@@ -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; |
@@ -1054,7 +1054,7 @@ discard block |
||
1054 | 1054 | private function doGetBinaryBitsetLeInt() |
1055 | 1055 | { |
1056 | 1056 | $bin = \pack(\PHP_INT_SIZE === 8 ? 'P' : 'V', $this->bitset); |
1057 | - return \substr($bin, 0, (int)\ceil($this->enumerationCount / 8)); |
|
1057 | + return \substr($bin, 0, (int) \ceil($this->enumerationCount / 8)); |
|
1058 | 1058 | } |
1059 | 1059 | |
1060 | 1060 | /** |
@@ -1112,6 +1112,6 @@ discard block |
||
1112 | 1112 | */ |
1113 | 1113 | private function doGetBitInt($ordinal) |
1114 | 1114 | { |
1115 | - return (bool)($this->bitset & (1 << $ordinal)); |
|
1115 | + return (bool) ($this->bitset & (1 << $ordinal)); |
|
1116 | 1116 | } |
1117 | 1117 | } |