Searched refs:previous (Results 1 - 25 of 561) 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/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_org/third_party/WebKit/Source/core/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...]
/external/chromium_org/chrome/browser/chromeos/
H A Dpreferences_unittest.cc20 MyMockInputMethodManager(StringPrefMember* previous, argument
22 : previous_(previous),
58 StringPrefMember previous; local
59 previous.Init(prefs::kLanguagePreviousInputMethod, &prefs);
60 previous.SetValue("KeyboardA");
65 MyMockInputMethodManager mock_manager(&previous, &current);
71 EXPECT_EQ("KeyboardA", previous.GetValue());
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/
H A Dutility.js37 return left.reduce(function(previous, current) {
40 previous.push(current);
43 return previous;
H A Dprofiler_unittest.js27 return model.children.reduce(function(previous, current) {
28 return previous && modelIsValid(current);
H A Dprofiler.js101 return model.children.reduce(function(previous, current) {
104 previous = matched;
105 return previous;
109 return this.models_.reduce(function(previous, current) {
112 previous.push(matched);
113 return previous;
128 var curSub = path.reduce(function(previous, current, index) {
129 return previous[2][current];
211 var size = matchedUnits.reduce(function(previous, current) {
212 return 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/chromium_org/third_party/WebKit/Source/core/dom/
H A DNodeChildRemovalTracker.h43 NodeChildRemovalTracker* previous() { return m_previous; } function in class:WebCore::NodeChildRemovalTracker
64 for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->previous()) {
H A DNodeTraversal.cpp37 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
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DForwardingListIterator.java57 public E previous() { method in class:ForwardingListIterator
58 return delegate().previous();
/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) {
/external/ceres-solver/internal/ceres/
H A Dline_search_direction.cc45 bool NextDirection(const LineSearchMinimizer::State& previous, argument
61 bool NextDirection(const LineSearchMinimizer::State& previous, argument
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, argument
122 previous
167 NextDirection(const LineSearchMinimizer::State& previous, const LineSearchMinimizer::State& current, Vector* search_direction) argument
[all...]
/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...]
/external/chromium_org/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_org/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...]
/external/smack/src/org/xbill/DNS/
H A DSIG0.java32 * @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) argument
76 DNSSEC.verifyMessage(message, b, sig, previous, key);
35 signMessage(Message message, KEYRecord key, PrivateKey privkey, SIGRecord previous) argument
/external/smack/src/org/jivesoftware/smack/util/
H A DCache.java508 head.next = head.previous = head;
530 LinkedListNode node = head.previous;
545 node.previous = head;
546 node.previous.next = node;
547 node.next.previous = node;
560 node.previous.next = node;
561 node.next.previous = node;
573 LinkedListNode node = new LinkedListNode(object, head, head.previous);
574 node.previous.next = node;
575 node.next.previous
628 public LinkedListNode previous; field in class:Cache.LinkedListNode
652 LinkedListNode(Object object, LinkedListNode next, LinkedListNode previous) argument
[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_org/components/policy/core/common/
H A Dpolicy_service.cc29 const PolicyMap& previous,
35 const Value* prev = previous.GetValue(it->first);
28 OnPolicyUpdated(const PolicyNamespace& ns, const PolicyMap& previous, const PolicyMap& current) argument
/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...]

Completed in 405 milliseconds

1234567891011>>