ring.rs 1.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
  1. use std::collections::VecDeque;
  2. use std::ops::{Index, IndexMut};
  3. pub struct RingBuffer<T> {
  4. data: VecDeque<T>,
  5. // Abstract index of data[0] in infinitely sized queue
  6. offset: usize,
  7. }
  8. impl<T> RingBuffer<T> {
  9. pub fn new() -> Self {
  10. RingBuffer {
  11. data: VecDeque::new(),
  12. offset: 0,
  13. }
  14. }
  15. pub fn is_empty(&self) -> bool {
  16. self.data.is_empty()
  17. }
  18. pub fn len(&self) -> usize {
  19. self.data.len()
  20. }
  21. pub fn push(&mut self, value: T) -> usize {
  22. let index = self.offset + self.data.len();
  23. self.data.push_back(value);
  24. index
  25. }
  26. pub fn clear(&mut self) {
  27. self.data.clear();
  28. }
  29. pub fn index_of_first(&self) -> usize {
  30. self.offset
  31. }
  32. pub fn first(&self) -> &T {
  33. &self.data[0]
  34. }
  35. pub fn first_mut(&mut self) -> &mut T {
  36. &mut self.data[0]
  37. }
  38. pub fn pop_first(&mut self) -> T {
  39. self.offset += 1;
  40. self.data.pop_front().unwrap()
  41. }
  42. pub fn last(&self) -> &T {
  43. self.data.back().unwrap()
  44. }
  45. pub fn last_mut(&mut self) -> &mut T {
  46. self.data.back_mut().unwrap()
  47. }
  48. pub fn second_last(&self) -> &T {
  49. &self.data[self.data.len() - 2]
  50. }
  51. pub fn pop_last(&mut self) {
  52. self.data.pop_back().unwrap();
  53. }
  54. }
  55. impl<T> Index<usize> for RingBuffer<T> {
  56. type Output = T;
  57. fn index(&self, index: usize) -> &Self::Output {
  58. &self.data[index.checked_sub(self.offset).unwrap()]
  59. }
  60. }
  61. impl<T> IndexMut<usize> for RingBuffer<T> {
  62. fn index_mut(&mut self, index: usize) -> &mut Self::Output {
  63. &mut self.data[index.checked_sub(self.offset).unwrap()]
  64. }
  65. }