Shrub-0.1.0.0: 4-way trie fuzzy search

Safe HaskellSafe-Inferred
LanguageHaskell2010

Shrub

Synopsis

Documentation

data Shrub a Source

Constructors

Branch !(Shrub a) !(Shrub a) !(Shrub a) !(Shrub a) 
Leaf !a 
Empty 

Instances

Show a => Show (Shrub a) 

addShrub :: Shrub a -> String -> a -> Shrub a Source

fromList :: [(String, a)] -> Shrub a Source

searchShrub :: Eq b => Shrub b -> String -> Int -> [(Int, b)] Source

searchShrub' :: Shrub a -> String -> Int -> [(Int, a)] Source

perfMatch' :: Shrub a -> String -> Int -> [(Int, a)] Source

searchShrub'' :: Shrub a -> String -> Int -> Int -> [(Int, a)] Source

searchShrubNE :: Eq a => Shrub a -> String -> a -> Int -> Int -> [(Int, a)] Source

Search Shrub with constraint to ignore a result

searchShrub3 :: Shrub a -> String -> Int -> Int -> [(Int, a)] Source

Give you nid 1 cost indel, then remaining 2 cost indels

searchShrubTM :: Int -> Shrub a -> String -> Int -> [(Int, a)] Source

Melting point shrub search

searchShrubPN :: Int -> Shrub a -> String -> Int -> [(Int, a)] Source

searchShrubTK :: Int -> Shrub a -> String -> Int -> [(Int, a)] Source

searchShrubTK2 :: Int -> Shrub a -> String -> Int -> Int -> [(Int, a)] Source

searchShrubTK3 :: Int -> Shrub a -> String -> Int -> Int -> [(Int, a)] Source

searchShrubXF :: Shrub a -> String -> Int -> Bool -> [(Int, a)] Source

searchShrubIT :: Shrub a -> String -> Int -> [(Int, (a, String))] Source

IonTorrent Shrub search

nubMax :: (Ord a, Eq b) => [(a, b)] -> [(a, b)] Source

searchShrubCount :: Shrub a -> String -> Int -> [(Int, Int, a)] Source