rust: rustlazyancestors.__contains__ This changeset provides a Rust implementation of the iteration performed by lazyancestor.__contains__ It has the advantage over the Python iteration to use the 'seen' set encapsuled into the dedicated iterator (self._containsiter), rather than storing emitted items in another set (self._containsseen), and hence should reduce the memory footprint. Also, there's no need to convert intermediate emitted revisions back into Python integers. At this point, it would be tempting to implement the whole lazyancestor object in Rust, but that would lead to more C wrapping code (two objects) for little expected benefits.

--- a/rust/hg-direct-ffi/src/lib.rs	Sun Oct 14 01:39:22 2018 -0400
+++ b/rust/hg-direct-ffi/src/lib.rs	Mon Oct 08 19:11:41 2018 +0200
@@ -13,4 +13,7 @@
 extern crate libc;
 
 mod ancestors;
-pub use ancestors::{rustlazyancestors_drop, rustlazyancestors_init, rustlazyancestors_next};
+pub use ancestors::{
+    rustlazyancestors_contains, rustlazyancestors_drop,
+    rustlazyancestors_init, rustlazyancestors_next,
+};