Home
last modified time | relevance | path

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

12

/netbsd-src/external/gpl2/gettext/dist/gettext-tools/libgrep/
H A Dkwset.c56 struct trie *trie; /* Trie node pointed to by this edge. */ member
62 struct trie struct
66 struct trie *parent; /* Parent of this node. */ argument
67 struct trie *next; /* List of all trie nodes in level order. */ argument
68 struct trie *fail; /* Aho-Corasick failure function. */ argument
79 struct trie *trie; /* The trie itself. */ member
83 struct trie *next[NCHAR]; /* Table of children of the root. */
102 kwset->trie in kwsalloc()
103 = (struct trie *) obstack_alloc(&kwset->obstack, sizeof (struct trie)); in kwsalloc()
104 if (!kwset->trie) in kwsalloc()
[all …]
/netbsd-src/external/gpl2/grep/dist/src/
H A Dkwset.c56 struct trie *trie; /* Trie node pointed to by this edge. */ member
62 struct trie struct
66 struct trie *parent; /* Parent of this node. */ argument
67 struct trie *next; /* List of all trie nodes in level order. */ argument
68 struct trie *fail; /* Aho-Corasick failure function. */ argument
79 struct trie *trie; /* The trie itself. */ member
83 struct trie *next[NCHAR]; /* Table of children of the root. */
102 kwset->trie in kwsalloc()
103 = (struct trie *) obstack_alloc(&kwset->obstack, sizeof (struct trie)); in kwsalloc()
104 if (!kwset->trie) in kwsalloc()
[all …]
/netbsd-src/external/gpl3/binutils.old/dist/bfd/
H A Dmmo.c2734 struct mmo_symbol_trie *trie = rootp; in mmo_internal_add_3_sym() local
2737 while (*name && trie != NULL) in mmo_internal_add_3_sym()
2739 if (*name < trie->symchar) in mmo_internal_add_3_sym()
2741 triep = &trie->left; in mmo_internal_add_3_sym()
2742 trie = trie->left; in mmo_internal_add_3_sym()
2744 else if (*name > trie->symchar) in mmo_internal_add_3_sym()
2746 triep = &trie->right; in mmo_internal_add_3_sym()
2747 trie = trie->right; in mmo_internal_add_3_sym()
2749 else if (*name == trie->symchar) in mmo_internal_add_3_sym()
2751 triep = &trie->middle; in mmo_internal_add_3_sym()
[all …]
H A Ddwarf2.c2057 struct trie_node *trie, in insert_arange_in_trie() argument
2071 if (trie->num_room_in_leaf > 0) in insert_arange_in_trie()
2073 struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
2087 return trie; in insert_arange_in_trie()
2091 is_full_leaf = leaf->num_stored_in_leaf == trie->num_room_in_leaf; in insert_arange_in_trie()
2098 const struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
2101 trie = bfd_zalloc (abfd, sizeof (struct trie_interior)); in insert_arange_in_trie()
2102 if (!trie) in insert_arange_in_trie()
2111 if (!insert_arange_in_trie (abfd, trie, trie_pc, trie_pc_bits, in insert_arange_in_trie()
2122 const struct trie_leaf *leaf = (struct trie_leaf *) trie; in insert_arange_in_trie()
[all …]
/netbsd-src/external/gpl3/binutils/dist/bfd/
H A 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 …]
H A 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/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/
H A 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/gcc/dist/libstdc++-v3/include/ext/pb_ds/
H A 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/usr.sbin/sysinst/
H A Dmsg.mbr.fr53 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}
H A Dmsg.pm.fr103 message vnd_geom_fmt {D�finir la g�om�trie � la main}
/netbsd-src/external/gpl3/binutils/dist/bfd/doc/
H A 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
H A 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.old/dist/bfd/doc/
H A 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
H A Dbfd.info11876 and retrieved by means of a `ternary search trie', following ideas of
11879 Addison-Wesley, 1998), `15.4'.) Each trie node stores a character, and
11881 less than, equal to, or greater than the character in the trie. There
11894 0x40 - Traverse left trie.
11931 0x20 - Traverse middle trie. (Read a new command byte
11935 0x10 - Traverse right trie. (Read a new command byte and
11948 This forms the trivial trie (note that the path between ":" and "M"
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/
H A Dir.d772 Trie trie; // slow path for Unicode variable
778 trie = makeTrie(set); in this()
786 return trie[ch]; in opIndex()
/netbsd-src/usr.sbin/sysinst/arch/i386/
H A Dmsg.md.fr93 {C'est la bonne g�om�trie}
95 {Entrer la g�om�trie}
/netbsd-src/external/gpl2/groff/dist/src/roff/troff/
H A Denv.cpp3345 class trie { class
3351 trie() : tp(0) {} in trie() function in trie
3352 virtual ~trie(); // virtual to shut up g++
3359 class hyphen_trie : private trie {
3460 trie::~trie() in ~trie()
3465 void trie::clear() in clear()
3472 void trie::delete_trie_node(trie_node *p) in delete_trie_node()
3483 void trie::insert(const char *pat, int patlen, void *val) in insert()
3501 void trie::find(const char *pat, int patlen) in find()
H A DTODO65 Devise a more compact representation for the hyphenation patterns trie.
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/regex/internal/
H A Dir.d965 Trie trie; // slow path for Unicode variable
971 trie = makeTrie(set); in this()
979 return trie[ch]; in opIndex()
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/
H A Duni.d444 this will be called a fixed trie. The following describes a particular
450 (e.g. 15 and 8). The first is the number of bits in the index of the trie
451 and the other is number of bits in each page of the trie.
452 The layout of the trie is then an array of size 2^^bits-of-index followed
471 of the trie are introduced by recursing on this notion - the index array
476 $(P For completeness a level 1 trie is simply an array.
483 $(P The process of constructing a trie is more involved and is hidden from
487 can be turned into a trie. The trie object in this module
4392 auto trie = codepointTrie!(LuckFactor, 8, 5, 8)(map); variable
4396 assert(trie[ch] == luckFactor(ch)); // verify
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/uni/
H A Dpackage.d442 this will be called a fixed trie. The following describes a particular
448 (e.g. 15 and 8). The first is the number of bits in the index of the trie
449 and the other is number of bits in each page of the trie.
450 The layout of the trie is then an array of size 2^^bits-of-index followed
469 of the trie are introduced by recursing on this notion - the index array
474 $(P For completeness a level 1 trie is simply an array.
481 $(P The process of constructing a trie is more involved and is hidden from
485 can be turned into a trie. The trie object in this module
4385 auto trie = codepointTrie!(LuckFactor, 8, 5, 8)(map);
4389 assert(trie[ch] == luckFactor(ch)); // verify
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/docs/CommandGuide/
H A Dllvm-objdump.rst311 .. option:: --exports-trie
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-objdump/
H A DObjdumpOpts.td214 def exports_trie : Flag<["--"], "exports-trie">,
/netbsd-src/external/bsd/unbound/dist/contrib/
H A Dfastrpz.patch622 + * version of the mapped file except trie node parent pointers remain valid
628 + * Versions can also appear in a single file. Old nodes and trie values
676 + * Changes to trie node or other data are always made so that it and
846 + * Convert the found client IP trie key to a CIDR block
858 + * Compute the owner name of the found or result trie key, usually to log it.
1061 + * Describe the next trie node while dumping the database.
/netbsd-src/external/gpl2/groff/dist/
H A DChangeLog.1151333 * troff/env.cc (trie::~trie): Make virtual to shut up g++.
1742 (class trie, class hyphen_trie): Move declarations up.
1744 (trie::delete_trie_node): New function.
1745 (trie::do_delete): New pure virtual function.
1747 (trie::~trie): New function.
1749 (trie::clear): No need to chcek that tp is not 0.
3655 * troff/env.c (class trie, class hyphen_trie): Make the
3656 elements of the trie be of type char not unsigned char.

12