úÎ|Éw­8      !"#$%&'()*+,-./01234567 Portable ExperimentalDan DoelNone:A type of comparisons between two values of a given type. 89:89:89:3Non-portable (scoped type variables, bang patterns) ExperimentalDan Doel <dan.doel@gmail.com>None6The number of passes necessary to sort an array of es The size of an auxiliary array 5The radix function parameterized by the current pass ,Sorts an array based on the Radix instance. 4Radix sorts an array using custom radix information 8 requires the number of passes to fully sort the array, 6 the size of of auxiliary arrays necessary (should be : one greater than the maximum value returned by the radix 7 function), and a radix function, which takes the pass 1 and an element, and returns the relevant radix. the number of passes the size of auxiliary arrays the radix function the array to be sorted ;<=>?@ABCDEFGHI;<=>?@ABCDEFGHINon-portable (bang patterns) ExperimentalDan Doel <dan.doel@gmail.com>None IFinds an index in a given sorted vector at which the given element could = be inserted while maintaining the sortedness of the vector. KFinds an index in a given vector, which must be sorted with respect to the O given comparison function, at which the given element could be inserted while  preserving the vector's sortedness. MGiven a vector sorted with respect to a given comparison function in indices ! in [l,u), finds an index in [l,u]. at which the given element could be inserted  while preserving sortedness. KFinds the lowest index in a given sorted vector at which the given element 5 could be inserted while maintaining the sortedness. OFinds the lowest index in a given vector, which must be sorted with respect to M the given comparison function, at which the given element could be inserted " while preserving the sortedness. MGiven a vector sorted with respect to a given comparison function on indices ) in [l,u), finds the lowest index in [l,u]% at which the given element could be ' inserted while preserving sortedness. MFinds the greatest index in a given sorted vector at which the given element 1 could be inserted while maintaining sortedness. QFinds the greatest index in a given vector, which must be sorted with respect to M the given comparison function, at which the given element could be inserted " while preserving the sortedness. OGiven a vector sorted with respect to the given comparison function on indices + in [l,u), finds the greatest index in [l,u]% at which the given element could be ' inserted while preserving sortedness.        Portable ExperimentalDan DoelNone$Sorts the elements at the positions off and 'off + 1' in the given  array using the comparison. GSorts the elements at the two given indices using the comparison. This K is essentially a compare-and-swap, although the first index is assumed to  be the lower of the two. DSorts the three elements starting at the given offset in the array. GSorts the elements at the three given indices. The indices are assumed + to be given from lowest to highest, so if 'l < m < u' then  'sort3ByIndex cmp a m l u'0 essentially sorts the median of three into the  lowest position in the array. 1Sorts the four elements beginning at the offset. GSorts the elements at the four given indices. Like the 2 and 3 element K versions, this assumes that the indices are given in increasing order, so E it can be used to sort medians into particular positions and so on. Portable ExperimentalDan DoelNone@Sorts an entire array using the default comparison for the type /Sorts an entire array using a given comparison 1Sorts the portion of an array delimited by [l,u) GSorts the portion of the array delimited by [l,u) under the assumption  that [l,m) is already sorted. JJ4Non-portable (FlexibleContexts, ScopedTypeVariables) ExperimentalDan Doel <dan.doel@gmail.com>NoneDThe methods of this class specify the information necessary to sort - arrays using the default ordering. The name  is meant I to convey that index should return results in a similar way to indexing  into a string. =Given a representative of a stripe and an index number, this 4 function should determine whether to stop sorting. 6The size of the bucket array necessary for sorting es =Determines which bucket a given element should inhabit for a  particular iteration. BSorts an array using the default ordering. Both Lexicographic and F Ord are necessary because the algorithm falls back to insertion sort  for sufficiently small arrays. DA fully parameterized version of the sorting algorithm. Again, this E function takes both radix information and a comparison, because the ; algorithms falls back to insertion sort for small arrays. -a comparison for the insertion sort flalback (determines whether a stripe is complete  the number of buckets necessary the big-endian radix function the array to be sorted KLMNOPQRSTUVWXYZKLMNOPQRSTUVWXYZNon-portable (type operators) ExperimentalDan Doel <dan.doel@gmail.com>None 2Sorts an entire array using the default ordering. !/Sorts an entire array using a custom ordering. ":Sorts a portion of an array [l,u) using a custom ordering #7Moves the lowest k elements to the front of the array. . The elements will be in no particular order. $ Moves the lowest+ (as defined by the comparison) k elements B to the front of the array. The elements will be in no particular  order. % Moves the lowest( k elements in the portion [l,u) of the ; array into the positions [l,k+l). The elements will be in  no particular order. &?Moves the lowest k elements to the front of the array, sorted. '>Moves the lowest k elements (as defined by the comparison) to ! the front of the array, sorted. (>Moves the lowest k elements in the portion [l,u) of the array ! into positions [l,k+l), sorted. )2Constructs a heap in a portion of an array [l, u) *>Given a heap stored in a portion of an array [l,u), swaps the > top of the heap with the element at u and rebuilds the heap. +AGiven a heap stored in a portion of an array [l,u) swaps the top D of the heap with the element at position t, and rebuilds the heap. ,>Given a heap stored in a portion of an array [l,u), sorts the A highest values into [m,u). The elements in [l,m) are not in any  particular order.  !"#$%&'()*+,[\ !"#$%&'()*+, !"#$%&'()*+, !"#$%&'()*+,[\,Non-portable (type operators, bang patterns) ExperimentalDan Doel <dan.doel@gmail.com>None -2Sorts an entire array using the default ordering. ./Sorts an entire array using a custom ordering. /:Sorts a portion of an array [l,u) using a custom ordering 08Moves the least k elements to the front of the array in  no particular order. 1=Moves the least k elements (as defined by the comparison) to 0 the front of the array in no particular order. 2BMoves the least k elements in the interval [l,u) to the positions ! [l,k+l) in no particular order. 3>Moves the least k elements to the front of the array, sorted. 4=Moves the least k elements (as defined by the comparison) to ! the front of the array, sorted. 5BMoves the least k elements in the interval [l,u) to the positions  [l,k+l), sorted. -./]012345^_` -./012345 -./012345 -./]012345^_`Portable ExperimentalDan Doel <dan.doel@gmail.com>None6-Sorts an array using the default comparison. 7*Sorts an array using a custom comparison. 67abc676767abcd      !"# $ %&'()*+,-. %&'()* / 0 123456789:;<=>?@AB4CDEFGHIJKLMNOPQRSTUEVWEXvector-algorithms-0.5.4.2Data.Vector.Algorithms.SearchData.Vector.Algorithms.RadixData.Vector.Algorithms.Optimal Data.Vector.Algorithms.Insertion#Data.Vector.Algorithms.AmericanFlagData.Vector.Algorithms.HeapData.Vector.Algorithms.IntroData.Vector.Algorithms.MergeData.Vector.Algorithms.Common ComparisonRadixpassessizeradixsortsortBy binarySearchbinarySearchBybinarySearchByBounds binarySearchLbinarySearchLBybinarySearchLByBounds binarySearchRbinarySearchRBybinarySearchRByBounds sort2ByOffset sort2ByIndex sort3ByOffset sort3ByIndex sort4ByOffset sort4ByIndex sortByBounds sortByBounds' Lexicographic terminateindexselectselectByselectByBounds partialSort partialSortBypartialSortByBoundsheapifypoppopTosortHeap copyOffsetinc countLoop radixLoopbody accumulatemoveLoop $fRadix(,) $fRadixWord64 $fRadixWord32 $fRadixWord16 $fRadixWord8 $fRadixWord $fRadixInt64 $fRadixInt32 $fRadixInt16 $fRadixInt8 $fRadixIntinsertflagLooppermute countStripe threshold$fLexicographicByteString$fLexicographicInt$fLexicographicInt64$fLexicographicInt32$fLexicographicInt16$fLexicographicInt8$fLexicographicWord$fLexicographicWord64$fLexicographicWord32$fLexicographicWord16$fLexicographicWord8 siftByOffset maximumChild introsort partitionByilgmergeSortWithBufmerge