@@ -86,7 +86,7 @@ discard block |
||
86 | 86 | // we will switch this into a binary bitset |
87 | 87 | if ($this->enumerationCount > \PHP_INT_SIZE * 8) { |
88 | 88 | // init binary bitset with zeros |
89 | - $this->bitset = $this->emptyBitset = \str_repeat("\0", (int)\ceil($this->enumerationCount / 8)); |
|
89 | + $this->bitset = $this->emptyBitset = \str_repeat("\0", (int) \ceil($this->enumerationCount / 8)); |
|
90 | 90 | |
91 | 91 | // switch internal binary bitset functions |
92 | 92 | $this->fnDoGetIterator = 'doGetIteratorBin'; |
@@ -332,7 +332,7 @@ discard block |
||
332 | 332 | throw new InvalidArgumentException('out-of-range bits detected'); |
333 | 333 | } |
334 | 334 | |
335 | - $this->bitset = \substr($bitset, 0, -1) . $lastByteExpected; |
|
335 | + $this->bitset = \substr($bitset, 0, -1).$lastByteExpected; |
|
336 | 336 | } |
337 | 337 | |
338 | 338 | $this->bitset = $bitset; |
@@ -1044,7 +1044,7 @@ discard block |
||
1044 | 1044 | private function doGetBinaryBitsetLeInt() |
1045 | 1045 | { |
1046 | 1046 | $bin = \pack(\PHP_INT_SIZE === 8 ? 'P' : 'V', $this->bitset); |
1047 | - return \substr($bin, 0, (int)\ceil($this->enumerationCount / 8)); |
|
1047 | + return \substr($bin, 0, (int) \ceil($this->enumerationCount / 8)); |
|
1048 | 1048 | } |
1049 | 1049 | |
1050 | 1050 | /** |
@@ -1102,7 +1102,7 @@ discard block |
||
1102 | 1102 | */ |
1103 | 1103 | private function doGetBitInt($ordinal) |
1104 | 1104 | { |
1105 | - return (bool)($this->bitset & (1 << $ordinal)); |
|
1105 | + return (bool) ($this->bitset & (1 << $ordinal)); |
|
1106 | 1106 | } |
1107 | 1107 | |
1108 | 1108 | /** |