view tests/test-ancestor.py.out @ 44143:7f86426fdd2c

rust-node: binary Node ID and conversion utilities

The choice of type makes sure that a `Node` has the exact
wanted size. We'll use a different type for prefixes.

Added dependency: hexadecimal conversion relies on the
`hex` crate.

The fact that sooner or later Mercurial is going to need
to change its hash sizes has been taken strongly in
consideration:

- the hash length is a constant, but that is not directly
  exposed to callers. Changing the value of that constant
  is the only thing to do to change the hash length (even
  in unit tests)
- the code could be adapted to support several sizes of hashes,
  if that turned out to be useful. To that effect, only the
  size of a given `Node` is exposed in the public API.
- callers not involved in initial computation, I/O and FFI
  are able to operate without a priori assumptions on the hash
  size. The traits `FromHex` and `ToHex` have not been directly
  implemented, so that the doc-comments explaining these
  restrictions would stay really visible in `cargo doc`

Differential Revision: https://phab.mercurial-scm.org/D7788

% removeancestorsfrom(), example 1
remaining (sorted): [5, 6, 8, 9]
% removeancestorsfrom(), example 2
remaining (sorted): [11, 12, 13, 14]
% removeancestorsfrom(), example 3
remaining (sorted): [3, 5]
% missingancestors(), example 1
return [3, 7, 11]
% missingancestors(), example 2
return [5, 10]
% missingancestors(), example 3
return [3, 6, 9, 11]
% removeancestorsfrom(), bigger graph
Ok
% lazy ancestor set for [], stoprev = 0, inclusive = False
membership: []
iteration:  []
% lazy ancestor set for [11, 13], stoprev = 0, inclusive = False
membership: [7, 8, 3, 4, 1, 0]
iteration:  [8, 7, 4, 3, 2, 1, 0]
% lazy ancestor set for [1, 3], stoprev = 0, inclusive = False
membership: [1, 0]
iteration:  [1, 0]
% lazy ancestor set for [11, 13], stoprev = 0, inclusive = True
membership: [11, 13, 7, 8, 3, 4, 1, 0]
iteration:  [13, 11, 8, 7, 4, 3, 2, 1, 0]
% lazy ancestor set for [11, 13], stoprev = 6, inclusive = False
membership: [7, 8]
iteration:  [8, 7]
% lazy ancestor set for [11, 13], stoprev = 6, inclusive = True
membership: [11, 13, 7, 8]
iteration:  [13, 11, 8, 7]
% lazy ancestor set for [11, 13], stoprev = 11, inclusive = True
membership: [11, 13]
iteration:  [13, 11]
% lazy ancestor set for [11, 13], stoprev = 12, inclusive = True
membership: [13]
iteration:  [13]
% lazy ancestor set for [10, 1], stoprev = 0, inclusive = True
membership: [2, 10, 4, 5, 0, 1]
iteration:  [10, 5, 4, 2, 1, 0]