/external/v8/test/mjsunit/regress/ |
H A D | regress-1708.js | 35 var tail = head; variable 40 tail[1] = new Array(1000); 41 tail = tail[1]; 60 tail[1] = new Array(1000); 61 tail = tail[1];
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | p2.cpp | 13 void recurse_until_fail(const Head &, const Tail &...tail) { // expected-note{{candidate function template not viable: requires at least 1 argument, but 0 were provided}} argument 14 recurse_until_fail(tail...); // expected-error{{no matching function for call to 'recurse_until_fail'}} \
|
/external/icu4c/layout/ |
H A D | LEInsertionList.h | 150 * The tail of the insertion list. 154 InsertionRecord *tail; member in class:LEInsertionList
|
/external/dropbear/ |
H A D | queue.h | 38 struct Link* tail; member in struct:Queue
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | BstPathTest.java | 30 private SimplePath(SimpleNode tip, SimplePath tail) { argument 31 super(tip, tail);
|
/external/kernel-headers/original/linux/ |
H A D | circ_buf.h | 7 int tail; member in struct:circ_buf 11 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1)) 14 as a completely full buffer has head == tail, which is the same as 16 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size)) 19 accessing head and tail more than once, so they can change 21 #define CIRC_CNT_TO_END(head,tail,size) \ 22 ({int end = (size) - (tail); \ 27 #define CIRC_SPACE_TO_END(head,tail,siz [all...] |
/external/marisa-trie/tests/ |
H A D | tail-test.cc | 4 #include <marisa/tail.h> 13 marisa::Tail tail; local 15 ASSERT(tail.size() == 0); 16 ASSERT(tail.empty()); 17 ASSERT(tail.total_size() == sizeof(marisa::UInt32)); 20 tail.build(keys, NULL, MARISA_BINARY_TAIL); 22 ASSERT(tail.size() == 0); 23 ASSERT(tail.empty()); 24 ASSERT(tail.total_size() == sizeof(marisa::UInt32)); 28 tail 139 marisa::Tail tail; local [all...] |
/external/marisa-trie/v0_1_5/tests/ |
H A D | tail-test.cc | 4 #include <marisa_alpha/tail.h> 13 marisa_alpha::Tail tail; local 15 ASSERT(tail.size() == 0); 16 ASSERT(tail.empty()); 17 ASSERT(tail.total_size() == sizeof(marisa_alpha::UInt32)); 20 tail.build(keys, NULL, MARISA_ALPHA_BINARY_TAIL); 22 ASSERT(tail.size() == 0); 23 ASSERT(tail.empty()); 24 ASSERT(tail.total_size() == sizeof(marisa_alpha::UInt32)); 28 tail 143 marisa_alpha::Tail tail; local [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRUnbufferedCommonTreeNodeStream.h | 56 NSUInteger tail; variable 72 @property (assign, getter=getTail, setter=setTail:) NSUInteger tail; variable
|
/external/checkpolicy/ |
H A D | queue.h | 26 queue_node_ptr_t tail; member in struct:queue_info
|
/external/eigen/Eigen/src/Core/ |
H A D | VectorBlock.h | 175 DenseBase<Derived>::tail(Index size) function in class:Eigen::DenseBase 181 /** This is the const version of tail(Index).*/ 184 DenseBase<Derived>::tail(Index size) const function in class:Eigen::DenseBase 266 DenseBase<Derived>::tail() function in class:Eigen::DenseBase 272 /** This is the const version of tail<int>.*/ 276 DenseBase<Derived>::tail() const function in class:Eigen::DenseBase
|
/external/iproute2/tc/ |
H A D | f_basic.c | 42 struct rtattr *tail; local 59 tail = (struct rtattr*)(((void*)n)+NLMSG_ALIGN(n->nlmsg_len)); 105 tail->rta_len = (((void*)n)+n->nlmsg_len) - (void*)tail;
|
H A D | f_cgroup.c | 29 struct rtattr *tail; local 43 tail = (struct rtattr*)(((void*)n)+NLMSG_ALIGN(n->nlmsg_len)); 80 tail->rta_len = (((void*)n)+n->nlmsg_len) - (void*)tail;
|
H A D | f_route.c | 41 struct rtattr *tail; local 57 tail = NLMSG_TAIL(n); 124 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
H A D | f_tcindex.c | 31 struct rtattr *tail; local 42 tail = NLMSG_TAIL(n); 116 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
H A D | q_drr.c | 56 struct rtattr *tail; local 59 tail = NLMSG_TAIL(n); 81 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *)tail;
|
H A D | q_dsmark.c | 32 struct rtattr *tail; local 71 tail = NLMSG_TAIL(n); 80 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail; 94 struct rtattr *tail; local 98 tail = NLMSG_TAIL(n); 126 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
H A D | IntQueue.java | 29 private IntQueue.Entry tail; field in class:IntQueue 33 if (tail != null) 34 tail.next = entry; 35 tail = entry; 52 tail = null;
|
/external/llvm/unittests/IR/ |
H A D | WaymarkTest.cpp | 27 static uint8_t tail[22] = "s02s33s30y2y0s1x0syxS"; local 29 std::transform(tail, tail + 22, values, char2constant);
|
/external/srec/seti/sltsEngine/include/ |
H A D | linklist.h | 32 struct LNode *tail; member in struct:LList
|
/external/clang/test/SemaTemplate/ |
H A D | example-typelist.cpp | 10 typedef Tail tail; typedef in struct:cons 50 typedef typename reverse<typename T::tail>::type reversed_tail; 52 typedef typename reverse<typename reversed_tail::tail>::type most_of_tail; 83 struct find : find<typename List::tail, T> { };
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | BstInOrderPath.java | 62 N tip, @Nullable BstSide sideExtension, @Nullable BstInOrderPath<N> tail) { 63 super(tip, tail); 65 assert (sideExtension == null) == (tail == null); 120 * Returns the direction this path went in relative to its tail path, or {@code null} if this 121 * path has no tail. 61 BstInOrderPath( N tip, @Nullable BstSide sideExtension, @Nullable BstInOrderPath<N> tail) argument
|
/external/marisa-trie/lib/marisa/ |
H A D | progress.h | 44 int tail() const { function in class:marisa::Progress
|
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
H A D | progress.h | 44 int tail() const { function in class:marisa_alpha::Progress
|
/external/opencv/cvaux/src/ |
H A D | extendededges.cpp | 137 CvSeq* tail = 0; local 184 if( tail ) 186 tail->v_next = newseq; 187 newseq->v_prev = tail; 188 tail = newseq; 192 output = tail = newseq; 204 if( tail ) 206 tail->v_next = newseq; 207 newseq->v_prev = tail; 208 tail [all...] |