1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182
use orx_split_vec::SplitVecGrowth;
use crate::ImpVec;
impl<T: Clone, G> ImpVec<T, G>
where
G: SplitVecGrowth<T>,
{
/// Clones and appends all elements in a slice to the vec.
///
/// Iterates over the slice `other`, clones each element, and then appends
/// it to this vector. The `other` slice is traversed in-order.
///
/// Unlike `std::vec::Vec` or `orx_split_vec::SplitVec`;
/// push operation for `ImpVec` does **not** require a mutable reference.
///
/// # Examples
///
/// ```
/// use orx_imp_vec::ImpVec;
///
/// let vec = ImpVec::default();
/// vec.push(1);
/// vec.push(2);
/// vec.push(3);
/// assert_eq!(vec, [1, 2, 3]);
///
/// vec.extend_from_slice(&[4, 5, 6, 7]);
/// assert_eq!(vec, [1, 2, 3, 4, 5, 6, 7]);
/// ```
pub fn extend_from_slice(&self, other: &[T]) {
let split_vec = unsafe { &mut *self.as_mut_ptr() };
let fragments = unsafe { split_vec.fragments_mut() };
let mut slice = other;
while !slice.is_empty() {
if !self.has_capacity_for_one() {
self.add_fragment();
}
let f = fragments.len() - 1;
let last = &mut fragments[f];
let available = last.room();
if available < slice.len() {
last.extend_from_slice(&slice[0..available]);
slice = &slice[available..];
self.add_fragment();
} else {
last.extend_from_slice(slice);
break;
}
}
}
}
impl<'a, T: Clone + 'a, G> ImpVec<T, G>
where
G: SplitVecGrowth<T>,
{
/// Clones and appends all elements in the iterator to the vec.
///
/// Iterates over the `iter`, clones each element, and then appends
/// it to this vector.
///
/// Unlike `std::vec::Vec` or `orx_split_vec::SplitVec`;
/// extend operation for `ImpVec` does **not** require a mutable reference.
///
/// # Examples
///
/// ```
/// use orx_imp_vec::ImpVec;
///
/// let vec = ImpVec::default();
/// vec.push(1);
/// vec.push(2);
/// vec.push(3);
/// assert_eq!(vec, [1, 2, 3]);
///
/// vec.extend(&[4, 5, 6, 7]);
/// assert_eq!(vec, [1, 2, 3, 4, 5, 6, 7]);
///
/// let sec_vec = ImpVec::default();
/// sec_vec.extend(vec.into_iter());
/// assert_eq!(sec_vec, [1, 2, 3, 4, 5, 6, 7]);
/// ```
pub fn extend<I: IntoIterator<Item = &'a T>>(&self, iter: I) {
for x in iter {
self.push(x.clone());
}
}
}
#[cfg(test)]
mod tests {
use crate::{test_all_growth_types, ImpVec};
use orx_split_vec::SplitVecGrowth;
#[test]
fn extend_from_slice() {
fn test<G: SplitVecGrowth<usize>>(vec: ImpVec<usize, G>) {
let mut refs = Vec::with_capacity(4062);
let mut addr = Vec::with_capacity(4062);
vec.extend_from_slice(&(0..42).collect::<Vec<_>>());
for i in 0..42 {
let refi = &vec[i];
refs.push(refi);
addr.push(refi as *const usize);
}
vec.extend_from_slice(&(42..63).collect::<Vec<_>>());
for i in 42..63 {
let refi = &vec[i];
refs.push(refi);
addr.push(refi as *const usize);
}
vec.extend_from_slice(&(63..100).collect::<Vec<_>>());
for i in 63..100 {
let refi = &vec[i];
refs.push(refi);
addr.push(refi as *const usize);
}
assert_eq!(100, vec.len());
for i in 0..100 {
assert_eq!(i, vec[i]);
assert_eq!(i, *refs[i]);
let curr_addr = &vec[i] as *const usize;
assert_eq!(curr_addr, addr[i]);
assert_eq!(i, unsafe { *addr[i] });
}
}
test_all_growth_types!(test);
}
#[test]
fn push_get_ref2() {
fn test<G: SplitVecGrowth<usize>>(vec: ImpVec<usize, G>) {
let mut refs = Vec::with_capacity(4062);
let mut addr = Vec::with_capacity(4062);
vec.extend(&(0..42).collect::<Vec<_>>());
for i in 0..42 {
let refi = &vec[i];
refs.push(refi);
addr.push(refi as *const usize);
}
vec.extend(&(42..63).collect::<Vec<_>>());
for i in 42..63 {
let refi = &vec[i];
refs.push(refi);
addr.push(refi as *const usize);
}
vec.extend(&(53..90).map(|i| i + 10).collect::<Vec<_>>());
for i in 63..100 {
let refi = &vec[i];
refs.push(refi);
addr.push(refi as *const usize);
}
assert_eq!(100, vec.len());
for i in 0..100 {
assert_eq!(i, vec[i]);
assert_eq!(i, *refs[i]);
let curr_addr = &vec[i] as *const usize;
assert_eq!(curr_addr, addr[i]);
assert_eq!(i, unsafe { *addr[i] });
}
}
test_all_growth_types!(test);
}
}