{"count":53704,"next":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-updated_at&page=723","previous":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-updated_at&page=721","results":[{"name":"dbcsr","portdir":"math/dbcsr","version":"2.8.0","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://cp2k.github.io/dbcsr","description":"Distributed Block Compressed Sparse Row matrix library","long_description":"DBCSR is a library designed to efficiently perform sparse matrix-matrix multiplication, among other operations. It is MPI and OpenMP parallel and can exploit Nvidia and AMD GPUs via CUDA and HIP.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","accelerate","atlas","blis","flexiblas","openblas","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","mpich","openmpi","tests","universal"],"dependencies":[{"type":"build","ports":["gcc15","ninja","python311","py311-fypp","clang-20","cmake"]},{"type":"lib","ports":["libomp","OpenBLAS","mpich-gcc15","libgcc"]}],"depends_on":[]},{"name":"dap","portdir":"math/dap","version":"3.10","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.gnu.org/software/dap/dap.html","description":"small statistics and graphics package","long_description":"Dap is a small statistics and graphics package based on C. Version 3.0 of Dap can read SBS programs! The user wishing to perform basic statistical analyses is now freed from learning and using C syntax for straightforward tasks, while retaining access to the C-style graphics and statistics features provided by the original implementation. Dap provides core methods of data management, analysis, and graphics that are commonly used in statistical consulting practice (univariate statistics, correlations and regression, ANOVA, categorical data analysis, logistic regression, and nonparametric analyses).","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"cvc4","portdir":"math/cvc4","version":"1.4","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://cvc4.cs.nyu.edu/","description":"An automated theorem prover for SMT problems","long_description":"CVC4 is a tool for determining the satisfiability of a first order formula modulo a first order theory (or a combination of such theories). It is the fourth in the Cooperating Validity Checker family of tools (CVC, CVC Lite, CVC3) but does not directly incorporate code from any previous version. CVC4 is intended to be an open and extensible SMT engine. It can be used as a stand-alone tool or as a library. It has been designed to increase the performance and reduce the memory overhead of its predecessors.","active":true,"categories":["devel","math"],"maintainers":[],"variants":["debug","java","universal"],"dependencies":[{"type":"build","ports":["bash","gawk","curl","clang-18","doxygen","boost176"]},{"type":"lib","ports":["gmp"]}],"depends_on":[{"type":"lib","ports":["Maude"]}]},{"name":"cusp","portdir":"math/cusp","version":"0.5.1","license":"Apache-2","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://cusplibrary.github.io","description":"Generic Parallel Algorithms for Sparse Matrix and Graph","long_description":"Cusp is a library for sparse linear algebra and graph computations on CUDA. Cusp provides a flexible, high-level interface for manipulating sparse matrices and solving sparse linear systems.","active":true,"categories":["science","math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"curves","portdir":"math/curves","version":"20220312","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/teodimoff/curves","description":"Curves provide mapping a point from 1D to 2D hilbert space.","long_description":"Curves provide Hilbert mapping of a point from 1D to 2D hilbert space. This means that points closer together from one dimentional space are closer in the other. In other words it preserves locality.","active":true,"categories":["graphics","math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["sbt","clang-18"]},{"type":"lib","ports":["libsdl2","openjdk11"]}],"depends_on":[]},{"name":"crfsuite","portdir":"math/crfsuite","version":"0.12.2","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.chokkan.org/software/crfsuite/","description":"A fast implementation of Conditional Random Fields (CRFs)","long_description":"CRFsuite is an implementation of Conditional Random Fields (CRFs) for labeling sequential data.","active":true,"categories":["textproc","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18"]},{"type":"lib","ports":["liblbfgs"]}],"depends_on":[]},{"name":"crfpp","portdir":"math/crfpp","version":"0.58","license":"LGPL-3+ and BSD","platforms":"darwin","epoch":1,"replaced_by":null,"homepage":"https://taku910.github.io/crfpp/","description":"Yet Another CRF toolkit","long_description":"CRF++ is a simple, customizable, and open source implementation of Conditional Random Fields (CRFs) for segmenting/labeling sequential data. CRF++ is designed for generic purpose and will be applied to a variety of NLP tasks, such as Named Entity Recognition, Information Extraction and Text Chunking.","active":true,"categories":["textproc","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["nkf","clang-18"]}],"depends_on":[{"type":"lib","ports":["cabocha","extractopinion","kakarot","knp","knp3"]}]},{"name":"cppoptlib","portdir":"math/cppoptlib","version":"2024.01.03","license":"MIT","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://github.com/PatWie/CppNumericalSolvers","description":"Header-only C++17 optimization library","long_description":"cppoptlib is light-weight header-only C++17 library of numerical optimization methods for non-linear functions based on Eigen.","active":true,"categories":["math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-20"]},{"type":"run","ports":["eigen3"]}],"depends_on":[]},{"name":"cotila","portdir":"math/cotila","version":"1.2.1","license":"Apache-2","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://github.com/calebzulawski/cotila","description":"A compile-time linear algebra system for C++","long_description":"A compile-time linear algebra system for C++","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]}],"depends_on":[]},{"name":"convertall","portdir":"math/convertall","version":"0.8.0","license":"GPL-2+","platforms":"any","epoch":0,"replaced_by":null,"homepage":"http://convertall.bellz.org","description":"Extremely flexible unit converter","long_description":"ConvertAll has a large database of units, and allows conversions that use multiple units, e.g. convert from feet per decade to nautical miles per fortnight.","active":true,"categories":["science","math"],"maintainers":[{"name":"kevin01","github":"khorton","ports_count":1}],"variants":[],"dependencies":[{"type":"build","ports":["clang-18","py310-wheel","py310-build","py310-installer","pkgconfig","py310-setuptools"]},{"type":"lib","ports":["python310","py310-pyqt5","qt5-qtbase"]}],"depends_on":[]},{"name":"conauto","portdir":"math/conauto","version":"2.03","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://sites.google.com/site/giconauto","description":"Program for graph isomorphism testing & automorphism group computation","long_description":"Program for graph isomorphism testing & automorphism group computation","active":true,"categories":["math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"coinor-osi","portdir":"math/coinor-osi","version":"0.108.9","license":"EPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/coin-or/osi","description":"A uniform API for calling embedded linear and mixed-integer programming solvers.","long_description":"The COIN-OR Open Solver Interface is a uniform API for interacting with callable solver libraries. It supports linear programming solvers as well as the ability to \"finish off\" a mixed-integer problem calling the solver library's MIP solver.","active":true,"categories":["math"],"maintainers":[{"name":"flyingsamson","github":"flyingsamson","ports_count":18}],"variants":["universal"],"dependencies":[{"type":"build","ports":["pkgconfig","clang-18"]},{"type":"lib","ports":["glpk","coinor-coinutils"]}],"depends_on":[{"type":"lib","ports":["coinor-cbc","coinor-cgl","coinor-clp"]}]},{"name":"coinor-coinutils","portdir":"math/coinor-coinutils","version":"2.11.10","license":"EPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/coin-or/CoinUtils","description":"Utilities, data structures, and linear algebra methods for COIN-OR projects","long_description":"CoinUtils is an open-source collection of classes and helper functions that are generally useful to multiple COIN-OR projects. \nThese utilities include: \n * classes for storing and manipulating sparse matrices and vectors, \n * performing matrix factorization, \n * parsing input files in standard formats, e.g. MPS, \n * building representations of mathematical programs, \n * performing simple presolve operations, \n * warm starting algorithms for mathematical programs, \n * comparing floating point numbers with a tolerance \n * classes for storing and manipulating conflict graphs, and \n * classes for searching and storing cliques and odd cycles in conflict graphs, among others.","active":true,"categories":["math"],"maintainers":[{"name":"flyingsamson","github":"flyingsamson","ports_count":18}],"variants":["openblas","universal"],"dependencies":[{"type":"build","ports":["pkgconfig","clang-18"]},{"type":"lib","ports":["OpenBLAS","glpk"]}],"depends_on":[{"type":"lib","ports":["coinor-cbc","coinor-cgl","coinor-clp","coinor-osi"]}]},{"name":"coinor-clp","portdir":"math/coinor-clp","version":"1.17.9","license":"EPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/coin-or/clp","description":"A solver for linear programs","long_description":"Clp (Coin-or linear programming) is an open-source linear programming solver. \nIt is primarily meant to be used as a callable library, but a basic, stand-alone executable version is also available. It is designed to find solutions of mathematical optimization problems of the form \n \nminimize c'x \nsuch that lhs <= Ax <= rhs \nand lb <= x <= ub \n \nCLP includes primal and dual Simplex solvers. Both dual and primal algorithms can use matrix storage methods provided by the user (0-1 and network matrices are already supported in addition to the default sparse matrix). The dual algorithm has Dantzig and Steepest edge row pivot choices, new ones may be provided by the user. The same is true for the column pivot choice of the primal algorithm. The primal can also use a non linear cost which should work for piecewise linear convex functions. CLP also includes a barrier method for solving LPs.","active":true,"categories":["math"],"maintainers":[{"name":"flyingsamson","github":"flyingsamson","ports_count":18}],"variants":["openblas","universal"],"dependencies":[{"type":"build","ports":["pkgconfig","clang-18"]},{"type":"lib","ports":["glpk","mumps","readline","coinor-coinutils","coinor-osi","asl","OpenBLAS"]}],"depends_on":[{"type":"lib","ports":["coinor-cbc","coinor-cgl"]}]},{"name":"coinor-cgl","portdir":"math/coinor-cgl","version":"0.60.8","license":"EPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/coin-or/cgl","description":"A library of cutting-plane generators.","long_description":"The COIN-OR Cut Generation Library (Cgl) is an open collection of cutting plane implementations (\"cut generators\") for use in teaching, research, and applications. Cgl can be used with other COIN-OR packages that make use of cuts, such as the mixed-integer linear programming solver Cbc. Each cut generator has its own maintainer who leads the development of its functionality, testing, and documentation. See below for a listing of available generators. All the generators are combined in one library when Cgl is compiled.","active":true,"categories":["math"],"maintainers":[{"name":"flyingsamson","github":"flyingsamson","ports_count":18}],"variants":["universal"],"dependencies":[{"type":"build","ports":["pkgconfig","clang-18"]},{"type":"lib","ports":["coinor-clp","coinor-coinutils","coinor-osi"]}],"depends_on":[{"type":"lib","ports":["coinor-cbc"]}]},{"name":"coinor-cbc","portdir":"math/coinor-cbc","version":"2.10.11","license":"EPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/coin-or/cbc","description":"An LP-based branch-and-cut library","long_description":"CBC is an open-source MILP solver. It uses many of the COIN-OR components and is designed to be used with CLP. It is available as a library and as a standalone solver.","active":true,"categories":["math"],"maintainers":[{"name":"flyingsamson","github":"flyingsamson","ports_count":18}],"variants":["openblas","universal"],"dependencies":[{"type":"build","ports":["pkgconfig","clang-18"]},{"type":"lib","ports":["glpk","mumps","asl","readline","coinor-clp","coinor-coinutils","coinor-osi","coinor-cgl","OpenBLAS"]}],"depends_on":[]},{"name":"cmsvlib","portdir":"math/cmsvlib","version":"2013-04-19","license":"unknown","platforms":"any","epoch":1,"replaced_by":null,"homepage":"http://www.physics.wisc.edu/~craigm/idl/cmsave.html","description":"Read and Write IDL SAVE files","long_description":"allows interactive users and programmers to read, write and interrogate IDL SAVE files.","active":true,"categories":["science","math"],"maintainers":[{"name":"takeshi","github":"tenomoto","ports_count":53}],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"cminpack","portdir":"math/cminpack","version":"1.3.11","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/devernay/cminpack","description":"Solving nonlinear equations and nonlinear least squares problems","long_description":"A C/C++ rewrite of the MINPACK software (originally in Fortran) for solving nonlinear equations and nonlinear least squares problems.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[]},{"name":"cmh","portdir":"math/cmh","version":"1.1.1","license":"GPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.multiprecision.org/cmh/home.html","description":"Compute Igusa class polynomials","long_description":"Compute Igusa class polynomials","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18"]},{"type":"lib","ports":["fplll","gmp","mpfrcx","libmpc","mpfr","pari"]}],"depends_on":[]},{"name":"cln","portdir":"math/cln","version":"1.3.7","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.ginac.de/CLN/","description":"Class Library for Numbers","long_description":"CLN is a C++ library providing a rich library of numeric functions.","active":true,"categories":["math"],"maintainers":[{"name":"mps","github":"Schamschula","ports_count":1677}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["gmp"]}],"depends_on":[{"type":"lib","ports":["cantor","GiNaC","py26-clnum"]}]},{"name":"cliquer","portdir":"math/cliquer","version":"1.21","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://users.aalto.fi/~pat/cliquer.html","description":"Find cliques in graphs","long_description":"Cliquer is a program for efficiently finding cliques in arbitrary weighted graphs.","active":true,"categories":["science","math"],"maintainers":[{"name":"szhorvat","github":"szhorvat","ports_count":18}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"clingo","portdir":"math/clingo","version":"5.7.1","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://potassco.org/clingo/","description":"An Answer Set Programming system to ground and solve logic programs.","long_description":"Clingo is part of the Potassco project for Answer Set Programming (ASP). ASP offers a simple and powerful modeling language to describe combinatorial problems as logic programs. The clingo system then takes such a logic program and computes answer sets representing solutions to the given problem.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]}],"depends_on":[{"type":"lib","ports":["aspcud","clingcon"]}]},{"name":"clingcon","portdir":"math/clingcon","version":"5.2.1","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://potassco.org/clingcon","description":"Extension of clingo to handle constraints over integers","long_description":"Clingcon is an answer set solver for constraint logic programs, building upon the answer set solver clingo. It extends the high-level modeling language of ASP with constraint solving capacities. Constraints over finite domain integer variables can be used in logic programs. Clingcon adopts state-of-the-art techniques from the area of SMT, like conflict-driven learning and theory propagation. It uses lazy nogood and variable generation on the order encoding and features several preprocessing techniques.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]},{"type":"lib","ports":["clingo"]}],"depends_on":[]},{"name":"clblast","portdir":"math/clblast","version":"1.6.2","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/CNugteren/CLBlast","description":"Tuned OpenCL BLAS","long_description":"Tuned OpenCL BLAS","active":true,"categories":["math"],"maintainers":[{"name":"stromnov","github":"stromnov","ports_count":2959}],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[]},{"name":"clblas","portdir":"math/clblas","version":"2.12","license":"Apache","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/clMathLibraries/clBLAS","description":"A software library containing BLAS functions written in OpenCL","long_description":"A software library containing BLAS functions written in OpenCL","active":true,"categories":["math"],"maintainers":[{"name":"stromnov","github":"stromnov","ports_count":2959}],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[]},{"name":"classias","portdir":"math/classias","version":"1.1","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.chokkan.org/software/classias/","description":"a collection of machine-learning algorithms for classification","long_description":"Classias is a collection of machine-learning algorithms for classification.","active":true,"categories":["textproc","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":[null]},{"type":"run","ports":[null]}],"depends_on":[]},{"name":"clasp","portdir":"math/clasp","version":"3.3.10","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://potassco.org/clasp/","description":"A conflict-driven nogood learning answer set solver","long_description":"clasp is an answer set solver for (extended) normal logic programs. It combines the high-level modeling capacities of answer set programming with state-of-the-art techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict-driven nogood learning, a technique that proved very successful for satisfiability checking (SAT).","active":true,"categories":["math"],"maintainers":[],"variants":["debug","tests","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[]},{"name":"clac","portdir":"math/clac","version":"0.3.4","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/soveran/clac","description":"Command-line, stack-based calculator with postfix notation","long_description":"Command-line, stack-based calculator with postfix notation","active":true,"categories":["math"],"maintainers":[{"name":"judaew","github":"judaew","ports_count":688}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"ceres-solver","portdir":"math/ceres-solver","version":"2.2.0","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://ceres-solver.org","description":"Library for modeling and solving large, complicated optimization problems.","long_description":"Ceres Solver is an open source C++ library for modeling and solving large, complicated optimization problems. It can solve nonlinear least squares problems and general unconstrained optimization problems.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]},{"type":"lib","ports":["SuiteSparse_config","SuiteSparse_AMD","SuiteSparse_CAMD","SuiteSparse_CCOLAMD","gflags","SuiteSparse_CHOLMOD","SuiteSparse_SPQR","eigen3","metis","SuiteSparse_COLAMD","google-glog"]}],"depends_on":[]},{"name":"casadi","portdir":"math/casadi","version":"3.7.2","license":"LGPL-3","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/casadi/casadi","description":"CasADi is a symbolic framework for numeric optimization","long_description":"CasADi is a symbolic framework for numeric optimization implementing automatic differentiation in forward and reverse modes on sparse matrix-valued computational graphs. It supports self-contained C-code generation and interfaces state-of-the-art codes such as SUNDIALS, IPOPT etc. It can be used from C++, Python or Matlab/Octave.","active":true,"categories":["math"],"maintainers":[{"name":"aw.kornilov","github":"ierofant","ports_count":15}],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[]},{"name":"buddy","portdir":"math/buddy","version":"2.4","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://buddy.sourceforge.net/","description":"binary decision diagram package","long_description":"binary decision diagram package","active":true,"categories":["devel","science","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18"]}],"depends_on":[{"type":"lib","ports":["ocaml-buddy","Maude"]}]},{"name":"btor2tools","portdir":"math/btor2tools","version":"20230816","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/Boolector/btor2tools","description":"a generic parser and tools for the BTOR2 format","long_description":"The Btor2Tools package provides a generic parser and tools for the BTOR2 format.","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]}],"depends_on":[{"type":"lib","ports":["boolector"]}]},{"name":"bpack","portdir":"math/bpack","version":"3.2.0","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://portal.nersc.gov/project/sparse/butterflypack","description":"ButterflyPACK is a mathematical software for rapidly solving large-scale dense linear systems that exhibit off-diagonal rank-deficiency","long_description":"ButterflyPACK is a mathematical software for rapidly solving large-scale dense linear systems that exhibit off-diagonal rank-deficiency","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","accelerate","atlas","blis","flexiblas","openblas","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gfortran","mpich","openmpi","universal"],"dependencies":[{"type":"build","ports":["cmake","pkgconfig","clang-18","gcc15"]},{"type":"lib","ports":["zfp","libgcc","mpich-clang18","libomp","OpenBLAS","scalapack"]}],"depends_on":[]},{"name":"boolector","portdir":"math/boolector","version":"3.2.4","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/Boolector/boolector","description":"an SMT solver for the theory of bit-vectors","long_description":"Boolector is an SMT solver for the theory of bit-vectors and the extensional theory of arrays over bit-vectors. It won first places in the prestigious bit-vector and bit-vector with arrays tracks in the SMT competition 2008. In the latest SMT competition, it won the second place in the bit-vector division and again the first place in the division of bit-vectors and arrays.","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","gtest","picosat","clang-18"]},{"type":"lib","ports":["gmp","btor2tools"]}],"depends_on":[]},{"name":"blitzwave","portdir":"math/blitzwave","version":"0.8.0","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://oschulz.github.io/blitzwave/","description":"C++ wavelet mini-library building on the blitz++ array template library","long_description":"blitzwave is a C++ wavelet mini-library building on the blitz++ array template library. blitzwave is heavily templated and supports wavelet decompositions of n-dimensional arrays of various numerical data types. You can define and use your own wavelets, a number of pre-defined, ready-to-use wavelets are available","active":true,"categories":["devel","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18"]},{"type":"lib","ports":["blitz"]}],"depends_on":[]},{"name":"blitz","portdir":"math/blitz","version":"1.0.2","license":"(LGPL-3+ or BSD or Artistic-2)","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/blitzpp/blitz","description":"a C++ class library for scientific computing","long_description":"Blitz++ is a C++ class library for scientific computing which provides performance on par with Fortran 77/90. It uses template techniques to achieve high performance.","active":true,"categories":["devel","math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1685}],"variants":["debug","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","universal"],"dependencies":[{"type":"build","ports":["cmake","python38","clang-18"]}],"depends_on":[{"type":"lib","ports":["blitzwave","itl"]}]},{"name":"bliss","portdir":"math/bliss","version":"0.77","license":"LGPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://users.aalto.fi/~tjunttil/bliss/","description":"Compute automorphism groups of graphs","long_description":"bliss is an open-source tool for computing canonical labelings and automorphism groups of graphs.","active":true,"categories":["science","math"],"maintainers":[{"name":"szhorvat","github":"szhorvat","ports_count":18}],"variants":["universal","debug"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"extract","ports":["unzip"]}],"depends_on":[{"type":"lib","ports":["polymake","sympol"]}]},{"name":"blaspp","portdir":"math/blaspp","version":"2024.10.26","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/icl-utk-edu/blaspp","description":"C++ API for the Basic Linear Algebra Subroutines","long_description":"C++ API for the Basic Linear Algebra Subroutines","active":true,"categories":["science","math"],"maintainers":[],"variants":["universal","debug","accelerate","atlas","blis","flexiblas","openblas"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["libomp","OpenBLAS"]},{"type":"test","ports":["python312"]}],"depends_on":[]},{"name":"bcv","portdir":"math/bcv","version":"2.2","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://gbarbier.free.fr/prj/dev/#bcv","description":"command line number converter","long_description":"Converts number to/from decimal, hex, bin, octal and ascii on the command line.","active":true,"categories":["math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"bayon","portdir":"math/bayon","version":"0.1.1","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/fujimizu/bayon","description":"a simple and fast hard-clustering tool","long_description":"Bayon is a simple and fast hard-clustering tool, and supports Repeated Bisection clustering and K-means clustering.","active":true,"categories":["textproc","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["sparsehash"]}],"depends_on":[]},{"name":"basiclu","portdir":"math/basiclu","version":"2.2.0","license":"(GPL-3 or MIT)","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/ERGO-Code/basiclu","description":"Sparse LU factorization and update","long_description":"Sparse LU factorization and update","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"bashplotlib","portdir":"math/bashplotlib","version":"0.6.5","license":"BSD","platforms":"{darwin any}","epoch":0,"replaced_by":null,"homepage":"https://github.com/glamp/bashplotlib","description":"Make scatter or histogram plots in the terminal","long_description":"Make scatter or histogram plots in the terminal","active":true,"categories":["math","python"],"maintainers":[{"name":"amake","github":"amake","ports_count":166}],"variants":[],"dependencies":[{"type":"build","ports":["clang-18","py314-build","py314-installer","py314-setuptools","py314-wheel"]},{"type":"lib","ports":["python314"]}],"depends_on":[]},{"name":"bact","portdir":"math/bact","version":"0.13","license":"GPL","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://chasen.org/~taku/software/bact/","description":"a Boosting Algorithm for Classification of Trees","long_description":"BACT is a machine learning tool for labeled ordered trees. The important characteristic is that the input example x is represented not in a numerical feature vector (bag-of-words) but in a labeled ordered tree.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"name":"atlas","portdir":"math/atlas","version":"3.10.2","license":"BSD","platforms":"{darwin < 20}","epoch":0,"replaced_by":null,"homepage":"http://math-atlas.sourceforge.net/","description":"Portable optimal linear algebra software","long_description":"Provides a complete BLAS and LAPACK API.\nATLAS achieves performance on par with machine-specific tuned libraries.","active":true,"categories":["math"],"maintainers":[{"name":"vince","github":"Veence","ports_count":25}],"variants":["gcc5","gcc49","mpclang37","nofortran","universal"],"dependencies":[{"type":"build","ports":["gcc5"]},{"type":"lib","ports":["libgcc6","libgcc"]}],"depends_on":[{"type":"lib","ports":["shogun","shogun-devel","levmar","scamp"]}]},{"name":"asl","portdir":"math/asl","version":"20240106","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/ampl/asl","description":"ASL is A Modeling Language for Mathematical Programming (AMPL) Solver Library","long_description":"ASL is A Modeling Language for Mathematical Programming (AMPL) Solver Library.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","threads","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["libomp"]}],"depends_on":[{"type":"lib","ports":["coinor-cbc","coinor-clp","ipopt"]}]},{"name":"arpack","portdir":"math/arpack","version":"3.9.1","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/opencollab/arpack-ng","description":"Package for solving large-scale eigenvalue problems","long_description":"ARPACK is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems. Parallel ARPACK (PARPACK) is included if built with an MPI variant.","active":true,"categories":["math"],"maintainers":[],"variants":["accelerate","atlas","blis","flexiblas","openblas","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","mpich","openmpi","universal"],"dependencies":[{"type":"build","ports":["gcc15","pkgconfig","clang-18","autoconf","automake","libtool"]},{"type":"lib","ports":["OpenBLAS","libgcc"]}],"depends_on":[{"type":"lib","ports":["shogun","shogun-devel","tapkee","octave","deal.ii","hpddm","igraph","getdp","nektarpp"]}]},{"name":"arborx","portdir":"math/arborx","version":"1.7","license":"BSD","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://github.com/arborx/ArborX","description":"An open-source library designed to provide performance portable algorithms for geometric search","long_description":"ArborX is An open-source library designed to provide performance portable algorithms for geometric search.","active":true,"categories":["math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1685}],"variants":["debug","tests"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]},{"type":"lib","ports":["libomp","kokkos"]}],"depends_on":[{"type":"lib","ports":["deal.ii"]}]},{"name":"apophenia","portdir":"math/apophenia","version":"20160308","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://apophenia.info","description":"A C library for statistical and scientific computing","long_description":"Apophenia is an open statistical library for working with data sets and statistical models. It provides functions on the same level as those of the typical stats package (such as OLS, Probit, or singular value decomposition) but gives the user more flexibility to be creative in model-building. The core functions are written in C.","active":true,"categories":["science","math"],"maintainers":[{"name":"el.dirte","github":"","ports_count":1}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["sqlite3","gsl"]}],"depends_on":[]},{"name":"adept2","portdir":"math/adept2","version":"2024.01.24","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.met.reading.ac.uk/clouds/adept","description":"Fast automatic differentiation library in C++","long_description":"Combined array and automatic differentiation library in C++.","active":true,"categories":["math"],"maintainers":[],"variants":["accelerate","atlas","blis","flexiblas","openblas","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","universal"],"dependencies":[{"type":"build","ports":["clang-18","gcc15","autoconf","automake","libtool"]},{"type":"lib","ports":["libgcc","OpenBLAS"]},{"type":"test","ports":["gsl"]}],"depends_on":[]},{"name":"acl2","portdir":"math/acl2","version":"8.7","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.cs.utexas.edu/users/moore/acl2/v8-7","description":"Applicative Common Lisp / A Computational Logic","long_description":"ACL2 (Applicative Common Lisp / A Computational Logic) is the successor to nqthm, the Boyer-Moore theorem prover. ACL2 can be used to automatically or semi-automatically prove theorems and has been used extensively in real applications (e.g., proving the correctness of certain calculations in the floating point unit of the AMD K5 microprocessor. ACL2 is a very large, multipurpose system. You can use it as a programming language, a specification language, a modeling language, a formal mathematical logic, or a semi-automatic theorem prover. Because the meta-language is the same as the language (a subset of Common Lisp), it is very flexible.","active":true,"categories":["math"],"maintainers":[{"name":"ijackson","github":"JacksonIsaac","ports_count":44}],"variants":["emacs","ccl","certify","regression","nonstd"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["sbcl"]}],"depends_on":[]}]}