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

rust-nodemap: mutable NodeTree data structure...

rust-nodemap: mutable NodeTree data structure Thanks to the previously indexing abstraction, the only difference in the lookup algorithm is that we don't need the special case for an empty NodeTree any more. We've considered making the mutable root an `Option<Block>`, but that leads to unpleasant checks and `unwrap()` unless we abstract it as typestate patterns (`NodeTree<Immutable>` and `NodeTree<Mutated>`) which seem exaggerated in that case. The initial copy of the root block is a very minor performance penalty, given that it typically occurs just once per transaction. Differential Revision: https://phab.mercurial-scm.org/D7793

Georges Racinet - - Load All Authors

File last commit:

r40336:72b94f94 default


                r44646:a1933145

default

Download file

             lib.rs
        
                    19 lines
            
             | 609 B
            
                | application/rls-services+xml
            
             |
                RustLexer
            
             / rust / hg-direct-ffi / 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.

      //! Bindings for CPython extension code

      //!

      //! This exposes methods to build and use a `rustlazyancestors` iterator

      //! from C code, using an index and its parents function that are passed

      //! from the caller at instantiation.

      extern crate hg;

      extern crate libc;

      mod ancestors;

      pub use ancestors::{

          rustlazyancestors_contains, rustlazyancestors_drop,

          rustlazyancestors_init, rustlazyancestors_next,

      };

	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.

				//! Bindings for CPython extension code
				//!
				//! This exposes methods to build and use a `rustlazyancestors` iterator
				//! from C code, using an index and its parents function that are passed
				//! from the caller at instantiation.

				extern crate hg;
				extern crate libc;

				mod ancestors;
				pub use ancestors::{
				rustlazyancestors_contains, rustlazyancestors_drop,
				rustlazyancestors_init, rustlazyancestors_next,
				};