| /external/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| 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/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/chromium_org/chrome/common/extensions/docs/examples/apps/calculator/tests/ |
| utilities.js | 60 var last = this.display[this.display.length - 1];
62 accumulator: last && last[0] || null,
63 operator: last && last[1] || null,
64 operand: last && last[2] || null
211 * adjust the last expected value array by setting only its accumulator value.
229 * of the last expected value array is set and changed as described in the
319 var last = expected[expected.length - 1]
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/x86/ |
| 3dnow.c | 61 GLfloat *last,
67 GLfloat *last,
|
| /external/chromium_org/third_party/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
|
| /external/libcxx/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);
|
| /external/mesa3d/src/mesa/x86/ |
| 3dnow.c | 61 GLfloat *last,
67 GLfloat *last,
|
| /external/chromium_org/third_party/webrtc/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...] |
| /bionic/libc/bionic/ |
| pthread_atfork.cpp | 43 atfork_t* last; member in struct:atfork_list_t
61 for (atfork_t* it = g_atfork_list.last; it != NULL; it = it->prev) {
102 entry->prev = g_atfork_list.last;
109 g_atfork_list.last = entry;
|
| /external/apache-http/src/org/apache/commons/codec/language/ |
| RefinedSoundex.java | 173 char last, current; local
174 last = '*';
179 if (current == last) {
185 last = current;
|
| /external/chromium_org/chrome/browser/spellchecker/ |
| word_trimmer.cc | 21 // A circular buffer of the last |keep + 1| words seen before position |start|
25 size_t last = std::string::npos; local
33 last = iter.pos();
41 last = iter.pos();
49 return text.substr(first, last - first);
|
| /external/chromium_org/third_party/WebKit/Source/platform/text/ |
| TextBoundaries.cpp | 53 int last = i; local
57 return last;
98 *end = it->last();
106 return end < 0 ? it->last() : end;
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ir_basic_block.cpp | 54 ir_instruction *last,
59 ir_instruction *last = NULL; local
101 last = ir;
104 callback(leader, last, data);
|
| /external/clang/test/CodeCompletion/ |
| function-templates.cpp | 3 void sort(RandomAccessIterator first, RandomAccessIterator last);
19 // CHECK-CC1: sort(<#RandomAccessIterator first#>, <#RandomAccessIterator last#>
|
| /external/libcxx/test/algorithms/alg.sorting/alg.binary.search/equal.range/ |
| equal_range.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value);
26 test(Iter first, Iter last, const T& value)
28 std::pair<Iter, Iter> i = std::equal_range(first, last, value);
31 for (Iter j = i.first; j != last; ++j)
35 for (Iter j = i.second; j != last; ++j)
|
| /external/mesa3d/src/glsl/ |
| ir_basic_block.cpp | 54 ir_instruction *last,
59 ir_instruction *last = NULL; local
101 last = ir;
104 callback(leader, last, data);
|
| /external/openssl/apps/ |
| app_rand.c | 168 int last; local
174 last=0;
176 if (*p == '\0') last=1;
187 if (last) break;
|
| /external/libcap-ng/libcap-ng-0.7/bindings/python/test/ |
| capng-test.py | 11 last = capng.CAP_LAST_CAP variable
26 if len < 80 and last > 30:
27 last = 30 variable
29 print("Doing advanced bit tests for %d capabilities...\n" % (last))
30 for i in range(last+1):
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| rbtree.py | 163 last = 0
181 if node is parent[last]:
182 grand_grand_parent[direction2] = jsw_single(grand_parent, 1 - last)
184 grand_grand_parent[direction2] = jsw_double(grand_parent, 1 - last)
191 last = direction
217 last = direction
233 parent[last] = jsw_single(node, direction)
234 parent = parent[last]
236 sibling = parent[1 - last]
238 if (not is_red(sibling[1 - last])) and (not is_red(sibling[last]))
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| RegularContiguousSet.java | 68 final C last = last();
72 return equalsOrThrow(previous, last) ? null : domain.next(previous);
89 @Override public C last() { method
94 long distance = domain.distance(first(), last());
135 C upperEndpoint = Ordering.natural().min(this.last(), other.last());
158 && this.last().equals(that.last());
|
| /external/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
| VariableTranslator.java | 124 JavaExpression last = null; local
126 if (last == null) {
127 last = current;
130 if (current instanceof StringExpression && last instanceof StringExpression) {
131 // Last and current are both strings - combine them.
133 StringExpression lastString = (StringExpression) last;
134 last = new StringExpression(lastString.getValue() + currentString.getValue());
136 out.add(last);
137 last = current;
140 out.add(last);
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderTableRow.cpp | 118 RenderObject* last = beforeChild; local
119 if (!last)
120 last = lastCell();
121 if (last && last->isAnonymous() && last->isTableCell() && !last->isBeforeOrAfterContent()) {
122 RenderTableCell* lastCell = toRenderTableCell(last);
138 if (last && !last->isTableCell() && last->parent() && last->parent()->isAnonymous() && !last->parent()->isBeforeOrAf (…)
[all...] |
| /external/chromium_org/components/autofill/core/browser/ |
| autofill_type_unittest.cc | 37 // Last value, to check any offset errors.
38 AutofillType last(NAME_BILLING_SUFFIX);
39 EXPECT_EQ(NAME_SUFFIX, last.GetStorableType());
40 EXPECT_EQ(NAME_BILLING, last.group());
74 // Last value, to check any offset errors.
75 AutofillType last(HTML_TYPE_CREDIT_CARD_EXP_4_DIGIT_YEAR, HTML_MODE_NONE);
76 EXPECT_EQ(CREDIT_CARD_EXP_4_DIGIT_YEAR, last.GetStorableType());
77 EXPECT_EQ(CREDIT_CARD, last.group());
|
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| hb-set.cc | 226 * @last:
235 hb_codepoint_t last)
237 set->add_range (first, last);
260 * @last:
269 hb_codepoint_t last)
271 set->del_range (first, last);
456 * @last: (inout): input current last and output last codepoint in the range.
459 * are greater than current value of @last
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-set.cc | 226 * @last:
235 hb_codepoint_t last)
237 set->add_range (first, last);
260 * @last:
269 hb_codepoint_t last)
271 set->del_range (first, last);
456 * @last: (inout): input current last and output last codepoint in the range.
459 * are greater than current value of @last
[all...] |
