Home
last modified time | relevance | path

Searched refs:trie (Results 1 – 13 of 13) sorted by relevance

/netbsd/src/external/gpl3/binutils/dist/bfd/
Dmmo.c2732 struct mmo_symbol_trie *trie = rootp; in mmo_internal_add_3_sym() local
2735 while (*name && trie != NULL) in mmo_internal_add_3_sym()
2737 if (*name < trie->symchar) in mmo_internal_add_3_sym()
2739 triep = &trie->left; in mmo_internal_add_3_sym()
2740 trie = trie->left; in mmo_internal_add_3_sym()
2742 else if (*name > trie->symchar) in mmo_internal_add_3_sym()
2744 triep = &trie->right; in mmo_internal_add_3_sym()
2745 trie = trie->right; in mmo_internal_add_3_sym()
2747 else if (*name == trie->symchar) in mmo_internal_add_3_sym()
2749 triep = &trie->middle; in mmo_internal_add_3_sym()
[all …]
Ddwarf2.c2144 struct trie_node *trie, in insert_arange_in_trie() argument
2158 if (trie->num_room_in_leaf > 0) in insert_arange_in_trie()
2160 struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
2174 return trie; in insert_arange_in_trie()
2178 is_full_leaf = leaf->num_stored_in_leaf == trie->num_room_in_leaf; in insert_arange_in_trie()
2185 const struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
2188 trie = bfd_zalloc (abfd, sizeof (struct trie_interior)); in insert_arange_in_trie()
2189 if (!trie) in insert_arange_in_trie()
2198 if (!insert_arange_in_trie (abfd, trie, trie_pc, trie_pc_bits, in insert_arange_in_trie()
2209 const struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
[all …]
/netbsd/src/external/gpl3/gdb/dist/bfd/
Dmmo.c2732 struct mmo_symbol_trie *trie = rootp; in mmo_internal_add_3_sym() local
2735 while (*name && trie != NULL) in mmo_internal_add_3_sym()
2737 if (*name < trie->symchar) in mmo_internal_add_3_sym()
2739 triep = &trie->left; in mmo_internal_add_3_sym()
2740 trie = trie->left; in mmo_internal_add_3_sym()
2742 else if (*name > trie->symchar) in mmo_internal_add_3_sym()
2744 triep = &trie->right; in mmo_internal_add_3_sym()
2745 trie = trie->right; in mmo_internal_add_3_sym()
2747 else if (*name == trie->symchar) in mmo_internal_add_3_sym()
2749 triep = &trie->middle; in mmo_internal_add_3_sym()
[all …]
Ddwarf2.c2144 struct trie_node *trie, in insert_arange_in_trie() argument
2159 if (trie->num_room_in_leaf > 0) in insert_arange_in_trie()
2161 struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
2175 return trie; in insert_arange_in_trie()
2179 is_full_leaf = leaf->num_stored_in_leaf == trie->num_room_in_leaf; in insert_arange_in_trie()
2206 const struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
2209 trie = bfd_zalloc (abfd, sizeof (struct trie_interior)); in insert_arange_in_trie()
2210 if (!trie) in insert_arange_in_trie()
2219 if (!insert_arange_in_trie (abfd, trie, trie_pc, trie_pc_bits, in insert_arange_in_trie()
2231 const struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
[all …]
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/
Dassoc_container.hpp731 class trie : public PB_DS_TRIE_BASE class
740 trie() { } in trie() function in __gnu_pbds::trie
744 trie(const access_traits& t) in trie() function in __gnu_pbds::trie
751 trie(It first, It last) in trie() function in __gnu_pbds::trie
758 trie(It first, It last, const access_traits& t) in trie() function in __gnu_pbds::trie
762 trie(const trie& other) in trie() function in __gnu_pbds::trie
766 ~trie() { } in ~trie()
768 trie&
769 operator=(const trie& other) in operator =()
773 trie tmp(other); in operator =()
[all …]
/netbsd/src/external/gpl3/binutils/dist/bfd/doc/
Dmmo.texi180 search trie}, following ideas of Bentley and Sedgewick. (See
183 Addison--Wesley, 1998), @samp{15.4}.) Each trie node stores a
186 character in the trie. There also is a pointer to a symbol table
200 0x40 - Traverse left trie.
237 0x20 - Traverse middle trie. (Read a new command byte
241 0x10 - Traverse right trie. (Read a new command byte and
257 This forms the trivial trie (note that the path between ``:'' and
Dbfd.info10858 and retrieved by means of a ‘ternary search trie’, following ideas of
10861 Addison–Wesley, 1998), ‘15.4’.) Each trie node stores a character, and
10863 less than, equal to, or greater than the character in the trie. There
10876 0x40 - Traverse left trie.
10913 0x20 - Traverse middle trie. (Read a new command byte
10917 0x10 - Traverse right trie. (Read a new command byte and
10930 This forms the trivial trie (note that the path between “:” and “M”
/netbsd/src/external/gpl3/binutils/dist/ld/po/
Dfr.po2179 msgstr "%F%P : option de trie de section invalide : %s\n"
2191 msgstr "%F%P : option de trie de section invalide : %s\n"
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/
DChangeLog-20112757 trie.html, trie_node_iterator.html,
DChangeLog-20063944 * docs/html/ext/pb_ds/trie.html: Same.
/netbsd/src/external/gpl3/gcc/dist/
DNEWS14266 containers, including data types for tree and trie forms
14267 (basic_tree, tree, trie), lists (list_update), and both
DMD5SUMS98425 1d7b3e2ea7786cbe36a81d4fab3c2e38 libgo/go/golang.org/x/net/idna/trie.go
98537 3aae5b2aa8a6489b1c0ae5ab31f1d356 libgo/go/golang.org/x/text/unicode/norm/trie.go
/netbsd/src/external/gpl3/binutils/dist/
DChangeLog.git120481 that match a unit with errors, since ranges are added to a trie while
123355 add a trie to map quickly from address range to compilation unit
123362 Add a radix-256 trie over the address space to quickly map address to