Field
A Field represents the local view of distributed values across a network of nodes.
Each field consists of:
A local entry, associated with the node executing the aggregate computation.
A set of neighboring entries, each identified by a unique ID.
The field provides functional operators for aggregation, projection, and transformation, supporting key aggregate computing patterns. Fields are expected to be aligned when used together - i.e., they share the same neighborhood structure.
Type Parameters
the type used to identify nodes in the aggregate space.
the type of value carried by each entry in the field.
Properties
A collapsing view over the field entries that includes the local entry and all neighbors. Provides access to the combined list/set/sequence of self + peers, e.g., for operations that need to reason about the entire neighborhood including the local node.
The entry representing the local node in the field.
A collapsing view over the field entries that excludes the local entry, i.e., only peers. Provides access to the neighborhood without the local node, for computations scoped to neighbors.
Functions
Combines this field with another (aligned) one considering the ID when combining the values.
Combines this field with other two (aligned) fields based on the IDs.
Combines this field with other three (aligned) fields based on the IDs.
Combines this field with other four (aligned) fields based on the IDs.
Combines this field with other five (aligned) fields based on the IDs.
Combines this field with other six (aligned) fields based on the IDs.
Combines this field with another (aligned) one.
Combines this field with other two (aligned) fields based on the IDs.
Combines this field with other three (aligned) fields based on the IDs.
Combines this field with other four (aligned) fields based on the IDs.
Combines this field with other five (aligned) fields based on the IDs.
Combines this field with other six (aligned) fields based on the IDs.