     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

    use std::collections::{HashMap, HashSet};
    use bytes::Bytes;

    /// Queue of out-of-order responses. Each peer has it's own queue.
    #[derive(Debug, Default)]
    pub struct ResponseQueue {
    	unfinished: HashMap<u32, Vec<Bytes>>,
    	finished: HashMap<u32, Vec<Bytes>>,
    	ignored: HashSet<u32>,
    }

    pub enum Responses {
    	Unfinished(Vec<Bytes>),
    	Finished(Vec<Bytes>),
    	Ignored,
    }

    impl ResponseQueue {
    	pub fn push_unfinished_response(&mut self, id: u32, response: Bytes) {
    		self.unfinished.entry(id).or_insert_with(Vec::new).push(response)
    	}

    	pub fn push_finished_response(&mut self, id: u32, response: Bytes) {
    		let mut responses = self.unfinished.remove(&id).unwrap_or_default();
    		responses.push(response);
    		let previous = self.finished.insert(id, responses);
    		assert!(previous.is_none(), "logic error; same finished response should never be pushed twice");
    	}

    	pub fn push_ignored_response(&mut self, id: u32) {
    		assert!(self.ignored.insert(id), "logic error; same response should never be ignored twice");
    	}

    	pub fn responses(&mut self, id: u32) -> Option<Responses> {
    		self.unfinished.remove(&id).map(Responses::Unfinished)
    			.or_else(|| self.finished.remove(&id).map(Responses::Finished))
    			.or_else(|| {
    				if self.ignored.remove(&id) {
    					Some(Responses::Ignored)
    				} else {
    					None
    				}
    			})
    	}
    }

# Help

## Keyboard Shortcuts

`?`
  Show this help dialog
`S`
  Focus the search field
`↑`
  Move up in search results
`↓`
  Move down in search results
`↹`
  Switch tab
`⏎`
  Go to active search result
`+`
  Expand all sections
`-`
  Collapse all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)

Search multiple things at once by splitting your query with comma (e.g. `str,u8` or `String,struct:Vec,test`)