From 5da722b628c5ea7de49310534ec8d278972a2d59 Mon Sep 17 00:00:00 2001 From: Travis CI User Date: Sat, 19 May 2018 05:45:27 +0000 Subject: [PATCH] Automatic Travis documentation build --- master/aliases.js | 68 + master/crunchy/macro.unroll.html | 2 +- master/error_chain/struct.Backtrace.html | 8 +- master/error_chain/struct.ErrorChainIter.html | 2 +- master/itertools/enum.Either.html | 50 +- master/itertools/structs/struct.Batching.html | 2 +- master/itertools/structs/struct.Chunk.html | 2 +- master/itertools/structs/struct.Chunks.html | 2 +- master/itertools/structs/struct.Coalesce.html | 2 +- .../structs/struct.Combinations.html | 2 +- .../itertools/structs/struct.ConsTuples.html | 12 +- master/itertools/structs/struct.Dedup.html | 2 +- master/itertools/structs/struct.Flatten.html | 2 +- master/itertools/structs/struct.Group.html | 2 +- master/itertools/structs/struct.Groups.html | 2 +- .../itertools/structs/struct.Interleave.html | 2 +- .../structs/struct.InterleaveShortest.html | 2 +- .../itertools/structs/struct.Intersperse.html | 2 +- master/itertools/structs/struct.Iterate.html | 2 +- master/itertools/structs/struct.KMerge.html | 2 +- master/itertools/structs/struct.KMergeBy.html | 2 +- .../itertools/structs/struct.MapResults.html | 2 +- master/itertools/structs/struct.Merge.html | 2 +- master/itertools/structs/struct.MergeBy.html | 2 +- .../itertools/structs/struct.MultiPeek.html | 2 +- master/itertools/structs/struct.PadUsing.html | 2 +- .../structs/struct.PeekingTakeWhile.html | 2 +- master/itertools/structs/struct.Product.html | 2 +- master/itertools/structs/struct.PutBack.html | 2 +- master/itertools/structs/struct.PutBackN.html | 2 +- master/itertools/structs/struct.RcIter.html | 2 +- .../itertools/structs/struct.RepeatCall.html | 2 +- master/itertools/structs/struct.RepeatN.html | 2 +- master/itertools/structs/struct.Step.html | 2 +- .../structs/struct.TakeWhileRef.html | 2 +- master/itertools/structs/struct.Tee.html | 2 +- .../itertools/structs/struct.TupleBuffer.html | 2 +- .../structs/struct.TupleCombinations.html | 2 +- .../structs/struct.TupleWindows.html | 2 +- master/itertools/structs/struct.Tuples.html | 2 +- master/itertools/structs/struct.Unfold.html | 2 +- master/itertools/structs/struct.Unique.html | 2 +- master/itertools/structs/struct.UniqueBy.html | 2 +- .../itertools/structs/struct.WhileSome.html | 2 +- .../structs/struct.WithPosition.html | 2 +- master/itertools/structs/struct.Zip.html | 16 +- master/itertools/structs/struct.ZipEq.html | 2 +- .../itertools/structs/struct.ZipLongest.html | 2 +- master/memmap/struct.Mmap.html | 48 +- master/memmap/struct.MmapMut.html | 98 +- master/nix/pty/struct.Winsize.html | 6 +- .../nix/sys/signal/struct.SignalIterator.html | 2 +- master/nix/sys/signalfd/struct.SignalFd.html | 2 +- master/nix/sys/signalfd/struct.siginfo.html | 6 +- .../nix/sys/socket/struct.CmsgIterator.html | 2 +- master/nix/sys/socket/struct.in6_addr.html | 6 +- master/nix/sys/socket/struct.in_addr.html | 6 +- master/nix/sys/socket/struct.sockaddr.html | 6 +- master/nix/sys/socket/struct.sockaddr_in.html | 6 +- .../nix/sys/socket/struct.sockaddr_in6.html | 6 +- .../sys/socket/struct.sockaddr_storage.html | 6 +- master/nix/sys/socket/struct.sockaddr_un.html | 6 +- master/nix/sys/stat/struct.FileStat.html | 6 +- master/owning_ref/trait.StableAddress.html | 4 +- master/rand/chacha/struct.ChaChaRng.html | 10 +- .../distributions/exponential/struct.Exp.html | 10 +- .../exponential/struct.Exp1.html | 10 +- .../gamma/struct.ChiSquared.html | 10 +- .../distributions/gamma/struct.FisherF.html | 10 +- .../distributions/gamma/struct.Gamma.html | 10 +- .../distributions/gamma/struct.StudentT.html | 10 +- .../normal/struct.LogNormal.html | 10 +- .../distributions/normal/struct.Normal.html | 10 +- .../normal/struct.StandardNormal.html | 10 +- .../distributions/range/struct.Range.html | 10 +- .../range/trait.SampleRange.html | 4 +- .../rand/distributions/struct.ChiSquared.html | 10 +- master/rand/distributions/struct.Exp.html | 10 +- master/rand/distributions/struct.FisherF.html | 10 +- master/rand/distributions/struct.Gamma.html | 10 +- .../rand/distributions/struct.LogNormal.html | 10 +- master/rand/distributions/struct.Normal.html | 10 +- .../rand/distributions/struct.RandSample.html | 10 +- master/rand/distributions/struct.Range.html | 10 +- .../rand/distributions/struct.StudentT.html | 10 +- .../rand/distributions/struct.Weighted.html | 8 +- .../trait.IndependentSample.html | 12 +- master/rand/distributions/trait.Sample.html | 14 +- master/rand/isaac/struct.Isaac64Rng.html | 10 +- master/rand/isaac/struct.IsaacRng.html | 10 +- .../reseeding/struct.ReseedWithDefault.html | 6 +- master/rand/struct.AsciiGenerator.html | 8 +- master/rand/struct.ChaChaRng.html | 10 +- master/rand/struct.Closed01.html | 4 +- master/rand/struct.Generator.html | 8 +- master/rand/struct.Isaac64Rng.html | 10 +- master/rand/struct.IsaacRng.html | 10 +- master/rand/struct.StdRng.html | 10 +- master/rand/struct.ThreadRng.html | 8 +- master/rand/struct.XorShiftRng.html | 8 +- master/rand/trait.Rand.html | 22 +- master/rand/trait.Rng.html | 16 +- master/rand/trait.SeedableRng.html | 2 +- .../hir/literal/struct.Literal.html | 66 +- .../hir/struct.ClassBytesIter.html | 2 +- .../hir/struct.ClassUnicodeIter.html | 2 +- master/search-index.js | 10 +- .../crunchy-37acb142db8f0457/out/lib.rs.html | 1633 +++++++++++++++++ master/src/serde/de/from_primitive.rs.html | 2 +- master/src/serde/de/ignored_any.rs.html | 2 +- master/src/serde/de/impls.rs.html | 2 +- master/src/serde/de/mod.rs.html | 2 +- master/src/serde/de/utf8.rs.html | 2 +- master/src/serde/de/value.rs.html | 2 +- master/src/serde/export.rs.html | 2 +- master/src/serde/lib.rs.html | 4 +- master/src/serde/macros.rs.html | 2 +- master/src/serde/private/de.rs.html | 2 +- master/src/serde/private/macros.rs.html | 2 +- master/src/serde/private/mod.rs.html | 2 +- master/src/serde/private/ser.rs.html | 2 +- master/src/serde/ser/impls.rs.html | 2 +- master/src/serde/ser/impossible.rs.html | 2 +- master/src/serde/ser/mod.rs.html | 2 +- master/src/serde_derive/bound.rs.html | 2 +- master/src/serde_derive/de.rs.html | 2 +- master/src/serde_derive/fragment.rs.html | 2 +- master/src/serde_derive/internals/ast.rs.html | 2 +- .../src/serde_derive/internals/attr.rs.html | 2 +- .../src/serde_derive/internals/case.rs.html | 2 +- .../src/serde_derive/internals/check.rs.html | 2 +- .../src/serde_derive/internals/ctxt.rs.html | 2 +- master/src/serde_derive/internals/mod.rs.html | 2 +- master/src/serde_derive/lib.rs.html | 4 +- master/src/serde_derive/pretend.rs.html | 2 +- master/src/serde_derive/ser.rs.html | 2 +- master/src/serde_derive/try.rs.html | 2 +- master/src/tantivy/query/range_query.rs.html | 58 +- master/src/tantivy/schema/term.rs.html | 12 + .../directory/enum.ReadOnlySource.html | 60 +- master/tantivy/query/struct.RangeQuery.html | 9 +- master/tantivy/query/trait.Query.html | 2 +- master/tantivy/schema/struct.Term.html | 22 +- master/tantivy/struct.Term.html | 22 +- master/tempfile/struct.NamedTempFile.html | 10 +- master/thread_local/struct.IntoIter.html | 2 +- master/thread_local/struct.IterMut.html | 2 +- 147 files changed, 2278 insertions(+), 532 deletions(-) create mode 100644 master/src/crunchy/home/travis/build/tantivy-search/tantivy/target/debug/build/crunchy-37acb142db8f0457/out/lib.rs.html diff --git a/master/aliases.js b/master/aliases.js index 6c5d8e5bc..5b957d496 100644 --- a/master/aliases.js +++ b/master/aliases.js @@ -1,73 +1,141 @@ var ALIASES = {}; ALIASES['aho_corasick'] = {}; +ALIASES['aho_corasick'] = {}; +ALIASES['ascii'] = {}; ALIASES['ascii'] = {}; ALIASES['atomicwrites'] = {}; +ALIASES['atomicwrites'] = {}; +ALIASES['backtrace'] = {}; ALIASES['backtrace'] = {}; ALIASES['backtrace_sys'] = {}; +ALIASES['backtrace_sys'] = {}; +ALIASES['base64'] = {}; ALIASES['base64'] = {}; ALIASES['bit_set'] = {}; +ALIASES['bit_set'] = {}; +ALIASES['bit_vec'] = {}; ALIASES['bit_vec'] = {}; ALIASES['bitflags'] = {}; +ALIASES['bitflags'] = {}; +ALIASES['bitpacking'] = {}; ALIASES['bitpacking'] = {}; ALIASES['byteorder'] = {}; +ALIASES['byteorder'] = {}; +ALIASES['cfg_if'] = {}; ALIASES['cfg_if'] = {}; ALIASES['chan'] = {}; +ALIASES['chan'] = {}; +ALIASES['combine'] = {}; ALIASES['combine'] = {}; ALIASES['crossbeam'] = {}; +ALIASES['crossbeam'] = {}; +ALIASES['crunchy'] = {}; ALIASES['crunchy'] = {}; ALIASES['downcast'] = {}; +ALIASES['downcast'] = {}; +ALIASES['dtoa'] = {}; ALIASES['dtoa'] = {}; ALIASES['either'] = {}; +ALIASES['either'] = {}; +ALIASES['error_chain'] = {}; ALIASES['error_chain'] = {}; ALIASES['fnv'] = {}; +ALIASES['fnv'] = {}; +ALIASES['fst'] = {}; ALIASES['fst'] = {}; ALIASES['futures'] = {}; +ALIASES['futures'] = {}; +ALIASES['futures_cpupool'] = {}; ALIASES['futures_cpupool'] = {}; ALIASES['itertools'] = {}; +ALIASES['itertools'] = {}; +ALIASES['itoa'] = {}; ALIASES['itoa'] = {}; ALIASES['lazy_static'] = {}; ALIASES['lazy_static'] = {}; ALIASES['lazy_static'] = {}; +ALIASES['lazy_static'] = {}; +ALIASES['lazy_static'] = {}; +ALIASES['lazy_static'] = {}; ALIASES['levenshtein_automata'] = {}; +ALIASES['levenshtein_automata'] = {}; +ALIASES['libc'] = {}; ALIASES['libc'] = {}; ALIASES['log'] = {}; ALIASES['log'] = {}; +ALIASES['log'] = {}; +ALIASES['log'] = {}; +ALIASES['lz4'] = {}; ALIASES['lz4'] = {}; ALIASES['lz4_sys'] = {}; +ALIASES['lz4_sys'] = {}; +ALIASES['maplit'] = {}; ALIASES['maplit'] = {}; ALIASES['matches'] = {}; +ALIASES['matches'] = {}; +ALIASES['memchr'] = {}; ALIASES['memchr'] = {}; ALIASES['memmap'] = {}; +ALIASES['memmap'] = {}; +ALIASES['nix'] = {}; ALIASES['nix'] = {}; ALIASES['num_cpus'] = {}; +ALIASES['num_cpus'] = {}; +ALIASES['owning_ref'] = {}; ALIASES['owning_ref'] = {}; ALIASES['proc_macro2'] = {}; +ALIASES['proc_macro2'] = {}; +ALIASES['quote'] = {}; ALIASES['quote'] = {}; ALIASES['rand'] = {}; ALIASES['rand'] = {}; +ALIASES['rand'] = {}; +ALIASES['rand'] = {}; +ALIASES['regex'] = {}; ALIASES['regex'] = {}; ALIASES['regex_syntax'] = {}; +ALIASES['regex_syntax'] = {}; +ALIASES['remove_dir_all'] = {}; ALIASES['remove_dir_all'] = {}; ALIASES['rust_stemmers'] = {}; +ALIASES['rust_stemmers'] = {}; +ALIASES['rustc_demangle'] = {}; ALIASES['rustc_demangle'] = {}; ALIASES['safemem'] = {}; +ALIASES['safemem'] = {}; +ALIASES['serde'] = {}; ALIASES['serde'] = {}; ALIASES['serde_derive'] = {}; +ALIASES['serde_derive'] = {}; +ALIASES['serde_json'] = {}; ALIASES['serde_json'] = {}; ALIASES['stable_deref_trait'] = {}; +ALIASES['stable_deref_trait'] = {}; +ALIASES['syn'] = {}; ALIASES['syn'] = {}; ALIASES['tantivy'] = {}; ALIASES['tantivy'] = {}; ALIASES['tantivy'] = {}; ALIASES['tantivy'] = {}; ALIASES['tantivy'] = {}; +ALIASES['tantivy'] = {}; +ALIASES['tempdir'] = {}; ALIASES['tempdir'] = {}; ALIASES['tempfile'] = {}; +ALIASES['tempfile'] = {}; +ALIASES['thread_local'] = {}; ALIASES['thread_local'] = {}; ALIASES['tinysegmenter'] = {}; +ALIASES['tinysegmenter'] = {}; +ALIASES['ucd_util'] = {}; ALIASES['ucd_util'] = {}; ALIASES['unicode_xid'] = {}; +ALIASES['unicode_xid'] = {}; +ALIASES['unreachable'] = {}; ALIASES['unreachable'] = {}; ALIASES['utf8_ranges'] = {}; +ALIASES['utf8_ranges'] = {}; +ALIASES['uuid'] = {}; ALIASES['uuid'] = {}; ALIASES['void'] = {}; +ALIASES['void'] = {}; diff --git a/master/crunchy/macro.unroll.html b/master/crunchy/macro.unroll.html index 3bb23bdff..2f08666b8 100644 --- a/master/crunchy/macro.unroll.html +++ b/master/crunchy/macro.unroll.html @@ -1,4 +1,4 @@ -crunchy::unroll - Rust

Macro crunchy::unroll[−][src]

+crunchy::unroll - Rust
Macro crunchy::unroll[−][src]
 macro_rules! unroll {
     (for $v:ident in 0..0 $c:block) => { ... };
     (for $v:ident in 0..$b:tt {$($c:tt)*}) => { ... };
diff --git a/master/error_chain/struct.Backtrace.html b/master/error_chain/struct.Backtrace.html
index 9ba244db4..fee2e5d7f 100644
--- a/master/error_chain/struct.Backtrace.html
+++ b/master/error_chain/struct.Backtrace.html
@@ -1,4 +1,4 @@
-error_chain::Backtrace - Rust
Struct error_chain::Backtrace[−][src]
pub struct Backtrace { /* fields omitted */ }
Representation of an owned and self-contained backtrace.

+error_chain::Backtrace - Rust
Struct error_chain::Backtrace[−][src]
pub struct Backtrace { /* fields omitted */ }
Representation of an owned and self-contained backtrace.

 
This structure can be used to capture a backtrace at various points in a
 program and later used to inspect what the backtrace was at that time.

 

@@ -42,11 +42,11 @@ will resolve all addresses in the backtrace to their symbolic names.

                 

                   Trait Implementations
                 

-                
impl Clone for Backtrace
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

+                
impl From<Vec<BacktraceFrame>> for Backtrace
[src]
Performs the conversion.

 
impl Into<Vec<BacktraceFrame>> for Backtrace
[src]
ⓘImportant traits for Vec<u8>
Performs the conversion.

-
impl From<Vec<BacktraceFrame>> for Backtrace
[src]
Performs the conversion.

 
impl Debug for Backtrace
[src]
Formats the value using the given formatter. Read more

+
impl Clone for Backtrace
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Default for Backtrace
[src]
Returns the "default value" for a type. Read more

 

                 

diff --git a/master/error_chain/struct.ErrorChainIter.html b/master/error_chain/struct.ErrorChainIter.html
index d886f1ce5..e849d4ea8 100644
--- a/master/error_chain/struct.ErrorChainIter.html
+++ b/master/error_chain/struct.ErrorChainIter.html
@@ -27,7 +27,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/enum.Either.html b/master/itertools/enum.Either.html
index 25c664267..8f55f27a7 100644
--- a/master/itertools/enum.Either.html
+++ b/master/itertools/enum.Either.html
@@ -1,4 +1,4 @@
-itertools::Either - Rust
Enum itertools::Either[−][src]
pub enum Either<L, R> {
+itertools::Either - Rust
Enum itertools::Either[−][src]
pub enum Either<L, R> {
     Left(L),
     Right(R),
 }
The enum Either with variants Left and Right is a general purpose
@@ -205,11 +205,9 @@ functions ends up being called.

                 

                   Trait Implementations
                 

-                
impl<L, R> ExactSizeIterator for Either<L, R> where
    L: ExactSizeIterator,
    R: ExactSizeIterator<Item = <L as Iterator>::Item>, 
[src]
Returns the exact number of times the iterator will iterate. Read more

-
🔬 This is a nightly-only experimental API.  (exact_size_is_empty)
Returns whether the iterator is empty. Read more

-
impl<L, R> From<Result<R, L>> for Either<L, R>
[src]
Convert from Result to Either with Ok => Right and Err => Left.

-
ⓘImportant traits for Either<L, R>
Performs the conversion.

-
impl<L, R> Debug for Either<L, R> where
    L: Debug,
    R: Debug, 
[src]
Formats the value using the given formatter. Read more

+                
impl<L, R> DerefMut for Either<L, R> where
    L: DerefMut,
    R: DerefMut<Target = <L as Deref>::Target>, 
[src]
ⓘImportant traits for Either<L, R>
Mutably dereferences the value.

+
impl<L, R> Clone for Either<L, R> where
    L: Clone,
    R: Clone, 
[src]
ⓘImportant traits for Either<L, R>
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<L, R> Iterator for Either<L, R> where
    L: Iterator,
    R: Iterator<Item = <L as Iterator>::Item>, 
[src]
Either<L, R> is an iterator if both L and R are iterators.

 

 
The type of the elements being iterated over.

@@ -238,7 +236,7 @@ functions ends up being called.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Consumes an iterator, creating two collections from it. Read more

@@ -270,35 +268,37 @@ functions ends up being called.

 
Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more

 
Determines if the elements of this Iterator are lexicographically greater than those of another. Read more

 
Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more

-
impl<L, R> Display for Either<L, R> where
    L: Display,
    R: Display, 
[src]
Formats the value using the given formatter. Read more

 
impl<L, R> PartialOrd<Either<L, R>> for Either<L, R> where
    L: PartialOrd<L>,
    R: PartialOrd<R>, 
[src]
This method returns an ordering between self and other values if one exists. Read more

 
This method tests less than (for self and other) and is used by the < operator. Read more

 
This method tests less than or equal to (for self and other) and is used by the <= operator. Read more

 
This method tests greater than (for self and other) and is used by the > operator. Read more

 
This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

-
impl<L, R> Ord for Either<L, R> where
    L: Ord,
    R: Ord, 
[src]
This method returns an Ordering between self and other. Read more

-
Compares and returns the maximum of two values. Read more

-
Compares and returns the minimum of two values. Read more

-
impl<L, R> Deref for Either<L, R> where
    L: Deref,
    R: Deref<Target = <L as Deref>::Target>, 
[src]

-
The resulting type after dereferencing.

-
ⓘImportant traits for Either<L, R>
Dereferences the value.

-
impl<L, R, Target> AsMut<Target> for Either<L, R> where
    L: AsMut<Target>,
    R: AsMut<Target>, 
[src]
ⓘImportant traits for &'a mut R
Performs the conversion.

+
impl<L, R> Debug for Either<L, R> where
    L: Debug,
    R: Debug, 
[src]
Formats the value using the given formatter. Read more

+
impl<L, R> Display for Either<L, R> where
    L: Display,
    R: Display, 
[src]
Formats the value using the given formatter. Read more

 
impl<L, R> Hash for Either<L, R> where
    L: Hash,
    R: Hash, 
[src]
Feeds this value into the given [Hasher]. Read more

 
Feeds a slice of this type into the given [Hasher]. Read more

+
impl<L, R> Into<Result<R, L>> for Either<L, R>
[src]
Convert from Either to Result with Right => Ok and Left => Err.

+
Performs the conversion.

+
impl<L, R> From<Result<R, L>> for Either<L, R>
[src]
Convert from Result to Either with Ok => Right and Err => Left.

+
ⓘImportant traits for Either<L, R>
Performs the conversion.

+
impl<L, R> PartialEq<Either<L, R>> for Either<L, R> where
    L: PartialEq<L>,
    R: PartialEq<R>, 
[src]
This method tests for self and other values to be equal, and is used by ==. Read more

+
This method tests for !=.

+
impl<L, R> Eq for Either<L, R> where
    L: Eq,
    R: Eq, 
[src]
impl<L, R, A> Extend<A> for Either<L, R> where
    L: Extend<A>,
    R: Extend<A>, 
[src]
Extends a collection with the contents of an iterator. Read more

+
impl<L, R, Target> AsRef<Target> for Either<L, R> where
    L: AsRef<Target>,
    R: AsRef<Target>, 
[src]
ⓘImportant traits for &'a mut R
Performs the conversion.

+
impl<L, R> Copy for Either<L, R> where
    L: Copy,
    R: Copy, 
[src]
impl<L, R> Ord for Either<L, R> where
    L: Ord,
    R: Ord, 
[src]
This method returns an Ordering between self and other. Read more

+
Compares and returns the maximum of two values. Read more

+
Compares and returns the minimum of two values. Read more

+
impl<L, R, Target> AsMut<Target> for Either<L, R> where
    L: AsMut<Target>,
    R: AsMut<Target>, 
[src]
ⓘImportant traits for &'a mut R
Performs the conversion.

 
impl<L, R> DoubleEndedIterator for Either<L, R> where
    L: DoubleEndedIterator,
    R: DoubleEndedIterator<Item = <L as Iterator>::Item>, 
[src]
Removes and returns an element from the end of the iterator. Read more

 
This is the reverse version of [try_fold()]: it takes elements starting from the back of the iterator. Read more

 
An iterator method that reduces the iterator's elements to a single, final value, starting from the back. Read more

 
Searches for an element of an iterator from the back that satisfies a predicate. Read more

-
impl<L, R> Into<Result<R, L>> for Either<L, R>
[src]
Convert from Either to Result with Right => Ok and Left => Err.

-
Performs the conversion.

-
impl<L, R> DerefMut for Either<L, R> where
    L: DerefMut,
    R: DerefMut<Target = <L as Deref>::Target>, 
[src]
ⓘImportant traits for Either<L, R>
Mutably dereferences the value.

-
impl<L, R> Clone for Either<L, R> where
    L: Clone,
    R: Clone, 
[src]
ⓘImportant traits for Either<L, R>
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl<L, R> PartialEq<Either<L, R>> for Either<L, R> where
    L: PartialEq<L>,
    R: PartialEq<R>, 
[src]
This method tests for self and other values to be equal, and is used by ==. Read more

-
This method tests for !=.

-
impl<L, R> Copy for Either<L, R> where
    L: Copy,
    R: Copy, 
[src]
impl<L, R, A> Extend<A> for Either<L, R> where
    L: Extend<A>,
    R: Extend<A>, 
[src]
Extends a collection with the contents of an iterator. Read more

-
impl<L, R, Target> AsRef<Target> for Either<L, R> where
    L: AsRef<Target>,
    R: AsRef<Target>, 
[src]
ⓘImportant traits for &'a mut R
Performs the conversion.

-
impl<L, R> Eq for Either<L, R> where
    L: Eq,
    R: Eq, 
[src]

+
impl<L, R> Deref for Either<L, R> where
    L: Deref,
    R: Deref<Target = <L as Deref>::Target>, 
[src]

+
The resulting type after dereferencing.

+
ⓘImportant traits for Either<L, R>
Dereferences the value.

+
impl<L, R> ExactSizeIterator for Either<L, R> where
    L: ExactSizeIterator,
    R: ExactSizeIterator<Item = <L as Iterator>::Item>, 
[src]
Returns the exact number of times the iterator will iterate. Read more

+
🔬 This is a nightly-only experimental API.  (exact_size_is_empty)
Returns whether the iterator is empty. Read more

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/itertools/structs/struct.Batching.html b/master/itertools/structs/struct.Batching.html
index 8478abe5f..b58151ce5 100644
--- a/master/itertools/structs/struct.Batching.html
+++ b/master/itertools/structs/struct.Batching.html
@@ -33,7 +33,7 @@ and may pick off as many elements as it likes, to produce the next iterator elem
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Chunk.html b/master/itertools/structs/struct.Chunk.html
index f902959a5..3c08b92ce 100644
--- a/master/itertools/structs/struct.Chunk.html
+++ b/master/itertools/structs/struct.Chunk.html
@@ -29,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Chunks.html b/master/itertools/structs/struct.Chunks.html
index 758d7c972..66e6b1917 100644
--- a/master/itertools/structs/struct.Chunks.html
+++ b/master/itertools/structs/struct.Chunks.html
@@ -29,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Coalesce.html b/master/itertools/structs/struct.Coalesce.html
index f473c5e39..ca112bf5a 100644
--- a/master/itertools/structs/struct.Coalesce.html
+++ b/master/itertools/structs/struct.Coalesce.html
@@ -31,7 +31,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Combinations.html b/master/itertools/structs/struct.Combinations.html
index ca4aa52e3..1072383bc 100644
--- a/master/itertools/structs/struct.Combinations.html
+++ b/master/itertools/structs/struct.Combinations.html
@@ -29,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.ConsTuples.html b/master/itertools/structs/struct.ConsTuples.html
index 334299729..de88a0525 100644
--- a/master/itertools/structs/struct.ConsTuples.html
+++ b/master/itertools/structs/struct.ConsTuples.html
@@ -29,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -92,7 +92,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -155,7 +155,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -218,7 +218,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -281,7 +281,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -344,7 +344,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Dedup.html b/master/itertools/structs/struct.Dedup.html
index 9f71aa611..9fec6c5f9 100644
--- a/master/itertools/structs/struct.Dedup.html
+++ b/master/itertools/structs/struct.Dedup.html
@@ -32,7 +32,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Flatten.html b/master/itertools/structs/struct.Flatten.html
index 083f2e047..8eb8c6909 100644
--- a/master/itertools/structs/struct.Flatten.html
+++ b/master/itertools/structs/struct.Flatten.html
@@ -32,7 +32,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Group.html b/master/itertools/structs/struct.Group.html
index de09bf849..1a1761b32 100644
--- a/master/itertools/structs/struct.Group.html
+++ b/master/itertools/structs/struct.Group.html
@@ -29,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Groups.html b/master/itertools/structs/struct.Groups.html
index 18f2836cb..4b74b59fe 100644
--- a/master/itertools/structs/struct.Groups.html
+++ b/master/itertools/structs/struct.Groups.html
@@ -30,7 +30,7 @@ the group's key K and the group's iterator.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Interleave.html b/master/itertools/structs/struct.Interleave.html
index a9855b9fa..1593a8525 100644
--- a/master/itertools/structs/struct.Interleave.html
+++ b/master/itertools/structs/struct.Interleave.html
@@ -33,7 +33,7 @@ run out.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.InterleaveShortest.html b/master/itertools/structs/struct.InterleaveShortest.html
index cbde730b9..c67636d81 100644
--- a/master/itertools/structs/struct.InterleaveShortest.html
+++ b/master/itertools/structs/struct.InterleaveShortest.html
@@ -34,7 +34,7 @@ for more information.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Intersperse.html b/master/itertools/structs/struct.Intersperse.html
index a0bf6b63f..b5c700041 100644
--- a/master/itertools/structs/struct.Intersperse.html
+++ b/master/itertools/structs/struct.Intersperse.html
@@ -33,7 +33,7 @@ between each element of the adapted iterator.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Iterate.html b/master/itertools/structs/struct.Iterate.html
index 9dcd7b6ce..1fbdb4d1f 100644
--- a/master/itertools/structs/struct.Iterate.html
+++ b/master/itertools/structs/struct.Iterate.html
@@ -31,7 +31,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.KMerge.html b/master/itertools/structs/struct.KMerge.html
index 75c17fdd6..217cf70d1 100644
--- a/master/itertools/structs/struct.KMerge.html
+++ b/master/itertools/structs/struct.KMerge.html
@@ -32,7 +32,7 @@ If all base iterators are sorted (ascending), the result is sorted.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.KMergeBy.html b/master/itertools/structs/struct.KMergeBy.html
index bb6aa01d4..8a631484e 100644
--- a/master/itertools/structs/struct.KMergeBy.html
+++ b/master/itertools/structs/struct.KMergeBy.html
@@ -31,7 +31,7 @@ information.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.MapResults.html b/master/itertools/structs/struct.MapResults.html
index 54b993b6f..3e68b9447 100644
--- a/master/itertools/structs/struct.MapResults.html
+++ b/master/itertools/structs/struct.MapResults.html
@@ -28,7 +28,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Merge.html b/master/itertools/structs/struct.Merge.html
index cb71b2be6..40298cea1 100644
--- a/master/itertools/structs/struct.Merge.html
+++ b/master/itertools/structs/struct.Merge.html
@@ -33,7 +33,7 @@ If both base iterators are sorted (ascending), the result is sorted.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.MergeBy.html b/master/itertools/structs/struct.MergeBy.html
index e3e3183a2..3e19e9b01 100644
--- a/master/itertools/structs/struct.MergeBy.html
+++ b/master/itertools/structs/struct.MergeBy.html
@@ -33,7 +33,7 @@ If both base iterators are sorted (ascending), the result is sorted.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.MultiPeek.html b/master/itertools/structs/struct.MultiPeek.html
index dacec525a..291e9ff83 100644
--- a/master/itertools/structs/struct.MultiPeek.html
+++ b/master/itertools/structs/struct.MultiPeek.html
@@ -38,7 +38,7 @@ further ahead.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.PadUsing.html b/master/itertools/structs/struct.PadUsing.html
index b213144da..b0ece0477 100644
--- a/master/itertools/structs/struct.PadUsing.html
+++ b/master/itertools/structs/struct.PadUsing.html
@@ -32,7 +32,7 @@ missing elements using a closure.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.PeekingTakeWhile.html b/master/itertools/structs/struct.PeekingTakeWhile.html
index e9ac2713b..2c2a6784f 100644
--- a/master/itertools/structs/struct.PeekingTakeWhile.html
+++ b/master/itertools/structs/struct.PeekingTakeWhile.html
@@ -29,7 +29,7 @@ for more information.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Product.html b/master/itertools/structs/struct.Product.html
index 16f1d5fbe..1e7bd94f7 100644
--- a/master/itertools/structs/struct.Product.html
+++ b/master/itertools/structs/struct.Product.html
@@ -33,7 +33,7 @@ the element sets of two iterators I and J.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.PutBack.html b/master/itertools/structs/struct.PutBack.html
index 75cb97bbc..bde123cf9 100644
--- a/master/itertools/structs/struct.PutBack.html
+++ b/master/itertools/structs/struct.PutBack.html
@@ -42,7 +42,7 @@ item to the front of the iterator.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.PutBackN.html b/master/itertools/structs/struct.PutBackN.html
index 90c99e1f2..d8bee8f11 100644
--- a/master/itertools/structs/struct.PutBackN.html
+++ b/master/itertools/structs/struct.PutBackN.html
@@ -49,7 +49,7 @@ values first.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.RcIter.html b/master/itertools/structs/struct.RcIter.html
index d745bd283..cfe2398c8 100644
--- a/master/itertools/structs/struct.RcIter.html
+++ b/master/itertools/structs/struct.RcIter.html
@@ -37,7 +37,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.RepeatCall.html b/master/itertools/structs/struct.RepeatCall.html
index d60126473..c51d828e8 100644
--- a/master/itertools/structs/struct.RepeatCall.html
+++ b/master/itertools/structs/struct.RepeatCall.html
@@ -28,7 +28,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.RepeatN.html b/master/itertools/structs/struct.RepeatN.html
index e9c4e4e29..0e5212ea1 100644
--- a/master/itertools/structs/struct.RepeatN.html
+++ b/master/itertools/structs/struct.RepeatN.html
@@ -33,7 +33,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Step.html b/master/itertools/structs/struct.Step.html
index abab7e894..fae2e1c05 100644
--- a/master/itertools/structs/struct.Step.html
+++ b/master/itertools/structs/struct.Step.html
@@ -34,7 +34,7 @@ then skipping forward n-1 elements.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.TakeWhileRef.html b/master/itertools/structs/struct.TakeWhileRef.html
index ac099de58..9e6d705da 100644
--- a/master/itertools/structs/struct.TakeWhileRef.html
+++ b/master/itertools/structs/struct.TakeWhileRef.html
@@ -30,7 +30,7 @@ to only pick off elements while the predicate returns true.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Tee.html b/master/itertools/structs/struct.Tee.html
index 10ed5a5f7..db171499e 100644
--- a/master/itertools/structs/struct.Tee.html
+++ b/master/itertools/structs/struct.Tee.html
@@ -28,7 +28,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.TupleBuffer.html b/master/itertools/structs/struct.TupleBuffer.html
index 0ff46bea4..170dda2dd 100644
--- a/master/itertools/structs/struct.TupleBuffer.html
+++ b/master/itertools/structs/struct.TupleBuffer.html
@@ -29,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.TupleCombinations.html b/master/itertools/structs/struct.TupleCombinations.html
index 47e4abb66..278d525ab 100644
--- a/master/itertools/structs/struct.TupleCombinations.html
+++ b/master/itertools/structs/struct.TupleCombinations.html
@@ -31,7 +31,7 @@ information.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.TupleWindows.html b/master/itertools/structs/struct.TupleWindows.html
index ef4c73901..55eb27bd7 100644
--- a/master/itertools/structs/struct.TupleWindows.html
+++ b/master/itertools/structs/struct.TupleWindows.html
@@ -29,7 +29,7 @@ information.

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Tuples.html b/master/itertools/structs/struct.Tuples.html
index c9104e1e7..dad2caa5a 100644
--- a/master/itertools/structs/struct.Tuples.html
+++ b/master/itertools/structs/struct.Tuples.html
@@ -41,7 +41,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Unfold.html b/master/itertools/structs/struct.Unfold.html
index cc25f9d9e..ce3ad8b47 100644
--- a/master/itertools/structs/struct.Unfold.html
+++ b/master/itertools/structs/struct.Unfold.html
@@ -39,7 +39,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Unique.html b/master/itertools/structs/struct.Unique.html
index f92ab2fd6..8a0384d73 100644
--- a/master/itertools/structs/struct.Unique.html
+++ b/master/itertools/structs/struct.Unique.html
@@ -28,7 +28,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.UniqueBy.html b/master/itertools/structs/struct.UniqueBy.html
index 3db16e700..e25efb033 100644
--- a/master/itertools/structs/struct.UniqueBy.html
+++ b/master/itertools/structs/struct.UniqueBy.html
@@ -31,7 +31,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.WhileSome.html b/master/itertools/structs/struct.WhileSome.html
index 01e3dfa22..190e2b212 100644
--- a/master/itertools/structs/struct.WhileSome.html
+++ b/master/itertools/structs/struct.WhileSome.html
@@ -32,7 +32,7 @@ and produces A. Stops on the first None encountered.
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.WithPosition.html b/master/itertools/structs/struct.WithPosition.html
index f3359dbe0..4da39a4ad 100644
--- a/master/itertools/structs/struct.WithPosition.html
+++ b/master/itertools/structs/struct.WithPosition.html
@@ -29,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.Zip.html b/master/itertools/structs/struct.Zip.html
index 320c04939..27038d820 100644
--- a/master/itertools/structs/struct.Zip.html
+++ b/master/itertools/structs/struct.Zip.html
@@ -36,7 +36,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -98,7 +98,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -160,7 +160,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -222,7 +222,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -284,7 +284,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -346,7 +346,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -408,7 +408,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -470,7 +470,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.ZipEq.html b/master/itertools/structs/struct.ZipEq.html
index 58691b2c0..38d206bad 100644
--- a/master/itertools/structs/struct.ZipEq.html
+++ b/master/itertools/structs/struct.ZipEq.html
@@ -31,7 +31,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/itertools/structs/struct.ZipLongest.html b/master/itertools/structs/struct.ZipLongest.html
index 2b02d234e..f33cb4eac 100644
--- a/master/itertools/structs/struct.ZipLongest.html
+++ b/master/itertools/structs/struct.ZipLongest.html
@@ -32,7 +32,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/memmap/struct.Mmap.html b/master/memmap/struct.Mmap.html
index be4164b1f..63c5cf647 100644
--- a/master/memmap/struct.Mmap.html
+++ b/master/memmap/struct.Mmap.html
@@ -57,17 +57,17 @@ variety of reasons, such as when the file is not open with writable permissions.
                     

                       Methods from Deref<Target = [u8]>
                     

-                
Returns the number of elements in the slice.

+                
Returns the number of elements in the slice.

 
Examples

 
 let a = [1, 2, 3];
 assert_eq!(a.len(), 3);

-
Returns true if the slice has a length of 0.

+
Returns true if the slice has a length of 0.

 
Examples

 
 let a = [1, 2, 3];
 assert!(!a.is_empty());

-
Returns the first element of the slice, or None if it is empty.

+
Returns the first element of the slice, or None if it is empty.

 
Examples

 
 let v = [10, 40, 30];
@@ -75,7 +75,7 @@ variety of reasons, such as when the file is not open with writable permissions.
 
 let w: &[i32] = &[];
 assert_eq!(None, w.first());

-
Returns the first and all the rest of the elements of the slice, or None if it is empty.

+
Returns the first and all the rest of the elements of the slice, or None if it is empty.

 
Examples

 
 let x = &[0, 1, 2];
@@ -84,7 +84,7 @@ variety of reasons, such as when the file is not open with writable permissions.
     assert_eq!(first, &0);
     assert_eq!(elements, &[1, 2]);
 }

-
Returns the last and all the rest of the elements of the slice, or None if it is empty.

+
Returns the last and all the rest of the elements of the slice, or None if it is empty.

 
Examples

 
 let x = &[0, 1, 2];
@@ -93,7 +93,7 @@ variety of reasons, such as when the file is not open with writable permissions.
     assert_eq!(last, &2);
     assert_eq!(elements, &[0, 1]);
 }

-
Returns the last element of the slice, or None if it is empty.

+
Returns the last element of the slice, or None if it is empty.

 
Examples

 
 let v = [10, 40, 30];
@@ -101,7 +101,7 @@ variety of reasons, such as when the file is not open with writable permissions.
 
 let w: &[i32] = &[];
 assert_eq!(None, w.last());

-
Returns a reference to an element or subslice depending on the type of
+
Returns a reference to an element or subslice depending on the type of
 index.

 
    
 
  • If given a position, returns a reference to the element at that
@@ -116,7 +116,7 @@ or None if out of bounds.
    • 
 assert_eq!(Some(&[10, 40][..]), v.get(0..2));
 assert_eq!(None, v.get(3));
 assert_eq!(None, v.get(0..4));

-
Returns a reference to an element or subslice, without doing bounds
+
Returns a reference to an element or subslice, without doing bounds
 checking.

 
This is generally not recommended, use with caution! For a safe
 alternative see get.

@@ -127,7 +127,7 @@ alternative see get.

 unsafe {
     assert_eq!(x.get_unchecked(1), &2);
 }

-
Returns a raw pointer to the slice's buffer.

+
Returns a raw pointer to the slice's buffer.

 
The caller must ensure that the slice outlives the pointer this
 function returns, or else it will end up pointing to garbage.

 
Modifying the container referenced by this slice may cause its buffer
@@ -142,7 +142,7 @@ to be reallocated, which would also make any pointers to it invalid.

         assert_eq!(x.get_unchecked(i), &*x_ptr.offset(i as isize));
     }
 }
-

Returns an iterator over the slice.

+

Returns an iterator over the slice.

Examples

 let x = &[1, 2, 4];
@@ -152,7 +152,7 @@ to be reallocated, which would also make any pointers to it invalid.

 assert_eq!(iterator.next(), Some(&2));
 assert_eq!(iterator.next(), Some(&4));
 assert_eq!(iterator.next(), None);
-

Returns an iterator over all contiguous windows of length +

Returns an iterator over all contiguous windows of length size. The windows overlap. If the slice is shorter than size, the iterator returns no values.

Panics

@@ -171,7 +171,7 @@ to be reallocated, which would also make any pointers to it invalid.

let slice = ['f', 'o', 'o']; let mut iter = slice.windows(4); assert!(iter.next().is_none()); -

Returns an iterator over chunk_size elements of the slice at a +

Returns an iterator over chunk_size elements of the slice at a time. The chunks are slices and do not overlap. If chunk_size does not divide the length of the slice, then the last chunk will not have length chunk_size.

@@ -187,7 +187,7 @@ of always exactly chunk_size elements.

assert_eq!(iter.next().unwrap(), &['r', 'e']); assert_eq!(iter.next().unwrap(), &['m']); assert!(iter.next().is_none()); -

🔬 This is a nightly-only experimental API. (exact_chunks)

Returns an iterator over chunk_size elements of the slice at a +

🔬 This is a nightly-only experimental API. (exact_chunks)

Returns an iterator over chunk_size elements of the slice at a time. The chunks are slices and do not overlap. If chunk_size does not divide the length of the slice, then the last up to chunk_size-1 elements will be omitted.

@@ -205,7 +205,7 @@ can often optimize the resulting code better than in the case of assert_eq!(iter.next().unwrap(), &['l', 'o']); assert_eq!(iter.next().unwrap(), &['r', 'e']); assert!(iter.next().is_none()); -

Divides one slice into two at an index.

+

Divides one slice into two at an index.

The first will contain all indices from [0, mid) (excluding the index mid itself) and the second will contain all indices from [mid, len) (excluding the index len itself).

@@ -232,7 +232,7 @@ indices from [mid, len) (excluding the index len itsel assert!(left == [1, 2, 3, 4, 5, 6]); assert!(right == []); } -

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred. The matched element is not contained in the subslices.

Examples

@@ -265,7 +265,7 @@ present between them:

 assert_eq!(iter.next().unwrap(), &[]);
 assert_eq!(iter.next().unwrap(), &[20]);
 assert!(iter.next().is_none());
-

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred, starting at the end of the slice and working backwards. The matched element is not contained in the subslices.

Examples

@@ -287,7 +287,7 @@ slice will be the first (or last) item returned by the iterator.

assert_eq!(it.next().unwrap(), &[1, 1]); assert_eq!(it.next().unwrap(), &[]); assert_eq!(it.next(), None); -

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred, limited to returning at most n items. The matched element is not contained in the subslices.

The last element returned, if any, will contain the remainder of the @@ -302,7 +302,7 @@ slice.

for group in v.splitn(2, |num| *num % 3 == 0) { println!("{:?}", group); } -

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred limited to returning at most n items. This starts at the end of the slice and works backwards. The matched element is not contained in the subslices.

@@ -318,13 +318,13 @@ by 3 (i.e. [50], [10, 40, 30, 20]):

for group in v.rsplitn(2, |num| *num % 3 == 0) { println!("{:?}", group); } -

Returns true if the slice contains an element with the given value.

+

Returns true if the slice contains an element with the given value.

Examples

 let v = [10, 40, 30];
 assert!(v.contains(&30));
 assert!(!v.contains(&50));
-

Returns true if needle is a prefix of the slice.

+

Returns true if needle is a prefix of the slice.

Examples

 let v = [10, 40, 30];
@@ -339,7 +339,7 @@ by 3 (i.e. [50], [10, 40, 30, 20]):

 assert!(v.starts_with(&[]));
 let v: &[u8] = &[];
 assert!(v.starts_with(&[]));
-

Returns true if needle is a suffix of the slice.

+

Returns true if needle is a suffix of the slice.

Examples

 let v = [10, 40, 30];
@@ -354,7 +354,7 @@ by 3 (i.e. [50], [10, 40, 30, 20]):

 assert!(v.ends_with(&[]));
 let v: &[u8] = &[];
 assert!(v.ends_with(&[]));
-

Binary searches this sorted slice for a given element.

+

Binary searches this sorted slice for a given element.

If the value is found then Ok is returned, containing the index of the matching element; if the value is not found then Err is returned, containing the index where a matching @@ -372,7 +372,7 @@ found; the fourth could match any position in [1, 4].

assert_eq!(s.binary_search(&100), Err(13)); let r = s.binary_search(&1); assert!(match r { Ok(1...4) => true, _ => false, }); -

Binary searches this sorted slice with a comparator function.

+

Binary searches this sorted slice with a comparator function.

The comparator function should implement an order consistent with the sort order of the underlying slice, returning an order code that indicates whether its argument is Less, @@ -398,7 +398,7 @@ found; the fourth could match any position in [1, 4].

let seek = 1; let r = s.binary_search_by(|probe| probe.cmp(&seek)); assert!(match r { Ok(1...4) => true, _ => false, }); -

Binary searches this sorted slice with a key extraction function.

+

Binary searches this sorted slice with a key extraction function.

Assumes that the slice is sorted by the key, for instance with sort_by_key using the same key extraction function.

If a matching value is found then returns Ok, containing the diff --git a/master/memmap/struct.MmapMut.html b/master/memmap/struct.MmapMut.html index beb7b7965..aed8c84df 100644 --- a/master/memmap/struct.MmapMut.html +++ b/master/memmap/struct.MmapMut.html @@ -97,17 +97,17 @@ variety of reasons, such as when the file has not been opened with execute permi

Methods from Deref<Target = [u8]>

-

Returns the number of elements in the slice.

+

Returns the number of elements in the slice.

Examples

 let a = [1, 2, 3];
 assert_eq!(a.len(), 3);
-

Returns true if the slice has a length of 0.

+

Returns true if the slice has a length of 0.

Examples

 let a = [1, 2, 3];
 assert!(!a.is_empty());
-

Returns the first element of the slice, or None if it is empty.

+

Returns the first element of the slice, or None if it is empty.

Examples

 let v = [10, 40, 30];
@@ -115,7 +115,7 @@ variety of reasons, such as when the file has not been opened with execute permi
 
 let w: &[i32] = &[];
 assert_eq!(None, w.first());
-

Returns a mutable pointer to the first element of the slice, or None if it is empty.

+

Returns a mutable pointer to the first element of the slice, or None if it is empty.

Examples

 let x = &mut [0, 1, 2];
@@ -124,7 +124,7 @@ variety of reasons, such as when the file has not been opened with execute permi
     *first = 5;
 }
 assert_eq!(x, &[5, 1, 2]);
-

Returns the first and all the rest of the elements of the slice, or None if it is empty.

+

Returns the first and all the rest of the elements of the slice, or None if it is empty.

Examples

 let x = &[0, 1, 2];
@@ -133,7 +133,7 @@ variety of reasons, such as when the file has not been opened with execute permi
     assert_eq!(first, &0);
     assert_eq!(elements, &[1, 2]);
 }
-

Returns the first and all the rest of the elements of the slice, or None if it is empty.

+

Returns the first and all the rest of the elements of the slice, or None if it is empty.

Examples

 let x = &mut [0, 1, 2];
@@ -144,7 +144,7 @@ variety of reasons, such as when the file has not been opened with execute permi
     elements[1] = 5;
 }
 assert_eq!(x, &[3, 4, 5]);
-

Returns the last and all the rest of the elements of the slice, or None if it is empty.

+

Returns the last and all the rest of the elements of the slice, or None if it is empty.

Examples

 let x = &[0, 1, 2];
@@ -153,7 +153,7 @@ variety of reasons, such as when the file has not been opened with execute permi
     assert_eq!(last, &2);
     assert_eq!(elements, &[0, 1]);
 }
-

Returns the last and all the rest of the elements of the slice, or None if it is empty.

+

Returns the last and all the rest of the elements of the slice, or None if it is empty.

Examples

 let x = &mut [0, 1, 2];
@@ -164,7 +164,7 @@ variety of reasons, such as when the file has not been opened with execute permi
     elements[1] = 5;
 }
 assert_eq!(x, &[4, 5, 3]);
-

Returns the last element of the slice, or None if it is empty.

+

Returns the last element of the slice, or None if it is empty.

Examples

 let v = [10, 40, 30];
@@ -172,7 +172,7 @@ variety of reasons, such as when the file has not been opened with execute permi
 
 let w: &[i32] = &[];
 assert_eq!(None, w.last());
-

Returns a mutable pointer to the last item in the slice.

+

Returns a mutable pointer to the last item in the slice.

Examples

 let x = &mut [0, 1, 2];
@@ -181,7 +181,7 @@ variety of reasons, such as when the file has not been opened with execute permi
     *last = 10;
 }
 assert_eq!(x, &[0, 1, 10]);
-

Returns a reference to an element or subslice depending on the type of +

Returns a reference to an element or subslice depending on the type of index.

  • If given a position, returns a reference to the element at that @@ -196,7 +196,7 @@ or None if out of bounds.
    • assert_eq!(Some(&[10, 40][..]), v.get(0..2)); assert_eq!(None, v.get(3)); assert_eq!(None, v.get(0..4)); -

Returns a mutable reference to an element or subslice depending on the +

Returns a mutable reference to an element or subslice depending on the type of index (see get) or None if the index is out of bounds.

Examples

@@ -206,7 +206,7 @@ type of index (see get) or None*elem = 42;
 }
 assert_eq!(x, &[0, 42, 2]);
-

Returns a reference to an element or subslice, without doing bounds +

Returns a reference to an element or subslice, without doing bounds checking.

This is generally not recommended, use with caution! For a safe alternative see get.

@@ -217,7 +217,7 @@ alternative see get.

unsafe { assert_eq!(x.get_unchecked(1), &2); } -

Returns a mutable reference to an element or subslice, without doing +

Returns a mutable reference to an element or subslice, without doing bounds checking.

This is generally not recommended, use with caution! For a safe alternative see get_mut.

@@ -230,7 +230,7 @@ alternative see get_mut.

*elem = 13; } assert_eq!(x, &[1, 13, 4]); -

Returns a raw pointer to the slice's buffer.

+

Returns a raw pointer to the slice's buffer.

The caller must ensure that the slice outlives the pointer this function returns, or else it will end up pointing to garbage.

Modifying the container referenced by this slice may cause its buffer @@ -245,7 +245,7 @@ to be reallocated, which would also make any pointers to it invalid.

assert_eq!(x.get_unchecked(i), &*x_ptr.offset(i as isize)); } } -

Returns an unsafe mutable pointer to the slice's buffer.

+

Returns an unsafe mutable pointer to the slice's buffer.

The caller must ensure that the slice outlives the pointer this function returns, or else it will end up pointing to garbage.

Modifying the container referenced by this slice may cause its buffer @@ -261,7 +261,7 @@ to be reallocated, which would also make any pointers to it invalid.

} } assert_eq!(x, &[3, 4, 6]); -

Swaps two elements in the slice.

+

Swaps two elements in the slice.

Arguments

  • a - The index of the first element
    • @@ -274,13 +274,13 @@ to be reallocated, which would also make any pointers to it invalid.

    let mut v = ["a", "b", "c", "d"]; v.swap(1, 3); assert!(v == ["a", "d", "c", "b"]); -

Reverses the order of elements in the slice, in place.

+

Reverses the order of elements in the slice, in place.

Examples

 let mut v = [1, 2, 3];
 v.reverse();
 assert!(v == [3, 2, 1]);
-

Returns an iterator over the slice.

+

Returns an iterator over the slice.

Examples

 let x = &[1, 2, 4];
@@ -290,7 +290,7 @@ to be reallocated, which would also make any pointers to it invalid.

 assert_eq!(iterator.next(), Some(&2));
 assert_eq!(iterator.next(), Some(&4));
 assert_eq!(iterator.next(), None);
-

Returns an iterator that allows modifying each value.

+

Returns an iterator that allows modifying each value.

Examples

 let x = &mut [1, 2, 4];
@@ -298,7 +298,7 @@ to be reallocated, which would also make any pointers to it invalid.

     *elem += 2;
 }
 assert_eq!(x, &[3, 4, 6]);
-

Returns an iterator over all contiguous windows of length +

Returns an iterator over all contiguous windows of length size. The windows overlap. If the slice is shorter than size, the iterator returns no values.

Panics

@@ -317,7 +317,7 @@ to be reallocated, which would also make any pointers to it invalid.

let slice = ['f', 'o', 'o']; let mut iter = slice.windows(4); assert!(iter.next().is_none()); -

Returns an iterator over chunk_size elements of the slice at a +

Returns an iterator over chunk_size elements of the slice at a time. The chunks are slices and do not overlap. If chunk_size does not divide the length of the slice, then the last chunk will not have length chunk_size.

@@ -333,7 +333,7 @@ of always exactly chunk_size elements.

assert_eq!(iter.next().unwrap(), &['r', 'e']); assert_eq!(iter.next().unwrap(), &['m']); assert!(iter.next().is_none()); -

🔬 This is a nightly-only experimental API. (exact_chunks)

Returns an iterator over chunk_size elements of the slice at a +

🔬 This is a nightly-only experimental API. (exact_chunks)

Returns an iterator over chunk_size elements of the slice at a time. The chunks are slices and do not overlap. If chunk_size does not divide the length of the slice, then the last up to chunk_size-1 elements will be omitted.

@@ -351,7 +351,7 @@ can often optimize the resulting code better than in the case of assert_eq!(iter.next().unwrap(), &['l', 'o']); assert_eq!(iter.next().unwrap(), &['r', 'e']); assert!(iter.next().is_none()); -

Returns an iterator over chunk_size elements of the slice at a time. +

Returns an iterator over chunk_size elements of the slice at a time. The chunks are mutable slices, and do not overlap. If chunk_size does not divide the length of the slice, then the last chunk will not have length chunk_size.

@@ -371,7 +371,7 @@ of always exactly chunk_size elements.

count += 1; } assert_eq!(v, &[1, 1, 2, 2, 3]); -

🔬 This is a nightly-only experimental API. (exact_chunks)

Returns an iterator over chunk_size elements of the slice at a time. +

🔬 This is a nightly-only experimental API. (exact_chunks)

Returns an iterator over chunk_size elements of the slice at a time. The chunks are mutable slices, and do not overlap. If chunk_size does not divide the length of the slice, then the last up to chunk_size-1 elements will be omitted.

@@ -394,7 +394,7 @@ can often optimize the resulting code better than in the case of count += 1; } assert_eq!(v, &[1, 1, 2, 2, 0]); -

Divides one slice into two at an index.

+

Divides one slice into two at an index.

The first will contain all indices from [0, mid) (excluding the index mid itself) and the second will contain all indices from [mid, len) (excluding the index len itself).

@@ -421,7 +421,7 @@ indices from [mid, len) (excluding the index len itsel assert!(left == [1, 2, 3, 4, 5, 6]); assert!(right == []); } -

Divides one mutable slice into two at an index.

+

Divides one mutable slice into two at an index.

The first will contain all indices from [0, mid) (excluding the index mid itself) and the second will contain all indices from [mid, len) (excluding the index len itself).

@@ -439,7 +439,7 @@ indices from [mid, len) (excluding the index len itsel right[1] = 4; } assert!(v == [1, 2, 3, 4, 5, 6]); -

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred. The matched element is not contained in the subslices.

Examples

@@ -472,7 +472,7 @@ present between them:

 assert_eq!(iter.next().unwrap(), &[]);
 assert_eq!(iter.next().unwrap(), &[20]);
 assert!(iter.next().is_none());
-

Returns an iterator over mutable subslices separated by elements that +

Returns an iterator over mutable subslices separated by elements that match pred. The matched element is not contained in the subslices.

Examples

@@ -482,7 +482,7 @@ match pred. The matched element is not contained in the subslices.<
     group[0] = 1;
 }
 assert_eq!(v, [1, 40, 30, 1, 60, 1]);
-

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred, starting at the end of the slice and working backwards. The matched element is not contained in the subslices.

Examples

@@ -504,7 +504,7 @@ slice will be the first (or last) item returned by the iterator.

assert_eq!(it.next().unwrap(), &[1, 1]); assert_eq!(it.next().unwrap(), &[]); assert_eq!(it.next(), None); -

Returns an iterator over mutable subslices separated by elements that +

Returns an iterator over mutable subslices separated by elements that match pred, starting at the end of the slice and working backwards. The matched element is not contained in the subslices.

Examples

@@ -517,7 +517,7 @@ backwards. The matched element is not contained in the subslices.

group[0] = count; } assert_eq!(v, [3, 400, 300, 2, 600, 1]); -

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred, limited to returning at most n items. The matched element is not contained in the subslices.

The last element returned, if any, will contain the remainder of the @@ -532,7 +532,7 @@ slice.

for group in v.splitn(2, |num| *num % 3 == 0) { println!("{:?}", group); } -

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred, limited to returning at most n items. The matched element is not contained in the subslices.

The last element returned, if any, will contain the remainder of the @@ -545,7 +545,7 @@ slice.

group[0] = 1; } assert_eq!(v, [1, 40, 30, 1, 60, 50]); -

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred limited to returning at most n items. This starts at the end of the slice and works backwards. The matched element is not contained in the subslices.

@@ -561,7 +561,7 @@ by 3 (i.e. [50], [10, 40, 30, 20]):

for group in v.rsplitn(2, |num| *num % 3 == 0) { println!("{:?}", group); } -

Returns an iterator over subslices separated by elements that match +

Returns an iterator over subslices separated by elements that match pred limited to returning at most n items. This starts at the end of the slice and works backwards. The matched element is not contained in the subslices.

@@ -575,13 +575,13 @@ slice.

group[0] = 1; } assert_eq!(s, [1, 40, 30, 20, 60, 1]); -

Returns true if the slice contains an element with the given value.

+

Returns true if the slice contains an element with the given value.

Examples

 let v = [10, 40, 30];
 assert!(v.contains(&30));
 assert!(!v.contains(&50));
-

Returns true if needle is a prefix of the slice.

+

Returns true if needle is a prefix of the slice.

Examples

 let v = [10, 40, 30];
@@ -596,7 +596,7 @@ slice.

 assert!(v.starts_with(&[]));
 let v: &[u8] = &[];
 assert!(v.starts_with(&[]));
-

Returns true if needle is a suffix of the slice.

+

Returns true if needle is a suffix of the slice.

Examples

 let v = [10, 40, 30];
@@ -611,7 +611,7 @@ slice.

 assert!(v.ends_with(&[]));
 let v: &[u8] = &[];
 assert!(v.ends_with(&[]));
-

Binary searches this sorted slice for a given element.

+

Binary searches this sorted slice for a given element.

If the value is found then Ok is returned, containing the index of the matching element; if the value is not found then Err is returned, containing the index where a matching @@ -629,7 +629,7 @@ found; the fourth could match any position in [1, 4].

assert_eq!(s.binary_search(&100), Err(13)); let r = s.binary_search(&1); assert!(match r { Ok(1...4) => true, _ => false, }); -

Binary searches this sorted slice with a comparator function.

+

Binary searches this sorted slice with a comparator function.

The comparator function should implement an order consistent with the sort order of the underlying slice, returning an order code that indicates whether its argument is Less, @@ -655,7 +655,7 @@ found; the fourth could match any position in [1, 4].

let seek = 1; let r = s.binary_search_by(|probe| probe.cmp(&seek)); assert!(match r { Ok(1...4) => true, _ => false, }); -

Binary searches this sorted slice with a key extraction function.

+

Binary searches this sorted slice with a key extraction function.

Assumes that the slice is sorted by the key, for instance with sort_by_key using the same key extraction function.

If a matching value is found then returns Ok, containing the @@ -678,7 +678,7 @@ fourth could match any position in [1, 4].

assert_eq!(s.binary_search_by_key(&100, |&(a,b)| b), Err(13)); let r = s.binary_search_by_key(&1, |&(a,b)| b); assert!(match r { Ok(1...4) => true, _ => false, }); -

Sorts the slice, but may not preserve the order of equal elements.

+

Sorts the slice, but may not preserve the order of equal elements.

This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate), and O(n log n) worst-case.

Current implementation

@@ -695,7 +695,7 @@ slice consists of several concatenated sorted sequences.

v.sort_unstable(); assert!(v == [-5, -3, 1, 2, 4]); -

Sorts the slice with a comparator function, but may not preserve the order of equal +

Sorts the slice with a comparator function, but may not preserve the order of equal elements.

This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate), and O(n log n) worst-case.

@@ -716,7 +716,7 @@ slice consists of several concatenated sorted sequences.

// reverse sorting v.sort_unstable_by(|a, b| b.cmp(a)); assert!(v == [5, 4, 3, 2, 1]); -

Sorts the slice with a key extraction function, but may not preserve the order of equal +

Sorts the slice with a key extraction function, but may not preserve the order of equal elements.

This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate), and O(m n log(m n)) worst-case, where the key function is O(m).

@@ -732,7 +732,7 @@ deterministic behavior.

v.sort_unstable_by_key(|k| k.abs()); assert!(v == [1, 2, -3, 4, -5]); -

Rotates the slice in-place such that the first mid elements of the +

Rotates the slice in-place such that the first mid elements of the slice move to the end while the last self.len() - mid elements move to the front. After calling rotate_left, the element previously at index mid will become the first element in the slice.

@@ -753,7 +753,7 @@ rotation.

let mut a = ['a', 'b', 'c', 'd', 'e', 'f']; a[1..5].rotate_left(1); assert_eq!(a, ['a', 'c', 'd', 'e', 'b', 'f']); -

Rotates the slice in-place such that the first self.len() - k +

Rotates the slice in-place such that the first self.len() - k elements of the slice move to the end while the last k elements move to the front. After calling rotate_right, the element previously at index self.len() - k will become the first element in the slice.

@@ -774,7 +774,7 @@ rotation.

let mut a = ['a', 'b', 'c', 'd', 'e', 'f']; a[1..5].rotate_right(1); assert_eq!(a, ['a', 'e', 'b', 'c', 'd', 'f']); -

Copies the elements from src into self.

+

Copies the elements from src into self.

The length of src must be the same as self.

If src implements Copy, it can be more performant to use copy_from_slice.

@@ -812,7 +812,7 @@ sub-slices from a slice:

} assert_eq!(slice, [4, 5, 3, 4, 5]); -

Copies all elements from src into self, using a memcpy.

+

Copies all elements from src into self, using a memcpy.

The length of src must be the same as self.

If src does not implement Copy, use clone_from_slice.

Panics

@@ -849,7 +849,7 @@ sub-slices from a slice:

} assert_eq!(slice, [4, 5, 3, 4, 5]); -

Swaps all elements in self with those in other.

+

Swaps all elements in self with those in other.

The length of other must be the same as self.

Panics

This function will panic if the two slices have different lengths.

diff --git a/master/nix/pty/struct.Winsize.html b/master/nix/pty/struct.Winsize.html index 78dba4a5c..5d6b2fad5 100644 --- a/master/nix/pty/struct.Winsize.html +++ b/master/nix/pty/struct.Winsize.html @@ -1,4 +1,4 @@ -nix::pty::Winsize - Rust

Struct nix::pty::Winsize[−][src]

#[repr(C)]
+nix::pty::Winsize - Rust
Struct nix::pty::Winsize[−][src]
#[repr(C)]
 
pub struct Winsize {
     pub ws_row: u16,
     pub ws_col: u16,
@@ -25,9 +25,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for winsize
[src]
Returns a copy of the value. Read more

+                
impl Copy for winsize
[src]
impl Clone for winsize
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for winsize
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/signal/struct.SignalIterator.html b/master/nix/sys/signal/struct.SignalIterator.html
index dfba5063f..61ff204fc 100644
--- a/master/nix/sys/signal/struct.SignalIterator.html
+++ b/master/nix/sys/signal/struct.SignalIterator.html
@@ -26,7 +26,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/nix/sys/signalfd/struct.SignalFd.html b/master/nix/sys/signalfd/struct.SignalFd.html
index 9b42076c4..64bbc3d9b 100644
--- a/master/nix/sys/signalfd/struct.SignalFd.html
+++ b/master/nix/sys/signalfd/struct.SignalFd.html
@@ -54,7 +54,7 @@ this struct!

 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/nix/sys/signalfd/struct.siginfo.html b/master/nix/sys/signalfd/struct.siginfo.html
index 9261f67f6..b616f596b 100644
--- a/master/nix/sys/signalfd/struct.siginfo.html
+++ b/master/nix/sys/signalfd/struct.siginfo.html
@@ -1,4 +1,4 @@
-nix::sys::signalfd::siginfo - Rust
Struct nix::sys::signalfd::siginfo[−][src]
#[repr(C)]
+nix::sys::signalfd::siginfo - Rust
Struct nix::sys::signalfd::siginfo[−][src]
#[repr(C)]
 
pub struct siginfo {
     pub ssi_signo: u32,
     pub ssi_errno: i32,
@@ -86,9 +86,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for signalfd_siginfo
[src]
Returns a copy of the value. Read more

+                
impl Copy for signalfd_siginfo
[src]
impl Clone for signalfd_siginfo
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for signalfd_siginfo
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/socket/struct.CmsgIterator.html b/master/nix/sys/socket/struct.CmsgIterator.html
index c26a5972c..0707b7224 100644
--- a/master/nix/sys/socket/struct.CmsgIterator.html
+++ b/master/nix/sys/socket/struct.CmsgIterator.html
@@ -26,7 +26,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

diff --git a/master/nix/sys/socket/struct.in6_addr.html b/master/nix/sys/socket/struct.in6_addr.html
index 3d6605d14..44a72fd74 100644
--- a/master/nix/sys/socket/struct.in6_addr.html
+++ b/master/nix/sys/socket/struct.in6_addr.html
@@ -1,4 +1,4 @@
-nix::sys::socket::in6_addr - Rust
Struct nix::sys::socket::in6_addr[−][src]
#[repr(C)]
+nix::sys::socket::in6_addr - Rust
Struct nix::sys::socket::in6_addr[−][src]
#[repr(C)]
 
pub struct in6_addr {
     pub s6_addr: [u8; 16],
     // some fields omitted
@@ -11,9 +11,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for in6_addr
[src]
Returns a copy of the value. Read more

+                
impl Copy for in6_addr
[src]
impl Clone for in6_addr
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for in6_addr
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/socket/struct.in_addr.html b/master/nix/sys/socket/struct.in_addr.html
index 60a69f20d..49984f2a2 100644
--- a/master/nix/sys/socket/struct.in_addr.html
+++ b/master/nix/sys/socket/struct.in_addr.html
@@ -1,4 +1,4 @@
-nix::sys::socket::in_addr - Rust
Struct nix::sys::socket::in_addr[−][src]
#[repr(C)]
+nix::sys::socket::in_addr - Rust
Struct nix::sys::socket::in_addr[−][src]
#[repr(C)]
 
pub struct in_addr {
     pub s_addr: u32,
 }

@@ -10,9 +10,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for in_addr
[src]
Returns a copy of the value. Read more

+                
impl Copy for in_addr
[src]
impl Clone for in_addr
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for in_addr
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/socket/struct.sockaddr.html b/master/nix/sys/socket/struct.sockaddr.html
index 7f38ef6fb..8d6527a7c 100644
--- a/master/nix/sys/socket/struct.sockaddr.html
+++ b/master/nix/sys/socket/struct.sockaddr.html
@@ -1,4 +1,4 @@
-nix::sys::socket::sockaddr - Rust
Struct nix::sys::socket::sockaddr[−][src]
#[repr(C)]
+nix::sys::socket::sockaddr - Rust
Struct nix::sys::socket::sockaddr[−][src]
#[repr(C)]
 
pub struct sockaddr {
     pub sa_family: u16,
     pub sa_data: [i8; 14],
@@ -15,9 +15,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for sockaddr
[src]
Returns a copy of the value. Read more

+                
impl Copy for sockaddr
[src]
impl Clone for sockaddr
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for sockaddr
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/socket/struct.sockaddr_in.html b/master/nix/sys/socket/struct.sockaddr_in.html
index 0c53caa2d..0da7c2491 100644
--- a/master/nix/sys/socket/struct.sockaddr_in.html
+++ b/master/nix/sys/socket/struct.sockaddr_in.html
@@ -1,4 +1,4 @@
-nix::sys::socket::sockaddr_in - Rust
Struct nix::sys::socket::sockaddr_in[−][src]
#[repr(C)]
+nix::sys::socket::sockaddr_in - Rust
Struct nix::sys::socket::sockaddr_in[−][src]
#[repr(C)]
 
pub struct sockaddr_in {
     pub sin_family: u16,
     pub sin_port: u16,
@@ -25,9 +25,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for sockaddr_in
[src]
Returns a copy of the value. Read more

+                
impl Copy for sockaddr_in
[src]
impl Clone for sockaddr_in
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for sockaddr_in
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/socket/struct.sockaddr_in6.html b/master/nix/sys/socket/struct.sockaddr_in6.html
index 1b6c8a06e..7ac33b84c 100644
--- a/master/nix/sys/socket/struct.sockaddr_in6.html
+++ b/master/nix/sys/socket/struct.sockaddr_in6.html
@@ -1,4 +1,4 @@
-nix::sys::socket::sockaddr_in6 - Rust
Struct nix::sys::socket::sockaddr_in6[−][src]
#[repr(C)]
+nix::sys::socket::sockaddr_in6 - Rust
Struct nix::sys::socket::sockaddr_in6[−][src]
#[repr(C)]
 
pub struct sockaddr_in6 {
     pub sin6_family: u16,
     pub sin6_port: u16,
@@ -30,9 +30,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for sockaddr_in6
[src]
Returns a copy of the value. Read more

+                
impl Copy for sockaddr_in6
[src]
impl Clone for sockaddr_in6
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for sockaddr_in6
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/socket/struct.sockaddr_storage.html b/master/nix/sys/socket/struct.sockaddr_storage.html
index cd9bb097c..870fec647 100644
--- a/master/nix/sys/socket/struct.sockaddr_storage.html
+++ b/master/nix/sys/socket/struct.sockaddr_storage.html
@@ -1,4 +1,4 @@
-nix::sys::socket::sockaddr_storage - Rust
Struct nix::sys::socket::sockaddr_storage[−][src]
#[repr(C)]
+nix::sys::socket::sockaddr_storage - Rust
Struct nix::sys::socket::sockaddr_storage[−][src]
#[repr(C)]
 
pub struct sockaddr_storage {
     pub ss_family: u16,
     // some fields omitted
@@ -11,9 +11,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for sockaddr_storage
[src]
Returns a copy of the value. Read more

+                
impl Copy for sockaddr_storage
[src]
impl Clone for sockaddr_storage
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for sockaddr_storage
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/socket/struct.sockaddr_un.html b/master/nix/sys/socket/struct.sockaddr_un.html
index d6c7c1496..1f9963636 100644
--- a/master/nix/sys/socket/struct.sockaddr_un.html
+++ b/master/nix/sys/socket/struct.sockaddr_un.html
@@ -1,4 +1,4 @@
-nix::sys::socket::sockaddr_un - Rust
Struct nix::sys::socket::sockaddr_un[−][src]
#[repr(C)]
+nix::sys::socket::sockaddr_un - Rust
Struct nix::sys::socket::sockaddr_un[−][src]
#[repr(C)]
 
pub struct sockaddr_un {
     pub sun_family: u16,
     pub sun_path: [i8; 108],
@@ -15,9 +15,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for sockaddr_un
[src]
Returns a copy of the value. Read more

+                
impl Copy for sockaddr_un
[src]
impl Clone for sockaddr_un
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for sockaddr_un
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/nix/sys/stat/struct.FileStat.html b/master/nix/sys/stat/struct.FileStat.html
index 942589124..0d86cd875 100644
--- a/master/nix/sys/stat/struct.FileStat.html
+++ b/master/nix/sys/stat/struct.FileStat.html
@@ -1,4 +1,4 @@
-nix::sys::stat::FileStat - Rust
Struct nix::sys::stat::FileStat[−][src]
#[repr(C)]
+nix::sys::stat::FileStat - Rust
Struct nix::sys::stat::FileStat[−][src]
#[repr(C)]
 
pub struct FileStat {
     pub st_dev: u64,
     pub st_ino: u64,
@@ -86,9 +86,9 @@
                 

                   Trait Implementations
                 

-                
impl Clone for stat
[src]
Returns a copy of the value. Read more

+                
impl Copy for stat
[src]
impl Clone for stat
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Copy for stat
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/owning_ref/trait.StableAddress.html b/master/owning_ref/trait.StableAddress.html
index 0727acd93..71eba3186 100644
--- a/master/owning_ref/trait.StableAddress.html
+++ b/master/owning_ref/trait.StableAddress.html
@@ -1,4 +1,4 @@
-owning_ref::StableAddress - Rust
Trait owning_ref::StableAddress[−][src]
pub unsafe trait StableAddress: Deref { }
An unsafe marker trait for types that deref to a stable address, even when moved. For example, this is implemented by Box, Vec, Rc, Arc and String, among others. Even when a Box is moved, the underlying storage remains at a fixed location.

+owning_ref::StableAddress - Rust
Trait owning_ref::StableAddress[−][src]
pub unsafe trait StableAddress: Deref { }
An unsafe marker trait for types that deref to a stable address, even when moved. For example, this is implemented by Box, Vec, Rc, Arc and String, among others. Even when a Box is moved, the underlying storage remains at a fixed location.

 
More specifically, implementors must ensure that the result of calling deref() is valid for the lifetime of the object, not just the lifetime of the borrow, and that the deref is valid even if the object is moved. Also, it must be valid even after invoking arbitrary &self methods or doing anything transitively accessible from &Self. If Self also implements DerefMut, the same restrictions apply to deref_mut() and it must remain valid if anything transitively accessible from the result of deref_mut() is mutated/called. Additionally, multiple calls to deref, (and deref_mut if implemented) must return the same address. No requirements are placed on &mut self methods other than deref_mut() and drop(), if applicable.

 
Basically, it must be valid to convert the result of deref() to a pointer, and later dereference that pointer, as long as the original object is still live, even if it has been moved or &self methods have been called on it. If DerefMut is also implemented, it must be valid to get pointers from deref() and deref_mut() and dereference them while the object is live, as long as you don't simultaneously dereference both of them.

 
Additionally, Deref and DerefMut implementations must not panic, but users of the trait are not allowed to rely on this fact (so that this restriction can be removed later without breaking backwards compatibility, should the need arise).

@@ -66,7 +66,7 @@
                 

                   Implementations on Foreign Types
                 

-            
impl<'a, T> StableDeref for RefMut<'a, T> where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for MutexGuard<'a, T> where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for &'a mut T where
    T: ?Sized, 
[src]
impl<T> StableDeref for Rc<T> where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for RwLockWriteGuard<'a, T> where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for Ref<'a, T> where
    T: ?Sized, 
[src]
impl<T> StableDeref for Vec<T>
[src]
impl<'a, T> StableDeref for RwLockReadGuard<'a, T> where
    T: ?Sized, 
[src]
impl<T> StableDeref for Arc<T> where
    T: ?Sized, 
[src]
impl<T> StableDeref for Box<T> where
    T: ?Sized, 
[src]
impl StableDeref for String
[src]
impl<'a, T> StableDeref for &'a T where
    T: ?Sized, 
[src]

+            
impl<'a, T> StableDeref for RefMut<'a, T> where
    T: ?Sized, 
[src]
impl<T> StableDeref for Rc<T> where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for Ref<'a, T> where
    T: ?Sized, 
[src]
impl<T> StableDeref for Box<T> where
    T: ?Sized, 
[src]
impl StableDeref for String
[src]
impl<'a, T> StableDeref for &'a T where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for MutexGuard<'a, T> where
    T: ?Sized, 
[src]
impl<T> StableDeref for Vec<T>
[src]
impl<T> StableDeref for Arc<T> where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for RwLockReadGuard<'a, T> where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for &'a mut T where
    T: ?Sized, 
[src]
impl<'a, T> StableDeref for RwLockWriteGuard<'a, T> where
    T: ?Sized, 
[src]

         

           Implementors
         

diff --git a/master/rand/chacha/struct.ChaChaRng.html b/master/rand/chacha/struct.ChaChaRng.html
index 6d2e9d284..37232d69c 100644
--- a/master/rand/chacha/struct.ChaChaRng.html
+++ b/master/rand/chacha/struct.ChaChaRng.html
@@ -1,4 +1,4 @@
-rand::chacha::ChaChaRng - Rust
Struct rand::chacha::ChaChaRng[−][src]
pub struct ChaChaRng { /* fields omitted */ }
A random number generator that uses the ChaCha20 algorithm [1].

+rand::chacha::ChaChaRng - Rust
Struct rand::chacha::ChaChaRng[−][src]
pub struct ChaChaRng { /* fields omitted */ }
A random number generator that uses the ChaCha20 algorithm [1].

 
The ChaCha algorithm is widely accepted as suitable for
 cryptographic purposes, but this implementation has not been
 verified as such. Prefer a generator like OsRng that defers to
@@ -44,9 +44,7 @@ arguments 0, desired_nonce.

                 

                   Trait Implementations
                 

-                
impl Clone for ChaChaRng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for ChaChaRng
[src]
Return the next random u32. Read more

+                
impl Copy for ChaChaRng
[src]
impl Rng for ChaChaRng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

 
Return the next random f64 selected from the half-open interval [0, 1). Read more

@@ -61,12 +59,14 @@ arguments 0, desired_nonce.

 
Shuffle a mutable slice in place. Read more

 
impl Debug for ChaChaRng
[src]
Formats the value using the given formatter. Read more

 
impl Rand for ChaChaRng
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Clone for ChaChaRng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<'a> SeedableRng<&'a [u32]> for ChaChaRng
[src]
Reseed an RNG with the given seed. Read more

 
Create a ChaCha generator from a seed,
 obtained from a variable-length u32 array.
 Only up to 8 words are used; if less than 8
 words are used, the remaining are set to zero.

-
impl Copy for ChaChaRng
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/exponential/struct.Exp.html b/master/rand/distributions/exponential/struct.Exp.html
index 2736848f7..5f62ba104 100644
--- a/master/rand/distributions/exponential/struct.Exp.html
+++ b/master/rand/distributions/exponential/struct.Exp.html
@@ -1,4 +1,4 @@
-rand::distributions::exponential::Exp - Rust
Struct rand::distributions::exponential::Exp[−][src]
pub struct Exp { /* fields omitted */ }
The exponential distribution Exp(lambda).

+rand::distributions::exponential::Exp - Rust
Struct rand::distributions::exponential::Exp[−][src]
pub struct Exp { /* fields omitted */ }
The exponential distribution Exp(lambda).

 
This distribution has density function: f(x) = lambda * exp(-lambda * x) for x > 0.

 
Example

 
@@ -17,12 +17,12 @@
                 

                   Trait Implementations
                 

-                
impl Clone for Exp
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for Exp
[src]
Generate a random value.

+                
impl Copy for Exp
[src]
impl IndependentSample<f64> for Exp
[src]
Generate a random value.

 
impl Debug for Exp
[src]
Formats the value using the given formatter. Read more

+
impl Clone for Exp
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for Exp
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for Exp
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/exponential/struct.Exp1.html b/master/rand/distributions/exponential/struct.Exp1.html
index a6e19fc68..d64fb49b5 100644
--- a/master/rand/distributions/exponential/struct.Exp1.html
+++ b/master/rand/distributions/exponential/struct.Exp1.html
@@ -1,4 +1,4 @@
-rand::distributions::exponential::Exp1 - Rust
Struct rand::distributions::exponential::Exp1[−][src]
pub struct Exp1(pub f64);
A wrapper around an f64 to generate Exp(1) random numbers.

+rand::distributions::exponential::Exp1 - Rust
Struct rand::distributions::exponential::Exp1[−][src]
pub struct Exp1(pub f64);
A wrapper around an f64 to generate Exp(1) random numbers.

 
See Exp for the general exponential distribution.

 
Implemented via the ZIGNOR variant[1] of the Ziggurat method. The
 exact description in the paper was adjusted to use tables for the
@@ -17,11 +17,11 @@ College, Oxford

                 

                   Trait Implementations
                 

-                
impl Clone for Exp1
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Debug for Exp1
[src]
Formats the value using the given formatter. Read more

+                
impl Copy for Exp1
[src]
impl Debug for Exp1
[src]
Formats the value using the given formatter. Read more

 
impl Rand for Exp1
[src]
Generates a random instance of this type using the specified source of randomness. Read more

-
impl Copy for Exp1
[src]

+
impl Clone for Exp1
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/gamma/struct.ChiSquared.html b/master/rand/distributions/gamma/struct.ChiSquared.html
index aaf31af70..392141c42 100644
--- a/master/rand/distributions/gamma/struct.ChiSquared.html
+++ b/master/rand/distributions/gamma/struct.ChiSquared.html
@@ -1,4 +1,4 @@
-rand::distributions::gamma::ChiSquared - Rust
Struct rand::distributions::gamma::ChiSquared[−][src]
pub struct ChiSquared { /* fields omitted */ }
The chi-squared distribution χ²(k), where k is the degrees of
+rand::distributions::gamma::ChiSquared - Rust
Struct rand::distributions::gamma::ChiSquared[−][src]
pub struct ChiSquared { /* fields omitted */ }
The chi-squared distribution χ²(k), where k is the degrees of
 freedom.

 
For k > 0 integral, this distribution is the sum of the squares
 of k independent standard normal random variables. For other
@@ -21,12 +21,12 @@ of k independent standard normal random variables. For other
                 

                   Trait Implementations
                 

-                
impl Clone for ChiSquared
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for ChiSquared
[src]
Generate a random value.

+                
impl Copy for ChiSquared
[src]
impl IndependentSample<f64> for ChiSquared
[src]
Generate a random value.

 
impl Debug for ChiSquared
[src]
Formats the value using the given formatter. Read more

+
impl Clone for ChiSquared
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for ChiSquared
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for ChiSquared
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/gamma/struct.FisherF.html b/master/rand/distributions/gamma/struct.FisherF.html
index 08b79a35a..1d7de532c 100644
--- a/master/rand/distributions/gamma/struct.FisherF.html
+++ b/master/rand/distributions/gamma/struct.FisherF.html
@@ -1,4 +1,4 @@
-rand::distributions::gamma::FisherF - Rust
Struct rand::distributions::gamma::FisherF[−][src]
pub struct FisherF { /* fields omitted */ }
The Fisher F distribution F(m, n).

+rand::distributions::gamma::FisherF - Rust
Struct rand::distributions::gamma::FisherF[−][src]
pub struct FisherF { /* fields omitted */ }
The Fisher F distribution F(m, n).

 
This distribution is equivalent to the ratio of two normalised
 chi-squared distributions, that is, F(m,n) = (χ²(m)/m) / (χ²(n)/n).

 
Example

@@ -18,12 +18,12 @@ parameter. Panics if either m or n are not positive.
                   Trait Implementations
                 
-                
impl Clone for FisherF
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for FisherF
[src]
Generate a random value.

+                
impl Copy for FisherF
[src]
impl IndependentSample<f64> for FisherF
[src]
Generate a random value.

 
impl Debug for FisherF
[src]
Formats the value using the given formatter. Read more

+
impl Clone for FisherF
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for FisherF
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for FisherF
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/gamma/struct.Gamma.html b/master/rand/distributions/gamma/struct.Gamma.html
index 1a9fdd3e8..3359ffa47 100644
--- a/master/rand/distributions/gamma/struct.Gamma.html
+++ b/master/rand/distributions/gamma/struct.Gamma.html
@@ -1,4 +1,4 @@
-rand::distributions::gamma::Gamma - Rust
Struct rand::distributions::gamma::Gamma[−][src]
pub struct Gamma { /* fields omitted */ }
The Gamma distribution Gamma(shape, scale) distribution.

+rand::distributions::gamma::Gamma - Rust
Struct rand::distributions::gamma::Gamma[−][src]
pub struct Gamma { /* fields omitted */ }
The Gamma distribution Gamma(shape, scale) distribution.

 
The density function of this distribution is

 
f(x) =  x^(k - 1) * exp(-x / θ) / (Γ(k) * θ^k)
 

@@ -29,12 +29,12 @@ distribution.

                 

                   Trait Implementations
                 

-                
impl Clone for Gamma
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for Gamma
[src]
Generate a random value.

+                
impl Copy for Gamma
[src]
impl IndependentSample<f64> for Gamma
[src]
Generate a random value.

 
impl Debug for Gamma
[src]
Formats the value using the given formatter. Read more

+
impl Clone for Gamma
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for Gamma
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for Gamma
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/gamma/struct.StudentT.html b/master/rand/distributions/gamma/struct.StudentT.html
index e4c3ed0e6..f3e540c4e 100644
--- a/master/rand/distributions/gamma/struct.StudentT.html
+++ b/master/rand/distributions/gamma/struct.StudentT.html
@@ -1,4 +1,4 @@
-rand::distributions::gamma::StudentT - Rust
Struct rand::distributions::gamma::StudentT[−][src]
pub struct StudentT { /* fields omitted */ }
The Student t distribution, t(nu), where nu is the degrees of
+rand::distributions::gamma::StudentT - Rust
Struct rand::distributions::gamma::StudentT[−][src]
pub struct StudentT { /* fields omitted */ }
The Student t distribution, t(nu), where nu is the degrees of
 freedom.

 
Example

 
@@ -17,12 +17,12 @@ freedom. Panics if n <= 0.

                 

                   Trait Implementations
                 

-                
impl Clone for StudentT
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for StudentT
[src]
Generate a random value.

+                
impl Copy for StudentT
[src]
impl IndependentSample<f64> for StudentT
[src]
Generate a random value.

 
impl Debug for StudentT
[src]
Formats the value using the given formatter. Read more

+
impl Clone for StudentT
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for StudentT
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for StudentT
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/normal/struct.LogNormal.html b/master/rand/distributions/normal/struct.LogNormal.html
index 4a499c7a5..1e33a458c 100644
--- a/master/rand/distributions/normal/struct.LogNormal.html
+++ b/master/rand/distributions/normal/struct.LogNormal.html
@@ -1,4 +1,4 @@
-rand::distributions::normal::LogNormal - Rust
Struct rand::distributions::normal::LogNormal[−][src]
pub struct LogNormal { /* fields omitted */ }
The log-normal distribution ln N(mean, std_dev**2).

+rand::distributions::normal::LogNormal - Rust
Struct rand::distributions::normal::LogNormal[−][src]
pub struct LogNormal { /* fields omitted */ }
The log-normal distribution ln N(mean, std_dev**2).

 
If X is log-normal distributed, then ln(X) is N(mean, std_dev**2) distributed.

 
Example

 
@@ -20,12 +20,12 @@ and standard deviation.

                 

                   Trait Implementations
                 

-                
impl Clone for LogNormal
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for LogNormal
[src]
Generate a random value.

+                
impl Copy for LogNormal
[src]
impl IndependentSample<f64> for LogNormal
[src]
Generate a random value.

 
impl Debug for LogNormal
[src]
Formats the value using the given formatter. Read more

+
impl Clone for LogNormal
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for LogNormal
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for LogNormal
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/normal/struct.Normal.html b/master/rand/distributions/normal/struct.Normal.html
index caa513ed3..951e6e8a2 100644
--- a/master/rand/distributions/normal/struct.Normal.html
+++ b/master/rand/distributions/normal/struct.Normal.html
@@ -1,4 +1,4 @@
-rand::distributions::normal::Normal - Rust
Struct rand::distributions::normal::Normal[−][src]
pub struct Normal { /* fields omitted */ }
The normal distribution N(mean, std_dev**2).

+rand::distributions::normal::Normal - Rust
Struct rand::distributions::normal::Normal[−][src]
pub struct Normal { /* fields omitted */ }
The normal distribution N(mean, std_dev**2).

 
This uses the ZIGNOR variant of the Ziggurat method, see
 StandardNormal for more details.

 
Example

@@ -21,12 +21,12 @@ standard deviation.

                 

                   Trait Implementations
                 

-                
impl Clone for Normal
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for Normal
[src]
Generate a random value.

+                
impl Copy for Normal
[src]
impl IndependentSample<f64> for Normal
[src]
Generate a random value.

 
impl Debug for Normal
[src]
Formats the value using the given formatter. Read more

+
impl Clone for Normal
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for Normal
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for Normal
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/normal/struct.StandardNormal.html b/master/rand/distributions/normal/struct.StandardNormal.html
index 56eb8b852..4a3fcb541 100644
--- a/master/rand/distributions/normal/struct.StandardNormal.html
+++ b/master/rand/distributions/normal/struct.StandardNormal.html
@@ -1,4 +1,4 @@
-rand::distributions::normal::StandardNormal - Rust
Struct rand::distributions::normal::StandardNormal[−][src]
pub struct StandardNormal(pub f64);
A wrapper around an f64 to generate N(0, 1) random numbers
+rand::distributions::normal::StandardNormal - Rust
Struct rand::distributions::normal::StandardNormal[−][src]
pub struct StandardNormal(pub f64);
A wrapper around an f64 to generate N(0, 1) random numbers
 (a.k.a.  a standard normal, or Gaussian).

 
See Normal for the general normal distribution.

 
Implemented via the ZIGNOR variant[1] of the Ziggurat method.

@@ -16,11 +16,11 @@ College, Oxford

                 

                   Trait Implementations
                 

-                
impl Clone for StandardNormal
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Debug for StandardNormal
[src]
Formats the value using the given formatter. Read more

+                
impl Copy for StandardNormal
[src]
impl Debug for StandardNormal
[src]
Formats the value using the given formatter. Read more

 
impl Rand for StandardNormal
[src]
Generates a random instance of this type using the specified source of randomness. Read more

-
impl Copy for StandardNormal
[src]

+
impl Clone for StandardNormal
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/range/struct.Range.html b/master/rand/distributions/range/struct.Range.html
index c3b2ed3e5..68d487bc8 100644
--- a/master/rand/distributions/range/struct.Range.html
+++ b/master/rand/distributions/range/struct.Range.html
@@ -1,4 +1,4 @@
-rand::distributions::range::Range - Rust
Struct rand::distributions::range::Range[−][src]
pub struct Range<X> { /* fields omitted */ }
Sample values uniformly between two bounds.

+rand::distributions::range::Range - Rust
Struct rand::distributions::range::Range[−][src]
pub struct Range<X> { /* fields omitted */ }
Sample values uniformly between two bounds.

 
This gives a uniform distribution (assuming the RNG used to sample
 it is itself uniform & the SampleRange implementation for the
 given type is correct), even for edge cases like low = 0u8,
@@ -32,12 +32,12 @@ normally satisfy it, but rounding may mean high can occur.

                 

                   Trait Implementations
                 

-                
impl<X> Clone for Range<X> where
    X: Clone, 
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl<Sup> IndependentSample<Sup> for Range<Sup> where
    Sup: SampleRange, 
[src]
Generate a random value.

+                
impl<X> Copy for Range<X> where
    X: Copy, 
[src]
impl<Sup> IndependentSample<Sup> for Range<Sup> where
    Sup: SampleRange, 
[src]
Generate a random value.

 
impl<X> Debug for Range<X> where
    X: Debug, 
[src]
Formats the value using the given formatter. Read more

+
impl<X> Clone for Range<X> where
    X: Clone, 
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<Sup> Sample<Sup> for Range<Sup> where
    Sup: SampleRange, 
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl<X> Copy for Range<X> where
    X: Copy, 
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/range/trait.SampleRange.html b/master/rand/distributions/range/trait.SampleRange.html
index a9ad1a91e..20e8910fa 100644
--- a/master/rand/distributions/range/trait.SampleRange.html
+++ b/master/rand/distributions/range/trait.SampleRange.html
@@ -1,4 +1,4 @@
-rand::distributions::range::SampleRange - Rust
Trait rand::distributions::range::SampleRange[−][src]
pub trait SampleRange {
+rand::distributions::range::SampleRange - Rust
Trait rand::distributions::range::SampleRange[−][src]
pub trait SampleRange {
     fn construct_range(low: Self, high: Self) -> Range<Self>;
 
    fn sample_range<R>(r: &Range<Self>, rng: &mut R) -> Self
    where
        R: Rng;
 }
The helper trait for types that have a sensible way to sample
@@ -19,7 +19,7 @@ a source of randomness.

                 

                   Implementations on Foreign Types
                 

-            
impl SampleRange for i32
[src]
impl SampleRange for u8
[src]
impl SampleRange for f64
[src]
impl SampleRange for f32
[src]
impl SampleRange for i8
[src]
impl SampleRange for u64
[src]
impl SampleRange for isize
[src]
impl SampleRange for usize
[src]
impl SampleRange for u32
[src]
impl SampleRange for i64
[src]
impl SampleRange for u16
[src]
impl SampleRange for i16
[src]

+            
impl SampleRange for u16
[src]
impl SampleRange for u64
[src]
impl SampleRange for i16
[src]
impl SampleRange for i64
[src]
impl SampleRange for i32
[src]
impl SampleRange for f64
[src]
impl SampleRange for usize
[src]
impl SampleRange for isize
[src]
impl SampleRange for f32
[src]
impl SampleRange for u32
[src]
impl SampleRange for i8
[src]
impl SampleRange for u8
[src]

         

           Implementors
         

diff --git a/master/rand/distributions/struct.ChiSquared.html b/master/rand/distributions/struct.ChiSquared.html
index c63153ecb..355015d86 100644
--- a/master/rand/distributions/struct.ChiSquared.html
+++ b/master/rand/distributions/struct.ChiSquared.html
@@ -1,4 +1,4 @@
-rand::distributions::ChiSquared - Rust
Struct rand::distributions::ChiSquared[−][src]
pub struct ChiSquared { /* fields omitted */ }
The chi-squared distribution χ²(k), where k is the degrees of
+rand::distributions::ChiSquared - Rust
Struct rand::distributions::ChiSquared[−][src]
pub struct ChiSquared { /* fields omitted */ }
The chi-squared distribution χ²(k), where k is the degrees of
 freedom.

 
For k > 0 integral, this distribution is the sum of the squares
 of k independent standard normal random variables. For other
@@ -21,12 +21,12 @@ of k independent standard normal random variables. For other
                 

                   Trait Implementations
                 

-                
impl Clone for ChiSquared
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for ChiSquared
[src]
Generate a random value.

+                
impl Copy for ChiSquared
[src]
impl IndependentSample<f64> for ChiSquared
[src]
Generate a random value.

 
impl Debug for ChiSquared
[src]
Formats the value using the given formatter. Read more

+
impl Clone for ChiSquared
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for ChiSquared
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for ChiSquared
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.Exp.html b/master/rand/distributions/struct.Exp.html
index 413fa4092..90759e8c8 100644
--- a/master/rand/distributions/struct.Exp.html
+++ b/master/rand/distributions/struct.Exp.html
@@ -1,4 +1,4 @@
-rand::distributions::Exp - Rust
Struct rand::distributions::Exp[−][src]
pub struct Exp { /* fields omitted */ }
The exponential distribution Exp(lambda).

+rand::distributions::Exp - Rust
Struct rand::distributions::Exp[−][src]
pub struct Exp { /* fields omitted */ }
The exponential distribution Exp(lambda).

 
This distribution has density function: f(x) = lambda * exp(-lambda * x) for x > 0.

 
Example

 
@@ -17,12 +17,12 @@
                 

                   Trait Implementations
                 

-                
impl Clone for Exp
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for Exp
[src]
Generate a random value.

+                
impl Copy for Exp
[src]
impl IndependentSample<f64> for Exp
[src]
Generate a random value.

 
impl Debug for Exp
[src]
Formats the value using the given formatter. Read more

+
impl Clone for Exp
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for Exp
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for Exp
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.FisherF.html b/master/rand/distributions/struct.FisherF.html
index 099cad815..9cb1d34d4 100644
--- a/master/rand/distributions/struct.FisherF.html
+++ b/master/rand/distributions/struct.FisherF.html
@@ -1,4 +1,4 @@
-rand::distributions::FisherF - Rust
Struct rand::distributions::FisherF[−][src]
pub struct FisherF { /* fields omitted */ }
The Fisher F distribution F(m, n).

+rand::distributions::FisherF - Rust
Struct rand::distributions::FisherF[−][src]
pub struct FisherF { /* fields omitted */ }
The Fisher F distribution F(m, n).

 
This distribution is equivalent to the ratio of two normalised
 chi-squared distributions, that is, F(m,n) = (χ²(m)/m) / (χ²(n)/n).

 
Example

@@ -18,12 +18,12 @@ parameter. Panics if either m or n are not positive.
                   Trait Implementations
                 
-                
impl Clone for FisherF
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for FisherF
[src]
Generate a random value.

+                
impl Copy for FisherF
[src]
impl IndependentSample<f64> for FisherF
[src]
Generate a random value.

 
impl Debug for FisherF
[src]
Formats the value using the given formatter. Read more

+
impl Clone for FisherF
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for FisherF
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for FisherF
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.Gamma.html b/master/rand/distributions/struct.Gamma.html
index d4f49c6a2..7eb40595a 100644
--- a/master/rand/distributions/struct.Gamma.html
+++ b/master/rand/distributions/struct.Gamma.html
@@ -1,4 +1,4 @@
-rand::distributions::Gamma - Rust
Struct rand::distributions::Gamma[−][src]
pub struct Gamma { /* fields omitted */ }
The Gamma distribution Gamma(shape, scale) distribution.

+rand::distributions::Gamma - Rust
Struct rand::distributions::Gamma[−][src]
pub struct Gamma { /* fields omitted */ }
The Gamma distribution Gamma(shape, scale) distribution.

 
The density function of this distribution is

 
f(x) =  x^(k - 1) * exp(-x / θ) / (Γ(k) * θ^k)
 

@@ -29,12 +29,12 @@ distribution.

                 

                   Trait Implementations
                 

-                
impl Clone for Gamma
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for Gamma
[src]
Generate a random value.

+                
impl Copy for Gamma
[src]
impl IndependentSample<f64> for Gamma
[src]
Generate a random value.

 
impl Debug for Gamma
[src]
Formats the value using the given formatter. Read more

+
impl Clone for Gamma
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for Gamma
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for Gamma
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.LogNormal.html b/master/rand/distributions/struct.LogNormal.html
index 406b42d47..82092235b 100644
--- a/master/rand/distributions/struct.LogNormal.html
+++ b/master/rand/distributions/struct.LogNormal.html
@@ -1,4 +1,4 @@
-rand::distributions::LogNormal - Rust
Struct rand::distributions::LogNormal[−][src]
pub struct LogNormal { /* fields omitted */ }
The log-normal distribution ln N(mean, std_dev**2).

+rand::distributions::LogNormal - Rust
Struct rand::distributions::LogNormal[−][src]
pub struct LogNormal { /* fields omitted */ }
The log-normal distribution ln N(mean, std_dev**2).

 
If X is log-normal distributed, then ln(X) is N(mean, std_dev**2) distributed.

 
Example

 
@@ -20,12 +20,12 @@ and standard deviation.

                 

                   Trait Implementations
                 

-                
impl Clone for LogNormal
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for LogNormal
[src]
Generate a random value.

+                
impl Copy for LogNormal
[src]
impl IndependentSample<f64> for LogNormal
[src]
Generate a random value.

 
impl Debug for LogNormal
[src]
Formats the value using the given formatter. Read more

+
impl Clone for LogNormal
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for LogNormal
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for LogNormal
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.Normal.html b/master/rand/distributions/struct.Normal.html
index 0e25ead68..3ce82376f 100644
--- a/master/rand/distributions/struct.Normal.html
+++ b/master/rand/distributions/struct.Normal.html
@@ -1,4 +1,4 @@
-rand::distributions::Normal - Rust
Struct rand::distributions::Normal[−][src]
pub struct Normal { /* fields omitted */ }
The normal distribution N(mean, std_dev**2).

+rand::distributions::Normal - Rust
Struct rand::distributions::Normal[−][src]
pub struct Normal { /* fields omitted */ }
The normal distribution N(mean, std_dev**2).

 
This uses the ZIGNOR variant of the Ziggurat method, see
 StandardNormal for more details.

 
Example

@@ -21,12 +21,12 @@ standard deviation.

                 

                   Trait Implementations
                 

-                
impl Clone for Normal
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for Normal
[src]
Generate a random value.

+                
impl Copy for Normal
[src]
impl IndependentSample<f64> for Normal
[src]
Generate a random value.

 
impl Debug for Normal
[src]
Formats the value using the given formatter. Read more

+
impl Clone for Normal
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for Normal
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for Normal
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.RandSample.html b/master/rand/distributions/struct.RandSample.html
index 322db123e..a0a16c8f5 100644
--- a/master/rand/distributions/struct.RandSample.html
+++ b/master/rand/distributions/struct.RandSample.html
@@ -1,4 +1,4 @@
-rand::distributions::RandSample - Rust
Struct rand::distributions::RandSample[−][src]
pub struct RandSample<Sup> { /* fields omitted */ }
A wrapper for generating types that implement Rand via the
+rand::distributions::RandSample - Rust
Struct rand::distributions::RandSample[−][src]
pub struct RandSample<Sup> { /* fields omitted */ }
A wrapper for generating types that implement Rand via the
 Sample & IndependentSample traits.

 

                     

@@ -8,12 +8,12 @@
                 

                   Trait Implementations
                 

-                
impl<Sup> Clone for RandSample<Sup>
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl<Sup> IndependentSample<Sup> for RandSample<Sup> where
    Sup: Rand, 
[src]
Generate a random value.

+                
impl<Sup> Copy for RandSample<Sup>
[src]
impl<Sup> IndependentSample<Sup> for RandSample<Sup> where
    Sup: Rand, 
[src]
Generate a random value.

 
impl<Sup> Debug for RandSample<Sup> where
    Sup: Debug, 
[src]
Formats the value using the given formatter. Read more

+
impl<Sup> Clone for RandSample<Sup>
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<Sup> Sample<Sup> for RandSample<Sup> where
    Sup: Rand, 
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl<Sup> Copy for RandSample<Sup>
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.Range.html b/master/rand/distributions/struct.Range.html
index caf547c77..ca0ccd771 100644
--- a/master/rand/distributions/struct.Range.html
+++ b/master/rand/distributions/struct.Range.html
@@ -1,4 +1,4 @@
-rand::distributions::Range - Rust
Struct rand::distributions::Range[−][src]
pub struct Range<X> { /* fields omitted */ }
Sample values uniformly between two bounds.

+rand::distributions::Range - Rust
Struct rand::distributions::Range[−][src]
pub struct Range<X> { /* fields omitted */ }
Sample values uniformly between two bounds.

 
This gives a uniform distribution (assuming the RNG used to sample
 it is itself uniform & the SampleRange implementation for the
 given type is correct), even for edge cases like low = 0u8,
@@ -32,12 +32,12 @@ normally satisfy it, but rounding may mean high can occur.

                 

                   Trait Implementations
                 

-                
impl<X> Clone for Range<X> where
    X: Clone, 
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl<Sup> IndependentSample<Sup> for Range<Sup> where
    Sup: SampleRange, 
[src]
Generate a random value.

+                
impl<X> Copy for Range<X> where
    X: Copy, 
[src]
impl<Sup> IndependentSample<Sup> for Range<Sup> where
    Sup: SampleRange, 
[src]
Generate a random value.

 
impl<X> Debug for Range<X> where
    X: Debug, 
[src]
Formats the value using the given formatter. Read more

+
impl<X> Clone for Range<X> where
    X: Clone, 
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<Sup> Sample<Sup> for Range<Sup> where
    Sup: SampleRange, 
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl<X> Copy for Range<X> where
    X: Copy, 
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.StudentT.html b/master/rand/distributions/struct.StudentT.html
index 17b7e44c9..3d189f10a 100644
--- a/master/rand/distributions/struct.StudentT.html
+++ b/master/rand/distributions/struct.StudentT.html
@@ -1,4 +1,4 @@
-rand::distributions::StudentT - Rust
Struct rand::distributions::StudentT[−][src]
pub struct StudentT { /* fields omitted */ }
The Student t distribution, t(nu), where nu is the degrees of
+rand::distributions::StudentT - Rust
Struct rand::distributions::StudentT[−][src]
pub struct StudentT { /* fields omitted */ }
The Student t distribution, t(nu), where nu is the degrees of
 freedom.

 
Example

 
@@ -17,12 +17,12 @@ freedom. Panics if n <= 0.

                 

                   Trait Implementations
                 

-                
impl Clone for StudentT
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl IndependentSample<f64> for StudentT
[src]
Generate a random value.

+                
impl Copy for StudentT
[src]
impl IndependentSample<f64> for StudentT
[src]
Generate a random value.

 
impl Debug for StudentT
[src]
Formats the value using the given formatter. Read more

+
impl Clone for StudentT
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl Sample<f64> for StudentT
[src]
Generate a random value of Support, using rng as the source of randomness. Read more

-
impl Copy for StudentT
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/struct.Weighted.html b/master/rand/distributions/struct.Weighted.html
index 195f1ea46..1302e2552 100644
--- a/master/rand/distributions/struct.Weighted.html
+++ b/master/rand/distributions/struct.Weighted.html
@@ -1,4 +1,4 @@
-rand::distributions::Weighted - Rust
Struct rand::distributions::Weighted[−][src]
pub struct Weighted<T> {
+rand::distributions::Weighted - Rust
Struct rand::distributions::Weighted[−][src]
pub struct Weighted<T> {
     pub weight: u32,
     pub item: T,
 }
A value with a particular weight for use with WeightedChoice.

@@ -17,10 +17,10 @@
                 

                   Trait Implementations
                 

-                
impl<T> Clone for Weighted<T> where
    T: Clone, 
[src]
Returns a copy of the value. Read more

+                
impl<T> Copy for Weighted<T> where
    T: Copy, 
[src]
impl<T> Debug for Weighted<T> where
    T: Debug, 
[src]
Formats the value using the given formatter. Read more

+
impl<T> Clone for Weighted<T> where
    T: Clone, 
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl<T> Debug for Weighted<T> where
    T: Debug, 
[src]
Formats the value using the given formatter. Read more

-
impl<T> Copy for Weighted<T> where
    T: Copy, 
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/distributions/trait.IndependentSample.html b/master/rand/distributions/trait.IndependentSample.html
index 014e765fb..177d6421d 100644
--- a/master/rand/distributions/trait.IndependentSample.html
+++ b/master/rand/distributions/trait.IndependentSample.html
@@ -15,16 +15,16 @@ property.

           Implementors
         
         

\ No newline at end of file
diff --git a/master/rand/distributions/trait.Sample.html b/master/rand/distributions/trait.Sample.html
index 3134d98c8..2c7cf95c8 100644
--- a/master/rand/distributions/trait.Sample.html
+++ b/master/rand/distributions/trait.Sample.html
@@ -13,16 +13,16 @@ source of randomness.

           Implementors
         
         

\ No newline at end of file
diff --git a/master/rand/isaac/struct.Isaac64Rng.html b/master/rand/isaac/struct.Isaac64Rng.html
index 6627040b3..15337c364 100644
--- a/master/rand/isaac/struct.Isaac64Rng.html
+++ b/master/rand/isaac/struct.Isaac64Rng.html
@@ -1,4 +1,4 @@
-rand::isaac::Isaac64Rng - Rust
Struct rand::isaac::Isaac64Rng[−][src]
pub struct Isaac64Rng { /* fields omitted */ }
A random number generator that uses ISAAC-64[1], the 64-bit
+rand::isaac::Isaac64Rng - Rust
Struct rand::isaac::Isaac64Rng[−][src]
pub struct Isaac64Rng { /* fields omitted */ }
A random number generator that uses ISAAC-64[1], the 64-bit
 variant of the ISAAC algorithm.

 
The ISAAC algorithm is generally accepted as suitable for
 cryptographic purposes, but this implementation has not be
@@ -16,9 +16,7 @@ default fixed seed.

                 

                   Trait Implementations
                 

-                
impl Clone for Isaac64Rng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for Isaac64Rng
[src]
Return the next random u32. Read more

+                
impl Copy for Isaac64Rng
[src]
impl Rng for Isaac64Rng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

 
Return the next random f64 selected from the half-open interval [0, 1). Read more

@@ -33,13 +31,15 @@ default fixed seed.

 
Shuffle a mutable slice in place. Read more

 
impl Debug for Isaac64Rng
[src]
Formats the value using the given formatter. Read more

 
impl Rand for Isaac64Rng
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Clone for Isaac64Rng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<'a> SeedableRng<&'a [u64]> for Isaac64Rng
[src]
Reseed an RNG with the given seed. Read more

 
Create an ISAAC random number generator with a seed. This can
 be any length, although the maximum number of elements used is
 256 and any more will be silently ignored. A generator
 constructed with a given seed will generate the same sequence
 of values as all other generators constructed with that seed.

-
impl Copy for Isaac64Rng
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/isaac/struct.IsaacRng.html b/master/rand/isaac/struct.IsaacRng.html
index a65a636e3..3a96dc531 100644
--- a/master/rand/isaac/struct.IsaacRng.html
+++ b/master/rand/isaac/struct.IsaacRng.html
@@ -1,4 +1,4 @@
-rand::isaac::IsaacRng - Rust
Struct rand::isaac::IsaacRng[−][src]
pub struct IsaacRng { /* fields omitted */ }
A random number generator that uses the ISAAC algorithm[1].

+rand::isaac::IsaacRng - Rust
Struct rand::isaac::IsaacRng[−][src]
pub struct IsaacRng { /* fields omitted */ }
A random number generator that uses the ISAAC algorithm[1].

 
The ISAAC algorithm is generally accepted as suitable for
 cryptographic purposes, but this implementation has not be
 verified as such. Prefer a generator like OsRng that defers to
@@ -15,9 +15,7 @@ fixed seed.

                 

                   Trait Implementations
                 

-                
impl Clone for IsaacRng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for IsaacRng
[src]
Return the next random u32. Read more

+                
impl Copy for IsaacRng
[src]
impl Rng for IsaacRng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

 
Return the next random f64 selected from the half-open interval [0, 1). Read more

@@ -32,13 +30,15 @@ fixed seed.

 
Shuffle a mutable slice in place. Read more

 
impl Debug for IsaacRng
[src]
Formats the value using the given formatter. Read more

 
impl Rand for IsaacRng
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Clone for IsaacRng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<'a> SeedableRng<&'a [u32]> for IsaacRng
[src]
Reseed an RNG with the given seed. Read more

 
Create an ISAAC random number generator with a seed. This can
 be any length, although the maximum number of elements used is
 256 and any more will be silently ignored. A generator
 constructed with a given seed will generate the same sequence
 of values as all other generators constructed with that seed.

-
impl Copy for IsaacRng
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/reseeding/struct.ReseedWithDefault.html b/master/rand/reseeding/struct.ReseedWithDefault.html
index 65837dbcf..59f2f1f57 100644
--- a/master/rand/reseeding/struct.ReseedWithDefault.html
+++ b/master/rand/reseeding/struct.ReseedWithDefault.html
@@ -1,15 +1,15 @@
-rand::reseeding::ReseedWithDefault - Rust
Struct rand::reseeding::ReseedWithDefault[−][src]
pub struct ReseedWithDefault;
Reseed an RNG using a Default instance. This reseeds by
+rand::reseeding::ReseedWithDefault - Rust
Struct rand::reseeding::ReseedWithDefault[−][src]
pub struct ReseedWithDefault;
Reseed an RNG using a Default instance. This reseeds by
 replacing the RNG with the result of a Default::default call.

 

                 

                   Trait Implementations
                 

                 
impl<R> Reseeder<R> for ReseedWithDefault where
    R: Rng + Default, 
[src]
Reseed the given RNG.

+
impl Copy for ReseedWithDefault
[src]
impl Debug for ReseedWithDefault
[src]
Formats the value using the given formatter. Read more

 
impl Clone for ReseedWithDefault
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

-
impl Debug for ReseedWithDefault
[src]
Formats the value using the given formatter. Read more

 
impl Default for ReseedWithDefault
[src]
Returns the "default value" for a type. Read more

-
impl Copy for ReseedWithDefault
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/struct.AsciiGenerator.html b/master/rand/struct.AsciiGenerator.html
index 00f6eb306..7a41dd89f 100644
--- a/master/rand/struct.AsciiGenerator.html
+++ b/master/rand/struct.AsciiGenerator.html
@@ -1,10 +1,11 @@
-rand::AsciiGenerator - Rust
Struct rand::AsciiGenerator[−][src]
pub struct AsciiGenerator<'a, R> where
    R: 'a,  { /* fields omitted */ }
Iterator which will continuously generate random ascii characters.

+rand::AsciiGenerator - Rust
Struct rand::AsciiGenerator[−][src]
pub struct AsciiGenerator<'a, R> where
    R: 'a,  { /* fields omitted */ }
Iterator which will continuously generate random ascii characters.

 
This iterator is created via the gen_ascii_chars method on Rng.

 

                 

                   Trait Implementations
                 

-                
impl<'a, R> Iterator for AsciiGenerator<'a, R> where
    R: Rng, 
[src]

+                
impl<'a, R> Debug for AsciiGenerator<'a, R> where
    R: 'a + Debug, 
[src]
Formats the value using the given formatter. Read more

+
impl<'a, R> Iterator for AsciiGenerator<'a, R> where
    R: Rng, 
[src]

 
The type of the elements being iterated over.

 
Advances the iterator and returns the next value. Read more

 
Returns the bounds on the remaining length of the iterator. Read more

@@ -28,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -63,7 +64,6 @@
 
Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more

 
Determines if the elements of this Iterator are lexicographically greater than those of another. Read more

 
Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more

-
impl<'a, R> Debug for AsciiGenerator<'a, R> where
    R: 'a + Debug, 
[src]
Formats the value using the given formatter. Read more

 

                 

                   Auto Trait Implementations
diff --git a/master/rand/struct.ChaChaRng.html b/master/rand/struct.ChaChaRng.html
index a5b200e9b..6e5a54ad4 100644
--- a/master/rand/struct.ChaChaRng.html
+++ b/master/rand/struct.ChaChaRng.html
@@ -1,4 +1,4 @@
-rand::ChaChaRng - Rust
Struct rand::ChaChaRng[−][src]
pub struct ChaChaRng { /* fields omitted */ }
A random number generator that uses the ChaCha20 algorithm [1].

+rand::ChaChaRng - Rust
Struct rand::ChaChaRng[−][src]
pub struct ChaChaRng { /* fields omitted */ }
A random number generator that uses the ChaCha20 algorithm [1].

 
The ChaCha algorithm is widely accepted as suitable for
 cryptographic purposes, but this implementation has not been
 verified as such. Prefer a generator like OsRng that defers to
@@ -44,9 +44,7 @@ arguments 0, desired_nonce.

                 

                   Trait Implementations
                 

-                
impl Clone for ChaChaRng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for ChaChaRng
[src]
Return the next random u32. Read more

+                
impl Copy for ChaChaRng
[src]
impl Rng for ChaChaRng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

 
Return the next random f64 selected from the half-open interval [0, 1). Read more

@@ -61,12 +59,14 @@ arguments 0, desired_nonce.

 
Shuffle a mutable slice in place. Read more

 
impl Debug for ChaChaRng
[src]
Formats the value using the given formatter. Read more

 
impl Rand for ChaChaRng
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Clone for ChaChaRng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<'a> SeedableRng<&'a [u32]> for ChaChaRng
[src]
Reseed an RNG with the given seed. Read more

 
Create a ChaCha generator from a seed,
 obtained from a variable-length u32 array.
 Only up to 8 words are used; if less than 8
 words are used, the remaining are set to zero.

-
impl Copy for ChaChaRng
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/struct.Closed01.html b/master/rand/struct.Closed01.html
index af03d9013..d0aca7923 100644
--- a/master/rand/struct.Closed01.html
+++ b/master/rand/struct.Closed01.html
@@ -14,8 +14,8 @@ closed interval [0,1] (including both endpoints).

                   Trait Implementations
                 

                 
impl<F> Debug for Closed01<F> where
    F: Debug, 
[src]
Formats the value using the given formatter. Read more

-
impl Rand for Closed01<f64>
[src]
Generates a random instance of this type using the specified source of randomness. Read more

-
impl Rand for Closed01<f32>
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Rand for Closed01<f32>
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Rand for Closed01<f64>
[src]
Generates a random instance of this type using the specified source of randomness. Read more

 

                 

                   Auto Trait Implementations
diff --git a/master/rand/struct.Generator.html b/master/rand/struct.Generator.html
index 13acee5f3..8cc32c227 100644
--- a/master/rand/struct.Generator.html
+++ b/master/rand/struct.Generator.html
@@ -1,10 +1,11 @@
-rand::Generator - Rust
Struct rand::Generator[−][src]
pub struct Generator<'a, T, R> where
    R: 'a,  { /* fields omitted */ }
Iterator which will generate a stream of random items.

+rand::Generator - Rust
Struct rand::Generator[−][src]
pub struct Generator<'a, T, R> where
    R: 'a,  { /* fields omitted */ }
Iterator which will generate a stream of random items.

 
This iterator is created via the gen_iter method on Rng.

 

                 

                   Trait Implementations
                 

-                
impl<'a, T, R> Iterator for Generator<'a, T, R> where
    R: Rng,
    T: Rand, 
[src]

+                
impl<'a, T, R> Debug for Generator<'a, T, R> where
    R: 'a + Debug,
    T: Debug, 
[src]
Formats the value using the given formatter. Read more

+
impl<'a, T, R> Iterator for Generator<'a, T, R> where
    R: Rng,
    T: Rand, 
[src]

 
The type of the elements being iterated over.

 
Advances the iterator and returns the next value. Read more

 
Returns the bounds on the remaining length of the iterator. Read more

@@ -28,7 +29,7 @@
 
ⓘImportant traits for Scan<I, St, F>
An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

 
ⓘImportant traits for FlatMap<I, U, F>
Creates an iterator that works like map, but flattens nested structure. Read more

 
ⓘImportant traits for Flatten<I>
🔬 This is a nightly-only experimental API.  (iterator_flatten)
Creates an iterator that flattens nested structure. Read more

-
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

+
ⓘImportant traits for Fuse<I>
Creates an iterator which ends after the first [None]. Read more

 
ⓘImportant traits for Inspect<I, F>
Do something with each element of an iterator, passing the value on. Read more

 
ⓘImportant traits for &'a mut R
Borrows an iterator, rather than consuming it. Read more

 
Transforms an iterator into a collection. Read more

@@ -63,7 +64,6 @@
 
Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more

 
Determines if the elements of this Iterator are lexicographically greater than those of another. Read more

 
Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more

-
impl<'a, T, R> Debug for Generator<'a, T, R> where
    R: 'a + Debug,
    T: Debug, 
[src]
Formats the value using the given formatter. Read more

 

                 

                   Auto Trait Implementations
diff --git a/master/rand/struct.Isaac64Rng.html b/master/rand/struct.Isaac64Rng.html
index 7eb4005fc..cf1d0da58 100644
--- a/master/rand/struct.Isaac64Rng.html
+++ b/master/rand/struct.Isaac64Rng.html
@@ -1,4 +1,4 @@
-rand::Isaac64Rng - Rust
Struct rand::Isaac64Rng[−][src]
pub struct Isaac64Rng { /* fields omitted */ }
A random number generator that uses ISAAC-64[1], the 64-bit
+rand::Isaac64Rng - Rust
Struct rand::Isaac64Rng[−][src]
pub struct Isaac64Rng { /* fields omitted */ }
A random number generator that uses ISAAC-64[1], the 64-bit
 variant of the ISAAC algorithm.

 
The ISAAC algorithm is generally accepted as suitable for
 cryptographic purposes, but this implementation has not be
@@ -16,9 +16,7 @@ default fixed seed.

                 

                   Trait Implementations
                 

-                
impl Clone for Isaac64Rng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for Isaac64Rng
[src]
Return the next random u32. Read more

+                
impl Copy for Isaac64Rng
[src]
impl Rng for Isaac64Rng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

 
Return the next random f64 selected from the half-open interval [0, 1). Read more

@@ -33,13 +31,15 @@ default fixed seed.

 
Shuffle a mutable slice in place. Read more

 
impl Debug for Isaac64Rng
[src]
Formats the value using the given formatter. Read more

 
impl Rand for Isaac64Rng
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Clone for Isaac64Rng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<'a> SeedableRng<&'a [u64]> for Isaac64Rng
[src]
Reseed an RNG with the given seed. Read more

 
Create an ISAAC random number generator with a seed. This can
 be any length, although the maximum number of elements used is
 256 and any more will be silently ignored. A generator
 constructed with a given seed will generate the same sequence
 of values as all other generators constructed with that seed.

-
impl Copy for Isaac64Rng
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/struct.IsaacRng.html b/master/rand/struct.IsaacRng.html
index 637b65077..141977e09 100644
--- a/master/rand/struct.IsaacRng.html
+++ b/master/rand/struct.IsaacRng.html
@@ -1,4 +1,4 @@
-rand::IsaacRng - Rust
Struct rand::IsaacRng[−][src]
pub struct IsaacRng { /* fields omitted */ }
A random number generator that uses the ISAAC algorithm[1].

+rand::IsaacRng - Rust
Struct rand::IsaacRng[−][src]
pub struct IsaacRng { /* fields omitted */ }
A random number generator that uses the ISAAC algorithm[1].

 
The ISAAC algorithm is generally accepted as suitable for
 cryptographic purposes, but this implementation has not be
 verified as such. Prefer a generator like OsRng that defers to
@@ -15,9 +15,7 @@ fixed seed.

                 

                   Trait Implementations
                 

-                
impl Clone for IsaacRng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for IsaacRng
[src]
Return the next random u32. Read more

+                
impl Copy for IsaacRng
[src]
impl Rng for IsaacRng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

 
Return the next random f64 selected from the half-open interval [0, 1). Read more

@@ -32,13 +30,15 @@ fixed seed.

 
Shuffle a mutable slice in place. Read more

 
impl Debug for IsaacRng
[src]
Formats the value using the given formatter. Read more

 
impl Rand for IsaacRng
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Clone for IsaacRng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<'a> SeedableRng<&'a [u32]> for IsaacRng
[src]
Reseed an RNG with the given seed. Read more

 
Create an ISAAC random number generator with a seed. This can
 be any length, although the maximum number of elements used is
 256 and any more will be silently ignored. A generator
 constructed with a given seed will generate the same sequence
 of values as all other generators constructed with that seed.

-
impl Copy for IsaacRng
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/struct.StdRng.html b/master/rand/struct.StdRng.html
index e0a7f5163..d3bf622c4 100644
--- a/master/rand/struct.StdRng.html
+++ b/master/rand/struct.StdRng.html
@@ -1,4 +1,4 @@
-rand::StdRng - Rust
Struct rand::StdRng[−][src]
pub struct StdRng { /* fields omitted */ }
The standard RNG. This is designed to be efficient on the current
+rand::StdRng - Rust
Struct rand::StdRng[−][src]
pub struct StdRng { /* fields omitted */ }
The standard RNG. This is designed to be efficient on the current
 platform.

 

                     

@@ -17,9 +17,7 @@ propagated via the io::Result return value.

                 

                   Trait Implementations
                 

-                
impl Clone for StdRng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for StdRng
[src]
Return the next random u32. Read more

+                
impl Copy for StdRng
[src]
impl Rng for StdRng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

 
Return the next random f64 selected from the half-open interval [0, 1). Read more

@@ -33,9 +31,11 @@ propagated via the io::Result return value.

 
Return a mutable pointer to a random element from values. Read more

 
Shuffle a mutable slice in place. Read more

 
impl Debug for StdRng
[src]
Formats the value using the given formatter. Read more

+
impl Clone for StdRng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl<'a> SeedableRng<&'a [usize]> for StdRng
[src]
Reseed an RNG with the given seed. Read more

 
Create a new RNG with the given seed. Read more

-
impl Copy for StdRng
[src]

+

                 

                   Auto Trait Implementations
                 

diff --git a/master/rand/struct.ThreadRng.html b/master/rand/struct.ThreadRng.html
index 2daf3f188..2f5716bcf 100644
--- a/master/rand/struct.ThreadRng.html
+++ b/master/rand/struct.ThreadRng.html
@@ -1,11 +1,9 @@
-rand::ThreadRng - Rust
Struct rand::ThreadRng[−][src]
pub struct ThreadRng { /* fields omitted */ }
The thread-local RNG.

+rand::ThreadRng - Rust
Struct rand::ThreadRng[−][src]
pub struct ThreadRng { /* fields omitted */ }
The thread-local RNG.

 

                 

                   Trait Implementations
                 

-                
impl Clone for ThreadRng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for ThreadRng
[src]
Return the next random u32. Read more

+                
impl Rng for ThreadRng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Fill dest with random data. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

@@ -19,6 +17,8 @@
 
Return a mutable pointer to a random element from values. Read more

 
Shuffle a mutable slice in place. Read more

 
impl Debug for ThreadRng
[src]
Formats the value using the given formatter. Read more

+
impl Clone for ThreadRng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 

                 

                   Auto Trait Implementations
diff --git a/master/rand/struct.XorShiftRng.html b/master/rand/struct.XorShiftRng.html
index c0b243ba4..9ea0e6035 100644
--- a/master/rand/struct.XorShiftRng.html
+++ b/master/rand/struct.XorShiftRng.html
@@ -1,4 +1,4 @@
-rand::XorShiftRng - Rust
Struct rand::XorShiftRng[−][src]
pub struct XorShiftRng { /* fields omitted */ }
An Xorshift[1] random number
+rand::XorShiftRng - Rust
Struct rand::XorShiftRng[−][src]
pub struct XorShiftRng { /* fields omitted */ }
An Xorshift[1] random number
 generator.

 
The Xorshift algorithm is not suitable for cryptographic purposes
 but is very fast. If you do not know for sure that it fits your
@@ -19,9 +19,7 @@ this function

                 

                   Trait Implementations
                 

-                
impl Clone for XorShiftRng
[src]
Returns a copy of the value. Read more

-
Performs copy-assignment from source. Read more

-
impl Rng for XorShiftRng
[src]
Return the next random u32. Read more

+                
impl Rng for XorShiftRng
[src]
Return the next random u32. Read more

 
Return the next random u64. Read more

 
Return the next random f32 selected from the half-open interval [0, 1). Read more

 
Return the next random f64 selected from the half-open interval [0, 1). Read more

@@ -36,6 +34,8 @@ this function

 
Shuffle a mutable slice in place. Read more

 
impl Debug for XorShiftRng
[src]
Formats the value using the given formatter. Read more

 
impl Rand for XorShiftRng
[src]
Generates a random instance of this type using the specified source of randomness. Read more

+
impl Clone for XorShiftRng
[src]
Returns a copy of the value. Read more

+
Performs copy-assignment from source. Read more

 
impl SeedableRng<[u32; 4]> for XorShiftRng
[src]
Reseed an XorShiftRng. This will panic if seed is entirely 0.

 
Create a new XorShiftRng. This will panic if seed is entirely 0.

 

diff --git a/master/rand/trait.Rand.html b/master/rand/trait.Rand.html
index 46c4c5053..698423e0b 100644
--- a/master/rand/trait.Rand.html
+++ b/master/rand/trait.Rand.html
@@ -1,4 +1,4 @@
-rand::Rand - Rust
Trait rand::Rand[−][src]
pub trait Rand {
+rand::Rand - Rust
Trait rand::Rand[−][src]
pub trait Rand {
     fn rand<R>(rng: &mut R) -> Self
    where
        R: Rng;
 }
A type that can be randomly generated using an Rng.

 
Built-in Implementations

@@ -37,29 +37,29 @@ randomness.

                 

                   Implementations on Foreign Types
                 

-            
impl Rand for f32
[src]
Generate a floating point number in the half-open
+            
impl<A, B, C, D, E> Rand for (A, B, C, D, E) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand, 
[src]
impl Rand for i8
[src]
impl<T> Rand for [T; 30] where
    T: Rand, 
[src]
impl Rand for u32
[src]
impl Rand for usize
[src]
impl<A, B, C, D, E, F> Rand for (A, B, C, D, E, F) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand, 
[src]
impl<T> Rand for [T; 12] where
    T: Rand, 
[src]
impl<T> Rand for [T; 23] where
    T: Rand, 
[src]
impl Rand for char
[src]
impl<T> Rand for [T; 31] where
    T: Rand, 
[src]
impl<T> Rand for [T; 22] where
    T: Rand, 
[src]
impl<T> Rand for [T; 4] where
    T: Rand, 
[src]
impl<T> Rand for [T; 16] where
    T: Rand, 
[src]
impl<T> Rand for Option<T> where
    T: Rand, 
[src]
impl<T> Rand for [T; 20] where
    T: Rand, 
[src]
impl Rand for i32
[src]
impl Rand for i16
[src]
impl<T> Rand for [T; 18] where
    T: Rand, 
[src]
impl Rand for isize
[src]
impl<T> Rand for [T; 29] where
    T: Rand, 
[src]
impl Rand for u64
[src]
impl<T> Rand for [T; 9] where
    T: Rand, 
[src]
impl Rand for u16
[src]
impl<T> Rand for [T; 6] where
    T: Rand, 
[src]
impl<A, B> Rand for (A, B) where
    A: Rand,
    B: Rand, 
[src]
impl<T> Rand for [T; 21] where
    T: Rand, 
[src]
impl<T> Rand for [T; 5] where
    T: Rand, 
[src]
impl<T> Rand for [T; 2] where
    T: Rand, 
[src]
impl<A, B, C, D, E, F, G, H, I, J, K, L> Rand for (A, B, C, D, E, F, G, H, I, J, K, L) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand,
    I: Rand,
    J: Rand,
    K: Rand,
    L: Rand, 
[src]
impl<T> Rand for [T; 13] where
    T: Rand, 
[src]
impl<A, B, C> Rand for (A, B, C) where
    A: Rand,
    B: Rand,
    C: Rand, 
[src]
impl<T> Rand for [T; 14] where
    T: Rand, 
[src]
impl<T> Rand for [T; 1] where
    T: Rand, 
[src]
impl<T> Rand for [T; 0]
[src]
impl<T> Rand for [T; 28] where
    T: Rand, 
[src]
impl<A> Rand for (A,) where
    A: Rand, 
[src]
impl<A, B, C, D, E, F, G, H> Rand for (A, B, C, D, E, F, G, H) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand, 
[src]
impl Rand for bool
[src]
impl<T> Rand for [T; 11] where
    T: Rand, 
[src]
impl<T> Rand for [T; 24] where
    T: Rand, 
[src]
impl<A, B, C, D, E, F, G, H, I, J, K> Rand for (A, B, C, D, E, F, G, H, I, J, K) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand,
    I: Rand,
    J: Rand,
    K: Rand, 
[src]
impl<T> Rand for [T; 7] where
    T: Rand, 
[src]
impl<T> Rand for [T; 15] where
    T: Rand, 
[src]
impl Rand for ()
[src]
impl<T> Rand for [T; 27] where
    T: Rand, 
[src]
impl<T> Rand for [T; 32] where
    T: Rand, 
[src]
impl<T> Rand for [T; 25] where
    T: Rand, 
[src]
impl<T> Rand for [T; 10] where
    T: Rand, 
[src]
impl<T> Rand for [T; 26] where
    T: Rand, 
[src]
impl<T> Rand for [T; 17] where
    T: Rand, 
[src]
impl<T> Rand for [T; 8] where
    T: Rand, 
[src]
impl Rand for i64
[src]
impl Rand for f64
[src]
Generate a floating point number in the half-open
 interval [0,1).

 
See Closed01 for the closed interval [0,1],
 and Open01 for the open interval (0,1).

-
impl Rand for char
[src]
impl Rand for i32
[src]
impl Rand for i64
[src]
impl<T> Rand for [T; 21] where
    T: Rand, 
[src]
impl Rand for f64
[src]
Generate a floating point number in the half-open
+
impl<T> Rand for [T; 19] where
    T: Rand, 
[src]
impl<A, B, C, D> Rand for (A, B, C, D) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand, 
[src]
impl Rand for u8
[src]
impl<A, B, C, D, E, F, G> Rand for (A, B, C, D, E, F, G) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand, 
[src]
impl Rand for f32
[src]
Generate a floating point number in the half-open
 interval [0,1).

 
See Closed01 for the closed interval [0,1],
 and Open01 for the open interval (0,1).

-
impl Rand for u8
[src]
impl<T> Rand for [T; 1] where
    T: Rand, 
[src]
impl<T> Rand for [T; 13] where
    T: Rand, 
[src]
impl<A, B, C, D, E, F, G, H, I, J> Rand for (A, B, C, D, E, F, G, H, I, J) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand,
    I: Rand,
    J: Rand, 
[src]
impl<T> Rand for [T; 22] where
    T: Rand, 
[src]
impl Rand for i16
[src]
impl<T> Rand for [T; 25] where
    T: Rand, 
[src]
impl<T> Rand for [T; 28] where
    T: Rand, 
[src]
impl<T> Rand for [T; 12] where
    T: Rand, 
[src]
impl Rand for ()
[src]
impl<T> Rand for [T; 11] where
    T: Rand, 
[src]
impl<A, B> Rand for (A, B) where
    A: Rand,
    B: Rand, 
[src]
impl<T> Rand for [T; 26] where
    T: Rand, 
[src]
impl<T> Rand for [T; 4] where
    T: Rand, 
[src]
impl<T> Rand for [T; 6] where
    T: Rand, 
[src]
impl<T> Rand for [T; 23] where
    T: Rand, 
[src]
impl<T> Rand for [T; 24] where
    T: Rand, 
[src]
impl<A, B, C, D> Rand for (A, B, C, D) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand, 
[src]
impl<T> Rand for [T; 3] where
    T: Rand, 
[src]
impl<A, B, C> Rand for (A, B, C) where
    A: Rand,
    B: Rand,
    C: Rand, 
[src]
impl<T> Rand for [T; 27] where
    T: Rand, 
[src]
impl<T> Rand for [T; 32] where
    T: Rand, 
[src]
impl<T> Rand for [T; 7] where
    T: Rand, 
[src]
impl<T> Rand for [T; 10] where
    T: Rand, 
[src]
impl Rand for i8
[src]
impl<T> Rand for [T; 15] where
    T: Rand, 
[src]
impl<T> Rand for [T; 17] where
    T: Rand, 
[src]
impl<A, B, C, D, E, F, G, H> Rand for (A, B, C, D, E, F, G, H) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand, 
[src]
impl<A, B, C, D, E, F, G, H, I, J, K, L> Rand for (A, B, C, D, E, F, G, H, I, J, K, L) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand,
    I: Rand,
    J: Rand,
    K: Rand,
    L: Rand, 
[src]
impl<A, B, C, D, E, F, G, H, I> Rand for (A, B, C, D, E, F, G, H, I) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand,
    I: Rand, 
[src]
impl Rand for u64
[src]
impl<T> Rand for [T; 29] where
    T: Rand, 
[src]
impl<T> Rand for [T; 0]
[src]
impl<T> Rand for [T; 9] where
    T: Rand, 
[src]
impl<A, B, C, D, E, F, G> Rand for (A, B, C, D, E, F, G) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand, 
[src]
impl<T> Rand for [T; 20] where
    T: Rand, 
[src]
impl<T> Rand for [T; 16] where
    T: Rand, 
[src]
impl<T> Rand for [T; 18] where
    T: Rand, 
[src]
impl<T> Rand for [T; 31] where
    T: Rand, 
[src]
impl Rand for u32
[src]
impl<A> Rand for (A,) where
    A: Rand, 
[src]
impl Rand for u16
[src]
impl<T> Rand for [T; 5] where
    T: Rand, 
[src]
impl<A, B, C, D, E, F, G, H, I, J, K> Rand for (A, B, C, D, E, F, G, H, I, J, K) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand,
    I: Rand,
    J: Rand,
    K: Rand, 
[src]
impl<T> Rand for [T; 30] where
    T: Rand, 
[src]
impl<A, B, C, D, E, F> Rand for (A, B, C, D, E, F) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand, 
[src]
impl Rand for bool
[src]
impl<A, B, C, D, E> Rand for (A, B, C, D, E) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand, 
[src]
impl<T> Rand for Option<T> where
    T: Rand, 
[src]
impl<T> Rand for [T; 14] where
    T: Rand, 
[src]
impl<T> Rand for [T; 8] where
    T: Rand, 
[src]
impl Rand for usize
[src]
impl<T> Rand for [T; 19] where
    T: Rand, 
[src]
impl<T> Rand for [T; 2] where
    T: Rand, 
[src]
impl Rand for isize
[src]

+
impl<T> Rand for [T; 3] where
    T: Rand, 
[src]
impl<A, B, C, D, E, F, G, H, I> Rand for (A, B, C, D, E, F, G, H, I) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand,
    I: Rand, 
[src]
impl<A, B, C, D, E, F, G, H, I, J> Rand for (A, B, C, D, E, F, G, H, I, J) where
    A: Rand,
    B: Rand,
    C: Rand,
    D: Rand,
    E: Rand,
    F: Rand,
    G: Rand,
    H: Rand,
    I: Rand,
    J: Rand, 
[src]

         

           Implementors
         

         

\ No newline at end of file
diff --git a/master/rand/trait.Rng.html b/master/rand/trait.Rng.html
index 0254952cf..0d2532a0a 100644
--- a/master/rand/trait.Rng.html
+++ b/master/rand/trait.Rng.html
@@ -1,4 +1,4 @@
-rand::Rng - Rust
Trait rand::Rng[−][src]
pub trait Rng {
+rand::Rng - Rust
Trait rand::Rng[−][src]
pub trait Rng {
     fn next_u32(&mut self) -> u32;
 
     fn next_u64(&mut self) -> u64 { ... }
@@ -167,20 +167,20 @@ which produces an unbiased permutation.

                 

                   Implementations on Foreign Types
                 

-            
impl Rng for JitterRng
[src]
ⓘImportant traits for Generator<'a, T, R>
ⓘImportant traits for AsciiGenerator<'a, R>
impl<'a, R> Rng for &'a mut R where
    R: Rng + ?Sized, 
[src]
ⓘImportant traits for Generator<'a, T, R>
ⓘImportant traits for AsciiGenerator<'a, R>
impl<R> Rng for Box<R> where
    R: Rng + ?Sized, 
[src]
ⓘImportant traits for Generator<'a, T, R>
ⓘImportant traits for AsciiGenerator<'a, R>

+            
impl<'a, R> Rng for &'a mut R where
    R: Rng + ?Sized, 
[src]
ⓘImportant traits for Generator<'a, T, R>
ⓘImportant traits for AsciiGenerator<'a, R>
impl<R> Rng for Box<R> where
    R: Rng + ?Sized, 
[src]
ⓘImportant traits for Generator<'a, T, R>
ⓘImportant traits for AsciiGenerator<'a, R>
impl Rng for JitterRng
[src]
ⓘImportant traits for Generator<'a, T, R>
ⓘImportant traits for AsciiGenerator<'a, R>

         

           Implementors
         

         

\ No newline at end of file
diff --git a/master/rand/trait.SeedableRng.html b/master/rand/trait.SeedableRng.html
index 9e269cd3b..6dc0b3a6e 100644
--- a/master/rand/trait.SeedableRng.html
+++ b/master/rand/trait.SeedableRng.html
@@ -33,8 +33,8 @@ the same stream of randomness multiple times.

         
  1
+  2
+  3
+  4
+  5
+  6
+  7
+  8
+  9
+ 10
+ 11
+ 12
+ 13
+ 14
+ 15
+ 16
+ 17
+ 18
+ 19
+ 20
+ 21
+ 22
+ 23
+ 24
+ 25
+ 26
+ 27
+ 28
+ 29
+ 30
+ 31
+ 32
+ 33
+ 34
+ 35
+ 36
+ 37
+ 38
+ 39
+ 40
+ 41
+ 42
+ 43
+ 44
+ 45
+ 46
+ 47
+ 48
+ 49
+ 50
+ 51
+ 52
+ 53
+ 54
+ 55
+ 56
+ 57
+ 58
+ 59
+ 60
+ 61
+ 62
+ 63
+ 64
+ 65
+ 66
+ 67
+ 68
+ 69
+ 70
+ 71
+ 72
+ 73
+ 74
+ 75
+ 76
+ 77
+ 78
+ 79
+ 80
+ 81
+ 82
+ 83
+ 84
+ 85
+ 86
+ 87
+ 88
+ 89
+ 90
+ 91
+ 92
+ 93
+ 94
+ 95
+ 96
+ 97
+ 98
+ 99
+100
+101
+102
+103
+104
+105
+106
+107
+108
+109
+110
+111
+112
+113
+114
+115
+116
+117
+118
+119
+120
+121
+122
+123
+124
+125
+126
+127
+128
+129
+130
+131
+132
+133
+134
+135
+136
+137
+138
+139
+140
+141
+142
+143
+144
+145
+146
+147
+148
+149
+150
+151
+152
+153
+154
+155
+156
+157
+158
+159
+160
+161
+162
+163
+164
+165
+166
+167
+168
+169
+170
+171
+172
+173
+174
+175
+176
+177
+178
+179
+180
+181
+182
+183
+184
+185
+186
+187
+188
+189
+190
+191
+192
+193
+194
+195
+196
+197
+198
+199
+200
+201
+202
+203
+204
+205
+206
+207
+208
+209
+210
+211
+212
+213
+214
+215
+216
+217
+218
+219
+220
+221
+222
+223
+224
+225
+226
+227
+228
+229
+230
+231
+232
+233
+234
+235
+236
+237
+238
+239
+240
+241
+242
+243
+244
+245
+246
+247
+248
+249
+250
+251
+252
+253
+254
+255
+256
+257
+258
+259
+260
+261
+262
+263
+264
+265
+266
+267
+268
+269
+270
+271
+272
+273
+274
+275
+276
+277
+278
+279
+280
+281
+282
+283
+284
+285
+286
+287
+288
+289
+290
+291
+292
+293
+294
+295
+296
+297
+298
+299
+300
+301
+302
+303
+304
+305
+306
+307
+308
+309
+310
+311
+312
+313
+314
+315
+316
+317
+318
+319
+320
+321
+322
+323
+324
+325
+326
+327
+328
+329
+330
+331
+332
+333
+334
+335
+336
+337
+338
+339
+340
+341
+342
+343
+344
+345
+346
+347
+348
+349
+350
+351
+352
+353
+354
+355
+356
+357
+358
+359
+360
+361
+362
+363
+364
+365
+366
+367
+368
+369
+370
+371
+372
+373
+374
+375
+376
+377
+378
+379
+380
+381
+382
+383
+384
+385
+386
+387
+388
+389
+390
+391
+392
+393
+394
+395
+396
+397
+398
+399
+400
+401
+402
+403
+404
+405
+406
+407
+408
+409
+410
+411
+412
+413
+414
+415
+416
+417
+418
+419
+420
+421
+422
+423
+424
+425
+426
+427
+428
+429
+430
+431
+432
+433
+434
+435
+436
+437
+438
+439
+440
+441
+442
+443
+444
+445
+446
+447
+448
+449
+450
+451
+452
+453
+454
+455
+456
+457
+458
+459
+460
+461
+462
+463
+464
+465
+466
+467
+468
+469
+470
+471
+472
+473
+474
+475
+476
+477
+478
+479
+480
+481
+482
+483
+484
+485
+486
+487
+488
+489
+490
+491
+492
+493
+494
+495
+496
+497
+498
+499
+500
+501
+502
+503
+504
+505
+506
+507
+508
+509
+510
+511
+512
+513
+514
+515
+516
+517
+518
+519
+520
+521
+522
+523
+524
+525
+526
+527
+528
+529
+530
+531
+532
+533
+534
+535
+536
+537
+538
+539
+540
+541
+542
+543
+544
+545
+546
+547
+548
+549
+550
+551
+552
+553
+554
+555
+556
+557
+558
+559
+560
+561
+562
+563
+564
+565
+566
+567
+568
+569
+570
+571
+572
+573
+574
+575
+576
+577
+578
+579
+580
+581
+582
+583
+584
+585
+586
+587
+588
+589
+590
+591
+592
+593
+594
+595
+596
+597
+598
+599
+600
+601
+602
+603
+604
+605
+606
+607
+608
+609
+610
+611
+612
+613
+614
+615
+616
+617
+618
+619
+620
+621
+622
+623
+624
+625
+626
+627
+628
+629
+630
+631
+632
+633
+634
+635
+636
+637
+638
+639
+640
+641
+642
+643
+644
+645
+646
+647
+648
+649
+650
+651
+652
+653
+654
+655
+656
+657
+658
+659
+660
+661
+662
+663
+664
+665
+666
+667
+668
+669
+670
+671
+672
+673
+674
+675
+676
+677
+678
+679
+680
+681
+682
+683
+684
+685
+686
+687
+688
+689
+690
+691
+692
+693
+694
+695
+696
+697
+698
+699
+700
+701
+702
+703
+704
+705
+706
+707
+708
+709
+710
+711
+712
+713
+714
+715
+716
+717
+718
+719
+720
+721
+722
+723
+724
+725
+726
+727
+728
+729
+730
+731
+732
+733
+734
+735
+736
+737
+738
+739
+740
+741
+742
+743
+744
+745
+746
+747
+748
+749
+750
+751
+752
+753
+754
+755
+756
+757
+758
+759
+760
+761
+762
+763
+764
+765
+766
+767
+768
+769
+770
+771
+772
+773
+774
+775
+776
+777
+778
+779
+780
+781
+782
+783
+784
+785
+786
+787
+788
+789
+790
+791
+792
+793
+794
+795
+796
+797
+798
+799
+800
+801
+802
+803
+804
+805
+806
+807
+808
+809
+810
+811
+812
+813
+814
+815
+
+
+/// Unroll the given for loop
+///
+/// Example:
+///
+/// ```ignore
+/// unroll! {
+///   for i in 0..5 {
+///     println!("Iteration {}", i);
+///   }
+/// }
+/// ```
+///
+/// will expand into:
+///
+/// ```ignore
+/// { println!("Iteration {}", 0); }
+/// { println!("Iteration {}", 1); }
+/// { println!("Iteration {}", 2); }
+/// { println!("Iteration {}", 3); }
+/// { println!("Iteration {}", 4); }
+/// ```
+#[macro_export]
+macro_rules! unroll {
+    (for $v:ident in 0..0 $c:block) => {};
+
+    (for $v:ident in 0..$b:tt {$($c:tt)*}) => {
+        #[allow(non_upper_case_globals)]
+        { unroll!(@$v, 0, $b, {$($c)*}); }
+    };
+
+    (@$v:ident, $a:expr, 0, $c:block) => {
+        { const $v: usize = $a; $c }
+    };
+
+    (@$v:ident, $a:expr, 1, $c:block) => {
+        { const $v: usize = $a; $c }
+    };
+
+    (@$v:ident, $a:expr, 2, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+    };
+
+    (@$v:ident, $a:expr, 3, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+    };
+
+    (@$v:ident, $a:expr, 4, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+    };
+
+    (@$v:ident, $a:expr, 5, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+    };
+
+    (@$v:ident, $a:expr, 6, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+    };
+
+    (@$v:ident, $a:expr, 7, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+    };
+
+    (@$v:ident, $a:expr, 8, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+    };
+
+    (@$v:ident, $a:expr, 9, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+        { const $v: usize = $a + 8; $c }
+    };
+
+    (@$v:ident, $a:expr, 10, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+        { const $v: usize = $a + 8; $c }
+        { const $v: usize = $a + 9; $c }
+    };
+
+    (@$v:ident, $a:expr, 11, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+        { const $v: usize = $a + 8; $c }
+        { const $v: usize = $a + 9; $c }
+        { const $v: usize = $a + 10; $c }
+    };
+
+    (@$v:ident, $a:expr, 12, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+        { const $v: usize = $a + 8; $c }
+        { const $v: usize = $a + 9; $c }
+        { const $v: usize = $a + 10; $c }
+        { const $v: usize = $a + 11; $c }
+    };
+
+    (@$v:ident, $a:expr, 13, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+        { const $v: usize = $a + 8; $c }
+        { const $v: usize = $a + 9; $c }
+        { const $v: usize = $a + 10; $c }
+        { const $v: usize = $a + 11; $c }
+        { const $v: usize = $a + 12; $c }
+    };
+
+    (@$v:ident, $a:expr, 14, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+        { const $v: usize = $a + 8; $c }
+        { const $v: usize = $a + 9; $c }
+        { const $v: usize = $a + 10; $c }
+        { const $v: usize = $a + 11; $c }
+        { const $v: usize = $a + 12; $c }
+        { const $v: usize = $a + 13; $c }
+    };
+
+    (@$v:ident, $a:expr, 15, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+        { const $v: usize = $a + 8; $c }
+        { const $v: usize = $a + 9; $c }
+        { const $v: usize = $a + 10; $c }
+        { const $v: usize = $a + 11; $c }
+        { const $v: usize = $a + 12; $c }
+        { const $v: usize = $a + 13; $c }
+        { const $v: usize = $a + 14; $c }
+    };
+
+    (@$v:ident, $a:expr, 16, $c:block) => {
+        { const $v: usize = $a; $c }
+        { const $v: usize = $a + 1; $c }
+        { const $v: usize = $a + 2; $c }
+        { const $v: usize = $a + 3; $c }
+        { const $v: usize = $a + 4; $c }
+        { const $v: usize = $a + 5; $c }
+        { const $v: usize = $a + 6; $c }
+        { const $v: usize = $a + 7; $c }
+        { const $v: usize = $a + 8; $c }
+        { const $v: usize = $a + 9; $c }
+        { const $v: usize = $a + 10; $c }
+        { const $v: usize = $a + 11; $c }
+        { const $v: usize = $a + 12; $c }
+        { const $v: usize = $a + 13; $c }
+        { const $v: usize = $a + 14; $c }
+        { const $v: usize = $a + 15; $c }
+    };
+
+    (@$v:ident, $a:expr, 17, $c:block) => {
+        unroll!(@$v, $a, 16, $c);
+        { const $v: usize = $a + 16; $c }
+    };
+
+    (@$v:ident, $a:expr, 18, $c:block) => {
+        unroll!(@$v, $a, 9, $c);
+        unroll!(@$v, $a + 9, 9, $c);
+    };
+
+    (@$v:ident, $a:expr, 19, $c:block) => {
+        unroll!(@$v, $a, 18, $c);
+        { const $v: usize = $a + 18; $c }
+    };
+
+    (@$v:ident, $a:expr, 20, $c:block) => {
+        unroll!(@$v, $a, 10, $c);
+        unroll!(@$v, $a + 10, 10, $c);
+    };
+
+    (@$v:ident, $a:expr, 21, $c:block) => {
+        unroll!(@$v, $a, 20, $c);
+        { const $v: usize = $a + 20; $c }
+    };
+
+    (@$v:ident, $a:expr, 22, $c:block) => {
+        unroll!(@$v, $a, 11, $c);
+        unroll!(@$v, $a + 11, 11, $c);
+    };
+
+    (@$v:ident, $a:expr, 23, $c:block) => {
+        unroll!(@$v, $a, 22, $c);
+        { const $v: usize = $a + 22; $c }
+    };
+
+    (@$v:ident, $a:expr, 24, $c:block) => {
+        unroll!(@$v, $a, 12, $c);
+        unroll!(@$v, $a + 12, 12, $c);
+    };
+
+    (@$v:ident, $a:expr, 25, $c:block) => {
+        unroll!(@$v, $a, 24, $c);
+        { const $v: usize = $a + 24; $c }
+    };
+
+    (@$v:ident, $a:expr, 26, $c:block) => {
+        unroll!(@$v, $a, 13, $c);
+        unroll!(@$v, $a + 13, 13, $c);
+    };
+
+    (@$v:ident, $a:expr, 27, $c:block) => {
+        unroll!(@$v, $a, 26, $c);
+        { const $v: usize = $a + 26; $c }
+    };
+
+    (@$v:ident, $a:expr, 28, $c:block) => {
+        unroll!(@$v, $a, 14, $c);
+        unroll!(@$v, $a + 14, 14, $c);
+    };
+
+    (@$v:ident, $a:expr, 29, $c:block) => {
+        unroll!(@$v, $a, 28, $c);
+        { const $v: usize = $a + 28; $c }
+    };
+
+    (@$v:ident, $a:expr, 30, $c:block) => {
+        unroll!(@$v, $a, 15, $c);
+        unroll!(@$v, $a + 15, 15, $c);
+    };
+
+    (@$v:ident, $a:expr, 31, $c:block) => {
+        unroll!(@$v, $a, 30, $c);
+        { const $v: usize = $a + 30; $c }
+    };
+
+    (@$v:ident, $a:expr, 32, $c:block) => {
+        unroll!(@$v, $a, 16, $c);
+        unroll!(@$v, $a + 16, 16, $c);
+    };
+
+    (@$v:ident, $a:expr, 33, $c:block) => {
+        unroll!(@$v, $a, 32, $c);
+        { const $v: usize = $a + 32; $c }
+    };
+
+    (@$v:ident, $a:expr, 34, $c:block) => {
+        unroll!(@$v, $a, 17, $c);
+        unroll!(@$v, $a + 17, 17, $c);
+    };
+
+    (@$v:ident, $a:expr, 35, $c:block) => {
+        unroll!(@$v, $a, 34, $c);
+        { const $v: usize = $a + 34; $c }
+    };
+
+    (@$v:ident, $a:expr, 36, $c:block) => {
+        unroll!(@$v, $a, 18, $c);
+        unroll!(@$v, $a + 18, 18, $c);
+    };
+
+    (@$v:ident, $a:expr, 37, $c:block) => {
+        unroll!(@$v, $a, 36, $c);
+        { const $v: usize = $a + 36; $c }
+    };
+
+    (@$v:ident, $a:expr, 38, $c:block) => {
+        unroll!(@$v, $a, 19, $c);
+        unroll!(@$v, $a + 19, 19, $c);
+    };
+
+    (@$v:ident, $a:expr, 39, $c:block) => {
+        unroll!(@$v, $a, 38, $c);
+        { const $v: usize = $a + 38; $c }
+    };
+
+    (@$v:ident, $a:expr, 40, $c:block) => {
+        unroll!(@$v, $a, 20, $c);
+        unroll!(@$v, $a + 20, 20, $c);
+    };
+
+    (@$v:ident, $a:expr, 41, $c:block) => {
+        unroll!(@$v, $a, 40, $c);
+        { const $v: usize = $a + 40; $c }
+    };
+
+    (@$v:ident, $a:expr, 42, $c:block) => {
+        unroll!(@$v, $a, 21, $c);
+        unroll!(@$v, $a + 21, 21, $c);
+    };
+
+    (@$v:ident, $a:expr, 43, $c:block) => {
+        unroll!(@$v, $a, 42, $c);
+        { const $v: usize = $a + 42; $c }
+    };
+
+    (@$v:ident, $a:expr, 44, $c:block) => {
+        unroll!(@$v, $a, 22, $c);
+        unroll!(@$v, $a + 22, 22, $c);
+    };
+
+    (@$v:ident, $a:expr, 45, $c:block) => {
+        unroll!(@$v, $a, 44, $c);
+        { const $v: usize = $a + 44; $c }
+    };
+
+    (@$v:ident, $a:expr, 46, $c:block) => {
+        unroll!(@$v, $a, 23, $c);
+        unroll!(@$v, $a + 23, 23, $c);
+    };
+
+    (@$v:ident, $a:expr, 47, $c:block) => {
+        unroll!(@$v, $a, 46, $c);
+        { const $v: usize = $a + 46; $c }
+    };
+
+    (@$v:ident, $a:expr, 48, $c:block) => {
+        unroll!(@$v, $a, 24, $c);
+        unroll!(@$v, $a + 24, 24, $c);
+    };
+
+    (@$v:ident, $a:expr, 49, $c:block) => {
+        unroll!(@$v, $a, 48, $c);
+        { const $v: usize = $a + 48; $c }
+    };
+
+    (@$v:ident, $a:expr, 50, $c:block) => {
+        unroll!(@$v, $a, 25, $c);
+        unroll!(@$v, $a + 25, 25, $c);
+    };
+
+    (@$v:ident, $a:expr, 51, $c:block) => {
+        unroll!(@$v, $a, 50, $c);
+        { const $v: usize = $a + 50; $c }
+    };
+
+    (@$v:ident, $a:expr, 52, $c:block) => {
+        unroll!(@$v, $a, 26, $c);
+        unroll!(@$v, $a + 26, 26, $c);
+    };
+
+    (@$v:ident, $a:expr, 53, $c:block) => {
+        unroll!(@$v, $a, 52, $c);
+        { const $v: usize = $a + 52; $c }
+    };
+
+    (@$v:ident, $a:expr, 54, $c:block) => {
+        unroll!(@$v, $a, 27, $c);
+        unroll!(@$v, $a + 27, 27, $c);
+    };
+
+    (@$v:ident, $a:expr, 55, $c:block) => {
+        unroll!(@$v, $a, 54, $c);
+        { const $v: usize = $a + 54; $c }
+    };
+
+    (@$v:ident, $a:expr, 56, $c:block) => {
+        unroll!(@$v, $a, 28, $c);
+        unroll!(@$v, $a + 28, 28, $c);
+    };
+
+    (@$v:ident, $a:expr, 57, $c:block) => {
+        unroll!(@$v, $a, 56, $c);
+        { const $v: usize = $a + 56; $c }
+    };
+
+    (@$v:ident, $a:expr, 58, $c:block) => {
+        unroll!(@$v, $a, 29, $c);
+        unroll!(@$v, $a + 29, 29, $c);
+    };
+
+    (@$v:ident, $a:expr, 59, $c:block) => {
+        unroll!(@$v, $a, 58, $c);
+        { const $v: usize = $a + 58; $c }
+    };
+
+    (@$v:ident, $a:expr, 60, $c:block) => {
+        unroll!(@$v, $a, 30, $c);
+        unroll!(@$v, $a + 30, 30, $c);
+    };
+
+    (@$v:ident, $a:expr, 61, $c:block) => {
+        unroll!(@$v, $a, 60, $c);
+        { const $v: usize = $a + 60; $c }
+    };
+
+    (@$v:ident, $a:expr, 62, $c:block) => {
+        unroll!(@$v, $a, 31, $c);
+        unroll!(@$v, $a + 31, 31, $c);
+    };
+
+    (@$v:ident, $a:expr, 63, $c:block) => {
+        unroll!(@$v, $a, 62, $c);
+        { const $v: usize = $a + 62; $c }
+    };
+
+    (@$v:ident, $a:expr, 64, $c:block) => {
+        unroll!(@$v, $a, 32, $c);
+        unroll!(@$v, $a + 32, 32, $c);
+    };
+
+    (@$v:ident, $a:expr, 65, $c:block) => {
+        unroll!(@$v, $a, 64, $c);
+        { const $v: usize = $a + 64; $c }
+    };
+
+    (@$v:ident, $a:expr, 66, $c:block) => {
+        unroll!(@$v, $a, 33, $c);
+        unroll!(@$v, $a + 33, 33, $c);
+    };
+
+    (@$v:ident, $a:expr, 67, $c:block) => {
+        unroll!(@$v, $a, 66, $c);
+        { const $v: usize = $a + 66; $c }
+    };
+
+    (@$v:ident, $a:expr, 68, $c:block) => {
+        unroll!(@$v, $a, 34, $c);
+        unroll!(@$v, $a + 34, 34, $c);
+    };
+
+    (@$v:ident, $a:expr, 69, $c:block) => {
+        unroll!(@$v, $a, 68, $c);
+        { const $v: usize = $a + 68; $c }
+    };
+
+    (@$v:ident, $a:expr, 70, $c:block) => {
+        unroll!(@$v, $a, 35, $c);
+        unroll!(@$v, $a + 35, 35, $c);
+    };
+
+    (@$v:ident, $a:expr, 71, $c:block) => {
+        unroll!(@$v, $a, 70, $c);
+        { const $v: usize = $a + 70; $c }
+    };
+
+    (@$v:ident, $a:expr, 72, $c:block) => {
+        unroll!(@$v, $a, 36, $c);
+        unroll!(@$v, $a + 36, 36, $c);
+    };
+
+    (@$v:ident, $a:expr, 73, $c:block) => {
+        unroll!(@$v, $a, 72, $c);
+        { const $v: usize = $a + 72; $c }
+    };
+
+    (@$v:ident, $a:expr, 74, $c:block) => {
+        unroll!(@$v, $a, 37, $c);
+        unroll!(@$v, $a + 37, 37, $c);
+    };
+
+    (@$v:ident, $a:expr, 75, $c:block) => {
+        unroll!(@$v, $a, 74, $c);
+        { const $v: usize = $a + 74; $c }
+    };
+
+    (@$v:ident, $a:expr, 76, $c:block) => {
+        unroll!(@$v, $a, 38, $c);
+        unroll!(@$v, $a + 38, 38, $c);
+    };
+
+    (@$v:ident, $a:expr, 77, $c:block) => {
+        unroll!(@$v, $a, 76, $c);
+        { const $v: usize = $a + 76; $c }
+    };
+
+    (@$v:ident, $a:expr, 78, $c:block) => {
+        unroll!(@$v, $a, 39, $c);
+        unroll!(@$v, $a + 39, 39, $c);
+    };
+
+    (@$v:ident, $a:expr, 79, $c:block) => {
+        unroll!(@$v, $a, 78, $c);
+        { const $v: usize = $a + 78; $c }
+    };
+
+    (@$v:ident, $a:expr, 80, $c:block) => {
+        unroll!(@$v, $a, 40, $c);
+        unroll!(@$v, $a + 40, 40, $c);
+    };
+
+    (@$v:ident, $a:expr, 81, $c:block) => {
+        unroll!(@$v, $a, 80, $c);
+        { const $v: usize = $a + 80; $c }
+    };
+
+    (@$v:ident, $a:expr, 82, $c:block) => {
+        unroll!(@$v, $a, 41, $c);
+        unroll!(@$v, $a + 41, 41, $c);
+    };
+
+    (@$v:ident, $a:expr, 83, $c:block) => {
+        unroll!(@$v, $a, 82, $c);
+        { const $v: usize = $a + 82; $c }
+    };
+
+    (@$v:ident, $a:expr, 84, $c:block) => {
+        unroll!(@$v, $a, 42, $c);
+        unroll!(@$v, $a + 42, 42, $c);
+    };
+
+    (@$v:ident, $a:expr, 85, $c:block) => {
+        unroll!(@$v, $a, 84, $c);
+        { const $v: usize = $a + 84; $c }
+    };
+
+    (@$v:ident, $a:expr, 86, $c:block) => {
+        unroll!(@$v, $a, 43, $c);
+        unroll!(@$v, $a + 43, 43, $c);
+    };
+
+    (@$v:ident, $a:expr, 87, $c:block) => {
+        unroll!(@$v, $a, 86, $c);
+        { const $v: usize = $a + 86; $c }
+    };
+
+    (@$v:ident, $a:expr, 88, $c:block) => {
+        unroll!(@$v, $a, 44, $c);
+        unroll!(@$v, $a + 44, 44, $c);
+    };
+
+    (@$v:ident, $a:expr, 89, $c:block) => {
+        unroll!(@$v, $a, 88, $c);
+        { const $v: usize = $a + 88; $c }
+    };
+
+    (@$v:ident, $a:expr, 90, $c:block) => {
+        unroll!(@$v, $a, 45, $c);
+        unroll!(@$v, $a + 45, 45, $c);
+    };
+
+    (@$v:ident, $a:expr, 91, $c:block) => {
+        unroll!(@$v, $a, 90, $c);
+        { const $v: usize = $a + 90; $c }
+    };
+
+    (@$v:ident, $a:expr, 92, $c:block) => {
+        unroll!(@$v, $a, 46, $c);
+        unroll!(@$v, $a + 46, 46, $c);
+    };
+
+    (@$v:ident, $a:expr, 93, $c:block) => {
+        unroll!(@$v, $a, 92, $c);
+        { const $v: usize = $a + 92; $c }
+    };
+
+    (@$v:ident, $a:expr, 94, $c:block) => {
+        unroll!(@$v, $a, 47, $c);
+        unroll!(@$v, $a + 47, 47, $c);
+    };
+
+    (@$v:ident, $a:expr, 95, $c:block) => {
+        unroll!(@$v, $a, 94, $c);
+        { const $v: usize = $a + 94; $c }
+    };
+
+    (@$v:ident, $a:expr, 96, $c:block) => {
+        unroll!(@$v, $a, 48, $c);
+        unroll!(@$v, $a + 48, 48, $c);
+    };
+
+    (@$v:ident, $a:expr, 97, $c:block) => {
+        unroll!(@$v, $a, 96, $c);
+        { const $v: usize = $a + 96; $c }
+    };
+
+    (@$v:ident, $a:expr, 98, $c:block) => {
+        unroll!(@$v, $a, 49, $c);
+        unroll!(@$v, $a + 49, 49, $c);
+    };
+
+    (@$v:ident, $a:expr, 99, $c:block) => {
+        unroll!(@$v, $a, 98, $c);
+        { const $v: usize = $a + 98; $c }
+    };
+
+    (@$v:ident, $a:expr, 100, $c:block) => {
+        unroll!(@$v, $a, 50, $c);
+        unroll!(@$v, $a + 50, 50, $c);
+    };
+
+    (@$v:ident, $a:expr, 101, $c:block) => {
+        unroll!(@$v, $a, 100, $c);
+        { const $v: usize = $a + 100; $c }
+    };
+
+    (@$v:ident, $a:expr, 102, $c:block) => {
+        unroll!(@$v, $a, 51, $c);
+        unroll!(@$v, $a + 51, 51, $c);
+    };
+
+    (@$v:ident, $a:expr, 103, $c:block) => {
+        unroll!(@$v, $a, 102, $c);
+        { const $v: usize = $a + 102; $c }
+    };
+
+    (@$v:ident, $a:expr, 104, $c:block) => {
+        unroll!(@$v, $a, 52, $c);
+        unroll!(@$v, $a + 52, 52, $c);
+    };
+
+    (@$v:ident, $a:expr, 105, $c:block) => {
+        unroll!(@$v, $a, 104, $c);
+        { const $v: usize = $a + 104; $c }
+    };
+
+    (@$v:ident, $a:expr, 106, $c:block) => {
+        unroll!(@$v, $a, 53, $c);
+        unroll!(@$v, $a + 53, 53, $c);
+    };
+
+    (@$v:ident, $a:expr, 107, $c:block) => {
+        unroll!(@$v, $a, 106, $c);
+        { const $v: usize = $a + 106; $c }
+    };
+
+    (@$v:ident, $a:expr, 108, $c:block) => {
+        unroll!(@$v, $a, 54, $c);
+        unroll!(@$v, $a + 54, 54, $c);
+    };
+
+    (@$v:ident, $a:expr, 109, $c:block) => {
+        unroll!(@$v, $a, 108, $c);
+        { const $v: usize = $a + 108; $c }
+    };
+
+    (@$v:ident, $a:expr, 110, $c:block) => {
+        unroll!(@$v, $a, 55, $c);
+        unroll!(@$v, $a + 55, 55, $c);
+    };
+
+    (@$v:ident, $a:expr, 111, $c:block) => {
+        unroll!(@$v, $a, 110, $c);
+        { const $v: usize = $a + 110; $c }
+    };
+
+    (@$v:ident, $a:expr, 112, $c:block) => {
+        unroll!(@$v, $a, 56, $c);
+        unroll!(@$v, $a + 56, 56, $c);
+    };
+
+    (@$v:ident, $a:expr, 113, $c:block) => {
+        unroll!(@$v, $a, 112, $c);
+        { const $v: usize = $a + 112; $c }
+    };
+
+    (@$v:ident, $a:expr, 114, $c:block) => {
+        unroll!(@$v, $a, 57, $c);
+        unroll!(@$v, $a + 57, 57, $c);
+    };
+
+    (@$v:ident, $a:expr, 115, $c:block) => {
+        unroll!(@$v, $a, 114, $c);
+        { const $v: usize = $a + 114; $c }
+    };
+
+    (@$v:ident, $a:expr, 116, $c:block) => {
+        unroll!(@$v, $a, 58, $c);
+        unroll!(@$v, $a + 58, 58, $c);
+    };
+
+    (@$v:ident, $a:expr, 117, $c:block) => {
+        unroll!(@$v, $a, 116, $c);
+        { const $v: usize = $a + 116; $c }
+    };
+
+    (@$v:ident, $a:expr, 118, $c:block) => {
+        unroll!(@$v, $a, 59, $c);
+        unroll!(@$v, $a + 59, 59, $c);
+    };
+
+    (@$v:ident, $a:expr, 119, $c:block) => {
+        unroll!(@$v, $a, 118, $c);
+        { const $v: usize = $a + 118; $c }
+    };
+
+    (@$v:ident, $a:expr, 120, $c:block) => {
+        unroll!(@$v, $a, 60, $c);
+        unroll!(@$v, $a + 60, 60, $c);
+    };
+
+    (@$v:ident, $a:expr, 121, $c:block) => {
+        unroll!(@$v, $a, 120, $c);
+        { const $v: usize = $a + 120; $c }
+    };
+
+    (@$v:ident, $a:expr, 122, $c:block) => {
+        unroll!(@$v, $a, 61, $c);
+        unroll!(@$v, $a + 61, 61, $c);
+    };
+
+    (@$v:ident, $a:expr, 123, $c:block) => {
+        unroll!(@$v, $a, 122, $c);
+        { const $v: usize = $a + 122; $c }
+    };
+
+    (@$v:ident, $a:expr, 124, $c:block) => {
+        unroll!(@$v, $a, 62, $c);
+        unroll!(@$v, $a + 62, 62, $c);
+    };
+
+    (@$v:ident, $a:expr, 125, $c:block) => {
+        unroll!(@$v, $a, 124, $c);
+        { const $v: usize = $a + 124; $c }
+    };
+
+    (@$v:ident, $a:expr, 126, $c:block) => {
+        unroll!(@$v, $a, 63, $c);
+        unroll!(@$v, $a + 63, 63, $c);
+    };
+
+    (@$v:ident, $a:expr, 127, $c:block) => {
+        unroll!(@$v, $a, 126, $c);
+        { const $v: usize = $a + 126; $c }
+    };
+
+    (@$v:ident, $a:expr, 128, $c:block) => {
+        unroll!(@$v, $a, 64, $c);
+        unroll!(@$v, $a + 64, 64, $c);
+    };
+
+}
+
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_all() {
+        {
+            let a: Vec<usize> = vec![];
+            unroll! {
+                for i in 0..0 {
+                    a.push(i);
+                }
+            }
+            assert_eq!(a, (0..0).collect::<Vec<usize>>());
+        }
+        {
+            let mut a: Vec<usize> = vec![];
+            unroll! {
+                for i in 0..1 {
+                    a.push(i);
+                }
+            }
+            assert_eq!(a, (0..1).collect::<Vec<usize>>());
+        }
+        {
+            let mut a: Vec<usize> = vec![];
+            unroll! {
+                for i in 0..128 {
+                    a.push(i);
+                }
+            }
+            assert_eq!(a, (0..128).collect::<Vec<usize>>());
+        }
+    }
+}
+

+

\ No newline at end of file
diff --git a/master/src/serde/de/from_primitive.rs.html b/master/src/serde/de/from_primitive.rs.html
index deee51afc..84630d3ee 100644
--- a/master/src/serde/de/from_primitive.rs.html
+++ b/master/src/serde/de/from_primitive.rs.html
@@ -1,4 +1,4 @@
-from_primitive.rs.html -- source
  1
+from_primitive.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde/de/ignored_any.rs.html b/master/src/serde/de/ignored_any.rs.html
index e0e34c610..131712e93 100644
--- a/master/src/serde/de/ignored_any.rs.html
+++ b/master/src/serde/de/ignored_any.rs.html
@@ -1,4 +1,4 @@
-ignored_any.rs.html -- source
  1
+ignored_any.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde/de/impls.rs.html b/master/src/serde/de/impls.rs.html
index 3c1bef914..52a721307 100644
--- a/master/src/serde/de/impls.rs.html
+++ b/master/src/serde/de/impls.rs.html
@@ -1,4 +1,4 @@
-impls.rs.html -- source
   1
+impls.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde/de/mod.rs.html b/master/src/serde/de/mod.rs.html
index 07664b9b5..792cfdcb2 100644
--- a/master/src/serde/de/mod.rs.html
+++ b/master/src/serde/de/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs.html -- source
   1
+mod.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde/de/utf8.rs.html b/master/src/serde/de/utf8.rs.html
index 1135ba87f..ad2c73d48 100644
--- a/master/src/serde/de/utf8.rs.html
+++ b/master/src/serde/de/utf8.rs.html
@@ -1,4 +1,4 @@
-utf8.rs.html -- source
 1
+utf8.rs.html -- source
 1
  2
  3
  4
diff --git a/master/src/serde/de/value.rs.html b/master/src/serde/de/value.rs.html
index d464b38d0..eb983b3af 100644
--- a/master/src/serde/de/value.rs.html
+++ b/master/src/serde/de/value.rs.html
@@ -1,4 +1,4 @@
-value.rs.html -- source
   1
+value.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde/export.rs.html b/master/src/serde/export.rs.html
index 979163dfb..31a6c32ab 100644
--- a/master/src/serde/export.rs.html
+++ b/master/src/serde/export.rs.html
@@ -1,4 +1,4 @@
-export.rs.html -- source
 1
+export.rs.html -- source
 1
  2
  3
  4
diff --git a/master/src/serde/lib.rs.html b/master/src/serde/lib.rs.html
index 38dd535d0..e5ec65828 100644
--- a/master/src/serde/lib.rs.html
+++ b/master/src/serde/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs.html -- source
  1
+lib.rs.html -- source
  1
   2
   3
   4
@@ -370,7 +370,7 @@
 ////////////////////////////////////////////////////////////////////////////////
 
