Files
LibretroAdmin cc87d6cc22 playlist: a push to the front takes room kept before the first entry
A playlist keeps its entries with room before the first, so a push
takes the slot there instead of moving every entry up one; when there
is none, the entries move into an allocation with as much room again
before them. A full playlist still drops its last entry, and cannot
fail for want of memory: with no room to be had its entries move up
over the last as before. Order, eviction and what is written are
unchanged. A scan adding 50000 entries spends about 0.17 s on its
pushes rather than 5.4 s.

playlist_parity_test checks pushes, unchecked pushes, pushes of entries
already there, deletes and clears against a list kept beside them, on
a loaded playlist at a capacity that evicts and on one grown to 4095
entries.
2026-11-13 01:11:39 +01:00
..
2026-11-04 19:05:04 +01:00