libcrcutil 1.0-5.2 source package in Ubuntu

Changelog

libcrcutil (1.0-5.2) unstable; urgency=medium

  * Non-maintainer upload.
  * Fix "dpkg-buildpackage -b" builds. (Closes: #952326)

 -- Adrian Bunk <email address hidden>  Sat, 16 May 2020 21:14:43 +0300

Upload details

Uploaded by:
Dmitry Smirnov
Uploaded to:
Sid
Original maintainer:
Dmitry Smirnov
Architectures:
any-alpha any-amd64 any-arm any-arm64 any-i386 any-ia64 any-mipsel any-mips64el any-ppc64el any-riscv64 any-sh4 any-x32 all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release universe misc
Lunar release universe misc
Jammy release universe misc

Downloads

File Size SHA-256 Checksum
libcrcutil_1.0-5.2.dsc 2.3 KiB 71e1adf84aad4dd562177128834491a6ca21f706b7c52e4fb712304096b6e9d1
libcrcutil_1.0.orig.tar.gz 1.9 MiB 87f0448c235d195c8df2a834ec7c24613f62878500468ff3aeb2dab2b10ffcf1
libcrcutil_1.0-5.2.debian.tar.xz 7.8 KiB b7140d74f387bae239e433899b8cd8eec3a3c3fd42f7ee264726bb029bd17f25

Available diffs

No changes file available.

Binary packages built by this source

libcrcutil-dev: library for cyclic redundancy check (CRC) computation - development files

 Crcutil library provides efficient implementation of CRC algorithms. It
 includes reference implementation of a novel Multiword CRC algorithm
 invented by Andrew Kadatch and Bob Jenkins in early 2007. The new
 algorithm is heavily tuned towards modern Intel and AMD processors and is
 substantially faster than almost all other software CRC algorithms.
 .
 Included whitepaper describes the details of Multiword CRC algorithm as
 well as other algorithms and CRC manipulation routines implemented by
 crcutil library.
 .
 Crcutil library computes:
  * Hardware-assisted CRC32C: 0.13 (Nehalem) CPU cycles per byte.
  * 64-bit and smaller CRCs: 1.0 (Nehalem) - 1.2 (Core) CPU cycles per byte.
  * 128-bit CRCs: 1.7 CPU cycles per byte.
 .
 Since computational speed of 64-bit CRCs is identical to 32-bit and
 16-bit, the use of crcutil library enables widespread use of more reliable
 64-bit CRCs instead of 32-bit ones.
 .
 As a bonus, crcutil also implements a number of useful CRC "tricks" (e.g.
 computation of CRC of concatenated blocks of data of known length and CRC
 without touching actual data).
 .
 This package provides development files.

libcrcutil-doc: No summary available for libcrcutil-doc in ubuntu groovy.

No description available for libcrcutil-doc in ubuntu groovy.

libcrcutil0: library for cyclic redundancy check (CRC) computation

 Crcutil library provides efficient implementation of CRC algorithms. It
 includes reference implementation of a novel Multiword CRC algorithm
 invented by Andrew Kadatch and Bob Jenkins in early 2007. The new
 algorithm is heavily tuned towards modern Intel and AMD processors and is
 substantially faster than almost all other software CRC algorithms.
 .
 Included whitepaper describes the details of Multiword CRC algorithm as
 well as other algorithms and CRC manipulation routines implemented by
 crcutil library.
 .
 Crcutil library computes:
  * Hardware-assisted CRC32C: 0.13 (Nehalem) CPU cycles per byte.
  * 64-bit and smaller CRCs: 1.0 (Nehalem) - 1.2 (Core) CPU cycles per byte.
  * 128-bit CRCs: 1.7 CPU cycles per byte.
 .
 Since computational speed of 64-bit CRCs is identical to 32-bit and
 16-bit, the use of crcutil library enables widespread use of more reliable
 64-bit CRCs instead of 32-bit ones.
 .
 As a bonus, crcutil also implements a number of useful CRC "tricks" (e.g.
 computation of CRC of concatenated blocks of data of known length and CRC
 without touching actual data).

libcrcutil0-dbgsym: No summary available for libcrcutil0-dbgsym in ubuntu groovy.

No description available for libcrcutil0-dbgsym in ubuntu groovy.