| /dports/biology/iqtree/IQ-TREE-2.0.6/terraphast/tools/ |
| H A D | tree_gen.cpp | 29 struct tree_node { struct
30 explicit tree_node(index parent = none, index left = none, index right = none) in tree_node() argument
45 using tree = std::vector<tree_node>; argument
|
| /dports/net/samba412/samba-4.12.15/source3/utils/ |
| H A D | regedit_treeview.h | 29 struct tree_node { struct
34 struct tree_node *parent; argument
35 struct tree_node *child_head; argument
36 struct tree_node *previous; argument
37 struct tree_node *next; argument
|
| /dports/www/lighttpd/lighttpd-1.4.63/src/ |
| H A D | algo_splaytree.h | 5 typedef struct tree_node { struct
6 struct tree_node * left, * right; argument
7 int key;
8 void *data;
|
| /dports/textproc/scws/scws-1.2.3/libscws/ |
| H A D | xtree.h | 20 struct tree_node struct
22 char *key;
23 void *value;
24 int vlen;
25 node_t left;
26 node_t right;
|
| /dports/textproc/modlogan/modlogan-0.8.13/src/ |
| H A D | top-down-splay.h | 4 typedef struct tree_node { struct
5 struct tree_node *left, *right; argument
8 } splaytree_node; argument
|
| /dports/lang/racket/racket-8.3/src/bc/utils/ |
| H A D | splay.c | 57 struct tree_node { struct
58 Tree * left, * right;
59 uintptr_t item;
60 void *data;
|
| /dports/lang/racket-minimal/racket-8.3/src/bc/utils/ |
| H A D | splay.c | 57 struct tree_node { struct
58 Tree * left, * right;
59 uintptr_t item;
60 void *data;
|
| /dports/devel/boost-python-libs/boost_1_72_0/tools/quickbook/src/ |
| H A D | tree.hpp | 46 template <typename T> struct tree_node : tree_node_base struct
48 T* parent() const { return static_cast<T*>(parent_); } in parent()
49 T* children() const { return static_cast<T*>(children_); } in children()
50 T* next() const { return static_cast<T*>(next_); } in next()
51 T* prev() const { return static_cast<T*>(prev_); } in prev()
53 void add_before(tree<T>&& x) { tree_node_base::add_before(&x); } in add_before()
54 void add_after(tree<T>&& x) { tree_node_base::add_after(&x); } in add_after()
55 void add_first_child(tree<T>&& x) in add_first_child()
59 void add_last_child(tree<T>&& x) in add_last_child()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/tools/quickbook/src/ |
| H A D | tree.hpp | 46 template <typename T> struct tree_node : tree_node_base struct
48 T* parent() const { return static_cast<T*>(parent_); } in parent()
49 T* children() const { return static_cast<T*>(children_); } in children()
50 T* next() const { return static_cast<T*>(next_); } in next()
51 T* prev() const { return static_cast<T*>(prev_); } in prev()
53 void add_before(tree<T>&& x) { tree_node_base::add_before(&x); } in add_before()
54 void add_after(tree<T>&& x) { tree_node_base::add_after(&x); } in add_after()
55 void add_first_child(tree<T>&& x) in add_first_child()
59 void add_last_child(tree<T>&& x) in add_last_child()
|
| /dports/devel/boost-docs/boost_1_72_0/tools/quickbook/src/ |
| H A D | tree.hpp | 46 template <typename T> struct tree_node : tree_node_base struct
48 T* parent() const { return static_cast<T*>(parent_); } in parent()
49 T* children() const { return static_cast<T*>(children_); } in children()
50 T* next() const { return static_cast<T*>(next_); } in next()
51 T* prev() const { return static_cast<T*>(prev_); } in prev()
53 void add_before(tree<T>&& x) { tree_node_base::add_before(&x); } in add_before()
54 void add_after(tree<T>&& x) { tree_node_base::add_after(&x); } in add_after()
55 void add_first_child(tree<T>&& x) in add_first_child()
59 void add_last_child(tree<T>&& x) in add_last_child()
|
| /dports/devel/boost-libs/boost_1_72_0/tools/quickbook/src/ |
| H A D | tree.hpp | 46 template <typename T> struct tree_node : tree_node_base struct
48 T* parent() const { return static_cast<T*>(parent_); } in parent()
49 T* children() const { return static_cast<T*>(children_); } in children()
50 T* next() const { return static_cast<T*>(next_); } in next()
51 T* prev() const { return static_cast<T*>(prev_); } in prev()
53 void add_before(tree<T>&& x) { tree_node_base::add_before(&x); } in add_before()
54 void add_after(tree<T>&& x) { tree_node_base::add_after(&x); } in add_after()
55 void add_first_child(tree<T>&& x) in add_first_child()
59 void add_last_child(tree<T>&& x) in add_last_child()
|
| /dports/devel/hyperscan/boost_1_75_0/tools/quickbook/src/ |
| H A D | tree.hpp | 46 template <typename T> struct tree_node : tree_node_base struct
48 T* parent() const { return static_cast<T*>(parent_); } in parent()
49 T* children() const { return static_cast<T*>(children_); } in children()
50 T* next() const { return static_cast<T*>(next_); } in next()
51 T* prev() const { return static_cast<T*>(prev_); } in prev()
53 void add_before(tree<T>&& x) { tree_node_base::add_before(&x); } in add_before()
54 void add_after(tree<T>&& x) { tree_node_base::add_after(&x); } in add_after()
55 void add_first_child(tree<T>&& x) in add_first_child()
59 void add_last_child(tree<T>&& x) in add_last_child()
|
| /dports/lang/spidermonkey60/firefox-60.9.0/third_party/aom/aom_dsp/ |
| H A D | prob.c | 41 typedef struct tree_node tree_node; typedef
43 struct tree_node { struct
55 static uint32_t tree_node_prob(tree_node n, int i) { in tree_node_prob() argument
|
| /dports/math/GiNaC/ginac-1.8.2/ginac/ |
| H A D | class_info.h | 65 struct tree_node { struct
66 tree_node(class_info *i) : info(i) {} in tree_node() function
67 void add_child(tree_node *n) { children.push_back(n); } in add_child() argument
69 std::vector<tree_node *> children; argument
73 static void dump_tree(tree_node *n, const std::string & prefix, bool verbose); argument
|
| /dports/math/pynac/pynac-pynac-0.7.27/ginac/ |
| H A D | class_info.h | 65 struct tree_node { struct
66 tree_node(class_info *i) : info(i) {} in tree_node() argument
67 void add_child(tree_node *n) { children.push_back(n); } in add_child() argument
69 std::vector<tree_node *> children; argument
73 static void dump_tree(tree_node *n, const std::string & prefix, bool verbose); argument
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 32 struct tree_node struct
34 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
36 node_ptr parent_, left_, right_;
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 32 struct tree_node struct
34 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
36 node_ptr parent_, left_, right_;
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 32 struct tree_node struct
34 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
36 node_ptr parent_, left_, right_;
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 31 struct tree_node struct
33 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
35 node_ptr parent_, left_, right_;
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 32 struct tree_node struct
34 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
36 node_ptr parent_, left_, right_;
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 32 struct tree_node struct
34 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
36 node_ptr parent_, left_, right_;
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 31 struct tree_node struct
33 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
35 node_ptr parent_, left_, right_;
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 31 struct tree_node struct
33 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
35 node_ptr parent_, left_, right_;
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 32 struct tree_node struct
34 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
36 node_ptr parent_, left_, right_;
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/detail/ |
| H A D | tree_node.hpp | 31 struct tree_node struct
33 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr;
35 node_ptr parent_, left_, right_;
|