-
Notifications
You must be signed in to change notification settings - Fork 67
/
log.rb
288 lines (259 loc) · 7.78 KB
/
log.rb
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
############################################################################
# Copyright 2009-2019 Benjamin Kellermann #
# #
# This file is part of Dudle. #
# #
# Dudle is free software: you can redistribute it and/or modify it under #
# the terms of the GNU Affero General Public License as published by #
# the Free Software Foundation, either version 3 of the License, or #
# (at your option) any later version. #
# #
# Dudle is distributed in the hope that it will be useful, but WITHOUT ANY #
# WARRANTY; without even the implied warranty of MERCHANTABILITY or #
# FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public #
# License for more details. #
# #
# You should have received a copy of the GNU Affero General Public License #
# along with dudle. If not, see <http://www.gnu.org/licenses/>. #
############################################################################
require "time"
class LogEntry
attr_accessor :rev, :timestamp, :comment
def initialize(rev,timestamp,comment)
@rev = rev
@timestamp = timestamp
@comment = comment
end
def to_html(link = true,history = "")
ret = "<tr><td>"
if link
ret += "<a href='?revision=#{@rev}"
ret += "&history=#{history}" if history != ""
ret += "'>"
end
ret += "#{@rev}"
ret += "</a>" if link
ret += "</td>"
ret += "<td>#{@timestamp.strftime('%d.%m, %H:%M')}</td>"
ret += "<td class='historycomment'>#{CGI.escapeHTML(@comment)}</td>"
ret += "</tr>"
ret
end
include Comparable
def <=>(other)
self.rev <=> other.rev
end
def inspect
"#{@rev}: #{@comment}"
end
end
class Log
attr_reader :log
def initialize(a = [])
@log = a.compact.sort
end
def min
@log.sort!
@log[0]
end
def max
@log.sort!
@log[-1]
end
def revisions
@log.collect{|e| e.rev }
end
def [](revision)
i = revisions.index(revision)
if i
return @log[i]
else # no revision found, search the nearest
dist = revisions.collect{|e| (e - revision).abs }.sort[0]
return nil unless dist
i = revisions.index(revision + dist) || revisions.index(revision - dist)
return @log[i]
end
end
def size
@log.size
end
def around_rev(rev,number)
ret = [self[rev]]
midindex = @log.index(ret[0])
counter = 1
while ret.size < number && counter < @log.size
ret << @log[midindex + counter]
counter *= -1 if counter <= midindex
if counter > 0
counter += 1
end
ret.compact!
end
ret.sort!
Log.new(ret)
end
def +(other)
a = @log + other.log
Log.new(a.sort)
end
def add(revision,timestamp,comment)
@log << LogEntry.new(revision,timestamp,comment)
@log.sort!
end
def to_html(unlinkedrevision,history)
ret = "<table><thead><tr><th>"
ret += _("Version") + "</th><th>" + _("Date") + "</th><th>" + _("Comment") + "</th></thead></tr>"
self.reverse_each{|l|
ret += l.to_html(unlinkedrevision != l.rev,history)
}
ret += "</table>"
ret
end
def reverse_each
@log.reverse.each{|e| yield(e)}
end
def each
@log.each{|e| yield(e)}
end
def collect
@log.collect{|e| yield(e)}
end
def comment_matches(regex)
Log.new(@log.collect{|e| e if e.comment =~ regex}.compact)
end
def undorevisions
h = []
minrev = min.rev
rev = max.rev
while rev > minrev
elem = self[rev]
prevrev = elem.comment.scan(/^.* to version (\d*)$/).flatten[0]
if prevrev
rev = prevrev.to_i
else
h << elem
rev -= 1
end
end
h.sort!
a = []
begin
a << h.pop
end while a.last && a.last.comment =~ /^Column .*$/
a.pop
a.sort!
Log.new(a)
end
def redorevisions
@log.sort!
revertrevs = []
redone = []
minrev = min.rev
(minrev..max.rev).to_a.reverse.each{|rev|
action,r = self[rev].comment.scan(/^(.*) to version (\d*)$/).flatten
break unless r
if action =~ /^Redo changes/
break unless revertrevs.empty?
redone << r.to_i() -1
else
revertrevs << r.to_i
end
}
revertrevs = revertrevs - redone
Log.new(revertrevs.collect{|e| self[e+1]})
end
end
if __FILE__ == $0
require "test/unit"
require "pp"
class Log_test < Test::Unit::TestCase
def test_indexes
l = Log.new
l.each{flunk("this should not happen")}
assert_equal(nil,l[2])
l.add(10,Time.now,"baz 10")
20.times{|i|
l.add(i,Time.now,"foo #{i}") unless i == 10
}
assert_equal(0,l.min.rev)
assert_equal(19,l.max.rev)
assert_equal("baz 10",l[10].comment)
assert_equal([10],l.comment_matches(/^baz \d*$/).revisions)
[42,23].each{|i|
l.add(i,Time.now,"foo #{i}")
}
assert_equal(l[42],l[37])
assert_equal([16,17,18,19,23,42],l.around_rev(23,6).revisions)
assert_equal([0,1,2,3,4,5,6,7,8,9,10,11],l.around_rev(2,12).revisions)
assert_equal(l.revisions,l.around_rev(0,99).revisions)
end
def test_undoredo
# 15 16 17
# | | |
# 11 10 |
# 14| | |
# 13| 7---8---9
# | 12| 6
# | | | |
# 0-1-2-3-4-5
# p
def dummy_add(log,comment)
log.add(log.max.rev+1,Time.now,comment)
end
l = Log.new
l.add(1,Time.now,"Participant Spamham added")
6.times{|i|
l.add(i,Time.now,"Column Foo#{i} added") unless i == 1
}
assert_equal([2,3,4,5],l.undorevisions.revisions)
assert_equal([],l.redorevisions.revisions)
dummy_add(l,"Reverted Poll to version 4")
assert_equal([2,3,4],l.undorevisions.revisions)
assert_equal([5],l.redorevisions.revisions)
dummy_add(l,"Reverted Poll to version 3")
assert_equal([2,3],l.undorevisions.revisions)
assert_equal([4,5],l.redorevisions.revisions)
dummy_add(l,"Column Foo added")
assert_equal([2,3,8],l.undorevisions.revisions)
assert_equal([],l.redorevisions.revisions)
dummy_add(l,"Column Foo added")
assert_equal([2,3,8,9],l.undorevisions.revisions)
assert_equal([],l.redorevisions.revisions)
dummy_add(l,"Reverted Poll to version 8")
dummy_add(l,"Reverted Poll to version 7")
dummy_add(l,"Reverted Poll to version 2")
dummy_add(l,"Reverted Poll to version 1")
assert_equal([],l.undorevisions.revisions)
assert_equal([2,3,8,9],l.redorevisions.revisions)
dummy_add(l,"Redo changes to version 2")
dummy_add(l,"Redo changes to version 3")
assert_equal([2,3],l.undorevisions.revisions)
assert_equal([8,9],l.redorevisions.revisions)
dummy_add(l,"Redo changes to version 8")
dummy_add(l,"Redo changes to version 9")
assert_equal([2,3,8,9],l.undorevisions.revisions)
assert_equal([],l.redorevisions.revisions)
# second time should be the same
dummy_add(l,"Reverted Poll to version 8")
assert_equal([2,3,8],l.undorevisions.revisions)
assert_equal([9],l.redorevisions.revisions)
dummy_add(l,"Reverted Poll to version 7")
assert_equal([2,3],l.undorevisions.revisions)
assert_equal([8,9],l.redorevisions.revisions)
dummy_add(l,"Reverted Poll to version 2")
assert_equal([2],l.undorevisions.revisions)
assert_equal([3,8,9],l.redorevisions.revisions)
dummy_add(l,"Reverted Poll to version 1")
assert_equal([],l.undorevisions.revisions)
assert_equal([2,3,8,9],l.redorevisions.revisions)
dummy_add(l,"Redo changes to version 2")
dummy_add(l,"Redo changes to version 3")
assert_equal([2,3],l.undorevisions.revisions)
assert_equal([8,9],l.redorevisions.revisions)
dummy_add(l,"Redo changes to version 8")
dummy_add(l,"Redo changes to version 9")
assert_equal([2,3,8,9],l.undorevisions.revisions)
assert_equal([],l.redorevisions.revisions)
end
end
end