Searched refs:tail (Results 1 - 25 of 310) sorted by relevance

1234567891011>>

/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/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/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/eigen/doc/snippets/
H A DMatrixBase_end_int.cpp3 cout << "Here is v.tail(2):" << endl << v.tail(2) << endl;
4 v.tail(2).setZero();
H A DMatrixBase_template_int_end.cpp3 cout << "Here is v.tail(2):" << endl << v.tail<2>() << endl;
4 v.tail<2>().setZero();
H A DTutorial_commainit_01b.cpp4 m.col(2).tail(2) << 6, 9;
/external/valgrind/main/auxprogs/
H A Ddump_insn_ppc.sh4 =(perl -e 'print pack "N", hex $ARGV[0]' $1) | tail +7
/external/javassist/src/main/javassist/compiler/ast/
H A DCondExpr.java32 public ASTree thenExpr() { return tail().head(); }
34 public void setThen(ASTree t) { tail().setHead(t); }
36 public ASTree elseExpr() { return tail().tail().head(); }
38 public void setElse(ASTree t) { tail().tail().setHead(t); }
/external/apache-harmony/security/src/test/support/common/java/org/apache/harmony/security/tests/support/
H A DTestUtils.java51 String tail = Integer.toHexString(0x000000ff & data[i]);
52 if (tail.length() == 1) {
53 tail = "0" + tail;
55 System.out.print(prefix + "0x" + tail + delimiter);
/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/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...]
/external/valgrind/tsan/
H A Dignore.cc46 string tail; local
47 if (CutStringPrefixIfPresent(input_line, "obj:", &tail)) {
48 ignore_lists->ignores.push_back(IgnoreObj(tail));
49 } else if (CutStringPrefixIfPresent(input_line, "src:", &tail)) {
50 ignore_lists->ignores.push_back(IgnoreFile(tail));
51 } else if (CutStringPrefixIfPresent(input_line, "fun:", &tail)) {
52 ignore_lists->ignores.push_back(IgnoreFun(tail));
53 } else if (CutStringPrefixIfPresent(input_line, "fun_r:", &tail)) {
54 ignore_lists->ignores_r.push_back(IgnoreFun(tail));
55 } else if (CutStringPrefixIfPresent(input_line, "fun_hist:", &tail)) {
[all...]
/external/markdown/markdown/
H A Dtreeprocessors.py102 Process placeholders in Element.text or Element.tail
109 * isText: bool variable, True - it's text, False - it's tail
118 text = subnode.tail
119 subnode.tail = None
147 if result[-1].tail:
148 result[-1].tail += text
150 result[-1].tail = text
173 if child.tail:
174 if child.tail.strip():
232 if child.tail
[all...]
/external/webkit/Source/WebCore/dom/
H A DContainerNodeAlgorithms.h34 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container);
45 GenericNode* tail = 0; local
47 Private::addChildNodesToDeletionQueue<GenericNode, GenericNodeContainer>(head, tail, container);
59 tail = 0;
62 Private::addChildNodesToDeletionQueue<GenericNode, GenericNodeContainer>(head, tail, static_cast<GenericNodeContainer*>(n));
114 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container) argument
132 if (tail)
133 tail->setNextSibling(n);
137 tail = n;
/external/apache-harmony/auth/src/test/java/common/org/apache/harmony/auth/tests/support/
H A DTestUtils.java55 String tail = Integer.toHexString(0x000000ff & data[i]);
56 if (tail.length() == 1) {
57 tail = "0" + tail;
59 System.out.print(prefix + "0x" + tail + delimiter);
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/x509/
H A DORAddressTest.java40 String tail = Integer.toHexString(0x000000ff & data[i]);
41 if (tail.length() == 1) {
42 tail = "0" + tail;
44 System.out.print(prefix + "0x" + tail + delimiter);
/external/dropbear/
H A Dqueue.c32 queue->tail = NULL;
54 queue->tail = NULL;
79 if (queue->tail != NULL) {
80 queue->tail->link = newlink;
82 queue->tail = newlink;
H A Dqueue.h38 struct Link* tail; member in struct:Queue
/external/icu4c/layout/
H A DLEInsertionList.cpp26 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft)
28 tail = (InsertionRecord *) &head;
45 tail = (InsertionRecord *) &head;
74 tail->next = insertion;
75 tail = insertion;
/external/webkit/Tools/BuildSlaveSupport/build.webkit.org-config/
H A DMakefile19 tail -f twistd.log
/external/chromium/base/
H A Dlinked_list_unittest.cc34 // Checks that when iterating |list| (either from head to tail, or from
35 // tail to head, as determined by |forward|), we get back |node_ids|,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
55 SCOPED_TRACE("Iterating forward (from head to tail)");
59 SCOPED_TRACE("Iterating backward (from tail to head)");
67 EXPECT_EQ(list.end(), list.tail());
79 EXPECT_EQ(&n1, list.tail());
89 EXPECT_EQ(&n2, list.tail());
99 EXPECT_EQ(&n3, list.tail());
122 EXPECT_EQ(&n5, list.tail());
[all...]
/external/clang/test/SemaTemplate/
H A Dexample-typelist.cpp9 typedef Tail tail; typedef in struct:cons
49 typedef typename reverse<typename T::tail>::type reversed_tail;
51 typedef typename reverse<typename reversed_tail::tail>::type most_of_tail;
82 struct find : find<typename List::tail, T> { };
/external/eigen/doc/examples/
H A DTutorial_BlockOperations_vector.cpp11 cout << "v.tail<3>() = " << endl << v.tail<3>() << endl << endl;
/external/srec/seti/sltsEngine/include/
H A Dlinklist.h32 struct LNode *tail; member in struct:LList
/external/srec/seti/sltsEngine/src/
H A Dlinklist_impl.c139 list->tail = list->head;
145 list->curr = list->tail;
149 if(list->curr == list->tail){
157 list->tail = newnode;
202 list->curr = list->tail;
219 }else if(curr == list->tail){
221 list->tail = curr->prev;
223 if(list->tail != NULL){
224 (list->tail)->next = NULL;
228 list->curr = list->tail;
[all...]

Completed in 1400 milliseconds

1234567891011>>