dynamic_programming_search_tree_node Struct Reference
Detailed Description
sub tree
Definition at line 41 of file dpterms_util.c.
Data Fields | |
int | children_id [2] |
STP_Bitset | terms_intersection |
STP_Bitset | roots_union |
int64_t | nsubsets |
int | split_pos |
Field Documentation
◆ children_id
int dynamic_programming_search_tree_node::children_id[2] |
indices of children
Definition at line 43 of file dpterms_util.c.
Referenced by addLeaf(), insertData(), and streeCollectIntersects().
◆ terms_intersection
STP_Bitset dynamic_programming_search_tree_node::terms_intersection |
intersection of all terminals of leaves of subtree
Definition at line 44 of file dpterms_util.c.
Referenced by insertData(), and streeCollectIntersects().
◆ roots_union
STP_Bitset dynamic_programming_search_tree_node::roots_union |
union of all roots of leaves of subtree
Definition at line 45 of file dpterms_util.c.
Referenced by insertData(), and streeCollectIntersects().
◆ nsubsets
int64_t dynamic_programming_search_tree_node::nsubsets |
number of subsets
Definition at line 46 of file dpterms_util.c.
Referenced by addLeaf(), and streeCollectIntersects().
◆ split_pos
int dynamic_programming_search_tree_node::split_pos |
split position
Definition at line 47 of file dpterms_util.c.
Referenced by dpterms_streeInsert(), and streeCollectIntersects().