Searched refs:previous (Results 1 - 25 of 643) sorted by relevance

1234567891011>>

/external/llvm/test/MC/MachO/
H A Dprevious.s9 .previous
12 .previous
/external/autotest/client/site_tests/firmware_TouchMTB/tools/
H A Dawk_process_syn18 previous = 0;
24 if (previous == 0) {
25 previous = $3;
28 interval = current - previous;
29 previous = current;
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/
H A DRealConvergenceChecker.java43 * 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 DVectorialConvergenceChecker.java43 * 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 DSimpleRealPointChecker.java73 final RealPointValuePair previous,
75 final double[] p = previous.getPoint();
72 converged(final int iteration, final RealPointValuePair previous, final RealPointValuePair current) argument
H A DSimpleScalarValueChecker.java73 final RealPointValuePair previous,
75 final double p = previous.getValue();
72 converged(final int iteration, final RealPointValuePair previous, final RealPointValuePair current) argument
/external/llvm/test/MC/ELF/
H A Delf_directive_previous.s9 .previous
12 .previous
/external/swiftshader/third_party/LLVM/test/MC/ELF/
H A Delf_directive_previous.s9 .previous
12 .previous
/external/syslinux/gpxe/src/arch/i386/prefix/
H A Dnullprefix.S13 .previous
/external/apache-commons-math/src/main/java/org/apache/commons/math/exception/
H A DNonMonotonousSequenceException.java49 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 DMultiTransformation.java34 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/lib/
H A Dlist.h37 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/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DAbstractSequentialIteratorTest.java48 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/glide/library/src/main/java/com/bumptech/glide/request/animation/
H A DDrawableCrossFadeViewAnimation.java30 * 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/android_icu4j/src/main/java/android/icu/impl/
H A DUCharacterIteratorWrapper.java54 return (char)iterator.previous();
91 public char previous(){ method in class:UCharacterIteratorWrapper
93 return (char) iterator.previous();
H A DCharacterIteration.java42 ci.previous();
58 ci.previous();
83 ci.previous();
93 char trail = ci.previous();
96 char lead = ci.previous();
116 ci.previous();
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DUCharacterIteratorWrapper.java52 return (char)iterator.previous();
89 public char previous(){ method in class:UCharacterIteratorWrapper
91 return (char) iterator.previous();
H A DCharacterIteration.java38 ci.previous();
54 ci.previous();
79 ci.previous();
89 char trail = ci.previous();
92 char lead = ci.previous();
112 ci.previous();
/external/guava/guava/src/com/google/common/collect/
H A DForwardingListIterator.java57 public E previous() { method in class:ForwardingListIterator
58 return delegate().previous();
H A DLinkedListMultimap.java115 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 DAbstractSequentialIteratorTest.java61 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/llvm/test/MC/COFF/
H A Dinvalid-def.s3 # CHECK: error: starting a new symbol definition without completing the previous one
4 # CHECK: error: starting a new symbol definition without completing the previous one
/external/autotest/client/profilers/powertop/src/
H A Dsuggestions.c58 static char previous[1024]; variable
119 if (strlen(previous) && displaytime > 0.0)
125 if (strcmp(ptr->string, previous)==0 && displaytime > 0.0)
133 if (strcmp(ptr->string, previous)) {
135 strcpy(previous, ptr->string);
142 memset(previous, 0, sizeof(previous));
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DLinkedListMultimap.java111 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...]
/external/swiftshader/third_party/LLVM/test/MC/AsmParser/
H A Dsection.s7 .previous
11 .previous
15 .previous
35 .previous
39 .previous
45 .previous
47 .previous

Completed in 554 milliseconds

1234567891011>>