| /frameworks/compile/mclinker/lib/Target/Hexagon/ |
| HexagonGOT.h | 49 HexagonGOTEntry* m_pLast; ///< the last consumed entry
|
| /libcore/include/ |
| ScopedBytes.h | 26 * (On Android, this last group only contains MappedByteBuffers.)
|
| /libcore/luni/src/main/java/java/io/ |
| SequenceInputStream.java | 26 * the first stream until it ends, then the next stream is used, until the last
126 * the next one. Blocks until one byte has been read, the end of the last
129 * @return the byte read or -1 if either the end of the last stream in the
173 * is closed or if the end of the last stream in the sequence has
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 92 * - There is exactly one (last) Node with a null next reference,
93 * which is CASed when enqueueing. This last Node can be
123 * to be two or more steps away from the first/last node.
208 * A node from which the last node on list (that is, the unique
211 * - the last node is always reachable from tail via succ()
303 // p is last node
493 Node<E> beginningOfTheEnd = null, last = null; local
498 beginningOfTheEnd = last = newNode;
500 last.lazySetNext(newNode);
501 last = newNode
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1_MessageDigestImpl.java | 95 // - lastWord < 14 - two last, these are 14 & 15, words in 16 word frame are free;
97 // - lastWord = 14 - only one last, namely 15-th, word in frame doesn't contain bytes;
99 // - lastWord > 14 - last word in frame is not full;
108 buffer[15] = 0; // last word in frame is set to "0"
|
| /libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| PinFailureLogger.java | 40 // update the last logged time
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldTreeSetTest.java | 166 // Test for method java.lang.Object java.util.TreeSet.last()
167 assertTrue("Returned incorrect last element",
168 ts.last() == objArray[objArray.length - 1]);
172 ts.last();
|
| /libcore/luni/src/test/java/org/apache/harmony/crypto/tests/support/ |
| MyKeyAgreementSpi.java | 48 throw new IllegalStateException("last Phase is false");
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.copy/ |
| copy_backward.pass.cpp | 15 // copy_backward(InIter first, InIter last, OutIter result);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.generate/ |
| generate.pass.cpp | 16 // generate(Iter first, Iter last, Generator gen);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.random.shuffle/ |
| random_shuffle.pass.cpp | 15 // random_shuffle(Iter first, Iter last);
|
| random_shuffle_rand.pass.cpp | 16 // random_shuffle(Iter first, Iter last, Rand&& rand);
|
| random_shuffle_urng.pass.cpp | 13 // void shuffle(RandomAccessIterator first, RandomAccessIterator last,
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.replace/ |
| replace.pass.cpp | 17 // replace(Iter first, Iter last, const T& old_value, const T& new_value);
|
| replace_if.pass.cpp | 17 // replace_if(Iter first, Iter last, Pred pred, const T& new_value);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.adjacent.find/ |
| adjacent_find.pass.cpp | 15 // adjacent_find(Iter first, Iter last);
|
| adjacent_find_pred.pass.cpp | 15 // adjacent_find(Iter first, Iter last, Pred pred);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.all_of/ |
| all_of.pass.cpp | 14 // all_of(InputIterator first, InputIterator last, Predicate pred);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.count/ |
| count.pass.cpp | 15 // count(Iter first, Iter last, const T& value);
|
| count_if.pass.cpp | 15 // count_if(Iter first, Iter last, Pred pred);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find/ |
| find.pass.cpp | 15 // find(Iter first, Iter last, const T& value);
|
| find_if.pass.cpp | 15 // find_if(Iter first, Iter last, Pred pred);
|
| find_if_not.pass.cpp | 15 // find_if_not(Iter first, Iter last, Pred pred);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.foreach/ |
| test.pass.cpp | 15 // for_each(Iter first, Iter last, Function f);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| make_heap.pass.cpp | 15 // make_heap(Iter first, Iter last);
|
