prosody
396db0e7084f
spec/scansion/pep_pubsub_max.scs

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

Software / code / prosody

File

spec/scansion/pep_pubsub_max.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 11631:6641ca266d94
line wrap: on
line source

# PEP max_items=max

[Client] Romeo
	jid: pep-test-maxitems@localhost
	password: password

-----

Romeo connects

Romeo sends:
	<iq type="set" id="pub">
		<pubsub xmlns="http://jabber.org/protocol/pubsub">
			<publish node="urn:xmpp:microblog:0">
				<item>
					<entry xmlns='http://www.w3.org/2005/Atom'>
						<title>Hello</title>
					</entry>
				</item>
			</publish>
			<publish-options>
				<x xmlns="jabber:x:data" type="submit">
					<field type="hidden" var="FORM_TYPE">
						<value>http://jabber.org/protocol/pubsub#publish-options</value>
					</field>
					<field var="pubsub#persist_items">
						<value>true</value>
					</field>
					<field var="pubsub#access_model">
						<value>open</value>
					</field>
					<field var="pubsub#max_items">
						<value>max</value>
					</field>
				</x>
			</publish-options>
		</pubsub>
	</iq>

Romeo receives:
	<iq type="result" id="pub">
		<pubsub xmlns="http://jabber.org/protocol/pubsub">
			<publish node="urn:xmpp:microblog:0">
				<item id="{scansion:any}"/>
			</publish>
		</pubsub>
	</iq>