| /external/llvm/test/MC/MachO/ |
| previous.s | 9 .previous
12 .previous
|
| /external/llvm/test/MC/ELF/ |
| elf_directive_previous.s | 9 .previous
12 .previous
|
| /external/elfutils/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...] |
| ListIterator.java | 29 * {@code previous}. The object inserted will be the previous object.
51 * Returns whether there are previous elements to iterate.
53 * @return {@code true} if there are previous elements, {@code false}
55 * @see #previous
81 * Returns the previous object in the iteration.
83 * @return the previous object.
85 * if there are no previous elements.
88 public E previous(); method in interface:ListIterator
91 * Returns the index of the previous object in the iteration
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTableRowsCollection.cpp | 55 HTMLTableRowElement* HTMLTableRowsCollection::rowAfter(HTMLTableElement* table, HTMLTableRowElement* previous)
61 if (previous && previous->parentNode() != table) {
62 for (child = previous->nextSibling(); child; child = child->nextSibling()) {
69 if (!previous)
71 else if (isInHead(previous))
72 child = previous->parentNode()->nextSibling();
83 if (!previous || isInHead(previous))
85 else if (previous->parentNode() == table
[all...] |
| /external/chromium_org/chrome/browser/chromeos/ |
| preferences_unittest.cc | 20 MyMockInputMethodManager(StringPrefMember* previous,
22 : previous_(previous),
68 StringPrefMember previous; local
69 previous.Init(prefs::kLanguagePreviousInputMethod, &prefs);
70 previous.SetValue("KeyboardA");
75 MyMockInputMethodManager mock_manager(&previous, ¤t);
81 EXPECT_EQ("KeyboardA", previous.GetValue());
|
| /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
|
| /external/chromium/chrome/common/net/ |
| raw_host_resolver_proc.cc | 13 net::HostResolverProc* previous)
14 : HostResolverProc(previous), dns_server_(dns_server) {}
|
| /frameworks/base/core/java/android/util/ |
| LruCache.java | 163 * @return the previous value mapped by {@code key}.
170 V previous; local
174 previous = map.put(key, value);
175 if (previous != null) {
176 size -= safeSizeOf(key, previous);
180 if (previous != null) {
181 entryRemoved(false, key, previous, value);
185 return previous;
228 * @return the previous value mapped by {@code key}.
235 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 | 113 * @return the previous value mapped by {@code key}.
120 V previous; local
124 previous = map.put(key, value);
125 if (previous != null) {
126 size -= safeSizeOf(key, previous);
130 if (previous != null) {
131 entryRemoved(false, key, previous, value);
135 return previous;
174 * @return the previous value mapped by {@code key}.
181 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/chromium/net/base/ |
| directory_lister_unittest.cc | 36 for (size_t previous = 0, current = 1;
38 previous++, current++) {
40 paths_[previous], paths_[current]));
47 for (size_t previous = 0, current = 1;
49 previous++, current++) {
51 if (file_util::FileEnumerator::IsDirectory(file_list_[previous]) &&
57 EXPECT_EQ(file_util::FileEnumerator::IsDirectory(file_list_[previous]),
60 file_util::FileEnumerator::GetFilename(file_list_[previous]),
|
| /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/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeTraversal.cpp | 37 if (Node* previous = current->pseudoAwarePreviousSibling()) {
38 while (previous->pseudoAwareLastChild())
39 previous = previous->pseudoAwareLastChild();
40 return previous;
100 Node* previous(const Node* current, const Node* stayWithin) function in namespace:WebCore::NodeTraversal
105 Node* previous = current->previousSibling(); local
106 while (previous->lastChild())
107 previous = previous->lastChild()
[all...] |
| /external/ceres-solver/internal/ceres/ |
| line_search_direction.cc | 45 bool NextDirection(const LineSearchMinimizer::State& previous,
61 bool NextDirection(const LineSearchMinimizer::State& previous,
68 beta = current.gradient_squared_norm / previous.gradient_squared_norm;
71 gradient_change = current.gradient - previous.gradient;
73 previous.gradient_squared_norm);
76 gradient_change = current.gradient - previous.gradient;
78 previous.search_direction.dot(gradient_change));
84 *search_direction = -current.gradient + beta * previous.search_direction;
113 bool NextDirection(const LineSearchMinimizer::State& previous,
122 previous.search_direction * previous.step_size
[all...] |
| /external/chromium/base/ |
| linked_list.h | 13 // list, as extending LinkNode (this gives it next/previous pointers).
47 // node = node->previous()) {
73 // "previous" pointers that reference other nodes in the list.
76 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
78 // needs to glue on the "next" and "previous" pointers using
87 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
88 : previous_(previous), next_(next) {}
112 LinkNode<T>* previous() const { function in class:base::LinkNode
146 // and root_->previous() wraps around to the end of the list).
159 return root_.previous();
[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/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);
|
