Overload List
| # | Signature | Description |
|---|---|---|
| 1 | function BitShift(const Src: TMtxVecInt; const Bits: Integer): TMtxVecInt; | Apply binary shift by number of Bits to the left (positive) or right (negative) to elements in Src. |
| └ indexed: function BitShift(const Src: TMtxVecInt; const Bits: Integer; const SrcIndex: Integer; const Index: Integer; const Len: Integer): TMtxVecInt; | ||
| 2 | function BitShift(const Bits: Integer): TMtxVecInt; | Apply binary shift by number of Bits to the left (positive) or right (negative) for all elements in the calling object. |
| └ indexed: function BitShift(const Bits: Integer; const Index: Integer; const Len: Integer): TMtxVecInt; |
Overload 1: function BitShift(const Src: TMtxVecInt; const Bits: Integer): TMtxVecInt;
Apply binary shift by number of Bits to the left (positive) or right (negative) to elements in Src.
| # | Name | Type | Description |
|---|---|---|---|
| 1 | Src | TMtxVecInt | |
| 2 | Bits | Integer |
Result: stored in self (calling object), returns self for chaining
Returns: the result of binary shift to the left or right by number of Bits applied to Src values and stored in the calling object (Self). The sign of the numbers is preserved when doing right shift.
Indexed: function BitShift(const Src: TMtxVecInt; const Bits: Integer; const SrcIndex: Integer; const Index: Integer; const Len: Integer): TMtxVecInt;
Apply binary shift by number of Bits to the left (positive) or right (negative) to elements in Src.
| # | Name | Type | Description |
|---|---|---|---|
| 1 | Src | TMtxVecInt | |
| 2 | Bits | Integer | |
| 3 | SrcIndex | Integer | source start index |
| 4 | Index | Integer | start index |
| 5 | Len | Integer | element count |
Result: stored in self (calling object), returns self for chaining
Returns: the result of binary shift to the left or right by number of Bits applied to Src values [SrcIndex]..[SrcIndex+Len-1] and stored in the calling object (Self) value [Index]..[Index+Len-1]. The sign of the numbers is preserved when doing right shift.
Overload 2: function BitShift(const Bits: Integer): TMtxVecInt;
Apply binary shift by number of Bits to the left (positive) or right (negative) for all elements in the calling object.
| # | Name | Type | Description |
|---|---|---|---|
| 1 | Bits | Integer |
Result: stored in self (calling object), returns self for chaining
Returns: the result of binary shift to the left or right by number of Bits applied to values in the calling object and stored back in the calling object. The sign of the numbers is preserved when doing right shift.
Indexed: function BitShift(const Bits: Integer; const Index: Integer; const Len: Integer): TMtxVecInt;
Apply binary shift by number of Bits to the left (positive) or right (negative) to elements in the calling object.
| # | Name | Type | Description |
|---|---|---|---|
| 1 | Bits | Integer | |
| 2 | Index | Integer | start index |
| 3 | Len | Integer | element count |
Result: stored in self (calling object), returns self for chaining
Returns: the result of binary shift to the left or right by number of Bits applied to values [Index]..[Index+Len-1] in the calling object and stored back in the calling object. The sign of the numbers is preserved when doing right shift.