Searched refs:First (Results 1 - 25 of 234) sorted by relevance

12345678910

/external/markdown/MarkdownTest/Tests_2004/
H A DYuri-Links-in-Headers.text12 First with a hash
H A DOrdered and unordered lists.text58 1. First
71 1. First
106 1. First
115 1. First
/external/clang/include/clang/Lex/
H A DPPCallbacks.h235 PPCallbacks *First, *Second; member in class:clang::PPChainedCallbacks
239 : First(_First), Second(_Second) {}
242 delete First;
248 First->FileChanged(Loc, Reason, FileType, PrevFID);
255 First->FileSkipped(ParentFile, FilenameTok, FileType);
261 return First->FileNotFound(FileName, RecoveryPath) ||
273 First->InclusionDirective(HashLoc, IncludeTok, FileName, IsAngled, File,
280 First->EndOfMainFile();
285 First->Ident(Loc, str);
291 First
[all...]
/external/markdown/MarkdownTest/Tests_2007/
H A DOrdered and unordered lists.text58 1. First
71 1. First
106 1. First
115 1. First
/external/markdown/tests/markdown-test/
H A Dordered-and-unordered-list.txt58 1. First
71 1. First
106 1. First
115 1. First
/external/webkit/Source/JavaScriptCore/wtf/
H A DVectorTraits.h79 template<typename First, typename Second>
80 struct VectorTraits<pair<First, Second> >
82 typedef VectorTraits<First> FirstTraits;
H A DHashTraits.h112 template<typename First, typename Second>
113 struct HashTraits<pair<First, Second> > : public PairHashTraits<HashTraits<First>, HashTraits<Second> > { };
/external/protobuf/src/google/protobuf/stubs/
H A Dhash.h190 template <typename First, typename Second>
191 struct hash<pair<First, Second> > {
192 inline size_t operator()(const pair<First, Second>& key) const {
193 size_t first_hash = hash<First>()(key.first);
203 inline size_t operator()(const pair<First, Second>& a,
204 const pair<First, Second>& b) const {
/external/clang/utils/TableGen/
H A DClangASTNodesEmitter.cpp80 Record *First = 0, *Last = 0; local
84 First = Last = Base;
106 if (!First && Result.first)
107 First = Result.first;
114 if (!First)
115 First = R;
122 if (First) {
128 OS << Base->getName() << ", " << First->getName() << ", "
132 return std::make_pair(First, Last);
143 << macroName(Root.getName()) << "_RANGE(Base, First, Las
[all...]
/external/llvm/lib/CodeGen/
H A DInterferenceCache.cpp135 BI->First = BI->Last = SlotIndex();
145 if (!BI->First.isValid() || StartI < BI->First)
146 BI->First = StartI;
158 if (!BI->First.isValid() || StartI < BI->First)
159 BI->First = StartI;
165 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop;
170 BI->First
[all...]
H A DInterferenceCache.h34 SlotIndex First; member in struct:llvm::InterferenceCache::BlockInterference
207 return Current->First.isValid();
213 return Current->First;
/external/llvm/lib/Target/Hexagon/
H A DHexagonRemoveSZExtArgs.cpp65 Instruction* First = F.getEntryBlock().begin(); local
66 SI->insertBefore(First);
/external/webrtc/src/system_wrappers/test/list/
H A Dlist.cc41 ListItem* list_item = list.First();
60 ListItem* item_iter = list.First();
104 // Test First
105 ListItem* first_item = test_list.First();
141 FailTest(test_list.InsertBefore(test_list.First(),insert_item_first) != 0);
159 FailTest(test_list.First() != NULL);
/external/webrtc/src/system_wrappers/source/
H A Dlist_unittest.cc53 ListItem* First() const { function in class:ListWrapperSimple
54 return list_.First();
100 ListItem* list_item = list_wrapper->First();
103 list_item = list_wrapper->First();
209 return Erase(list_.First());
299 ListItem* list_item = list->First();
318 ListItem* lhs_item = lhs->First();
319 ListItem* rhs_item = rhs->First();
367 for (ListItem* item = list_to_reverse->First(); item != NULL;
379 EXPECT_EQ(1U, ascending_list->GetUnsignedItem(ascending_list->First()));
[all...]
H A Dmap_no_stl.cc59 if (First())
63 while (Erase(First()) == 0)
117 MapNoStlItem* MapNoStl::First() const function in class:webrtc::MapNoStl
H A Dlist_stl.h52 ListItem* First() const;
H A Dmap_no_stl.h52 MapNoStlItem* First() const;
H A Dmap_unittest.cc74 MapItem* remove_item = clear_map->First();
100 MapItem* item = print_map.First();
144 MapItem* lhs_item = lhs.First();
174 MapItem* item_first = ascending_map_.First();
218 MapItem* ascend_item = ascending_map_.First();
228 while (compare_map.Erase(compare_map.First()) == 0) {
H A Dmap.cc58 while (Erase(First()) == 0)
74 MapItem* MapWrapper::First() const function in class:webrtc::MapWrapper
H A Dlist_no_stl.h56 ListNoStlItem* First() const;
H A Dlist_no_stl.cc63 while (Erase(First()) == 0)
121 ListItem* ListWrapper::First() const function in class:webrtc::ListWrapper
/external/webrtc/src/system_wrappers/interface/
H A Dmap_wrapper.h56 MapItem* First() const;
H A Dlist_wrapper.h68 ListItem* First() const;
/external/clang/test/CXX/temp/temp.spec/temp.expl.spec/
H A Dexamples.cpp129 namespace First namespace in namespace:PR9668
145 typedef First::Bar<Second::Foo> Special;
148 First namespace in namespace:PR9668
/external/webrtc/src/system_wrappers/test/map/
H A Dmap.cc41 MapItem* map_item = map.First();
80 // Test First
81 MapItem* first_item = test_map.First();

Completed in 229 milliseconds

12345678910