Home
last modified time | relevance | path

Searched refs:First (Results 1 – 25 of 1474) sorted by relevance

12345678910>>...59

/third_party/vk-gl-cts/framework/common/
DtcuEither.hpp39 template<typename First, typename Second>
43 Either (const First& first);
47 Either (const Either<First, Second>& other);
48 Either& operator= (const Either<First, Second>& other);
50 Either& operator= (const First& first);
56 const First& getFirst (void) const;
72 First* m_first;
78 deUint8 m_data[sizeof(First) > sizeof(Second) ? sizeof(First) : sizeof(Second)];
86 template<typename Type, typename First, typename Second>
89 template<typename First, typename Second>
[all …]
/third_party/typescript/tests/baselines/reference/
DenumAssignmentCompat3.types2 namespace First {
3 >First : typeof First
132 var abc: First.E;
133 >abc : First.E
134 >First : any
174 >abc : First.E
179 >abc : First.E
184 >abc : First.E
189 >abc : First.E
194 >abc : First.E
[all …]
DtypeFromPropertyAssignmentOutOfOrder.types2 First.Item = class I {}
3 >First.Item = class I {} : typeof I
4 >First.Item : typeof I
5 >First : typeof First
10 Common.Object = class extends First.Item {}
11 >Common.Object = class extends First.Item {} : typeof Object
15 >class extends First.Item {} : typeof Object
16 >First.Item : I
17 >First : typeof First
35 var First = {};
[all …]
DtypeFromPropertyAssignmentOutOfOrder.symbols2 First.Item = class I {}
3 >First.Item : Symbol(First.Item, Decl(index.js, 0, 0))
4 >First : Symbol(First, Decl(index.js, 0, 0), Decl(roots.js, 0, 3))
5 >Item : Symbol(First.Item, Decl(index.js, 0, 0))
8 Common.Object = class extends First.Item {}
12 >First.Item : Symbol(First.Item, Decl(index.js, 0, 0))
13 >First : Symbol(First, Decl(index.js, 0, 0), Decl(roots.js, 0, 3))
14 >Item : Symbol(First.Item, Decl(index.js, 0, 0))
29 var First = {};
30 >First : Symbol(First, Decl(index.js, 0, 0), Decl(roots.js, 0, 3))
DenumAssignmentCompat3.errors.txt1 …er/enumAssignmentCompat3.ts(68,1): error TS2322: Type 'Abcd.E' is not assignable to type 'First.E'.
2 Property 'd' is missing in type 'First.E'.
3 …iler/enumAssignmentCompat3.ts(70,1): error TS2322: Type 'Cd.E' is not assignable to type 'First.E'.
4 Property 'd' is missing in type 'First.E'.
6 …er/enumAssignmentCompat3.ts(72,1): error TS2322: Type 'Decl.E' is not assignable to type 'First.E'.
7 tests/cases/compiler/enumAssignmentCompat3.ts(75,1): error TS2322: Type 'First.E' is not assignable…
9 tests/cases/compiler/enumAssignmentCompat3.ts(76,1): error TS2322: Type 'First.E' is not assignable…
12 tests/cases/compiler/enumAssignmentCompat3.ts(78,1): error TS2322: Type 'First.E' is not assignable…
13 …r/enumAssignmentCompat3.ts(82,1): error TS2322: Type 'Const.E' is not assignable to type 'First.E'.
14 tests/cases/compiler/enumAssignmentCompat3.ts(83,1): error TS2322: Type 'First.E' is not assignable…
[all …]
DenumAssignmentCompat3.js2 namespace First {
58 var abc: First.E;
93 var First; variable
94 (function (First) { argument
100 })(E = First.E || (First.E = {}));
101 })(First || (First = {}));
DvariadicTuples1.js209 type First<T extends readonly unknown[]> =
222 type T00 = First<[number, symbol, string]>;
223 type T01 = First<[symbol, string]>;
224 type T02 = First<[string]>;
225 type T03 = First<[number, symbol, ...string[]]>;
226 type T04 = First<[symbol, ...string[]]>;
227 type T05 = First<[string?]>;
228 type T06 = First<string[]>;
229 type T07 = First<[]>;
230 type T08 = First<any>;
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/
DItaniumDemangle.h1890 const Node *First; variable
1895 : Node(KBracedRangeExpr), First(First_), Last(Last_), Init(Init_) {} in BracedRangeExpr()
1897 template<typename Fn> void match(Fn F) const { F(First, Last, Init); } in match()
1901 First->print(S); in printLeft()
2176 T* First = nullptr; in FOR_EACH_NODE_KIND() local
2181 bool isInline() const { return First == Inline; } in FOR_EACH_NODE_KIND()
2184 First = Inline; in FOR_EACH_NODE_KIND()
2195 std::copy(First, Last, Tmp); in FOR_EACH_NODE_KIND()
2196 First = Tmp; in FOR_EACH_NODE_KIND()
2198 First = static_cast<T*>(std::realloc(First, NewCap * sizeof(T))); in FOR_EACH_NODE_KIND()
[all …]
DStringView.h24 const char *First; variable
31 StringView(const char (&Str)[N]) : First(Str), Last(Str + N - 1) {} in StringView()
33 : First(First_), Last(Last_) {} in StringView()
35 : First(First_), Last(First_ + Len) {} in StringView()
36 StringView(const char *Str) : First(Str), Last(Str + std::strlen(Str)) {} in StringView()
37 StringView() : First(nullptr), Last(nullptr) {} in StringView()
48 if (const void *P = ::memchr(First + FindBegin, C, size() - FindBegin))
49 return size_t(static_cast<const char *>(P) - First);
59 return StringView(First + From, First + To); in substr()
65 return StringView(First + N, Last);
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DSwitchLoweringUtils.cpp21 unsigned First, unsigned Last) { in getJumpTableRange() argument
22 assert(Last >= First); in getJumpTableRange()
23 const APInt &LowCase = Clusters[First].Low->getValue(); in getJumpTableRange()
35 unsigned First, unsigned Last) { in getJumpTableNumCases() argument
36 assert(Last >= First); in getJumpTableNumCases()
37 assert(TotalCases[Last] >= TotalCases[First]); in getJumpTableNumCases()
39 TotalCases[Last] - (First == 0 ? 0 : TotalCases[First - 1]); in getJumpTableNumCases()
169 for (unsigned First = 0, Last; First < N; First = Last + 1) { in findJumpTables() local
170 Last = LastElement[First]; in findJumpTables()
171 assert(Last >= First); in findJumpTables()
[all …]
DInterferenceCache.cpp165 BI->First = BI->Last = SlotIndex(); in update()
175 if (!BI->First.isValid() || StartI < BI->First) in update()
176 BI->First = StartI; in update()
188 if (!BI->First.isValid() || StartI < BI->First) in update()
189 BI->First = StartI; in update()
195 SlotIndex Limit = BI->First.isValid() ? BI->First : Stop; in update()
200 BI->First = RegMaskSlots[i]; in update()
205 if (BI->First.isValid()) in update()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
Dilist_base.h44 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument
45 node_base_type *Prev = First.getPrev(); in removeRangeImpl()
51 First.setPrev(nullptr); in removeRangeImpl()
55 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
57 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
61 assert(&Next != &First && in transferBeforeImpl()
68 First.getPrev()->setNext(&Last); in transferBeforeImpl()
69 Last.setPrev(First.getPrev()); in transferBeforeImpl()
74 First.setPrev(&Prev); in transferBeforeImpl()
75 Prev.setNext(&First); in transferBeforeImpl()
[all …]
Dsimple_ilist.h162 void insert(iterator I, Iterator First, Iterator Last) { in insert() argument
163 for (; First != Last; ++First) in insert()
164 insert(I, *First); in insert()
201 iterator erase(iterator First, iterator Last) { in erase() argument
202 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase()
217 iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose) { in eraseAndDispose() argument
218 while (First != Last) in eraseAndDispose()
219 First = eraseAndDispose(First, dispose); in eraseAndDispose()
244 void splice(iterator I, simple_ilist &, iterator First, iterator Last) { in splice() argument
245 list_base_type::transferBefore(*I.getNodePtr(), *First.getNodePtr(), in splice()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
Dilist_base.h41 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument
42 node_base_type *Prev = First.getPrev(); in removeRangeImpl()
48 First.setPrev(nullptr); in removeRangeImpl()
52 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, in transferBeforeImpl() argument
54 if (&Next == &Last || &First == &Last) in transferBeforeImpl()
58 assert(&Next != &First && in transferBeforeImpl()
65 First.getPrev()->setNext(&Last); in transferBeforeImpl()
66 Last.setPrev(First.getPrev()); in transferBeforeImpl()
71 First.setPrev(&Prev); in transferBeforeImpl()
72 Prev.setNext(&First); in transferBeforeImpl()
[all …]
Dsimple_ilist.h166 void insert(iterator I, Iterator First, Iterator Last) { in insert() argument
167 for (; First != Last; ++First) in insert()
168 insert(I, *First); in insert()
205 iterator erase(iterator First, iterator Last) { in erase() argument
206 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase()
221 iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose) { in eraseAndDispose() argument
222 while (First != Last) in eraseAndDispose()
223 First = eraseAndDispose(First, dispose); in eraseAndDispose()
248 void splice(iterator I, simple_ilist &, iterator First, iterator Last) { in splice() argument
249 list_base_type::transferBefore(*I.getNodePtr(), *First.getNodePtr(), in splice()
/third_party/zlib/contrib/ada/
Dzlib.adb218 Filter.Offset := Simple_GZip_Header'First;
277 In_First := In_Buffer'First;
286 Flush => Flush_Finish (Last < In_Buffer'First));
288 if Out_Buffer'First <= Out_Last then
289 Data_Out (Out_Buffer (Out_Buffer'First .. Out_Last));
403 Item_First : Ada.Streams.Stream_Element_Offset := Item'First;
407 pragma Assert (Rest_First in Buffer'First .. Buffer'Last + 1);
408 pragma Assert (Rest_Last in Buffer'First - 1 .. Buffer'Last);
411 if Rest_Last = Buffer'First - 1 then
416 Rest_First := Buffer'First;
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
DIceRangeSpec.cpp49 void getRange(const std::string &Token, uint32_t *First, uint32_t *Last) { in getRange() argument
53 *First = std::stoul(Tokens[0]); in getRange()
54 *Last = *First + 1; in getRange()
56 *First = Tokens[0].empty() ? 0 : std::stoul(Tokens[0]); in getRange()
61 if (*First >= *Last) { in getRange()
80 uint32_t First = 0, Last = 0; in record() local
81 getRange(Token, &First, &Last); in record()
83 D->AllFrom = std::min(D->AllFrom, First); in record()
87 D->Numbers.set(First, Last); in record()
/third_party/typescript/tests/cases/conformance/types/tuple/
DvariadicTuples1.ts211 type First<T extends readonly unknown[]> = alias
224 type T00 = First<[number, symbol, string]>;
225 type T01 = First<[symbol, string]>;
226 type T02 = First<[string]>;
227 type T03 = First<[number, symbol, ...string[]]>;
228 type T04 = First<[symbol, ...string[]]>;
229 type T05 = First<[string?]>;
230 type T06 = First<string[]>;
231 type T07 = First<[]>;
232 type T08 = First<any>;
[all …]
/third_party/flutter/flutter/packages/flutter/test/material/
Dtoggle_buttons_test.dart30 Text('First child'),
39 find.widgetWithText(DefaultTextStyle, 'First child'),
69 Text('First child'),
85 find.widgetWithText(DefaultTextStyle, 'First child'),
102 find.widgetWithText(DefaultTextStyle, 'First child'),
130 Text('First child'),
144 find.widgetWithText(DefaultTextStyle, 'First child'),
165 find.widgetWithText(DefaultTextStyle, 'First child'),
212 Text('First child'),
237 Text('First child'),
[all …]
/third_party/protobuf/src/google/protobuf/stubs/
Dhash.h92 template <typename First, typename Second>
93 struct hash<std::pair<First, Second> > {
94 inline size_t operator()(const std::pair<First, Second>& key) const {
95 size_t first_hash = hash<First>()(key.first);
105 inline bool operator()(const std::pair<First, Second>& a,
106 const std::pair<First, Second>& b) const {
/third_party/skia/src/core/
DSkRecordPattern.h86 template <typename First, typename... Rest>
89 bool operator()(T* ptr) { return First()(ptr) || Or<Rest...>()(ptr); } in operator()
91 template <typename First>
92 struct Or<First> {
94 bool operator()(T* ptr) { return First()(ptr); }
119 template <typename First, typename... Rest>
120 class Pattern<First, Rest...> {
171 First fFirst;
DSkTBlockList.h124 if (releaseIndex == First(block)) { in pop_back()
160 count += (sizeof(T) + Last(b) - First(b)) / sizeof(T); in count()
179 return GetItem(fAllocator->headBlock(), First(fAllocator->headBlock())); in front()
183 return GetItem(fAllocator->headBlock(), First(fAllocator->headBlock())); in front()
211 int start = First(b); in item()
241 static int First(const SkBlockAllocator::Block* b) { in First() function
258 br.fAlignedOffset == First(fAllocator->currentBlock())); in pushItem()
272 using Iter = BlockIndexIterator<T&, true, false, &First, &Last, &Increment, &GetItem>;
273 using CIter = BlockIndexIterator<const T&, true, true, &First, &Last, &Increment, &GetItem>;
274 using RIter = BlockIndexIterator<T&, false, false, &Last, &First, &Decrement, &GetItem>;
[all …]
/third_party/flutter/skia/src/core/
DSkRecordPattern.h85 template <typename First, typename... Rest>
88 bool operator()(T* ptr) { return First()(ptr) || Or<Rest...>()(ptr); } in operator()
90 template <typename First>
91 struct Or<First> {
93 bool operator()(T* ptr) { return First()(ptr); }
118 template <typename First, typename... Rest>
119 class Pattern<First, Rest...> {
170 First fFirst;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Lanai/
DLanaiMemAluCombiner.cpp335 MbbIterator First = MemInstr; in findClosestSuitableAluInstr() local
338 while (First != Last) { in findClosestSuitableAluInstr()
339 Decrement ? --First : ++First; in findClosestSuitableAluInstr()
341 if (First == Last) in findClosestSuitableAluInstr()
345 if (First->isDebugInstr()) in findClosestSuitableAluInstr()
348 if (isSuitableAluInstr(IsSpls, First, *Base, *Offset)) { in findClosestSuitableAluInstr()
349 return First; in findClosestSuitableAluInstr()
353 if (First != Last) { in findClosestSuitableAluInstr()
354 if (InstrUsesReg(First, Base)) in findClosestSuitableAluInstr()
356 if (Offset->isReg() && InstrUsesReg(First, Offset)) in findClosestSuitableAluInstr()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
DX86OptimizeLEAs.cpp264 int calcInstrDist(const MachineInstr &First, const MachineInstr &Last);
284 bool isReplaceable(const MachineInstr &First, const MachineInstr &Last,
319 int X86OptimizeLEAPass::calcInstrDist(const MachineInstr &First, in calcInstrDist() argument
323 assert(Last.getParent() == First.getParent() && in calcInstrDist()
325 assert(InstrPos.find(&First) != InstrPos.end() && in calcInstrDist()
329 return InstrPos[&Last] - InstrPos[&First]; in calcInstrDist()
424 bool X86OptimizeLEAPass::isReplaceable(const MachineInstr &First, in isReplaceable() argument
427 assert(isLEA(First) && isLEA(Last) && in isReplaceable()
434 if (MRI->getRegClass(First.getOperand(0).getReg()) != in isReplaceable()
439 AddrDispShift = getAddrDispShift(Last, 1, First, 1); in isReplaceable()
[all …]

12345678910>>...59