Comparing version 0.31.1 to 0.31.2
@@ -193,7 +193,7 @@ /** | ||
var byte, | ||
b = 0, | ||
b = 32, | ||
p = 0, | ||
c = 0; | ||
for (var i = 0, l = this.length; i < l; i++) { | ||
for (var i = 0, l = this.array.length; i < l; i++) { | ||
byte = this.array[i]; | ||
@@ -206,3 +206,4 @@ | ||
// TODO: This branching might not be useful here | ||
b = i === l - 1 ? this.length % 32 : 32; | ||
if (i === l - 1) | ||
b = this.length % 32 || 32; | ||
@@ -230,4 +231,6 @@ // TODO: popcount should speed things up here | ||
var byte, | ||
bit; | ||
var length = this.length, | ||
byte, | ||
bit, | ||
b = 32; | ||
@@ -237,3 +240,4 @@ for (var i = 0, l = this.array.length; i < l; i++) { | ||
var b = i === l - 1 ? this.length % 32 : 32; | ||
if (i === l - 1) | ||
b = length % 32 || 32; | ||
@@ -262,3 +266,3 @@ for (var j = 0; j < b; j++) { | ||
j = -1, | ||
b; | ||
b = 32; | ||
@@ -273,3 +277,5 @@ return new Iterator(function next() { | ||
b = i === l - 1 ? length % 32 : 32; | ||
if (i === l - 1) | ||
b = length % 32 || 32; | ||
byte = array[i++]; | ||
@@ -310,3 +316,3 @@ inner = true; | ||
j = -1, | ||
b; | ||
b = 32; | ||
@@ -321,3 +327,5 @@ return new Iterator(function next() { | ||
b = i === l - 1 ? length % 32 : 32; | ||
if (i === l - 1) | ||
b = length % 32 || 32; | ||
byte = array[i++]; | ||
@@ -324,0 +332,0 @@ inner = true; |
@@ -364,7 +364,7 @@ /** | ||
var byte, | ||
b = 0, | ||
b = 32, | ||
p = 0, | ||
c = 0; | ||
for (var i = 0, l = this.length; i < l; i++) { | ||
for (var i = 0, l = this.array.length; i < l; i++) { | ||
byte = this.array[i]; | ||
@@ -377,3 +377,4 @@ | ||
// TODO: This branching might not be useful here | ||
b = i === l - 1 ? this.length % 32 : 32; | ||
if (i === l - 1) | ||
b = this.length % 32 || 32; | ||
@@ -401,4 +402,6 @@ // TODO: popcount should speed things up here | ||
var byte, | ||
bit; | ||
var length = this.length, | ||
byte, | ||
bit, | ||
b = 32; | ||
@@ -408,3 +411,4 @@ for (var i = 0, l = this.array.length; i < l; i++) { | ||
var b = i === l - 1 ? this.length % 32 : 32; | ||
if (i === l - 1) | ||
b = length % 32 || 32; | ||
@@ -433,3 +437,3 @@ for (var j = 0; j < b; j++) { | ||
j = -1, | ||
b; | ||
b = 32; | ||
@@ -444,3 +448,5 @@ return new Iterator(function next() { | ||
b = i === l - 1 ? length % 32 : 32; | ||
if (i === l - 1) | ||
b = length % 32 || 32; | ||
byte = array[i++]; | ||
@@ -481,3 +487,3 @@ inner = true; | ||
j = -1, | ||
b; | ||
b = 32; | ||
@@ -492,3 +498,5 @@ return new Iterator(function next() { | ||
b = i === l - 1 ? length % 32 : 32; | ||
if (i === l - 1) | ||
b = length % 32 || 32; | ||
byte = array[i++]; | ||
@@ -495,0 +503,0 @@ inner = true; |
# Changelog | ||
## 0.31.2 | ||
* Fixing `BitSet` & `BitVector` iteration methods edge case. | ||
* Fixing `BitSet` & `BitVector` `#.select` method. | ||
## 0.31.1 | ||
@@ -4,0 +9,0 @@ |
{ | ||
"name": "mnemonist", | ||
"version": "0.31.1", | ||
"version": "0.31.2", | ||
"description": "Curated collection of data structures for the JavaScript language.", | ||
@@ -5,0 +5,0 @@ "scripts": { |
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
317777
11432