| /external/llvm/test/MC/MachO/ |
| previous.s | 9 .previous
12 .previous
|
| /external/glide/library/src/main/java/com/bumptech/glide/load/ |
| MultiTransformation.java | 31 Resource<T> previous = resource; local
35 Resource<T> transformed = transformation.transform(previous, outWidth, outHeight);
36 if (transformed != previous && previous != resource && previous != null) {
37 previous.recycle();
39 previous = transformed;
43 Resource<T> transformed = transformation.transform(previous, outWidth, outHeight);
44 if (transformed != previous && previous != resource && previous != null)
[all...] |
| /external/chromium_org/device/hid/ |
| hid_report_descriptor_item.cc | 26 HidReportDescriptorItem* previous)
27 : previous_(previous), next_(NULL), parent_(NULL), shortData_(0) {
40 if (previous) {
41 DCHECK(!previous->next_);
42 previous->next_ = this;
43 switch (previous->tag()) {
45 parent_ = previous;
53 if (previous->parent()) {
54 parent_ = previous->parent()->parent();
58 parent_ = previous->parent()
[all...] |
| /external/llvm/test/MC/ELF/ |
| elf_directive_previous.s | 9 .previous
12 .previous
|
| /external/elfutils/0.153/lib/ |
| list.h | 58 assert (_newp->previous == NULL); \
60 (first) = _newp->next = _newp->previous = _newp; \
64 _newp->previous = (first)->previous; \
65 _newp->previous->next = _newp->next->previous = _newp; \
87 _elem->next->previous = _elem->previous; \
88 _elem->previous->next = _elem->next; \
92 assert ((_elem->next = _elem->previous = NULL, 1));
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| LinkedList.java | 51 Link<ET> previous, next; field in class:LinkedList.Link
55 previous = p;
81 link = link.previous;
94 next.previous = newLink;
131 public ET previous() { method in class:LinkedList.LinkIterator
135 link = link.previous;
152 Link<ET> previous = lastLink.previous; local
153 next.previous = previous;
225 Link<ET> previous = link.next; local
290 Link<E> previous = link.previous; local
353 Link<E> previous = voidLink; local
393 Link<E> previous = voidLink.previous; local
652 Link<E> previous = link.previous; local
706 Link<E> previous = last.previous; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTableRowsCollection.cpp | 56 HTMLTableRowElement* HTMLTableRowsCollection::rowAfter(HTMLTableElement& table, HTMLTableRowElement* previous)
60 if (previous && previous->parentNode() != table) {
61 if (HTMLTableRowElement* row = Traversal<HTMLTableRowElement>::nextSibling(*previous))
67 if (!previous)
69 else if (isInHead(previous))
70 child = Traversal<HTMLElement>::nextSibling(*previous->parentNode());
79 if (!previous || isInHead(previous))
81 else if (previous->parentNode() == table
[all...] |
| /external/chromium_org/chrome/browser/chromeos/ |
| preferences_unittest.cc | 22 MyMockInputMethodManager(StringPrefMember* previous,
24 : previous_(previous),
66 StringPrefMember previous; local
67 previous.Init(prefs::kLanguagePreviousInputMethod, &prefs);
68 previous.SetValue("KeyboardA");
73 MyMockInputMethodManager mock_manager(&previous, ¤t);
79 EXPECT_EQ("KeyboardA", previous.GetValue());
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| ChildNodeList.cpp | 63 Node* previous = ¤tNode; local
64 while ((previous = previous->previousSibling())) {
66 return previous;
|
| NodeChildRemovalTracker.h | 43 NodeChildRemovalTracker* previous() { return m_previous; } function in class:WebCore::NodeChildRemovalTracker
64 for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->previous()) {
|
| /libcore/luni/src/main/java/java/text/ |
| CharacterIterator.java | 98 * @return the character at the previous index, or {@code DONE} if the
99 * previous index would be past the beginning.
101 public char previous(); method in interface:CharacterIterator
|
| /frameworks/base/core/java/android/util/ |
| LruCache.java | 162 * @return the previous value mapped by {@code key}.
169 V previous; local
173 previous = map.put(key, value);
174 if (previous != null) {
175 size -= safeSizeOf(key, previous);
179 if (previous != null) {
180 entryRemoved(false, key, previous, value);
184 return previous;
227 * @return the previous value mapped by {@code key}.
234 V previous; local
[all...] |
| /frameworks/base/tools/layoutlib/bridge/src/android/util/ |
| LruCache.java | 167 * @return the previous value mapped by {@code key}.
174 V previous; local
178 previous = map.put(key, value);
179 if (previous != null) {
180 size -= safeSizeOf(key, previous);
184 if (previous != null) {
185 entryRemoved(false, key, previous, value);
189 return previous;
238 * @return the previous value mapped by {@code key}.
245 V previous; local
[all...] |
| /frameworks/support/v4/java/android/support/v4/util/ |
| LruCache.java | 129 * @return the previous value mapped by {@code key}.
136 V previous; local
140 previous = map.put(key, value);
141 if (previous != null) {
142 size -= safeSizeOf(key, previous);
146 if (previous != null) {
147 entryRemoved(false, key, previous, value);
151 return previous;
190 * @return the previous value mapped by {@code key}.
197 V previous; local
[all...] |
| /dalvik/dx/tests/087-ssa-local-vars/ |
| Blort.java | 48 * phi's. The key component here is the assignment of previous = current.
58 StringBuilder previous = null; local
70 if ((current.charAt(0) == ' ' || current.charAt(0) == '\t') && previous != null) {
80 && previous.length() + 1 + current.length() - i > maxLineLen) {
83 previous.append(' ');
84 previous.append(current, i, current.length() - i);
86 previous = current;
|
| /external/guava/guava/src/com/google/common/collect/ |
| ForwardingListIterator.java | 57 public E previous() { method in class:ForwardingListIterator
58 return delegate().previous();
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractLinkedIteratorTest.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/ |
| line_search_direction.cc | 43 bool NextDirection(const LineSearchMinimizer::State& previous,
59 bool NextDirection(const LineSearchMinimizer::State& previous,
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,
120 previous.search_direction * previous.step_size
[all...] |
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/common/ |
| 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/third_party/closure_linter/closure_linter/ |
| 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/chromium_org/base/containers/ |
| linked_list.h | 12 // list, as extending LinkNode (this gives it next/previous pointers).
46 // node = node->previous()) {
72 // "previous" pointers that reference other nodes in the list.
75 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
77 // needs to glue on the "next" and "previous" pointers using
86 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
87 : previous_(previous), next_(next) {}
111 LinkNode<T>* previous() const { function in class:base::LinkNode
138 // and root_->previous() wraps around to the end of the list).
151 return root_.previous();
[all...] |
| /external/chromium_org/third_party/closure_linter/closure_linter/common/ |
| 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_org/third_party/closure_linter/closure_linter/ |
| 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/glide/library/src/main/java/com/bumptech/glide/request/ |
| GlideAnimation.java | 8 public boolean animate(Drawable previous, R current, View view, Target<R> target);
|
| /external/smack/src/org/xbill/DNS/ |
| SIG0.java | 32 * @param previous If this message is a response, the SIG(0) from the query
36 SIGRecord previous) throws DNSSEC.DNSSECException
47 SIGRecord sig = DNSSEC.signMessage(message, previous, key, privkey,
60 * @param previous If this message is a response, the SIG(0) from the query
63 verifyMessage(Message message, byte [] b, KEYRecord key, SIGRecord previous)
76 DNSSEC.verifyMessage(message, b, sig, previous, key);
|
