non port: math/openfst/pkg-plist |
Number of commits found: 15 |
Saturday, 16 Dec 2023
|
02:57 Yuri Victorovich (yuri)
math/openfst: update 1.8.1 → 1.8.2-20221207
PR: 275786
d3fbfd7 |
Tuesday, 24 Aug 2021
|
07:09 Vanilla I. Shu (vanilla)
math/openfst: revive ports, also update to 1.8.1.
Reported by: kevlo@
4bd6f68 |
Sunday, 26 Jul 2020
|
11:44 demon
Update to version 1.7.9
|
Monday, 25 Sep 2017
|
10:20 demon
Update to version 1.6.3.
|
Thursday, 25 Aug 2016
|
13:07 demon
Update to version 1.5.4.
|
Saturday, 20 Aug 2016
|
11:45 demon
Update to version 1.5.3.
|
Wednesday, 17 Feb 2016
|
15:06 demon
Update to version 1.5.1.
|
Saturday, 30 Jan 2016
|
13:47 demon
Update to version 1.5.0.
|
Monday, 20 Oct 2014
|
14:28 demon
Use correct directory for USE_LDCONFIG;
Remove obsoleted @dirrm's.
|
Friday, 4 Jul 2014
|
08:02 amdmi3
- Switch to USES=libtool, drop .la files
- Fix build on 9.x: requires unordered_map, thus c++11-lib
Approved by: portmgr blanket
|
Wednesday, 30 Apr 2014
|
13:06 demon
Update to 1.4.1.
|
Saturday, 26 Apr 2014
|
16:07 demon
Fix plist.
|
15:59 demon
Update to version 1.4.0.
|
Monday, 30 Dec 2013
|
20:55 ohauer
- rename AL2 to APACHE20 in Mk/bsd.licenses.db.mk
- svn move Templates/Licenses/AL2 Templates/Licenses/APACHE20
- add APACHE10 and APACHE11 to Mk/bsd.licenses.db.mk
- add entry in UPDATING
- bulk change all ports AL2 => APACHE20
- math/openfst/pkg-plist: remove share/licenses/openfst-1.3.4
PR: ports/184785
Submitted by: ohauer
Reviewed by: tabthorpe
Approved by: portmgr (tabthorpe@)
|
Thursday, 26 Dec 2013
|
16:13 demon
New port : openfst.
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.
|
Number of commits found: 15 |