| /external/markdown/MarkdownTest/Tests_2004/ |
| Yuri-Links-in-Headers.text | 3 Let's first have a plain header
12 First with a hash
|
| Ordered and unordered lists.text | 58 1. First
71 1. First
106 1. First
115 1. First
|
| /external/clang/include/clang/Lex/ |
| PPCallbacks.h | 210 PPCallbacks *First, *Second;
214 : First(_First), Second(_Second) {}
217 delete First;
223 First->FileChanged(Loc, Reason, FileType, PrevFID);
230 First->FileSkipped(ParentFile, FilenameTok, FileType);
242 First->InclusionDirective(HashLoc, IncludeTok, FileName, IsAngled, File,
249 First->EndOfMainFile();
254 First->Ident(Loc, str);
260 First->PragmaComment(Loc, Kind, Str);
265 First->PragmaMessage(Loc, Str)
[all...] |
| /external/markdown/MarkdownTest/Tests_2007/ |
| Ordered and unordered lists.text | 58 1. First
71 1. First
106 1. First
115 1. First
|
| /external/markdown/tests/markdown-test/ |
| ordered-and-unordered-list.txt | 58 1. First
71 1. First
106 1. First
115 1. First
|
| /external/clang/utils/TableGen/ |
| ClangASTNodesEmitter.cpp | 22 // Returns the first and last non-abstract subrecords
32 Record *First = 0, *Last = 0;
36 First = Last = Base;
58 if (!First && Result.first)
59 First = Result.first;
66 if (!First)
67 First = R;
74 if (First) {
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| VectorTraits.h | 79 template<typename First, typename Second>
80 struct VectorTraits<pair<First, Second> >
82 typedef VectorTraits<First> FirstTraits;
|
| HashTraits.h | 105 static void constructDeletedValue(TraitType& slot) { FirstTraits::constructDeletedValue(slot.first); }
106 static bool isDeletedValue(const TraitType& value) { return FirstTraits::isDeletedValue(value.first); }
109 template<typename First, typename Second>
110 struct HashTraits<pair<First, Second> > : public PairHashTraits<HashTraits<First>, HashTraits<Second> > { };
|
| /external/protobuf/src/google/protobuf/stubs/ |
| hash.h | 190 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/webrtc/src/system_wrappers/interface/ |
| map_wrapper.h | 56 // Returns a pointer to the first MapItem in the map.
57 MapItem* First() const;
|
| list_wrapper.h | 51 // Puts a pointer to anything first in the list.
56 // Puts a copy of the specified integer first in the list.
59 // Pops the first ListItem from the list
68 // Returns a pointer to the first ListItem in the list.
69 ListItem* First() const;
|
| /external/valgrind/main/exp-ptrcheck/tests/ |
| supp.stderr.exp | 5 First byte (0x........) is 3 bytes inside a 6-byte block alloc'd
|
| syscall.stderr.exp | 8 First byte (0x........) is 3 bytes within a 6-byte block alloc'd
21 First byte is not within a known block
34 First byte (0x........) is 1 bytes within a 6-byte block alloc'd
49 First byte (0x........) is 3 bytes within a 6-byte block alloc'd
60 First byte (0x........) is 0 bytes within a 15-byte block alloc'd
85 First byte (0x........) is 3 bytes within a 6-byte block free'd
98 First byte (0x........) is 1 bytes within a 6-byte block free'd
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| examples.cpp | 129 namespace First
145 typedef First::Bar<Second::Foo> Special;
148 First
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 32 SlotIndex First;
184 return Current->First.isValid();
187 /// first - Return the starting index of the first interfering range in the
189 SlotIndex first() { function in class:llvm::InterferenceCache::Cursor
190 return Current->First;
|
| InterferenceCache.cpp | 68 Aliases[i].second = Aliases[i].first->getTag();
91 Iters[i].setMap(Aliases[i].first->getMap());
99 if (i == e || Aliases[i].first != LIU)
126 BI->First = BI->Last = SlotIndex();
128 // Check for first interference.
136 if (!BI->First.isValid() || StartI < BI->First)
137 BI->First = StartI;
141 if (BI->First.isValid())
|
| /external/webrtc/src/system_wrappers/source/ |
| map_no_stl.cc | 59 if (First())
63 while (Erase(First()) == 0)
90 // 1. Item should be inserted first.
117 MapNoStlItem* MapNoStl::First() const
|
| list_no_stl.h | 56 ListNoStlItem* First() const;
|
| list_stl.h | 52 ListItem* First() const;
|
| map_no_stl.h | 52 MapNoStlItem* First() const;
|
| list_unittest.cc | 53 ListItem* First() const {
54 return list_.First();
184 return Erase(list_.First());
220 while (list->Erase(list->First()) == 0) {
285 ListItem* list_item = list->First();
304 ListItem* lhs_item = lhs->First();
305 ListItem* rhs_item = rhs->First();
350 for (ListItem* item = list_to_reverse->First(); item != NULL;
363 EXPECT_EQ(1,ascending_list->GetUnsignedItem(ascending_list->First()));
399 item = interleave_list->First();
[all...] |
| map_unittest.cc | 74 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) {
|
| map.cc | 58 while (Erase(First()) == 0)
74 MapItem* MapWrapper::First() const
|
| /external/webrtc/src/system_wrappers/test/list/ |
| list.cc | 41 ListItem* list_item = list.First();
60 ListItem* item_iter = list.First();
61 // Fake a previous value for the first iteration
104 // Test First
105 ListItem* first_item = test_list.First();
129 // Pop last and first since they are pushed as unsigned items.
141 FailTest(test_list.InsertBefore(test_list.First(),insert_item_first) != 0);
159 FailTest(test_list.First() != NULL);
|
| /external/webkit/LayoutTests/storage/domstorage/events/resources/ |
| eventTestHarness.js | 49 // First run the test with SessionStorage.
|
