re2c 2.2-1 source package in Ubuntu
Changelog
re2c (2.2-1) unstable; urgency=medium
* New upstream release.
* Change maintainer to my debian.org email address.
* Bump Standards-Version to 4.6.0 (from 4.5.1; no further changes).
* Rules: add override for dh_auto_test to ensure Python
multiprocessing.Pool() is supported, and otherwise skip the
testsuite.
* Tests: upstream switched testsuite to Python3, adjust the
autopkgtest accordingly.
* Control: build-depend on python3 for the upstream testsuite.
-- Jeroen Ploemen <email address hidden> Thu, 19 Aug 2021 10:17:21 +0000
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| re2c_2.2-1.dsc | 1.9 KiB | f6354dbb6570479a5c86e937630eeb80ed5b7ec05f46ba7dba5ec8fffd73fe99 |
| re2c_2.2.orig.tar.xz | 1.4 MiB | 0fc45e4130a8a555d68e230d1795de0216dfe99096b61b28e67c86dfd7d86bda |
| re2c_2.2-1.debian.tar.xz | 9.1 KiB | 48f729715c4f22c958ecf8e45add3d9b467c4993ad8e5b40edd5bf03f4ba09c0 |
Available diffs
- diff from 2.0.3-1build1 (in Ubuntu) to 2.2-1 (621.9 KiB)
No changes file available.
Binary packages built by this source
- re2c: lexer generator for C, C++, Go and Rust
re2c's main goal is generating fast lexers: at least as fast as
their reasonably optimized hand-coded counterparts. Instead of using
a traditional table-driven approach, re2c encodes the generated
finite state automata directly in the form of conditional jumps and
comparisons. The resulting programs are faster and often smaller
than their table-driven analogues, and they are much easier to debug
and understand. Quite a few optimizations are applied in order to
speed up and compress the generated code.
.
Another distinctive feature is its flexible interface: instead of
assuming a fixed program template, re2c lets the programmer write
most of the interface code and adapt the generated lexer to any
particular environment.
- re2c-dbgsym: debug symbols for re2c
