Crate intset

This crate provides a collection of data structures for storing sets of integers. The different data structures are designed to make different operations efficient.

All of the data structures in this crate support the following operations with the associated complexity:

• contains - check if an integer is in the set in O(1) time
• iterate - iterate over the members of the set in O(n) time, where n is the number of elements in the set
• len - return the number of elements in the set in O(1) time

Individual set data structures support additional operations, as documented below.

All of the set data structures in this crate have a maximum capacity, specified as the largest integer that can be stored in the set plus one. Once a set is created, it does no further allocations.

Structs

GrowSet

A GrowSet is a set of integers that supports efficient addition and clearing.

ShrinkSet

A ShrinkSet is a set of integers that supports efficient removal and refilling.