struct Equation {
target: i64,
total: i64,
remaining_numbers: Vec<i64>,
}
Expand description
An equation missing operators, stored as a target number, the running total and the numbers that have yet to be combined into to the total.
Fields§
§target: i64
§total: i64
§remaining_numbers: Vec<i64>
Implementations§
Trait Implementations§
source§impl Ord for Equation
impl Ord for Equation
Ordering for the BinaryHeap. The best candidate equation has the greatest ordering. This is done by
- Fewest numbers remaining to combine
- The least distance from the running total to the target
source§impl PartialOrd for Equation
impl PartialOrd for Equation
PartialOrd
needs to be implemented if Ord
is implemented, but can delegate to it.
impl Eq for Equation
impl StructuralPartialEq for Equation
Auto Trait Implementations§
impl Freeze for Equation
impl RefUnwindSafe for Equation
impl Send for Equation
impl Sync for Equation
impl Unpin for Equation
impl UnwindSafe for Equation
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.