Software /
code /
prosody
File
spec/scansion/basic_roster.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 | 9305:f14c81fd44a4 |
line wrap: on
line source
# Basic roster test [Client] Romeo jid: user@localhost password: password [Client] Juliet jid: juliet@localhost password: password --------- Romeo connects Juliet connects Romeo sends: <presence/> Romeo receives: <presence from="${Romeo's full JID}" /> Romeo sends: <iq type="get" id="roster1"> <query xmlns='jabber:iq:roster'/> </iq> Romeo receives: <iq type="result" id="roster1"> <query ver='{scansion:any}' xmlns="jabber:iq:roster"/> </iq> # Add nurse to roster Romeo sends: <iq type="set" id="roster2"> <query xmlns="jabber:iq:roster"> <item jid='nurse@localhost'/> </query> </iq> # Receive the roster add result Romeo receives: <iq type="result" id="roster2"/> # Receive the roster push Romeo receives: <iq type="set" id="{scansion:any}"> <query xmlns='jabber:iq:roster' ver='{scansion:any}'> <item jid='nurse@localhost' subscription='none'/> </query> </iq> Romeo sends: <iq type="result" id="fixme"/> # Fetch the roster, it should include nurse now Romeo sends: <iq type="get" id="roster3"> <query xmlns='jabber:iq:roster'/> </iq> Romeo receives: <iq type="result" id="roster3"> <query xmlns='jabber:iq:roster' ver="{scansion:any}"> <item subscription='none' jid='nurse@localhost'/> </query> </iq> Romeo disconnects