File

doc/stanza.txt @ 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 55:4edb942e9dff
line wrap: on
line source


Structure of a stanza:


stanza {
	--- properties ---
	tags -- array of tags
	
	--- static methods ---
	iq(attrs) -- 
	
	--- read-only methods ---
	reply -- return new stanza with attributes of current stanza
	child_with_name(string name) -- return the first child of the current tag with the matching name
	
	--- write methods ---
	tag(name, sttrs) -- create a new child of the current tag, and set the child as current
	up() -- move to the parent of the current tag
	text(string) -- append a new text node to the current tag
}