Comparing version 5.0.3 to 5.0.4
/** | ||
* @license BitSet.js v5.0.3 4/3/2018 | ||
* @license BitSet.js v5.0.4 4/3/2018 | ||
* http://www.xarg.org/2014/03/javascript-bit-array/ | ||
@@ -238,3 +238,3 @@ * | ||
* @param {number} ndx the index to be fetched | ||
* @returns {number|null} The binary flag | ||
* @returns {number} The binary flag | ||
*/ | ||
@@ -254,3 +254,3 @@ 'get': function(ndx) { | ||
/** | ||
* Creates the bitwise NOT of a set. The result is stored in-place. | ||
* Creates the bitwise NOT of a set. | ||
* | ||
@@ -260,5 +260,5 @@ * Ex: | ||
* | ||
* bs1.not(); | ||
* res = bs1.not(); | ||
* | ||
* @returns {BitSet} this | ||
* @returns {BitSet} A new BitSet object, containing the bitwise NOT of this | ||
*/ | ||
@@ -278,3 +278,3 @@ 'not': function() { // invert() | ||
/** | ||
* Creates the bitwise AND of two sets. The result is stored in-place. | ||
* Creates the bitwise AND of two sets. | ||
* | ||
@@ -285,6 +285,6 @@ * Ex: | ||
* | ||
* bs1.and(bs2); | ||
* res = bs1.and(bs2); | ||
* | ||
* @param {BitSet} value A bitset object | ||
* @returns {BitSet} this | ||
* @returns {BitSet} A new BitSet object, containing the bitwise AND of this and value | ||
*/ | ||
@@ -325,3 +325,3 @@ 'and': function(value) {// intersection | ||
/** | ||
* Creates the bitwise OR of two sets. The result is stored in-place. | ||
* Creates the bitwise OR of two sets. | ||
* | ||
@@ -332,6 +332,6 @@ * Ex: | ||
* | ||
* bs1.or(bs2); | ||
* res = bs1.or(bs2); | ||
* | ||
* @param {BitSet} val A bitset object | ||
* @returns {BitSet} this | ||
* @returns {BitSet} A new BitSet object, containing the bitwise OR of this and val | ||
*/ | ||
@@ -365,3 +365,3 @@ 'or': function(val) { // union | ||
/** | ||
* Creates the bitwise XOR of two sets. The result is stored in-place. | ||
* Creates the bitwise XOR of two sets. | ||
* | ||
@@ -372,6 +372,6 @@ * Ex: | ||
* | ||
* bs1.xor(bs2); | ||
* res = bs1.xor(bs2); | ||
* | ||
* @param {BitSet} val A bitset object | ||
* @returns {BitSet} this | ||
* @returns {BitSet} A new BitSet object, containing the bitwise XOR of this and val | ||
*/ | ||
@@ -415,3 +415,3 @@ 'xor': function(val) { // symmetric difference | ||
/** | ||
* Creates the bitwise AND NOT (not confuse with NAND!) of two sets. The result is stored in-place. | ||
* Creates the bitwise AND NOT (not confuse with NAND!) of two sets. | ||
* | ||
@@ -422,6 +422,6 @@ * Ex: | ||
* | ||
* bs1.notAnd(bs2); | ||
* res = bs1.notAnd(bs2); | ||
* | ||
* @param {BitSet} val A bitset object | ||
* @returns {BitSet} this | ||
* @returns {BitSet} A new BitSet object, containing the bitwise AND NOT of this and other | ||
*/ | ||
@@ -479,3 +479,3 @@ 'andNot': function(val) { // difference | ||
* bs1.clear(5); // Clear single bit | ||
* bs1.clar(3,10); // Clear a bit range | ||
* bs1.clear(3,10); // Clear a bit range | ||
* | ||
@@ -524,3 +524,3 @@ * @param {number=} from The start index of the range to be cleared | ||
* @param {number=} to The end index of the range to be get | ||
* @returns {BitSet|Object} A new smaller bitset object, containing the extracted range | ||
* @returns {BitSet} A new smaller bitset object, containing the extracted range | ||
*/ | ||
@@ -597,3 +597,3 @@ 'slice': function(from, to) { | ||
* | ||
* @returns {Array|number} | ||
* @returns {Array} | ||
*/ | ||
@@ -887,3 +887,3 @@ 'toArray': Math['clz32'] ? | ||
* @param {BitSet} val A bitset object | ||
* @returns {boolean} Whether the two BitSets are similar | ||
* @returns {boolean} Whether the two BitSets have the same bits set (valid for indefinite sets as well) | ||
*/ | ||
@@ -890,0 +890,0 @@ 'equals': function(val) { |
/* | ||
BitSet.js v5.0.3 4/3/2018 | ||
BitSet.js v5.0.4 4/3/2018 | ||
http://www.xarg.org/2014/03/javascript-bit-array/ | ||
@@ -4,0 +4,0 @@ |
{ | ||
"name": "bitset.js", | ||
"main": "bitset.js", | ||
"version": "5.0.3", | ||
"version": "5.0.4", | ||
"homepage": "http://www.xarg.org/2014/03/javascript-bit-array/", | ||
@@ -6,0 +6,0 @@ "description": "A performance optimized infinite bit vector library", |
@@ -21,13 +21,13 @@ /** | ||
return gulp.src(['bitset.js']) | ||
.pipe(closureCompiler({ | ||
compilation_level: 'ADVANCED', | ||
externs: 'moduleExterns.js', | ||
language_in: 'ES6_STRICT', | ||
language_out: 'ES5_STRICT', | ||
js_output_file: 'bitset.min.js', | ||
warning_level: 'VERBOSE' | ||
})) | ||
.pipe(gulp.dest('.')); | ||
.pipe(closureCompiler({ | ||
compilation_level: 'ADVANCED', | ||
externs: 'moduleExterns.js', | ||
language_in: 'ES6_STRICT', | ||
language_out: 'ES5_STRICT', | ||
js_output_file: 'bitset.min.js', | ||
warning_level: 'VERBOSE' | ||
})) | ||
.pipe(gulp.dest('.')); | ||
}); | ||
gulp.task('default', ['compile']); |
{ | ||
"name": "bitset", | ||
"title": "BitSet", | ||
"version": "5.0.3", | ||
"version": "5.0.4", | ||
"homepage": "http://www.xarg.org/2014/03/javascript-bit-array/", | ||
@@ -6,0 +6,0 @@ "description": "A performance optimized infinite bit vector library", |
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
68173
11
1865