| /frameworks/ex/variablespeed/jni/ |
| macros.h | 31 ForwardIterator min_element(ForwardIterator first, ForwardIterator last) {
33 if (first == last) return last;
34 while (++first != last)
|
| /libcore/luni/src/main/java/java/text/ |
| CharacterIterator.java | 68 * @return the index one past the last character of the iteration.
85 public char last(); method in interface:CharacterIterator
|
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/ |
| GLFace.java | 51 int last = mVertexList.size() - 1; local
52 if (last < 2) {
55 GLVertex vertex = mVertexList.get(last);
61 mVertexList.remove(last + 1);
62 vertex = mVertexList.get(last);
77 int last = mVertexList.size() - 1; local
80 GLVertex vn = mVertexList.get(last);
83 for (int i = 1; i < last; i++) {
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/ |
| vlc_encode.h | 24 Int PutCoeff_Inter(Int run, Int level, Int last, BitstreamEncVideo *bitstream);
25 Int PutCoeff_Intra(Int run, Int level, Int last, BitstreamEncVideo *bitstream);
33 Int PutCoeff_Inter_RVLC(Int run, Int level, Int last, BitstreamEncVideo *bitstream);
34 Int PutCoeff_Intra_RVLC(Int run, Int level, Int last, BitstreamEncVideo *bitstream);
35 Int PutRunCoeff_Inter(Int run, Int level, Int last, BitstreamEncVideo *bitstream);
36 Int PutRunCoeff_Intra(Int run, Int level, Int last, BitstreamEncVideo *bitstream);
37 Int PutLevelCoeff_Inter(Int run, Int level, Int last, BitstreamEncVideo *bitstream);
38 Int PutLevelCoeff_Intra(Int run, Int level, Int last, BitstreamEncVideo *bitstream);
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p2/src/ |
| armVCM4P2_FillVLDBuffer.c | 34 * [in] last status of the last flag
51 OMX_U8 last,
72 /* If last is 1, fill the remaining elments of the buffer with zeros */
73 if (last == 1)
|
| omxVCM4P2_DecodeVLCZigzag_Inter.c | 79 OMX_U8 last,start = 0; local
96 &last,
112 if (last == 0)
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.min.max/ |
| minmax_element.pass.cpp | 15 // minmax_element(Iter first, Iter last);
24 test(Iter first, Iter last)
26 std::pair<Iter, Iter> p = std::minmax_element(first, last);
27 if (first != last)
29 for (Iter j = first; j != last; ++j)
37 assert(p.first == last);
38 assert(p.second == last);
|
| minmax_element_comp.pass.cpp | 15 // minmax_element(Iter first, Iter last, Compare comp);
25 test(Iter first, Iter last)
29 std::pair<Iter, Iter> p = std::minmax_element(first, last, comp);
30 if (first != last)
32 for (Iter j = first; j != last; ++j)
40 assert(p.first == last);
41 assert(p.second == last);
|
| /external/skia/src/core/ |
| SkDeque.cpp | 118 Block* last = fBackBlock; local
121 if (NULL == last->fBegin) {
123 last->fBegin = last->start();
124 end = last->fBegin + fElemSize;
126 end = last->fEnd + fElemSize;
127 if (end > last->fStop) { // no more room in this chunk
129 last = this->allocateBlock(fAllocCount);
130 last->fPrev = fBackBlock;
131 fBackBlock->fNext = last;
189 Block* last = fBackBlock; local
[all...] |
| /external/bison/examples/calc++/ |
| location.hh | 163 position last = loc.end - 1; local
165 if (last.filename
167 || *loc.begin.filename != *last.filename))
168 ostr << '-' << last; local
169 else if (loc.begin.line != last.line)
170 ostr << '-' << last.line << '.' << last.column;
171 else if (loc.begin.column != last.column)
172 ostr << '-' << last.column;
|
| /sdk/emulator/opengl/host/tools/emugen/ |
| strUtils.cpp | 21 std::string getNextToken(const std::string & str, size_t pos, size_t * last, const std::string & delim)
28 *last = str.find_first_of(delim, pos);
29 if (*last == std::string::npos) *last = str.size();
30 std::string retval = str.substr(pos, *last - pos);
|
| /external/webkit/Source/WebKit/chromium/src/ |
| WebPluginListBuilderImpl.cpp | 56 m_results->last().mimes.append(info);
61 MimeClassInfo& info = m_results->last().mimes.last();
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector.bool/ |
| construct_iter_iter.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last);
22 test(Iterator first, Iterator last)
24 C c(first, last);
26 assert(c.size() == std::distance(first, last));
|
| /external/opencv/cv/src/ |
| _cvkdtree.hpp | 84 int dimension_of_highest_variance(__instype * first, __instype * last,
86 assert(last - first > 0);
92 for (__instype * k = first; k < last; ++k)
94 mean /= last - first;
96 for (__instype * k = first; k < last; ++k) {
100 var /= last - first;
113 // given point indices and dimension, find index of median; (almost) modifies [first,last)
114 // such that points_in[first,median]<=point[median], points_in(median,last)>point[median].
117 __instype * median_partition(__instype * first, __instype * last,
119 assert(last - first > 0)
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| util.rb | 154 range.exclude_end? ? last >= range.last : last > range.last
156 range.exclude_end? ? last.succ >= range.last : last >= range.last
|
| /external/regex-re2/re2/ |
| make_unicode_casefold.py | 66 last = -100
68 def evenodd(last, a, b, r):
69 if a != last+1 or b != _AddDelta(a, r[2]):
74 def evenoddpair(last, a, b, r):
75 if a != last+2:
92 if ranges and evenodd(last, a, b, ranges[-1]):
94 elif ranges and evenoddpair(last, a, b, ranges[-1]):
98 last = a
|
| /ndk/sources/cxx-stl/llvm-libc++/test/iterators/iterator.primitives/iterator.operations/ |
| distance.pass.cpp | 14 // distance(Iter first, Iter last);
18 // distance(Iter first, Iter last);
27 test(It first, It last, typename std::iterator_traits<It>::difference_type x)
29 assert(std::distance(first, last) == x);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/strings/basic.string/string.cons/ |
| iter_alloc.pass.cpp | 25 test(It first, It last)
31 S s2(first, last);
33 assert(s2.size() == std::distance(first, last));
35 for (It it = first; it != last; ++it, ++i)
43 test(It first, It last, const test_allocator<typename std::iterator_traits<It>::value_type>& a)
49 S s2(first, last, a);
51 assert(s2.size() == std::distance(first, last));
53 for (It it = first; it != last; ++it, ++i)
|
| /external/stlport/src/ |
| num_put.cpp | 27 // We assume, without checking, that *last is null and that there is enough
28 // space in the buffer to extend the number past [first, last).
31 __insert_grouping_aux(Char* first, Char* last, const string& grouping,
36 if (first == last)
47 Char* cur_group = last; // Points immediately beyond the rightmost
63 ++last;
64 copy_backward(cur_group, last, last + 1);
68 return (last - first) + sign + basechars;
135 __insert_grouping(char * first, char * last, const string& grouping
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| num_put.cpp | 27 // We assume, without checking, that *last is null and that there is enough
28 // space in the buffer to extend the number past [first, last).
31 __insert_grouping_aux(Char* first, Char* last, const string& grouping,
36 if (first == last)
47 Char* cur_group = last; // Points immediately beyond the rightmost
63 ++last;
64 copy_backward(cur_group, last, last + 1);
68 return (last - first) + sign + basechars;
135 __insert_grouping(char * first, char * last, const string& grouping
[all...] |
| /external/quake/quake/src/WinQuake/ |
| gl_mesh.cpp | 62 mtriangle_t *last, *check; local
67 last = &triangles[starttri];
69 stripverts[0] = last->vertindex[(startv)%3];
70 stripverts[1] = last->vertindex[(startv+1)%3];
71 stripverts[2] = last->vertindex[(startv+2)%3];
76 m1 = last->vertindex[(startv+2)%3];
77 m2 = last->vertindex[(startv+1)%3];
83 if (check->facesfront != last->facesfront)
131 mtriangle_t *last, *check; local
136 last = &triangles[starttri]
202 mtriangle_t *last, *check; local
[all...] |
| /external/webrtc/src/system_wrappers/source/spreadsortlib/ |
| spreadsort.hpp | 60 find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAccessIter & min)
64 while(++current < last) {
75 find_extremes(RandomAccessIter current, RandomAccessIter last, RandomAccessIter & max, RandomAccessIter & min, compare comp)
78 while(++current < last) {
125 spread_sort_rec(RandomAccessIter first, RandomAccessIter last, std::vector<RandomAccessIter> &bin_cache, unsigned cache_offset
131 find_extremes(first, last, max, min);
136 unsigned log_divisor = get_log_divisor(last - first, rough_log_2_size((size_t)(*max >> 0) - (*min >> 0)));
144 for (RandomAccessIter current = first; current != last;)
180 bins[bin_count - 1] = last;
187 size_t max_count = get_max_count(log_divisor, last - first);
[all...] |
| /external/apache-http/src/org/apache/commons/codec/language/ |
| RefinedSoundex.java | 168 char last, current; local
169 last = '*';
174 if (current == last) {
180 last = current;
|
| /external/clang/test/CodeCompletion/ |
| function-templates.cpp | 3 void sort(RandomAccessIterator first, RandomAccessIterator last);
19 // CHECK-CC1: sort(<#RandomAccessIterator first#>, <#RandomAccessIterator last#>
|
| /external/openssl/apps/ |
| app_rand.c | 168 int last; local
174 last=0;
176 if (*p == '\0') last=1;
187 if (last) break;
|
