@@ -331,7 +331,7 @@ convertingExtraState v a = withSubStateF setVAsExtraState modifyWithA
331331 where
332332 setVAsExtraState = liftAsSuccess $ extractFromState id >>^ replaceExtraState v
333333 modifyWithA = keepingTheValue (moreState ^>> a)
334− >>^ spreadChoice >>?§ flip replaceExtraState
334+ >>^ spreadChoice >>?% flip replaceExtraState
335335
336336-- | First sets the extra state to the new value. Then produces a new
337337-- extra state with a converter that uses the new state. Finally, the
@@ -413,14 +413,14 @@ elemName :: (NameSpaceID nsID)
413413 -> XMLConverter nsID extraState x XML.QName
414414elemName nsID name = lookupNSiri nsID
415415 &&& lookupNSprefix nsID
416− >>§ XML.QName name
416+ >>% XML.QName name
417417
418418-- | Checks if a given element matches both a specified namespace id
419419-- and a specified element name
420420elemNameIs :: (NameSpaceID nsID)
421421 => nsID -> ElementName
422422 -> XMLConverter nsID extraState XML.Element Bool
423−elemNameIs nsID name = keepingTheValue (lookupNSiri nsID) >>§ hasThatName
423+elemNameIs nsID name = keepingTheValue (lookupNSiri nsID) >>% hasThatName
424424 where hasThatName e iri = let elName = XML.elName e
425425 in XML.qName elName == name
426426 && XML.qURI elName == iri
@@ -461,8 +461,8 @@ currentElemIs'' nsID name = ( (getCurrentElement >>^ XML.elName >>>
461461 (XML.qName >>^ (&&).(== name) )
462462 ^&&&^
463463 (XML.qIRI >>^ (==) )
464− ) >>§ (.)
465− ) &&& lookupNSiri nsID >>§ ($)
464+ ) >>% (.)
465+ ) &&& lookupNSiri nsID >>% ($)
466466-}
467467
468468--
@@ -487,7 +487,7 @@ findChildren :: (NameSpaceID nsID)
487487 -> XMLConverter nsID extraState x [XML.Element]
488488findChildren nsID name = elemName nsID name
489489 &&& getCurrentElement
490− >>§ XML.findChildren
490+ >>% XML.findChildren
491491
492492--
493493filterChildren :: (XML.Element -> Bool)
@@ -508,7 +508,7 @@ findChild' :: (NameSpaceID nsID)
508508 -> XMLConverter nsID extraState x (Maybe XML.Element)
509509findChild' nsID name = elemName nsID name
510510 &&& getCurrentElement
511− >>§ XML.findChild
511+ >>% XML.findChild
512512
513513--
514514findChild :: (NameSpaceID nsID)
@@ -596,7 +596,7 @@ isThatTheAttrValue :: (NameSpaceID nsID)
596596isThatTheAttrValue nsID attrName
597597 = keepingTheValue
598598 (findAttr nsID attrName)
599− >>§ right.(==)
599+ >>% right.(==)
600600
601601-- | Lookup value in a dictionary, fail if no attribute found or value
602602-- not in dictionary
@@ -669,7 +669,7 @@ findAttr' :: (NameSpaceID nsID)
669669 -> XMLConverter nsID extraState x (Maybe AttributeValue)
670670findAttr' nsID attrName = elemName nsID attrName
671671 &&& getCurrentElement
672− >>§ XML.findAttr
672+ >>% XML.findAttr
673673
674674-- | Return value as string or fail
675675findAttr :: (NameSpaceID nsID)
@@ -787,7 +787,7 @@ prepareIteration :: (NameSpaceID nsID)
787787 -> XMLConverter nsID extraState b [(b, XML.Element)]
788788prepareIteration nsID name = keepingTheValue
789789 (findChildren nsID name)
790− >>§ distributeValue
790+ >>% distributeValue
791791
792792-- | Applies a converter to every child element of a specific type.
793793-- Collects results in a 'Monoid'.
@@ -877,9 +877,9 @@ makeMatcherE nsID name c = ( second (
877877 elemNameIs nsID name
878878 >>^ bool Nothing (Just tryC)
879879 )
880− >>§ (<|>)
880+ >>% (<|>)
881881 ) &&&^ snd
882− where tryC = (fst ^&&& executeThere c >>§ recover) &&&^ snd
882+ where tryC = (fst ^&&& executeThere c >>% recover) &&&^ snd
883883
884884-- Helper function: The @c@ is actually a converter that is to be selected by
885885-- matching XML content to the first two parameters.
@@ -899,14 +899,14 @@ makeMatcherC nsID name c = ( second ( contentToElem
899899 >>^ bool Nothing (Just cWithJump)
900900 )
901901 )
902− >>§ (<|>)
902+ >>% (<|>)
903903 ) &&&^ snd
904904 where cWithJump = ( fst
905905 ^&&& ( second contentToElem
906906 >>> spreadChoice
907907 ^>>? executeThere c
908908 )
909− >>§ recover)
909+ >>% recover)
910910 &&&^ snd
911911 contentToElem :: FallibleXMLConverter nsID extraState XML.Content XML.Element
912912 contentToElem = arr $ \e -> case e of