Ideas.Common.Id

Many entities of the Ideas framework carry an Id for identification. Identifiers have a hierarchical structure of an arbitrary depth (e.g. algebra.equation or a.b.c). Valid symbols for identifiers are the alpha-numerical characters, together with - and _. Each identifier carries a description and a hash value for fast comparison.

Functionality for identifiers is provided by means of three type classes:

• Type class IsId for constructing identifiers
• Type class HasId for accessing (and changing) the identifier of an entity. Instances of this type class must always have exactly one identifier (although this identifier can be empty).
• Type class Identify for labeling entities with an identifier. Instances of this type class typically allow labels to appear at multiple locations within their structure.

The Id datatype implements and re-exports the Monoid interface.

Constructing identifiers

data Id

Abstract data type for identifiers with a hierarchical name, carrying a description. The data type provides a fast comparison implementation.

Instances

Eq Id

Methods

(==) :: Id -> Id -> Bool

(/=) :: Id -> Id -> Bool

Ord Id

Methods

compare :: Id -> Id -> Ordering

(<) :: Id -> Id -> Bool

(<=) :: Id -> Id -> Bool

(>) :: Id -> Id -> Bool

(>=) :: Id -> Id -> Bool

max :: Id -> Id -> Id

min :: Id -> Id -> Id

Read Id

Methods

readsPrec :: Int -> ReadS Id

readList :: ReadS [Id]

readPrec :: ReadPrec Id

readListPrec :: ReadPrec [Id]

Show Id

Methods

showsPrec :: Int -> Id -> ShowS

show :: Id -> String

showList :: [Id] -> ShowS

Semigroup Id

Methods

(<>) :: Id -> Id -> Id

sconcat :: NonEmpty Id -> Id

stimes :: Integral b => b -> Id -> Id

Monoid Id

Methods

mempty :: Id

mappend :: Id -> Id -> Id

mconcat :: [Id] -> Id

Arbitrary Id

Methods

arbitrary :: Gen Id

shrink :: Id -> [Id]

HasId Id

Methods

getId :: Id -> Id

changeId :: (Id -> Id) -> Id -> Id

IsId Id

Methods

newId :: Id -> Id

concatId :: [Id] -> Id

class IsId a where

Type class IsId for constructing identifiers. Examples are newId "algebra.equation", newId ("a", "b", "c"), and newId () for the empty identifier.

Minimal complete definition

newId

Methods

newId :: a -> Id

concatId :: [a] -> Id

Instances

IsId Char

Methods

newId :: Char -> Id

concatId :: [Char] -> Id

IsId ()

Methods

newId :: () -> Id

concatId :: [()] -> Id

IsId Id

Methods

newId :: Id -> Id

concatId :: [Id] -> Id

IsId a => IsId [a]

Methods

newId :: [a] -> Id

concatId :: [[a]] -> Id

IsId a => IsId (Maybe a)

Methods

newId :: Maybe a -> Id

concatId :: [Maybe a] -> Id

(IsId a, IsId b) => IsId (Either a b)

Methods

newId :: Either a b -> Id

concatId :: [Either a b] -> Id

(IsId a, IsId b) => IsId (a, b)

Methods

newId :: (a, b) -> Id

concatId :: [(a, b)] -> Id

(IsId a, IsId b, IsId c) => IsId (a, b, c)

Methods

newId :: (a, b, c) -> Id

concatId :: [(a, b, c)] -> Id

