úÎ=É<|     4A transparent print-function, for use in debugging. "Arbitrary polymorphic input-data. Output (identical to input). XA transparent print-function, which prepends the specified label, for use in debugging. <The label to be printed before the value of the input data. "Arbitrary polymorphic input-data. Output (identical to input). % Time the specified pure expression. - CAVEAT: as a side-effect, the expression is deep evaluated. "Arbitrary polymorphic expression. <The original expression, tagged with the CPU-seconds taken. ; Print the time required by the specified pure expression. - CAVEAT: as a side-effect, the expression is deep evaluated. DThe interface to which data which can self-validate should conform. 7The data which implements this interface should return  if internally consistent.  IThe polymorphic pair, resulting from splitting a list of arbitrary type. 5The length of the chunks into which a list is split.  Splits a list into length-size pieces, where  (size >= 0). $ The last chunk will be shorter, if n isn',t an aliquot part of the input list-length.  If  (size == 0)A, the resulting list will be an infinite sequence of null lists. 7 CAVEAT: a similar function is available in the module Data.List.Split, though this one checks for (size < 0). *The polymorphic input list to be chunked. 1Remove the single indexed element from the list.  The index. The polymorphic input list. 1The same list, with the indexed element removed.  Much like Data.List.GroupBy), but where the normal binary predicate, n is composed from equality, after the same unary translation-function has been applied to both list-elements.  cf. GHC.Exts.groupWith<, which uses the function parameter to both sort and group. XTranslates elements from the list, prior to testing the translated values for equality. %The polymorphic input list to group. 8The same list split into chunks of the required length. : Merge two sorted lists, to product a single sorted list.  The merge-process is stableS, in that where items from each list are equal, they remain in the original order. \ Merge two sorted lists, according to the specified order, to product a single sorted list.  The merge-process is stableS, in that where items from each list are equal, they remain in the original order. 8Use the specified transformation, to generate a list of s, from the initial one. #The function used to transform one split into the next. Index. *The polymorphic input list from which the splits are generated. :The list of all required splits of the single input list.  Create the set of all /s, migrating left from the specified location.  CAVEAT:  fails when  has been reduced to null. Index. *The polymorphic input list from which the splits- are generated, as the index is stepped left :The list of all required splits of the single input list.  Create the set of all 0s, migrating right from the specified location.  CAVEAT: pattern-match against  :  fails, when  has been reduced to null. Index. *The polymorphic input list from which the splits/ are generated, as the index is stepped right. :The list of all required splits of the single input list. 2 Take until the specified predicate is satisfied;  including the item which satisfied it.  NB: takeWhile (not . test) would return one fewer item. 2Predicate, used to determine the last item taken. The polymorphic input list.      $The default value of the data-type. Similar to the class &Text.Regex.Base.RegexLike.RegexOptions. The  undefinedd state of the data-type, which may be literal, but could alternatively be a logical starting value.       !"#"$%toolshed-0.11.1.0ToolShed.UnsafeToolShed.TimePureToolShed.SelfValidateToolShed.ListPlusToolShed.DefaultableToolShed.Optionsprint' printShow getCPUSecondsprintCPUSeconds SelfValidatorisValid ChunkLengthchunkexcisegroupComparingmergemergeBysplitsLeftFromsplitsRightFrom takeUntil Defaultable defaultValueOptions blankValueghc-primGHC.BoolTrueSplit splitsFrombaseGHC.Listinit Data.Tuplefstsnd