upstream/mercurial-mirror Files · rust/hg-core/src/lib.rs

rust: dagop.headrevs() Rust counterparts...

rust: dagop.headrevs() Rust counterparts This introduces two Rust implementations for `mercurial.dagop.headrevs`. The algorithm is identical to the Python version. Depending on the caller, one or the other could be the most practical, or the most performant, by minimizing the amount of memory copy and allocations. Differential Revision: https://phab.mercurial-scm.org/D5580

Georges Racinet on ishtar.racinet.fr - - Load All Authors

File last commit:

r41278:47881d2a default


                r41278:47881d2a

default

Download file

             lib.rs
        
                    30 lines
            
             | 938 B
            
                | application/rls-services+xml
            
             |
                RustLexer
            
             / rust / hg-core / src / lib.rs
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

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

      //

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

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

      mod ancestors;

      pub mod dagops;

      pub use ancestors::{AncestorsIterator, LazyAncestors, MissingAncestors};

      #[cfg(test)]

      pub mod testing;

      /// 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;

      pub const NULL_REVISION: Revision = -1;

      /// 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, Revision) -> Result<[Revision; 2], GraphError>;

      }

      #[derive(Clone, Debug, PartialEq)]

      pub enum GraphError {

          ParentOutOfRange(Revision),

      }

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				// Copyright 2018 Georges Racinet <gracinet@anybox.fr>
				//
				// This software may be used and distributed according to the terms of the
				// GNU General Public License version 2 or any later version.
				mod ancestors;
				pub mod dagops;
				pub use ancestors::{AncestorsIterator, LazyAncestors, MissingAncestors};
				#[cfg(test)]
				pub mod testing;

				/// 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;

				pub const NULL_REVISION: Revision = -1;

				/// 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, Revision) -> Result<[Revision; 2], GraphError>;
				}

				#[derive(Clone, Debug, PartialEq)]
				pub enum GraphError {
				ParentOutOfRange(Revision),
				}