File perl-Algorithm-Metric-Chessboard.spec of Package perl-Algorithm-Metric-Chessboard

Overview Repositories Revisions Requests Users Attributes Meta

File perl-Algorithm-Metric-Chessboard.spec of Package perl-Algorithm-Metric-Chessboard

#
# spec file for package perl-Algorithm-Metric-Chessboard
#
# 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-Metric-Chessboard
Version:        0.01
Release:        0
%define cpan_name Algorithm-Metric-Chessboard
Summary:        Calculate distances on a square grid with optional wormholes (the 'chess[cut]
License:        GPL-1.0+ or Artistic-1.0
Group:          Development/Libraries/Perl
Url:            http://search.cpan.org/dist/Algorithm-Metric-Chessboard/
Source0:        http://www.cpan.org/authors/id/K/KA/KAKE/%{cpan_name}-%{version}.tar.gz
BuildArch:      noarch
BuildRoot:      %{_tmppath}/%{name}-%{version}-build
BuildRequires:  perl
BuildRequires:  perl-macros
%{perl_requires}

%description
Calculates the minimum number of moves between two points in a game played
on a square grid, where one move is a jump from a point to a horizontal,
vertical or diagonal neighbour.

With no other features, the number of moves taken to go from the point
'(x1, y1)' to '(x2, y2)' _would_ be quite simple:

d( (x1, y1), (x2, y2) ) = max( abs( x1 - x2 ), abs( y1 - y2) )

However within the space are "wormholes" which allow you to travel between
any two distant points, so the actual number of moves may be smaller than
the above. Wormhole travel costs a fixed number of moves.

%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 README

%changelog

Places

File perl-Algorithm-Metric-Chessboard.spec of Package perl-Algorithm-Metric-Chessboard

Places