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

12

/external/eigen/bench/
H A Dcheck_cache_queries.cpp68 int sets = (abcd[2]); // C[31:0] local
69 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
76 cout << "cache[" << cache_id << "].sets = " << sets << "\n"; local
/external/chromium_org/testing/gtest/scripts/
H A Dfuse_gtest_files.py63 import sets namespace
150 processed_files = sets.Set() # Holds all gtest headers we've processed.
178 processed_files = sets.Set()
/external/protobuf/gtest/scripts/
H A Dfuse_gtest_files.py63 import sets namespace
150 processed_files = sets.Set() # Holds all gtest headers we've processed.
178 processed_files = sets.Set()
/external/chromium_org/ui/app_list/
H A Dsearch_result.cc46 void SearchResult::SetActions(const Actions& sets) { argument
47 actions_ = sets;
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
H A DFeatureUtil.java293 * of the given sets.
304 * of all the given sets.
305 * @param sets the sets to intersect
306 * @return the intersection of the sets
307 * @throws java.lang.IllegalArgumentException if there are no sets to
310 public static <T> Set<T> intersection(Set<? extends T> ... sets) { argument
311 if (sets.length == 0) {
313 "Can't intersect no sets; would have to return the universe.");
315 Set<T> results = Helpers.copyToSet(sets[
[all...]
/external/openfst/src/include/fst/
H A Dequivalent.h88 // Convenience function: returns the representative of 'id' in 'sets',
90 static MappedId FindSet(UnionFind<MappedId> *sets, MappedId id) { argument
91 MappedId repr = sets->FindSet(id);
95 sets->MakeSet(id);
116 // Analysis of Computer Programs") successively constructs sets of
119 // forest (the union-find algorithm) is used to represent the sets of
121 // sets contains both final and non-final states. Returns optional error
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dequivalent.h78 // Convenience function: returns the representative of 'id' in 'sets',
80 static MappedId FindSet(UnionFind<MappedId> *sets, MappedId id) { argument
81 MappedId repr = sets->FindSet(id);
85 sets->MakeSet(id);
99 // Analysis of Computer Programs") successively constructs sets of
102 // forest (the union-find algorithm) is used to represent the sets of
104 // sets contains both final and non-final states.
/external/chromium_org/extensions/common/
H A Durl_pattern_set.cc52 void URLPatternSet::CreateUnion(const std::vector<URLPatternSet>& sets, argument
55 if (sets.empty())
63 for (size_t i = 0; i < sets.size(); i += 2) {
64 if (i + 1 < sets.size()) {
66 URLPatternSet::CreateUnion(sets[i], sets[i + 1], &u);
69 working.push_back(sets[i]);
/external/chromium_org/testing/gtest/test/
H A Dgtest_filter_unittest.py47 import sets namespace
231 """Asserts that two sets are equal."""
246 self.assertEqual(sets.Set(set_var), sets.Set(full_partition))
253 return list(sets.Set(tests_to_run) - sets.Set(PARAM_TESTS))
350 sets the flags accordingly.
/external/chromium_org/third_party/icu/source/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/gtest/test/
H A Dgtest_filter_unittest.py47 import sets namespace
231 """Asserts that two sets are equal."""
246 self.assertEqual(sets.Set(set_var), sets.Set(full_partition))
253 return list(sets.Set(tests_to_run) - sets.Set(PARAM_TESTS))
350 sets the flags accordingly.
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheBuilderFactory.java33 * Helper class for creating {@link CacheBuilder} instances with all combinations of several sets of
127 * Sets.cartesianProduct doesn't allow sets that contain null, but we want null to mean
129 * behavior. This method wraps the elements in the input sets (which may contain null) as
133 private Iterable<List<Object>> buildCartesianProduct(Set<?>... sets) { argument
134 List<Set<Optional<?>>> optionalSets = Lists.newArrayListWithExpectedSize(sets.length);
135 for (Set<?> set : sets) {
/external/icu/icu4c/source/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/protobuf/gtest/test/
H A Dgtest_filter_unittest.py47 import sets namespace
187 """Asserts that two sets are equal."""
202 self.assertEqual(sets.Set(set_var), sets.Set(full_partition))
209 return list(sets.Set(tests_to_run) - sets.Set(PARAM_TESTS))
306 sets the flags accordingly.
/external/valgrind/main/cachegrind/
H A Dcg_sim.c45 Int sets; member in struct:__anon32371
62 c->sets = (c->size / c->line_size) / c->assoc;
63 c->sets_min_1 = c->sets - 1;
65 c->tag_shift = c->line_size_bits + VG_(log2)(c->sets);
76 sizeof(UWord) * c->sets * c->assoc);
78 for (i = 0; i < c->sets * c->assoc; i++)
136 * tag = block >> log2(#sets)
160 VG_(tool_panic)("item straddles more than two cache sets");
/external/llvm/lib/Support/
H A Dregex2.h97 * Structure for [] character-set representation. Character sets are
101 * simplifies testing whether two sets could be identical.
135 cset *sets; /* -> cset [ncsets] */ member in struct:re_guts
/external/valgrind/main/coregrind/
H A Dm_cache.c298 UInt sets = *(UInt *)&info[8] + 1; local
300 UInt size = assoc * parts * line_size * sets / 1024;
/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/guava/guava/src/com/google/common/collect/
H A DSets.java527 * An unmodifiable view of a set which may be backed by other sets; this view
528 * will change as the backing sets do. Contains methods to copy the data into
555 * all the sets involved are based on the same notion of equivalence.
568 * Returns an unmodifiable <b>view</b> of the union of two sets. The returned
574 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
579 * smaller of the two sets. If you have reason to believe one of your sets
616 * Returns an unmodifiable <b>view</b> of the intersection of two sets. The
617 * returned set contains all elements that are contained by both backing sets.
620 * <p>Results are undefined if {@code set1} and {@code set2} are sets base
928 cartesianProduct( List<? extends Set<? extends B>> sets) argument
984 cartesianProduct( Set<? extends B>.... sets) argument
993 CartesianSet(List<? extends Set<? extends B>> sets) argument
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DSets.java515 * An unmodifiable view of a set which may be backed by other sets; this view
516 * will change as the backing sets do. Contains methods to copy the data into
543 * all the sets involved are based on the same notion of equivalence.
556 * Returns an unmodifiable <b>view</b> of the union of two sets. The returned
562 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
567 * smaller of the two sets. If you have reason to believe one of your sets
604 * Returns an unmodifiable <b>view</b> of the intersection of two sets. The
605 * returned set contains all elements that are contained by both backing sets.
608 * <p>Results are undefined if {@code set1} and {@code set2} are sets base
916 cartesianProduct( List<? extends Set<? extends B>> sets) argument
972 cartesianProduct( Set<? extends B>.... sets) argument
981 CartesianSet(List<? extends Set<? extends B>> sets) argument
[all...]
/external/llvm/lib/Target/AArch64/
H A DAArch64CollectLOH.cpp228 /// the given "sets".
229 /// If this couple does not reference any set, an empty set is added to "sets"
232 /// with the way sets is used.
233 static SetOfMachineInstr &getSet(BlockToSetOfInstrsPerColor &sets, argument
237 BlockToSetOfInstrsPerColor::iterator it = sets.find(&MBB);
238 if (it != sets.end())
241 result = sets[&MBB] = new SetOfMachineInstr[nbRegs];
247 /// the given "sets".
248 /// This is used to get the uses record in sets of a definition identified by
251 /// "sets[re
253 getUses(InstrToInstrs *sets, unsigned reg, const MachineInstr &MI) argument
260 getUses(const InstrToInstrs *sets, unsigned reg, const MachineInstr &MI) argument
[all...]
/external/eigen/Eigen/src/Core/util/
H A DMemory.h801 int sets = (abcd[2]); // C[31:0] local
803 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
/external/chromium_org/third_party/icu/source/i18n/
H A Drbt_pars.cpp173 const UVector* sets,
175 data(d), variablesVector(sets), variableNames(vNames) {}
1049 // variable range' pragma allows rule sets to modify this.
1331 // sets, or a mixture of chars and sets -- syntax error.
172 ParseData(const TransliterationRuleData* d, const UVector* sets, const Hashtable* vNames) argument
H A Drematch.cpp2799 UVector *sets = fPattern->fSets; local
3171 UnicodeSet **sets = fPattern->fStaticSets; local
3172 if (sets[URX_GC_NORMAL]->contains(c)) goto GC_Extend;
3173 if (sets[URX_GC_CONTROL]->contains(c)) goto GC_Control;
3174 if (sets[URX_GC_L]->contains(c)) goto GC_L;
3175 if (sets[URX_GC_LV]->contains(c)) goto GC_V;
3176 if (sets[URX_GC_LVT]->contains(c)) goto GC_T;
3177 if (sets[URX_GC_V]->contains(c)) goto GC_V;
3178 if (sets[URX_GC_T]->contains(c)) goto GC_T;
3187 if (sets[URX_GC_
[all...]
/external/icu/icu4c/source/i18n/
H A Drbt_pars.cpp173 const UVector* sets,
175 data(d), variablesVector(sets), variableNames(vNames) {}
1049 // variable range' pragma allows rule sets to modify this.
1331 // sets, or a mixture of chars and sets -- syntax error.
172 ParseData(const TransliterationRuleData* d, const UVector* sets, const Hashtable* vNames) argument

Completed in 635 milliseconds

12