File ghc-dual-tree.spec of Package ghc-dual-tree

Overview Repositories Revisions Requests Users Attributes Meta

File ghc-dual-tree.spec of Package ghc-dual-tree

#
# spec file for package ghc-dual-tree
#
# 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
# upon. The license for this file, and modifications and additions to the
# file, is the same license as for the pristine package itself (unless the
# license for the pristine package is not an Open Source License, in which
# case the license is the MIT License). An "Open Source License" is a
# license that conforms to the Open Source Definition (Version 1.9)
# published by the Open Source Initiative.

# Please submit bugfixes or comments via http://bugs.opensuse.org/
#

%global pkg_name dual-tree
%bcond_with tests
Name:           ghc-%{pkg_name}
Version:        0.2.1
Release:        0
Summary:        Rose trees with cached and accumulating monoidal annotations
License:        BSD-3-Clause
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
BuildRequires:  ghc-Cabal-devel
BuildRequires:  ghc-monoid-extras-devel
BuildRequires:  ghc-newtype-generics-devel
BuildRequires:  ghc-rpm-macros
BuildRequires:  ghc-semigroups-devel
%if %{with tests}
BuildRequires:  ghc-QuickCheck-devel
BuildRequires:  ghc-testing-feat-devel
%endif

%description
Rose (n-ary) trees with both upwards- (/i.e./ cached) and downwards-traveling
(/i.e./ accumulating) monoidal annotations. This is used as the core data
structure underlying the 'diagrams' framework
(<http://projects.haskell.org/diagrams>), but potentially has other
applications as well.

Abstractly, a DUALTree is a rose (n-ary) tree with data (of type 'l') at
leaves, data (of type 'a') at internal nodes, and two types of monoidal
annotations, one (of type 'u') travelling "up" the tree and one (of type 'd')
traveling "down".

See "Data.Tree.DUAL" for full documentation. "Data.Tree.DUAL" provides a public
API which should suffice for most purposes. "Data.Tree.DUAL.Internal" exports
more of the internal implementation---use it at your own risk.

%package devel
Summary:        Haskell %{pkg_name} library development files
Group:          Development/Libraries/Haskell
Requires:       %{name} = %{version}-%{release}
Requires:       ghc-compiler = %{ghc_version}
Requires(post): ghc-compiler = %{ghc_version}
Requires(postun): ghc-compiler = %{ghc_version}

%description devel
This package provides the Haskell %{pkg_name} library development files.

%prep
%setup -q -n %{pkg_name}-%{version}

%build
%ghc_lib_build

%install
%ghc_lib_install

%check
%cabal_test

%post devel
%ghc_pkg_recache

%postun devel
%ghc_pkg_recache

%files -f %{name}.files
%doc LICENSE

%files devel -f %{name}-devel.files
%doc CHANGES

%changelog

Places

File ghc-dual-tree.spec of Package ghc-dual-tree

Places