2021-07-13 03:48:01 +08:00
|
|
|
/*
|
2024-09-09 21:57:16 +08:00
|
|
|
Copyright 2024 New Vector Ltd.
|
2021-07-13 03:48:01 +08:00
|
|
|
Copyright 2021 The Matrix.org Foundation C.I.C.
|
|
|
|
|
2024-09-09 21:57:16 +08:00
|
|
|
SPDX-License-Identifier: AGPL-3.0-only OR GPL-3.0-only
|
|
|
|
Please see LICENSE files in the repository root for full details.
|
2021-07-13 03:48:01 +08:00
|
|
|
*/
|
|
|
|
|
2024-10-15 21:57:26 +08:00
|
|
|
import { FixedRollingArray } from "../../../src/utils/FixedRollingArray";
|
2021-07-13 03:48:01 +08:00
|
|
|
|
2022-12-12 19:24:14 +08:00
|
|
|
describe("FixedRollingArray", () => {
|
|
|
|
it("should seed the array with the given value", () => {
|
2021-07-13 03:48:01 +08:00
|
|
|
const seed = "test";
|
|
|
|
const width = 24;
|
|
|
|
const array = new FixedRollingArray(width, seed);
|
|
|
|
|
|
|
|
expect(array.value.length).toBe(width);
|
2022-12-12 19:24:14 +08:00
|
|
|
expect(array.value.every((v) => v === seed)).toBe(true);
|
2021-07-13 03:48:01 +08:00
|
|
|
});
|
|
|
|
|
2022-12-12 19:24:14 +08:00
|
|
|
it("should insert at the correct end", () => {
|
2021-07-13 03:48:01 +08:00
|
|
|
const seed = "test";
|
|
|
|
const value = "changed";
|
|
|
|
const width = 24;
|
|
|
|
const array = new FixedRollingArray(width, seed);
|
|
|
|
array.pushValue(value);
|
|
|
|
|
|
|
|
expect(array.value.length).toBe(width);
|
|
|
|
expect(array.value[0]).toBe(value);
|
|
|
|
});
|
|
|
|
|
2022-12-12 19:24:14 +08:00
|
|
|
it("should roll over", () => {
|
2021-07-13 03:48:01 +08:00
|
|
|
const seed = -1;
|
|
|
|
const width = 24;
|
|
|
|
const array = new FixedRollingArray(width, seed);
|
|
|
|
|
2021-07-13 03:52:10 +08:00
|
|
|
const maxValue = width * 2;
|
|
|
|
const minValue = width; // because we're forcing a rollover
|
2021-07-13 03:48:01 +08:00
|
|
|
for (let i = 0; i <= maxValue; i++) {
|
|
|
|
array.pushValue(i);
|
|
|
|
}
|
|
|
|
|
|
|
|
expect(array.value.length).toBe(width);
|
|
|
|
|
|
|
|
for (let i = 1; i < width; i++) {
|
|
|
|
const current = array.value[i];
|
|
|
|
const previous = array.value[i - 1];
|
|
|
|
expect(previous - current).toBe(1);
|
|
|
|
|
|
|
|
if (i === 1) {
|
2023-03-07 21:58:10 +08:00
|
|
|
// eslint-disable-next-line jest/no-conditional-expect
|
2021-07-13 03:48:01 +08:00
|
|
|
expect(previous).toBe(maxValue);
|
|
|
|
} else if (i === width) {
|
2023-03-07 21:58:10 +08:00
|
|
|
// eslint-disable-next-line jest/no-conditional-expect
|
2021-07-13 03:48:01 +08:00
|
|
|
expect(current).toBe(minValue);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
});
|
|
|
|
});
|