{"count":51961,"next":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-updated_at&page=570","previous":"https://ports.macports.org/api/v1/ports/?format=json&ordering=-updated_at&page=568","results":[{"name":"fxt","portdir":"math/fxt","version":"2026.01.31","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.jjj.de/fxt/","description":"Library of low-level algorithms","long_description":"Library of low-level algorithms","active":true,"categories":["science","math"],"maintainers":[],"variants":[],"dependencies":[{"type":"build","ports":["gcc13"]},{"type":"lib","ports":["libgcc","libgcc13"]}],"depends_on":[]},{"name":"fricas","portdir":"math/fricas","version":"1.3.13","license":"BSD","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://fricas.sourceforge.net/","description":"The Fricas computer algebra system","long_description":"FriCAS is a computer algebra system. FriCAS is a fork of Axiom. The basic goal of FriCAS is to create a free advanced world-class CAS. FriCAS builds on the Axiom codebase. The FriCAS algebra library is one of the largest and most advanced free general purpose computer algebra systems -- this gives a good foundation to build on. Additionally, the FriCAS algebra library is written in a high level strongly typed language (Spad), which allows natural expression of mathematical algorithms. This makes FriCAS easier to understand and extend.","active":true,"categories":["math"],"maintainers":[{"name":"pieter","github":"pietvo","ports_count":3}],"variants":["x11","hunchentoot","sbcl","ccl","ecl","gmp"],"dependencies":[{"type":"build","ports":["clang-18"]},{"type":"lib","ports":["sbcl","xorg-libX11","xorg-libice","xorg-libsm","xpm"]}],"depends_on":[{"type":"run","ports":["py37-jfricas","py38-jfricas","py39-jfricas","py310-jfricas","py311-jfricas"]}]},{"name":"fplll","portdir":"math/fplll","version":"5.5.0","license":"LGPL-2.1","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/fplll/fplll","description":"Lattice algorithms using floating-point arithmetic","long_description":"fplll contains implementations of several lattice algorithms. The implementation relies on floating-point orthogonalization, and LLLis central to the code, hence the name.","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["automake","pkgconfig","clang-18","autoconf","libtool"]},{"type":"lib","ports":["mpfr","gmp"]}],"depends_on":[{"type":"lib","ports":["cmh","sollya"]}]},{"name":"flint","portdir":"math/flint","version":"3.1.3-p1","license":"LGPL-2.1+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.flintlib.org","description":"Fast Library for Number Theory","long_description":"FLINT is a C library for doing number theory","active":true,"categories":["devel","math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["universal"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18"]},{"type":"lib","ports":["mpfr","ntl","gmp"]}],"depends_on":[{"type":"lib","ports":["py39-gyoto","symengine","normaliz","polymake","singular","Gyoto","py310-gyoto","py311-gyoto","py312-gyoto","py313-gyoto","py314-gyoto"]}]},{"name":"flexiblas","portdir":"math/flexiblas","version":"3.4.5","license":"GPL-3+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.mpi-magdeburg.mpg.de/projects/flexiblas","description":"A BLAS and LAPACK wrapper library with runtime exchangeable backends","long_description":"A BLAS and LAPACK wrapper library with runtime exchangeable backends","active":true,"categories":["science","math"],"maintainers":[],"variants":["debug","clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","atlas","universal"],"dependencies":[{"type":"build","ports":["cmake","clang-18","gcc15"]},{"type":"lib","ports":["blis","libgcc","libomp","OpenBLAS"]},{"type":"test","ports":["python313"]}],"depends_on":[{"type":"run","ports":["R-flexiblas"]}]},{"name":"finufft","portdir":"math/finufft","version":"2.1.0","license":"Apache-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/flatironinstitute/finufft","description":"Flatiron Institute Non-uniform Fast Fourier Transform library, FINUFFT","long_description":"This is a lightweight CPU library to compute the three standard types of non-uniform FFT to a specified precision, in one, two or three dimensions.","active":true,"categories":["science","math"],"maintainers":[],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","universal"],"dependencies":[{"type":"build","ports":["pkgconfig","clang-20","gcc15"]},{"type":"lib","ports":["libgcc","fftw-3-single","libomp","fftw-3"]}],"depends_on":[]},{"name":"fityk","portdir":"math/fityk","version":"1.3.2","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://fityk.nieto.pl","description":"fityk is for peak fitting.","long_description":"fityk is a program for nonlinear fitting of analytical functions (especially peak-shaped) to data (usually experimental data). There are also people using it to remove the baseline from data, or to display data only.","active":true,"categories":["math"],"maintainers":[],"variants":["docs","universal"],"dependencies":[{"type":"build","ports":["clang-18","autoconf","automake","libtool","swig-lua","makeicns"]},{"type":"lib","ports":["boost176","zlib","python311","ncurses","readline","wxWidgets-3.0","lua","xylib"]},{"type":"run","ports":["gnuplot"]}],"depends_on":[]},{"name":"fgsl","portdir":"math/fgsl","version":"1.6.0","license":"GPL-2","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://doku.lrz.de/fgsl-a-fortran-interface-to-the-gnu-scientific-library-10746505.html","description":"Fortran interface to the GNU scientific library","long_description":"A portable, object-based Fortran interface to the GNU scientific library (GSL), a collection of numerical routines for scientific computing. Version 1.6.x is for use with GSL versions >= 2.7. Source: https://github.com/reinh-bader/fgsl","active":true,"categories":["science","math"],"maintainers":[{"name":"takeshi","github":"tenomoto","ports_count":54},{"name":"dave.allured","github":"Dave-Allured","ports_count":10}],"variants":["gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel"],"dependencies":[{"type":"build","ports":["gcc15","pkgconfig","clang-18","autoconf","automake","libtool"]},{"type":"lib","ports":["gsl","libgcc"]}],"depends_on":[]},{"name":"fftw-3-long","portdir":"math/fftw-3","version":"3.3.10","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.fftw.org/","description":"Fast C routines to compute the Discrete Fourier Transform","long_description":"FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. This port is of fftw version 3.x. It has many improvements relative to 2.x, but is not backwardly compatible.","active":true,"categories":["math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","openmp","threads","pfft_patches","mpich","openmpi","universal"],"dependencies":[{"type":"build","ports":["clang-18","gcc15"]},{"type":"lib","ports":["libgcc","fftw-3"]}],"depends_on":[{"type":"lib","ports":["p5.26-pdl-fftw3","py27-pyfftw","py35-pyfftw","py36-pyfftw","py39-pyfftw","py37-pyfftw","py27-pyfftw3","py38-pyfftw","py310-pyfftw"]}]},{"name":"fftw-3-single","portdir":"math/fftw-3","version":"3.3.10","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.fftw.org/","description":"Fast C routines to compute the Discrete Fourier Transform","long_description":"FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. This port is of fftw version 3.x. It has many improvements relative to 2.x, but is not backwardly compatible.","active":true,"categories":["math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","openmp","threads","pfft_patches","mpich","openmpi","universal"],"dependencies":[{"type":"build","ports":["clang-18","gcc15"]},{"type":"lib","ports":["libgcc","fftw-3"]}],"depends_on":[{"type":"lib","ports":["yorick-yao","p5.26-pdl-fftw3","relax3d","scamp","skymaker","source-extractor","gnuradio-devel","py27-lalpulsar","py36-lalpulsar","py36-isce2","py27-pyfftw","py35-pyfftw","py36-pyfftw","py37-lalpulsar","py39-pyfftw","py37-isce2","py38-lalpulsar","py37-pyfftw","aubio","py27-pyfftw3","SDRangel","py38-pyfftw","luminance-hdr","aacplusenc","audiowmark","liblastfm","liblastfm-qt5","nrsc5","pulseaudio","xmms2","InsightToolkit","InsightToolkit4","py310-InsightToolkit","py311-InsightToolkit","py312-InsightToolkit","py313-InsightToolkit","py310-InsightToolkit4","py311-InsightToolkit4","py312-InsightToolkit4","py313-InsightToolkit4","rawstudio","rawtherapee","vigra","finufft","gnudatalanguage","octave","lmms","mythtv-core.27","mythtv-core.28","shenidam","welle.io","welle.io-devel","p5.28-pdl-fftw3","p5.30-pdl-fftw3","p5.32-pdl-fftw3","p5.34-pdl-fftw3","py310-pyfftw","SDRPlusPlus","bart","dab-cmdline","gds","gnuradio","gnuradio37","gnuradio-next","gr-adapt","gr-air-modes","gr37-adapt","gr37-air-modes","gr-baz","gr37-ais","gr37-baz","gr-fcdproplus","gr37-cdma","gr37-fcdproplus","gr-foo","gr-fosphor","gr37-foo","gr37-fosphor","gr-gfdm","gr-gsm","gr37-gfdm","gr37-gsm","gr-hermeslite2","gr-hpsdr","gr-ieee802-11","gr-ieee802-15-4","gr37-ieee802-11","gr37-ieee802-15-4","gr-iio","gr-iqbalance","gr37-iio","gr37-iqbalance","gr-iridium","gr-limesdr","gr37-iridium","gr37-limesdr","gr-linrad","gr37-lora-BastilleResearch","gr37-lora-rpp0","gr-lora-rpp0","gr37-lte","gr37-mapper","gr37-mac","gr-osmosdr","gr37-ofdm","gr37-osmosdr","gr37-pcap","gr37-pyqt","gr-rds","gr-satellites","gr37-rds","gr37-satellites","gr37-sdrplay","gr-specest","gr37-specest","gr37-tdd","gromacs","gromacs-plumed","hackrf","hackrf-devel","imager","inspectrum","ismrmrd","lal","lalapps","lalpulsar","py312-lalpulsar","libosmo-dsp","liquid-dsp","psfex"]},{"type":"run","ports":["py36-gpilab-framework","py37-gpilab-framework","lscsoft-deps","py39-gpilab-framework","py38-gpilab-framework"]}]},{"name":"fftw-single","portdir":"math/fftw","version":"2.1.5","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.fftw.org/","description":"Fast C routines to compute the Discrete Fourier Transform","long_description":"FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification.","active":true,"categories":["devel","math"],"maintainers":[],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","mpich","openmpi"],"dependencies":[{"type":"build","ports":["automake","clang-18","gcc15","autoconf","libtool"]},{"type":"lib","ports":["fftw","libgcc"]}],"depends_on":[{"type":"lib","ports":["clipper","coot","coot-devel","orfeotoolbox","py310-orfeotoolbox","py311-orfeotoolbox","py312-orfeotoolbox","py313-orfeotoolbox","py314-orfeotoolbox"]}]},{"name":"fftw-3","portdir":"math/fftw-3","version":"3.3.10","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.fftw.org/","description":"Fast C routines to compute the Discrete Fourier Transform","long_description":"FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. This port is of fftw version 3.x. It has many improvements relative to 2.x, but is not backwardly compatible.","active":true,"categories":["math"],"maintainers":[{"name":"mcalhoun","github":"MarcusCalhoun-Lopez","ports_count":1599}],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","openmp","threads","pfft_patches","mpich","openmpi","universal"],"dependencies":[{"type":"build","ports":["clang-18","gcc15"]},{"type":"lib","ports":["libgcc"]}],"depends_on":[{"type":"lib","ports":["xcrysden","scamp","shtools","source-extractor","stimfit","wdsp","p5.26-pdl-fftw3","py27-lalpulsar","py36-lalpulsar","py36-isce2","py27-pyfftw","py35-pyfftw","py36-pyfftw","py37-gmic","py37-lalpulsar","py35-cvxopt","py36-cvxopt","mlt-qt5","py39-pyfftw","py37-isce2","py37-numpy","py38-numpy","py38-lalpulsar","cdo","gmic","gmic-qt","gmic-gimp","gmic-clib","gmic-lib","py37-pyfftw","grass","asymptote","py27-pyfftw3","py39-cvxopt","orfeotoolbox","py310-orfeotoolbox","py311-orfeotoolbox","py312-orfeotoolbox","py313-orfeotoolbox","py314-orfeotoolbox","py35-numpy","py36-numpy","py37-cvxopt","py27-cvxopt","py38-cvxopt","py38-gmic","py38-pyfftw","py39-gmic","pyxplot","R-KSgeneral","R-LOMAR","R-PoissonBinomial","R-PoissonMultinomial","R-Rssa","R-fftw","R-fftwtools","R-imager","R-poisbinom","R-qqconf","cava","libofa","olena","starpu","grass7","ImageMagick","ImageMagick7","InsightToolkit","InsightToolkit4","py310-InsightToolkit","py311-InsightToolkit","py312-InsightToolkit","py313-InsightToolkit","py310-InsightToolkit4","py311-InsightToolkit4","py312-InsightToolkit4","py313-InsightToolkit4","ale","blender","hugin-app","nip2","rawstudio","rawtherapee","vips","gnu-apl","lua54-numlua","lua53-numlua","lua52-numlua","lua51-numlua","fftw-3-single","fftw-3-long","finufft","gnudatalanguage","gretl","itpp","itpp-devel","nfft-3","octave","pfft","libmovit","mlt","mlt-legacy","mythtv-core.28","httping","p5.28-pdl-fftw3","p5.30-pdl-fftw3","p5.32-pdl-fftw3","p5.34-pdl-fftw3","denemo","pure-audio","py310-cvxopt","py311-cvxopt","py312-cvxopt","py313-cvxopt","py310-pyfftw","py27-numpy","LORENE","NanoVNA-QT","libxavna","bart","berkeleygw","crystfel","gds","gerris","gwyddion","indi","lal","lalapps","lalpulsar","py312-lalpulsar","linhpsdr","magicspp","nektarpp","octopus","openhantek","pihpsdr","plumed","plumed-devel","quantum-espresso","quisk"]},{"type":"run","ports":["py36-gpilab-framework","lscsoft-deps","py39-gpilab-framework","py37-gpilab-framework","py38-gpilab-framework","luaradio"]}]},{"name":"fftw","portdir":"math/fftw","version":"2.1.5","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"http://www.fftw.org/","description":"Fast C routines to compute the Discrete Fourier Transform","long_description":"FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification.","active":true,"categories":["devel","math"],"maintainers":[],"variants":["clang13","clang14","clang15","clang16","clang17","clang18","clang19","clang20","clang21","clang22","clangdevel","g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","gfortran","mpich","openmpi"],"dependencies":[{"type":"build","ports":["autoconf","automake","libtool","clang-18","gcc15"]},{"type":"lib","ports":["libgcc"]}],"depends_on":[{"type":"lib","ports":["fftw-single","yorick-yeti"]},{"type":"run","ports":["nrsc5"]}]},{"name":"fend","portdir":"math/fend","version":"1.5.8","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://printfn.github.io/fend","description":"Arbitrary-precision unit-aware calculator","long_description":"fend is an Arbitrary-precision unit-aware calculator. It features: Arbitrary-precision arithmetic using rational numbers, Full support for complex numbers, D&D-style dice rolls, Variables, Binary, octal, hexadecimal and all other bases between 2 and 36, The ability to keep track of units, with support for SI, US and UK customary and many historical units, Emacs-style CLI shortcuts, Trigonometric functions, and Lambda calculus","active":true,"categories":["math"],"maintainers":[{"name":"herby.gillot","github":"herbygillot","ports_count":1057}],"variants":["universal"],"dependencies":[{"type":"build","ports":["cargo","legacy-support","rust","clang-20"]},{"type":"lib","ports":["libunwind"]}],"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":["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":"expreduce","portdir":"math/expreduce","version":"0.5.1","license":"MIT","platforms":"darwin freebsd linux","epoch":0,"replaced_by":null,"homepage":"https://github.com/corywalker/expreduce","description":"An experimental computer algebra system written in Go","long_description":"Expreduce implements a language with specialized constructs for term rewriting. It is a neat language for a computer algebra system because it is able to express expression manipulation steps in a form very similar to standard math equations","active":true,"categories":["math"],"maintainers":[{"name":"herby.gillot","github":"herbygillot","ports_count":1057}],"variants":[],"dependencies":[{"type":"build","ports":["go","clang-18"]}],"depends_on":[]},{"name":"eva","portdir":"math/eva","version":"0.3.1","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/nerdypepper/eva","description":"a calculator REPL, similar to bc(1)","long_description":"a calculator REPL, similar to bc(1) with syntax highlighting and persistent history","active":true,"categories":["math"],"maintainers":[{"name":"herby.gillot","github":"herbygillot","ports_count":1057}],"variants":["universal"],"dependencies":[{"type":"build","ports":["cargo","legacy-support","rust","clang-20"]},{"type":"lib","ports":["libunwind"]}],"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":54}],"variants":["debug","tests"],"dependencies":[{"type":"build","ports":["cmake","clang-18"]},{"type":"lib","ports":["armadillo"]}],"depends_on":[{"type":"lib","ports":["mlpack"]}]},{"name":"eiscor","portdir":"math/eiscor","version":"0.2.0","license":"MIT","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://github.com/eiscor/eiscor","description":"eigensolvers based on unitary core transformations","long_description":"This package is a collection of Fortran 90 subroutines for accurately and efficiently solving matrix eigenvalue problems using essentially 2×2 unitary matrices.","active":true,"categories":["math","fortran"],"maintainers":[],"variants":["g95","gcc10","gcc11","gcc12","gcc13","gcc14","gcc15","gccdevel","universal"],"dependencies":[{"type":"build","ports":["clang-18","gcc15"]},{"type":"lib","ports":["libgcc"]}],"depends_on":[]},{"name":"eigenmath","portdir":"math/eigenmath","version":"350","license":"BSD","platforms":"darwin","epoch":1,"replaced_by":null,"homepage":"https://github.com/georgeweigt/eigenmath","description":"Symbolic math app","long_description":"Symbolic math app","active":true,"categories":["math"],"maintainers":[],"variants":["universal"],"dependencies":[{"type":"build","ports":["clang-18"]}],"depends_on":[]},{"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":["openbabel","py310-openbabel","py311-openbabel","py312-openbabel","py313-openbabel","py314-openbabel","py310-openbabel2","py311-openbabel2","py312-openbabel2","py39-openbabel","openscad","iqtree2","py39-gyoto","gnudatalanguage","openbabel2","avogadro","Gyoto","py310-gyoto","py311-gyoto","py312-gyoto","py313-gyoto","py314-gyoto","avogadrolibs","Pangolin","bali-phy","bali-phy-devel","iqtree","iqtree3","openscad-devel","py27-openbabel","py39-openbabel2"]},{"type":"lib","ports":["vtk","digikam","kdeartwork","kstars","FastAD","LBFGSpp","ceres-solver","dolfin","hiop","polysolve","shogun","shogun-devel","sympol","libmovit","mlt-legacy","py310-coolprop","py311-coolprop","py310-pytorch","py311-pytorch","py312-pytorch","py313-pytorch","py314-pytorch","ALPSMaxent","ALPSCore","NanoVNA-QT","libxavna","cantera","chemkit","cufflinks","fcl","gmsh","stellarium","LightGBM","finite-diff","tapkee","py27-milk","py38-pytorch","Sophus","rdkit","paraview","py38-coolprop","py39-pytorch","py39-coolprop","R-ChemmineOB","luminance-hdr","draco","freecad","manif","orocos-kdl","cgal4","cgal5","cgal6","libpcl","InsightToolkit","py310-InsightToolkit","py311-InsightToolkit","py312-InsightToolkit","py313-InsightToolkit","blender","libfive","nanogui-wjakob","tthresh","libcifpp","mutationpp","ompl","openscad","openscad-devel","py37-pytorch"]},{"type":"run","ports":["stanmath","cppoptlib","py38-gpilab-framework","py36-gpilab-framework","py39-gpilab-framework","py37-gpilab-framework"]}]},{"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":"ecgen","portdir":"math/ecgen","version":"0.7.7","license":"GPL-2+","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://neuromancer.sk/page/ecgen","description":"Tool for generating Elliptic curve domain parameters","long_description":"Tool for generating Elliptic curve domain parameters","active":true,"categories":["math"],"maintainers":[],"variants":["debug","universal"],"dependencies":[{"type":"build","ports":["argp-standalone","cmake","posix-macos-addons","clang-18"]},{"type":"lib","ports":["pari"]}],"depends_on":[]},{"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":"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":"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":[]}]}