| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/vect/ |
| H A D | pr31041.c | 14 UNewTrie *trie; local
20 trie->index[i++] = j;
|
| /netbsd-6-1-5-RELEASE/gnu/dist/grep/src/ |
| H A D | 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. */
78 int words; /* Number of words in the trie
79 struct trie *trie; /* The trie itself. */ member in struct:kwset
130 register struct trie *trie; local
585 struct trie const *trie; local
[all...] |
| /netbsd-6-1-5-RELEASE/gnu/dist/gettext/gettext-tools/libgrep/ |
| H A D | kwset.c | 52 /* Balanced tree of edges and labels leaving a given trie node. */
57 struct trie *trie; /* Trie node pointed to by this edge. */ member in struct:tree
62 /* Node of a trie representing a set of reversed keywords. */
63 struct trie struct
67 struct trie *parent; /* Parent of this node. */
68 struct trie *next; /* List of all trie nodes in level order. */
69 struct trie *fail; /* Aho-Corasick failure function. */
79 int words; /* Number of words in the trie
80 struct trie *trie; /* The trie itself. */ member in struct:kwset
131 register struct trie *trie; local
586 struct trie const *trie; local
[all...] |
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/ext/pb_ds/example/ |
| H A D | trie_split.cc | 34 * A basic example showing how to split trie-based container objects.
38 * This example shows how to split trie based containers, i.e., the opposite
51 // A PATRICIA trie table mapping strings to chars.
52 typedef trie<string, char> map_type;
|
| H A D | trie_dna.cc | 34 * An example showing how to use a trie for storing DNA strings.
38 * This example shows how to use a PATRICIA trie for storing
101 // A PATRICIA trie with DNA string element-access traits.
103 typedef trie<dna_t, string, traits_type> trie_type;
|
| H A D | trie_prefix_search.cc | 34 * An example showing how to use a trie for searching
39 * This example shows how to use a PATRICIA trie for searching
52 // A PATRICIA trie with a prefix-search node-updator type. Note that
59 typedef trie<string, mapped_type, cmp_fn, tag_type,
62 // The following helper function takes a trie object and r_key, a
96 assert(t.insert("trie").second == true);
105 print_prefix_match(t, "trie");
|
| /netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/bfd/ |
| H A D | mmo.c | 1210 search trie}, following ideas of Bentley and Sedgewick. (See
1213 Addison--Wesley, 1998), @samp{15.4}.) Each trie node stores a
1216 character in the trie. There also is a pointer to a symbol table
1229 | 0x40 - Traverse left trie.
1266 | 0x20 - Traverse middle trie. (Read a new command byte
1270 | 0x10 - Traverse right trie. (Read a new command byte and
1283 This forms the trivial trie (note that the path between ``:'' and
1307 /* Traverse left trie. */
1396 /* Traverse middle trie. */
1403 /* Traverse right trie
2606 struct mmo_symbol_trie *trie = rootp; local
2662 mmo_internal_3_length(bfd *abfd, struct mmo_symbol_trie *trie) argument
2732 mmo_internal_3_dump(bfd *abfd, struct mmo_symbol_trie *trie) argument
[all...] |
| /netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/bfd/ |
| H A D | mmo.c | 1210 search trie}, following ideas of Bentley and Sedgewick. (See
1213 Addison--Wesley, 1998), @samp{15.4}.) Each trie node stores a
1216 character in the trie. There also is a pointer to a symbol table
1229 | 0x40 - Traverse left trie.
1266 | 0x20 - Traverse middle trie. (Read a new command byte
1270 | 0x10 - Traverse right trie. (Read a new command byte and
1283 This forms the trivial trie (note that the path between ``:'' and
1307 /* Traverse left trie. */
1396 /* Traverse middle trie. */
1403 /* Traverse right trie
2606 struct mmo_symbol_trie *trie = rootp; local
2662 mmo_internal_3_length(bfd *abfd, struct mmo_symbol_trie *trie) argument
2732 mmo_internal_3_dump(bfd *abfd, struct mmo_symbol_trie *trie) argument
[all...] |
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/ |
| H A D | assoc_container.hpp | 473 /// An abstract basic tree-like (tree, trie) associative container.
574 /// A concrete basic trie-based associative container.
585 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
594 trie() { } function in class:__gnu_pbds::trie
599 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
606 trie(It first, It last) function in class:__gnu_pbds::trie
613 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
617 trie(const trie& other) function in class:__gnu_pbds::trie
621 ~trie() { }
[all...] |
| /netbsd-6-1-5-RELEASE/distrib/utils/sysinst/ |
| H A D | msg.mbr.fr | 83 La g�om�trie du disque doit �tre pr�cis�e.
91 {Sysinst n'a pas pu d�terminer automatiquement la g�om�trie utilis�e par le
93 La g�om�trie physique est %d cylindres %d secteurs %d t�tes\n}
97 la g�om�trie utilis�e par le BIOS soit de %d cylindres, %d secteurs et %d t�tes\n}
|
| /netbsd-6-1-5-RELEASE/gnu/dist/groff/src/roff/troff/ |
| H A D | 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
[all...] |
| /netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/util/common_type/assoc/ |
| H A D | common_type.hpp | 788 typedef __gnu_pbds::trie<Key, Data, E_Access_Traits, Tag, Node_Update, Allocator> type;
|
| /netbsd-6-1-5-RELEASE/external/cddl/osnet/dist/uts/common/ |
| H A D | Makefile.files | 506 IPGPC_OBJS += classifierddi.o classifier.o filters.o trie.o table.o \
|