tree e4f06356a6f5dd64551706f07b7fc204f182e3b9
parent 62fa89d45ca459f35e73036b39c8aa3b3f45a6d2
author djasper <djasper@google.com> 1562088631 -0700
committer Copybara-Service <copybara-worker@google.com> 1562088699 -0700

Implement a slightly more efficient algorithm to sample the oldest actions in
the UI. This is not more efficient in terms of big-O, but using a heap and just
removing the top elements means that we can skip some unnecessary work. Plus,
using a heap is a lot more efficient in terms of memory allocation.

RELNOTES: None.
PiperOrigin-RevId: 256191956