Searched defs:tail (Results 1 - 25 of 165) sorted by relevance

1234567

/external/v8/test/mjsunit/regress/
H A Dregress-1708.js35 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 Dp2.cpp13 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 DLEInsertionList.h150 * The tail of the insertion list.
154 InsertionRecord *tail; member in class:LEInsertionList
/external/dropbear/
H A Dqueue.h38 struct Link* tail; member in struct:Queue
/external/guava/guava-tests/test/com/google/common/collect/
H A DBstPathTest.java30 private SimplePath(SimpleNode tip, SimplePath tail) { argument
31 super(tip, tail);
/external/kernel-headers/original/linux/
H A Dcirc_buf.h7 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 Dtail-test.cc4 #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 Dtail-test.cc4 #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 DANTLRUnbufferedCommonTreeNodeStream.h56 NSUInteger tail; variable
72 @property (assign, getter=getTail, setter=setTail:) NSUInteger tail; variable
/external/checkpolicy/
H A Dqueue.h26 queue_node_ptr_t tail; member in struct:queue_info
/external/eigen/Eigen/src/Core/
H A DVectorBlock.h175 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 Df_basic.c42 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 Df_cgroup.c29 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 Df_route.c41 struct rtattr *tail; local
57 tail = NLMSG_TAIL(n);
124 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Df_tcindex.c31 struct rtattr *tail; local
42 tail = NLMSG_TAIL(n);
116 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dq_drr.c56 struct rtattr *tail; local
59 tail = NLMSG_TAIL(n);
81 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *)tail;
H A Dq_dsmark.c32 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 DIntQueue.java29 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 DWaymarkTest.cpp27 static uint8_t tail[22] = "s02s33s30y2y0s1x0syxS"; local
29 std::transform(tail, tail + 22, values, char2constant);
/external/srec/seti/sltsEngine/include/
H A Dlinklist.h32 struct LNode *tail; member in struct:LList
/external/clang/test/SemaTemplate/
H A Dexample-typelist.cpp10 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 DBstInOrderPath.java62 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 Dprogress.h44 int tail() const { function in class:marisa::Progress
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
H A Dprogress.h44 int tail() const { function in class:marisa_alpha::Progress
/external/opencv/cvaux/src/
H A Dextendededges.cpp137 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...]

Completed in 578 milliseconds

1234567