diff options
Diffstat (limited to 'libraries/base/Data')
| -rw-r--r-- | libraries/base/Data/Data.hs | 2 | ||||
| -rw-r--r-- | libraries/base/Data/Foldable.hs | 8 | ||||
| -rw-r--r-- | libraries/base/Data/OldList.hs | 2 | ||||
| -rw-r--r-- | libraries/base/Data/Typeable/Internal.hs | 2 |
4 files changed, 7 insertions, 7 deletions
diff --git a/libraries/base/Data/Data.hs b/libraries/base/Data/Data.hs index fa199f1117..dfa55676f6 100644 --- a/libraries/base/Data/Data.hs +++ b/libraries/base/Data/Data.hs @@ -1108,7 +1108,7 @@ ratioDataType = mkDataType "GHC.Real.Ratio" [ratioConstr] -- NB: This Data instance intentionally uses the (%) smart constructor instead -- of the internal (:%) constructor to preserve the invariant that a Ratio --- value is reduced to normal form. See Trac #10011. +-- value is reduced to normal form. See #10011. -- | @since 4.0.0.0 instance (Data a, Integral a) => Data (Ratio a) where diff --git a/libraries/base/Data/Foldable.hs b/libraries/base/Data/Foldable.hs index 9a031212f0..037a44b99e 100644 --- a/libraries/base/Data/Foldable.hs +++ b/libraries/base/Data/Foldable.hs @@ -127,7 +127,7 @@ class Foldable t where -- and combine the results. foldMap :: Monoid m => (a -> m) -> t a -> m {-# INLINE foldMap #-} - -- This INLINE allows more list functions to fuse. See Trac #9848. + -- This INLINE allows more list functions to fuse. See #9848. foldMap f = foldr (mappend . f) mempty -- | A variant of 'foldMap' that is strict in the accumulator. @@ -718,7 +718,7 @@ GHC used to proceed like this: in ...(c x1 y1)...(c x2 y2)....n... The trouble is that `c`, being big, will not be inlined. And that can -be absolutely terrible for performance, as we saw in Trac #8763. +be absolutely terrible for performance, as we saw in #8763. It's much better to define @@ -776,7 +776,7 @@ foldr1. This was problematic for space usage, as the semantics of maximumBy and minimumBy essentially require that they examine every element of the data structure. Using foldr1 to examine every element results in space usage proportional to the size of the data structure. For the common case of lists, -this could be particularly bad (see Trac #10830). +this could be particularly bad (see #10830). For the common case of lists, switching the implementations of maximumBy and minimumBy to foldl1 solves the issue, as GHC's strictness analysis can then @@ -784,7 +784,7 @@ make these functions only use O(1) stack space. It is perhaps not the optimal way to fix this problem, as there are other conceivable data structures (besides lists) which might benefit from specialized implementations for maximumBy and minimumBy (see -https://ghc.haskell.org/trac/ghc/ticket/10830#comment:26 for a further +https://gitlab.haskell.org/ghc/ghc/issues/10830#note_129843 for a further discussion). But using foldl1 is at least always better than using foldr1, so GHC has chosen to adopt that approach for now. -} diff --git a/libraries/base/Data/OldList.hs b/libraries/base/Data/OldList.hs index 132ee14673..82cc9faa3b 100644 --- a/libraries/base/Data/OldList.hs +++ b/libraries/base/Data/OldList.hs @@ -1112,7 +1112,7 @@ and possibly to bear similarities to a 1982 paper by Richard O'Keefe: "A smooth applicative merge sort". Benchmarks show it to be often 2x the speed of the previous implementation. -Fixes ticket http://ghc.haskell.org/trac/ghc/ticket/2143 +Fixes ticket https://gitlab.haskell.org/ghc/ghc/issues/2143 -} sort = sortBy compare diff --git a/libraries/base/Data/Typeable/Internal.hs b/libraries/base/Data/Typeable/Internal.hs index 1be6e27b74..1775871034 100644 --- a/libraries/base/Data/Typeable/Internal.hs +++ b/libraries/base/Data/Typeable/Internal.hs @@ -830,7 +830,7 @@ splitApps = go [] -- appropriate module and constructor names. -- -- The ticket to find a better way to deal with this is --- Trac #14480. +-- #14480. tyConTYPE :: TyCon tyConTYPE = mkTyCon (tyConPackage liftedRepTyCon) "GHC.Prim" "TYPE" 0 (KindRepFun (KindRepTyConApp liftedRepTyCon []) (KindRepTYPE LiftedRep)) |