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

1234567891011>>

/external/llvm/test/MC/MachO/
H A Dprevious.s9 .previous
12 .previous
/external/glide/library/src/main/java/com/bumptech/glide/load/
H A DMultiTransformation.java31 Resource<T> previous = resource;
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 !
[all...]
/external/chromium_org/device/hid/
H A Dhid_report_descriptor_item.cc26 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
24 HidReportDescriptorItem( const uint8_t* bytes, HidReportDescriptorItem* previous) argument
[all...]
/external/llvm/test/MC/ELF/
H A Delf_directive_previous.s9 .previous
12 .previous
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DChildNodeList.cpp62 for (Node* previous = currentNode.previousSibling(); previous; previous = previous->previousSibling()) {
64 return previous;
H A DNodeTraversal.cpp36 if (Node* previous = current.pseudoAwarePreviousSibling()) {
37 while (previous->pseudoAwareLastChild())
38 previous = previous->pseudoAwareLastChild();
39 return previous;
113 Node* NodeTraversal::previous(const Node& current, const Node* stayWithin) function in class:blink::NodeTraversal
118 Node* previous = current.previousSibling(); local
119 while (Node* child = previous->lastChild())
120 previous = child;
121 return previous;
[all...]
H A DNodeChildRemovalTracker.h45 NodeChildRemovalTracker* previous() { return m_previous; } function in class:blink::NodeChildRemovalTracker
68 for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->previous()) {
/external/elfutils/0.153/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.cpp48 HTMLTableRowElement* HTMLTableRowsCollection::rowAfter(HTMLTableElement& table, HTMLTableRowElement* previous) argument
52 if (previous && previous->parentNode() != table) {
53 if (HTMLTableRowElement* row = Traversal<HTMLTableRowElement>::nextSibling(*previous))
59 if (!previous)
61 else if (isInSection(*previous, theadTag))
62 child = Traversal<HTMLElement>::nextSibling(*previous->parentNode());
71 if (!previous || isInSection(*previous, theadTag))
73 else if (previous
[all...]
/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_org/chrome/browser/chromeos/
H A Dpreferences_unittest.cc46 MyMockInputMethodManager(StringPrefMember* previous, argument
48 : previous_(previous),
81 StringPrefMember previous; local
82 previous.Init(prefs::kLanguagePreviousInputMethod, &prefs);
83 previous.SetValue("KeyboardA");
88 MyMockInputMethodManager mock_manager(&previous, &current);
95 EXPECT_EQ("KeyboardA", previous.GetValue());
/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.cc43 bool NextDirection(const LineSearchMinimizer::State& previous, argument
59 bool NextDirection(const LineSearchMinimizer::State& previous, argument
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, argument
120 previous
166 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.
76 self.previous = None
93 return not self.previous or self.previous.line_number != self.line_number
145 node = node.previous
/external/glide/library/src/main/java/com/bumptech/glide/request/
H A DGlideAnimation.java8 public boolean animate(Drawable previous, R current, View view, Target<R> target); argument
/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/chromium_org/third_party/closure_linter/closure_linter/
H A Dtokenutil.py43 token = token.previous
48 """Returns the first token in the previous line as token.
54 The first token in the previous line as token, or None if token is on the
58 if first_in_line.previous:
59 return GetFirstTokenInSameLine(first_in_line.previous)
121 previous = token.previous
122 if previous:
123 if func(previous):
124 return previous
[all...]
/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/chromium_org/chrome/browser/ui/autofill/
H A Dpassword_generation_popup_controller_impl.cc37 base::WeakPtr<PasswordGenerationPopupControllerImpl> previous,
45 if (previous.get() &&
46 previous->element_bounds() == bounds &&
47 previous->web_contents() == web_contents &&
48 previous->container_view() == container_view) {
49 return previous;
52 if (previous.get())
53 previous->Hide();
36 GetOrCreate( base::WeakPtr<PasswordGenerationPopupControllerImpl> previous, const gfx::RectF& bounds, const PasswordForm& form, int max_length, password_manager::PasswordManager* password_manager, PasswordGenerationPopupObserver* observer, content::WebContents* web_contents, gfx::NativeView container_view) argument
/external/chromium_org/components/policy/core/common/
H A Dpolicy_service.cc29 const PolicyMap& previous,
35 const base::Value* prev = previous.GetValue(it->first);
28 OnPolicyUpdated(const PolicyNamespace& ns, const PolicyMap& previous, const PolicyMap& current) argument

Completed in 718 milliseconds

1234567891011>>