| /src/external/gpl2/gettext/dist/gettext-tools/libgrep/ |
| kwset.c | 51 /* Balanced tree of edges and labels leaving a given trie node. */
56 struct trie *trie; /* Trie node pointed to by this edge. */ member in struct:tree
61 /* Node of a trie representing a set of reversed keywords. */
62 struct trie struct
66 struct trie *parent; /* Parent of this node. */
67 struct trie *next; /* List of all trie nodes in level order. */
68 struct trie *fail; /* Aho-Corasick failure function. *
79 struct trie *trie; \/* The trie itself. *\/ member in struct:kwset
130 register struct trie *trie; local
585 struct trie const *trie; local
[all...] |
| /src/external/gpl2/grep/dist/src/ |
| kwset.c | 51 /* Balanced tree of edges and labels leaving a given trie node. */
56 struct trie *trie; /* Trie node pointed to by this edge. */ member in struct:tree
61 /* Node of a trie representing a set of reversed keywords. */
62 struct trie struct
66 struct trie *parent; /* Parent of this node. */
67 struct trie *next; /* List of all trie nodes in level order. */
68 struct trie *fail; /* Aho-Corasick failure function. *
79 struct trie *trie; \/* The trie itself. *\/ member in struct:kwset
130 register struct trie *trie; local
585 struct trie const *trie; local
[all...] |
| /src/usr.sbin/sysinst/ |
| msg.mbr.fr | 53 La g�om�trie du disque doit �tre pr�cis�e.
61 {Sysinst n'a pas pu d�terminer automatiquement la g�om�trie utilis�e par le
63 La g�om�trie physique est %d cylindres %d secteurs %d t�tes\n}
67 la g�om�trie utilis�e par le BIOS soit de %d cylindres, %d secteurs et %d t�tes\n}
|
| /src/external/gpl3/binutils/dist/bfd/ |
| mmo.c | 1269 search trie}, following ideas of Bentley and Sedgewick. (See
1272 Addison--Wesley, 1998), @samp{15.4}.) Each trie node stores a
1275 character in the trie. There also is a pointer to a symbol table
1288 | 0x40 - Traverse left trie.
1325 | 0x20 - Traverse middle trie. (Read a new command byte
1329 | 0x10 - Traverse right trie. (Read a new command byte and
1342 This forms the trivial trie (note that the path between ``:'' and
1366 /* Traverse left trie. */
1465 /* Traverse middle trie. */
1472 /* Traverse right trie. *
2723 struct mmo_symbol_trie *trie = rootp; local
[all...] |
| dwarf2.c | 88 /* A trie to map quickly from address range to compilation unit.
90 This is a fairly standard radix-256 trie, used to quickly locate which
97 We use a hybrid trie to avoid memory explosion: There are two types of trie
280 /* Root of a trie to map addresses to compilation units. */
356 We scan these separately when we have a trie over the ranges.
437 /* Used when iterating over trie leaves to know which units we have
2144 /* Insert an address range in the trie mapping addresses to compilation units.
2145 Will return the new trie node (usually the same as is being sent in, but
2151 struct trie_node *trie,
5933 struct trie_node *trie = stash->f.trie_root; local
[all...] |
| /src/external/gpl3/binutils.old/dist/bfd/ |
| mmo.c | 1270 search trie}, following ideas of Bentley and Sedgewick. (See
1273 Addison--Wesley, 1998), @samp{15.4}.) Each trie node stores a
1276 character in the trie. There also is a pointer to a symbol table
1289 | 0x40 - Traverse left trie.
1326 | 0x20 - Traverse middle trie. (Read a new command byte
1330 | 0x10 - Traverse right trie. (Read a new command byte and
1343 This forms the trivial trie (note that the path between ``:'' and
1367 /* Traverse left trie. */
1466 /* Traverse middle trie. */
1473 /* Traverse right trie. *
2724 struct mmo_symbol_trie *trie = rootp; local
[all...] |
| dwarf2.c | 88 /* A trie to map quickly from address range to compilation unit.
90 This is a fairly standard radix-256 trie, used to quickly locate which
97 We use a hybrid trie to avoid memory explosion: There are two types of trie
280 /* Root of a trie to map addresses to compilation units. */
356 We scan these separately when we have a trie over the ranges.
437 /* Used when iterating over trie leaves to know which units we have
2144 /* Insert an address range in the trie mapping addresses to compilation units.
2145 Will return the new trie node (usually the same as is being sent in, but
2151 struct trie_node *trie,
5933 struct trie_node *trie = stash->f.trie_root; local
[all...] |
| /src/external/gpl3/gdb/dist/bfd/ |
| mmo.c | 1270 search trie}, following ideas of Bentley and Sedgewick. (See
1273 Addison--Wesley, 1998), @samp{15.4}.) Each trie node stores a
1276 character in the trie. There also is a pointer to a symbol table
1289 | 0x40 - Traverse left trie.
1326 | 0x20 - Traverse middle trie. (Read a new command byte
1330 | 0x10 - Traverse right trie. (Read a new command byte and
1343 This forms the trivial trie (note that the path between ``:'' and
1367 /* Traverse left trie. */
1466 /* Traverse middle trie. */
1473 /* Traverse right trie. *
2724 struct mmo_symbol_trie *trie = rootp; local
[all...] |
| dwarf2.c | 88 /* A trie to map quickly from address range to compilation unit.
90 This is a fairly standard radix-256 trie, used to quickly locate which
97 We use a hybrid trie to avoid memory explosion: There are two types of trie
280 /* Root of a trie to map addresses to compilation units. */
356 We scan these separately when we have a trie over the ranges.
437 /* Used when iterating over trie leaves to know which units we have
2144 /* Insert an address range in the trie mapping addresses to compilation units.
2145 Will return the new trie node (usually the same as is being sent in, but
2151 struct trie_node *trie,
5934 struct trie_node *trie = stash->f.trie_root; local
[all...] |
| /src/external/gpl3/gdb.old/dist/bfd/ |
| mmo.c | 1275 search trie}, following ideas of Bentley and Sedgewick. (See
1278 Addison--Wesley, 1998), @samp{15.4}.) Each trie node stores a
1281 character in the trie. There also is a pointer to a symbol table
1294 | 0x40 - Traverse left trie.
1331 | 0x20 - Traverse middle trie. (Read a new command byte
1335 | 0x10 - Traverse right trie. (Read a new command byte and
1348 This forms the trivial trie (note that the path between ``:'' and
1372 /* Traverse left trie. */
1471 /* Traverse middle trie. */
1478 /* Traverse right trie. *
2732 struct mmo_symbol_trie *trie = rootp; local
[all...] |
| dwarf2.c | 88 /* A trie to map quickly from address range to compilation unit.
90 This is a fairly standard radix-256 trie, used to quickly locate which
97 We use a hybrid trie to avoid memory explosion: There are two types of trie
280 /* Root of a trie to map addresses to compilation units. */
359 We scan these separately when we have a trie over the ranges.
440 /* Used when iterating over trie leaves to know which units we have
2137 /* Insert an address range in the trie mapping addresses to compilation units.
2138 Will return the new trie node (usually the same as is being sent in, but
2144 struct trie_node *trie,
5927 struct trie_node *trie = stash->f.trie_root; local
[all...] |
| /src/crypto/external/apache2/openssl/dist/util/perl/OpenSSL/ |
| paramnames.pm | 677 my %trie;
684 my $cursor = \%trie;
705 return %trie;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/ |
| assoc_container.hpp | 537 * A branched, tree-like (tree, trie) container abstraction.
704 * A trie-based container.
711 * @tparam Node_Update Updates trie internal-nodes,
731 class trie : public PB_DS_TRIE_BASE class in namespace:__gnu_pbds
740 trie() { } function in class:__gnu_pbds::trie
744 trie(const access_traits& t) function in class:__gnu_pbds::trie
751 trie(It first, It last) function in class:__gnu_pbds::trie
758 trie(It first, It last, const access_traits& t) function in class:__gnu_pbds::trie
762 trie(const trie& other function in class:__gnu_pbds::trie
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/ |
| assoc_container.hpp | 537 * A branched, tree-like (tree, trie) container abstraction.
704 * A trie-based container.
711 * @tparam Node_Update Updates trie internal-nodes,
731 class trie : public PB_DS_TRIE_BASE class in namespace:__gnu_pbds
740 trie() { } function in class:__gnu_pbds::trie
744 trie(const access_traits& t) function in class:__gnu_pbds::trie
751 trie(It first, It last) function in class:__gnu_pbds::trie
758 trie(It first, It last, const access_traits& t) function in class:__gnu_pbds::trie
762 trie(const trie& other function in class:__gnu_pbds::trie
[all...] |
| /src/external/gpl2/groff/dist/src/roff/troff/ |
| env.cpp | 3345 class trie { class
3351 trie() : tp(0) {} function in class:trie
3352 virtual ~trie(); // virtual to shut up g++
3359 class hyphen_trie : private trie {
3460 trie::~trie()
3465 void trie::clear()
3472 void trie::delete_trie_node(trie_node *p)
3483 void trie::insert(const char *pat, int patlen, void *val)
3501 void trie::find(const char *pat, int patlen
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/ |
| ir.d | 26 alias Trie = CodepointSetTrie!(13, 8);
111 Trie = 0b1_00011_00, //CodepointSet implemented as Trie
437 case IR.Backref: case IR.CodepointSet: case IR.Trie:
965 Trie trie; // slow path for Unicode
971 trie = makeTrie(set);
979 return trie[ch];
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/uni/ |
| package.d | 66 $(TR $(TD Trie) $(TD
150 special case of $(LINK2 https://en.wikipedia.org/wiki/Trie, Trie).
212 // 1-level Trie lookup table essentially a huge bit-set ~262Kb
222 // build the trie with the most sensible trie level
440 $(HTTP en.wikipedia.org/wiki/Trie, Trie) data structure with integer
442 this will be called a fixed trie. The following describes a particular
446 $(P Taking a 2-level Trie as an example the principle of operation is as follows
[all...] |
