spec/locale_tree/siblings_spec.rb in i18n-tasks-0.5.4 vs spec/locale_tree/siblings_spec.rb in i18n-tasks-0.6.0

- old
+ new

@@ -8,16 +8,16 @@ children = I18n::Tasks::Data::Tree::Siblings.from_key_attr([['a', value: 1]]) node = I18n::Tasks::Data::Tree::Node.new( key: 'fr', children: children ) - expect(node.to_siblings.first.children.first.parent.key).to eq 'fr' + expect(node.to_siblings.first.children.parent.key).to eq 'fr' end end context 'a tree' do - let(:a_hash) { {a: 1, b: {ba: 1, bb: 2}}.deep_stringify_keys } + let(:a_hash) { {'a' => 1, 'b' => {'ba' => 1, 'bb' => 2}} } it '::from_nested_hash' do a = build_tree(a_hash) expect(a.to_hash).to eq(a_hash) end @@ -32,23 +32,60 @@ expect(b.to_hash).to eq(a_hash.merge('c' => 1)) end it '#merge' do a = build_tree(a_hash) - b_hash = {b: {bc: 1}, c: 1}.deep_stringify_keys + b_hash = {'b' => {'bc' => 1}, 'c' => 1} expect(a.merge(build_tree(b_hash)).to_hash).to eq(a_hash.deep_merge(b_hash)) end + it '#merge does not modify self' do + a = build_tree(a: 1) + b = build_tree(a: 2) + c = a.merge b + expect(a['a'].value).to eq 1 + expect(c['a'].value).to eq 2 + expect(b['a'].value).to eq 2 + end + + it '#merge conflict value <- scope' do + a = build_tree(a: 1) + b = build_tree(a: {b: 1}) + expect { silence_stderr { a.merge(b) } }.to_not raise_error + end + + it '#set conflict value <- scope' do + a = build_tree(a: 1) + expect { silence_stderr { a.set('a.b', build_node(key: 'b', value: 1)) } }.to_not raise_error + end + it '#intersect' do x = {a: 1, b: {ba: 1, bb: 2}} y = {b: {ba: 1, bc: 3}, c: 1} - intersection = {b: {ba: 1}}.deep_stringify_keys + intersection = {'b' => {'ba' => 1}} a = build_tree(x) b = build_tree(y) expect(a.intersect_keys(b, root: true).to_hash).to eq(intersection) end it '#select_keys' do expect(build_tree(a: 1, b: 1).select_keys {|k, node| k == 'b'}.to_hash).to eq({'b' => 1}) + end + + it '#append!' do + expect(build_tree({'a' => 1}).append!(build_node(key: 'b', value: 2)).to_hash).to eq('a' => 1, 'b' => 2) + end + + it '#set replace value' do + expect(build_tree(a: {b: 1}).tap {|t| t['a.b'] = build_node(key: 'b', value: 2) }.to_hash).to( + eq('a' => {'b' => 2}) + ) + end + + it '#set get' do + t = build_tree(a: {x: 1}) + node = build_node(key: 'd', value: 'e') + t['a.b.c.' + node.key] = node + expect(t['a.b.c.d'].value).to eq('e') end end end