s1      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                  ! " # $ % & ' ( ) * + , - . / 0 None7Specifies 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 1Obtain C value from Haskell 2. -345 6789:;<=>?@ABCDEFGHI1JEntity decoder #Whether to include input locations KLMN  #345  6789:;<=>?@ABCDEFGHI1JKLMNNone 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  . (;The encoding parameter, if provided, overrides the document's  encoding declaration. )%If provided, entity references (i.e. &nbsp; and friends) will 9 be decoded into text using the supplied lookup function +FParse a generalized list of ByteStrings containing XML to SAX events. P In the event of an error, FailDocument is the last element of the output list. ,FParse a generalized list of ByteStrings containing XML to SAX events. P In the event of an error, FailDocument is the last element of the output list. -JLazily parse XML to SAX events. In the event of an error, FailDocument is & the last element of the output list. .JA variant of parseSAX that gives a document location with each SAX event. /@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. 0JA 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. ( !"#$%&'()*+Parse options Input text (a lazy ByteString) ,Parse options Input text (a lazy ByteString) OParse options Input text (a lazy ByteString) 'True to add locations to binary output Fetch extra data  Fetch a value for failure case P-Parse options Input text (a lazy ByteString) .Parse options Input text (a lazy ByteString) /Parse options input text (a lazy ByteString) 0Optional encoding override Input text (a lazy ByteString) QRSTU.  !"#$%&'()*+,-./0. &'()-+.,0/* !"#$%   !"#$%&'()*+,OP-./0QRSTUNone%1GA class of node types where an Element can be constructed given a tag,  attributes and children. 2Generic element constructor. 4Is the given node an element? 5Is the given node text? 6Is the given node CData? 7,Is the given node a processing instruction? 8Is the given node a comment? 9KExtract all text content from inside a tag into a single string, including ' any text contained in children. This excludes the contents of comments or  processing instructions-. To get the text for these node types, use @. :-Is the given node a tag with the given name? ;Get the name of this node if it'-s an element, return empty string otherwise. <BIs the given node a Processing Instruction with the given target? =!Get the target of this node if it';s a Processing Instruction, return empty string otherwise. >"Get the attributes of a node if it'+s an element, return empty list otherwise. ?Get children of a node if it'+s an element, return empty list otherwise. @ Get this node' s text if it'3s a text node, comment, or processing instruction,  return empty text otherwise. AModify name if it's an element, no-op otherwise. BModify attributes if it's an element, no-op otherwise. C'Modify children (non-recursively) if it's an element, no-op otherwise. DEMap an element non-recursively, allowing the tag type to be changed. E?Map all tags (both tag names and attribute names) recursively. FEChange a node recursively from one container type to another, with a 3 specified function to convert the container type. GGeneric text node constructor. HKA type function to give the type of a list of nodes, using the appropriate - list type for the specified node type, e.g. ListOf (UNode Text) IBType shortcut for attributes with unqualified names where tag and  text are the same string type. JType shortcut for attributes KKExtract all text content from inside a tag into a single string, including ' any text contained in children. This excludes the contents of comments or  processing instructions-. To get the text for these node types, use @. LLChange a list of nodes recursively from one container type to another, with 5 a specified function to convert the container type. MDChange a node recursively from one container type to another. This L extracts the entire tree contents to standard lists and re-constructs them > with the new container type. For monadic list types used in  hexpat-iteratee$ this operation forces evaluation. NMChange a list of nodes recursively from one container type to another. This L extracts the entire tree contents to standard lists and re-constructs them > with the new container type. For monadic list types used in  hexpat-iteratee# this operation forces evaluation. O:Get the value of the attribute having the specified name. PQSet the value of the attribute with the specified name to the value, overwriting 9 the first existing attribute with that name if present. Q8Delete the first attribute matching the specified name. RsetAttribute if Just, deleteAttribute if Nothing. SHGenerically convert an element of one node type to another. Useful for ! adding or removing annotations. TBGenerically convert an element of one node type to another, using P the specified element constructor. Useful for adding or removing annotations. UOGenerically convert a list of nodes from one node type to another. Useful for ! adding or removing annotations. VIGenerically convert a list of nodes from one node type to another, using P the specified element constructor. Useful for adding or removing annotations. &123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTElement constructor UVElement constructor &123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV&JIKH3456789:;<=>?@ABCDEFGLMN12OPQRSTUV123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVNoneW2Type shortcut for attributes with qualified names XA 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. WXYZ[\]^_V WXYZ[\]^_ XYZ[W\]^_WXYZ[\]^_VNone`3Type shortcut for attributes with namespaced names aA 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. e.Make a new NName from a prefix and localPart. f!Make a new NName with no prefix. WX`abcdefYZgh[\i]j^_ `abcdefghij abcd`efijghWX`abcdefYZgh[\i]j^_None k?Type alias for a node where namespaced names are used for tags l>Type alias for a node where qualified names are used for tags m?Type alias for a node with unqualified tag names where tag and  text are the same string type. nCA pure tree representation that uses a list as its container type. In the hexpat' package, a list of nodes has the type [Node tag text] , but note 6 that you can also use the more general type function H to give a list of  any node type, using that node's associated list type, e.g.  ListOf (UNode Text). o-The tree representation of the XML document. c& is the container type for the element'%s children, which would normally be [], D but could potentially be a monadic list type to allow for chunked I/O. 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. uHStrictly parse XML to tree. Returns error message or valid parsed tree. vPA lower level function that lazily converts a SAX stream into a tree structure. wUA lower level function that converts a generalized SAX stream into a tree structure.  Ignores parse errors. xKLazily 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. y;Parse a generalized list to a tree, ignoring parse errors. 4 This function allows for a parse from an enumerator/iteratee to a lazy  tree structure using the List-enumerator package. z: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. klmnopqrstuParse options !Input text (a strict ByteString) vwxParse options Input text (a lazy ByteString) yParse options +Input text as a generalized list of blocks zParse options Input text (a lazy ByteString) `abcdh  !"#$%&'()*123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz.noqprstmlk&'()* xuyzvw !"#$%klmnoqprstuvwxyz`abcdNoneI{A cursor specific to Text.XML.Expat.Tree.Node trees. |KGeneralized 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. ~ The currently selected content. %Siblings on the left, closest first. &Siblings on the right, closest first. 6The contexts of the parent elements of this location. A path specific to Text.XML.Expat.Tree.Node trees. )Generalized path within an XML document. "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. e7Find the next left sibling that satisfies a predicate. GFind the next right sibling that satisfies a predicate - pure version. fVFind the next right sibling that satisfies a predicate - used for monadic node types. ;The first child that satisfies a predicate - pure version. gJThe 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. h!private: computes the parent for down operations.  A cursor for the given content. ;The location of the first tree in a forest - pure version. iKThe 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. jRGet 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. k;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. l+private: Gets the given element of a list. L Also returns the preceding elements (reversed) and the following elements. m0private: combChildren ls x ys = reverse ls ++ [x] ++ rs R{|}~efghijklmls x rs noG{|}~G{|}~J{|}~efghijklmnoNone+Get the XML declaration for this document. ;Get the Document Type Declaration (DTD) for this document. Get the top-level  nodes for this document. (Get the root element for this document. +Make a document with the specified fields. Stub for future expansion. AXML declaration, consisting of version, encoding and standalone. ?The formatting functions always outputs only UTF-8, regardless M of what encoding is specified here. If you want to produce a document in a O different encoding, then set the encoding here, format the document, and then H convert the output text from UTF-8 to your desired encoding using some  text conversion library. GMake a document with the specified root node and all other information  set to defaults. pqr pqr NonehType alias for an extended node where namespaced names are used for tags, annotated with parse location IType alias for an extended node where namespaced names are used for tags gType alias for an extended node where qualified names are used for tags, annotated with parse location HType alias for an extended node where qualified names are used for tags AType alias for an extended node with unqualified tag names where F tag and text are the same string type, annotated with parse location ?Type alias for an extended node, annotated with parse location AType alias for an extended node with unqualified tag names where ' tag and text are the same string type lType alias for an extended document where namespaced names are used for tags, annotated with parse location MType alias for an extended document where namespaced names are used for tags kType alias for an extended document where qualified names are used for tags, annotated with parse location LType alias for an extended document where qualified names are used for tags EType alias for an extended document with unqualified tag names where F tag and text are the same string type, annotated with parse location CType alias for an extended document, annotated with parse location EType alias for an extended document 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,  extended variant. In the hexpat' package, a list of nodes has the type [Node tag text] , but note 6 that you can also use the more general type function H to give a list of  any node type, using that node's associated list type, e.g.  ListOf (UNode Text). JExtended variant of the tree representation of the XML document, intended P to support the entire XML specification. DTDs are not yet supported, however. c& is the container type for the element's children, which is [] in the  hexpat& package, and a monadic list type for hexpat-iteratee. 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 1, type class. Normally this can only be done  if aO is a Maybe type or () (so it can provide the Nothing value for the annotation 6 on newly created nodes). Or, you can write your own 1 instance. . Apart from that, there is no requirement for a to be a Maybe type. QA pure representation of an XML document that uses a list as its container type. LDocument representation of the XML document, intended to support the entire : XML specification. DTDs are not yet supported, however. 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. AModify the annotation of every node in the document recursively. 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. :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. HStrictly parse XML to tree. Returns error message or valid parsed tree. /Parse options Input text (a lazy ByteString) Parse options Input text (a lazy ByteString) Parse options !Input text (a strict ByteString) stuvwxyz{  !"#$%&'()*123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijD&'()*  !"#$%"stuvwxyz{ NoneFormat 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. 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. DFormat an XML document - lazy variant that returns lazy ByteString. HFormat an XML document - strict variant that returns strict ByteString. DFormat an XML document - 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.  IFormat SAX events with no header - generalized variant that uses generic  list.  0Make the output prettier by adding indentation.  KMake the output prettier by adding indentation, specifying initial indent. |  SAX events } SAX events True if processing CDATA ~ /Number of indentation spaces per nesting level  Initial indent (spaces) /Number of indentation spaces per nesting level       | }~  None 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).          NoneiType alias for an annotated node where namespaced names are used for tags, annotated with parse location JType alias for an annotated node where namespaced names are used for tags hType alias for an annotated node where qualified names are used for tags, annotated with parse location IType alias for an annotated node where qualified names are used for tags BType alias for an annotated node with unqualified tag names where F tag and text are the same string type, annotated with parse location @Type alias for an annotated node, annotated with parse location  BType alias for an 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. In the hexpat' package, a list of nodes has the type [Node tag text] , but note 6 that you can also use the more general type function H to give a list of  any node type, using that node's associated list type, e.g.  ListOf (UNode Text). "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 would normally be [], D but could potentially be a monadic list type to allow for chunked I/O. 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 1, type class. Normally this can only be done  if aO is a Maybe type or () (so it can provide the Nothing value for the annotation 6 on newly created nodes). Or, you can write your own 1 instance. . Apart from that, there is no requirement for a to be a Maybe type. )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. ,UA lower level function that converts a generalized SAX stream into a tree structure.  Ignores parse errors. -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. .;Parse a generalized list to a tree, ignoring parse errors. 4 This function allows for a parse from an enumerator/iteratee to a lazy  tree structure using the List-enumerator package. /: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. 0HStrictly parse XML to tree. Returns error message or valid parsed tree.  !"#$%&'()*+,-Parse options Input text (a lazy ByteString) .Parse options +Input text as a generalized list of blocks /Parse options Input text (a lazy ByteString) 0Parse options !Input text (a strict ByteString) o  !"#$%&'()*123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghij !"#$%&'()*+,-./05!"$#%&'( )*&'()* -0./+, !"#$% !"$#%&'()*+,-./0  !"#$%&'()*+,-./00123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`aabcdefghiijklmnopqrstuvwxyz{|}~648%%  r  s   t        u v   w x y z {    } 6 8 |         r  s   t u v w x y z { } ~ 6 4 8 |      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJ 8 K 9 : ; < L M N O P Q R S 8 K 9 : ; <T hexpat-0.20.3Text.XML.Expat.Internal.IOText.XML.Expat.SAX!Text.XML.Expat.Internal.NodeClass!Text.XML.Expat.Internal.Qualified"Text.XML.Expat.Internal.NamespacedText.XML.Expat.TreeText.XML.Expat.Cursor%Text.XML.Expat.Internal.DocumentClassText.XML.Expat.ExtendedText.XML.Expat.FormatText.XML.Expat.ProcText.XML.Expat.AnnotatedHParserXMLParseLocation xmlLineNumberxmlColumnNumber xmlByteIndex xmlByteCount XMLParseErrorEncodingISO88591UTF16UTF8ASCIIencodingToStringhexpatNewParserXMLParseExceptionSAXEvent FailDocumentCommentProcessingInstructionEndCData StartCData CharacterData EndElement StartElementXMLDeclarationGenericXMLString gxNullString gxToString gxFromString gxFromChargxHeadgxTail gxBreakOngxFromByteStringgxToByteString ParseOptionsoverrideEncoding entityDecoderdefaultParseOptionsparseGparseLocationsGparseparseLocations parseThrowingparseLocationsThrowingMkElementClass mkElement NodeClass isElementisTextisCDataisProcessingInstruction isComment textContentMisNamedgetName hasTarget getTarget getAttributes getChildrengetText modifyNamemodifyAttributesmodifyChildren modifyElement mapAllTagsmapNodeContainermkTextListOf UAttributes Attributes textContentmapNodeListContainerfromNodeContainerfromNodeListContainer getAttribute setAttributedeleteAttributealterAttribute fromElement fromElement_ fromNodes fromNodes_ QAttributesQNameqnPrefix qnLocalPartmkQName mkAnQName toQualified fromQualified NAttributesNName nnNamespace nnLocalPartmkNName mkAnNNamexmlnsUrixmlns toNamespacedfromNamespacedNNodeQNodeUNodeNodeNodeGTextElementeName eAttributes eChildrenparse' saxToTree saxToTreeGCursorCursorGCurcurrentleftsrightsparentsPathPathGTagtagName 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 DocumentClassgetXMLDeclarationgetDocumentTypeDeclarationgetTopLevelMiscsgetRoot mkDocumentNodeTypeMiscDocumentTypeDeclarationmkPlainDocumentmodifyXMLDeclarationmodifyDocumentTypeDeclarationmodifyTopLevelMiscs modifyRootNLNodeQLNodeULNodeLNode NLDocument NDocument QLDocument QDocument ULDocument LDocument UDocumentCDataeAnnDocument DocumentGdXMLDeclarationdDocumentTypeDeclarationdTopLevelMiscsdRootmodifyAnnotation mapAnnotationmapDocumentAnnotationformatformatGformat' formatNode formatNode' formatNodeGformatDocumentformatDocument'formatDocumentG xmlHeader documentToSAX treeToSAX formatSAX formatSAX' formatSAXGindentindent_ onlyElemsonlyText findChildrenfilterChildrenfilterChildrenName filterChildfilterChildName findElement filterElementfilterElementName findElementsfilterElementsfilterElementsName cFromBoolghc-prim GHC.TypesBoolCEntityHandler MyParserPtrMyParser_struct ParserPtr Parser_struct funPtrFree_hexpatSetEntityHandlermkCEntityHandler_hexpatParseSafe_hexpatParseUnsafehexpatFreeParser_hexpatGetParser_hexpatNewParserxmlErrorStringxmlGetCurrentByteCountxmlGetCurrentByteIndexxmlGetCurrentColumnNumberxmlGetCurrentLineNumberxmlGetErrorCodewithOptEncodingwithBStringLenunStatusgetErrorgetParseLocationpeekByteStringLenwrapCEntityHandler$fNFDataXMLParseLocation$fNFDataXMLParseError parseImplparseBuf$fExceptionXMLParseException$fNFDataSAXEvent$fGenericXMLStringText$fGenericXMLStringByteString$fGenericXMLString[] $fNFDataQName PrefixNsMap NsPrefixMapxmlUrixmlbaseNsBindingsbasePfBindingsnodeWithNamespacesnodeWithQualifiers $fNFDataNName$fMkElementClassNodeGc$fNodeClassNodeGc $fNFDataNodeG $fEqNodeG $fShowNodeG findLeftM findRightM findChildM downParents fromForestM getNodeIndexM mapChildrensplitChildrenM combChildrenreverseL $fShowCursorG $fNFDataMisc$fEqMisc $fShowMisc$fMkElementClassNodeGc0$fDocumentClassDocumentGc $fEqDocumentG$fShowDocumentGstartTagHelper formatSAXGbpack isSafeChar escapeText