Home
last modified time | relevance | path

Searched refs:to_leaf (Results 1 – 4 of 4) sorted by relevance

/dports/math/z3/z3-z3-4.8.13/src/util/
H A Ddependency.h68 static leaf * to_leaf(dependency * d) { SASSERT(d->is_leaf()); return static_cast<leaf*>(d); } in to_leaf() function
91 dec_ref(to_leaf(d)->m_value); in del()
92 to_leaf(d)->~leaf(); in del()
93 m_allocator.deallocate(sizeof(leaf), to_leaf(d)); in del()
176 if (to_leaf(d)->m_value == v) { in contains()
206 vs.push_back(to_leaf(d)->m_value); in linearize()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/util/
H A Ddependency.h68 static leaf * to_leaf(dependency * d) { SASSERT(d->is_leaf()); return static_cast<leaf*>(d); } in to_leaf() function
91 dec_ref(to_leaf(d)->m_value); in del()
92 to_leaf(d)->~leaf(); in del()
93 m_allocator.deallocate(sizeof(leaf), to_leaf(d)); in del()
176 if (to_leaf(d)->m_value == v) { in contains()
206 vs.push_back(to_leaf(d)->m_value); in linearize()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/hilbert/
H A Dheap_trie.h247 value = to_leaf(n)->get_value(); in find_eq()
265 values.push_back(to_leaf(todo[index][j])->get_value()); in find_all_le()
371 return to_leaf(m_path.back())->get_value(); in value()
562 bool r = check(to_leaf(n)->get_value()); in find_le()
567 verbose_stream() << to_leaf(n)->get_value() << (r?" hit\n":" miss\n");); in find_le()
599 to_leaf(n)->set_value(val); in insert()
640 leaf* l = to_leaf(n); in del_node()
651 static leaf* to_leaf(node* n) { in to_leaf() function
/dports/math/z3/z3-z3-4.8.13/src/math/hilbert/
H A Dheap_trie.h247 value = to_leaf(n)->get_value(); in find_eq()
265 values.push_back(to_leaf(todo[index][j])->get_value()); in find_all_le()
372 return to_leaf(m_path.back())->get_value(); in value()
563 bool r = check(to_leaf(n)->get_value()); in find_le()
568 verbose_stream() << to_leaf(n)->get_value() << (r?" hit\n":" miss\n");); in find_le()
600 to_leaf(n)->set_value(val); in insert()
641 leaf* l = to_leaf(n); in del_node()
652 static leaf* to_leaf(node* n) { in to_leaf() function