@@ -15,7 +15,37 @@ public void givenCaseInsensitiveTreeMap_whenTwoEntriesAdded_thenSizeIsOne(){
1515 treeMap .put ("abc" , 1 );
1616 treeMap .put ("ABC" , 2 );
1717
18- assertEquals (treeMap .size (), 1 );
18+ assertEquals (1 , treeMap .size ());
19+
20+ }
21+
22+ @ Test
23+ public void givenCommonsCaseInsensitiveMap_whenTwoEntriesAdded_thenSizeIsOne (){
24+ CaseInsensitiveMap <String , Integer > commonsHashMap = new CaseInsensitiveMap <>();
25+ commonsHashMap .put ("abc" , 1 );
26+ commonsHashMap .put ("ABC" , 2 );
27+
28+ assertEquals (1 , commonsHashMap .size ());
29+
30+ }
31+
32+ @ Test
33+ public void givenLinkedCaseInsensitiveMap_whenTwoEntriesAdded_thenSizeIsOne (){
34+ LinkedCaseInsensitiveMap <Integer > linkedHashMap = new LinkedCaseInsensitiveMap <>();
35+ linkedHashMap .put ("abc" , 1 );
36+ linkedHashMap .put ("ABC" , 2 );
37+
38+ assertEquals (1 , linkedHashMap .size ());
39+
40+ }
41+
42+ @ Test
43+ public void givenCaseInsensitiveTreeMap_whenSameEntryAdded_thenValueUpdated (){
44+ TreeMap <String , Integer > treeMap = new TreeMap <>(String .CASE_INSENSITIVE_ORDER );
45+ treeMap .put ("abc" , 1 );
46+ treeMap .put ("ABC" , 2 );
47+
48+ Assert .assertEquals ((Integer )2 , treeMap .get ("aBc" ));
1949 }
2050
2151 @ Test
@@ -24,7 +54,34 @@ public void givenCommonsCaseInsensitiveMap_whenSameEntryAdded_thenValueUpdated()
2454 commonsHashMap .put ("abc" , 1 );
2555 commonsHashMap .put ("ABC" , 2 );
2656
27- Assert .assertEquals (commonsHashMap .get ("aBc" ), (Integer )2 );
57+ Assert .assertEquals ((Integer )2 , commonsHashMap .get ("aBc" ));
58+ }
59+
60+ @ Test
61+ public void givenLinkedCaseInsensitiveMap_whenSameEntryAdded_thenValueUpdated (){
62+ LinkedCaseInsensitiveMap <Integer > linkedHashMap = new LinkedCaseInsensitiveMap <>();
63+ linkedHashMap .put ("abc" , 1 );
64+ linkedHashMap .put ("ABC" , 2 );
65+
66+ Assert .assertEquals ((Integer )2 , linkedHashMap .get ("aBc" ));
67+ }
68+
69+ @ Test
70+ public void givenCaseInsensitiveTreeMap_whenEntryRemoved_thenSizeIsZero (){
71+ TreeMap <String , Integer > treeMap = new TreeMap <>(String .CASE_INSENSITIVE_ORDER );
72+ treeMap .put ("abc" , 3 );
73+ treeMap .remove ("aBC" );
74+
75+ Assert .assertEquals (0 , treeMap .size ());
76+ }
77+
78+ @ Test
79+ public void givenCommonsCaseInsensitiveMap_whenEntryRemoved_thenSizeIsZero (){
80+ CaseInsensitiveMap <String , Integer > commonsHashMap = new CaseInsensitiveMap <>();
81+ commonsHashMap .put ("abc" , 3 );
82+ commonsHashMap .remove ("aBC" );
83+
84+ Assert .assertEquals (0 , commonsHashMap .size ());
2885 }
2986
3087 @ Test
@@ -33,6 +90,6 @@ public void givenLinkedCaseInsensitiveMap_whenEntryRemoved_thenSizeIsZero(){
3390 linkedHashMap .put ("abc" , 3 );
3491 linkedHashMap .remove ("aBC" );
3592
36- Assert .assertEquals (linkedHashMap .size (), 0 );
93+ Assert .assertEquals (0 , linkedHashMap .size ());
3794 }
3895}
0 commit comments