Hello community, here is the log from the commit of package ghc-data-reify for openSUSE:Factory checked in at 2017-09-15 21:03:51 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/ghc-data-reify (Old) and /work/SRC/openSUSE:Factory/.ghc-data-reify.new (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "ghc-data-reify" Fri Sep 15 21:03:51 2017 rev:2 rq:523872 version:0.6.1 Changes: -------- --- /work/SRC/openSUSE:Factory/ghc-data-reify/ghc-data-reify.changes 2017-03-24 01:54:23.327608257 +0100 +++ /work/SRC/openSUSE:Factory/.ghc-data-reify.new/ghc-data-reify.changes 2017-09-15 21:03:55.145923835 +0200 @@ -1,0 +2,5 @@ +Thu Aug 3 15:38:38 UTC 2017 - [email protected] + +- Updated with latest spec-cleaner version 0.9.8-8-geadfbbf. + +------------------------------------------------------------------- Old: ---- 1.cabal New: ---- data-reify.cabal ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ ghc-data-reify.spec ++++++ --- /var/tmp/diff_new_pack.C5paUD/_old 2017-09-15 21:03:56.125786282 +0200 +++ /var/tmp/diff_new_pack.C5paUD/_new 2017-09-15 21:03:56.129785721 +0200 @@ -1,7 +1,7 @@ # # spec file for package ghc-data-reify # -# 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 @@ -22,16 +22,13 @@ Release: 0 Summary: Reify a recursive data structure into an explicit graph License: BSD-3-Clause -Group: System/Libraries -Url: https://hackage.haskell.org/package/%{pkg_name} +Group: Development/Libraries/Haskell +URL: https://hackage.haskell.org/package/%{pkg_name} Source0: https://hackage.haskell.org/package/%{pkg_name}-%{version}/%{pkg_name}-%{version}.tar.gz -Source1: https://hackage.haskell.org/package/%{pkg_name}-%{version}/revision/1.cabal +Source1: https://hackage.haskell.org/package/%{pkg_name}-%{version}/revision/1.cabal#/%{pkg_name}.cabal BuildRequires: ghc-Cabal-devel -# Begin cabal-rpm deps: BuildRequires: ghc-containers-devel BuildRequires: ghc-rpm-macros -BuildRoot: %{_tmppath}/%{name}-%{version}-build -# End cabal-rpm deps %description 'data-reify' provided the ability to turn recursive structures into explicit @@ -59,7 +56,7 @@ %package devel Summary: Haskell %{pkg_name} library development files -Group: Development/Libraries/Other +Group: Development/Libraries/Haskell Requires: %{name} = %{version}-%{release} Requires: ghc-compiler = %{ghc_version} Requires(post): ghc-compiler = %{ghc_version} @@ -72,15 +69,12 @@ %setup -q -n %{pkg_name}-%{version} cp -p %{SOURCE1} %{pkg_name}.cabal - %build %ghc_lib_build - %install %ghc_lib_install - %post devel %ghc_pkg_recache @@ -88,11 +82,9 @@ %ghc_pkg_recache %files -f %{name}.files -%defattr(-,root,root,-) %doc LICENSE %files devel -f %{name}-devel.files -%defattr(-,root,root,-) %doc CHANGELOG.md README.md %changelog ++++++ data-reify.cabal ++++++ Name: data-reify Version: 0.6.1 x-revision: 1 Synopsis: Reify a recursive data structure into an explicit graph. Description: 'data-reify' provided the ability to turn recursive structures into explicit graphs. Many (implicitly or explicitly) recursive data structure can be given this ability, via a type class instance. This gives an alternative to using 'Ref' for observable sharing. . Observable sharing in general is unsafe, so we use the IO monad to bound this effect, but can be used safely even with 'unsafePerformIO' if some simple conditions are met. Typically this package will be used to tie the knot with DSL's that depend of observable sharing, like Lava. . Providing an instance for 'MuRef' is the mechanism for allowing a structure to be reified into a graph, and several examples of this are provided. . History: Version 0.1 used unsafe pointer compares. Version 0.2 of 'data-reify' used 'StableName's, and was much faster. Version 0.3 provided two versions of 'MuRef', the mono-typed version, for trees of a single type, and the dynamic-typed version, for trees of different types. Version 0.4 used 'Int' as a synonym for 'Unique' rather than 'Data.Unique' for node ids, by popular demand. Version 0.5 merged the mono-typed and dynamic version again, by using 'DynStableName', an unphantomized version of StableName. . © 2009 Andy Gill; BSD3 license. Category: Language, Data, Parsing, Reflection License: BSD3 License-file: LICENSE Author: Andy Gill Maintainer: Andy Gill <[email protected]> Copyright: (c) 2009 Andy Gill Homepage: http://ku-fpg.github.io/software/data-reify/ Stability: alpha build-type: Simple Cabal-Version: >= 1.8 extra-source-files: CHANGELOG.md, README.md source-repository head type: git location: https://github.com/ku-fpg/data-reify Flag tests Description: Enable full development tree Default: False Library Build-Depends: base >= 4 && < 5, containers Exposed-modules: Data.Reify, Data.Reify.Graph Ghc-Options: -Wall Executable data-reify-test1 Build-Depends: base, data-reify Main-Is: Test1.hs Hs-Source-Dirs: test ghc-options: -Wall if !flag(tests) buildable: False Executable data-reify-test2 Build-Depends: base, data-reify Main-Is: Test2.hs Hs-Source-Dirs: test ghc-options: -Wall if !flag(tests) buildable: False Executable data-reify-test3 Build-Depends: base, data-reify Main-Is: Test3.hs Hs-Source-Dirs: test ghc-options: -Wall if !flag(tests) buildable: False Executable data-reify-test4 Build-Depends: base, data-reify Main-Is: Test4.hs Hs-Source-Dirs: test ghc-options: -Wall if !flag(tests) buildable: False Executable data-reify-test5 Build-Depends: base, data-reify Main-Is: Test5.hs Hs-Source-Dirs: test ghc-options: -Wall if !flag(tests) buildable: False Executable data-reify-test6 Build-Depends: base, data-reify Main-Is: Test6.hs Hs-Source-Dirs: test ghc-options: -Wall if !flag(tests) buildable: False Executable data-reify-test7 Build-Depends: base, data-reify Main-Is: Test7.hs Hs-Source-Dirs: test ghc-options: -Wall if !flag(tests) buildable: False
