File

spec/scansion/mam_prefs_prep.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 11727:f3aee8a825cc
line wrap: on
line source

# mod_mam should apply JIDprep in prefs

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

-----

Romeo connects

Romeo sends:
	<iq id="lx2" type="set">
		<prefs xmlns="urn:xmpp:mam:2" default="roster">
			<always>
				<jid>JULIET@MONTAGUE.LIT</jid>
			</always>
			<never>
				<jid>MONTAGUE@MONTAGUE.LIT</jid>
			</never>
		</prefs>
	</iq>

Romeo receives:
	<iq id="lx2" type="result">
		<prefs xmlns="urn:xmpp:mam:2" default="roster">
			<always>
				<jid>juliet@montague.lit</jid>
			</always>
			<never>
				<jid>montague@montague.lit</jid>
			</never>
		</prefs>
	</iq>

Romeo disconnects