steemjs-fixed/libcrypto/vendor/sjcl/test/bitArray_test.js

Steem.js the JavaScript API for Steem blockchain

(function() {

  function word2hex(w) {
    return "0x" + ((w|0)+0xF00000000000).toString(16).substr(4);
  }

  var b0 = sjcl.bitArray.partial(1, 0);
  var b1 = sjcl.bitArray.partial(1, 1);

  function concatbits(s) {
    var j, b, a = [];
    for (j = 0; j < s.length; ++j) {
      b = (s[j] == '1' ? b1 : b0);
      a = sjcl.bitArray.concat(a, [b]);
    }
    return a;
  }

  new sjcl.test.TestCase("bitArray single bits", function (cb) {
    if (!sjcl.bitArray) {
      this.unimplemented();
      cb && cb();
      return;
    }

    this.require((b0|0) === (0x00000000|0), "bitstring '0': " + word2hex(b0));
    this.require((b1|0) === (0x80000000|0), "bitstring '1': " + word2hex(b1));

    cb && cb();
  });

  new sjcl.test.TestCase("bitArray concat small bitstrings", function (cb) {
    if (!sjcl.bitArray) {
      this.unimplemented();
      cb && cb();
      return;
    }

    var i, kat = sjcl.test.vector.bitArray.bits, tv, a, b, bitlen, t;
    for (i=0; i<kat.length; i++) {
      tv = kat[i];
      a = concatbits(tv[0]);
      bitlen = sjcl.bitArray.bitLength(a);
      t = "bitstring '" + tv[0] + "': ";
      this.require(1 === a.length, t + "array length is 1: " + a.length);
      this.require(bitlen === tv[0].length, t + "length " + bitlen + " matches input length " + tv[0].length);
      b = sjcl.bitArray.partial(tv[0].length, tv[1]);
      this.require(a[0] === b, t + "array matches shifted number: " + word2hex(a[0]) + " == " + word2hex(b));
      b = 0 | (a[0] >>> (32 - tv[0].length)); // unsigned shift, convert to signed word
      this.require(b === (tv[1]|0), t + "array entry shifted is number: " + word2hex(b) + " == " + word2hex(tv[1]));
    }

    cb && cb();
  });


  new sjcl.test.TestCase("bitArray concat, slicing, shifting and clamping", function (cb) {
    if (!sjcl.bitArray) {
      this.unimplemented();
      cb && cb();
      return;
    }

    var i, j, kat = sjcl.test.vector.bitArray.slices, tv, a, a1, b, bitlen, t;
    for (i=0; i<kat.length; i++) {
      tv = kat[i];
      a = [];
      b = [];

      bitlen = 0;
      for (j=0; j<tv[0].length; j++) {
        b[j] = concatbits(tv[0][j]);
        a = sjcl.bitArray.concat(a, b[j]);
        bitlen += tv[0][j].length;
      }

      // shift last array entry and set partial length on it
      a1 = tv[1]; a1 = a1.slice(0, a1.length);
      bitlen &= 31;
      if (0 !== bitlen) a1[a1.length-1] = sjcl.bitArray.partial(bitlen, a1[a1.length-1]);

      this.require(sjcl.bitArray.equal(a, a1), "concat: [" + a + "] == [" + a1 + "]");

      t = 0;
      for (j=0; j<tv[0].length; j++) {
        bitlen = sjcl.bitArray.bitLength(b[j]);
        this.require(bitlen === tv[0][j].length, "bitstring length");
        a1 = sjcl.bitArray.bitSlice(a, t, t + bitlen);
        this.require(sjcl.bitArray.equal(b[j], a1), "slice after concat: [" + b[j] + "] == [" + a1 + "]");
        t += bitlen;
      }
    }

    cb && cb();
  });

  new sjcl.test.TestCase("bitArray byteswap", function (cb) {
    if (!sjcl.bitArray) {
      this.unimplemented();
      cb && cb();
      return;
    }

    var i, kat = sjcl.test.vector.bitArray.byteswap, tv, a;
    for (i=0; i<kat.length; i++) {
      tv = kat[i];

      a = tv[1];
      this.require(sjcl.bitArray.equal(tv[0], sjcl.bitArray.byteswapM(a.slice(0, a.length))));
    }

    cb && cb();
  });

})();