Skip to content

Ring buffer is a data structure which is cache-friendly implementation of queues. Without using any data structure which has a dynamic storage size such as Lists , you can enqueue , dequeue elements with this data structure.For more information about this data structure you can go to: https://gameprogrammingpatterns.com/event-queue.html

License

Notifications You must be signed in to change notification settings

csharp-craftsman/csharp-ringbuffer-example

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 

Repository files navigation

csharp-ringbuffer-example

Ring buffer is a data structure which is cache-friendly implementation of queues. Without using any data structure which has a dynamic storage size such as Lists , you can enqueue , dequeue elements with this data structure.For more information about this data structure you can go to: https://gameprogrammingpatterns.com/event-queue.html

About

Ring buffer is a data structure which is cache-friendly implementation of queues. Without using any data structure which has a dynamic storage size such as Lists , you can enqueue , dequeue elements with this data structure.For more information about this data structure you can go to: https://gameprogrammingpatterns.com/event-queue.html

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages