2018-03-25 16:15:39 +00:00
|
|
|
# License: AGPL-3.0-or-later WITH Web-Template-Output-Additional-Permission-3.0-or-later
|
2018-03-25 17:30:42 +00:00
|
|
|
require 'rails_helper'
|
|
|
|
|
|
|
|
describe NameCopyNamingAlgorithm do
|
|
|
|
describe '.create_copy_name' do
|
|
|
|
before(:all) {
|
|
|
|
Timecop.freeze(2020,5,4)
|
|
|
|
}
|
|
|
|
after(:all) {
|
|
|
|
Timecop.return
|
|
|
|
}
|
|
|
|
|
|
|
|
def set_name(name)
|
|
|
|
@name = name
|
|
|
|
end
|
|
|
|
|
|
|
|
let(:short_name) { "short name"}
|
|
|
|
let(:short_name_copy_today) { "short name (2020-05-04 copy) 00"}
|
|
|
|
let(:short_name_copy_today_plus_1) { "short name (2020-05-04 copy) 01"}
|
|
|
|
let(:short_name_copy_yesterday) { "short name (2020-05-03 copy) 00"}
|
|
|
|
let(:short_name_copy_today_base) { "short name (2020-05-04 copy)"}
|
|
|
|
|
|
|
|
let(:long_name) {"campaign_name is so long that it must be shortened down" }
|
|
|
|
let(:long_name_copy_today) {"#{long_name_copy_today_base} 00"}
|
|
|
|
let(:long_name_copy_today_plus_1) {"#{long_name_copy_today_base} 01"}
|
|
|
|
let(:long_name_copy_yesterday) {"campaign_name is so long that it must b (2020-05-03 copy) 00"}
|
|
|
|
let(:long_name_copy_today_base) {"campaign_name is so long that it must b (2020-05-04 copy)"}
|
|
|
|
let(:nonprofit) {force_create(:nonprofit)}
|
|
|
|
|
|
|
|
|
|
|
|
describe 'events' do
|
|
|
|
|
|
|
|
let(:event) {force_create(:event, :name => @name, nonprofit: nonprofit)}
|
|
|
|
let(:event2) {force_create(:event, :name => @name2, nonprofit:nonprofit)}
|
|
|
|
let(:events_at_max_copies) { (0..30).collect{|i|
|
|
|
|
force_create(:event, name: "#{@copy_base} #{"%02d" % i}", nonprofit:nonprofit)
|
|
|
|
}}
|
|
|
|
let(:algo) {NameCopyNamingAlgorithm.new(Event, nonprofit.id)}
|
|
|
|
describe 'short event names' do
|
|
|
|
|
|
|
|
it 'not a copy' do
|
|
|
|
@name = short_name
|
|
|
|
event
|
|
|
|
expect(algo.create_copy_name(@name)).to eq short_name_copy_today
|
|
|
|
end
|
|
|
|
it 'one copy exists' do
|
|
|
|
@name = short_name
|
|
|
|
@name2 = short_name_copy_today
|
|
|
|
event
|
|
|
|
event2
|
|
|
|
expect(algo.create_copy_name(@name)).to eq short_name_copy_today_plus_1
|
|
|
|
expect(algo.create_copy_name(@name2)).to eq short_name_copy_today_plus_1
|
|
|
|
end
|
|
|
|
|
|
|
|
it 'one copy yesterday exists' do
|
|
|
|
@name = short_name_copy_yesterday
|
|
|
|
@name2 = short_name
|
|
|
|
event
|
|
|
|
event2
|
|
|
|
|
|
|
|
expect(algo.create_copy_name(@name2)).to eq short_name_copy_today
|
|
|
|
end
|
|
|
|
|
|
|
|
it 'errors when at max copies' do
|
|
|
|
@name = short_name
|
|
|
|
@copy_base = short_name_copy_today_base
|
|
|
|
event
|
|
|
|
events_at_max_copies
|
|
|
|
|
|
|
|
expect{ algo.create_copy_name(@name) }.to(raise_error{|error|
|
|
|
|
expect(error).to be_a ArgumentError
|
|
|
|
})
|
|
|
|
events_at_max_copies.each {|i|
|
|
|
|
expect {algo.create_copy_name(i.name)}.to(raise_error{|error|
|
|
|
|
expect(error).to be_a ArgumentError
|
|
|
|
})
|
|
|
|
}
|
|
|
|
end
|
|
|
|
|
|
|
|
end
|
|
|
|
|
|
|
|
describe 'long event names' do
|
|
|
|
|
|
|
|
it 'not a copy' do
|
|
|
|
@name = long_name
|
|
|
|
event
|
|
|
|
expect(algo.create_copy_name(@name)).to eq long_name_copy_today
|
|
|
|
end
|
|
|
|
it 'one copy exists' do
|
|
|
|
@name = long_name
|
|
|
|
@name2 = long_name_copy_today
|
|
|
|
event
|
|
|
|
event2
|
|
|
|
expect(algo.create_copy_name(@name)).to eq long_name_copy_today_plus_1
|
|
|
|
expect(algo.create_copy_name(@name2)).to eq long_name_copy_today_plus_1
|
|
|
|
end
|
|
|
|
|
|
|
|
it 'one copy yesterday exists' do
|
|
|
|
@name = long_name_copy_yesterday
|
|
|
|
@name2 = long_name
|
|
|
|
event
|
|
|
|
event2
|
|
|
|
|
|
|
|
expect(algo.create_copy_name(@name2)).to eq long_name_copy_today
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
|
|
it 'errors when at max copies' do
|
|
|
|
@name = long_name
|
|
|
|
@copy_base = long_name_copy_today_base
|
|
|
|
event
|
|
|
|
events_at_max_copies
|
|
|
|
|
|
|
|
expect{ algo.create_copy_name(@name) }.to(raise_error{|error|
|
|
|
|
expect(error).to be_a ArgumentError
|
|
|
|
})
|
|
|
|
events_at_max_copies.each {|i|
|
|
|
|
expect {algo.create_copy_name(i.name)}.to(raise_error{|error|
|
|
|
|
expect(error).to be_a ArgumentError
|
|
|
|
})
|
|
|
|
}
|
|
|
|
end
|
|
|
|
|
|
|
|
end
|
|
|
|
end
|
|
|
|
|
|
|
|
describe 'campaigns' do
|
|
|
|
let(:campaign) {force_create(:campaign, :name => @name, nonprofit: nonprofit)}
|
|
|
|
let(:campaign2) {force_create(:campaign, :name => @name2, nonprofit:nonprofit)}
|
|
|
|
let(:algo) {NameCopyNamingAlgorithm.new(Campaign, nonprofit.id)}
|
|
|
|
describe 'short campaign names' do
|
|
|
|
|
|
|
|
it 'not a copy' do
|
|
|
|
@name = short_name
|
|
|
|
campaign
|
|
|
|
expect(algo.create_copy_name(@name)).to eq short_name_copy_today
|
|
|
|
end
|
|
|
|
it 'one copy exists' do
|
|
|
|
@name = short_name
|
|
|
|
@name2 = short_name_copy_today
|
|
|
|
campaign
|
|
|
|
campaign2
|
|
|
|
expect(algo.create_copy_name(@name)).to eq short_name_copy_today_plus_1
|
|
|
|
expect(algo.create_copy_name(@name2)).to eq short_name_copy_today_plus_1
|
|
|
|
end
|
|
|
|
|
|
|
|
it 'one copy yesterday exists' do
|
|
|
|
@name = short_name_copy_yesterday
|
|
|
|
@name2 = short_name
|
|
|
|
campaign
|
|
|
|
campaign2
|
|
|
|
|
|
|
|
expect(algo.create_copy_name(@name2)).to eq short_name_copy_today
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
|
|
end
|
|
|
|
|
|
|
|
describe 'long campaign names' do
|
|
|
|
|
|
|
|
it 'not a copy' do
|
|
|
|
@name = long_name
|
|
|
|
campaign
|
|
|
|
expect(algo.create_copy_name(@name)).to eq long_name_copy_today
|
|
|
|
end
|
|
|
|
it 'one copy exists' do
|
|
|
|
@name = long_name
|
|
|
|
@name2 = long_name_copy_today
|
|
|
|
campaign
|
|
|
|
campaign2
|
|
|
|
expect(algo.create_copy_name(@name)).to eq long_name_copy_today_plus_1
|
|
|
|
expect(algo.create_copy_name(@name2)).to eq long_name_copy_today_plus_1
|
|
|
|
end
|
|
|
|
|
|
|
|
it 'one copy yesterday exists' do
|
|
|
|
@name = long_name_copy_yesterday
|
|
|
|
@name2 = long_name
|
|
|
|
campaign
|
|
|
|
campaign2
|
|
|
|
|
|
|
|
expect(algo.create_copy_name(@name2)).to eq long_name_copy_today
|
|
|
|
end
|
|
|
|
end
|
|
|
|
end
|
|
|
|
end
|
|
|
|
end
|
|
|
|
|