Searched defs:set2 (Results 1 - 25 of 52) sorted by last modified time

123

/external/valgrind/main/none/tests/ppc32/
H A Dpower5+_round.c89 double set2[] = { 0.9, 0.1, -0.1, -0.9, 1e-40, -1e-40 }; local
111 DO_TEST(frin, set2, frin2, frin2rf);
113 DO_TEST(friz, set2, friz2, friz2rf);
115 DO_TEST(frip, set2, frip2, frip2rf);
117 DO_TEST(frim, set2, frim2, frim2rf);
125 double set2[] = local
137 DO_TEST(frsp, set2, frsp2, fprf2);
/external/valgrind/main/cachegrind/
H A Dcg_sim.c148 UInt set2 = block2 & c->sets_min_1; local
153 cachesim_setref_is_miss(c, set2, tag2);
156 return cachesim_setref_is_miss(c, set2, tag2);
/external/valgrind/main/callgrind/
H A Dsim.c299 UInt set2 = block2 & c->sets_min_1; local
304 CacheResult res2 = cachesim_setref(c, set2, tag2);
396 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local
400 if (set1 == set2)
405 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
410 CacheResult res2 = cachesim_setref_wb(c, ref, set2, tag2);
416 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
690 UInt set2 = ((a+size-1) >> L.line_size_bits) & (L.sets_min_1); \
698 L.name, a, size, set1, set2); \
701 if (set1 == set2) { \
[all...]
/external/stlport/test/eh/
H A Dtest.cpp18 std::set<int> set1, set2; local
26 set2.insert(1);
27 set2.insert(1);
31 printElements(set2, "set2 : ");
/external/stlport/test/unit/
H A Dset_test.cpp21 CPPUNIT_TEST(set2);
38 void set2();
68 void SetTest::set2() function in class:SetTest
/external/skia/tests/
H A DGrOrderedSetTest.cpp126 Set2 set2; local
128 set2.insert("ape");
129 set2.insert(char1);
130 set2.insert(char2);
131 set2.insert(char3);
132 set2.insert("ant");
133 set2.insert("cat");
135 REPORTER_ASSERT(reporter, set2.count() == 4);
136 REPORTER_ASSERT(reporter, set2.find("dog") == set2
[all...]
H A DTSetTest.cpp81 SkTSet<int> set2; local
82 set2 = set0;
84 REPORTER_ASSERT(reporter, set0.count() == set2.count());
85 REPORTER_ASSERT(reporter, !set2.contains(-1000));
88 REPORTER_ASSERT(reporter, set2.contains(f(i)));
89 REPORTER_ASSERT(reporter, set2[i] == f(i));
95 set2.validate();
/external/smali/util/src/main/java/org/jf/util/
H A DCollectionUtils.java193 @Nonnull Collection<? extends T> set2) {
194 int res = Ints.compare(set1.size(), set2.size());
198 SortedSet<? extends T> sortedSet2 = toNaturalSortedSet(set2);
200 Iterator<? extends T> elements2 = set2.iterator();
215 SortedSet<? extends T> set2 = toSortedSet(elementComparator, list2);
217 Iterator<? extends T> elements2 = set2.iterator();
192 compareAsSet(@onnull Collection<? extends T> set1, @Nonnull Collection<? extends T> set2) argument
/external/owasp/sanitizer/distrib/lib/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/owasp/sanitizer/lib/guava-libraries/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/pcre/dist/
H A Dpcre_compile.c3080 const pcre_uint8 *set1, *set2, *set_end; local
3233 set2 = (pcre_uint8 *)
3248 set2 = (pcre_uint8 *)(xclass_flags + 1);
3256 set2 = (pcre_uint8 *)(cd->cbits + cbit_digit);
3263 set2 = (pcre_uint8 *)(cd->cbits + cbit_space);
3270 set2 = (pcre_uint8 *)(cd->cbits + cbit_word);
3284 if ((*set1++ & ~(*set2++)) != 0) return FALSE;
3292 if ((*set1++ & *set2++) != 0) return FALSE;
/external/libxml2/
H A Dxpath.c3924 * @set2: the second NodeSet
3925 * @hasSet2NsNodes: 1 if set2 contains namespaces nodes
3927 * Merges two nodesets, all nodes from @set2 are added to @set1
3928 * if @set1 is NULL, a new set is created and copied from @set2.
3929 * Checks for duplicate nodes. Clears set2.
3934 xmlXPathNodeSetMergeAndClear(xmlNodeSetPtr set1, xmlNodeSetPtr set2, argument
3940 * just assigned to set1, since set2 is cleared anyway.
3942 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
3945 if (set2->nodeNr != 0) {
3946 memcpy(set1->nodeTab, set2
4047 xmlXPathNodeSetMergeAndClearNoDupls(xmlNodeSetPtr set1, xmlNodeSetPtr set2, int hasNullEntries) argument
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dcucdtst.c3056 USet *set1, *set2, *set3, *set4; local
3105 set2=uset_openPattern(dashPattern, 8, &errorCode);
3110 showAMinusB(set1, set2, "[:Hyphen:]", "[:Dash:]", FALSE);
3120 showAIntersectB(set3, set2, "[:Cf:]", "[:Dash:]", TRUE);
3127 uset_close(set2);
3176 set2=uset_openPattern(mathPattern, 8, &errorCode);
3179 uset_retainAll(set2, set1); /* [math blocks]&[:Math:] */
3182 compareUSets(set1, set2,
3189 uset_close(set2);
3195 set2
[all...]
H A Dusettest.c83 USet* set2; local
179 set2 = uset_open(1, 1);
180 uset_clear(set2);
183 uset_applyPropertyAlias(set2, PAT_lb, PAT_lb_LEN, VAL_SP, VAL_SP_LEN, &ec);
184 expect(set2, " ", "abcdefghi{bc}", NULL);
187 uset_set(set2, 0x0061, 0x0063);
192 if (uset_containsSome(set, set2)) {
193 log_err("set should not contain some of set2 yet\n");
195 uset_complementAll(set, set2);
196 if (!uset_containsSome(set, set2)) {
[all...]
/external/icu/icu4c/source/test/intltest/
H A Ducdtest.cpp355 UnicodeSet set1, set2; local
361 set2.add(start);
365 if (set1!=set2) {
370 //compareUSets(set1, set2,
H A Dusettest.cpp319 // set1 and set2 used to be built with the obsolete constructor taking
328 UnicodeSet *set2=new UnicodeSet(UNICODE_STRING_SIMPLE("\\p{Decimal Number}"), status); //Number, Decimal digit local
338 if (*set2 != *set2a) {
346 if(*set1 != *set1copy || *set1 == *set2 ||
355 UnicodeSet set2equal=*set2;
356 if(set1equal != *set1 || set1equal != *set1copy || set2equal != *set2 ||
363 UnicodeSet *set2clone=(UnicodeSet*)set2->clone();
365 *set2clone != *set2 || *set2clone == *set1copy || *set2clone != set2equal ||
372 set2->hashCode() != set2equal.hashCode() || set2
439 UnicodeSet set2; local
[all...]
/external/icu/icu4c/source/common/
H A Duset.cpp179 uset_containsAll(const USet* set1, const USet* set2) { argument
180 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2);
191 uset_containsNone(const USet* set1, const USet* set2) { argument
192 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2);
196 uset_containsSome(const USet* set1, const USet* set2) { argument
197 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2);
221 uset_equals(const USet* set1, const USet* set2) { argument
222 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
/external/guava/guava/src/com/google/common/collect/
H A DSets.java571 * {@code set1}, then over each element of {@code set2}, in order, that is not
574 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
583 final Set<? extends E> set1, final Set<? extends E> set2) {
585 checkNotNull(set2, "set2");
587 final Set<? extends E> set2minus1 = difference(set2, set1);
594 return set1.isEmpty() && set2.isEmpty();
601 return set1.contains(object) || set2.contains(object);
605 set.addAll(set2);
610 .addAll(set1).addAll(set2)
582 union( final Set<? extends E> set1, final Set<? extends E> set2) argument
641 intersection( final Set<E> set1, final Set<?> set2) argument
678 difference( final Set<E> set1, final Set<?> set2) argument
712 symmetricDifference( Set<? extends E> set1, Set<? extends E> set2) argument
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DSets.java559 * {@code set1}, then over each element of {@code set2}, in order, that is not
562 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
571 final Set<? extends E> set1, final Set<? extends E> set2) {
573 checkNotNull(set2, "set2");
575 final Set<? extends E> set2minus1 = difference(set2, set1);
582 return set1.isEmpty() && set2.isEmpty();
589 return set1.contains(object) || set2.contains(object);
593 set.addAll(set2);
598 .addAll(set1).addAll(set2)
570 union( final Set<? extends E> set1, final Set<? extends E> set2) argument
629 intersection( final Set<E> set1, final Set<?> set2) argument
666 difference( final Set<E> set1, final Set<?> set2) argument
700 symmetricDifference( Set<? extends E> set1, Set<? extends E> set2) argument
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
H A DFeatureUtil.java298 Set<? extends T> set1, Set<? extends T> set2) {
299 return intersection(new Set[] {set1, set2});
297 intersection( Set<? extends T> set1, Set<? extends T> set2) argument
/external/clang/test/Misc/
H A Ddiag-template-diffing.cpp71 void set2(I2<int, int>) {}; function
73 set2(I2<double, int, int>());
75 // CHECK-ELIDE-NOTREE: no matching function for call to 'set2'
77 // CHECK-NOELIDE-NOTREE: no matching function for call to 'set2'
79 // CHECK-ELIDE-TREE: no matching function for call to 'set2'
85 // CHECK-NOELIDE-TREE: no matching function for call to 'set2'
/external/chromium_org/v8/test/cctest/
H A Dtest-unique.cc268 UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) {
270 CHECK(set2->Equals(set2));
271 CHECK(expected == set1->Equals(set2));
272 CHECK(expected == set2->Equals(set1));
284 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
286 CHECK_SETS(set1, set2, true);
290 CHECK_SETS(set1, set2, false);
292 set2->Add(A, &zone);
294 CHECK_SETS(set1, set2, tru
267 CHECK_SETS( UniqueSet<T>* set1, UniqueSet<T>* set2, bool expected) argument
322 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
357 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
407 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
423 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
471 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
491 UniqueSet<String>* set2 = new(&zone) UniqueSet<String>(); local
539 UniqueSet<String>* set2 = MakeSet(&zone, j, elements); local
[all...]
/external/chromium_org/third_party/webrtc/modules/desktop_capture/
H A Ddesktop_region.cc227 const RowSpanSet& set2,
231 RowSpanSet::const_iterator it2 = set2.begin();
232 RowSpanSet::const_iterator end2 = set2.end();
226 IntersectRows(const RowSpanSet& set1, const RowSpanSet& set2, RowSpanSet* output) argument
/external/chromium_org/third_party/skia/tests/
H A DGrOrderedSetTest.cpp126 Set2 set2; local
128 set2.insert("ape");
129 set2.insert(char1);
130 set2.insert(char2);
131 set2.insert(char3);
132 set2.insert("ant");
133 set2.insert("cat");
135 REPORTER_ASSERT(reporter, set2.count() == 4);
136 REPORTER_ASSERT(reporter, set2.find("dog") == set2
[all...]
H A DTSetTest.cpp81 SkTSet<int> set2; local
82 set2 = set0;
84 REPORTER_ASSERT(reporter, set0.count() == set2.count());
85 REPORTER_ASSERT(reporter, !set2.contains(-1000));
88 REPORTER_ASSERT(reporter, set2.contains(f(i)));
89 REPORTER_ASSERT(reporter, set2[i] == f(i));
95 set2.validate();

Completed in 787 milliseconds

123