| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.ECTA.Internal.Paths.Zipper
Description
These were used in an earlier version of the enumeration algorithm, but no longer.
They are being kept around just in case.
Synopsis
- unionPathTrie :: PathTrie -> PathTrie -> Maybe PathTrie
- data InvertedPathTrie
- data PathTrieZipper = PathTrieZipper !PathTrie !InvertedPathTrie
- emptyPathTrieZipper :: PathTrieZipper
- pathTrieToZipper :: PathTrie -> PathTrieZipper
- zipperCurPathTrie :: PathTrieZipper -> PathTrie
- pathTrieZipperDescend :: PathTrieZipper -> Int -> PathTrieZipper
- pathTrieZipperAscend :: PathTrieZipper -> Int -> PathTrieZipper
- unionPathTrieZipper :: PathTrieZipper -> PathTrieZipper -> Maybe PathTrieZipper
Documentation
data InvertedPathTrie Source #
Constructors
| PathZipperRoot | |
| PathTrieAt !Int !PathTrie !InvertedPathTrie |
Instances
| Eq InvertedPathTrie Source # | |
Defined in Data.ECTA.Internal.Paths.Zipper Methods (==) :: InvertedPathTrie -> InvertedPathTrie -> Bool # (/=) :: InvertedPathTrie -> InvertedPathTrie -> Bool # | |
| Ord InvertedPathTrie Source # | |
Defined in Data.ECTA.Internal.Paths.Zipper Methods compare :: InvertedPathTrie -> InvertedPathTrie -> Ordering # (<) :: InvertedPathTrie -> InvertedPathTrie -> Bool # (<=) :: InvertedPathTrie -> InvertedPathTrie -> Bool # (>) :: InvertedPathTrie -> InvertedPathTrie -> Bool # (>=) :: InvertedPathTrie -> InvertedPathTrie -> Bool # max :: InvertedPathTrie -> InvertedPathTrie -> InvertedPathTrie # min :: InvertedPathTrie -> InvertedPathTrie -> InvertedPathTrie # | |
| Show InvertedPathTrie Source # | |
Defined in Data.ECTA.Internal.Paths.Zipper Methods showsPrec :: Int -> InvertedPathTrie -> ShowS # show :: InvertedPathTrie -> String # showList :: [InvertedPathTrie] -> ShowS # | |
data PathTrieZipper Source #
Constructors
| PathTrieZipper !PathTrie !InvertedPathTrie |
Instances
| Eq PathTrieZipper Source # | |
Defined in Data.ECTA.Internal.Paths.Zipper Methods (==) :: PathTrieZipper -> PathTrieZipper -> Bool # (/=) :: PathTrieZipper -> PathTrieZipper -> Bool # | |
| Ord PathTrieZipper Source # | |
Defined in Data.ECTA.Internal.Paths.Zipper Methods compare :: PathTrieZipper -> PathTrieZipper -> Ordering # (<) :: PathTrieZipper -> PathTrieZipper -> Bool # (<=) :: PathTrieZipper -> PathTrieZipper -> Bool # (>) :: PathTrieZipper -> PathTrieZipper -> Bool # (>=) :: PathTrieZipper -> PathTrieZipper -> Bool # max :: PathTrieZipper -> PathTrieZipper -> PathTrieZipper # min :: PathTrieZipper -> PathTrieZipper -> PathTrieZipper # | |
| Show PathTrieZipper Source # | |
Defined in Data.ECTA.Internal.Paths.Zipper Methods showsPrec :: Int -> PathTrieZipper -> ShowS # show :: PathTrieZipper -> String # showList :: [PathTrieZipper] -> ShowS # | |
pathTrieZipperAscend :: PathTrieZipper -> Int -> PathTrieZipper Source #
The semantics of this may not be what you expect: Path trie zippers do not support editing currently, only traversing. The value at the cursor (as well as the index) is ignored except when traversing above the root, where it uses those values to extend the path trie upwards.