/external/srtp/crypto/include/ |
H A D | aes_cbc.h | 19 v128_t previous; /* previous ciphertext block */ member in struct:__anon12493
|
/external/chromium/chrome/common/net/ |
H A D | raw_host_resolver_proc.cc | 13 net::HostResolverProc* previous) 14 : HostResolverProc(previous), dns_server_(dns_server) {} 12 RawHostResolverProc(const net::IPAddressNumber& dns_server, net::HostResolverProc* previous) argument
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | AbstractIndexedListIterator.java | 61 * the element at that index, if available. Calls to {@link #previous()} can 98 public final E previous() { method in class:AbstractIndexedListIterator
|
H A D | AbstractLinkedIterator.java | 29 * previous element. Null elements are not supported, nor is the 35 * protected Integer computeNext(Integer previous) { 36 * return (previous == 1 << 30) ? null : previous * 2; 58 * Returns the element that follows {@code previous}, or returns {@code null} 63 protected abstract T computeNext(T previous); argument
|
H A D | DiscreteDomain.java | 27 * operations: {@link #next}, {@link #previous} and {@link #distance}, according 48 * #previous}. 65 public abstract C previous(C value); method in class:DiscreteDomain 69 * #next} (if positive) or {@link #previous} (if negative) are needed to reach
|
H A D | ForwardingListIterator.java | 57 public E previous() { method in class:ForwardingListIterator 58 return delegate().previous();
|
H A D | DiscreteDomains.java | 52 @Override public Integer previous(Integer value) { method in class:DiscreteDomains.IntegerDomain 92 @Override public Long previous(Long value) { method in class:DiscreteDomains.LongDomain 144 @Override public BigInteger previous(BigInteger value) { method in class:DiscreteDomains.BigIntegerDomain
|
H A D | RegularImmutableSortedMultiset.java | 41 CumulativeCountEntry(E element, int count, @Nullable CumulativeCountEntry<E> previous) { argument 44 this.cumulativeCount = count + ((previous == null) ? 0 : previous.cumulativeCount); 61 CumulativeCountEntry<E> previous = null; 64 previous = new CumulativeCountEntry<E>(entry.getElement(), entry.getCount(), previous));
|
/external/proguard/src/proguard/gui/ |
H A D | TabbedPane.java | 195 * Selects the previous tab. 197 public void previous() method in class:TabbedPane 199 cardLayout.previous(cardPanel);
|
/external/webkit/Source/WebCore/html/ |
H A D | HTMLTableRowsCollection.cpp | 55 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/nist-sip/java/gov/nist/javax/sip/message/ |
H A D | HeaderIterator.java | 57 public Object previous() throws NoSuchElementException { method in class:HeaderIterator
|
/external/webkit/Source/JavaScriptCore/qt/api/ |
H A D | qscriptvalueiterator.cpp | 99 \sa hasNext(), previous(), name() 111 \sa previous(), hasNext() 126 void QScriptValueIterator::previous() function in class:QScriptValueIterator 128 d_ptr->previous(); 146 \sa toFront(), previous() 155 next() or previous(). 166 next() or previous(). 175 next() or previous(). 186 next() or previous(). 197 or previous() [all...] |
H A D | qscriptvalueiterator_p.h | 38 inline void previous(); 96 inline void QScriptValueIteratorPrivate::previous() function in class:QScriptValueIteratorPrivate 98 m_idx.previous();
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
H A D | ElemContext.java | 108 /** 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/chromium/base/ |
H A D | 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) 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/chromium/chrome/browser/safe_browsing/ |
H A D | safe_browsing_store_file_unittest.cc | 116 int32 previous = kZero; local 117 EXPECT_EQ(fread(&previous, sizeof(previous), 1, file.get()), 1U); 118 EXPECT_NE(previous, kZero);
|
/external/junit/src/org/junit/internal/runners/ |
H A D | TestClass.java | 68 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/inspector/front-end/ |
H A D | CSSCompletions.js | 101 previous: function(str, prefix)
|
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
H A D | AbstractSequentialListTest.java | 191 public Object previous() { method in class:AbstractSequentialListTest.MockListIterator
|
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
H A D | AttributedStringTest.java | 102 public char previous() { method in class:AttributedStringTest.testAttributedCharacterIterator
|
/external/chromium/chrome/browser/ |
H A D | intranet_redirect_detector.cc | 163 net::HostResolverProc* previous) 164 : net::HostResolverProc(previous) { 162 IntranetRedirectHostResolverProc( net::HostResolverProc* previous) argument
|
/external/chromium/net/base/ |
H A D | host_resolver_proc.cc | 59 HostResolverProc::HostResolverProc(HostResolverProc* previous) { argument 60 SetPreviousProc(previous); 63 if (!previous)
|
/external/icu4c/common/ |
H A D | ulist.c | 18 UListNode *previous; member in struct:UListNode 63 newItem->previous = NULL; 88 newItem->previous = list->tail; 114 newItem->previous = NULL; 116 list->head->previous = newItem;
|
/external/icu4c/common/unicode/ |
H A D | uiter.h | 162 * Check if previous() can still return another code unit. 165 * @return boolean value for whether previous() can still return another code unit 205 * Function type declaration for UCharIterator.previous(). 212 * @return the previous code unit (after pre-decrementing the current index) 326 * limit, and previous() only checks the current index against the start, 411 * (public) Check if previous() can still return another code unit. 445 UCharIteratorPrevious *previous; member in struct:UCharIterator 514 * Helper function for UCharIterator to get the previous code point. 521 * @return the previous code point (after pre-decrementing the current index)
|
/external/icu4c/i18n/ |
H A D | coleitr.cpp | 142 * Get the ordering priority of the previous collation element in the string. 144 * @return the previous element's ordering. Returns NULLORDER if an error has 147 int32_t CollationElementIterator::previous(UErrorCode& status) function in class:CollationElementIterator
|