/external/chromium_org/third_party/bintrees/bintrees/ |
ctrees.pxd | 12 ctypedef struct node_t: 13 node_t *link[2] 18 void ct_delete_tree(node_t *root) 19 node_t *ct_find_node(node_t *root, object key) 20 PyObject *ct_get_item(node_t *root, object key) 21 node_t *ct_max_node(node_t *root) 22 node_t *ct_min_node(node_t *root [all...] |
ctrees.h | 14 typedef struct tree_node node_t; typedef in typeref:struct:tree_node 17 node_t *link[2]; 23 typedef node_t* nodeptr; 26 void ct_delete_tree(node_t *root); 28 PyObject *ct_get_item(node_t *root, PyObject *key); 29 node_t *ct_find_node(node_t *root, PyObject *key); 30 node_t *ct_succ_node(node_t *root, PyObject *key); 31 node_t *ct_prev_node(node_t *root, PyObject *key) [all...] |
cwalker.pxd | 8 from ctrees cimport node_t namespace 12 cdef node_t *node 13 cdef node_t *root 16 cdef void set_tree(self, node_t *root)
|
stack.h | 18 node_t **stack; 23 void stack_push(node_stack_t *stack, node_t *node); 24 node_t *stack_pop(node_stack_t *stack);
|
stack.pxd | 8 from ctrees cimport node_t namespace 15 void stack_push(node_stack_t *stack, node_t *node) 16 node_t *stack_pop(node_stack_t *stack)
|
stack.c | 18 stack->stack = PyMem_Malloc(sizeof(node_t *) * size); 32 stack_push(node_stack_t *stack, node_t *node) 38 sizeof(node_t *) * stack->size); 42 extern node_t *
|
ctrees.c | 24 static node_t * 27 node_t *new_node = PyMem_Malloc(sizeof(node_t)); 41 ct_delete_node(node_t *node) 53 ct_delete_tree(node_t *root) 67 ct_swap_data(node_t *node1, node_t *node2) 98 extern node_t * 99 ct_find_node(node_t *root, PyObject *key) 114 ct_get_item(node_t *root, PyObject *key [all...] |
qavltree.pyx | 17 cdef node_t *_root 74 cdef node_t *node 82 cdef node_t *node
|
qbintree.pyx | 17 cdef node_t *_root 73 cdef node_t *node 81 cdef node_t *node
|
qrbtree.pyx | 17 cdef node_t *_root 74 cdef node_t *node 82 cdef node_t *node
|
cwalker.pyx | 23 cdef void set_tree(self, node_t *root):
|
cwalker.c | 352 * cdef node_t *node 353 * cdef node_t *root 358 node_t *node; 359 node_t *root; 374 void (*set_tree)(struct __pyx_obj_8bintrees_7cwalker_cWalker *, node_t *); 653 * cdef void set_tree(self, node_t *root): 663 * cdef void set_tree(self, node_t *root): # <<<<<<<<<<<<<< 668 static void __pyx_f_8bintrees_7cwalker_7cWalker_set_tree(struct __pyx_obj_8bintrees_7cwalker_cWalker *__pyx_v_self, node_t *__pyx_v_root) { 678 * cdef void set_tree(self, node_t *root): 686 * cdef void set_tree(self, node_t *root) [all...] |
qavltree.c | 354 * cdef node_t *node 355 * cdef node_t *root 360 node_t *node; 361 node_t *root; 370 * cdef node_t *_root 375 node_t *_root; 385 * cdef node_t *node 386 * cdef node_t *root 390 void (*set_tree)(struct __pyx_obj_8bintrees_7cwalker_cWalker *, node_t *); [all...] |
qbintree.c | 354 * cdef node_t *node 355 * cdef node_t *root 360 node_t *node; 361 node_t *root; 370 * cdef node_t *_root 375 node_t *_root; 385 * cdef node_t *node 386 * cdef node_t *root 390 void (*set_tree)(struct __pyx_obj_8bintrees_7cwalker_cWalker *, node_t *); [all...] |
qrbtree.c | 354 * cdef node_t *node 355 * cdef node_t *root 360 node_t *node; 361 node_t *root; 370 * cdef node_t *_root 375 node_t *_root; 385 * cdef node_t *node 386 * cdef node_t *root 390 void (*set_tree)(struct __pyx_obj_8bintrees_7cwalker_cWalker *, node_t *); [all...] |
/bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
tfind.c | 7 * The node_t structure is for internal use only 16 typedef struct node_t struct 19 struct node_t *llink, *rlink; 30 if (rootp == (struct node_t **)0) 31 return ((struct node_t *)0); 32 while (*rootp != (struct node_t *)0) { /* T1: */
|
tsearch.c | 7 * The node_t structure is for internal use only 18 typedef struct node_t { struct 20 struct node_t *left, *right; 32 if (rootp == (struct node_t **)0) 34 while (*rootp != (struct node_t *)0) { /* Knuth's T1: */ 44 if (q != (struct node_t *)0) { /* make new node */ 47 q->left = q->right = (struct node_t *)0; 64 if (rootp == (struct node_t **)0 || *rootp == (struct node_t *)0) 65 return ((struct node_t *)0) [all...] |
/bionic/libc/bionic/ |
tdestroy.cpp | 24 node_t* root_node = (node_t*) root;
|
/external/jemalloc/test/unit/ |
rb.c | 14 typedef struct node_s node_t; typedef in typeref:struct:node_s 19 rb_node(node_t) link; 24 node_cmp(node_t *a, node_t *b) { 42 typedef rb_tree(node_t) tree_t; 43 rb_gen(static, tree_, tree_t, node_t, link, node_cmp); 48 node_t key; 70 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth, 71 node_t *nil) 74 node_t *left_node = rbtn_left_get(node_t, link, node) [all...] |
/bionic/libc/include/ |
search.h | 27 } node_t; typedef in typeref:struct:node
|
/development/ndk/platforms/android-L/include/ |
search.h | 27 } node_t; typedef in typeref:struct:node
|
/prebuilts/ndk/9/platforms/android-19/arch-arm64/usr/include/ |
search.h | 27 } node_t; typedef in typeref:struct:node
|
/prebuilts/ndk/9/platforms/android-19/arch-mips64/usr/include/ |
search.h | 27 } node_t; typedef in typeref:struct:node
|
/prebuilts/ndk/9/platforms/android-19/arch-x86_64/usr/include/ |
search.h | 27 } node_t; typedef in typeref:struct:node
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
search.h | 57 } node_t; typedef in typeref:struct:node
|