k3ylabs/cosoco-image-dataset huggingface dataset:
Package: libmath-base-convert-perl (0.11-2)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Base-Convert
Depends: perl
Description:  module for very fast base to base conversion Math::Base::Convert provides fast functions and methods to convert between arbitrary number bases from 2 (binary) thru 65535. . This module is pure Perl, has no external dependencies, and is backward compatible with old versions of Perl 5.
Package: libmath-base36-perl (0.14-1.1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Base36
Depends: perl:any
Description:  Perl module for encoding and decoding of base36 strings Math::Base36 converts to and from Base36 numbers (0..9 - A..Z).
Package: libmath-base85-perl (0.5+dfsg-1)
Section: perl
Homepage: https://metacpan.org/release/Math-Base85
Depends: perl:any
Description:  Perl extension for base 85 numbers, as referenced by RFC 1924 RFC 1924 describes a compact, fixed-size representation of IPv6 addresses which uses a base 85 number system. Math::Base85 handles some of the uglier details of it. . The base 85 numbers (from 0 to 84) are as follows: . 0..9 A..Z a..z ! # $ % & ( ) * + - ; < = > ? @ ^ _ ` { | } ~ . At the moment, there's not much in this module. But it should be sufficient for the purposes of RFC 1924. . This module has a variable called $Math::Base85::base85_digits, which is a string containing the digits of the base 85 alphabet from lowest (0) to highest (~), in that order.
Package: libmath-basecalc-perl (1.019-1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-BaseCalc
Depends: perl
Description:  module for numeric base conversion Math::BaseCalc is a Perl module for converting numeric values between various bases. It provides several predefined digit sets (Hexadecimal, Base64, etc.) and allows custom digit sets to be defined for base conversion.
Package: libmath-basecnv-perl (1.14-1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-BaseCnv
Depends: perl
Description:  set of fast functions to convert between number bases Math::BaseCnv provides a few simple functions for converting between arbitrary number bases. It is as fast as the author currently knows how to make it (of course relying only on the lovely Perl).
Package: libmath-bezier-perl (0.01-2.1)
Section: universe/perl
Homepage: http://search.cpan.org/dist/Math-Bezier/
Depends: perl:any
Description:  Perl module for the solution of Bezier Curves Math::Bezier implements the algorithm for the solution of Bezier curves as presented by Robert D. Miller in Graphics Gems V, "Quick and Simple Bezier Curve Drawing". . A new Bezier curve is created using the new() constructor, passing a list of (x, y) control points. .  use Math::Bezier;  my @control = ( 0, 0, 10, 20, 30, -20, 40, 0 );  my $bezier = Math::Bezier->new(@control); . Alternately, a reference to a list of control points may be passed.
Package: libmath-bigint-gmp-perl (1.6010-1build1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-BigInt-GMP
Depends: perl, perlapi-5.34.0, libc6 (>= 2.34), libgmp10 (>= 2:6.2.1+dfsg), libmath-bigint-perl (>= 1.999819)
Description:  module for arbitrary precision arithmetic using GMP Math::BigInt::GMP is a Perl module that uses direct bindings to the GNU Multiple Precision Arithmetic Library (also known as GMP) to provide a high-performance drop-in replacement for Math::BigInt.
Package: libmath-bigint-perl (1.999829-1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-BigInt
Depends: perl:any, libscalar-list-utils-perl
Description:  arbitrary size integer/float math package Math::BigInt and Math::BigFloat allow one to declare big integers / floating point numbers as .  $i = new Math::BigInt '123_456_789_123_456_789';  $i = new Math::BigFloat '12_3.456_789_123_456_789E-2'; . All operators are overloaded; operations with overloaded operators preserve the arguments. . Math::BigInt is also in perl core, this package provides newer versions separately.
Package: libmath-calc-units-perl (1.07-2.1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Calc-Units
Depends: perl:any
Description:  Human-readable unit-aware calculator Math::Calc::Units is a simple calculator that keeps track of units. It only handles combinations of byte sizes and duration only, though adding any other multiplicative types is easy. Any unknown type is treated as a unique user type (with some effort to map English plurals to their singular forms). . The included 'ucalc' program prints out all of the "readable" variants of a value. For example, "3 bytes" will only produce "3 byte", but "3 byte/sec" produces the original along with "180 byte/minute", etc.
Package: libmath-calculus-differentiate-perl (0.3-2.1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Calculus-Differentiate
Depends: perl:any, libmath-calculus-expression-perl
Description:  Algebraic Differentiation Engine Math::Calculus::Differentiate can take an algebraic expression, parse it into a tree structure, modify the tree to give a representation of the differentiated function, simplify the tree and turn the tree back into an output of the same form as the input. . It supports differentiation of expressions including the +, -, *, / and ^ (raise to power) operators, bracketed expressions to enable correct precedence and the functions ln, exp, sin, cos, tan, sec, cosec, cot, sinh, cosh, tanh, sech, cosech, coth, asin, acos, atan, asinh, acosh and atanh.
Package: libmath-calculus-expression-perl (0.2.2.ds-2.1)
Section: universe/perl
Homepage: http://search.cpan.org/dist/Math-Calculus-Expression/
Depends: perl:any
Description:  Algebraic Calculus Tools Expression Class Math::Calculus::Expression can take an algebraic expression, parse it into a tree structure, simplify the tree, substitute variables and named constants for other variables or constants (which may be numeric), numerically evaluate the tree and turn the tree back into an output of the same form as the input. . It supports a wide range of expressions including the +, -, *, / and ^ (raise to power) operators, bracketed expressions to enable correct precedence and the functions ln, exp, sin, cos, tan, sec, cosec, cot, sinh, cosh, tanh, sech, cosech, coth, asin, acos, atan, asinh, acosh and atanh.
Package: libmath-calculus-newtonraphson-perl (0.1-2.1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Calculus-NewtonRaphson
Depends: perl:any, libmath-calculus-expression-perl, libmath-calculus-differentiate-perl
Description:  Algebraic Newton Raphson Implementation The Math::Calculus::NewtonRaphson module takes an algebraic expression, parses it and then uses the Newton Raphson method to solve it. The Newton Raphson method relies on the fact that the expression you pass in evaluates to zero where there is a solution. That is, to solve:- . x^2 = 5 . You would need to pass in:- . x^2 - 5 . It understands expressions containing any of the operators +, -, *, / and ^ (raise to power), bracketed expressions to enable correct precedence and the functions ln, exp, sin, cos, tan, sec, cosec, cot, sinh, cosh, tanh, sech, cosech, coth, asin, acos, atan, asinh, acosh and atanh.
Package: libmath-cartesian-product-perl (1.009-1.1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Cartesian-Product
Depends: perl:any
Description:  generate the Cartesian product of zero or more lists Math::Cartesian::Product generates the Cartesian product of zero or more lists. . Given two lists, say: [a,b] and [1,2,3], the Cartesian product is the set of all ordered pairs: . (a,1), (a,2), (a,3), (b,1), (b,2), (b,3) . which select their first element from all the possibilities listed in the first list, and select their second element from all the possibilities in the second list. . The idea can be generalized to n-tuples selected from n lists where all the elements of the first list are combined with all the elements of the second list, the results of which are then combined with all the member of the third list and so on over all the input lists.
Package: libmath-cephes-perl (0.5305-5build1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Cephes
Depends: perl, perlapi-5.34.0, libc6 (>= 2.34)
Description:  perl interface to the math cephes library Math::Cephes provides an interface to over 150 mathematical functions of the cephes math library of Stephen Moshier, including trigonometric, hyperbolic, exponential, logarithmic, Bessel, Gamma, Beta, elliptic integrals, hypergeometric, distribution functions, etc. . Some common constants, such as PI and SQRT2, are also available.  As well, there is support for arithmetic operations for fractions (adding, subtracting, dividing, multiplying) and also for various functions of complex numbers.
Package: libmath-clipper-perl (1.29-1build4)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Clipper
Depends: perl, perlapi-5.34.0, libc6 (>= 2.34), libgcc-s1 (>= 3.3.1), libstdc++6 (>= 11)
Description:  Perl module for Polygon clipping in 2D Math::Clipper is a C++ (and Delphi) library that implements polygon clipping. A Polygon is represented by a reference to an array of 2D points. A Point is, in turn, represented by a reference to an array containing two numbers: The X and Y coordinates. . Clipper 4.x works with polygons with integer coordinates. Data in floating point format will need to be scaled appropriately to be converted to the available integer range before polygons are added to a clipper object. (Scaling utilities are provided.)
Package: libmath-combinatorics-clojure (0.1.4-1.1)
Section: universe/java
Depends: libclojure-java
Description:  generate lazy sequences for common combinatorial functions in Clojure math.combinatorics is a collection of efficient functional algorithms for generating lazy sequences for common combinatorial functions, like partitions, selections, cartesian products, etc. It is implemented in pure Clojure.
Package: libmath-combinatorics-perl (0.09-5.1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Combinatorics
Depends: perl:any
Description:  module for performing combinations and permutations on lists 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: . http://mathworld.wolfram.com/Combinatorics.html . Math::Combinatorics provides a pure-perl implementation of nCk, nPk, and n! (combination, permutation, and factorial, respectively).
Package: libmath-convexhull-monotonechain-perl (0.1-1build9)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-ConvexHull-MonotoneChain/
Depends: perl, perlapi-5.34.0, libc6 (>= 2.2.5)
Description:  Perl module to calculate a convex hull using Andrew's monotone chain algorithm Math::ConvexHull::MonotoneChain optionally exports a single function convex_hull which calculates the convex hull of the input points and returns it. Andrew's monotone chain convex hull algorithm constructs the convex hull of a set of 2-dimensional points in O(n*log(n)) time. . It does so by first sorting the points lexicographically (first by x-coordinate, and in case of a tie, by y-coordinate), and then constructing upper and lower hulls of the points in O(n) time. It should be somewhat faster than a plain Graham's scan (also O(n*log(n))) in practice since it avoids polar coordinates.
Package: libmath-convexhull-perl (1.4-1.1)
Section: universe/perl
Homepage: http://search.cpan.org/dist/Math-ConvexHull/
Depends: perl:any
Description:  Perl module to calculate convex hulls using Graham's scan (n*log(n)) Math::ConvexHull is a simple module that calculates convex hulls from a set of points in 2D space. It is a straightforward implementation of the algorithm known as Graham's scan which, with complexity of O(n*log(n)), is the fastest known method of finding the convex hull of an arbitrary set of points. There are some methods of eliminating points that cannot be part of the convex hull. These may or may not be implemented in a future version. . The implementation cannot deal with duplicate points. Therefore, points which are very, very close (think floating point close) to the previous point are dropped since version 1.02 of the module. However, if you pass in randomly ordered data which contains duplicate points, this safety measure might not help you. In that case, you will have to remove duplicates yourself.
Package: libmath-derivative-perl (1.01-1.1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Derivative
Depends: perl:any
Description:  Perl package for numeric 1st and 2nd order differentiation Math::Derivative exports functions for performing numerical first and second order differentiation on data. The functions take references to two arrays containing the x and y ordinates of the data and return an array of the 1st or 2nd derivative at the given x ordinates. The 2nd derivative may optionally be given values to use for the first derivative at the start and end points of the data - otherwise 'natural' values are used.
Package: libmath-fibonacci-perl (1.5-5.1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Fibonacci
Depends: perl:any
Description:  Fibonacci numbers calculations Perl module Math::Fibonacci provides a few functions related to Fibonacci numbers, such as getting the n term of a Fibonacci sequence, compute and return the first n Fibonacci numbers, decompose an integer into the sum of Fibonacci numbers, etc.
Package: libmath-geometry-voronoi-perl (1.3-3build4)
Section: universe/perl
Homepage: http://search.cpan.org/dist/Math-Geometry-Voronoi/
Depends: perl, perlapi-5.34.0, libc6 (>= 2.34), libclass-accessor-perl, libparams-validate-perl
Description:  Perl module to compute Voronoi diagrams from sets of points Math::Geometry::Voronoi computes Voronoi diagrams from a set of input points. This module is a wrapper around a C implementation by Steve Fortune, the inventor of the algorithm used (Fortune's algorithm), that was further modified by Derek Bradley. . Info on Voronoi diagrams can be found here: .     http://en.wikipedia.org/wiki/Voronoi_diagram
Package: libmath-gmp-perl (2.24-1build1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-GMP
Depends: perl, perlapi-5.34.0, libc6 (>= 2.34), libgmp10 (>= 2:6.2.1+dfsg)
Description:  high speed arbitrary size integer math for perl Math::GMP was designed to be a drop-in replacement both for Math::BigInt and for regular integer arithmetic.  Unlike BigInt, though, Math::GMP uses the GNU gmp library for all of its calculations, as opposed to straight Perl functions.  This can result in speed improvements. . The downside is that this module is not 100% compatible to Math::BigInt.
Package: libmath-gradient-perl (0.04-2)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Gradient
Depends: perl
Description:  module for calculating smooth numerical transitions Math::Gradient is a Perl module that is useful for calculating numbers needed to make smooth transitions between two or more numerical values (graphically represented as gradients). The primary intent of this module is to make it easy to mix colours, both in terms of basic and multiple-point gradients.
Package: libmath-int128-perl (0.22-2build3)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Int128
Depends: perl, perlapi-5.34.0, libc6 (>= 2.34), libmath-int64-perl (>= 0.51)
Description:  Perl module to manipulate 128 bits integers Math::Int128 adds support for 128 bit integers, signed and unsigned, to Perl. . The API is comparable to Math::Int64, just s/64/128/g ;-) . Besides that, as object allocation and destruction has been found to be a bottleneck, an alternative set of operations that use their first argument as the output (instead of the return value) is also provided.
Package: libmath-int64-perl (0.54-1build6)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Int64
Depends: perl, perlapi-5.34.0, libc6 (>= 2.14)
Description:  module to manipulate 64 bits integers in Perl Math::Int64 adds support for 64 bit integers, signed and unsigned, to Perl.
Package: libmath-libm-perl (1.0-1build9)
Section: universe/perl
Homepage: http://search.cpan.org/dist/Math-Libm/
Depends: perl, perlapi-5.34.0, libc6 (>= 2.35)
Description:  Perl extension for the C math library, libm Math::Libm is a translation of the C math.h file. It exports a number of mathematical constants, like pi and e, and functions such as floor(), log10() or tan().
Package: libmath-matrixreal-perl (2.13-2)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-MatrixReal
Depends: perl:any
Description:  module to manipulate NxN matrices of real numbers Math::MatrixReal implements the data type "matrix of reals" (and consequently also "vector of reals") which can be used almost like any other basic Perl type thanks to operator overloading. . It features many important operations and methods: matrix norm, matrix transposition, matrix inverse, determinant of a matrix, order and numerical condition of a matrix, scalar product of vectors, vector product of vectors, vector length, projection of row and column vectors, a comfortable way for reading in a matrix from a file, the keyboard or your code, and many more. . It allows one to solve linear equation systems using an efficient algorithm known as "L-R-decomposition" and several approximative (iterative) methods. . It features an implementation of Kleene's algorithm to compute the minimal costs for all paths in a graph with weighted edges (the "weights" being the costs associated with each edge). . Finally, it allows one to solve the eigensystem of a real symmetric matrix, using Householder transformation and QL decomposition.
Package: libmath-mpfr-perl (4.19-1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-MPFR
Depends: perl, perlapi-5.34.0, libc6 (>= 2.34), libgmp10 (>= 2:6.2.1+dfsg), libmpfr6 (>= 4.1)
Description:  perl interface to the MPFR (floating point) library Math::MPFR is a bigfloat module utilising the MPFR library. Basically this module simply wraps the 'mpfr' floating point functions provided by that library. Operator overloading is also available.
Package: libmath-nocarry-perl (1.113-1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-NoCarry
Depends: perl:any
Description:  Perl module for no carry arithmetic The perl module Math::NoCarry implememnts no carry arithmetic which doesn't allow you to carry digits to the next column.  For example, if you add 8 and 4, you normally expect the answer to be 12, but that 1 digit is a carry.  In no carry arithmetic you can't do that, so the sum of 8 and 4 is just 2.  In effect, this is addition modulo 10 in each column. The following example discards all of the carry digits: .  1234  + 5678  ------  6802 . For multiplication, the result of pair-wise multiplication of digits is the modulo 10 value of their normal, everyday multiplication.
Package: libmath-numbercruncher-perl (5.00-10)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-NumberCruncher
Depends: perl
Description:  Perl5 module with commonly needed Maths and Stats functions This module is a collection of commonly needed number-related functions, including numerous standard statistical, geometric, and probability functions. Some of these functions are taken directly from _Mastering Algorithms with Perl_, by Jon Orwant, Jarkko Hietaniemi, and John Macdonald, and others are adapted heavily from same.
Package: libmath-numeric-tower-clojure (0.0.4-1.1)
Section: universe/java
Depends: libclojure-java
Description:  math functions for Clojure math.numeric-tower provides math functions that deal intelligently with the various types in Clojure's numeric tower, as well as math functions commonly found in Scheme implementations: .   * (expt x y) - x to the yth power   * (abs n) - absolute value of n   * (gcd m n) - greatest common divisor of m and n   * (lcm m n) - least common multiple of m and n   * (floor x) - round down   * (ceil x) - round up   * (round x) - round to nearest   * (sqrt x) - square root, exact if possible   * (exact-integer-sqrt k) returns floor of square root and the "remainder"
Package: libmath-planepath-perl (129-1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-PlanePath
Depends: perl:any, libconstant-defer-perl, libmath-libm-perl
Description:  Perl module to calculate mathematical paths through a 2-D plane Math::PlanePath is a collection of Perl modules to generate some paths through the 2-D X,Y plane, mainly integer oriented, and including .  * Square numbering of Ulam's spiral  * Pentagonal, hexagonal, heptagonal spirals  * Pyramid and triangular spirals and rows  * An infinite knight's tour  * Vogel's sunflower floret (and variations)  * Sacks' quadratic spiral  * Spiral of Theodorus  * Peano, Hilbert and Z-Order  * Gosper's flowsnake  * Koch curve and quadric curve  * Sierpinski triangle  * Dragon curves  * Pixellated rings, and by hypotenuse distance  * Trees of rationals and Pythagorean triples  * Some complex base related patterns
Package: libmath-polygon-perl (1.10-1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Polygon
Depends: perl
Description:  Perl module for Polygon calculations Math::Polygon provides an OO interface around Math::Polygon::Calc (for simple polygon calculations) andMath::Polygon::Clip (for framing a polygon in a square). There's also a collection of convex algorithms, for polygons with exclusions, and for polygon transformation.
Package: libmath-prime-util-gmp-perl (0.52-1build2)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Prime-Util-GMP
Depends: perl, perlapi-5.34.0, libc6 (>= 2.34), libgmp10 (>= 2:6.2.1+dfsg)
Description:  utilities related to prime numbers, using GMP Math::Prime::Util::GMP contains a set of utilities related to prime numbers, using GMP. This includes primality tests, getting primes in a range, and factoring. . While it certainly can be used directly, the main purpose of this module is for Math::Prime::Util. That module will automatically load this if it is installed, greatly speeding up many of its operations on big numbers. . Inputs and outputs for big numbers are via strings, so you do not need to use a bigint package in your program. However if you do use bigints, inputs will be converted internally so there is no need to convert before a call. Output results are returned as either Perl scalars (for native-size) or strings (for bigints). Math::Prime::Util tries to reconvert all strings back into the callers bigint type if possible, which makes it more convenient for calculations.
Package: libmath-prime-util-perl (0.73-2build1)
Section: universe/perl
Homepage: https://metacpan.org/release/Math-Prime-Util
Depends: perl, perlapi-5.34.0, libc6 (>= 2.29), libmath-prime-util-gmp-perl
Description:  utilities related to prime numbers, including fast sieves and factoring Math::Prime::Util is a set of perl utilities related to prime numbers. These include multiple sieving methods, is_prime, prime_count, nth_prime, approximations and bounds for the prime_count and nth prime, next_prime and prev_prime, factoring utilities, and more. . The default sieving and factoring are intended to be (and currently are) the fastest on CPAN, including Math::Prime::XS, Math::Prime::FastSieve, Math::Factor::XS, Math::Prime::TiedArray, Math::Big::Factors, Math::Factoring, and Math::Primality (when the GMP module is available). For numbers in the 10-20 digit range, it is often orders of magnitude faster. Typically it is faster than Math::Pari for 64-bit operations. . All operations support both Perl UV's (32-bit or 64-bit) and bignums. It requires no external software for big number support, as there are Perl implementations included that solely use Math::BigInt and Math::BigFloat. However, performance will be improved for most big number functions by installing Math::Prime::Util::GMP, and is definitely recommended if you do many bignum operations. Also look into Math::Pari as an alternative.