Lines Matching refs:a
729 pub struct Cursor<'a, K, V> {
730 tree: &'a mut RBTree<K, V>,
737 unsafe impl<'a, K: Send, V: Send> Send for Cursor<'a, K, V> {}
741 unsafe impl<'a, K: Sync, V: Sync> Sync for Cursor<'a, K, V> {}
743 impl<'a, K, V> Cursor<'a, K, V> {
931 impl<'a, K, V> IntoIterator for &'a RBTree<K, V> {
932 type Item = (&'a K, &'a V);
933 type IntoIter = Iter<'a, K, V>;
943 pub struct Iter<'a, K, V> {
944 _tree: PhantomData<&'a RBTree<K, V>>,
950 unsafe impl<'a, K: Sync, V: Sync> Send for Iter<'a, K, V> {}
954 unsafe impl<'a, K: Sync, V: Sync> Sync for Iter<'a, K, V> {}
956 impl<'a, K, V> Iterator for Iter<'a, K, V> {
957 type Item = (&'a K, &'a V);
965 impl<'a, K, V> IntoIterator for &'a mut RBTree<K, V> {
966 type Item = (&'a K, &'a mut V);
967 type IntoIter = IterMut<'a, K, V>;
977 pub struct IterMut<'a, K, V> {
978 _tree: PhantomData<&'a mut RBTree<K, V>>,
985 unsafe impl<'a, K: Send, V: Send> Send for IterMut<'a, K, V> {}
989 unsafe impl<'a, K: Sync, V: Sync> Sync for IterMut<'a, K, V> {}
991 impl<'a, K, V> Iterator for IterMut<'a, K, V> {
992 type Item = (&'a K, &'a mut V);
1125 pub enum Entry<'a, K, V> {
1127 Vacant(VacantEntry<'a, K, V>),
1129 Occupied(OccupiedEntry<'a, K, V>),
1133 enum RawEntry<'a, K, V> {
1134 Vacant(RawVacantEntry<'a, K, V>),
1135 Occupied(OccupiedEntry<'a, K, V>),
1139 pub struct VacantEntry<'a, K, V> {
1141 raw: RawVacantEntry<'a, K, V>,
1150 struct RawVacantEntry<'a, K, V> {
1157 _phantom: PhantomData<&'a mut RBTree<K, V>>,
1160 impl<'a, K, V> RawVacantEntry<'a, K, V> {
1165 fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V { in insert()
1185 impl<'a, K, V> VacantEntry<'a, K, V> {
1187 pub fn insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V { in insert()
1196 pub struct OccupiedEntry<'a, K, V> {
1197 rbtree: &'a mut RBTree<K, V>,
1202 impl<'a, K, V> OccupiedEntry<'a, K, V> {
1222 pub fn into_mut(self) -> &'a mut V { in into_mut()