Home
last modified time | relevance | path

Searched refs:N (Results 1 – 25 of 111) sorted by relevance

12345

/arkcompiler/ets_runtime/test/typeinfer/automatedcases/
DuniqueSymbolsDeclarations.ts357 declare namespace N { const s: unique symbol; } namespace
358 declare const o: { [s]: "a", [N.s]: "b" };
362 AssertType([N.s], "string");
363 AssertType(N.s, "unique symbol");
367 declare function g(x: typeof N.s): void;
377 f(N.s);
378 AssertType(f(N.s), "unique symbol");
380 AssertType(N.s, "unique symbol");
382 f(N["s"]);
383 AssertType(f(N["s"]), "unique symbol");
[all …]
DuniqueSymbols.ts364 declare namespace N { const s: unique symbol; } namespace
365 declare const o: { [s]: "a", [N.s]: "b" };
369 AssertType([N.s], "string");
370 AssertType(N.s, "unique symbol");
374 declare function g(x: typeof N.s): void;
384 f(N.s);
385 AssertType(f(N.s), "unique symbol");
387 AssertType(N.s, "unique symbol");
389 f(N["s"]);
390 AssertType(f(N["s"]), "unique symbol");
[all …]
DinheritanceOfGenericConstructorMethod2.ts25 module N {
35 let n = new N.D1(); // no error
37 AssertType(new N.D1(), "N.D1");
38 AssertType(N.D1, "typeof N.D1");
40 let n2 = new N.D2<number>(); // error
42 AssertType(new N.D2<number>(), "N.D2<number>");
43 AssertType(N.D2, "typeof N.D2");
45 let n3 = new N.D2(); // no error, D2<any>
47 AssertType(new N.D2(), "N.D2<unknown>");
48 AssertType(N.D2, "typeof N.D2");
DrecursiveConditionalCrash3.ts79 type KeysCanBeExpanded_<T, N extends number, Depth extends number[]> = N extends Depth['length'] ? …
81 KeysCanBeExpanded_<T['value'], N, Depth> :
82 T extends Array<infer U> ? KeysCanBeExpanded_<U, N, Depth> :
89 ? `${K}` | Join<`${K}`, KeysCanBeExpanded_<T[K], N, [1, ...Depth]>>
97 export type KeysCanBeExpanded<T, N extends number = 4> = KeysCanBeExpanded_<T, N, []>
102 type Expand__<O, Keys, P extends string, N extends number , Depth extends unknown[] > =
103 N extends Depth['length'] ?
108 Expand__<O[P extends Keys ? 'value' : 'default'], Keys, P, N, Depth> :
110 Expand__<U, Keys, P, N, Depth>[]
113 [K in keyof O]-?: Expand__<O[K], Keys, PrefixWith<P, K>, N, [1, ...Depth]>
[all …]
DinlinedAliasAssignableToConstraintSameAsAlias.ts27 type ShouldA<RF extends RelationFields, N extends Name> = RF[N] extends A[]
28 ? RF[N][0]
38 N extends Name = Name,
39 A1 extends A = RF[N] extends A[] ? RF[N][0] : never,
40 A2 extends A = ShouldA<RF, N>
DimportAliasWithDottedName.ts24 export module N {
30 import N = M.N;
31 let r = N.y;
32 let r2 = M.N.y;
DtailRecursiveConditionalTypes.ts43 type TupleOf<T, N extends number> = number extends N ? T[] : TupleOfRec<T, N, []>;
44 type TupleOfRec<T, N extends number, Acc extends unknown[]> =
45 Acc["length"] extends N ? Acc : TupleOfRec<T, N, [T, ...Acc]>;
DgenericsAndHigherOrderFunctions.ts54 let foo: <K, N>(g: (x: K) => N) =>
66 <R>(f: (_: N) => (_: R) => R) => (_: R) => R
72 = <K, N>(g: (x: K) => N) =>
73 AssertType(<K, N>(g: (x: K) => N) => (h: <M>(_: (_: K) => (_: M) => M) => (_: M) => M) => …
78 AssertType((h: <M>(_: (_: K) => (_: M) => M) => (_: M) => M) => <R>(f: (_: N) => (_: R) …
85 <R>(f: (_: N) => (_: R) => R) => h(combine(f)(g))
86 AssertType(<R>(f: (_: N) => (_: R) => R) => h(combine(f)(g)), "<R>((N) => (R) => R) => (R) => R");
DenumAssignmentCompat4.ts30 namespace N { namespace
41 AssertType([ N.object1, M.object2], "(union)[]");
43 N.object1,
44 AssertType(N.object1, "{ foo: N.MyEnum; }");
DramdaToolsNoInfinite2.ts106 export type NumberOf<N extends any> = N extends number ? _NumberOf<N> : N;
333 type DropForth<L extends List, N extends Iteration> = {
334 0: DropForth<Tail<L>, Prev<N>>;
336 }[Extends<0, Pos<N>>];
338 …type DropBack<L extends List, N extends Iteration, I extends Iteration = Prev<N>, LN extends List …
339 0: DropBack<L, N, Prev<I>, Prepend<LN, L[Pos<I>]>>;
343 type __Drop<L extends List, N extends Iteration, way extends Way = '->'> = {
344 '->': DropForth<L, N>;
345 '<-': DropBack<L, N>;
348 …export type _Drop<L extends List, N extends Number, way extends Way = '->'> = __Drop<Naked<L>, Ite…
[all …]
DclassDeclarationMergedInModuleWithContinuation.ts23 export class N { }
24 export module N {
30 export class O extends M.N {
DrecursiveConditionalCrash2.ts28 type Expand__<O, N, Depth> =
29 N extends Depth ?
32 Expand__<O['value'], N, Depth> :
DintersectionTypeNormalization.ts58 interface N { n: string } interface
61 type Z1 = (A | X & (M | N)) & (C | D);
62 type Z2 = A & (C | D) | X & (M | N) & (C | D)
63 type Z3 = A & C | A & D | X & (M | N) & C | X & (M | N) & D;
64 type Z4 = A & C | A & D | X & M & C | X & N & C | X & M & D | X & N & D;
/arkcompiler/ets_frontend/es2panda/test/type_extractor/testcases_with_assert/
Dtest-export-ts-type-interface-in-namepsace.ts19 namespace N {
31 let obj: N.M.I = {id: 1, name: "a"};
32 let intNum: N.t = 1;
33 let doubleNum: N.t = 1.1;
34 let c: N.M.C = new N.M.C();
/arkcompiler/runtime_core/libpandabase/tests/genmc/
Dmutex_test_genmc.cpp42 constexpr int N = 2; in main() local
44 pthread_t t[N]; in main()
46 for (long i = 0u; i < N; i++) { in main()
50 for (int i = 0u; i < N; i++) { in main()
Dmutex_test_3.cpp47 constexpr int N = 2; in main() local
50 pthread_t t[N]; in main()
52 for (long i = 0u; i < N; i++) { in main()
56 for (int i = 0u; i < N; i++) { in main()
Dmutex_test_2.cpp56 constexpr int N = 2; variable
64 pthread_t t[N];
65 for (long i = 0u; i < N; i++) {
69 for (int i = 0u; i < N; i++) {
/arkcompiler/runtime_core/libpandabase/utils/
Dring_buffer.h25 template <class T, size_t N>
28 template <class T, size_t N, bool is_const = false>
93 …using array_ptr = std::conditional_t<is_const, const std::array<T, N + 1> *, std::array<T, N + 1> …
99 index_ = (index_ == N) ? 0U : index_ + 1; in increment_index()
104 index_ = (index_ == 0U) ? N : index_ - 1; in decrement_index()
107 friend class RingBuffer<T, N>;
118 template <class T, size_t N>
121 static_assert(N > 0U, "0 is invalid size for ring buffer");
130 using iterator = RingBufferIterator<value_type, N>;
131 using const_iterator = RingBufferIterator<value_type, N, true>;
[all …]
/arkcompiler/ets_runtime/test/typeinfer/automatedcases/declarationEmitNameConflicts/
DdeclarationEmit_nameConflicts_0.ts26 export module N {
33 export import c = N;
40 export module N {
55 export module N {
/arkcompiler/ets_runtime/ecmascript/base/
Dgc_ring_buffer.h27 template<typename T, int N>
37 if (count_ == N) { in Push()
39 if (start_ == N) { in Push()
71 std::array<T, N> elements_;
/arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationImportsAndExports5/
Df3.ts35 namespace N { namespace
39 import I = N.Ifc;
40 import C = N.Cls;
/arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationImportsAndExports6/
Df3.ts35 export namespace N { namespace
39 import I = N.Ifc;
40 import C = N.Cls;
/arkcompiler/ets_runtime/test/typeinfer/automatedcases/moduleAugmentationImportsAndExports4/
Df3.ts35 namespace N { namespace
39 import I = N.Ifc;
40 import C = N.Cls;
/arkcompiler/runtime_core/libpandabase/tests/
Dmutex_test.cpp26 constexpr size_t N = 10; variable
106 pthread_t t[N + N];
108 for (size_t i = 0; i < N; i++) {
111 for (size_t i = 0; i < N; i++) {
112 pthread_create(&t[i + N], nullptr, TestThread2, reinterpret_cast<void *>(&arg));
115 for (size_t i = 0; i < N; i++) {
117 pthread_join(t[i + N], nullptr);
123 ASSERT_EQ(res, N);
/arkcompiler/runtime_core/compiler/tests/
Drpo_test.cpp114 auto N = GetGraph()->CreateEmptyBlock(); in TEST_F() local
116 N->AppendInst(ret1); in TEST_F()
136 E->AddSucc(N); in TEST_F()
139 N->AddSucc(exit); in TEST_F()
145 GetGraph()->GetAnalysis<Rpo>().AddBasicBlockAfter(E, N); in TEST_F()
153 Check_Subsequence({A, C, E, N}); in TEST_F()
161 Check_Subsequence({A, C, E, N}); in TEST_F()
243 auto N = GetGraph()->CreateEmptyBlock(); in TEST_F() local
257 G->AddSucc(N); in TEST_F()
258 N->AddSucc(K); in TEST_F()
[all …]

12345