Safe Haskell | None |
---|
- type URI = String
- type URIWithLevel = (URI, Int)
- type URIs = URIs' ()
- type URIsWithLevel = URIs' Int
- type URIs' a = PrefixTree a
- emptyURIs :: URIs' a
- singletonURIs :: URI -> URIs
- singletonURIs' :: URI -> a -> URIs' a
- nullURIs :: URIs' a -> Bool
- memberURIs :: URI -> URIs' a -> Bool
- cardURIs :: URIs' a -> Int
- nextURI :: URIs' a -> (URI, a)
- nextURIs :: Int -> URIs' a -> [(URI, a)]
- insertURI :: URI -> URIs -> URIs
- insertURI' :: URI -> a -> URIs' a -> URIs' a
- deleteURI :: URI -> URIs' a -> URIs' a
- deleteURIs :: URIs' b -> URIs' a -> URIs' a
- unionURIs :: URIs -> URIs -> URIs
- unionURIs' :: (a -> a -> a) -> URIs' a -> URIs' a -> URIs' a
- diffURIs :: URIs' a -> URIs' a -> URIs' a
- fromListURIs :: [URI] -> URIs
- fromListURIs' :: [(URI, a)] -> URIs' a
- toListURIs :: URIs' a -> [URI]
- toListURIs' :: URIs' a -> [(URI, a)]
- foldURIs :: (URI -> b -> b) -> b -> URIs -> b
- foldURIs' :: (URI -> a -> b -> b) -> b -> URIs' a -> b
Documentation
type URIWithLevel = (URI, Int)Source
A set of URIs implemeted as a prefix tree. This implementation is space efficient, because of many equal prefixes in the crawled set of URIs
type URIsWithLevel = URIs' IntSource
type URIs' a = PrefixTree aSource
singletonURIs :: URI -> URIsSource
singletonURIs' :: URI -> a -> URIs' aSource
memberURIs :: URI -> URIs' a -> BoolSource
insertURI' :: URI -> a -> URIs' a -> URIs' aSource
deleteURIs :: URIs' b -> URIs' a -> URIs' aSource
unionURIs' :: (a -> a -> a) -> URIs' a -> URIs' a -> URIs' aSource
fromListURIs :: [URI] -> URIsSource
fromListURIs' :: [(URI, a)] -> URIs' aSource
toListURIs :: URIs' a -> [URI]Source
toListURIs' :: URIs' a -> [(URI, a)]Source