##// END OF EJS Templates
dirstate-tree: Add the new `status()` algorithm...
dirstate-tree: Add the new `status()` algorithm With the dirstate organized in a tree that mirrors the structure of the filesystem tree, we can traverse both trees at the same time in order to compare them. This is hopefully more efficient that building multiple big hashmaps for all of the repository’s contents. Differential Revision: https://phab.mercurial-scm.org/D10547

File last commit:

r47577:e8ae91b1 default
r47883:be579775 default
Show More
revlog.rs
71 lines | 2.2 KiB | application/rls-services+xml | RustLexer
Georges Racinet
rust-core: extracted a revlog submodule...
r44457 // Copyright 2018-2020 Georges Racinet <georges.racinet@octobus.net>
// and Mercurial contributors
//
// This software may be used and distributed according to the terms of the
// GNU General Public License version 2 or any later version.
//! Mercurial concepts for handling revision history
Georges Racinet
rust-node: binary Node ID and conversion utilities...
r44601 pub mod node;
Georges Racinet
rust-nodemap: building blocks for nodetree structures...
r44600 pub mod nodemap;
Simon Sapin
rhg: use persistent nodemap when available...
r46706 mod nodemap_docket;
Antoine Cezar
hg-core: add path_encode...
r46110 pub mod path_encode;
Simon Sapin
rust: Make NodePrefix allocation-free and Copy, remove NodePrefixRef...
r47160 pub use node::{FromHexError, Node, NodePrefix};
Antoine Cezar
hg-core: add `Changlog` a specialized `Revlog`...
r46103 pub mod changelog;
Antoine Cezar
hg-core: Add a limited read only `revlog` implementation...
r46097 pub mod index;
Antoine Cezar
hg-core: add `Manifest` a specialized `Revlog`...
r46104 pub mod manifest;
Antoine Cezar
hg-core: Add a limited read only `revlog` implementation...
r46097 pub mod patch;
pub mod revlog;
Georges Racinet
rust-nodemap: building blocks for nodetree structures...
r44600
Georges Racinet
rust-core: extracted a revlog submodule...
r44457 /// Mercurial revision numbers
///
/// As noted in revlog.c, revision numbers are actually encoded in
/// 4 bytes, and are liberally converted to ints, whence the i32
pub type Revision = i32;
/// Marker expressing the absence of a parent
///
/// Independently of the actual representation, `NULL_REVISION` is guaranteed
Aay Jay Chan
rust-core: fix typo in comment...
r44547 /// to be smaller than all existing revisions.
Georges Racinet
rust-core: extracted a revlog submodule...
r44457 pub const NULL_REVISION: Revision = -1;
/// Same as `mercurial.node.wdirrev`
///
/// This is also equal to `i32::max_value()`, but it's better to spell
/// it out explicitely, same as in `mercurial.node`
Raphaël Gomès
rust: do a clippy pass...
r45500 #[allow(clippy::unreadable_literal)]
Georges Racinet
rust-core: extracted a revlog submodule...
r44457 pub const WORKING_DIRECTORY_REVISION: Revision = 0x7fffffff;
Pulkit Goyal
rhg: raise wdir specific error for `hg debugdata`...
r47577 pub const WORKING_DIRECTORY_HEX: &str =
"ffffffffffffffffffffffffffffffffffffffff";
Georges Racinet
rust-core: extracted a revlog submodule...
r44457 /// The simplest expression of what we need of Mercurial DAGs.
pub trait Graph {
/// Return the two parents of the given `Revision`.
///
/// Each of the parents can be independently `NULL_REVISION`
fn parents(&self, rev: Revision) -> Result<[Revision; 2], GraphError>;
}
#[derive(Clone, Debug, PartialEq)]
pub enum GraphError {
ParentOutOfRange(Revision),
WorkingDirectoryUnsupported,
}
Georges Racinet
rust-revlog: a trait for the revlog index...
r44642
/// The Mercurial Revlog Index
///
/// This is currently limited to the minimal interface that is needed for
/// the [`nodemap`](nodemap/index.html) module
pub trait RevlogIndex {
/// Total number of Revisions referenced in this index
fn len(&self) -> usize;
Raphaël Gomès
rust: do a clippy pass...
r45500 fn is_empty(&self) -> bool {
self.len() == 0
}
Georges Racinet
rust-revlog: a trait for the revlog index...
r44642 /// Return a reference to the Node or `None` if rev is out of bounds
///
/// `NULL_REVISION` is not considered to be out of bounds.
fn node(&self, rev: Revision) -> Option<&Node>;
}