Produced by Araxis Merge on 4/26/2019 10:01:16 AM 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\CCCC\CCCC\seoc-ui1.8\cc_seoc_ui\src\utils | decodeString.spec.js | Tue Apr 9 17:46:26 2019 UTC |
2 | C:\AraxisMergeCompare\Pri_re\CCCC\CCCC\seoc-ui1.8\cc_seoc_ui\src\utils | decodeString.spec.js | Wed Apr 24 20:10:36 2019 UTC |
Description | Between Files 1 and 2 |
|
---|---|---|
Text Blocks | Lines | |
Unchanged | 22 | 310 |
Changed | 21 | 62 |
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 | import dec odeString, { decodeB illingCode s, decodeU sers } fro m './decod eString'; | |
2 | ||
3 | describe(' decodeStri ng functio ns', () => { | |
4 | describe ('decodeSt ring', () => { | |
5 | it('sh ould retur n an empty string if no string is given' , () => { | |
6 | cons t actual = decodeStr ing(); | |
7 | cons t expected = ''; | |
8 | ||
9 | expe ct(actual) .toEqual(e xpected); | |
10 | }); | |
11 | ||
12 | it('sh ould corre ctly decod e a given string', ( ) => { | |
13 | cons t actual = decodeStr ing('Test String &#x 7e;!& #x40;# ;$&#x 25;^& *()_+` ;-={} |[]:" ;\'<> ;?,./'); | |
14 | cons t expected = 'Test S tring ~!@# $%^&*()_+` -={}|[]:"; \'<>?,./'; | |
15 | ||
16 | expe ct(actual) .toEqual(e xpected); | |
17 | }); | |
18 | }); | |
19 | ||
20 | describe ('decodeBi llingCodes ', () => { | |
21 | it('sh ould retur n an empty array if no billing Codes are given', () => { | |
22 | cons t actual = decodeBil lingCodes( ); | |
23 | cons t expected = []; | |
24 | ||
25 | expe ct(actual) .toEqual(e xpected); | |
26 | }); | |
27 | ||
28 | it('sh ould corre ctly decod e the list of billin gCodes', ( ) => { | |
29 | cons t billingC odes = [ | |
30 | { | |
31 | billingCod e: '12345' , | |
32 | codeType: 'CPT', | |
33 | descriptio n: 'code d escription ', | |
34 | precertReq uired: fal se | |
35 | }, | |
36 | { | |
37 | billingCod e: 'abcde' , | |
38 | codeType: 'DRG', | |
39 | descriptio n: 'code d escription ', | |
40 | precertReq uired: fal se | |
41 | }, | |
42 | { | |
43 | billingCod e: 'h~ ;!&#x 40;#' , | |
44 | codeType: 'DRG', | |
45 | descriptio n: 'code d escription ', | |
46 | precertReq uired: fal se | |
47 | }, | |
48 | { | |
49 | billingCod e: '23456' , | |
50 | codeType: 'HCPCS', | |
51 | descriptio n: '~ ! 0;# c ode descri ption', | |
52 | precertReq uired: fal se | |
53 | }, | |
54 | { | |
55 | billingCod e: 'e~ ;!&#x 40;#' , | |
56 | codeType: 'CPT', | |
57 | descriptio n: '~ ! 0;# d escription ', | |
58 | precertReq uired: fal se | |
59 | } | |
60 | ]; | |
61 | ||
62 | cons t actual = decodeBil lingCodes( billingCod es); | |
63 | cons t expected = [ | |
64 | { | |
65 | billingCod e: '12345' , | |
66 | codeType: 'CPT', | |
67 | descriptio n: 'code d escription ', | |
68 | precertReq uired: fal se | |
69 | }, | |
70 | { | |
71 | billingCod e: 'ABCDE' , | |
72 | codeType: 'DRG', | |
73 | descriptio n: 'code d escription ', | |
74 | precertReq uired: fal se | |
75 | }, | |
76 | { | |
77 | billingCod e: 'H~!@#' , | |
78 | codeType: 'DRG', | |
79 | descriptio n: 'code d escription ', | |
80 | precertReq uired: fal se | |
81 | }, | |
82 | { | |
83 | billingCod e: '23456' , | |
84 | codeType: 'HCPCS', | |
85 | descriptio n: '~!@# c ode descri ption', | |
86 | precertReq uired: fal se | |
87 | }, | |
88 | { | |
89 | billingCod e: 'E~!@#' , | |
90 | codeType: 'CPT', | |
91 | descriptio n: '~!@# d escription ', | |
92 | precertReq uired: fal se | |
93 | } | |
94 | ]; | |
95 | ||
96 | expe ct(actual) .toEqual(e xpected); | |
97 | }); | |
98 | }); | |
99 | ||
100 | describe ('decodeUs ers', () = > { | |
101 | it('sh ould retur n an empty array if no users a re given', () => { | |
102 | cons t actual = decodeUse rs(); | |
103 | cons t expected = []; | |
104 | ||
105 | expe ct(actual) .toEqual(e xpected); | |
106 | }); | |
107 | ||
108 | it('sh ould corre ctly decod e the list of users' , () => { | |
109 | cons t users = [ | |
110 | { | |
111 | userName: ' AI ', | |
112 | role: 'Vie wer', | |
113 | vaNetworkI d: ' AI ', | |
114 | domain: '
|
|
115 | }, | |
116 | { | |
117 | userName: ' AI ', | |
118 | role: 'Aut hor', | |
119 | vaNetworkI d: ' A I
|
|
120 | domain: '
|
|
121 | }, | |
122 | { | |
123 | userName: ' AI ', | |
124 | role: 'Pub lisher', | |
125 | vaNetworkI d: ' A I
|
|
126 | domain: '
|
|
127 | }, | |
128 | { | |
129 | userName: ' AI ', | |
130 | role: 'Adm inistrator ', | |
131 | vaNetworkI d: ' A I
|
|
132 | domain: ' EXT ' | |
133 | }, | |
134 | { | |
135 | userName: ' AI ', | |
136 | role: 'Adm inistrator ', | |
137 | vaNetworkI d: ' A I
|
|
138 | domain: ' EXT ' | |
139 | }, | |
140 | {} | |
141 | ]; | |
142 | ||
143 | cons t actual = decodeUse rs(users); | |
144 | cons t expected = [ | |
145 | { | |
146 | userName: ' AI ', | |
147 | role: 'VIE WER', | |
148 | vaNetworkI d: ' AI ', | |
149 | domain: '
|
|
150 | }, | |
151 | { | |
152 | userName: ' AI ', | |
153 | role: 'AUT HOR', | |
154 | vaNetworkI d: ' A I
|
|
155 | domain: '
|
|
156 | }, | |
157 | { | |
158 | userName: ' AI ', | |
159 | role: 'PUB LISHER', | |
160 | vaNetworkI d: ' A I
|
|
161 | domain: '
|
|
162 | }, | |
163 | { | |
164 | userName: ' AI ', | |
165 | role: 'ADM INISTRATOR ', | |
166 | vaNetworkI d: ' A I
|
|
167 | domain: '
|
|
168 | }, | |
169 | { | |
170 | userName: ' AI ', | |
171 | role: 'ADM INISTRATOR ', | |
172 | vaNetworkI d: ' A I
|
|
173 | domain: '
|
|
174 | }, | |
175 | { | |
176 | userName: ' AI ', | |
177 | role: '', | |
178 | vaNetworkI d: '', | |
179 | domain: '' | |
180 | } | |
181 | ]; | |
182 | ||
183 | expe ct(actual) .toEqual(e xpected); | |
184 | }); | |
185 | }); | |
186 | }); |
Araxis Merge (but not the data content of this report) is Copyright © 1993-2016 Araxis Ltd (www.araxis.com). All rights reserved.