| Copyright | (c) Michael Mounteney, 2017 |
|---|---|
| License | BSD 3 clause |
| Maintainer | the project name, all lower case, at landcroft dot com |
| Stability | experimental |
| Portability | undefined |
| Safe Haskell | None |
| Language | Haskell2010 |
DeckData
Description
A user has a tree-structured hierarchy of views which specify the order in which cards are presented for review; hence the usage of terms _node_ and _end_ in this source.
- userDeckNodes :: forall m. MonadIO m => UserId -> ReaderT (PersistEntityBackend UserDeckNode) m [Entity UserDeckNode]
- userDeckEnds :: forall m. MonadIO m => UserId -> ReaderT (PersistEntityBackend UserDeckEnd) m [Entity UserDeckEnd]
- userDeckEndsViewed :: forall m. MonadIO m => UserId -> [ViewId] -> ReaderT (PersistEntityBackend UserDeckEnd) m [Entity UserDeckEnd]
Documentation
userDeckNodes :: forall m. MonadIO m => UserId -> ReaderT (PersistEntityBackend UserDeckNode) m [Entity UserDeckNode] Source #
Return a list of all deck nodes for the given user.
userDeckEnds :: forall m. MonadIO m => UserId -> ReaderT (PersistEntityBackend UserDeckEnd) m [Entity UserDeckEnd] Source #
Return a list of all deck ends for the given user.
userDeckEndsViewed :: forall m. MonadIO m => UserId -> [ViewId] -> ReaderT (PersistEntityBackend UserDeckEnd) m [Entity UserDeckEnd] Source #
Return a list of all deck nodes for the given user, that refer to one of the given list of view.