libboxes

Introduction

This is a collection of C++ containers that I find useful in my day-to-day work. Data structures are implemented in a way that is easy to understand and use. There are no optimizations for performance or for any specific use case.

Containers

Please, refer to examples for basic usage and more information.

• boxes::cache::Cache
  • An implementation of a Cache with LRU/MRU and LFU eviction policies.
  • Example: simple_lru_example.cpp
  • Header: cache.hpp
• boxes::LinkedVector
  • A vector that is implemented as a linked list of fixed-size chunks. This allows for efficient insertion and deletion at the front and back of the vector.
  • Example: linked_vector_example.cpp
  • Header: linked_vector.hpp
• boxes::RingBuffer
  • A fixed-size ring buffer allowing for efficient insertion and deletion at both ends.
  • Example: ring_buffer_example.cpp
  • Header: ring_buffer.hpp
• boxes::filter::bloom::Bloom
  • A generic bloom filter implementation.
  • Example: bloom_filter_example.cpp
  • Header: bloom_filter.hpp