logos.lang.slice

Iterator over non-overlapping chunks of a slice, created by slice_chunks.

Raw (ptr, len) halves of a slice split, as produced by slice_split_at.

Iterator over overlapping size-element windows of a slice, created by slice_windows.

Binary-searches sorted s for target. Returns Ok(index) on a match (any one, if target is duplicated) or Err(i) where i is the insertion index that keeps s sorted. Unspecified result if s is not sorted.

Returns an iterator over non-overlapping size-element chunks of s. The last chunk is shorter when s.len() % size != 0; empty input yields no chunks. size must be positive: non-positive size is unchecked, and size == 0 makes next yield empty chunks forever on a non-empty slice.

Constructs an &[T] fat pointer from a raw pointer and element count. Compiler intrinsic (sema intercepts the call); mirrors str_from_raw in lang/str. ptr must be valid for reads of len elements for as long as the result is used.

Returns the sub-slice s[lo..hi] (backs the range-indexing desugar). Bounds are clamped to [0, len]: open range forms pass lo=0 / hi=i64::MAX and the clamp resolves them against the true length. Inclusive ..=hi passes hi+1. Empty when hi <= lo after clamping.

Sorts the n elements at base in place, ascending (stable insertion sort, O(n^2)). base must be valid for reads and writes of n elements. Intended for small n.

Splits s at mid, returning raw (ptr, len) pairs for both halves. mid is clamped to s.len() (no panic, unlike Rust). Rebuild typed &[T] halves with slice_from_raw.

Returns an iterator over overlapping size-element windows of s, advancing by 1. Yields nothing if size <= 0 or size > s.len() (unlike Rust, size == 0 does not panic).