ú΃ž     %Pad right side with spaces such that  length (pad n s) >= length s + n %Pad right side with spaces such that  length (pad n s) >= length s + n $Pad left side with spaces such that  length (pad n s) >= length s + n  +Sort a list and leave out duplicates. Like  nub . sort but faster. ŒCalculate the arithmetic mean. May not be numerically robust for some types and lists. Double and Rational should be fine most of the time.  Shortcut for average . map fromIntegral". Check numerical robustness, see average above. rTurn a list of integer frequencies into relative frequencies that sum up to 1. Frequencies should be nonnegative. …Turn an association list of integer frequencies into on of relative frequencies that sum up to 1. Frequencies should be nonnegative. Sort, then group Sort, then group =Aggregate an association list, such that keys become unique. AFind the most frequently occurring element. TODO: rewrite for Eq @Infinite integer sequence of the natural numbers, starting at 0 @Infinite integer sequence of the natural numbers, starting at 1            hinduce-missingh-0.0.0.0Data.String.HIUtilsData.List.HIUtilspadpadrpadluniqSortaverageaverageIrelFreq relFreqAL aggregate aggregateBy aggregateALmajoritynat0nat1oddIxevenIxprop_uniqSortIsNubSort