pub fn enqueue(&mut self, key: K, item: V) -> Enqueued {
        match self.map.entry(key) {
            Entry::Occupied(mut entry) => {
                entry.get_mut().push_back(item);
                Enqueued::Existing
            }
            Entry::Vacant(entry) => {
                entry.insert(std::iter::once(item).collect());
                Enqueued::New
            }
        }
    }
/// Inserts `item` in the queue associated with `key`
Inserts `item` in the queue associated with `key`
Inserts ` item ` in the queue associated with ` key `
pub fn enqueue(&mut self, key: K, item: V) -> Enqueued {
        match self.map.entry(key) {
            Entry::Occupied(mut entry) => {
                entry.get_mut().push_back(item);
                Enqueued::Existing
            }
            Entry::Vacant(entry) => {
                entry.insert(std::iter::once(item).collect());
                Enqueued::New
            }
        }
    }
pub fn enqueue ( & mut self , key : K , item : V ) -> Enqueued { match self . map . entry ( key ) { Entry :: Occupied ( mut entry ) => { entry . get_mut ( ) . push_back ( item ) ; Enqueued :: Existing } Entry :: Vacant ( entry ) => { entry . insert ( std :: iter :: once ( item ) . collect ( ) ) ; Enqueued :: New } } }
Inserts `item` in the queue associated with `key`
Inserts ` item ` in the queue associated with ` key `
&mut self
key
K
item
V