# # spec file for package psqueues # # Copyright (c) 2018 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 psqueues %bcond_with tests Name: %{pkg_name} Version: 0.2.4.0 Release: 0 Summary: Pure priority search queues License: BSD-3-Clause Group: Development/Libraries/Haskell URL: https://hackage.haskell.org/package/%{name} Source0: https://hackage.haskell.org/package/%{name}-%{version}/%{name}-%{version}.tar.gz BuildRequires: ghc-Cabal-devel BuildRequires: ghc-deepseq-devel BuildRequires: ghc-hashable-devel BuildRequires: ghc-rpm-macros %if %{with tests} BuildRequires: ghc-HUnit-devel BuildRequires: ghc-QuickCheck-devel BuildRequires: ghc-array-devel BuildRequires: ghc-tagged-devel BuildRequires: ghc-test-framework-devel BuildRequires: ghc-test-framework-hunit-devel BuildRequires: ghc-test-framework-quickcheck2-devel %endif %description The psqueues package provides in three different flavors. * 'OrdPSQ k p v', which uses the 'Ord k' instance to provide fast insertion, deletion and lookup. This implementation is based on Ralf Hinze's . Hence, it is similar to the library, although it is considerably faster and provides a slightly different API. * 'IntPSQ p v' is a far more efficient implementation. It fixes the key type to 'Int' and uses a (like 'IntMap') with an additional min-heap property. * 'HashPSQ k p v' is a fairly straightforward extension of 'IntPSQ': it simply uses the keys' hashes as indices in the 'IntPSQ'. If there are any hash collisions, it uses an 'OrdPSQ' to resolve those. The performance of this implementation is comparable to that of 'IntPSQ', but it is more widely applicable since the keys are not restricted to 'Int', but rather to any 'Hashable' datatype. Each of the three implementations provides the same API, so they can be used interchangeably. The benchmarks show how they perform relative to one another, and also compared to the other Priority Search Queue implementations on Hackage: and . <> <> Typical applications of Priority Search Queues include: * Caches, and more specifically LRU Caches; * Schedulers; * Pathfinding algorithms, such as Dijkstra's and A*. %package -n ghc-%{name} Summary: Haskell %{name} library Group: System/Libraries %description -n ghc-%{name} This package provides the Haskell %{name} shared library. %package -n ghc-%{name}-devel Summary: Haskell %{name} library development files Group: Development/Libraries/Haskell Requires: ghc-%{name} = %{version}-%{release} Requires: ghc-compiler = %{ghc_version} Requires(post): ghc-compiler = %{ghc_version} Requires(postun): ghc-compiler = %{ghc_version} %description -n ghc-%{name}-devel This package provides the Haskell %{name} library development files. %prep %setup -q %build %ghc_lib_build %install %ghc_lib_install %check %cabal_test %post -n ghc-%{name}-devel %ghc_pkg_recache %postun -n ghc-%{name}-devel %ghc_pkg_recache %files %license LICENSE %doc CHANGELOG %files -n ghc-%{name} -f ghc-%{name}.files %license LICENSE %files -n ghc-%{name}-devel -f ghc-%{name}-devel.files %doc CHANGELOG %changelog