Age | Commit message (Collapse) | Author | Files | Lines | |
---|---|---|---|---|---|
2019-11-02 | math: align variable assignments | rillig | 1 | -2/+2 | |
pkglint -Wall -F --only aligned -r Manual correction in R/Makefile.extension for the MASTER_SITES continuation line. | |||||
2018-07-18 | Mark packages that require C++03 (or the GNU variants) if they fail with | joerg | 1 | -2/+2 | |
C++14 default language. | |||||
2015-11-03 | Add SHA512 digests for distfiles for math category | agc | 1 | -1/+2 | |
Problems found locating distfiles: Package dfftpack: missing distfile dfftpack-20001209.tar.gz Package eispack: missing distfile eispack-20001130.tar.gz Package fftpack: missing distfile fftpack-20001130.tar.gz Package linpack: missing distfile linpack-20010510.tar.gz Package minpack: missing distfile minpack-20001130.tar.gz Package odepack: missing distfile odepack-20001130.tar.gz Package py-networkx: missing distfile networkx-1.10.tar.gz Package py-sympy: missing distfile sympy-0.7.6.1.tar.gz Package quadpack: missing distfile quadpack-20001130.tar.gz Otherwise, existing SHA1 digests verified and found to be the same on the machine holding the existing distfiles (morden). All existing SHA1 digests retained for now as an audit trail. | |||||
2014-12-26 | Update MASTER_SITES, it was 'Server not found' status. | mef | 1 | -2/+2 | |
2013-05-06 | Prefer C++11 interfaces over tr1. | joerg | 16 | -37/+328 | |
2012-09-11 | "user-destdir" is default these days | asau | 1 | -3/+1 | |
2012-07-03 | Fix template usage. | joerg | 12 | -1/+527 | |
2009-11-03 | Initial import of openfst-1.1 from pkgsrc-wip, packaged by Pierre | wiz | 4 | -0/+161 | |
Allegraud. OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight. The more familiar finite-state acceptor is represented as a transducer with each transition's input and output label equal. Finite-state acceptors are used to represent sets of strings (specifically, regular or rational sets); finite-state transducers are used to represent binary relations between pairs of strings (specifically, rational transductions). The weights can be used to represent the cost of taking a particular transition. This library was developed by contributors from Google Research and NYU's Courant Institute. It is intended to be comprehensive, flexible, efficient and scale well to large problems. it has been extensively tested. It is an open source project distributed under the Apache license. |