ceiling method

T? ceiling(
  1. T value
)

The smallest value >= value, or null if every value is smaller. Audited: 2026-06-12 11:26 EDT

Implementation

T? ceiling(T value) {
  final List<_SkipNode<T>?> update = List<_SkipNode<T>?>.filled(_maxLevel, null);
  final _SkipNode<T>? candidate = _findPredecessors(value, update);
  // The candidate at level 0 is the first value >= target (or null past the end).
  return candidate?.value;
}