@@ -1,69 +1,47 @@
1−{-# OPTIONS_GHC -Wno-missing-export-lists #-}
3−{-# LANGUAGE AllowAmbiguousTypes #-}
1+{-# LANGUAGE AllowAmbiguousTypes #-}
4−{-# LANGUAGE BangPatterns #-}
2+{-# LANGUAGE BangPatterns #-}
6−{-# LANGUAGE DataKinds #-}
3+{-# LANGUAGE DataKinds #-}
7−{-# LANGUAGE GADTs #-}
4+{-# LANGUAGE GADTs #-}
8−{-# LANGUAGE InstanceSigs #-}
5+{-# LANGUAGE InstanceSigs #-}
6+{-# LANGUAGE KindSignatures #-}
9−{-# LANGUAGE MagicHash #-}
7+{-# LANGUAGE MagicHash #-}
10−{-# LANGUAGE PolyKinds #-}
8+{-# LANGUAGE PolyKinds #-}
11−{-# LANGUAGE Rank2Types #-}
9+{-# LANGUAGE Rank2Types #-}
12−{-# LANGUAGE TypeFamilies #-}
10+{-# LANGUAGE TypeFamilies #-}
13−{-# LANGUAGE TypeInType #-}
11+{-# LANGUAGE TypeInType #-}
14−{-# LANGUAGE ViewPatterns #-}
12+{-# LANGUAGE ViewPatterns #-}
16−#if __GLASGOW_HASKELL__ >= 806
17−{-# LANGUAGE QuantifiedConstraints #-}
20-- {-# OPTIONS_GHC -ddump-simpl -dsuppress-idinfo -dsuppress-coercions -dsuppress-type-applications -dsuppress-uniques -dsuppress-module-prefixes #-}
14-- {-# OPTIONS_GHC -ddump-simpl -dsuppress-idinfo -dsuppress-coercions -dsuppress-type-applications -dsuppress-uniques -dsuppress-module-prefixes #-}
23−Copyright: (c) 2017-2020 Kowainik
24−SPDX-License-Identifier: MPL-2.0
25−Maintainer: Kowainik <xrom.xkov@gmail.com>
27−Internal API for 'TypeRepMap' and operations on it. The functions here do
16+-- | Internal API for 'TypeRepMap' and operations on it. The functions here do
28−not have any stability guarantees and can change between minor versions.
17+-- not have any stability guarantees and can change between minor versions.
30−If you need to use this module for purposes other than tests,
19+-- If you need to use this module for purposes other than tests,
31−create an issue.
20+-- create an issue.
36module Data.TypeRepMap.Internal where
22module Data.TypeRepMap.Internal where
38import Prelude hiding (lookup)
24import Prelude hiding (lookup)
40−import Control.DeepSeq
41import Control.Monad.ST (ST, runST)
26import Control.Monad.ST (ST, runST)
42import Control.Monad.Zip (mzip)
27import Control.Monad.Zip (mzip)
43import Data.Function (on)
28import Data.Function (on)
44import Data.Kind (Type)
29import Data.Kind (Type)
45−import Data.Type.Equality ((:~:) (..), TestEquality (..))
46import Data.List (intercalate, nubBy)
30import Data.List (intercalate, nubBy)
47−import Data.Maybe (fromMaybe)
48−import Data.Primitive.Array (Array, MutableArray, indexArray, mapArray', sizeofArray,
31+import Data.Primitive.Array (Array, MutableArray, indexArray, mapArray', readArray, sizeofArray,
49 thawArray, unsafeFreezeArray, writeArray)
32 thawArray, unsafeFreezeArray, writeArray)
50−import Data.Primitive.PrimArray (writePrimArray, newPrimArray, unsafeFreezePrimArray, primArrayToList, MutablePrimArray, primArrayFromListN, PrimArray, indexPrimArray, sizeofPrimArray)
33+import Data.Primitive.PrimArray (PrimArray, indexPrimArray, sizeofPrimArray)
51−import Data.Semigroup (Semigroup (..), All(..))
34+import Data.Semigroup (Semigroup (..))
52import GHC.Base (Any, Int (..), Int#, (*#), (+#), (<#))
35import GHC.Base (Any, Int (..), Int#, (*#), (+#), (<#))
53import GHC.Exts (IsList (..), inline, sortWith)
36import GHC.Exts (IsList (..), inline, sortWith)
54import GHC.Fingerprint (Fingerprint (..))
37import GHC.Fingerprint (Fingerprint (..))
55−#if WORD_SIZE_IN_BITS >= 64
56import GHC.Prim (eqWord#, ltWord#)
38import GHC.Prim (eqWord#, ltWord#)
58−import GHC.IntWord64 (eqWord64#, ltWord64#)
59−#define eqWord eqWord64
60−#define ltWord ltWord64
62import GHC.Word (Word64 (..))
39import GHC.Word (Word64 (..))
63import Type.Reflection (SomeTypeRep (..), TypeRep, Typeable, typeRep, withTypeable)
40import Type.Reflection (SomeTypeRep (..), TypeRep, Typeable, typeRep, withTypeable)
64import Type.Reflection.Unsafe (typeRepFingerprint)
41import Type.Reflection.Unsafe (typeRepFingerprint)
65import Unsafe.Coerce (unsafeCoerce)
42import Unsafe.Coerce (unsafeCoerce)
44+import qualified Data.Map.Strict as Map
67import qualified GHC.Exts as GHC (fromList, toList)
45import qualified GHC.Exts as GHC (fromList, toList)
@@ -96,9 +74,6 @@ data TypeRepMap (f :: k -> Type) =
97 -- ^ an unsafe constructor for 'TypeRepMap'
75 -- ^ an unsafe constructor for 'TypeRepMap'
99−instance NFData (TypeRepMap f) where
100− rnf x = rnf (keys x) `seq` ()
102-- | Shows only keys.
77-- | Shows only keys.
103instance Show (TypeRepMap f) where
78instance Show (TypeRepMap f) where
104 show TypeRepMap{..} = "TypeRepMap [" ++ showKeys ++ "]"
79 show TypeRepMap{..} = "TypeRepMap [" ++ showKeys ++ "]"
@@ -118,31 +93,6 @@ instance Monoid (TypeRepMap f) where
118 {-# INLINE mempty #-}
93 {-# INLINE mempty #-}
119 {-# INLINE mappend #-}
94 {-# INLINE mappend #-}
121−#if __GLASGOW_HASKELL__ >= 806
122−instance (forall a. Typeable a => Eq (f a)) => Eq (TypeRepMap f) where
123− tm1 == tm2 = size tm1 == size tm2 && go 0
127− | i == size tm1 = True
128− | otherwise = case testEquality tr1i tr2i of
130− Just Refl -> repEq tr1i (fromAny tv1i) (fromAny tv2i) && go (i + 1)
133− tr1i = anyToTypeRep $ indexArray (trKeys tm1) i
136− tr2i = anyToTypeRep $ indexArray (trKeys tm2) i
139− tv1i = indexArray (trAnys tm1) i
140− tv2i = indexArray (trAnys tm2) i
142− repEq :: TypeRep x -> f x -> f x -> Bool
143− repEq tr = withTypeable tr (==)
146-- | Returns the list of 'Fingerprint's from 'TypeRepMap'.
96-- | Returns the list of 'Fingerprint's from 'TypeRepMap'.
147toFingerprints :: TypeRepMap f -> [Fingerprint]
97toFingerprints :: TypeRepMap f -> [Fingerprint]
148toFingerprints TypeRepMap{..} =
98toFingerprints TypeRepMap{..} =
@@ -169,49 +119,33 @@ prop> member @a (one (x :: f a)) == True
171one :: forall a f . Typeable a => f a -> TypeRepMap f
121one :: forall a f . Typeable a => f a -> TypeRepMap f
172−one x = TypeRepMap (primArrayFromListN 1 [fa])
122+one x = insert x empty
173− (primArrayFromListN 1 [fb])
177− (Fingerprint fa fb, v, k) = (calcFp @a, toAny x, unsafeCoerce $ typeRep @a)
178{-# INLINE one #-}
123{-# INLINE one #-}
182Insert a value into a 'TypeRepMap'.
127Insert a value into a 'TypeRepMap'.
183−TypeRepMap optimizes for fast reads rather than inserts, as a trade-off inserts are @O(n)@.
185prop> size (insert v tm) >= size tm
129prop> size (insert v tm) >= size tm
186prop> member @a (insert (x :: f a) tm) == True
130prop> member @a (insert (x :: f a) tm) == True
189insert :: forall a f . Typeable a => f a -> TypeRepMap f -> TypeRepMap f
133insert :: forall a f . Typeable a => f a -> TypeRepMap f -> TypeRepMap f
190−insert x m
134+insert x = fromTriples . addX . toTriples
191− | size m == 0 = one x
192− | otherwise = case cachedBinarySearch (typeFp @a) (fingerprintAs m) (fingerprintBs m) of
193− Nothing -> union m $ one x
194− Just i -> m {trAnys = changeAnyArr i (trAnys m)}
196− changeAnyArr :: Int -> Array Any -> Array Any
136+ tripleX :: (Fingerprint, Any, Any)
197− changeAnyArr i trAs = runST $ do
137+ tripleX@(fpX, _, _) = (calcFp @a, toAny x, unsafeCoerce $ typeRep @a)
198− let n = sizeofArray trAs
138+
199− mutArr <- thawArray trAs 0 n
139+ addX :: [(Fingerprint, Any, Any)] -> [(Fingerprint, Any, Any)]
200− writeArray mutArr i $ toAny x
140+ addX l = tripleX : deleteByFst fpX l
201− unsafeFreezeArray mutArr
202{-# INLINE insert #-}
141{-# INLINE insert #-}
204-- Extract the kind of a type. We use it to work around lack of syntax for
143-- Extract the kind of a type. We use it to work around lack of syntax for
205-- inferred type variables (which are not subject to type applications).
144-- inferred type variables (which are not subject to type applications).
206type KindOf (a :: k) = k
145type KindOf (a :: k) = k
208−type ArgKindOf (f :: k -> l) = k
210{- | Delete a value from a 'TypeRepMap'.
147{- | Delete a value from a 'TypeRepMap'.
212−TypeRepMap optimizes for fast reads rather than modifications, as a trade-off deletes are
213−@O(n)@, with an @O(log(n))@ optimization for when the element is already missing.
215prop> size (delete @a tm) <= size tm
149prop> size (delete @a tm) <= size tm
216prop> member @a (delete @a tm) == False
150prop> member @a (delete @a tm) == False
@@ -224,60 +158,30 @@ False
226delete :: forall a (f :: KindOf a -> Type) . Typeable a => TypeRepMap f -> TypeRepMap f
160delete :: forall a (f :: KindOf a -> Type) . Typeable a => TypeRepMap f -> TypeRepMap f
227−delete m
161+delete = fromTriples . deleteByFst (typeFp @a) . toTriples
228− -- Lookups are fast, so check if we even have the element first.
229− | not (member @a m) = m
230− -- We know we have the element, If the map has exactly one element, we can return the empty map
231− | size m == 1 = empty
232− -- Otherwise, filter out the element in linear time.
233− | otherwise = fromSortedTriples . deleteFirst ((== typeFp @a) . fst3) . toSortedTriples $ m
234{-# INLINE delete #-}
162{-# INLINE delete #-}
236−deleteFirst :: (a -> Bool) -> [a] -> [a]
237−deleteFirst _ [] = []
238−deleteFirst p (x : xs) = if p x then xs else x : deleteFirst p xs
241−Update a value at a specific key with the result of the provided function.
165+Update a value at a specific key with the result of the provided function. When
242−When the key is not a member of the map, the original map is returned.
166+the key is not a member of the map, the original map is returned.
244>>> trmap = fromList @(TypeRepMap Identity) [WrapTypeable $ Identity "a"]
168>>> trmap = fromList @(TypeRepMap Identity) [WrapTypeable $ Identity "a"]
245>>> lookup @String $ adjust (fmap (++ "ww")) trmap
169>>> lookup @String $ adjust (fmap (++ "ww")) trmap
246Just (Identity "aww")
170Just (Identity "aww")
248adjust :: forall a f . Typeable a => (f a -> f a) -> TypeRepMap f -> TypeRepMap f
172adjust :: forall a f . Typeable a => (f a -> f a) -> TypeRepMap f -> TypeRepMap f
249−adjust fun = alter (fmap fun)
250−{-# INLINE adjust #-}
253−Updates a value at a specific key, whether or not it exists.
254−This can be used to insert, delete, or update a value of a given type in the map.
256−>>> func = (\case Nothing -> Just (Identity "new"); Just (Identity s) -> Just (Identity (reverse s)))
257−>>> lookup @String $ alter func empty
258−Just (Identity "new")
259−>>> trmap = fromList @(TypeRepMap Identity) [WrapTypeable $ Identity "helllo"]
260−>>> lookup @String $ alter func trmap
261−>>> Just (Identity "olleh")
263−alter :: forall a f . Typeable a => (Maybe (f a) -> Maybe (f a)) -> TypeRepMap f -> TypeRepMap f
264−alter fun tr = case cachedBinarySearch (typeFp @a) (fingerprintAs tr) (fingerprintBs tr) of
173+adjust fun tr = case cachedBinarySearch (typeFp @a) (fingerprintAs tr) (fingerprintBs tr) of
265− Nothing ->
174+ Nothing -> tr
266− case (fun Nothing) of
268− Just v -> insert v tr
270− case fun (Just . fromAny $ indexArray (trAnys tr) i) of
271− Nothing -> delete @a tr
272− Just v -> tr{trAnys = replaceAnyAt i (toAny v) (trAnys tr)}
175+ Just i -> tr {trAnys = changeAnyArr i (trAnys tr)}
274− replaceAnyAt :: Int -> Any -> Array Any -> Array Any
177+ changeAnyArr :: Int -> Array Any -> Array Any
275− replaceAnyAt i v trAs = runST $ do
178+ changeAnyArr i trAs = runST $ do
276 let n = sizeofArray trAs
179 let n = sizeofArray trAs
277 mutArr <- thawArray trAs 0 n
180 mutArr <- thawArray trAs 0 n
181+ a <- toAny . fun . fromAny <$> readArray mutArr i
278− writeArray mutArr i v
182+ writeArray mutArr i a
279 unsafeFreezeArray mutArr
183 unsafeFreezeArray mutArr
280−{-# INLINE alter #-}
184+{-# INLINE adjust #-}
282{- | Map over the elements of a 'TypeRepMap'.
186{- | Map over the elements of a 'TypeRepMap'.
@@ -311,89 +215,30 @@ hoistWithKey f (TypeRepMap as bs ans ks) = TypeRepMap as bs newAns ks
311 withTr t = withTypeable t f
215 withTr t = withTypeable t f
312{-# INLINE hoistWithKey #-}
216{-# INLINE hoistWithKey #-}
314−-- | The union of two 'TypeRepMap's using a combining function for conflicting entries. @O(n + m)@
218+-- | The union of two 'TypeRepMap's using a combining function.
315−unionWith :: forall f. (forall x. Typeable x => f x -> f x -> f x) -> TypeRepMap f -> TypeRepMap f -> TypeRepMap f
219+unionWith :: (forall x. f x -> f x -> f x) -> TypeRepMap f -> TypeRepMap f -> TypeRepMap f
316−unionWith f ma mb = do
220+unionWith f m1 m2 = fromTriples
317− fromSortedTriples $ mergeMaps (toSortedTriples ma) (toSortedTriples mb)
221+ $ toTripleList
222+ $ Map.unionWith combine
223+ (fromTripleList $ toTriples m1)
224+ (fromTripleList $ toTriples m2)
319− f' :: forall x. TypeRep x -> f x -> f x -> f x
320− f' tr = withTypeable tr f
322− combine :: (Fingerprint, Any, Any) -> (Fingerprint, Any, Any) -> (Fingerprint, Any, Any)
226+ combine :: (Any, Any) -> (Any, Any) -> (Any, Any)
323− combine (fp, av, ak) (_, bv, _) = (fp, toAny $ f' (fromAny ak) (fromAny av) (fromAny bv), ak)
227+ combine (av, ak) (bv, _) = (toAny $ f (fromAny av) (fromAny bv), ak)
325− -- Merges two typrepmaps into a sorted, dedup'd list of triples.
229+ fromTripleList :: Ord a => [(a, b, c)] -> Map.Map a (b, c)
326− -- Using 'toSortedTriples' allows us to assume the triples are sorted by fingerprint,
230+ fromTripleList = Map.fromList . map (\(a, b, c) -> (a, (b, c)))
327− -- Given O(n) performance from 'toSortedTriples', and given that we can merge-sort in
231+
328− -- O(n + m) time, then can '.fromSortedTriples' back into cachedBinarySearch order in O(n + m)
232+ toTripleList :: Map.Map a (b, c) -> [(a, b, c)]
329− -- that gives a total of O(n + m).
233+ toTripleList = map (\(a, (b, c)) -> (a, b, c)) . Map.toList
330− mergeMaps :: [(Fingerprint, Any, Any)] -> [(Fingerprint, Any, Any)] -> [(Fingerprint, Any, Any)]
331− -- We've addressed all elements from both maps
332− mergeMaps as [] = as
333− mergeMaps [] bs = bs
335− mergeMaps (a@(af, _, _) : as) (b@(bf, _, _) : bs) =
336− case compare af bf of
337− -- Fingerprints are equal, union the elements using our function
338− -- If the incoming maps were de-duped, there shouldn't be any other equivalent
340− EQ -> combine a b : mergeMaps as bs
341− -- First fingerprint must not be in the second map or we would have seen it by now
342− -- Add it to the result as-is
343− LT -> a : mergeMaps as (b : bs)
344− -- Second fingerprint must not be in the first map or we would have seen it by now
345− -- Add it to the result as-is
346− GT -> b : mergeMaps (a:as) bs
347{-# INLINE unionWith #-}
234{-# INLINE unionWith #-}
349−-- | The (left-biased) union of two 'TypeRepMap's in @O(n + m)@. It prefers the first map when
236+-- | The (left-biased) union of two 'TypeRepMap's. It prefers the first map when
350-- duplicate keys are encountered, i.e. @'union' == 'unionWith' const@.
237-- duplicate keys are encountered, i.e. @'union' == 'unionWith' const@.
351union :: TypeRepMap f -> TypeRepMap f -> TypeRepMap f
238union :: TypeRepMap f -> TypeRepMap f -> TypeRepMap f
352union = unionWith const
239union = unionWith const
353{-# INLINE union #-}
240{-# INLINE union #-}
355−-- | The 'intersection' of two 'TypeRepMap's using a combining function
358−intersectionWith :: forall f. (forall x. Typeable x => f x -> f x -> f x) -> TypeRepMap f -> TypeRepMap f -> TypeRepMap f
359−intersectionWith f ma mb =
360− fromSortedTriples $ mergeMaps (toSortedTriples ma) (toSortedTriples mb)
362− f' :: forall x. TypeRep x -> f x -> f x -> f x
363− f' tr = withTypeable tr f
365− combine :: (Fingerprint, Any, Any) -> (Fingerprint, Any, Any) -> (Fingerprint, Any, Any)
366− combine (fp, av, ak) (_, bv, _) = (fp, toAny $ f' (fromAny ak) (fromAny av) (fromAny bv), ak)
368− -- Merges two typrepmaps into a sorted, dedup'd list of triples.
369− mergeMaps :: [(Fingerprint, Any, Any)] -> [(Fingerprint, Any, Any)] -> [(Fingerprint, Any, Any)]
370− -- If either list is empty, the intersection must be finished.
373− -- Merge the two maps considering one element at a time.
374− mergeMaps (a@(af, _, _) : as) (b@(bf, _, _) : bs) =
375− case compare af bf of
376− -- Fingerprints are equal, union the elements using our function
377− -- If the incoming maps were de-duped, there shouldn't be any other equivalent
379− EQ -> combine a b : mergeMaps as bs
380− -- First fingerprint must not be in the second map or we would have seen it by now
381− -- Skip it an move on
382− LT -> mergeMaps as (b : bs)
383− -- Second fingerprint must not be in the first map or we would have seen it by now
384− -- Skip it an move on
385− GT -> mergeMaps (a:as) bs
386−{-# INLINE intersectionWith #-}
388−-- | The intersection of two 'TypeRepMap's.
389−-- It keeps all values from the first map whose keys are present in the second.
392−intersection :: TypeRepMap f -> TypeRepMap f -> TypeRepMap f
393−intersection = intersectionWith const
394−{-# INLINE intersection #-}
397{- | Check if a value of the given type is present in a 'TypeRepMap'.
242{- | Check if a value of the given type is present in a 'TypeRepMap'.
399>>> member @Char $ one (Identity 'a')
244>>> member @Char $ one (Identity 'a')
@@ -429,22 +274,9 @@ size = sizeofPrimArray . fingerprintAs
430-- | Return the list of 'SomeTypeRep' from the keys.
275-- | Return the list of 'SomeTypeRep' from the keys.
431keys :: TypeRepMap f -> [SomeTypeRep]
276keys :: TypeRepMap f -> [SomeTypeRep]
432−keys = keysWith SomeTypeRep
277+keys TypeRepMap{..} = SomeTypeRep . anyToTypeRep <$> toList trKeys
433{-# INLINE keys #-}
278{-# INLINE keys #-}
435−-- | Return the list of keys by wrapping them with a user-provided function.
436−keysWith :: (forall (a :: ArgKindOf f). TypeRep a -> r) -> TypeRepMap f -> [r]
437−keysWith f TypeRepMap{..} = f . anyToTypeRep <$> toList trKeys
438−{-# INLINE keysWith #-}
440−-- | Return the list of key-value pairs by wrapping them with a user-provided function.
441−toListWith :: forall f r. (forall (a :: ArgKindOf f). Typeable a => f a -> r) -> TypeRepMap f -> [r]
442−toListWith f = map toF . toTriples
444− withTypeRep :: TypeRep a -> f a -> r
445− withTypeRep tr an = withTypeable tr $ f an
446− toF (_, an, k) = withTypeRep (unsafeCoerce k) (fromAny an)
448-- | Binary searched based on this article
280-- | Binary searched based on this article
449-- http://bannalia.blogspot.com/2015/06/cache-friendly-binary-search.html
281-- http://bannalia.blogspot.com/2015/06/cache-friendly-binary-search.html
450-- with modification for our two-vector search case.
282-- with modification for our two-vector search case.
@@ -488,20 +320,8 @@ typeFp = typeRepFingerprint $ typeRep @a
488toTriples :: TypeRepMap f -> [(Fingerprint, Any, Any)]
320toTriples :: TypeRepMap f -> [(Fingerprint, Any, Any)]
489toTriples tm = zip3 (toFingerprints tm) (GHC.toList $ trAnys tm) (GHC.toList $ trKeys tm)
321toTriples tm = zip3 (toFingerprints tm) (GHC.toList $ trAnys tm) (GHC.toList $ trKeys tm)
491−-- | Efficiently get sorted triples from a map in O(n) time
323+deleteByFst :: Eq a => a -> [(a, b, c)] -> [(a, b, c)]
492−--
324+deleteByFst x = filter ((/= x) . fst3)
493−-- We assume the incoming TypeRepMap is already sorted into 'cachedBinarySearch' order using fromSortedList.
494−-- Then we can construct the index mapping from the "cached" ordering into monotonically
495−-- increasing order using 'generateOrderMapping' with the length of the TRM. This takes @O(n).
496−-- We then pull those indexes from the source TRM to get the sorted triples in a total of @O(n).
497−toSortedTriples :: TypeRepMap f -> [(Fingerprint, Any, Any)]
498−toSortedTriples tm = trip <$> ordering
500− trip i = ( Fingerprint (indexPrimArray (fingerprintAs tm) i) (indexPrimArray (fingerprintBs tm) i)
501− , indexArray (trAnys tm) i
502− , indexArray (trKeys tm) i)
504− ordering = generateOrderMapping (size tm)
506nubByFst :: (Eq a) => [(a, b, c)] -> [(a, b, c)]
326nubByFst :: (Eq a) => [(a, b, c)] -> [(a, b, c)]
507nubByFst = nubBy ((==) `on` fst3)
327nubByFst = nubBy ((==) `on` fst3)
@@ -548,19 +368,19 @@ instance IsList (TypeRepMap f) where
548 k (WrapTypeable (_ :: f a)) = unsafeCoerce $ typeRep @a
368 k (WrapTypeable (_ :: f a)) = unsafeCoerce $ typeRep @a
550 toList :: TypeRepMap f -> [WrapTypeable f]
370 toList :: TypeRepMap f -> [WrapTypeable f]
551− toList = toListWith WrapTypeable
371+ toList = map toWrapTypeable . toTriples
373+ toWrapTypeable :: (Fingerprint, Any, Any) -> WrapTypeable f
374+ toWrapTypeable (_, an, k) = withTypeable (unsafeCoerce k) $ fromAny an
553calcFp :: forall a . Typeable a => Fingerprint
376calcFp :: forall a . Typeable a => Fingerprint
554calcFp = typeRepFingerprint $ typeRep @a
377calcFp = typeRepFingerprint $ typeRep @a
556fromTriples :: [(Fingerprint, Any, Any)] -> TypeRepMap f
379fromTriples :: [(Fingerprint, Any, Any)] -> TypeRepMap f
557−fromTriples = fromSortedTriples . sortWith fst3 . nubByFst
559−fromSortedTriples :: [(Fingerprint, Any, Any)] -> TypeRepMap f
560−fromSortedTriples kvs = TypeRepMap (GHC.fromList fpAs) (GHC.fromList fpBs) (GHC.fromList ans) (GHC.fromList ks)
380+fromTriples kvs = TypeRepMap (GHC.fromList fpAs) (GHC.fromList fpBs) (GHC.fromList ans) (GHC.fromList ks)
562 (fpAs, fpBs) = unzip $ map (\(Fingerprint a b) -> (a, b)) fps
382 (fpAs, fpBs) = unzip $ map (\(Fingerprint a b) -> (a, b)) fps
563− (fps, ans, ks) = unzip3 $ fromSortedList kvs
383+ (fps, ans, ks) = unzip3 $ fromSortedList $ sortWith fst3 $ nubByFst kvs
565----------------------------------------------------------------------------
385----------------------------------------------------------------------------
566-- Tree-like conversion
386-- Tree-like conversion
@@ -586,85 +406,3 @@ fromSortedList l = runST $ do
586 newFirst <- loop (2 * i + 1) first
406 newFirst <- loop (2 * i + 1) first
587 writeArray result i (indexArray origin newFirst)
407 writeArray result i (indexArray origin newFirst)
588 loop (2 * i + 2) (newFirst + 1)
408 loop (2 * i + 2) (newFirst + 1)
590−-- Returns a list of indexes which represents the "sorted" order of an array generated by
591−-- fromSortedList of the provided length.
592−-- I.e. fmap (fromSortedList [1, 2, 3, 4, 5, 6] !!) (generateOrderMapping 6) == [1, 2, 3, 4, 5, 6]
594−-- >>> generateOrderMapping 6
597−-- >>> generateOrderMapping 8
599−generateOrderMapping :: Int -> [Int]
600−generateOrderMapping len = runST $ do
601− orderMappingArr <- newPrimArray len
602− _ <- loop orderMappingArr 0 0
603− primArrayToList <$> unsafeFreezePrimArray orderMappingArr
605− loop :: MutablePrimArray s Int -> Int -> Int -> ST s Int
606− loop result i first =
610− newFirst <- loop result (2 * i + 1) first
611− writePrimArray result newFirst i
612− loop result (2 * i + 2) (newFirst + 1)
614−----------------------------------------------------------------------------
616−----------------------------------------------------------------------------
618−-- | Check that invariant of the structure holds.
619−-- The structure maintains the following invariant.
620−-- For each element @A@ at index @i@:
622−-- 1. if there is an element @B@ at index @2*i+1@,
625−-- 2. if there is an element @C@ at index @2*i+2@,
628−invariantCheck :: TypeRepMap f -> Bool
629−invariantCheck TypeRepMap{..} = getAll (check 0)
631− lastMay [] = Nothing
632− lastMay [x] = Just x
633− lastMay (_:xs) = lastMay xs
634− sz = sizeofPrimArray fingerprintAs
635− check i | i >= sz = All True
639− -- maximum value in the left branch
641− fmap (\j -> (indexPrimArray fingerprintAs j, indexPrimArray fingerprintBs j))
644− $ iterate (\j -> j*2+2) left
645− -- minimum value in the right branch
647− fmap (\j -> (indexPrimArray fingerprintAs j, indexPrimArray fingerprintBs j))
650− $ iterate (\j -> j*2+1) right
655− case indexPrimArray fingerprintAs i `compare` indexPrimArray fingerprintAs left of
657− EQ -> indexPrimArray fingerprintBs i >= indexPrimArray fingerprintBs left
663− case indexPrimArray fingerprintAs i `compare` indexPrimArray fingerprintAs right of
665− EQ -> indexPrimArray fingerprintBs i <= indexPrimArray fingerprintBs right
668− , All $ fromMaybe True $ (<=) <$> leftMax <*> rightMin