pub struct Doors {
pub fulltext: bool,
pub vector: bool,
pub mixed: bool,
}Expand description
WHICH of the three fused doors a tier emits — the ADDITIVE DOOR LAW, decided in one place.
§Additive, which is the whole of the ruling
The per-kind doors keep emitting at every level. These stand BESIDE them and never instead of
them, so a tier that grows a second route of one modality grows a door and loses nothing: a
client written against retrieve_keys_by_<field> goes on working the day the declaration fans.
§Two modalities, three doors, and the third is not a spelling of the first two
A tier with two full-text routes gets fulltext_fuse and a tier with two vector routes gets
vector_fuse, because RRF over one modality is a pure question about that modality. fuse is
the MIXED door and needs at least one route of EACH: over a single-modality route set it would
be a second spelling of the modality door, which is two names for one behaviour and the thing
this law exists to keep out.
Fields§
§fulltext: boolfulltext_fuse — two or more full-text routes.
vector: boolvector_fuse — two or more vector routes.
mixed: boolfuse — at least one route of EACH modality.
Implementations§
Source§impl Doors
impl Doors
Sourcepub const fn of(fulltext: usize, vector: usize) -> Self
pub const fn of(fulltext: usize, vector: usize) -> Self
The law itself, over one tier’s per-modality route counts.
A constructor over two numbers rather than a method on Tier, because the ROOT tier’s
counts come from its members’ KINDS and an index tier’s from its own elections — two callers,
one rule, and nowhere for the rule to be restated differently.