Module

Data.Table.Internal

Package: purescript-tables
Repository: colehaus/purescript-tables

#Table Source

newtype Table rowId columnId cell

Constructors

MkTable { cells :: HashMap (Tuple rowId columnId) cell }

Instances

Generic (Table rowId columnId cell) _
(Eq rowId, Eq columnId, Eq cell) => Eq (Table rowId columnId cell)
(Show rowId, Show columnId, Show cell) => Show (Table rowId columnId cell)

#MissingCell Source

newtype MissingCell rowId columnId

Constructors

MkMissingCell (Tuple rowId columnId)

Instances

Generic (MissingCell rowId columnId) _
(Eq rowId, Eq columnId) => Eq (MissingCell rowId columnId)
(Ord rowId, Ord columnId) => Ord (MissingCell rowId columnId)
(Show rowId, Show columnId) => Show (MissingCell rowId columnId)
(Hashable rowId, Hashable columnId) => Hashable (MissingCell rowId columnId)

#valid Source

valid :: forall cell columnId rowId. Hashable rowId => Hashable columnId => Table rowId columnId cell -> Either (HashSet (MissingCell rowId columnId)) Unit

#mk Source

mk :: forall columnId rowId cell. Hashable rowId => Hashable columnId => HashMap (Tuple rowId columnId) cell -> Either (HashSet (MissingCell rowId columnId)) (Table rowId columnId cell)

#vectors Source

vectors :: forall columnId rowId cell id. Hashable id => Hashable rowId => Hashable columnId => Hashable cell => (Tuple rowId columnId -> id) -> Table rowId columnId cell -> HashSet (HashMap (Tuple rowId columnId) cell)

#vectors' Source

vectors' :: forall columnId rowId cell idr id. Hashable id => Hashable idr => (Tuple rowId columnId -> id) -> (Tuple rowId columnId -> idr) -> Table rowId columnId cell -> HashMap id (HashMap idr cell)

#vector Source

vector :: forall cell columnId rowId rid id. Eq id => Hashable rid => (Tuple rowId columnId -> id) -> (Tuple rowId columnId -> rid) -> Table rowId columnId cell -> id -> HashMap rid cell

#mapVectors Source

mapVectors :: forall idr id cell2 cell1 columnId rowId. Hashable id => Hashable rowId => Hashable columnId => Hashable cell1 => Hashable idr => (Tuple rowId columnId -> id) -> (Tuple rowId columnId -> idr) -> (id -> idr -> Tuple rowId columnId) -> (HashMap idr cell1 -> HashMap idr cell2) -> Table rowId columnId cell1 -> Either (HashSet (MissingCell rowId columnId)) (Table rowId columnId cell2)

The mapping function should preserve the length of the list. If it doesn't, you'll end up

Modules: Data.Table; Data.Table.Internal