HomeSort by relevance Sort by last modified time
    Searched defs:node_t (Results 1 - 15 of 15) sorted by null

  /external/chromium_org/third_party/bintrees/bintrees/
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)
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)
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...]
  /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/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-21/arch-arm/usr/include/
search.h 27 } node_t; typedef in typeref:struct:node
  /prebuilts/ndk/9/platforms/android-21/arch-arm64/usr/include/
search.h 27 } node_t; typedef in typeref:struct:node
  /prebuilts/ndk/9/platforms/android-21/arch-mips/usr/include/
search.h 27 } node_t; typedef in typeref:struct:node
  /prebuilts/ndk/9/platforms/android-21/arch-mips64/usr/include/
search.h 27 } node_t; typedef in typeref:struct:node
  /prebuilts/ndk/9/platforms/android-21/arch-x86/usr/include/
search.h 27 } node_t; typedef in typeref:struct:node
  /prebuilts/ndk/9/platforms/android-21/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
  /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...]

Completed in 417 milliseconds