diff --git a/docs/developers/CHANGELOG.md b/docs/developers/CHANGELOG.md
index 6bb58fa..c810442 100644
--- a/docs/developers/CHANGELOG.md
+++ b/docs/developers/CHANGELOG.md
@@ -1,5 +1,8 @@
# 📅 Revision history for HelVM Common
+## 0.1.2.4 -- 2024-04-14
+* Fix "This binding for ‘golden’ shadows the existing binding"
+
## 0.1.2.3 -- 2023-06-20
* Implement `FileReaderIO (BusinessT MockIO)`
diff --git a/docs/reports/helio-test/helio-0.1.2.3-inplace/HelVM.HelIO.Collections.MapList.hs.html b/docs/reports/helio-test/helio-0.1.2.3-inplace/HelVM.HelIO.Collections.MapList.hs.html
index cf46672..6b37c5e 100644
--- a/docs/reports/helio-test/helio-0.1.2.3-inplace/HelVM.HelIO.Collections.MapList.hs.html
+++ b/docs/reports/helio-test/helio-0.1.2.3-inplace/HelVM.HelIO.Collections.MapList.hs.html
@@ -38,31 +38,31 @@
19 mapListEmpty = mapListFromList []
20
21 mapListFromList :: [a] -> MapList a
- 22 mapListFromList = fromIndexedList . List.indexed
+ 22 mapListFromList = fromIndexedList <$> List.indexed
23
24 fromIndexedList :: IndexedList a -> MapList a
- 25 fromIndexedList = fromIntMap . IntMap.fromList
+ 25 fromIndexedList = fromIntMap <$> IntMap.fromList
26
27 fromIntMap :: IntMap a -> MapList a
28 fromIntMap = MapList
29
30 -- | DeConstruction
31 mapListToList :: Default a => MapList a -> [a]
- 32 mapListToList = listFromDescList . toDescList
+ 32 mapListToList = listFromDescList <$> toDescList
33
34 toDescList :: MapList a -> IndexedList a
- 35 toDescList = IntMap.toDescList . unMapList
+ 35 toDescList = IntMap.toDescList <$> unMapList
36
37 -- | Internal function
38 listFromDescList :: Default a => IndexedList a -> [a]
- 39 listFromDescList = loop act . ([] , ) where
+ 39 listFromDescList = loop act <$> ([] , ) where
40 act :: Default a => AccWithIndexedList a -> Either (AccWithIndexedList a) [a]
41 act (acc , [] ) = Right acc
42 act (acc , [(i , v)] ) = Right $ consDef i $ v : acc
43 act (acc , (i1 , v1) : (i2 , v2) : l ) = Left (consDef (i1 - i2 - 1) $ v1 : acc , (i2 , v2) : l)
44
45 consDef :: Default a => Key -> [a] -> [a]
- 46 consDef i l = (check . compare i) 0 where
+ 46 consDef i l = (check <$> compare i) 0 where
47 check LT = error "MapList.consDef index is negative"
48 check EQ = l
49 check GT = consDef (i - 1) (def : l)
@@ -79,7 +79,7 @@
60
61 -- | Standard instances
62 instance (Default a , Show a) => Show (MapList a) where
- 63 show = show . I.toList
+ 63 show = show <$> I.toList
64
65 instance IsString MapString where
66 fromString = mapListFromList
@@ -88,27 +88,27 @@
69 type (Item (MapList a)) = a
70 toList = mapListToList
71 fromList = mapListFromList
- 72 fromListN n = mapListFromList . fromListN n
+ 72 fromListN n = mapListFromList <$> fromListN n
73
74 -- | ListLike instances
75 instance Default a => LL.FoldableLL (MapList a) a where
- 76 foldl f b = IntMap.foldl f b . unMapList
- 77 foldr f b = IntMap.foldr f b . unMapList
+ 76 foldl f b = IntMap.foldl f b <$> unMapList
+ 77 foldr f b = IntMap.foldr f b <$> unMapList
78
79 -- | My instances
80 instance {-# OVERLAPPING #-} IndexSafe (MapList a) a where
- 81 findWithDefault e i = IntMap.findWithDefault e i . unMapList
+ 81 findWithDefault e i = IntMap.findWithDefault e i <$> unMapList
82 findMaybe = mapListFindMaybe
83 indexMaybe = mapListIndexMaybe
- 84 findSafe i = liftMaybeOrError "MapList.findSafe: index is not correct" . mapListFindMaybe i
- 85 indexSafe l = liftMaybeOrError "MapList.LLIndexSafe: index is not correct" . mapListIndexMaybe l
+ 84 findSafe i = liftMaybeOrError "MapList.findSafe: index is not correct" <$> mapListFindMaybe i
+ 85 indexSafe l = liftMaybeOrError "MapList.LLIndexSafe: index is not correct" <$> mapListIndexMaybe l
86
87 instance InsertDef (MapList a) a where
- 88 insertDef i e = fromIntMap . IntMap.insert i e . unMapList
+ 88 insertDef i e = fromIntMap <$> IntMap.insert i e <$> unMapList
89
90 -- | Internal functions
91 mapListFindMaybe :: Key -> MapList a -> Maybe a
- 92 mapListFindMaybe i = IntMap.lookup i . unMapList
+ 92 mapListFindMaybe i = IntMap.lookup i <$> unMapList
93
94 mapListIndexMaybe :: MapList a -> Key -> Maybe a
95 mapListIndexMaybe l i = unMapList l IntMap.!? i
diff --git a/docs/reports/helio-test/helio-0.1.2.3-inplace/HelVM.HelIO.Collections.SList.hs.html b/docs/reports/helio-test/helio-0.1.2.3-inplace/HelVM.HelIO.Collections.SList.hs.html
index 03f93cf..2a837a5 100644
--- a/docs/reports/helio-test/helio-0.1.2.3-inplace/HelVM.HelIO.Collections.SList.hs.html
+++ b/docs/reports/helio-test/helio-0.1.2.3-inplace/HelVM.HelIO.Collections.SList.hs.html
@@ -45,11 +45,11 @@
26 sListEmpty = SList mempty
27
28 sListFromList :: [a] -> SList a
- 29 sListFromList = SList . fromList
+ 29 sListFromList = SList <$> fromList
30
31 -- | DeConstruction
32 sListToList :: SList a -> [a]
- 33 sListToList = toList . unSList
+ 33 sListToList = toList <$> unSList
34
35 -- | Types
36 type SString = SList Char
@@ -61,16 +61,16 @@
42
43 -- | Standard instances
44 instance Show a => Show (SList a) where
- 45 show = show . toList
+ 45 show = show <$> toList
46
47 instance IsString SString where
- 48 fromString = SList . L.slist
+ 48 fromString = SList <$> L.slist
49
50 instance IsList (SList a) where
51 type (Item (SList a)) = a
52 toList = sListToList
53 fromList = sListFromList
- 54 fromListN n = SList . fromListN n
+ 54 fromListN n = SList <$> fromListN n
55
56 -- | MonoFoldable instances
57 type instance MT.Element (SList a) = a
@@ -107,7 +107,7 @@
88 -- | ListLike instances
89 instance LL.FoldableLL (SList a) a where
90 -- foldl = F.foldl
- 91 foldl f z t = appEndo (getDual (foldMap (Dual . Endo . flip f) t)) z
+ 91 foldl f z t = appEndo (getDual (foldMap (Dual <$> Endo <$> flip f) t)) z
92 foldr = F.foldr
93 foldl1 = F.foldl1
94 foldr1 = F.foldr1
@@ -125,7 +125,7 @@
106 last = sListLast
107 tail = sListTail
108 init = sListInit
- 109 null = L.isEmpty . unSList
+ 109 null = L.isEmpty <$> unSList
110 -- length = genericLength
111 -- map = fmap
112 rigidMap = fmap
@@ -134,8 +134,8 @@
115 -- concat = fold
116 -- concatMap = foldMap
117 -- rigidConcatMap = concatMap
- 118 -- any p = getAny . foldMap (Any . p)
- 119 -- all p = getAll . foldMap (All . p)
+ 118 -- any p = getAny <$> foldMap (Any <$> p)
+ 119 -- all p = getAll <$> foldMap (All <$> p)
120 -- maximum = foldr1 max
121 -- minimum = foldr1 min
122 replicate = sListReplicate
@@ -146,7 +146,7 @@
127 -- dropWhile
128 -- dropWhileEnd func = foldr (\x xs -> if func x && null xs then empty else cons x xs) empty
129 -- span
- 130 -- break p = span (not . p)
+ 130 -- break p = span (not <$> p)
131 -- group = groupBy (==)
132 -- inits
133 -- tails
@@ -159,11 +159,11 @@
140 -- notElem i = all (/= i)
141 find = sListFind
142 -- filter
- 143 -- partition p xs = (filter p xs, filter (not . p) xs)
+ 143 -- partition p xs = (filter p xs, filter (not <$> p) xs)
144 index = sListIndex
145 -- elemIndex e l = findIndex (== e) l
146 -- elemIndices i l = findIndices (== i) l
- 147 -- findIndex f = listToMaybe . findIndices f
+ 147 -- findIndex f = listToMaybe <$> findIndices f
148 -- findIndices
149 -- sequence
150 -- mapM
@@ -186,7 +186,7 @@
167 -- groupBy
168 sortBy = sListSortBy
169 -- insertBy
- 170 genericLength = L.genericLength . unSList
+ 170 genericLength = L.genericLength <$> unSList
171 -- genericTake
172 -- genericDrop
173 -- genericSplitAt n l = (genericTake n l, genericDrop n l)
@@ -194,55 +194,55 @@
175
176 -- | My instances
177 instance Default a => MT.InsertDef (SList a) where
- 178 insertDef i e = sListFromList. MT.insertDef i e . sListToList
+ 178 insertDef i e = sListFromList. MT.insertDef i e <$> sListToList
179
180 instance Default a => LL.InsertDef (SList a) a where
- 181 insertDef i e = sListFromList. LL.insertDef i e . sListToList
+ 181 insertDef i e = sListFromList. LL.insertDef i e <$> sListToList
182
183 -- | Internals sList
184 sListCons :: a -> SList a -> SList a
- 185 sListCons e = SList . L.cons e . unSList
+ 185 sListCons e = SList <$> L.cons e <$> unSList
186
187 sListSnoc :: LL.ListLike a (I.Item a) => a -> I.Item a -> a
188 sListSnoc l e = l <> LL.singleton e
189
190 sListHead :: SList a -> a
- 191 sListHead = L.head . unSList
+ 191 sListHead = L.head <$> unSList
192
193 sListUncons :: SList a -> Maybe (a, SList a)
- 194 sListUncons l = wrap <$> (L.uncons . unSList) l where
+ 194 sListUncons l = wrap <$> (L.uncons <$> unSList) l where
195 wrap :: (a , L.Slist a) -> (a , SList a)
196 wrap (a , l') = (a , SList l')
197
198 sListLast :: SList a -> a
- 199 sListLast = L.last . unSList
+ 199 sListLast = L.last <$> unSList
200
201 sListTail :: SList a -> SList a
- 202 sListTail = SList . L.tail . unSList
+ 202 sListTail = SList <$> L.tail <$> unSList
203
204 sListInit :: SList a -> SList a
- 205 sListInit = SList . L.init . unSList
+ 205 sListInit = SList <$> L.init <$> unSList
206
207 sListReverse :: SList a -> SList a
- 208 sListReverse = SList . L.reverse . unSList
+ 208 sListReverse = SList <$> L.reverse <$> unSList
209
210 sListIntersperse :: a -> SList a -> SList a
- 211 sListIntersperse e = SList . L.intersperse e . unSList
+ 211 sListIntersperse e = SList <$> L.intersperse e <$> unSList
212
213 sListReplicate :: Int -> a -> SList a
- 214 sListReplicate e = SList . L.replicate e
+ 214 sListReplicate e = SList <$> L.replicate e
215
216 sListFind :: (a -> Bool) -> SList a -> Maybe a
- 217 sListFind e = find e . sListToList
+ 217 sListFind e = find e <$> sListToList
218
219 sListIndex :: SList a -> Int -> a
220 sListIndex = flip sListUnsafeAt
221
222 sListUnsafeAt :: Int -> SList a -> a
- 223 sListUnsafeAt i = L.unsafeAt i . unSList
+ 223 sListUnsafeAt i = L.unsafeAt i <$> unSList
224
225 sListSortBy :: (a -> a -> Ordering) -> SList a -> SList a
- 226 sListSortBy f = SList . L.sortBy f . unSList
+ 226 sListSortBy f = SList <$> L.sortBy f <$> unSList