HomeSort by relevance Sort by last modified time
    Searched full:trie (Results 201 - 225 of 326) sorted by null

1 2 3 4 5 6 7 891011>>

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/
tag_and_trait.hpp 129 /// trie.
132 /// PATRICIA trie.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/
tag_and_trait.hpp 129 /// trie.
132 /// PATRICIA trie.
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/
tag_and_trait.hpp 128 /// trie.
131 /// PATRICIA trie.
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/
tag_and_trait.hpp 128 /// trie.
131 /// PATRICIA trie.
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/
tag_and_trait.hpp 128 /// trie.
131 /// PATRICIA trie.
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/
tag_and_trait.hpp 128 /// trie.
131 /// PATRICIA trie.
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/
tag_and_trait.hpp 129 /// trie.
132 /// PATRICIA trie.
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/
tag_and_trait.hpp 129 /// trie.
132 /// PATRICIA trie.
  /external/chromium_org/courgette/
adjustment_method.cc 126 // TRIE node for suffix strings in the label reference sequence.
128 // We dynamically build a trie for both the program and model, growing the trie
129 // as necessary. The trie node for a (possibly) empty string of label
142 int count_; // Frequency of this path in Trie.
533 // Make sure trie is filled in at this node.
  /external/icu4c/i18n/
tzgnames.cpp 103 * GNameInfo stores zone name information in the local trie
606 // put the name info into the trie
857 // put the name to the local trie as well
903 // getPartialLocationName formats a name and put it into the trie
    [all...]
tznames_impl.cpp 137 // Trie is built, while fNodes and fLazyContents change with the lazy init
285 // Mutex for protecting the lazy creation of the Trie node structure on the first call to search().
288 // buildTrie() - The Trie node structure is needed. Create it from the data that was
289 // saved at the time the ZoneStringFormatter was created. The Trie is only
291 // and the Trie is big, which is why its creation is deferred until first use.
742 * ZNameInfo stores zone name information in the trie
    [all...]
  /external/marisa-trie/v0_1_5/tests/
Makefile.in 38 tail-test$(EXEEXT) trie-test$(EXEEXT) c-test$(EXEEXT)
51 vector-test$(EXEEXT) tail-test$(EXEEXT) trie-test$(EXEEXT) \
62 am_trie_test_OBJECTS = trie-test.$(OBJEXT)
235 trie_test_SOURCES = trie-test.cc
291 trie-test$(EXEEXT): $(trie_test_OBJECTS) $(trie_test_DEPENDENCIES) $(EXTRA_trie_test_DEPENDENCIES)
292 @rm -f trie-test$(EXEEXT)
310 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/trie-test.Po@am__quote@
unit-test.cc 248 ASSERT(progress.trie() == MARISA_ALPHA_DEFAULT_TRIE);
259 ASSERT(progress.trie() == MARISA_ALPHA_DEFAULT_TRIE);
271 ASSERT(progress.trie() == MARISA_ALPHA_PREFIX_TRIE);
  /external/chromium_org/third_party/icu/source/i18n/
uspoof_impl.h 362 int32_t fAnyCaseTrie; // byte offset to the serialized Any Case Trie
363 int32_t fAnyCaseTrieLength; // Length (bytes) of the serialized Any Case Trie
365 int32_t fLowerCaseTrie; // byte offset to the serialized Lower Case Trie
366 int32_t fLowerCaseTrieLength; // Length (bytes) of the serialized Lower Case Trie
394 // by the offsets obtained from the Trie.
  /external/icu4c/common/
bytestriebuilder.cpp 31 * It might(!) take less memory if we collected the data in a temporary, dynamic trie.
199 bytes=NULL; // The new trie now owns the array.
248 // Create and byte-serialize the trie for the elements.
ucnv_ext.cpp 117 * - no trie is used
548 /* trie lookup of firstCP */
551 return 0; /* the first code point is outside the trie */
645 } else /* result from firstCP trie lookup */ {
    [all...]
  /external/marisa-trie/tests/
unit-test.cc 244 ASSERT(progress.trie() == MARISA_DEFAULT_TRIE);
255 ASSERT(progress.trie() == MARISA_DEFAULT_TRIE);
267 ASSERT(progress.trie() == MARISA_PREFIX_TRIE);
  /external/chromium_org/third_party/icu/source/common/
ucnv_ext.c 116 * - no trie is used
538 /* trie lookup of firstCP */
541 return 0; /* the first code point is outside the trie */
642 } else /* result from firstCP trie lookup */ {
    [all...]
rbbidata.h 84 uint32_t fTrie; /* Offset to Trie data for character categories */
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/
container_base_dispatch.hpp 137 /// Specialization for PATRICIA trie map.
149 /// Specialization for PATRICIA trie set.
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/
container_base_dispatch.hpp 137 /// Specialization for PATRICIA trie map.
149 /// Specialization for PATRICIA trie set.
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/
container_base_dispatch.hpp 137 /// Specialization for PATRICIA trie map.
149 /// Specialization for PATRICIA trie set.
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
com.ibm.icu_4.2.1.v20100412.jar 
  /external/chromium_org/chrome/tools/convert_dict/
convert_dict.cc 30 // Compares the given word list with the serialized trie to make sure they
  /external/chromium_org/third_party/icu/android/
brkitr.patch 8 # List of compact trie dictionary files (ctd).

Completed in 300 milliseconds

1 2 3 4 5 6 7 891011>>