HTTP 200 OK
Allow: GET, HEAD, OPTIONS
Content-Type: application/json
Vary: Accept
{
"count": 51561,
"next": "https://ports.macports.org/api/v1/ports/?format=api&ordering=-updated_at&page=1010",
"previous": "https://ports.macports.org/api/v1/ports/?format=api&ordering=-updated_at&page=1008",
"results": [
{
"name": "tiemu3",
"portdir": "math/tiemu3",
"version": "3.03",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://lpg.ticalc.org/prj_tiemu/",
"description": "Texas Instruments TI89, Titanium, TI-92, TI-92+, Voyager 200 multi-platform emulator",
"long_description": "TiEmu is a full-featured TI89, Titanium, TI-92, TI-92+, Voyager 200 multi-platform emulator with an html manual. It offers: popup menu, screenshots, ASM/C debugger, link port, saving state and some other stuffs.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"pkgconfig",
"groff",
"clang-13"
]
},
{
"type": "lib",
"ports": [
"libglade2",
"libticables2",
"libticalcs2",
"gettext",
"libtifiles2",
"libiconv",
"libticonv",
"libsdl",
"gtk2"
]
}
],
"depends_on": []
},
{
"name": "svdlibc",
"portdir": "math/svdlibc",
"version": "1.4",
"license": "BSD",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://tedlab.mit.edu/~dr/SVDLIBC/",
"description": "SVDLIBC is a C library to perform singular value decomposition",
"long_description": "SVDLIBC is a C library based on the SVDPACKC library. It offers a cleaned-up version of the code with a sane library interface and a front-end executable that performs matrix file type conversions, along with computing singular value decompositions. Currently the only SVDPACKC algorithm implemented in SVDLIBC is las2, because it seems to be consistently the fastest.",
"active": true,
"categories": [
"science",
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "sofia-ml",
"portdir": "math/sofia-ml",
"version": "2011-06-20-r42",
"license": "Apache-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://code.google.com/p/sofia-ml/",
"description": "Suite of Fast Incremental Algorithms for Machine Learning",
"long_description": "The suite of fast incremental algorithms for machine learning (sofia-ml) can be used for training models for classification, regression, ranking, or combined regression and ranking. Several different techniques are available. This release is intended to aid researchers and practitioners who require fast methods for classification and ranking on large, sparse data sets.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal",
"kmeans"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
},
{
"type": "fetch",
"ports": [
"subversion"
]
}
],
"depends_on": []
},
{
"name": "sgd",
"portdir": "math/sgd",
"version": "2.1",
"license": "LGPL-3",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://leon.bottou.org/projects/sgd",
"description": "Stochastic Gradient Descent",
"long_description": "The goal of this package is to illustrate the efficiency of stochastic gradient descent for large-scale learning tasks. Two algorithms, Stochastic Gradient Descent (SGD), and Averaged Stochastic Gradient Descent (ASGD), are applied to two well known problems, Linear Support Vector Machines, and Conditional Random Fields.",
"active": true,
"categories": [
"textproc",
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"zlib"
]
}
],
"depends_on": []
},
{
"name": "scalc",
"portdir": "math/scalc",
"version": "1.15",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.fokus.fraunhofer.de/research/cc/berlios/employees/joerg.schilling/private/",
"description": "tool for simple integer calculations or for converting numbers",
"long_description": "The calc command may be used to do simple integer calculations or to convert numbers from one radix to another.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"smake",
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "reduce",
"portdir": "math/reduce",
"version": "20211019",
"license": "BSD",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://reduce-algebra.sourceforge.io/",
"description": "REDUCE Computer Algebra System",
"long_description": "REDUCE is an interactive system for general algebraic computations of interest to mathematicians, scientists and engineers.",
"active": true,
"categories": [
"lang",
"math"
],
"maintainers": [
{
"name": "mark.brethen",
"github": "mbrethen",
"ports_count": 7
}
],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-14",
"Xft2",
"xorg-libX11",
"xorg-libXcursor",
"xorg-libXext",
"xorg-libXrandr",
"xorg-xorgproto",
"xrender",
"autoconf",
"automake",
"libtool",
"gnuplot"
]
},
{
"type": "lib",
"ports": [
"freetype",
"fontconfig",
"netpbm",
"ncurses",
"libffi"
]
},
{
"type": "run",
"ports": [
"texlive",
"gnuplot"
]
}
],
"depends_on": []
},
{
"name": "qhull",
"portdir": "math/qhull",
"version": "2020.2",
"license": "Permissive",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://www.qhull.org",
"description": "Programs and library for computing convex hulls.",
"long_description": "Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The software runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. Qhull also computes volumes, surface areas, and approximations to the convex hull.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"debug",
"native",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"cmake",
"clang-9.0"
]
}
],
"depends_on": [
{
"type": "build",
"ports": [
"gnudatalanguage"
]
},
{
"type": "lib",
"ports": [
"py36-matplotlib",
"py310-matplotlib",
"py311-matplotlib",
"py312-matplotlib",
"py313-matplotlib",
"py314-matplotlib",
"ipe",
"plplot510",
"plplot510-single",
"solid",
"py39-matplotlib",
"palapeli",
"py35-matplotlib",
"gdal",
"gdal-hdf5",
"gdal-kea",
"gdal-netcdf",
"py38-matplotlib",
"octave",
"plplot",
"plplot-single",
"py27-matplotlib",
"libpcl",
"FreeSOLID",
"py37-matplotlib"
]
}
]
},
{
"name": "primegen",
"portdir": "math/primegen",
"version": "0.97",
"license": "public-domain",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://cr.yp.to/primegen.html",
"description": "Binary and library to generate prime numbers",
"long_description": "primegen is a small, fast library to generate prime numbers in order. Can generate primes up to 1000000000000000, although it is not optimized for primes past 32 bits. It uses the Sieve of Atkin instead of the traditional Sieve of Eratosthenes.",
"active": true,
"categories": [
"math"
],
"maintainers": [
{
"name": "bstj",
"github": "",
"ports_count": 3
}
],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "prc",
"portdir": "math/prc",
"version": "1.5.6",
"license": "GPL-2+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://supfam.mrc-lmb.cam.ac.uk/PRC/",
"description": "program for aligning and scoring two profile hidden Markov models",
"long_description": "PRC is a stand-alone program for aligning and scoring two profile hidden Markov models. This can be used to detect remote relationships between profiles more effectively than by doing simple profile-sequence comparisons. PRC takes into account all transition and emission probabilities in both hidden Markov models. PRC can read SAM, HMMER, PSI-BLAST and FASTA files.",
"active": true,
"categories": [
"science",
"math"
],
"maintainers": [
{
"name": "ryandesign",
"github": "ryandesign",
"ports_count": 2085
}
],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "ploticus",
"portdir": "math/ploticus",
"version": "2.42",
"license": "GPL-2+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://ploticus.sourceforge.net/",
"description": "plot generation program",
"long_description": "A free, GPL, non-interactive software package for producing plots, charts, and graphics from data. It was developed in a Unix/C environment and runs on various Unix, Linux, and win32 systems. ploticus is good for automated or just-in-time graph generation, handles date and time data nicely, and has basic statistical capabilities. It allows significant user control over colors, styles, options and details.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"gd2",
"libjpeg-turbo",
"zlib",
"freetype",
"xorg-libX11",
"libpng"
]
}
],
"depends_on": []
},
{
"name": "plda",
"portdir": "math/plda",
"version": "3.1",
"license": "Apache-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://code.google.com/p/plda/",
"description": "A parallel C++ implementation of fast Gibbs sampling of Latent Dirichlet Allocation",
"long_description": "plda is a parallel C++ implementation of fast Gibbs sampling of Latent Dirichlet Allocation (LDA).",
"active": true,
"categories": [
"textproc",
"math"
],
"maintainers": [],
"variants": [
"clang10",
"clang11",
"clang12",
"clang50",
"clang60",
"clang70",
"clang80",
"clang90",
"clangdevel",
"gcc10",
"gcc11",
"gcc5",
"gcc6",
"gcc7",
"gcc8",
"gcc9",
"gccdevel",
"mpich",
"openmpi",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "picosat",
"portdir": "math/picosat",
"version": "965",
"license": "MIT",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://fmv.jku.at/picosat/",
"description": "picosat is a SAT solver",
"long_description": "picosat is a SAT solver",
"active": true,
"categories": [
"science",
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": [
{
"type": "build",
"ports": [
"boolector"
]
}
]
},
{
"name": "pfft",
"portdir": "math/pfft",
"version": "1.0.8-alpha",
"license": "GPL-3",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://www-user.tu-chemnitz.de/~potts/workgroup/pippig/software.php.en#pfft",
"description": "An extension of FFTW to massively parallel architectures",
"long_description": "PFFT is a parallel FFT software library based on MPI.",
"active": true,
"categories": [
"math"
],
"maintainers": [
{
"name": "dstrubbe",
"github": "dstrubbe",
"ports_count": 38
}
],
"variants": [
"clang10",
"clang11",
"clang90",
"g95",
"gcc10",
"gcc7",
"gcc9",
"gfortran",
"mpich",
"openmpi",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0",
"gcc11"
]
},
{
"type": "lib",
"ports": [
"libgcc",
"fftw-3",
"mpich-clang90"
]
}
],
"depends_on": []
},
{
"name": "pecco",
"portdir": "math/pecco",
"version": "2022-03-18",
"license": "(GPL-2 or LGPL-2.1) and BSD",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.tkl.iis.u-tokyo.ac.jp/~ynaga/pecco/",
"description": "simple C++ library for linear classification with conjunctive features",
"long_description": "pecco is a simple C++ library for linear classification with conjunctive features.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"dartsclone",
"float",
"trie",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"darts-clone",
"clang-14"
]
}
],
"depends_on": []
},
{
"name": "pdc",
"portdir": "math/pdc",
"version": "0.9",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.redfelineninja.dsl.pipex.com/software/all.html#pdc",
"description": "programmers desktop caclulator in bc style",
"long_description": "PDC is a desktop caclulator in the bc style with features designed for programmers. It does not support floating point maths but does provide all the C operators (logical, bitwise, shifts etc.) and implements ISO C operator precedence. Additionally functions are available to perform population counts and byte swaps.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"ncurses",
"readline"
]
}
],
"depends_on": []
},
{
"name": "oll",
"portdir": "math/oll",
"version": "0.03",
"license": "BSD",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://code.google.com/p/oll/",
"description": "a library supporting several for online-learning algorithms.",
"long_description": "OLL is a library supporting several for online-learning algorithms. OLL is specialized for large-scale, but sparse, learning tasks such as Natural Language Processing. While these algorithms are very efficient in terms of speed, and space (linear in the number of examples, and features), its performances are comparable to the batch-style learning methods such as SVMs, MEs.",
"active": true,
"categories": [
"textproc",
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "ocaml-lacaml",
"portdir": "math/ocaml-lacaml",
"version": "7.0.13",
"license": "LGPL-2.1",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://bitbucket.org/mmottl/lacaml/",
"description": "OCaml interfaces to the BLAS- and LAPACK-library",
"long_description": "OCaml interfaces to the BLAS- and LAPACK-library",
"active": true,
"categories": [
"devel",
"math",
"ocaml"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0",
"ocaml-findlib"
]
},
{
"type": "lib",
"ports": [
"ocaml",
"ocaml-findlib"
]
}
],
"depends_on": []
},
{
"name": "ocaml-gsl",
"portdir": "math/ocaml-gsl",
"version": "0.6.0",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://mmottl.github.io/gsl-ocaml/",
"description": "ocamlgsl is the GNU scientific library for OCaml",
"long_description": "This is an interface to GSL (GNU scientific library) for the Objective Caml language. See the gsl port for more details.",
"active": true,
"categories": [
"science",
"math",
"ocaml"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"gawk",
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"ocaml",
"gsl"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"flashdot"
]
}
]
},
{
"name": "ntl",
"portdir": "math/ntl",
"version": "11.5.1",
"license": "LGPL-2.1+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://shoup.net/ntl/",
"description": "NTL: A Library for doing Number Theory",
"long_description": "NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers; for vectors, matrices, and polynomials over the integers and over finite fields; and for arbitrary precision floating point arithmetic.",
"active": true,
"categories": [
"devel",
"math"
],
"maintainers": [
{
"name": "mcalhoun",
"github": "MarcusCalhoun-Lopez",
"ports_count": 1595
}
],
"variants": [
"tuned",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0",
"perl5"
]
},
{
"type": "lib",
"ports": [
"gmp"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"gensync",
"flint",
"singular",
"latte-int"
]
}
]
},
{
"name": "nfft-3",
"portdir": "math/nfft-3",
"version": "3.5.0",
"license": "GPL-2+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.nfft.org/",
"description": "Fast C routines to compute the Non-equispaced Discrete Fourier Transform",
"long_description": "NFFT3 is a software library written in C for computing nonequispaced fast Fourier \n and related transformations. In detail, NFFT3 implements \n 1) The nonequispaced fast Fourier transform (NFFT) \n - the forward transform (NFFT) \n - the adjoint transform (adjoint NFFT) \n 2) Generalisations of the NFFT \n - to arbitrary knots in time and frequency domain (NNFFT) \n - to the sphere S^2 (NFSFT) \n - to the hyperbolic cross (NSFFT) \n - to real-valued data, i.e. (co)sine transforms, (NFCT, NFST) \n - to the rotation group (NFSOFT) \n 3) Generalised inverses based on iterative methods, e.g. CGNR, CGNE \n 4) Applications in \n - medical imaging \n * magnetic resonance imaging \n * computerised tomography \n - summation schemes \n * fast Gauss transform (FGT) \n * singular kernels \n * zonal kernels \n - polar FFT, discrete Radon transform, ridgelet transform",
"active": true,
"categories": [
"math"
],
"maintainers": [
{
"name": "jens",
"github": "",
"ports_count": 1
}
],
"variants": [
"kaiserbessel",
"gaussian",
"bspline",
"sinc",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"fftw-3"
]
}
],
"depends_on": []
},
{
"name": "nestedsums",
"portdir": "math/nestedsums",
"version": "1.4.12",
"license": "unknown",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://wwwthep.physik.uni-mainz.de/~stefanw/nestedsums/",
"description": "nestedsums library",
"long_description": "A Library for the Symbolic Expansion of a Class of Transcendental Functions",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"pkgconfig",
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"GiNaC"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"xloops"
]
}
]
},
{
"name": "ndiff",
"portdir": "math/ndiff",
"version": "2.00",
"license": "GPL-2+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.math.utah.edu/~beebe/software/ndiff/",
"description": "compare putatively similar files",
"long_description": "ndiff assumes that you have two text files containing numerical values, and the two files are expected to be identical, or at least numerically similar. ndiff allows you to specify absolute and/or relative error tolerances for differences between numerical values in the two files, and then reports only the lines with values exceeding those tolerances. It also tells you by how much they differ.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "mpfi",
"portdir": "math/mpfi",
"version": "1.5.4",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://perso.ens-lyon.fr/nathalie.revol/software.html",
"description": "A multiple precision interval arithmetic library based on MPFR",
"long_description": "A multiple precision interval arithmetic library based on MPFR",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-13"
]
},
{
"type": "lib",
"ports": [
"gmp",
"mpfr"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"p5.26-math-mpfi",
"p5.28-math-mpfi",
"p5.32-math-mpfi",
"p5.34-math-mpfi",
"p5.30-math-mpfi",
"sollya"
]
}
]
},
{
"name": "ml",
"portdir": "math/ml",
"version": "6.2",
"license": "LGPL-2.1",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://trilinos.sandia.gov/packages/ml/",
"description": "Multilevel Preconditioning Package",
"long_description": "ML is designed to solve large sparse linear systems of equations arising primarily from elliptic PDE discretizations.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"clang10",
"clang11",
"clang12",
"clang50",
"clang60",
"clang70",
"clang80",
"clang90",
"clangdevel",
"g95",
"gcc10",
"gcc11",
"gcc5",
"gcc6",
"gcc7",
"gcc8",
"gcc9",
"gccdevel",
"gfortran",
"mpich",
"openmpi"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0",
"gcc11"
]
},
{
"type": "lib",
"ports": [
"libgcc"
]
}
],
"depends_on": []
},
{
"name": "mathex",
"portdir": "math/mathex",
"version": "0.3-b",
"license": "LGPL-2.1+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://sscilib.sourceforge.net",
"description": "C++ library to parse/evaluate mathematical expressions",
"long_description": "mathex is a C++ library to parse/evaluate mathematical expressions.",
"active": true,
"categories": [
"math"
],
"maintainers": [
{
"name": "mcalhoun",
"github": "MarcusCalhoun-Lopez",
"ports_count": 1595
}
],
"variants": [
"debug",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"cmake",
"clang-9.0"
]
},
{
"type": "extract",
"ports": [
"unzip"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"gmsh"
]
}
]
},
{
"name": "mapm",
"portdir": "math/mapm",
"version": "4.9.5",
"license": "BSD-old",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.tc.umn.edu/~ringx004/mapm-main.html",
"description": "A Portable Arbitrary Precision Math Library in C.",
"long_description": "MAPM is a set of functions that allow the user to perform math to any level of accuracy that is desired. The precision of a number is only limited by 'INT_MAX' and available memory.",
"active": true,
"categories": [
"science",
"math"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "mallet",
"portdir": "math/mallet",
"version": "2.0.8",
"license": "CPL-1",
"platforms": "any",
"epoch": 0,
"replaced_by": null,
"homepage": "http://mallet.cs.umass.edu/",
"description": "MAchine Learning for LanguagE Toolkit (MALLET)",
"long_description": "MALLET is a Java-based package for statistical natural language processing, document classification, clustering, topic modeling, information extraction, and other machine learning applications to text.",
"active": true,
"categories": [
"java",
"math"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-14"
]
}
],
"depends_on": []
},
{
"name": "libtifiles2",
"portdir": "math/libtifiles2",
"version": "1.1.7",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://lpg.ticalc.org/prj_tilp/",
"description": "TILibs",
"long_description": "Utility libraries for TI related apps",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0",
"autoconf",
"automake",
"libtool",
"pkgconfig"
]
},
{
"type": "lib",
"ports": [
"libarchive",
"zlib",
"gettext",
"glib2",
"libticonv"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"libticables2",
"gfm",
"libticalcs2",
"tiemu3",
"tilp2"
]
}
]
},
{
"name": "libticonv",
"portdir": "math/libticonv",
"version": "1.1.5",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://lpg.ticalc.org/prj_tilp/",
"description": "TILibs",
"long_description": "Utility libraries for TI related apps",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0",
"automake",
"libtool",
"pkgconfig",
"autoconf"
]
},
{
"type": "lib",
"ports": [
"libusb-compat",
"libiconv",
"glib2"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"libticables2",
"gfm",
"libticalcs2",
"libtifiles2",
"tiemu3",
"tilp2"
]
}
]
},
{
"name": "libticalcs2",
"portdir": "math/libticalcs2",
"version": "1.1.9",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://lpg.ticalc.org/prj_tilp",
"description": "TILibs",
"long_description": "Utility libraries for TI related apps",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"autoconf",
"automake",
"libtool",
"pkgconfig",
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"zlib",
"libtifiles2",
"gettext",
"glib2",
"libticables2",
"libticonv"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"gfm",
"tiemu3",
"tilp2"
]
}
]
},
{
"name": "libranlib",
"portdir": "math/libranlib",
"version": "1.0",
"license": "Restrictive/Distributable and Noncommercial",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://netlib.org/random/",
"description": "Library of Routines for Random Number Generation",
"long_description": "This library provides routines that return: Beta random deviates, Chi-square random deviates, Exponential random deviates, F random deviates, Gamma random deviates, Multivariate normal random deviates (mean and covariance matrix specified), Noncentral chi-square random deviates, Noncentral F random deviates, Univariate normal random deviates, Random permutations of an integer array, Real uniform random deviates between specif, Binomial random deviates, Negative Binomial random deviates, Multinomial random deviates, Poisson random deviates, Integer uniform deviates between specified limits and Seeds for the random number generator calculated from a character string.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "lda-d",
"portdir": "math/lda-d",
"version": "0.2",
"license": "unknown",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://chasen.org/~daiti-m/dist/lda/",
"description": "a Latent Dirichlet Allocation package",
"long_description": "lda-d is a Latent Dirichlet Allocation (LDA) package made by Daichi Mochihashi.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "lda-c",
"portdir": "math/lda-c",
"version": "20080413",
"license": "GPL",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.cs.princeton.edu/~blei/lda-c/",
"description": "a C implementation of latent Dirichlet allocation (LDA)",
"long_description": "LDA-C is a C implementation of latent Dirichlet allocation (LDA) made by David M. Blei.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal",
"sample"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "laspack",
"portdir": "math/laspack",
"version": "1.12.2",
"license": "Noncommercial",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.mgnet.org/mgnet/Codes/laspack/html/laspack.html",
"description": "Package for solving large sparse systems of linear equations",
"long_description": "LASPack is a package for solving large sparse systems of linear equations like those which arise from discretization of partial differential equations.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "k3dsurf",
"portdir": "math/k3dsurf",
"version": "0.6.2",
"license": "GPL-2+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://k3dsurf.sourceforge.net/",
"description": "Multidimensional surface visualizer",
"long_description": "K3DSurf is a program to visualize and manipulate multidimensional surfaces by using mathematical equations. It's also a modeler for POV-Ray in the area of parametric surfaces.",
"active": true,
"categories": [
"graphics",
"science",
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"qt3"
]
}
],
"depends_on": []
},
{
"name": "itl",
"portdir": "math/itl",
"version": "4.0.0-1",
"license": "Artistic-1",
"platforms": "any",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.osl.iu.edu/research/itl/",
"description": "Iterative Template Library (based on MTL)",
"long_description": "The Iterative Template Library (ITL) is a generic component library that provides iterative methods for solving linear systems. ITL also provides numerious preconditioners which is for MTL. ITL uses the abstract interface of matrix-vector, vector-vector, and vector-scalor operations MTL is default to serve those operations. ITL is able to use other packages such as Blitz++ and BLAS with the same abstract interface provided.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-14"
]
},
{
"type": "lib",
"ports": [
"blitz",
"mtl"
]
}
],
"depends_on": []
},
{
"name": "hist",
"portdir": "math/hist",
"version": "1.1.1",
"license": "MIT",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://bitbucket.org/kesterlester/hist",
"description": "Histogramming from standard input",
"long_description": "Histogramming from standard input",
"active": true,
"categories": [
"science",
"math"
],
"maintainers": [
{
"name": "jonesc",
"github": "cjones051073",
"ports_count": 232
}
],
"variants": [
"debug",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"cmake",
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"cairo",
"xorg-libX11"
]
}
],
"depends_on": []
},
{
"name": "gtkdatabox",
"portdir": "math/gtkdatabox",
"version": "0.9.1.1",
"license": "unknown",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.eudoxos.net/gtk/gtkdatabox/",
"description": "Data Display Widget",
"long_description": "GtkDataBox is a widget for the GTK+ Library designed to display large amounts of numerical data fast.",
"active": true,
"categories": [
"graphics",
"math",
"gtk"
],
"maintainers": [
{
"name": "james.r.haigh",
"github": "",
"ports_count": 3
}
],
"variants": [
"libglade",
"glade3",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"pkgconfig",
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"gtk2"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"klavaro"
]
}
]
},
{
"name": "gmp-ecm",
"portdir": "math/gmp-ecm",
"version": "6.3",
"license": "GPL-2+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://gforge.inria.fr/projects/ecm/",
"description": "Factor integers using the Elliptic Curve Method",
"long_description": "Free implementation of the Elliptic Curve Method (ECM) for integer factorization.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
},
{
"type": "lib",
"ports": [
"gmp"
]
}
],
"depends_on": []
},
{
"name": "gibbslda",
"portdir": "math/gibbslda",
"version": "0.2",
"license": "GPL-2+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://gibbslda.sourceforge.net/",
"description": "a C/C++ implementation of Latent Dirichlet Allocation (LDA) using Gibbs Sampling",
"long_description": "GibbsLDA++ is a C/C++ implementation of Latent Dirichlet Allocation (LDA) using Gibbs Sampling technique for parameter estimation and inference. It is very fast and is designed to analyze hidden/latent topic structures of large-scale datasets including very large collections of text/Web documents.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "gfm",
"portdir": "math/gfm",
"version": "1.06",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://lpg.ticalc.org/prj_tilp/",
"description": "tool to manipulate Texas Instruments calculator files",
"long_description": "GFM allows to manipulate single/group/tigroup files of all Texas Instruments (TI) calculators",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"pkgconfig",
"clang-9.0",
"groff"
]
},
{
"type": "lib",
"ports": [
"libticables2",
"libticalcs2",
"gettext",
"libtifiles2",
"libiconv",
"libticonv",
"gtk2",
"libglade2"
]
}
],
"depends_on": []
},
{
"name": "gexpr",
"portdir": "math/gexpr",
"version": "2.0.2",
"license": "GPL-2+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://gexpr.sourceforge.net/",
"description": "A shell calculator",
"long_description": "Gexpr is a shell calculator with floating point, standard C functions, relational operators, and output in base 2/8/10/16. It is a light alternative to bc(1). It can also be used to add floating point math to shell scripts.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "gaul-devel",
"portdir": "math/gaul-devel",
"version": "0.1850",
"license": "GPL",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://gaul.sourceforge.net/",
"description": "Genetic algorithms library",
"long_description": "A flexible programming library for evolutionary computation. Steady-state, generational and island model genetic algorithms are supported, using Darwinian, Lamarckian or Baldwinian evolution. Includes support for multiprocessor and distributed systems.",
"active": true,
"categories": [
"math"
],
"maintainers": [
{
"name": "vince",
"github": "Veence",
"ports_count": 25
}
],
"variants": [
"mpi",
"slang",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "feast",
"portdir": "math/feast",
"version": "4.0",
"license": "BSD",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.feast-solver.org",
"description": "A free high-performance numerical library for solving Hermitian and non-Hermitian eigenvalue problems",
"long_description": "The FEAST eigensolver package is a free high-performance numerical library for solving Hermitian and non-Hermitian eigenvalue problems, and obtaining all the eigenvalues and (right/left) eigenvectors within a given search interval or arbitrary domain in the complex plane. Its originality lies with a new transformative numerical approach to the traditional eigenvalue algorithm design - the FEAST algorithm. The algorithm takes its inspiration from the density-matrix representation and contour integration technique in quantum mechanics. It contains elements from complex analysis, numerical linear algebra and approximation theory, and it can be defined as an optimal subspace iteration method using approximate spectral projectors. FEAST's main building block is a numerical quadrature computation consisting of solving independent linear systems along a complex contour, each with multiple right-hand sides. A Rayleigh-Ritz procedure is then used to generate a reduced dense eigenvalue problem orders of magnitude smaller than the original one. The FEAST eigensolver combines simplicity and efficiency and it offers many important capabilities for achieving high performance, robustness, accuracy, and scalability on parallel architectures. NOTE: Without an MPI variant, builds libfeast.a. With MPI, builds libpfeast.a.",
"active": true,
"categories": [
"science"
],
"maintainers": [
{
"name": "dstrubbe",
"github": "dstrubbe",
"ports_count": 38
}
],
"variants": [
"clang10",
"clang11",
"clang90",
"gcc10",
"gcc7",
"gcc9",
"gfortran",
"mpich",
"openmpi"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0",
"gcc11"
]
},
{
"type": "lib",
"ports": [
"libgcc",
"mpich-clang90"
]
},
{
"type": "test",
"ports": [
"vecLibFort",
"libomp"
]
}
],
"depends_on": []
},
{
"name": "espresso",
"portdir": "math/espresso",
"version": "1.0",
"license": "BSD",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://embedded.eecs.berkeley.edu/pubs/downloads/espresso/",
"description": "logic minimization program",
"long_description": "Espresso is a program using heuristic and specific algorithms for efficiently reducing the complexity of digital electronic gate circuits",
"active": true,
"categories": [
"devel",
"science",
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "entropy",
"portdir": "math/entropy",
"version": "2.0",
"license": "Permissive",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.seccuris.com/",
"description": "calculate the entropy of a given file/stream",
"long_description": "Entropy is a program that will calculate the entropy of a given set of data. This program is mainly used to benchmark the efficiency of existing or developing compression algorithms.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "eigen",
"portdir": "math/eigen",
"version": "2.0.17",
"license": "GPL-2+ and LGPL-3+",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://eigen.tuxfamily.org/",
"description": "A C++ template library for linear algebra: vectors, matrices, and related algorithms.",
"long_description": "A C++ template library for linear algebra: vectors, matrices, and related algorithms.",
"active": true,
"categories": [
"science",
"math"
],
"maintainers": [
{
"name": "nicos",
"github": "NicosPavlov",
"ports_count": 16
}
],
"variants": [
"debug",
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"cmake",
"clang-9.0"
]
}
],
"depends_on": [
{
"type": "lib",
"ports": [
"kalzium",
"koffice2-devel",
"step"
]
}
]
},
{
"name": "e",
"portdir": "math/e",
"version": "0.02718",
"license": "GPL-2",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://www.softnet.tuc.gr/~apdim/projects/e/",
"description": "e is a command line expression evaluator.",
"long_description": "e is a command line expression evaluator. It was designed to be as small as possible, and quick to use.",
"active": true,
"categories": [
"math"
],
"maintainers": [
{
"name": "casey",
"github": "",
"ports_count": 2
}
],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "djbfft",
"portdir": "math/djbfft",
"version": "0.76",
"license": "public-domain",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "https://cr.yp.to/djbfft.html",
"description": "D.J. Bernstein's fast fourier transform library",
"long_description": "djbfft is an extremely fast library for floating-point convolution. The current version holds most of the speed records for double-precision FFTs on general purpose computers. djbfft provides power-of-2 complex FFTs, real FFTs at twice the speed, and fast multiplication of complex arrays. Single precision and double precision are equally supported.",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [
"universal"
],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
},
{
"name": "diehard",
"portdir": "math/diehard",
"version": "0.1",
"license": "none",
"platforms": "darwin",
"epoch": 0,
"replaced_by": null,
"homepage": "http://stat.fsu.edu/pub/diehard/",
"description": "Marsaglia's Diehard Battery of Tests of Randomness",
"long_description": "Marsaglia's Diehard Battery of Tests of Randomness",
"active": true,
"categories": [
"math"
],
"maintainers": [],
"variants": [],
"dependencies": [
{
"type": "build",
"ports": [
"clang-9.0"
]
}
],
"depends_on": []
}
]
}