Safe Haskell	Safe-Inferred
Language	Haskell2010

Tourney.Match.Matrix

Description

Sparse matrices for holding matches

Synopsis

data MatchMatrix
newtype MapByRound a = ByRound (IntMap a)
vectorMapByRound :: Vector a -> MapByRound a
newtype MapByMatches a = ByMatches (IntMap (IntMap a))
createMatchMatrix :: PlayerCount -> STM MatchMatrix
readMatchMatrix :: MatchMatrix -> STM (MapByRound (MapByMatches (Maybe Result)))
getMatch :: MatchMatrix -> RoundNo -> Match -> STM (Maybe (Maybe Result))
getMatches :: MatchMatrix -> RoundNo -> STM (Vector (Match, Maybe Result))
getMatchResults :: MatchMatrix -> RoundNo -> STM (Vector MatchResult)
addMatch :: MatchMatrix -> RoundNo -> Match -> STM ()
setMatchResult :: MatchMatrix -> RoundNo -> Match -> Result -> STM ()
getPendingMatches :: MatchMatrix -> RoundNo -> STM (Vector Match)
pendingMatchCount :: MatchMatrix -> RoundNo -> STM Int
haveAnyPendingMatchesWithin :: MatchMatrix -> RoundNo -> Focus -> STM Bool

Documentation

data MatchMatrix Source #

An abstraction around a mutable store of rounds of matches and their results. Conceptually it stores a matrix of matches by (round, player1, player2), and a variable for the current round.

Instances

Instances details

Generic MatchMatrix Source #
Instance details Defined in Tourney.Match.Matrix Associated Types type Rep MatchMatrix :: Type -> Type Source # Methods from :: MatchMatrix -> Rep MatchMatrix x Source # to :: Rep MatchMatrix x -> MatchMatrix Source #
type Rep MatchMatrix Source #
Instance details Defined in Tourney.Match.Matrix type Rep MatchMatrix

newtype MapByRound a Source #

Constructors

ByRound (IntMap a)

Instances

Instances details

