stelliferous

Search uses release 0.0.2.0 · 2,086 definitions

Releases (2)

def out_extent
def geometry
def leading
def planesThe number of planes before the last two axes; none below rank two.
def pooled
def pool_middle
def middle_shapeThe column-swept planes keep the rows of the input and have the columns of the output.
def pool_counts
def pool_planes
def pool_status
def band_shapepad is both the value outside the input and the initial accumulator.
def band_execute
def band_countThe band route needs the same counts as the dense route: the planes swept along the columns and the output.
def band_geometry
def band_status
def pool2d

def write_list
type State
def indexed_stepIndexed state updates share the traversal counter without requiring an array destination.
def indexed_output
def indexed_fold
def write_state
def store
def step
def run
def finishReturn both owners when the caller can reuse the source allocation later.
def index
def read_index
type Offsets
def destination_offset
def source_offset
def copy
def fold_valueOrdered folds share the same state/counter and preserve the combine order.
def fold_step
def finish_fold
def fold
def mapped_valueReuse the output owner for each read/write; no second array or clone.
def map_step
def mapped_output
def map_in_place
def update_sampleRead the destination's current element, combine it with an owned reader, then store through the same traversal state.
def update_current
def update_step
def update
type VisitedA cursor is consumed by read and returned advanced.
def visit_store
def visit_step
def visit
type TargetA scatter reads the source at the state position, which counts up, and stores at the address its context names; target yields that address with the context of the next element.
def spread_store
def spread_step
def visit_update_sample
def visit_update_current
def visit_update_step
def visit_update
def visit_fold_value
def visit_fold_step
def visit_fold

def gathered
def gather7
def gather6
def gather5
def gather4
def gather3
def gather2
def gather1
def gatherThe mapped values at position, position + 1, ...
def scatterThe lanes of a tile to position, position + 1, ...
def scratch
def finishThe values the rounds leave: fewer than eight, mapped one by one.
def rounds_withOne eight-value loop for any owned input bundle; gather and scatter decide which owners are read or updated.
def rounds
def mapmap over the count values from position, in order: Traversal.map_in_place with the values of each round computed together.
def coveredAn array of 2^depth values holds the count positions from position, within the depths the refinement proof covers.
def map_whenmap over count values from position when the array is known to hold them, and the scalar map otherwise: the same array either way.

type Tree
def runEach binary fork gives both children independent owners; its leaf callback finishes all local stages before returning.
def gather