HomeSort by relevance Sort by last modified time
    Searched refs:set1 (Results 1 - 25 of 40) sorted by null

1 2

  /external/stlport/test/eh/
test.cpp 18 std::set<int> set1, set2; local
24 set1.insert(aVector.begin(), aVector.end());
30 printElements(set1, "set1 : ");
  /packages/apps/Gallery2/tests/src/com/android/gallery3d/data/
MediaSetTest.java 47 MockSet set1 = new MockSet(Path.fromString("/mock/1"), dataManager, 8, 8000); local
48 set1.addMediaSet(set10);
49 set1.addMediaSet(set11);
50 set1.addMediaSet(set12);
  /packages/apps/Gallery2/src/com/android/gallery3d/util/
MediaSetUtils.java 50 public int compare(MediaSet set1, MediaSet set2) {
51 int result = set1.getName().compareToIgnoreCase(set2.getName());
53 return set1.getPath().toString().compareTo(set2.getPath().toString());
  /external/valgrind/main/cachegrind/
cg_sim.c 101 UInt set1 = ( a >> L.line_size_bits) & (L.sets_min_1); \
110 if (set1 == set2) { \
112 set = &(L.tags[set1 * L.assoc]); \
141 /* Nb: this is a fast way of doing ((set1+1) % L.sets) */ \
142 } else if (((set1 + 1) & (L.sets-1)) == set2) { \
143 set = &(L.tags[set1 * L.assoc]); \
185 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);\
  /external/guava/src/com/google/common/collect/
Sets.java 537 * {@code set1}, then over each element of {@code set2}, in order, that is not
538 * contained in {@code set1}.
540 * <p>Results are undefined if {@code set1} and {@code set2} are sets based on
544 * <p><b>Note:</b> The returned view performs better when {@code set1} is the
549 final Set<? extends E> set1, final Set<? extends E> set2) {
550 checkNotNull(set1, "set1");
556 final Set<? extends E> set2minus1 = difference(set2, set1);
560 return set1.size() + set2minus1.size();
563 return set1.isEmpty() && set2.isEmpty()
    [all...]
  /external/chromium/chrome/browser/sync/sessions/
session_state.cc 238 vector<syncable::Id>* set1 = id_to_conflict_set_[id1]; local
241 if (0 == set1 && 0 == set2) {
251 } else if (0 == set1) {
257 rv = set1;
259 } else if (set1 == set2) {
264 rv = set1;
  /external/webkit/Source/WebKit/gtk/tests/
testatk.c 981 AtkAttributeSet* set1 = atk_text_get_run_attributes(childText, 0, &startOffset, &endOffset); local
1362 AtkAttributeSet* set1 = atk_object_get_attributes(table1); local
    [all...]
  /external/valgrind/main/coregrind/
pub_core_libcsignal.h 51 extern Bool VG_(iseqsigset) ( const vki_sigset_t* set1,
m_libcsignal.c 92 Bool VG_(iseqsigset)( const vki_sigset_t* set1, const vki_sigset_t* set2 )
95 vg_assert(set1 != NULL && set2 != NULL);
97 if (set1->sig[i] != set2->sig[i]) return False;
  /external/webkit/Source/JavaScriptCore/icu/unicode/
uset.h 585 * Returns true if set1 contains all the characters and strings
586 * of set2. It answers the question, 'Is set1 a subset of set2?'
587 * @param set1 set to be checked for containment
593 uset_containsAll(const USet* set1, const USet* set2);
596 * Returns true if set1 contains none of the characters and strings
597 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
598 * @param set1 set to be checked for containment
604 uset_containsNone(const USet* set1, const USet* set2);
607 * Returns true if set1 contains some of the characters and strings
608 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
    [all...]
  /external/webkit/Source/WebCore/icu/unicode/
uset.h 585 * Returns true if set1 contains all the characters and strings
586 * of set2. It answers the question, 'Is set1 a subset of set2?'
587 * @param set1 set to be checked for containment
593 uset_containsAll(const USet* set1, const USet* set2);
596 * Returns true if set1 contains none of the characters and strings
597 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
598 * @param set1 set to be checked for containment
604 uset_containsNone(const USet* set1, const USet* set2);
607 * Returns true if set1 contains some of the characters and strings
608 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
    [all...]
  /external/icu4c/common/
uset.cpp 184 uset_containsAll(const USet* set1, const USet* set2) {
185 return ((const UnicodeSet*) set1)->UnicodeSet::containsAll(* (const UnicodeSet*) set2);
196 uset_containsNone(const USet* set1, const USet* set2) {
197 return ((const UnicodeSet*) set1)->UnicodeSet::containsNone(* (const UnicodeSet*) set2);
201 uset_containsSome(const USet* set1, const USet* set2) {
202 return ((const UnicodeSet*) set1)->UnicodeSet::containsSome(* (const UnicodeSet*) set2);
226 uset_equals(const USet* set1, const USet* set2) {
227 return *(const UnicodeSet*)set1 == *(const UnicodeSet*)set2;
  /packages/apps/Browser/src/com/android/browser/
PhoneUi.java 354 AnimatorSet set1 = new AnimatorSet(); local
374 set1.addListener(new AnimatorListenerAdapter() {
382 set1.playSequentially(inanim, blend1);
383 set1.start();
446 AnimatorSet set1 = new AnimatorSet(); local
449 set1.playTogether(fade1, fade2);
450 set1.setDuration(100);
467 combo.playSequentially(set1, set2, otheralpha);
NavTabScroller.java 313 AnimatorSet set1 = new AnimatorSet(); local
314 set1.playTogether(trans, alpha);
315 set1.setDuration(duration);
335 mAnimator.playSequentially(set1, set2);
338 mAnimator.playSequentially(set1, scroll1);
343 mAnimator.playSequentially(set1, trans2);
  /dalvik/vm/
Ddm.cpp 380 set1(buf+0, kHeaderLen);
381 set1(buf+1, kBytesPerEntry);
401 set1(buf+4, thread->status);
405 set1(buf+17, isDaemon);
AllocTracker.cpp 381 set1(&ptr[0], kMessageHeaderLen);
382 set1(&ptr[1], kEntryHeaderLen);
383 set1(&ptr[2], kStackFrameLen);
408 set1(&ptr[8], depth);
  /external/icu4c/common/unicode/
uset.h 861 * Returns true if set1 contains all the characters and strings
862 * of set2. It answers the question, 'Is set1 a superset of set2?'
863 * @param set1 set to be checked for containment
869 uset_containsAll(const USet* set1, const USet* set2);
885 * Returns true if set1 contains none of the characters and strings
886 * of set2. It answers the question, 'Is set1 a disjoint set of set2?'
887 * @param set1 set to be checked for containment
893 uset_containsNone(const USet* set1, const USet* set2);
896 * Returns true if set1 contains some of the characters and strings
897 * of set2. It answers the question, 'Does set1 and set2 have an intersection?
    [all...]
  /external/valgrind/main/callgrind/
sim.c 279 UInt set1 = ( a >> c->line_size_bits) & (c->sets_min_1); local
284 if (set1 == set2)
285 return cachesim_setref(c, set1, tag);
288 /* Nb: this is a fast way of doing ((set1+1) % c->sets) */
289 else if (((set1 + 1) & (c->sets-1)) == set2) {
293 CacheResult res1 = cachesim_setref(c, set1, tag);
298 VG_(printf)("addr: %lx size: %u sets: %d %d", a, size, set1, set2);
383 UInt set1 = ( a >> c->line_size_bits) & (c->sets_min_1); local
388 if (set1 == set2)
389 return cachesim_setref_wb(c, ref, set1, tag)
    [all...]
  /external/icu4c/test/intltest/
ucdtest.cpp 349 UnicodeSet set1, set2; local
350 if (nfcImpl->getCanonStartSet(0x49, set1)) {
359 if (set1!=set2) {
364 //compareUSets(set1, set2,
trnserr.cpp 181 UnicodeSet *set1 = new UnicodeSet(badPattern, status); local
185 delete set1;
  /external/chromium/testing/gtest/test/
gtest-printers_test.cc 823 hash_set<string> set1; local
824 set1.insert("hello");
825 EXPECT_EQ("{ \"hello\" }", Print(set1));
831 hash_multiset<int> set1(a, a + kSize);
834 const string result = Print(set1);
886 set<unsigned int> set1(a, a + 3);
887 EXPECT_EQ("{ 0, 3, 5 }", Print(set1));
892 multiset<int> set1(a, a + 5);
893 EXPECT_EQ("{ 1, 1, 1, 2, 5 }", Print(set1));
    [all...]
  /external/valgrind/main/none/tests/ppc32/
power5+_round.c 136 double set1[] = { inf, 0.9, 0.1, 0, neg0, -0.1, -0.9, -inf, nan }; local
161 DO_TEST(frsp, set1, frsp1, fprf1);
  /dalvik/vm/jdwp/
JdwpEvent.cpp 727 set1(buf+8, 0); /* flags */
728 set1(buf+9, kJdwpEventCommandSet);
729 set1(buf+10, kJdwpCompositeCommand);
    [all...]
  /external/libxml2/
xpath.c     [all...]
  /external/stlport/test/unit/
set_test.cpp 20 CPPUNIT_TEST(set1);
37 void set1();
56 void SetTest::set1() function in class:SetTest

Completed in 896 milliseconds

1 2