16217034415

Committed 11 Jul 2025 09:46AM UTC coverage: 71.624% (-0.04%) from 71.662%

Build # 16217034415

Build Type

Pull #939

github

Committed by

web-flow

Commit Message

Merge 5cf5b0cb5 into 134613b51

Pull Request Pull Request #939: wallet: keep batch action order when sorting with same covenant types

Run Details

8214 of 13319 branches covered (61.67%)

Branch coverage included in aggregate %.

2 of 2 new or added lines in 1 file covered. (100.0%)

16 existing lines in 3 files now uncovered.

26137 of 34641 relevant lines covered (75.45%)

34142.54 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

60.34

/lib/utils/binary.js

/*!
 * binary.js - binary search utils for hsd
 * Copyright (c) 2017-2018, Christopher Jeffrey (MIT License).
 * https://github.com/handshake-org/hsd
 */

'use strict';

/**
 * Perform a binary search on a sorted array.
 * @param {Array} items
 * @param {Object} key
 * @param {Function} compare
 * @param {Boolean} [insert=false]
 * @returns {Number} Index.
 */

exports.search = function search(items, key, compare, insert) {
  let start = 0;
  let end = items.length - 1;

  while (start <= end) {
    const pos = (start + end) >>> 1;
    const cmp = compare(items[pos], key);

    if (cmp === 0)
      return pos;

    if (cmp < 0)
      start = pos + 1;
    else
      end = pos - 1;
  }

  if (!insert)
    return -1;

  return start;
};

/**
 * Perform a binary insert on a sorted array.
 * @param {Array} items
 * @param {Object} item
 * @param {Function} compare
 * @param {Boolean} [uniq=false]
 * @returns {Number} index
 */

exports.insert = function insert(items, item, compare, uniq) {
  const i = exports.search(items, item, compare, true);

  if (uniq && i < items.length) {
    if (compare(items[i], item) === 0)
      return -1;
  }

  if (i === 0)
    items.unshift(item);
  else if (i === items.length)
    items.push(item);
  else
    items.splice(i, 0, item);

  return i;
};

/**
 * Perform a binary removal on a sorted array.
 * @param {Array} items
 * @param {Object} item
 * @param {Function} compare
 * @returns {Boolean}
 */

exports.remove = function remove(items, item, compare) {
  const i = exports.search(items, item, compare, false);

  if (i === -1)
    return false;

  splice(items, i);

  return true;
};

/*
 * Helpers
 */

/**
 * @param {Array} list
 * @param {Number} i
 */

function splice(list, i) {
  if (i === 0) {
    list.shift();
    return;
  }

  let k = i + 1;

  while (k < list.length)
    list[i++] = list[k++];

  list.pop();
}

1	/*!
2	* binary.js - binary search utils for hsd
3	* Copyright (c) 2017-2018, Christopher Jeffrey (MIT License).
4	* https://github.com/handshake-org/hsd
5	*/
6
7	'use strict';
8
9	/**
10	* Perform a binary search on a sorted array.
11	* @param {Array} items
12	* @param {Object} key
13	* @param {Function} compare
14	* @param {Boolean} [insert=false]
15	* @returns {Number} Index.
16	*/
17
18	exports.search = function search(items, key, compare, insert) {	68✔
19	let start = 0;	28,285✔
20	let end = items.length - 1;	28,285✔
21
22	while (start <= end) {	28,285✔
23	const pos = (start + end) >>> 1;	138,625✔
24	const cmp = compare(items[pos], key);	138,625✔
25
26	if (cmp === 0)	138,625✔
27	return pos;	330✔
28
29	if (cmp < 0)	138,295✔
30	start = pos + 1;	134,751✔
31	else
32	end = pos - 1;	3,544✔
33	}
34
35	if (!insert)	27,955!
36	return -1;	×
37
38	return start;	27,955✔
39	};
40
41	/**
42	* Perform a binary insert on a sorted array.
43	* @param {Array} items
44	* @param {Object} item
45	* @param {Function} compare
46	* @param {Boolean} [uniq=false]
47	* @returns {Number} index
48	*/
49
50	exports.insert = function insert(items, item, compare, uniq) {	68✔
51	const i = exports.search(items, item, compare, true);	436✔
52
53	if (uniq && i < items.length) {	436!
UNCOV 54	if (compare(items[i], item) === 0)	×
55	return -1;	×
56	}
57
58	if (i === 0)	436✔
59	items.unshift(item);	355✔
60	else if (i === items.length)	81✔
61	items.push(item);	40✔
62	else
63	items.splice(i, 0, item);	41✔
64
65	return i;	436✔
66	};
67
68	/**
69	* Perform a binary removal on a sorted array.
70	* @param {Array} items
71	* @param {Object} item
72	* @param {Function} compare
73	* @returns {Boolean}
74	*/
75
76	exports.remove = function remove(items, item, compare) {	68✔
77	const i = exports.search(items, item, compare, false);	×
78
79	if (i === -1)	×
80	return false;	×
81
82	splice(items, i);	×
83
84	return true;	×
85	};
86
87	/*
88	* Helpers
89	*/
90
91	/**
92	* @param {Array} list
93	* @param {Number} i
94	*/
95
96	function splice(list, i) {
97	if (i === 0) {	×
98	list.shift();	×
99	return;	×
100	}
101
102	let k = i + 1;	×
103
104	while (k < list.length)	×
105	list[i++] = list[k++];	×
106
107	list.pop();	×
108	}

handshake-org / hsd / 16217034415

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous