pub enum Input {
Internal(FunctionInput),
External(External),
-}Variants§
Internal(FunctionInput)
External(External)
Implementations§
Trait Implementations§
source§impl<'de> Deserialize<'de> for Input
impl<'de> Deserialize<'de> for Input
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq<Input> for Input
impl PartialEq<Input> for Input
source§fn eq(&self, other: &Input) -> bool
fn eq(&self, other: &Input) -> bool
This method tests for § §
source§ source§ source§ § § § § § §§
source§ source§ source§ § § § § §
self and other values to be equal, and is used
+}Variants§
Internal(FunctionInput)
External(External)
Implementations§
Trait Implementations§
source§impl<'de> Deserialize<'de> for Input
impl<'de> Deserialize<'de> for Input
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq<Input> for Input
impl PartialEq<Input> for Input
impl Eq for Input
impl StructuralEq for Input
impl StructuralPartialEq for Input
Auto Trait Implementations§
impl RefUnwindSafe for Input
impl Send for Input
impl Sync for Input
impl Unpin for Input
impl UnwindSafe for Input
Blanket Implementations§
§
key_type: TypeThe type of the key.
value_type: TypeThe type of the value.
span: SpanThe entire span of the mapping declaration.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Mapping
impl<'de> Deserialize<'de> for Mapping
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq<Mapping> for Mapping
impl PartialEq<Mapping> for Mapping
source§fn eq(&self, other: &Mapping) -> bool
fn eq(&self, other: &Mapping) -> bool
This method tests for
self and other values to be equal, and is used
+Trait Implementations§
source§impl<'de> Deserialize<'de> for Mapping
impl<'de> Deserialize<'de> for Mapping
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq<Mapping> for Mapping
impl PartialEq<Mapping> for Mapping
impl Eq for Mapping
impl StructuralEq for Mapping
impl StructuralPartialEq for Mapping
Auto Trait Implementations§
impl RefUnwindSafe for Mapping
impl Send for Mapping
impl Sync for Mapping
impl Unpin for Mapping
impl UnwindSafe for Mapping
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/assert/struct.AssertStatement.html b/leo_ast/statement/assert/struct.AssertStatement.html
index c3b1407262..8e6f385649 100644
--- a/leo_ast/statement/assert/struct.AssertStatement.html
+++ b/leo_ast/statement/assert/struct.AssertStatement.html
@@ -4,8 +4,8 @@
}Expand description
An assert statement, assert(<expr>), assert_eq(<expr>) or assert_neq(<expr>).
Fields§
§variant: AssertVariantThe variant of the assert statement.
§span: SpanThe span, excluding the semicolon.
-Trait Implementations§
source§impl Clone for AssertStatement
source§fn clone(&self) -> AssertStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for AssertStatement
source§impl<'de> Deserialize<'de> for AssertStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for AssertStatement
source§impl Node for AssertStatement
source§impl PartialEq<AssertStatement> for AssertStatement
source§fn eq(&self, other: &AssertStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for AssertStatement
source§fn clone(&self) -> AssertStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for AssertStatement
source§impl<'de> Deserialize<'de> for AssertStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for AssertStatement
source§impl Node for AssertStatement
source§impl PartialEq<AssertStatement> for AssertStatement
source§fn eq(&self, other: &AssertStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for AssertStatement
source§impl Eq for AssertStatement
source§impl StructuralEq for AssertStatement
source§impl StructuralPartialEq for AssertStatement
Auto Trait Implementations§
§impl RefUnwindSafe for AssertStatement
§impl Send for AssertStatement
§impl Sync for AssertStatement
§impl Unpin for AssertStatement
§impl UnwindSafe for AssertStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/block/struct.Block.html b/leo_ast/statement/block/struct.Block.html
index 2bbc86ffea..ecf6403c3a 100644
--- a/leo_ast/statement/block/struct.Block.html
+++ b/leo_ast/statement/block/struct.Block.html
@@ -4,8 +4,8 @@
}Expand description
A block { [stmt]* } consisting of a list of statements to execute in order.
Fields§
§statements: Vec<Statement>The list of statements to execute.
§span: SpanThe span from { to }.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Block> for Block
source§fn eq(&self, other: &Block) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Block> for Block
source§impl Eq for Block
source§impl StructuralEq for Block
source§impl StructuralPartialEq for Block
Auto Trait Implementations§
§impl !RefUnwindSafe for Block
§impl Send for Block
§impl !Sync for Block
§impl Unpin for Block
§impl UnwindSafe for Block
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
index 52923bf610..476515b55c 100644
--- a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
+++ b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
@@ -4,8 +4,8 @@
}Expand description
A console logging statement like console.log(...);.
Fields§
§function: ConsoleFunctionThe logging function to run.
§span: SpanThe span excluding the semicolon.
-Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ConsoleStatement
source§impl Eq for ConsoleStatement
source§impl StructuralEq for ConsoleStatement
source§impl StructuralPartialEq for ConsoleStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ConsoleStatement
§impl Send for ConsoleStatement
§impl Sync for ConsoleStatement
§impl Unpin for ConsoleStatement
§impl UnwindSafe for ConsoleStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/expression/struct.ExpressionStatement.html b/leo_ast/statement/expression/struct.ExpressionStatement.html
index 5d411c9f64..e4f7a1084f 100644
--- a/leo_ast/statement/expression/struct.ExpressionStatement.html
+++ b/leo_ast/statement/expression/struct.ExpressionStatement.html
@@ -4,8 +4,8 @@
}Expand description
An expression statement, foo(a);.
Fields§
§expression: ExpressionThe expression associated with the statement.
§span: SpanThe span.
-Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
source§impl Eq for ExpressionStatement
source§impl StructuralEq for ExpressionStatement
source§impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ExpressionStatement
§impl Send for ExpressionStatement
§impl Sync for ExpressionStatement
§impl Unpin for ExpressionStatement
§impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
§block: BlockThe block to run on each iteration.
§span: SpanThe span from for to block.
-Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
source§impl Eq for IterationStatement
source§impl StructuralEq for IterationStatement
source§impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
§impl !RefUnwindSafe for IterationStatement
§impl Send for IterationStatement
§impl !Sync for IterationStatement
§impl Unpin for IterationStatement
§impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
§finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
§span: SpanThe span of return expression excluding the semicolon.
-Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
source§impl Eq for ReturnStatement
source§impl StructuralEq for ReturnStatement
source§impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ReturnStatement
§impl Send for ReturnStatement
§impl Sync for ReturnStatement
§impl Unpin for ReturnStatement
§impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
source§impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’,
but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moreTrait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
This method tests for self and other values to be equal, and is used
+}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read moresource§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
source§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
Self: Sized,
- Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
self,
f: F
) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
- F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
to every Result::Ok value. Result::Err values are
-unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
value with the provided closure. Result::Err values are
-unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+unchanged. Read more
source§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+values are unchanged. Read more
source§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
Self: Iterator<Item = Result<T, E>> + Sized,
T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnOnce(ProcessResults<'_, Self, E>) -> R,
“Lift” a function of the values of the current iterator so as to process
+an iterator of Result values instead. Read moresource§fn merge<J>(
+ self,
+ other: J
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
+ J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
+ascending order. If both base iterators are sorted (ascending), the
+result is sorted. Read moresource§fn merge_by<J, F>(
+ self,
+ other: J,
+ is_first: F
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ J: IntoIterator<Item = Self::Item>,
+ F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F, T>(
+ self,
+ other: J,
+ cmp_fn: F
+) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where
+ J: IntoIterator,
+ F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T,
+ T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>,
+ Self: Sized,
Create an iterator that merges items from both this and the specified
+iterator in ascending order. Read moresource§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them in ascending order. Read moresource§fn kmerge_by<F>(
+ self,
+ first: F
+) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them according to the given closure. Read moresource§fn cartesian_product<J>(
+ self,
+ other: J
+) -> Product<Self, <J as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: Clone,
+ J: IntoIterator,
+ <J as IntoIterator>::IntoIter: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+the element sets of two iterators self and J. Read moresource§fn multi_cartesian_product(
+ self
+) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::IntoIter: Clone,
+ <Self::Item as IntoIterator>::Item: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+all subiterators returned by meta-iterator self. Read moresource§fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where
+ Self: Sized,
+ F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
Return an iterator adaptor that uses the passed-in closure to
+optionally merge together consecutive elements. Read moresource§fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
Remove duplicates from sections of consecutive identical elements.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_by<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements,
+determining equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_with_count(
+ self
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where
+ Self: Sized,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_by_with_count<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+This will determine equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read moresource§fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read moresource§fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read moresource§fn unique(self) -> Unique<Self>where
+ Self: Sized,
+ Self::Item: Clone + Eq + Hash,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Duplicates
+are detected using hash and equality. Read moresource§fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Read moresource§fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where
+ Self: Sized + PeekingNext,
+ F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from this iterator and
+takes items while the closure accept returns true. Read moresource§fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where
+ Self: Clone,
+ F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from a Clone-able iterator
+to only pick off elements while the predicate accept returns true. Read moresource§fn take_while_inclusive<F>(
+ &mut self,
+ accept: F
+) -> TakeWhileInclusive<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> bool,
Returns an iterator adaptor that consumes elements while the given
+predicate is true, including the element for which the predicate
+first returned false. Read moresource§fn while_some<A>(self) -> WhileSome<Self>where
+ Self: Sized + Iterator<Item = Option<A>>,
Return an iterator adaptor that filters Option<A> iterator elements
+and produces A. Stops on the first None encountered. Read moresource§fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where
+ Self: Sized + Clone,
+ Self::Item: Clone,
+ T: HasCombination<Self>,
Return an iterator adaptor that iterates over the combinations of the
+elements from an iterator. Read moresource§fn combinations(self, k: usize) -> Combinations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator adaptor that iterates over the k-length combinations of
+the elements from an iterator. Read moresource§fn combinations_with_replacement(
+ self,
+ k: usize
+) -> CombinationsWithReplacement<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator that iterates over the k-length combinations of
+the elements from an iterator, with replacement. Read moresource§fn permutations(self, k: usize) -> Permutations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator adaptor that iterates over all k-permutations of the
+elements from an iterator. Read moresource§fn powerset(self) -> Powerset<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator that iterates through the powerset of the elements from an
+iterator. Read moresource§fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where
+ Self: Sized,
+ F: FnMut(usize) -> Self::Item,
Return an iterator adaptor that pads the sequence to a minimum length of
+min by filling missing elements using a closure f. Read moresource§fn with_position(self) -> WithPosition<Self>where
+ Self: Sized,
Return an iterator adaptor that combines each element with a Position to
+ease special-case handling of the first or last elements. Read moresource§fn positions<P>(self, predicate: P) -> Positions<Self, P>where
+ Self: Sized,
+ P: FnMut(Self::Item) -> bool,
Return an iterator adaptor that yields the indices of all elements
+satisfying a predicate, counted from the start of the iterator. Read moresource§fn update<F>(self, updater: F) -> Update<Self, F>where
+ Self: Sized,
+ F: FnMut(&mut Self::Item),
Return an iterator adaptor that applies a mutating function
+to each element before yielding it. Read moresource§fn next_tuple<T>(&mut self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Advances the iterator and returns the next items grouped in a tuple of
+a specific size (up to 12). Read moresource§fn collect_tuple<T>(self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Collects all items from the iterator into a tuple of a specific size
+(up to 12). Read moresource§fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where
+ P: FnMut(&Self::Item) -> bool,
Find the position and value of the first element satisfying a predicate. Read moresource§fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the last element, if any. Read moresource§fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the first element, if any. Read moresource§fn contains<Q>(&mut self, query: &Q) -> boolwhere
+ Self: Sized,
+ Self::Item: Borrow<Q>,
+ Q: PartialEq<Q>,
Returns true if the given item is present in this iterator. Read moresource§fn all_equal(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
Check whether all elements compare equal. Read moresource§fn all_equal_value(
+ &mut self
+) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
If there are elements and they are all equal, return a single copy of that element.
+If there are no elements, return an Error containing None.
+If there are elements and they are not all equal, return a tuple containing the first
+two non-equal elements found. Read moresource§fn all_unique(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: Eq + Hash,
Check whether all elements are unique (non equal). Read moresource§fn dropping(self, n: usize) -> Selfwhere
+ Self: Sized,
Consume the first n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn dropping_back(self, n: usize) -> Selfwhere
+ Self: Sized + DoubleEndedIterator,
Consume the last n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn foreach<F>(self, f: F)where
+ F: FnMut(Self::Item),
+ Self: Sized,
👎Deprecated since 0.8.0: Use .for_each() insteadRun the closure f eagerly on each element of the iterator. Read moresource§fn concat(self) -> Self::Itemwhere
+ Self: Sized,
+ Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,
source§fn collect_vec(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
.collect_vec() is simply a type specialization of Iterator::collect,
+for convenience.source§fn try_collect<T, U, E>(self) -> Result<U, E>where
+ Self: Sized + Iterator<Item = Result<T, E>>,
+ Result<U, E>: FromIterator<Result<T, E>>,
source§fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere
+ A: 'a,
+ Self: Iterator<Item = &'a mut A>,
+ J: IntoIterator<Item = A>,
Assign to each reference in self from the from iterator,
+stopping at the shortest of the two iterators. Read moresource§fn join(&mut self, sep: &str) -> Stringwhere
+ Self::Item: Display,
Combine all iterator elements into one String, separated by sep. Read moresource§fn format(self, sep: &str) -> Format<'_, Self>where
+ Self: Sized,
Format all iterator elements, separated by sep. Read moresource§fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,
Format all iterator elements, separated by sep. Read moresource§fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
👎Deprecated since 0.10.0: Use .fold_ok() insteadSee .fold_ok().source§fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
Fold Result values from an iterator. Read moresource§fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where
+ Self: Iterator<Item = Option<A>>,
+ F: FnMut(B, A) -> B,
Fold Option values from an iterator. Read moresource§fn fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
👎Deprecated since 0.10.2: Use Iterator::reduce insteadAccumulator of the elements in the iterator. Read moresource§fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
Accumulate the elements in the iterator in a tree-like manner. Read moresource§fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where
+ Self: Sized,
+ F: FnMut(B, Self::Item) -> FoldWhile<B>,
An iterator method that applies a function, producing a single, final value. Read moresource§fn sum1<S>(self) -> Option<S>where
+ Self: Sized,
+ S: Sum<Self::Item>,
Iterate over the entire iterator and add all the elements. Read moresource§fn product1<P>(self) -> Option<P>where
+ Self: Sized,
+ P: Product<Self::Item>,
Iterate over the entire iterator and multiply all the elements. Read moresource§fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. The key function is
+called exactly once per key. Read moresource§fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort the k smallest elements into a new iterator, in ascending order. Read moresource§fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where
+ Self: Sized,
+ F: FnMut(Self::Item) -> Either<L, R>,
+ A: Default + Extend<L>,
+ B: Default + Extend<R>,
Collect all iterator elements into one of two
+partitions. Unlike Iterator::partition, each partition may
+have a distinct type. Read moresource§fn partition_result<A, B, T, E>(self) -> (A, B)where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ A: Default + Extend<T>,
+ B: Default + Extend<E>,
Partition a sequence of Results into one list of all the Ok elements
+and another list of all the Err elements. Read moresource§fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
Return a HashMap of keys mapped to Vecs of values. Keys and values
+are taken from (Key, Value) tuple pairs yielded by the input iterator. Read moresource§fn into_group_map_by<K, V, F>(
+ self,
+ f: F
+) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: Fn(&V) -> K,
Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified
+in the closure. Read moresource§fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
Constructs a GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn into_grouping_map_by<K, V, F>(
+ self,
+ key_mapper: F
+) -> GroupingMap<MapForGrouping<Self, F>>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: FnMut(&V) -> K,
Constructs a GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn min_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Return all minimum elements of an iterator. Read moresource§fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all minimum elements of an iterator, as determined by
+the specified function. Read moresource§fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return all minimum elements of an iterator, as determined by
+the specified function. Read moresource§fn max_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Return all maximum elements of an iterator. Read moresource§fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all maximum elements of an iterator, as determined by
+the specified function. Read moresource§fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return all maximum elements of an iterator, as determined by
+the specified function. Read moresource§fn minmax(self) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
Return the minimum and maximum elements in the iterator. Read moresource§fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
Return the minimum and maximum element of an iterator, as determined by
+the specified function. Read moresource§fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the minimum and maximum element of an iterator, as determined by
+the specified comparison function. Read moresource§fn position_max(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
Return the position of the maximum element in the iterator. Read moresource§fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return the position of the maximum element in the iterator, as
+determined by the specified function. Read moresource§fn position_max_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the maximum element in the iterator, as
+determined by the specified comparison function. Read moresource§fn position_min(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
Return the position of the minimum element in the iterator. Read moresource§fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return the position of the minimum element in the iterator, as
+determined by the specified function. Read moresource§fn position_min_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the minimum element in the iterator, as
+determined by the specified comparison function. Read moresource§fn position_minmax(self) -> MinMaxResult<usize>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
Return the positions of the minimum and maximum elements in
+the iterator. Read moresource§fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified function. Read moresource§fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified comparison function. Read moresource§fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
+ Self: Sized,
If the iterator yields exactly one element, that element will be returned, otherwise
+an error will be returned containing an iterator that has the same output as the input
+iterator. Read moresource§fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
+ Self: Sized,
If the iterator yields no elements, Ok(None) will be returned. If the iterator yields
+exactly one element, that element will be returned, otherwise an error will be returned
+containing an iterator that has the same output as the input iterator. Read moresource§fn multipeek(self) -> MultiPeek<Self>where
+ Self: Sized,
An iterator adaptor that allows the user to peek at multiple .next()
+values without advancing the base iterator. Read moresource§fn counts(self) -> HashMap<Self::Item, usize, RandomState>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
Collect the items in this iterator and return a HashMap which
+contains each item that appears in the iterator and the number
+of times it appears. Read moresource§fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where
+ Self: Sized,
+ K: Eq + Hash,
+ F: FnMut(Self::Item) -> K,
Collect the items in this iterator and return a HashMap which
+contains each item that appears in the iterator and the number
+of times it appears,
+determining identity using a keying function. Read moresource§fn multiunzip<FromI>(self) -> FromIwhere
+ Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
+ self,
+ other: J
+) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ self,
+ other: J
+) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
Alternate elements from two iterators until at least one of them has run
+out. Read moresource§fn intersperse(
+ self,
+ element: Self::Item
+) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
+ Self: Sized,
+ Self::Item: Clone,
An iterator adaptor to insert a particular value
+between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+ Self: Sized,
+ F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
+between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+ self,
+ other: J
+) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of elements. Read moresource§fn batching<B, F>(self, f: F) -> Batching<Self, F>where
+ F: FnMut(&mut Self) -> Option<B>,
+ Self: Sized,
A “meta iterator adaptor”. Its closure receives a reference to the
+iterator and may pick off as many elements as it likes, to produce the
+next iterator element. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> K,
+ K: PartialEq<K>,
Return an iterable that can group iterator elements.
+Consecutive elements that map to the same key (“runs”), are assigned
+to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
+ <T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
+a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+ Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
+ T: TupleCollect + Clone,
+ <T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
+elements when the window would otherwise exceed the length of the
+iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
+(up to 12). Read moresource§fn tee(self) -> (Tee<Self>, Tee<Self>)where
+ Self: Sized,
+ Self::Item: Clone,
Split into an iterator pair that both yield all elements from
+the original iterator. Read moresource§fn step(self, n: usize) -> Step<Self>where
+ Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
+for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+ Self: Sized,
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ self,
+ f: F
+) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
+to every Result::Ok value. Result::Err values are
+unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
+value with the provided closure. Result::Err values are
+unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
+Result::Ok value with the provided closure. Result::Err
+values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
+a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn merge<J>(
self,
other: J
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
@@ -287,7 +692,7 @@
Self::Item: PartialOrd<Self::Item>,
J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
ascending order. If both base iterators are sorted (ascending), the
-result is sorted. Read moresource§fn merge_by<J, F>(
self,
other: J,
is_first: F
@@ -295,7 +700,7 @@
Self: Sized,
J: IntoIterator<Item = Self::Item>,
F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F>(
+This is much like .merge() but allows for a custom ordering. Read more
source§fn merge_join_by<J, F>(
self,
other: J,
cmp_fn: F
@@ -303,18 +708,18 @@
J: IntoIterator,
F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering,
Self: Sized,
Create an iterator that merges items from both this and the specified
-iterator in ascending order. Read moresource§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
+iterator in ascending order. Read more
source§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
Return an iterator adaptor that flattens an iterator of iterators by
-merging them in ascending order. Read moresource§fn kmerge_by<F>(
self,
first: F
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
Return an iterator adaptor that flattens an iterator of iterators by
-merging them according to the given closure. Read moresource§fn cartesian_product<J>(
+merging them according to the given closure. Read more
impl<T> Any for Twhere
diff --git a/leo_ast/statement/assert/struct.AssertStatement.html b/leo_ast/statement/assert/struct.AssertStatement.html
index c3b1407262..8e6f385649 100644
--- a/leo_ast/statement/assert/struct.AssertStatement.html
+++ b/leo_ast/statement/assert/struct.AssertStatement.html
@@ -4,8 +4,8 @@
}Expand description
An assert statement, assert(<expr>), assert_eq(<expr>) or assert_neq(<expr>).
Fields§
§variant: AssertVariantThe variant of the assert statement.
§span: SpanThe span, excluding the semicolon.
-Trait Implementations§
source§impl Clone for AssertStatement
source§fn clone(&self) -> AssertStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for AssertStatement
source§impl<'de> Deserialize<'de> for AssertStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for AssertStatement
source§impl Node for AssertStatement
source§impl PartialEq<AssertStatement> for AssertStatement
source§fn eq(&self, other: &AssertStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for AssertStatement
source§fn clone(&self) -> AssertStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for AssertStatement
source§impl<'de> Deserialize<'de> for AssertStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for AssertStatement
source§impl Node for AssertStatement
source§impl PartialEq<AssertStatement> for AssertStatement
source§fn eq(&self, other: &AssertStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for AssertStatement
source§impl Eq for AssertStatement
source§impl StructuralEq for AssertStatement
source§impl StructuralPartialEq for AssertStatement
Auto Trait Implementations§
§impl RefUnwindSafe for AssertStatement
§impl Send for AssertStatement
§impl Sync for AssertStatement
§impl Unpin for AssertStatement
§impl UnwindSafe for AssertStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/block/struct.Block.html b/leo_ast/statement/block/struct.Block.html
index 2bbc86ffea..ecf6403c3a 100644
--- a/leo_ast/statement/block/struct.Block.html
+++ b/leo_ast/statement/block/struct.Block.html
@@ -4,8 +4,8 @@
}Expand description
A block { [stmt]* } consisting of a list of statements to execute in order.
Fields§
§statements: Vec<Statement>The list of statements to execute.
§span: SpanThe span from { to }.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Block> for Block
source§fn eq(&self, other: &Block) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Block> for Block
source§impl Eq for Block
source§impl StructuralEq for Block
source§impl StructuralPartialEq for Block
Auto Trait Implementations§
§impl !RefUnwindSafe for Block
§impl Send for Block
§impl !Sync for Block
§impl Unpin for Block
§impl UnwindSafe for Block
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
index 52923bf610..476515b55c 100644
--- a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
+++ b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
@@ -4,8 +4,8 @@
}Expand description
A console logging statement like console.log(...);.
Fields§
§function: ConsoleFunctionThe logging function to run.
§span: SpanThe span excluding the semicolon.
-Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ConsoleStatement
source§impl Eq for ConsoleStatement
source§impl StructuralEq for ConsoleStatement
source§impl StructuralPartialEq for ConsoleStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ConsoleStatement
§impl Send for ConsoleStatement
§impl Sync for ConsoleStatement
§impl Unpin for ConsoleStatement
§impl UnwindSafe for ConsoleStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/expression/struct.ExpressionStatement.html b/leo_ast/statement/expression/struct.ExpressionStatement.html
index 5d411c9f64..e4f7a1084f 100644
--- a/leo_ast/statement/expression/struct.ExpressionStatement.html
+++ b/leo_ast/statement/expression/struct.ExpressionStatement.html
@@ -4,8 +4,8 @@
}Expand description
An expression statement, foo(a);.
Fields§
§expression: ExpressionThe expression associated with the statement.
§span: SpanThe span.
-Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
source§impl Eq for ExpressionStatement
source§impl StructuralEq for ExpressionStatement
source§impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ExpressionStatement
§impl Send for ExpressionStatement
§impl Sync for ExpressionStatement
§impl Unpin for ExpressionStatement
§impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
§block: BlockThe block to run on each iteration.
§span: SpanThe span from for to block.
-Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
source§impl Eq for IterationStatement
source§impl StructuralEq for IterationStatement
source§impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
§impl !RefUnwindSafe for IterationStatement
§impl Send for IterationStatement
§impl !Sync for IterationStatement
§impl Unpin for IterationStatement
§impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
§finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
§span: SpanThe span of return expression excluding the semicolon.
-Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
source§impl Eq for ReturnStatement
source§impl StructuralEq for ReturnStatement
source§impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ReturnStatement
§impl Send for ReturnStatement
§impl Sync for ReturnStatement
§impl Unpin for ReturnStatement
§impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
source§impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’,
but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moreTrait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
This method tests for self and other values to be equal, and is used
+}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read moresource§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
source§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
Self: Sized,
- Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
self,
f: F
) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
- F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
to every Result::Ok value. Result::Err values are
-unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
value with the provided closure. Result::Err values are
-unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+unchanged. Read more
source§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+values are unchanged. Read more
source§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
Self: Iterator<Item = Result<T, E>> + Sized,
T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnOnce(ProcessResults<'_, Self, E>) -> R,
“Lift” a function of the values of the current iterator so as to process
+an iterator of Result values instead. Read moresource§fn merge<J>(
+ self,
+ other: J
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
+ J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
+ascending order. If both base iterators are sorted (ascending), the
+result is sorted. Read moresource§fn merge_by<J, F>(
+ self,
+ other: J,
+ is_first: F
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ J: IntoIterator<Item = Self::Item>,
+ F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F, T>(
+ self,
+ other: J,
+ cmp_fn: F
+) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where
+ J: IntoIterator,
+ F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T,
+ T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>,
+ Self: Sized,
Create an iterator that merges items from both this and the specified
+iterator in ascending order. Read moresource§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them in ascending order. Read moresource§fn kmerge_by<F>(
+ self,
+ first: F
+) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them according to the given closure. Read moresource§fn cartesian_product<J>(
+ self,
+ other: J
+) -> Product<Self, <J as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: Clone,
+ J: IntoIterator,
+ <J as IntoIterator>::IntoIter: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+the element sets of two iterators self and J. Read moresource§fn multi_cartesian_product(
+ self
+) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::IntoIter: Clone,
+ <Self::Item as IntoIterator>::Item: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+all subiterators returned by meta-iterator self. Read moresource§fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where
+ Self: Sized,
+ F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
Return an iterator adaptor that uses the passed-in closure to
+optionally merge together consecutive elements. Read moresource§fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
Remove duplicates from sections of consecutive identical elements.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_by<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements,
+determining equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_with_count(
+ self
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where
+ Self: Sized,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_by_with_count<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+This will determine equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read moresource§fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read moresource§fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read moresource§fn unique(self) -> Unique<Self>where
+ Self: Sized,
+ Self::Item: Clone + Eq + Hash,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Duplicates
+are detected using hash and equality. Read moresource§fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Read moresource§fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where
+ Self: Sized + PeekingNext,
+ F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from this iterator and
+takes items while the closure accept returns true. Read moresource§fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where
+ Self: Clone,
+ F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from a Clone-able iterator
+to only pick off elements while the predicate accept returns true. Read moresource§fn take_while_inclusive<F>(
+ &mut self,
+ accept: F
+) -> TakeWhileInclusive<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> bool,
Returns an iterator adaptor that consumes elements while the given
+predicate is true, including the element for which the predicate
+first returned false. Read moresource§fn while_some<A>(self) -> WhileSome<Self>where
+ Self: Sized + Iterator<Item = Option<A>>,
Return an iterator adaptor that filters Option<A> iterator elements
+and produces A. Stops on the first None encountered. Read moresource§fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where
+ Self: Sized + Clone,
+ Self::Item: Clone,
+ T: HasCombination<Self>,
Return an iterator adaptor that iterates over the combinations of the
+elements from an iterator. Read moresource§fn combinations(self, k: usize) -> Combinations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator adaptor that iterates over the k-length combinations of
+the elements from an iterator. Read moresource§fn combinations_with_replacement(
+ self,
+ k: usize
+) -> CombinationsWithReplacement<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator that iterates over the k-length combinations of
+the elements from an iterator, with replacement. Read moresource§fn permutations(self, k: usize) -> Permutations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator adaptor that iterates over all k-permutations of the
+elements from an iterator. Read moresource§fn powerset(self) -> Powerset<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator that iterates through the powerset of the elements from an
+iterator. Read moresource§fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where
+ Self: Sized,
+ F: FnMut(usize) -> Self::Item,
Return an iterator adaptor that pads the sequence to a minimum length of
+min by filling missing elements using a closure f. Read moresource§fn with_position(self) -> WithPosition<Self>where
+ Self: Sized,
Return an iterator adaptor that combines each element with a Position to
+ease special-case handling of the first or last elements. Read moresource§fn positions<P>(self, predicate: P) -> Positions<Self, P>where
+ Self: Sized,
+ P: FnMut(Self::Item) -> bool,
Return an iterator adaptor that yields the indices of all elements
+satisfying a predicate, counted from the start of the iterator. Read moresource§fn update<F>(self, updater: F) -> Update<Self, F>where
+ Self: Sized,
+ F: FnMut(&mut Self::Item),
Return an iterator adaptor that applies a mutating function
+to each element before yielding it. Read moresource§fn next_tuple<T>(&mut self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Advances the iterator and returns the next items grouped in a tuple of
+a specific size (up to 12). Read moresource§fn collect_tuple<T>(self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Collects all items from the iterator into a tuple of a specific size
+(up to 12). Read moresource§fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where
+ P: FnMut(&Self::Item) -> bool,
Find the position and value of the first element satisfying a predicate. Read moresource§fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the last element, if any. Read moresource§fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the first element, if any. Read moresource§fn contains<Q>(&mut self, query: &Q) -> boolwhere
+ Self: Sized,
+ Self::Item: Borrow<Q>,
+ Q: PartialEq<Q>,
Returns true if the given item is present in this iterator. Read moresource§fn all_equal(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
Check whether all elements compare equal. Read moresource§fn all_equal_value(
+ &mut self
+) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
If there are elements and they are all equal, return a single copy of that element.
+If there are no elements, return an Error containing None.
+If there are elements and they are not all equal, return a tuple containing the first
+two non-equal elements found. Read moresource§fn all_unique(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: Eq + Hash,
Check whether all elements are unique (non equal). Read moresource§fn dropping(self, n: usize) -> Selfwhere
+ Self: Sized,
Consume the first n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn dropping_back(self, n: usize) -> Selfwhere
+ Self: Sized + DoubleEndedIterator,
Consume the last n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn foreach<F>(self, f: F)where
+ F: FnMut(Self::Item),
+ Self: Sized,
👎Deprecated since 0.8.0: Use .for_each() insteadRun the closure f eagerly on each element of the iterator. Read moresource§fn concat(self) -> Self::Itemwhere
+ Self: Sized,
+ Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,
source§fn collect_vec(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
.collect_vec() is simply a type specialization of Iterator::collect,
+for convenience.source§fn try_collect<T, U, E>(self) -> Result<U, E>where
+ Self: Sized + Iterator<Item = Result<T, E>>,
+ Result<U, E>: FromIterator<Result<T, E>>,
source§fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere
+ A: 'a,
+ Self: Iterator<Item = &'a mut A>,
+ J: IntoIterator<Item = A>,
Assign to each reference in self from the from iterator,
+stopping at the shortest of the two iterators. Read moresource§fn join(&mut self, sep: &str) -> Stringwhere
+ Self::Item: Display,
Combine all iterator elements into one String, separated by sep. Read moresource§fn format(self, sep: &str) -> Format<'_, Self>where
+ Self: Sized,
Format all iterator elements, separated by sep. Read moresource§fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,
Format all iterator elements, separated by sep. Read moresource§fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
👎Deprecated since 0.10.0: Use .fold_ok() insteadSee .fold_ok().source§fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
Fold Result values from an iterator. Read moresource§fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where
+ Self: Iterator<Item = Option<A>>,
+ F: FnMut(B, A) -> B,
Fold Option values from an iterator. Read moresource§fn fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
👎Deprecated since 0.10.2: Use Iterator::reduce insteadAccumulator of the elements in the iterator. Read moresource§fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
Accumulate the elements in the iterator in a tree-like manner. Read moresource§fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where
+ Self: Sized,
+ F: FnMut(B, Self::Item) -> FoldWhile<B>,
An iterator method that applies a function, producing a single, final value. Read moresource§fn sum1<S>(self) -> Option<S>where
+ Self: Sized,
+ S: Sum<Self::Item>,
Iterate over the entire iterator and add all the elements. Read moresource§fn product1<P>(self) -> Option<P>where
+ Self: Sized,
+ P: Product<Self::Item>,
Iterate over the entire iterator and multiply all the elements. Read moresource§fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. The key function is
+called exactly once per key. Read moresource§fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort the k smallest elements into a new iterator, in ascending order. Read moresource§fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where
+ Self: Sized,
+ F: FnMut(Self::Item) -> Either<L, R>,
+ A: Default + Extend<L>,
+ B: Default + Extend<R>,
Collect all iterator elements into one of two
+partitions. Unlike Iterator::partition, each partition may
+have a distinct type. Read moresource§fn partition_result<A, B, T, E>(self) -> (A, B)where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ A: Default + Extend<T>,
+ B: Default + Extend<E>,
Partition a sequence of Results into one list of all the Ok elements
+and another list of all the Err elements. Read moresource§fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
Return a HashMap of keys mapped to Vecs of values. Keys and values
+are taken from (Key, Value) tuple pairs yielded by the input iterator. Read moresource§fn into_group_map_by<K, V, F>(
+ self,
+ f: F
+) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: Fn(&V) -> K,
Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified
+in the closure. Read moresource§fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
Constructs a GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn into_grouping_map_by<K, V, F>(
+ self,
+ key_mapper: F
+) -> GroupingMap<MapForGrouping<Self, F>>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: FnMut(&V) -> K,
Constructs a GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn min_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Return all minimum elements of an iterator. Read moresource§fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all minimum elements of an iterator, as determined by
+the specified function. Read moresource§fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return all minimum elements of an iterator, as determined by
+the specified function. Read moresource§fn max_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Return all maximum elements of an iterator. Read moresource§fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all maximum elements of an iterator, as determined by
+the specified function. Read moresource§fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return all maximum elements of an iterator, as determined by
+the specified function. Read moresource§fn minmax(self) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
Return the minimum and maximum elements in the iterator. Read moresource§fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
Return the minimum and maximum element of an iterator, as determined by
+the specified function. Read moresource§fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the minimum and maximum element of an iterator, as determined by
+the specified comparison function. Read moresource§fn position_max(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
Return the position of the maximum element in the iterator. Read moresource§fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return the position of the maximum element in the iterator, as
+determined by the specified function. Read moresource§fn position_max_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the maximum element in the iterator, as
+determined by the specified comparison function. Read moresource§fn position_min(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
Return the position of the minimum element in the iterator. Read moresource§fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return the position of the minimum element in the iterator, as
+determined by the specified function. Read moresource§fn position_min_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the minimum element in the iterator, as
+determined by the specified comparison function. Read moresource§fn position_minmax(self) -> MinMaxResult<usize>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
Return the positions of the minimum and maximum elements in
+the iterator. Read moresource§fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified function. Read moresource§fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified comparison function. Read moresource§fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
+ Self: Sized,
If the iterator yields exactly one element, that element will be returned, otherwise
+an error will be returned containing an iterator that has the same output as the input
+iterator. Read moresource§fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
+ Self: Sized,
If the iterator yields no elements, Ok(None) will be returned. If the iterator yields
+exactly one element, that element will be returned, otherwise an error will be returned
+containing an iterator that has the same output as the input iterator. Read moresource§fn multipeek(self) -> MultiPeek<Self>where
+ Self: Sized,
An iterator adaptor that allows the user to peek at multiple .next()
+values without advancing the base iterator. Read moresource§fn counts(self) -> HashMap<Self::Item, usize, RandomState>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
Collect the items in this iterator and return a HashMap which
+contains each item that appears in the iterator and the number
+of times it appears. Read moresource§fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where
+ Self: Sized,
+ K: Eq + Hash,
+ F: FnMut(Self::Item) -> K,
Collect the items in this iterator and return a HashMap which
+contains each item that appears in the iterator and the number
+of times it appears,
+determining identity using a keying function. Read moresource§fn multiunzip<FromI>(self) -> FromIwhere
+ Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
+ self,
+ other: J
+) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ self,
+ other: J
+) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
Alternate elements from two iterators until at least one of them has run
+out. Read moresource§fn intersperse(
+ self,
+ element: Self::Item
+) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
+ Self: Sized,
+ Self::Item: Clone,
An iterator adaptor to insert a particular value
+between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+ Self: Sized,
+ F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
+between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+ self,
+ other: J
+) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of elements. Read moresource§fn batching<B, F>(self, f: F) -> Batching<Self, F>where
+ F: FnMut(&mut Self) -> Option<B>,
+ Self: Sized,
A “meta iterator adaptor”. Its closure receives a reference to the
+iterator and may pick off as many elements as it likes, to produce the
+next iterator element. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> K,
+ K: PartialEq<K>,
Return an iterable that can group iterator elements.
+Consecutive elements that map to the same key (“runs”), are assigned
+to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
+ <T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
+a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+ Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
+ T: TupleCollect + Clone,
+ <T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
+elements when the window would otherwise exceed the length of the
+iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
+(up to 12). Read moresource§fn tee(self) -> (Tee<Self>, Tee<Self>)where
+ Self: Sized,
+ Self::Item: Clone,
Split into an iterator pair that both yield all elements from
+the original iterator. Read moresource§fn step(self, n: usize) -> Step<Self>where
+ Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
+for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+ Self: Sized,
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ self,
+ f: F
+) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
+to every Result::Ok value. Result::Err values are
+unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
+value with the provided closure. Result::Err values are
+unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
+Result::Ok value with the provided closure. Result::Err
+values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
+a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn merge<J>(
self,
other: J
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
@@ -287,7 +692,7 @@
Self::Item: PartialOrd<Self::Item>,
J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
ascending order. If both base iterators are sorted (ascending), the
-result is sorted. Read moresource§fn merge_by<J, F>(
self,
other: J,
is_first: F
@@ -295,7 +700,7 @@
Self: Sized,
J: IntoIterator<Item = Self::Item>,
F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F>(
+This is much like .merge() but allows for a custom ordering. Read more
source§fn merge_join_by<J, F>(
self,
other: J,
cmp_fn: F
@@ -303,18 +708,18 @@
J: IntoIterator,
F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering,
Self: Sized,
Create an iterator that merges items from both this and the specified
-iterator in ascending order. Read moresource§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
+iterator in ascending order. Read more
source§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
Return an iterator adaptor that flattens an iterator of iterators by
-merging them in ascending order. Read moresource§fn kmerge_by<F>(
self,
first: F
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
Return an iterator adaptor that flattens an iterator of iterators by
-merging them according to the given closure. Read moresource§fn cartesian_product<J>(
+merging them according to the given closure. Read more
Expand description
An assert statement, assert(<expr>), assert_eq(<expr>) or assert_neq(<expr>).
The variant of the assert statement.
The span, excluding the semicolon.
-source§impl Clone for AssertStatement
impl Clone for AssertStatement
source§fn clone(&self) -> AssertStatement
fn clone(&self) -> AssertStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for AssertStatement
impl Debug for AssertStatement
source§impl<'de> Deserialize<'de> for AssertStatement
impl<'de> Deserialize<'de> for AssertStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for AssertStatement
impl Display for AssertStatement
source§impl Node for AssertStatement
impl Node for AssertStatement
source§impl PartialEq<AssertStatement> for AssertStatement
impl PartialEq<AssertStatement> for AssertStatement
source§fn eq(&self, other: &AssertStatement) -> bool
fn eq(&self, other: &AssertStatement) -> bool
This method tests for
self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for AssertStatement
impl Clone for AssertStatement
source§fn clone(&self) -> AssertStatement
fn clone(&self) -> AssertStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for AssertStatement
impl Debug for AssertStatement
source§impl<'de> Deserialize<'de> for AssertStatement
impl<'de> Deserialize<'de> for AssertStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for AssertStatement
impl Display for AssertStatement
source§impl Node for AssertStatement
impl Node for AssertStatement
source§impl PartialEq<AssertStatement> for AssertStatement
impl PartialEq<AssertStatement> for AssertStatement
source§fn eq(&self, other: &AssertStatement) -> bool
fn eq(&self, other: &AssertStatement) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl Serialize for AssertStatement
impl Serialize for AssertStatement
impl Eq for AssertStatement
impl StructuralEq for AssertStatement
impl StructuralPartialEq for AssertStatement
Auto Trait Implementations§
impl RefUnwindSafe for AssertStatement
impl Send for AssertStatement
impl Sync for AssertStatement
impl Unpin for AssertStatement
impl UnwindSafe for AssertStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/block/struct.Block.html b/leo_ast/statement/block/struct.Block.html
index 2bbc86ffea..ecf6403c3a 100644
--- a/leo_ast/statement/block/struct.Block.html
+++ b/leo_ast/statement/block/struct.Block.html
@@ -4,8 +4,8 @@
}Expand description
A block { [stmt]* } consisting of a list of statements to execute in order.
Fields§
§statements: Vec<Statement>The list of statements to execute.
§span: SpanThe span from { to }.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Block> for Block
source§fn eq(&self, other: &Block) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Block> for Block
source§impl Eq for Block
source§impl StructuralEq for Block
source§impl StructuralPartialEq for Block
Auto Trait Implementations§
§impl !RefUnwindSafe for Block
§impl Send for Block
§impl !Sync for Block
§impl Unpin for Block
§impl UnwindSafe for Block
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
index 52923bf610..476515b55c 100644
--- a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
+++ b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
@@ -4,8 +4,8 @@
}Expand description
A console logging statement like console.log(...);.
Fields§
§function: ConsoleFunctionThe logging function to run.
§span: SpanThe span excluding the semicolon.
-Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ConsoleStatement
source§impl Eq for ConsoleStatement
source§impl StructuralEq for ConsoleStatement
source§impl StructuralPartialEq for ConsoleStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ConsoleStatement
§impl Send for ConsoleStatement
§impl Sync for ConsoleStatement
§impl Unpin for ConsoleStatement
§impl UnwindSafe for ConsoleStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/expression/struct.ExpressionStatement.html b/leo_ast/statement/expression/struct.ExpressionStatement.html
index 5d411c9f64..e4f7a1084f 100644
--- a/leo_ast/statement/expression/struct.ExpressionStatement.html
+++ b/leo_ast/statement/expression/struct.ExpressionStatement.html
@@ -4,8 +4,8 @@
}Expand description
An expression statement, foo(a);.
Fields§
§expression: ExpressionThe expression associated with the statement.
§span: SpanThe span.
-Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
source§impl Eq for ExpressionStatement
source§impl StructuralEq for ExpressionStatement
source§impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ExpressionStatement
§impl Send for ExpressionStatement
§impl Sync for ExpressionStatement
§impl Unpin for ExpressionStatement
§impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
§block: BlockThe block to run on each iteration.
§span: SpanThe span from for to block.
-Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
source§impl Eq for IterationStatement
source§impl StructuralEq for IterationStatement
source§impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
§impl !RefUnwindSafe for IterationStatement
§impl Send for IterationStatement
§impl !Sync for IterationStatement
§impl Unpin for IterationStatement
§impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
§finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
§span: SpanThe span of return expression excluding the semicolon.
-Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
source§impl Eq for ReturnStatement
source§impl StructuralEq for ReturnStatement
source§impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ReturnStatement
§impl Send for ReturnStatement
§impl Sync for ReturnStatement
§impl Unpin for ReturnStatement
§impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
source§impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’,
but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moreTrait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
This method tests for self and other values to be equal, and is used
+}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read moresource§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
source§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
Self: Sized,
- Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
self,
f: F
) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
- F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
to every Result::Ok value. Result::Err values are
-unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
value with the provided closure. Result::Err values are
-unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+unchanged. Read more
source§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+values are unchanged. Read more
source§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
Self: Iterator<Item = Result<T, E>> + Sized,
T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnOnce(ProcessResults<'_, Self, E>) -> R,
“Lift” a function of the values of the current iterator so as to process
+an iterator of Result values instead. Read moresource§fn merge<J>(
+ self,
+ other: J
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
+ J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
+ascending order. If both base iterators are sorted (ascending), the
+result is sorted. Read moresource§fn merge_by<J, F>(
+ self,
+ other: J,
+ is_first: F
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ J: IntoIterator<Item = Self::Item>,
+ F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F, T>(
+ self,
+ other: J,
+ cmp_fn: F
+) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where
+ J: IntoIterator,
+ F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T,
+ T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>,
+ Self: Sized,
Create an iterator that merges items from both this and the specified
+iterator in ascending order. Read moresource§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them in ascending order. Read moresource§fn kmerge_by<F>(
+ self,
+ first: F
+) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them according to the given closure. Read moresource§fn cartesian_product<J>(
+ self,
+ other: J
+) -> Product<Self, <J as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: Clone,
+ J: IntoIterator,
+ <J as IntoIterator>::IntoIter: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+the element sets of two iterators self and J. Read moresource§fn multi_cartesian_product(
+ self
+) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::IntoIter: Clone,
+ <Self::Item as IntoIterator>::Item: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+all subiterators returned by meta-iterator self. Read moresource§fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where
+ Self: Sized,
+ F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
Return an iterator adaptor that uses the passed-in closure to
+optionally merge together consecutive elements. Read moresource§fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
Remove duplicates from sections of consecutive identical elements.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_by<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements,
+determining equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_with_count(
+ self
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where
+ Self: Sized,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_by_with_count<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+This will determine equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read moresource§fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read moresource§fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read moresource§fn unique(self) -> Unique<Self>where
+ Self: Sized,
+ Self::Item: Clone + Eq + Hash,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Duplicates
+are detected using hash and equality. Read moresource§fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Read moresource§fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where
+ Self: Sized + PeekingNext,
+ F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from this iterator and
+takes items while the closure accept returns true. Read moresource§fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where
+ Self: Clone,
+ F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from a Clone-able iterator
+to only pick off elements while the predicate accept returns true. Read moresource§fn take_while_inclusive<F>(
+ &mut self,
+ accept: F
+) -> TakeWhileInclusive<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> bool,
Returns an iterator adaptor that consumes elements while the given
+predicate is true, including the element for which the predicate
+first returned false. Read moresource§fn while_some<A>(self) -> WhileSome<Self>where
+ Self: Sized + Iterator<Item = Option<A>>,
Return an iterator adaptor that filters Option<A> iterator elements
+and produces A. Stops on the first None encountered. Read moresource§fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where
+ Self: Sized + Clone,
+ Self::Item: Clone,
+ T: HasCombination<Self>,
Return an iterator adaptor that iterates over the combinations of the
+elements from an iterator. Read moresource§fn combinations(self, k: usize) -> Combinations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator adaptor that iterates over the k-length combinations of
+the elements from an iterator. Read moresource§fn combinations_with_replacement(
+ self,
+ k: usize
+) -> CombinationsWithReplacement<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator that iterates over the k-length combinations of
+the elements from an iterator, with replacement. Read moresource§fn permutations(self, k: usize) -> Permutations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator adaptor that iterates over all k-permutations of the
+elements from an iterator. Read moresource§fn powerset(self) -> Powerset<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator that iterates through the powerset of the elements from an
+iterator. Read moresource§fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where
+ Self: Sized,
+ F: FnMut(usize) -> Self::Item,
Return an iterator adaptor that pads the sequence to a minimum length of
+min by filling missing elements using a closure f. Read moresource§fn with_position(self) -> WithPosition<Self>where
+ Self: Sized,
Return an iterator adaptor that combines each element with a Position to
+ease special-case handling of the first or last elements. Read moresource§fn positions<P>(self, predicate: P) -> Positions<Self, P>where
+ Self: Sized,
+ P: FnMut(Self::Item) -> bool,
Return an iterator adaptor that yields the indices of all elements
+satisfying a predicate, counted from the start of the iterator. Read moresource§fn update<F>(self, updater: F) -> Update<Self, F>where
+ Self: Sized,
+ F: FnMut(&mut Self::Item),
Return an iterator adaptor that applies a mutating function
+to each element before yielding it. Read moresource§fn next_tuple<T>(&mut self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Advances the iterator and returns the next items grouped in a tuple of
+a specific size (up to 12). Read moresource§fn collect_tuple<T>(self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Collects all items from the iterator into a tuple of a specific size
+(up to 12). Read moresource§fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where
+ P: FnMut(&Self::Item) -> bool,
Find the position and value of the first element satisfying a predicate. Read moresource§fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the last element, if any. Read moresource§fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the first element, if any. Read moresource§fn contains<Q>(&mut self, query: &Q) -> boolwhere
+ Self: Sized,
+ Self::Item: Borrow<Q>,
+ Q: PartialEq<Q>,
Returns true if the given item is present in this iterator. Read moresource§fn all_equal(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
Check whether all elements compare equal. Read moresource§fn all_equal_value(
+ &mut self
+) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
If there are elements and they are all equal, return a single copy of that element.
+If there are no elements, return an Error containing None.
+If there are elements and they are not all equal, return a tuple containing the first
+two non-equal elements found. Read moresource§fn all_unique(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: Eq + Hash,
Check whether all elements are unique (non equal). Read moresource§fn dropping(self, n: usize) -> Selfwhere
+ Self: Sized,
Consume the first n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn dropping_back(self, n: usize) -> Selfwhere
+ Self: Sized + DoubleEndedIterator,
Consume the last n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn foreach<F>(self, f: F)where
+ F: FnMut(Self::Item),
+ Self: Sized,
👎Deprecated since 0.8.0: Use .for_each() insteadRun the closure f eagerly on each element of the iterator. Read moresource§fn concat(self) -> Self::Itemwhere
+ Self: Sized,
+ Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,
source§fn collect_vec(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
.collect_vec() is simply a type specialization of Iterator::collect,
+for convenience.source§fn try_collect<T, U, E>(self) -> Result<U, E>where
+ Self: Sized + Iterator<Item = Result<T, E>>,
+ Result<U, E>: FromIterator<Result<T, E>>,
source§fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere
+ A: 'a,
+ Self: Iterator<Item = &'a mut A>,
+ J: IntoIterator<Item = A>,
Assign to each reference in self from the from iterator,
+stopping at the shortest of the two iterators. Read moresource§fn join(&mut self, sep: &str) -> Stringwhere
+ Self::Item: Display,
Combine all iterator elements into one String, separated by sep. Read moresource§fn format(self, sep: &str) -> Format<'_, Self>where
+ Self: Sized,
Format all iterator elements, separated by sep. Read moresource§fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,
Format all iterator elements, separated by sep. Read moresource§fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
👎Deprecated since 0.10.0: Use .fold_ok() insteadSee .fold_ok().source§fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
Fold Result values from an iterator. Read moresource§fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where
+ Self: Iterator<Item = Option<A>>,
+ F: FnMut(B, A) -> B,
Fold Option values from an iterator. Read moresource§fn fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
👎Deprecated since 0.10.2: Use Iterator::reduce insteadAccumulator of the elements in the iterator. Read moresource§fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
Accumulate the elements in the iterator in a tree-like manner. Read moresource§fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where
+ Self: Sized,
+ F: FnMut(B, Self::Item) -> FoldWhile<B>,
An iterator method that applies a function, producing a single, final value. Read moresource§fn sum1<S>(self) -> Option<S>where
+ Self: Sized,
+ S: Sum<Self::Item>,
Iterate over the entire iterator and add all the elements. Read moresource§fn product1<P>(self) -> Option<P>where
+ Self: Sized,
+ P: Product<Self::Item>,
Iterate over the entire iterator and multiply all the elements. Read moresource§fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. The key function is
+called exactly once per key. Read moresource§fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort the k smallest elements into a new iterator, in ascending order. Read moresource§fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where
+ Self: Sized,
+ F: FnMut(Self::Item) -> Either<L, R>,
+ A: Default + Extend<L>,
+ B: Default + Extend<R>,
Collect all iterator elements into one of two
+partitions. Unlike Iterator::partition, each partition may
+have a distinct type. Read moresource§fn partition_result<A, B, T, E>(self) -> (A, B)where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ A: Default + Extend<T>,
+ B: Default + Extend<E>,
Partition a sequence of Results into one list of all the Ok elements
+and another list of all the Err elements. Read moresource§fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
Return a HashMap of keys mapped to Vecs of values. Keys and values
+are taken from (Key, Value) tuple pairs yielded by the input iterator. Read moresource§fn into_group_map_by<K, V, F>(
+ self,
+ f: F
+) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: Fn(&V) -> K,
Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified
+in the closure. Read moresource§fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
Constructs a GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn into_grouping_map_by<K, V, F>(
+ self,
+ key_mapper: F
+) -> GroupingMap<MapForGrouping<Self, F>>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: FnMut(&V) -> K,
Constructs a GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn min_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Return all minimum elements of an iterator. Read moresource§fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all minimum elements of an iterator, as determined by
+the specified function. Read moresource§fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return all minimum elements of an iterator, as determined by
+the specified function. Read moresource§fn max_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Return all maximum elements of an iterator. Read moresource§fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all maximum elements of an iterator, as determined by
+the specified function. Read moresource§fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return all maximum elements of an iterator, as determined by
+the specified function. Read moresource§fn minmax(self) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
Return the minimum and maximum elements in the iterator. Read moresource§fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
Return the minimum and maximum element of an iterator, as determined by
+the specified function. Read moresource§fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the minimum and maximum element of an iterator, as determined by
+the specified comparison function. Read moresource§fn position_max(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
Return the position of the maximum element in the iterator. Read moresource§fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return the position of the maximum element in the iterator, as
+determined by the specified function. Read moresource§fn position_max_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the maximum element in the iterator, as
+determined by the specified comparison function. Read moresource§fn position_min(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
Return the position of the minimum element in the iterator. Read moresource§fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return the position of the minimum element in the iterator, as
+determined by the specified function. Read moresource§fn position_min_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the minimum element in the iterator, as
+determined by the specified comparison function. Read moresource§fn position_minmax(self) -> MinMaxResult<usize>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
Return the positions of the minimum and maximum elements in
+the iterator. Read moresource§fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified function. Read moresource§fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified comparison function. Read moresource§fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
+ Self: Sized,
If the iterator yields exactly one element, that element will be returned, otherwise
+an error will be returned containing an iterator that has the same output as the input
+iterator. Read moresource§fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
+ Self: Sized,
If the iterator yields no elements, Ok(None) will be returned. If the iterator yields
+exactly one element, that element will be returned, otherwise an error will be returned
+containing an iterator that has the same output as the input iterator. Read moresource§fn multipeek(self) -> MultiPeek<Self>where
+ Self: Sized,
An iterator adaptor that allows the user to peek at multiple .next()
+values without advancing the base iterator. Read moresource§fn counts(self) -> HashMap<Self::Item, usize, RandomState>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
Collect the items in this iterator and return a HashMap which
+contains each item that appears in the iterator and the number
+of times it appears. Read moresource§fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where
+ Self: Sized,
+ K: Eq + Hash,
+ F: FnMut(Self::Item) -> K,
Collect the items in this iterator and return a HashMap which
+contains each item that appears in the iterator and the number
+of times it appears,
+determining identity using a keying function. Read moresource§fn multiunzip<FromI>(self) -> FromIwhere
+ Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
+ self,
+ other: J
+) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ self,
+ other: J
+) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
Alternate elements from two iterators until at least one of them has run
+out. Read moresource§fn intersperse(
+ self,
+ element: Self::Item
+) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
+ Self: Sized,
+ Self::Item: Clone,
An iterator adaptor to insert a particular value
+between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+ Self: Sized,
+ F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
+between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+ self,
+ other: J
+) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of elements. Read moresource§fn batching<B, F>(self, f: F) -> Batching<Self, F>where
+ F: FnMut(&mut Self) -> Option<B>,
+ Self: Sized,
A “meta iterator adaptor”. Its closure receives a reference to the
+iterator and may pick off as many elements as it likes, to produce the
+next iterator element. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> K,
+ K: PartialEq<K>,
Return an iterable that can group iterator elements.
+Consecutive elements that map to the same key (“runs”), are assigned
+to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
+ <T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
+a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+ Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
+ T: TupleCollect + Clone,
+ <T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
+elements when the window would otherwise exceed the length of the
+iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
+(up to 12). Read moresource§fn tee(self) -> (Tee<Self>, Tee<Self>)where
+ Self: Sized,
+ Self::Item: Clone,
Split into an iterator pair that both yield all elements from
+the original iterator. Read moresource§fn step(self, n: usize) -> Step<Self>where
+ Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
+for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+ Self: Sized,
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ self,
+ f: F
+) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
+to every Result::Ok value. Result::Err values are
+unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
+value with the provided closure. Result::Err values are
+unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
+Result::Ok value with the provided closure. Result::Err
+values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
+a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn merge<J>(
self,
other: J
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
@@ -287,7 +692,7 @@
Self::Item: PartialOrd<Self::Item>,
J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
ascending order. If both base iterators are sorted (ascending), the
-result is sorted. Read moresource§fn merge_by<J, F>(
self,
other: J,
is_first: F
@@ -295,7 +700,7 @@
Self: Sized,
J: IntoIterator<Item = Self::Item>,
F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F>(
+This is much like .merge() but allows for a custom ordering. Read more
impl<T> Any for Twhere
diff --git a/leo_ast/statement/block/struct.Block.html b/leo_ast/statement/block/struct.Block.html
index 2bbc86ffea..ecf6403c3a 100644
--- a/leo_ast/statement/block/struct.Block.html
+++ b/leo_ast/statement/block/struct.Block.html
@@ -4,8 +4,8 @@
}Expand description
A block { [stmt]* } consisting of a list of statements to execute in order.
Fields§
§statements: Vec<Statement>The list of statements to execute.
§span: SpanThe span from { to }.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Block> for Block
source§fn eq(&self, other: &Block) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Block> for Block
source§impl Eq for Block
source§impl StructuralEq for Block
source§impl StructuralPartialEq for Block
Auto Trait Implementations§
§impl !RefUnwindSafe for Block
§impl Send for Block
§impl !Sync for Block
§impl Unpin for Block
§impl UnwindSafe for Block
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
index 52923bf610..476515b55c 100644
--- a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
+++ b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
@@ -4,8 +4,8 @@
}Expand description
A console logging statement like console.log(...);.
Fields§
§function: ConsoleFunctionThe logging function to run.
§span: SpanThe span excluding the semicolon.
-Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ConsoleStatement
source§impl Eq for ConsoleStatement
source§impl StructuralEq for ConsoleStatement
source§impl StructuralPartialEq for ConsoleStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ConsoleStatement
§impl Send for ConsoleStatement
§impl Sync for ConsoleStatement
§impl Unpin for ConsoleStatement
§impl UnwindSafe for ConsoleStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/expression/struct.ExpressionStatement.html b/leo_ast/statement/expression/struct.ExpressionStatement.html
index 5d411c9f64..e4f7a1084f 100644
--- a/leo_ast/statement/expression/struct.ExpressionStatement.html
+++ b/leo_ast/statement/expression/struct.ExpressionStatement.html
@@ -4,8 +4,8 @@
}Expand description
An expression statement, foo(a);.
Fields§
§expression: ExpressionThe expression associated with the statement.
§span: SpanThe span.
-Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
source§impl Eq for ExpressionStatement
source§impl StructuralEq for ExpressionStatement
source§impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ExpressionStatement
§impl Send for ExpressionStatement
§impl Sync for ExpressionStatement
§impl Unpin for ExpressionStatement
§impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
§block: BlockThe block to run on each iteration.
§span: SpanThe span from for to block.
-Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
source§impl Eq for IterationStatement
source§impl StructuralEq for IterationStatement
source§impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
§impl !RefUnwindSafe for IterationStatement
§impl Send for IterationStatement
§impl !Sync for IterationStatement
§impl Unpin for IterationStatement
§impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
§finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
§span: SpanThe span of return expression excluding the semicolon.
-Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
source§impl Eq for ReturnStatement
source§impl StructuralEq for ReturnStatement
source§impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ReturnStatement
§impl Send for ReturnStatement
§impl Sync for ReturnStatement
§impl Unpin for ReturnStatement
§impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
source§impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’,
but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moreTrait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
This method tests for self and other values to be equal, and is used
+}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read moresource§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
source§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
Self: Sized,
- Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
self,
f: F
) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
- F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
to every Result::Ok value. Result::Err values are
-unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
value with the provided closure. Result::Err values are
-unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+unchanged. Read more
source§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+values are unchanged. Read more
source§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
Self: Iterator<Item = Result<T, E>> + Sized,
T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnOnce(ProcessResults<'_, Self, E>) -> R,
“Lift” a function of the values of the current iterator so as to process
+an iterator of Result values instead. Read moresource§fn merge<J>(
+ self,
+ other: J
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
+ J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
+ascending order. If both base iterators are sorted (ascending), the
+result is sorted. Read moresource§fn merge_by<J, F>(
+ self,
+ other: J,
+ is_first: F
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ J: IntoIterator<Item = Self::Item>,
+ F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F, T>(
+ self,
+ other: J,
+ cmp_fn: F
+) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where
+ J: IntoIterator,
+ F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T,
+ T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>,
+ Self: Sized,
Create an iterator that merges items from both this and the specified
+iterator in ascending order. Read moresource§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them in ascending order. Read moresource§fn kmerge_by<F>(
+ self,
+ first: F
+) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them according to the given closure. Read moresource§fn cartesian_product<J>(
+ self,
+ other: J
+) -> Product<Self, <J as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: Clone,
+ J: IntoIterator,
+ <J as IntoIterator>::IntoIter: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+the element sets of two iterators self and J. Read moresource§fn multi_cartesian_product(
+ self
+) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::IntoIter: Clone,
+ <Self::Item as IntoIterator>::Item: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+all subiterators returned by meta-iterator self. Read moresource§fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where
+ Self: Sized,
+ F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
Return an iterator adaptor that uses the passed-in closure to
+optionally merge together consecutive elements. Read moresource§fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
Remove duplicates from sections of consecutive identical elements.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_by<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements,
+determining equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_with_count(
+ self
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where
+ Self: Sized,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+If the iterator is sorted, all elements will be unique. Read moresource§fn dedup_by_with_count<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+This will determine equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read moresource§fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read moresource§fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read moresource§fn unique(self) -> Unique<Self>where
+ Self: Sized,
+ Self::Item: Clone + Eq + Hash,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Duplicates
+are detected using hash and equality. Read moresource§fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Read moresource§fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where
+ Self: Sized + PeekingNext,
+ F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from this iterator and
+takes items while the closure accept returns true. Read moresource§fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where
+ Self: Clone,
+ F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from a Clone-able iterator
+to only pick off elements while the predicate accept returns true. Read moresource§fn take_while_inclusive<F>(
+ &mut self,
+ accept: F
+) -> TakeWhileInclusive<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> bool,
Returns an iterator adaptor that consumes elements while the given
+predicate is true, including the element for which the predicate
+first returned false. Read moresource§fn while_some<A>(self) -> WhileSome<Self>where
+ Self: Sized + Iterator<Item = Option<A>>,
Return an iterator adaptor that filters Option<A> iterator elements
+and produces A. Stops on the first None encountered. Read moresource§fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where
+ Self: Sized + Clone,
+ Self::Item: Clone,
+ T: HasCombination<Self>,
Return an iterator adaptor that iterates over the combinations of the
+elements from an iterator. Read moresource§fn combinations(self, k: usize) -> Combinations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator adaptor that iterates over the k-length combinations of
+the elements from an iterator. Read moresource§fn combinations_with_replacement(
+ self,
+ k: usize
+) -> CombinationsWithReplacement<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator that iterates over the k-length combinations of
+the elements from an iterator, with replacement. Read moresource§fn permutations(self, k: usize) -> Permutations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator adaptor that iterates over all k-permutations of the
+elements from an iterator. Read moresource§fn powerset(self) -> Powerset<Self>where
+ Self: Sized,
+ Self::Item: Clone,
Return an iterator that iterates through the powerset of the elements from an
+iterator. Read moresource§fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where
+ Self: Sized,
+ F: FnMut(usize) -> Self::Item,
Return an iterator adaptor that pads the sequence to a minimum length of
+min by filling missing elements using a closure f. Read moresource§fn with_position(self) -> WithPosition<Self>where
+ Self: Sized,
Return an iterator adaptor that combines each element with a Position to
+ease special-case handling of the first or last elements. Read moresource§fn positions<P>(self, predicate: P) -> Positions<Self, P>where
+ Self: Sized,
+ P: FnMut(Self::Item) -> bool,
Return an iterator adaptor that yields the indices of all elements
+satisfying a predicate, counted from the start of the iterator. Read moresource§fn update<F>(self, updater: F) -> Update<Self, F>where
+ Self: Sized,
+ F: FnMut(&mut Self::Item),
Return an iterator adaptor that applies a mutating function
+to each element before yielding it. Read moresource§fn next_tuple<T>(&mut self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Advances the iterator and returns the next items grouped in a tuple of
+a specific size (up to 12). Read moresource§fn collect_tuple<T>(self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Collects all items from the iterator into a tuple of a specific size
+(up to 12). Read moresource§fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where
+ P: FnMut(&Self::Item) -> bool,
Find the position and value of the first element satisfying a predicate. Read moresource§fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the last element, if any. Read moresource§fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the first element, if any. Read moresource§fn contains<Q>(&mut self, query: &Q) -> boolwhere
+ Self: Sized,
+ Self::Item: Borrow<Q>,
+ Q: PartialEq<Q>,
Returns true if the given item is present in this iterator. Read moresource§fn all_equal(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
Check whether all elements compare equal. Read moresource§fn all_equal_value(
+ &mut self
+) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
If there are elements and they are all equal, return a single copy of that element.
+If there are no elements, return an Error containing None.
+If there are elements and they are not all equal, return a tuple containing the first
+two non-equal elements found. Read moresource§fn all_unique(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: Eq + Hash,
Check whether all elements are unique (non equal). Read moresource§fn dropping(self, n: usize) -> Selfwhere
+ Self: Sized,
Consume the first n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn dropping_back(self, n: usize) -> Selfwhere
+ Self: Sized + DoubleEndedIterator,
Consume the last n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn foreach<F>(self, f: F)where
+ F: FnMut(Self::Item),
+ Self: Sized,
👎Deprecated since 0.8.0: Use .for_each() insteadRun the closure f eagerly on each element of the iterator. Read moresource§fn concat(self) -> Self::Itemwhere
+ Self: Sized,
+ Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,
source§fn collect_vec(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
.collect_vec() is simply a type specialization of Iterator::collect,
+for convenience.source§fn try_collect<T, U, E>(self) -> Result<U, E>where
+ Self: Sized + Iterator<Item = Result<T, E>>,
+ Result<U, E>: FromIterator<Result<T, E>>,
source§fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere
+ A: 'a,
+ Self: Iterator<Item = &'a mut A>,
+ J: IntoIterator<Item = A>,
Assign to each reference in self from the from iterator,
+stopping at the shortest of the two iterators. Read moresource§fn join(&mut self, sep: &str) -> Stringwhere
+ Self::Item: Display,
Combine all iterator elements into one String, separated by sep. Read moresource§fn format(self, sep: &str) -> Format<'_, Self>where
+ Self: Sized,
Format all iterator elements, separated by sep. Read moresource§fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,
Format all iterator elements, separated by sep. Read moresource§fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
👎Deprecated since 0.10.0: Use .fold_ok() insteadSee .fold_ok().source§fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
Fold Result values from an iterator. Read moresource§fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where
+ Self: Iterator<Item = Option<A>>,
+ F: FnMut(B, A) -> B,
Fold Option values from an iterator. Read moresource§fn fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
👎Deprecated since 0.10.2: Use Iterator::reduce insteadAccumulator of the elements in the iterator. Read moresource§fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
Accumulate the elements in the iterator in a tree-like manner. Read moresource§fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where
+ Self: Sized,
+ F: FnMut(B, Self::Item) -> FoldWhile<B>,
An iterator method that applies a function, producing a single, final value. Read moresource§fn sum1<S>(self) -> Option<S>where
+ Self: Sized,
+ S: Sum<Self::Item>,
Iterate over the entire iterator and add all the elements. Read moresource§fn product1<P>(self) -> Option<P>where
+ Self: Sized,
+ P: Product<Self::Item>,
Iterate over the entire iterator and multiply all the elements. Read moresource§fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read moresource§fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. The key function is
+called exactly once per key. Read moresource§fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Sort the k smallest elements into a new iterator, in ascending order. Read moresource§fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where
+ Self: Sized,
+ F: FnMut(Self::Item) -> Either<L, R>,
+ A: Default + Extend<L>,
+ B: Default + Extend<R>,
Collect all iterator elements into one of two
+partitions. Unlike Iterator::partition, each partition may
+have a distinct type. Read moresource§fn partition_result<A, B, T, E>(self) -> (A, B)where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ A: Default + Extend<T>,
+ B: Default + Extend<E>,
Partition a sequence of Results into one list of all the Ok elements
+and another list of all the Err elements. Read moresource§fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
Return a HashMap of keys mapped to Vecs of values. Keys and values
+are taken from (Key, Value) tuple pairs yielded by the input iterator. Read moresource§fn into_group_map_by<K, V, F>(
+ self,
+ f: F
+) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: Fn(&V) -> K,
Return an Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified
+in the closure. Read moresource§fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
Constructs a GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn into_grouping_map_by<K, V, F>(
+ self,
+ key_mapper: F
+) -> GroupingMap<MapForGrouping<Self, F>>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: FnMut(&V) -> K,
Constructs a GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn min_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Return all minimum elements of an iterator. Read moresource§fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all minimum elements of an iterator, as determined by
+the specified function. Read moresource§fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return all minimum elements of an iterator, as determined by
+the specified function. Read moresource§fn max_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
Return all maximum elements of an iterator. Read moresource§fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all maximum elements of an iterator, as determined by
+the specified function. Read moresource§fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return all maximum elements of an iterator, as determined by
+the specified function. Read moresource§fn minmax(self) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
Return the minimum and maximum elements in the iterator. Read moresource§fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
Return the minimum and maximum element of an iterator, as determined by
+the specified function. Read moresource§fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the minimum and maximum element of an iterator, as determined by
+the specified comparison function. Read moresource§fn position_max(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
Return the position of the maximum element in the iterator. Read moresource§fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return the position of the maximum element in the iterator, as
+determined by the specified function. Read moresource§fn position_max_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the maximum element in the iterator, as
+determined by the specified comparison function. Read moresource§fn position_min(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
Return the position of the minimum element in the iterator. Read moresource§fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
Return the position of the minimum element in the iterator, as
+determined by the specified function. Read moresource§fn position_min_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the minimum element in the iterator, as
+determined by the specified comparison function. Read moresource§fn position_minmax(self) -> MinMaxResult<usize>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
Return the positions of the minimum and maximum elements in
+the iterator. Read moresource§fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified function. Read moresource§fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified comparison function. Read moresource§fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
+ Self: Sized,
If the iterator yields exactly one element, that element will be returned, otherwise
+an error will be returned containing an iterator that has the same output as the input
+iterator. Read moresource§fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
+ Self: Sized,
If the iterator yields no elements, Ok(None) will be returned. If the iterator yields
+exactly one element, that element will be returned, otherwise an error will be returned
+containing an iterator that has the same output as the input iterator. Read moresource§fn multipeek(self) -> MultiPeek<Self>where
+ Self: Sized,
An iterator adaptor that allows the user to peek at multiple .next()
+values without advancing the base iterator. Read moresource§fn counts(self) -> HashMap<Self::Item, usize, RandomState>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
Collect the items in this iterator and return a HashMap which
+contains each item that appears in the iterator and the number
+of times it appears. Read moresource§fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where
+ Self: Sized,
+ K: Eq + Hash,
+ F: FnMut(Self::Item) -> K,
Collect the items in this iterator and return a HashMap which
+contains each item that appears in the iterator and the number
+of times it appears,
+determining identity using a keying function. Read moresource§fn multiunzip<FromI>(self) -> FromIwhere
+ Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
+ self,
+ other: J
+) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ self,
+ other: J
+) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
Alternate elements from two iterators until at least one of them has run
+out. Read moresource§fn intersperse(
+ self,
+ element: Self::Item
+) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
+ Self: Sized,
+ Self::Item: Clone,
An iterator adaptor to insert a particular value
+between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+ Self: Sized,
+ F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
+between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+ self,
+ other: J
+) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of elements. Read moresource§fn batching<B, F>(self, f: F) -> Batching<Self, F>where
+ F: FnMut(&mut Self) -> Option<B>,
+ Self: Sized,
A “meta iterator adaptor”. Its closure receives a reference to the
+iterator and may pick off as many elements as it likes, to produce the
+next iterator element. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> K,
+ K: PartialEq<K>,
Return an iterable that can group iterator elements.
+Consecutive elements that map to the same key (“runs”), are assigned
+to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
+ <T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
+a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+ Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
+ T: TupleCollect + Clone,
+ <T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
+elements when the window would otherwise exceed the length of the
+iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
+(up to 12). Read moresource§fn tee(self) -> (Tee<Self>, Tee<Self>)where
+ Self: Sized,
+ Self::Item: Clone,
Split into an iterator pair that both yield all elements from
+the original iterator. Read moresource§fn step(self, n: usize) -> Step<Self>where
+ Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
+for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+ Self: Sized,
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ self,
+ f: F
+) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
+to every Result::Ok value. Result::Err values are
+unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
+value with the provided closure. Result::Err values are
+unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
+Result::Ok value with the provided closure. Result::Err
+values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ T: IntoIterator,
Return an iterator adaptor that flattens every Result::Ok value into
+a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn merge<J>(
self,
other: J
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
@@ -287,7 +692,7 @@
Self::Item: PartialOrd<Self::Item>,
J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
ascending order. If both base iterators are sorted (ascending), the
-result is sorted. Read moresource§fn merge_by<J, F>(
self,
other: J,
is_first: F
@@ -295,7 +700,7 @@
Self: Sized,
J: IntoIterator<Item = Self::Item>,
F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F>(
+This is much like .merge() but allows for a custom ordering. Read more
Expand description
A block { [stmt]* } consisting of a list of statements to execute in order.
The list of statements to execute.
The span from { to }.
source§impl<'de> Deserialize<'de> for Block
impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq<Block> for Block
impl PartialEq<Block> for Block
source§fn eq(&self, other: &Block) -> bool
fn eq(&self, other: &Block) -> bool
This method tests for
self and other values to be equal, and is used
+Trait Implementations§
source§impl<'de> Deserialize<'de> for Block
impl<'de> Deserialize<'de> for Block
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq<Block> for Block
impl PartialEq<Block> for Block
impl Eq for Block
impl StructuralEq for Block
impl StructuralPartialEq for Block
Auto Trait Implementations§
impl !RefUnwindSafe for Block
impl Send for Block
impl !Sync for Block
impl Unpin for Block
impl UnwindSafe for Block
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
index 52923bf610..476515b55c 100644
--- a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
+++ b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
@@ -4,8 +4,8 @@
}Expand description
A console logging statement like console.log(...);.
Fields§
§function: ConsoleFunctionThe logging function to run.
§span: SpanThe span excluding the semicolon.
-Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ConsoleStatement
source§impl Eq for ConsoleStatement
source§impl StructuralEq for ConsoleStatement
source§impl StructuralPartialEq for ConsoleStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ConsoleStatement
§impl Send for ConsoleStatement
§impl Sync for ConsoleStatement
§impl Unpin for ConsoleStatement
§impl UnwindSafe for ConsoleStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/expression/struct.ExpressionStatement.html b/leo_ast/statement/expression/struct.ExpressionStatement.html
index 5d411c9f64..e4f7a1084f 100644
--- a/leo_ast/statement/expression/struct.ExpressionStatement.html
+++ b/leo_ast/statement/expression/struct.ExpressionStatement.html
@@ -4,8 +4,8 @@
}Expand description
An expression statement, foo(a);.
Fields§
§expression: ExpressionThe expression associated with the statement.
§span: SpanThe span.
-Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
source§impl Eq for ExpressionStatement
source§impl StructuralEq for ExpressionStatement
source§impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ExpressionStatement
§impl Send for ExpressionStatement
§impl Sync for ExpressionStatement
§impl Unpin for ExpressionStatement
§impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
§block: BlockThe block to run on each iteration.
§span: SpanThe span from for to block.
-Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
source§impl Eq for IterationStatement
source§impl StructuralEq for IterationStatement
source§impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
§impl !RefUnwindSafe for IterationStatement
§impl Send for IterationStatement
§impl !Sync for IterationStatement
§impl Unpin for IterationStatement
§impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
§finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
§span: SpanThe span of return expression excluding the semicolon.
-Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
source§impl Eq for ReturnStatement
source§impl StructuralEq for ReturnStatement
source§impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ReturnStatement
§impl Send for ReturnStatement
§impl Sync for ReturnStatement
§impl Unpin for ReturnStatement
§impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
source§impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’,
but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moreTrait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
This method tests for self and other values to be equal, and is used
+}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read moresource§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
source§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
Self: Sized,
- Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
self,
f: F
) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
- F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
to every Result::Ok value. Result::Err values are
-unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
value with the provided closure. Result::Err values are
-unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+unchanged. Read more
source§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+values are unchanged. Read more
impl<T> Any for Twhere
diff --git a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
index 52923bf610..476515b55c 100644
--- a/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
+++ b/leo_ast/statement/console/console_statement/struct.ConsoleStatement.html
@@ -4,8 +4,8 @@
}Expand description
A console logging statement like console.log(...);.
Fields§
§function: ConsoleFunctionThe logging function to run.
§span: SpanThe span excluding the semicolon.
-Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ConsoleStatement
source§impl Eq for ConsoleStatement
source§impl StructuralEq for ConsoleStatement
source§impl StructuralPartialEq for ConsoleStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ConsoleStatement
§impl Send for ConsoleStatement
§impl Sync for ConsoleStatement
§impl Unpin for ConsoleStatement
§impl UnwindSafe for ConsoleStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/expression/struct.ExpressionStatement.html b/leo_ast/statement/expression/struct.ExpressionStatement.html
index 5d411c9f64..e4f7a1084f 100644
--- a/leo_ast/statement/expression/struct.ExpressionStatement.html
+++ b/leo_ast/statement/expression/struct.ExpressionStatement.html
@@ -4,8 +4,8 @@
}Expand description
An expression statement, foo(a);.
Fields§
§expression: ExpressionThe expression associated with the statement.
§span: SpanThe span.
-Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
source§impl Eq for ExpressionStatement
source§impl StructuralEq for ExpressionStatement
source§impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ExpressionStatement
§impl Send for ExpressionStatement
§impl Sync for ExpressionStatement
§impl Unpin for ExpressionStatement
§impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
§block: BlockThe block to run on each iteration.
§span: SpanThe span from for to block.
-Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
source§impl Eq for IterationStatement
source§impl StructuralEq for IterationStatement
source§impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
§impl !RefUnwindSafe for IterationStatement
§impl Send for IterationStatement
§impl !Sync for IterationStatement
§impl Unpin for IterationStatement
§impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
§finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
§span: SpanThe span of return expression excluding the semicolon.
-Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
source§impl Eq for ReturnStatement
source§impl StructuralEq for ReturnStatement
source§impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ReturnStatement
§impl Send for ReturnStatement
§impl Sync for ReturnStatement
§impl Unpin for ReturnStatement
§impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
source§impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’,
but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moreTrait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
This method tests for self and other values to be equal, and is used
+}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read moresource§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
source§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
Self: Sized,
- Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
self,
f: F
) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
- F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() insteadSee .map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
to every Result::Ok value. Result::Err values are
-unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every Result::Ok
value with the provided closure. Result::Err values are
-unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+unchanged. Read more
source§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+values are unchanged. Read more
Expand description
A console logging statement like console.log(...);.
The logging function to run.
The span excluding the semicolon.
-source§impl Clone for ConsoleStatement
impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for ConsoleStatement
impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for ConsoleStatement
impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for
self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ConsoleStatement
impl Clone for ConsoleStatement
source§fn clone(&self) -> ConsoleStatement
fn clone(&self) -> ConsoleStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for ConsoleStatement
impl Debug for ConsoleStatement
source§impl<'de> Deserialize<'de> for ConsoleStatement
impl<'de> Deserialize<'de> for ConsoleStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for ConsoleStatement
impl Display for ConsoleStatement
source§impl Node for ConsoleStatement
impl Node for ConsoleStatement
source§impl PartialEq<ConsoleStatement> for ConsoleStatement
impl PartialEq<ConsoleStatement> for ConsoleStatement
source§fn eq(&self, other: &ConsoleStatement) -> bool
fn eq(&self, other: &ConsoleStatement) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl Serialize for ConsoleStatement
impl Serialize for ConsoleStatement
impl Eq for ConsoleStatement
impl StructuralEq for ConsoleStatement
impl StructuralPartialEq for ConsoleStatement
Auto Trait Implementations§
impl RefUnwindSafe for ConsoleStatement
impl Send for ConsoleStatement
impl Sync for ConsoleStatement
impl Unpin for ConsoleStatement
impl UnwindSafe for ConsoleStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/expression/struct.ExpressionStatement.html b/leo_ast/statement/expression/struct.ExpressionStatement.html
index 5d411c9f64..e4f7a1084f 100644
--- a/leo_ast/statement/expression/struct.ExpressionStatement.html
+++ b/leo_ast/statement/expression/struct.ExpressionStatement.html
@@ -4,8 +4,8 @@
}Expand description
An expression statement, foo(a);.
Fields§
§expression: ExpressionThe expression associated with the statement.
§span: SpanThe span.
-Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
source§impl Eq for ExpressionStatement
source§impl StructuralEq for ExpressionStatement
source§impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ExpressionStatement
§impl Send for ExpressionStatement
§impl Sync for ExpressionStatement
§impl Unpin for ExpressionStatement
§impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
§block: BlockThe block to run on each iteration.
§span: SpanThe span from for to block.
-Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
source§impl Eq for IterationStatement
source§impl StructuralEq for IterationStatement
source§impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
§impl !RefUnwindSafe for IterationStatement
§impl Send for IterationStatement
§impl !Sync for IterationStatement
§impl Unpin for IterationStatement
§impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
§finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
§span: SpanThe span of return expression excluding the semicolon.
-Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
source§impl Eq for ReturnStatement
source§impl StructuralEq for ReturnStatement
source§impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ReturnStatement
§impl Send for ReturnStatement
§impl Sync for ReturnStatement
§impl Unpin for ReturnStatement
§impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
source§impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’,
but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moreTrait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
This method tests for self and other values to be equal, and is used
+}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read moresource§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
impl<T> Any for Twhere
diff --git a/leo_ast/statement/expression/struct.ExpressionStatement.html b/leo_ast/statement/expression/struct.ExpressionStatement.html
index 5d411c9f64..e4f7a1084f 100644
--- a/leo_ast/statement/expression/struct.ExpressionStatement.html
+++ b/leo_ast/statement/expression/struct.ExpressionStatement.html
@@ -4,8 +4,8 @@
}Expand description
An expression statement, foo(a);.
Fields§
§expression: ExpressionThe expression associated with the statement.
§span: SpanThe span.
-Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
source§impl Eq for ExpressionStatement
source§impl StructuralEq for ExpressionStatement
source§impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ExpressionStatement
§impl Send for ExpressionStatement
§impl Sync for ExpressionStatement
§impl Unpin for ExpressionStatement
§impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
§block: BlockThe block to run on each iteration.
§span: SpanThe span from for to block.
-Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IterationStatement
source§impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
source§impl Eq for IterationStatement
source§impl StructuralEq for IterationStatement
source§impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
§impl !RefUnwindSafe for IterationStatement
§impl Send for IterationStatement
§impl !Sync for IterationStatement
§impl Unpin for IterationStatement
§impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
§finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
§span: SpanThe span of return expression excluding the semicolon.
-Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for ReturnStatement
source§impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
This method tests for self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
source§impl Eq for ReturnStatement
source§impl StructuralEq for ReturnStatement
source§impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
§impl RefUnwindSafe for ReturnStatement
§impl Send for ReturnStatement
§impl Sync for ReturnStatement
§impl Unpin for ReturnStatement
§impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
source§impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’,
but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
-Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moreTrait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
This method tests for self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
This method tests for self and other values to be equal, and is used
+}Variants§
§Input(Type, Identifier)
§Address(String, Span)
§Boolean(bool, Span)
§Struct(Identifier, IndexMap<Symbol, Value>)
§Field(String, Span)
§Group(Box<GroupLiteral>)
§I8(i8, Span)
§I16(i16, Span)
§I32(i32, Span)
§I64(i64, Span)
§I128(i128, Span)
§U8(u8, Span)
§U16(u16, Span)
§U32(u32, Span)
§U64(u64, Span)
§U128(u128, Span)
§Scalar(String, Span)
§String(String, Span)
Implementations§
source§impl Value
sourcepub(crate) fn abs(self, span: Span) -> Result<Self>
sourcepub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
sourcepub(crate) fn neg(self, span: Span) -> Result<Self>
sourcepub(crate) fn not(self, span: Span) -> Result<Self>
sourcepub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
sourcepub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl Eq for Value
source§impl StructuralEq for Value
source§impl StructuralPartialEq for Value
Auto Trait Implementations§
§impl RefUnwindSafe for Value
§impl Send for Value
§impl Sync for Value
§impl Unpin for Value
§impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read moresource§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read moresource§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read moresource§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read moresource§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
Return an iterable that can chunk the iterator. Read moresource§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read moresource§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read moresource§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read moresource§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() insteadReturn an iterator adaptor that steps n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
Expand description
An expression statement, foo(a);.
The expression associated with the statement.
The span.
-source§impl Clone for ExpressionStatement
impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for ExpressionStatement
impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for ExpressionStatement
impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for
self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ExpressionStatement
impl Clone for ExpressionStatement
source§fn clone(&self) -> ExpressionStatement
fn clone(&self) -> ExpressionStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for ExpressionStatement
impl Debug for ExpressionStatement
source§impl<'de> Deserialize<'de> for ExpressionStatement
impl<'de> Deserialize<'de> for ExpressionStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for ExpressionStatement
impl Display for ExpressionStatement
source§impl Node for ExpressionStatement
impl Node for ExpressionStatement
source§impl PartialEq<ExpressionStatement> for ExpressionStatement
impl PartialEq<ExpressionStatement> for ExpressionStatement
source§fn eq(&self, other: &ExpressionStatement) -> bool
fn eq(&self, other: &ExpressionStatement) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl Serialize for ExpressionStatement
impl Serialize for ExpressionStatement
impl Eq for ExpressionStatement
impl StructuralEq for ExpressionStatement
impl StructuralPartialEq for ExpressionStatement
Auto Trait Implementations§
impl RefUnwindSafe for ExpressionStatement
impl Send for ExpressionStatement
impl Sync for ExpressionStatement
impl Unpin for ExpressionStatement
impl UnwindSafe for ExpressionStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
impl<T> Any for Twhere
diff --git a/leo_ast/statement/iteration/struct.IterationStatement.html b/leo_ast/statement/iteration/struct.IterationStatement.html
index 338ab5560a..952092ec70 100644
--- a/leo_ast/statement/iteration/struct.IterationStatement.html
+++ b/leo_ast/statement/iteration/struct.IterationStatement.html
@@ -19,8 +19,8 @@
Signified with = when parsing.
block: BlockThe block to run on each iteration.
span: SpanThe span from for to block.
Trait Implementations§
source§impl Clone for IterationStatement
impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for IterationStatement
impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for IterationStatement
impl Display for IterationStatement
source§impl Node for IterationStatement
impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
fn eq(&self, other: &IterationStatement) -> bool
This method tests for
self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for IterationStatement
impl Clone for IterationStatement
source§fn clone(&self) -> IterationStatement
fn clone(&self) -> IterationStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for IterationStatement
impl Debug for IterationStatement
source§impl<'de> Deserialize<'de> for IterationStatement
impl<'de> Deserialize<'de> for IterationStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for IterationStatement
impl Display for IterationStatement
source§impl Node for IterationStatement
impl Node for IterationStatement
source§impl PartialEq<IterationStatement> for IterationStatement
impl PartialEq<IterationStatement> for IterationStatement
source§fn eq(&self, other: &IterationStatement) -> bool
fn eq(&self, other: &IterationStatement) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl Serialize for IterationStatement
impl Serialize for IterationStatement
impl Eq for IterationStatement
impl StructuralEq for IterationStatement
impl StructuralPartialEq for IterationStatement
Auto Trait Implementations§
impl !RefUnwindSafe for IterationStatement
impl Send for IterationStatement
impl !Sync for IterationStatement
impl Unpin for IterationStatement
impl UnwindSafe for IterationStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html
index 796cd22def..4232751b74 100644
--- a/leo_ast/statement/return_/struct.ReturnStatement.html
+++ b/leo_ast/statement/return_/struct.ReturnStatement.html
@@ -6,8 +6,8 @@
impl<T> Any for Twhere diff --git a/leo_ast/statement/return_/struct.ReturnStatement.html b/leo_ast/statement/return_/struct.ReturnStatement.html index 796cd22def..4232751b74 100644 --- a/leo_ast/statement/return_/struct.ReturnStatement.html +++ b/leo_ast/statement/return_/struct.ReturnStatement.html @@ -6,8 +6,8 @@
Fields§
§expression: ExpressionThe expression to return to the function caller.
finalize_arguments: Option<Vec<Expression>>Arguments to the finalize block.
span: SpanThe span of return expression excluding the semicolon.
Trait Implementations§
source§impl Clone for ReturnStatement
impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for ReturnStatement
impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for ReturnStatement
impl Display for ReturnStatement
source§impl Node for ReturnStatement
impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
fn eq(&self, other: &ReturnStatement) -> bool
This method tests for
self and other values to be equal, and is used
+Trait Implementations§
source§impl Clone for ReturnStatement
impl Clone for ReturnStatement
source§fn clone(&self) -> ReturnStatement
fn clone(&self) -> ReturnStatement
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for ReturnStatement
impl Debug for ReturnStatement
source§impl<'de> Deserialize<'de> for ReturnStatement
impl<'de> Deserialize<'de> for ReturnStatement
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for ReturnStatement
impl Display for ReturnStatement
source§impl Node for ReturnStatement
impl Node for ReturnStatement
source§impl PartialEq<ReturnStatement> for ReturnStatement
impl PartialEq<ReturnStatement> for ReturnStatement
source§fn eq(&self, other: &ReturnStatement) -> bool
fn eq(&self, other: &ReturnStatement) -> bool
This method tests for
self and other values to be equal, and is used
by ==.source§impl Serialize for ReturnStatement
impl Serialize for ReturnStatement
impl Eq for ReturnStatement
impl StructuralEq for ReturnStatement
impl StructuralPartialEq for ReturnStatement
Auto Trait Implementations§
impl RefUnwindSafe for ReturnStatement
impl Send for ReturnStatement
impl Sync for ReturnStatement
impl Unpin for ReturnStatement
impl UnwindSafe for ReturnStatement
Blanket Implementations§
source§impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
impl<T> Any for Twhere
diff --git a/leo_ast/types/integer_type/enum.IntegerType.html b/leo_ast/types/integer_type/enum.IntegerType.html
index 1cb56c6b28..5ecba89b7e 100644
--- a/leo_ast/types/integer_type/enum.IntegerType.html
+++ b/leo_ast/types/integer_type/enum.IntegerType.html
@@ -12,8 +12,8 @@
}Expand description
Explicit integer type.
Variants§
Implementations§
Trait Implementations§
source§impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
Returns a copy of the value. Read more1.0.0 · source§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read moresource§impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read moresource§impl Display for IntegerType
Expand description
Explicit integer type.
source§impl Clone for IntegerType
impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
fn clone(&self) -> IntegerType
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for IntegerType
impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for IntegerType
impl Display for IntegerType
Trait Implementations§
source§impl Clone for IntegerType
impl Clone for IntegerType
source§fn clone(&self) -> IntegerType
fn clone(&self) -> IntegerType
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl Debug for IntegerType
impl Debug for IntegerType
source§impl<'de> Deserialize<'de> for IntegerType
impl<'de> Deserialize<'de> for IntegerType
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Display for IntegerType
impl Display for IntegerType
source§impl Hash for IntegerType
impl Hash for IntegerType
source§impl PartialEq<IntegerType> for IntegerType
impl PartialEq<IntegerType> for IntegerType
source§fn eq(&self, other: &IntegerType) -> bool
fn eq(&self, other: &IntegerType) -> bool
This method tests for
self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
fn ne(&self, other: &Rhs) -> bool
This method tests for
!=. The default implementation is almost always
diff --git a/leo_ast/types/tuple/struct.Tuple.html b/leo_ast/types/tuple/struct.Tuple.html
index 22e45f2d9d..b5503fbb59 100644
--- a/leo_ast/types/tuple/struct.Tuple.html
+++ b/leo_ast/types/tuple/struct.Tuple.html
@@ -2274,8 +2274,8 @@ Examples
ASCII letters ‘A’ to ‘Z’ are mapped to ‘a’ to ‘z’, but non-ASCII letters are unchanged.
To lowercase the value in-place, use make_ascii_lowercase.
Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
- __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where - __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Trait Implementations§
source§impl<'de> Deserialize<'de> for Tuple
impl<'de> Deserialize<'de> for Tuple
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+ __D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where + __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl PartialEq<Tuple> for Tuple
impl PartialEq<Tuple> for Tuple
source§fn eq(&self, other: &Tuple) -> bool
fn eq(&self, other: &Tuple) -> bool
This method tests for
self and other values to be equal, and is used
by ==.1.0.0 · source§fn ne(&self, other: &Rhs) -> bool
fn ne(&self, other: &Rhs) -> bool
This method tests for § § § § § § § § § § § § § § § § § §
source source source source source source source source source source source source source source source source source source source source source source source source source source source
source§ source§ source§ § § § § §
!=. The default implementation is almost always
diff --git a/leo_ast/value/enum.Value.html b/leo_ast/value/enum.Value.html
index cd127df0e5..112b5315bc 100644
--- a/leo_ast/value/enum.Value.html
+++ b/leo_ast/value/enum.Value.html
@@ -17,10 +17,10 @@
U128(u128, Span),
Scalar(String, Span),
String(String, Span),
-}Variants§
Input(Type, Identifier)
Address(String, Span)
Boolean(bool, Span)
Struct(Identifier, IndexMap<Symbol, Value>)
Field(String, Span)
Group(Box<GroupLiteral>)
I8(i8, Span)
I16(i16, Span)
I32(i32, Span)
I64(i64, Span)
I128(i128, Span)
U8(u8, Span)
U16(u16, Span)
U32(u32, Span)
U64(u64, Span)
U128(u128, Span)
Scalar(String, Span)
String(String, Span)
Implementations§
source§impl Value
impl Value
pub(crate) fn abs(self, span: Span) -> Result<Self>
pub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
pub(crate) fn neg(self, span: Span) -> Result<Self>
pub(crate) fn not(self, span: Span) -> Result<Self>
pub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
impl PartialEq<Value> for Value
source§fn eq(&self, other: &Value) -> bool
fn eq(&self, other: &Value) -> bool
This method tests for § § § § § § § § § § § § § § § § § §
source source source source source source source source source source source source source source source source source source source source source source source source source source source
source§ source§ source§ § § § § §
self and other values to be equal, and is used
+}Variants§
Input(Type, Identifier)
Address(String, Span)
Boolean(bool, Span)
Struct(Identifier, IndexMap<Symbol, Value>)
Field(String, Span)
Group(Box<GroupLiteral>)
I8(i8, Span)
I16(i16, Span)
I32(i32, Span)
I64(i64, Span)
I128(i128, Span)
U8(u8, Span)
U16(u16, Span)
U32(u32, Span)
U64(u64, Span)
U128(u128, Span)
Scalar(String, Span)
String(String, Span)
Implementations§
source§impl Value
impl Value
pub(crate) fn abs(self, span: Span) -> Result<Self>
pub(crate) fn abs_wrapped(self, span: Span) -> Result<Self>
pub(crate) fn neg(self, span: Span) -> Result<Self>
pub(crate) fn not(self, span: Span) -> Result<Self>
pub(crate) fn add(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn add_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn bitand(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn div(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn div_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn eq(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn ge(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn gt(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn le(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn lt(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn mul(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn mul_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn bitor(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn pow(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn pow_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn shl(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn shl_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn shr(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn shr_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn sub(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn sub_wrapped(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn xor(self, other: Self, span: Span) -> Result<Self>
pub(crate) fn is_supported_const_fold_type(&self) -> bool
Trait Implementations§
source§impl PartialEq<Value> for Value
impl PartialEq<Value> for Value
impl Eq for Value
impl StructuralEq for Value
impl StructuralPartialEq for Value
Auto Trait Implementations§
impl RefUnwindSafe for Value
impl Send for Value
impl Sync for Value
impl Unpin for Value
impl UnwindSafe for Value
Blanket Implementations§
impl Eq for Value
impl StructuralEq for Value
impl StructuralPartialEq for Value
Auto Trait Implementations§
impl RefUnwindSafe for Value
impl Send for Value
impl Sync for Value
impl Unpin for Value
impl UnwindSafe for Value
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
impl<Q, K> Equivalent<K> for Qwhere
diff --git a/leo_package/package/static.CALLSITE.html b/leo_package/package/static.CALLSITE.html
index 4948686424..14a2607f9c 100644
--- a/leo_package/package/static.CALLSITE.html
+++ b/leo_package/package/static.CALLSITE.html
@@ -1 +1 @@
-CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
CALLSITE in leo_package::package - Rust Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsite
RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
Static leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsiteStatic leo_package::package::CALLSITE
source · static CALLSITE: DefaultCallsiteStruct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
+RangeIterator in leo_passes::loop_unrolling::range_iterator - Rust Struct leo_passes::loop_unrolling::range_iterator::RangeIterator
source · pub(crate) struct RangeIterator<I: LoopBound> {
end: I,
current: Option<I>,
clusivity: Clusivity,
@@ -200,86 +200,491 @@
rng: &mut R,
amount: usize
) -> Vec<Self::Item, Global>where
- R: Rng + ?Sized,
amount values at random from the iterator into a vector. Read moresource§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
source§fn interleave<J>(
self,
other: J
) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
- Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
+ Self: Sized,
Alternate elements from two iterators until both have run out. Read moresource§fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
Alternate elements from two iterators until at least one of them has run
-out. Read moresource§fn intersperse(
+out. Read more
source§fn intersperse(
self,
element: Self::Item
) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
-between each element of the adapted iterator. Read moresource§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
Self: Sized,
F: FnMut() -> Self::Item,
fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where Self: Sized, F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
-between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
+between each element of the adapted iterator. Read more
fn zip_longest<J>( +between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
self,
other: J
) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
fn zip_longest<J>( self, other: J ) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of two optional elements. Read more
source§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
J: IntoIterator,
Self: Sized,
fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where J: IntoIterator, Self: Sized,
Create an iterator which iterates over both this and the specified
-iterator simultaneously, yielding pairs of elements. Read more
source§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq<K>,
fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where Self: Sized, F: FnMut(&Self::Item) -> K, K: PartialEq<K>,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
-to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
- Self: Sized,
fn chunks(self, size: usize) -> IntoChunks<Self>where - Self: Sized,
Return an iterable that can chunk the iterator. Read more
source§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+to the same group. Read more
fn tuple_windows<T>(self) -> TupleWindows<Self, T>where +to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
fn chunks(self, size: usize) -> IntoChunks<Self>where + Self: Sized,
Return an iterable that can chunk the iterator. Read more
source§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
<T as TupleCollect>::Item: Clone,
fn tuple_windows<T>(self) -> TupleWindows<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple, <T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
-a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+a specific size (up to 12). Read more
fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where +a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
<T as TupleCollect>::Item: Clone,
fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator, T: TupleCollect + Clone, <T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
-iterator, producing tuples of a specific size (up to 12). Read more
source§fn tuples<T>(self) -> Tuples<Self, T>where
Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
T: HomogeneousTuple,
fn tuples<T>(self) -> Tuples<Self, T>where Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
-(up to 12). Read more
source§fn step(self, n: usize) -> Step<Self>where
Self: Sized,
fn step(self, n: usize) -> Step<Self>where Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps
n elements in the base iterator
-for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+for each iteration. Read more
fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where +for each iteration. Read more
source§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
Self: Sized,
- Self::Item: Into<R>,
fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where Self: Sized, - Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ Self::Item: Into<R>,
fn map_results<F, T, U, E>( + Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
self,
f: F
) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
- F: FnMut(T) -> U,
fn map_results<F, T, U, E>( self, f: F ) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, - F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
See
.map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ F: FnMut(T) -> U,
fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where + F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
See
.map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
to every
Result::Ok value. Result::Err values are
-unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every
Result::Ok
value with the provided closure. Result::Err values are
-unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+unchanged. Read more
fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where +unchanged. Read more
source§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where Self: Iterator<Item = Result<T, E>> + Sized, F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
Result::Ok value with the provided closure. Result::Err
-values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+values are unchanged. Read more
fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where +values are unchanged. Read more
source§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
Self: Iterator<Item = Result<T, E>> + Sized,
T: IntoIterator,
fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where Self: Iterator<Item = Result<T, E>> + Sized, T: IntoIterator,
Return an iterator adaptor that flattens every
Result::Ok value into
-a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnOnce(ProcessResults<'_, Self, E>) -> R,
fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnOnce(ProcessResults<'_, Self, E>) -> R,
“Lift” a function of the values of the current iterator so as to process
+an iterator of
Result values instead. Read moresource§fn merge<J>(
+ self,
+ other: J
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
+ J: IntoIterator<Item = Self::Item>,
fn merge<J>( + self, + other: J +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where + Self: Sized, + Self::Item: PartialOrd<Self::Item>, + J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
+ascending order. If both base iterators are sorted (ascending), the
+result is sorted. Read more
source§fn merge_by<J, F>(
+ self,
+ other: J,
+ is_first: F
+) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ J: IntoIterator<Item = Self::Item>,
+ F: FnMut(&Self::Item, &Self::Item) -> bool,
fn merge_by<J, F>( + self, + other: J, + is_first: F +) -> MergeBy<Self, <J as IntoIterator>::IntoIter, F>where + Self: Sized, + J: IntoIterator<Item = Self::Item>, + F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F, T>(
+ self,
+ other: J,
+ cmp_fn: F
+) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where
+ J: IntoIterator,
+ F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T,
+ T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>,
+ Self: Sized,
fn merge_join_by<J, F, T>( + self, + other: J, + cmp_fn: F +) -> MergeJoinBy<Self, <J as IntoIterator>::IntoIter, F>where + J: IntoIterator, + F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> T, + T: OrderingOrBool<Self::Item, <J as IntoIterator>::Item>, + Self: Sized,
Create an iterator that merges items from both this and the specified
+iterator in ascending order. Read more
source§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where + Self: Sized, + Self::Item: IntoIterator, + <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them in ascending order. Read more
source§fn kmerge_by<F>(
+ self,
+ first: F
+) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
fn kmerge_by<F>( + self, + first: F +) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where + Self: Sized, + Self::Item: IntoIterator, + F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
Return an iterator adaptor that flattens an iterator of iterators by
+merging them according to the given closure. Read more
source§fn cartesian_product<J>(
+ self,
+ other: J
+) -> Product<Self, <J as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: Clone,
+ J: IntoIterator,
+ <J as IntoIterator>::IntoIter: Clone,
fn cartesian_product<J>( + self, + other: J +) -> Product<Self, <J as IntoIterator>::IntoIter>where + Self: Sized, + Self::Item: Clone, + J: IntoIterator, + <J as IntoIterator>::IntoIter: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+the element sets of two iterators
self and J. Read moresource§fn multi_cartesian_product(
+ self
+) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where
+ Self: Sized,
+ Self::Item: IntoIterator,
+ <Self::Item as IntoIterator>::IntoIter: Clone,
+ <Self::Item as IntoIterator>::Item: Clone,
fn multi_cartesian_product( + self +) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where + Self: Sized, + Self::Item: IntoIterator, + <Self::Item as IntoIterator>::IntoIter: Clone, + <Self::Item as IntoIterator>::Item: Clone,
Return an iterator adaptor that iterates over the cartesian product of
+all subiterators returned by meta-iterator
self. Read moresource§fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where
+ Self: Sized,
+ F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where + Self: Sized, + F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
Return an iterator adaptor that uses the passed-in closure to
+optionally merge together consecutive elements. Read more
source§fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where + Self: Sized, + Self::Item: PartialEq<Self::Item>,
Remove duplicates from sections of consecutive identical elements.
+If the iterator is sorted, all elements will be unique. Read more
source§fn dedup_by<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
fn dedup_by<Cmp>( + self, + cmp: Cmp +) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where + Self: Sized, + Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements,
+determining equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read more
source§fn dedup_with_count(
+ self
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where
+ Self: Sized,
fn dedup_with_count( + self +) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where + Self: Sized,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+If the iterator is sorted, all elements will be unique. Read more
source§fn dedup_by_with_count<Cmp>(
+ self,
+ cmp: Cmp
+) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where
+ Self: Sized,
+ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
fn dedup_by_with_count<Cmp>( + self, + cmp: Cmp +) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where + Self: Sized, + Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
+how many repeated elements were present.
+This will determine equality using a comparison function.
+If the iterator is sorted, all elements will be unique. Read more
source§fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
fn duplicates(self) -> DuplicatesBy<Self, Self::Item, ById>where + Self: Sized, + Self::Item: Eq + Hash,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read more
source§fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, ByFn<F>>where + Self: Sized, + V: Eq + Hash, + F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that produces elements that appear more than once during the
+iteration. Duplicates are detected using hash and equality. Read more
source§fn unique(self) -> Unique<Self>where
+ Self: Sized,
+ Self::Item: Clone + Eq + Hash,
fn unique(self) -> Unique<Self>where + Self: Sized, + Self::Item: Clone + Eq + Hash,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Duplicates
+are detected using hash and equality. Read more
source§fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where
+ Self: Sized,
+ V: Eq + Hash,
+ F: FnMut(&Self::Item) -> V,
fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>where + Self: Sized, + V: Eq + Hash, + F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that filters out elements that have
+already been produced once during the iteration. Read more
source§fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where
+ Self: Sized + PeekingNext,
+ F: FnMut(&Self::Item) -> bool,
fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>where + Self: Sized + PeekingNext, + F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from this iterator and
+takes items while the closure
accept returns true. Read moresource§fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where
+ Self: Clone,
+ F: FnMut(&Self::Item) -> bool,
fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>where + Self: Clone, + F: FnMut(&Self::Item) -> bool,
Return an iterator adaptor that borrows from a
Clone-able iterator
+to only pick off elements while the predicate accept returns true. Read moresource§fn take_while_inclusive<F>(
+ &mut self,
+ accept: F
+) -> TakeWhileInclusive<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> bool,
fn take_while_inclusive<F>( + &mut self, + accept: F +) -> TakeWhileInclusive<'_, Self, F>where + Self: Sized, + F: FnMut(&Self::Item) -> bool,
Returns an iterator adaptor that consumes elements while the given
+predicate is
true, including the element for which the predicate
+first returned false. Read moresource§fn while_some<A>(self) -> WhileSome<Self>where
+ Self: Sized + Iterator<Item = Option<A>>,
fn while_some<A>(self) -> WhileSome<Self>where + Self: Sized + Iterator<Item = Option<A>>,
Return an iterator adaptor that filters
Option<A> iterator elements
+and produces A. Stops on the first None encountered. Read moresource§fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where
+ Self: Sized + Clone,
+ Self::Item: Clone,
+ T: HasCombination<Self>,
fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>where + Self: Sized + Clone, + Self::Item: Clone, + T: HasCombination<Self>,
Return an iterator adaptor that iterates over the combinations of the
+elements from an iterator. Read more
source§fn combinations(self, k: usize) -> Combinations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
fn combinations(self, k: usize) -> Combinations<Self>where + Self: Sized, + Self::Item: Clone,
Return an iterator adaptor that iterates over the
k-length combinations of
+the elements from an iterator. Read moresource§fn combinations_with_replacement(
+ self,
+ k: usize
+) -> CombinationsWithReplacement<Self>where
+ Self: Sized,
+ Self::Item: Clone,
fn combinations_with_replacement( + self, + k: usize +) -> CombinationsWithReplacement<Self>where + Self: Sized, + Self::Item: Clone,
Return an iterator that iterates over the
k-length combinations of
+the elements from an iterator, with replacement. Read moresource§fn permutations(self, k: usize) -> Permutations<Self>where
+ Self: Sized,
+ Self::Item: Clone,
fn permutations(self, k: usize) -> Permutations<Self>where + Self: Sized, + Self::Item: Clone,
Return an iterator adaptor that iterates over all k-permutations of the
+elements from an iterator. Read more
source§fn powerset(self) -> Powerset<Self>where
+ Self: Sized,
+ Self::Item: Clone,
fn powerset(self) -> Powerset<Self>where + Self: Sized, + Self::Item: Clone,
Return an iterator that iterates through the powerset of the elements from an
+iterator. Read more
source§fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where
+ Self: Sized,
+ F: FnMut(usize) -> Self::Item,
fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>where + Self: Sized, + F: FnMut(usize) -> Self::Item,
Return an iterator adaptor that pads the sequence to a minimum length of
+
min by filling missing elements using a closure f. Read moresource§fn with_position(self) -> WithPosition<Self>where
+ Self: Sized,
fn with_position(self) -> WithPosition<Self>where + Self: Sized,
Return an iterator adaptor that combines each element with a
Position to
+ease special-case handling of the first or last elements. Read moresource§fn positions<P>(self, predicate: P) -> Positions<Self, P>where
+ Self: Sized,
+ P: FnMut(Self::Item) -> bool,
fn positions<P>(self, predicate: P) -> Positions<Self, P>where + Self: Sized, + P: FnMut(Self::Item) -> bool,
Return an iterator adaptor that yields the indices of all elements
+satisfying a predicate, counted from the start of the iterator. Read more
source§fn update<F>(self, updater: F) -> Update<Self, F>where
+ Self: Sized,
+ F: FnMut(&mut Self::Item),
fn update<F>(self, updater: F) -> Update<Self, F>where + Self: Sized, + F: FnMut(&mut Self::Item),
Return an iterator adaptor that applies a mutating function
+to each element before yielding it. Read more
source§fn next_tuple<T>(&mut self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
fn next_tuple<T>(&mut self) -> Option<T>where + Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + T: HomogeneousTuple,
Advances the iterator and returns the next items grouped in a tuple of
+a specific size (up to 12). Read more
source§fn collect_tuple<T>(self) -> Option<T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
fn collect_tuple<T>(self) -> Option<T>where + Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + T: HomogeneousTuple,
Collects all items from the iterator into a tuple of a specific size
+(up to 12). Read more
source§fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where
+ P: FnMut(&Self::Item) -> bool,
fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where + P: FnMut(&Self::Item) -> bool,
Find the position and value of the first element satisfying a predicate. Read more
source§fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the last element, if any. Read more
source§fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where
+ Self: Sized,
+ P: FnMut(&Self::Item) -> bool,
fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where + Self: Sized, + P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the first element, if any. Read more
source§fn contains<Q>(&mut self, query: &Q) -> boolwhere
+ Self: Sized,
+ Self::Item: Borrow<Q>,
+ Q: PartialEq<Q>,
fn contains<Q>(&mut self, query: &Q) -> boolwhere + Self: Sized, + Self::Item: Borrow<Q>, + Q: PartialEq<Q>,
Returns
true if the given item is present in this iterator. Read moresource§fn all_equal(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
fn all_equal(&mut self) -> boolwhere + Self: Sized, + Self::Item: PartialEq<Self::Item>,
Check whether all elements compare equal. Read more
source§fn all_equal_value(
+ &mut self
+) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where
+ Self: Sized,
+ Self::Item: PartialEq<Self::Item>,
fn all_equal_value( + &mut self +) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where + Self: Sized, + Self::Item: PartialEq<Self::Item>,
If there are elements and they are all equal, return a single copy of that element.
+If there are no elements, return an Error containing None.
+If there are elements and they are not all equal, return a tuple containing the first
+two non-equal elements found. Read more
source§fn all_unique(&mut self) -> boolwhere
+ Self: Sized,
+ Self::Item: Eq + Hash,
fn all_unique(&mut self) -> boolwhere + Self: Sized, + Self::Item: Eq + Hash,
Check whether all elements are unique (non equal). Read more
source§fn dropping(self, n: usize) -> Selfwhere
+ Self: Sized,
fn dropping(self, n: usize) -> Selfwhere + Self: Sized,
Consume the first
n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn dropping_back(self, n: usize) -> Selfwhere
+ Self: Sized + DoubleEndedIterator,
fn dropping_back(self, n: usize) -> Selfwhere + Self: Sized + DoubleEndedIterator,
Consume the last
n elements from the iterator eagerly,
+and return the same iterator again. Read moresource§fn foreach<F>(self, f: F)where
+ F: FnMut(Self::Item),
+ Self: Sized,
fn foreach<F>(self, f: F)where + F: FnMut(Self::Item), + Self: Sized,
👎Deprecated since 0.8.0: Use .for_each() instead
Run the closure
f eagerly on each element of the iterator. Read moresource§fn concat(self) -> Self::Itemwhere
+ Self: Sized,
+ Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,
fn concat(self) -> Self::Itemwhere + Self: Sized, + Self::Item: Extend<<Self::Item as IntoIterator>::Item> + IntoIterator + Default,
source§fn collect_vec(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
fn collect_vec(self) -> Vec<Self::Item, Global>where + Self: Sized,
.collect_vec() is simply a type specialization of Iterator::collect,
+for convenience.source§fn try_collect<T, U, E>(self) -> Result<U, E>where
+ Self: Sized + Iterator<Item = Result<T, E>>,
+ Result<U, E>: FromIterator<Result<T, E>>,
fn try_collect<T, U, E>(self) -> Result<U, E>where + Self: Sized + Iterator<Item = Result<T, E>>, + Result<U, E>: FromIterator<Result<T, E>>,
source§fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere
+ A: 'a,
+ Self: Iterator<Item = &'a mut A>,
+ J: IntoIterator<Item = A>,
fn set_from<'a, A, J>(&mut self, from: J) -> usizewhere + A: 'a, + Self: Iterator<Item = &'a mut A>, + J: IntoIterator<Item = A>,
Assign to each reference in
self from the from iterator,
+stopping at the shortest of the two iterators. Read moresource§fn join(&mut self, sep: &str) -> Stringwhere
+ Self::Item: Display,
fn join(&mut self, sep: &str) -> Stringwhere + Self::Item: Display,
Combine all iterator elements into one String, separated by
sep. Read moresource§fn format(self, sep: &str) -> Format<'_, Self>where
+ Self: Sized,
fn format(self, sep: &str) -> Format<'_, Self>where + Self: Sized,
Format all iterator elements, separated by
sep. Read moresource§fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where
+ Self: Sized,
+ F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,
fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where + Self: Sized, + F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result<(), Error>) -> Result<(), Error>,
Format all iterator elements, separated by
sep. Read moresource§fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + Self: Iterator<Item = Result<A, E>>, + F: FnMut(B, A) -> B,
👎Deprecated since 0.10.0: Use .fold_ok() instead
See
.fold_ok().source§fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
+ Self: Iterator<Item = Result<A, E>>,
+ F: FnMut(B, A) -> B,
fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where + Self: Iterator<Item = Result<A, E>>, + F: FnMut(B, A) -> B,
Fold
Result values from an iterator. Read moresource§fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where
+ Self: Iterator<Item = Option<A>>,
+ F: FnMut(B, A) -> B,
fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where + Self: Iterator<Item = Option<A>>, + F: FnMut(B, A) -> B,
Fold
Option values from an iterator. Read moresource§fn fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
fn fold1<F>(self, f: F) -> Option<Self::Item>where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,
👎Deprecated since 0.10.2: Use
Iterator::reduce insteadAccumulator of the elements in the iterator. Read more
source§fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where
+ F: FnMut(Self::Item, Self::Item) -> Self::Item,
+ Self: Sized,
fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where + F: FnMut(Self::Item, Self::Item) -> Self::Item, + Self: Sized,
Accumulate the elements in the iterator in a tree-like manner. Read more
source§fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where
+ Self: Sized,
+ F: FnMut(B, Self::Item) -> FoldWhile<B>,
fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where + Self: Sized, + F: FnMut(B, Self::Item) -> FoldWhile<B>,
An iterator method that applies a function, producing a single, final value. Read more
source§fn sum1<S>(self) -> Option<S>where
+ Self: Sized,
+ S: Sum<Self::Item>,
fn sum1<S>(self) -> Option<S>where + Self: Sized, + S: Sum<Self::Item>,
Iterate over the entire iterator and add all the elements. Read more
source§fn product1<P>(self) -> Option<P>where
+ Self: Sized,
+ P: Product<Self::Item>,
fn product1<P>(self) -> Option<P>where + Self: Sized, + P: Product<Self::Item>,
Iterate over the entire iterator and multiply all the elements. Read more
source§fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
fn sorted_unstable(self) -> IntoIter<Self::Item, Global>where + Self: Sized, + Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read more
source§fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read more
source§fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + Self: Sized, + K: Ord, + F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read more
source§fn sorted(self) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
fn sorted(self) -> IntoIter<Self::Item, Global>where + Self: Sized, + Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read more
source§fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item, Global>where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read more
source§fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + Self: Sized, + K: Ord, + F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read more
source§fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item, Global>where + Self: Sized, + K: Ord, + F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. The key function is
+called exactly once per key. Read more
source§fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
fn k_smallest(self, k: usize) -> IntoIter<Self::Item, Global>where + Self: Sized, + Self::Item: Ord,
Sort the k smallest elements into a new iterator, in ascending order. Read more
source§fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where
+ Self: Sized,
+ F: FnMut(Self::Item) -> Either<L, R>,
+ A: Default + Extend<L>,
+ B: Default + Extend<R>,
fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where + Self: Sized, + F: FnMut(Self::Item) -> Either<L, R>, + A: Default + Extend<L>, + B: Default + Extend<R>,
Collect all iterator elements into one of two
+partitions. Unlike
Iterator::partition, each partition may
+have a distinct type. Read moresource§fn partition_result<A, B, T, E>(self) -> (A, B)where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ A: Default + Extend<T>,
+ B: Default + Extend<E>,
fn partition_result<A, B, T, E>(self) -> (A, B)where + Self: Iterator<Item = Result<T, E>> + Sized, + A: Default + Extend<T>, + B: Default + Extend<E>,
Partition a sequence of
Results into one list of all the Ok elements
+and another list of all the Err elements. Read moresource§fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
fn into_group_map<K, V>(self) -> HashMap<K, Vec<V, Global>, RandomState>where + Self: Iterator<Item = (K, V)> + Sized, + K: Hash + Eq,
Return a
HashMap of keys mapped to Vecs of values. Keys and values
+are taken from (Key, Value) tuple pairs yielded by the input iterator. Read moresource§fn into_group_map_by<K, V, F>(
+ self,
+ f: F
+) -> HashMap<K, Vec<V, Global>, RandomState>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: Fn(&V) -> K,
fn into_group_map_by<K, V, F>( + self, + f: F +) -> HashMap<K, Vec<V, Global>, RandomState>where + Self: Iterator<Item = V> + Sized, + K: Hash + Eq, + F: Fn(&V) -> K,
Return an
Iterator on a HashMap. Keys mapped to Vecs of values. The key is specified
+in the closure. Read moresource§fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where
+ Self: Iterator<Item = (K, V)> + Sized,
+ K: Hash + Eq,
fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where + Self: Iterator<Item = (K, V)> + Sized, + K: Hash + Eq,
Constructs a
GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn into_grouping_map_by<K, V, F>(
+ self,
+ key_mapper: F
+) -> GroupingMap<MapForGrouping<Self, F>>where
+ Self: Iterator<Item = V> + Sized,
+ K: Hash + Eq,
+ F: FnMut(&V) -> K,
fn into_grouping_map_by<K, V, F>( + self, + key_mapper: F +) -> GroupingMap<MapForGrouping<Self, F>>where + Self: Iterator<Item = V> + Sized, + K: Hash + Eq, + F: FnMut(&V) -> K,
Constructs a
GroupingMap to be used later with one of the efficient
+group-and-fold operations it allows to perform. Read moresource§fn min_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
fn min_set(self) -> Vec<Self::Item, Global>where + Self: Sized, + Self::Item: Ord,
Return all minimum elements of an iterator. Read more
source§fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn min_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all minimum elements of an iterator, as determined by
+the specified function. Read more
source§fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where + Self: Sized, + K: Ord, + F: FnMut(&Self::Item) -> K,
Return all minimum elements of an iterator, as determined by
+the specified function. Read more
source§fn max_set(self) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ Self::Item: Ord,
fn max_set(self) -> Vec<Self::Item, Global>where + Self: Sized, + Self::Item: Ord,
Return all maximum elements of an iterator. Read more
source§fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn max_set_by<F>(self, compare: F) -> Vec<Self::Item, Global>where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all maximum elements of an iterator, as determined by
+the specified function. Read more
source§fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item, Global>where + Self: Sized, + K: Ord, + F: FnMut(&Self::Item) -> K,
Return all maximum elements of an iterator, as determined by
+the specified function. Read more
source§fn minmax(self) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
fn minmax(self) -> MinMaxResult<Self::Item>where + Self: Sized, + Self::Item: PartialOrd<Self::Item>,
Return the minimum and maximum elements in the iterator. Read more
source§fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where + Self: Sized, + K: PartialOrd<K>, + F: FnMut(&Self::Item) -> K,
Return the minimum and maximum element of an iterator, as determined by
+the specified function. Read more
source§fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the minimum and maximum element of an iterator, as determined by
+the specified comparison function. Read more
source§fn position_max(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
fn position_max(self) -> Option<usize>where + Self: Sized, + Self::Item: Ord,
Return the position of the maximum element in the iterator. Read more
source§fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where + Self: Sized, + K: Ord, + F: FnMut(&Self::Item) -> K,
Return the position of the maximum element in the iterator, as
+determined by the specified function. Read more
source§fn position_max_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn position_max_by<F>(self, compare: F) -> Option<usize>where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the maximum element in the iterator, as
+determined by the specified comparison function. Read more
source§fn position_min(self) -> Option<usize>where
+ Self: Sized,
+ Self::Item: Ord,
fn position_min(self) -> Option<usize>where + Self: Sized, + Self::Item: Ord,
Return the position of the minimum element in the iterator. Read more
source§fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where
+ Self: Sized,
+ K: Ord,
+ F: FnMut(&Self::Item) -> K,
fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where + Self: Sized, + K: Ord, + F: FnMut(&Self::Item) -> K,
Return the position of the minimum element in the iterator, as
+determined by the specified function. Read more
source§fn position_min_by<F>(self, compare: F) -> Option<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn position_min_by<F>(self, compare: F) -> Option<usize>where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the minimum element in the iterator, as
+determined by the specified comparison function. Read more
source§fn position_minmax(self) -> MinMaxResult<usize>where
+ Self: Sized,
+ Self::Item: PartialOrd<Self::Item>,
fn position_minmax(self) -> MinMaxResult<usize>where + Self: Sized, + Self::Item: PartialOrd<Self::Item>,
Return the positions of the minimum and maximum elements in
+the iterator. Read more
source§fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ K: PartialOrd<K>,
+ F: FnMut(&Self::Item) -> K,
fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where + Self: Sized, + K: PartialOrd<K>, + F: FnMut(&Self::Item) -> K,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified function. Read more
source§fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where
+ Self: Sized,
+ F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where + Self: Sized, + F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the postions of the minimum and maximum elements of an
+iterator, as determined by the specified comparison function. Read more
source§fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
+ Self: Sized,
fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where + Self: Sized,
If the iterator yields exactly one element, that element will be returned, otherwise
+an error will be returned containing an iterator that has the same output as the input
+iterator. Read more
source§fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
+ Self: Sized,
fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where + Self: Sized,
If the iterator yields no elements, Ok(None) will be returned. If the iterator yields
+exactly one element, that element will be returned, otherwise an error will be returned
+containing an iterator that has the same output as the input iterator. Read more
source§fn multipeek(self) -> MultiPeek<Self>where
+ Self: Sized,
fn multipeek(self) -> MultiPeek<Self>where + Self: Sized,
An iterator adaptor that allows the user to peek at multiple
.next()
+values without advancing the base iterator. Read moresource§fn counts(self) -> HashMap<Self::Item, usize, RandomState>where
+ Self: Sized,
+ Self::Item: Eq + Hash,
fn counts(self) -> HashMap<Self::Item, usize, RandomState>where + Self: Sized, + Self::Item: Eq + Hash,
Collect the items in this iterator and return a
HashMap which
+contains each item that appears in the iterator and the number
+of times it appears. Read moresource§fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where
+ Self: Sized,
+ K: Eq + Hash,
+ F: FnMut(Self::Item) -> K,
fn counts_by<K, F>(self, f: F) -> HashMap<K, usize, RandomState>where + Self: Sized, + K: Eq + Hash, + F: FnMut(Self::Item) -> K,
Collect the items in this iterator and return a
HashMap which
+contains each item that appears in the iterator and the number
+of times it appears,
+determining identity using a keying function. Read moresource§fn multiunzip<FromI>(self) -> FromIwhere
+ Self: Sized + MultiUnzip<FromI>,
fn multiunzip<FromI>(self) -> FromIwhere + Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read more
source§impl<T> Itertools for Twhere
+ T: Iterator + ?Sized,
impl<T> Itertools for Twhere + T: Iterator + ?Sized,
source§fn interleave<J>(
+ self,
+ other: J
+) -> Interleave<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
fn interleave<J>( + self, + other: J +) -> Interleave<Self, <J as IntoIterator>::IntoIter>where + J: IntoIterator<Item = Self::Item>, + Self: Sized,
Alternate elements from two iterators until both have run out. Read more
source§fn interleave_shortest<J>(
+ self,
+ other: J
+) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator<Item = Self::Item>,
+ Self: Sized,
fn interleave_shortest<J>( + self, + other: J +) -> InterleaveShortest<Self, <J as IntoIterator>::IntoIter>where + J: IntoIterator<Item = Self::Item>, + Self: Sized,
Alternate elements from two iterators until at least one of them has run
+out. Read more
source§fn intersperse(
+ self,
+ element: Self::Item
+) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where
+ Self: Sized,
+ Self::Item: Clone,
fn intersperse( + self, + element: Self::Item +) -> IntersperseWith<Self, IntersperseElementSimple<Self::Item>>where + Self: Sized, + Self::Item: Clone,
An iterator adaptor to insert a particular value
+between each element of the adapted iterator. Read more
source§fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where
+ Self: Sized,
+ F: FnMut() -> Self::Item,
fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>where + Self: Sized, + F: FnMut() -> Self::Item,
An iterator adaptor to insert a particular value created by a function
+between each element of the adapted iterator. Read more
source§fn zip_longest<J>(
+ self,
+ other: J
+) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
fn zip_longest<J>( + self, + other: J +) -> ZipLongest<Self, <J as IntoIterator>::IntoIter>where + J: IntoIterator, + Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of two optional elements. Read more
source§fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where
+ J: IntoIterator,
+ Self: Sized,
fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter>where + J: IntoIterator, + Self: Sized,
Create an iterator which iterates over both this and the specified
+iterator simultaneously, yielding pairs of elements. Read more
source§fn batching<B, F>(self, f: F) -> Batching<Self, F>where
+ F: FnMut(&mut Self) -> Option<B>,
+ Self: Sized,
fn batching<B, F>(self, f: F) -> Batching<Self, F>where + F: FnMut(&mut Self) -> Option<B>, + Self: Sized,
A “meta iterator adaptor”. Its closure receives a reference to the
+iterator and may pick off as many elements as it likes, to produce the
+next iterator element. Read more
source§fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
+ Self: Sized,
+ F: FnMut(&Self::Item) -> K,
+ K: PartialEq<K>,
fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where + Self: Sized, + F: FnMut(&Self::Item) -> K, + K: PartialEq<K>,
Return an iterable that can group iterator elements.
+Consecutive elements that map to the same key (“runs”), are assigned
+to the same group. Read more
source§fn chunks(self, size: usize) -> IntoChunks<Self>where
+ Self: Sized,
fn chunks(self, size: usize) -> IntoChunks<Self>where + Self: Sized,
Return an iterable that can chunk the iterator. Read more
source§fn tuple_windows<T>(self) -> TupleWindows<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
+ <T as TupleCollect>::Item: Clone,
fn tuple_windows<T>(self) -> TupleWindows<Self, T>where + Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + T: HomogeneousTuple, + <T as TupleCollect>::Item: Clone,
Return an iterator over all contiguous windows producing tuples of
+a specific size (up to 12). Read more
source§fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where
+ Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator,
+ T: TupleCollect + Clone,
+ <T as TupleCollect>::Item: Clone,
fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>where + Self: Sized + Clone + Iterator<Item = <T as TupleCollect>::Item> + ExactSizeIterator, + T: TupleCollect + Clone, + <T as TupleCollect>::Item: Clone,
Return an iterator over all windows, wrapping back to the first
+elements when the window would otherwise exceed the length of the
+iterator, producing tuples of a specific size (up to 12). Read more
source§fn tuples<T>(self) -> Tuples<Self, T>where
+ Self: Sized + Iterator<Item = <T as TupleCollect>::Item>,
+ T: HomogeneousTuple,
fn tuples<T>(self) -> Tuples<Self, T>where + Self: Sized + Iterator<Item = <T as TupleCollect>::Item>, + T: HomogeneousTuple,
Return an iterator that groups the items in tuples of a specific size
+(up to 12). Read more
source§fn tee(self) -> (Tee<Self>, Tee<Self>)where
+ Self: Sized,
+ Self::Item: Clone,
fn tee(self) -> (Tee<Self>, Tee<Self>)where + Self: Sized, + Self::Item: Clone,
Split into an iterator pair that both yield all elements from
+the original iterator. Read more
source§fn step(self, n: usize) -> Step<Self>where
+ Self: Sized,
fn step(self, n: usize) -> Step<Self>where + Self: Sized,
👎Deprecated since 0.8.0: Use std .step_by() instead
Return an iterator adaptor that steps
n elements in the base iterator
+for each iteration. Read moresource§fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where
+ Self: Sized,
+ Self::Item: Into<R>,
fn map_into<R>(self) -> MapSpecialCase<Self, MapSpecialCaseFnInto<R>>where + Self: Sized, + Self::Item: Into<R>,
source§fn map_results<F, T, U, E>(
+ self,
+ f: F
+) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
fn map_results<F, T, U, E>( + self, + f: F +) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> U,
👎Deprecated since 0.10.0: Use .map_ok() instead
See
.map_ok().source§fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> U,
fn map_ok<F, T, U, E>(self, f: F) -> MapSpecialCase<Self, MapSpecialCaseFnOk<F>>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
+to every
Result::Ok value. Result::Err values are
+unchanged. Read moresource§fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(&T) -> bool,
fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(&T) -> bool,
Return an iterator adaptor that filters every
Result::Ok
+value with the provided closure. Result::Err values are
+unchanged. Read moresource§fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ F: FnMut(T) -> Option<U>,
fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>where + Self: Iterator<Item = Result<T, E>> + Sized, + F: FnMut(T) -> Option<U>,
Return an iterator adaptor that filters and transforms every
+
Result::Ok value with the provided closure. Result::Err
+values are unchanged. Read moresource§fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where
+ Self: Iterator<Item = Result<T, E>> + Sized,
+ T: IntoIterator,
fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>where + Self: Iterator<Item = Result<T, E>> + Sized, + T: IntoIterator,
Return an iterator adaptor that flattens every
Result::Ok value into
+a series of Result::Ok values. Result::Err values are unchanged. Read moresource§fn merge<J>(
self,
other: J
) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where
@@ -287,7 +692,7 @@
Self::Item: PartialOrd<Self::Item>,
J: IntoIterator<Item = Self::Item>,
fn merge<J>( self, other: J ) -> MergeBy<Self, <J as IntoIterator>::IntoIter, MergeLte>where @@ -287,7 +692,7 @@ Self::Item: PartialOrd<Self::Item>, J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
ascending order. If both base iterators are sorted (ascending), the
-result is sorted. Read more
source§fn merge_by<J, F>(
self,
other: J,
is_first: F
@@ -295,7 +700,7 @@
Self: Sized,
J: IntoIterator<Item = Self::Item>,
F: FnMut(&Self::Item, &Self::Item) -> bool,
fn merge_by<J, F>( self, other: J, is_first: F @@ -295,7 +700,7 @@ Self: Sized, J: IntoIterator<Item = Self::Item>, F: FnMut(&Self::Item, &Self::Item) -> bool,
source§fn merge_join_by<J, F>(
+This is much like .merge() but allows for a custom ordering. Read more
fn merge_join_by<J, F>(
+This is much like .merge() but allows for a custom ordering. Read more
source§fn merge_join_by<J, F>(
self,
other: J,
cmp_fn: F
@@ -303,18 +708,18 @@
J: IntoIterator,
F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering,
Self: Sized,
fn merge_join_by<J, F>( self, other: J, cmp_fn: F @@ -303,18 +708,18 @@ J: IntoIterator, F: FnMut(&Self::Item, &<J as IntoIterator>::Item) -> Ordering, Self: Sized,
Create an iterator that merges items from both this and the specified
-iterator in ascending order. Read more
source§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
+iterator in ascending order. Read more
fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where +iterator in ascending order. Read more
source§fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
fn kmerge(self) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, KMergeByLt>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::Item: PartialOrd<<Self::Item as IntoIterator>::Item>,
Return an iterator adaptor that flattens an iterator of iterators by
-merging them in ascending order. Read more
source§fn kmerge_by<F>(
self,
first: F
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
fn kmerge_by<F>( self, first: F ) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>where Self: Sized, Self::Item: IntoIterator, F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
Return an iterator adaptor that flattens an iterator of iterators by
-merging them according to the given closure. Read more
source§fn cartesian_product<J>(
+merging them according to the given closure. Read more
fn cartesian_product<J>( +merging them according to the given closure. Read more
source§fn cartesian_product<J>(
self,
other: J
) -> Product<Self, <J as IntoIterator>::IntoIter>where
@@ -322,32 +727,32 @@
Self::Item: Clone,
J: IntoIterator,
<J as IntoIterator>::IntoIter: Clone,
fn cartesian_product<J>( self, other: J ) -> Product<Self, <J as IntoIterator>::IntoIter>where @@ -322,32 +727,32 @@ Self::Item: Clone, J: IntoIterator, <J as IntoIterator>::IntoIter: Clone,
Return an iterator adaptor that iterates over the cartesian product of
-the element sets of two iterators
self and J. Read moresource§fn multi_cartesian_product(
+the element sets of two iterators self and J. Read more
fn multi_cartesian_product(
+the element sets of two iterators self and J. Read more
source§fn multi_cartesian_product(
self
) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::IntoIter: Clone,
<Self::Item as IntoIterator>::Item: Clone,
fn multi_cartesian_product( self ) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>where Self: Sized, Self::Item: IntoIterator, <Self::Item as IntoIterator>::IntoIter: Clone, <Self::Item as IntoIterator>::Item: Clone,
Return an iterator adaptor that iterates over the cartesian product of
-all subiterators returned by meta-iterator
self. Read moresource§fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where
Self: Sized,
F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
fn coalesce<F>(self, f: F) -> CoalesceBy<Self, F, Self::Item>where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
Return an iterator adaptor that uses the passed-in closure to
-optionally merge together consecutive elements. Read more
source§fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where
+optionally merge together consecutive elements. Read more
fn dedup(self) -> CoalesceBy<Self, DedupPred2CoalescePred<DedupEq>, Self::Item>where +optionally merge together consecutive elements. Read more
source§fn dedup_by<Cmp>(
self,
cmp: Cmp
) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where
Self: Sized,
Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
fn dedup_by<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPred2CoalescePred<Cmp>, Self::Item>where Self: Sized, Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements,
determining equality using a comparison function.
-If the iterator is sorted, all elements will be unique. Read more
source§fn dedup_with_count(
+If the iterator is sorted, all elements will be unique. Read more
fn dedup_with_count( +If the iterator is sorted, all elements will be unique. Read more
source§fn dedup_with_count(
self
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where
Self: Sized,
fn dedup_with_count( self ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<DedupEq>, (usize, Self::Item)>where Self: Sized,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
how many repeated elements were present.
-If the iterator is sorted, all elements will be unique. Read more
source§fn dedup_by_with_count<Cmp>(
+If the iterator is sorted, all elements will be unique. Read more
fn dedup_by_with_count<Cmp>( +If the iterator is sorted, all elements will be unique. Read more
source§fn dedup_by_with_count<Cmp>(
self,
cmp: Cmp
) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where
@@ -355,267 +760,303 @@
Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
fn dedup_by_with_count<Cmp>( self, cmp: Cmp ) -> CoalesceBy<Self, DedupPredWithCount2CoalescePred<Cmp>, (usize, Self::Item)>where @@ -355,267 +760,303 @@ Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
how many repeated elements were present.
This will determine equality using a comparison function.
-If the iterator is sorted, all elements will be unique. Read more