/dports/net-mgmt/rtrlib/rtrlib-0.6.3/tests/ |
H A D | test_trie.c | 45 result = trie_lookup(&n1, &addr, 16, &lvl); in trie_test() 50 result = trie_lookup(&n1, &addr, 16, &lvl); in trie_test() 69 result = trie_lookup(&n1, &addr, 16, &lvl); in trie_test() 90 result = trie_lookup(&n1, &addr, 16, &lvl); in trie_test() 113 result = trie_lookup(&n1, &addr, 24, &lvl); in trie_test() 132 result = trie_lookup(&n1, &addr, 16, &lvl); in trie_test() 139 result = trie_lookup(&n1, &addr, 16, &lvl); in trie_test()
|
/dports/lang/swi-pl/swipl-8.2.3/src/Tests/tabling/ |
H A D | test_trie.pl | 54 trie_lookup(T, aap, N). 58 trie_lookup(T, aap, N). 63 trie_lookup(T, aap1, N1), 64 trie_lookup(T, aap2, N2). 68 trie_lookup(T, aap(1), N). 85 trie_lookup(T, aap(_), N). 89 trie_lookup(T, aap(_,_), N), 90 assertion(\+ trie_lookup(T, aap(A,A), N)).
|
/dports/lang/gcc6-aux/gcc-6-20180516/libjava/gnu/gcj/convert/ |
H A D | natOutput_SJIS.cc | 15 extern int trie_lookup (unsigned short *trie, unsigned short key); 37 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_SJIS()
|
H A D | natOutput_EUCJIS.cc | 24 trie_lookup (unsigned short *trie, unsigned short key) in trie_lookup() function 59 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_EUCJIS()
|
/dports/lang/gcc48/gcc-4.8.5/libjava/gnu/gcj/convert/ |
H A D | natOutput_SJIS.cc | 15 extern int trie_lookup (unsigned short *trie, unsigned short key); 37 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_SJIS()
|
H A D | natOutput_EUCJIS.cc | 24 trie_lookup (unsigned short *trie, unsigned short key) in trie_lookup() function 59 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_EUCJIS()
|
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/libjava/gnu/gcj/convert/ |
H A D | natOutput_SJIS.cc | 15 extern int trie_lookup (unsigned short *trie, unsigned short key); 37 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_SJIS()
|
H A D | natOutput_EUCJIS.cc | 24 trie_lookup (unsigned short *trie, unsigned short key) in trie_lookup() function 59 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_EUCJIS()
|
/dports/lang/gnat_util/gcc-6-20180516/libjava/gnu/gcj/convert/ |
H A D | natOutput_SJIS.cc | 15 extern int trie_lookup (unsigned short *trie, unsigned short key); 37 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_SJIS()
|
H A D | natOutput_EUCJIS.cc | 24 trie_lookup (unsigned short *trie, unsigned short key) in trie_lookup() function 59 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_EUCJIS()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libjava/gnu/gcj/convert/ |
H A D | natOutput_SJIS.cc | 15 extern int trie_lookup (unsigned short *trie, unsigned short key); 37 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_SJIS()
|
H A D | natOutput_EUCJIS.cc | 24 trie_lookup (unsigned short *trie, unsigned short key) in trie_lookup() function 59 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_EUCJIS()
|
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/libjava/gnu/gcj/convert/ |
H A D | natOutput_SJIS.cc | 15 extern int trie_lookup (unsigned short *trie, unsigned short key); 37 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_SJIS()
|
H A D | natOutput_EUCJIS.cc | 24 trie_lookup (unsigned short *trie, unsigned short key) in trie_lookup() function 59 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_EUCJIS()
|
/dports/devel/mingw32-gcc/gcc-4.8.1/libjava/gnu/gcj/convert/ |
H A D | natOutput_SJIS.cc | 15 extern int trie_lookup (unsigned short *trie, unsigned short key); 37 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_SJIS()
|
H A D | natOutput_EUCJIS.cc | 24 trie_lookup (unsigned short *trie, unsigned short key) in trie_lookup() function 59 unsigned short val = trie_lookup(Unicode_to_JIS, ch); in convert_TO_EUCJIS()
|
/dports/audio/rsynth/rsynth-2.0/ |
H A D | trie.h | 6 extern void *trie_lookup PROTO((trie_ptr *r,char **sp));
|
H A D | trie.c | 48 trie_lookup(r, sp) in trie_lookup() function
|
H A D | mkdictdb.c | 79 if (e > p && (code = (unsigned) trie_lookup(&phones, &p)))
|
H A D | phtoelm.c | 118 char *e = trie_lookup(&phtoelm, &s);
|
/dports/devel/libqb/libqb-2.0.3/lib/ |
H A D | trie.c | 310 trie_lookup(struct trie *t, const char *key, int exact_match) in trie_lookup() function 549 struct trie_node *n = trie_lookup(t, key, QB_TRUE); in trie_rm() 563 struct trie_node *n = trie_lookup(t, key, QB_TRUE); in trie_get() 633 n = trie_lookup(t, key, QB_TRUE); in trie_notify_add() 696 n = trie_lookup(t, key, QB_FALSE); in trie_notify_del() 752 si->root = trie_lookup(t, si->prefix, QB_FALSE); in trie_iter_next()
|
/dports/net-mgmt/rtrlib/rtrlib-0.6.3/rtrlib/pfx/trie/ |
H A D | trie_private.h | 57 struct trie_node *trie_lookup(const struct trie_node *root_node,
|
H A D | trie-pfx.c | 366 struct trie_node *node = trie_lookup(root, prefix, prefix_len, &lvl); in pfx_table_validate_r() 391 node = trie_lookup(node->lchild, prefix, prefix_len, &lvl); in pfx_table_validate_r() 393 node = trie_lookup(node->rchild, prefix, prefix_len, &lvl); in pfx_table_validate_r()
|
/dports/lang/swi-pl/swipl-8.2.3/src/ |
H A D | pl-trie.c | 1485 if ( (rc=trie_lookup(trie, NULL, &node, kp, FALSE, NULL PASS_LD)) == TRUE ) 1503 PRED_IMPL("trie_lookup", 3, trie_lookup, 0) 1514 if ( (rc=trie_lookup(trie, NULL, &node, kp, FALSE, NULL PASS_LD)) == TRUE ) 2439 rc = trie_lookup(trie, NULL, &root, kp, TRUE, &vars PASS_LD); 2441 { rc = trie_lookup(trie, root, &node, vp, TRUE, &vars PASS_LD); 2474 rc = trie_lookup(trie, NULL, &root, kp, FALSE, NULL PASS_LD); 2500 rc = trie_lookup(trie, NULL, &root, kp, FALSE, NULL PASS_LD); 2505 rc = trie_lookup(trie, root, &node, vp, FALSE, NULL PASS_LD); 3003 PRED_DEF("trie_lookup", 3, trie_lookup, 0)
|
H A D | pl-trie.h | 201 trie_lookup(trie *trie, trie_node *node, trie_node **nodep, in trie_lookup() function
|