2025-02-09 07:36:00 +01:00
|
|
|
Source: ck
|
|
|
|
Section: libs
|
|
|
|
Priority: optional
|
|
|
|
Maintainer: Daniel Baumann <daniel.baumann@progress-linux.org>
|
2025-02-09 07:39:36 +01:00
|
|
|
Build-Depends:
|
|
|
|
debhelper-compat (= 13),
|
2025-02-09 07:39:33 +01:00
|
|
|
Rules-Requires-Root: no
|
2025-02-09 07:42:55 +01:00
|
|
|
Standards-Version: 4.6.2
|
2025-02-09 07:39:33 +01:00
|
|
|
Homepage: http://concurrencykit.org
|
2025-02-09 07:36:00 +01:00
|
|
|
Vcs-Browser: https://git.progress-linux.org/users/daniel.baumann/debian/packages/ck
|
|
|
|
Vcs-Git: https://git.progress-linux.org/users/daniel.baumann/debian/packages/ck
|
|
|
|
|
2025-02-09 07:39:36 +01:00
|
|
|
Package: libck-dev
|
|
|
|
Section: libdevel
|
2025-02-09 07:40:02 +01:00
|
|
|
Architecture: linux-any
|
2025-02-09 07:39:36 +01:00
|
|
|
Multi-Arch: same
|
|
|
|
Depends:
|
2025-02-09 07:47:07 +01:00
|
|
|
libck0t64 (= ${binary:Version}),
|
2025-02-09 07:39:36 +01:00
|
|
|
${misc:Depends},
|
|
|
|
${shlibs:Depends},
|
|
|
|
Description: Concurrency Kit (development)
|
2025-02-09 07:39:34 +01:00
|
|
|
The Concurrency Kit library implements concurrency primitives, safe memory
|
|
|
|
reclamation mechanisms and non-blocking data structures for the research,
|
2025-02-09 07:36:00 +01:00
|
|
|
design and implementation of high performance concurrent systems.
|
2025-02-09 07:39:34 +01:00
|
|
|
.
|
2025-02-09 07:39:36 +01:00
|
|
|
This package contains the development files.
|
2025-02-09 07:36:00 +01:00
|
|
|
|
2025-02-09 07:47:07 +01:00
|
|
|
Package: libck0t64
|
|
|
|
Provides: ${t64:Provides}
|
|
|
|
Replaces: libck0
|
|
|
|
Breaks: libck0 (<< ${source:Version})
|
2025-02-09 07:39:36 +01:00
|
|
|
Section: libs
|
2025-02-09 07:40:02 +01:00
|
|
|
Architecture: linux-any
|
2025-02-09 07:39:36 +01:00
|
|
|
Pre-Depends:
|
|
|
|
${misc:Pre-Depends},
|
|
|
|
Depends:
|
|
|
|
${misc:Depends},
|
|
|
|
${shlibs:Depends},
|
|
|
|
Description: Concurrency Kit (library)
|
2025-02-09 07:39:34 +01:00
|
|
|
The Concurrency Kit library implements concurrency primitives, safe memory
|
|
|
|
reclamation mechanisms and non-blocking data structures for the research,
|
2025-02-09 07:36:00 +01:00
|
|
|
design and implementation of high performance concurrent systems.
|
|
|
|
.
|
2025-02-09 07:39:36 +01:00
|
|
|
It features atomic operations, hardware transactional memory, memory barriers,
|
|
|
|
hash tables, list, ring, stack, fifo, bitmap, safe memory reclamation,
|
|
|
|
scalable locks, execution barriers, asymmetric synchronization and more.
|