stelliferous

Releases (2)

• 0.0.3.0 invalid

  expected a fresh constructor name (duplicate declaration: Text)

  at checkpoint_pickle.bend:14

  8 files do not load

  • checkpoint_pickle.bend
  • tensor_batch_norm.bend
  • tensor_checkpoint.bend
  • tensor_f32.bend
  • tensor_layer.bend
  • tensor_loss.bend
  • tensor_optimizer.bend
  • tensor_training.bend
• 0.0.2.0 indexed

Definitions (2,086)

tensor_access.bend

• def indexed_value
• def read_indexed
• def apply_indexed_runReads a contiguous view and writes a separate contiguous output from zero.
• type PoolThe geometry of a two-dimensional window reduction over the last two axes.
• def window_read
• type SweepWindow reduction along one axis.
• type SweepContext
• type Line
• def read_line
• def line_at
• def read_swept
• def swept_index
• def sweep_run
• def pool_columnsThe sweep along the columns of a pool: every stored row is one line.
• def pool_rowsThe sweep along the rows of the column-swept planes.

tensor_band.bend

• type Geometry
• def Bands
• def elements
• def local_count
• def global_indexChannel-major local indices map to the same global NCHW index for every partition.
• def planes
• def destination
• def gather_leaf
• def gatherOne allocation is provided by the caller.
• def copied_leaf
• def copied_fork
• def copy
• type PlanA pure ownership plan contains no Buffer.
• def plan_join
• def plan
• def same_plan
• def first
• def last
• def same_image
• type PairedTwo trees of one shape, joined leaf by leaf.
• def only
• def zip
• def left_leaf
• def left_of
• def paired
• def unshared
• def same
• def leaf_taskOne leaf below a parallel split.
• def eachThe one band recursion.
• type Indexed
• def map_leaf
• def map_whole_contextA mapper over the whole of one band.
• def map_band
• def map_withParallelism is a planner decision.
• def scalar_value
• def scalar
• def result
• def index_of
• def channel_baseChannel c of a leaf holds the positions from c * rows * width; their global indices are consecutive from this base.
• def channels_of
• def plane_of
• def indexed_buffers
• def indexed_leaf
• type Filled
• def indexed_band
• def apply_indexed
• def range_result
• def range_planesAn empty intersection copies nothing, so it skips the per-channel loop.
• def range_leafRepartition and halo extraction share this owned range reader.
• def range_into
• def range
• def allocate
• def repartition
• def repartitioned
• def align_when
• def align_planned
• def align
• def dense_result
• def dense_leaf
• def dense_ranges
• def from_dense
• def row_plan
• def image_plan
• def splitPlan metadata first, then transfer each dense channel range once.
• def combined
• def combine_leaf_with
• def combine_band_with
• def combine_planned_with
• def combine_withThe caller supplies the same plan on both sides, after shape and status checks; the plan is read from the left.
• def transform_band
• def transform
• type Inspection
• def join_inspection
• def inspected_pair
• def leaf_inspection
• def inspect_leaf
• def inspect

tensor_band_concat.bend

• def geometry
• def tensor_planned
• def tensor_plan
• def first_plan
• def single_plan
• def cons_plan
• def discover
• def compatible_plansReuse the existing metadata traversal to classify the common band path.