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
|
require 'spec_helper'
describe Immutable::Vector do
describe '#insert' do
let(:original) { V[1, 2, 3] }
it 'can add items at the beginning of a vector' do
vector = original.insert(0, :a, :b)
vector.size.should be(5)
vector.at(0).should be(:a)
vector.at(2).should be(1)
end
it 'can add items in the middle of a vector' do
vector = original.insert(1, :a, :b, :c)
vector.size.should be(6)
vector.to_a.should == [1, :a, :b, :c, 2, 3]
end
it 'can add items at the end of a vector' do
vector = original.insert(3, :a, :b, :c)
vector.size.should be(6)
vector.to_a.should == [1, 2, 3, :a, :b, :c]
end
it 'can add items past the end of a vector' do
vector = original.insert(6, :a, :b)
vector.size.should be(8)
vector.to_a.should == [1, 2, 3, nil, nil, nil, :a, :b]
end
it 'accepts a negative index, which counts back from the end of the vector' do
vector = original.insert(-2, :a)
vector.size.should be(4)
vector.to_a.should == [1, :a, 2, 3]
end
it 'raises IndexError if a negative index is too great' do
expect { original.insert(-4, :a) }.to raise_error(IndexError)
end
it 'works when adding an item past boundary when vector trie needs to deepen' do
vector = original.insert(32, :a, :b)
vector.size.should == 34
vector.to_a.size.should == 34
end
it 'works when adding to an empty Vector' do
V.empty.insert(0, :a).should eql(V[:a])
end
it 'has the right size and contents after many insertions' do
array = (1..4000).to_a # we use an Array as standard of correctness
vector = Immutable::Vector.new(array)
100.times do
items = rand(10).times.map { rand(10000) }
index = rand(vector.size)
vector = vector.insert(index, *items)
array.insert(index, *items)
vector.size.should == array.size
ary = vector.to_a
ary.size.should == vector.size
ary.should eql(array)
end
end
end
end
|
