2012-01-19 16:49:54 +00:00
|
|
|
/*
|
|
|
|
* memTreeComponent.cpp
|
|
|
|
*
|
|
|
|
* Copyright 2009-2012 Yahoo! Inc.
|
|
|
|
*
|
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at
|
|
|
|
*
|
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
|
|
|
*
|
|
|
|
*/
|
2010-03-09 01:42:23 +00:00
|
|
|
#include "memTreeComponent.h"
|
2010-03-17 21:51:26 +00:00
|
|
|
#include "datatuple.h"
|
|
|
|
|
2011-06-09 00:27:57 +00:00
|
|
|
void memTreeComponent::tearDownTree(rbtree_ptr_t tree) {
|
|
|
|
datatuple * t = 0;
|
2011-06-13 18:47:21 +00:00
|
|
|
rbtree_t::iterator old;
|
|
|
|
for(rbtree_t::iterator delitr = tree->begin();
|
2010-03-09 01:42:23 +00:00
|
|
|
delitr != tree->end();
|
|
|
|
delitr++) {
|
|
|
|
if(t) {
|
|
|
|
tree->erase(old);
|
2011-06-09 00:27:57 +00:00
|
|
|
datatuple::freetuple(t);
|
2010-03-09 01:42:23 +00:00
|
|
|
t = 0;
|
|
|
|
}
|
|
|
|
t = *delitr;
|
|
|
|
old = delitr;
|
|
|
|
}
|
|
|
|
if(t) {
|
|
|
|
tree->erase(old);
|
2011-06-09 00:27:57 +00:00
|
|
|
datatuple::freetuple(t);
|
2010-03-09 01:42:23 +00:00
|
|
|
}
|
|
|
|
delete tree;
|
|
|
|
}
|