úÎ<:      Safe9 A variant of 4 which may contain a value at the root of the tree. A representation of a D designed for efficient lookups when we perform the replacements in .You may construct a  using  or . }A map where the keys are strings we're looking for, and the values are strings with which we're replacing a key that we find. You may use  to construct a 3 from a list of replacement rules, and you may use  to convert back to a list. A replacement rule. Replace "abc" "xyz"meansWhen you encounter the string abc$ in the input text, replace it with xyz.ŒThe first argument must be a non-empty string, because there is no sensible way to interpret "replace all occurrences of the empty string." A string we're looking for  A string we're replacing it with Non-empty string. —Apply a list of replacement rules to a string. The search for strings to replace is performed left-to-right, preferring longer matches to shorter ones.,Internally, the list will be converted to a  using ˆ. If the list contains more than one replacement for the same search string, the last mapping is used, and earlier mappings are ignored.yIf you are going to be applying the same list of rules to multiple input strings, you should first convert the list to a  using  and then use  instead. –Apply a map of replacement rules to a string. The search for strings to replace is performed left-to-right, preferring longer matches to shorter ones.oIf you are going to be applying the same list of rules to multiple input strings, you should first convert the   to a  using  and then use  instead. —Apply a trie of replacement rules to a string. The search for strings to replace is performed left-to-right, preferring longer matches to shorter ones.To construct a , you may use  or . Convert an ordinary ! to a non-empty  . ó6þ Warning: string'fromString "" = "¥ +The first character of a non-empty string. 7All characters of a non-empty string except the first.  Construct a " from a list of replacement rules.‡If the list contains more than one replacement for the same search string, the last mapping is used, and earlier mappings are ignored. rConvert a replacement map to a list of replacement rules. The rules in the list will be sorted according to their  field in ascending order. 6Draws a text diagram of a trie; useful for debugging. LConvert a replacement map to a trie, which is used to efficiently implement . VConvert a list of replacement rules to a trie, which is used to efficiently implement .‡If the list contains more than one replacement for the same search string, the last mapping is used, and earlier mappings are ignored. )Convert a list of replacement rules to a ;, where the rules must be sorted in ascending order by the  field.Vó6þ Warning: this precondition is not checked. If you are not sure, it is safer to use  instead.  " =  ó6þ Warning: (" "" ::  ) = "¥  List of replacement rules Input string8Result after performing replacements on the input string Map of replacement rules Input string8Result after performing replacements on the input string/Map of replacement rules, represented as a trie Input string8Result after performing replacements on the input string*This list must be sorted according to the  field in ascending order,ó6þ Warning: this precondition is not checked#WThis list must be sorted according to the left field of the tuple in ascending order,ó6þ Warning: this precondition is not checked      $       !"#$"%&'(+text-replace-0.0.0.2-Ek4VANM525ILATOrZOrUH8 Text.ReplaceTrie'trieRoot trieBranchesTrie ReplaceMapReplace replaceFrom replaceToString'replaceWithListreplaceWithMapreplaceWithTriestring'fromString string'head string'tail listToMap mapToAscListdrawTrie mapToTrie listToTrie ascListToTrie$fIsStringString' $fShowString' $fEqString' $fOrdString' $fEqReplace $fShowReplace $fEqTrie' $fShowTrie'containers-0.5.10.2Data.Map.InternalMapbaseGHC.BaseString Data.String fromStringascListToTrie'