| /third_party/typescript/tests/baselines/reference/ |
| D | twiceNestedKeyofIndexInference.types | 2 type Set1<T, K1 extends keyof T> = T extends any[] ? T : Pick<T, Exclude<keyof T, K1>> & {
3 >Set1 : Set1<T, K1>
5 [SK1 in K1]-?: Required<Pick<T, SK1>>;
6 }[K1];
8 type Set2<T, K1 extends keyof T, K2 extends keyof T[K1]> = T extends any[] ? T : Pick<T, Exclude<ke…
9 >Set2 : Set2<T, K1, K2>
11 [SK1 in K1]-?: Required<{
12 [key in K1]: Set1<T[K1], K2>;
14 }[K1];
16 declare function set<T, K1 extends keyof T>(source: T, path: [K1], value: T[K1]): Set1<T, K1>;
[all …]
|
| D | deepKeysIndexing.types | 14 >keys2broken : keys2broken<O, K1>
17 K1 extends keyof O
18 > = O[K1] extends object ? Extract<keyof O[K1], string> : never;
21 >keys2working : keys2working<O, K1>
24 K1 extends keyof O
25 > = O[K1] extends object ? keyof O[K1] : never;
27 type keys2workaround<O extends DeepObject, K1 extends keyof O> = Extract<
28 >keys2workaround : keys2workaround<O, K1>
30 O[K1] extends object ? keyof O[K1] : never,
54 >broken : <K1 extends keyof O, K2 extends keys2broken<O, K1>, V extends O[K1][K2]>(k1: K1, k2: K2, …
[all …]
|
| D | twiceNestedKeyofIndexInference.symbols | 2 type Set1<T, K1 extends keyof T> = T extends any[] ? T : Pick<T, Exclude<keyof T, K1>> & {
5 >K1 : Symbol(K1, Decl(twiceNestedKeyofIndexInference.ts, 0, 12))
13 >K1 : Symbol(K1, Decl(twiceNestedKeyofIndexInference.ts, 0, 12))
15 [SK1 in K1]-?: Required<Pick<T, SK1>>;
17 >K1 : Symbol(K1, Decl(twiceNestedKeyofIndexInference.ts, 0, 12))
23 }[K1];
24 >K1 : Symbol(K1, Decl(twiceNestedKeyofIndexInference.ts, 0, 12))
26 type Set2<T, K1 extends keyof T, K2 extends keyof T[K1]> = T extends any[] ? T : Pick<T, Exclude<ke…
29 >K1 : Symbol(K1, Decl(twiceNestedKeyofIndexInference.ts, 4, 12))
33 >K1 : Symbol(K1, Decl(twiceNestedKeyofIndexInference.ts, 4, 12))
[all …]
|
| D | twiceNestedKeyofIndexInference.js | 2 type Set1<T, K1 extends keyof T> = T extends any[] ? T : Pick<T, Exclude<keyof T, K1>> & {
3 [SK1 in K1]-?: Required<Pick<T, SK1>>;
4 }[K1];
6 type Set2<T, K1 extends keyof T, K2 extends keyof T[K1]> = T extends any[] ? T : Pick<T, Exclude<ke…
7 [SK1 in K1]-?: Required<{
8 [key in K1]: Set1<T[K1], K2>;
10 }[K1];
12 declare function set<T, K1 extends keyof T>(source: T, path: [K1], value: T[K1]): Set1<T, K1>;
14 declare function set<T, K1 extends keyof T, K2 extends keyof T[K1]>(source: T, path: [K1, K2], valu…
|
| D | deepKeysIndexing.symbols | 22 K1 extends keyof O
23 >K1 : Symbol(K1, Decl(deepKeysIndexing.ts, 8, 23))
26 > = O[K1] extends object ? Extract<keyof O[K1], string> : never;
28 >K1 : Symbol(K1, Decl(deepKeysIndexing.ts, 8, 23))
31 >K1 : Symbol(K1, Decl(deepKeysIndexing.ts, 8, 23))
40 K1 extends keyof O
41 >K1 : Symbol(K1, Decl(deepKeysIndexing.ts, 13, 23))
44 > = O[K1] extends object ? keyof O[K1] : never;
46 >K1 : Symbol(K1, Decl(deepKeysIndexing.ts, 13, 23))
48 >K1 : Symbol(K1, Decl(deepKeysIndexing.ts, 13, 23))
[all …]
|
| D | deepKeysIndexing.js | 11 K1 extends keyof O
12 > = O[K1] extends object ? Extract<keyof O[K1], string> : never;
16 K1 extends keyof O
17 > = O[K1] extends object ? keyof O[K1] : never;
19 type keys2workaround<O extends DeepObject, K1 extends keyof O> = Extract<
20 O[K1] extends object ? keyof O[K1] : never,
34 K1 extends keyof O, field in Bar
35 K2 extends keys2broken<O, K1>, field in Bar
36 V extends O[K1][K2]
37 >(k1: K1, k2: K2, value: V) {}
[all …]
|
| D | deepKeysIndexing.errors.txt | 16 K1 extends keyof O
17 > = O[K1] extends object ? Extract<keyof O[K1], string> : never;
21 K1 extends keyof O
22 > = O[K1] extends object ? keyof O[K1] : never;
24 type keys2workaround<O extends DeepObject, K1 extends keyof O> = Extract<
25 O[K1] extends object ? keyof O[K1] : never,
39 K1 extends keyof O,
40 K2 extends keys2broken<O, K1>,
41 V extends O[K1][K2]
42 >(k1: K1, k2: K2, value: V) {}
[all …]
|
| D | qualify.types | 75 export module K1 {
91 var v2:K1.I3=v1;
92 >v2 : K1.I3
93 >K1 : any
96 var v3:K1.I3[]=v1;
97 >v3 : K1.I3[]
98 >K1 : any
101 var v4:()=>K1.I3=v1;
102 >v4 : () => K1.I3
103 >K1 : any
[all …]
|
| D | qualify.symbols | 76 export module K1 {
77 >K1 : Symbol(K1, Decl(qualify.ts, 33, 16))
99 var v2:K1.I3=v1;
101 >K1 : Symbol(K1, Decl(qualify.ts, 33, 16))
102 >I3 : Symbol(K1.I3, Decl(qualify.ts, 34, 22))
105 var v3:K1.I3[]=v1;
107 >K1 : Symbol(K1, Decl(qualify.ts, 33, 16))
108 >I3 : Symbol(K1.I3, Decl(qualify.ts, 34, 22))
111 var v4:()=>K1.I3=v1;
113 >K1 : Symbol(K1, Decl(qualify.ts, 33, 16))
[all …]
|
| D | genericObjectRest.types | 75 function f3<T, K1 extends keyof T, K2 extends keyof T>(obj: T, k1: K1, k2: K2) {
76 >f3 : <T, K1 extends keyof T, K2 extends keyof T>(obj: T, k1: K1, k2: K2) => void
78 >k1 : K1
82 >k1 : K1
83 >a1 : T[K1]
86 >r1 : Omit<T, K1 | K2>
96 function f4<K1 extends keyof Item, K2 extends keyof Item>(obj: Item, k1: K1, k2: K2) {
97 >f4 : <K1 extends keyof Item, K2 extends keyof Item>(obj: Item, k1: K1, k2: K2) => void
99 >k1 : K1
103 >k1 : K1
[all …]
|
| D | typeUsedAsTypeLiteralIndex.symbols | 12 const K1 = Symbol();
13 >K1 : Symbol(K1, Decl(typeUsedAsTypeLiteralIndex.ts, 5, 5))
19 [K1]: number;
20 >[K1] : Symbol([K1], Decl(typeUsedAsTypeLiteralIndex.ts, 6, 11))
21 >K1 : Symbol(K1, Decl(typeUsedAsTypeLiteralIndex.ts, 5, 5))
|
| D | keyofAndIndexedAccess.types | 1403 function path<T, K1 extends keyof T>(obj: T, key1: K1): T[K1];
1404 …K1 extends keyof T>(obj: T, key1: K1): T[K1]; <T, K1 extends keyof T, K2 extends keyof T[K1]>(obj:…
1406 >key1 : K1
1408 function path<T, K1 extends keyof T, K2 extends keyof T[K1]>(obj: T, key1: K1, key2: K2): T[K1][K2];
1409 …K1 extends keyof T>(obj: T, key1: K1): T[K1]; <T, K1 extends keyof T, K2 extends keyof T[K1]>(obj:…
1411 >key1 : K1
1414 function path<T, K1 extends keyof T, K2 extends keyof T[K1], K3 extends keyof T[K1][K2]>(obj: T, ke…
1415 …K1 extends keyof T>(obj: T, key1: K1): T[K1]; <T, K1 extends keyof T, K2 extends keyof T[K1]>(obj:…
1417 >key1 : K1
1422 …K1 extends keyof T>(obj: T, key1: K1): T[K1]; <T, K1 extends keyof T, K2 extends keyof T[K1]>(obj:…
[all …]
|
| D | qualify.js | 36 export module K1 {
46 var v2:K1.I3=v1;
47 var v3:K1.I3[]=v1;
48 var v4:()=>K1.I3=v1;
49 var v5:(k:K1.I3)=>void=v1;
50 var v6:{k:K1.I3;}=v1;
|
| D | typeUsedAsTypeLiteralIndex.types | 13 const K1 = Symbol();
14 >K1 : unique symbol
21 [K1]: number;
22 >[K1] : number
23 >K1 : unique symbol
|
| /third_party/typescript/tests/cases/compiler/ |
| D | deepKeysIndexing.ts | 10 K1 extends keyof O
11 > = O[K1] extends object ? Extract<keyof O[K1], string> : never;
15 K1 extends keyof O
16 > = O[K1] extends object ? keyof O[K1] : never;
18 type keys2workaround<O extends DeepObject, K1 extends keyof O> = Extract<
19 O[K1] extends object ? keyof O[K1] : never,
33 K1 extends keyof O,
34 K2 extends keys2broken<O, K1>,
35 V extends O[K1][K2]
36 >(k1: K1, k2: K2, value: V) {}
[all …]
|
| D | twiceNestedKeyofIndexInference.ts | 1 type Set1<T, K1 extends keyof T> = T extends any[] ? T : Pick<T, Exclude<keyof T, K1>> & {
2 [SK1 in K1]-?: Required<Pick<T, SK1>>;
3 }[K1];
5 type Set2<T, K1 extends keyof T, K2 extends keyof T[K1]> = T extends any[] ? T : Pick<T, Exclude<ke…
6 [SK1 in K1]-?: Required<{
7 [key in K1]: Set1<T[K1], K2>;
9 }[K1];
11 declare function set<T, K1 extends keyof T>(source: T, path: [K1], value: T[K1]): Set1<T, K1>;
13 declare function set<T, K1 extends keyof T, K2 extends keyof T[K1]>(source: T, path: [K1, K2], valu…
|
| D | qualify.ts | 35 export module K1 {
45 var v2:K1.I3=v1;
46 var v3:K1.I3[]=v1;
47 var v4:()=>K1.I3=v1;
48 var v5:(k:K1.I3)=>void=v1;
49 var v6:{k:K1.I3;}=v1;
|
| /third_party/ltp/testcases/kernel/syscalls/pread/ |
| D | pread01.c | 82 #define K1 1024 macro
83 #define K2 (K1 * 2)
84 #define K3 (K1 * 3)
85 #define K4 (K1 * 4)
118 nread = pread(fildes, read_buf[2], K1, K2); in main()
121 if (nread != K1) { in main()
136 nread = pread(fildes, read_buf[3], K1, K3); in main()
137 if (nread != K1) { in main()
150 if ((nread = read(fildes, read_buf[0], K1)) != K1) { in main()
156 l_seek(fildes, 0, SEEK_CUR, K1); in main()
[all …]
|
| D | pread02.c | 78 #define K1 1024 macro
105 1, K1, 0, "file descriptor is a PIPE or FIFO", ESPIPE, setup1}, {
106 2, K1, -1, "specified offset is -ve or invalid", EINVAL, setup2}, {
218 if (write(pfd[1], write_buf[0], K1) != K1) { in setup1()
261 write_buf[count] = malloc(K1); in init_buffers()
262 read_buf[count] = malloc(K1); in init_buffers()
268 memset(write_buf[count], count, K1); in init_buffers()
|
| /third_party/ltp/testcases/kernel/syscalls/pwrite/ |
| D | pwrite01.c | 85 #define K1 1024 macro
86 #define K2 (K1 * 2)
87 #define K3 (K1 * 3)
88 #define K4 (K1 * 4)
119 nwrite = pwrite(fildes, write_buf[0], K1, 0); in main()
122 if (nwrite != K1) { in main()
135 l_seek(fildes, K1 / 2, SEEK_SET, K1 / 2); in main()
141 nwrite = pwrite(fildes, write_buf[2], K1, K2); in main()
142 if (nwrite != K1) { in main()
150 l_seek(fildes, 0, SEEK_CUR, K1 / 2); in main()
[all …]
|
| D | pwrite04.c | 52 #define K1 1024 macro
53 #define K2 (K1 * 2)
54 #define K3 (K1 * 3)
55 #define K4 (K1 * 4)
56 #define K5 (K1 * 5)
93 if ((nbytes = pwrite(fd, wbuf[0], K1, 0)) != K1) { in main()
108 l_seek(fd, K1 / 2, SEEK_SET, K1 / 2); in main()
113 if ((nbytes = pwrite(fd, wbuf[2], K1, K2)) != K1) { in main()
123 l_seek(fd, 0, SEEK_CUR, K1 / 2); in main()
134 if ((nbytes = write(fd, wbuf[3], K1)) != K1) { in main()
[all …]
|
| /third_party/boost/boost/fusion/container/generation/detail/preprocessed/ |
| D | map_tie10.hpp | 15 …typename K0 = void_ , typename K1 = void_ , typename K2 = void_ , typename K3 = void_ , typename K…
57 typename K0 , typename K1
60 …struct map_tie<K0 , K1, D0 , D1 , void_ , void_ , void_ , void_ , void_ , void_ , void_ , void_ , …
62 …typedef map<fusion::pair< K0 , typename add_reference<D0>::type> , fusion::pair< K1 , typename add…
66 typename K0 , typename K1
70 …inline map<fusion::pair< K0 , typename add_reference<D0>::type> , fusion::pair< K1 , typename add_…
73 …return map<fusion::pair< K0 , typename add_reference<D0>::type> , fusion::pair< K1 , typename add_… in map_tie()
74 fusion::pair_tie<K0>(arg0) , fusion::pair_tie<K1>(arg1)); in map_tie()
79 typename K0 , typename K1 , typename K2
82 …struct map_tie<K0 , K1 , K2, D0 , D1 , D2 , void_ , void_ , void_ , void_ , void_ , void_ , void_ …
[all …]
|
| D | make_map10.hpp | 15 …typename K0 = void_ , typename K1 = void_ , typename K2 = void_ , typename K3 = void_ , typename K…
57 typename K0 , typename K1
60 …struct make_map<K0 , K1, D0 , D1 , void_ , void_ , void_ , void_ , void_ , void_ , void_ , void_ ,…
62 …::pair< K0 , typename detail::as_fusion_element<D0>::type> , fusion::pair< K1 , typename detail::a…
66 typename K0 , typename K1
70 …inline map<fusion::pair< K0 , typename detail::as_fusion_element<D0>::type> , fusion::pair< K1 , t…
73 …::pair< K0 , typename detail::as_fusion_element<D0>::type> , fusion::pair< K1 , typename detail::a… in make_map()
74 fusion::make_pair<K0>(arg0) , fusion::make_pair<K1>(arg1)); in make_map()
79 typename K0 , typename K1 , typename K2
82 …struct make_map<K0 , K1 , K2, D0 , D1 , D2 , void_ , void_ , void_ , void_ , void_ , void_ , void_…
[all …]
|
| D | map_tie20.hpp | 15 …typename K0 = void_ , typename K1 = void_ , typename K2 = void_ , typename K3 = void_ , typename K…
57 typename K0 , typename K1
60 …struct map_tie<K0 , K1, D0 , D1 , void_ , void_ , void_ , void_ , void_ , void_ , void_ , void_ , …
62 …typedef map<fusion::pair< K0 , typename add_reference<D0>::type> , fusion::pair< K1 , typename add…
66 typename K0 , typename K1
70 …inline map<fusion::pair< K0 , typename add_reference<D0>::type> , fusion::pair< K1 , typename add_…
73 …return map<fusion::pair< K0 , typename add_reference<D0>::type> , fusion::pair< K1 , typename add_… in map_tie()
74 fusion::pair_tie<K0>(arg0) , fusion::pair_tie<K1>(arg1)); in map_tie()
79 typename K0 , typename K1 , typename K2
82 …struct map_tie<K0 , K1 , K2, D0 , D1 , D2 , void_ , void_ , void_ , void_ , void_ , void_ , void_ …
[all …]
|
| D | make_map20.hpp | 15 …typename K0 = void_ , typename K1 = void_ , typename K2 = void_ , typename K3 = void_ , typename K…
57 typename K0 , typename K1
60 …struct make_map<K0 , K1, D0 , D1 , void_ , void_ , void_ , void_ , void_ , void_ , void_ , void_ ,…
62 …::pair< K0 , typename detail::as_fusion_element<D0>::type> , fusion::pair< K1 , typename detail::a…
66 typename K0 , typename K1
70 …inline map<fusion::pair< K0 , typename detail::as_fusion_element<D0>::type> , fusion::pair< K1 , t…
73 …::pair< K0 , typename detail::as_fusion_element<D0>::type> , fusion::pair< K1 , typename detail::a… in make_map()
74 fusion::make_pair<K0>(arg0) , fusion::make_pair<K1>(arg1)); in make_map()
79 typename K0 , typename K1 , typename K2
82 …struct make_map<K0 , K1 , K2, D0 , D1 , D2 , void_ , void_ , void_ , void_ , void_ , void_ , void_…
[all …]
|