major-pickems-sim 0.3.0

use std::collections::BTreeMap;
use std::{fs::read_to_string, io::Write, path::PathBuf};

use anyhow::anyhow;
use serde::{Deserialize, Serialize};

use crate::datatypes::{Index, Name, Rating, Seed, Set};

/// Input data for a single team.
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct Team {
    /// Initial one-based tournament seed.
    pub seed: Seed,
    /// Rating points used by the simulation model.
    pub rating: Rating,
}

/// TOML-friendly collection of teams keyed by team name.
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct Map(BTreeMap<Name, Team>);

impl Map {
    /// Parse a team map from a TOML file.
    pub fn parse_toml(filepath: PathBuf) -> anyhow::Result<Self> {
        Ok(toml::from_str::<Self>(&read_to_string(filepath)?)?)
    }

    /// Write a team map to a TOML file.
    pub fn write_toml(&self, filepath: PathBuf) -> anyhow::Result<()> {
        let contents = toml::to_string_pretty(self)?;

        std::fs::OpenOptions::new()
            .write(true)
            .create(true)
            .truncate(true)
            .open(filepath)?
            .write_all(contents.as_bytes())?;

        Ok(())
    }
}

impl<I: IntoIterator<Item = (Name, Team)>> From<I> for Map {
    fn from(teams: I) -> Self {
        Self(teams.into_iter().collect())
    }
}

/// Seed-ordered team data optimized for simulation.
///
/// The arrays are indexed by [`Index`], so element `0` corresponds to seed `1`.
#[derive(Debug, Clone)]
pub struct Teams {
    /// Team names sorted by ascending initial seed.
    pub names: [Name; 16],
    /// Team ratings sorted by ascending initial seed.
    pub ratings: [Rating; 16],
}

impl Teams {
    /// Produce dummy data for testing purposes.
    #[must_use]
    pub fn dummy() -> Self {
        // Safety: names and ratings produced are all valid
        unsafe {
            Self {
                names: std::array::from_fn(|i| Name::new_unchecked(format!("Team {}", i + 1))),
                ratings: std::array::from_fn(|i| Rating::new_unchecked(2000 - 50 * i as u16)),
            }
        }
    }

    /// Parse, validate, and convert TOML input into seed-ordered team arrays.
    pub fn parse_toml(filepath: PathBuf) -> anyhow::Result<Self> {
        Self::try_from(Map::parse_toml(filepath)?)
    }

    /// Convert seed-ordered team arrays back into TOML input format.
    pub fn write_toml(&self, filepath: PathBuf) -> anyhow::Result<()> {
        let map = Map::from(self);
        map.write_toml(filepath)
    }
}

impl TryFrom<Map> for Teams {
    type Error = anyhow::Error;

    fn try_from(teams_map: Map) -> Result<Self, Self::Error> {
        // Convert seeds to a bitset first so we can cheaply detect missing
        // seeds before doing the more expensive duplicate check.
        let set = teams_map
            .0
            .values()
            .map(|team| Index::from(team.seed))
            .collect::<Set>();

        if set != Set::full() {
            for i in Index::iter_all() {
                if !set.contains(i) {
                    return Err(anyhow!("missing seed: {}", Seed::from(i)));
                }
            }

            // If no seed is missing but the set is still not complete, at least
            // one seed was duplicated.
            let indices = teams_map
                .0
                .values()
                .map(|team| Index::from(team.seed))
                .collect::<Vec<_>>();

            for i in Index::iter_all() {
                if indices.iter().filter(|&&index| index == i).count() > 1 {
                    return Err(anyhow!("duplicate seed: {}", Seed::from(i)));
                }
            }
        }

        if teams_map.0.len() != 16 {
            return Err(anyhow!(
                "there must be exactly 16 teams ({} teams recognised)",
                teams_map.0.len(),
            ));
        }

        // Sorting here establishes the central invariant for `Teams`: every
        // parallel array is indexed by zero-based initial seed.
        let mut teams = teams_map.0.into_iter().collect::<Vec<_>>();
        teams.sort_by_key(|(_, data)| data.seed);

        let teams = teams
            .into_iter()
            .map(|(name, data)| (name, data.rating))
            .collect::<Vec<_>>();

        let ratings = teams
            .iter()
            .map(|(_, rating)| *rating)
            .collect::<Vec<_>>()
            .try_into()
            .map_err(|_| anyhow!("failed to allocate array"))?;

        let names = teams
            .into_iter()
            .map(|(name, _)| name)
            .collect::<Vec<_>>()
            .try_into()
            .map_err(|_| anyhow!("failed to allocate array"))?;

        Ok(Self { names, ratings })
    }
}

impl From<&Teams> for Map {
    fn from(teams: &Teams) -> Self {
        Self(
            (0..16)
                .map(|i| {
                    (
                        teams.names[i].clone(),
                        Team {
                            seed: Seed::try_new(i as u16 + 1).unwrap(),
                            rating: teams.ratings[i],
                        },
                    )
                })
                .collect(),
        )
    }
}