// Copyright Jerome Benoit. 2021-2023. All Rights Reserved.
-const DEFAULT_CIRCULAR_ARRAY_SIZE = 1024;
+export const DEFAULT_CIRCULAR_ARRAY_SIZE = 1024;
/**
* Array with a maximum length and shifting items when full.
if (concatenatedCircularArray.length > concatenatedCircularArray.size) {
concatenatedCircularArray.splice(
0,
- concatenatedCircularArray.length - concatenatedCircularArray.size
+ concatenatedCircularArray.length - concatenatedCircularArray.size,
);
}
return concatenatedCircularArray;
}
- public splice(start: number, deleteCount?: number, ...items: T[]): T[] {
- let itemsRemoved: T[];
+ public splice(start: number, deleteCount?: number, ...items: T[]): CircularArray<T> {
+ let itemsRemoved: T[] = [];
if (arguments.length >= 3 && deleteCount !== undefined) {
- itemsRemoved = super.splice(start, deleteCount);
- // FIXME: that makes the items insert not in place
- this.push(...items);
+ itemsRemoved = super.splice(start, deleteCount, ...items);
+ if (this.length > this.size) {
+ const itemsOverflowing = super.splice(0, this.length - this.size);
+ itemsRemoved = new CircularArray<T>(
+ itemsRemoved.length + itemsOverflowing.length,
+ ...itemsRemoved,
+ ...itemsOverflowing,
+ );
+ }
} else if (arguments.length === 2) {
itemsRemoved = super.splice(start, deleteCount);
} else {
itemsRemoved = super.splice(start);
}
- return itemsRemoved;
+ return itemsRemoved as CircularArray<T>;
}
public resize(size: number): void {