úÎ!RƒRNoneQåmm2CThe function that can be used instead of the 'case ... of' function Rcase var of a1 -> b1 a2 -> b2 a3 -> b3 ... an -> bn _ -> defaultValueÿ4The function 'case a of ...' gives the O(n) coplexity of the transformation of a to b here, but the function getBFst' tries to give about O(log n) complexity The Vector v (a, b) must be sorted in ascending order here for the algorithm to be used correctly. For this you can use the following functions  and . 4b after Vector (a, b) in the type definition of the ( must be a defaultValue for case above. Vector (a, b) corresponds to , a1 -> b1 a2 -> b2 a3 -> b3 ... an -> bnmm2The function that uses special kind of bisection to effectively transform the Vector a to Vector b with instead of simply use  Rcase var of a1 -> b1 a2 -> b2 a3 -> b3 ... an -> bn _ -> defaultValueØThe function 'V.map (f (case var of ...)) [a]' gives the O(n*m) coplexity of the transformation of Vector a to Vector b here where m is the length of the Vector a (and Vector b respectively here), but the function ½ tries to give about O(m*log n) complexity The Vector (a, b) must be sorted in ascending order here for the algorithm to be used correctly. For this you can use the following functions  and ®. If m >> n than the function gives more efficiency. Even otherwise, it can be used to simplify the procedure for optimizing the code for transformation of the Vector data.4b after Vector (a, b) in the type definition of the ( must be a defaultValue for case above. Vector (a, b) corresponds to , a1 -> b1 a2 -> b2 a3 -> b3 ... an -> bnmm2uThe function that uses special kind of bisection to effectively transform the [a] to [b] with instead of simply use  Rcase var of a1 -> b1 a2 -> b2 a3 -> b3 ... an -> bn _ -> defaultValueÂThe function 'map (f (case var of ...)) [a]' gives the O(n*m) coplexity of the transformation of [a] to [b] here where m is the length of the [a] (and [b] respectively here), but the function ½ tries to give about O(m*log n) complexity The Vector (a, b) must be sorted in ascending order here for the algorithm to be used correctly. For this you can use the following functions  and ¬. If m >> n than the function gives more efficiency. Even otherwise, it can be used to simplify the procedure for optimizing the code for transformation of the list data.4b after Vector (a, b) in the type definition of the ( must be a defaultValue for case above. Vector (a, b) corresponds to , a1 -> b1 a2 -> b2 a3 -> b3 ... an -> bnmm2DFunction that sorts a list of (a, b) tuples by the first argument (|aÊ| must be an instance of class Ord) and is inspired by Data.List.sort function (the last one can be used for sorting the (a, b) tuples where both the types of a and b have instances of the class Ord).mm2BFunction that prepares the list of (a, b) tuples representing the  Tcase var of a1 -> b1 a2 -> b2 a3 -> b3 ... an -> bn _ -> defaultValuefor usage in the  and  functions. |a#| must be an instance of class Ord.mm2ÿKThe function that is used to filter a list [(a, b)] of the corresponding values for getFstB' to obtain the Vector (a, b) such that the b element for the sequence of pairs (a, b) with the same a is selected by the predicate p and is not necessarily the first one as it is for the getFstB' function and its successors by default.mm2ga default value that can be substituted if there is no correspendence in the set of (a, b) tuples (the ! or irrefutable pattern analogue)mm2½Vector of the (a, b) tuples that are sorted in ascending order for the first argument. If there are several pairs (a, b) with the same a, the function acts as if there is only the first onemm2@an element for which the corresponding resulting b must be foundmm2 the resultmm2UVector of the (a, b) tuples that are sorted in ascending order for the first argumentmm2ga default value that can be substituted if there is no correspendence in the set of (a, b) tuples (the ! or irrefutable pattern analogue)mm2Oa Vector needed to be transformed accordingly to the correct (a, b) tuple pairsmm2the resulting Vectormm2UVector of the (a, b) tuples that are sorted in ascending order for the first argumentmm2ga default value that can be substituted if there is no correspendence in the set of (a, b) tuples (the ! or irrefutable pattern analogue)mm2Wa list of values needed to be transformed accordingly to the correct (a, b) tuple pairsmm2the resulting listmm2øThe predicate p used to select the only one value of b in the pairs (a, b) with the same a. ^ If there are several pairs (a, b) for the same a that satisfies a predicate then the first one is used. For large [(a, b)] ^ it can be rather complex.mm2VThe list of (a, b) sorted in the ascending order by the first element a (e. g. by the  function)mm2^The resulting filtered Vector (a, b) that can be used for getFstB' and its successor functions Example: µfilterP (\(t, w) -> (t == "1") || (w > 'f')) . sortFst $ [("1",'a'),("4a",'k'),("4a",'b'),("4a",'c'),("4a",'d'),("4a",'e'),("b7",'c'),("b7",'k')] = [("1",'a'),("4a",'k'),("b7",'k')] "mm2-0.1.1.0-3tPOh5x1TNK3axdXtWqvnJCaseBigetBFst'getBFstVgetBFstsortFstsortFstVfilterPbaseGHC.Base otherwise