@@ -81,25 +81,23 @@ public function __construct($header = "--- Original\n+++ New\n")
81
81
public function diff ($ from , $ to )
82
82
{
83
83
$ buffer = $ this ->header ;
84
- $ diff = $ this ->diffToArray ($ from ,$ to );
84
+ $ diff = $ this ->diffToArray ($ from , $ to );
85
85
86
- $ inOld = FALSE ;
86
+ $ inOld = false ;
87
87
$ i = 0 ;
88
88
$ old = array ();
89
89
90
90
foreach ($ diff as $ line ) {
91
91
if ($ line [1 ] === 0 /* OLD */ ) {
92
- if ($ inOld === FALSE ) {
92
+ if ($ inOld === false ) {
93
93
$ inOld = $ i ;
94
94
}
95
- }
96
-
97
- else if ($ inOld !== FALSE ) {
95
+ } elseif ($ inOld !== false ) {
98
96
if (($ i - $ inOld ) > 5 ) {
99
97
$ old [$ inOld ] = $ i - 1 ;
100
98
}
101
99
102
- $ inOld = FALSE ;
100
+ $ inOld = false ;
103
101
}
104
102
105
103
++$ i ;
@@ -112,29 +110,25 @@ public function diff($from, $to)
112
110
$ end = $ tmp ;
113
111
}
114
112
115
- $ newChunk = TRUE ;
113
+ $ newChunk = true ;
116
114
117
115
for ($ i = $ start ; $ i < $ end ; $ i ++) {
118
116
if (isset ($ old [$ i ])) {
119
117
$ buffer .= "\n" ;
120
- $ newChunk = TRUE ;
118
+ $ newChunk = true ;
121
119
$ i = $ old [$ i ];
122
120
}
123
121
124
122
if ($ newChunk ) {
125
123
$ buffer .= "@@ @@ \n" ;
126
- $ newChunk = FALSE ;
124
+ $ newChunk = false ;
127
125
}
128
126
129
127
if ($ diff [$ i ][1 ] === 1 /* ADDED */ ) {
130
128
$ buffer .= '+ ' . $ diff [$ i ][0 ] . "\n" ;
131
- }
132
-
133
- else if ($ diff [$ i ][1 ] === 2 /* REMOVED */ ) {
129
+ } elseif ($ diff [$ i ][1 ] === 2 /* REMOVED */ ) {
134
130
$ buffer .= '- ' . $ diff [$ i ][0 ] . "\n" ;
135
- }
136
-
137
- else {
131
+ } else {
138
132
$ buffer .= ' ' . $ diff [$ i ][0 ] . "\n" ;
139
133
}
140
134
}
@@ -197,7 +191,8 @@ public function diffToArray($from, $to)
197
191
}
198
192
199
193
$ common = $ this ->longestCommonSubsequence (
200
- array_values ($ from ), array_values ($ to )
194
+ array_values ($ from ),
195
+ array_values ($ to )
201
196
);
202
197
203
198
$ diff = array ();
@@ -232,11 +227,11 @@ public function diffToArray($from, $to)
232
227
array_shift ($ to );
233
228
}
234
229
235
- while (($ token = array_shift ($ from )) !== NULL ) {
230
+ while (($ token = array_shift ($ from )) !== null ) {
236
231
$ diff [] = array ($ token , 2 /* REMOVED */ );
237
232
}
238
233
239
- while (($ token = array_shift ($ to )) !== NULL ) {
234
+ while (($ token = array_shift ($ to )) !== null ) {
240
235
$ diff [] = array ($ token , 1 /* ADDED */ );
241
236
}
242
237
@@ -272,9 +267,9 @@ private function longestCommonSubsequence(array $from, array $to)
272
267
for ($ i = 1 ; $ i <= $ fromLength ; ++$ i ) {
273
268
for ($ j = 1 ; $ j <= $ toLength ; ++$ j ) {
274
269
$ matrix [$ i ][$ j ] = max (
275
- $ matrix [$ i -1 ][$ j ],
276
- $ matrix [$ i ][$ j -1 ],
277
- $ from [$ i -1 ] === $ to [$ j -1 ] ? $ matrix [$ i -1 ][$ j -1 ] + 1 : 0
270
+ $ matrix [$ i -1 ][$ j ],
271
+ $ matrix [$ i ][$ j -1 ],
272
+ $ from [$ i -1 ] === $ to [$ j -1 ] ? $ matrix [$ i -1 ][$ j -1 ] + 1 : 0
278
273
);
279
274
}
280
275
}
@@ -287,13 +282,9 @@ private function longestCommonSubsequence(array $from, array $to)
287
282
array_unshift ($ common , $ from [$ i -1 ]);
288
283
--$ i ;
289
284
--$ j ;
290
- }
291
-
292
- else if ($ matrix [$ i ][$ j -1 ] > $ matrix [$ i -1 ][$ j ]) {
285
+ } elseif ($ matrix [$ i ][$ j -1 ] > $ matrix [$ i -1 ][$ j ]) {
293
286
--$ j ;
294
- }
295
-
296
- else {
287
+ } else {
297
288
--$ i ;
298
289
}
299
290
}
0 commit comments