compact-calendar 1.1.5

Compact representation of a set of days based on a bit-maps
Documentation 
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

Compact representation for a calendar
=====================================

[![](https://img.shields.io/crates/v/compact-calendar)][compact-calendar]
[![](https://img.shields.io/docsrs/compact-calendar)][docs]

This modules basically builds a data-structure for a set of days based on
bit-maps. This is built to store a collection of regional holidays for the
[opening-hours] crate.


Data layout
-----------

Here is how serialized data is represented:

```text
 start   size       year 1          year 2      ...
┌──────┬──────┬───────────────┬───────────────┬────
│  8B  │  8B  │ 8B * 12 = 96B │ 8B * 12 = 96B │ ...
└──────┴──────┴───────────────┴───────────────┴────
```

Each year is just an array of 12 `u32` where the least significant bits each
represent a day.

While a bitset might not be the most efficient way to store a collection of
dates for sparse data, this approached proved to be very compact when combined
with a Zlib encoder. This methods allowed to store all holidays from 2000 to
2100 as described by [workalendar] in only 60kb of data.


[opening-hours]: https://crates.io/crates/opening-hours
    "Root Package"

[compact-calendar]: https://crates.io/crates/compact-calendar
    "Root Package"

[docs]: https://docs.rs/compact-calendar
    "Documentation"

[workalendar]: https://github.com/workalendar/workalendar
    "Workalendar Python Package"