Based on the idea of First in First Out (FIFO) Queues, this Data structure is made up of a Queue of Queues. Upon adding elements to the queue, once it exceeds it's capacity, another Queue is allocated. All of these Queues are indexed by pointers in an outer circular Queue/Buffer, that only stores the data and circulates back around.
-
Notifications
You must be signed in to change notification settings - Fork 0
Based on the idea of First in First Out (FIFO) Queues, this Data structure is made up of a Queue of Queues. Upon adding elements to the queue, once it exceeds it's capacity, another Queue is allocated. All of these Queues are indexed by pointers in an outer circular Queue/Buffer, that only stores the data and circulates back around.
sean-custer/Circular-Buffer-of-Circular-Buffers
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Based on the idea of First in First Out (FIFO) Queues, this Data structure is made up of a Queue of Queues. Upon adding elements to the queue, once it exceeds it's capacity, another Queue is allocated. All of these Queues are indexed by pointers in an outer circular Queue/Buffer, that only stores the data and circulates back around.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published