@@ -88,8 +88,7 @@ discard block |
||
| 88 | 88 | { |
| 89 | 89 | $this->data = str_repeat(chr(255), ceil($this->size / 8)); |
| 90 | 90 | $this->restrict(); |
| 91 | - } |
|
| 92 | - else |
|
| 91 | + } else |
|
| 93 | 92 | { |
| 94 | 93 | $this->data = str_repeat(chr(0), ceil($this->size / 8)); |
| 95 | 94 | } |
@@ -202,8 +201,7 @@ discard block |
||
| 202 | 201 | if ($this->offsetExists($offset)) |
| 203 | 202 | { |
| 204 | 203 | return (bool) (ord($this->data[(int) ($offset / 8)]) & (1 << $offset % 8)); |
| 205 | - } |
|
| 206 | - else |
|
| 204 | + } else |
|
| 207 | 205 | { |
| 208 | 206 | throw new \OutOfRangeException('Argument offset must be a positive integer lesser than the size'); |
| 209 | 207 | } |
@@ -230,13 +228,11 @@ discard block |
||
| 230 | 228 | if ($value) |
| 231 | 229 | { |
| 232 | 230 | $this->data[$index] = chr(ord($this->data[$index]) | (1 << $offset % 8)); |
| 233 | - } |
|
| 234 | - else |
|
| 231 | + } else |
|
| 235 | 232 | { |
| 236 | 233 | $this->data[$index] = chr(ord($this->data[$index]) & ~(1 << $offset % 8)); |
| 237 | 234 | } |
| 238 | - } |
|
| 239 | - else |
|
| 235 | + } else |
|
| 240 | 236 | { |
| 241 | 237 | throw new \OutOfRangeException('Argument index must be a positive integer lesser than the size'); |
| 242 | 238 | } |
@@ -354,8 +350,7 @@ discard block |
||
| 354 | 350 | { |
| 355 | 351 | $this[$i + $index] = $bits[$i + $offset]; |
| 356 | 352 | } |
| 357 | - } |
|
| 358 | - else |
|
| 353 | + } else |
|
| 359 | 354 | { |
| 360 | 355 | for ($i = $size - 1; $i >= 0; $i--) |
| 361 | 356 | { |
@@ -423,8 +418,7 @@ discard block |
||
| 423 | 418 | { |
| 424 | 419 | $offset = 0; |
| 425 | 420 | } |
| 426 | - } |
|
| 427 | - elseif ($offset > $this->size) |
|
| 421 | + } elseif ($offset > $this->size) |
|
| 428 | 422 | { |
| 429 | 423 | $offset = $this->size; |
| 430 | 424 | } |
@@ -449,8 +443,7 @@ discard block |
||
| 449 | 443 | if ($size === null) |
| 450 | 444 | { |
| 451 | 445 | $size = $this->size - $offset; |
| 452 | - } |
|
| 453 | - else |
|
| 446 | + } else |
|
| 454 | 447 | { |
| 455 | 448 | $size = (int) $size; |
| 456 | 449 | |
@@ -462,8 +455,7 @@ discard block |
||
| 462 | 455 | { |
| 463 | 456 | $size = 0; |
| 464 | 457 | } |
| 465 | - } |
|
| 466 | - elseif ($size > $this->size - $offset) |
|
| 458 | + } elseif ($size > $this->size - $offset) |
|
| 467 | 459 | { |
| 468 | 460 | $size = $this->size - $offset; |
| 469 | 461 | } |
@@ -687,8 +679,7 @@ discard block |
||
| 687 | 679 | } |
| 688 | 680 | |
| 689 | 681 | return $this; |
| 690 | - } |
|
| 691 | - else |
|
| 682 | + } else |
|
| 692 | 683 | { |
| 693 | 684 | throw new \InvalidArgumentException('Argument must be of equal size'); |
| 694 | 685 | } |
@@ -717,8 +708,7 @@ discard block |
||
| 717 | 708 | } |
| 718 | 709 | |
| 719 | 710 | return $this; |
| 720 | - } |
|
| 721 | - else |
|
| 711 | + } else |
|
| 722 | 712 | { |
| 723 | 713 | throw new \InvalidArgumentException('Argument must be of equal size'); |
| 724 | 714 | } |
@@ -747,8 +737,7 @@ discard block |
||
| 747 | 737 | } |
| 748 | 738 | |
| 749 | 739 | return $this; |
| 750 | - } |
|
| 751 | - else |
|
| 740 | + } else |
|
| 752 | 741 | { |
| 753 | 742 | throw new \InvalidArgumentException('Argument must be of equal size'); |
| 754 | 743 | } |
@@ -783,8 +772,7 @@ discard block |
||
| 783 | 772 | { |
| 784 | 773 | $this[$i] = $value; |
| 785 | 774 | } |
| 786 | - } |
|
| 787 | - else |
|
| 775 | + } else |
|
| 788 | 776 | { |
| 789 | 777 | $min = min($this->size, -$size); |
| 790 | 778 | |