update to 0.2.3.4

This commit is contained in:
Jens Petersen 2020-06-10 11:52:51 +08:00
parent 3d4938a403
commit 2f73805515
4 changed files with 7 additions and 63 deletions

1
.gitignore vendored
View File

@ -11,3 +11,4 @@
/split-0.2.3.1.tar.gz
/split-0.2.3.2.tar.gz
/split-0.2.3.3.tar.gz
/split-0.2.3.4.tar.gz

View File

@ -8,15 +8,14 @@
%bcond_with tests
Name: ghc-%{pkg_name}
Version: 0.2.3.3
Release: 7%{?dist}
Version: 0.2.3.4
Release: 1%{?dist}
Summary: Combinator library for splitting lists
License: BSD
Url: https://hackage.haskell.org/package/%{pkg_name}
# Begin cabal-rpm sources:
Source0: https://hackage.haskell.org/package/%{pkgver}/%{pkgver}.tar.gz
Source1: https://hackage.haskell.org/package/%{pkgver}/%{pkg_name}.cabal#/%{pkgver}.cabal
# End cabal-rpm sources
# Begin cabal-rpm deps:
@ -84,7 +83,6 @@ This package provides the Haskell %{pkg_name} profiling library.
%prep
# Begin cabal-rpm setup:
%setup -q -n %{pkgver}
cp -bp %{SOURCE1} %{pkg_name}.cabal
# End cabal-rpm setup
@ -136,6 +134,9 @@ cp -bp %{SOURCE1} %{pkg_name}.cabal
%changelog
* Wed Jun 10 2020 Jens Petersen <petersen@redhat.com> - 0.2.3.4-1
- update to 0.2.3.4
* Wed Feb 19 2020 Jens Petersen <petersen@redhat.com> - 0.2.3.3-7
- revise .cabal and refresh to cabal-rpm-2.0.2

View File

@ -1 +1 @@
SHA512 (split-0.2.3.3.tar.gz) = 40283ee2f5e2ab56207b05a1a7bc7de114ae0da52dc37ed32bd4e1dd3a3baa8d3346fed04af979fa5fc263b931c0b830832c0cad69e98d151f5550542af6f475
SHA512 (split-0.2.3.4.tar.gz) = a60566106a5f285224b0d555d30b2af3315c707012f5c8e9384d4b8216894e6a6263e838b0e367418c4f8bfb5f4f2cc056ca14acb6b27a5ca3446576b057ca15

View File

@ -1,58 +0,0 @@
Name: split
Version: 0.2.3.3
x-revision: 2
Stability: stable
Description: A collection of various methods for splitting
lists into parts, akin to the \"split\" function
found in several mainstream languages. Here is
its tale:
.
Once upon a time the standard "Data.List" module
held no function for splitting a list into parts
according to a delimiter. Many a brave
lambda-knight strove to add such a function, but
their striving was in vain, for Lo, the Supreme
Council fell to bickering amongst themselves what
was to be the essential nature of the One True
Function which could cleave a list in twain (or
thrain, or any required number of parts).
.
And thus came to pass the split package,
comprising divers functions for splitting a list
asunder, each according to its nature. And the
Supreme Council had no longer any grounds for
argument, for the favored method of each was
contained therein.
.
To get started, see the "Data.List.Split" module.
Synopsis: Combinator library for splitting lists.
License: BSD3
License-file: LICENSE
Copyright: (c) Brent Yorgey, Louis Wasserman 2008-2012
Extra-source-files: README, test/Properties.hs, CHANGES
Author: Brent Yorgey
Maintainer: byorgey@gmail.com
Category: List
Build-type: Simple
Cabal-Version: >= 1.10
Tested-with: GHC ==7.0.4, GHC ==7.2.2, GHC ==7.4.2, GHC ==7.6.3, GHC ==7.8.4, GHC==7.10.3, GHC==8.0.2, GHC ==8.2.2, GHC==8.4.1
Bug-reports: https://github.com/byorgey/split/issues
Test-suite split-tests
type: exitcode-stdio-1.0
main-is: Properties.hs
build-depends: base, QuickCheck >= 2.4, split
default-language: Haskell2010
Hs-source-dirs: test
Source-repository head
type: git
location: http://github.com/byorgey/split.git
Library
ghc-options: -Wall
build-depends: base < 4.14
exposed-modules: Data.List.Split, Data.List.Split.Internals
default-language: Haskell2010
Hs-source-dirs: src