Function find_insert_position

atomic-core/src/crdt/apply/order.rs:159–179

Finds the insertion position for a new element among concurrent insertions. Given a new element ID and a list of existing elements that were all inserted after the same reference point, determines where the new element should be placed based on ID ordering. # Arguments `new_id` - The ID of the element being inserted `concurrent` - Existing elements that share the same insertion point # Returns

(new_id: &T, concurrent: &[T])

/// assert_eq!(pos, InsertPosition::After(0));
/// ```
pub fn find_insert_position<T: Ord>(new_id: &T, concurrent: &[T]) -> InsertPosition {
    if concurrent.is_empty() {
        return InsertPosition::Start;
    }

    // Find where the new ID fits in the sorted order
    match concurrent.binary_search(new_id) {
        // Exact match (shouldn't happen with unique IDs)
        Ok(idx) => InsertPosition::After(idx),
        // Not found, idx is where it would be inserted
        Err(idx) => {
            if idx == 0 {
                InsertPosition::Start
            } else if idx >= concurrent.len() {
                InsertPosition::End
            } else {
                InsertPosition::After(idx - 1)
            }
        }
    }
}

/// Finds the insertion position for a branch among existing branches.
///