Uses of Class
ai.badmonkey.agentspaces.pdt.values.PDb
Packages that use PDb
Package
Description
Persistent data trees (srad/agentspaces-pdt.md §3, §6.2): the shared node layer
every persistent value builds on.
The persistent values of srad/agentspaces-pdt.md §3.2 (group V, PD-V-01 to
PD-V-09) and the spill rules of PD-N-05.
-
Uses of PDb in ai.badmonkey.agentspaces.pdt
Methods in ai.badmonkey.agentspaces.pdt that return types with arguments of type PDb -
Uses of PDb in ai.badmonkey.agentspaces.pdt.golden
Methods in ai.badmonkey.agentspaces.pdt.golden that return PDb -
Uses of PDb in ai.badmonkey.agentspaces.pdt.refs
Methods in ai.badmonkey.agentspaces.pdt.refs that return PDbModifier and TypeMethodDescriptionMerges two heads of adbref.Methods in ai.badmonkey.agentspaces.pdt.refs that return types with arguments of type PDbModifier and TypeMethodDescriptionA DataScript database ref (PDT 2 phase 2, P2-D-03): heads of kinddbat version 2, linear unless the facade configures the name's mode, merged by datoms throughmergewhen two heads meet (P2-D-06).Methods in ai.badmonkey.agentspaces.pdt.refs with parameters of type PDb -
Uses of PDb in ai.badmonkey.agentspaces.pdt.values
Methods in ai.badmonkey.agentspaces.pdt.values that return PDbModifier and TypeMethodDescriptionstatic PDbPDb.empty(NodeStore store, NodeLoader loader) The empty database: an empty schema, max-eid 0, max-txPDb.TX0, three empty leaves, no tail, written into the store at once so every read of it finds its four nodes.static PDbPDb.load(NodeStore store, NodeLoader loader, String root) A stored database: reads its root node through the loader and nothing else.PDb.Writer.root(byte[] schema, long maxEid, long maxTx, String eavt, String aevt, String avet, String tail) Writes the queued nodes and the root in one batch.Methods in ai.badmonkey.agentspaces.pdt.values with parameters of type PDbModifier and TypeMethodDescriptionPDb.changesSince(PDb base) What changed since a base (§3.1.4): the candidates are the datoms of the EAVT diff, which prunes every shared subtree, and the datoms of both tails; each is then read in both databases, a tail's last operation on it first and the index otherwise.