A high-speed character set detection library.
libguess employs discrete-finite automata to deduce the character set
of the input buffer. The advantage of this is that all character sets
can be checked in parallel, and quickly. Right now, libguess passes a
byte to each DFA on the same pass, meaning that the winning character
set can be deduced as efficiently as possible.
libguess is fully reentrant, using only local stack memory for DFA operations.
WWW: http://www.atheme.org/project/libguess
Remove expired ports:
Adjusted for ports rescued since r534032
2020-05-05 audio/festvox-czech: Broken for more than 6 months
2020-05-05 audio/gkrellmvolume2: Broken for more than 6 months
2020-05-05 audio/mixmos: Broken for more than 6 months
2020-05-05 audio/mma: Broken for more than 6 months
2020-05-05 audio/pd-cyclone: Broken for more than 6 months
2020-05-05 audio/shorten: Broken for more than 6 months
2020-05-05 audio/taglib-sharp: Broken for more than 6 months
2020-05-05 audio/xhippo: Broken for more than 6 months
2020-05-05 biology/consed: Broken for more than 6 months
2020-05-05 biology/plinkseq: Broken for more than 6 months
2020-05-05 biology/seqtools: Broken for more than 6 months
(Only the first 15 lines of the commit message are shown above )
Use USES=pathfix where applicable.
PR: 213195
Submitted by: mat
Exp-run by: antoine
Sponsored by: Absolight
Differential Revision: https://reviews.freebsd.org/D8093
A high-speed character set detection library.
libguess employs discrete-finite automata to deduce the character set of
the input buffer. The advantage of this is that all character sets can
be checked in parallel, and quickly. Right now, libguess passes a byte
to each DFA on the same pass, meaning that the winning character set can
be deduced as efficiently as possible.
libguess is fully reentrant, using only local stack memory for DFA operations.
WWW: http://www.atheme.org/project/libguess
PR: ports/167686
Submitted by: William Grzybowski <william88@gmail.com>
