HomeSort by relevance Sort by last modified time
    Searched refs:Trie (Results 1 - 25 of 29) sorted by null

1 2

  /external/marisa-trie/lib/marisa/
trie.cc 4 #include "trie.h"
8 Trie::Trie()
12 void Trie::mmap(Mapper *mapper, const char *filename,
21 void Trie::map(const void *ptr, std::size_t size) {
26 void Trie::map(Mapper &mapper) {
27 Trie temp;
38 temp.trie_.reset(new (std::nothrow) Trie);
45 void Trie::load(const char *filename,
52 void Trie::fread(std::FILE *file)
    [all...]
trie-inline.h 10 inline std::string Trie::operator[](UInt32 key_id) const {
16 inline UInt32 Trie::operator[](const char *str) const {
20 inline UInt32 Trie::operator[](const std::string &str) const {
24 inline UInt32 Trie::lookup(const std::string &str) const {
28 inline std::size_t Trie::find(const std::string &str,
35 inline std::size_t Trie::find(const std::string &str,
42 inline UInt32 Trie::find_first(const std::string &str,
47 inline UInt32 Trie::find_last(const std::string &str,
53 inline std::size_t Trie::find_callback(const char *str,
61 inline std::size_t Trie::find_callback(const char *ptr, std::size_t length
    [all...]
trie-search.cc 4 #include "trie.h"
42 std::string Trie::restore(UInt32 key_id) const {
50 void Trie::restore(UInt32 key_id, std::string *key) const {
57 std::size_t Trie::restore(UInt32 key_id, char *key_buf,
66 UInt32 Trie::lookup(const char *str) const {
72 UInt32 Trie::lookup(const char *ptr, std::size_t length) const {
78 std::size_t Trie::find(const char *str,
87 std::size_t Trie::find(const char *ptr, std::size_t length,
96 std::size_t Trie::find(const char *str,
105 std::size_t Trie::find(const char *ptr, std::size_t length
    [all...]
trie-build.cc 7 #include "trie.h"
11 void Trie::build(const char * const *keys, std::size_t num_keys,
34 void Trie::build(const std::vector<std::string> &keys,
46 void Trie::build(const std::vector<std::pair<std::string, double> > &keys,
60 void Trie::build_trie(Vector<Key<String> > &keys,
71 void Trie::build_trie(Vector<Key<String> > &keys,
73 Trie temp;
120 void Trie::build_trie(Vector<Key<T> > &keys,
164 void Trie::build_cur(Vector<Key<T> > &keys,
225 if ((progress.trie() != MARISA_PATRICIA_TRIE) &
    [all...]
trie.h 21 class Trie {
23 Trie();
190 void swap(Trie *rhs);
201 std::auto_ptr<Trie> trie_;
298 Trie(const Trie &);
299 Trie &operator=(const Trie &);
304 #include "trie-inline.h"
trie-c.cc 1 #include "trie.h"
53 marisa_trie_() : trie(), mapper() {}
55 marisa::Trie trie; member in struct:marisa_trie_
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags);
96 h->trie.mmap(&h->mapper, filename, offset, whence);
104 h->trie.map(ptr, size);
114 h->trie.load(filename, offset, whence);
123 h->trie.fread(file);
132 h->trie.read(fd)
    [all...]
  /external/marisa-trie/v0_1_5/lib/marisa_alpha/
trie.cc 4 #include "trie.h"
8 Trie::Trie()
12 void Trie::mmap(Mapper *mapper, const char *filename,
21 void Trie::map(const void *ptr, std::size_t size) {
26 void Trie::map(Mapper &mapper) {
27 Trie temp;
38 temp.trie_.reset(new (std::nothrow) Trie);
45 void Trie::load(const char *filename,
52 void Trie::fread(std::FILE *file)
    [all...]
trie-inline.h 10 inline std::string Trie::operator[](UInt32 key_id) const {
16 inline UInt32 Trie::operator[](const char *str) const {
20 inline UInt32 Trie::operator[](const std::string &str) const {
24 inline UInt32 Trie::lookup(const std::string &str) const {
28 inline std::size_t Trie::find(const std::string &str,
35 inline std::size_t Trie::find(const std::string &str,
42 inline UInt32 Trie::find_first(const std::string &str,
47 inline UInt32 Trie::find_last(const std::string &str,
53 inline std::size_t Trie::find_callback(const char *str,
61 inline std::size_t Trie::find_callback(const char *ptr, std::size_t length
    [all...]
trie-search.cc 4 #include "trie.h"
42 std::string Trie::restore(UInt32 key_id) const {
50 void Trie::restore(UInt32 key_id, std::string *key) const {
57 std::size_t Trie::restore(UInt32 key_id, char *key_buf,
66 UInt32 Trie::lookup(const char *str) const {
72 UInt32 Trie::lookup(const char *ptr, std::size_t length) const {
79 std::size_t Trie::find(const char *str,
88 std::size_t Trie::find(const char *ptr, std::size_t length,
98 std::size_t Trie::find(const char *str,
107 std::size_t Trie::find(const char *ptr, std::size_t length
    [all...]
trie-build.cc 7 #include "trie.h"
11 void Trie::build(const char * const *keys, std::size_t num_keys,
36 void Trie::build(const std::vector<std::string> &keys,
49 void Trie::build(const std::vector<std::pair<std::string, double> > &keys,
63 void Trie::build_trie(Vector<Key<String> > &keys,
80 void Trie::build_trie(Vector<Key<String> > &keys,
82 Trie temp;
129 void Trie::build_trie(Vector<Key<T> > &keys,
173 void Trie::build_cur(Vector<Key<T> > &keys,
235 if ((progress.trie() != MARISA_ALPHA_PATRICIA_TRIE) &
    [all...]
trie.h 21 class Trie {
23 Trie();
190 void swap(Trie *rhs);
201 std::auto_ptr<Trie> trie_;
298 Trie(const Trie &);
299 Trie &operator=(const Trie &);
304 #include "trie-inline.h"
  /external/clang/unittests/Tooling/
CompilationDatabaseTest.cpp 138 FileMatchTrieTest() : Trie(new FakeComparator()) {}
142 return Trie.findEquivalent(Path, ES);
145 FileMatchTrie Trie;
150 Trie.insert("//net/path/file.cc");
151 Trie.insert("file.cc");
160 Trie.insert("//net/d/c/b.cc");
161 Trie.insert("//net/d/b/b.cc");
166 Trie.insert("//net/AA/file.cc");
171 Trie.insert("//net/Aa/file.cc");
172 Trie.insert("//net/aA/file.cc")
    [all...]
  /external/marisa-trie/tools/
marisa-find.cc 39 void find_all(const marisa::Trie &trie, const std::string &str) {
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths);
56 void find_first(const marisa::Trie &trie, const std::string &str) {
58 const marisa::UInt32 key_id = trie.find_first(str, &length);
59 if (key_id != trie.notfound()) {
67 void find_last(const marisa::Trie &trie, const std::string &str) {
69 const marisa::UInt32 key_id = trie.find_last(str, &length)
88 marisa::Trie trie; local
    [all...]
marisa-benchmark.cc 50 " -P, --patricia-trie build patricia tries (default)\n"
51 " -p, --prefix-trie build prefix tries\n"
71 std::cout << "trie: patricia" << std::endl;
75 std::cout << "trie: prefix" << std::endl;
174 marisa::Trie *trie, std::vector<marisa::UInt32> *key_ids) {
176 trie->build(keys, key_ids, num_tries
178 std::printf(" %9lu", (unsigned long)trie->num_nodes());
179 std::printf(" %9lu", (unsigned long)trie->total_size());
183 void benchmark_restore(const marisa::Trie &trie
273 marisa::Trie trie; local
    [all...]
marisa-lookup.cc 33 marisa::Trie trie; local
37 trie.mmap(&mapper, args[0]);
45 trie.load(args[0]);
55 const marisa::UInt32 key_id = trie.lookup(str);
56 if (key_id != trie.notfound()) {
marisa-build.cc 28 " -P, --patricia-trie build patricia tries (default)\n"
29 " -p, --prefix-trie build prefix tries\n"
77 marisa::Trie trie; local
79 trie.build(keys, NULL, param_num_tries
87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
88 std::cerr << "#tries: " << trie.num_tries() << std::endl;
89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
90 std::cerr << "size: " << trie.total_size() << std::endl;
94 trie.save(output_filename)
    [all...]
marisa-predict.cc 42 marisa::Trie trie; local
46 trie.mmap(&mapper, args[0]);
54 trie.load(args[0]);
66 std::size_t num_keys = trie.predict(str);
73 num_keys = trie.predict_depth_first(
76 num_keys = trie.predict_breadth_first(
  /external/marisa-trie/v0_1_5/tools/
marisa_alpha-find.cc 39 void find_all(const marisa_alpha::Trie &trie, const std::string &str) {
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths);
56 void find_first(const marisa_alpha::Trie &trie, const std::string &str) {
58 const marisa_alpha::UInt32 key_id = trie.find_first(str, &length);
59 if (key_id != trie.notfound()) {
67 void find_last(const marisa_alpha::Trie &trie, const std::string &str) {
69 const marisa_alpha::UInt32 key_id = trie.find_last(str, &length)
88 marisa_alpha::Trie trie; local
    [all...]
marisa_alpha-benchmark.cc 50 " -P, --patricia-trie build patricia tries (default)\n"
51 " -p, --prefix-trie build prefix tries\n"
71 std::cout << "trie: patricia" << std::endl;
75 std::cout << "trie: prefix" << std::endl;
174 marisa_alpha::Trie *trie, std::vector<marisa_alpha::UInt32> *key_ids) {
176 trie->build(keys, key_ids, num_tries
178 std::printf(" %9lu", (unsigned long)trie->num_nodes());
179 std::printf(" %9lu", (unsigned long)trie->total_size());
183 void benchmark_restore(const marisa_alpha::Trie &trie
273 marisa_alpha::Trie trie; local
    [all...]
marisa_alpha-lookup.cc 33 marisa_alpha::Trie trie; local
37 trie.mmap(&mapper, args[0]);
45 trie.load(args[0]);
55 const marisa_alpha::UInt32 key_id = trie.lookup(str);
56 if (key_id != trie.notfound()) {
marisa_alpha-build.cc 28 " -P, --patricia-trie build patricia tries (default)\n"
29 " -p, --prefix-trie build prefix tries\n"
77 marisa_alpha::Trie trie; local
79 trie.build(keys, NULL, param_num_tries
87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
88 std::cerr << "#tries: " << trie.num_tries() << std::endl;
89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
90 std::cerr << "size: " << trie.total_size() << std::endl;
94 trie.save(output_filename)
    [all...]
marisa_alpha-predict.cc 42 marisa_alpha::Trie trie; local
46 trie.mmap(&mapper, args[0]);
54 trie.load(args[0]);
66 std::size_t num_keys = trie.predict(str);
73 num_keys = trie.predict_depth_first(
76 num_keys = trie.predict_breadth_first(
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
ToHTMLStream.java 61 /** A digital search trie for fast, case insensitive lookup of ElemDesc objects. */
62 static final Trie m_elementFlags = new Trie();
67 static void initTagReference(Trie m_elementFlags) {
639 * A Trie that is just a copy of the "static" one.
641 * method Trie.get2(name)
643 private Trie m_htmlInfo = new Trie(m_elementFlags);
    [all...]
  /external/marisa-trie/tests/
trie-test.cc 56 marisa::Trie trie; local
58 ASSERT(trie.num_tries() == 0);
59 ASSERT(trie.num_keys() == 0);
60 ASSERT(trie.num_nodes() == 0);
61 ASSERT(trie.total_size() == (sizeof(marisa::UInt32) * 23));
64 trie.build(keys);
65 ASSERT(trie.num_tries() == 1);
66 ASSERT(trie.num_keys() == 0);
67 ASSERT(trie.num_nodes() == 1)
190 marisa::Trie trie; local
416 marisa::Trie trie; local
514 marisa::Trie trie; local
578 marisa::Trie trie; local
    [all...]
  /external/marisa-trie/v0_1_5/tests/
trie-test.cc 56 marisa_alpha::Trie trie; local
58 ASSERT(trie.num_tries() == 0);
59 ASSERT(trie.num_keys() == 0);
60 ASSERT(trie.num_nodes() == 0);
61 ASSERT(trie.total_size() == (sizeof(marisa_alpha::UInt32) * 23));
64 trie.build(keys);
65 ASSERT(trie.num_tries() == 1);
66 ASSERT(trie.num_keys() == 0);
67 ASSERT(trie.num_nodes() == 1)
192 marisa_alpha::Trie trie; local
434 marisa_alpha::Trie trie; local
532 marisa_alpha::Trie trie; local
596 marisa_alpha::Trie trie; local
    [all...]

Completed in 127 milliseconds

1 2