mirror of
https://github.com/oxen-io/session-desktop.git
synced 2023-12-14 02:12:57 +01:00
remove unused service_node.js and test for it
This commit is contained in:
Audric Ackermann
parent
d3b9e56c92
commit
6dd166d7d4
1
libloki/index.d.ts
vendored
1
libloki/index.d.ts
vendored
|
|
@ -4,5 +4,4 @@ export interface Libloki {
|
|||
api: any;
|
||||
crypto: CryptoInterface;
|
||||
storage: any;
|
||||
serviceNodes: any;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -1,42 +0,0 @@
|
|||
/* global window */
|
||||
|
||||
// eslint-disable-next-line func-names
|
||||
(function() {
|
||||
window.libloki = window.libloki || {};
|
||||
|
||||
function consolidateLists(lists, threshold, selector = x => x) {
|
||||
if (typeof threshold !== 'number') {
|
||||
throw Error('Provided threshold is not a number');
|
||||
}
|
||||
if (typeof selector !== 'function') {
|
||||
throw Error('Provided selector is not a function');
|
||||
}
|
||||
|
||||
// calculate list size manually since `Set`
|
||||
// does not have a `length` attribute
|
||||
let numLists = 0;
|
||||
const occurences = {};
|
||||
const values = {};
|
||||
lists.forEach(list => {
|
||||
numLists += 1;
|
||||
list.forEach(item => {
|
||||
const key = selector(item);
|
||||
if (!(key in occurences)) {
|
||||
occurences[key] = 1;
|
||||
values[key] = item;
|
||||
} else {
|
||||
occurences[key] += 1;
|
||||
}
|
||||
});
|
||||
});
|
||||
|
||||
const scaledThreshold = numLists * threshold;
|
||||
return Object.keys(occurences)
|
||||
.filter(key => occurences[key] >= scaledThreshold)
|
||||
.map(key => values[key]);
|
||||
}
|
||||
|
||||
window.libloki.serviceNodes = {
|
||||
consolidateLists,
|
||||
};
|
||||
})();
|
||||
|
|
@ -39,4 +39,5 @@
|
|||
mocha.run();
|
||||
</script>
|
||||
</body>
|
||||
</html>
|
||||
|
||||
</html>
|
||||
|
|
@ -1,137 +0,0 @@
|
|||
/* global libloki, assert */
|
||||
|
||||
describe('ServiceNodes', () => {
|
||||
describe('#consolidateLists', () => {
|
||||
it('should throw when provided a non-iterable list', () => {
|
||||
assert.throws(
|
||||
() => libloki.serviceNodes.consolidateLists(null, 1),
|
||||
Error
|
||||
);
|
||||
});
|
||||
|
||||
it('should throw when provided a non-iterable item in the list', () => {
|
||||
assert.throws(
|
||||
() => libloki.serviceNodes.consolidateLists([1, 2, 3], 1),
|
||||
Error
|
||||
);
|
||||
});
|
||||
|
||||
it('should throw when provided a non-number threshold', () => {
|
||||
assert.throws(
|
||||
() => libloki.serviceNodes.consolidateLists([], 'a'),
|
||||
'Provided threshold is not a number'
|
||||
);
|
||||
});
|
||||
|
||||
it('should throw when provided a non-function selector', () => {
|
||||
[1, 'a', 0xffffffff, { really: 'not a function' }].forEach(x => {
|
||||
assert.throws(
|
||||
() => libloki.serviceNodes.consolidateLists([], 1, x),
|
||||
'Provided selector is not a function'
|
||||
);
|
||||
});
|
||||
});
|
||||
|
||||
it('should return an empty array when the input is an empty array', () => {
|
||||
const result = libloki.serviceNodes.consolidateLists([], 1);
|
||||
assert.deepEqual(result, []);
|
||||
});
|
||||
|
||||
it('should return the input when only 1 list is provided', () => {
|
||||
const result = libloki.serviceNodes.consolidateLists(
|
||||
[['a', 'b', 'c']],
|
||||
1
|
||||
);
|
||||
assert.deepEqual(result, ['a', 'b', 'c']);
|
||||
});
|
||||
|
||||
it('should return the union of all lists when threshold is 0', () => {
|
||||
const result = libloki.serviceNodes.consolidateLists(
|
||||
[
|
||||
['a', 'b', 'c', 'h'],
|
||||
['d', 'e', 'f', 'g'],
|
||||
['g', 'h'],
|
||||
],
|
||||
0
|
||||
);
|
||||
assert.deepEqual(result.sort(), ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']);
|
||||
});
|
||||
|
||||
it('should use the selector to identify the elements', () => {
|
||||
const result = libloki.serviceNodes.consolidateLists(
|
||||
[
|
||||
[
|
||||
{ id: 1, val: 'a' },
|
||||
{ id: 2, val: 'b' },
|
||||
{ id: 3, val: 'c' },
|
||||
{ id: 8, val: 'h' },
|
||||
],
|
||||
[
|
||||
{ id: 4, val: 'd' },
|
||||
{ id: 5, val: 'e' },
|
||||
{ id: 6, val: 'f' },
|
||||
{ id: 7, val: 'g' },
|
||||
],
|
||||
[
|
||||
{ id: 7, val: 'g' },
|
||||
{ id: 8, val: 'h' },
|
||||
],
|
||||
],
|
||||
0,
|
||||
x => x.id
|
||||
);
|
||||
const expected = [
|
||||
{ id: 1, val: 'a' },
|
||||
{ id: 2, val: 'b' },
|
||||
{ id: 3, val: 'c' },
|
||||
{ id: 4, val: 'd' },
|
||||
{ id: 5, val: 'e' },
|
||||
{ id: 6, val: 'f' },
|
||||
{ id: 7, val: 'g' },
|
||||
{ id: 8, val: 'h' },
|
||||
];
|
||||
assert.deepEqual(
|
||||
result.sort((a, b) => a.val > b.val),
|
||||
expected
|
||||
);
|
||||
});
|
||||
|
||||
it('should return the intersection of all lists when threshold is 1', () => {
|
||||
const result = libloki.serviceNodes.consolidateLists(
|
||||
[
|
||||
['a', 'b', 'c', 'd'],
|
||||
['a', 'e', 'f', 'g'],
|
||||
['a', 'h'],
|
||||
],
|
||||
1
|
||||
);
|
||||
assert.deepEqual(result, ['a']);
|
||||
});
|
||||
|
||||
it('should return the elements that have an occurence >= the provided threshold', () => {
|
||||
const result = libloki.serviceNodes.consolidateLists(
|
||||
[
|
||||
['a', 'b', 'c', 'd', 'e', 'f', 'g'],
|
||||
['a', 'b', 'c', 'd', 'e', 'f', 'h'],
|
||||
['a', 'b', 'c', 'd', 'e', 'f', 'g'],
|
||||
['a', 'b', 'c', 'd', 'e', 'g', 'h'],
|
||||
],
|
||||
3 / 4
|
||||
);
|
||||
assert.deepEqual(result, ['a', 'b', 'c', 'd', 'e', 'f', 'g']);
|
||||
});
|
||||
|
||||
it('should work with sets as well', () => {
|
||||
const result = libloki.serviceNodes.consolidateLists(
|
||||
new Set([
|
||||
new Set(['a', 'b', 'c', 'd', 'e', 'f', 'g']),
|
||||
new Set(['a', 'b', 'c', 'd', 'e', 'f', 'h']),
|
||||
new Set(['a', 'b', 'c', 'd', 'e', 'f', 'g']),
|
||||
new Set(['a', 'b', 'c', 'd', 'e', 'g', 'h']),
|
||||
]),
|
||||
3 / 4
|
||||
);
|
||||
assert.deepEqual(result, ['a', 'b', 'c', 'd', 'e', 'f', 'g']);
|
||||
});
|
||||
});
|
||||
});
|
||||
Loading…
Reference in a new issue