blob: 40c58975d89274ab8fe17b3792cb239aea5e56c0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
Source: frozen
Section: libs
Priority: optional
Maintainer: Progress Linux Maintainers <maintainers@lists.progress-linux.org>
XSBC-Uploaders: Daniel Baumann <daniel.baumann@progress-linux.org>
XSBC-Original-Maintainer: Rene Engelhard <rene@debian.org>
Bugs: mailto:maintainers@lists.progress-linux.org
Rules-Requires-Root: no
Build-Depends:
debhelper-compat (= 13),
cmake,
Standards-Version: 4.6.2
Homepage: https://github.com/serge-sans-paille/frozen
Vcs-Browser: https://git.progress-linux.org/packages/graograman-backports/frozen
Vcs-Git: https://git.progress-linux.org/packages/graograman-backports/frozen
Package: libfrozen-dev
Section: libdevel
Architecture: all
Depends:
${misc:Depends},
Description: library for immutable and fixed-size containers
Header-only library that provides 0 cost initialization for immutable
containers, fixed-size containers, and various algorithms.
.
Frozen provides:
.
- immutable (a.k.a. frozen), constexpr-compatible versions of std::set,
std::unordered_set, std::map and std::unordered_map.
- fixed-capacity, constinit-compatible versions of std::map and
std::unordered_map with immutable, compile-time selected keys mapped to
mutable values.
- 0-cost initialization version of std::search for frozen needles using
Boyer-Moore or Knuth-Morris-Pratt algorithms.
.
The unordered_* containers are guaranteed perfect (a.k.a. no hash collision)
and the extra storage is linear with respect to the number of keys.
.
Once initialized, the container keys cannot be updated, and in exchange,
lookups are faster.
.
This package contains the necessary headers.
|
