Module memory 

Structs

AskMemoryQuery

EntryLabelData

One label an entry stands in, as the pair a reader names it by: key is the dimension kind, value the bare scope id.

ExistingMemoryRefs

InspectMemoryQuery

InspectMemoryResult

InspectedEvidence

KernelMemoryApplicationService

MemoryAcceptedCounts

MemoryCoordinateData

MemoryData

MemoryDimensionData

MemoryEntryData

MemoryEvidenceData

MemoryIngestCommand

MemoryIngestOutcome

MemoryProvenanceData

MemoryRelabelCommand

Change the labels an entry stands in without rewriting its text: labels to add, labels to take off, and why. Translated against what the about holds, like an ingest, into one change the log keeps.

MemoryRelabelOutcome

MemoryRelationData

RelateMemoryQuery

What memories of several abouts have to do with each other: the abouts the selection names or resolves, read within one span on one clock.

RelatePageRequest

ResemblingLabelData

A label a write named beside the existing label it resembles.

TemporalCoordinateView

TemporalIncludeOptions

TemporalMemoryQuery

TemporalMemoryResult

TraceMemoryQuery

TracePageRequest

VisualBin

One bin of one label: the lane is the key, the row inside it the value, and a bin counts the entries standing in that pair whose position falls in its span. A renderer that folds a lane sums its rows.

VisualCluster

VisualEntry

VisualLabel

One label the about holds, as a renderer draws it: the key (dimension) and the value, both as the coordinates spell them and as the catalogue speaks, with how many entries stand in it across all time (entries) and how many inside the projected range on the selected clock (in_range).

VisualMetric

VisualProjectionPage

VisualProjectionQuery

VisualProjectionResult

VisualRange

VisualRelation

WakeMemoryQuery

Enums

LabelPolicy

What an ingest does with a dimension that resembles a label the about already holds: the same identifier up to case and separators, or the same value under another key.

MemoryAnswerPolicy

TemporalAxisView

VisualLevelOfDetail

Constants

DEFAULT_RELATE_PAGE_ENTRIES

A relate page counts facts, declared relations, coordinate relations and tensions alike; facts carry their text, so the page is kept smaller than a trace page.

DEFAULT_TRACE_PAGE_ENTRIES

MAX_RELATE_PAGE_ENTRIES

MAX_TRACE_PAGE_ENTRIES

MAX_VISUAL_BINS

MAX_VISUAL_PAGE_ENTRIES

MAX_VISUAL_SOURCE_ENTRIES

RELABEL_ENTITY_KIND

The change kind a relabel appends to the log. The projection reads it as edges added and removed around one entry; nothing else in the log does.

RELABEL_METHOD

The method a contains_entry edge carries when a relabel put it there, so a reader can tell a label given at write from one given later.

Functions

build_visual_projection

Bins, clusters and entries of one range, on one clock, one row per label. catalogue is the about’s labels as read before the dimension filter, so the result lists a label that is empty here as empty.

crosses_abouts

Whether a relation is the one that may cross an about: same_event_as or same_entity_as, evidential, with why and evidence, stamped as declared from a kmp_relate proposal, to a ref this about does not own.

relabel_logical_digest

Digest of the logical relabel, taken before translation: what the caller said, which is what a replay under the same idempotency key must equal.

replayed_relabel_outcome

The outcome a replay of an already-accepted relabel returns: what the caller asked for, read against what the entry stands in now, without translating — a translation after the first apply would refuse the labels the first apply put there.

translate_memory_ingest

translate_memory_relabel

Translates a relabel into the one change the log keeps, refusing what only the caller can fix: a label the entry already stands in, one it does not stand in, a value already used under another key, the last label an entry has, or a new label that resembles one the about holds under a policy that refuses it.

validate_ref_token

Reject ref spellings that can escape the graph namespace or become ambiguous when rendered, logged, or used as storage keys.

validate_supplied_entry_ref

Entry ids are strict descendants of the about they mutate. The about anchor itself is deliberately excluded: ingesting an entry must never change the root node’s kind or payload.

validate_supplied_evidence_ref

Evidence nodes use a distinct prefix, but remain owned by exactly one about through the entry ref embedded after evidence:.

validate_supplied_member_ref

A relation-like ref may name the about anchor, one of its entry nodes, an owned evidence node, or the canonical namespace used for its dimensions.