Frenetic.Pattern

Documentation

class Eq a => Matchable a where

A class for types that compose similar to wildcards.

All instances must satisfy the following:

• match defines a partial order; top is the top element of this order and intersect is a meet.
• Meets are exact: if match x y and match x z, then match x (fromJust (intersect y z)), if such a meet exists.

Minimal complete definition: top and intersect.

Methods

top :: a

intersect :: a -> a -> Maybe a

match :: a -> a -> Bool

overlap :: a -> a -> Bool

disjoint :: a -> a -> Bool

Instances

Matchable IPAddressPrefix

Matchable Match

Matchable Predicate

Matchable Pattern

Eq a => Matchable (Maybe a)

Bits a => Matchable (Prefix a)

Eq a => Matchable (Wildcard a)

Matchable (PatternImpl ())

Matchable (PatternImpl OpenFlow)

data Wildcard a

Constructors

Exact a

Wildcard

Instances

Functor Wildcard

Eq a => Eq (Wildcard a)

Ord a => Ord (Wildcard a)

Show a => Show (Wildcard a)

Eq a => Matchable (Wildcard a)

data Prefix a

Constructors

Prefix a Int

Instances

Eq a => Eq (Prefix a)

Ord a => Ord (Prefix a)

(Bits a, Show a) => Show (Prefix a)

Bits a => Matchable (Prefix a)

wMatch :: Eq a => a -> Wildcard a -> Bool