Copyright	(c) Dong Han 2017-2018
License	BSD
Maintainer	winterland1989@gmail.com
Stability	experimental
Portability	non-portable
Safe Haskell	None
Language	Haskell2010

Z.Data.Text.Search

Contents

element-wise search
Searching by equality

Description

Synopsis

elem :: Char -> Text -> Bool
notElem :: Char -> Text -> Bool
findIndices :: (Char -> Bool) -> Text -> [Int]
findBytesIndices :: (Char -> Bool) -> Text -> [Int]
find :: (Char -> Bool) -> Text -> (Int, Maybe Char)
findR :: (Char -> Bool) -> Text -> (Int, Maybe Char)
findIndex :: (Char -> Bool) -> Text -> Int
findIndexR :: (Char -> Bool) -> Text -> Int
findBytesIndex :: (Char -> Bool) -> Text -> Int
findBytesIndexR :: (Char -> Bool) -> Text -> Int
filter :: (Char -> Bool) -> Text -> Text
partition :: (Char -> Bool) -> Text -> (Text, Text)

element-wise search

elem :: Char -> Text -> Bool Source #

O(n) elem test if given char is in given text.

notElem :: Char -> Text -> Bool Source #

O(n) not . elem

Searching by equality

findIndices :: (Char -> Bool) -> Text -> [Int] Source #

find all char index matching the predicate.

findBytesIndices :: (Char -> Bool) -> Text -> [Int] Source #

find all char's byte index matching the predicate.

find Source #

Arguments

:: (Char -> Bool)
-> Text
-> (Int, Maybe Char)	(char index, matching char)

O(n) find the first char matching the predicate in a text from left to right, if there isn't one, return the text length.

findR Source #

Arguments

:: (Char -> Bool)
-> Text
-> (Int, Maybe Char)	(char index(counting backwards), matching char)

O(n) find the first char matching the predicate in a text from right to left.

findIndex :: (Char -> Bool) -> Text -> Int Source #

O(n) find the char index.

findIndexR :: (Char -> Bool) -> Text -> Int Source #

O(n) find the char index in reverse order.

findBytesIndex :: (Char -> Bool) -> Text -> Int Source #

O(n) find the char's byte slice index.

findBytesIndexR :: (Char -> Bool) -> Text -> Int Source #

O(n) find the char's byte slice index in reverse order(pointing to the right char's first byte).

filter :: (Char -> Bool) -> Text -> Text Source #

O(n) filter, applied to a predicate and a text, returns a text containing those chars that satisfy the predicate.

partition :: (Char -> Bool) -> Text -> (Text, Text) Source #

O(n) The partition function takes a predicate, a text, returns a pair of text with codepoints which do and do not satisfy the predicate, respectively; i.e.,

partition p txt == (filter p txt, filter (not . p) txt)