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

<<51525354555657585960>>

  /external/llvm/include/llvm/CodeGen/
SlotIndexes.h 183 /// is strictly lower than the second.
188 /// is lower than, or equal to, the second.
194 /// is greater than the second.
200 /// is greater than, or equal to, the second.
418 return itr->second;
452 return MapItr->second;
469 return MapItr->second;
497 return getMBBRange(Num).second;
502 return getMBBRange(mbb).second;
517 index < getMBBEndIdx(J->second) &
    [all...]
  /external/stlport/stlport/stl/
_tree.h 504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
598 return _STLP_STD::distance(__p.first, __p.second);
617 __p.second = lower_bound(__x);
618 if (__p.second._M_node != &this->_M_header._M_data &&
619 !_M_key_compare(__x, _S_key(__p.second._M_node))) {
620 __p.first = __p.second++;
623 __p.first = __p.second;
630 __p.second = lower_bound(__x);
631 if (__p.second._M_node != &this->_M_header._M_data &
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_tree.h 504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
598 return _STLP_STD::distance(__p.first, __p.second);
617 __p.second = lower_bound(__x);
618 if (__p.second._M_node != &this->_M_header._M_data &&
619 !_M_key_compare(__x, _S_key(__p.second._M_node))) {
620 __p.first = __p.second++;
623 __p.first = __p.second;
630 __p.second = lower_bound(__x);
631 if (__p.second._M_node != &this->_M_header._M_data &
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_tree.h 504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
598 return _STLP_STD::distance(__p.first, __p.second);
617 __p.second = lower_bound(__x);
618 if (__p.second._M_node != &this->_M_header._M_data &&
619 !_M_key_compare(__x, _S_key(__p.second._M_node))) {
620 __p.first = __p.second++;
623 __p.first = __p.second;
630 __p.second = lower_bound(__x);
631 if (__p.second._M_node != &this->_M_header._M_data &
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_tree.h 504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
598 return _STLP_STD::distance(__p.first, __p.second);
617 __p.second = lower_bound(__x);
618 if (__p.second._M_node != &this->_M_header._M_data &&
619 !_M_key_compare(__x, _S_key(__p.second._M_node))) {
620 __p.first = __p.second++;
623 __p.first = __p.second;
630 __p.second = lower_bound(__x);
631 if (__p.second._M_node != &this->_M_header._M_data &
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_tree.h 504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
598 return _STLP_STD::distance(__p.first, __p.second);
617 __p.second = lower_bound(__x);
618 if (__p.second._M_node != &this->_M_header._M_data &&
619 !_M_key_compare(__x, _S_key(__p.second._M_node))) {
620 __p.first = __p.second++;
623 __p.first = __p.second;
630 __p.second = lower_bound(__x);
631 if (__p.second._M_node != &this->_M_header._M_data &
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_tree.h 504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
598 return _STLP_STD::distance(__p.first, __p.second);
617 __p.second = lower_bound(__x);
618 if (__p.second._M_node != &this->_M_header._M_data &&
619 !_M_key_compare(__x, _S_key(__p.second._M_node))) {
620 __p.first = __p.second++;
623 __p.first = __p.second;
630 __p.second = lower_bound(__x);
631 if (__p.second._M_node != &this->_M_header._M_data &
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/
_tree.h 504 size_type __n = _STLP_STD::distance(__p.first, __p.second);
505 erase(__p.first, __p.second);
598 return _STLP_STD::distance(__p.first, __p.second);
617 __p.second = lower_bound(__x);
618 if (__p.second._M_node != &this->_M_header._M_data &&
619 !_M_key_compare(__x, _S_key(__p.second._M_node))) {
620 __p.first = __p.second++;
623 __p.first = __p.second;
630 __p.second = lower_bound(__x);
631 if (__p.second._M_node != &this->_M_header._M_data &
    [all...]
  /external/chromium_org/chrome/browser/
character_encoding.cc 268 base::ASCIIToUTF16(found_name->second));
280 return found_name->second.second;
310 return found_id->second;
322 return found_name->second.first;
335 return GetEncodingDisplayName(found_name->second.first,
336 found_name->second.second);
455 bool ok = inserted_encoding.insert(*it).second;
  /external/chromium_org/chrome/browser/extensions/api/declarative_content/
content_rules_registry.cc 131 ContentRule* rule = rule_iter->second;
181 const ContentConditionSet& conditions = i->second->conditions();
185 match_id_to_rule_[(*j)->id()] = i->second.get();
193 i->second->conditions().GetURLMatcherConditionSets(&all_new_condition_sets);
219 ContentRule* rule = content_rules_entry->second.get();
231 if (ContainsKey(it->second, rule)) {
241 it->second.erase(rule);
265 rule_identifiers.push_back(global_rule_id.second);
275 ContentRule& rule = *i->second;
  /external/chromium_org/chrome/browser/sync/test/integration/
sessions_helper.cc 82 if (it->second->tabs.size() == 0) {
87 it->second->tabs.begin();
88 tab_it != it->second->tabs.end(); ++tab_it) {
203 const SessionWindow& window = *(w->second);
325 if (i->second->tabs.size() != j->second->tabs.size())
327 for (size_t t = 0; t < i->second->tabs.size(); ++t) {
328 client0_tab = i->second->tabs[t];
329 client1_tab = j->second->tabs[t];
  /external/chromium_org/content/browser/indexed_db/leveldb/
leveldb_transaction.cc 29 delete it->second;
52 it->second->value.swap(*value);
53 it->second->deleted = deleted;
74 if (it->second->deleted)
77 *value = it->second->value;
100 if (!iterator->second->deleted)
101 write_batch->Put(iterator->first, iterator->second->value);
169 return iterator_->second->value;
174 return iterator_->second->deleted;
  /external/chromium_org/media/cdm/
aes_decryptor.cc 53 return key_list_.begin()->second;
98 DCHECK(position->second);
99 delete position->second;
293 if (it->second.length() !=
299 if (!AddDecryptionKey(web_session_id, it->first, it->second)) {
437 key_id_entry->second->Insert(web_session_id, decryption_key.Pass());
457 return key_id_found->second->LatestDecryptionKey();
468 it->second->Erase(web_session_id);
469 if (it->second->Empty()) {
  /external/chromium_org/sandbox/win/src/
broker_services.cc 175 DeregisterPeerTracker(it->second);
185 ::CloseHandle(it->second.first);
186 ::CloseHandle(it->second.second);
298 DeregisterPeerTracker(it->second);
349 initial_token_temp = it->second.first;
350 lockdown_token_temp = it->second.second;
533 if (!peer_map_.insert(std::make_pair(peer->id, peer.get())).second)
  /external/chromium_org/third_party/WebKit/Source/core/css/parser/
MediaQueryTokenizer.cpp 35 static bool twoCharsAreValidEscape(UChar first, UChar second)
37 return ((first == '\\') && (second != '\n') && (second != kEndOfFileMarker));
485 UChar second = m_input.nextInputChar(); local
489 return ((isASCIIDigit(second)) || (second == '.' && isASCIIDigit(m_input.peek(1))));
491 return (isASCIIDigit(second));
506 UChar second = m_input.nextInputChar(); local
507 if (isNameStart(first) || twoCharsAreValidEscape(first, second))
  /external/chromium_org/third_party/libjingle/source/talk/p2p/base/
session.cc 62 iter->second->SignalDestroyed(iter->second);
63 delete iter->second;
140 SetupChannelProxy(iter->first, iter->second);
184 return (iter != channels_.end()) ? iter->second : NULL;
192 if (iter->second->name() == name) {
193 return iter->second;
257 ReplaceChannelProxyImpl(iter->second, NULL);
262 iter->second, target->transport_->get()->CreateChannel(iter->first));
416 delete iter->second;
    [all...]
  /external/chromium_org/third_party/skia/experimental/Intersection/
LineIntersection.cpp 123 bool second = fabs(i.fT[0][0] - i.fT[0][1]) > FLT_EPSILON;
124 SkASSERT((fabs(i.fT[1][0] - i.fT[1][1]) <= FLT_EPSILON) ^ second);
125 return computePoints(a, 1 + second, i);
222 bool second = fabs(intersections.fT[0][0] - intersections.fT[0][1])
225 <= FLT_EPSILON) ^ second);
226 return computePoints(line, 1 + second, intersections);
311 bool second = fabs(intersections.fT[0][0] - intersections.fT[0][1])
314 <= FLT_EPSILON) ^ second);
315 return computePoints(line, 1 + second, intersections);
  /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/
receive_statistics_impl.cc 260 // second. We know how many "old" packets we have received. We just count
402 delete statisticians_.begin()->second;
421 it->second->IncomingPacket(header, bytes, retransmitted);
428 it->second->FecPacketReceived();
438 statisticians_[to_ssrc] = from_it->second;
449 it->second->LastReceiveTimeNtp(&secs, &frac);
452 active_statisticians[it->first] = it->second;
464 return it->second;
472 it->second->SetMaxReorderingThreshold(max_reordering_threshold);
480 it->second->ProcessBitrate()
    [all...]
  /external/chromium_org/tools/clang/blink_gc_plugin/
RecordInfo.cpp 148 return &it->second;
150 .first->second;
159 if (it->second.info()->IsStackAllocated()) {
232 if (it->second.NeedsTracing().IsNeeded())
269 if (it->second.info()->InheritsTrace())
279 if (CXXMethodDecl* trace = it->second.info()->InheritsNonVirtualTrace())
388 if (CXXMethodDecl* dispatch = it->second.info()->GetTraceDispatchMethod()) {
393 it->second.info()->GetFinalizeDispatchMethod()) {
422 if (it->second.info()->NeedsTracing(option).IsNeeded())
  /external/clang/lib/Lex/
PreprocessingRecord.cpp 55 iterator(this, CachedRangeQuery.Result.second));
63 return std::make_pair(iterator(this, Res.first), iterator(this, Res.second));
138 return std::make_pair(Local.first, Local.second);
144 if (Loaded.first == Loaded.second)
145 return std::make_pair(Local.first, Local.second);
150 if (Local.first == Local.second)
152 int(Loaded.second)-TotalLoaded);
155 return std::make_pair(int(Loaded.first)-TotalLoaded, Local.second);
366 return Pos->second;
  /external/llvm/include/llvm/ADT/
StringMap.h 116 ValueTy second; member in class:llvm::StringMapEntry
119 : StringMapEntryBase(strLen), second() {}
121 : StringMapEntryBase(strLen), second(std::move(V)) {}
127 const ValueTy &getValue() const { return second; }
128 ValueTy &getValue() { return second; }
130 void setValue(const ValueTy &V) { second = V; }
187 (reinterpret_cast<char*>(&EPtr->second) -
294 return it->second;
340 MapEntryTy::Create(KV.first, Allocator, std::move(KV.second));
  /external/llvm/unittests/ADT/
StringMapTest.cpp 56 EXPECT_EQ(testValue, it->second);
176 ss << "key_" << it->second;
178 visited[it->second] = true;
193 EXPECT_EQ(1u, entry->second);
216 EXPECT_EQ(testValue, NewIt->second);
241 EXPECT_EQ(42u, It->second);
256 ASSERT_EQ(iter->second.i, 123);
332 ASSERT_EQ(I->second.Number, 42);
340 ASSERT_EQ(I->second.Number, 42);
  /external/skia/experimental/Intersection/
LineIntersection.cpp 123 bool second = fabs(i.fT[0][0] - i.fT[0][1]) > FLT_EPSILON;
124 SkASSERT((fabs(i.fT[1][0] - i.fT[1][1]) <= FLT_EPSILON) ^ second);
125 return computePoints(a, 1 + second, i);
222 bool second = fabs(intersections.fT[0][0] - intersections.fT[0][1])
225 <= FLT_EPSILON) ^ second);
226 return computePoints(line, 1 + second, intersections);
311 bool second = fabs(intersections.fT[0][0] - intersections.fT[0][1])
314 <= FLT_EPSILON) ^ second);
315 return computePoints(line, 1 + second, intersections);
  /art/compiler/sea_ir/debug/
dot_gen.cc 50 if (NULL != def_it->second) {
51 dot_text_ += def_it->second->StringId() + " -> ";
54 art::SafeMap<int, const Type*>::const_iterator type_it = types_->find(def_it->second->Id());
57 dot_text_ += "(" + type_it->second->Dump() + ")";
89 dot_text_ += "(" + type_it->second->Dump() + ")";
  /external/chromium_org/base/memory/
discardable_memory_manager.cc 95 const AllocationInfo& info = it->second;
113 AllocationInfo* info = &it->second;
150 AllocationInfo* info = &it->second;
177 return it != allocations_.end() && it->second.purgable;
228 AllocationInfo* info = &it->second;

Completed in 2054 milliseconds

<<51525354555657585960>>