| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_set.h | 154 * @param last An input iterator.
156 * Create a %set consisting of copies of the elements from [first,last).
158 * otherwise (where N is distance(first,last)).
168 * @param last An input iterator.
172 * Create a %set consisting of copies of the elements from [first,last).
174 * otherwise (where N is distance(first,last)).
298 * Returns a read-only (constant) iterator that points one past the last
307 * Returns a read-only (constant) iterator that points to the last
317 * last pair in the %set. Iteration is done in descending order
335 * Returns a read-only (constant) iterator that points one past the last
[all...] |
| stl_algobase.h | 426 * @brief Copies the range [first,last) into result.
429 * @param last An input iterator.
431 * @return result + (first - last)
437 * [first,last); the copy_backward function should be used instead.
440 * within [first,last).
459 * @brief Moves the range [first,last) into result.
462 * @param last An input iterator.
464 * @return result + (first - last)
470 * [first,last); the move_backward function should be used instead.
473 * within [first,last)
[all...] |
| stl_uninitialized.h | 99 * @brief Copies the range [first,last) into result.
101 * @param last An input iterator.
103 * @return result + (first - last)
156 * @brief Copies the value x into the range [first,last).
158 * @param last An input iterator.
385 // Fills [result, mid) with x, and moves [first, last) into
386 // [mid, mid + (last - first)).
506 // Fills [first, last) with std::distance(first, last) default
550 // Fills [first, last) with std::distance(first, last) defaul
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ |
| initializer_list | 74 // One past the last element.
90 * @brief Return an iterator pointing to one past the last element
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/bits/ |
| sem.h | 42 __time_t sem_otime; /* last semop() time */
44 __time_t sem_ctime; /* last time changed by semctl() */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| pktcdvd.h | 59 #define PACKET_LRA_VALID 3 /* last recorded address valid */
80 * Last session/border status
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/bits/ |
| sem.h | 42 __time_t sem_otime; /* last semop() time */
44 __time_t sem_ctime; /* last time changed by semctl() */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| pktcdvd.h | 59 #define PACKET_LRA_VALID 3 /* last recorded address valid */
80 * Last session/border status
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| regex_constants.h | 161 * last) proceeds according to the rules of the grammar specified for the
199 * The first character in the sequence [first, last) is treated as though it
206 * The last character in the sequence [first, last) is treated as though it
208 * expression shall not match [last, last).
220 * [last,last).
|
| stl_multiset.h | 147 * @param last An input iterator.
150 * [first,last). This is linear in N if the range is already sorted,
151 * and NlogN otherwise (where N is distance(first,last)).
161 * @param last An input iterator.
166 * [first,last). This is linear in N if the range is already sorted,
167 * and NlogN otherwise (where N is distance(first,last)).
291 * Returns a read-only (constant) iterator that points one past the last
301 * last element in the %multiset. Iteration is done in descending order
310 * last element in the %multiset. Iteration is done in descending order
328 * Returns a read-only (constant) iterator that points one past the last
[all...] |
| stl_set.h | 154 * @param last An input iterator.
156 * Create a %set consisting of copies of the elements from [first,last).
158 * otherwise (where N is distance(first,last)).
168 * @param last An input iterator.
172 * Create a %set consisting of copies of the elements from [first,last).
174 * otherwise (where N is distance(first,last)).
298 * Returns a read-only (constant) iterator that points one past the last
307 * Returns a read-only (constant) iterator that points to the last
317 * last pair in the %set. Iteration is done in descending order
335 * Returns a read-only (constant) iterator that points one past the last
[all...] |
| stl_algobase.h | 426 * @brief Copies the range [first,last) into result.
429 * @param last An input iterator.
431 * @return result + (first - last)
437 * [first,last); the copy_backward function should be used instead.
440 * within [first,last).
459 * @brief Moves the range [first,last) into result.
462 * @param last An input iterator.
464 * @return result + (first - last)
470 * [first,last); the move_backward function should be used instead.
473 * within [first,last)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ |
| initializer_list | 74 // One past the last element.
90 * @brief Return an iterator pointing to one past the last element
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| regex_constants.h | 161 * last) proceeds according to the rules of the grammar specified for the
199 * The first character in the sequence [first, last) is treated as though it
206 * The last character in the sequence [first, last) is treated as though it
208 * expression shall not match [last, last).
220 * [last,last).
|
| stl_multiset.h | 147 * @param last An input iterator.
150 * [first,last). This is linear in N if the range is already sorted,
151 * and NlogN otherwise (where N is distance(first,last)).
161 * @param last An input iterator.
166 * [first,last). This is linear in N if the range is already sorted,
167 * and NlogN otherwise (where N is distance(first,last)).
291 * Returns a read-only (constant) iterator that points one past the last
301 * last element in the %multiset. Iteration is done in descending order
310 * last element in the %multiset. Iteration is done in descending order
328 * Returns a read-only (constant) iterator that points one past the last
[all...] |
| stl_set.h | 154 * @param last An input iterator.
156 * Create a %set consisting of copies of the elements from [first,last).
158 * otherwise (where N is distance(first,last)).
168 * @param last An input iterator.
172 * Create a %set consisting of copies of the elements from [first,last).
174 * otherwise (where N is distance(first,last)).
298 * Returns a read-only (constant) iterator that points one past the last
307 * Returns a read-only (constant) iterator that points to the last
317 * last pair in the %set. Iteration is done in descending order
335 * Returns a read-only (constant) iterator that points one past the last
[all...] |
| stl_algobase.h | 426 * @brief Copies the range [first,last) into result.
429 * @param last An input iterator.
431 * @return result + (first - last)
437 * [first,last); the copy_backward function should be used instead.
440 * within [first,last).
459 * @brief Moves the range [first,last) into result.
462 * @param last An input iterator.
464 * @return result + (first - last)
470 * [first,last); the move_backward function should be used instead.
473 * within [first,last)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ |
| initializer_list | 74 // One past the last element.
90 * @brief Return an iterator pointing to one past the last element
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| regex_constants.h | 161 * last) proceeds according to the rules of the grammar specified for the
199 * The first character in the sequence [first, last) is treated as though it
206 * The last character in the sequence [first, last) is treated as though it
208 * expression shall not match [last, last).
220 * [last,last).
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ |
| initializer_list | 77 // One past the last element.
93 * @brief Return an iterator pointing to one past the last element
|
| /system/core/adb/ |
| utils.c | 29 if (avail == 1) { /* overflowing, the last byte is reserved for zero */
90 * trigger that last case. */
|
| /ndk/sources/cxx-stl/llvm-libc++/include/ |
| algorithm | 24 all_of(InputIterator first, InputIterator last, Predicate pred);
28 any_of(InputIterator first, InputIterator last, Predicate pred);
32 none_of(InputIterator first, InputIterator last, Predicate pred);
36 for_each(InputIterator first, InputIterator last, Function f);
40 find(InputIterator first, InputIterator last, const T& value);
44 find_if(InputIterator first, InputIterator last, Predicate pred);
48 find_if_not(InputIterator first, InputIterator last, Predicate pred);
72 adjacent_find(ForwardIterator first, ForwardIterator last);
76 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
80 count(InputIterator first, InputIterator last, const T& value)
[all...] |
| /external/libvorbis/lib/ |
| envelope.c | 14 last mod: $Id: envelope.c 16227 2009-07-08 06:58:46Z xiphmont $
224 int last=v->pcm_current/ve->searchstep-VE_WIN; local
228 if(last+VE_WIN+VE_POST>ve->storage){
229 ve->storage=last+VE_WIN+VE_POST; /* be sure */
233 for(j=first;j<last;j++){
259 ve->current=last*ve->searchstep;
298 for(l=0;l<last;l++)marker[l*ve->searchstep]=ve->filter[m].markers[l]*.1;
305 for(l=0;l<last;l++)marker[l*ve->searchstep]=ve->filter[m+VE_BANDS].markers[l]*.1;
309 for(l=0;l<last;l++)marker[l*ve->searchstep]=ve->mark[l]*.4;
348 long last=endW/ve->searchstep local
[all...] |
| /external/v8/test/cctest/ |
| test-cpu-profiler.cc | 174 CHECK_EQ("bbb", top_down_root_children->last()->entry()->name());
176 top_down_root_children->last()->children();
178 CHECK_EQ("5", top_down_bbb_children->last()->entry()->name());
180 top_down_bbb_children->last()->children();
182 CHECK_EQ("ddd", top_down_stub_children->last()->entry()->name());
184 top_down_stub_children->last()->children();
199 CHECK_EQ("bbb", bottom_up_stub_children->last()->entry()->name());
206 CHECK_EQ("5", bottom_up_ddd_children->last()->entry()->name());
208 bottom_up_ddd_children->last()->children();
210 CHECK_EQ("bbb", bottom_up_ddd_stub_children->last()->entry()->name())
[all...] |
| /external/zlib/src/contrib/ada/ |
| zlib.ads | 179 Last : out Ada.Streams.Stream_Element_Offset);
224 -- Out_Data. In_Last is the index of last element from In_Data accepted by
225 -- the Filter. Out_Last is the last element of the received data from
261 Last : out Ada.Streams.Stream_Element_Offset);
270 -- Rest_First have to be initialized to Buffer'Last + 1
271 -- Rest_Last have to be initialized to Buffer'Last
275 -- Is it allowed to return Last < Item'Last before end of data.
280 Last : out Ada.Streams.Stream_Element_Offset;
285 -- Last < Item'Last only at end of stream
[all...] |
