Expand description
Prelude to use essentials: use my_module::prelude::*
.
Macros§
- _if_
make - Generate code only if feature::make is enabled.
- _impls_
callback - Internal impls1 macro. Don’t use.
- a_
dbg_ id - Asserts that two expressions are identical to each other.
- a_
dbg_ not_ id - Asserts that two expressions are not identical to each other.
- a_
dbg_ true - Asserts that a boolean expression is true at runtime.
- a_id
- Asserts that two expressions are equal to each other (using
PartialEq
). - a_
not_ id - Asserts that two expressions are not equal to each other (using
PartialEq
). - a_true
- Asserts that a boolean expression is true at runtime.
- bmap
- Literally just a BTreeMap literal with keys and values into’d.
- braces_
unwrap - Unwrap braces of token tree and pass its content to the passed callback. If token tree in not braced then it passed to callback as is.
- bset
- Literally just a BTreeSet literal with values into’d.
- cta_
mem_ same_ size - Compile-time assertion that two values have the same size.
- cta_
ptr_ same_ size - Compile-time assertion that memory behind two references have the same size.
- cta_
true - Macro to compare meta condition is true at compile-time.
- cta_
type_ same_ align - Compile-time assertion of having the same align.
- cta_
type_ same_ size - Compile-time assertion that two types have the same size.
- fn_name
- Get name of a function.
- fn_
rename - Macro to rename function.
- fns
- Split functions.
- fns2
- Split functions.
- for_
each - Module :: for_each
- heap
- Literally just a BinaryHeap literal with values into’d.
- hmap
- Literally just a HashMap literal with keys and values into’d.
- hset
- Literally just a HashSet literal with values into’d.
- identity
- Macro which returns its input as is.
- idents_
concat - implements
- Macro
implements
to answer the question: does it implement a trait? - impls
- Define implementation putting each function under a macro.
- impls1
- Define implementation putting each function under a macro.
- impls2
- Define implementation putting each function under a macro.
- impls3
- Macros to put each function under a named macro to index every function in a class.
- index
- Index of items.
- inspect_
to_ str_ type_ of - Macro to inspect type of a variable and its size exporting it as a string.
- inspect_
type_ of - Macro to inspect type of a variable and its size printing into stdout and exporting it as a string.
- instance_
of - Macro
instance_of
to answer the question: does it implement a trait? Alias of the macroimplements
. - is_
slice - Macro to answer the question: is it a slice?
- list
- Literally just a LinkedList literal with values into’d.
- make
- Variadic constructor.
- mod_
interface - Protocol of modularity unifying interface of a module and introducing layers.
- tests_
impls - Define implementation putting each function under a macro and adding attribute
#[ test ]
. - tests_
impls_ optional - Define implementation putting each function under a macro and adding attribute
#[ test ]
. - tests_
index - Index of items.
- types
- Type constructor to define tuple wrapping a given type.
- vecd
- Literally just a VecDeque literal with values into’d.
Structs§
- BTree
Map - An ordered map based on a B-Tree.
- BTree
Set - An ordered set based on a B-Tree.
- Binary
Heap - A priority queue implemented with a binary heap.
- DynArray
- A contiguous growable array type, written as
Vec<T>
, short for ‘vector’. - Enumerable
Iterator Consumable - Iterator for enumerable.
- Enumerable
Iterator NonConsumable - Iterator for enumerable.
- HashMap
- A hash map implemented with quadratic probing and SIMD lookup.
- HashSet
- A hash set implemented as a
HashMap
where the value is()
. - Homo
Pair - Type constructor to wrap pair of the same type.
- Linked
List - A doubly-linked list with owned nodes.
- Many
- Type constructor to wrap a vector.
- Map
- A hash map implemented with quadratic probing and SIMD lookup.
- Pair
- Type constructor to wrap two types into a tuple.
- Set
- A hash set implemented as a
HashMap
where the value is()
. - Single
- Type constructor to wrap a another type into a tuple.
- Vec
- A contiguous growable array type, written as
Vec<T>
, short for ‘vector’. - VecDeque
- A double-ended queue implemented with a growable ring buffer.
Enums§
- Diff
- A type returned by the
diff_with
function. - Either
- The enum
Either
with variantsLeft
andRight
is a general purpose sum type with two cases. - Either
OrBoth - Value that either holds a single A or B, or both.
- Fold
While - An enum used for controlling the execution of
fold_while
. - MinMax
Result MinMaxResult
is an enum returned byminmax
.- Position
- A value yielded by
WithPosition
. Indicates the position of this element in the iterator results.
Traits§
- AsArray
- Reinterpret as array.
- AsSlice
- Reinterpret as slice.
- AsTuple
- Reinterpret as tuple.
- Clone
AsArray - Clone as array.
- Clone
AsTuple - Clone as tuple.
- Enumerable
- Has length and indexed access.
- Isolate
Options Adapter - Adapter for IsolateOptions.
- Itertools
- An
Iterator
blanket implementation that provides extra adaptors and methods. - Make0
- Constructor without arguments.
- Make1
- Constructor with single argument.
- Make2
- Constructor with two arguments.
- Make3
- Constructor with three arguments.
- Parse
Options Adapter - Adapter for ParseOptions.
- Peeking
Next - An iterator that allows peeking at an element before deciding to accept it.
- Split
Options Adapter - Adapter for Split Options.
- Vectorized
From - Implementation of trait From to vectorize into/from.
- Vectorized
Into - Implementation of trait Into to vectorize into/from.
Functions§
- _clone_
boxed - Clone boxed dyn.
Attribute Macros§
- clone_
dyn - Derive macro to generate former for a structure. Former is variation of Builder Pattern.