|
Related articles:
Data structure
Key terms: buffer bytes count read ring write svg pointers offset void address circular buffer keep elements status empty prot variables indices mmap exceptional condition struct ring fill count computing wrap descriptor modulo thread unsigned long disadvantage void ring advantages overwriting one byte overwritten two elements full buffer buffer is empty write counts both pointers if the buffer implementation additional variable number of items use a fill count underlying buffer unsigned long count pointing at the same same circular buffer Search external links cited by footnotes on Wikipedia page Circular buffer: |
|