Network.Hinquire

Documentation

data Relation

The relation between a key and value time=now or cat!=dog

Constructors

Equal

NEqual

GThan

GThanE

LThan

LThanE

Instances

Eq Relation

Show Relation

data GBool

The boolean operation between a group of Inquires

Constructors

And

Or

Instances

Eq GBool

Show GBool

data WBool

This is an optional negation wrapping an Inquire.

Constructors

NoBool

Not

Instances

Eq WBool

Show WBool

data Inquire k v

The meat of our package. This encapsulates our query logic.

Constructors

Atom

Predicate k Relation v

Group (Inquire k v) GBool (Inquire k v)

Wrap WBool (Inquire k v)

Instances

Biapplicative Inquire

Bitraversable Inquire

Bifunctor Inquire

Bifoldable Inquire

Dyad Inquire

Monoid k => Monad (Inquire k)

Functor (Inquire k)

Monoid k => Applicative (Inquire k)

Foldable (Inquire k)

Traversable (Inquire k)

Monoid k => Alternative (Inquire k)

(Eq k, Eq v) => Eq (Inquire k v)

(Show k, Show v) => Show (Inquire k v)

Monoid (Inquire k v)

class Dyad d where

Methods

bireturn :: a -> b -> d a b

(>>==) :: d a b -> (a -> b -> d e f) -> d e f

Instances

Dyad Inquire

(<&&&>) :: Inquire k v -> Inquire k v -> Inquire k v

Conjoin two Inquires.

(<|||>) :: Inquire k v -> Inquire k v -> Inquire k v

Disjoin two Inquires.

generate :: (Show v, Show k) => Inquire k v -> String

Slap a question mark in front of our inquire.