/// Constructs a new, empty `PieceTable<T>` with the specified capacity for elements and pieces.
/// Sequential insertion of `data_capacity` elements will be possible without reallocation.
/// Scattered operations results in pieces being added; the created piece table will be able to store `piece_capacity` of these before reallocating.
Constructs a new, empty `PieceTable` with the specified capacity for elements and pieces.
Sequential insertion of `data_capacity` elements will be possible without reallocation.
Scattered operations results in pieces being added; the created piece table will be able to store `piece_capacity` of these before reallocating.
Constructs a new empty ` PieceTable ` with the specified capacity for elements and pieces . Sequential insertion of ` data_capacity ` elements will be possible without reallocation . Scattered operations results in pieces being added ; the created piece table will be able to store ` piece_capacity ` of these before reallocating .
pub fn with_capacity(data_capacity: usize, piece_capacity: usize) -> PieceTable<'a, T> {
        PieceTable {
            original: &[],
            adds: Vec::with_capacity(data_capacity),
            pieces: Vec::with_capacity(piece_capacity),
            last_idx: 0,
            length: 0,
            reusable_insert: None,
            reusable_remove: None,
        }
    }
pub fn with_capacity ( data_capacity : usize , piece_capacity : usize ) -> PieceTable < ' a , T > { PieceTable { original : & [ ] , adds : Vec :: with_capacity ( data_capacity ) , pieces : Vec :: with_capacity ( piece_capacity ) , last_idx : 0 , length : 0 , reusable_insert : None , reusable_remove : None , } }
Constructs a new, empty `PieceTable<T>` with the specified capacity for elements and pieces.
Constructs a new empty ` PieceTable<T > ` with the specified capacity for elements and pieces .
data_capacity
usize
piece_capacity
usize