ST package:hxt

stringEscapeXml :: String -> String

find all positions where a string occurs within another string

stringFirst :: Eq a => [a] -> [a] -> Maybe Int

escape XML chars <, >, ", and ampercent by transforming them into character references see also : attrEscapeXml

stringLast :: Eq a => [a] -> [a] -> Maybe Int

find the position of the first occurence of a string

stringToHexString :: String -> String

find the position of the last occurence of a string

stringToInt :: Int -> String -> Int

convert a string into a hexadecimal string applying charToHexString see also : charToHexString

stringToLower :: String -> String

stringToUpper :: String -> String

convert string to lowercase with standard Haskell toLower function

stringTrim :: String -> String

convert string to uppercase with standard Haskell toUpper function

hxt Text.XML.HXT.DOM.XmlKeywords

remove leading and trailing whitespace with standard Haskell predicate isSpace

stringProtocol :: String

module Control.Arrow.ArrowList

hxt

The list arrow class This module defines the interface for list arrows. A list arrow is a function that gives a list of results for a given argument. A single element result represents a normal function. An empty list often indicates that the function is undefined for the given argument. The empty list may also represent False, non-empty lists True. A list with more than one element gives all results for a so called nondeterministic function.

class (Arrow a, ArrowPlus a, ArrowZero a, ArrowApply a) => ArrowList a

constA :: ArrowList a => c -> a b c

The interface for list arrows Only mkA, isA (>>.) don't have default implementations

constL :: ArrowList a => [c] -> a b c

constructor for a const arrow: constA = arr . const

listA :: ArrowList a => a b c -> a b [c]

constructor for a const arrow: constL = arrL . const

unlistA :: ArrowList a => a [b] b

combinator for converting an arrow into a determinstic version with all results collected in a single element list

listA af = af >>. (:[])

this is useful when the list of results computed by an arrow must be manipulated (e.g. sorted) example for sorting the results of a filter

collectAndSort         :: a b c -> a b c

collectAndSort collect = listA collect >>> arrL sort

ancestorAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

the inverse of listA

listA af >>> unlistA = af

unlistA is defined as arrL id

ancestorOrSelfAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

XPath axis: ancestor

changeThisTree :: (ArrowList a, ArrowIf a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t) => a (t b) (t b) -> a (nt b) (nt b)

XPath axis: ancestor or self

substThisTree :: (ArrowList a, ArrowIf a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t) => t b -> a (nt b) (nt b)

Change the current subtree of a navigatable tree. The arrow for computing the changes should be deterministic. If it fails nothing is changed.