/external/stlport/stlport/stl/debug/ |
H A D | _slist.h | 224 iterator previous(const_iterator __pos) { function in class:slist 227 return iterator(&_M_iter_list, _M_non_dbg_impl.previous(__pos._M_iterator)); 229 const_iterator previous(const_iterator __pos) const { function in class:slist 232 return const_iterator(&_M_iter_list, _M_non_dbg_impl.previous(__pos._M_iterator));
|
/external/stlport/stlport/stl/pointers/ |
H A D | _slist.h | 220 iterator previous(const_iterator __pos) function in class:slist 221 { return iterator(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node); } 222 const_iterator previous(const_iterator __pos) const function in class:slist 223 { return const_iterator(const_cast<_Node_base*>(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node)); }
|
/external/webkit/Source/WebCore/editing/ |
H A D | TypingCommand.cpp | 340 VisiblePosition previous = start.previous(); local 341 if (previous.isNotNull()) { 342 VisiblePosition p1 = startOfWord(previous, LeftWordIfOnBoundary); 494 if (endingSelection().visibleStart().previous(CannotCrossEditingBoundary).isNull()) { 513 if (isStartOfParagraph(visibleStart) && isFirstPositionAfterTable(visibleStart.previous(CannotCrossEditingBoundary))) { 530 selectionToDelete.setWithoutValidation(selectionToDelete.end(), selectionToDelete.end().previous(BackwardDeletion));
|
H A D | VisiblePosition.cpp | 75 VisiblePosition VisiblePosition::previous(EditingBoundaryCrossingRule rule) const function in class:WebCore::VisiblePosition 79 // find first previous DOM position that is visible 82 // return null visible position if there is no previous visible position 90 // we should always be able to make the affinity DOWNSTREAM, because going previous from an 426 // FIXME: Move to the previous non-editable region. 686 VisiblePosition previous = visiblePosition.previous(); 687 return previous.isNull() || !previous.deepEquivalent().deprecatedNode()->isDescendantOf(node);
|
/external/webkit/Source/WebCore/platform/text/gtk/ |
H A D | TextBreakIteratorGtk.cpp | 51 int previous(); 165 int CharacterIterator::previous() function in class:WebCore::CharacterIterator 167 int previous = m_index - 1; local 169 if (previous >= 0) { 170 m_utf16Index = max(m_utf16Index - characterSize(previous), 0); 171 m_index = previous; 308 pos = iterator->m_charIterator.previous(); 335 while (iterator->m_charIterator.previous() != TextBreakDone) { 383 iterator->m_charIterator.previous();
|
/external/webkit/Source/WebCore/rendering/ |
H A D | RenderCounter.cpp | 312 // We are also a reset counter and the previous reset was on a sibling renderer 319 // We are not a reset node or the previous reset must be on an ancestor of our owner renderer 334 // We are at the potential end of the search, but we had no previous sibling candidate 355 // We come here if the previous sibling or parent of our owner renderer had no 356 // good counter, or we are a reset node and the counter on the previous sibling 361 // We are searching descendants of a previous sibling of the renderer that the 366 // Since we had a suitable previous counter before, we should only consider this one as our 370 // We are no longer interested in previous siblings of the currentRenderer or their children 371 // as counters they may have attached cannot be the previous sibling of the counter we are placing. 527 CounterNode* previous; local [all...] |
/external/aac/libSBRdec/src/ |
H A D | sbrdec_freq_sca.cpp | 525 int previous; local 530 previous = stop; /* Start with highest QMF channel */ 545 diff[i] = previous - current; 546 previous = current;
|
/external/bluetooth/bluedroid/gki/ulinux/ |
H A D | gki_ulinux.c | 611 struct timespec previous = {0,0}; local 662 delta_ns = current.tv_nsec - previous.tv_nsec; 663 delta_ns += (current.tv_sec - previous.tv_sec) * 1000000000; 667 * timeout = (previous time + timeout + delay) - current time 668 * timeout = timeout + delay - (current time - previous time) 673 previous = current;
|
/external/icu4c/i18n/ |
H A D | ucol_tok.h | 83 UColToken* previous; member in struct:UColToken
|
/external/icu4c/test/intltest/ |
H A D | citrtest.cpp | 75 virtual UChar previous(){return DONE;}; function in class:SCharacterIterator 444 c = iter.previous(); 449 c=iter.previous(); 451 errln("previous didn't return DONE at the beginning"); 540 c = iter.previous(); 804 c=iter->previous(iter); 805 c2=ci.previous(); 1105 virtual UChar previous() { function in class:SubCharIter
|
H A D | icusvtst.cpp | 1233 UnicodeString* previous = (UnicodeString*)service->getKey((ICUServiceKey&)key, NULL, this, status); local 1234 if (previous) { 1235 previous->insert(0, "A different greeting: \""); 1236 previous->append("\""); 1237 return previous;
|
H A D | tstnorm.cpp | 518 for (ch = iter->last(); ch != iter->DONE; ch = iter->previous()) { 606 UChar32 previous() { function in class:UChar32Iterator 651 c1=iter.previous(); 652 c2=iter32.previous(); 745 // - for previous(), 0 for current(), + for next()
|
/external/jmonkeyengine/engine/src/core/com/jme3/font/ |
H A D | LetterQuad.java | 34 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/v8/src/ |
H A D | d8-posix.cc | 549 int previous = umask(mask); local 550 return Number::New(previous);
|
H A D | store-buffer.cc | 154 Address previous = NULL; local 159 if (current != previous) { 164 previous = current;
|
H A D | utils.h | 241 static uint32_t update(uint32_t previous, T value) { argument 242 return (previous & ~kMask) | encode(value);
|
/external/webkit/Source/JavaScriptCore/runtime/ |
H A D | Structure.cpp | 220 Structure::Structure(JSGlobalData& globalData, const Structure* previous) argument 222 , m_typeInfo(previous->typeInfo()) 223 , m_prototype(globalData, this, previous->storedPrototype()) 224 , m_classInfo(previous->m_classInfo) 225 , m_propertyStorageCapacity(previous->m_propertyStorageCapacity) 229 , m_hasGetterSetterProperties(previous->m_hasGetterSetterProperties) 230 , m_hasNonEnumerableProperties(previous->m_hasNonEnumerableProperties) 232 , m_specificFunctionThrashCount(previous->m_specificFunctionThrashCount) 233 , m_anonymousSlotCount(previous->anonymousSlotCount()) 234 , m_preventExtensions(previous [all...] |
/external/webkit/Source/WebKit/android/WebCoreSupport/autofill/ |
H A D | FormManagerAndroid.cpp | 159 // a previous node of |element|. 162 Node* previous = element.previousSibling(); local 163 if (!previous) 166 if (previous->isTextNode()) { 167 inferred_label = WTFStringToString16(previous->nodeValue()); 171 // If we didn't find text, check for previous paragraph. 174 if (inferred_label.empty() && previous->isElementNode()) { 175 Element* element = static_cast<Element*>(previous); 180 // If we didn't find paragraph, check for previous paragraph to this. 184 Node* sibling = previous 246 Node* previous = parent; local 292 Node* previous = parent->previousSibling(); local [all...] |
/external/chromium/chrome/common/extensions/docs/examples/apps/hello-python/httplib2/ |
H A D | __init__.py | 947 response.previous = old_response 1069 response.previous = Response(info) 1070 response.previous.fromcache = True 1176 previous = None variable in class:Response
|
/external/chromium/net/base/ |
H A D | host_resolver_impl_unittest.cc | 80 explicit CapturingHostResolverProc(HostResolverProc* previous) argument 81 : HostResolverProc(previous), event_(true, false) {
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | AbstractMultimap.java | 819 public V previous() { method in class:AbstractMultimap.WrappedList.WrappedListIterator 820 return getDelegateListIterator().previous();
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | MapMakerInternalMapTest.java | 1806 public void setPreviousExpirable(ReferenceEntry<K, V> previous) { argument 1807 this.previousExpirable = previous; 1830 public void setPreviousEvictable(ReferenceEntry<K, V> previous) { argument 1831 this.previousEvictable = previous;
|
/external/icu4c/common/ |
H A D | rbbi.cpp | 440 // previous call to this function, delete it now. 526 * equivalent to repeatedly calling next() or previous(). 539 result = previous(); 576 int32_t RuleBasedBreakIterator::previous(void) { function in class:RuleBasedBreakIterator 735 // previous will give result 0 or 1 boundary away from offset, 738 int32_t oldresult = previous(); 740 int32_t result = previous(); 766 result = previous(); 819 // position specified by the caller, we can just use previous() 845 result = previous(); [all...] |
/external/kernel-headers/original/asm-mips/ |
H A D | mipsmtregs.h | 200 /* Enable virtual processor execution if previous suggested it should be. 205 static inline void evpe(int previous) argument 207 if ((previous & MVPCONTROL_EVP)) 241 /* enable multi-threaded execution if previous suggested it should be. 246 static inline void emt(int previous) argument 248 if ((previous & EMT_ENABLE))
|
/external/libxslt/libxslt/ |
H A D | pattern.c | 886 xmlNodePtr previous; local 889 previous = (xmlNodePtr) 892 if ((previous != NULL) && 893 (previous->parent == node->parent)) { 901 if (sibling == previous) 903 if ((previous->type == XML_ELEMENT_NODE) && 904 (previous->name != NULL) && 906 (previous->name[0] == sibling->name[0]) && 907 (xmlStrEqual(previous->name, sibling->name))) 922 if (sibling == previous) 1018 xmlNodePtr previous; local 1832 xsltCompMatchPtr element, first = NULL, previous = NULL; local [all...] |