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.
| Package Version | Update ID | Released | Package Hub Version | Platforms | Subpackages |
|---|---|---|---|---|---|
| 1.2-bp153.1.14 info | GA Release | 2021-03-06 | 15 SP3 |
|
|
| 1.2-bp152.3.18 info | GA Release | 2020-04-16 | 15 SP2 |
|
|
| 1.2-bp151.1.1 info | GA Release | 2019-07-17 | 15 SP1 |
|
|
| 1.2-bp150.1.2 info | GA Release | 2018-07-30 | 15 |
|
|
| 1.2-1.23 info | GA Release | 2018-05-25 | 15 SP5 Subpackages |
|
|