Skip to content

Commit 90baa90

Browse files
committed
Succ is a tad faster in CRuby
1 parent c2620c8 commit 90baa90

File tree

2 files changed

+8
-8
lines changed

2 files changed

+8
-8
lines changed

lib/wave_function_collapse/cell.rb

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@ def initialize(x, y, tiles)
1313
@neighbors = {}
1414
@x = x
1515
@y = y
16-
@@cellid += 1
16+
@@cellid = @@cellid.succ
1717
end
1818

1919
def ==(other)

lib/wave_function_collapse/model.rb

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -64,7 +64,7 @@ def prepend_empty_row
6464
new_cell = Cell.new(x, @height - 1, @tiles)
6565
@cells << new_cell
6666
@uncollapsed_cells << new_cell
67-
x += 1
67+
x = x.succ
6868
end
6969
@width.times { |x|
7070
evaluate_neighbor(cell_at(x, @height - 2), :up)
@@ -85,9 +85,9 @@ def generate_grid
8585

8686
while y < @height
8787
rx[y] = cell_at(x, y).tile
88-
y += 1
88+
y = y.succ
8989
end
90-
x += 1
90+
x = x.succ
9191
end
9292

9393
result
@@ -145,9 +145,9 @@ def evaluate_neighbor(source_cell, evaluation_direction)
145145
new_tiles << neighbor_tiles[i]
146146
break
147147
end
148-
ii += 1
148+
ii = ii.succ
149149
end
150-
i += 1
150+
i = i.succ
151151
end
152152

153153
neighbor_cell.tiles = new_tiles unless new_tiles.empty?
@@ -165,7 +165,7 @@ def find_lowest_entropy
165165
acc = []
166166
while i < l
167167
cc = ucg[i]
168-
next i += 1 if !cc
168+
next i = i.succ if !cc
169169

170170
ce = cc.entropy
171171
if ce < min_e
@@ -176,7 +176,7 @@ def find_lowest_entropy
176176
acc << i
177177
end
178178

179-
i += 1
179+
i = i.succ
180180
end
181181
ucg[acc.sample]
182182
end

0 commit comments

Comments
 (0)