Hoogle Search
Within LTS Haskell 24.22 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
esqueleto Database.Esqueleto.Experimental.From.Join No documentation available.
-
esqueleto Database.Esqueleto.Internal.Internal A left-precedence pair. Pronounced "and". Used to represent expressions that have been joined together. The precedence behavior can be demonstrated by:
a :& b :& c == ((a :& b) :& c)
See the examples at the beginning of this module to see how this operator is used in JOIN operations. -
esqueleto Database.Esqueleto.Internal.Internal No documentation available.
(
<&> ) :: SqlExpr (Insertion (a -> b)) -> SqlExpr (Value a) -> SqlExpr (Insertion b)esqueleto Database.Esqueleto.Internal.Internal Apply extra SqlExpr Value arguments to a PersistField constructor
(
<&> ) :: SqlExpr (Insertion (a -> b)) -> SqlExpr (Value a) -> SqlExpr (Insertion b)esqueleto Database.Esqueleto.Legacy Apply extra SqlExpr Value arguments to a PersistField constructor
(
?&. ) :: JSONBExpr a -> [Text] -> SqlExpr (Value Bool)esqueleto Database.Esqueleto.PostgreSQL.JSON Requires PostgreSQL version >= 9.4 This operator checks if ALL of the given texts are top-level members of the JSON value on the left. This means a top-level field in an object, a top-level string in an array or just a string value. Examples of the usage of this operator can be found in the Database.Persist.Postgresql.JSON module. (here: https://hackage.haskell.org/package/persistent-postgresql-2.10.0/docs/Database-Persist-Postgresql-JSON.html)
PostgreSQL Documentation
| Type | Description | Example ----+--------+--------------------------------------------------------+---------------------------------------- ?& | text[] | Do all of these array strings exist as top-level keys? | '["a", "b"]'::jsonb ?& array[a, b]
(
.&.? ) :: Bits a => FindClause a -> a -> FindClause afilemanip System.FilePath.Find This operator is useful to check if bits are set in a FileMode.
(
.&&. ) :: JStgExpr -> JStgExpr -> JStgExprghc-lib-parser GHC.JS.Make JS infix bit operators
(
.&. ) :: Bits a => a -> a -> aghc-lib-parser GHC.Prelude.Basic Bitwise "and"
(
<&&> ) :: Applicative f => f Bool -> f Bool -> f Boolghc-lib-parser GHC.Utils.Misc No documentation available.