h$ a!      (c) OleksandrZhabenko 2020MITolexandr543@yahoo.com Experimental Safe-Inferred>subGSome 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.subGInspired 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.subGInspired 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.subGInspired 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.subGPrepends and appends the given two first arguments to the third one.subGInspired 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. subGInspired 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. subGInspired 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. subGInspired 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. subGInspired 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. subGInspired 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.subGInspired 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.subGInspired 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.subGInspired 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.subGInspired 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. Splits the structure starting from the end and preserves the order.subG&If a structure is empty, just returns $.subGIf 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-InferredsubGGiven a finite structure with at least 5 elements returns a tuple with two minimum elements and three maximum elements. If the structure has less elements, returns $. Uses just three passes through the structure, so may be more efficient than some other approaches.subGGiven a finite structure with at least 5 elements returns a tuple with three minimum elements and two maximum elements. If the structure has less elements, returns $. Uses just three passes through the structure, so may be more efficient than some other approaches.subGGiven a finite structure with at least 6 elements returns a tuple with three minimum elements and three maximum elements. If the structure has less elements, returns $. Uses just three passes through the structure, so may be more efficient than some other approaches.(c) OleksandrZhabenko 2020MITolexandr543@yahoo.com Experimental Safe-InferredsubGReturns 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.subGA ternary predicate to check whether the third argument lies between the first two unequal ones or whether they are all equal.subGFinds 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.subGGiven 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 $. Uses just three passes through the structure, so may be more efficient than some other approaches.subGGiven 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 $. Uses just three passes through the structure, so may be more efficient than some other approaches. subGGiven 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 $. Uses just three passes through the structure, so may be more efficient than some other approaches.  &      !"#$%&'%()%*+%,-%,./"subG-0.3.0.0-D9zbtE2dRF5UwcmQzj8I0 Data.SubGData.MinMax3Plus Data.MinMax InsertLeft%@%^subG dropWhilespan takeWhile preAppend takeFromEndGreverseTakeFromEndG reverseTakeGtakeG reverseDropG dropFromEndGreverseDropFromEndGdropGsplitAtG splitAtEndG safeHeadG safeTailG safeInitG safeLastG$fInsertLeft[]aminMax23minMax32minMax33minmaxP betweenNXminMaxminMaxByminMax21minMax12minMax22base Data.FoldableFoldableGHC.BaseMonoid Data.OldListwords GHC.MaybeNothingJust