3 Commits

Author SHA1 Message Date
Quaternions 555daf5ec3 use custom arrayvec 2026-05-24 10:36:15 -07:00
Quaternions 555e7ef11c update readme 2026-05-19 16:46:32 -07:00
Quaternions f49721e415 no repr 2026-05-19 07:42:34 -07:00
7 changed files with 29 additions and 62 deletions
Generated
+2 -2
View File
@@ -11,8 +11,8 @@ checksum = "7f202df86484c868dbad7eaa557ef785d5c66295e41b460ef922eca0723b842c"
[[package]]
name = "arrayvec"
version = "0.7.6"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "7c02d123df017efcdfbd739ef81735b36c5ba83ec3c59c80a9d7ecc718f92e50"
source = "sparse+https://git.aleshym.co/api/packages/Quaternions/cargo/"
checksum = "813440870d646c57c222c1d713dc4e3ddcb2919c3801564d767d85d7bf2afee4"
[[package]]
name = "bitflags"
+1 -1
View File
@@ -9,7 +9,7 @@ authors = ["Rhys Lloyd <krakow20@gmail.com>"]
keywords = ["card", "cards", "solitaire", "klondike"]
[dependencies]
arrayvec = "0.7.6"
arrayvec = { version = "0.7.6", registry = "Quaternions", features = ["len_u8"], default-features = false }
[lints]
workspace = true
+21 -53
View File
@@ -6,10 +6,10 @@ struct ReadmeDoctests;
use core::ops::RangeBounds;
// TODO: pub struct ValidInstruction<I>(I);
pub trait Game: Clone + core::fmt::Debug {
type Stats: Clone + core::fmt::Debug;
type Config: Clone + core::fmt::Debug;
type Instruction: Clone + core::fmt::Debug;
pub trait Game {
type Stats;
type Config;
type Instruction;
fn possible_instructions(&self) -> impl Iterator<Item = Self::Instruction> + use<Self>;
fn is_instruction_valid(&self, config: &Self::Config, instruction: Self::Instruction) -> bool;
fn process_instruction(
@@ -321,33 +321,21 @@ impl<S> SessionStats<S> {
}
}
#[derive(Clone, Debug)]
pub struct Session<G: Game> {
stats: SessionStats<G::Stats>,
config: G::Config,
state: SessionState<G>,
}
#[derive(Clone, Debug)]
pub struct StateSnapshot<G: Game> {
state: G,
instruction: G::Instruction,
}
impl<G: Game> StateSnapshot<G> {
pub const fn state(&self) -> &G {
&self.state
}
pub const fn instruction(&self) -> &G::Instruction {
&self.instruction
}
}
#[derive(Clone, Debug)]
#[derive(Clone, Eq, Hash, PartialEq)]
pub struct SessionState<G: Game> {
seed: G,
state: G,
history: Vec<StateSnapshot<G>>,
history: Vec<G::Instruction>,
}
impl<G: Game + Clone> SessionState<G> {
fn new(state: G) -> Self {
Self {
seed: state.clone(),
state,
history: Vec::new(),
}
@@ -357,7 +345,6 @@ impl<G: Game> Session<G>
where
G: Clone + Eq + core::hash::Hash,
G::Stats: Clone + Default,
G::Config: Clone,
G::Instruction: Clone + Eq + core::hash::Hash,
{
pub fn new(state: G, config: G::Config) -> Self {
@@ -382,7 +369,7 @@ where
pub const fn config(&self) -> &G::Config {
&self.config
}
pub fn history(&self) -> &[StateSnapshot<G>] {
pub fn history(&self) -> &[G::Instruction] {
&self.state.history
}
pub fn undo(&mut self) {
@@ -402,34 +389,12 @@ where
pub fn is_win(&self) -> bool {
self.state.is_win()
}
pub fn is_winnable(&self) -> Option<Vec<StateSnapshot<G>>> {
let mut state_moves = std::collections::HashMap::new();
let mut state = self.clone();
while !state.is_win() {
// Continue existing iterator if it exists
let it = state_moves
.entry(state.state().clone())
.or_insert_with(|| state.state().possible_instructions());
// Run one possible move
if let Some(instruction) = it.next() {
state.process_instruction(instruction);
continue;
}
// No more moves. If we can't undo we're done
if state.history().is_empty() {
return None;
} else {
state.undo();
}
}
Some(state.state.history)
}
}
impl<G: Game> Game for SessionState<G>
where
G: Clone,
G::Stats: Default,
G::Instruction: Clone,
{
type Stats = SessionStats<G::Stats>;
type Config = G::Config;
@@ -455,16 +420,19 @@ where
) {
match instruction {
SessionInstruction::Undo => {
if let Some(snapshot) = self.history.pop() {
self.state = snapshot.state;
stats.increment_undos();
// replay the entire history of the game except one move
self.history.pop();
let mut inner_stats = G::Stats::default();
let mut state = self.seed.clone();
for instruction in &self.history {
state.process_instruction(&mut inner_stats, config, instruction.clone());
}
self.state = state;
stats.inner_stats = inner_stats;
stats.increment_undos();
}
SessionInstruction::InnerInstruction(instruction) => {
self.history.push(StateSnapshot {
state: self.state.clone(),
instruction: instruction.clone(),
});
self.history.push(instruction.clone());
self.state
.process_instruction(&mut stats.inner_stats, config, instruction);
}
+2 -2
View File
@@ -4,8 +4,8 @@ use klondike::{
KlondikePile, KlondikePileStack, KlondikeStats, SkipCards, Tableau, TableauStack,
};
#[cfg(test)]
mod test;
// #[cfg(test)]
// mod test;
use std::fmt::Display;
struct Displayed<T>(T);
+1 -1
View File
@@ -1,5 +1,5 @@
use card_game::Session;
use klondike::Klondike;
use card_game::Session;
#[test]
fn test_is_winnable() {
// is winnable
+2 -2
View File
@@ -17,8 +17,8 @@ let mut session = Session::new_default(game);
while let Some(instruction) = session.state().get_auto_move() {
session.process_instruction(instruction);
// quit after 1000 moves
if 1000 < session.stats().stats().moves() {
// quit after 200 moves or win
if session.is_win() || 200 < session.stats().stats().moves() {
break;
}
}
-1
View File
@@ -137,7 +137,6 @@ impl From<Foundation> for KlondikePile {
}
}
#[repr(u8)]
#[derive(Clone, Copy, Debug, Eq, Hash, PartialEq)]
pub enum SkipCards {
Skip0,