| Index: trunk/phase3/includes/diff/DairikiDiff.php |
| — | — | @@ -185,8 +185,8 @@ |
| 186 | 186 | $edits = array(); |
| 187 | 187 | $xi = $yi = 0; |
| 188 | 188 | while ( $xi < $n_from || $yi < $n_to ) { |
| 189 | | - assert( $yi < $n_to || $this->xchanged[$xi] ); |
| 190 | | - assert( $xi < $n_from || $this->ychanged[$yi] ); |
| | 189 | + assert( '$yi < $n_to || $this->xchanged[$xi]' ); |
| | 190 | + assert( '$xi < $n_from || $this->ychanged[$yi]' ); |
| 191 | 191 | |
| 192 | 192 | // Skip matching "snake". |
| 193 | 193 | $copy = array(); |
| — | — | @@ -374,14 +374,14 @@ |
| 375 | 375 | while ( list( , $y ) = each( $matches ) ) { |
| 376 | 376 | if ( empty( $this->in_seq[$y] ) ) { |
| 377 | 377 | $k = $this->_lcs_pos( $y ); |
| 378 | | - assert( $k > 0 ); |
| | 378 | + assert( '$k > 0' ); |
| 379 | 379 | $ymids[$k] = $ymids[$k -1]; |
| 380 | 380 | break; |
| 381 | 381 | } |
| 382 | 382 | } |
| 383 | 383 | while ( list ( , $y ) = each( $matches ) ) { |
| 384 | 384 | if ( $y > $this->seq[$k -1] ) { |
| 385 | | - assert( $y < $this->seq[$k] ); |
| | 385 | + assert( '$y < $this->seq[$k]' ); |
| 386 | 386 | // Optimization: this is a common case: |
| 387 | 387 | // next match is just replacing previous match. |
| 388 | 388 | $this->in_seq[$this->seq[$k]] = false; |
| — | — | @@ -389,7 +389,7 @@ |
| 390 | 390 | $this->in_seq[$y] = 1; |
| 391 | 391 | } elseif ( empty( $this->in_seq[$y] ) ) { |
| 392 | 392 | $k = $this->_lcs_pos( $y ); |
| 393 | | - assert( $k > 0 ); |
| | 393 | + assert( '$k > 0' ); |
| 394 | 394 | $ymids[$k] = $ymids[$k -1]; |
| 395 | 395 | } |
| 396 | 396 | } |
| — | — | @@ -430,7 +430,7 @@ |
| 431 | 431 | } |
| 432 | 432 | } |
| 433 | 433 | |
| 434 | | - assert( $ypos != $this->seq[$end] ); |
| | 434 | + assert( '$ypos != $this->seq[$end]' ); |
| 435 | 435 | |
| 436 | 436 | $this->in_seq[$this->seq[$end]] = false; |
| 437 | 437 | $this->seq[$end] = $ypos; |
| — | — | @@ -814,8 +814,8 @@ |
| 815 | 815 | $mapped_from_lines, $mapped_to_lines ) { |
| 816 | 816 | wfProfileIn( __METHOD__ ); |
| 817 | 817 | |
| 818 | | - assert( sizeof( $from_lines ) == sizeof( $mapped_from_lines ) ); |
| 819 | | - assert( sizeof( $to_lines ) == sizeof( $mapped_to_lines ) ); |
| | 818 | + assert( 'sizeof( $from_lines ) == sizeof( $mapped_from_lines )' ); |
| | 819 | + assert( 'sizeof( $to_lines ) == sizeof( $mapped_to_lines )' ); |
| 820 | 820 | |
| 821 | 821 | parent::__construct( $mapped_from_lines, $mapped_to_lines ); |
| 822 | 822 | |
| — | — | @@ -1205,7 +1205,7 @@ |
| 1206 | 1206 | $this->_flushLine( $tag ); |
| 1207 | 1207 | $word = substr( $word, 1 ); |
| 1208 | 1208 | } |
| 1209 | | - assert( !strstr( $word, "\n" ) ); |
| | 1209 | + assert( '!strstr( $word, "\n" )' ); |
| 1210 | 1210 | $this->_group .= $word; |
| 1211 | 1211 | } |
| 1212 | 1212 | } |
| Index: trunk/phase3/includes/parser/Preprocessor_Hash.php |
| — | — | @@ -428,7 +428,7 @@ |
| 429 | 429 | } elseif ( $found == 'line-end' ) { |
| 430 | 430 | $piece = $stack->top; |
| 431 | 431 | // A heading must be open, otherwise \n wouldn't have been in the search list |
| 432 | | - assert( $piece->open == "\n" ); |
| | 432 | + assert( '$piece->open == "\n"' ); |
| 433 | 433 | $part = $piece->getCurrentPart(); |
| 434 | 434 | // Search back through the input to see if it has a proper close |
| 435 | 435 | // Do this using the reversed string since the other solutions (end anchor, etc.) are inefficient |
| Index: trunk/phase3/includes/parser/Preprocessor_HipHop.hphp |
| — | — | @@ -444,7 +444,7 @@ |
| 445 | 445 | } elseif ( $found === 'line-end' ) { |
| 446 | 446 | $piece = $stack->getTop(); |
| 447 | 447 | // A heading must be open, otherwise \n wouldn't have been in the search list |
| 448 | | - assert( $piece->open === "\n" ); |
| | 448 | + assert( '$piece->open === "\n"' ); |
| 449 | 449 | $part = $piece->getCurrentPart(); |
| 450 | 450 | // Search back through the input to see if it has a proper close |
| 451 | 451 | // Do this using the reversed string since the other solutions (end anchor, etc.) are inefficient |
| Index: trunk/phase3/includes/parser/Preprocessor_DOM.php |
| — | — | @@ -479,7 +479,7 @@ |
| 480 | 480 | } elseif ( $found == 'line-end' ) { |
| 481 | 481 | $piece = $stack->top; |
| 482 | 482 | // A heading must be open, otherwise \n wouldn't have been in the search list |
| 483 | | - assert( $piece->open == "\n" ); |
| | 483 | + assert( '$piece->open == "\n"' ); |
| 484 | 484 | $part = $piece->getCurrentPart(); |
| 485 | 485 | // Search back through the input to see if it has a proper close |
| 486 | 486 | // Do this using the reversed string since the other solutions (end anchor, etc.) are inefficient |