| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| H A D | next_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
| H A D | next_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
| H A D | prev_permutation.pass.cpp | 39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
| H A D | prev_permutation_comp.pass.cpp | 41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
| /ndk/sources/host-tools/ndk-stack/elff/ |
| H A D | elf_alloc.h | 50 ElfAllocatorChunk* prev; member in struct:ElfAllocatorChunk
|
| H A D | dwarf_cu.h | 189 void set_prev_cu(DwarfCU* prev) { argument
190 prev_cu_ = prev;
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/ |
| H A D | lazy_ostream.hpp | 66 lazy_ostream_impl( lazy_ostream const& prev, T value ) argument
68 , m_prev( prev )
86 operator<<( lazy_ostream const& prev, T const& v ) argument
88 return lazy_ostream_impl<T const&>( prev, v );
97 operator<<( lazy_ostream const& prev, R& (BOOST_TEST_CALL_DECL *man)(S&) ) argument
99 return lazy_ostream_impl<R& (BOOST_TEST_CALL_DECL *)(S&)>( prev, man );
|
| /ndk/sources/host-tools/make-3.81/ |
| H A D | filedef.h | 40 struct file *prev; /* Previous entry for same file name; member in struct:file
|
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| H A D | obstack.h | 146 struct _obstack_chunk *prev; /* address of prior chunk or NULL */
294 (__o->chunk->prev == 0 \
422 ((h)->chunk->prev == 0 \
145 struct _obstack_chunk *prev; /* address of prior chunk or NULL */ member in struct:_obstack_chunk
|
| H A D | regcomp.c | 1213 bin_tree_t *node, *prev;
1232 prev = node;
1236 while (node->right == prev || node->right == NULL);
1258 bin_tree_t *prev = NULL;
1259 while (node->right == prev || node->right == NULL)
1261 prev = node;
1981 char prev = re_string_peek_byte (input, -1);
1982 if (!(syntax & RE_NEWLINE_ALT) || prev != '\n')
3852 const bin_tree_t *prev = NULL;
3853 while (node->right == prev || nod
1206 bin_tree_t *node, *prev; local
1251 bin_tree_t *prev = NULL; local
1973 char prev = re_string_peek_byte (input, -1); local
3841 const bin_tree_t *prev = NULL; local
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/sed/ |
| H A D | utils.c | 298 struct open_file *prev;
303 prev = &r;
304 while ( (cur = prev->link) )
309 prev->link = cur->link;
314 prev = cur;
297 struct open_file *prev; local
|
| /ndk/sources/host-tools/nawk-20071023/ |
| H A D | tran.c | 188 Cell *p, *prev = NULL; local
193 for (p = tp->tab[h]; p != NULL; prev = p, p = p->cnext)
195 if (prev == NULL) /* 1st one */
198 prev->cnext = p->cnext;
|
| /ndk/tests/build/issue56508-gcc4.7-ICE/jni/ |
| H A D | extraMachine.c | 14 struct hdl *prev; /* previous modified handle */ member in struct:save_restore_link
|