Struct Solutions 

pub struct Solutions<N>
where
    N: Network,
{ /* private fields */ }

Implementations

impl<N> Solutions<N>

where N: Network,

pub fn to_solutions_root(&self) -> Result<Field<N>, Error>

Returns the solutions root.

impl<N> Solutions<N>

where N: Network,

pub fn max_aborted_solutions() -> Result<usize, Error>

The maximum number of aborted solutions allowed in a block.

impl<N> Solutions<N>

where N: Network,

pub fn new(solutions: PuzzleSolutions<N>) -> Result<Solutions<N>, Error>

Initializes a new instance of the solutions.

pub fn is_empty(&self) -> bool

Returns true if the solutions are empty.

pub fn len(&self) -> usize

Returns the number of solutions.

impl<N> Solutions<N>

where N: Network,

pub fn solution_ids<'a>( &'a self, ) -> Box<dyn Iterator<Item = &'a SolutionID<N>> + 'a>

Returns an iterator over the solution IDs.

Methods from Deref<Target = Option<PuzzleSolutions<N>>>

pub fn is_some(&self) -> bool

Returns true if the option is a Some value.

Examples

let x: Option<u32> = Some(2);
assert_eq!(x.is_some(), true);

let x: Option<u32> = None;
assert_eq!(x.is_some(), false);

pub fn is_none(&self) -> bool

Returns true if the option is a None value.

Examples

let x: Option<u32> = Some(2);
assert_eq!(x.is_none(), false);

let x: Option<u32> = None;
assert_eq!(x.is_none(), true);

pub fn as_ref(&self) -> Option<&T>

Converts from &Option<T> to Option<&T>.

Examples

Calculates the length of an Option<String> as an Option<usize> without moving the String. The map method takes the self argument by value, consuming the original, so this technique uses as_ref to first take an Option to a reference to the value inside the original.

let text: Option<String> = Some("Hello, world!".to_string());
// First, cast `Option<String>` to `Option<&String>` with `as_ref`,
// then consume *that* with `map`, leaving `text` on the stack.
let text_length: Option<usize> = text.as_ref().map(|s| s.len());
println!("still can print text: {text:?}");

pub fn as_pin_ref(self: Pin<&Option<T>>) -> Option<Pin<&T>>

Converts from Pin<&Option<T>> to Option<Pin<&T>>.

pub fn as_pin_mut(self: Pin<&mut Option<T>>) -> Option<Pin<&mut T>>

Converts from Pin<&mut Option<T>> to Option<Pin<&mut T>>.

pub fn as_slice(&self) -> &[T]

Returns a slice of the contained value, if any. If this is None, an empty slice is returned. This can be useful to have a single type of iterator over an Option or slice.

Note: Should you have an Option<&T> and wish to get a slice of T, you can unpack it via opt.map_or(&[], std::slice::from_ref).

Examples

assert_eq!(
    [Some(1234).as_slice(), None.as_slice()],
    [&[1234][..], &[][..]],
);

The inverse of this function is (discounting borrowing) [_]::first:

for i in [Some(1234_u16), None] {
    assert_eq!(i.as_ref(), i.as_slice().first());
}

pub fn as_deref(&self) -> Option<&<T as Deref>::Target>

where T: Deref,

Converts from Option<T> (or &Option<T>) to Option<&T::Target>.

Leaves the original Option in-place, creating a new one with a reference to the original one, additionally coercing the contents via Deref.

Examples

let x: Option<String> = Some("hey".to_owned());
assert_eq!(x.as_deref(), Some("hey"));

let x: Option<String> = None;
assert_eq!(x.as_deref(), None);

pub fn iter(&self) -> Iter<'_, T>

Returns an iterator over the possibly contained value.

Examples

let x = Some(4);
assert_eq!(x.iter().next(), Some(&4));

let x: Option<u32> = None;
assert_eq!(x.iter().next(), None);

Trait Implementations

impl<N> Clone for Solutions<N>

where N: Clone + Network,

fn clone(&self) -> Solutions<N>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N> Debug for Solutions<N>

where N: Network,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Prints the solutions as a JSON-string.

impl<N> Deref for Solutions<N>

where N: Network,

fn deref(&self) -> &<Solutions<N> as Deref>::Target

Returns the solutions.

type Target = Option<PuzzleSolutions<N>>

The resulting type after dereferencing.

impl<'de, N> Deserialize<'de> for Solutions<N>

where N: Network,

fn deserialize<D>( deserializer: D, ) -> Result<Solutions<N>, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserializes the solutions from a JSON-string or buffer.

impl<N> Display for Solutions<N>

where N: Network,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Displays the solutions as a JSON-string.

impl<N> From<Option<PuzzleSolutions<N>>> for Solutions<N>

where N: Network,

fn from(solutions: Option<PuzzleSolutions<N>>) -> Solutions<N>

Initializes a new instance of the solutions.

impl<N> FromBytes for Solutions<N>

where N: Network,

fn read_le<R>(reader: R) -> Result<Solutions<N>, Error>

where R: Read,

Reads the solutions from the buffer.

fn from_bytes_le(bytes: &[u8]) -> Result<Self, Error>

where Self: Sized,

Returns Self from a byte array in little-endian order.

impl<N> FromStr for Solutions<N>

where N: Network,

fn from_str( solutions: &str, ) -> Result<Solutions<N>, <Solutions<N> as FromStr>::Err>

Initializes the solutions from a JSON-string.

type Err = Error

The associated error which can be returned from parsing.

impl<N> PartialEq for Solutions<N>

where N: PartialEq + Network,

fn eq(&self, other: &Solutions<N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N> Serialize for Solutions<N>

where N: Network,

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serializes the solutions to a JSON-string or buffer.

impl<N> ToBytes for Solutions<N>

where N: Network,

fn write_le<W>(&self, writer: W) -> Result<(), Error>

where W: Write,

Writes the solutions to the buffer.

fn to_bytes_le(&self) -> Result<Vec<u8>, Error>

where Self: Sized,

Returns self as a byte array in little-endian order.

impl<N> Eq for Solutions<N>

where N: Eq + Network,

impl<N> StructuralPartialEq for Solutions<N>

where N: Network,