1 // Copyright Jerome Benoit. 2021-2023. All Rights Reserved.
3 const DEFAULT_CIRCULAR_ARRAY_SIZE
= 1024
6 * Array with a maximum length and shifting items when full.
8 export class CircularArray
<T
> extends Array<T
> {
11 constructor (size
: number = DEFAULT_CIRCULAR_ARRAY_SIZE
, ...items
: T
[]) {
15 if (arguments.length
> 1) {
21 public push (...items
: T
[]): number {
22 const length
= super.push(...items
)
23 if (length
> this.size
) {
24 super.splice(0, length
- this.size
)
30 public unshift (...items
: T
[]): number {
31 const length
= super.unshift(...items
)
32 if (length
> this.size
) {
33 super.splice(this.size
, items
.length
)
39 public concat (...items
: Array<T
| ConcatArray
<T
>>): CircularArray
<T
> {
40 const concatenatedCircularArray
= super.concat(
43 concatenatedCircularArray
.size
= this.size
44 if (concatenatedCircularArray
.length
> concatenatedCircularArray
.size
) {
45 concatenatedCircularArray
.splice(
47 concatenatedCircularArray
.length
- concatenatedCircularArray
.size
50 return concatenatedCircularArray
54 public splice (start
: number, deleteCount
?: number, ...items
: T
[]): T
[] {
56 if (arguments.length
>= 3 && deleteCount
!== undefined) {
57 itemsRemoved
= super.splice(start
, deleteCount
)
58 // FIXME: that makes the items insert not in place
60 } else if (arguments.length
=== 2) {
61 itemsRemoved
= super.splice(start
, deleteCount
)
63 itemsRemoved
= super.splice(start
)
68 public resize (size
: number): void {
72 } else if (size
< this.size
) {
73 for (let i
= size
; i
< this.size
; i
++) {
80 public empty (): boolean {
81 return this.length
=== 0
84 public full (): boolean {
85 return this.length
=== this.size
88 private checkSize (size
: number): void {
89 if (!Number.isSafeInteger(size
)) {
91 `Invalid circular array size: ${size} is not a safe integer`
95 throw new RangeError(`Invalid circular array size: ${size} < 0`)