Script 'mail_helper' called by obssrc
Hello community,
here is the log from the commit of package ghc-vector-algorithms for
openSUSE:Factory checked in at 2025-02-13 18:38:59
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/ghc-vector-algorithms (Old)
and /work/SRC/openSUSE:Factory/.ghc-vector-algorithms.new.8181 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-vector-algorithms"
Thu Feb 13 18:38:59 2025 rev:21 rq:1245489 version:0.9.1.0
Changes:
--------
---
/work/SRC/openSUSE:Factory/ghc-vector-algorithms/ghc-vector-algorithms.changes
2024-12-20 23:12:05.072094241 +0100
+++
/work/SRC/openSUSE:Factory/.ghc-vector-algorithms.new.8181/ghc-vector-algorithms.changes
2025-02-13 18:39:07.828375013 +0100
@@ -1,0 +2,8 @@
+Wed Feb 5 02:55:54 UTC 2025 - Peter Simons <psim...@suse.com>
+
+- Update vector-algorithms to version 0.9.1.0.
+ ## Version 0.9.1.0 (2025-02-05)
+
+ - More inlining for `sort` and `nib` functions.
+
+-------------------------------------------------------------------
Old:
----
vector-algorithms-0.9.0.3.tar.gz
New:
----
vector-algorithms-0.9.1.0.tar.gz
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Other differences:
------------------
++++++ ghc-vector-algorithms.spec ++++++
--- /var/tmp/diff_new_pack.5nOdg1/_old 2025-02-13 18:39:08.324395559 +0100
+++ /var/tmp/diff_new_pack.5nOdg1/_new 2025-02-13 18:39:08.324395559 +0100
@@ -1,7 +1,7 @@
#
# spec file for package ghc-vector-algorithms
#
-# Copyright (c) 2024 SUSE LLC
+# Copyright (c) 2025 SUSE LLC
#
# All modifications and additions to the file contributed by third parties
# remain the property of their copyright owners, unless otherwise agreed
@@ -20,7 +20,7 @@
%global pkgver %{pkg_name}-%{version}
%bcond_with tests
Name: ghc-%{pkg_name}
-Version: 0.9.0.3
+Version: 0.9.1.0
Release: 0
Summary: Efficient algorithms for vector arrays
License: BSD-3-Clause
++++++ vector-algorithms-0.9.0.3.tar.gz -> vector-algorithms-0.9.1.0.tar.gz
++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/vector-algorithms-0.9.0.3/CHANGELOG.md
new/vector-algorithms-0.9.1.0/CHANGELOG.md
--- old/vector-algorithms-0.9.0.3/CHANGELOG.md 2001-09-09 03:46:40.000000000
+0200
+++ new/vector-algorithms-0.9.1.0/CHANGELOG.md 2001-09-09 03:46:40.000000000
+0200
@@ -1,3 +1,7 @@
+## Version 0.9.1.0 (2025-02-05)
+
+- More inlining for `sort` and `nib` functions.
+
## Version 0.9.0.3 (2024-11-25)
- Fix an off-by-one error Heap.partialSort functions.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/AmericanFlag.hs
new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/AmericanFlag.hs
--- old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/AmericanFlag.hs
2001-09-09 03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/AmericanFlag.hs
2001-09-09 03:46:40.000000000 +0200
@@ -244,7 +244,7 @@
sort v = sortBy compare terminate (size p) index v
where p :: Proxy e
p = Proxy
-{-# INLINABLE sort #-}
+{-# INLINE sort #-}
-- | A variant on `sort` that returns a vector of unique elements.
sortUniq :: forall e m v. (PrimMonad m, MVector v e, Lexicographic e, Ord e)
@@ -252,7 +252,7 @@
sortUniq v = sortUniqBy compare terminate (size p) index v
where p :: Proxy e
p = Proxy
-{-# INLINABLE sortUniq #-}
+{-# INLINE sortUniq #-}
-- | A fully parameterized version of the sorting algorithm. Again, this
-- function takes both radix information and a comparison, because the
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Heap.hs
new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Heap.hs
--- old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Heap.hs
2001-09-09 03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Heap.hs
2001-09-09 03:46:40.000000000 +0200
@@ -56,12 +56,12 @@
-- | Sorts an entire array using the default ordering.
sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()
sort = sortBy compare
-{-# INLINABLE sort #-}
+{-# INLINE sort #-}
-- | A variant on `sort` that returns a vector of unique elements.
sortUniq :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m (v
(PrimState m) e)
sortUniq = sortUniqBy compare
-{-# INLINABLE sortUniq #-}
+{-# INLINE sortUniq #-}
-- | Sorts an entire array using a custom ordering.
sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m
()
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Insertion.hs
new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Insertion.hs
--- old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Insertion.hs
2001-09-09 03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Insertion.hs
2001-09-09 03:46:40.000000000 +0200
@@ -36,12 +36,12 @@
-- | Sorts an entire array using the default comparison for the type
sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()
sort = sortBy compare
-{-# INLINABLE sort #-}
+{-# INLINE sort #-}
-- | A variant on `sort` that returns a vector of unique elements.
sortUniq :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m (v
(PrimState m) e)
sortUniq = sortUniqBy compare
-{-# INLINABLE sortUniq #-}
+{-# INLINE sortUniq #-}
-- | Sorts an entire array using a given comparison
sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m
()
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Intro.hs
new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Intro.hs
--- old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Intro.hs
2001-09-09 03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Intro.hs
2001-09-09 03:46:40.000000000 +0200
@@ -67,12 +67,12 @@
-- | Sorts an entire array using the default ordering.
sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()
sort = sortBy compare
-{-# INLINABLE sort #-}
+{-# INLINE sort #-}
-- | A variant on `sort` that returns a vector of unique elements.
sortUniq :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m (v
(PrimState m) e)
sortUniq = sortUniqBy compare
-{-# INLINABLE sortUniq #-}
+{-# INLINE sortUniq #-}
-- | A variant on `sortBy` which returns a vector of unique elements.
sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m
()
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Merge.hs
new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Merge.hs
--- old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Merge.hs
2001-09-09 03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Merge.hs
2001-09-09 03:46:40.000000000 +0200
@@ -37,12 +37,12 @@
-- | Sorts an array using the default comparison.
sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()
sort = sortBy compare
-{-# INLINABLE sort #-}
+{-# INLINE sort #-}
-- | A variant on `sort` that returns a vector of unique elements.
sortUniq :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m (v
(PrimState m) e)
sortUniq = sortUniqBy compare
-{-# INLINABLE sortUniq #-}
+{-# INLINE sortUniq #-}
-- | Sorts an array using a custom comparison.
sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m
()
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Radix.hs
new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Radix.hs
--- old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Radix.hs
2001-09-09 03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Radix.hs
2001-09-09 03:46:40.000000000 +0200
@@ -186,7 +186,7 @@
where
e :: e
e = undefined
-{-# INLINABLE sort #-}
+{-# INLINE sort #-}
-- | Radix sorts an array using custom radix information
-- requires the number of passes to fully sort the array,
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Tim.hs
new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Tim.hs
--- old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms/Tim.hs
2001-09-09 03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms/Tim.hs
2001-09-09 03:46:40.000000000 +0200
@@ -113,12 +113,12 @@
-- | Sorts an array using the default comparison.
sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()
sort = sortBy compare
-{-# INLINABLE sort #-}
+{-# INLINE sort #-}
-- | A variant on `sort` that returns a vector of unique elements.
sortUniq :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m (v
(PrimState m) e)
sortUniq = sortUniqBy compare
-{-# INLINABLE sortUniq #-}
+{-# INLINE sortUniq #-}
-- | Sorts an array using a custom comparison.
sortBy :: (PrimMonad m, MVector v e)
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore'
old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms.hs
new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms.hs
--- old/vector-algorithms-0.9.0.3/src/Data/Vector/Algorithms.hs 2001-09-09
03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/src/Data/Vector/Algorithms.hs 2001-09-09
03:46:40.000000000 +0200
@@ -18,6 +18,7 @@
-- | The `nub` function which removes duplicate elements from a vector.
nub :: forall v e . (V.Vector v e, Ord e) => v e -> v e
nub = nubBy compare
+{-# INLINE nub #-}
-- | A version of `nub` with a custom comparison predicate.
--
@@ -31,6 +32,7 @@
destMV <- nubByMut sortUniqBy cmp mv
v <- V.unsafeFreeze destMV
pure (V.force v)
+{-# INLINE nubBy #-}
-- | The `nubByMut` function takes in an in-place sort algorithm
-- and uses it to do a de-deduplicated sort. It then uses this to
@@ -72,3 +74,4 @@
go (srcInd + 1) (destInd + 1)
go 0 0
pure dest
+{-# INLINABLE nubByMut #-}
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/vector-algorithms-0.9.0.3/vector-algorithms.cabal
new/vector-algorithms-0.9.1.0/vector-algorithms.cabal
--- old/vector-algorithms-0.9.0.3/vector-algorithms.cabal 2001-09-09
03:46:40.000000000 +0200
+++ new/vector-algorithms-0.9.1.0/vector-algorithms.cabal 2001-09-09
03:46:40.000000000 +0200
@@ -1,6 +1,6 @@
cabal-version: >= 1.10
name: vector-algorithms
-version: 0.9.0.3
+version: 0.9.1.0
license: BSD3
license-file: LICENSE
author: Dan Doel
@@ -30,7 +30,6 @@
GHC == 8.6.5
GHC == 8.4.4
GHC == 8.2.2
- GHC == 8.0.2
flag BoundsChecks
description: Enable bounds checking
@@ -51,10 +50,6 @@
performance
default: True
-flag properties
- description: Enable the quickcheck tests
- default: True
-
-- flag dump-simpl
-- description: Dumps the simplified core during compilation
-- default: False
@@ -154,16 +149,13 @@
Properties
Util
- if !flag(properties)
- buildable: False
- else
- build-depends:
- base >= 4.9,
- bytestring,
- containers,
- QuickCheck > 2.9 && < 2.16,
- vector,
- vector-algorithms
+ build-depends:
+ base >= 4.9,
+ bytestring,
+ containers,
+ QuickCheck > 2.9 && < 2.16,
+ vector,
+ vector-algorithms
if flag(llvm)
ghc-options: -fllvm
