Slicing mit array[start..end]

Sometimes you want only part of an array. Slicing lets you grab a sub-range as a new slice without copying any elements. ✂️

Write the start and end inside brackets joined by two dots: array[start..end]. This produces a slice over those positions.

The end index is exclusive, so array[1..3] includes positions 1 and 2 but stops before 3. The result has a length of 2.

Leave the end off to run all the way to the last element. data[2..] means everything from index 2 onward.

Using [0..] turns an entire array into a slice. It is the common way to hand a full array to slice-taking code.

Slicing only computes a new pointer and length. The elements stay shared with the original array, so it is fast and allocation-free.

You can slice a slice just like an array. The new range is relative to the slice's own start, narrowing the view further.

If start or end falls outside the data, safe builds panic at runtime. This stops you from reading memory you never owned.

When the bounds are known at compile time, the result can be a pointer to an array with a fixed length baked into its type.

Add a terminator with [start..end :0] to guarantee a trailing zero. This is handy when passing strings to C code.

A slice's length is simply end minus start. So data[2..5] always yields a slice whose len is exactly 3.

You have const data = [_]i32{ 0, 1, 2, 3, 4 }. What is the length of data[1..4]?

The array[start..end] syntax carves a sub-view: end is exclusive, omit it for the tail, nothing is copied, and bounds stay checked. 🎯