HomeSort by relevance Sort by last modified time
    Searched defs:last (Results 276 - 300 of 2704) sorted by null

<<11121314151617181920>>

  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/
rexpr.c 336 int first, last, i; local
349 first = *(s-1); /* Get last char */
354 last = tokchar;
356 for (i = first+1; i <= last; i++)
  /external/ImageMagick/MagickCore/
vision.c 174 last,
565 last=first;
570 last=strtol(p+1,&p,10);
571 if (last < 0)
572 last+=(long) component_image->colors;
574 for (step=first > last ? -1 : 1; first != (last+step); first+=step)
598 last=first;
603 last=strtol(p+1,&p,10);
604 if (last < 0
172 last, local
    [all...]
  /external/Microsoft-GSL/tests/
string_span_tests.cpp 854 int last = 0; local
859 last = 3;
861 span[last] = '\0';
908 int last = 0; local
913 last = 3;
915 span[last] = L'\0';
  /external/annotation-tools/asmx/src/org/objectweb/asm/
AnnotationWriter.java 262 AnnotationWriter last = null; local
267 aw.prev = last;
268 last = aw;
273 aw = last;
294 AnnotationWriter last = null; local
299 aw.prev = last;
300 last = aw;
304 aw = last;
  /external/apache-commons-math/src/main/java/org/apache/commons/math/util/
MultidimensionalCounter.java 63 * Index of last dimension.
65 private final int last; field in class:MultidimensionalCounter
85 counter[last] = -1;
105 for (int i = last; i >= 0; i--) {
170 last = dimension - 1;
171 int tS = size[last];
172 for (int i = 0; i < last; i++) {
180 uniCounterOffset[last] = 0;
224 for (int i = 0; i < last; i++) {
242 indices[last] = idx
    [all...]
  /external/apache-http/src/org/apache/commons/codec/language/
Soundex.java 263 char last, mapped; local
266 last = getMappingCode(str, 0);
270 if ((mapped != '0') && (mapped != last)) {
273 last = mapped;
  /external/blktrace/btt/
list.h 195 struct list_head *last = list->prev; local
201 last->next = at;
202 at->prev = last;
  /external/boringssl/src/crypto/x509v3/
pcy_tree.c 272 * last in the chain.
314 X509_POLICY_LEVEL *last = curr - 1; local
319 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) {
320 node = sk_X509_POLICY_NODE_value(last->nodes, i);
321 if (policy_node_match(last, node, data->valid_policy)) {
327 if (!matched && last->anyPolicy) {
328 if (!level_add_node(curr, data, last->anyPolicy, NULL))
403 const X509_POLICY_LEVEL *last = curr - 1; local
406 if ((last->flags & X509_V_FLAG_INHIBIT_MAP)
443 X509_POLICY_LEVEL *last = curr - 1 local
    [all...]
  /external/brotli/research/
draw_histogram.cc 57 static int last = 0; local
60 if (*pos < last) {
63 last = *pos;
  /external/clang/lib/Driver/
Multilib.cpp 40 StringRef last = path::filename(seg); local
41 if (last != ".")
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_symbolizer_libbacktrace.cc 90 SymbolizedStack *last; member in struct:__sanitizer::__anon17195::SymbolizeCodeCallbackArg
94 CHECK(last);
99 last->next = cur;
100 last = cur;
103 CHECK_EQ(addr, last->info.address);
104 return &last->info;
161 data.last = stack;
  /external/dng_sdk/source/
dng_color_spec.cpp 531 dng_xy_coord last = D50_xy_coord (); local
536 dng_matrix xyzToCamera = FindXYZtoCamera (last);
540 if (Abs_real64 (next.x - last.x) +
541 Abs_real64 (next.y - last.y) < 0.0000001)
549 // in a two value oscillation. So take the average of the last
555 next.x = (last.x + next.x) * 0.5;
556 next.y = (last.y + next.y) * 0.5;
560 last = next;
564 return last;
  /external/eigen/bench/tensors/
benchmark_main.cc 159 int last = iterations; local
165 iterations = std::max(last + 1, std::min(iterations + iterations/2, 100*last));
  /external/elfutils/libdwfl/
cu.c 113 /* It might be in the last range. */
114 const Dwarf_Arange *last local
116 if (addr > last->addr + last->length)
  /external/f2fs-tools/fsck/
xattr.c 118 struct f2fs_xattr_entry *here, *last; local
164 last = here;
165 while (!IS_XATTR_LAST_ENTRY(last))
166 last = XATTR_NEXT_ENTRY(last);
177 free = MIN_OFFSET - ((char *)last - (char *)base_addr);
195 memmove(here, next, (char *)last - (char *)next);
196 last = (struct f2fs_xattr_entry *)((char *)last - oldsize);
197 memset(last, 0, oldsize)
    [all...]
  /external/fio/lib/
prio_tree.c 50 *heap = node->last;
81 struct prio_tree_node *first = NULL, *prev, *last = NULL; local
96 last = first;
98 prev = last;
99 last = root->prio_tree_node;
101 INIT_PRIO_TREE_NODE(last);
102 prev->left = last;
103 last->parent = prev;
113 last = node;
116 last->left = root->prio_tree_node
    [all...]
  /external/freetype/src/gxvalid/
gxvmort2.c 174 FT_UShort last; local
182 last = (FT_UShort)( ( lig_action >> 31 ) & 1 );
gxvmorx2.c 173 FT_UShort last; local
182 last = (FT_UShort)( ( lig_action >> 31 ) & 1 );
  /external/guava/guava/src/com/google/common/collect/
EmptyContiguousSet.java 41 @Override public C last() { method in class:EmptyContiguousSet
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
RegularContiguousSet.java 69 final C last = last();
73 return equalsOrThrow(previous, last) ? null : domain.next(previous);
90 @Override public C last() { method
95 long distance = domain.distance(first(), last());
125 C upperEndpoint = Ordering.natural().min(this.last(), other.last());
148 && this.last().equals(that.last());
  /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
SortedSetNavigationTester.java 77 sortedSet.last();
90 assertEquals(a, sortedSet.last());
100 assertEquals(c, sortedSet.last());
  /external/guava/guava-tests/test/com/google/common/collect/
SynchronizedNavigableSetTest.java 143 @Override public E last() { method in class:SynchronizedNavigableSetTest.TestSet
145 return delegate().last();
  /external/harfbuzz_ng/src/
gen-indic-table.py 184 last = -100000 variable
191 if u <= last:
201 if start != last + 1:
202 if start - last <= 1+16*3:
203 print_block (None, last+1, start-1, data)
204 last = start-1 variable
206 if last >= 0:
207 ends.append (last + 1)
215 last = end variable
216 ends.append (last + 1
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/lang/
CharSequences.java 46 // s.trim() => UnicodeSet.trim(CharSequence s); return a subsequence starting with the first character not in the set to the last character not in the set.
295 char last = (char) result[j-1]; local
296 if (last >= 0xD800 && last <= 0xDBFF) {
298 result[j-1] = Character.toCodePoint(last, cp);
  /external/icu/icu4c/source/common/
normlzr.cpp 316 * Return the last character in the normalized text. This resets
320 UChar32 Normalizer::last() { function in class:Normalizer

Completed in 2677 milliseconds

<<11121314151617181920>>