rust: pure Rust lazyancestors iterator This is the first of a patch series aiming to provide an alternative implementation in the Rust programming language of the _lazyancestorsiter from the ancestor module. This iterator has been brought to our attention by the people at Octobus, as a potential good candidate for incremental "oxydation" (rewriting in Rust), because it has shown performance issues lately and it merely deals with ints (revision numbers) obtained by calling the index, whih should be directly callable from Rust code, being itself implemented as a C extension. The idea behind this series is to provide a minimal example of Rust code collaborating with existing C and Python code. To open the way to gradually rewriting more of Mercurial's Python code in Rust, without being forced to pay a large initial cost of rewriting the existing fast core into Rust. This patch does not introduce any bindings to other Mercurial code yet. Instead, it introduces the necessary abstractions to address the problem independently, and unit-test it. Since this is the first use of Rust as a Python module within Mercurial, the hg-core crate gets created within this patch. See its Cargo.toml for more details. Someone with a rustc/cargo installation may chdir into rust/hg-core and run the tests by issuing: cargo test --lib The algorithm is a bit simplified (see details in docstrings), and at its simplest becomes rather trivial, showcasing that Rust has batteries included too: BinaryHeap, the Rust analog of Python's heapq does actually all the work. The implementation can be further optimized and probably be made more idiomatic Rust.

     1

// Copyright 2018 Georges Racinet <gracinet@anybox.fr>

     2

//

     3

// This software may be used and distributed according to the terms of the

     4

// GNU General Public License version 2 or any later version.

     5

mod ancestors;

     6

pub use ancestors::AncestorsIterator;

     7

     8

/// Mercurial revision numbers

     9

///

    10

/// As noted in revlog.c, revision numbers are actually encoded in

    11

/// 4 bytes, and are liberally converted to ints, whence the i32

    12

pub type Revision = i32;

    13

    14

pub const NULL_REVISION: Revision = -1;

    15

    16

/// The simplest expression of what we need of Mercurial DAGs.

    17

pub trait Graph {

    18

    fn parents(&self, Revision) -> Result<(Revision, Revision), GraphError>;

    19

}

    20

    21

#[derive(Clone, Debug, PartialEq)]

    22

pub enum GraphError {

    23

    ParentOutOfRange(Revision),

    24

}