/ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
range_size_hash_equal.pass.cpp | 58 assert(std::distance(eq.first, eq.second) == 2); 61 assert(i->second == "one"); 64 assert(i->second == "four"); 66 assert(std::distance(eq.first, eq.second) == 2); 69 assert(i->second == "two"); 72 assert(i->second == "four"); 75 assert(std::distance(eq.first, eq.second) == 1); 78 assert(i->second == "three"); 80 assert(std::distance(eq.first, eq.second) == 1); 83 assert(i->second == "four") [all...] |
range_size_hash_equal_allocator.pass.cpp | 60 assert(std::distance(eq.first, eq.second) == 2); 63 assert(i->second == "one"); 66 assert(i->second == "four"); 68 assert(std::distance(eq.first, eq.second) == 2); 71 assert(i->second == "two"); 74 assert(i->second == "four"); 77 assert(std::distance(eq.first, eq.second) == 1); 80 assert(i->second == "three"); 82 assert(std::distance(eq.first, eq.second) == 1); 85 assert(i->second == "four") [all...] |
move_alloc.pass.cpp | 60 assert(std::distance(eq.first, eq.second) == 2); 63 assert(i->second == "one"); 66 assert(i->second == "four"); 68 assert(std::distance(eq.first, eq.second) == 2); 71 assert(i->second == "two"); 74 assert(i->second == "four"); 77 assert(std::distance(eq.first, eq.second) == 1); 80 assert(i->second == "three"); 82 assert(std::distance(eq.first, eq.second) == 1); 85 assert(i->second == "four") [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/re/re.alg/re.alg.match/ |
extended.pass.cpp | 34 assert(m.prefix().second == m[0].first); 36 assert(m.suffix().first == m[0].second); 37 assert(m.suffix().second == s+1); 49 assert(m.prefix().second == m[0].first); 51 assert(m.suffix().first == m[0].second); 52 assert(m.suffix().second == s+2); 90 assert(m.prefix().second == m[0].first); 92 assert(m.suffix().first == m[0].second); 93 assert(m.suffix().second == s+4); 105 assert(m.prefix().second == m[0].first) [all...] |
basic.pass.cpp | 40 assert(m.prefix().second == m[0].first); 42 assert(m.suffix().first == m[0].second); 43 assert(m.suffix().second == s+1); 55 assert(m.prefix().second == m[0].first); 57 assert(m.suffix().first == m[0].second); 58 assert(m.suffix().second == s+2); 96 assert(m.prefix().second == m[0].first); 98 assert(m.suffix().first == m[0].second); 99 assert(m.suffix().second == s+4); 111 assert(m.prefix().second == m[0].first) [all...] |
ecma.pass.cpp | 34 assert(m.prefix().second == m[0].first); 36 assert(m.suffix().first == m[0].second); 37 assert(m.suffix().second == s+1); 49 assert(m.prefix().second == m[0].first); 51 assert(m.suffix().first == m[0].second); 52 assert(m.suffix().second == s+2); 90 assert(m.prefix().second == m[0].first); 92 assert(m.suffix().first == m[0].second); 93 assert(m.suffix().second == s+4); 105 assert(m.prefix().second == m[0].first) [all...] |
egrep.pass.cpp | 34 assert(m.prefix().second == m[0].first); 36 assert(m.suffix().first == m[0].second); 37 assert(m.suffix().second == s + std::char_traits<char>::length(s)); 57 assert(m.prefix().second == m[0].first); 59 assert(m.suffix().first == m[0].second); 60 assert(m.suffix().second == s + std::char_traits<char>::length(s)); 73 assert(m.prefix().second == m[0].first); 75 assert(m.suffix().first == m[0].second); 76 assert(m.suffix().second == s + std::char_traits<char>::length(s));
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/map/map.modifiers/ |
emplace.pass.cpp | 33 assert(r.second); 37 assert(m.begin()->second == DefaultOnly()); 40 assert(r.second); 44 assert(next(m.begin())->second == DefaultOnly()); 47 assert(!r.second); 51 assert(next(m.begin())->second == DefaultOnly()); 60 assert(r.second); 64 assert(m.begin()->second == Emplaceable()); 67 assert(r.second); 71 assert(m.begin()->second == Emplaceable(2, 3.5)) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.ops/ |
equal_range.pass.cpp | 41 assert(r.second == m.begin()); 44 assert(r.second == next(m.begin(), 3)); 47 assert(r.second == next(m.begin(), 3)); 50 assert(r.second == next(m.begin(), 6)); 53 assert(r.second == next(m.begin(), 6)); 56 assert(r.second == next(m.begin(), 9)); 59 assert(r.second == m.end()); 78 assert(r.second == m.begin()); 81 assert(r.second == next(m.begin(), 3)); 84 assert(r.second == next(m.begin(), 3)) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multiset/ |
equal_range.pass.cpp | 41 assert(r.second == next(m.begin(), 0)); 44 assert(r.second == next(m.begin(), 3)); 47 assert(r.second == next(m.begin(), 3)); 50 assert(r.second == next(m.begin(), 6)); 53 assert(r.second == next(m.begin(), 6)); 56 assert(r.second == next(m.begin(), 9)); 59 assert(r.second == next(m.begin(), 9)); 78 assert(r.second == next(m.begin(), 0)); 81 assert(r.second == next(m.begin(), 3)); 84 assert(r.second == next(m.begin(), 3)) [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
stl_pair.h | 70 typedef _T2 second_type; ///< @c second_type is the second bound type 73 _T2 second; ///< @c second is a copy of the second object member in struct:pair 77 /** The default constructor creates @c first and @c second using their 80 : first(), second() { } 84 : first(__a), second(__b) { } 90 second(std::forward<_U2>(__y)) { } 94 second(std::move(__p.second)) { } [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_pair.h | 70 typedef _T2 second_type; ///< @c second_type is the second bound type 73 _T2 second; ///< @c second is a copy of the second object member in struct:pair 77 /** The default constructor creates @c first and @c second using their 80 : first(), second() { } 84 : first(__a), second(__b) { } 90 second(std::forward<_U2>(__y)) { } 94 second(std::move(__p.second)) { } [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_pair.h | 70 typedef _T2 second_type; ///< @c second_type is the second bound type 73 _T2 second; ///< @c second is a copy of the second object member in struct:pair 77 /** The default constructor creates @c first and @c second using their 80 : first(), second() { } 84 : first(__a), second(__b) { } 90 second(std::forward<_U2>(__y)) { } 94 second(std::move(__p.second)) { } [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
stl_pair.h | 70 typedef _T2 second_type; ///< @c second_type is the second bound type 73 _T2 second; ///< @c second is a copy of the second object member in struct:pair 77 /** The default constructor creates @c first and @c second using their 80 : first(), second() { } 84 : first(__a), second(__b) { } 90 second(std::forward<_U2>(__y)) { } 94 second(std::move(__p.second)) { } [all...] |
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
FunctionSummary.h | 68 I->second->MayReachMaxBlockCount = true; 74 return I->second->MayReachMaxBlockCount; 80 llvm::BitVector &Blocks = I->second->VisitedBasicBlocks; 84 I->second->TotalBasicBlocks = TotalIDs; 92 return I->second->VisitedBasicBlocks.count(); 99 return I->second->TimesInlined; 105 I->second->TimesInlined++; 112 return ((I->second->VisitedBasicBlocks.count() * 100) / 113 I->second->TotalBasicBlocks);
|
/external/webkit/Source/WebCore/css/ |
CSSPrimitiveValueCache.cpp | 52 if (entry.second) 53 entry.first->second = CSSPrimitiveValue::createIdentifier(ident); 54 return entry.first->second; 75 if (entry.second) 76 entry.first->second = CSSPrimitiveValue::createColor(rgbValue); 77 return entry.first->second; 114 if (entry.second) 115 entry.first->second = CSSPrimitiveValue::create(value, type); 116 return entry.first->second;
|
/external/clang/test/Analysis/Inputs/ |
system-header-simulator-cxx.h | 12 T2 second; member in struct:std::pair 14 pair() : first(), second() {} 15 pair(const T1 &a, const T2 &b) : first(a), second(b) {} 18 pair(const pair<U1, U2> &other) : first(other.first), second(other.second) {}
|
/frameworks/base/libs/hwui/utils/ |
Pair.h | 26 S second; member in struct:android::uirenderer::Pair 29 Pair(const Pair& o) : first(o.first), second(o.second) { } 30 Pair(const F& f, const S& s) : first(f), second(s) { } 37 return second;
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/unord.multimap.modifiers/ |
emplace_hint.pass.cpp | 35 assert(r->second == Emplaceable()); 40 assert(r->second == Emplaceable(5, 6)); 47 assert(r->second == Emplaceable(6, 7)); 51 assert(r->second == Emplaceable()); 54 assert(r->second == Emplaceable(5, 6));
|
/frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
sparse_weight_vector.cpp | 41 if (isnanf(iter->second) || __isinff(iter->second)) 55 w_[iter->first] += ((multiplier * iter->second) / w1.normalizer_ 69 w_[iter->first] += ((multiplier * iter->second * iter->second) / 84 if(iter->second > 0.0) { 86 (sqrt(iter->second)) 103 w_[iter->first] += ((multiplier * iter->second) / w1.normalizer_ 127 iter->second *= w1.GetElement(iter->first); 143 iter->second *= w1.GetElement(iter->first) [all...] |
/external/openfst/src/script/ |
replace.cc | 28 if (!ArcTypesMatch(*tuples[i].second, *tuples[i+1].second, "Replace")) { 33 if (!ArcTypesMatch(*tuples[0].second, *ofst, "Replace")) return;
|
/external/stlport/test/unit/ |
pair_test.cpp | 31 CPPUNIT_ASSERT(p.second==10); 43 CPPUNIT_CHECK( PAIR_ARRAY[i].second == "0" ); 44 PAIR_ARRAY[i].second = "1";
|
/external/webkit/LayoutTests/fast/dom/HTMLFormElement/script-tests/ |
elements-not-in-document.js | 19 f.elements.second; 20 i.name = 'second'; 25 shouldBe("f.elements.second", "i"); 27 shouldBe("i.getAttribute('name')", "'second'"); 28 shouldBe("i.name", "'second'"); 35 shouldBe("f.elements.second", "i");
|
/external/webkit/Source/WebCore/bindings/js/ |
DOMObjectHashTableMap.h | 43 iter->second.deleteTable(); 50 return &iter->second; 51 return &m_map.set(staticTable, JSC::HashTable(*staticTable)).first->second;
|
/external/webkit/Source/WebKit2/WebProcess/InjectedBundle/DOM/ |
InjectedBundleRangeHandle.cpp | 50 if (!result.second) 51 return PassRefPtr<InjectedBundleRangeHandle>(result.first->second); 54 result.first->second = rangeHandle.get();
|