(#) :: (IsId a, IsId b) => a -> b -> Id infixr 8

Appends two identifiers. Both parameters are overloaded.

Accessing (and changing) identifiers

class HasId a where

Type classfor accessing (and changing) the identifier of an entity.

Minimal complete definition

getId, changeId

Methods

getId :: a -> Id

changeId :: (Id -> Id) -> a -> a

Instances

HasId Id

Methods

getId :: Id -> Id

changeId :: (Id -> Id) -> Id -> Id

HasId ViewPackage

Methods

getId :: ViewPackage -> Id

changeId :: (Id -> Id) -> ViewPackage -> ViewPackage

HasId Symbol

Methods

getId :: Symbol -> Id

changeId :: (Id -> Id) -> Symbol -> Symbol

HasId Binding

Methods

getId :: Binding -> Id

changeId :: (Id -> Id) -> Binding -> Binding

HasId Service

Methods

getId :: Service -> Id

changeId :: (Id -> Id) -> Service -> Service

HasId DomainReasoner

Methods

getId :: DomainReasoner -> Id

changeId :: (Id -> Id) -> DomainReasoner -> DomainReasoner

HasId (Predicate a)

Methods

getId :: Predicate a -> Id

changeId :: (Id -> Id) -> Predicate a -> Predicate a

HasId (Constraint a)

Methods

getId :: Constraint a -> Id

changeId :: (Id -> Id) -> Constraint a -> Constraint a

HasId (Ref a)

Methods

getId :: Ref a -> Id

changeId :: (Id -> Id) -> Ref a -> Ref a

HasId (RewriteRule a)

Methods

getId :: RewriteRule a -> Id

changeId :: (Id -> Id) -> RewriteRule a -> RewriteRule a

HasId (Rule a)

Methods

getId :: Rule a -> Id

changeId :: (Id -> Id) -> Rule a -> Rule a

HasId (Decl f)

Methods

getId :: Decl f -> Id

changeId :: (Id -> Id) -> Decl f -> Decl f

HasId (Dynamic a)

Methods

getId :: Dynamic a -> Id

changeId :: (Id -> Id) -> Dynamic a -> Dynamic a

HasId (Leaf a)

Methods

getId :: Leaf a -> Id

changeId :: (Id -> Id) -> Leaf a -> Leaf a

HasId (LabeledStrategy a)

Methods

getId :: LabeledStrategy a -> Id

changeId :: (Id -> Id) -> LabeledStrategy a -> LabeledStrategy a

HasId (Exercise a)

Methods

getId :: Exercise a -> Id

changeId :: (Id -> Id) -> Exercise a -> Exercise a

HasId (State a)

Methods

getId :: State a -> Id

changeId :: (Id -> Id) -> State a -> State a

(HasId a, HasId b) => HasId (Either a b)

Methods

getId :: Either a b -> Id

changeId :: (Id -> Id) -> Either a b -> Either a b

HasId (Isomorphism a b)

Methods

getId :: Isomorphism a b -> Id

changeId :: (Id -> Id) -> Isomorphism a b -> Isomorphism a b

HasId (View a b)

Methods

getId :: View a b -> Id

changeId :: (Id -> Id) -> View a b -> View a b

unqualified :: HasId a => a -> String

Get the unqualified part of the identifier (i.e., last string).

qualifiers :: HasId a => a -> [String]

Get the list of qualifiers of the identifier (i.e., everything but the last string).

qualification :: HasId a => a -> String

Get the qualified part of the identifier. If the identifier consists of more than one part, the parts are separated by a period (.).

describe :: HasId a => String -> a -> a

Give a description for the current entity. If there already is a description, both strings are combined.

description :: HasId a => a -> String

Get the current description.

showId :: HasId a => a -> String

Show the identifier.

compareId :: HasId a => a -> a -> Ordering

Compare two identifiers based on their names. Use compare for a fast ordering based on hash values.

Labeling with identifiers

class HasId a => Identify a where

Type class for labeling entities with an identifier

Minimal complete definition

(@>)

Methods

(@>) :: IsId n => n -> a -> a

Instances

Identify (Predicate a)

Methods

(@>) :: IsId n => n -> Predicate a -> Predicate a

Identify (Isomorphism a b)

Methods

(@>) :: IsId n => n -> Isomorphism a b -> Isomorphism a b

Identify (View a b)

Methods

(@>) :: IsId n => n -> View a b -> View a b

module Data.Monoid

(<>) :: Semigroup a => a -> a -> a infixr 6

An associative operation.

(a <> b) <> c = a <> (b <> c)

If a is also a Monoid we further require

(<>) = mappend