Searched defs:set2 (Results 1 - 18 of 18) sorted by relevance

/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/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/icu4c/test/intltest/
H A Ducdtest.cpp352 UnicodeSet set1, set2; local
358 set2.add(start);
362 if (set1!=set2) {
367 //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/jmonkeyengine/engine/src/core/com/jme3/math/
H A DTriangle.java154 public void set2(Vector3f v) { method in class:Triangle
/external/stlport/test/unit/
H A Dset_test.cpp21 CPPUNIT_TEST(set2);
38 void set2();
68 void SetTest::set2() function in class:SetTest
/external/valgrind/main/none/tests/ppc32/
H A Dpower5+_round.c92 double set2[] = { 0.9, 0.1, -0.1, -0.9, 1e-40, -1e-40 }; local
125 DO_TEST(frin, set2, frin2, frin2rf);
127 DO_TEST(friz, set2, friz2, friz2rf);
129 DO_TEST(frip, set2, frip2, frip2rf);
131 DO_TEST(frim, set2, frim2, frim2rf);
144 double set2[] = local
162 DO_TEST(frsp, set2, frsp2, fprf2);
/external/chromium/chrome/browser/sync/sessions/
H A Dsession_state.cc239 vector<syncable::Id>* set2 = id_to_conflict_set_[id2]; local
241 if (0 == set1 && 0 == set2) {
253 rv = set2;
255 } else if (0 == set2) {
259 } else if (set1 == set2) {
267 for (i = set2->begin() ; i != set2->end() ; ++i) {
271 rv->insert(rv->end(), set2->begin(), set2->end());
272 conflict_sets_.erase(set2);
[all...]
/external/icu4c/test/cintltst/
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...]
H A Dcucdtst.c2887 USet *set1, *set2, *set3, *set4; local
2936 set2=uset_openPattern(dashPattern, 8, &errorCode);
2941 showAMinusB(set1, set2, "[:Hyphen:]", "[:Dash:]", FALSE);
2951 showAIntersectB(set3, set2, "[:Cf:]", "[:Dash:]", TRUE);
2958 uset_close(set2);
3007 set2=uset_openPattern(mathPattern, 8, &errorCode);
3010 uset_retainAll(set2, set1); /* [math blocks]&[:Math:] */
3013 compareUSets(set1, set2,
3020 uset_close(set2);
3026 set2
[all...]
/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/icu4c/common/
H A Duset.cpp184 uset_containsAll(const USet* set1, const USet* set2) { argument
185 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2);
196 uset_containsNone(const USet* set1, const USet* set2) { argument
197 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2);
201 uset_containsSome(const USet* set1, const USet* set2) { argument
202 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2);
226 uset_equals(const USet* set1, const USet* set2) { argument
227 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
/external/webkit/Source/WebKit/gtk/tests/
H A Dtestatk.c942 static gboolean atkAttributeSetAreEqual(AtkAttributeSet* set1, AtkAttributeSet* set2) argument
945 return !set2;
948 set2 = g_slist_sort(set2, (GCompareFunc)compAtkAttribute);
951 if (!set2 || compAtkAttribute(set1->data, set2->data))
955 set2 = set2->next;
958 return (!set2);
986 AtkAttributeSet* set2 local
1371 AtkAttributeSet* set2 = atk_object_get_attributes(table2); local
[all...]
/external/valgrind/main/callgrind/
H A Dsim.c280 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local
284 if (set1 == set2)
289 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
294 CacheResult res2 = cachesim_setref(c, set2, tag2);
298 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
384 UInt set2 = ((a+size-1) >> c->line_size_bits) & (c->sets_min_1); local
388 if (set1 == set2)
393 else if (((set1 + 1) & (c->sets_min_1)) == set2) {
398 CacheResult res2 = cachesim_setref_wb(c, ref, set2, tag2);
404 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
[all...]
/external/valgrind/tsan/
H A Dthread_sanitizer.cc925 const LSSet &set2 = Get(lsid2); local
926 return set2.has(LID(lsid1.raw())) == false;
949 const LSSet &set2 = Get(lsid2); local
951 FixedArray<LID> intersection(min(set1.size(), set2.size()));
953 set2.begin(), set2.end(),
/external/libxml2/
H A Dxpath.c3872 * @set2: the second NodeSet
3873 * @hasSet2NsNodes: 1 if set2 contains namespaces nodes
3875 * Merges two nodesets, all nodes from @set2 are added to @set1
3876 * if @set1 is NULL, a new set is created and copied from @set2.
3877 * Checks for duplicate nodes. Clears set2.
3882 xmlXPathNodeSetMergeAndClear(xmlNodeSetPtr set1, xmlNodeSetPtr set2, argument
3888 * just assigned to set1, since set2 is cleared anyway.
3890 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
3893 if (set2->nodeNr != 0) {
3894 memcpy(set1->nodeTab, set2
3991 xmlXPathNodeSetMergeAndClearNoDupls(xmlNodeSetPtr set1, xmlNodeSetPtr set2, int hasNullEntries) argument
[all...]

Completed in 514 milliseconds