blob: 4980cb3c1a1df901d0caa1503760076bee9986ce (
plain)
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
|
class Pry
# A ring is an array to which you can only add elements. Older entries are
# removed progressively, so that the array never contains more than N
# elements.
#
# Rings are used by Pry to store the output of the last commands.
#
# @example
# ring = Pry::Ring.new(10)
# ring << 1 << 2 << 3
# ring[0] # => 1
# ring[1] # => 2
# 10.times { |n| ring << n }
# ring[0] # => nil
# ring[-1] # => 9
class Ring
include Enumerable
# @param [Integer] size Maximum amount of objects in the array
def initialize(size)
@max_size = size
@hash = {}
@count = 0
end
# Pushes an object at the end of the array
# @param [Object] value Object to be added
def <<(value)
@hash[@count] = value
if @hash.size > max_size
@hash.delete(@count - max_size)
end
@count += 1
self
end
# @overload [](index)
# @param [Integer] index Index of the item to access.
# @return [Object, nil] Item at that index or nil if it has been removed.
# @overload [](index, size)
# @param [Integer] index Index of the first item to access.
# @param [Integer] size Amount of items to access
# @return [Array, nil] The selected items. Nil if index is greater than
# the size of the array.
# @overload [](range)
# @param [Range<Integer>] range Range of indices to access.
# @return [Array, nil] The selected items. Nil if index is greater than
# the size of the array.
def [](index_or_range, size = nil)
unless index_or_range.is_a?(Integer)
range = convert_range(index_or_range)
return range.begin > @count ? nil : range.map { |n| @hash[n] }
end
index = convert_index(index_or_range)
return @hash[index] unless size
return if index > @count
end_index = index + size
(index...[end_index, @count].min).map { |n| @hash[n] }
end
# @return [Integer] Amount of objects in the array
def size
@count
end
alias count size
alias length size
def empty?
size == 0
end
def each
((@count - size)...@count).each do |n|
yield @hash[n]
end
end
def to_a
((@count - size)...@count).map { |n| @hash[n] }
end
# @return [Hash] copy of the internal @hash history
def to_h
@hash.dup
end
def pop!
@hash.delete @count - 1
@count -= 1
end
def inspect
"#<#{self.class} size=#{size} first=#{@count - size} max_size=#{max_size}>"
end
# @return [Integer] Maximum amount of objects in the array
attr_reader :max_size
private
def convert_index(n)
n >= 0 ? n : @count + n
end
def convert_range(range)
end_index = convert_index(range.end)
end_index += 1 unless range.exclude_end?
Range.new(convert_index(range.begin), [end_index, @count].min, true)
end
end
end
|