-
Notifications
You must be signed in to change notification settings - Fork 41
Expand file tree
/
Copy pathtest_sequence_set.rb
More file actions
1434 lines (1304 loc) · 52.6 KB
/
test_sequence_set.rb
File metadata and controls
1434 lines (1304 loc) · 52.6 KB
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
# frozen_string_literal: true
require "net/imap"
require "test/unit"
class IMAPSequenceSetTest < Net::IMAP::TestCase
# alias for convenience
SequenceSet = Net::IMAP::SequenceSet
DataFormatError = Net::IMAP::DataFormatError
if ProfilingHelper.profile?
def self.startup = ProfilingHelper.start_profiler("seqset-tests")
def self.shutdown = ProfilingHelper.stop_profiler
end
if ENV["PROFILE_ALLOCATIONS"] =~ /\A(1|y(es)?|t(rue)?)\z/i
module ProfileAllocations
def setup
@allocated = GC.stat(:total_allocated_objects)
super
end
def teardown
super
return unless @allocated
allocated = GC.stat(:total_allocated_objects)
$stderr.puts "Allocated: %6d in %p" % [allocated - @allocated, local_name]
end
end
include ProfileAllocations
end
def compare_to_reference_set(nums, set, seqset)
set.merge nums
seqset.merge nums
assert_equal set, seqset.to_set
assert seqset.elements.size <= set.size
sorted = set.to_a.sort
assert_equal sorted, seqset.numbers
Array.new(50) { rand(sorted.count) }.each do |idx|
assert_equal sorted.at(idx), seqset.at(idx)
assert_equal sorted.at(-idx), seqset.at(-idx)
end
assert seqset.cover? sorted.sample 100
end
test "fuzz test: add numbers and compare to reference Set" do
set = Set.new
seqset = SequenceSet.new
10.times do
nums = Array.new(1000) { rand(1..10_000) }
compare_to_reference_set(nums, set, seqset)
end
end
test "fuzz test: add ranges and compare to reference Set" do
set = Set.new
seqset = SequenceSet.new
(1..10_000).each_slice(250) do
compare_to_reference_set _1, set, seqset
assert_equal 1, seqset.elements.size
end
end
test "fuzz test: set union identities" do
10.times do
lhs = SequenceSet[Array.new(100) { rand(1..300) }]
rhs = SequenceSet[Array.new(100) { rand(1..300) }]
union = lhs | rhs
assert_equal union, rhs | lhs # commutative
assert_equal union, ~(~lhs & ~rhs) # De Morgan's Law
assert_equal union, lhs | (lhs ^ rhs)
assert_equal union, lhs | (rhs - lhs)
assert_equal union, (lhs & rhs) ^ (lhs ^ rhs)
mutable = lhs.dup
assert_equal union, mutable.merge(rhs)
assert_equal union, mutable
end
end
test "fuzz test: set intersection identities" do
10.times do
lhs = SequenceSet[Array.new(100) { rand(1..300) }]
rhs = SequenceSet[Array.new(100) { rand(1..300) }]
intersection = lhs & rhs
assert_equal intersection, rhs & lhs # commutative
assert_equal intersection, ~(~lhs | ~rhs) # De Morgan's Law
assert_equal intersection, lhs - ~rhs
assert_equal intersection, lhs - (lhs - rhs)
assert_equal intersection, lhs - (lhs ^ rhs)
assert_equal intersection, lhs ^ (lhs - rhs)
mutable = lhs.dup
assert_equal intersection, mutable.intersect!(rhs)
assert_equal intersection, mutable
end
end
test "fuzz test: set subtraction identities" do
10.times do
lhs = SequenceSet[Array.new(100) { rand(1..300) }]
rhs = SequenceSet[Array.new(100) { rand(1..300) }]
difference = lhs - rhs
assert_equal difference, ~rhs - ~lhs
assert_equal difference, ~(~lhs | rhs)
assert_equal difference, lhs & (lhs ^ rhs)
assert_equal difference, lhs ^ (lhs & rhs)
assert_equal difference, rhs ^ (lhs | rhs)
mutable = lhs.dup
assert_equal difference, mutable.subtract(rhs)
assert_equal difference, mutable
end
end
test "fuzz test: set xor identities" do
10.times do
lhs = SequenceSet[Array.new(100) { rand(1..300) }]
rhs = SequenceSet[Array.new(100) { rand(1..300) }]
mid = SequenceSet[Array.new(100) { rand(1..300) }]
xor = lhs ^ rhs
assert_equal xor, rhs ^ lhs # commutative
assert_equal xor, (lhs | rhs) - (lhs & rhs)
assert_equal xor, (lhs ^ mid) ^ (mid ^ rhs)
assert_equal xor, ~lhs ^ ~rhs
mutable = lhs.dup
assert_equal xor, mutable.xor!(rhs)
assert_equal xor, mutable
end
end
test "fuzz test: set complement identities" do
10.times do
set = SequenceSet[Array.new(100) { rand(1..300) }]
complement = ~set
assert_equal set, ~complement
assert_equal complement, ~set.dup
assert_equal complement, SequenceSet.full - set
mutable = set.dup
assert_equal complement, mutable.complement!
assert_equal complement, mutable
assert_equal set, mutable.complement!
assert_equal set, mutable
end
end
test "#== equality by value (not by identity or representation)" do
assert_equal SequenceSet.new, SequenceSet.new
assert_equal SequenceSet.new("1"), SequenceSet[1]
assert_equal SequenceSet.new("*"), SequenceSet[:*]
assert_equal SequenceSet["2:4"], SequenceSet["4:2"]
end
test "#freeze" do
set = SequenceSet.new "2:4,7:11,99,999"
assert !set.frozen?
set.freeze
assert set.frozen?
assert Ractor.shareable?(set) if defined?(Ractor)
assert_equal set, set.freeze
end
data "#clear", :clear
data "#replace seq", ->{ _1.replace SequenceSet[1] }
data "#replace num", ->{ _1.replace 1 }
data "#replace str", ->{ _1.replace ?1 }
data "#string=", ->{ _1.string = ?1 }
data "#add", ->{ _1.add 1 }
data "#add?", ->{ _1.add? 1 }
data "#<<", ->{ _1 << 1 }
data "#append", ->{ _1.append 1 }
data "#delete", ->{ _1.delete 3 }
data "#delete?", ->{ _1.delete? 3 }
data "#delete_at", ->{ _1.delete_at 3 }
data "#slice!", ->{ _1.slice! 1 }
data "#merge", ->{ _1.merge 1 }
data "#subtract", ->{ _1.subtract 1 }
data "#limit!", ->{ _1.limit! max: 10 }
data "#intersect!", ->{ _1.intersect! SequenceSet[1..100] }
data "#xor!", ->{ _1.xor! SequenceSet[9..98] }
data "#complement!", :complement!
data "#normalize!", :normalize!
test "frozen error message" do |modification|
set = SequenceSet["2:4,7:11,99,999"]
msg = "can't modify frozen Net::IMAP::SequenceSet: %p" % [set]
assert_raise_with_message FrozenError, msg do
modification.to_proc.(set)
end
end
data "#min(count)", {transform: ->{ _1.min(10) }, }
data "#max(count)", {transform: ->{ _1.max(10) }, }
data "#slice(length)", {transform: ->{ _1.slice(0, 10) }, }
data "#slice(range)", {transform: ->{ _1.slice(0...10) }, }
data "#slice => empty", {transform: ->{ _1.slice(0...0) }, }
data "#slice => empty", {transform: ->{ _1.slice(10..9) }, }
data "#union", {transform: ->{ _1 | (1..100) }, }
data "#intersection", {transform: ->{ _1 & (1..100) }, }
data "#difference", {transform: ->{ _1 - (1..100) }, }
data "#xor", {transform: ->{ _1 ^ (1..100) }, }
data "#complement", {transform: ->{ ~_1 }, }
data "#normalize", {transform: ->{ _1.normalize }, }
data "#above", {transform: ->{ _1.above(22) }, }
data "#below", {transform: ->{ _1.below(22) }, }
data "#limit", {transform: ->{ _1.limit(max: 22) }, freeze: :always }
data "#limit => empty", {transform: ->{ _1.limit(max: 1) }, freeze: :always }
test "transforms keep frozen status" do |data|
data => {transform:}
set = SequenceSet.new("2:4,7:11,99,999")
dup = set.dup
result = transform.to_proc.(set)
assert_equal dup, set, "transform should not modified"
if data in {freeze: :always}
assert result.frozen?, "this transform always returns frozen"
else
refute result.frozen?, "transform of non-frozen returned frozen"
end
set.freeze
result = transform.to_proc.(set)
assert result.frozen?, "transform of frozen returned non-frozen"
end
%i[clone dup].each do |method|
test "##{method}" do
orig = SequenceSet.new "2:4,7:11,99,999"
copy = orig.send method
assert_equal orig, copy
orig << 123
copy << 456
assert_not_equal orig, copy
assert orig.include?(123)
assert copy.include?(456)
assert !copy.include?(123)
assert !orig.include?(456)
end
end
if defined?(Ractor)
test "#freeze makes ractor sharable (deeply frozen)" do
assert Ractor.shareable? SequenceSet.new("1:9,99,999").freeze
end
test ".[] returns ractor sharable (deeply frozen)" do
assert Ractor.shareable? SequenceSet["2:8,88,888"]
end
test "#clone preserves ractor sharability (deeply frozen)" do
assert Ractor.shareable? SequenceSet["3:7,77,777"].clone
end
end
test ".new, input must be valid" do
assert_raise DataFormatError do SequenceSet.new [0] end
assert_raise DataFormatError do SequenceSet.new "0" end
assert_raise DataFormatError do SequenceSet.new [2**32] end
assert_raise DataFormatError do SequenceSet.new [2**33] end
assert_raise DataFormatError do SequenceSet.new (2**32).to_s end
assert_raise DataFormatError do SequenceSet.new (2**33).to_s end
assert_raise DataFormatError do SequenceSet.new "0:2" end
assert_raise DataFormatError do SequenceSet.new ":2" end
assert_raise DataFormatError do SequenceSet.new " 2" end
assert_raise DataFormatError do SequenceSet.new "2 " end
assert_raise DataFormatError do SequenceSet.new "2," end
assert_raise DataFormatError do SequenceSet.new Time.now end
assert_raise DataFormatError do SequenceSet.new Set[1, [2]] end
assert_raise DataFormatError do SequenceSet.new Set[1..20] end
end
test ".[frozen SequenceSet] returns that SequenceSet" do
frozen_seqset = SequenceSet[123..456]
assert_same frozen_seqset, SequenceSet[frozen_seqset]
coercible = Object.new
frozen_seqset = SequenceSet[192, 168, 1, 255]
coercible.define_singleton_method(:to_sequence_set) { frozen_seqset }
assert_same frozen_seqset, SequenceSet[coercible]
coercible = Object.new
mutable_seqset = SequenceSet.new([192, 168, 1, 255])
coercible.define_singleton_method(:to_sequence_set) { mutable_seqset }
assert_equal mutable_seqset, SequenceSet[coercible]
refute_same mutable_seqset, SequenceSet[coercible]
end
test ".new, input may be empty" do
assert_empty SequenceSet.new
assert_empty SequenceSet.new []
assert_empty SequenceSet.new [[]]
assert_empty SequenceSet.new nil
assert_empty SequenceSet.new ""
assert_empty SequenceSet.new Set.new
end
test ".[] must not be empty" do
assert_raise ArgumentError do SequenceSet[] end
assert_raise DataFormatError do SequenceSet[[]] end
assert_raise DataFormatError do SequenceSet[[[]]] end
assert_raise DataFormatError do SequenceSet[nil] end
assert_raise DataFormatError do SequenceSet[""] end
assert_raise DataFormatError do SequenceSet[Set.new] end
end
test ".try_convert" do
assert_nil SequenceSet.try_convert(nil)
assert_nil SequenceSet.try_convert(123)
assert_nil SequenceSet.try_convert(12..34)
assert_nil SequenceSet.try_convert("12:34")
assert_nil SequenceSet.try_convert(Object.new)
obj = Object.new
def obj.to_sequence_set; nil end
assert_nil SequenceSet.try_convert(obj)
obj = Object.new
def obj.to_sequence_set; SequenceSet[192, 168, 1, 255] end
assert_equal SequenceSet[192, 168, 1, 255], SequenceSet.try_convert(obj)
obj = Object.new
def obj.to_sequence_set; 192_168.001_255 end
assert_raise DataFormatError do SequenceSet.try_convert(obj) end
end
test "Net::IMAP::SequenceSet(set)" do
assert_equal SequenceSet.empty, Net::IMAP::SequenceSet()
assert_equal SequenceSet.empty, Net::IMAP::SequenceSet(nil)
assert_equal SequenceSet.empty, Net::IMAP::SequenceSet([])
assert_equal SequenceSet.empty, Net::IMAP::SequenceSet([[]])
assert_equal SequenceSet.empty, Net::IMAP::SequenceSet("")
assert_equal SequenceSet[123], Net::IMAP::SequenceSet(123)
assert_equal SequenceSet[12..34], Net::IMAP::SequenceSet(12..34)
assert_equal SequenceSet[12..34], Net::IMAP::SequenceSet("12:34")
refute Net::IMAP::SequenceSet("").frozen?
assert_raise DataFormatError do Net::IMAP::SequenceSet(Object.new) end
set = SequenceSet[123]
assert_same set, Net::IMAP::SequenceSet(set)
set = SequenceSet.new(123)
assert_same set, Net::IMAP::SequenceSet(set)
obj = Object.new
set = SequenceSet[192, 168, 1, 255]
obj.define_singleton_method(:to_sequence_set) { set }
assert_same set, Net::IMAP::SequenceSet(obj)
obj = Object.new
def obj.to_sequence_set; 192_168.001_255 end
assert_raise DataFormatError do Net::IMAP::SequenceSet(obj) end
end
test "#at(non-negative index)" do
assert_nil SequenceSet.empty.at(0)
assert_equal 1, SequenceSet[1..].at(0)
assert_equal 1, SequenceSet.full.at(0)
assert_equal 111, SequenceSet.full.at(110)
assert_equal 4, SequenceSet[2,4,6,8].at(1)
assert_equal 8, SequenceSet[2,4,6,8].at(3)
assert_equal 6, SequenceSet[4..6].at(2)
assert_nil SequenceSet[4..6].at(3)
assert_equal 205, SequenceSet["101:110,201:210,301:310"].at(14)
assert_equal 310, SequenceSet["101:110,201:210,301:310"].at(29)
assert_nil SequenceSet["101:110,201:210,301:310"].at(44)
assert_equal :*, SequenceSet["1:10,*"].at(10)
end
test "#[non-negative index]" do
assert_nil SequenceSet.empty[0]
assert_equal 1, SequenceSet[1..][0]
assert_equal 1, SequenceSet.full[0]
assert_equal 111, SequenceSet.full[110]
assert_equal 4, SequenceSet[2,4,6,8][1]
assert_equal 8, SequenceSet[2,4,6,8][3]
assert_equal 6, SequenceSet[4..6][2]
assert_nil SequenceSet[4..6][3]
assert_equal 205, SequenceSet["101:110,201:210,301:310"][14]
assert_equal 310, SequenceSet["101:110,201:210,301:310"][29]
assert_nil SequenceSet["101:110,201:210,301:310"][44]
assert_equal :*, SequenceSet["1:10,*"][10]
end
test "#at(negative index)" do
assert_nil SequenceSet.empty.at(-1)
assert_equal :*, SequenceSet[1..].at(-1)
assert_equal 1, SequenceSet.full.at(-(2**32))
assert_equal 111, SequenceSet[1..111].at(-1)
assert_equal 6, SequenceSet[2,4,6,8].at(-2)
assert_equal 2, SequenceSet[2,4,6,8].at(-4)
assert_equal 4, SequenceSet[4..6].at(-3)
assert_nil SequenceSet[4..6].at(-4)
assert_equal 207, SequenceSet["101:110,201:210,301:310"].at(-14)
assert_equal 102, SequenceSet["101:110,201:210,301:310"].at(-29)
assert_nil SequenceSet["101:110,201:210,301:310"].at(-44)
end
test "#[negative index]" do
assert_nil SequenceSet.empty[-1]
assert_equal :*, SequenceSet[1..][-1]
assert_equal 1, SequenceSet.full[-(2**32)]
assert_equal 111, SequenceSet[1..111][-1]
assert_equal 6, SequenceSet[2,4,6,8][-2]
assert_equal 2, SequenceSet[2,4,6,8][-4]
assert_equal 4, SequenceSet[4..6][-3]
assert_nil SequenceSet[4..6][-4]
assert_equal 207, SequenceSet["101:110,201:210,301:310"][-14]
assert_equal 102, SequenceSet["101:110,201:210,301:310"][-29]
assert_nil SequenceSet["101:110,201:210,301:310"][-44]
end
test "#ordered_at(non-negative index)" do
assert_nil SequenceSet.empty.ordered_at(0)
assert_equal 1, SequenceSet.full.ordered_at(0)
assert_equal 111, SequenceSet.full.ordered_at(110)
assert_equal 1, SequenceSet["1:*"].ordered_at(0)
assert_equal :*, SequenceSet["*,1"].ordered_at(0)
assert_equal 4, SequenceSet["6,4,8,2"].ordered_at(1)
assert_equal 2, SequenceSet["6,4,8,2"].ordered_at(3)
assert_equal 6, SequenceSet["9:11,4:6,1:3"].ordered_at(5)
assert_nil SequenceSet["9:11,4:6,1:3"].ordered_at(9)
assert_equal 105, SequenceSet["201:210,101:110,301:310"].ordered_at(14)
assert_equal 310, SequenceSet["201:210,101:110,301:310"].ordered_at(29)
assert_nil SequenceSet["201:210,101:110,301:310"].ordered_at(30)
assert_equal :*, SequenceSet["1:10,*"].ordered_at(10)
end
test "#ordered_at(negative index)" do
assert_nil SequenceSet.empty.ordered_at(-1)
assert_equal :*, SequenceSet["1:*"].ordered_at(-1)
assert_equal 1, SequenceSet.full.ordered_at(-(2**32))
assert_equal :*, SequenceSet["*,1"].ordered_at(0)
assert_equal 8, SequenceSet["6,4,8,2"].ordered_at(-2)
assert_equal 6, SequenceSet["6,4,8,2"].ordered_at(-4)
assert_equal 4, SequenceSet["9:11,4:6,1:3"].ordered_at(-6)
assert_equal 10, SequenceSet["9:11,4:6,1:3"].ordered_at(-8)
assert_nil SequenceSet["9:11,4:6,1:3"].ordered_at(-12)
assert_equal 107, SequenceSet["201:210,101:110,301:310"].ordered_at(-14)
assert_equal 201, SequenceSet["201:210,101:110,301:310"].ordered_at(-30)
assert_nil SequenceSet["201:210,101:110,301:310"].ordered_at(-31)
assert_equal :*, SequenceSet["1:10,*"].ordered_at(10)
end
test "#[start, length]" do
assert_equal SequenceSet[10..99], SequenceSet.full[9, 90]
assert_equal 90, SequenceSet.full[9, 90].count
assert_equal 90, SequenceSet.full[9, 90].cardinality
assert_equal SequenceSet[1000..1099],
SequenceSet[1..100, 1000..1111][100, 100]
assert_equal SequenceSet[11, 21, 31, 41],
SequenceSet[((1..10_000) % 10).to_a][1, 4]
assert_equal SequenceSet[9981, 9971, 9961, 9951],
SequenceSet[((1..10_000) % 10).to_a][-5, 4]
assert_nil SequenceSet[111..222, 888..999][2000, 4]
assert_nil SequenceSet[111..222, 888..999][-2000, 4]
# with length longer than the remaining members
assert_equal SequenceSet[101...200],
SequenceSet[1...200][100, 10000]
end
test "#[range]" do
assert_equal SequenceSet[10..100], SequenceSet.full[9..99]
assert_equal SequenceSet[1000..1100],
SequenceSet[1..100, 1000..1111][100..200]
assert_equal SequenceSet[1000..1099],
SequenceSet[1..100, 1000..1111][100...200]
assert_equal SequenceSet[11, 21, 31, 41],
SequenceSet[((1..10_000) % 10).to_a][1..4]
assert_equal SequenceSet[9981, 9971, 9961, 9951],
SequenceSet[((1..10_000) % 10).to_a][-5..-2]
assert_equal SequenceSet[((51..9951) % 10).to_a],
SequenceSet[((1..10_000) % 10).to_a][5..-5]
assert_equal SequenceSet.full, SequenceSet.full[0..]
assert_equal SequenceSet[2..], SequenceSet.full[1..]
assert_equal SequenceSet[:*], SequenceSet.full[-1..]
assert_equal SequenceSet.empty, SequenceSet[1..100][60..50]
assert_equal SequenceSet.empty, SequenceSet[1..100][-50..-60]
assert_equal SequenceSet.empty, SequenceSet[1..100][-10..10]
assert_equal SequenceSet.empty, SequenceSet[1..100][60..-60]
assert_equal SequenceSet.empty, SequenceSet[1..100][10...0]
assert_equal SequenceSet.empty, SequenceSet[1..100][0...0]
assert_nil SequenceSet.empty[2..4]
assert_nil SequenceSet[101..200][1000..1060]
assert_nil SequenceSet[101..200][-1000..-60]
# with length longer than the remaining members
assert_equal SequenceSet[101..1111], SequenceSet[1..1111][100..999_999]
end
test "#find_index" do
assert_equal 9, SequenceSet.full.find_index(10)
assert_equal 99, SequenceSet.full.find_index(100)
set = SequenceSet[1..100, 1000..1111]
assert_equal 100, set.find_index(1000)
assert_equal 200, set.find_index(1100)
set = SequenceSet[((1..10_000) % 10).to_a]
assert_equal 0, set.find_index(1)
assert_equal 1, set.find_index(11)
assert_equal 5, set.find_index(51)
assert_nil SequenceSet.empty.find_index(1)
assert_nil SequenceSet[5..9].find_index(4)
assert_nil SequenceSet[5..9,12..24].find_index(10)
assert_nil SequenceSet[5..9,12..24].find_index(11)
assert_equal 1, SequenceSet[1, :*].find_index(-1)
assert_equal 2**32 - 1, SequenceSet.full.find_index(:*)
end
test "#find_ordered_index" do
assert_equal 9, SequenceSet.full.find_ordered_index(10)
assert_equal 99, SequenceSet.full.find_ordered_index(100)
assert_equal 2**32 - 1, SequenceSet.full.find_ordered_index(:*)
assert_nil SequenceSet.empty.find_index(1)
set = SequenceSet["9,8,7,6,5,4,3,2,1"]
assert_equal 0, set.find_ordered_index(9)
assert_equal 1, set.find_ordered_index(8)
assert_equal 2, set.find_ordered_index(7)
assert_equal 3, set.find_ordered_index(6)
assert_equal 4, set.find_ordered_index(5)
assert_equal 5, set.find_ordered_index(4)
assert_equal 6, set.find_ordered_index(3)
assert_equal 7, set.find_ordered_index(2)
assert_equal 8, set.find_ordered_index(1)
assert_nil set.find_ordered_index(10)
set = SequenceSet["7:9,5:6"]
assert_equal 0, set.find_ordered_index(7)
assert_equal 1, set.find_ordered_index(8)
assert_equal 2, set.find_ordered_index(9)
assert_equal 3, set.find_ordered_index(5)
assert_equal 4, set.find_ordered_index(6)
assert_nil set.find_ordered_index(4)
set = SequenceSet["1000:1111,1:100"]
assert_equal 0, set.find_ordered_index(1000)
assert_equal 100, set.find_ordered_index(1100)
assert_equal 112, set.find_ordered_index(1)
assert_equal 121, set.find_ordered_index(10)
set = SequenceSet["1,1,1,1,51,50,4,11"]
assert_equal 0, set.find_ordered_index(1)
assert_equal 4, set.find_ordered_index(51)
assert_equal 5, set.find_ordered_index(50)
assert_equal 6, set.find_ordered_index(4)
assert_equal 7, set.find_ordered_index(11)
assert_equal 1, SequenceSet["1,*"].find_ordered_index(-1)
assert_equal 0, SequenceSet["*,1"].find_ordered_index(-1)
end
test "#above" do
set = SequenceSet["5,10:22,50"]
assert_equal SequenceSet.empty, set.above(2**32 - 1)
assert_equal SequenceSet.empty, set.above(99)
assert_equal SequenceSet.empty, set.above(50)
assert_equal SequenceSet["50"], set.above(40)
assert_equal SequenceSet["50"], set.above(30)
assert_equal SequenceSet["21:22,50"], set.above(20)
assert_equal SequenceSet["11:22,50"], set.above(10)
assert_equal SequenceSet["5,10:22,50"], set.above(1)
assert_raise ArgumentError do set.above(2**32) end
assert_raise ArgumentError do set.above(0) end
assert_raise ArgumentError do set.above(-1) end
assert_raise ArgumentError do set.above(:*) end
end
test "#below" do
set = SequenceSet["5,10:22,50"]
assert_equal SequenceSet["5,10:22,50"], set.below(99)
assert_equal SequenceSet["5,10:22"], set.below(50)
assert_equal SequenceSet["5,10:22"], set.below(40)
assert_equal SequenceSet["5,10:22"], set.below(30)
assert_equal SequenceSet["5,10:19"], set.below(20)
assert_equal SequenceSet["5"], set.below(10)
assert_equal SequenceSet.empty, set.below(1)
assert_equal SequenceSet.empty, set.below(1)
assert_raise ArgumentError do set.below(2**32) end
assert_raise ArgumentError do set.below(0) end
assert_raise ArgumentError do set.below(-1) end
assert_raise ArgumentError do set.below(:*) end
end
test "#limit" do
set = SequenceSet["1:100,500"]
assert_equal [1..99], set.limit(max: 99).ranges
assert_equal (1..15).to_a, set.limit(max: 15).numbers
assert_equal SequenceSet["1:100"], set.limit(max: 101)
assert_equal SequenceSet["1:97"], set.limit(max: 97)
assert_equal [1..99], set.limit(max: 99).ranges
assert_equal (1..15).to_a, set.limit(max: 15).numbers
end
test "#limit with *" do
assert_equal SequenceSet.new("2,4,5,6,7,9,12,13,14,15"),
SequenceSet.new("2,4:7,9,12:*").limit(max: 15)
assert_equal(SequenceSet["37"],
SequenceSet["50,60,99:*"].limit(max: 37))
assert_equal(SequenceSet["1:100,300"],
SequenceSet["1:100,500:*"].limit(max: 300))
assert_equal [15], SequenceSet["3967:*"].limit(max: 15).numbers
assert_equal [15], SequenceSet["*:12293456"].limit(max: 15).numbers
end
test "#limit with empty result" do
assert_equal SequenceSet.empty, SequenceSet["1234567890"].limit(max: 37)
assert_equal SequenceSet.empty, SequenceSet["99:195,458"].limit(max: 37)
end
test "values for '*'" do
assert_equal "*", SequenceSet[?*].to_s
assert_equal "*", SequenceSet[:*].to_s
assert_equal "*", SequenceSet[-1].to_s
assert_equal "*", SequenceSet[[?*]].to_s
assert_equal "*", SequenceSet[[:*]].to_s
assert_equal "*", SequenceSet[[-1]].to_s
assert_equal "1:*", SequenceSet[1..].to_s
assert_equal "1:*", SequenceSet[1..-1].to_s
end
test "#empty?" do
refute SequenceSet.new("1:*").empty?
refute SequenceSet.new(:*).empty?
assert SequenceSet.new(nil).empty?
assert SequenceSet.new.empty?
assert SequenceSet.empty.empty?
set = SequenceSet.new "1:1111"
refute set.empty?
set.string = nil
assert set.empty?
end
test "#full?" do
assert SequenceSet.new("1:*").full?
refute SequenceSet.new(1..2**32-1).full?
refute SequenceSet.new(nil).full?
end
test "#to_sequence_set" do
assert_equal (set = SequenceSet["*"]), set.to_sequence_set
assert_equal (set = SequenceSet["15:36,5,99,*,2"]), set.to_sequence_set
end
test "set + other" do
seqset = -> { SequenceSet.new _1 }
assert_equal seqset["1,5"], seqset["1"] + seqset["5"]
assert_equal seqset["1,*"], seqset["*"] + seqset["1"]
assert_equal seqset["1:*"], seqset["1:4"] + seqset["5:*"]
assert_equal seqset["1:*"], seqset["5:*"] + seqset["1:4"]
assert_equal seqset["1:5"], seqset["1,3,5"] + seqset["2,4"]
assert_equal seqset["1:3,5,7:9"], seqset["1,3,5,7:8"] + seqset["2,8:9"]
assert_equal seqset["1:*"], seqset["1,3,5,7:*"] + seqset["2,4:6"]
end
test "#add" do
assert_equal SequenceSet["1,5"], SequenceSet.new("1").add("5")
assert_equal SequenceSet["1,*"], SequenceSet.new("*").add(1)
assert_equal SequenceSet["1:9"], SequenceSet.new("1:6").add("4:9")
assert_equal SequenceSet["1:*"], SequenceSet.new("1:4").add(5..)
assert_equal SequenceSet["1:*"], SequenceSet.new("5:*").add(1..4)
end
test "#<<" do
assert_equal SequenceSet["1,5"], SequenceSet.new("1") << "5"
assert_equal SequenceSet["1,*"], SequenceSet.new("*") << 1
assert_equal SequenceSet["1:9"], SequenceSet.new("1:6") << "4:9"
assert_equal SequenceSet["1:*"], SequenceSet.new("1:4") << (5..)
assert_equal SequenceSet["1:*"], SequenceSet.new("5:*") << (1..4)
end
test "#append" do
assert_equal "1,5", SequenceSet.new("1").append("5").string
assert_equal "*,1", SequenceSet.new("*").append(1).string
assert_equal "1:6,4:9", SequenceSet.new("1:6").append("4:9").string
assert_equal "5:*,1:4", SequenceSet.new("5:*").append(1..4).string
# also works when previous string was not normal
assert_equal "3:1,8:9", SequenceSet.new("3:1").append("9:8").string
# coalesces adjacent entries (when previously normalized)
assert_equal "1:9", SequenceSet.new("1:3").append("4:9").string
assert_equal "1:9", SequenceSet.new("1:3").append("9:4").string
assert_equal "1:*", SequenceSet.new("1:4").append(5..).string
# coalesces adjacent entries (when _not_ previously normalized)
assert_equal "1:9", SequenceSet.new("3:1").append("4:9").string
assert_equal "4,1:*", SequenceSet.new("4,1").append(2..).string
# assert_equal "3:1,4:9", SequenceSet.new("3:1").append("4:9").string
# a non-normal appended string will be normalized
assert_equal "1:6,4:9", SequenceSet.new("1:6").append("9:4").string
assert_equal "1:6,999", SequenceSet.new("1:6").append("999:999").string
# also works from empty
assert_equal "5,1", SequenceSet.new.append(5).append(1).string
# also works when *previously* input was non-strings
assert_equal "*,1", SequenceSet.new(:*).append(1).string
assert_equal "1,5", SequenceSet.new(1).append("5").string
assert_equal "1:6,4:9", SequenceSet.new(1..6).append(4..9).string
assert_equal "1:*", SequenceSet.new(1..4).append(5..).string
assert_equal "5:*,1:4", SequenceSet.new(5..).append(1..4).string
end
test "#merge" do
seqset = -> { SequenceSet.new _1 }
assert_equal seqset["1,5"], seqset["1"].merge("5")
assert_equal seqset["1,*"], seqset["*"].merge(1)
assert_equal seqset["1:*"], seqset["1:4"].merge(5..)
assert_equal seqset["1:3,5,7:9"], seqset["1,3,5,7:8"].merge(seqset["2,8:9"])
assert_equal seqset["1:*"], seqset["5:*"].merge(1..4)
assert_equal seqset["1:5"], seqset["1,3,5"].merge(seqset["2,4"])
# when merging frozen SequenceSet
set = SequenceSet.new
set.merge SequenceSet[1, 3, 5]
set.merge SequenceSet[2..33]
assert_equal seqset[1..33], set
end
test "set - other" do
seqset = -> { SequenceSet.new _1 }
assert_equal seqset["1,5"], seqset["1,5"] - 9
assert_equal seqset["1,5"], seqset["1,5"] - "3"
assert_equal seqset["1,5"], seqset["1,3,5"] - [3]
assert_equal seqset["1,9"], seqset["1,3:9"] - "2:8"
assert_equal seqset["1,9"], seqset["1:7,9"] - (2..8)
assert_equal seqset["1,9"], seqset["1:9"] - (2..8).to_a
assert_equal seqset["1,5"], seqset["1,5:9,11:99"] - "6:999"
assert_equal seqset["1,5,99"], seqset["1,5:9,11:88,99"] - ["6:98"]
assert_equal seqset["1,5,99"], seqset["1,5:6,8:9,11:99"] - "6:98"
assert_equal seqset["1,5,11:99"], seqset["1,5:6,8:9,11:99"] - "6:9"
assert_equal seqset["1:10"], seqset["1:*"] - (11..)
assert_equal seqset[nil], seqset["1,5"] - [1..8, 10..]
end
test "#intersection" do
seqset = -> { SequenceSet.new _1 }
assert_equal seqset[nil], seqset["1,5"] & "9"
assert_equal seqset["1,5"], seqset["1:5"].intersection([1, 5..9])
assert_equal seqset["1,5"], seqset["1:5"] & [1, 5, 9, 55]
assert_equal seqset["*"], seqset["9999:*"] & "1,5,9,*"
end
test "#intersect?" do
set = SequenceSet["1:5,11:20"]
refute set.intersect? "9"
refute set.intersect? 9
refute set.intersect? 6..10
refute set.intersect? ~set
assert set.intersect? 6..11
assert set.intersect? "1,5,11,20"
assert set.intersect? set
end
test "#disjoint?" do
set = SequenceSet["1:5,11:20"]
assert set.disjoint? "9"
assert set.disjoint? 6..10
assert set.disjoint? ~set
refute set.disjoint? 6..11
refute set.disjoint? "1,5,11,20"
refute set.disjoint? set
end
test "#delete" do
seqset = -> { SequenceSet.new _1 }
assert_equal seqset["1,5"], seqset["1,5"].delete("9")
assert_equal seqset["1,5"], seqset["1,5"].delete("3")
assert_equal seqset["1,5"], seqset["1,3,5"].delete("3")
assert_equal seqset["1,9"], seqset["1,3:9"].delete("2:8")
assert_equal seqset["1,9"], seqset["1:7,9"].delete("2:8")
assert_equal seqset["1,9"], seqset["1:9"].delete("2:8")
assert_equal seqset["1,5"], seqset["1,5:9,11:99"].delete("6:999")
assert_equal seqset["1,5,99"], seqset["1,5:9,11:88,99"].delete("6:98")
assert_equal seqset["1,5,99"], seqset["1,5:6,8:9,11:99"].delete("6:98")
assert_equal seqset["1,5,11:99"], seqset["1,5:6,8:9,11:99"].delete("6:9")
end
test "#subtract" do
seqset = -> { SequenceSet.new _1 }
assert_equal seqset["1,5"], seqset["1,5"].subtract("9")
assert_equal seqset["1,5"], seqset["1,5"].subtract("3")
assert_equal seqset["1,5"], seqset["1,3,5"].subtract("3")
assert_equal seqset["1,9"], seqset["1,3:9"].subtract("2:8")
assert_equal seqset["1,9"], seqset["1:7,9"].subtract("2:8")
assert_equal seqset["1,9"], seqset["1:9"].subtract("2:8")
assert_equal seqset["1,5"], seqset["1,5:9,11:99"].subtract("6:999")
assert_equal seqset["1,5,99"], seqset["1,5:9,11:88,99"].subtract("6:98")
assert_equal seqset["1,5,99"], seqset["1,5:6,8:9,11:99"].subtract("6:98")
assert_equal seqset["1,5,11:99"], seqset["1,5:6,8:9,11:99"].subtract("6:9")
end
test "#xor" do
seqset = -> { SequenceSet.new(_1) }
assert_equal seqset["1:5,11:15"], seqset["1:10"] ^ seqset["6:15"]
assert_equal seqset["1,3,5:6"], seqset[1..5] ^ [2, 4, 6]
assert_equal SequenceSet.empty, seqset[1..5] ^ seqset[1..5]
assert_equal seqset["1:100"], seqset["1:50"] ^ seqset["51:100"]
assert_equal seqset["1:50"], seqset["1:50"] ^ SequenceSet.empty
assert_equal seqset["1:50"], SequenceSet.empty ^ seqset["1:50"]
end
test "#min" do
assert_equal 3, SequenceSet.new("34:3").min
assert_equal 345, SequenceSet.new("345,678").min
assert_nil SequenceSet.new.min
# with a count
assert_equal SequenceSet["3:6"], SequenceSet["34:3"].min(4)
assert_equal SequenceSet["345"], SequenceSet["345,678"].min(1)
assert_equal SequenceSet["345,678"], SequenceSet["345,678"].min(222)
assert_equal SequenceSet.empty, SequenceSet.new.min(5)
end
test "#max" do
assert_equal 34, SequenceSet["34:3"].max
assert_equal 678, SequenceSet["345,678"].max
assert_equal 678, SequenceSet["345:678"].max(star: "unused")
assert_equal :*, SequenceSet["345:*"].max
assert_equal nil, SequenceSet["345:*"].max(star: nil)
assert_equal "*", SequenceSet["345:*"].max(star: "*")
assert_nil SequenceSet.new.max(star: "ignored")
# with a count
assert_equal SequenceSet["31:34"], SequenceSet["34:3"].max(4)
assert_equal SequenceSet["678"], SequenceSet["345,678"].max(1)
assert_equal SequenceSet["345,678"], SequenceSet["345,678"].max(222)
assert_equal SequenceSet.empty, SequenceSet.new.max(5)
end
test "#minmax" do
assert_equal [ 3, 3], SequenceSet["3"].minmax
assert_equal [ :*, :*], SequenceSet["*"].minmax
assert_equal [ 99, 99], SequenceSet["*"].minmax(star: 99)
assert_equal [ 3, 34], SequenceSet["34:3"].minmax
assert_equal [345, 678], SequenceSet["345,678"].minmax
assert_equal [345, 678], SequenceSet["345:678"].minmax(star: "unused")
assert_equal [345, :*], SequenceSet["345:*"].minmax
assert_equal [345, nil], SequenceSet["345:*"].minmax(star: nil)
assert_equal [345, "*"], SequenceSet["345:*"].minmax(star: "*")
assert_nil SequenceSet.new.minmax(star: "ignored")
end
test "#add?" do
assert_equal(SequenceSet.new("1:3,5,7:8"),
SequenceSet.new("1,3,5,7:8").add?("2"))
assert_equal(SequenceSet.new("1,3,5,7:9"),
SequenceSet.new("1,3,5,7:8").add?("8:9"))
assert_nil SequenceSet.new("1,3,5,7:*").add?("3")
assert_nil SequenceSet.new("1,3,5,7:*").add?("9:91")
end
test "#delete?" do
set = SequenceSet.new [5..10, 20]
assert_nil set.delete?(11)
assert_equal SequenceSet[5..10, 20], set
assert_equal 6, set.delete?(6)
assert_equal SequenceSet[5, 7..10, 20], set
assert_equal SequenceSet[9..10, 20], set.delete?(9..)
assert_equal SequenceSet[5, 7..8], set
assert_nil set.delete?(11..)
end
test "#slice!" do
set = SequenceSet.new 1..20
assert_equal SequenceSet[1..4], set.slice!(0, 4)
assert_equal SequenceSet[5..20], set
assert_equal 14, set.slice!(-7)
assert_equal SequenceSet[5..13, 15..20], set
assert_equal 11, set.slice!(6)
assert_equal SequenceSet[5..10, 12..13, 15..20], set
assert_equal SequenceSet[12..13, 15..19], set.slice!(6..12)
assert_equal SequenceSet[5..10, 20], set
assert_nil set.slice!(10)
assert_equal SequenceSet[5..10, 20], set
assert_equal 6, set.slice!(1)
assert_equal SequenceSet[5, 7..10, 20], set
assert_equal SequenceSet[9..10, 20], set.slice!(3..)
assert_equal SequenceSet[5, 7..8], set
assert_nil set.slice!(3)
assert_nil set.slice!(3..)
end
test "#delete_at" do
set = SequenceSet.new [5..10, 20]
assert_nil set.delete_at(20)
assert_equal SequenceSet[5..10, 20], set
assert_equal 6, set.delete_at(1)
assert_equal 9, set.delete_at(3)
assert_equal 10, set.delete_at(3)
assert_equal 20, set.delete_at(3)
assert_equal nil, set.delete_at(3)
assert_equal SequenceSet[5, 7..8], set
end
test "#include_star?" do
assert SequenceSet["2,*:12"].include_star?
assert SequenceSet[-1].include_star?
refute SequenceSet["12"].include_star?
end
test "#include?" do
assert_equal true, SequenceSet["2:4"].include?(3)
assert_equal true, SequenceSet["2,*:12"].include?(:*)
assert_equal true, SequenceSet["2,*:12"].include?(-1)
assert_nil SequenceSet["1:*"].include?("hopes and dreams")
assert_nil SequenceSet["1:*"].include?(:wat?)
assert_nil SequenceSet["1:*"].include?([1, 2, 3])
set = SequenceSet.new Array.new(100) { rand(1..1500) }
rev = (~set).limit(max: 1_501)
set.numbers.each do assert_equal true, set.include?(_1) end
rev.numbers.each do assert_equal false, set.include?(_1) end
end
test "#cover?" do
assert SequenceSet["2:4"].cover?(3)
assert SequenceSet["2,4:7,9,12:*"] === 2
assert SequenceSet["2,4:7,9,12:*"].cover?(2222)
assert SequenceSet["2,*:12"].cover? :*
assert SequenceSet["2,*:12"].cover?(-1)
assert SequenceSet["2,*:12"].cover?(99..5000)
refute SequenceSet["2,*:12"].cover?(10)
refute SequenceSet["2,*:12"].cover?(10..13)
assert SequenceSet["2:12"].cover?(10..12)
refute SequenceSet["2:12"].cover?(10..13)
assert SequenceSet["2:12"].cover?(10...13)
set = SequenceSet.new Array.new(100) { rand(1..1500) }
rev = (~set).limit(max: 1_501)
refute set.cover?(rev)
set.each_element do assert set.cover?(_1) end
rev.each_element do refute set.cover?(_1) end
assert SequenceSet["2:4"].cover? []
assert SequenceSet["2:4"].cover? SequenceSet.empty
assert SequenceSet["2:4"].cover? nil
assert SequenceSet["2:4"].cover? ""
refute SequenceSet["2:4"].cover? "*"
refute SequenceSet["2:4"].cover? SequenceSet.full
assert SequenceSet.full .cover? SequenceSet.full
assert SequenceSet.full .cover? :*
assert SequenceSet.full .cover?(-1)
assert SequenceSet.empty .cover? SequenceSet.empty
refute SequenceSet.empty .cover? SequenceSet[:*]
end
test "~full == empty" do
assert_equal SequenceSet.new("1:*"), ~SequenceSet.new
assert_equal SequenceSet.new, ~SequenceSet.new("1:*")
assert_equal SequenceSet.new("1:*"), SequenceSet.new .complement
assert_equal SequenceSet.new, SequenceSet.new("1:*").complement
assert_equal SequenceSet.new("1:*"), SequenceSet.new .complement!
assert_equal SequenceSet.new, SequenceSet.new("1:*").complement!
end
data(
# desc => [expected, input, freeze]
"empty" => ["Net::IMAP::SequenceSet()", nil],
"frozen empty" => ["Net::IMAP::SequenceSet.empty", nil, true],
"normalized" => ['Net::IMAP::SequenceSet("1:2")', [2, 1]],
"denormalized" => ['Net::IMAP::SequenceSet("2,1")', "2,1"],
"star" => ['Net::IMAP::SequenceSet("*")', "*"],
"frozen" => ['Net::IMAP::SequenceSet["1,3,5:*"]', [1, 3, 5..], true],
"at limit" => [
"Net::IMAP::SequenceSet(\"#{((1..1024) % 2).to_a.join(",")}\")",
[((1..1024) % 2).to_a],
false
],
"just over limit" => [
'#<Net::IMAP::SequenceSet 513 entries ' \
'"1,3,5,7,9,11,13,15,' \
'17,19,21,23,25,27,29,31,' \
'...(481 entries omitted)...,' \
'995,997,999,1001,1003,1005,1007,1009,' \
'1011,1013,1015,1017,1019,1021,1023,1025">',
((1..1025) % 2).to_a,
false
],
"denormalized at limit" => [
"Net::IMAP::SequenceSet(\"#{(1..512).to_a.reverse.join(",")}\")",
(1..512).to_a.reverse.join(","),
false
],
"over limit" => [
'#<Net::IMAP::SequenceSet 2046 entries ' \
'"1:5,7,9,11,13,15,17,19,' \
'21,23,25,27,29,31,33,35,' \
'...(2014 entries omitted)...,' \
'4065,4067,4069,4071,4073,4075,4077,4079,' \
'4081,4083,4085,4087,4089,4091,4093,4095">',
[((1..4096) % 2).to_a, 2, 4], # add 2 and 4 to demonstrate range: "1:5"
false
],
"frozen over limit" => [
'#<Net::IMAP::SequenceSet 2046 entries "' \
'1:5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,' \
'...(2014 entries omitted)...,' \
'4065,4067,4069,4071,4073,4075,4077,4079,' \
'4081,4083,4085,4087,4089,4091,4093,4095" (frozen)>',
[((1..4096) % 2).to_a, 2, 4], # add 2 and 4 to demonstrate range: "1:5"
true
],
"denormalized over limit" => [
'#<Net::IMAP::SequenceSet 1000 entries "' \
'100001,100002,100003,100004,100005,100006,100007,100008,' \
'100009,100010,100011,100012,100013,100014,100015,100016,' \
'...(968 entries omitted)...,' \
'100985,100986,100987,100988,100989,100990,100991,100992,' \
'100993,100994,100995,100996,100997,100998,100999,101000">',
(100_001..101_000).to_a.join(","),
false
],
)
def test_inspect((expected, input, freeze))
seqset = SequenceSet.new(input)
seqset = seqset.freeze if freeze
assert_equal expected, seqset.inspect
end
data "single number", {