Searched refs:bits_tree_dup (Results 1 – 4 of 4) sorted by relevance
/dports/devel/tla/tla-1.3.5/src/hackerlab/bitsets/ |
H A D | bitset-tree.c | 234 bits_tree_dup (alloc_limits lim, in bits_tree_dup() function 257 ((bits_tree *)answer)[x] = bits_tree_dup (lim, rule + 1, ((bits_tree *)a)[x]); in bits_tree_dup() 1232 ((bits_tree *)a)[x] = bits_tree_dup (lim, rule + 1, ((bits_tree *)b)[x]); in bits_tree_union() 1276 ((bits_tree *)a)[x] = bits_tree_dup (lim, rule + 1, ((bits_tree *)b)[x]); in bits_tree_intersection() 1320 ((bits_tree *)a)[x] = bits_tree_dup (lim, rule + 1, ((bits_tree *)b)[x]); in bits_tree_difference() 1362 ((bits_tree *)a)[x] = bits_tree_dup (lim, rule + 1, ((bits_tree *)b)[x]); in bits_tree_revdifference() 1423 ((bits_tree *)a)[x] = bits_tree_dup (lim, rule + 1, ((bits_tree *)b)[x]); in bits_tree_xor() 1433 ((bits_tree *)a)[x] = bits_tree_dup (lim, rule + 1, ((bits_tree *)b)[x]); in bits_tree_xor()
|
H A D | bitset-tree.h | 140 extern bits_tree bits_tree_dup (alloc_limits lim,
|
H A D | bits.c | 136 s->tree = bits_tree_dup (a->lim, a->rule, a->stree->tree); in bits_cow()
|
/dports/devel/tla/tla-1.3.5/src/docs-hackerlab/texi/ |
H A D | bitsets.texi | 1116 @b{* Function} @code{bits_tree_dup}@fuindex bits_tree_dup 1120 bits_tree bits_tree_dup (alloc_limits lim,
|