Îõ³h&) '¥)      !"#$%&'( Safe-Inferred"ãë'k,)xmlbfZipper into a  tree.*xmlbf Retrieves the current node of a ).+xmlbf*Nodes to the left (ordered right to left).,xmlbf+Nodes to the right (ordered left to right).-xmlbf(Parents' name, attributes, and siblings.xmlbfRenders a value of type a into an XML fragment body.If a  instance for a exists, then:    ( a) == . a xmlbfXML parser for a value of type a.You can build a  using , , , , , , , , any of the /, 0, 1 or related combinators.Run a  using  .2xmlbfInternal parser state.3xmlbfParsing the top-level nodes.4xmlbf"Parsing a particular root element.xmlbf1Parses an XML fragment body into a value of type a.If a  instance for a exists, then:    ( a) == pure (. a) xmlbf9Either a text or an element node in an XML fragment body.Construct with   or  . Destruct with  or .xmlbfDestruct a text .xmlbfDestruct an element .xmlbfCase analysis for a .5xmlbf Normalizes s by concatenating consecutive  nodes. xmlbf2Construct a XML fragment body containing a single  , if possible.ÍThis function will return empty list if it is not possible to construct the + with the given input. To learn more about why+ it was not possible to construct it, use   instead.Using   rather than  é is recommended, so that you are forced to acknowledge a failing situation in case it happens. However,  à is at times more convenient to use. For example, when you know statically the input is valid. xmlbf Construct a  , if possible.Returns 6 if the  / can't be created, with an explanation of why. xmlbf2Construct a XML fragment body containing a single  , if possible.ÍThis function will return empty list if it is not possible to construct the + with the given input. To learn more about why+ it was not possible to construct it, use   instead.Using   rather than  é is recommended, so that you are forced to acknowledge a failing situation in case it happens. However,  Ë is at times more convenient to use, whenever you know the input is valid. xmlbf Construct an  .Returns 6 if the  / can't be created, with an explanation of why.7xmlbf.Construct an initial parser state to use with 8 from zero or more top-level s. xmlbfRun a  on an XML fragment body.òNotice that this function doesn't enforce that all input is consumed. If you want that behavior, then please use  in the given .9xmlbfA 0 that always fails with the given error message.xmlbf "foo" p runs a 'Parser p inside a  node named "foo". This parser fails9 if such element does not exist at the current position.êLeading whitespace is ignored. If you need to preserve that whitespace for some reason, capture it using  before using .Consumes the matched element from the parser state.xmlbf p runs a  p inside the Û node at the current position, if any. Otherwise, if no such element exists, this parser fails.6You can recover the name of the matched element using  inside the given î. However, if you already know beforehand the name of the element that you want to match, it's better to use  rather than .êLeading whitespace is ignored. If you need to preserve that whitespace for some reason, capture it using  before using .Consumes the matched element from the parser state.xmlbf+Returns the name of the currently selected . This parser fails" if there's no currently selected  (see , ). Doesn't modify the parser state.xmlbfÅReturn the value of the requested attribute, if defined. Returns an : ;À in case the attribute is defined but no value was given to it. This parser fails" if there's no currently selected  (see , ).Consumes the matched attribute from the parser state.xmlbf0Returns all of the available element attributes.Returns : ;É as values in case an attribute is defined but no value was given to it. This parser fails" if there's no currently selected  (see , ).Consumes all the attributes( for this element from the parser state.xmlbf=Returns all of the immediate children of the current element.ÊIf parsing top-level nodes rather than a particular element (that is, if  is not being run inside ), then all of the top level s will be returned.Consumes all the returned nodes from the parser state.xmlbfReturns the contents of a  node.ØSurrounidng whitespace is not removed, as it is considered to be part of the text node.ÃIf there is no text node at the current position, then this parser fails. This implies that  never returns an empty <<, since there is no such thing as a text node without text.×Please note that consecutive text nodes are always concatenated and returned together.    (  "Ha" <>   "sk" <>   "ell") == . (  "Haskell") Consumes the textÊ from the parser state. This implies that if you perform two consecutive $ calls, the second will always fail.   ( >> ) (  "Ha" <>   "sk" <>   "ell") == 6 "Missing text node" xmlbfÏSucceeds if all of the elements, attributes and text nodes have been consumed.xmlbfEncodes a list of XML Õs, representing an XML fragment body, to an UTF8-encoded and XML-escaped bytestring.ìThis function doesn't render self-closing elements. Instead, all elements have a corresponding closing tag.ÓAlso, it doesn't render CDATA sections. Instead, all text is escaped as necessary.6Element attributes are rendered in alphabetical order.xmlbf&Post-order depth-first replacement of  and all of its children.This function works like =ñ, but the given function is trying to find a fixpoint for the individual children nodes, not for the root node.=For example, the following function renames every node named "w" to "y", and every node named "y" to "z"*. It accomplishes this by first renaming "w" nodes to "x", and then, by using k$ recursively to further rename all "x"6 nodes (including the ones that were just created) to "y"8 in a post-order depth-first manner. After renaming an "x" node to "y", the recursion stops (i.e., k is not used), so our new "y"$ nodes won't be further renamed to "z"!. However, nodes that were named "y" initially will be renamed to "z".šIn our example we only replace one node with another, but a node can be replaced with zero or more nodes, depending on the length of the resulting list. foo ::  -> [] foo =  $ \k -> \case  "w" as cs ->   "x" as cs >>= k  "x" as cs ->   "y" as cs  "y" as cs ->   "z" as cs >>= k See ( for pre-orderd depth-first replacement.WARNING If you call k in every branch, then ü will never terminate. Make sure the recursion stops at some point by simply returning a list of nodes instead of calling k.xmlbfMonadic version of .xmlbf%Pre-order depth-first replacement of  and all of its children.This is just like . but the search proceeds in a different order.xmlbfMonadic version of .>xmlbf#The cursor if left where it starts.?xmlbf,The cursor if left in the rightmost sibling.@xmlbf Builds a )> for navigating a tree. That is, a forest with a single root .AxmlbfRetrieves a list of the Õs at the same level as the current position of a cursor, including the current node.Bxmlbf,Removes the node to the right and return it.CxmlbfInserts a list of new 's to the right of the current position.xmlbfD ma mb5 backtracks the internal parser state before running mb.#xmlbfma E mb5 backtracks the internal parser state before running mb. xmlbf Transform an  node.xmlbf Transform a  node. xmlbfLazy <. xmlbfLazy <. xmlbfElement' name as a strict ;.xmlbfAttributes as strict ; pairs.xmlbf Children. xmlbfElement' name as a strict ;.xmlbfAttributes as strict ; pairs.xmlbf Children. xmlbfParser to run.xmlbf3XML fragment body to parse. That is, top-level XML s.xmlbfIf parsing fails, a FÅ with an error message is returned. Otherwise, we the parser output a is returned.xmlbfElement name as strict ;.xmlbf to run inside the matched .xmlbf to run inside any matched .xmlbfElement name as strict ;.xmlbfAttribute name as strict ;.xmlbfAttribute value as strict ; , possibly :.xmlbf&Pairs of attribute names and possibly : values, as strict ;.xmlbfs in their original order.xmlbf#Content of the text node as a lazy <.    Ç      !"#$%&'()*+,-./012034035036789:01;<=>?@A?@?B0CDEFGHIJ03K03L03MÎ"xmlbf-0.6.2-32teWlnD6N9GQ7CUL2sxCdXmlbfToXmltoXmlParserFromXmlfromXmlNodeTextElementnodetexttext'elementelement' runParserpElement pAnyElementpNamepAttrpAttrs pChildrenpText pEndOfInputencodedfposdfposMdfpredfpreM $fShowNode $fNFDataNode$fMonadZipParser$fMonadFixParser$fMonadPlusParser$fMonadFailParser $fMonadParser$fSelectiveParser$fAlternativeParser$fApplicativeParser$fFunctorParser$fMonoidParser$fSemigroupParser$fEqNodeCursor_cursorCurrent _cursorLefts _cursorRights_cursorParentsbase Data.EitherRightGHC.Base Applicative AlternativeMonadSSTopSReg normalizeLeftinitialSunParserpFail text-1.2.5.0Data.Text.InternalemptyData.Text.Internal.Lazy Data.FunctionfixtraverseChildrentraverseRightSiblingscursorFromNodecursorSiblingscursorRemoveRightcursorInsertManyRightmplus<|>String