Safe Haskell	None
Language	Haskell2010

Data.DAWG.Trans.Vector

Description

A vector representation of a transition map. Memory efficient, but the insert operation is O(n) with respect to the number of transitions. In particular, complexity of the insert operation can make the construction of a large-alphabet dictionary intractable.

Synopsis

data Trans

Documentation

data Trans Source #

A vector of distinct key/value pairs strictly ascending with respect to key values.

Instances

Eq Trans Source #
Instance details Defined in Data.DAWG.Trans.Vector Methods (==) :: Trans -> Trans -> Bool # (/=) :: Trans -> Trans -> Bool #
Ord Trans Source #
Instance details Defined in Data.DAWG.Trans.Vector Methods compare :: Trans -> Trans -> Ordering # (<) :: Trans -> Trans -> Bool # (<=) :: Trans -> Trans -> Bool # (>) :: Trans -> Trans -> Bool # (>=) :: Trans -> Trans -> Bool # max :: Trans -> Trans -> Trans # min :: Trans -> Trans -> Trans #
Show Trans Source #
Instance details Defined in Data.DAWG.Trans.Vector Methods showsPrec :: Int -> Trans -> ShowS # show :: Trans -> String # showList :: [Trans] -> ShowS #
Binary Trans Source #
Instance details Defined in Data.DAWG.Trans.Vector Methods put :: Trans -> Put # get :: Get Trans # putList :: [Trans] -> Put #
Trans Trans Source #
Instance details Defined in Data.DAWG.Trans.Vector Methods empty :: Trans Source # lookup :: Sym -> Trans -> Maybe ID Source # index :: Sym -> Trans -> Maybe Int Source # byIndex :: Int -> Trans -> Maybe (Sym, ID) Source # insert :: Sym -> ID -> Trans -> Trans Source # fromList :: [(Sym, ID)] -> Trans Source # toList :: Trans -> [(Sym, ID)] Source #
Eq (Hashed Trans) Source #
Instance details Defined in Data.DAWG.Trans.Hashed Methods (==) :: Hashed Trans -> Hashed Trans -> Bool # (/=) :: Hashed Trans -> Hashed Trans -> Bool #
Ord (Hashed Trans) Source #
Instance details Defined in Data.DAWG.Trans.Hashed Methods compare :: Hashed Trans -> Hashed Trans -> Ordering # (<) :: Hashed Trans -> Hashed Trans -> Bool # (<=) :: Hashed Trans -> Hashed Trans -> Bool # (>) :: Hashed Trans -> Hashed Trans -> Bool # (>=) :: Hashed Trans -> Hashed Trans -> Bool # max :: Hashed Trans -> Hashed Trans -> Hashed Trans # min :: Hashed Trans -> Hashed Trans -> Hashed Trans #
(Eq a, Eq b, Unbox a) => Eq (Node Trans a b) Source #
Instance details Defined in Data.DAWG.Node Methods (==) :: Node Trans a b -> Node Trans a b -> Bool # (/=) :: Node Trans a b -> Node Trans a b -> Bool #
(Ord a, Ord b, Unbox a) => Ord (Node Trans a b) Source #
Instance details Defined in Data.DAWG.Node Methods compare :: Node Trans a b -> Node Trans a b -> Ordering # (<) :: Node Trans a b -> Node Trans a b -> Bool # (<=) :: Node Trans a b -> Node Trans a b -> Bool # (>) :: Node Trans a b -> Node Trans a b -> Bool # (>=) :: Node Trans a b -> Node Trans a b -> Bool # max :: Node Trans a b -> Node Trans a b -> Node Trans a b # min :: Node Trans a b -> Node Trans a b -> Node Trans a b #
(Eq b, Eq c, Unbox b) => Eq (DAWG Trans a b c) Source #
Instance details Defined in Data.DAWG.Static Methods (==) :: DAWG Trans a b c -> DAWG Trans a b c -> Bool # (/=) :: DAWG Trans a b c -> DAWG Trans a b c -> Bool #
(Ord b, Ord c, Unbox b) => Ord (DAWG Trans a b c) Source #
Instance details Defined in Data.DAWG.Static Methods compare :: DAWG Trans a b c -> DAWG Trans a b c -> Ordering # (<) :: DAWG Trans a b c -> DAWG Trans a b c -> Bool # (<=) :: DAWG Trans a b c -> DAWG Trans a b c -> Bool # (>) :: DAWG Trans a b c -> DAWG Trans a b c -> Bool # (>=) :: DAWG Trans a b c -> DAWG Trans a b c -> Bool # max :: DAWG Trans a b c -> DAWG Trans a b c -> DAWG Trans a b c # min :: DAWG Trans a b c -> DAWG Trans a b c -> DAWG Trans a b c #