Skip to content

Span

Status: Stable

documented, exercised by the test suite and/or worked examples, with no known limitations recorded.

Description

i;;j represents a span of elements i through j. i;;j;;k represents a span in steps of k.

Examples (8)

Every input below was run against the current Mathilda build and its output recorded.

Basic examples (5)

In[1]:= {a, b, c, d, e, f, g, h}[[2;;5]]
Out[1]= {b, c, d, e}

In[2]:= {a, b, c, d, e, f, g, h}[[1;;-1;;3]]
Out[2]= {a, d, g}

In[3]:= t = {a, b, c, d, e, f, g, h}; t[[2;;5]] = x; t
Out[3]= {a, x, x, x, x, f, g, h}

In[4]:= t = {a, b, c, d, e, f, g, h}; t[[2;;5]] = {p, q, r, s}; t
Out[4]= {a, p, q, r, s, f, g, h}

In[5]:= Range[10][[3;;All]]
Out[5]= {3, 4, 5, 6, 7, 8, 9, 10}

Applications (3)

In[6]:= Range[10][[2 ;; 8]]
Out[6]= {2, 3, 4, 5, 6, 7, 8}

In[7]:= Range[10][[2 ;; 8 ;; 2]]
Out[7]= {2, 4, 6, 8}

In[8]:= Range[10][[;; ;; 3]]
Out[8]= {1, 4, 7, 10}

Implementation notes

Algorithm. Span is not a standalone builtin ā€” it is the head the parser produces for the i;;j and i;;j;;k syntax (OP_SPAN, precedence 290, in parse.c). A Span[start, end, step] expression is interpreted only inside Part/Extract: expr_part (in part.c) resolves it against a concrete list, mapping negative endpoints to len + k + 1, clamping UpTo/All endpoints, computing the element count from the step, and emitting the selected elements. On its own a bare Span stays unevaluated.

  • m[[i;;j;;k]] is equivalent to Take[m, {i, j, k}] but evaluated natively within Part.
  • m[[i;;j]] = v can be used to assign v iteratively over a span of elements. If v is a list, elements are assigned sequentially. If v is a non-list expression, it is assigned uniformly to all elements in the span.
  • When used in Part, negative i and j count from the end.
  • i and j can be of the form UpTo[n] to restrict endpoints to the actual length of the list.
  • Any argument of Span[...] can be All.

Attributes: none registered.

References

See also: Part

Notes & additional examples

Notes

i ;; j is the span of elements i through j, and i ;; j ;; k steps by k. Inside Part ([[...]]) it extracts a contiguous or strided slice: ;; ;; 3 keeps every third element starting from the first, and omitting an endpoint defaults to the start or end of the list. Evaluated on its own a span stays inert as Span[i, j], since its meaning is supplied by the indexing context it appears in.