@@ -7,6 +7,11 @@ using Dates
7
7
8
8
using InteractiveUtils: subtypes
9
9
10
+ # Compare ranges by comparing their `first` and `last` elements and their `length`. This
11
+ # returns `false` if empty ranges have different startpoints.
12
+ == ᵣ (r:: AbstractRange , s:: AbstractRange ) =
13
+ (first (r) == first (s)) & (length (r) == length (s)) & (last (r) == last (s))
14
+
10
15
let
11
16
for T in (Dates. Date, Dates. DateTime)
12
17
f1 = T (2014 ); l1 = T (2013 , 12 , 31 )
35
40
@test first (reverse (dr)) < f1
36
41
@test last (reverse (dr)) >= f1
37
42
@test issorted (dr)
38
- @test sortperm (dr) === Int64 ( 1 ) : Int64 ( 1 ) : Int64 ( 0 )
43
+ @test sortperm (dr) == ᵣ 1 : 1 : 0
39
44
@test ! (f1 in dr)
40
45
@test ! (l1 in dr)
41
46
@test ! (f1 - pos_step in dr)
93
98
@test first (reverse (dr)) > l1
94
99
@test last (reverse (dr)) <= l1
95
100
@test issorted (dr)
96
- @test sortperm (dr) === Int64 ( 1 ) : Int64 ( 1 ) : Int64 ( 0 )
101
+ @test sortperm (dr) == ᵣ 1 : 1 : 0
97
102
@test ! (l1 in dr)
98
103
@test ! (l1 in dr)
99
104
@test ! (l1 - neg_step in dr)
153
158
@test first (reverse (dr)) < f1
154
159
@test last (reverse (dr)) >= f1
155
160
@test issorted (dr)
156
- @test sortperm (dr) === Int64 ( 1 ) : Int64 ( 1 ) : Int64 ( 0 )
161
+ @test sortperm (dr) == ᵣ 1 : 1 : 0
157
162
@test ! (f1 in dr)
158
163
@test ! (l1 in dr)
159
164
@test ! (f1 - pos_step in dr)
211
216
@test first (reverse (dr)) > l1
212
217
@test last (reverse (dr)) <= l1
213
218
@test issorted (dr)
214
- @test sortperm (dr) === Int64 ( 1 ) : Int64 ( 1 ) : Int64 ( 0 )
219
+ @test sortperm (dr) == ᵣ 1 : 1 : 0
215
220
@test ! (l1 in dr)
216
221
@test ! (l1 in dr)
217
222
@test ! (l1 - neg_step in dr)
0 commit comments