circular_list.dart 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
  1. class CircularList<T> {
  2. List<T?> _array;
  3. int _length = 0;
  4. int _startIndex = 0;
  5. Function(int num)? onTrimmed;
  6. CircularList(int maxLength) : _array = List<T?>.filled(maxLength, null);
  7. // Gets the cyclic index for the specified regular index. The cyclic index can then be used on the
  8. // backing array to get the element associated with the regular index.
  9. int _getCyclicIndex(int index) {
  10. return (_startIndex + index) % _array.length;
  11. }
  12. int get maxLength {
  13. return _array.length;
  14. }
  15. set maxLength(int value) {
  16. if (value <= 0)
  17. throw ArgumentError.value(
  18. value, 'value', 'maxLength can\'t be negative!');
  19. if (value == _array.length) return;
  20. // Reconstruct array, starting at index 0. Only transfer values from the
  21. // indexes 0 to length.
  22. final newArray = List<T?>.generate(
  23. value,
  24. (index) => index < _array.length ? _array[_getCyclicIndex(index)] : null,
  25. );
  26. _startIndex = 0;
  27. _array = newArray;
  28. }
  29. int get length {
  30. return _length;
  31. }
  32. set length(int value) {
  33. if (value > _length) {
  34. for (int i = length; i < value; i++) {
  35. _array[i] = null;
  36. }
  37. }
  38. _length = value;
  39. }
  40. void forEach(
  41. void Function(T? item, int index) callback, [
  42. bool includeBuffer = false,
  43. ]) {
  44. final len = includeBuffer ? _array.length : _length;
  45. for (int i = 0; i < len; i++) {
  46. callback(_array[_getCyclicIndex(i)], i);
  47. }
  48. }
  49. T? operator [](int index) {
  50. return _array[_getCyclicIndex(index)];
  51. }
  52. operator []=(int index, T? value) {
  53. _array[_getCyclicIndex(index)] = value;
  54. }
  55. void clear() {
  56. _startIndex = 0;
  57. _length = 0;
  58. }
  59. void push(T value) {
  60. _array[_getCyclicIndex(_length)] = value;
  61. if (_length == _array.length) {
  62. _startIndex++;
  63. if (_startIndex == _array.length) {
  64. _startIndex = 0;
  65. }
  66. onTrimmed?.call(1);
  67. } else {
  68. _length++;
  69. }
  70. }
  71. /// Removes and returns the last value on the list
  72. T pop() {
  73. return _array[_getCyclicIndex(_length-- - 1)]!;
  74. }
  75. /// Deletes and/or inserts items at a particular index (in that order).
  76. void splice(int start, int deleteCount, List<T> items) {
  77. // delete items
  78. if (deleteCount > 0) {
  79. for (int i = start; i < _length - deleteCount; i++)
  80. _array[_getCyclicIndex(i)] = _array[_getCyclicIndex(i + deleteCount)];
  81. length -= deleteCount;
  82. }
  83. if (items.length != 0) {
  84. // add items
  85. for (int i = _length - 1; i >= start; i--)
  86. _array[_getCyclicIndex(i + items.length)] = _array[_getCyclicIndex(i)];
  87. for (int i = 0; i < items.length; i++)
  88. _array[_getCyclicIndex(start + i)] = items[i];
  89. }
  90. // Adjust length as needed
  91. if (_length + items.length > _array.length) {
  92. int countToTrim = _length + items.length - _array.length;
  93. _startIndex += countToTrim;
  94. length = _array.length;
  95. onTrimmed?.call(countToTrim);
  96. } else {
  97. _length += items.length;
  98. }
  99. }
  100. void trimStart(int count) {
  101. if (count > _length) count = _length;
  102. // TODO: perhaps bug in original code, this does not clamp the value of startIndex
  103. _startIndex += count;
  104. _length -= count;
  105. onTrimmed?.call(count);
  106. }
  107. void shiftElements(int start, int count, int offset) {
  108. if (count < 0) return;
  109. if (start < 0 || start >= _length)
  110. throw Exception('Start argument is out of range');
  111. if (start + offset < 0)
  112. throw Exception('Can not shift elements in list beyond index 0');
  113. if (offset > 0) {
  114. for (var i = count - 1; i >= 0; i--) {
  115. this[start + i + offset] = this[start + i];
  116. }
  117. var expandListBy = (start + count + offset) - _length;
  118. if (expandListBy > 0) {
  119. _length += expandListBy;
  120. while (_length > _array.length) {
  121. length--;
  122. _startIndex++;
  123. onTrimmed?.call(1);
  124. }
  125. }
  126. } else {
  127. for (var i = 0; i < count; i++) {
  128. this[start + i + offset] = this[start + i];
  129. }
  130. }
  131. }
  132. bool get isFull => length == maxLength;
  133. List<T> toList() {
  134. return List<T>.generate(length, (index) => this[index]!);
  135. }
  136. }