Data Structures

Collection of arbitrary data structures implemented in C++.

Circular Buffer
- A dynamically resizing array that allows for efficient insertion and deletion of elements at both ends
- Allows for O(1) random access
Caching Allocator
- An abstraction useful for frequent new/delete operations on some type
- We still call the constructor and destructor of the type but cache the allocated memory
Deque
- A double-ended queue that allows for efficient insertion and deletion of elements at both ends
- Allows for O(1) random access
- Prevents iterator invalidation by storing elements in allocated fixed length arrays that never move
- Internally relies on a circular buffer to store pointers to the fixed length arrays that are dynamically allocated and managed by a caching allocator
TestingTracker
- A utility class to track the number of times a class has objects constructed and destructed

To do (deque):

To do (General):

Name		Name	Last commit message	Last commit date
Latest commit History 8 Commits
.idea		.idea
build		build
CMakeLists.txt		CMakeLists.txt
CachingAllocator.h		CachingAllocator.h
CircularBuffer.h		CircularBuffer.h
Deque.h		Deque.h
README.md		README.md
TestingTracker.cpp		TestingTracker.cpp
TestingTracker.h		TestingTracker.h
Vector.h		Vector.h
conan_provider.cmake		conan_provider.cmake
conandata.yml		conandata.yml
conanfile.py		conanfile.py
main.cpp		main.cpp
test_circular_buffer.cpp		test_circular_buffer.cpp
test_deque.cpp		test_deque.cpp
test_vector.cpp		test_vector.cpp

Navigation Menu