Searched refs:next (Results 201 - 225 of 4188) sorted by relevance

1234567891011>>

/external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/ui/
H A DFixedTableModelTest.java52 RectF cellRect = it.next();
55 cellRect = it.next();
58 cellRect = it.next();
61 cellRect = it.next();
64 cellRect = it.next();
68 cellRect = it.next();
84 RectF cellRect = it.next();
91 cellRect = it.next();
98 cellRect = it.next();
105 cellRect = it.next();
[all...]
/external/ceres-solver/internal/ceres/
H A Dlow_rank_inverse_hessian.cc101 int next = indices_.size(); local
104 // making it the next position where the LBFGS history is stored.
105 if (next == max_num_corrections_) {
106 next = indices_.front();
110 indices_.push_back(next);
111 delta_x_history_.col(next) = delta_x;
112 delta_gradient_history_.col(next) = delta_gradient;
113 delta_x_dot_delta_gradient_(next) = delta_x_dot_delta_gradient;
/external/e2fsprogs/lib/e2p/
H A Dmntopts.c103 char *cp, *buf, *next; local
116 next = skip_over_word(cp);
117 if (*next == 0)
118 next = 0;
120 *next = 0;
144 cp = next ? next+1 : 0;
/external/guava/guava/src/com/google/common/util/concurrent/
H A DExecutionList.java53 * {@link RunnableExecutorPair#next} field.
135 // N.B. All writes to the list and the next pointers must have happened before the above
140 list = list.next;
141 tmp.next = reversedList;
146 reversedList = reversedList.next;
169 @Nullable RunnableExecutorPair next; field in class:ExecutionList.RunnableExecutorPair
171 RunnableExecutorPair(Runnable runnable, Executor executor, RunnableExecutorPair next) { argument
174 this.next = next;
/external/mesa3d/src/gallium/auxiliary/draw/
H A Ddraw_pipe_util.c15 * next paragraph) shall be included in all copies or substantial portions
42 stage->next->point(stage->next, header);
48 stage->next->line(stage->next, header);
54 stage->next->tri(stage->next, header);
122 stage = stage->next;
H A Ddraw_pipe_unfilled.c15 * next paragraph) shall be included in all copies or substantial portions
65 stage->next->point( stage->next, &tmp );
75 stage->next->line( stage->next, &tmp );
100 stage->next->reset_stipple_counter( stage->next );
145 stage->next->tri( stage->next, header );
177 stage->next
[all...]
/external/wpa_supplicant_8/wpa_supplicant/
H A Dblacklist.c33 e = e->next;
77 e->next = wpa_s->blacklist;
103 wpa_s->blacklist = e->next;
105 prev->next = e->next;
113 e = e->next;
134 e = e->next;
/external/skia/src/pathops/
H A DSkPathOpsDebug.cpp165 } while ((span = span->next()->upCastable()));
202 SkDebugf(" tEnd=%1.9g", span->next()->t());
218 } while ((span = span->next()->upCastable()));
231 span->t(), span->debugID(), pt.fX, pt.fY, span->next()->t());
255 span->t(), span->debugID(), pt.fX, pt.fY, span->next()->t(), winding, oppWinding);
315 const SkOpAngle* next = this; local
317 next->dumpOne(true);
319 next = next->fNext;
320 } while (next
332 const SkOpAngle* next = this; local
375 const SkOpAngle* next = first; local
436 const SkOpSpanBase* next = this; local
481 const SkOpSpan* next = this; local
528 const SkOpPtT* next = this; local
[all...]
H A DSkPathOpsPostSect.cpp46 SkOpPtT* next = prev->fNext; local
47 if (next == this) {
52 prev = next;
60 SkOpPtT* next = this->fNext; local
61 this->fNext = next->fNext;
62 SkOpSpanBase* span = next->span();
63 next->setDeleted();
64 if (span->ptT() == next) {
95 span->setFromAngle(span->toAngle()->next());
105 ptT = ptT->next();
229 const SkOpSpanBase* next = this; local
268 SkOpPtT* next = remainder->next(); local
298 const SkOpSpan* next = this; local
311 SkOpSpanBase* next = this->next(); local
459 SkOpSpanBase* next = start->next(); local
486 SkOpSpanBase* next = start; local
[all...]
/external/chromium-trace/trace-viewer/tracing/third_party/closure_linter/closure_linter/
H A Dtokenutil.py73 token = token.next
92 first_token = first_token.next
133 next_token = token.next
218 token.previous.next = token.next
220 if token.next:
221 token.next.previous = token.previous
223 following_token = token.next
226 following_token = following_token.next
237 DeleteToken(token.next)
[all...]
/external/google-breakpad/src/third_party/libdisasm/
H A Dx86_insn.c25 for (op_lst = insn->operands; op_lst; op_lst = op_lst->next ) {
46 for (op_lst = insn->operands; op_lst; op_lst = op_lst->next ) {
63 for (op_lst = insn->operands; op_lst; op_lst = op_lst->next ) {
77 for (op_lst = insn->operands; op_lst; op_lst = op_lst->next ) {
103 } else if ( insn->operands->next ) {
104 if ( IS_PROPER_IMM( insn->operands->next ) ) {
105 op = &insn->operands->next->op;
106 } else if ( insn->operands->next->next &&
107 IS_PROPER_IMM( insn->operands->next
[all...]
/external/selinux/checkpolicy/
H A Dqueue.c38 newnode->next = NULL;
43 q->tail->next = newnode;
62 newnode->next = NULL;
67 newnode->next = q->head;
86 q->head = q->head->next;
117 p = p->next;
137 p = p->next;
158 last->next = p->next;
159 if (last->next
[all...]
/external/mesa3d/src/gallium/drivers/i915/
H A Di915_fpc_optimize.c15 * next paragraph) shall be included in all copies or substantial portions
200 static void i915_fpc_optimize_mov_after_alu(union i915_full_token* current, union i915_full_token* next) argument
203 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION &&
205 current->FullInstruction.Instruction.Saturate == next->FullInstruction.Instruction.Saturate &&
206 next->FullInstruction.Instruction.Opcode == TGSI_OPCODE_MOV &&
207 same_dst_reg(&next->FullInstruction.Dst[0], &current->FullInstruction.Dst[0]) &&
208 same_src_reg(&next->FullInstruction.Src[0], &current->FullInstruction.Src[1]) &&
209 !same_src_dst_reg(&next->FullInstruction.Src[0], &current->FullInstruction.Dst[0]) &&
212 is_unswizzled(&next->FullInstruction.Src[0], next
282 i915_fpc_optimize_useless_mov_after_inst(union i915_full_token* current, union i915_full_token* next) argument
[all...]
/external/e2fsprogs/lib/ss/
H A Dget_readline.c47 char *tmp, *cp, *next; local
63 for (cp = tmp; cp; cp = next) {
64 next = strchr(cp, ':');
65 if (next)
66 *next++ = 0;
/external/guava/guava/src/com/google/common/base/
H A DAbstractIterator.java40 private T next; field in class:AbstractIterator
64 next = computeNext();
73 public final T next() { method in class:AbstractIterator
78 T result = next;
79 next = null;
/external/junit/src/org/junit/experimental/theories/internal/
H A DParameterizedAssertionError.java33 Object next = iter.next();
34 buffer.append(stringValueOf(next));
42 private static String stringValueOf(Object next) { argument
44 return String.valueOf(next);
/external/mockito/src/org/mockito/internal/verification/checkers/
H A DNonGreedyNumberOfInvocationsInOrderChecker.java39 Invocation next = finder.findFirstMatchingUnverifiedInvocation( invocations, wanted, context );
40 if( next == null ){
43 marker.markVerified( next, wanted );
44 context.markVerified( next );
45 lastLocation = next.getLocation();
/external/nist-sip/java/gov/nist/javax/sip/parser/
H A DContactParser.java61 final char next = lexer.lookAhead(1);
62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
/external/selinux/libsepol/cil/src/
H A Dcil_list.c63 struct cil_list_item *next = NULL; local
66 next = item->next;
73 item = next;
82 new_item->next = NULL;
116 list->tail->next = item;
138 item->next = list->head;
164 item->next = curr->next;
166 curr->next
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DLinkedListMultimap.java114 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
116 Node<K, V> nextSibling; // the next node with the same key
226 tail.next = node;
245 node.next = nextSibling;
255 nextSibling.previous.next = node;
271 node.previous.next = node.next;
273 head = node.next;
275 if (node.next !
318 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
351 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
412 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
427 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
451 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
497 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DLinkedListMultimap.java110 Node<K, V> next; // the next node (with any key) field in class:LinkedListMultimap.Node
112 Node<K, V> nextSibling; // the next node with the same key
222 tail.next = node;
241 node.next = nextSibling;
251 nextSibling.previous.next = node;
267 node.previous.next = node.next;
269 head = node.next;
271 if (node.next !
314 Node<K, V> next; field in class:LinkedListMultimap.NodeIterator
347 public Node<K, V> next() { method in class:LinkedListMultimap.NodeIterator
408 Node<K, V> next = head; field in class:LinkedListMultimap.DistinctKeyIterator
423 public K next() { method in class:LinkedListMultimap.DistinctKeyIterator
447 Node<K, V> next; field in class:LinkedListMultimap.ValueForKeyIterator
493 public V next() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...]
/external/skia/src/utils/
H A DSkNWayCanvas.cpp45 bool next() { function in class:SkNWayCanvas::Iter
62 while (iter.next()) {
72 while (iter.next()) {
83 while (iter.next()) {
91 while (iter.next()) {
99 while (iter.next()) {
107 while (iter.next()) {
115 while (iter.next()) {
123 while (iter.next()) {
131 while (iter.next()) {
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_bb.cpp60 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next())
63 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next())
66 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next())
97 for (Instruction *i = getFirst(); i; i = i->next)
102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
120 assert(inst->next == 0 && inst->prev == 0);
154 assert(inst->next == 0 && inst->prev == 0);
186 assert(p->next == 0 && p->prev == 0);
201 p->next = q;
204 p->prev->next
478 Instruction *insn, *next; local
[all...]
/external/zlib/src/contrib/blast/
H A Dblast.c41 unsigned char *in; /* next input location */
52 unsigned next; /* index of next write location in out[] */ member in struct:state
133 int left; /* bits left in next or left to process */
134 short *next; /* next number of codes */ local
140 next = h->count + 1;
145 count = *next++;
151 index += count; /* else update for next length */
256 * next,
[all...]
/external/bison/src/
H A Dsymlist.c53 res->next = NULL;
72 res->next = NULL;
90 res->next = NULL;
108 res->next = NULL;
121 for (/* Nothing. */; l && l->content.sym; l = l->next)
138 node->next = list;
150 symbol_list *node, *next; local
151 for (node = list; node; node = next)
153 next = node->next;
[all...]

Completed in 8897 milliseconds

1234567891011>>