| void Impala::Core::Feature::SplitSet | ( | bool *& | left, | |
| bool *& | right, | |||
| int | dimension, | |||
| double | value, | |||
| const AnnotatedFeatureTable * | data, | |||
| bool * | filter | |||
| ) |
returns filters for left and right through ref to pointer (pointer is set to a new address, so if either of these point to data when this function is called it will introduce a memory leak).
When the function returns the union of left and right is equal to filter.
Definition at line 90 of file MakeRandomTree.h.
References Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn1(), Impala::Util::MakeFilterElemLess(), Impala::Util::MakeIntersection(), Impala::Util::MakeRelativeComplement(), and Impala::Core::Table::Table::Size().
Referenced by MakeRandomTree(), Impala::Core::Feature::TestMakeRandomTree::testFindSplitWithSeed(), Impala::Core::Feature::TestMakeRandomTree::testSplitSet(), and TryRandomSplit().
00092 { 00093 int size = data->Size(); 00094 bool* less = Util::MakeFilterElemLess(data->GetColumn1()->GetStorage(), 00095 dimension, value); 00096 left = Util::MakeIntersection(filter, less, size); 00097 right = Util::MakeRelativeComplement(filter, left, size); 00098 delete less; 00099 }
Here is the call graph for this function:
