Update of /cvsroot/fink/dists/10.4/stable/main/finkinfo/libs/perlmods
In directory vz-cvs-3.sog:/tmp/cvs-serv16114/stable/main/finkinfo/libs/perlmods

Added Files:
        math-combinatorics-pm.info math-interpolate-pm.info 
Log Message:
migrate math-*-pm to stable

--- NEW FILE: math-interpolate-pm.info ---
Package: math-interpolate-pm
Version: 1.05
Revision: 1
Description: Find element index in a sorted list
License: Artistic
Homepage: http://search.cpan.org/dist/Math-Interpolate/
Maintainer: Blair Zajac <bl...@orcaware.com>

# Unpack Phase.
Source: mirror:cpan:authors/id/B/BZ/BZAJAC/Math-Interpolate-%v.tar.gz
Source-MD5: 1826c6c24b75a2a27964c3dac198adac

# Compile Phase.
Type: perl

# Install Phase.
UpdatePOD: true

# Documentation.
DescDetail: <<
This package contains two Perl modules, Math::IntervalSearch and
Math::Interpolate, where Math::Interpolate uses Math::IntervalSearch.

These modules contains several useful routines for interpolating data
sets and finding where a given value lies in a sorted list.

The first is a subroutine used to locate a position in an array of values
where a given value would fit using bisection.  It has been designed
to be efficient in the common situation that it is called repeatedly.
The user can supply a different set of comparison operators to replace
the standard < and <=.  For example, given a list (1, 2, 5, 8, 15)
and the number 9.5 it would return 3.

The remaining routines all are related to interpolating sets of (x, y)
data pairs.  They all take a list of (x, y) data pairs given another
x value, return a sensible y value using the list of (x, y) data pairs.
Three different interpolating functions are provided.  The first, called a
constant interpolator, assumes that the function being interpolated moves
in non-linear jumps from one value to another.  The interpolated value
for some value x is the y value of the neighboring (x, y) to the left of
the given x.  The second interpolator performs a linear interpolation
between the neighboring points.  The third interpolator is called the
robust interpolator and interpolates a smooth curve between all of
the (x, y) pairs.  To do the interpolation, it first calculates some
reasonable derivatives at the (x, y) pairs.  If you have measured your
own derivative information, you can supply it to the robust interpolator
and it will use it.

--- NEW FILE: math-combinatorics-pm.info ---
Package: math-combinatorics-pm
Version: 0.08
Revision: 1
Description: Combinations and permutations on lists
Type: perl
License: Artistic
Maintainer: Adrian Mugnolo <amugn...@users.sourceforge.net>
Source: mirror:cpan:modules/by-module/Math/Math-Combinatorics-%v.tar.gz
Source-MD5: 2d524c14e4faf483dc06f2f793bfe5fb
PatchScript: <<
  sed -n '109,111{s/^ *//;p;}' README > LICENSE
UpdatePOD: true
DescDetail: <<
  Combinatorics is the branch of mathematics studying the enumeration,
  combination, and permutation of sets of elements and the mathematical
  relations that characterize their properties.  As a jumping off
  point, refer to:


  This module provides a pure-perl implementation of nCk, nPk, and n!
  (combination, permutation, and factorial, respectively).

Write once. Port to many.
Get the SDK and tools to simplify cross-platform app development. Create 
new or port existing apps to sell to consumers worldwide. Explore the 
Intel AppUpSM program developer opportunity. appdeveloper.intel.com/join
Fink-commits mailing list

Reply via email to