     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

    // Copyright 2015-2017 Parity Technologies (UK) Ltd.
    // This file is part of Parity.

    // Parity is free software: you can redistribute it and/or modify
    // it under the terms of the GNU General Public License as published by
    // the Free Software Foundation, either version 3 of the License, or
    // (at your option) any later version.

    // Parity is distributed in the hope that it will be useful,
    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU General Public License for more details.

    // You should have received a copy of the GNU General Public License
    // along with Parity.  If not, see <http://www.gnu.org/licenses/>.

    //! Verification queue info types

    /// Verification queue status
    #[derive(Debug)]
    #[cfg_attr(feature = "ipc", binary)]
    pub struct VerificationQueueInfo {
    	/// Number of queued items pending verification
    	pub unverified_queue_size: usize,
    	/// Number of verified queued items pending import
    	pub verified_queue_size: usize,
    	/// Number of items being verified
    	pub verifying_queue_size: usize,
    	/// Configured maximum number of items in the queue
    	pub max_queue_size: usize,
    	/// Configured maximum number of bytes to use
    	pub max_mem_use: usize,
    	/// Heap memory used in bytes
    	pub mem_used: usize,
    }

    impl VerificationQueueInfo {
    	/// The total size of the queues.
    	pub fn total_queue_size(&self) -> usize { self.unverified_queue_size + self.verified_queue_size + self.verifying_queue_size }

    	/// The size of the unverified and verifying queues.
    	pub fn incomplete_queue_size(&self) -> usize { self.unverified_queue_size + self.verifying_queue_size }

    	/// Indicates that queue is full
    	pub fn is_full(&self) -> bool {
    		self.unverified_queue_size + self.verified_queue_size + self.verifying_queue_size > self.max_queue_size ||
    			self.mem_used > self.max_mem_use
    	}

    	/// Indicates that queue is empty
    	pub fn is_empty(&self) -> bool {
    		self.unverified_queue_size + self.verified_queue_size + self.verifying_queue_size == 0
    	}
    }

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand 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`)