| /external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
| D | profiler.js | 101 return model.children.reduce(function(previous, current) { argument
109 return this.models_.reduce(function(previous, current) { argument
128 var curSub = path.reduce(function(previous, current, index) { argument
211 var size = matchedUnits.reduce(function(previous, current) { argument
251 retVal.remainderUnits.reduce(function(previous, current) { argument
287 var remainderUnits = localUnits.reduce(function(previous, current) { argument
|
| D | profiler_unittest.js | 27 return model.children.reduce(function(previous, current) { argument
|
| D | utility.js | 37 return left.reduce(function(previous, current) { argument
|
| /external/ceres-solver/internal/ceres/ |
| D | line_search_direction.cc | 43 bool NextDirection(const LineSearchMinimizer::State& previous, in NextDirection()
59 bool NextDirection(const LineSearchMinimizer::State& previous, in NextDirection()
111 bool NextDirection(const LineSearchMinimizer::State& previous, in NextDirection()
166 bool NextDirection(const LineSearchMinimizer::State& previous, in NextDirection()
|
| /external/chromium_org/base/containers/ |
| D | linked_list.h | 86 LinkNode(LinkNode<T>* previous, LinkNode<T>* next) in LinkNode() function
111 LinkNode<T>* previous() const { in previous() function
|
| /external/smack/src/org/xbill/DNS/ |
| D | SIG0.java | 36 SIGRecord previous) throws DNSSEC.DNSSECException in signMessage()
63 verifyMessage(Message message, byte [] b, KEYRecord key, SIGRecord previous) in verifyMessage()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | RegularImmutableSortedMultiset.java | 41 CumulativeCountEntry(E element, int count, @Nullable CumulativeCountEntry<E> previous) { in CumulativeCountEntry()
61 CumulativeCountEntry<E> previous = null; in createFromSorted() local
|
| D | DiscreteDomains.java | 52 @Override public Integer previous(Integer value) { in previous() method in DiscreteDomains.IntegerDomain
92 @Override public Long previous(Long value) { in previous() method in DiscreteDomains.LongDomain
144 @Override public BigInteger previous(BigInteger value) { in previous() method in DiscreteDomains.BigIntegerDomain
|
| D | AbstractLinkedIterator.java | 63 protected abstract T computeNext(T previous); in computeNext()
|
| D | LinkedListMultimap.java | 115 Node<K, V> previous; // the previous node (with any key) field in LinkedListMultimap.Node
283 Node<K, V> previous; field in LinkedListMultimap.NodeIterator
334 public Node<K, V> previous() { in previous() method in LinkedListMultimap.NodeIterator
397 Node<K, V> previous; field in LinkedListMultimap.ValueForKeyIterator
453 public V previous() { in previous() method in LinkedListMultimap.ValueForKeyIterator
|
| D | ForwardingListIterator.java | 57 public E previous() { in previous() method in ForwardingListIterator
|
| D | DiscreteDomain.java | 65 public abstract C previous(C value); in previous() method in DiscreteDomain
|
| /external/chromium_org/chrome/browser/chromeos/ |
| D | preferences_unittest.cc | 22 MyMockInputMethodManager(StringPrefMember* previous, in MyMockInputMethodManager()
66 StringPrefMember previous; in TEST() local
|
| /external/chromium_org/chrome/browser/chromeos/policy/ |
| D | network_configuration_updater.cc | 22 const PolicyMap& previous, in OnPolicyUpdated()
68 const base::Value* previous, in OnPolicyChanged()
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| D | NodeTraversal.cpp | 36 if (Node* previous = current.pseudoAwarePreviousSibling()) { in previousIncludingPseudo() local
107 Node* NodeTraversal::previous(const Node& current, const Node* stayWithin) in previous() function in WebCore::NodeTraversal
112 Node* previous = current.previousSibling(); in previous() local
|
| D | NodeChildRemovalTracker.h | 43 NodeChildRemovalTracker* previous() { return m_previous; } in previous() function
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| D | CounterNode.cpp | 137 CounterNode* previous = m_previousSibling; in previousInPreOrder() local
194 RenderCounter* previous = 0; in removeRenderer() local
331 CounterNode* previous = oldChild->m_previousSibling; in removeChild() local
|
| /external/chromium_org/v8/src/ |
| D | hydrogen-escape-analysis.cc | 63 HCapturedObject* HEscapeAnalysisPhase::NewState(HInstruction* previous) { in NewState()
74 HInstruction* previous) { in NewStateForAllocation()
86 HInstruction* previous, in NewStateForLoopHeader()
101 HInstruction* previous, in NewStateCopy()
|
| D | vm-state.h | 32 ExternalCallbackScope* previous() { return previous_scope_; } in previous() function
|
| /external/glide/library/src/main/java/com/bumptech/glide/request/ |
| D | GlideAnimation.java | 8 public boolean animate(Drawable previous, R current, View view, Target<R> target); in animate()
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
| D | ComposedTreeWalker.h | 163 inline void ComposedTreeWalker::previous() in previous() function
166 if (Node* previous = traversePreviousSibling(m_node)) { in previous() local
|
| /external/chromium_org/third_party/WebKit/Source/core/fetch/ |
| D | MemoryCache.cpp | 200 MemoryCacheEntry* previous = current->m_previousInLiveResourcesList; in pruneLiveResources() local
235 MemoryCacheEntry* previous = current->m_previousInAllResourcesList; in pruneDeadResources() local
259 MemoryCacheEntry* previous = current->m_previousInAllResourcesList; in pruneDeadResources() local
280 MemoryCacheEntry* previous = current->m_previousInAllResourcesList; in pruneDeadResources() local
361 MemoryCacheEntry* previous = entry->m_previousInAllResourcesList; in removeFromLRUList() local
423 MemoryCacheEntry* previous = entry->m_previousInLiveResourcesList; in removeFromLiveDecodedResourcesList() local
|
| /external/srtp/crypto/include/ |
| D | aes_cbc.h | 19 v128_t previous; /* previous ciphertext block */ member
|
| /external/chromium_org/third_party/libsrtp/srtp/crypto/include/ |
| D | aes_cbc.h | 54 v128_t previous; /* previous ciphertext block */ member
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | LinkedListMultimap.java | 111 Node<K, V> previous; // the previous node (with any key) field in LinkedListMultimap.Node
279 Node<K, V> previous; field in LinkedListMultimap.NodeIterator
330 public Node<K, V> previous() { in previous() method in LinkedListMultimap.NodeIterator
393 Node<K, V> previous; field in LinkedListMultimap.ValueForKeyIterator
449 public V previous() { in previous() method in LinkedListMultimap.ValueForKeyIterator
|