-
-
Notifications
You must be signed in to change notification settings - Fork 709
/
Copy pathmeta.d
1730 lines (1512 loc) · 43.2 KB
/
meta.d
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Written in the D programming language.
/**
* Templates to manipulate template argument lists (also known as type lists).
*
* Some operations on alias sequences are built in to the language,
* such as TL[$(I n)] which gets the $(I n)th type from the
* alias sequence. TL[$(I lwr) .. $(I upr)] returns a new type
* list that is a slice of the old one.
*
* Several templates in this module use or operate on eponymous templates that
* take a single argument and evaluate to a boolean constant. Such templates
* are referred to as $(I template predicates).
*
* $(SCRIPT inhibitQuickIndex = 1;)
* $(DIVC quickindex,
* $(BOOKTABLE ,
* $(TR $(TH Category) $(TH Templates))
* $(TR $(TD Building blocks) $(TD
* $(LREF Alias)
* $(LREF AliasSeq)
* $(LREF aliasSeqOf)
* ))
* $(TR $(TD Alias sequence filtering) $(TD
* $(LREF Erase)
* $(LREF EraseAll)
* $(LREF Filter)
* $(LREF NoDuplicates)
* $(LREF Stride)
* ))
* $(TR $(TD Alias sequence type hierarchy) $(TD
* $(LREF DerivedToFront)
* $(LREF MostDerived)
* ))
* $(TR $(TD Alias sequence transformation) $(TD
* $(LREF Repeat)
* $(LREF Replace)
* $(LREF ReplaceAll)
* $(LREF Reverse)
* $(LREF staticMap)
* $(LREF staticSort)
* ))
* $(TR $(TD Alias sequence searching) $(TD
* $(LREF allSatisfy)
* $(LREF anySatisfy)
* $(LREF staticIndexOf)
* ))
* $(TR $(TD Template predicates) $(TD
* $(LREF templateAnd)
* $(LREF templateNot)
* $(LREF templateOr)
* $(LREF staticIsSorted)
* ))
* $(TR $(TD Template instantiation) $(TD
* $(LREF ApplyLeft)
* $(LREF ApplyRight)
* $(LREF Instantiate)
* ))
* ))
*
* References:
* Based on ideas in Table 3.1 from
* $(LINK2 http://amazon.com/exec/obidos/ASIN/0201704315/ref=ase_classicempire/102-2957199-2585768,
* Modern C++ Design),
* Andrei Alexandrescu (Addison-Wesley Professional, 2001)
* Copyright: Copyright Digital Mars 2005 - 2015.
* License: $(HTTP www.boost.org/LICENSE_1_0.txt, Boost License 1.0).
* Authors:
* $(HTTP digitalmars.com, Walter Bright),
* $(HTTP klickverbot.at, David Nadlinger)
* Source: $(PHOBOSSRC std/_meta.d)
*/
module std.meta;
/**
* Creates a sequence of zero or more aliases. This is most commonly
* used as template parameters or arguments.
*
* In previous versions of Phobos, this was known as `TypeTuple`.
*/
template AliasSeq(TList...)
{
alias AliasSeq = TList;
}
///
@safe unittest
{
import std.meta;
alias TL = AliasSeq!(int, double);
int foo(TL td) // same as int foo(int, double);
{
return td[0] + cast(int) td[1];
}
}
///
@safe unittest
{
alias TL = AliasSeq!(int, double);
alias Types = AliasSeq!(TL, char);
static assert(is(Types == AliasSeq!(int, double, char)));
}
/**
Returns an `AliasSeq` expression of `Func` being
applied to every variadic template argument.
*/
///
@safe unittest
{
auto ref ArgCall(alias Func, alias arg)()
{
return Func(arg);
}
template Map(alias Func, args...)
{
static if (args.length > 1)
{
alias Map = AliasSeq!(ArgCall!(Func, args[0]), Map!(Func, args[1 .. $]));
}
else
{
alias Map = ArgCall!(Func, args[0]);
}
}
static int square(int arg)
{
return arg * arg;
}
static int refSquare(ref int arg)
{
arg *= arg;
return arg;
}
static ref int refRetSquare(ref int arg)
{
arg *= arg;
return arg;
}
static void test(int a, int b)
{
assert(a == 4);
assert(b == 16);
}
static void testRef(ref int a, ref int b)
{
assert(a++ == 16);
assert(b++ == 256);
}
static int a = 2;
static int b = 4;
test(Map!(square, a, b));
test(Map!(refSquare, a, b));
assert(a == 4);
assert(b == 16);
testRef(Map!(refRetSquare, a, b));
assert(a == 17);
assert(b == 257);
}
/**
* Allows `alias`ing of any single symbol, type or compile-time expression.
*
* Not everything can be directly aliased. An alias cannot be declared
* of - for example - a literal:
*
* `alias a = 4; //Error`
*
* With this template any single entity can be aliased:
*
* `alias b = Alias!4; //OK`
*
* See_Also:
* To alias more than one thing at once, use $(LREF AliasSeq)
*/
alias Alias(alias a) = a;
/// Ditto
alias Alias(T) = T;
///
@safe unittest
{
// Without Alias this would fail if Args[0] was e.g. a value and
// some logic would be needed to detect when to use enum instead
alias Head(Args ...) = Alias!(Args[0]);
alias Tail(Args ...) = Args[1 .. $];
alias Blah = AliasSeq!(3, int, "hello");
static assert(Head!Blah == 3);
static assert(is(Head!(Tail!Blah) == int));
static assert((Tail!Blah)[1] == "hello");
}
///
@safe unittest
{
alias a = Alias!(123);
static assert(a == 123);
enum abc = 1;
alias b = Alias!(abc);
static assert(b == 1);
alias c = Alias!(3 + 4);
static assert(c == 7);
alias concat = (s0, s1) => s0 ~ s1;
alias d = Alias!(concat("Hello", " World!"));
static assert(d == "Hello World!");
alias e = Alias!(int);
static assert(is(e == int));
alias f = Alias!(AliasSeq!(int));
static assert(!is(typeof(f[0]))); //not an AliasSeq
static assert(is(f == int));
auto g = 6;
alias h = Alias!g;
++h;
assert(g == 7);
}
package template OldAlias(alias a)
{
static if (__traits(compiles, { alias x = a; }))
alias OldAlias = a;
else static if (__traits(compiles, { enum x = a; }))
enum OldAlias = a;
else
static assert(0, "Cannot alias " ~ a.stringof);
}
import std.traits : isAggregateType, Unqual;
package template OldAlias(T)
if (!isAggregateType!T || is(Unqual!T == T))
{
alias OldAlias = T;
}
@safe unittest
{
static struct Foo {}
static assert(is(OldAlias!(const(Foo)) == Foo));
static assert(is(OldAlias!(const(int)) == const(int)));
static assert(OldAlias!123 == 123);
enum abc = 123;
static assert(OldAlias!abc == 123);
}
/**
* Returns the index of the first occurrence of type T in the
* sequence of zero or more types TList.
* If not found, -1 is returned.
*/
template staticIndexOf(T, TList...)
{
enum staticIndexOf = genericIndexOf!(T, TList).index;
}
/// Ditto
template staticIndexOf(alias T, TList...)
{
enum staticIndexOf = genericIndexOf!(T, TList).index;
}
///
@safe unittest
{
import std.stdio;
void foo()
{
writefln("The index of long is %s",
staticIndexOf!(long, AliasSeq!(int, long, double)));
// prints: The index of long is 1
}
}
// [internal]
private template genericIndexOf(args...)
if (args.length >= 1)
{
alias e = OldAlias!(args[0]);
alias tuple = args[1 .. $];
static if (tuple.length)
{
alias head = OldAlias!(tuple[0]);
alias tail = tuple[1 .. $];
static if (isSame!(e, head))
{
enum index = 0;
}
else
{
enum next = genericIndexOf!(e, tail).index;
enum index = (next == -1) ? -1 : 1 + next;
}
}
else
{
enum index = -1;
}
}
@safe unittest
{
static assert(staticIndexOf!( byte, byte, short, int, long) == 0);
static assert(staticIndexOf!(short, byte, short, int, long) == 1);
static assert(staticIndexOf!( int, byte, short, int, long) == 2);
static assert(staticIndexOf!( long, byte, short, int, long) == 3);
static assert(staticIndexOf!( char, byte, short, int, long) == -1);
static assert(staticIndexOf!( -1, byte, short, int, long) == -1);
static assert(staticIndexOf!(void) == -1);
static assert(staticIndexOf!("abc", "abc", "def", "ghi", "jkl") == 0);
static assert(staticIndexOf!("def", "abc", "def", "ghi", "jkl") == 1);
static assert(staticIndexOf!("ghi", "abc", "def", "ghi", "jkl") == 2);
static assert(staticIndexOf!("jkl", "abc", "def", "ghi", "jkl") == 3);
static assert(staticIndexOf!("mno", "abc", "def", "ghi", "jkl") == -1);
static assert(staticIndexOf!( void, "abc", "def", "ghi", "jkl") == -1);
static assert(staticIndexOf!(42) == -1);
static assert(staticIndexOf!(void, 0, "void", void) == 2);
static assert(staticIndexOf!("void", 0, void, "void") == 2);
}
/**
* Returns an `AliasSeq` created from TList with the first occurrence,
* if any, of T removed.
*/
template Erase(T, TList...)
{
alias Erase = GenericErase!(T, TList).result;
}
/// Ditto
template Erase(alias T, TList...)
{
alias Erase = GenericErase!(T, TList).result;
}
///
@safe unittest
{
alias Types = AliasSeq!(int, long, double, char);
alias TL = Erase!(long, Types);
static assert(is(TL == AliasSeq!(int, double, char)));
}
// [internal]
private template GenericErase(args...)
if (args.length >= 1)
{
alias e = OldAlias!(args[0]);
alias tuple = args[1 .. $] ;
static if (tuple.length)
{
alias head = OldAlias!(tuple[0]);
alias tail = tuple[1 .. $];
static if (isSame!(e, head))
alias result = tail;
else
alias result = AliasSeq!(head, GenericErase!(e, tail).result);
}
else
{
alias result = AliasSeq!();
}
}
@safe unittest
{
static assert(Pack!(Erase!(int,
short, int, int, 4)).
equals!(short, int, 4));
static assert(Pack!(Erase!(1,
real, 3, 1, 4, 1, 5, 9)).
equals!(real, 3, 4, 1, 5, 9));
}
/**
* Returns an `AliasSeq` created from TList with the all occurrences,
* if any, of T removed.
*/
template EraseAll(T, TList...)
{
alias EraseAll = GenericEraseAll!(T, TList).result;
}
/// Ditto
template EraseAll(alias T, TList...)
{
alias EraseAll = GenericEraseAll!(T, TList).result;
}
///
@safe unittest
{
alias Types = AliasSeq!(int, long, long, int);
alias TL = EraseAll!(long, Types);
static assert(is(TL == AliasSeq!(int, int)));
}
// [internal]
private template GenericEraseAll(args...)
if (args.length >= 1)
{
alias e = OldAlias!(args[0]);
alias tuple = args[1 .. $];
static if (tuple.length)
{
alias head = OldAlias!(tuple[0]);
alias tail = tuple[1 .. $];
alias next = AliasSeq!(
GenericEraseAll!(e, tail[0..$/2]).result,
GenericEraseAll!(e, tail[$/2..$]).result
);
static if (isSame!(e, head))
alias result = next;
else
alias result = AliasSeq!(head, next);
}
else
{
alias result = AliasSeq!();
}
}
@safe unittest
{
static assert(Pack!(EraseAll!(int,
short, int, int, 4)).
equals!(short, 4));
static assert(Pack!(EraseAll!(1,
real, 3, 1, 4, 1, 5, 9)).
equals!(real, 3, 4, 5, 9));
}
/*
* Erase any occurrence of the first `TList[0 .. N]` elements from `TList[N .. $]`.
*
* Params:
* N = number of elements to delete from the `TList`
* TList = sequence of aliases
*
* See_Also: $(LREF EraseAll)
*/
private template EraseAllN(uint N, TList...)
{
static if (N == 1)
{
alias EraseAllN = EraseAll!(TList[0], TList[1 .. $]);
}
else
{
static if (N & 1)
alias EraseAllN = EraseAllN!(N / 2, TList[N / 2 + 1 .. N],
EraseAllN!(N / 2 + 1, TList[0 .. N / 2 + 1], TList[N .. $]));
else
alias EraseAllN = EraseAllN!(N / 2, TList[N / 2 .. N],
EraseAllN!(N / 2, TList[0 .. N / 2], TList[N .. $]));
}
}
/**
* Returns an `AliasSeq` created from TList with the all duplicate
* types removed.
*/
template NoDuplicates(TList...)
{
static if (TList.length >= 2)
{
alias fst = NoDuplicates!(TList[0 .. $/2]);
alias snd = NoDuplicates!(TList[$/2 .. $]);
alias NoDuplicates = AliasSeq!(fst, EraseAllN!(fst.length, fst, snd));
}
else
{
alias NoDuplicates = TList;
}
}
///
@safe unittest
{
alias Types = AliasSeq!(int, long, long, int, float);
alias TL = NoDuplicates!(Types);
static assert(is(TL == AliasSeq!(int, long, float)));
}
@safe unittest
{
import std.range : iota;
// Bugzilla 14561: huge enums
alias LongList = Repeat!(1500, int);
static assert(NoDuplicates!LongList.length == 1);
// Bugzilla 17995: huge enums, revisited
alias a = NoDuplicates!(AliasSeq!(1, Repeat!(1000, 3)));
alias b = NoDuplicates!(AliasSeq!(1, Repeat!(10, 3)));
static assert(a.length == b.length);
static assert(NoDuplicates!(aliasSeqOf!(iota(7)), aliasSeqOf!(iota(7))) == aliasSeqOf!(iota(7)));
static assert(NoDuplicates!(aliasSeqOf!(iota(8)), aliasSeqOf!(iota(8))) == aliasSeqOf!(iota(8)));
}
@safe unittest
{
static assert(
Pack!(
NoDuplicates!(1, int, 1, NoDuplicates, int, NoDuplicates, real))
.equals!(1, int, NoDuplicates, real));
}
/**
* Returns an `AliasSeq` created from TList with the first occurrence
* of type T, if found, replaced with type U.
*/
template Replace(T, U, TList...)
{
alias Replace = GenericReplace!(T, U, TList).result;
}
/// Ditto
template Replace(alias T, U, TList...)
{
alias Replace = GenericReplace!(T, U, TList).result;
}
/// Ditto
template Replace(T, alias U, TList...)
{
alias Replace = GenericReplace!(T, U, TList).result;
}
/// Ditto
template Replace(alias T, alias U, TList...)
{
alias Replace = GenericReplace!(T, U, TList).result;
}
///
@safe unittest
{
alias Types = AliasSeq!(int, long, long, int, float);
alias TL = Replace!(long, char, Types);
static assert(is(TL == AliasSeq!(int, char, long, int, float)));
}
// [internal]
private template GenericReplace(args...)
if (args.length >= 2)
{
alias from = OldAlias!(args[0]);
alias to = OldAlias!(args[1]);
alias tuple = args[2 .. $];
static if (tuple.length)
{
alias head = OldAlias!(tuple[0]);
alias tail = tuple[1 .. $];
static if (isSame!(from, head))
alias result = AliasSeq!(to, tail);
else
alias result = AliasSeq!(head,
GenericReplace!(from, to, tail).result);
}
else
{
alias result = AliasSeq!();
}
}
@safe unittest
{
static assert(Pack!(Replace!(byte, ubyte,
short, byte, byte, byte)).
equals!(short, ubyte, byte, byte));
static assert(Pack!(Replace!(1111, byte,
2222, 1111, 1111, 1111)).
equals!(2222, byte, 1111, 1111));
static assert(Pack!(Replace!(byte, 1111,
short, byte, byte, byte)).
equals!(short, 1111, byte, byte));
static assert(Pack!(Replace!(1111, "11",
2222, 1111, 1111, 1111)).
equals!(2222, "11", 1111, 1111));
}
/**
* Returns an `AliasSeq` created from TList with all occurrences
* of type T, if found, replaced with type U.
*/
template ReplaceAll(T, U, TList...)
{
alias ReplaceAll = GenericReplaceAll!(T, U, TList).result;
}
/// Ditto
template ReplaceAll(alias T, U, TList...)
{
alias ReplaceAll = GenericReplaceAll!(T, U, TList).result;
}
/// Ditto
template ReplaceAll(T, alias U, TList...)
{
alias ReplaceAll = GenericReplaceAll!(T, U, TList).result;
}
/// Ditto
template ReplaceAll(alias T, alias U, TList...)
{
alias ReplaceAll = GenericReplaceAll!(T, U, TList).result;
}
///
@safe unittest
{
alias Types = AliasSeq!(int, long, long, int, float);
alias TL = ReplaceAll!(long, char, Types);
static assert(is(TL == AliasSeq!(int, char, char, int, float)));
}
// [internal]
private template GenericReplaceAll(args...)
if (args.length >= 2)
{
alias from = OldAlias!(args[0]);
alias to = OldAlias!(args[1]);
alias tuple = args[2 .. $];
static if (tuple.length)
{
alias head = OldAlias!(tuple[0]);
alias tail = tuple[1 .. $];
alias next = GenericReplaceAll!(from, to, tail).result;
static if (isSame!(from, head))
alias result = AliasSeq!(to, next);
else
alias result = AliasSeq!(head, next);
}
else
{
alias result = AliasSeq!();
}
}
@safe unittest
{
static assert(Pack!(ReplaceAll!(byte, ubyte,
byte, short, byte, byte)).
equals!(ubyte, short, ubyte, ubyte));
static assert(Pack!(ReplaceAll!(1111, byte,
1111, 2222, 1111, 1111)).
equals!(byte, 2222, byte, byte));
static assert(Pack!(ReplaceAll!(byte, 1111,
byte, short, byte, byte)).
equals!(1111, short, 1111, 1111));
static assert(Pack!(ReplaceAll!(1111, "11",
1111, 2222, 1111, 1111)).
equals!("11", 2222, "11", "11"));
}
/**
* Returns an `AliasSeq` created from TList with the order reversed.
*/
template Reverse(TList...)
{
static if (TList.length <= 1)
{
alias Reverse = TList;
}
else
{
alias Reverse =
AliasSeq!(
Reverse!(TList[$/2 .. $ ]),
Reverse!(TList[ 0 .. $/2]));
}
}
///
@safe unittest
{
alias Types = AliasSeq!(int, long, long, int, float);
alias TL = Reverse!(Types);
static assert(is(TL == AliasSeq!(float, int, long, long, int)));
}
/**
* Returns the type from TList that is the most derived from type T.
* If none are found, T is returned.
*/
template MostDerived(T, TList...)
{
static if (TList.length == 0)
alias MostDerived = T;
else static if (is(TList[0] : T))
alias MostDerived = MostDerived!(TList[0], TList[1 .. $]);
else
alias MostDerived = MostDerived!(T, TList[1 .. $]);
}
///
@safe unittest
{
class A { }
class B : A { }
class C : B { }
alias Types = AliasSeq!(A, C, B);
MostDerived!(Object, Types) x; // x is declared as type C
static assert(is(typeof(x) == C));
}
/**
* Returns the `AliasSeq` TList with the types sorted so that the most
* derived types come first.
*/
template DerivedToFront(TList...)
{
static if (TList.length == 0)
alias DerivedToFront = TList;
else
alias DerivedToFront =
AliasSeq!(MostDerived!(TList[0], TList[1 .. $]),
DerivedToFront!(ReplaceAll!(MostDerived!(TList[0], TList[1 .. $]),
TList[0],
TList[1 .. $])));
}
///
@safe unittest
{
class A { }
class B : A { }
class C : B { }
alias Types = AliasSeq!(A, C, B);
alias TL = DerivedToFront!(Types);
static assert(is(TL == AliasSeq!(C, B, A)));
}
/**
Evaluates to $(D AliasSeq!(F!(T[0]), F!(T[1]), ..., F!(T[$ - 1]))).
*/
template staticMap(alias F, T...)
{
static if (T.length == 0)
{
alias staticMap = AliasSeq!();
}
else static if (T.length == 1)
{
alias staticMap = AliasSeq!(F!(T[0]));
}
else
{
alias staticMap =
AliasSeq!(
staticMap!(F, T[ 0 .. $/2]),
staticMap!(F, T[$/2 .. $ ]));
}
}
///
@safe unittest
{
import std.traits : Unqual;
alias TL = staticMap!(Unqual, int, const int, immutable int);
static assert(is(TL == AliasSeq!(int, int, int)));
}
@safe unittest
{
import std.traits : Unqual;
// empty
alias Empty = staticMap!(Unqual);
static assert(Empty.length == 0);
// single
alias Single = staticMap!(Unqual, const int);
static assert(is(Single == AliasSeq!int));
alias T = staticMap!(Unqual, int, const int, immutable int);
static assert(is(T == AliasSeq!(int, int, int)));
}
/**
Tests whether all given items satisfy a template predicate, i.e. evaluates to
$(D F!(T[0]) && F!(T[1]) && ... && F!(T[$ - 1])).
Evaluation is $(I not) short-circuited if a false result is encountered; the
template predicate must be instantiable with all the given items.
*/
template allSatisfy(alias F, T...)
{
static if (T.length == 0)
{
enum allSatisfy = true;
}
else static if (T.length == 1)
{
enum allSatisfy = F!(T[0]);
}
else
{
enum allSatisfy =
allSatisfy!(F, T[ 0 .. $/2]) &&
allSatisfy!(F, T[$/2 .. $ ]);
}
}
///
@safe unittest
{
import std.traits : isIntegral;
static assert(!allSatisfy!(isIntegral, int, double));
static assert( allSatisfy!(isIntegral, int, long));
}
/**
Tests whether any given items satisfy a template predicate, i.e. evaluates to
$(D F!(T[0]) || F!(T[1]) || ... || F!(T[$ - 1])).
Evaluation is short-circuited if a true result is encountered; the
template predicate must be instantiable with one of the given items.
*/
template anySatisfy(alias F, T...)
{
static if (T.length == 0)
{
enum anySatisfy = false;
}
else static if (T.length == 1)
{
enum anySatisfy = F!(T[0]);
}
else
{
enum anySatisfy =
anySatisfy!(F, T[ 0 .. $/2]) ||
anySatisfy!(F, T[$/2 .. $ ]);
}
}
///
@safe unittest
{
import std.traits : isIntegral;
static assert(!anySatisfy!(isIntegral, string, double));
static assert( anySatisfy!(isIntegral, int, double));
}
/**
* Filters an $(D AliasSeq) using a template predicate. Returns a
* $(D AliasSeq) of the elements which satisfy the predicate.
*/
template Filter(alias pred, TList...)
{
static if (TList.length == 0)
{
alias Filter = AliasSeq!();
}
else static if (TList.length == 1)
{
static if (pred!(TList[0]))
alias Filter = AliasSeq!(TList[0]);
else
alias Filter = AliasSeq!();
}
else
{
alias Filter =
AliasSeq!(
Filter!(pred, TList[ 0 .. $/2]),
Filter!(pred, TList[$/2 .. $ ]));
}
}
///
@safe unittest
{
import std.traits : isNarrowString, isUnsigned;
alias Types1 = AliasSeq!(string, wstring, dchar[], char[], dstring, int);
alias TL1 = Filter!(isNarrowString, Types1);
static assert(is(TL1 == AliasSeq!(string, wstring, char[])));
alias Types2 = AliasSeq!(int, byte, ubyte, dstring, dchar, uint, ulong);
alias TL2 = Filter!(isUnsigned, Types2);
static assert(is(TL2 == AliasSeq!(ubyte, uint, ulong)));
}
@safe unittest
{
import std.traits : isPointer;
static assert(is(Filter!(isPointer, int, void*, char[], int*) == AliasSeq!(void*, int*)));
static assert(is(Filter!isPointer == AliasSeq!()));
}
// Used in template predicate unit tests below.
private version (unittest)
{
template testAlways(T...)
{
enum testAlways = true;
}
template testNever(T...)
{
enum testNever = false;
}
template testError(T...)
{
static assert(false, "Should never be instantiated.");
}
}
/**
* Negates the passed template predicate.
*/
template templateNot(alias pred)
{
enum templateNot(T...) = !pred!T;
}
///
@safe unittest
{
import std.traits : isPointer;
alias isNoPointer = templateNot!isPointer;
static assert(!isNoPointer!(int*));
static assert(allSatisfy!(isNoPointer, string, char, float));
}
@safe unittest
{
static foreach (T; AliasSeq!(int, staticMap, 42))
{
static assert(!Instantiate!(templateNot!testAlways, T));
static assert(Instantiate!(templateNot!testNever, T));
}
}
/**