Searched refs:last (Results 201 - 225 of 1636) sorted by relevance

1234567891011>>

/external/libcxx/test/algorithms/alg.sorting/alg.binary.search/binary.search/
H A Dbinary_search_comp.pass.cpp16 // binary_search(Iter first, Iter last, const T& value, Compare comp);
27 test(Iter first, Iter last, const T& value, bool x) argument
29 assert(std::binary_search(first, last, value, std::greater<int>()) == x);
/external/libcxx/test/numerics/numeric.ops/accumulate/
H A Daccumulate_op.pass.cpp17 // accumulate(Iter first, Iter last, T init, BinaryOperation binary_op);
27 test(Iter first, Iter last, T init, T x) argument
29 assert(std::accumulate(first, last, init, std::multiplies<T>()) == x);
/external/libopus/celt/tests/
H A Dtest_unit_mathops.c101 opus_int32 min_d,max_d,last,chk; local
103 last=min_d=32767;
109 d = last - q;
112 last = q;
125 opus_int32 min_d,max_d,last,chk; local
127 last=min_d=15059;
135 d = last - q;
140 last = q;
/external/mesa3d/src/mesa/x86/
H A Dsse.c73 GLfloat *last,
79 GLfloat *last,
/external/mockito/cglib-and-asm/src/org/mockito/asm/
H A DAnnotationWriter.java262 AnnotationWriter last = null;
267 aw.prev = last;
268 last = aw;
273 aw = last;
299 AnnotationWriter last = null;
304 aw.prev = last;
305 last = aw;
309 aw = last;
/external/oprofile/daemon/
H A Dopd_trans.h44 struct sfile * last; member in struct:transient
67 trans->last = trans->current;
/external/strace/
H A Dgit-set-file-times34 last unless %ls;
/external/tcpdump/tests/
H A DTESTonce16 last;
/external/valgrind/main/include/
H A Dpub_tool_xarray.h84 index of the first, and *last to be the index of the last matching
86 False, and don't change *first or *last. first and/or last may be
89 /*OUT*/Word* first, /*OUT*/Word* last );
100 /*OUT*/Word* first, /*OUT*/Word* last,
115 /* Drop the last n elements of an XArray. Bombs if there are less
/external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/
H A Dunicodetext.cc51 const UnicodeText::const_iterator& last) {
52 return CodepointDistance(first.it_, last.it_);
205 const UnicodeText::const_iterator& last) {
206 assert(first <= last && "Incompatible iterators");
207 repr_.append(first.it_, last.it_ - first.it_);
211 const const_iterator& last) {
212 assert(first <= last && "Incompatible iterators");
213 return string(first.it_, last.it_ - first.it_);
291 const const_iterator &last) {
292 assert(first <= last
50 distance(const UnicodeText::const_iterator& first, const UnicodeText::const_iterator& last) argument
204 UnicodeText(const UnicodeText::const_iterator& first, const UnicodeText::const_iterator& last) argument
210 UTF8Substring(const const_iterator& first, const const_iterator& last) argument
290 PointTo(const const_iterator &first, const const_iterator &last) argument
304 append(const const_iterator& first, const const_iterator& last) argument
[all...]
/external/pcre/dist/
H A Dpcre_get.c142 lastptr where to put the pointer to the last entry
209 pcre_uchar *last = entry; local
216 while (last < lastentry)
219 (pcre_uchar *)(last + entrysize + IMM2_SIZE)) != 0) break;
220 last += entrysize;
224 *lastptr = (char *)last;
227 *lastptr = (PCRE_UCHAR16 *)last;
230 *lastptr = (PCRE_UCHAR32 *)last;
255 or the number of the last one if none are set,
274 char *first, *last; local
276 PCRE_UCHAR16 *first, *last; local
278 PCRE_UCHAR32 *first, *last; local
[all...]
/external/chromium_org/media/cast/test/utility/
H A Daudio_utility.cc51 float last = 0.0f; local
52 for (; i < length && fabsf(last) < kAmplitudeThreshold; ++i)
53 last = samples[i];
56 (last < 0) != (samples[i] < 0)) {
58 last = samples[i];
/external/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp97 unsigned last = Depth - 1; local
98 while ((last > 0) && ((*this)[last] == 0))
99 last--;
101 for (unsigned i = 0; i <= last; i++) {
/external/zlib/src/contrib/masmx64/
H A Dinffas8664.c87 /* 24 12 */ unsigned char FAR *last; /* r9 while in < last */ member in struct:inffast_ar
128 ar.last = ar.in + (strm->avail_in - PAD_AVAIL_IN);
175 strm->avail_in = (unsigned)(ar.in < ar.last ?
176 PAD_AVAIL_IN + (ar.last - ar.in) :
177 PAD_AVAIL_IN - (ar.in - ar.last));
/external/chromium_org/third_party/WebKit/Source/platform/text/
H A DBidiResolver.h82 // Check to see if our last midpoint is a start point beyond the line break. If so,
132 , last(WTF::Unicode::OtherNeutral)
141 eor = lastStrong = last = direction;
148 , last(lastDir)
155 WTF::Unicode::Direction last; member in struct:blink::BidiStatus
176 return status1.eor == status2.eor && status1.last == status2.last && status1.lastStrong == status2.lastStrong && *(status1.context) == *(status2.context);
220 void setLastDir(WTF::Unicode::Direction lastDir) { m_status.last = lastDir; }
279 Iterator m_eor; // Points to the last character in the current run.
283 // m_endOfRunAtEndOfLine is "the position last eo
[all...]
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/
H A DTokenRewriteStream.js288 var programName, first, last, text;
292 last = arguments[0];
297 last = arguments[1];
302 last = arguments[2];
310 if (last instanceof org.antlr.runtime.Token) {
311 last = last.index; // that's ugly
314 if ( first > last || last<0 || first<0 ) {
319 new trs.ReplaceOp(first, last, tex
[all...]
/external/chromium_org/ppapi/generators/
H A Didl_diff.py190 # Check if the combination of last + next change signals they are both
193 def Swapped(last, next):
194 if not last.now and not next.was and len(last.was) == len(next.now):
195 cnt = len(last.was)
199 if last.was[j] != next.now[(i + j) % cnt]:
203 if not last.was and not next.now and len(last.now) == len(next.was):
204 cnt = len(last.now)
208 if last
[all...]
/external/libpng/contrib/libtests/
H A Dpngimage.c348 struct buffer_list *last; /* last buffer in use */ member in struct:buffer
349 size_t end_count; /* bytes in the last buffer */
360 buffer->last = NULL;
368 buffer->last = &buffer->first;
418 struct buffer_list *last = &buffer->first; local
423 size_t r = fread(last->buffer+count, 1/*size*/,
424 (sizeof last->buffer)-count, fp);
430 if (count >= sizeof last->buffer)
432 assert(count == sizeof last
729 struct buffer_list *last = bp->current; local
1191 struct buffer_list *last = buffer->last; local
[all...]
/external/libsepol/src/
H A Dhashtab.c108 hashtab_ptr_t cur, last; local
114 last = NULL;
117 last = cur;
124 if (last == NULL)
127 last->next = cur->next;
254 hashtab_ptr_t last, cur, temp; local
260 last = NULL;
265 if (last) {
266 last->next = cur->next;
278 last
[all...]
H A Dsidtab.c90 sidtab_node_t *cur, *last; local
96 last = NULL;
99 last = cur;
106 if (last == NULL)
109 last->next = cur->next;
174 sidtab_node_t *last, *cur, *temp; local
180 last = NULL;
185 if (last) {
186 last->next = cur->next;
197 last
[all...]
/external/bison/data/
H A Dlocation.cc283 position last = loc.end - 1;
285 if (last.filename
287 || *loc.begin.filename != *last.filename))
288 ostr << '-' << last;
289 else if (loc.begin.line != last.line)
290 ostr << '-' << last.line << '.' << last.column;
291 else if (loc.begin.column != last.column)
292 ostr << '-' << last.column;
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsDebug.cpp519 const SkOpSpan* last = NULL; local
534 if (last) {
535 SK_ALWAYSBREAK(last->fT != span.fT || last->fOther != span.fOther);
536 bool tsEqual = last->fT == span.fT;
537 bool tsPreciselyEqual = precisely_equal(last->fT, span.fT);
539 bool pointsEqual = last->fPt == span.fPt;
540 bool pointsNearlyEqual = AlmostEqualUlps(last->fPt, span.fPt);
544 // SK_ALWAYSBREAK(!last->fTiny || !tsPreciselyEqual || span.fTiny || tinyTFound);
545 SK_ALWAYSBREAK(last
[all...]
/external/llvm/include/llvm/ADT/
H A Dilist.h119 ilist_iterator<NodeTy> /*last*/) {}
308 /// of the first node in the list always points to the last node in the list,
484 // [first, last) into position.
486 void transfer(iterator position, iplist &L2, iterator first, iterator last) { argument
487 assert(first != last && "Should be checked by callers");
493 if (position != last) {
501 // Remove [first, last) from its old position.
503 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next);
510 // Splice [first, last) into its new position.
544 iterator erase(iterator first, iterator last) { argument
565 insert(iterator where, InIt first, InIt last) argument
575 iterator last = first; ++last; local
579 splice(iterator where, iplist &L2, iterator first, iterator last) argument
654 ilist(InIt first, InIt last) argument
[all...]
/external/skia/src/pathops/
H A DSkPathOpsDebug.cpp518 const SkOpSpan* last = NULL; local
533 if (last) {
534 SK_ALWAYSBREAK(last->fT != span.fT || last->fOther != span.fOther);
535 bool tsEqual = last->fT == span.fT;
536 bool tsPreciselyEqual = precisely_equal(last->fT, span.fT);
538 bool pointsEqual = last->fPt == span.fPt;
539 bool pointsNearlyEqual = AlmostEqualUlps(last->fPt, span.fPt);
543 // SK_ALWAYSBREAK(!last->fTiny || !tsPreciselyEqual || span.fTiny || tinyTFound);
544 SK_ALWAYSBREAK(last
[all...]
/external/chromium_org/chrome/installer/util/
H A Dlanguage_selector.cc91 bool IsArraySorted(const LangToOffset* first, const LangToOffset* last, argument
93 if (last - first > 1) {
94 for (--last; first != last; ++first) {
149 bool TryFindOffset(const LangToOffset* first, const LangToOffset* last, argument
151 const LangToOffset* search_result = std::lower_bound(first, last, name);
152 if (last != search_result && search_result->language == name) {

Completed in 4331 milliseconds

1234567891011>>