Bitmessage/bitmessage-js
2
0
Fork 1
Code Issues 1 Pull Requests 1 Actions Packages Releases Activity

Typo fixes

Browse Source
This commit is contained in:
Kagami Hiiragi 2015-01-03 03:11:02 +03:00
parent b90435308c
commit 9757fd20f6
2 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/address.js
View File

@ -223,7 +223,7 @@ Address.fromRandom = function(opts) {
// FIXME(Kagami): This function is rather slow in browsers so // FIXME(Kagami): This function is rather slow in browsers so
// generation of ripelen=18 currently is disabled (see `test.js`). It // generation of ripelen=18 currently is disabled (see `test.js`). It
// should be heavilty profiled to determine the bottleneck. // should be heavily profiled to determine the bottleneck.
// TODO(Kagami): We may want to run this in the web worker to speedup // TODO(Kagami): We may want to run this in the web worker to speedup
// the search. Currently WebCryptoAPI is not available in Firefox in // the search. Currently WebCryptoAPI is not available in Firefox in
// web workers (see // web workers (see
@ -239,8 +239,8 @@ Address.fromRandom = function(opts) {
(strictripelen && len === ripelen) || (strictripelen && len === ripelen) ||
(!strictripelen && len <= ripelen && checkripelen(ripelen, version)) (!strictripelen && len <= ripelen && checkripelen(ripelen, version))
) { ) {
// XXX(Kagami): Do we need to put all these properties or // TODO(Kagami): Do we need to put all these properties or compute
// compute them manually via ECMA5 getters/setters instead? // them manually via ECMA5 getters/setters instead?
resolve(new Address(Object.assign({ resolve(new Address(Object.assign({
signPrivateKey: signPrivateKey, signPrivateKey: signPrivateKey,
signPublicKey: signPublicKey, signPublicKey: signPublicKey,

12
lib/struct.js
View File

@ -20,8 +20,8 @@ var var_int = exports.var_int = {
* Decoded var_int structure. * Decoded var_int structure.
*/ */
decode: function(buf) { decode: function(buf) {
assert(buf.length > 0, "Empty buffer");
var value, length; var value, length;
assert(buf.length > 0, "Empty buffer");
switch (buf[0]) { switch (buf[0]) {
case 253: case 253:
value = buf.readUInt16BE(1); value = buf.readUInt16BE(1);
@ -38,14 +38,14 @@ var var_int = exports.var_int = {
assert(hi !== 0, "Impractical var_int"); assert(hi !== 0, "Impractical var_int");
// Max safe number = 2^53 - 1 = // Max safe number = 2^53 - 1 =
// 0b0000000000011111111111111111111111111111111111111111111111111111 // 0b0000000000011111111111111111111111111111111111111111111111111111
// = 2097151*(2^32) + (2^32 - 1) // = 2097151*(2^32) + (2^32 - 1).
// So it's safe until hi <= 2097151. See // So it's safe until hi <= 2097151. See
// <http://mdn.io/issafeinteger>, // <http://mdn.io/issafeinteger>,
// <https://stackoverflow.com/q/307179> for details. // <https://stackoverflow.com/q/307179> for details.
// TODO(Kagami): We may want to return raw Buffer for // TODO(Kagami): We may want to return raw Buffer for
// 2^53 <= value <= 2^64 - 1 range. Possible using the optional // 2^53 <= value <= 2^64 - 1 range. Possibly using the optional
// argument because most of the code expect to get number from // argument because most of the code expect to get a number when
// `var_int.decode`. // calling `var_int.decode`.
assert(hi <= 2097151, "Unsafe integer"); assert(hi <= 2097151, "Unsafe integer");
var lo = buf.readUInt32BE(5); var lo = buf.readUInt32BE(5);
value = hi * 4294967296 + lo; value = hi * 4294967296 + lo;
@ -86,7 +86,7 @@ var var_int = exports.var_int = {
buf.writeUInt32BE(value % 4294967296, 5); // low32 buf.writeUInt32BE(value % 4294967296, 5); // low32
} }
} else if (Buffer.isBuffer(value)) { } else if (Buffer.isBuffer(value)) {
assert(value.length <= 8, "Buffer too big"); assert(value.length <= 8, "Buffer is too big");
buf = new Buffer(9); buf = new Buffer(9);
buf.fill(0); buf.fill(0);
buf[0] = 255; buf[0] = 255;