##// END OF EJS Templates
rust-nodemap: abstracting the indexing...
rust-nodemap: abstracting the indexing In the forthcoming mutable implementation, we'll have to visit node trees that are more complex than a single slice, although the algorithm will still be expressed in simple indexing terms. We still refrain using `#[inline]` indications as being premature optimizations, but we strongly hope the compiler will indeed inline most of the glue. Differential Revision: https://phab.mercurial-scm.org/D7792

File last commit:

r40336:72b94f94 default
r44645:220d4d2e default
Show More
lib.rs
19 lines | 609 B | application/rls-services+xml | RustLexer
// 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,
};