/external/chromium/base/memory/ |
H A D | scoped_vector.h | 65 // Lets the ScopedVector take ownership of elements in [first,last). 67 void insert(iterator position, InputIterator first, InputIterator last) { argument 68 v.insert(position, first, last); 76 iterator erase(iterator first, iterator last) { argument 77 STLDeleteContainerPointers(first, last); 78 return v.erase(first, last); 86 // Like |erase()|, but doesn't delete the elements in [first, last). 87 iterator weak_erase(iterator first, iterator last) { argument 88 return v.erase(first, last);
|
/external/llvm/lib/VMCore/ |
H A D | SymbolTableListTraitsImpl.h | 88 ilist_iterator<ValueSubClass> first, 99 for (; first != last; ++first) { 100 ValueSubClass &V = *first; 111 for (; first != last; ++first) 112 first->setParent(NewIP); 87 transferNodesFromList(ilist_traits<ValueSubClass> &L2, ilist_iterator<ValueSubClass> first, ilist_iterator<ValueSubClass> last) argument
|
/external/llvm/utils/TableGen/ |
H A D | SequenceToOffsetTable.h | 74 if (I != Seqs.end() && isSuffix(Seq, I->first)) 80 if (I != Seqs.begin() && isSuffix((--I)->first, Seq)) 94 Entries += I->first.size() + 1; 102 assert(I != Seqs.end() && isSuffix(Seq, I->first) && 103 "get() called with sequence that wasn't added first"); 104 return I->second + (I->first.size() - Seq.size()); 116 for (typename SeqT::const_iterator SI = I->first.begin(), 117 SE = I->first.end(); SI != SE; ++SI) {
|
/external/stlport/test/unit/ |
H A D | istmit_test.cpp | 91 2, back_inserter(chars)).first, 92 2, back_inserter(chars)).first; 141 itr = copy_n(itr, 0, back_inserter(ints)).first; 143 itr = copy_n(itr, -1, back_inserter(ints)).first; 145 itr = copy_n(itr, 2, back_inserter(ints)).first; 149 itr = copy_n(itr, 2, back_inserter(ints)).first; 153 itr = copy_n(itr, 2, back_inserter(ints)).first;
|
/external/webkit/Source/JavaScriptCore/wtf/ |
H A D | BloomFilter.h | 85 uint8_t& first = firstSlot(hash); local 87 if (LIKELY(first < maximumCount())) 88 ++first; 96 uint8_t& first = firstSlot(hash); local 98 ASSERT(first); 101 if (LIKELY(first < maximumCount())) 102 --first;
|
/external/webkit/Source/WebCore/rendering/ |
H A D | RenderObjectChildList.cpp | 50 firstChild()->remove(); // List markers are owned by their enclosing list and so don't get destroyed by this container. Similarly, first letters are destroyed by their remaining text fragment. 270 RenderObject* first = const_cast<RenderObject*>(owner); local 272 first = first->firstChild(); 274 while (first && (first->isListMarker() || (first->isRenderInline() && first->isRunIn()))) 275 first = first [all...] |
/external/clang/test/Index/ |
H A D | complete-method-decls.m | 46 - (int)first:(int)x second:(float)y third:(double)z; 47 - (id)first:(int)xx second2:(float)y2 third:(double)z; 48 - (void*)first:(int)xxx second3:(float)y3 third:(double)z; 52 - (int)first:(int)x second2:(float)y third:(double)z; 56 - (int)first:(int)x second2:(float)y third:(double)z { } 115 // CHECK-CC8: ObjCInstanceMethodDecl:{ResultType id}{Informative first:}{TypedText second2:}{Text (float)y2}{HorizontalSpace }{TypedText third:}{Text (double)z} (35) 116 // CHECK-CC8: ObjCInstanceMethodDecl:{ResultType void *}{Informative first:}{TypedText second3:}{Text (float)y3}{HorizontalSpace }{TypedText third:}{Text (double)z} (35) 117 // CHECK-CC8: ObjCInstanceMethodDecl:{ResultType int}{Informative first:}{TypedText second:}{Text (float)y}{HorizontalSpace }{TypedText third:}{Text (double)z} (8) 125 // CHECK-CCB: ObjCInstanceMethodDecl:{LeftParen (}{Text int}{RightParen )}{TypedText first}{TypedText :}{LeftParen (}{Text int}{RightParen )}{Text x}{HorizontalSpace }{TypedText second2:}{LeftParen (}{Text float}{RightParen )}{Text y}{HorizontalSpace }{TypedText third:}{LeftParen (}{Text double}{RightParen )}{Text z} (40) 127 // CHECK-CCC: ObjCInstanceMethodDecl:{TypedText first}{TypedTex [all...] |
/external/webkit/Source/WebCore/rendering/svg/ |
H A D | SVGRootInlineBox.cpp | 232 static inline void swapItemsInVector(Vector<float>& firstVector, Vector<float>& lastVector, unsigned first, unsigned last) argument 234 float temp = firstVector.at(first); 235 firstVector.at(first) = lastVector.at(last); 249 SVGTextLayoutAttributes*& first, SVGTextLayoutAttributes*& last) 251 first = 0; 257 if (!first && firstContext == current.context()) 258 first = ¤t; 261 if (first && last) 265 ASSERT(first); 269 static inline void reverseInlineBoxRangeAndValueListsIfNeeded(void* userData, Vector<InlineBox*>::iterator first, Vecto argument 248 findFirstAndLastAttributesInVector(Vector<SVGTextLayoutAttributes>& attributes, RenderSVGInlineText* firstContext, RenderSVGInlineText* lastContext, SVGTextLayoutAttributes*& first, SVGTextLayoutAttributes*& last) argument [all...] |
/external/iptables/libiptc/ |
H A D | linux_list.h | 286 struct list_head *first = list->next; local 290 first->prev = head; 291 head->next = first; 300 * @head: the place to add it in the first list. 311 * @head: the place to add it in the first list. 510 struct hlist_node *first; member in struct:hlist_head 517 #define HLIST_HEAD_INIT { .first = NULL } 518 #define HLIST_HEAD(name) struct hlist_head name = { .first = NULL } 519 #define INIT_HLIST_HEAD(ptr) ((ptr)->first = NULL) 529 return !h->first; 585 struct hlist_node *first = h->first; local 616 struct hlist_node *first = h->first; local [all...] |
/external/stlport/stlport/stl/ |
H A D | _pair.h | 55 _T1 first; 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) {} 72 pair(__move_source<pair<_T1, _T2> > src) : first(_STLP_PRIV _AsMoveSource(src.get().first)), 82 { return __x.first [all...] |
/external/llvm/include/llvm/Support/ |
H A D | IntegersSubsetMapping.h | 72 return C1.first < C2.first; 80 return LItem->first.getHigh() >= RItem->first.getLow(); 89 APInt RLow = RItem->first.getLow(); 92 return LItem->first.getHigh() >= RLow; 292 const RangeTy &LRange = L->first; 293 const RangeTy &RRange = R->first; 318 const IntTy *Low = &OldItems.begin()->first.getLow(); 319 const IntTy *High = &OldItems.begin()->first [all...] |
/external/webkit/Source/JavaScriptCore/bytecode/ |
H A D | Opcode.cpp | 86 long long leftValue = OpcodeStats::opcodePairCounts[leftPair.first][leftPair.second]; 88 long long rightValue = OpcodeStats::opcodePairCounts[rightPair.first][rightPair.second]; 137 long long count = opcodePairCounts[indexPair.first][indexPair.second]; 142 printf("%s%s %s:%s %lld %.2f%%\n", opcodeNames[indexPair.first], padOpcodeName((OpcodeID)indexPair.first, 28), opcodeNames[indexPair.second], padOpcodeName((OpcodeID)indexPair.second, 28), count, ((double) count) / ((double) totalInstructionPairs) * 100.0); 158 long long pairCount = opcodePairCounts[indexPair.first][indexPair.second]; 164 if (indexPair.first != index && indexPair.second != index) 167 printf(" %s%s %s:%s %lld - %.2f%%\n", opcodeNames[indexPair.first], padOpcodeName((OpcodeID)indexPair.first, 28), opcodeNames[indexPair.second], padOpcodeName((OpcodeID)indexPair.second, 28), pairCount, pairProportion * 100.0);
|
/external/chromium/base/ |
H A D | tracked_objects_unittest.cc | 24 EXPECT_FALSE(ThreadData::first()); // No activity even on this thread. 26 EXPECT_TRUE(ThreadData::first()); // Now class was constructed. 40 EXPECT_FALSE(ThreadData::first()); // No activity even on this thread. 42 EXPECT_TRUE(ThreadData::first()); // Now class was constructed. 65 const ThreadData* data = ThreadData::first(); 91 EXPECT_EQ(birth_map.begin()->second, death_map.begin()->first);
|
/external/chromium/chrome/browser/history/ |
H A D | snippet_unittest.cc | 17 // The \x bits after the first "Google" are UTF-8 of U+2122 TRADE MARK SIGN, 81 // Comparator for sorting by the first element in a pair. 84 return a.first < b.first; 128 star_snippet += snippet.text().substr(pos, match->first - pos); 130 star_snippet += snippet.text().substr(match->first, 131 match->second - match->first); 248 EXPECT_EQ(data[i].expected_matches[2 * j], matches[j].first);
|
/external/chromium/chrome/browser/ |
H A D | oom_priority_manager.cc | 60 // Returns true if |first| is considered less desirable to be killed 62 bool OomPriorityManager::CompareRendererStats(RendererStats first, argument 70 if (first.is_pinned != second.is_pinned) 71 return first.is_pinned == true; 77 if (abs((first.last_selected - second.last_selected).ToInternalValue()) < 79 return first.last_selected < second.last_selected; 81 return first.memory_used < second.memory_used; 144 // killed is first, most desirable is last.
|
/external/smali/util/src/main/java/org/jf/util/ |
H A D | PathUtil.java | 76 boolean first = true; 78 if (!first) { 81 first = false; 87 first = true; 89 if (first) { 93 first = false;
|
/external/webkit/Source/JavaScriptCore/parser/ |
H A D | ResultType.h | 141 OperandTypes(ResultType first = ResultType::unknownType(), ResultType second = ResultType::unknownType()) 146 m_u.rds.first = first.m_type; 152 ResultType::Type first; member in struct:JSC::OperandTypes::__anon14966::__anon14967 158 ResultType first() function in struct:JSC::OperandTypes 160 return ResultType(m_u.rds.first);
|
/external/webkit/Source/WebCore/css/ |
H A D | CSSPrimitiveValueCache.cpp | 53 entry.first->second = CSSPrimitiveValue::createIdentifier(ident); 54 return entry.first->second; 76 entry.first->second = CSSPrimitiveValue::createColor(rgbValue); 77 return entry.first->second; 115 entry.first->second = CSSPrimitiveValue::create(value, type); 116 return entry.first->second;
|
/external/clang/include/clang/AST/ |
H A D | StmtIterator.h | 158 bool empty() const { return first == second; } 161 Stmt *operator->() const { return first.operator->(); } 162 Stmt *&operator*() const { return first.operator*(); } 166 ++first; 173 ++first; 178 return range.first; 196 : std::pair<ConstStmtIterator,ConstStmtIterator>(range.first, range.second) 201 bool empty() const { return first == second; } 204 const Stmt *operator->() const { return first.operator->(); } 205 const Stmt *operator*() const { return first [all...] |
/external/chromium/chrome/browser/password_manager/ |
H A D | password_form_data.h | 37 const std::vector<webkit_glue::PasswordForm*>& first, 41 std::vector<webkit_glue::PasswordForm>& first,
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | ConstraintManager.cpp | 41 if (P.first && !P.second) 43 if (!P.first && P.second)
|
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
H A D | p23.cpp | 6 void print(T first, Ts... rest) { argument 7 (void)first;
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | RegularContiguousSet.java | 50 return contains(target) ? (int) domain.distance(first(), (C) target) : -1; 67 return new AbstractLinkedIterator<C>(first()) { 85 @Override public C first() { method in class:RegularContiguousSet 94 long distance = domain.distance(first(), last()); 134 C lowerEndpoint = Ordering.natural().max(this.first(), other.first()); 157 return this.first().equals(that.first())
|
/external/nist-sip/java/gov/nist/javax/sip/address/ |
H A D | NetObjectList.java | 102 /** returns the first element 105 public GenericObject first() { method in class:NetObjectList 106 return (NetObject) super.first();
|
/external/opencv/ |
H A D | libopencv.mk | 4 # Make sure bionic is first so we can include system headers.
|