/third_party/icu/icu4c/source/test/testdata/ |
D | GraphemeBreakTest.txt | 37 ÷ 0020 ÷ 0600 ÷ # ÷ [0.2] SPACE (Other) ÷ [999.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] 38 …ther) × [9.0] COMBINING DIAERESIS (Extend_ExtCccZwj) ÷ [999.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] 75 ÷ 000D ÷ 0600 ÷ # ÷ [0.2] <CARRIAGE RETURN (CR)> (CR) ÷ [4.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] 76 … (CR) ÷ [4.0] COMBINING DIAERESIS (Extend_ExtCccZwj) ÷ [999.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] 113 ÷ 000A ÷ 0600 ÷ # ÷ [0.2] <LINE FEED (LF)> (LF) ÷ [4.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] 114 … (LF) ÷ [4.0] COMBINING DIAERESIS (Extend_ExtCccZwj) ÷ [999.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] 151 ÷ 0001 ÷ 0600 ÷ # ÷ [0.2] <START OF HEADING> (Control) ÷ [4.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] 152 …trol) ÷ [4.0] COMBINING DIAERESIS (Extend_ExtCccZwj) ÷ [999.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] 189 ÷ 034F ÷ 0600 ÷ # ÷ [0.2] COMBINING GRAPHEME JOINER (Extend) ÷ [999.0] ARABIC NUMBER SIGN (Prepend… 190 …tend) × [9.0] COMBINING DIAERESIS (Extend_ExtCccZwj) ÷ [999.0] ARABIC NUMBER SIGN (Prepend) ÷ [0.3] [all …]
|
/third_party/icu/icu4c/source/data/brkitr/rules/ |
D | char.txt | 24 $Prepend = [\p{Grapheme_Cluster_Break = Prepend}]; 65 $Prepend [^$Control $CR $LF]; 76 ^$Prepend* $Regional_Indicator $Regional_Indicator / $Regional_Indicator; 77 ^$Prepend* $Regional_Indicator $Regional_Indicator;
|
/third_party/skia/third_party/externals/icu/source/data/brkitr/rules/ |
D | char.txt | 24 $Prepend = [\p{Grapheme_Cluster_Break = Prepend}]; 65 $Prepend [^$Control $CR $LF]; 76 ^$Prepend* $Regional_Indicator $Regional_Indicator / $Regional_Indicator; 77 ^$Prepend* $Regional_Indicator $Regional_Indicator;
|
/third_party/typescript/tests/cases/compiler/ |
D | ramdaToolsNoInfinite.ts | 33 type Prepend<E, T extends any[]> = alias 39 0: Drop<N, Tail<T>, Prepend<any, I>>; 53 Prepend<any, I>; 68 0: Reverse<T, Prepend<T[Pos<I>], R>, Next<I>>;
|
D | infiniteConstraints.ts | 42 export type Prepend<Elm, T extends unknown[]> = 50 { 0: [T]; 1: Prepend<T, Conv<ExactExtract<U, T>>>;}[U extends T ? 0 : 1];
|
D | ramdaToolsNoInfinite2.ts | 234 …export type Prepend<L extends List, A extends any> = ((head: A, ...args: L) => any) extends ((...a… alias 271 import { Prepend } from "List/Prepend"; 283 0: __Reverse<L, Prepend<LO, L[Pos<I>]>, Next<I>>; 309 import { Prepend } from "List/Prepend"; 319 0: DropBack<L, N, Prev<I>, Prepend<LN, L[Pos<I>]>>;
|
/third_party/typescript/tests/baselines/reference/ |
D | ramdaToolsNoInfinite.js | 33 type Prepend<E, T extends any[]> = 39 0: Drop<N, Tail<T>, Prepend<any, I>>; 53 Prepend<any, I>; 68 0: Reverse<T, Prepend<T[Pos<I>], R>, Next<I>>;
|
D | infiniteConstraints.types | 100 export type Prepend<Elm, T extends unknown[]> = 101 >Prepend : Prepend<Elm, T> 117 { 0: [T]; 1: Prepend<T, Conv<ExactExtract<U, T>>>;}[U extends T ? 0 : 1]; 119 >1 : Prepend<T, Conv<ExactExtract<U, T>, ExactExtract<U, T>>>
|
D | ramdaToolsNoInfinite.symbols | 77 type Prepend<E, T extends any[]> = 78 >Prepend : Symbol(Prepend, Decl(ramdaToolsNoInfinite.ts, 29, 20)) 102 0: Drop<N, Tail<T>, Prepend<any, I>>; 108 >Prepend : Symbol(Prepend, Decl(ramdaToolsNoInfinite.ts, 29, 20)) 146 Prepend<any, I>; 147 >Prepend : Symbol(Prepend, Decl(ramdaToolsNoInfinite.ts, 29, 20)) 193 0: Reverse<T, Prepend<T[Pos<I>], R>, Next<I>>; 197 >Prepend : Symbol(Prepend, Decl(ramdaToolsNoInfinite.ts, 29, 20))
|
D | ramdaToolsNoInfinite.types | 56 type Prepend<E, T extends any[]> = 57 >Prepend : [head: E, ...args: T] 70 0: Drop<N, Tail<T>, Prepend<any, I>>; 93 Prepend<any, I>; 118 0: Reverse<T, Prepend<T[Pos<I>], R>, Next<I>>;
|
D | infiniteConstraints.symbols | 143 export type Prepend<Elm, T extends unknown[]> = 144 >Prepend : Symbol(Prepend, Decl(infiniteConstraints.ts, 35, 88)) 178 { 0: [T]; 1: Prepend<T, Conv<ExactExtract<U, T>>>;}[U extends T ? 0 : 1]; 182 >Prepend : Symbol(Prepend, Decl(infiniteConstraints.ts, 35, 88))
|
D | infiniteConstraints.js | 41 export type Prepend<Elm, T extends unknown[]> = 49 { 0: [T]; 1: Prepend<T, Conv<ExactExtract<U, T>>>;}[U extends T ? 0 : 1];
|
D | ramdaToolsNoInfinite2.types | 475 declare module "List/Prepend" { 476 >"List/Prepend" : typeof import("List/Prepend") 481 …export type Prepend<L extends List, A extends any> = ((head: A, ...args: L) => any) extends ((...a… 482 >Prepend : [head: A, ...args: L] 561 import { Prepend } from "List/Prepend"; 562 >Prepend : any 594 0: __Reverse<L, Prepend<LO, L[Pos<I>]>, Next<I>>; 653 import { Prepend } from "List/Prepend"; 654 >Prepend : any 676 0: DropBack<L, N, Prev<I>, Prepend<LN, L[Pos<I>]>>;
|
D | ramdaToolsNoInfinite2.js | 234 …export type Prepend<L extends List, A extends any> = ((head: A, ...args: L) => any) extends ((...a… 271 import { Prepend } from "List/Prepend"; 283 0: __Reverse<L, Prepend<LO, L[Pos<I>]>, Next<I>>; 309 import { Prepend } from "List/Prepend"; 319 0: DropBack<L, N, Prev<I>, Prepend<LN, L[Pos<I>]>>;
|
D | infiniteConstraints.errors.txt | 57 export type Prepend<Elm, T extends unknown[]> = 65 { 0: [T]; 1: Prepend<T, Conv<ExactExtract<U, T>>>;}[U extends T ? 0 : 1];
|
/third_party/skia/third_party/externals/dawn/src/common/ |
D | SlabAllocator.cpp | 147 void SlabAllocatorImpl::SentinelSlab::Prepend(SlabAllocatorImpl::Slab* slab) { in Prepend() function in SlabAllocatorImpl::SentinelSlab 186 mFullSlabs.Prepend(slab); in Allocate() 209 mRecycledSlabs.Prepend(slab); in Deallocate() 245 mAvailableSlabs.Prepend(new (alignedPtr) Slab(allocation, node)); in GetNewSlab()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/ |
D | cord_ring_test.cc | 315 ring = CordRepRing::Prepend(ring, MakeLeaf(flats[i])); in FromFlats() 323 ring = CordRepRing::Prepend(ring, MakeLeaf(flats[--middle1])); in FromFlats() 326 ring = CordRepRing::Prepend(ring, MakeLeaf(flats[middle1 - i])); in FromFlats() 675 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, MakeFlat(str2))); in TEST_P() 801 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, str2)); in TEST_P() 817 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, str2)); in TEST_P() 848 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, str2)); in TEST_P() 863 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, str2, 26)); in TEST_P() 865 result = CordRepRing::Prepend(result, str3); in TEST_P() 876 result = CordRepRing::Prepend(result, flats[4 - i]); in TEST_P() [all …]
|
D | cordz_test.cc | 364 cord().Prepend(src); in TEST_P() 369 cord().Prepend(MakeString(TestCordSize::kSmall)); in TEST_P() 374 cord().Prepend(MakeString(TestCordSize::kLarge)); in TEST_P() 380 cord.Prepend(std::string(Length(GetParam()), '.')); in TEST_P() 388 cord.Prepend(std::string(Length(GetParam()), '.')); in TEST_P() 396 cord.Prepend(std::string(Length(GetParam()), '.')); in TEST_P()
|
D | cord_test.cc | 669 self.Prepend(self); in TEST_P() 706 x.Prepend(y); in TEST_P() 712 x.Prepend(b); in TEST_P() 880 concat.Prepend(tmp); in TEST_P() 1525 reused_nodes_cord.Prepend(absl::Cord(std::string(40, 'b'))); in TEST_P() 1526 reused_nodes_cord.Prepend(absl::Cord(std::string(40, 'a'))); in TEST_P() 1529 reused_nodes_cord.Prepend(reused_nodes_cord); in TEST_P() 1537 for (int i = 0; i < 128; ++i) subcords.Prepend(flat_cord.Subcord(i, 128)); in TEST_P() 1665 reused_nodes_cord.Prepend(absl::Cord("def")); in TEST() 1666 reused_nodes_cord.Prepend(absl::Cord("abc")); in TEST() [all …]
|
D | cord_test_helpers.h | 109 tmp.Prepend(result); in MakeFragmentedCord()
|
/third_party/icu/icu4c/source/test/testdata/break_rules/ |
D | grapheme.txt | 24 Prepend = [\p{Grapheme_Cluster_Break = Prepend}]; 60 GB9b: Prepend .;
|
/third_party/icu/ohos_icu4j/src/main/tests/resources/ohos/global/icu/dev/test/rbbi/break_rules/ |
D | grapheme.txt | 24 Prepend = [\p{Grapheme_Cluster_Break = Prepend}]; 60 GB9b: Prepend .;
|
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/break_rules/ |
D | grapheme.txt | 24 Prepend = [\p{Grapheme_Cluster_Break = Prepend}]; 60 GB9b: Prepend .;
|
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree_test.cc | 161 : CordRepBtree::Prepend(node, data); in BtreeAdd() 203 : CordRepBtree::Prepend(tree, MakeHexFlat(i)); in MakeTree() 220 while (++rit != flats.rend()) tree = CordRepBtree::Prepend(tree, *rit); in CreateTreeReverse() 394 auto* result = CordRepBtree::Prepend(leaf, flats.front()); in TEST_P() 417 result = CordRepBtree::Prepend(leaf, flats.front()); in TEST_P() 449 auto* result = CordRepBtree::Prepend(leaf, flat); in TEST_P() 527 tree = CordRepBtree::Prepend(tree, flats.front()); in TEST_P() 539 CordRepBtree* result = CordRepBtree::Prepend(tree, flats.front()); in TEST_P() 557 tree = CordRepBtree::Prepend(tree, flats.front()); in TEST_P() 570 CordRepBtree* result = CordRepBtree::Prepend(tree, flats.front()); in TEST_P() [all …]
|
/third_party/node/deps/v8/src/wasm/ |
D | local-decl-encoder.h | 29 void Prepend(Zone* zone, const byte** start, const byte** end) const;
|