u\      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~     Z    context  encoding  parser &use foreign DTD? (external entity ref & handler will be called with publicID &  systemID set to null  @Set a skipped entity handler. This is called in two situations: M1. An entity reference is encountered for which no declaration has been read  and this is not an error. C2. An internal entity reference is read, but not expanded, because  XML_SetDefaultHandler has been called. The type of the "external entity reference" callback. See the expat  documentation. The type of the "character data"! callback. The parameter is the M character data processed. This callback may be called more than once while G processing a single conceptual block of text. Return True to continue 5 parsing as normal, or False to terminate the parse. The type of the " element ended") callback. The parameter is the element L name. Return True to continue parsing as normal, or False to terminate the  parse. The type of the "element started"' callback. The first parameter is the K element name; the second are the (attribute, value) pairs. Return True to > continue parsing as normal, or False to terminate the parse. 7Specifies a location of an event within the input text Line number of the event Column number of the event +Byte index of event from start of document !The number of bytes in the event ;Parse error, consisting of message text and error location !4Encoding types available for the document encoding. "#$%&'(Opaque parser type. )* Create a . +, parse data feeds lazy ByteString data into a  . It returns . Nothing on success, or Just the parse error.  parse data feeds strict ByteString data into a  . It returns . Nothing on success, or Just the parse error. context  encoding text parseChunk data False feeds strict ByteString data into a  /. The end of the data is indicated by passing True for the L final parameter. It returns Nothing on success, or Just the parse error. -GMost of the low-level functions take a ParserPtr so are required to be  called inside  withParser. GComputation where parseChunk and other low-level functions may be used .Obtain C value from Haskell /. 012*Attach a StartElementHandler to a Parser. 34 )Attach an EndElementHandler to a Parser. 56!,Attach an CharacterDataHandler to a Parser. 789:"#$  !"#$   !"# $    !"#"$8An exception indicating an XML parse error, used by the  ..Throwing variants. %&'()*+IAn abstraction for any string type you want to use as xml text (that is, A attribute values or element text content). If you want to use a  new string type with hexpat", you must make it an instance of  +. ,-./01234567;The encoding parameter, if provided, overrides the document's  encoding declaration. 8%If provided, entity references (i.e. &nbsp; and friends) will 9 be decoded into text using the supplied lookup function 9;: Converts a < to a + type. =>;JLazily parse XML to SAX events. In the event of an error, FailDocument is & the last element of the output list. Parser options Input text (a lazy ByteString) <DEPRECATED: Use ; instead. JLazily parse XML to SAX events. In the event of an error, FailDocument is B the last element of the output list. Deprecated in favour of new  ; Optional encoding override Input text (a lazy ByteString) =JA variant of parseSAX that gives a document location with each SAX event. Parser options Input text (a lazy ByteString) >DEPRECATED: Use = instead. JA variant of parseSAX that gives a document location with each SAX event. Optional encoding override Input text (a lazy ByteString) ?@Lazily parse XML to SAX events. In the event of an error, throw  %$.  parseThrowingA can throw an exception from pure code, which is generally a bad & way to handle errors, because Haskell's lazy evaluation means it' s hard to I predict where it will be thrown from. However, it may be acceptable in  situations where it'9s not expected during normal operation, depending on the  design of your program. Parser options input text (a lazy ByteString) @DEPRECATED: Use ? instead. @Lazily parse XML to SAX events. In the event of an error, throw  %$. Optional encoding override Input text (a lazy ByteString) AJA variant of parseSAX that gives a document location with each SAX event. ! In the event of an error, throw %$. parseLocationsThrowingA can throw an exception from pure code, which is generally a bad & way to handle errors, because Haskell's lazy evaluation means it' s hard to I predict where it will be thrown from. However, it may be acceptable in  situations where it'9s not expected during normal operation, depending on the  design of your program. Optional encoding override Input text (a lazy ByteString) BDEPRECATED: Used A instead. JA variant of parseSAX that gives a document location with each SAX event. ! In the event of an error, throw %$. Optional encoding override Input text (a lazy ByteString) , $%&'()*+,-./0123456789:;<=>?@AB,  5678&*)(':;=A?9$%<>B@+,-./01234$%%&*)(''()*+ ,-./01234,-./0123456786789:;<=>?@ABCGA class of node types where an Element can be constructed given a tag,  attributes and children. DEFIs the given node an element? GIs the given node text? HKExtract all text content from inside a tag into a single string, including ! any text contained in children. I-Is the given node a tag with the given name? JGet the name of this node if it'-s an element, return empty string otherwise. K"Get the attributes of a node if it'+s an element, return empty list otherwise. LGet children of a node if it'+s an element, return empty list otherwise. M Get this node' s text if it',s a text node, return empty text otherwise. NModify name if it's an element, no-op otherwise. OModify attributes if it's an element, no-op otherwise. P'Modify children (non-recursively) if it's an element, no-op otherwise. Q?Map all tags (both tag names and attribute names) recursively. REMap an element non-recursively, allowing the tag type to be changed. S2Change a node from one container type to another. TCreate a text node UBType shortcut for attributes with unqualified names where tag and  text are the same string type. VType shortcut for attributes WKExtract all text content from inside a tag into a single string, including ! any text contained in children. X:Get the value of the attribute having the specified name. YQSet the value of the attribute with the specified name to the value, overwriting 9 the first existing attribute with that name if present. Z8Delete the first attribute matching the specified name. [setAttribute if Just, deleteAttribute if Nothing. CDEFGHIJKLMNOPQRSTUVWXYZ[VUWEFGHIJKLMNOPQRSTCDXYZ[CDDEFGHIJKLMNOPQRSTFGHIJKLMNOPQRSTUVWXYZ[\IType shortcut for a single node with unqualified tag names where tag and  text are the same string type. ]DEPRECATED: Use [UNode text] instead. AType shortcut for nodes with unqualified tag names where tag and + text are the same string type. Deprecated ^DEPRECATED: Use [Node tag text] instead. Type shortcut for nodes. _CA pure tree representation that uses a list as its container type. `-The tree representation of the XML document. c& is the container type for the element's children, which is usually [], $ except when you are using chunked I/ O with the hexpat-iteratee package. tagC is the tag type, which can either be one of several string types,  or a special type from the Text.XML.Expat.Namespaced or  Text.XML.Expat.Qualified modules. text& is the string type for text content. abcdef?gHStrictly parse XML to tree. Returns error message or valid parsed tree. Parser options !Input text (a strict ByteString) hDEPRECATED: use j instead. HStrictly parse XML to tree. Returns error message or valid parsed tree. Optional encoding override !Input text (a strict ByteString) iPA lower level function that lazily converts a SAX stream into a tree structure. jKLazily parse XML to tree. Note that forcing the XMLParseError return value G will force the entire parse. Therefore, to ensure lazy operation, don't ; check the error status until you have processed the tree. Parser options Input text (a lazy ByteString) kDEPREACTED: Use j instead. KLazily parse XML to tree. Note that forcing the XMLParseError return value G will force the entire parse. Therefore, to ensure lazy operation, don't ; check the error status until you have processed the tree. Optional encoding override Input text (a lazy ByteString) l:Lazily parse XML to tree. In the event of an error, throw %$.  parseThrowingA can throw an exception from pure code, which is generally a bad & way to handle errors, because Haskell's lazy evaluation means it' s hard to I predict where it will be thrown from. However, it may be acceptable in  situations where it'9s not expected during normal operation, depending on the  design of your program. Parser options Input text (a lazy ByteString) mDEPRECATED: Use l instead. :Lazily parse XML to tree. In the event of an error, throw %$. Optional encoding override Input text (a lazy ByteString) R $%&'()*+,-./0123456789<>@BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklm9_`bacde\56789jg  l$%&*)('i+,-./01234f^]kh<>m@B\]^_`bacdeabcdefghijklmQnA cursor specific to Text.XML.Expat.Tree.Node trees. oKGeneralized cursor: The position of a piece of content in an XML document.  n is the Node type and c+ is the list type, which would usually be [],  except when you're using chunked I/O. pq The currently selected content. r%Siblings on the left, closest first. s&Siblings on the right, closest first. t6The contexts of the parent elements of this location. uA path specific to Text.XML.Expat.Tree.Node trees. v)Generalized path within an XML document. wxyz{|"The parent of the given location. }+The top-most parent of the given location. ~7The left sibling of the given location - pure version. FThe left sibling of the given location - used for monadic node types. 8The right sibling of the given location - pure version. GThe right sibling of the given location - used for monadic node types. 6The first child of the given location - pure version. EThe first child of the given location - used for monadic node types. 5The last child of the given location - pure version. DThe last child of the given location - used for monadic node types. 7Find the next left sibling that satisfies a predicate. @7Find the next left sibling that satisfies a predicate. GFind the next right sibling that satisfies a predicate - pure version. AVFind the next right sibling that satisfies a predicate - used for monadic node types. ;The first child that satisfies a predicate - pure version. BJThe first child that satisfies a predicate - used for monadic node types. JThe next position in a left-to-right depth-first traversal of a document: N either the first child, right sibling, or the right sibling of a parent that  has one. Pure version. JThe next position in a left-to-right depth-first traversal of a document: N either the first child, right sibling, or the right sibling of a parent that ' has one. Used for monadic node types. APerform a depth first search for a descendant that satisfies the  given predicate. Pure version. APerform a depth first search for a descendant that satisfies the / given predicate. Used for monadic node types. BThe child with the given index (starting from 0). - pure version. PThe child with the given index (starting from 0) - used for monadic node types. C!private: computes the parent for down operations.  A cursor for the given content. ;The location of the first tree in a forest - pure version. DKThe location of the first tree in a forest - used with monadic node types. ,Computes the tree containing this location. .Computes the forest containing this location. #Are we at the top of the document? <Are we at the left end of the the document? (Pure version.) KAre we at the left end of the the document? (Used for monadic node types.) 9Are we at the right end of the document? (Pure version.) HAre we at the right end of the document? (Used for monadic node types.) &Are we at the bottom of the document? Do we have a parent? CGet the node index inside the sequence of children - pure version. ERGet the node index inside the sequence of children - used for monadic node types. Do we have children? Change the current content. Modify the current content. +Modify the current content - pure version. :Modify the current content - used for monadic node types. 4Modify the current content, allowing for an effect. 4Insert content to the left of the current position. 5Insert content to the right of the current position. 4Insert content to the left of the current position. 5Insert content to the right of the current position. F;Insert content as the first child of the current position. ;Insert content as the first child of the current position. ;Insert content as the first child of the current position. ;Insert content as the first child of the current position. ;Insert content as the first child of the current position. ORemove the content on the left of the current position, if any - pure version. ^Remove the content on the left of the current position, if any - used for monadic node types. PRemove the content on the right of the current position, if any - pure version. ^Remove the content on the left of the current position, if any - used for monadic node types. 4Insert content to the left of the current position. / The new content becomes the current position. 5Insert content to the right of the current position. / The new content becomes the current position. Remove the current element. 8 The new position is the one on the left. Pure version. Remove the current element. 8 The new position is the one on the left. Pure version. Remove the current element. 9 The new position is the one on the right. Pure version. Remove the current element. H The new position is the one on the right. Used for monadic node types. Remove the current element. 5 The new position is the parent of the old position. G+private: Gets the given element of a list. L Also returns the preceding elements (reversed) and the following elements. H0private: combChildren ls x ys = reverse ls ++ [x] ++ rs ls x rs IGnopqrstuvwxyz{|}~Gnopqrstuvwxyz{|}~Gnopqrstpqrstuvwxyzxyz{|}~ 2Type shortcut for attributes with qualified names HType shortcut for a single node where qualified names are used for tags DEPRECATED: Use [QNode text] instead. @Type shortcut for nodes where qualified names are used for tags A qualified name. JQualified names have two parts, a prefix and a local part. The local part E is the name of the tag. The prefix scopes that name to a particular  group of legal tags. LThe prefix will usually be associated with a namespace URI. This is usually > achieved by using xmlns attributes to bind prefixes to URIs. .Make a new QName from a prefix and localPart. !Make a new QName with no prefix. JK3Type shortcut for attributes with namespaced names IType shortcut for a single node where namespaced names are used for tags DEPRECATED: Use [NNode text] instead. BType shortcut for nodes where namespaced names are used for tags. A namespace-qualified tag. XNName has two components, a local part and an optional namespace. The local part is the U name of the tag. The namespace is the URI identifying collections of declared tags. \ Tags with the same local part but from different namespaces are distinct. Unqualified tags T are those with no namespace. They are in the default namespace, and all uses of an ! unqualified tag are equivalent. .Make a new NName from a prefix and localPart. !Make a new NName with no prefix. LMNOPQ DEPRECATED: Renamed to . Format document with <;?xml.. header - lazy variant that returns lazy ByteString. Format document with <;?xml.. header - generalized variant that returns a generic  list of strict ByteStrings. DEPRECATED: Renamed to . Format document with <??xml.. header - strict variant that returns strict ByteString. LFormat XML node with no header - lazy variant that returns lazy ByteString. PFormat XML node with no header - strict variant that returns strict ByteString. LFormat XML node with no header - generalized variant that returns a generic  list of strict ByteStrings. -The standard XML header with UTF-8 encoding. ;Flatten a tree structure into SAX events, monadic version. NFormat SAX events with no header - lazy variant that returns lazy ByteString. RFormat SAX events with no header - strict variant that returns strict ByteString. RIFormat SAX events with no header - generalized variant that uses generic  list.  SAX events STU0Make the output prettier by adding indentation. /Number of indentation spaces per nesting level KMake the output prettier by adding indentation, specifying initial indent. Initial indent (spaces) /Number of indentation spaces per nesting level  5Select only the elements from a list of XML content. 1Select only the text from a list of XML content. 1Find all immediate children with the given name. 5Filter all immediate children wrt a given predicate. FFilter all immediate children wrt a given predicate over their names. -Find an immediate child with the given name. -Find an immediate child with the given name. 8Find an immediate child with name matching a predicate. AFind the left-most occurrence of an element matching given name. DFilter the left-most occurrence of an element wrt. given predicate. DFilter the left-most occurrence of an element wrt. given predicate. .Find all non-nested occurances of an element. 8 (i.e., once we have found an element, we do not search & for more occurances among the element' s children). DFind all non-nested occurrences of an element wrt. given predicate. 8 (i.e., once we have found an element, we do not search & for more occurances among the element' s children). QFind all non-nested occurences of an element wrt a predicate over element names. 8 (i.e., once we have found an element, we do not search & for more occurances among the element' s children).  hType shortcut for a single node where namespaced names are used for tags, annotated with parse location SType shortcut for a single annotated node where namespaced names are used for tags gType shortcut for a single node where qualified names are used for tags, annotated with parse location RType shortcut for a single annotated node where qualified names are used for tags AType shortcut for a single node with unqualified tag names where F tag and text are the same string type, annotated with parse location IType shortcut for a single annotated node, annotated with parse location KType shortcut for a single annotated node with unqualified tag names where ' tag and text are the same string type CA pure tree representation that uses a list as its container type,  annotated variant. JAnnotated variant of the tree representation of the XML document, meaning K that it has an extra piece of information of your choice attached to each  Element. c& is the container type for the element's children, which is usually [], $ except when you are using chunked I/ O with the hexpat-iteratee package. tagC is the tag type, which can either be one of several string types,  or a special type from the Text.XML.Expat.Namespaced or  Text.XML.Expat.Qualified modules. text& is the string type for text content. aH is the type of the annotation. One of the things this can be used for I is to store the XML parse location, which is useful for error handling.  Note that some functions in the Text.XML.Expat.Cursor module need to create  new nodes through the C, type class. Normally this can only be done  if aI is a Maybe type (so it can provide the Nothing value for the annotation 6 on newly created nodes). Or, you can write your own C instance. . Apart from that, there is no requirement for a to be a Maybe type. Convert an annotated tree ( Annotated module) into a non-annotated  tree (Tree) module). Needed, for example, when you format your tree to  XML, since format takes a non-annotated tree. Modify this node'$s annotation (non-recursively) if it's an element, otherwise no-op. Modify this node'3s annotation and all its children recursively if it's an element, otherwise no-op. PA lower level function that lazily converts a SAX stream into a tree structure. 0 Variant that takes annotations for start tags. KLazily parse XML to tree. Note that forcing the XMLParseError return value G will force the entire parse. Therefore, to ensure lazy operation, don't ; check the error status until you have processed the tree. Optional encoding override Input text (a lazy ByteString) DEPRECATED: Use  instead. KLazily parse XML to tree. Note that forcing the XMLParseError return value G will force the entire parse. Therefore, to ensure lazy operation, don't ; check the error status until you have processed the tree. Optional encoding override Input text (a lazy ByteString) :Lazily parse XML to tree. In the event of an error, throw %$.  parseThrowingA can throw an exception from pure code, which is generally a bad & way to handle errors, because Haskell's lazy evaluation means it' s hard to I predict where it will be thrown from. However, it may be acceptable in  situations where it'9s not expected during normal operation, depending on the  design of your program. Optional encoding override Input text (a lazy ByteString) DEPRECATED: use  instead :Lazily parse XML to tree. In the event of an error, throw %$. Optional encoding override Input text (a lazy ByteString) HStrictly parse XML to tree. Returns error message or valid parsed tree. Optional encoding override !Input text (a strict ByteString) DEPRECATED: use  instead. HStrictly parse XML to tree. Returns error message or valid parsed tree. Optional encoding override !Input text (a strict ByteString) l $%&'()*+,-./0123456789<>@BCDEFGHIJKLMNOPQRSTUVWXYZ[S56789  $%&*)('+,-./01234<@>BV    !"#$%&'()*+,--./0123456789:;<==>?@A"BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijkl#mn"oEpqrstuvwxyzz{|}~       b e f g h i j k l n " o E p # m      !"#$%&'()*+,-,./0123456789:;<=>?@ABCD hexpat-0.15Text.XML.Expat.IOText.XML.Expat.SAXText.XML.Expat.NodeClassText.XML.Expat.TreeText.XML.Expat.CursorText.XML.Expat.QualifiedText.XML.Expat.NamespacedText.XML.Expat.FormatText.XML.Expat.ProcText.XML.Expat.AnnotatedSkippedEntityHandlerExternalEntityRefHandlerCharacterDataHandlerEndElementHandlerStartElementHandlerXMLParseLocation xmlLineNumberxmlColumnNumber xmlByteIndex xmlByteCount XMLParseError ExpatHandlersEncodingISO88591UTF16UTF8ASCIIParser ParserPtr Parser_structencodingToString newParsersetUseForeignDTDparseparse'parseExternalEntityReference parseChunk withParsergetParseLocationsetStartElementHandlersetEndElementHandlersetCharacterDataHandlersetExternalEntityRefHandlersetSkippedEntityHandlerXMLParseExceptionSAXEvent FailDocument CharacterData EndElement StartElementGenericXMLString gxNullString gxToString gxFromString gxFromChargxHeadgxTail gxBreakOngxFromCStringLengxToByteString ParserOptionsparserEncoding entityDecoderdefaultParserOptionstextFromCStringparseSAXparseLocationsparseSAXLocations parseThrowingparseSAXThrowingparseLocationsThrowingparseSAXLocationsThrowingMkElementClass mkElement NodeClass isElementisText textContentMisNamedgetName getAttributes getChildrengetText modifyNamemodifyAttributesmodifyChildren mapAllTags mapElementmapNodeContainermkText UAttributes Attributes textContent getAttribute setAttributedeleteAttributealterAttributeUNodeUNodesNodesNodeNodeGTextElementeName eAttributes eChildreneAttrs parseTree' saxToTree parseTreeparseTreeThrowingCursorCursorGCurcurrentleftsrightsparentsPathPathGTagtagName tagAttribsfromTagparentrootleftleftMrightrightM firstChild firstChildM lastChild lastChildMfindLeft findRight findChildnextDFnextDFMfindRecfindRecMgetChild getChildMgetTagfromTree fromForesttoTreetoForestisRootisFirstisFirstMisLastisLastMisLeafisChild getNodeIndex hasChildren setContent modifyContentmodifyContentListmodifyContentListMmodifyContentM insertLeft insertRightinsertManyLeftinsertManyRightinsertFirstChildinsertLastChildinsertManyFirstChildinsertManyLastChild removeLeft removeLeftM removeRight removeRightM insertGoLeft insertGoRight removeGoLeft removeGoLeftM removeGoRightremoveGoRightM removeGoUp QAttributesQNodeQNodesQNameqnPrefix qnLocalPartmkQName mkAnQName toQualified fromQualified NAttributesNNodeNNodesNName nnNamespace nnLocalPartmkNName mkAnNNamexmlnsUrixmlns toNamespacedfromNamespaced formatTreeformatformatG formatTree'format' formatNode formatNode' formatNodeG xmlHeader treeToSAX formatSAX formatSAX' formatSAXGindentindent_ onlyElemsonlyText findChildrenfilterChildrenfilterChildrenName filterChildfilterChildName findElement filterElementfilterElementName findElementsfilterElementsfilterElementsNameNLNodeQLNodeULNodeLNodeeAnn unannotatemodifyAnnotation mapAnnotation xmlStopParserxmlErrorStringxmlGetCurrentByteCountxmlGetCurrentByteIndexxmlGetCurrentColumnNumberxmlGetCurrentLineNumberxmlGetErrorCodemkCSkippedEntityHandlerxmlExternalEntityParserCreatexmlSetSkippedEntityHandlerxmlSetExternalEntityRefHandlermkCExternalEntityRefHandler parserFree' parserFreexmlUseForeignDTDdoParseChunk'_xmlSetcharacterdatahandlerxmlSetendelementhandlerxmlSetstartelementhandlerxmlSetUserDataparserCreate'_mkCCharacterDataHandlermkCEndElementHandlermkCStartElementHandlerCSkippedEntityHandlerCExternalEntityRefHandlerCCharacterDataHandlerCEndElementHandlerCStartElementHandler _parserObj_startElementHandler_endElementHandler _cdataHandler_externalEntityRefHandler_skippedEntityHandlerwithOptEncoding parserCreatewithBStringLenunStatusgetError cFromBoolghc-primGHC.BoolBool doParseChunknullCStartElementHandlerwrapStartElementHandlernullCEndElementHandlerwrapEndElementHandlernullCCharacterDataHandlerwrapCharacterDataHandlerpairwisestoppwrapExternalEntityRefHandlerwrapSkippedEntityHandlerpeekByteStringLenbaseForeign.C.StringCStringsetEntityDecodersetEntityDecoderLoc findLeftM findRightM findChildM downParents fromForestM getNodeIndexM mapChildrensplitChildrenM combChildrenreverseL PrefixNsMap NsPrefixMapxmlUrixmlbaseNsBindingsbasePfBindingsnodeWithNamespacesnodeWithQualifiersstartTagHelperpackescapees escapeText