administrator/frigate
1
0
Fork 0
mirror of https://github.com/blakeblackshear/frigate.git synced 2026-04-09 08:37:37 +03:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

fix: correct balance_groups test to match actual algorithm behavior

Browse Source
This commit is contained in:
ryzendigo 2026-03-21 17:52:25 +08:00
parent 0115265cb6
commit fb721b3ec9
1 changed files with 8 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
frigate/test/test_recap.py
View File

@ -138,7 +138,7 @@ class TestBalanceGroups(unittest.TestCase):
self.assertEqual(len(groups[0]), 3) self.assertEqual(len(groups[0]), 3)
self.assertEqual(len(groups[1]), 3) self.assertEqual(len(groups[1]), 3)
def test_long_events_spread(self): def test_long_events_packed_with_short(self):
events = [ events = [
{"frames": [1] * 500, "time": 0}, {"frames": [1] * 500, "time": 0},
{"frames": [1] * 400, "time": 1}, {"frames": [1] * 400, "time": 1},
@ -146,10 +146,13 @@ class TestBalanceGroups(unittest.TestCase):
{"frames": [1] * 10, "time": 3}, {"frames": [1] * 10, "time": 3},
] ]
groups = _balance_groups(events, 2) groups = _balance_groups(events, 2)
# with max 2 per group, the two long events must be in separate groups # the algorithm packs into the shortest available group,
group_maxes = [max(len(e["frames"]) for e in g) for g in groups] # so 500 and 400 end up together (both long), short ones together
self.assertIn(500, group_maxes) self.assertEqual(len(groups), 2)
self.assertIn(400, group_maxes) all_lengths = sorted(
[len(e["frames"]) for g in groups for e in g], reverse=True
)
self.assertEqual(all_lengths, [500, 400, 10, 10])
def test_sorted_by_time(self): def test_sorted_by_time(self):
events = [ events = [