/external/icu4c/tools/genprops/misc/ |
ucdmerge.c | 75 long first, last, c; local 78 first=last=-1; 96 if(last>=0 && (c!=(last+1) || !sameData(firstLine, line))) { 98 if(first==last) { 107 first, last, /* code point range */ 112 first, last, /* code point range */ 118 first, last, /* code point range */ 123 first=last=-1; 135 if(last<0) [all...] |
/external/kernel-headers/original/linux/netfilter/ |
nf_conntrack_tcp.h | 46 u_int8_t last_dir; /* Direction of the last packet (enum ip_conntrack_dir) */ 48 u_int8_t last_index; /* Index of the last packet */ 49 u_int32_t last_seq; /* Last sequence number seen in dir */ 50 u_int32_t last_ack; /* Last sequence number seen in opposite dir */ 51 u_int32_t last_end; /* Last seq + len */
|
/frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
ualgobase.h | 49 /// Copy copies elements from the range [first, last) to the range 50 /// [result, result + (last - first)). That is, it performs the assignments 52 /// for every integer n from 0 to last - first, copy performs the assignment 58 inline OutputIterator copy (InputIterator first, InputIterator last, OutputIterator result) 60 for (; first != last; ++result, ++first) 81 /// \brief Copy copies elements from the range (last, first] to result. 83 /// Copies elements starting at last, decrementing both last and result. 86 inline OutputIterator copy_backward (InputIterator first, InputIterator last, OutputIterator result) 88 while (first != last) [all...] |
ulist.h | 49 void splice (iterator ip, list<T>& l, iterator first = NULL, iterator last = NULL); 61 /// Moves the range [first, last) from \p l to this list at \p ip. 63 void list<T>::splice (iterator ip, list<T>& l, iterator first, iterator last) 67 if (!last) 68 last = l.end(); 69 insert (ip, first, last); 70 l.erase (first, last);
|
umap.h | 61 inline const_iterator find_data (const_data_ref v, const_iterator first = NULL, const_iterator last = NULL) const; 62 inline iterator find_data (const_data_ref v, iterator first = NULL, iterator last = NULL); 77 const_iterator first (begin()), last (end()); 78 while (first != last) { 79 const_iterator mid = advance (first, distance (first,last) / 2); 83 last = mid; 96 /// Returns the pair<K,V> where V = \p v, occuring in range [first,last). 98 inline typename map<K,V>::const_iterator map<K,V>::find_data (const_data_ref v, const_iterator first, const_iterator last) const 101 if (!last) last = end() [all...] |
uctralgo.h | 22 /// Copy copies elements from the range [first, last) to the range 23 /// [result, result + (last - first)). That is, it performs the assignments 25 /// for every integer n from 0 to last - first, copy performs the assignment 36 /// Copy_if copies elements from the range [first, last) to the range 37 /// [result, result + (last - first)) if pred(*i) returns true. 47 /// [first, last); f's return value, if any, is ignored. Applications are 48 /// performed in forward order, i.e. from first to last. For_each returns 59 /// [first, last); f's return value, if any, is ignored. Applications are 60 /// performed in forward order, i.e. from first to last. For_each returns 70 /// Returns the first iterator i in the range [first, last) such tha [all...] |
/development/tools/idegen/src/ |
Stopwatch.java | 22 long last = System.currentTimeMillis(); field in class:Stopwatch 26 Log.info(label + ": " + (now - last) + "ms"); 27 last = now;
|
/frameworks/base/core/tests/coretests/src/android/widget/gridview/touch/ |
GridTouchStackFromBottomTest.java | 62 assertEquals("Last item not the last child in the grid", 65 assertEquals("Last item not at the bottom of the grid", 79 assertEquals("Last item not the last child in the grid", 82 assertEquals("Last item not at the bottom of the grid", 96 assertEquals("Last item not the last child in the grid", 99 assertEquals("Last item not at the bottom of the grid", 113 assertEquals("Last item not the last child in the grid" [all...] |
/external/webkit/WebCore/platform/text/ |
BidiResolver.h | 60 , last(WTF::Unicode::OtherNeutral) 67 , last(lastDir) 74 WTF::Unicode::Direction last; member in struct:WebCore::BidiStatus 80 return status1.eor == status2.eor && status1.last == status2.last && status1.lastStrong == status2.lastStrong && *(status1.context) == *(status2.context); 150 void setLastDir(WTF::Unicode::Direction lastDir) { m_status.last = lastDir; } 187 Iterator last; member in class:WebCore::BidiResolver 315 if (!emptyRun && eor != last) { 317 // bidi.sor ... bidi.eor ... bidi.last eor; need to append the bidi.sor-bidi.eor run or extend it through bidi.last [all...] |
/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++) {
|
/external/kernel-headers/original/asm-arm/ |
sembuf.h | 16 __kernel_time_t sem_otime; /* last semop time */ 18 __kernel_time_t sem_ctime; /* last change time */
|
/external/kernel-headers/original/asm-x86/ |
sembuf.h | 15 __kernel_time_t sem_otime; /* last semop time */ 17 __kernel_time_t sem_ctime; /* last change time */
|
shmbuf.h | 20 __kernel_time_t shm_atime; /* last attach time */ 24 __kernel_time_t shm_dtime; /* last detach time */ 28 __kernel_time_t shm_ctime; /* last change time */ 33 __kernel_pid_t shm_lpid; /* pid of last operator */
|
/external/opencore/codecs_v2/video/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);
|
/external/oprofile/daemon/ |
opd_mangling.c | 69 mangle_filename(struct sfile * last, struct sfile const * sf, int counter, int cg) 109 if (last->kernel) { 110 values.cg_image_name = last->kernel->name; 111 } else if (last->anon) { 113 values.cg_image_name = mangle_anon(last->anon); 114 values.anon_name = last->anon->name; 116 values.cg_image_name = find_cookie(last->cookie); 141 int opd_open_sample_file(odb_t *file, struct sfile *last, 150 mangled = mangle_filename(last, sf, counter, cg); 161 if (sf != last) [all...] |
/dalvik/tests/082-inline-execute/ |
expected.txt | 7 Now is the time[last] = "e"
|
/external/libffi/ |
libtool-version | 16 # 3. If the library source code has changed at all since the last 20 # last update, increment current, and set revision to 0. 22 # 5. If any interfaces have been added since the last public release, 25 # 6. If any interfaces have been removed since the last public
|
/external/webkit/WebCore/manual-tests/ |
autofill-popup-width-and-item-direction.html | 13 <p> Try type some long text in the "Last name" input box, 19 <p> Try type the following text into the "First name" and "Last name". 29 and should be displayed as LTR in the popup of the "Last name". 33 Last name: <input type="text" name="lname" /><br />
|
/external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
SDL_qsort.c | 92 typedef struct { char * first; char * last; } stack_entry; member in struct:__anon4321 93 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;} 94 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;} 95 #define doLeft {first=ffirst;llast=last;continue;} 96 #define doRight {ffirst=first;last=llast;continue;} 99 last=llast=stack[stacktop].last;\ 115 * 3. We choose a pivot by looking at the first, last 169 { size_t l=last-ffirst,r=llast-first; 307 char *first,*last; local 338 char *first,*last; local 369 char *first,*last; local [all...] |
/bionic/libc/string/ |
strtok.c | 35 static char *last; local 37 return strtok_r(s, delim, &last); 41 strtok_r(char *s, const char *delim, char **last) 48 if (s == NULL && (s = *last) == NULL) 62 *last = NULL; 80 *last = s;
|
/packages/apps/Email/src/org/apache/commons/io/comparator/ |
LastModifiedFileComparator.java | 24 * Compare the <b>last modified date/time</b> of two files for order
28 * by their last modified date/time.
50 /** Last modified comparator instance */
53 /** Reverse last modified comparator instance */
57 * Compare the last the last modified date/time of two files.
|
/external/zlib/examples/ |
gzjoin.c | 271 /* Copy the compressed data from name, zeroing the last block bit of the last 273 boundary. If clr is false, then the last block becomes the last block of 282 int pos; /* where the "last block" bit is in byte */ 283 int last; /* true if processing the last block */ local 308 /* inflate and copy compressed data, clear last-block bit if requested */ 312 last = start[0] & 1; 313 if (last && clr [all...] |
/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...] |
/external/easymock/src/org/easymock/ |
CaptureType.java | 35 * Will capture the argument of the last matching call
37 LAST,
|
/build/tools/droiddoc/templates/ |
lists.cs | 3 ?> { id:<?cs var: page.id ?>, label:"<?cs var:page.label ?>", link:"<?cs var:page.link ?>", type:"<?cs var:page.type ?>" }<?cs if:!last(page) ?>,<?cs /if ?>
|