Sign Up
Log In
Log In
or
Sign Up
Places
All Projects
Status Monitor
Collapse sidebar
devel:languages:perl:CPAN-A
perl-Algorithm-Nhash
perl-Algorithm-Nhash.spec
Overview
Repositories
Revisions
Requests
Users
Attributes
Meta
File perl-Algorithm-Nhash.spec of Package perl-Algorithm-Nhash
# # spec file for package perl-Algorithm-Nhash # # Copyright (c) 2016 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/ # Name: perl-Algorithm-Nhash Version: 0.002 Release: 0 %define cpan_name Algorithm-Nhash Summary: Exim nhash algorithm License: Artistic-1.0 or GPL-1.0+ Group: Development/Libraries/Perl Url: http://search.cpan.org/dist/Algorithm-Nhash/ Source0: http://www.cpan.org/authors/id/M/MO/MOOLI/%{cpan_name}-%{version}.tar.gz BuildArch: noarch BuildRoot: %{_tmppath}/%{name}-%{version}-build BuildRequires: perl BuildRequires: perl-macros %{perl_requires} %description This is an implementation of the Exim nhash algorithm. It also supports an arbitrary number of divisors and not just the one or two that Exim permits. The nash algorithm is a fast and simple hashing algorithm that attempts to evenly-distribute values but does not attempt to avoid collisions. Thus, it should not be used in place of a cryptographically-secure algorithm such as Digest::SHA. It is mainly intended for hashing filenames into directories to avoid placing too many files into a single directory. If nhash is not given any divisors, then the hash result is returned as-is. If one divisor is given, the hash result is given modulo that divisor. If more than one divisor is given, the hash result is successively divided and the modulo at each stage returned. Since the result is typically a 20-30 bit number, the product of all the divisors shouldn't be more than about 2**20 or the returned values will not be evenly-distributed. %prep %setup -q -n %{cpan_name}-%{version} %build %{__perl} Makefile.PL INSTALLDIRS=vendor %{__make} %{?_smp_mflags} %check %{__make} test %install %perl_make_install %perl_process_packlist %perl_gen_filelist %files -f %{name}.files %defattr(-,root,root,755) %doc Changes LICENSE README %changelog
Locations
Projects
Search
Status Monitor
Help
OpenBuildService.org
Documentation
API Documentation
Code of Conduct
Contact
Support
@OBShq
Terms
openSUSE Build Service is sponsored by
The Open Build Service is an
openSUSE project
.
Sign Up
Log In
Places
Places
All Projects
Status Monitor