Struct Solitaire 

pub struct Solitaire {
    pub stockpile: Deck<StandardCard>,
    pub waste: Vec<StandardCard>,
    pub tablue: [Vec<SolitaireCard>; 7],
    pub foundation: [Vec<SolitaireCard>; 4],
    /* private fields */
}

Solitaire

Fields

stockpile: Deck<StandardCard>

stockpile of cards

waste: Vec<StandardCard>

Waste pile

tablue: [Vec<SolitaireCard>; 7]

Table

foundation: [Vec<SolitaireCard>; 4]

Foundation pile

Implementations

impl Solitaire

pub fn new() -> Self

New solitaire game

pub fn draw_card(&mut self) -> SError<StandardCard>

Move a card from stockpile to waste pile, if stockpile is empty, move waste to stockpile and draw card

Errors

Errors if there is no more cards to draw Can also error if moves exceed u32

pub fn moves(&self) -> u32

Number of moves performed

pub fn peek(&self) -> SError<StandardCard>

Peek at the next card

Errors

Errors if there is no cards to peek at from either the stockpile or waste

pub fn move_to(&mut self, target: Area, destination: Area) -> SError<()>

Move card(s) from target -> Destination

Errors

First Check phase: /// Target rules:

• Foundation
  • The row must be less than 4
• Stockpile
  • Waste must not be empty
  • Stockpile must not be empty
• Waste
  • Waste must not be empty
• Tablue
  • Row must be less than 7
  • The requested amount must be less than or equal to the number of faceup cards
  • The tablue must be all faceup if requested amount is 0 (All)

Destination:

• Foundation
  • Row less than 4
• Tablue
  • Row less than 7
• Stockpile OR Waste
  • Always ok

Second Phase:

Target Stockpile:

• Stockpile (Not Allowed)
• Waste
  • Failed to draw from stockpile
• Foundation
  • Card(s) not allowed to be stacked (Solitaire Rules)
• Tablue
  • Card(s) not allowed to be stacked (Solitaire Rules)

Target Waste:

• Stockpile (Never allowed)
• Waste (Never allowed)
• Foundation
  • Card(s) not allowed to be stacked (Solitaire Rules)
• Tablue
  • Card(s) not allowed to be stacked (Solitaire Rules)

Target Tablue:

• Stockpile (Never allowed)
• Waste (Never allowed)
• Tablue
  • Card(s) not allowed to be stacked (Solitaire Rules)
• Foundation
  • Card(s) not allowed to be stacked (Solitaire Rules)

Target Foundation:

• Waste (Never allowed)
• Stockpile (Never allowed)
• Foundation (Never allowed)
• Tablue
  • Card(s) not allowed to be stacked (Solitaire Rules)

Can also error if moves exceed the max of u32

pub fn game_won(&self) -> bool

Check if the solitaire game is a win

Trait Implementations

impl Clone for Solitaire

fn clone(&self) -> Solitaire

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Solitaire

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

Formats the value using the given formatter.

impl Default for Solitaire

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Solitaire

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Solitaire

impl Hash for Solitaire

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Solitaire

fn cmp(&self, other: &Solitaire) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Solitaire

fn eq(&self, other: &Solitaire) -> 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 PartialOrd for Solitaire

fn partial_cmp(&self, other: &Solitaire) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for Solitaire

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Solitaire