prosody
396db0e7084f
spec/scansion/tombstones.scs

Find changesets by keywords by author, files, the commit message, revision number or hash, or revset expression.

Software / code / prosody

File

spec/scansion/tombstones.scs @ 13136:396db0e7084f

mod_storage_internal: Use a binary search for time based ranges Iterating over an entire archive to find a few items in the far end from where iteration started is expensive, and probably more expensive with the lazy-loading of items added in the previous commit. Since we can now efficiently read items in random order, we can now use a binary search to find a better starting point for iteration.
author Kim Alvefur <zash@zash.se>
date Wed, 12 May 2021 01:32:03 +0200
parent 12116:efcf25ad5406
line wrap: on
line source

# Tombstones

[Client] Romeo
	jid: romeo@localhost
	password: password

[Client] Juliet
	jid: juliet-tombstones@localhost
	password: password

---------

Romeo connects

Juliet connects

Juliet sends:
	<iq type="set" id="bye">
		<query xmlns="jabber:iq:register">
			<remove/>
		</query>
	</iq>

# Scansion gets disconnected right after this with a stream error makes
# scansion itself abort, so we preemptively disconnect to avoid that
# Juliet receives:
#	<iq type="result" id="bye"/>

Juliet disconnects

Romeo sends:
	<presence type="probe" to="${Juliet's JID}"/>

Romeo receives:
	<presence type="error" from="${Juliet's JID}"/>

Romeo receives:
	<presence type="unsubscribed" from="${Juliet's JID}"/>