Searched refs:sets (Results 1 - 25 of 203) sorted by relevance

123456789

/external/tensorflow/tensorflow/contrib/metrics/python/ops/
H A Dset_ops.py20 from tensorflow.python.ops import sets namespace
22 set_size = sets.set_size
24 set_intersection = sets.set_intersection
26 set_difference = sets.set_difference
28 set_union = sets.set_union
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Dcompat.py37 from sets import Set as set, ImmutableSet as frozenset
/external/llvm/lib/Support/
H A Dregfree.c65 if (g->sets != NULL)
66 free((char *)g->sets);
/external/swiftshader/third_party/LLVM/lib/Support/
H A Dregfree.c65 if (g->sets != NULL)
66 free((char *)g->sets);
/external/swiftshader/third_party/llvm-subzero/lib/Support/
H A Dregfree.c65 if (g->sets != NULL)
66 free((char *)g->sets);
/external/elfutils/config/
H A Dknown-dwarf.awk40 n = asorti(DW, sets);
42 set = sets[i];
/external/curl/docs/cmdline-opts/
H A Dtcp-nodelay.d8 Since 7.50.2, curl sets this option by default and you need to explicitly
H A Dbasic.d8 previously set option that sets a different authentication method (such as
/external/abi-compliance-checker/modules/Internals/Scripts/
H A DTabs.js11 var sets = document.getElementsByTagName('div');
12 for (var i = 0; i < sets.length; i++)
14 if (sets[i].className.indexOf('tabset') != -1)
17 var links = sets[i].getElementsByTagName('a');
/external/icu/icu4c/source/test/intltest/
H A Dusettest.h176 void testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16,
180 void testSpan(const UnicodeSetWithStrings *sets[4], const void *s, int32_t length, UBool isUTF16,
183 void testSpanBothUTFs(const UnicodeSetWithStrings *sets[4],
187 void testSpanContents(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName);
188 void testSpanUTF16String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName);
189 void testSpanUTF8String(const UnicodeSetWithStrings *sets[4], uint32_t whichSpans, const char *testName);
/external/clang/utils/
H A Dtoken-delta.py49 """split(set) -> [sets]
63 def delta(self, c, sets):
64 # assert(reduce(set.union, sets, set()) == c)
67 if len(sets) <= 1:
71 res = self.search(c, sets)
75 # Otherwise, partition sets if possible; if not we are done.
76 refined = sum(map(list, map(self.split, sets)), [])
77 if len(refined) == len(sets):
82 def search(self, c, sets):
83 for i,S in enumerate(sets)
[all...]
/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/google-breakpad/src/testing/scripts/generator/cpp/
H A Dkeywords.py33 from sets import Set as set
/external/googletest/googlemock/scripts/generator/cpp/
H A Dkeywords.py33 from sets import Set as set
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/lang/
H A DUnicodeSetStringSpanTest.java556 // sets to be tested; odd index=isComplement
573 void verifySpan(final UnicodeSetWithStrings sets[], final String s, int whichSpans, argument
584 // Even-numbered sets are original, uncomplemented sets.
589 // Odd-numbered sets are complemented.
595 limitsCount = getSpans(sets[i], (0 != (i & 1)), s, whichSpans, type, typeName, limits,
640 if (!sets[SLOW].getSet().containsAll(string)) {
645 if (!sets[FAST].getSet().containsAll(string)) {
651 if (!sets[SLOW].getSet().containsNone(string)) {
656 if (!sets[FAS
669 verifySpan(final UnicodeSetWithStrings sets[], final String s, int whichSpans, final String testName, int index) argument
680 verifySpanBothUTFs(final UnicodeSetWithStrings sets[], final String s16, int whichSpans, final String testName, int index) argument
715 verifySpanContents(final UnicodeSetWithStrings sets[], int whichSpans, final String testName) argument
776 verifySpanUTF16String(final UnicodeSetWithStrings sets[], int whichSpans, final String testName) argument
[all...]
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/
H A DUnicodeSetStringSpanTest.java553 // sets to be tested; odd index=isComplement
570 void verifySpan(final UnicodeSetWithStrings sets[], final String s, int whichSpans, argument
581 // Even-numbered sets are original, uncomplemented sets.
586 // Odd-numbered sets are complemented.
592 limitsCount = getSpans(sets[i], (0 != (i & 1)), s, whichSpans, type, typeName, limits,
637 if (!sets[SLOW].getSet().containsAll(string)) {
642 if (!sets[FAST].getSet().containsAll(string)) {
648 if (!sets[SLOW].getSet().containsNone(string)) {
653 if (!sets[FAS
666 verifySpan(final UnicodeSetWithStrings sets[], final String s, int whichSpans, final String testName, int index) argument
677 verifySpanBothUTFs(final UnicodeSetWithStrings sets[], final String s16, int whichSpans, final String testName, int index) argument
712 verifySpanContents(final UnicodeSetWithStrings sets[], int whichSpans, final String testName) argument
773 verifySpanUTF16String(final UnicodeSetWithStrings sets[], int whichSpans, final String testName) argument
[all...]
/external/v8/testing/gmock/scripts/generator/cpp/
H A Dkeywords.py33 from sets import Set as set
/external/dagger2/producers/src/main/java/dagger/producers/internal/
H A DSetProducer.java57 * <p>If any of the delegate sets, or any elements therein, are null, then this future will fail
77 @Override public Set<T> apply(List<Set<T>> sets) {
79 for (Set<T> set : sets) {
/external/swiftshader/third_party/LLVM/lib/DebugInfo/
H A DDWARFDebugAranges.cpp66 SetCollection sets; local
71 sets.push_back(set);
75 std::for_each(sets.begin(), sets.end(), CountArangeDescriptors(count));
80 std::for_each(sets.begin(), sets.end(), range_adder);
/external/valgrind/cachegrind/
H A Dcg_sim.c45 Int sets; member in struct:__anon28825
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/valgrind/callgrind/
H A Dthreads.c116 t->lastdump_cost = CLG_(get_eventset_cost)( CLG_(sets).full );
117 t->sighandler_cost = CLG_(get_eventset_cost)( CLG_(sets).full );
118 CLG_(init_cost)( CLG_(sets).full, t->lastdump_cost );
119 CLG_(init_cost)( CLG_(sets).full, t->sighandler_cost );
214 CLG_(zero_cost)( CLG_(sets).full, es->cost );
283 CLG_(add_and_zero_cost)( CLG_(sets).full,
333 es->cost = CLG_(get_eventset_cost)(CLG_(sets).full);
334 CLG_(zero_cost)( CLG_(sets).full, es->cost );
427 CLG_(print_cost)(-9, CLG_(sets).full, es->cost);
454 CLG_(print_cost)(-9, CLG_(sets)
[all...]
/external/tensorflow/tensorflow/python/kernel_tests/
H A Dsets_test.py30 from tensorflow.python.ops import sets namespace
155 sets.set_size(sparse_data, validate_indices=True),
156 sets.set_size(sparse_data, validate_indices=False)
522 sets.set_intersection(
524 sets.set_intersection(
526 sets.set_intersection(
528 sets.set_intersection(
535 op = sets.set_size(sets.set_intersection(a, b))
960 sets
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
H A DFeatureUtil.java291 * of the given sets.
302 * of all the given sets.
303 * @param sets the sets to intersect
304 * @return the intersection of the sets
305 * @throws java.lang.IllegalArgumentException if there are no sets to
308 public static <T> Set<T> intersection(Set<? extends T> ... sets) { argument
309 if (sets.length == 0) {
311 "Can't intersect no sets; would have to return the universe.");
313 Set<T> results = Helpers.copyToSet(sets[
[all...]
/external/python/cpython2/Parser/
H A Dspark.py302 sets = [ [(1,0), (2,0)] ]
316 sets.append([])
318 if sets[i] == []:
320 self.makeSet(tokens[i], sets, i)
322 sets.append([])
323 self.makeSet(None, sets, len(tokens))
325 #_dump(tokens, sets, self.states)
328 if finalitem not in sets[-2]:
335 tokens, len(sets)-2)
471 def makeSet(self, token, sets,
[all...]
/external/autotest/client/site_tests/buffet_BasicDBusAPI/
H A Dbuffet_BasicDBusAPI.py9 import sets namespace
86 expected_base_keys = sets.Set(
89 missing_base_keys = sets.Set(expected_base_keys).difference(

Completed in 2060 milliseconds

123456789