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

rust-discovery: optimization of add commons/missings for empty arguments...

rust-discovery: optimization of add commons/missings for empty arguments These two cases have to be catched early for different reasons. In the case of add_missing_revisions, we don't want to trigger the computation of the undecided set (and the children cache) too early: the later the better. In the case of add_common_revisions, the inner `MissingAncestors` object wouldn't know that all ancestors of its bases have already been removed from the undecided. In principle, that would in itself be a lead for further improvement: this remove_ancestors_from could be more incremental, but the current performance seems to be good enough. Differential Revision: https://phab.mercurial-scm.org/D6429

Georges Racinet - - Load All Authors

File last commit:

r40336:72b94f94 default


                r42971:c5748c69

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,
				};