/external/llvm/test/MC/MachO/ |
H A D | previous.s | 9 .previous 12 .previous
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
H A D | RealConvergenceChecker.java | 43 * call if needed. Each time this method is called, the previous and current point 49 * @param previous point from previous iteration 53 boolean converged(int iteration, RealPointValuePair previous, RealPointValuePair current); argument
|
H A D | VectorialConvergenceChecker.java | 43 * call if needed. Each time this method is called, the previous and current point 49 * @param previous point from previous iteration 53 boolean converged(int iteration, VectorialPointValuePair previous, VectorialPointValuePair current); argument
|
H A D | SimpleRealPointChecker.java | 73 final RealPointValuePair previous, 75 final double[] p = previous.getPoint(); 72 converged(final int iteration, final RealPointValuePair previous, final RealPointValuePair current) argument
|
H A D | SimpleScalarValueChecker.java | 73 final RealPointValuePair previous, 75 final double p = previous.getValue(); 72 converged(final int iteration, final RealPointValuePair previous, final RealPointValuePair current) argument
|
H A D | SimpleVectorialPointChecker.java | 73 final VectorialPointValuePair previous, 75 final double[] p = previous.getPointRef(); 72 converged(final int iteration, final VectorialPointValuePair previous, final VectorialPointValuePair current) argument
|
H A D | SimpleVectorialValueChecker.java | 73 final VectorialPointValuePair previous, 75 final double[] p = previous.getValueRef(); 72 converged(final int iteration, final VectorialPointValuePair previous, final VectorialPointValuePair current) argument
|
/external/llvm/test/MC/ELF/ |
H A D | elf_directive_previous.s | 9 .previous 12 .previous
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/exception/ |
H A D | NonMonotonousSequenceException.java | 49 private final Number previous; field in class:NonMonotonousSequenceException 57 * @param previous Previous value in the sequence. 61 Number previous, 63 this(wrong, previous, index, MathUtils.OrderDirection.INCREASING, true); 70 * @param previous Previous value in the sequence. 78 Number previous, 89 wrong, previous, index, index - 1); 94 this.previous = previous; 118 * @return the previous valu 60 NonMonotonousSequenceException(Number wrong, Number previous, int index) argument 77 NonMonotonousSequenceException(Number wrong, Number previous, int index, MathUtils.OrderDirection direction, boolean strict) argument [all...] |
/external/glide/library/src/main/java/com/bumptech/glide/load/ |
H A D | MultiTransformation.java | 34 Resource<T> previous = resource; 37 Resource<T> transformed = transformation.transform(previous, outWidth, outHeight); 38 if (previous != null && !previous.equals(resource) && !previous.equals(transformed)) { 39 previous.recycle(); 41 previous = transformed; 43 return previous;
|
/external/elfutils/src/lib/ |
H A D | list.h | 37 assert (_newp->previous == NULL); \ 39 (first) = _newp->next = _newp->previous = _newp; \ 43 _newp->previous = (first)->previous; \ 44 _newp->previous->next = _newp->next->previous = _newp; \ 66 _elem->next->previous = _elem->previous; \ 67 _elem->previous->next = _elem->next; \ 71 assert ((_elem->next = _elem->previous [all...] |
/external/chromium-trace/trace-viewer/tracing/third_party/tvcm/third_party/rjsmin/bench/ |
H A D | jsmin_2_0_9.py | 106 previous = read(1) 107 if previous == '\\': 110 if previous == '/': 115 previous = next1 118 write(previous) 119 elif not previous: 121 elif previous >= '!': 122 if previous in "'\"": 123 in_quote = previous 124 write(previous) [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | AbstractSequentialIteratorTest.java | 48 protected Integer computeNext(Integer previous) { 49 return (previous == 1 << 30) ? null : previous * 2; 94 protected Integer computeNext(Integer previous) { 95 return (previous == last) ? null : previous * 2; 103 protected T computeNext(T previous) { 112 protected Object computeNext(Object previous) {
|
/external/skia/src/gpu/ |
H A D | GrInOrderCommandBuilder.cpp | 32 DrawBatch* previous = static_cast<DrawBatch*>(&this->cmdBuffer()->back()); local 33 if (previous->fState == state && previous->fBatch->combineIfPossible(batch)) { 93 // The previous command was also DrawPaths. Try to collapse this call into the one 100 DrawPaths* previous = static_cast<DrawPaths*>(&this->cmdBuffer()->back()); local 101 if (pathRange == previous->pathRange() && 102 indexType == previous->fIndexType && 103 transformType == previous->fTransformType && 104 stencilSettings == previous->fStencilSettings && 107 previous [all...] |
H A D | GrReorderCommandBuilder.cpp | 27 DrawBatch* previous = static_cast<DrawBatch*>(reverseIter.get()); local 29 if (previous->fState->getPipeline()->isEqual(*state->getPipeline()) && 30 previous->fBatch->combineIfPossible(batch)) { 34 if (intersect(previous->fBatch->bounds(), batch->bounds())) { 41 } while (reverseIter.previous());
|
/external/glide/library/src/main/java/com/bumptech/glide/request/animation/ |
H A D | DrawableCrossFadeViewAnimation.java | 30 * Animates from the previous drawable to the current drawable in one of two ways. 33 * <li>Using the default animation provided in the constructor if the previous drawable is null</li> 34 * <li>Using the cross fade animation with the duration provided in the constructor if the previous 44 Drawable previous = adapter.getCurrentDrawable(); 45 if (previous != null) { 46 TransitionDrawable transitionDrawable = new TransitionDrawable(new Drawable[] { previous, current });
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | UCharacterIteratorWrapper.java | 48 return (char)iterator.previous(); 82 public char previous(){ method in class:UCharacterIteratorWrapper 84 return (char) iterator.previous();
|
H A D | CharacterIteration.java | 36 c = ci.previous(); 52 ci.previous(); 77 ci.previous(); 87 char trail = ci.previous(); 90 char lead = ci.previous(); 110 ci.previous();
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ForwardingListIterator.java | 57 public E previous() { method in class:ForwardingListIterator 58 return delegate().previous();
|
H A D | LinkedListMultimap.java | 115 Node<K, V> previous; // the previous node (with any key) field in class:LinkedListMultimap.Node 117 Node<K, V> previousSibling; // the previous node with the same key 227 node.previous = tail; 243 node.previous = nextSibling.previous; 252 if (nextSibling.previous == null) { // nextSibling was head 255 nextSibling.previous.next = node; 257 nextSibling.previous = node; 270 if (node.previous ! 320 Node<K, V> previous; field in class:LinkedListMultimap.NodeIterator 379 public Node<K, V> previous() { method in class:LinkedListMultimap.NodeIterator 453 Node<K, V> previous; field in class:LinkedListMultimap.ValueForKeyIterator 511 public V previous() { method in class:LinkedListMultimap.ValueForKeyIterator [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractSequentialIteratorTest.java | 61 protected Integer computeNext(Integer previous) { 62 return (previous == 1 << 30) ? null : previous * 2; 107 protected Integer computeNext(Integer previous) { 108 return (previous == last) ? null : previous * 2; 116 protected T computeNext(T previous) { 125 protected Object computeNext(Object previous) {
|
/external/ceres-solver/internal/ceres/ |
H A D | line_search_direction.cc | 43 bool NextDirection(const LineSearchMinimizer::State& previous, argument 59 bool NextDirection(const LineSearchMinimizer::State& previous, argument 66 beta = current.gradient_squared_norm / previous.gradient_squared_norm; 69 gradient_change = current.gradient - previous.gradient; 71 previous.gradient_squared_norm); 74 gradient_change = current.gradient - previous.gradient; 76 previous.search_direction.dot(gradient_change)); 82 *search_direction = -current.gradient + beta * previous.search_direction; 111 bool NextDirection(const LineSearchMinimizer::State& previous, argument 120 previous 166 NextDirection(const LineSearchMinimizer::State& previous, const LineSearchMinimizer::State& current, Vector* search_direction) argument [all...] |
/external/chromium-trace/trace-viewer/tracing/third_party/closure_linter/closure_linter/common/ |
H A D | tokens.py | 42 previous: The token before this one. 70 self.previous = None 87 return not self.previous or self.previous.line_number != self.line_number 139 node = node.previous
|
/external/chromium-trace/trace-viewer/tracing/third_party/closure_linter/closure_linter/ |
H A D | tokenutil.py | 42 token = token.previous 47 """Returns the first token in the previous line as token. 53 The first token in the previous line as token, or None if token is on the 57 if first_in_line.previous: 58 return GetFirstTokenInSameLine(first_in_line.previous) 120 previous = token.previous 121 if previous: 122 if func(previous): 123 return previous [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 111 Node<K, V> previous; // the previous node (with any key) field in class:LinkedListMultimap.Node 113 Node<K, V> previousSibling; // the previous node with the same key 223 node.previous = tail; 239 node.previous = nextSibling.previous; 248 if (nextSibling.previous == null) { // nextSibling was head 251 nextSibling.previous.next = node; 253 nextSibling.previous = node; 266 if (node.previous ! 316 Node<K, V> previous; field in class:LinkedListMultimap.NodeIterator 375 public Node<K, V> previous() { method in class:LinkedListMultimap.NodeIterator 449 Node<K, V> previous; field in class:LinkedListMultimap.ValueForKeyIterator 507 public V previous() { method in class:LinkedListMultimap.ValueForKeyIterator [all...] |