Cleanup ~/util (#5553)
This commit is contained in:
@@ -1,26 +0,0 @@
|
||||
// Copyright 2015-2017 Parity Technologies (UK) Ltd.
|
||||
// This file is part of Parity.
|
||||
|
||||
// Parity is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU General Public License as published by
|
||||
// the Free Software Foundation, either version 3 of the License, or
|
||||
// (at your option) any later version.
|
||||
|
||||
// Parity is distributed in the hope that it will be useful,
|
||||
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
// GNU General Public License for more details.
|
||||
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with Parity. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
// http://stackoverflow.com/questions/11318680/split-array-into-chunks-of-n-length
|
||||
export function chunkArray (array, size) {
|
||||
return array
|
||||
.map((item, index) => {
|
||||
return index % size === 0
|
||||
? array.slice(index, index + size)
|
||||
: null;
|
||||
})
|
||||
.filter((item) => item);
|
||||
}
|
||||
@@ -1,29 +0,0 @@
|
||||
// Copyright 2015-2017 Parity Technologies (UK) Ltd.
|
||||
// This file is part of Parity.
|
||||
|
||||
// Parity is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU General Public License as published by
|
||||
// the Free Software Foundation, either version 3 of the License, or
|
||||
// (at your option) any later version.
|
||||
|
||||
// Parity is distributed in the hope that it will be useful,
|
||||
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
// GNU General Public License for more details.
|
||||
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with Parity. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
import { chunkArray } from './array';
|
||||
|
||||
describe('util/array', () => {
|
||||
describe('chunkArray', () => {
|
||||
it('splits array into equal chunks', () => {
|
||||
expect(chunkArray([1, 2, 3, 4], 2)).to.deep.equal([[1, 2], [3, 4]]);
|
||||
});
|
||||
|
||||
it('splits array into equal chunks (non-divisible)', () => {
|
||||
expect(chunkArray([1, 2, 3, 4], 3)).to.deep.equal([[1, 2, 3], [4]]);
|
||||
});
|
||||
});
|
||||
});
|
||||
@@ -1,62 +0,0 @@
|
||||
// Copyright 2015-2017 Parity Technologies (UK) Ltd.
|
||||
// This file is part of Parity.
|
||||
|
||||
// Parity is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU General Public License as published by
|
||||
// the Free Software Foundation, either version 3 of the License, or
|
||||
// (at your option) any later version.
|
||||
|
||||
// Parity is distributed in the hope that it will be useful,
|
||||
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
// GNU General Public License for more details.
|
||||
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with Parity. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
import base32 from 'base32.js';
|
||||
|
||||
import { DOMAIN } from './constants';
|
||||
|
||||
const BASE_URL = `.web${DOMAIN}`;
|
||||
const ENCODER_OPTS = { type: 'crockford' };
|
||||
|
||||
export function encodePath (token, url) {
|
||||
const encoder = new base32.Encoder(ENCODER_OPTS);
|
||||
const chars = `${token}+${url}`
|
||||
.split('')
|
||||
.map((char) => char.charCodeAt(0));
|
||||
|
||||
return encoder
|
||||
.write(chars) // add the characters to encode
|
||||
.finalize(); // create the encoded string
|
||||
}
|
||||
|
||||
export function encodeUrl (token, url) {
|
||||
const encoded = encodePath(token, url)
|
||||
.match(/.{1,63}/g) // split into 63-character chunks, max length is 64 for URLs parts
|
||||
.join('.'); // add '.' between URL parts
|
||||
|
||||
return `${encoded}${BASE_URL}`;
|
||||
}
|
||||
|
||||
// TODO: This export is really more a helper along the way of verifying the actual
|
||||
// encoding (being able to decode test values from the node layer), than meant to
|
||||
// be used as-is. Should the need arrise to decode URLs as well (instead of just
|
||||
// producing), it would make sense to further split the output into the token/URL
|
||||
export function decode (encoded) {
|
||||
const decoder = new base32.Decoder(ENCODER_OPTS);
|
||||
const sanitized = encoded
|
||||
.replace(BASE_URL, '') // remove the BASE URL
|
||||
.split('.') // split the string on the '.' (63-char boundaries)
|
||||
.join(''); // combine without the '.'
|
||||
|
||||
return decoder
|
||||
.write(sanitized) // add the string to decode
|
||||
.finalize() // create the decoded buffer
|
||||
.toString(); // create string from buffer
|
||||
}
|
||||
|
||||
export {
|
||||
BASE_URL
|
||||
};
|
||||
@@ -1,83 +0,0 @@
|
||||
// Copyright 2015-2017 Parity Technologies (UK) Ltd.
|
||||
// This file is part of Parity.
|
||||
|
||||
// Parity is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU General Public License as published by
|
||||
// the Free Software Foundation, either version 3 of the License, or
|
||||
// (at your option) any later version.
|
||||
|
||||
// Parity is distributed in the hope that it will be useful,
|
||||
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
// GNU General Public License for more details.
|
||||
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with Parity. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
import { BASE_URL, decode, encodePath, encodeUrl } from './dapplink';
|
||||
|
||||
const TEST_TOKEN = 'token';
|
||||
const TEST_URL = 'https://parity.io';
|
||||
const TEST_URL_LONG = 'http://some.very.very.very.long.long.long.domain.example.com';
|
||||
const TEST_PREFIX = 'EHQPPSBE5DM78X3GECX2YBVGC5S6JX3S5SMPY';
|
||||
const TEST_PREFIX_LONG = [
|
||||
'EHQPPSBE5DM78X3G78QJYWVFDNJJWXK5E9WJWXK5E9WJWXK5E9WJWV3FDSKJWV3', 'FDSKJWV3FDSKJWS3FDNGPJVHECNW62VBGDHJJWRVFDM'
|
||||
].join('.');
|
||||
const TEST_RESULT = `${TEST_PREFIX}${BASE_URL}`;
|
||||
const TEST_ENCODED = `${TEST_TOKEN}+${TEST_URL}`;
|
||||
|
||||
describe('util/ethlink', () => {
|
||||
describe('decode', () => {
|
||||
it('decodes into encoded url', () => {
|
||||
expect(decode(TEST_PREFIX)).to.equal(TEST_ENCODED);
|
||||
});
|
||||
|
||||
it('decodes full into encoded url', () => {
|
||||
expect(decode(TEST_RESULT)).to.equal(TEST_ENCODED);
|
||||
});
|
||||
});
|
||||
|
||||
describe('encodePath', () => {
|
||||
it('encodes a url/token combination', () => {
|
||||
expect(encodePath(TEST_TOKEN, TEST_URL)).to.equal(TEST_PREFIX);
|
||||
});
|
||||
|
||||
it('changes when token changes', () => {
|
||||
expect(encodePath('test-token-2', TEST_URL)).not.to.equal(TEST_PREFIX);
|
||||
});
|
||||
|
||||
it('changes when url changes', () => {
|
||||
expect(encodePath(TEST_TOKEN, 'http://other.example.com')).not.to.equal(TEST_PREFIX);
|
||||
});
|
||||
});
|
||||
|
||||
describe('encodeUrl', () => {
|
||||
it('encodes a url/token combination', () => {
|
||||
expect(encodeUrl(TEST_TOKEN, TEST_URL)).to.equal(TEST_RESULT);
|
||||
});
|
||||
|
||||
it('changes when token changes', () => {
|
||||
expect(encodeUrl('test-token-2', TEST_URL)).not.to.equal(TEST_RESULT);
|
||||
});
|
||||
|
||||
it('changes when url changes', () => {
|
||||
expect(encodeUrl(TEST_TOKEN, 'http://other.example.com')).not.to.equal(TEST_RESULT);
|
||||
});
|
||||
|
||||
describe('splitting', () => {
|
||||
let encoded;
|
||||
|
||||
beforeEach(() => {
|
||||
encoded = encodeUrl(TEST_TOKEN, TEST_URL_LONG);
|
||||
});
|
||||
|
||||
it('splits long values into boundary parts', () => {
|
||||
expect(encoded).to.equal(`${TEST_PREFIX_LONG}${BASE_URL}`);
|
||||
});
|
||||
|
||||
it('first part 63 characters', () => {
|
||||
expect(encoded.split('.')[0].length).to.equal(63);
|
||||
});
|
||||
});
|
||||
});
|
||||
});
|
||||
@@ -1,131 +0,0 @@
|
||||
// Copyright 2015-2017 Parity Technologies (UK) Ltd.
|
||||
// This file is part of Parity.
|
||||
|
||||
// Parity is free software: you can redistribute it and/or modify
|
||||
// it under the terms of the GNU General Public License as published by
|
||||
// the Free Software Foundation, either version 3 of the License, or
|
||||
// (at your option) any later version.
|
||||
|
||||
// Parity is distributed in the hope that it will be useful,
|
||||
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
// GNU General Public License for more details.
|
||||
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with Parity. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
import Transaction from 'ethereumjs-tx';
|
||||
|
||||
import { inAddress, inHex, inNumber10 } from '@parity/api/format/input';
|
||||
import { sha3 } from '@parity/api/util/sha3';
|
||||
|
||||
export function createUnsignedTx (api, netVersion, transaction) {
|
||||
const { data, from, gas, gasPrice, to, value } = transaction;
|
||||
|
||||
return api.parity
|
||||
.nextNonce(from)
|
||||
.then((_nonce) => {
|
||||
const chainId = parseInt(netVersion, 10);
|
||||
const nonce = (!transaction.nonce || transaction.nonce.isZero())
|
||||
? _nonce
|
||||
: transaction.nonce;
|
||||
|
||||
const tx = new Transaction({
|
||||
chainId,
|
||||
data: inHex(data),
|
||||
gasPrice: inHex(gasPrice),
|
||||
gasLimit: inHex(gas),
|
||||
nonce: inHex(nonce),
|
||||
to: to ? inHex(to) : undefined,
|
||||
value: inHex(value),
|
||||
r: 0,
|
||||
s: 0,
|
||||
v: chainId
|
||||
});
|
||||
|
||||
const rlp = inHex(tx.serialize().toString('hex'));
|
||||
const hash = sha3(rlp);
|
||||
|
||||
return {
|
||||
chainId,
|
||||
hash,
|
||||
nonce,
|
||||
rlp,
|
||||
tx
|
||||
};
|
||||
});
|
||||
}
|
||||
|
||||
export function createSignedTx (netVersion, signature, unsignedTx) {
|
||||
const chainId = parseInt(netVersion, 10);
|
||||
const { data, gasPrice, gasLimit, nonce, to, value } = unsignedTx;
|
||||
|
||||
const r = Buffer.from(signature.substr(2, 64), 'hex');
|
||||
const s = Buffer.from(signature.substr(66, 64), 'hex');
|
||||
const v = Buffer.from([parseInt(signature.substr(130, 2), 16) + (chainId * 2) + 35]);
|
||||
|
||||
const tx = new Transaction({
|
||||
chainId,
|
||||
data,
|
||||
gasPrice,
|
||||
gasLimit,
|
||||
nonce,
|
||||
to,
|
||||
value,
|
||||
r,
|
||||
s,
|
||||
v
|
||||
});
|
||||
|
||||
return {
|
||||
chainId,
|
||||
rlp: inHex(tx.serialize().toString('hex')),
|
||||
tx
|
||||
};
|
||||
}
|
||||
|
||||
export function generateQr (from, tx, hash, rlp) {
|
||||
if (tx.data && tx.data.length > 64) {
|
||||
return JSON.stringify({
|
||||
action: 'signTransactionHash',
|
||||
data: {
|
||||
account: from.substr(2),
|
||||
hash: hash.substr(2),
|
||||
details: {
|
||||
gasPrice: inNumber10(inHex(tx.gasPrice.toString('hex') || '0')),
|
||||
gas: inNumber10(inHex(tx.gasLimit.toString('hex') || '0')),
|
||||
nonce: inNumber10(inHex(tx.nonce.toString('hex') || '0')),
|
||||
to: inAddress(tx.to.toString('hex')),
|
||||
value: inHex(tx.value.toString('hex') || '0')
|
||||
}
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
return JSON.stringify({
|
||||
action: 'signTransaction',
|
||||
data: {
|
||||
account: from.substr(2),
|
||||
rlp: rlp.substr(2)
|
||||
}
|
||||
});
|
||||
}
|
||||
|
||||
export function generateDataQr (data) {
|
||||
return Promise.resolve({
|
||||
data,
|
||||
value: JSON.stringify({
|
||||
action: 'signData',
|
||||
data
|
||||
})
|
||||
});
|
||||
}
|
||||
|
||||
export function generateTxQr (api, netVersion, transaction) {
|
||||
return createUnsignedTx(api, netVersion, transaction)
|
||||
.then((qr) => {
|
||||
qr.value = generateQr(transaction.from, qr.tx, qr.hash, qr.rlp);
|
||||
|
||||
return qr;
|
||||
});
|
||||
}
|
||||
Reference in New Issue
Block a user