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

rust-index: implement common_ancestors_heads() and ancestors()...

rust-index: implement common_ancestors_heads() and ancestors() The only differences betwwen `common_ancestors_heads()` and `find_gca_candidates()` seems to be that: - the former accepts "overlapping" input revisions (meaning with duplicates). - limitation to 24 inputs (in the C code), that we translate to using the arbitrary size bit sets in the Rust code because we cannot bail to Python. Given that the input is expected to be small in most cases, we take the heavy handed approach of going through a HashSet and wait for perfomance assessment In case this is used via `hg-cpython`, we can anyway absorb the overhead by having `commonancestorheads` build a vector of unique values directly, and introduce a thin wrapper over `find_gca_candidates`, to take care of bit set type dispatching only. As far as `ancestors` is concerneed, this is just chaining `common_ancestors_heads()` with `find_deepest_revs`.

Raphaël Gomès - - Load All Authors

File last commit:

r50825:e98fd81b default


                r52118:89ce6a49

default

Download file

             dirstate.rs
        
                    50 lines
            
             | 1.1 KiB
            
                | application/rls-services+xml
            
             |
                RustLexer
            
             / rust / hg-core / src / dirstate.rs
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      // dirstate module

      //

      // Copyright 2019 Raphaël Gomès <rgomes@octobus.net>

      //

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

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

      use crate::dirstate_tree::on_disk::DirstateV2ParseError;

      use crate::revlog::node::NULL_NODE;

      use crate::revlog::Node;

      use crate::utils::hg_path::HgPath;

      use bytes_cast::BytesCast;

      pub mod dirs_multiset;

      pub mod entry;

      pub mod parsers;

      pub mod status;

      pub use self::entry::*;

      #[derive(Debug, PartialEq, Copy, Clone, BytesCast)]

      #[repr(C)]

      pub struct DirstateParents {

          pub p1: Node,

          pub p2: Node,

      }

      impl DirstateParents {

          pub const NULL: Self = Self {

              p1: NULL_NODE,

              p2: NULL_NODE,

          };

          pub fn is_merge(&self) -> bool {

              !(self.p2 == NULL_NODE)

          }

      }

      pub type StateMapIter<'a> = Box<

          dyn Iterator<

                  Item = Result<(&'a HgPath, DirstateEntry), DirstateV2ParseError>,

              > + Send

              + 'a,

      >;

      pub type CopyMapIter<'a> = Box<

          dyn Iterator<Item = Result<(&'a HgPath, &'a HgPath), DirstateV2ParseError>>

              + Send

              + 'a,

      >;

	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

				// dirstate module
				//
				// Copyright 2019 Raphaël Gomès <rgomes@octobus.net>
				//
				// This software may be used and distributed according to the terms of the
				// GNU General Public License version 2 or any later version.

				use crate::dirstate_tree::on_disk::DirstateV2ParseError;
				use crate::revlog::node::NULL_NODE;
				use crate::revlog::Node;
				use crate::utils::hg_path::HgPath;
				use bytes_cast::BytesCast;

				pub mod dirs_multiset;
				pub mod entry;
				pub mod parsers;
				pub mod status;

				pub use self::entry::*;

				#[derive(Debug, PartialEq, Copy, Clone, BytesCast)]
				#[repr(C)]
				pub struct DirstateParents {
				pub p1: Node,
				pub p2: Node,
				}

				impl DirstateParents {
				pub const NULL: Self = Self {
				p1: NULL_NODE,
				p2: NULL_NODE,
				};

				pub fn is_merge(&self) -> bool {
				!(self.p2 == NULL_NODE)
				}
				}

				pub type StateMapIter<'a> = Box<
				dyn Iterator<
				Item = Result<(&'a HgPath, DirstateEntry), DirstateV2ParseError>,
				> + Send
				+ 'a,
				>;

				pub type CopyMapIter<'a> = Box<
				dyn Iterator<Item = Result<(&'a HgPath, &'a HgPath), DirstateV2ParseError>>
				+ Send
				+ 'a,
				>;