// Copyright 2026 International Digital Economy Academy
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

///|
/// Aborts with the standard "index out of bounds" diagnostic.
///
/// Factored out of the checked accessors (`at` / `set`) and marked
/// `#inline(never)` on purpose: the failure path builds a `StringBuilder` and
/// formats the message, which makes the accessor body too large for the
/// C/LLVM backend to inline. Hoisting it into this shared cold function keeps
/// the hot accessors small enough to inline (and the surrounding loop to
/// vectorize) while preserving the exact diagnostic message.
#inline(never)
fn[T] index_out_of_bounds(len : Int, index : Int) -> T {
  abort(
    "index out of bounds: the len is from 0 to \{len} but the index is \{index}",
  )
}

///|
/// Variant of [index_out_of_bounds] for accessors that take two indices (e.g.
/// `Array::swap`). Kept `#inline(never)` for the same reason: keep the cold
/// formatting out of the small hot accessor body so it stays inlineable.
#inline(never)
fn[T] index_out_of_bounds2(len : Int, i : Int, j : Int) -> T {
  abort(
    "index out of bounds: the len is from 0 to \{len} but the index is (\{i}, \{j})",
  )
}