Hello community, here is the log from the commit of package ghc-EdisonAPI for openSUSE:Factory checked in at 2017-04-11 09:37:06 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/ghc-EdisonAPI (Old) and /work/SRC/openSUSE:Factory/.ghc-EdisonAPI.new (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-EdisonAPI" Tue Apr 11 09:37:06 2017 rev:2 rq:483914 version:1.3.1 Changes: -------- --- /work/SRC/openSUSE:Factory/ghc-EdisonAPI/ghc-EdisonAPI.changes 2017-03-24 01:56:47.283228156 +0100 +++ /work/SRC/openSUSE:Factory/.ghc-EdisonAPI.new/ghc-EdisonAPI.changes 2017-04-11 09:37:08.825023792 +0200 @@ -1,0 +2,5 @@ +Thu Sep 15 07:01:40 UTC 2016 - [email protected] + +- Update to version 1.3.1 revision 0 with cabal2obs. + +------------------------------------------------------------------- Old: ---- EdisonAPI-1.3.tar.gz New: ---- EdisonAPI-1.3.1.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ ghc-EdisonAPI.spec ++++++ --- /var/tmp/diff_new_pack.P6tSGY/_old 2017-04-11 09:37:11.028712493 +0200 +++ /var/tmp/diff_new_pack.P6tSGY/_new 2017-04-11 09:37:11.028712493 +0200 @@ -1,7 +1,7 @@ # # spec file for package ghc-EdisonAPI # -# Copyright (c) 2016 SUSE LINUX GmbH, Nuernberg, Germany. +# Copyright (c) 2017 SUSE LINUX GmbH, Nuernberg, Germany. # # All modifications and additions to the file contributed by third parties # remain the property of their copyright owners, unless otherwise agreed @@ -18,9 +18,9 @@ %global pkg_name EdisonAPI Name: ghc-%{pkg_name} -Version: 1.3 +Version: 1.3.1 Release: 0 -Summary: A library of efficent, purely-functional data structures (API) +Summary: A library of efficient, purely-functional data structures (API) License: MIT Group: Development/Languages/Other Url: https://hackage.haskell.org/package/%{pkg_name} @@ -33,7 +33,7 @@ %description Edison is a library of purely functional data structures written by Chris Okasaki. It is named after Thomas Alva Edison and for the mnemonic value EDiSon -(Efficent Data Structures). Edison provides several families of abstractions, +(Efficient Data Structures). Edison provides several families of abstractions, each with multiple implementations. The main abstractions provided by Edison are: Sequences such as stacks, queues, and dequeues; Collections such as sets, bags and heaps; and Associative Collections such as finite maps and priority ++++++ EdisonAPI-1.3.tar.gz -> EdisonAPI-1.3.1.tar.gz ++++++ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/EdisonAPI-1.3/EdisonAPI.cabal new/EdisonAPI-1.3.1/EdisonAPI.cabal --- old/EdisonAPI-1.3/EdisonAPI.cabal 2015-10-04 20:35:01.000000000 +0200 +++ new/EdisonAPI-1.3.1/EdisonAPI.cabal 2016-06-03 06:49:51.000000000 +0200 @@ -1,19 +1,19 @@ Build-type: Simple Name: EdisonAPI -Cabal-Version: >= 1.22 -Version: 1.3 -License: OtherLicense +Cabal-Version: >= 1.10 +Version: 1.3.1 +License: MIT License-File: COPYRIGHT Author: Chris Okasaki Maintainer: robdockins AT fastmail DOT fm -Synopsis: A library of efficent, purely-functional data structures (API) +Synopsis: A library of efficient, purely-functional data structures (API) Category: Data Structures Homepage: http://rwd.rdockins.name/edison/home/ Stability: Stable Description: Edison is a library of purely functional data structures written by Chris Okasaki. It is named after Thomas Alva Edison and for the - mnemonic value EDiSon (Efficent Data Structures). + mnemonic value EDiSon (Efficient Data Structures). Edison provides several families of abstractions, each with multiple implementations. The main abstractions provided by Edison are: Sequences such as stacks, queues, and dequeues; diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' old/EdisonAPI-1.3/src/Data/Edison.hs new/EdisonAPI-1.3.1/src/Data/Edison.hs --- old/EdisonAPI-1.3/src/Data/Edison.hs 2015-10-04 20:35:01.000000000 +0200 +++ new/EdisonAPI-1.3.1/src/Data/Edison.hs 2016-06-03 06:49:51.000000000 +0200 @@ -143,7 +143,7 @@ -- information. Unless otherwise stated, these are amortized time complexities, assuming -- persistent usage of the datastructure. Much of this data comes from: -- --- Martin Holters. /Efficent Data Structures in a Lazy Functional Language/. Master's Thesis. +-- Martin Holters. /Efficient Data Structures in a Lazy Functional Language/. Master's Thesis. -- Chalmers University of Technology, Sweden. 2003. -- -- /Notes on unsafe functions:/
