60 lines
1.8 KiB
Ruby
Raw Permalink Normal View History

2025-01-13 20:38:47 +00:00
# Copyright (C) 2024 Manuel Bustillo
# Copyright (C) 2024-2025 LibreWeddingPlanner contributors
2024-11-10 17:01:57 +00:00
# frozen_string_literal: true
2024-11-10 12:35:41 +01:00
require 'rails_helper'
module Tables
RSpec.describe Shift do
describe '#each' do
let(:shifts) do
acc = []
2024-12-28 18:07:22 +01:00
described_class.new(initial_solution).each do |solution| # rubocop:disable Style/MapIntoArray -- #map is not implemented
2024-11-10 12:35:41 +01:00
acc << solution.tables.map(&:dup)
end
acc
end
context 'when there are two tables with two people each' do
let(:initial_solution) do
Distribution.new(min_per_table: 2, max_per_table: 2).tap do |distribution|
distribution.tables << Set[:a, :b].to_table
distribution.tables << Set[:c, :d].to_table
end
end
it 'yields all possible shifts between the tables' do
expect(shifts).to contain_exactly(
[Set[:b], Set[:c, :d, :a]],
[Set[:a], Set[:c, :d, :b]],
[Set[:b, :a, :d], Set[:c]],
[Set[:b, :a, :c], Set[:d]]
)
end
end
context 'when there are two tables with three people each' do
let(:initial_solution) do
Distribution.new(min_per_table: 3, max_per_table: 3).tap do |distribution|
distribution.tables << Set[:a, :b, :c].to_table
distribution.tables << Set[:d, :e, :f].to_table
end
end
it 'yields all possible shifts between the tables' do
expect(shifts).to contain_exactly(
[Set[:b, :c], Set[:d, :e, :f, :a]],
[Set[:c, :a], Set[:d, :e, :f, :b]],
[Set[:a, :b], Set[:d, :e, :f, :c]],
[Set[:a, :b, :c, :d], Set[:e, :f]],
[Set[:a, :b, :c, :e], Set[:d, :f]],
[Set[:a, :b, :c, :f], Set[:d, :e]]
)
end
end
end
end
end