Skip to main content

vector

Attribute Macro vector 

Source
#[vector]
Expand description

Declare an EMBEDDING INDEX over another node’s messages — an operator holding one document per message it saw, searchable by nearness.

ⓘ
#[ingraph::vector(upstream(node = "video::Keyframe", image = "image_embedding", caption = "caption_embedding"))]
pub struct KeyframeEmbedding {
  #[ingraph(knn)]
  image: Embedding<f32, 768>,
  #[ingraph(knn)]
  caption: Embedding<f32, 768>,
}

Everything about the tier is fulltext’s, verbatim: the injected key, the per-field audit, the grammar and its refusals — graphql(<backend>) and rename among them. What differs is the ENGINE the documents are written to, which is named on the FIELD beside its election because a slot is one field in one engine, and the one word this kind adds.

§#[ingraph(knn)] — MANDATORY, and repeatable

A field’s TYPE states its shape, and this is what a knn runs over is a ROLE, so the role is declared — on the field, which is the thing that has it. At least one field must wear the marker; mark several to elect several, and each election becomes a VECTOR COLUMN of this declaration’s ONE slot, with a retrieve_keys_by_<field> / retrieve_by_<field> pair of its own. An embedding-typed field wearing no marker is ordinary payload — stored, hydrated, and reached by no knn.

The QUESTION ROAD is a [tower]’s, and the marker’s ask word retired on 2026-08-19. A road from what a person typed to what a column can be asked with is declared once, as a tower, and reached either by hand — walk it and hand the coordinates to retrieve_keys_by_<field> — or by a [search] recipe’s tower(<arm>(type = "…")) arm. The word that used to live here erased every hop’s refusal into one boxed name; a tower’s own <Tower>Error names the step AND carries that step’s error type, which is what the move bought.

§knn(searchable(tower = "…")) — the SUGAR, and the two entries the block holds

knn(…) takes semantics(<kind> = "…"), which decides how this election’s answer is scored, and searchable(tower = "path::to::Tower"), which names the tower a question is walked through to reach this column.

The second word is PURE SUGAR: it expands to the one-member #[ingraph::search] recipe an author would otherwise type — {Index}{Field}Search, a shared seat whose type is the tower’s own <Tower as SearchTower>::Question, one shared arm, and this declaration’s graphql(…) block passed through, so the wire fields {index}{field}Search and {index}{field}SearchKeys land wherever a hand-written recipe’s would. Nothing underneath knows which of the two it expanded from.

It is the shortest road and not the widest one. A weight, a floor, a second member or a second seat is a recipe’s word, so the moment one is wanted the answer is to write the recipe — which is what the refusal inside searchable(…) says.

The word is the full-text election marker’s own spelling, in a second position. It means one thing in both — a question can reach this column — and what it takes is the difference: nothing where a question is already text, a tower where the column holds coordinates.

A field marked searchable is refused here by name — that is the fulltext kind’s marker — and so is a field marked knn whose type holds no coordinates, at the TYPE its author wrote.

§keys — the UPSTREAM’s rung

fulltext’s word, verbatim and for its reason: an entity upstream holds no rows, so the hydrated half of each road has no store to read out of and is not mounted. See there for the whole of it, and for what a declaration that omits the word over an entity upstream is refused with.