/external/llvm/include/llvm/ADT/ |
edit_distance.h | 61 unsigned *Previous = SmallBuffer; 63 Previous = new unsigned [2*(n+1)]; 64 Allocated.reset(Previous); 66 unsigned *Current = Previous + (n + 1); 69 Previous[i] = i; 78 Previous[x-1] + (FromArray[y-1] == ToArray[x-1] ? 0u : 1u), 79 std::min(Current[x-1], Previous[x])+1); 82 if (FromArray[y-1] == ToArray[x-1]) Current[x] = Previous[x-1]; 83 else Current[x] = std::min(Current[x-1], Previous[x]) + 1; 92 Current = Previous; [all...] |
/external/clang/lib/Format/ |
ContinuationIndenter.cpp | 44 return Tok.isMemberAccess() && Tok.Previous && Tok.Previous->closesScope(); 50 const FormatToken &Previous = *Current.Previous; 54 return Previous.is(tok::comma) && !Current.isTrailingComment() && 55 (Previous.Type != TT_CtorInitializerComma || 93 const FormatToken &Previous = *Current.Previous; 94 assert(&Previous == Current.Previous); [all...] |
TokenAnnotator.cpp | 47 FormatToken *Left = CurrentToken->Previous; 52 Left->Previous && Left->Previous->Tok.isNot(tok::kw_template); 71 if (CurrentToken->Previous->isOneOf(tok::pipepipe, tok::ampamp) && 72 ((CurrentToken->Previous->Type == TT_BinaryOperator && 97 FormatToken *Left = CurrentToken->Previous; 101 } else if (FormatToken *MaybeSel = Left->Previous) { 103 if (MaybeSel->isObjCAtKeyword(tok::objc_selector) && MaybeSel->Previous && 104 MaybeSel->Previous->is(tok::at)) { 109 if (Left->Previous & [all...] |
FormatToken.cpp | 62 if (!State.NextToken->Previous || !State.NextToken->Previous->Previous) 66 const FormatToken *LBrace = State.NextToken->Previous->Previous; 75 Style.ColumnLimit - State.Column + State.NextToken->Previous->ColumnWidth; 93 // If the previous token was one of our commas, we are now on the next item. 94 if (Item < Commas.size() && State.NextToken->Previous == Commas[Item]) { 166 ItemEnd = Token->MatchingParen->Previous;
|
TokenAnnotator.h | 48 // Calculate Next and Previous for all tokens. Note that we must overwrite 49 // Next and Previous for every token, as previous formatting runs might have 51 First->Previous = nullptr; 58 I->Tok->Previous = Current;
|
FormatToken.h | 114 MatchingParen(nullptr), Previous(nullptr), Next(nullptr), 360 /// \brief Returns the previous token ignoring comments. 362 FormatToken *Tok = Previous; 364 Tok = Tok->Previous; 392 FormatToken *Previous;
|
Format.cpp | [all...] |
/external/llvm/lib/MC/ |
StringTableBuilder.cpp | 39 StringRef Previous; 41 if (Previous.endswith(s)) { 49 Previous = s;
|
/external/clang/lib/Frontend/ |
FrontendAction.cpp | 38 ASTDeserializationListener *Previous; 43 ASTDeserializationListener *Previous, bool DeletePrevious) 44 : Previous(Previous), DeletePrevious(DeletePrevious) {} 47 delete Previous; 51 if (Previous) 52 Previous->ReaderInitialized(Reader); 56 if (Previous) 57 Previous->IdentifierRead(ID, II); 60 if (Previous) [all...] |
/external/webrtc/src/system_wrappers/interface/ |
map_wrapper.h | 65 MapItem* Previous(MapItem* item) const;
|
list_wrapper.h | 77 ListItem* Previous(ListItem* item) const;
|
/external/libnfc-nxp/src/ |
phFriNfc_NdefReg.c | 133 NdefCb->Previous =NULL; 142 NdefCb->Previous = NULL; 143 NdefReg->NdefTypeList->Previous = NdefCb; 144 NdefReg->NdefTypeList = NdefReg->NdefTypeList->Previous; 191 if(tempNode->Previous==NULL && tempNode->Next!=NULL) 194 NdefReg->NdefTypeList->Previous = NULL; 198 if(tempNode->Next==NULL && tempNode->Previous==NULL) 203 if (tempNode->Previous != NULL) 205 tempNode->Previous->Next = tempNode->Next; 209 tempNode->Next->Previous = tempNode->Previous [all...] |
phFriNfc_NdefReg.h | 215 * This member is required by the library to link to the previous registered item. In case of the 218 struct phFriNfc_NdefReg_Cb *Previous;
|
/external/clang/include/clang/AST/ |
Redeclarable.h | 36 typedef Decl *Previous; 39 /// we've not yet set the previous decl or there isn't one), or to a known 40 /// previous declaration. 41 typedef llvm::PointerUnion<Previous, UninitializedLatest> NotKnownLatest; 52 : Next(NotKnownLatest(Previous(D))) {} 58 Next.get<NotKnownLatest>().template is<Previous>(); 66 if (NKL.is<Previous>()) 67 return static_cast<decl_type*>(NKL.get<Previous>()); 79 Next = Previous(D); 107 /// If NextIsPrevious() is true, this is a link to the previous declaratio [all...] |
/external/webrtc/src/system_wrappers/source/ |
list_no_stl.h | 59 ListNoStlItem* Previous(ListNoStlItem* item) const;
|
list_stl.h | 55 ListItem* Previous(ListItem* item) const;
|
map_no_stl.h | 55 MapNoStlItem* Previous(MapNoStlItem* item) const;
|
/frameworks/base/tests/backup/ |
test_restore.sh | 52 echo --- Previous files 55 echo --- Previous shared_prefs
|
/external/clang/include/clang/Lex/ |
MacroInfo.h | 338 /// \brief Previous macro directive for the same identifier, or NULL. 339 MacroDirective *Previous; 365 : Previous(nullptr), Loc(Loc), MDKind(K), IsFromPCH(false), 375 /// \brief Set previous definition of the macro with the same name. 377 Previous = Prev; 380 /// \brief Get previous definition of the macro with the same name. 381 const MacroDirective *getPrevious() const { return Previous; } 383 /// \brief Get previous definition of the macro with the same name. 384 MacroDirective *getPrevious() { return Previous; }
|
/external/chromium_org/third_party/WebKit/Tools/GardeningServer/scripts/ui/ |
actions_unittests.js | 67 new ui.actions.Previous(), 72 '<li><button class="action previous">\u25C0</button></li>' +
|
actions.js | 101 ui.actions.Previous = base.extends(Action, { 104 this._eventName = 'previous'; 105 $(this).addClass('previous');
|
/external/webrtc/src/system_wrappers/test/map/ |
map.cc | 93 // Test Previous 94 MapItem* second_to_last_item = test_map.Previous(last_item); 97 FailTest(test_map.Previous(first_item) != NULL);
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
EHStreamer.h | 57 unsigned Previous;
|
/external/webrtc/src/system_wrappers/test/list/ |
list.cc | 61 // Fake a previous value for the first iteration 115 // Test Previous 116 ListItem* second_to_last_item = test_list.Previous(last_item); 118 FailTest(test_list.Previous(first_item) != NULL); 119 FailTest(test_list.Previous(NULL) != NULL); 162 FailTest(test_list.Previous(NULL) != NULL);
|
/external/llvm/unittests/ADT/ |
SCCIteratorTest.cpp | 145 NodeSubset Previous(Reachable); 149 if (Previous.count(i)) 153 if (Reachable == Previous)
|