Imagelibrary/Containers
1
0
Fork 0
mirror of https://github.com/bkthomps/Containers.git synced 2025-12-05 15:15:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Improve spacing

Browse Source
This commit is contained in:
Bailey Thompson
2017-11-26 00:23:40 -05:00
committed by GitHub
parent d212bb959f
commit 8122d35e78
1 changed files with 16 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
README.md
View File

@@ -5,28 +5,28 @@ Inspired by the C++ STL. Implementation of the STL data structures using C; howe
# Sequence containers # Sequence containers
Data structures which can be accessed sequentially. Data structures which can be accessed sequentially.
array (todo) - static contiguous array <p> array (todo) - static contiguous array
vector - dynamic contiguous array <p> vector - dynamic contiguous array
deque - double-ended queue <p> deque - double-ended queue
forward_list - singly-linked list <p> forward_list - singly-linked list
list - doubly-linked list <p> list - doubly-linked list
# Associative containers # Associative containers
Data structures that can be quickly searched which use comparators. Data structures that can be quickly searched which use comparators.
set (todo) - collection of unique keys, sorted by keys <p> set (todo) - collection of unique keys, sorted by keys
map (todo) - collection of key-value pairs, sorted by keys, keys are unique <p> map (todo) - collection of key-value pairs, sorted by keys, keys are unique
multiset (todo) - collection of keys, sorted by keys <p> multiset (todo) - collection of keys, sorted by keys
multimap (todo) - collection of key-value pairs, sorted by keys <p> multimap (todo) - collection of key-value pairs, sorted by keys
# Unordered associative containers # Unordered associative containers
Data structures that can be quickly searched which use hashing. Data structures that can be quickly searched which use hashing.
unordered_set (todo) - collection of unique keys, hashed by keys <p> unordered_set (todo) - collection of unique keys, hashed by keys
unordered_map (todo) - collection of key-value pairs, hashed by keys, keys are unique <p> unordered_map (todo) - collection of key-value pairs, hashed by keys, keys are unique
unordered_multiset (todo) - collection of keys, hashed by keys <p> unordered_multiset (todo) - collection of keys, hashed by keys
unordered_multimap (todo) - collection of key-value pairs, hashed by keys <p> unordered_multimap (todo) - collection of key-value pairs, hashed by keys
# Container adaptors # Container adaptors
Data structures which adapt other containers to enhance functionality. Data structures which adapt other containers to enhance functionality.
stack - adapts a container to provide stack (last-in first-out) <p> stack - adapts a container to provide stack (last-in first-out)
queue - adapts a container to provide queue (first-in first-out) <p> queue - adapts a container to provide queue (first-in first-out)
priority_queue (todo) - adapts a container to provide priority queue <p> priority_queue (todo) - adapts a container to provide priority queue