{"count":52341,"next":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-created_at&page=943","previous":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-created_at&page=941","results":[{"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":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gfortran","mpich","openmpi"],"dependencies":[{"type":"build","ports":["clang-18","gcc15"]},{"type":"lib","ports":["libgcc","mpich-clang18"]},{"type":"test","ports":["vecLibFort","libomp"]}],"depends_on":[]},{"name":"ess","portdir":"math/ess","version":"13.09-1","license":"GPL-3+","platforms":"any","epoch":0,"replaced_by":null,"homepage":"http://ess.r-project.org/","description":"Emacs mode for statistical programming and analysis","long_description":"ESS is a GNU Emacs and XEmacs mode for interactive statistical programming and data analysis. Languages supported: the S family (S, S-PLUS and R), SAS, BUGS/JAGS, Stata and XLispStat.","active":true,"categories":["science","math"],"maintainers":[{"name":"jrblevin","github":"","ports_count":1}],"variants":["emacs_app"],"dependencies":[{"type":"build","ports":["texinfo","clang-18"]},{"type":"lib","ports":["emacs"]}],"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-18"]}],"depends_on":[]},{"name":"eplot","portdir":"math/eplot","version":"20230228","license":"GPL-2+","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://github.com/chriswolfvision/eplot","description":"Easily pipe data through gnuplot and create plots quickly","long_description":"Easily pipe data through gnuplot and create plots quickly. Save in PostScript, PDF, PNG or EMF format. Plotting of multiple files into a single diagram is supported.","active":true,"categories":["math","ruby"],"maintainers":[{"name":"amake","github":"amake","ports_count":162}],"variants":[],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"run","ports":["ruby27","gnuplot"]}],"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-18"]}],"depends_on":[]},{"name":"ent","portdir":"math/ent","version":"20220220","license":"public-domain","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.fourmilab.ch/random/","description":"Entropy calculator","long_description":"ent applies various tests to sequences of bytes stored in files and reports the results of those tests. The program is useful for those evaluating pseudorandom number generators for encryption and statistical sampling applications, compression algorithms and other applications where the information density of a file is of interest.","active":true,"categories":["security","math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"extract","ports":["unzip"]}],"depends_on":[]},{"name":"ensmallen","portdir":"math/ensmallen","version":"3.10.0","license":"BSD","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://ensmallen.org","description":"flexible C++ library for efficient numerical optimization","long_description":"ensmallen provides a simple set of abstractions for writing an objective function to optimize. It also provides a large set of standard and cutting-edge optimizers that can be used for virtually any numerical optimization task. These include full-batch gradient descent techniques, small-batch techniques, gradient-free optimizers, and constrained optimization.","active":true,"categories":["devel","science","math"],"maintainers":[{"name":"takeshi","github":"tenomoto","ports_count":53}],"variants":["debug","tests"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["armadillo"]}],"depends_on":[{"type":"lib","ports":["mlpack"]}]},{"name":"eigen3-devel","portdir":"math/eigen3","version":"3.4-tracking-20241122","license":"(MPL-2 or LGPL-2.1+ or Apache-2 or BSD or Minpack)","platforms":"any","epoch":3,"replaced_by":"eigen3","homepage":"https://libeigen.gitlab.io","description":"Obsolete port, replaced by eigen3","long_description":"This port has been replaced by eigen3.","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","doc","blas","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"extract","ports":[null]},{"type":"fetch","ports":[null]},{"type":"lib","ports":[null]},{"type":"patch","ports":[null]},{"type":"run","ports":[null]},{"type":"test","ports":[null]}],"depends_on":[]},{"name":"eigen3","portdir":"math/eigen3","version":"3.4.1","license":"(MPL-2 or LGPL-2.1+ or Apache-2 or BSD or Minpack)","platforms":"any","epoch":0,"replaced_by":null,"homepage":"https://libeigen.gitlab.io","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":[],"variants":["debug","doc","blas","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran"],"dependencies":[{"type":"build","ports":["cmake","pkgconfig","clang-18"]}],"depends_on":[{"type":"build","ports":["py312-openbabel","py313-openbabel","gnudatalanguage","py314-openbabel","openbabel","openscad-devel","py39-openbabel2","py27-openbabel","openscad","iqtree3","iqtree","Pangolin","py39-gyoto","avogadro","bali-phy-devel","avogadrolibs","openbabel2","py311-openbabel","py310-openbabel","py310-openbabel2","py311-openbabel2","py312-openbabel2","Gyoto","py310-gyoto","py311-gyoto","py312-gyoto","py313-gyoto","py314-gyoto","iqtree2","py39-openbabel","bali-phy"]},{"type":"lib","ports":["R-ChemmineOB","luminance-hdr","draco","freecad","manif","orocos-kdl","cgal4","cgal5","cgal6","libpcl","blender","libfive","nanogui-wjakob","tthresh","digikam","py37-pytorch","kstars","FastAD","LBFGSpp","ceres-solver","dolfin","hiop","polysolve","sympol","libmovit","py310-coolprop","py311-coolprop","NanoVNA-QT","libxavna","kdeartwork","libcifpp","paraview","py311-pytorch","py310-pytorch","py312-pytorch","py313-pytorch","py314-pytorch","InsightToolkit","py310-InsightToolkit","py311-InsightToolkit","py312-InsightToolkit","py313-InsightToolkit","shogun","shogun-devel","ALPSCore","ALPSMaxent","gmsh","rdkit","vtk","LightGBM","finite-diff","tapkee","py27-milk","py38-pytorch","Sophus","py38-coolprop","stellarium","py39-pytorch","mlt-legacy","py39-coolprop","cufflinks","fcl","mutationpp","ompl","openscad","openscad-devel","cantera","chemkit"]},{"type":"run","ports":["stanmath","py37-gpilab-framework","py36-gpilab-framework","py39-gpilab-framework","py38-gpilab-framework","cppoptlib"]}]},{"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-18"]}],"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-18"]}],"depends_on":[]},{"name":"drgeo1","portdir":"math/drgeo1","version":"1.1.0","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://drgeo.eu/","description":"Dr Geo is an interactive geometry software.","long_description":"Dr Geo is an interactive geometry software. This means one can draw geometric figure based on mathematic property but also can move part of the figure in respect with its properties. Dr Geo is an educational oriented software. It's an observatory to explore geometry situation in an interactive way in opposition to figure drawn on a sheet of paper. The user interface has been thing to be simple but efficient for young users. In this idea, Dr Geo can also handle different languages. It can can be used by mathematic teachers. In a class room to make a show or in a computer class room. Also the teacher can share Dr Geo with its students.","active":true,"categories":["math"],"maintainers":[{"name":"michael.klein","github":"mklein-de","ports_count":16}],"variants":["universal"],"dependencies":[{"type":"build","ports":["pkgconfig","clang-18"]},{"type":"lib","ports":["libglade2","guile-1.8"]}],"depends_on":[]},{"name":"dolfin","portdir":"math/dolfin","version":"2019.1.0","license":"LGPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://bitbucket.org/fenics-project/dolfin","description":"DOLFIN is a part of FEniCS","long_description":"DOLFIN is a library that functions as the main user interface of FEniCS","active":true,"categories":["math"],"maintainers":[],"variants":["debug","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gfortran","mpich","openmpi","cgal","docs","hdf5","parmetis","scotch","suitesparse","petsc","petsc4py","slepc","slepc4py"],"dependencies":[{"type":"build","ports":["cmake","pkgconfig","clang-18"]},{"type":"lib","ports":["armadillo","boost176","SuiteSparse_AMD","py312-ffc","mpich-clang18","py312-ply","SuiteSparse_UMFPACK","eigen3"]}],"depends_on":[{"type":"lib","ports":["py36-dolfin","py38-dolfin","py39-dolfin","py310-dolfin","py311-dolfin","py312-dolfin"]}]},{"name":"py39-dlib","portdir":"math/dlib","version":"19.24.6","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://dlib.net","description":"Python 3.9 bindings for Modern C++ toolkit for machine learning, image processing, and more.","long_description":"This package provides Python 3.9 bindings, modules, and scripts.","active":false,"categories":["math","python"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","py39-setuptools","clang-17"]},{"type":"lib","ports":["libpng","webp","python39","OpenBLAS","ffmpeg","xorg-libXext","xorg-libice","xorg-libsm","libjxl","sqlite3","giflib","libjpeg-turbo"]},{"type":"test","ports":["py39-pytest"]}],"depends_on":[{"type":"run","ports":["py39-photomosaic"]}]},{"name":"py38-dlib","portdir":"math/dlib","version":"19.24.2","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://dlib.net","description":"Python 3.8 bindings for Modern C++ toolkit for machine learning, image processing, and more.","long_description":"This package provides Python 3.8 bindings, modules, and scripts.","active":false,"categories":["math","python"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","py38-setuptools","clang-16"]},{"type":"lib","ports":["sqlite3","python38"]},{"type":"test","ports":["py38-pytest"]}],"depends_on":[{"type":"run","ports":["py38-photomosaic"]}]},{"name":"py37-dlib","portdir":"math/dlib","version":"19.24.2","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://dlib.net","description":"Python 3.7 bindings for Modern C++ toolkit for machine learning, image processing, and more.","long_description":"This package provides Python 3.7 bindings, modules, and scripts.","active":false,"categories":["math","python"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","py37-setuptools","clang-16"]},{"type":"lib","ports":["sqlite3","python37"]},{"type":"test","ports":["py37-pytest"]}],"depends_on":[{"type":"run","ports":["py37-photomosaic"]}]},{"name":"dlib","portdir":"math/dlib","version":"20.0.1","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://dlib.net","description":"Modern C++ toolkit for machine learning, image processing, and more.","long_description":"Dlib is a modern C++ toolkit containing machine learning algorithms and tools for creating complex software in C++ to solve real world problems. It is used in both industry and academia in a wide range of domains including robotics, embedded devices, mobile phones, and large high performance computing environments. Dlib's open source licensing allows you to use it in any application, free of charge.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-20"]},{"type":"lib","ports":["zlib","sqlite3","giflib","libjpeg-turbo","libpng","webp","OpenBLAS","ffmpeg","xorg-libX11","xorg-libXext","xorg-libice","xorg-libsm","libjxl"]}],"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-18"]}],"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-18"]}],"depends_on":[]},{"name":"deal.ii","portdir":"math/deal.ii","version":"9.4.2","license":"LGPL-2.1+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.dealii.org/","description":"a C++ software library supporting the creation of finite element codes","long_description":"deal.ii is a C++ software library supporting the creation of finite element codes.","active":true,"categories":["science","math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["debug","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","docs","python","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-20","gcc15"]},{"type":"lib","ports":["libgcc","libomp","ADOL-C","OpenBLAS","SuiteSparse_UMFPACK","arpack","gsl","metis","muparser","zlib","gmsh","hdf5","opencascade","boost176","onetbb","sundials5","kokkos","arborx","symengine","cgal5","assimp"]}],"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":"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":"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":"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":1545}],"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":"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":2897}],"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":2897}],"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":"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":"calc","portdir":"math/calc","version":"2.17.0.0","license":"LGPL-2.1","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.isthe.com/chongo/tech/comp/calc/","description":"Arbitrary precision calculator","long_description":"Calc is an interactive calculator which provides for easy large numeric calculations, but which also can be easily programmed for difficult or long calculations. It can accept a command line argument, in which case it executes that single command and exits. Otherwise, it enters interactive mode. There are a great number of pre-defined functions. The calculator can calculate transcendental functions, and accept and display numbers in real or exponential format. The calculator also knows about complex numbers.","active":true,"categories":["math"],"maintainers":[{"name":"pmetzger","github":"pmetzger","ports_count":24}],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["ncurses","readline"]}],"depends_on":[]},{"name":"caffe","portdir":"math/caffe","version":"20170817","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://caffe.berkeleyvision.org/","description":"a fast framework for deep learning","long_description":"a fast framework for deep learning","active":true,"categories":["science","math"],"maintainers":[],"variants":["universal","cpu","gpu","cudnn","openblas","python27"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["szip","leveldb","lmdb","gflags","google-glog","snappy","opencv3","OpenBLAS","hdf5","boost171","protobuf3-cpp"]},{"type":"run","ports":["wget"]}],"depends_on":[]},{"name":"cadabra2","portdir":"math/cadabra2","version":"2.5.14","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://cadabra.science/index.html","description":"A field theory approach to symbolic computer algebra","long_description":"Cadabra is a computer algebra system for the manipulation of what could loosely be called tensorial expressions. It is aimed at, though not necessarily restricted to, theoretical high energy physicists. Because of its target audience, the program's interface, storage system and underlying philosophy differ substantially from other computer algebra systems.","active":true,"categories":["math"],"maintainers":[],"variants":["debug","texmacs","universal"],"dependencies":[{"type":"build","ports":["cmake","pcrexx","pkgconfig","clang-20","py314-pybind11"]},{"type":"lib","ports":["dvipng","gtkmm3","sqlite3","py314-sympy","boost176","gmp","pcre","adwaita-icon-theme","hicolor-icon-theme"]}],"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":"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":1599}],"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":"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":"bc","portdir":"math/bc","version":"1.08.2","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.gnu.org/software/bc/","description":"arbitrary precision numeric processing language","long_description":"bc is an arbitrary precision numeric processing language. Syntax is similar to C, but differs in many substantial areas. It supports interactive execution of statements. bc is a utility included in the POSIX P1003.2/D11 draft standard.","active":true,"categories":["math"],"maintainers":[],"variants":["libedit","readline","universal"],"dependencies":[{"type":"build","ports":["texinfo","clang-18"]},{"type":"lib","ports":["flex","libedit"]}],"depends_on":[{"type":"run","ports":["gutils-suite-core"]}]},{"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":"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":162}],"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":"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":["deal.ii","shogun","shogun-devel","tapkee","octave","hpddm","igraph","getdp","nektarpp"]}]},{"name":"arowpp","portdir":"math/arowpp","version":"0.1.3","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/tetsuok/arowpp","description":"AROW++ An implementation of the efficient confidence-weighted classifier","long_description":"arowpp (AROW++) is an simple and efficient implementation of Adaptive Regularization of Weights online learning algorithm for binary classification. AROW is efficient for learning tasks such as natural language processing tasks that the data is high-dimensional, extremely sparse. AROW is an extension of confidence weighted (CW) algorithm that can achieve the good performance with a few iterations.","active":true,"categories":["textproc","math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["bazel","clang-18"]}],"depends_on":[]}]}