Searched defs:sets (Results 1 - 9 of 9) sorted by relevance

/external/gtest/scripts/
H A Dfuse_gtest_files.py63 import sets namespace
155 processed_files = sets.Set() # Holds all gtest headers we've processed.
184 processed_files = sets.Set()
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dequivalent.h79 // Convenience function: returns the representative of 'id' in 'sets',
81 static MappedId FindSet(UnionFind<MappedId> *sets, MappedId id) { argument
82 MappedId repr = sets->FindSet(id);
86 sets->MakeSet(id);
100 // Analysis of Computer Programs") successively constructs sets of
103 // forest (the union-find algorithm) is used to represent the sets of
105 // sets contains both final and non-final states.
/external/gtest/test/
H A Dgtest_filter_unittest.py48 import sets namespace
190 """Asserts that two sets are equal."""
205 self.assertEqual(sets.Set(set_var), sets.Set(full_partition))
215 tests_to_run = list(sets.Set(tests_to_run) - sets.Set(PARAM_TESTS))
267 enabled in the binary and sets flags accordingly.
/external/icu4c/common/
H A Drbbisetb.cpp20 // set of input uniocde sets.
24 // of these sets belong to the same set of the original
137 // that is in no sets.
206 // Add this unicode set to the list of sets for this rlRange
251 // Handle input sets that contain the special string {eof}.
340 // For each of the original Unicode sets - which correspond
344 // a list of sets.
350 void RBBISetBuilder::addValToSets(UVector *sets, uint32_t val) { argument
353 for (ix=0; ix<sets->size(); ix++) {
354 RBBINode *usetNode = (RBBINode *)sets
[all...]
/external/guava/src/com/google/common/collect/
H A DSets.java495 * An unmodifiable view of a set which may be backed by other sets; this view
496 * will change as the backing sets do. Contains methods to copy the data into
521 * all the sets involved are based on the same notion of equivalence.
534 * Returns an unmodifiable <b>view</b> of the union of two sets. The returned
540 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
545 * smaller of the two sets. If you have reason to believe one of your sets
554 // sorted sets and use that instead if so
585 * Returns an unmodifiable <b>view</b> of the intersection of two sets. The
586 * returned set contains all elements that are contained by both backing sets
766 cartesianProduct( List<? extends Set<? extends B>> sets) argument
811 cartesianProduct( Set<? extends B>.... sets) argument
820 CartesianSet(List<? extends Set<? extends B>> sets) argument
[all...]
/external/bison/lib/
H A Dbitset_stats.c56 bitset_stats_info->types[BITSET_TYPE_ (BSET)].sets++
82 unsigned int sets; member in struct:bitset_type_info_struct
181 stats->sets, stats->cache_sets,
182 stats->sets ? 100.0 * stats->cache_sets / stats->sets : 0);
/external/icu4c/i18n/
H A Drematch.cpp1484 UVector *sets = fPattern->fSets; local
1850 UnicodeSet **sets = fPattern->fStaticSets; local
1851 if (sets[URX_GC_NORMAL]->contains(c)) goto GC_Extend;
1852 if (sets[URX_GC_CONTROL]->contains(c)) goto GC_Control;
1853 if (sets[URX_GC_L]->contains(c)) goto GC_L;
1854 if (sets[URX_GC_LV]->contains(c)) goto GC_V;
1855 if (sets[URX_GC_LVT]->contains(c)) goto GC_T;
1856 if (sets[URX_GC_V]->contains(c)) goto GC_V;
1857 if (sets[URX_GC_T]->contains(c)) goto GC_T;
1865 if (sets[URX_GC_
[all...]
H A Drbt_pars.cpp169 const UVector* sets,
171 data(d), variablesVector(sets), variableNames(vNames) {}
1043 // variable range' pragma allows rule sets to modify this.
1325 // sets, or a mixture of chars and sets -- syntax error.
168 ParseData(const TransliterationRuleData* d, const UVector* sets, const Hashtable* vNames) argument
/external/icu4c/test/intltest/
H A Dusettest.cpp815 errln("FAIL: couldn't construct test sets");
2996 // sets to be tested; odd index=isComplement
3022 void UnicodeSetTest::testSpan(const UnicodeSetWithStrings *sets[4], argument
3036 // Even-numbered sets are original, uncomplemented sets.
3041 // Odd-numbered sets are complemented.
3047 limitsCount=getSpans(*sets[i], (UBool)(i&1),
3094 if(!sets[SLOW]->getSet().containsAll(string)) {
3099 if(!sets[FAST]->getSet().containsAll(string)) {
3105 if(!sets[SLO
3123 testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16, uint32_t whichSpans, const char *testName, int32_t index) argument
3162 testSpanBothUTFs(const UnicodeSetWithStrings *sets[4], const UChar *s16, int32_t length16, uint32_t whichSpans, const char *testName, int32_t index) argument
3238 testSpanContents(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName) argument
3273 testSpanUTF16String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName) argument
3294 testSpanUTF8String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName) argument
3583 UnicodeSet *sets[SET_COUNT]={ NULL }; local
[all...]

Completed in 1043 milliseconds