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

1234567891011>>

/external/llvm/test/MC/MachO/
H A Dprevious.s9 .previous
12 .previous
/external/llvm/test/MC/ELF/
H A Delf_directive_previous.s9 .previous
12 .previous
/external/webkit/Source/WebCore/html/
H A DHTMLTableRowsCollection.cpp55 HTMLTableRowElement* HTMLTableRowsCollection::rowAfter(HTMLTableElement* table, HTMLTableRowElement* previous) argument
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
[all...]
H A DHTMLNameCollection.cpp41 Element* HTMLNameCollection::itemAfter(Element* previous) const
43 ASSERT(previous != base());
46 if (!previous)
49 current = previous->traverseNextNode(base());
/external/elfutils/lib/
H A Dlist.h58 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
[all...]
/external/chromium/chrome/common/net/
H A Draw_host_resolver_proc.cc13 net::HostResolverProc* previous)
14 : HostResolverProc(previous), dns_server_(dns_server) {}
12 RawHostResolverProc(const net::IPAddressNumber& dns_server, net::HostResolverProc* previous) argument
H A Draw_host_resolver_proc.h25 net::HostResolverProc* previous);
/external/chromium/net/base/
H A Ddirectory_lister_unittest.cc36 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/
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
198 node.previous = tail;
209 node.previous = nextSibling.previous;
218 if (nextSibling.previous == null) { // nextSibling was head
221 nextSibling.previous.next = node;
223 nextSibling.previous = node;
236 if (node.previous !
283 Node<K, V> previous; field in class:LinkedListMultimap.NodeIterator
334 public Node<K, V> previous() { method in class:LinkedListMultimap.NodeIterator
397 Node<K, V> previous; field in class:LinkedListMultimap.ValueForKeyIterator
453 public V previous() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DAbstractLinkedIteratorTest.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) {
H A DUnmodifiableListIteratorTest.java51 assertEquals("b", iterator.previous());
64 assertEquals("b", iterator.previous());
93 @Override public String previous() {
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/common/
H A Dtokens.py42 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/
H A Dtokenutil.py42 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...]
H A Decmalintrules.py127 token = token.previous
196 the previous token doesn't end with a space and the previous token is on the
204 token.previous and token.line_number == token.previous.line_number and
205 len(token.previous.string) - len(token.previous.string.rstrip()) == 0):
319 if token.previous and token.previous.type == Type.WHITESPACE:
321 token.previous, Positio
[all...]
/external/llvm/test/MC/AsmParser/
H A Dsection.s7 .previous
11 .previous
15 .previous
35 .previous
39 .previous
45 .previous
47 .previous
/external/webkit/Source/WebCore/rendering/
H A DCounterNode.cpp92 CounterNode* previous = m_previousSibling; local
93 if (!previous)
96 while (CounterNode* lastChild = previous->m_lastChild)
97 previous = lastChild;
99 return previous;
149 RenderCounter* previous = 0; local
152 if (previous)
153 previous->m_nextForSameCounter = value->m_nextForSameCounter;
160 previous = iterator;
275 CounterNode* previous local
[all...]
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/
H A DTryListBuilder.java51 lastTryRange.previous = firstTryRange;
56 public TryRange previous = null; field in class:TryListBuilder.TryRange
69 this.previous = null;
77 this.next.previous = tryRange;
81 tryRange.previous = this;
85 /*we use a dummy first item, so this.previous will always
87 this.previous.next = tryRange;
88 tryRange.previous = this.previous;
90 this.previous
[all...]
/external/chromium/base/
H A Dlinked_list.h13 // 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) argument
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/apache-xml/src/main/java/org/apache/xml/serializer/
H A DElemContext.java108 /** The previous element "stack frame". */
136 * @param previous The "stack frame" corresponding to the new
139 private ElemContext(final ElemContext previous) argument
141 m_prev = previous;
142 m_currentElemDepth = previous.m_currentElemDepth + 1;
/external/junit/src/org/junit/internal/runners/
H A DTestClass.java68 private boolean isShadowed(Method current, Method previous) { argument
69 if (! previous.getName().equals(current.getName()))
71 if (previous.getParameterTypes().length != current.getParameterTypes().length)
73 for (int i= 0; i < previous.getParameterTypes().length; i++) {
74 if (! previous.getParameterTypes()[i].equals(current.getParameterTypes()[i]))
/external/webkit/Source/WebCore/platform/text/wince/
H A DTextBreakIteratorWinCE.cpp70 virtual int previous() = 0;
79 return previous();
89 virtual int previous();
94 virtual int previous();
99 virtual int previous();
104 virtual int previous();
124 int WordBreakIterator::previous() function in class:WebCore::WordBreakIterator
151 int CharBreakIterator::previous() function in class:WebCore::CharBreakIterator
180 int LineBreakIterator::previous() function in class:WebCore::LineBreakIterator
214 int SentenceBreakIterator::previous() function in class:WebCore::SentenceBreakIterator
[all...]
/external/jmonkeyengine/engine/src/core/com/jme3/font/
H A DLetterQuad.java34 private LetterQuad previous; field in class:LetterQuad
57 * create letter and append to previous LetterQuad
60 * @param prev previous character
97 return previous;
177 ins.previous = this;
178 n.previous = ins;
191 return previous == null;
198 this.previous.next = next;
199 this.next.previous = previous;
[all...]
/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
194 node.previous = tail;
205 node.previous = nextSibling.previous;
214 if (nextSibling.previous == null) { // nextSibling was head
217 nextSibling.previous.next = node;
219 nextSibling.previous = node;
232 if (node.previous !
279 Node<K, V> previous; field in class:LinkedListMultimap.NodeIterator
330 public Node<K, V> previous() { method in class:LinkedListMultimap.NodeIterator
393 Node<K, V> previous; field in class:LinkedListMultimap.ValueForKeyIterator
449 public V previous() { method in class:LinkedListMultimap.ValueForKeyIterator
[all...]
/external/webkit/Source/WebCore/platform/text/brew/
H A DTextBreakIteratorBrew.cpp61 virtual int previous() = 0;
70 return previous();
81 virtual int previous();
87 virtual int previous();
93 virtual int previous();
99 virtual int previous();
125 int WordBreakIterator::previous() function in class:WebCore::WordBreakIterator
158 int CharBreakIterator::previous() function in class:WebCore::CharBreakIterator
193 int LineBreakIterator::previous() function in class:WebCore::LineBreakIterator
233 int SentenceBreakIterator::previous() function in class:WebCore::SentenceBreakIterator
[all...]

Completed in 781 milliseconds

1234567891011>>