hset
Sets of Numbers Implemented with Hash Tables
Implementation of S4 class of sets and multisets of numbers. The implementation is based on the hash table from the package 'hash'. Quick operations are allowed when the set is a dynamic object. The implementation is discussed in detail in Ceoldo and Wit (2023) <arXiv:2304.09809>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.1 |
rolling source/ R- | hset_0.1.1.tar.gz |
7.9 KiB |
0.1.1 |
rolling linux/jammy R-4.5 | hset_0.1.1.tar.gz |
181.6 KiB |
0.1.1 |
rolling linux/noble R-4.5 | hset_0.1.1.tar.gz |
181.2 KiB |
0.1.1 |
latest source/ R- | hset_0.1.1.tar.gz |
7.9 KiB |
0.1.1 |
latest linux/jammy R-4.5 | hset_0.1.1.tar.gz |
181.6 KiB |
0.1.1 |
latest linux/noble R-4.5 | hset_0.1.1.tar.gz |
181.2 KiB |
0.1.1 |
2026-04-26 source/ R- | hset_0.1.1.tar.gz |
7.9 KiB |
0.1.1 |
2026-04-23 source/ R- | hset_0.1.1.tar.gz |
7.9 KiB |
0.1.1 |
2026-04-09 windows/windows R-4.5 | hset_0.1.1.zip |
183.5 KiB |
0.1.1 |
2025-04-20 source/ R- | hset_0.1.1.tar.gz |
7.9 KiB |