google-search-0.0.1.0: EDSL for Google and GMail search expressions

Safe HaskellNone

Language.Google.Search.Simple

Contents

Synopsis

Units

data Duration Source

Constructors

Days 
Months 
Years 

Instances

data Size Source

Constructors

Bytes 
KBytes 
MBytes 

Instances

class SearchBuilder e whereSource

Render a search expression using Google search syntax.

Primitive Terms

data Term Source

Fuzzy terms are grouped with parentheses (if necessary), while Exact terms are always “double-quoted”. The IsString instance defaults to Fuzzy, so a "literal string" ∷ Term may be used.

Constructors

Fuzzy Text 
Exact Text 

data BooleanF e Source

The shape of Boolean expressions.

Constructors

Not e 
And [e] 
Or [e] 

type BooleanM = Free BooleanFSource

The free Boolean-shaped monad: comes with an IsString instance so we can write "simple queries" :: Simple. No refunds.

type Simple = BooleanM TermSource

Simple Boolean combinations of Terms.

fAnd :: [BooleanM a] -> BooleanM aSource

Conjunction on a list of BooleanM expressions.

fOr :: [BooleanM a] -> BooleanM aSource

Disjunction on a list of BooleanM expressions.

fNot :: BooleanM a -> BooleanM aSource

Negation of a BooleanM expression.