Safe HaskellNone

LSC.SuffixTree

Documentation

data SuffixTree a Source #

Constructors

SuffixTree (Vector a) SuffixArray LCP 

Instances

Instances details
Show a => Show (SuffixTree a) Source # 
Instance details

Defined in LSC.SuffixTree

Methods

showsPrec :: Int -> SuffixTree a -> ShowS

show :: SuffixTree a -> String

showList :: [SuffixTree a] -> ShowS

type SuffixArray = Vector (Position, Suffix) Source #

type LCP = Vector (Position, Length) Source #

type Position = Int Source #

type Suffix = Vector Int Source #

type Length = Int Source #

divideSuffixTree :: Int -> [Int] -> Int -> Vector a -> SuffixTree a -> SuffixTree a Source #

cutSuffixArray :: Int -> Int -> Int -> SuffixArray -> SuffixArray Source #

constructSuffixTree :: (a -> Int) -> Vector a -> SuffixTree a Source #

constructSuffixArray :: (a -> Int) -> Vector a -> SuffixArray Source #

constructLcp :: SuffixArray -> LCP Source #

maximalRepeatsDisjoint :: SuffixTree a -> (a -> Int) -> Int -> [(Length, [Position], Int)] Source #

findmaxr :: SuffixTree a -> (a -> Int) -> Int -> ST s [(Length, [Position])] Source #

commonPrefix :: (Int, Int) -> Int -> Int Source #

longestSubString :: SuffixTree a -> (Int, Int) Source #

radixSortBy :: (a -> Int) -> Vector a -> Vector a Source #

suffixArraySortBy :: (a -> a -> Ordering) -> Vector a -> Vector a Source #

introSortBy :: (a -> a -> Ordering) -> Vector a -> Vector a Source #