 // Serde types in rustdoc of other crates get linked to here.
-#![doc(html_root_url = "https://docs.rs/serde/1.0.55")]
+#![doc(html_root_url = "https://docs.rs/serde/1.0.56")]
 // Support using Serde without the standard library!
 #![cfg_attr(not(feature = "std"), no_std)]
 // Unstable functionality only if the user asks for it. For tracking and
diff --git a/master/src/serde/macros.rs.html b/master/src/serde/macros.rs.html
index 589a83e95..eba0bc300 100644
--- a/master/src/serde/macros.rs.html
+++ b/master/src/serde/macros.rs.html
@@ -1,4 +1,4 @@
-macros.rs.html -- source
  1
+macros.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde/private/de.rs.html b/master/src/serde/private/de.rs.html
index e75f89795..e45bf9464 100644
--- a/master/src/serde/private/de.rs.html
+++ b/master/src/serde/private/de.rs.html
@@ -1,4 +1,4 @@
-de.rs.html -- source
   1
+de.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde/private/macros.rs.html b/master/src/serde/private/macros.rs.html
index 33527bc87..90b942804 100644
--- a/master/src/serde/private/macros.rs.html
+++ b/master/src/serde/private/macros.rs.html
@@ -1,4 +1,4 @@
-macros.rs.html -- source
  1
+macros.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde/private/mod.rs.html b/master/src/serde/private/mod.rs.html
index 629fa8a05..d4c59ceec 100644
--- a/master/src/serde/private/mod.rs.html
+++ b/master/src/serde/private/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs.html -- source
 1
+mod.rs.html -- source
 1
  2
  3
  4
diff --git a/master/src/serde/private/ser.rs.html b/master/src/serde/private/ser.rs.html
index abced9b8e..17fef4bd0 100644
--- a/master/src/serde/private/ser.rs.html
+++ b/master/src/serde/private/ser.rs.html
@@ -1,4 +1,4 @@
-ser.rs.html -- source
   1
+ser.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde/ser/impls.rs.html b/master/src/serde/ser/impls.rs.html
index 50c167da9..b6ff46c91 100644
--- a/master/src/serde/ser/impls.rs.html
+++ b/master/src/serde/ser/impls.rs.html
@@ -1,4 +1,4 @@
-impls.rs.html -- source
  1
+impls.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde/ser/impossible.rs.html b/master/src/serde/ser/impossible.rs.html
index b0eae52a7..b5a518ec7 100644
--- a/master/src/serde/ser/impossible.rs.html
+++ b/master/src/serde/ser/impossible.rs.html
@@ -1,4 +1,4 @@
-impossible.rs.html -- source
  1
+impossible.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde/ser/mod.rs.html b/master/src/serde/ser/mod.rs.html
index b06819e98..07bb2a62f 100644
--- a/master/src/serde/ser/mod.rs.html
+++ b/master/src/serde/ser/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs.html -- source
   1
+mod.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde_derive/bound.rs.html b/master/src/serde_derive/bound.rs.html
index db5baf182..626e124a3 100644
--- a/master/src/serde_derive/bound.rs.html
+++ b/master/src/serde_derive/bound.rs.html
@@ -1,4 +1,4 @@
-bound.rs.html -- source
  1
+bound.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde_derive/de.rs.html b/master/src/serde_derive/de.rs.html
index 29b257b25..e585519bb 100644
--- a/master/src/serde_derive/de.rs.html
+++ b/master/src/serde_derive/de.rs.html
@@ -1,4 +1,4 @@
-de.rs.html -- source
   1
+de.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde_derive/fragment.rs.html b/master/src/serde_derive/fragment.rs.html
index 9a51fd642..f1e7f95c5 100644
--- a/master/src/serde_derive/fragment.rs.html
+++ b/master/src/serde_derive/fragment.rs.html
@@ -1,4 +1,4 @@
-fragment.rs.html -- source
 1
+fragment.rs.html -- source
 1
  2
  3
  4
diff --git a/master/src/serde_derive/internals/ast.rs.html b/master/src/serde_derive/internals/ast.rs.html
index 2c8795406..2a3b4d437 100644
--- a/master/src/serde_derive/internals/ast.rs.html
+++ b/master/src/serde_derive/internals/ast.rs.html
@@ -1,4 +1,4 @@
-ast.rs.html -- source
  1
+ast.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde_derive/internals/attr.rs.html b/master/src/serde_derive/internals/attr.rs.html
index c960fe723..1b8f255df 100644
--- a/master/src/serde_derive/internals/attr.rs.html
+++ b/master/src/serde_derive/internals/attr.rs.html
@@ -1,4 +1,4 @@
-attr.rs.html -- source
   1
+attr.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde_derive/internals/case.rs.html b/master/src/serde_derive/internals/case.rs.html
index 1138e77e3..4dc9aff97 100644
--- a/master/src/serde_derive/internals/case.rs.html
+++ b/master/src/serde_derive/internals/case.rs.html
@@ -1,4 +1,4 @@
-case.rs.html -- source
  1
+case.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde_derive/internals/check.rs.html b/master/src/serde_derive/internals/check.rs.html
index 9324097bd..4bef846f7 100644
--- a/master/src/serde_derive/internals/check.rs.html
+++ b/master/src/serde_derive/internals/check.rs.html
@@ -1,4 +1,4 @@
-check.rs.html -- source
  1
+check.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde_derive/internals/ctxt.rs.html b/master/src/serde_derive/internals/ctxt.rs.html
index e15269fb1..8bb75f6e9 100644
--- a/master/src/serde_derive/internals/ctxt.rs.html
+++ b/master/src/serde_derive/internals/ctxt.rs.html
@@ -1,4 +1,4 @@
-ctxt.rs.html -- source
 1
+ctxt.rs.html -- source
 1
  2
  3
  4
diff --git a/master/src/serde_derive/internals/mod.rs.html b/master/src/serde_derive/internals/mod.rs.html
index b3f46b528..69b285b2d 100644
--- a/master/src/serde_derive/internals/mod.rs.html
+++ b/master/src/serde_derive/internals/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs.html -- source
 1
+mod.rs.html -- source
 1
  2
  3
  4
diff --git a/master/src/serde_derive/lib.rs.html b/master/src/serde_derive/lib.rs.html
index 581b2fc29..1bda42269 100644
--- a/master/src/serde_derive/lib.rs.html
+++ b/master/src/serde_derive/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs.html -- source
 1
+lib.rs.html -- source
 1
  2
  3
  4
@@ -108,7 +108,7 @@
 //!
 //! [https://serde.rs/derive.html]: https://serde.rs/derive.html
 
-#![doc(html_root_url = "https://docs.rs/serde_derive/1.0.55")]
+#![doc(html_root_url = "https://docs.rs/serde_derive/1.0.56")]
 #![cfg_attr(feature = "cargo-clippy", deny(clippy, clippy_pedantic))]
 // Whitelisted clippy lints
 #![cfg_attr(
diff --git a/master/src/serde_derive/pretend.rs.html b/master/src/serde_derive/pretend.rs.html
index d0bae20e6..e3bb3d1c4 100644
--- a/master/src/serde_derive/pretend.rs.html
+++ b/master/src/serde_derive/pretend.rs.html
@@ -1,4 +1,4 @@
-pretend.rs.html -- source
  1
+pretend.rs.html -- source
  1
   2
   3
   4
diff --git a/master/src/serde_derive/ser.rs.html b/master/src/serde_derive/ser.rs.html
index 4d4224b0c..dd93eb7ed 100644
--- a/master/src/serde_derive/ser.rs.html
+++ b/master/src/serde_derive/ser.rs.html
@@ -1,4 +1,4 @@
-ser.rs.html -- source
   1
+ser.rs.html -- source
   1
    2
    3
    4
diff --git a/master/src/serde_derive/try.rs.html b/master/src/serde_derive/try.rs.html
index 29a3a8f4b..9c2cf5896 100644
--- a/master/src/serde_derive/try.rs.html
+++ b/master/src/serde_derive/try.rs.html
@@ -1,4 +1,4 @@
-try.rs.html -- source
 1
+try.rs.html -- source
 1
  2
  3
  4
diff --git a/master/src/tantivy/query/range_query.rs.html b/master/src/tantivy/query/range_query.rs.html
index 2b97a9038..2ea8c4ccf 100644
--- a/master/src/tantivy/query/range_query.rs.html
+++ b/master/src/tantivy/query/range_query.rs.html
@@ -362,6 +362,21 @@
 362
 363
 364
+365
+366
+367
+368
+369
+370
+371
+372
+373
+374
+375
+376
+377
+378
+379
 
 use common::BitSet;
 use core::Searcher;
@@ -377,14 +392,14 @@
 use termdict::{TermDictionary, TermStreamer};
 use Result;
 
-fn map_bound<TFrom, Transform: Fn(TFrom) -> Vec<u8>>(
-    bound: Bound<TFrom>,
+fn map_bound<TFrom, TTo, Transform: Fn(&TFrom) -> TTo>(
+    bound: &Bound<TFrom>,
     transform: &Transform,
-) -> Bound<Vec<u8>> {
+) -> Bound<TTo> {
     use self::Bound::*;
     match bound {
-        Excluded(from_val) => Excluded(transform(from_val)),
-        Included(from_val) => Included(transform(from_val)),
+        Excluded(ref from_val) => Excluded(transform(from_val)),
+        Included(ref from_val) => Included(transform(from_val)),
         Unbounded => Unbounded,
     }
 }
@@ -478,12 +493,12 @@
         left_bound: Bound<i64>,
         right_bound: Bound<i64>,
     ) -> RangeQuery {
-        let make_term_val = |val: i64| Term::from_field_i64(field, val).value_bytes().to_owned();
+        let make_term_val = |val: &i64| Term::from_field_i64(field, *val).value_bytes().to_owned();
         RangeQuery {
             field,
             value_type: Type::I64,
-            left_bound: map_bound(left_bound, &make_term_val),
-            right_bound: map_bound(right_bound, &make_term_val),
+            left_bound: map_bound(&left_bound, &make_term_val),
+            right_bound: map_bound(&right_bound, &make_term_val),
         }
     }
 
@@ -499,12 +514,12 @@
         left_bound: Bound<u64>,
         right_bound: Bound<u64>,
     ) -> RangeQuery {
-        let make_term_val = |val: u64| Term::from_field_u64(field, val).value_bytes().to_owned();
+        let make_term_val = |val: &u64| Term::from_field_u64(field, *val).value_bytes().to_owned();
         RangeQuery {
             field,
             value_type: Type::U64,
-            left_bound: map_bound(left_bound, &make_term_val),
-            right_bound: map_bound(right_bound, &make_term_val),
+            left_bound: map_bound(&left_bound, &make_term_val),
+            right_bound: map_bound(&right_bound, &make_term_val),
         }
     }
 
@@ -532,12 +547,12 @@
         left: Bound<&'b str>,
         right: Bound<&'b str>,
     ) -> RangeQuery {
-        let make_term_val = |val: &str| val.as_bytes().to_vec();
+        let make_term_val = |val: &&str| val.as_bytes().to_vec();
         RangeQuery {
             field,
             value_type: Type::Str,
-            left_bound: map_bound(left, &make_term_val),
-            right_bound: map_bound(right, &make_term_val),
+            left_bound: map_bound(&left, &make_term_val),
+            right_bound: map_bound(&right, &make_term_val),
         }
     }
 
@@ -552,6 +567,21 @@
             Bound::Excluded(range.end),
         )
     }
+
+    /// Field to search over
+    pub fn field(&self) -> Field {
+        self.field
+    }
+
+    /// Lower bound of range
+    pub fn left_bound(&self) -> Bound<Term> {
+        map_bound(&self.left_bound, &|bytes| Term::from_field_bytes(self.field, bytes))
+    }
+
+    /// Upper bound of range
+    pub fn right_bound(&self) -> Bound<Term> {
+        map_bound(&self.right_bound, &|bytes| Term::from_field_bytes(self.field, bytes))
+    }
 }
 
 impl Query for RangeQuery {
diff --git a/master/src/tantivy/schema/term.rs.html b/master/src/tantivy/schema/term.rs.html
index 6c91a1aa6..4345ade14 100644
--- a/master/src/tantivy/schema/term.rs.html
+++ b/master/src/tantivy/schema/term.rs.html
@@ -221,6 +221,12 @@
 221
 222
 223
+224
+225
+226
+227
+228
+229
 
 use std::fmt;
 
@@ -333,6 +339,12 @@
         self.0.extend(bytes);
     }
 
+    pub(crate) fn from_field_bytes(field: Field, bytes: &[u8]) -> Term {
+        let mut term = Term::for_field(field);
+        term.set_bytes(bytes);
+        term
+    }
+
     /// Set the texts only, keeping the field untouched.
     pub fn set_text(&mut self, text: &str) {
         self.set_bytes(text.as_bytes());
diff --git a/master/tantivy/directory/enum.ReadOnlySource.html b/master/tantivy/directory/enum.ReadOnlySource.html
index 64b934eb4..4397c8a56 100644
--- a/master/tantivy/directory/enum.ReadOnlySource.html
+++ b/master/tantivy/directory/enum.ReadOnlySource.html
@@ -36,17 +36,17 @@ boundary.

                     

                       Methods from Deref<Target = [u8]>
                     

-                
Returns the number of elements in the slice.

+                
Returns the number of elements in the slice.

 
Examples

 
 let a = [1, 2, 3];
 assert_eq!(a.len(), 3);

-
Returns true if the slice has a length of 0.

+
Returns true if the slice has a length of 0.

 
Examples

 
 let a = [1, 2, 3];
 assert!(!a.is_empty());

-
Returns the first element of the slice, or None if it is empty.

+
Returns the first element of the slice, or None if it is empty.

 
Examples

 
 let v = [10, 40, 30];
@@ -54,7 +54,7 @@ boundary.

 
 let w: &[i32] = &[];
 assert_eq!(None, w.first());

-
Returns the first and all the rest of the elements of the slice, or None if it is empty.

+
Returns the first and all the rest of the elements of the slice, or None if it is empty.

 
Examples

 
 let x = &[0, 1, 2];
@@ -63,7 +63,7 @@ boundary.

     assert_eq!(first, &0);
     assert_eq!(elements, &[1, 2]);
 }

-
Returns the last and all the rest of the elements of the slice, or None if it is empty.

+
Returns the last and all the rest of the elements of the slice, or None if it is empty.

 
Examples

 
 let x = &[0, 1, 2];
@@ -72,7 +72,7 @@ boundary.

     assert_eq!(last, &2);
     assert_eq!(elements, &[0, 1]);
 }

-
Returns the last element of the slice, or None if it is empty.

+
Returns the last element of the slice, or None if it is empty.

 
Examples

 
 let v = [10, 40, 30];
@@ -80,7 +80,7 @@ boundary.

 
 let w: &[i32] = &[];
 assert_eq!(None, w.last());

-
Returns a reference to an element or subslice depending on the type of
+
Returns a reference to an element or subslice depending on the type of
 index.

 
    
 
  • If given a position, returns a reference to the element at that
@@ -95,7 +95,7 @@ or None if out of bounds.
    • 
 assert_eq!(Some(&[10, 40][..]), v.get(0..2));
 assert_eq!(None, v.get(3));
 assert_eq!(None, v.get(0..4));

-
Returns a reference to an element or subslice, without doing bounds
+
Returns a reference to an element or subslice, without doing bounds
 checking.

 
This is generally not recommended, use with caution! For a safe
 alternative see get.

@@ -106,7 +106,7 @@ alternative see get.

 unsafe {
     assert_eq!(x.get_unchecked(1), &2);
 }

-
Returns a raw pointer to the slice's buffer.

+
Returns a raw pointer to the slice's buffer.

 
The caller must ensure that the slice outlives the pointer this
 function returns, or else it will end up pointing to garbage.

 
Modifying the container referenced by this slice may cause its buffer
@@ -121,7 +121,7 @@ to be reallocated, which would also make any pointers to it invalid.

         assert_eq!(x.get_unchecked(i), &*x_ptr.offset(i as isize));
     }
 }

-
ⓘImportant traits for Iter<'a, T>
Returns an iterator over the slice.

+
ⓘImportant traits for Iter<'a, T>
Returns an iterator over the slice.

 
Examples

 
 let x = &[1, 2, 4];
@@ -131,7 +131,7 @@ to be reallocated, which would also make any pointers to it invalid.

 assert_eq!(iterator.next(), Some(&2));
 assert_eq!(iterator.next(), Some(&4));
 assert_eq!(iterator.next(), None);

-
ⓘImportant traits for Windows<'a, T>
Returns an iterator over all contiguous windows of length
+
ⓘImportant traits for Windows<'a, T>
Returns an iterator over all contiguous windows of length
 size. The windows overlap. If the slice is shorter than
 size, the iterator returns no values.

 
Panics

@@ -150,7 +150,7 @@ to be reallocated, which would also make any pointers to it invalid.

 let slice = ['f', 'o', 'o'];
 let mut iter = slice.windows(4);
 assert!(iter.next().is_none());

-
ⓘImportant traits for Chunks<'a, T>
Returns an iterator over chunk_size elements of the slice at a
+
ⓘImportant traits for Chunks<'a, T>
Returns an iterator over chunk_size elements of the slice at a
 time. The chunks are slices and do not overlap. If chunk_size does
 not divide the length of the slice, then the last chunk will
 not have length chunk_size.

@@ -166,7 +166,7 @@ of always exactly chunk_size elements.

 assert_eq!(iter.next().unwrap(), &['r', 'e']);
 assert_eq!(iter.next().unwrap(), &['m']);
 assert!(iter.next().is_none());

-
ⓘImportant traits for ExactChunks<'a, T>
🔬 This is a nightly-only experimental API.  (exact_chunks)
Returns an iterator over chunk_size elements of the slice at a
+
ⓘImportant traits for ExactChunks<'a, T>
🔬 This is a nightly-only experimental API.  (exact_chunks)
Returns an iterator over chunk_size elements of the slice at a
 time. The chunks are slices and do not overlap. If chunk_size does
 not divide the length of the slice, then the last up to chunk_size-1
 elements will be omitted.

@@ -184,7 +184,7 @@ can often optimize the resulting code better than in the case of
 assert_eq!(iter.next().unwrap(), &['l', 'o']);
 assert_eq!(iter.next().unwrap(), &['r', 'e']);
 assert!(iter.next().is_none());

-
Divides one slice into two at an index.

+
Divides one slice into two at an index.

 
The first will contain all indices from [0, mid) (excluding
 the index mid itself) and the second will contain all
 indices from [mid, len) (excluding the index len itself).

@@ -211,7 +211,7 @@ indices from [mid, len) (excluding the index len itsel
     assert!(left == [1, 2, 3, 4, 5, 6]);
     assert!(right == []);
 }

-
ⓘImportant traits for Split<'a, T, P>
Returns an iterator over subslices separated by elements that match
+
ⓘImportant traits for Split<'a, T, P>
Returns an iterator over subslices separated by elements that match
 pred. The matched element is not contained in the subslices.

 
Examples

 
@@ -244,7 +244,7 @@ present between them:

 assert_eq!(iter.next().unwrap(), &[]);
 assert_eq!(iter.next().unwrap(), &[20]);
 assert!(iter.next().is_none());

-
ⓘImportant traits for RSplit<'a, T, P>
Returns an iterator over subslices separated by elements that match
+
ⓘImportant traits for RSplit<'a, T, P>
Returns an iterator over subslices separated by elements that match
 pred, starting at the end of the slice and working backwards.
 The matched element is not contained in the subslices.

 
Examples

@@ -266,7 +266,7 @@ slice will be the first (or last) item returned by the iterator.

 assert_eq!(it.next().unwrap(), &[1, 1]);
 assert_eq!(it.next().unwrap(), &[]);
 assert_eq!(it.next(), None);

-
ⓘImportant traits for SplitN<'a, T, P>
Returns an iterator over subslices separated by elements that match
+
ⓘImportant traits for SplitN<'a, T, P>
Returns an iterator over subslices separated by elements that match
 pred, limited to returning at most n items. The matched element is
 not contained in the subslices.

 
The last element returned, if any, will contain the remainder of the
@@ -281,7 +281,7 @@ slice.

 for group in v.splitn(2, |num| *num % 3 == 0) {
     println!("{:?}", group);
 }

-
ⓘImportant traits for RSplitN<'a, T, P>
Returns an iterator over subslices separated by elements that match
+
ⓘImportant traits for RSplitN<'a, T, P>
Returns an iterator over subslices separated by elements that match
 pred limited to returning at most n items. This starts at the end of
 the slice and works backwards.  The matched element is not contained in
 the subslices.

@@ -297,13 +297,13 @@ by 3 (i.e. [50], [10, 40, 30, 20]):

 for group in v.rsplitn(2, |num| *num % 3 == 0) {
     println!("{:?}", group);
 }

-
Returns true if the slice contains an element with the given value.

+
Returns true if the slice contains an element with the given value.

 
Examples

 
 let v = [10, 40, 30];
 assert!(v.contains(&30));
 assert!(!v.contains(&50));

-
Returns true if needle is a prefix of the slice.

+
Returns true if needle is a prefix of the slice.

 
Examples

 
 let v = [10, 40, 30];
@@ -318,7 +318,7 @@ by 3 (i.e. [50], [10, 40, 30, 20]):

 assert!(v.starts_with(&[]));
 let v: &[u8] = &[];
 assert!(v.starts_with(&[]));

-
Returns true if needle is a suffix of the slice.

+
Returns true if needle is a suffix of the slice.

 
Examples

 
 let v = [10, 40, 30];
@@ -333,7 +333,7 @@ by 3 (i.e. [50], [10, 40, 30, 20]):

 assert!(v.ends_with(&[]));
 let v: &[u8] = &[];
 assert!(v.ends_with(&[]));

-
Binary searches this sorted slice for a given element.

+
Binary searches this sorted slice for a given element.

 
If the value is found then Ok is returned, containing the
 index of the matching element; if the value is not found then
 Err is returned, containing the index where a matching
@@ -351,7 +351,7 @@ found; the fourth could match any position in [1, 4].

 assert_eq!(s.binary_search(&100), Err(13));
 let r = s.binary_search(&1);
 assert!(match r { Ok(1...4) => true, _ => false, });

-
Binary searches this sorted slice with a comparator function.

+
Binary searches this sorted slice with a comparator function.

 
The comparator function should implement an order consistent
 with the sort order of the underlying slice, returning an
 order code that indicates whether its argument is Less,
@@ -377,7 +377,7 @@ found; the fourth could match any position in [1, 4].

 let seek = 1;
 let r = s.binary_search_by(|probe| probe.cmp(&seek));
 assert!(match r { Ok(1...4) => true, _ => false, });

-
Binary searches this sorted slice with a key extraction function.

+
Binary searches this sorted slice with a key extraction function.

 
Assumes that the slice is sorted by the key, for instance with
 sort_by_key using the same key extraction function.

 
If a matching value is found then returns Ok, containing the
@@ -400,17 +400,17 @@ fourth could match any position in [1, 4].

 assert_eq!(s.binary_search_by_key(&100, |&(a,b)| b), Err(13));
 let r = s.binary_search_by_key(&1, |&(a,b)| b);
 assert!(match r { Ok(1...4) => true, _ => false, });

-
Checks if all bytes in this slice are within the ASCII range.

-
Checks that two slices are an ASCII case-insensitive match.

+
Checks if all bytes in this slice are within the ASCII range.

+
Checks that two slices are an ASCII case-insensitive match.

 
Same as to_ascii_lowercase(a) == to_ascii_lowercase(b),
 but without allocating and copying temporaries.

-
ⓘImportant traits for Vec<u8>
Copies self into a new Vec.

+
ⓘImportant traits for Vec<u8>
Copies self into a new Vec.

 
Examples

 
 let s = [10, 40, 30];
 let x = s.to_vec();
 // Here, `s` and `x` can be modified independently.

-
ⓘImportant traits for Vec<u8>
🔬 This is a nightly-only experimental API.  (repeat_generic_slice)
it's on str, why not on slice?

+
ⓘImportant traits for Vec<u8>
🔬 This is a nightly-only experimental API.  (repeat_generic_slice)
it's on str, why not on slice?

 
Creates a vector by repeating a slice n times.

 
Examples

 
Basic usage:

@@ -421,12 +421,12 @@ but without allocating and copying temporaries.

 fn main() {
     assert_eq!([1, 2].repeat(3), vec![1, 2, 1, 2, 1, 2]);
 }

-
ⓘImportant traits for Vec<u8>
Returns a vector containing a copy of this slice where each byte
+
ⓘImportant traits for Vec<u8>
Returns a vector containing a copy of this slice where each byte
 is mapped to its ASCII upper case equivalent.

 
ASCII letters 'a' to 'z' are mapped to 'A' to 'Z',
 but non-ASCII letters are unchanged.

 
To uppercase the value in-place, use make_ascii_uppercase.

-
ⓘImportant traits for Vec<u8>
Returns a vector containing a copy of this slice where each byte
+
ⓘImportant traits for Vec<u8>
Returns a vector containing a copy of this slice where each byte
 is mapped to its ASCII lower case equivalent.

 
ASCII letters 'A' to 'Z' are mapped to 'a' to 'z',
 but non-ASCII letters are unchanged.

diff --git a/master/tantivy/query/struct.RangeQuery.html b/master/tantivy/query/struct.RangeQuery.html
index 1f9cc4b8c..d1db4b523 100644
--- a/master/tantivy/query/struct.RangeQuery.html
+++ b/master/tantivy/query/struct.RangeQuery.html
@@ -1,4 +1,4 @@
-tantivy::query::RangeQuery - Rust
Struct tantivy::query::RangeQuery[−][src]
pub struct RangeQuery { /* fields omitted */ }
RangeQuery match all documents that have at least one term within a defined range.

+tantivy::query::RangeQuery - Rust
Struct tantivy::query::RangeQuery[−][src]
pub struct RangeQuery { /* fields omitted */ }
RangeQuery match all documents that have at least one term within a defined range.

 
Matched document will all get a constant Score of one.

 
Implementation

 
The current implement will iterate over the terms within the range
@@ -19,7 +19,7 @@ and append all of the document cross into a BitSet.

                     

                       Methods
                     

-                
impl RangeQuery
[src]
Creates a new RangeQuery over a i64 field.

+                
impl RangeQuery
[src]
Creates a new RangeQuery over a i64 field.

 
If the field is not of the type i64, tantivy
 will panic when the Weight object is created.

 
Create a new RangeQuery over a i64 field.

@@ -43,6 +43,9 @@ will panic when the Weight object is created.

 
Create a new RangeQuery over a Str field.

 
If the field is not of the type Str, tantivy
 will panic when the Weight object is created.

+
Field to search over

+
Lower bound of range

+
Upper bound of range

 

                 

                   Trait Implementations
@@ -50,7 +53,7 @@ will panic when the Weight object is created.

                 
impl Clone for RangeQuery
[src]
Returns a copy of the value. Read more

 
Performs copy-assignment from source. Read more

 
impl Debug for RangeQuery
[src]
Formats the value using the given formatter. Read more

-
impl Query for RangeQuery
[src]
Create the weight associated to a query. Read more

+
impl Query for RangeQuery
[src]
Create the weight associated to a query. Read more

 
Returns the number of documents matching the query.

 
Search works as follows : Read more

 

diff --git a/master/tantivy/query/trait.Query.html b/master/tantivy/query/trait.Query.html
index 8d39d75c1..84eadf98b 100644
--- a/master/tantivy/query/trait.Query.html
+++ b/master/tantivy/query/trait.Query.html
@@ -71,7 +71,7 @@ can increase performances.

     
  • impl Query for AllQuery
    [src]
    • 
 
  • impl Query for BooleanQuery
    [src]
    • 
 
  • impl Query for PhraseQuery
    [src]
    • 
-
  • impl Query for RangeQuery
    [src]
    • 
+
  • impl Query for RangeQuery
    [src]
    • 
 
  • impl Query for TermQuery
    [src]
    •