http://hg.omfa.de/prosody-hg/ en-us spec/util_smqueue_spec.lua revision history http://hg.omfa.de/prosody-hg/log/73903352de86/spec/util_smqueue_spec.lua
The previous checkpoint logic used recursion, and the code was more complex
than needed due to maintenance of the self._next_checkpoint field.

This switches to a loop, which should be a bit more efficient, partly because
there are fewer calls (although it was a tail call) and because table lookups
can now be cached between each execution.

_call_checkpoints() is now called unconditionally for every ack, which is
simpler though adds a function call, it should be more than balanced out by
the other changes.]]> Matthew Wild <mwild1@gmail.com> Tue, 26 May 2026 15:36:36 +0100 http://hg.omfa.de/prosody-hg/log/6163c8b17ea9/spec/util_smqueue_spec.lua
Result of mutation testing. One mutant remaining.]]> Kim Alvefur <zash@zash.se> Wed, 19 Oct 2022 14:34:41 +0200 http://hg.omfa.de/prosody-hg/log/4860da718e87/spec/util_smqueue_spec.lua
There was an off-by-one in the modulo calculation. Switching to a plain
old array-table makes the apparent size of the queue wrong, but since
some of the queue may not be available this is likely for the best.]]> Kim Alvefur <zash@zash.se> Thu, 16 Dec 2021 12:16:45 +0100 http://hg.omfa.de/prosody-hg/log/daced16154fa/spec/util_smqueue_spec.lua
Meant to be used in mod_smacks for XEP-0198

Meant to have a larger virtual size than actual number of items stored,
on the theory that in most cases, the excess will be acked before needed
for a resumption event.]]> Kim Alvefur <zash@zash.se> Tue, 14 Dec 2021 19:58:53 +0100