Foldable MapByRound Source #
Instance details Defined in Tourney.Match.Matrix Methods fold :: Monoid m => MapByRound m -> m Source # foldMap :: Monoid m => (a -> m) -> MapByRound a -> m Source # foldMap' :: Monoid m => (a -> m) -> MapByRound a -> m Source # foldr :: (a -> b -> b) -> b -> MapByRound a -> b Source # foldr' :: (a -> b -> b) -> b -> MapByRound a -> b Source # foldl :: (b -> a -> b) -> b -> MapByRound a -> b Source # foldl' :: (b -> a -> b) -> b -> MapByRound a -> b Source # foldr1 :: (a -> a -> a) -> MapByRound a -> a Source # foldl1 :: (a -> a -> a) -> MapByRound a -> a Source # toList :: MapByRound a -> [a] Source # null :: MapByRound a -> Bool Source # length :: MapByRound a -> Int Source # elem :: Eq a => a -> MapByRound a -> Bool Source # maximum :: Ord a => MapByRound a -> a Source # minimum :: Ord a => MapByRound a -> a Source # sum :: Num a => MapByRound a -> a Source # product :: Num a => MapByRound a -> a Source #
Traversable MapByRound Source #
Instance details Defined in Tourney.Match.Matrix Methods traverse :: Applicative f => (a -> f b) -> MapByRound a -> f (MapByRound b) Source # sequenceA :: Applicative f => MapByRound (f a) -> f (MapByRound a) Source # mapM :: Monad m => (a -> m b) -> MapByRound a -> m (MapByRound b) Source # sequence :: Monad m => MapByRound (m a) -> m (MapByRound a) Source #
Functor MapByRound Source #
Instance details Defined in Tourney.Match.Matrix Methods fmap :: (a -> b) -> MapByRound a -> MapByRound b Source # (<$) :: a -> MapByRound b -> MapByRound a Source #
FoldableWithIndex RoundNo MapByRound Source #
Instance details Defined in Tourney.Match.Matrix Methods ifoldMap :: Monoid m => (RoundNo -> a -> m) -> MapByRound a -> m Source # ifoldMap' :: Monoid m => (RoundNo -> a -> m) -> MapByRound a -> m Source # ifoldr :: (RoundNo -> a -> b -> b) -> b -> MapByRound a -> b Source # ifoldl :: (RoundNo -> b -> a -> b) -> b -> MapByRound a -> b Source # ifoldr' :: (RoundNo -> a -> b -> b) -> b -> MapByRound a -> b Source # ifoldl' :: (RoundNo -> b -> a -> b) -> b -> MapByRound a -> b Source #
FunctorWithIndex RoundNo MapByRound Source #
Instance details Defined in Tourney.Match.Matrix Methods imap :: (RoundNo -> a -> b) -> MapByRound a -> MapByRound b Source #
TraversableWithIndex RoundNo MapByRound Source #
Instance details Defined in Tourney.Match.Matrix Methods itraverse :: Applicative f => (RoundNo -> a -> f b) -> MapByRound a -> f (MapByRound b) Source #
TraverseMax RoundNo MapByRound Source #
Instance details Defined in Tourney.Match.Matrix Methods traverseMax :: IndexedTraversal' RoundNo (MapByRound v) v Source #
TraverseMin RoundNo MapByRound Source #
Instance details Defined in Tourney.Match.Matrix Methods traverseMin :: IndexedTraversal' RoundNo (MapByRound v) v Source #
Semigroup a => Monoid (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix Methods mempty :: MapByRound a Source # mappend :: MapByRound a -> MapByRound a -> MapByRound a Source # mconcat :: [MapByRound a] -> MapByRound a Source #
Semigroup a => Semigroup (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix Methods (<>) :: MapByRound a -> MapByRound a -> MapByRound a Source # sconcat :: NonEmpty (MapByRound a) -> MapByRound a Source # stimes :: Integral b => b -> MapByRound a -> MapByRound a Source #
Show a => Show (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix Methods showsPrec :: Int -> MapByRound a -> ShowS Source # show :: MapByRound a -> String Source # showList :: [MapByRound a] -> ShowS Source #
Eq a => Eq (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix Methods (==) :: MapByRound a -> MapByRound a -> Bool Source # (/=) :: MapByRound a -> MapByRound a -> Bool Source #
At (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix Methods at :: Index (MapByRound a) -> Lens' (MapByRound a) (Maybe (IxValue (MapByRound a))) Source #
Ixed (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix Methods ix :: Index (MapByRound a) -> Traversal' (MapByRound a) (IxValue (MapByRound a)) Source #
AsEmpty (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix Methods _Empty :: Prism' (MapByRound a) () Source #
type Index (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix type Index (MapByRound a) = RoundNo
type IxValue (MapByRound a) Source #
Instance details Defined in Tourney.Match.Matrix type IxValue (MapByRound a) = a

vectorMapByRound :: Vector a -> MapByRound a Source #

newtype MapByMatches a Source #

A sparse matrix for storing a map between matches and a value.

Since the two players in Match are guaranteed to be ordered (low, high) we only need to ever check the low->high->match path in the nested intmaps.

Constructors

ByMatches (IntMap (IntMap a))

Instances

Instances details

Foldable MapByMatches Source #
Instance details Defined in Tourney.Match.Matrix Methods fold :: Monoid m => MapByMatches m -> m Source # foldMap :: Monoid m => (a -> m) -> MapByMatches a -> m Source # foldMap' :: Monoid m => (a -> m) -> MapByMatches a -> m Source # foldr :: (a -> b -> b) -> b -> MapByMatches a -> b Source # foldr' :: (a -> b -> b) -> b -> MapByMatches a -> b Source # foldl :: (b -> a -> b) -> b -> MapByMatches a -> b Source # foldl' :: (b -> a -> b) -> b -> MapByMatches a -> b Source # foldr1 :: (a -> a -> a) -> MapByMatches a -> a Source # foldl1 :: (a -> a -> a) -> MapByMatches a -> a Source # toList :: MapByMatches a -> [a] Source # null :: MapByMatches a -> Bool Source # length :: MapByMatches a -> Int Source # elem :: Eq a => a -> MapByMatches a -> Bool Source # maximum :: Ord a => MapByMatches a -> a Source # minimum :: Ord a => MapByMatches a -> a Source # sum :: Num a => MapByMatches a -> a Source # product :: Num a => MapByMatches a -> a Source #
Traversable MapByMatches Source #
Instance details Defined in Tourney.Match.Matrix Methods traverse :: Applicative f => (a -> f b) -> MapByMatches a -> f (MapByMatches b) Source # sequenceA :: Applicative f => MapByMatches (f a) -> f (MapByMatches a) Source # mapM :: Monad m => (a -> m b) -> MapByMatches a -> m (MapByMatches b) Source # sequence :: Monad m => MapByMatches (m a) -> m (MapByMatches a) Source #
Functor MapByMatches Source #
Instance details Defined in Tourney.Match.Matrix Methods fmap :: (a -> b) -> MapByMatches a -> MapByMatches b Source # (<$) :: a -> MapByMatches b -> MapByMatches a Source #
FoldableWithIndex Match MapByMatches Source #
Instance details Defined in Tourney.Match.Matrix Methods ifoldMap :: Monoid m => (Match -> a -> m) -> MapByMatches a -> m Source # ifoldMap' :: Monoid m => (Match -> a -> m) -> MapByMatches a -> m Source # ifoldr :: (Match -> a -> b -> b) -> b -> MapByMatches a -> b Source # ifoldl :: (Match -> b -> a -> b) -> b -> MapByMatches a -> b Source # ifoldr' :: (Match -> a -> b -> b) -> b -> MapByMatches a -> b Source # ifoldl' :: (Match -> b -> a -> b) -> b -> MapByMatches a -> b Source #
FunctorWithIndex Match MapByMatches Source #
Instance details Defined in Tourney.Match.Matrix Methods imap :: (Match -> a -> b) -> MapByMatches a -> MapByMatches b Source #
TraversableWithIndex Match MapByMatches Source #
Instance details Defined in Tourney.Match.Matrix Methods itraverse :: Applicative f => (Match -> a -> f b) -> MapByMatches a -> f (MapByMatches b) Source #
Monoid (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix Methods mempty :: MapByMatches a Source # mappend :: MapByMatches a -> MapByMatches a -> MapByMatches a Source # mconcat :: [MapByMatches a] -> MapByMatches a Source #
Semigroup (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix Methods (<>) :: MapByMatches a -> MapByMatches a -> MapByMatches a Source # sconcat :: NonEmpty (MapByMatches a) -> MapByMatches a Source # stimes :: Integral b => b -> MapByMatches a -> MapByMatches a Source #
Show a => Show (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix Methods showsPrec :: Int -> MapByMatches a -> ShowS Source # show :: MapByMatches a -> String Source # showList :: [MapByMatches a] -> ShowS Source #
Eq a => Eq (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix Methods (==) :: MapByMatches a -> MapByMatches a -> Bool Source # (/=) :: MapByMatches a -> MapByMatches a -> Bool Source #
At (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix Methods at :: Index (MapByMatches a) -> Lens' (MapByMatches a) (Maybe (IxValue (MapByMatches a))) Source #
Ixed (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix Methods ix :: Index (MapByMatches a) -> Traversal' (MapByMatches a) (IxValue (MapByMatches a)) Source #
AsEmpty (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix Methods _Empty :: Prism' (MapByMatches a) () Source #
type Index (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix type Index (MapByMatches a) = Match
type IxValue (MapByMatches a) Source #
Instance details Defined in Tourney.Match.Matrix type IxValue (MapByMatches a) = a

createMatchMatrix :: PlayerCount -> STM MatchMatrix Source #

readMatchMatrix :: MatchMatrix -> STM (MapByRound (MapByMatches (Maybe Result))) Source #

getMatch :: MatchMatrix -> RoundNo -> Match -> STM (Maybe (Maybe Result)) Source #

Get a match

getMatches :: MatchMatrix -> RoundNo -> STM (Vector (Match, Maybe Result)) Source #

getMatchResults :: MatchMatrix -> RoundNo -> STM (Vector MatchResult) Source #

addMatch :: MatchMatrix -> RoundNo -> Match -> STM () Source #

Add a match. It must not exist already in the current round

setMatchResult :: MatchMatrix -> RoundNo -> Match -> Result -> STM () Source #

Set a match result. It must already exist in the current round, by addMatch

getPendingMatches :: MatchMatrix -> RoundNo -> STM (Vector Match) Source #

pendingMatchCount :: MatchMatrix -> RoundNo -> STM Int Source #

haveAnyPendingMatchesWithin :: MatchMatrix -> RoundNo -> Focus -> STM Bool Source #