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
use alloc::vec::Vec; use super::super::*; impl<T> Collection for Vec<T> { #[inline(always)] fn len(&self) -> usize { Vec::<T>::len(self) } } impl<T> CollectionMut for Vec<T> { #[inline(always)] fn clear(&mut self) { Vec::<T>::truncate(self, 0); } } impl<T> Create<T> for Vec<T> { #[inline(always)] fn create() -> Self { Vec::<T>::new() } #[inline(always)] fn create_with_capacity(capacity: usize) -> Self { Vec::<T>::with_capacity(capacity) } #[inline(always)] fn add_element(mut self, value: T) -> Self { Vec::<T>::push(&mut self, value); self } } impl<T> Deque<T> for Vec<T> { #[inline(always)] fn push_front(&mut self, element: T) { Vec::<T>::insert(self, 0, element) } #[inline(always)] fn push_back(&mut self, element: T) { Vec::<T>::push(self, element) } #[inline(always)] fn pop_front(&mut self) -> Option<T> { if Vec::<T>::len(self) == 0 { None } else { Some(Vec::<T>::remove(self, 0)) } } #[inline(always)] fn pop_back(&mut self) -> Option<T> { Vec::<T>::pop(self) } #[inline(always)] fn front(&self) -> Option<&T> { self.first() } #[inline(always)] fn back(&self) -> Option<&T> { self.last() } #[inline(always)] fn front_mut(&mut self) -> Option<&mut T> { self.first_mut() } #[inline(always)] fn back_mut(&mut self) -> Option<&mut T> { self.last_mut() } } impl<T> Insert<usize, T> for Vec<T> { type Output = (); #[inline(always)] fn insert(&mut self, index: usize, element: T) -> Self::Output { Vec::<T>::insert(self, index, element) } } impl<T> Remove<usize> for Vec<T> { type Output = T; #[inline(always)] fn remove(&mut self, index: usize) -> Self::Output { Vec::<T>::remove(self, index) } } impl<T> Stack<T> for Vec<T> { #[inline(always)] fn push(&mut self, element: T) { Vec::<T>::push_front(self, element) } #[inline(always)] fn pop(&mut self) -> Option<T> { Vec::<T>::pop_front(self) } #[inline(always)] fn top(&self) -> Option<&T> { Vec::<T>::front(self) } #[inline(always)] fn top_mut(&mut self) -> Option<&mut T> { Vec::<T>::front_mut(self) } } impl<T> Queue<T> for Vec<T> { #[inline(always)] fn enqueue(&mut self, element: T) { Vec::<T>::push_back(self, element) } #[inline(always)] fn dequeue(&mut self) -> Option<T> { Vec::<T>::pop_front(self) } #[inline(always)] fn peek(&self) -> Option<&T> { Vec::<T>::front(self) } #[inline(always)] fn peek_mut(&mut self) -> Option<&mut T> { Vec::<T>::front_mut(self) } } impl<T> Get<usize> for Vec<T> { type Output = T; #[inline(always)] fn get(&self, index: usize) -> Option<&Self::Output> { if index < self.len() { Some(unsafe { self.get_unchecked(index) }) } else { None } } } impl<T> GetMut<usize> for Vec<T> { #[inline(always)] fn get_mut(&mut self, index: usize) -> Option<&mut Self::Output> { if index < self.len() { Some(unsafe { self.get_unchecked_mut(index) }) } else { None } } }