Produced by Araxis Merge on 4/2/2019 1:06:58 PM Central Daylight Time. See www.araxis.com for information about Merge. This report uses XHTML and CSS2, and is best viewed with a modern standards-compliant browser. For optimum results when printing this report, use landscape orientation and enable printing of background images and colours in your browser.
# | Location | File | Last Modified |
---|---|---|---|
1 | C:\AraxisMergeCompare\Pri_un\ARS_Backend\ars_app\src\test\java\gov\va\med\ewv\util | SetToSortedListTest.java | Wed Mar 27 19:21:16 2019 UTC |
2 | C:\AraxisMergeCompare\Pri_re\ARS_Backend\ars_app\src\test\java\gov\va\med\ewv\util | SetToSortedListTest.java | Thu Mar 28 17:51:22 2019 UTC |
Description | Between Files 1 and 2 |
|
---|---|---|
Text Blocks | Lines | |
Unchanged | 2 | 384 |
Changed | 1 | 2 |
Inserted | 0 | 0 |
Removed | 0 | 0 |
Whitespace | |
---|---|
Character case | Differences in character case are significant |
Line endings | Differences in line endings (CR and LF characters) are ignored |
CR/LF characters | Not shown in the comparison detail |
No regular expressions were active.
1 | /** | |
2 | * | |
3 | */ | |
4 | package go v.va.med.e wv.util; | |
5 | ||
6 | import sta tic org.ju nit.Assert .*; | |
7 | import jav a.util.Lis t; | |
8 | import jav a.util.Set ; | |
9 | import jav a.util.str eam.Collec tors; | |
10 | import jav a.util.str eam.IntStr eam; | |
11 | ||
12 | import org .junit.Tes t; | |
13 | ||
14 | /** | |
15 | * @author DNS BadgeB | |
16 | * | |
17 | */ | |
18 | public cla ss SetToSo rtedListTe st { | |
19 | ||
20 | pr ivate void show(Stri ng label, List<Integ er> stuff) { | |
21 | Syst em.out.pri nt(label + ": ["); | |
22 | if ( stuff == n ull) { | |
23 | System .out.print (stuff); | |
24 | } el se { | |
25 | int i = 0; | |
26 | for (O bject it : stuff) { | |
27 | System.o ut.print(i t); | |
28 | i++; | |
29 | if (i < stuff.size ()) { | |
30 | System.out .print(", "); | |
31 | } | |
32 | } | |
33 | } | |
34 | Syst em.out.pri ntln("]"); | |
35 | } | |
36 | ||
37 | pr ivate void show(Stri ng label, Set<Intege r> stuff) { | |
38 | Syst em.out.pri nt(label + ": ["); | |
39 | if ( stuff == n ull) { | |
40 | System .out.print (stuff); | |
41 | } el se { | |
42 | int i = 0; | |
43 | for (O bject it : stuff) { | |
44 | System.o ut.print(i t); | |
45 | i++; | |
46 | if (i < stuff.size ()) { | |
47 | System.out .print(", "); | |
48 | } | |
49 | } | |
50 | } | |
51 | Syst em.out.pri ntln("]"); | |
52 | } | |
53 | ||
54 | /* * | |
55 | * Test meth od for {@l ink gov.va .med.ewv.u til.SetToS ortedList# toSortedLi st(java.ut il.Set, ja va.util.Co mparator)} . | |
56 | * / | |
57 | @T est | |
58 | pu blic void testToSort edList() { | |
59 | // publ ic static <T> List<T > toSorted List(Set<T > set, Com parator<T> comparato r) { | |
60 | // if (se t == null) return Co llections. <T>emptyLi st(); | |
61 | // return set.strea m() | |
62 | // .sorted(co mparator) // Wha t will thi s match? | |
63 | // .collect(C ollectors. toList()); | |
64 | // } | |
65 | int[ ] iArr = { 3,1,4,1,5, 9,2,6,5,3, 5,8,9}; | |
66 | List <Integer> iList = In tStream.of (iArr) | |
67 | .boxed() .collect(C ollectors. toList()); | |
68 | List <Integer> iDistSorte d = IntStr eam.of(iAr r) | |
69 | .distinc t() | |
70 | .sorted( ) | |
71 | .boxed() .collect(C ollectors. toList()); | |
72 | Set< Integer> i Set = IntS tream.of(i Arr) | |
73 | .boxed() .collect(C ollectors. toSet()); | |
74 | ||
75 | asse rtEquals(i List.size( ), iArr.le ngth ); | |
76 | asse rtEquals(i DistSorted .size(), i Set.size() ); | |
77 | ||
78 | List <Integer> iSetToList = SetToSo rtedList.t oSortedLis t(iSet, In teger::com pare); | |
79 | asse rtEquals(i SetToList. size(), iS et.size()) ; | |
80 | asse rtEquals(i SetToList, iDistSort ed); | |
81 | } | |
82 | ||
83 | /* * | |
84 | * Test meth od for {@l ink gov.va .med.ewv.u til.SetToS ortedList# toNullsFir stList(jav a.util.Set , java.uti l.Comparat or)}. | |
85 | * / | |
86 | @T est | |
87 | pu blic void testToNull sFirstList () { | |
88 | ||
89 | // H ere, we mu st also ha ve some nu lls to tes t. | |
90 | // B ut you can only have one null in a set! | |
91 | ||
92 | int[ ] iArr = { 3,1,4,1,5, 9,2,6,5,3, 5,8,9}; // Ver y specific , do not c hange | |
93 | List <Integer> iDist1 = I ntStream.o f(iArr) | |
94 | .distinc t() // {3,1,4,5, 9,2,6,8} | |
95 | .sorted( ) // {1,2,3,4, 5,6,8,9} | |
96 | .boxed() // Integer({ 1,2,3,4,5, 6,8,9}) | |
97 | .map((iv ) -> { ret urn iv.equ als(1) ? n ull : iv; }) // convert I nteger(1) to null (a t beginnin g) | |
98 | .collect (Collector s.toList() ); // {nu ll, Intege r(2), Inte ger(3), In teger(4), Integer(5) , Integer( 6), Intege r(8), Inte ger(9)} | |
99 | ||
100 | List <Integer> iDist9 = I ntStream.o f(iArr) | |
101 | .distinc t() | |
102 | .sorted( ) | |
103 | .boxed() | |
104 | .map((iv ) -> { ret urn iv.equ als(9) ? n ull : iv; }) // convert I nteger(9) to null at end | |
105 | .collect (Collector s.toList() ); // {In teger(1), Integer(2) , Integer( 3), Intege r(4), Inte ger(5), In teger(6), Integer(8) , null} | |
106 | ||
107 | Set< Integer> i Set1 = Int Stream.of( iArr) | |
108 | .boxed() | |
109 | .map((iv ) -> { ret urn iv.equ als(1) ? n ull : iv; }) // convert I nteger(1) to null | |
110 | .collect (Collector s.toSet()) ; // You can put a null in a set | |
111 | ||
112 | Set< Integer> i Set9 = Int Stream.of( iArr) | |
113 | .boxed() | |
114 | .map((iv ) -> { ret urn iv.equ als(9) ? n ull : iv; }) // convert I nteger(9) to null | |
115 | .collect (Collector s.toSet()) ; | |
116 | ||
117 | // V erify setu p | |
118 | asse rtEquals(i Dist1.size (), iSet1. size()); | |
119 | asse rtEquals(i Dist9.size (), iSet9. size()); | |
120 | ||
121 | List <Integer> iSetList1 = SetToSor tedList.to NullsFirst List(iSet1 , Integer: :compare); | |
122 | List <Integer> iSetList9 = SetToSor tedList.to NullsFirst List(iSet9 , Integer: :compare); | |
123 | ||
124 | // S how result s | |
125 | show ("iDist1", iDist1); | |
126 | show ("iDist9", iDist9); | |
127 | show ("iSet1", iSet1); | |
128 | show ("iSet9", iSet9); | |
129 | show ("iSetList 1", iSetLi st1); | |
130 | show ("iSetList 9", iSetLi st9); | |
131 | ||
132 | asse rtEquals(i Dist1.size (), iSetLi st1.size() ); | |
133 | asse rtEquals(i Dist9.size (), iSetLi st9.size() ); | |
134 | ||
135 | asse rtEquals(i Dist1, iSe tList1); // S ince null is first | |
136 | asse rtNotEqual s(iDist9, iSetList9) ; // S ince null is last | |
137 | } | |
138 | ||
139 | /* * | |
140 | * Test meth od for {@l ink gov.va .med.ewv.u til.SetToS ortedList# toNullsLas tList(java .util.Set, java.util .Comparato r)}. | |
141 | * / | |
142 | @T est | |
143 | pu blic void testToNull sLastList( ) { | |
144 | // H ere, we mu st also ha ve some nu lls to tes t. | |
145 | // B ut you can only have one null in a set! | |
146 | ||
147 | int[ ] iArr = { 3,1,4,1,5, 9,2,6,5,3, 5,8,9}; // Ver y specific , do not c hange | |
148 | List <Integer> iDist1 = I ntStream.o f(iArr) | |
149 | .distinc t() | |
150 | .sorted( ) | |
151 | .boxed() | |
152 | .map((iv ) -> { ret urn iv.equ als(1) ? n ull : iv; }) // convert I nteger(1) to null (a t beginnin g) | |
153 | .collect (Collector s.toList() ); | |
154 | ||
155 | List <Integer> iDist9 = I ntStream.o f(iArr) | |
156 | .distinc t() | |
157 | .sorted( ) | |
158 | .boxed() | |
159 | .map((iv ) -> { ret urn iv.equ als(9) ? n ull : iv; }) // convert I nteger(9) to null at end | |
160 | .collect (Collector s.toList() ); | |
161 | ||
162 | Set< Integer> i Set1 = Int Stream.of( iArr) | |
163 | .boxed() | |
164 | .map((iv ) -> { ret urn iv.equ als(1) ? n ull : iv; }) // convert I nteger(1) to null | |
165 | .collect (Collector s.toSet()) ; | |
166 | ||
167 | Set< Integer> i Set9 = Int Stream.of( iArr) | |
168 | .boxed() | |
169 | .map((iv ) -> { ret urn iv.equ als(9) ? n ull : iv; }) // convert I nteger(9) to null | |
170 | .collect (Collector s.toSet()) ; | |
171 | // V erify setu p | |
172 | asse rtEquals(i Dist1.size (), iSet1. size()); | |
173 | asse rtEquals(i Dist9.size (), iSet9. size()); | |
174 | ||
175 | List <Integer> iSetList1 = SetToSor tedList.to NullsLastL ist(iSet1, Integer:: compare); | |
176 | List <Integer> iSetList9 = SetToSor tedList.to NullsLastL ist(iSet9, Integer:: compare); | |
177 | ||
178 | // S how result s | |
179 | show ("iDist1", iDist1); | |
180 | show ("iDist9", iDist9); | |
181 | show ("iSet1", iSet1); | |
182 | show ("iSet9", iSet9); | |
183 | show ("iSetList 1", iSetLi st1); | |
184 | show ("iSetList 9", iSetLi st9); | |
185 | ||
186 | asse rtEquals(i Dist1.size (), iSetLi st1.size() ); | |
187 | asse rtEquals(i Dist9.size (), iSetLi st9.size() ); | |
188 | ||
189 | asse rtNotEqual s(iDist1, iSetList1) ; // S ince null is first i n iDist1, but last i n iSetList 1 | |
190 | asse rtEquals(i Dist9, iSe tList9); // S ince null is last i n iDist9, and last i n iSetList 9 | |
191 | } | |
192 | ||
193 | } |
Araxis Merge (but not the data content of this report) is Copyright © 1993-2016 Araxis Ltd (www.araxis.com). All rights reserved.