aboutsummaryrefslogtreecommitdiff
path: root/ui/src/core/timeline_cache_unittest.ts
blob: 227c19d8c94764f6807c17af4f21e5390081b90c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
// Copyright (C) 2023 The Android Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//      http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

import {Time} from '../base/time';

import {CacheKey, TimelineCache} from './timeline_cache';

test('cacheKeys', () => {
  const k = CacheKey.create(Time.fromRaw(201n), Time.fromRaw(302n), 123);
  const n = k.normalize();
  const n2 = n.normalize();
  expect(k.isNormalized()).toEqual(false);
  expect(n.isNormalized()).toEqual(true);
  expect(n2.isNormalized()).toEqual(true);
  expect(n).toEqual(n2);
  expect(n.start).toBeLessThanOrEqual(k.start);
  expect(n.end).toBeGreaterThanOrEqual(k.start);
  expect(n.bucketSize).toBeGreaterThanOrEqual(k.bucketSize);
  expect(Math.abs(n.windowSizePx - k.windowSizePx)).toBeLessThanOrEqual(200);
});

test('cache', () => {
  const key1 = CacheKey.create(
    Time.fromRaw(1000n),
    Time.fromRaw(1100n),
    100,
  ).normalize();
  const key2 = CacheKey.create(
    Time.fromRaw(2000n),
    Time.fromRaw(2100n),
    100,
  ).normalize();
  const key3 = CacheKey.create(
    Time.fromRaw(3000n),
    Time.fromRaw(3100n),
    100,
  ).normalize();
  const key4 = CacheKey.create(
    Time.fromRaw(4000n),
    Time.fromRaw(4100n),
    100,
  ).normalize();
  const key5 = CacheKey.create(
    Time.fromRaw(5000n),
    Time.fromRaw(5100n),
    100,
  ).normalize();
  const key6 = CacheKey.create(
    Time.fromRaw(6000n),
    Time.fromRaw(6100n),
    100,
  ).normalize();
  const key7 = CacheKey.create(
    Time.fromRaw(7000n),
    Time.fromRaw(7100n),
    100,
  ).normalize();
  const cache = new TimelineCache<string>(5);

  cache.insert(key1, 'v1');
  expect(cache.lookup(key1)).toEqual('v1');

  cache.insert(key2, 'v2');
  cache.insert(key3, 'v3');
  cache.insert(key4, 'v4');
  cache.insert(key5, 'v5');

  // Should push key1/v1 out of the cache:
  cache.insert(key6, 'v6');
  expect(cache.lookup(key1)).toEqual(undefined);

  // Access key2 then add one more entry:
  expect(cache.lookup(key2)).toEqual('v2');
  cache.insert(key7, 'v7');

  // key2/v2 should still be present but key3/v3 should be discarded:
  expect(cache.lookup(key2)).toEqual('v2');
  expect(cache.lookup(key3)).toEqual(undefined);
});