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 {
expect(circularArray).toStrictEqual(new CircularArray(1000, 1, 2, 4, 5));
circularArray = new CircularArray(4, 1, 2, 3, 4);
deletedItems = circularArray.splice(2, 1, 5, 6);
- expect(deletedItems).toStrictEqual(new CircularArray(1, 3));
+ expect(deletedItems).toStrictEqual(new CircularArray(2, 3, 1));
expect(circularArray.length).toBe(4);
- expect(circularArray).toStrictEqual(new CircularArray(4, 2, 4, 5, 6));
+ expect(circularArray).toStrictEqual(new CircularArray(4, 2, 5, 6, 4));
});
it('Verify that circular array concat works as intended', () => {