HomeSort by relevance Sort by last modified time
    Searched refs:second (Results 451 - 475 of 5944) sorted by null

<<11121314151617181920>>

  /external/chromium_org/cc/layers/
delegated_frame_resource_collection.cc 49 DCHECK_GE(it->second.refs_to_wait_for, 1);
53 returned.count = it->second.refs_to_return;
89 DCHECK_GE(it->second.refs_to_wait_for, returned[i].count);
90 it->second.refs_to_wait_for -= returned[i].count;
91 if (it->second.refs_to_wait_for == 0) {
93 to_return.back().count = it->second.refs_to_return;
  /external/chromium_org/chrome/browser/sync_file_system/
subtree_set.cc 43 return !found->second.contained_as_subtree_root;
78 !found->second.contained_as_subtree_root)
81 DCHECK_EQ(1u, found->second.number_of_subtrees_below);
96 DCHECK(!found->second.contained_as_subtree_root);
97 if (!--(found->second.number_of_subtrees_below))
109 return found->second.number_of_subtrees_below;
  /external/chromium_org/components/keyed_service/content/
browser_context_keyed_service_factory.cc 72 return it->second;
85 if (jt->second) {
88 service = jt->second(context);
109 delete it->second;
117 if (it != mapping_.end() && it->second)
118 it->second->Shutdown();
126 // maintain a big map of dead pointers, but also since we may have a second
  /external/chromium_org/device/nfc/
nfc_adapter.cc 25 peer_list->push_back(iter->second);
33 tag_list->push_back(iter->second);
40 return iter->second;
47 return iter->second;
73 NfcTag* tag = iter->second;
84 NfcPeer* peer = iter->second;
  /external/chromium_org/gpu/command_buffer/service/
mailbox_manager.cc 32 return it->second->first;
54 if (it->second->first == texture)
56 TextureToMailboxMap::iterator texture_it = it->second;
76 it != range.second; ++it) {
77 size_t count = mailbox_to_textures_.erase(it->second);
80 textures_to_mailboxes_.erase(range.first, range.second);
  /external/chromium_org/ppapi/proxy/
plugin_var_tracker.cc 72 VarInfo& info = GetLiveVar(ret)->second;
98 VarInfo& info = GetLiveVar(ret)->second;
114 DCHECK(found->second.track_with_no_reference_count > 0);
115 found->second.track_with_no_reference_count--;
149 ProxyObjectVar* object = found->second.var->AsProxyObjectVar();
169 ReleaseVar(found->second);
268 if (i->second.instance == instance)
278 if (!found->second.plugin_object_id) {
281 CallWhileUnlocked(found->second.ppp_class->Deallocate, found->first);
289 found->second.instance = 0
    [all...]
  /external/chromium_org/sync/syncable/
parent_child_index.cc 63 children = i->second;
69 return children->insert(entry).second;
80 OrderedChildSet* children = parent->second;
98 const OrderedChildSet* children = parent->second;
110 DCHECK(!parent->second->empty());
111 return parent->second;
  /external/chromium_org/webkit/common/blob/
shareable_file_reference.cc 66 (found == g_file_map.Get().End()) ? NULL : found->second;
91 if (result.second == false) {
93 return scoped_refptr<ShareableFileReference>(result.first->second);
99 result.first->second = reference.get();
111 DCHECK(g_file_map.Get().Find(path())->second == NULL);
115 DCHECK(g_file_map.Get().Find(path())->second == this);
  /external/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/
emplace_hint.pass.cpp 41 assert(r->second == Emplaceable());
46 assert(r->second == Emplaceable(5, 6));
52 assert(r->second == Emplaceable(6, 7));
65 assert(r->second == Emplaceable());
70 assert(r->second == Emplaceable(5, 6));
76 assert(r->second == Emplaceable(6, 7));
  /external/libcxx/test/containers/unord/unord.multimap/
local_iterators.fail.cpp 54 assert(i->second == "one");
57 assert(i->second == "four");
65 assert(i->second == "two");
68 assert(i->second == "four");
75 assert(i->second == "three");
82 assert(i->second == "four");
119 assert(i->second == "one");
122 assert(i->second == "four");
129 assert(i->second == "two");
132 assert(i->second == "four")
    [all...]
  /external/stlport/test/unit/
hash_test.cpp 95 CPPUNIT_ASSERT(p.second);
98 CPPUNIT_ASSERT(!p.second);
129 CPPUNIT_ASSERT((*i).second==10);
132 CPPUNIT_ASSERT((*i).second==20);
135 CPPUNIT_ASSERT((*i).second==32);
210 for ( hashType::iterator j = range.first; j != range.second; ++j ) {
211 collection.insert( j->second );
232 for (hashType::iterator h = range.first; h != range.second; h++) {
234 cerr << h->second << ", "; // print all data for that key in Hash-Table
239 cout << mIter->second << ", " ; // print all data for that key in Ma
    [all...]
mismatch_test.cpp 45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
60 CPPUNIT_ASSERT(result.first == v1.end() && result.second == v2.end());
64 CPPUNIT_ASSERT(!(result.first == v1.end() && result.second == v2.end()));
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/
emplace_hint.pass.cpp 41 assert(r->second == Emplaceable());
46 assert(r->second == Emplaceable(5, 6));
52 assert(r->second == Emplaceable(6, 7));
65 assert(r->second == Emplaceable());
70 assert(r->second == Emplaceable(5, 6));
76 assert(r->second == Emplaceable(6, 7));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/
local_iterators.fail.cpp 54 assert(i->second == "one");
57 assert(i->second == "four");
65 assert(i->second == "two");
68 assert(i->second == "four");
75 assert(i->second == "three");
82 assert(i->second == "four");
119 assert(i->second == "one");
122 assert(i->second == "four");
129 assert(i->second == "two");
132 assert(i->second == "four")
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
hash_test.cpp 95 CPPUNIT_ASSERT(p.second);
98 CPPUNIT_ASSERT(!p.second);
129 CPPUNIT_ASSERT((*i).second==10);
132 CPPUNIT_ASSERT((*i).second==20);
135 CPPUNIT_ASSERT((*i).second==32);
210 for ( hashType::iterator j = range.first; j != range.second; ++j ) {
211 collection.insert( j->second );
232 for (hashType::iterator h = range.first; h != range.second; h++) {
234 cerr << h->second << ", "; // print all data for that key in Hash-Table
239 cout << mIter->second << ", " ; // print all data for that key in Ma
    [all...]
mismatch_test.cpp 45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
60 CPPUNIT_ASSERT(result.first == v1.end() && result.second == v2.end());
64 CPPUNIT_ASSERT(!(result.first == v1.end() && result.second == v2.end()));
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size));
  /ndk/tests/device/test-stlport/unit/
hash_test.cpp 95 CPPUNIT_ASSERT(p.second);
98 CPPUNIT_ASSERT(!p.second);
129 CPPUNIT_ASSERT((*i).second==10);
132 CPPUNIT_ASSERT((*i).second==20);
135 CPPUNIT_ASSERT((*i).second==32);
210 for ( hashType::iterator j = range.first; j != range.second; ++j ) {
211 collection.insert( j->second );
232 for (hashType::iterator h = range.first; h != range.second; h++) {
234 cerr << h->second << ", "; // print all data for that key in Hash-Table
239 cout << mIter->second << ", " ; // print all data for that key in Ma
    [all...]
mismatch_test.cpp 45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
60 CPPUNIT_ASSERT(result.first == v1.end() && result.second == v2.end());
64 CPPUNIT_ASSERT(!(result.first == v1.end() && result.second == v2.end()));
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
80 CPPUNIT_ASSERT(!(result.first == n2 + size && result.second == n2 + size));
  /external/chromium_org/third_party/libaddressinput/chromium/cpp/src/
ruleset.cc 55 AddressFieldTries* address_field_tries = lang_it->second;
62 IdentityFieldTries* identity_field_tries = address_field_it->second;
70 Trie<const Ruleset*>* trie = identity_field_it->second;
100 return it != sub_regions_.end() ? it->second : NULL;
107 return it != language_codes_.end() ? *it->second : *rule_;
129 AddressFieldTries* address_field_tries = lang_it->second;
141 IdentityFieldTries* identity_field_tries = address_field_it->second;
168 ? lang_it->second : tries_.find("")->second;
175 IdentityFieldTries* identity_field_tries = address_field_it->second;
    [all...]
  /external/chromium_org/chrome/browser/extensions/api/web_navigation/
frame_navigation_state.cc 72 frame_state->second.error_occurred) {
75 return IsValidUrl(frame_state->second.url);
134 if (frame->second.parent_frame_num != frame_id.frame_num)
165 frame_state->second.url = url;
181 if (frame_state->second.is_iframe_srcdoc)
183 return frame_state->second.url;
190 frame_state->second.is_main_frame);
205 return FrameID(frame_state->second.parent_frame_num,
218 frame_state->second.error_occurred);
230 !frame_state->second.is_navigating)
    [all...]
  /external/chromium_org/components/policy/core/common/
policy_service_impl.cc 111 it->second->RemoveObserver(observer);
112 if (!it->second->might_have_observers()) {
113 delete it->second;
176 *iterator->second,
205 NotifyNamespaceUpdated(it_new->first, kEmpty, *it_new->second);
209 NotifyNamespaceUpdated(it_old->first, *it_old->second, kEmpty);
212 if (!it_new->second->Equals(*it_old->second)) {
214 NotifyNamespaceUpdated(it_new->first, *it_old->second, *it_new->second);
    [all...]
  /external/chromium_org/third_party/icu/source/common/
filterednormalizer2.cpp 86 const UnicodeString &second,
88 return normalizeSecondAndAppend(first, second, TRUE, errorCode);
93 const UnicodeString &second,
95 return normalizeSecondAndAppend(first, second, FALSE, errorCode);
100 const UnicodeString &second,
104 uprv_checkCanGetBuffer(second, errorCode);
108 if(&first==&second) {
114 return normalize(second, first, errorCode);
116 return first=second;
119 // merge the in-filter suffix of the first string with the in-filter prefix of the second
    [all...]
  /external/icu/icu4c/source/common/
filterednormalizer2.cpp 88 const UnicodeString &second,
90 return normalizeSecondAndAppend(first, second, TRUE, errorCode);
95 const UnicodeString &second,
97 return normalizeSecondAndAppend(first, second, FALSE, errorCode);
102 const UnicodeString &second,
106 uprv_checkCanGetBuffer(second, errorCode);
110 if(&first==&second) {
116 return normalize(second, first, errorCode);
118 return first=second;
121 // merge the in-filter suffix of the first string with the in-filter prefix of the second
    [all...]
  /external/stlport/stlport/stl/
_pair.h 56 _T2 second; member in struct:pair
60 pair() : first(_T1()), second(_T2()) {}
62 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
66 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
68 pair(const pair<_T1,_T2>& __o) : first(__o.first), second(__o.second) {}
73 second(_STLP_PRIV _AsMoveSource(src.get().second))
82 { return __x.first == __y.first && __x.second == __y.second;
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_pair.h 56 _T2 second; member in struct:pair
60 pair() : first(_T1()), second(_T2()) {}
62 pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) {}
66 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {}
68 pair(const pair<_T1,_T2>& __o) : first(__o.first), second(__o.second) {}
73 second(_STLP_PRIV _AsMoveSource(src.get().second))
82 { return __x.first == __y.first && __x.second == __y.second;
    [all...]

Completed in 1612 milliseconds

<<11121314151617181920>>