Software /
code /
prosody
File
spec/scansion/vcard_temp.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 | 12967:53b0730093d8 |
line wrap: on
line source
# XEP-0054 vCard-temp writable and readable by anyone # mod_scansion_record on host 'localhost' recording started 2018-10-20T15:00:12Z [Client] Romeo jid: romeo@localhost password: password [Client] Juliet jid: juliet@localhost password: password ----- Romeo connects # Romeo sets his vCard # FN and N are required by the schema and mod_vcard_legacy will always inject them Romeo sends: <iq id="lx3" type="set"> <vCard xmlns="vcard-temp"> <FN>Romeo Montague</FN> <N> <FAMILY>Montague</FAMILY> <GIVEN>Romeo</GIVEN> <MIDDLE/> <PREFIX/> <SUFFIX/> </N> </vCard> </iq> Romeo receives: <iq type="result" id="lx3" to="${Romeo's full JID}"/> Romeo sends: <iq id="lx4" type="get"> <vCard xmlns="vcard-temp"/> </iq> Romeo receives: <iq type="result" id="lx4" to="${Romeo's full JID}"> <vCard xmlns="vcard-temp"> <FN>Romeo Montague</FN> <N> <FAMILY>Montague</FAMILY> <GIVEN>Romeo</GIVEN> <MIDDLE/> <PREFIX/> <SUFFIX/> </N> </vCard> </iq> Juliet connects Juliet sends: <iq type="get" id="lx3" to="romeo@localhost"> <vCard xmlns="vcard-temp"/> </iq> # Juliet can see Romeo's vCard since it's public Juliet receives: <iq type="result" from="romeo@localhost" id="lx3" to="${Juliet's full JID}"> <vCard xmlns="vcard-temp"> <FN>Romeo Montague</FN> <N> <FAMILY>Montague</FAMILY> <GIVEN>Romeo</GIVEN> <MIDDLE/> <PREFIX/> <SUFFIX/> </N> </vCard> </iq> Juliet disconnects Romeo disconnects # recording ended on 2018-10-20T15:02:14Z