X-Git-Url: https://git.heureux-cyclage.org/?a=blobdiff_plain;f=includes%2Fparser%2FPreprocessor_Hash.php;h=8e84cb2c823617c625071ccef7cb42f71c883e6f;hb=9404f8a589a9eed548da33fbfbcb12d3038e59e0;hp=597d1f231cce440be22fbd2db072af4a1a2f32b4;hpb=fb742a3a8eb951c91544e70fe09b63b1bac6aec5;p=lhc%2Fweb%2Fwiklou.git

diff --git a/includes/parser/Preprocessor_Hash.php b/includes/parser/Preprocessor_Hash.php
index 597d1f231c..8e84cb2c82 100644
--- a/includes/parser/Preprocessor_Hash.php
+++ b/includes/parser/Preprocessor_Hash.php
@@ -304,7 +304,6 @@ class Preprocessor_Hash extends Preprocessor {
 				}
 				// Handle comments
 				if ( isset( $matches[2] ) && $matches[2] == '!--' ) {
-
 					// To avoid leaving blank lines, when a sequence of
 					// space-separated comments is both preceded and followed by
 					// a newline (ignoring spaces), then
@@ -570,7 +569,7 @@ class Preprocessor_Hash extends Preprocessor {
 				$curLen = strlen( $curChar );
 				$count = ( $curLen > 1 ) ?
 					# allow the final character to repeat
-					strspn( $text, $curChar[$curLen-1], $i+1 ) + 1 :
+					strspn( $text, $curChar[$curLen - 1], $i + 1 ) + 1 :
 					strspn( $text, $curChar, $i );
 
 				# we need to add to stack only if opening brace count is enough for one of the rules
@@ -1716,7 +1715,7 @@ class PPNode_Hash_Tree implements PPNode {
 	 * store array can be accessed via getNextSibling().
 	 *
 	 * @param array $store
-	 * @param integer $index
+	 * @param int $index
 	 */
 	public function __construct( array $store, $index ) {
 		$this->store = $store;
@@ -1729,7 +1728,7 @@ class PPNode_Hash_Tree implements PPNode {
 	 * on what is at the relevant store index.
 	 *
 	 * @param array $store
-	 * @param integer $index
+	 * @param int $index
 	 * @return PPNode_Hash_Tree|PPNode_Hash_Attr|PPNode_Hash_Text
 	 */
 	public static function factory( array $store, $index ) {
@@ -1788,7 +1787,7 @@ class PPNode_Hash_Tree implements PPNode {
 	 * return a temporary proxy object: different instances will be returned
 	 * if this is called more than once on the same node.
 	 *
-	 * @return PPNode_Hash_Tree|PPNode_Hash_Attr|PPNode_Hash_Text|boolean
+	 * @return PPNode_Hash_Tree|PPNode_Hash_Attr|PPNode_Hash_Text|bool
 	 */
 	public function getFirstChild() {
 		if ( !isset( $this->rawChildren[0] ) ) {
@@ -1803,7 +1802,7 @@ class PPNode_Hash_Tree implements PPNode {
 	 * return a temporary proxy object: different instances will be returned
 	 * if this is called more than once on the same node.
 	 *
-	 * @return PPNode_Hash_Tree|PPNode_Hash_Attr|PPNode_Hash_Text|boolean
+	 * @return PPNode_Hash_Tree|PPNode_Hash_Attr|PPNode_Hash_Text|bool
 	 */
 	public function getNextSibling() {
 		return self::factory( $this->store, $this->index + 1 );
@@ -2028,7 +2027,7 @@ class PPNode_Hash_Text implements PPNode {
 	 * store array can be accessed via getNextSibling().
 	 *
 	 * @param array $store
-	 * @param integer $index
+	 * @param int $index
 	 */
 	public function __construct( array $store, $index ) {
 		$this->value = $store[$index];
@@ -2157,7 +2156,7 @@ class PPNode_Hash_Attr implements PPNode {
 	 * store array can be accessed via getNextSibling().
 	 *
 	 * @param array $store
-	 * @param integer $index
+	 * @param int $index
 	 */
 	public function __construct( array $store, $index ) {
 		$descriptor = $store[$index];