Function ordered_insert

crates/kernel/src/level.rs:354–363

Insert into a sorted list, returning `None` if already present.

(a: u64, list: &[u64])

fn norm_add_const(s: &mut NormLevel, k: u64, path: &[u64]) {
  if k == 0 || (k == 1 && !path.is_empty()) {
    return;
  }
  let node = s.entry(path.to_vec()).or_default();
  node.constant = node.constant.max(k);
}

/// Insert into a sorted list, returning `None` if already present.
fn ordered_insert(a: u64, list: &[u64]) -> Option<Vec<u64>> {
  match list.binary_search(&a) {
    Ok(_) => None,
    Err(pos) => {
      let mut result = list.to_vec();