Copyright	(c) Oleksandr Zhabenko 2022
License	MIT
Maintainer	oleksandr.zhabenko@yahoo.com
Stability	Experimental
Safe Haskell	Safe-Inferred
Language	Haskell2010

Logical.OrdConstraints

Description

Some simple logical encoding 'syntactical sugar' to represent point-wise or intervals-based logics.

Synopsis

data OrdConstraints a
- = O [a]
- | C [a]
type OrdCs t a = t (OrdConstraints a)
validOrdCs :: Ord a => OrdConstraints a -> Bool
ordCs2Predicate1 :: Ord a => OrdConstraints a -> a -> Bool
ordCs2HPred1 :: (Ord a, Foldable t1) => OrdCs t1 a -> a -> Bool
ordCs2Predicate :: Ord a => OrdConstraints a -> [a] -> Bool
ordCs2HPred :: (Ord a, Foldable t1) => OrdCs t1 a -> [a] -> Bool
ordCs2PredicateG :: (Ord a, Foldable t) => OrdConstraints a -> (t a -> Maybe a) -> t a -> Bool
ordCs2HPredG :: (Ord a, Foldable t, Foldable t1) => OrdCs t1 a -> (t a -> Maybe a) -> t a -> Bool

Documentation

data OrdConstraints a Source #

Data type to encode the simple logical contstraints for some Ordered data type value to be kept in some bounds (to lay in some intervals or points). O constructor encodes point-wise logics, and C encodes intervals logics.

Constructors

O [a]
C [a]

Instances

Instances details

Read a => Read (OrdConstraints a) Source #
Instance details Defined in Logical.OrdConstraints Methods readsPrec :: Int -> ReadS (OrdConstraints a) # readList :: ReadS [OrdConstraints a] # readPrec :: ReadPrec (OrdConstraints a) # readListPrec :: ReadPrec [OrdConstraints a] #
Show a => Show (OrdConstraints a) Source #
Instance details Defined in Logical.OrdConstraints Methods showsPrec :: Int -> OrdConstraints a -> ShowS # show :: OrdConstraints a -> String # showList :: [OrdConstraints a] -> ShowS #
Eq a => Eq (OrdConstraints a) Source #
Instance details Defined in Logical.OrdConstraints Methods (==) :: OrdConstraints a -> OrdConstraints a -> Bool # (/=) :: OrdConstraints a -> OrdConstraints a -> Bool #
Ord a => Ord (OrdConstraints a) Source #
Instance details Defined in Logical.OrdConstraints Methods compare :: OrdConstraints a -> OrdConstraints a -> Ordering # (<) :: OrdConstraints a -> OrdConstraints a -> Bool # (<=) :: OrdConstraints a -> OrdConstraints a -> Bool # (>) :: OrdConstraints a -> OrdConstraints a -> Bool # (>=) :: OrdConstraints a -> OrdConstraints a -> Bool # max :: OrdConstraints a -> OrdConstraints a -> OrdConstraints a # min :: OrdConstraints a -> OrdConstraints a -> OrdConstraints a #

type OrdCs t a = t (OrdConstraints a) Source #

validOrdCs :: Ord a => OrdConstraints a -> Bool Source #

The predicate to check whether the data is encoded logically correct just enough to be used by the functions in the library (minimal necessary validation). Checks whether at least just one point or interval is set.

ordCs2Predicate1 :: Ord a => OrdConstraints a -> a -> Bool Source #

ordCs2HPred1 :: (Ord a, Foldable t1) => OrdCs t1 a -> a -> Bool Source #

ordCs2Predicate :: Ord a => OrdConstraints a -> [a] -> Bool Source #

Just the head of the list is used. Therefore, is intended to be used mainly with the singleton list as the second argument.

ordCs2HPred :: (Ord a, Foldable t1) => OrdCs t1 a -> [a] -> Bool Source #

Just the head of the list is used. Therefore, is intended to be used mainly with the singleton list as the second argument.

ordCs2PredicateG :: (Ord a, Foldable t) => OrdConstraints a -> (t a -> Maybe a) -> t a -> Bool Source #

ordCs2HPredG :: (Ord a, Foldable t, Foldable t1) => OrdCs t1 a -> (t a -> Maybe a) -> t a -> Bool Source #