File

spec/scansion/lastactivity.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 10732:f5d88ad24b30
line wrap: on
line source

# XEP-0012: Last Activity / mod_lastactivity

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

-----

Romeo connects

Romeo sends:
	<presence>
		<status>Hello</status>
	</presence>

Romeo receives:
	<presence from="${Romeo's full JID}">
		<status>Hello</status>
	</presence>

Romeo sends:
	<presence type="unavailable">
		<status>Goodbye</status>
	</presence>

Romeo receives:
	<presence from="${Romeo's full JID}" type="unavailable">
		<status>Goodbye</status>
	</presence>

# mod_lastlog saves time + status message from the last unavailable presence

Romeo sends:
	<iq id='a' type='get'>
		<query xmlns='jabber:iq:last'/>
	</iq>

Romeo receives:
	<iq type='result' id='a'>
		<query xmlns='jabber:iq:last' seconds='0'>Goodbye</query>
	</iq>

Romeo disconnects

# recording ended on 2020-04-20T14:39:47Z