Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
>=. ) :: forall v typ . PersistField typ => EntityField v typ -> typ -> Filter vpersistent-redis Database.Persist.Redis Greater-than or equal check.
Examples
selectGreaterEqualAge :: MonadIO m => ReaderT SqlBackend m [Entity User] selectGreaterEqualAge = selectList [UserAge >=. 41 ] []
The above query when applied on dataset-1, will produce this:+-----+-----+-----+ |id |name |age | +-----+-----+-----+ |2 |Simon|41 | +-----+-----+-----+
(
||. ) :: [Filter v] -> [Filter v] -> [Filter v]persistent-redis Database.Persist.Redis The OR of two lists of filters. For example:
selectList ([ PersonAge >. 25 , PersonAge <. 30 ] ||. [ PersonIncome >. 15000 , PersonIncome <. 25000 ]) []
will filter records where a person's age is between 25 and 30 or a person's income is between (15000 and 25000). If you are looking for an (&&.) operator to do (A AND B AND (C OR D)) you can use the (++) operator instead as there is no (&&.). For example:selectList ([ PersonAge >. 25 , PersonAge <. 30 ] ++ ([PersonCategory ==. 1] ||. [PersonCategory ==. 5])) []
will filter records where a person's age is between 25 and 30 and (person's category is either 1 or 5).(
<.> ) :: RawFilePath -> ByteString -> RawFilePathposix-paths System.Posix.FilePath Operator version of addExtension
(
@>. ) :: Ord a => Range a -> a -> Boolpostgresql-typed Database.PostgreSQL.Typed.Range Contains element
(
<.> ) :: Numeric t => Vector t -> Vector t -> tqchas QC An infix synonym for dot
>>> vector [1,2,3,4] <.> vector [-2,0,1,1] 5.0
>>> let 𝑖 = 0:+1 :: C >>> fromList [1+𝑖,1] <.> fromList [1,1+𝑖] 2.0 :+ 0.0
(
++. ) :: AddL n m v w => RangeL n m a -> RangeL v w a -> RangeL (n + v) (m + w) aranged-list Data.List.Length To concatenate two lists whose types are RangeL n m a and RangeL v w a.
>>> :set -XDataKinds >>> sampleAddL1 = 'f' :. 'o' :. 'o' :.. NilL :: RangeL 2 5 Char >>> sampleAddL2 = 'b' :. 'a' :.. 'r' :.. NilL :: RangeL 1 6 Char >>> sampleAddL1 ++. sampleAddL2 'f' :. ('o' :. ('o' :. ('b' :.. ('a' :.. ('r' :.. NilL))))) >>> :type sampleAddL1 ++. sampleAddL2 sampleAddL1 ++. sampleAddL2 :: RangeL 3 11 Char(
++.+ ) :: LeftToRight n m v w => RangeR n m a -> RangeL v w a -> RangeR (n + v) (m + w) aranged-list Data.List.Length To concatenate a right-list and a left-list and return a right-list.
>>> :set -XDataKinds >>> sampleLeftToRight1 = NilR :++ 'f' :++ 'o' :+ 'o' :: RangeR 1 4 Char >>> sampleLeftToRight2 = 'b' :. 'a' :. 'r' :.. NilL :: RangeL 2 3 Char >>> sampleLeftToRight1 ++.+ sampleLeftToRight2 (((((NilR :++ 'f') :++ 'o') :++ 'o') :+ 'b') :+ 'a') :+ 'r' >>> :type sampleLeftToRight1 ++.+ sampleLeftToRight2 sampleLeftToRight1 ++.+ sampleLeftToRight2 :: RangeR 3 7 Char
(
++.. ) :: RightToLeft n m v w => RangeR n m a -> RangeL v w a -> RangeL (n + v) (m + w) aranged-list Data.List.Length To concatenate a right-list and a left-list and return a left-list.
>>> :set -XDataKinds >>> sampleRightToLeft1 = NilR :++ 'f' :++ 'o' :+ 'o' :: RangeR 1 4 Char >>> sampleRightToLeft2 = 'b' :. 'a' :. 'r' :.. NilL :: RangeL 2 3 Char >>> sampleRightToLeft1 ++.. sampleRightToLeft2 'f' :. ('o' :. ('o' :. ('b' :.. ('a' :.. ('r' :.. NilL)))))-
ranged-list Data.List.Length No documentation available.
(
++. ) :: AddL n m v w => RangeL n m a -> RangeL v w a -> RangeL (n + v) (m + w) aranged-list Data.List.Range To concatenate two lists whose types are RangeL n m a and RangeL v w a.
>>> :set -XDataKinds >>> sampleAddL1 = 'f' :. 'o' :. 'o' :.. NilL :: RangeL 2 5 Char >>> sampleAddL2 = 'b' :. 'a' :.. 'r' :.. NilL :: RangeL 1 6 Char >>> sampleAddL1 ++. sampleAddL2 'f' :. ('o' :. ('o' :. ('b' :.. ('a' :.. ('r' :.. NilL))))) >>> :type sampleAddL1 ++. sampleAddL2 sampleAddL1 ++. sampleAddL2 :: RangeL 3 11 Char