Struct Card 

pub struct Card(/* private fields */);

A playing card

Implementations

impl Card

pub const fn new(suit: Suit, rank: u8) -> Self

Create a card from suit and rank

The rank is a number from 2 to 14. J, Q, K, A are encoded as 11, 12, 13, 14 respectively.

Panics

Panics if the rank is not in the range 2..=14.

Examples found in repository

examples/compute-hot-deals/main.rs (line 13)

fn get_random_average_hand(rng: &mut (impl rand::Rng + ?Sized)) -> Hand {
    let bits: u64 = rng.random();

    (0..13).fold(Hand::EMPTY, |mut hand, i| {
        // SAFETY: we are slicing valid consecutive 2 bits from `bits`
        let suit: Suit = unsafe { core::mem::transmute((bits >> (2 * i) & 3) as u8) };
        hand.insert(Card::new(suit, i + 2));
        hand
    })
}

pub const fn suit(self) -> Suit

The suit of the card

pub const fn rank(self) -> u8

The rank of the card

The rank is a number from 2 to 14. J, Q, K, A are denoted as 11, 12, 13, 14 respectively.

Trait Implementations

impl Clone for Card

fn clone(&self) -> Card

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Card

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

Formats the value using the given formatter.

impl Hash for Card

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 PartialEq for Card

fn eq(&self, other: &Card) -> 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 SmallSet<Card> for Hand

const EMPTY: Self

The empty set

const ALL: Self

The set containing all possible values

fn len(self) -> usize

The number of elements in the set

fn contains(self, card: Card) -> bool

Whether the set contains a value

fn insert(&mut self, card: Card) -> bool

Insert a value into the set

fn remove(&mut self, card: Card) -> bool

Remove a value from the set

fn toggle(&mut self, card: Card) -> bool

Toggle a value in the set

fn set(&mut self, card: Card, condition: bool)

Conditionally insert/remove a value from the set

fn iter(self) -> impl Iterator<Item = Card>

Iterate over the values in the set

fn is_empty(self) -> bool

Whether the set is empty

fn intersection(self, rhs: Self) -> <Self as BitAnd>::Output

Intersection of two sets

fn union(self, rhs: Self) -> <Self as BitOr>::Output

Union of two sets

fn difference(self, rhs: Self) -> <Self as Sub>::Output

Difference of two sets

fn symmetric_difference(self, rhs: Self) -> <Self as BitXor>::Output

Symmetric difference of two sets

fn complement(self) -> <Self as Not>::Output

Complement of the set

impl Copy for Card

impl Eq for Card

impl StructuralPartialEq for Card