| Copyright | (c) 2013-2020 Brendan Hay <brendan.g.hay@gmail.com> |
|---|---|
| License | This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. A copy of the MPL can be found in the LICENSE file or you can obtain it at http://mozilla.org/MPL/2.0/. |
| Maintainer | Brendan Hay <brendan.g.hay@gmail.com> |
| Stability | experimental |
| Portability | non-portable (GHC extensions) |
| Safe Haskell | None |
| Language | Haskell2010 |
Text.EDE.Internal.Filters
Description
Warning: this is an internal module, and does not have a stable API or name. Functions in this module may not check or enforce preconditions expected by public modules. Use at your own risk!
Synopsis
- stdlib :: HashMap Text Term
- (@:) :: Quote a => Id -> a -> (Id, Term)
- qpoly2 :: Quote a => Id -> (Value -> Value -> a) -> (Id, Term)
- qnum1 :: Id -> (Scientific -> Scientific) -> (Id, Term)
- qnum2 :: Quote a => Id -> (Scientific -> Scientific -> a) -> (Id, Term)
- qlist1 :: (Quote a, Quote b) => Id -> (Text -> a) -> (Array -> b) -> (Id, Term)
- qcol1 :: (Quote a, Quote b, Quote c) => Id -> (Text -> a) -> (Object -> b) -> (Array -> c) -> (Id, Term)
- headT :: Text -> Value
- lastT :: Text -> Value
- tailT :: Text -> Value
- initT :: Text -> Value
- headV :: Array -> Value
- lastV :: Array -> Value
- tailV :: Array -> Value
- initV :: Array -> Value
- text :: (Text -> Text) -> Text -> Value
- vec :: (Array -> Value) -> Array -> Value
- safe :: b -> (a -> Bool) -> (a -> b) -> a -> b
Documentation
qpoly2 :: Quote a => Id -> (Value -> Value -> a) -> (Id, Term) Source #
Quote a binary function which takes the most general binding value.
qnum1 :: Id -> (Scientific -> Scientific) -> (Id, Term) Source #
Quote an unary numeric function.
qnum2 :: Quote a => Id -> (Scientific -> Scientific -> a) -> (Id, Term) Source #
Quote a binary numeric function.
qlist1 :: (Quote a, Quote b) => Id -> (Text -> a) -> (Array -> b) -> (Id, Term) Source #
Quote a comprehensive set of unary functions to create a binding that supports list collection types.