Îõ³h$À     (c) OleksandrZhabenko 2020MITolexandr543@yahoo.com Experimental Safe-Inferred>ÀÁÂVsubGSome extension to the  and  classes.subG Inspired by:  Òhttps://hackage.haskell.org/package/base-4.14.0.0/docs/src/Data.OldList.html#wordsÑ and: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Is similar to the Á but operates on more general structures an allows more control.subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdf.subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdf.subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdf.subGÄPrepends and appends the given two first arguments to the third one.subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdfÞ. Takes the first argument quantity from the right end of the structure preserving the order. subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdfá. Takes the specified quantity from the right end of the structure and then reverses the result. subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdf·. Is analogous to the taking the specified quantity from the structure and then reversing the result. Uses strict variant of the foldl, so is not suitable for large amounts of data. subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdfÎ. Uses strict variant of the foldl, so is strict and the data must be finite. subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdfµ. Is analogous to the dropping the specified quantity from the structure and then reversing the result. Uses strict variant of the foldl, so is strict and the data must be finite. subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdfõ. Drops the first argument quantity from the right end of the structure and returns the result preserving the order.subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdfá. Drops the specified quantity from the right end of the structure and then reverses the result.subG×Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming; 9 (4): 355“@372, July 1999. that is available at the URL:  *https://www.cs.nott.ac.uk/~pszgmh/fold.pdfÎ. Uses strict variant of the foldl, so is strict and the data must be finite.subG&If a structure is empty, just returns .subGüIf the structure is empty, just returns itself. Uses strict variant of the foldl, so is strict and the data must be finite.subG/If the structure is empty, just returns itself.subG(If the structure is empty, just returns .    11(c) OleksandrZhabenko 2020MITolexandr543@yahoo.com Experimental Safe-InferredsubG¼Returns a pair where the first element is the minimum element from the two given ones and the second one is the maximum. If the arguments are equal then the tuple contains equal elements.subGþA ternary predicate to check whether the third argument lies between the first two unequal ones or whether they are all equal.subGåFinds out the minimum and maximum values of the finite structure. If the latter one is empty returns Æ, if all the elements are equal (or it has just one) then it returns   tuple of equal elements.subGA generalized variant of the 4 where you can specify your own comparison function.subG×Given a finite structure with at least 3 elements returns a tuple with the two most minimum elements (the first one is less than the second one) and the maximum element. If the structure has less elements, returns ª. All the elements must be pairwise unequal though this is not checked. Uses just two passes through the structure, so may be more efficient than some other approaches.subGÎGiven a finite structure with at least 3 elements returns a tuple with the minimum element and two maximum elements (the first one is less than the second one). If the structure has less elements, returns ª. All the elements must be pairwise unequal though this is not checked. Uses just two passes through the structure, so may be more efficient than some other approaches.subG£Given a finite structure with at least 4 elements returns a tuple with two minimum elements and two maximum elements. If the structure has less elements, returns ª. All the elements must be pairwise unequal though this is not checked. Uses just two passes through the structure, so may be more efficient than some other approaches.!      !"#$%&'&()#subG-0.2.0.0-JnIrV676AqX303M046wvrk Data.SubG Data.MinMax InsertLeft%@%^subG dropWhilespan takeWhile preAppend takeFromEndreverseTakeFromEnd reverseTaketake reverseDrop dropFromEndreverseDropFromEnddropsafeHeadsafeTailsafeInitsafeLast$fInsertLeft[]aminmaxP betweenNXminMaxminMaxByminMax21minMax12minMax22base Data.FoldableFoldableGHC.BaseMonoid Data.OldListwords GHC.MaybeNothingJust