glazier-react-widget-1.0.0.0: Generic widget library using glazier-react

Safe HaskellNone
LanguageHaskell2010

Glazier.React.Widgets.Collection

Contents

Synopsis

Documentation

type family HKD f a where ... Source #

Equations

HKD Identity a = a 
HKD f a = f a 

data UKey Source #

A key where you can always create another key ordered between two different keys, or another key above or below this key. Memonic: U for uncountable https://en.wikipedia.org/wiki/Uncountable_set

Instances
Eq UKey Source #

For comparison purposes, an empty list is equivalent to [0,0,..]

Instance details

Defined in Glazier.React.Widgets.Collection

Methods

(==) :: UKey -> UKey -> Bool #

(/=) :: UKey -> UKey -> Bool #

Ord UKey Source #

For comparison purposes, an empty list is equivalent to [0,0,..]

Instance details

Defined in Glazier.React.Widgets.Collection

Methods

compare :: UKey -> UKey -> Ordering #

(<) :: UKey -> UKey -> Bool #

(<=) :: UKey -> UKey -> Bool #

(>) :: UKey -> UKey -> Bool #

(>=) :: UKey -> UKey -> Bool #

max :: UKey -> UKey -> UKey #

min :: UKey -> UKey -> UKey #

Show UKey Source # 
Instance details

Defined in Glazier.React.Widgets.Collection

Methods

showsPrec :: Int -> UKey -> ShowS #

show :: UKey -> String #

showList :: [UKey] -> ShowS #

Generic UKey Source # 
Instance details

Defined in Glazier.React.Widgets.Collection

Associated Types

type Rep UKey :: * -> * #

Methods

from :: UKey -> Rep UKey x #

to :: Rep UKey x -> UKey #

type Rep UKey Source # 
Instance details

Defined in Glazier.React.Widgets.Collection

type Rep UKey = D1 (MetaData "UKey" "Glazier.React.Widgets.Collection" "glazier-react-widget-1.0.0.0-6HV9uwI557lI53FjkcrH3T" True) (C1 (MetaCons "UKey" PrefixI True) (S1 (MetaSel (Just "unUKey") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Int])))

smallerUKey :: UKey -> UKey Source #

Create a key smaller than the input key.

largerUKey :: UKey -> UKey Source #

Create a key larger than the input key.

betweenUKey :: UKey -> UKey -> UKey Source #

Make a key that will fit in between the two provided keys, with no guarantees on how close it is to the mid point. Except when the inputs are equal, then it will return the same key.

Collection

type Collection t s f = t (HKD f s) Source #

Collection of higher kinded data

type HKCollection t s f = t (HKD f (s f)) Source #

Collection of higher kinded "higher kinded data"

collectionWindow :: (Functor t, Foldable t) => ReactId -> Window (t (Subject s)) () Source #

Collection doesn't have an initializing gadget since the Subjects in the model are all initialized via addSubject.

deleteCollectionItem :: (MonadReactor p allS cmd m, Ord k) => k -> ModelState (Map k (Subject s)) (m ()) Source #

insertCollectionItem :: (MonadReactor p allS cmd m, Ord k) => k -> Subject s -> ModelState (Map k (Subject s)) (m ()) Source #