chore: apply unreachable_pub and missing_debug_implementations to all crates (#1424)

This commit is contained in:
Taiki Endo
2019-08-11 04:28:52 +09:00
committed by GitHub
parent d9f9c5658f
commit 6a125082e4
49 changed files with 322 additions and 225 deletions
+8 -8
View File
@@ -22,13 +22,13 @@ pub(crate) struct Level<T> {
#[derive(Debug)]
pub(crate) struct Expiration {
/// The level containing the slot.
pub level: usize,
pub(crate) level: usize,
/// The slot index.
pub slot: usize,
pub(crate) slot: usize,
/// The instant at which the slot needs to be processed.
pub deadline: u64,
pub(crate) deadline: u64,
}
/// Level multiplier.
@@ -37,7 +37,7 @@ pub(crate) struct Expiration {
const LEVEL_MULT: usize = 64;
impl<T: Stack> Level<T> {
pub fn new(level: usize) -> Level<T> {
pub(crate) fn new(level: usize) -> Level<T> {
// Rust's derived implementations for arrays require that the value
// contained by the array be `Copy`. So, here we have to manually
// initialize every single slot.
@@ -123,7 +123,7 @@ impl<T: Stack> Level<T> {
/// Finds the slot that needs to be processed next and returns the slot and
/// `Instant` at which this slot must be processed.
pub fn next_expiration(&self, now: u64) -> Option<Expiration> {
pub(crate) fn next_expiration(&self, now: u64) -> Option<Expiration> {
// Use the `occupied` bit field to get the index of the next slot that
// needs to be processed.
let slot = match self.next_occupied_slot(now) {
@@ -172,14 +172,14 @@ impl<T: Stack> Level<T> {
Some(slot)
}
pub fn add_entry(&mut self, when: u64, item: T::Owned, store: &mut T::Store) {
pub(crate) fn add_entry(&mut self, when: u64, item: T::Owned, store: &mut T::Store) {
let slot = slot_for(when, self.level);
self.slot[slot].push(item, store);
self.occupied |= occupied_bit(slot);
}
pub fn remove_entry(&mut self, when: u64, item: &T::Borrowed, store: &mut T::Store) {
pub(crate) fn remove_entry(&mut self, when: u64, item: &T::Borrowed, store: &mut T::Store) {
let slot = slot_for(when, self.level);
self.slot[slot].remove(item, store);
@@ -193,7 +193,7 @@ impl<T: Stack> Level<T> {
}
}
pub fn pop_entry_slot(&mut self, slot: usize, store: &mut T::Store) -> Option<T::Owned> {
pub(crate) fn pop_entry_slot(&mut self, slot: usize, store: &mut T::Store) -> Option<T::Owned> {
let ret = self.slot[slot].pop(store);
if ret.is_some() && self.slot[slot].is_empty() {
+8 -8
View File
@@ -63,7 +63,7 @@ where
T: Stack,
{
/// Create a new timing wheel
pub fn new() -> Wheel<T> {
pub(crate) fn new() -> Wheel<T> {
let levels = (0..NUM_LEVELS).map(Level::new).collect();
Wheel { elapsed: 0, levels }
@@ -71,7 +71,7 @@ where
/// Return the number of milliseconds that have elapsed since the timing
/// wheel's creation.
pub fn elapsed(&self) -> u64 {
pub(crate) fn elapsed(&self) -> u64 {
self.elapsed
}
@@ -96,7 +96,7 @@ where
/// immediately.
///
/// `Err(Invalid)` indicates an invalid `when` argument as been supplied.
pub fn insert(
pub(crate) fn insert(
&mut self,
when: u64,
item: T::Owned,
@@ -124,7 +124,7 @@ where
}
/// Remove `item` from thee timing wheel.
pub fn remove(&mut self, item: &T::Borrowed, store: &mut T::Store) {
pub(crate) fn remove(&mut self, item: &T::Borrowed, store: &mut T::Store) {
let when = T::when(item, store);
let level = self.level_for(when);
@@ -132,11 +132,11 @@ where
}
/// Instant at which to poll
pub fn poll_at(&self) -> Option<u64> {
pub(crate) fn poll_at(&self) -> Option<u64> {
self.next_expiration().map(|expiration| expiration.deadline)
}
pub fn poll(&mut self, poll: &mut Poll, store: &mut T::Store) -> Option<T::Owned> {
pub(crate) fn poll(&mut self, poll: &mut Poll, store: &mut T::Store) -> Option<T::Owned> {
loop {
if poll.expiration.is_none() {
poll.expiration = self.next_expiration().and_then(|expiration| {
@@ -194,7 +194,7 @@ where
None
}
pub fn poll_expiration(
pub(crate) fn poll_expiration(
&mut self,
expiration: &Expiration,
store: &mut T::Store,
@@ -249,7 +249,7 @@ fn level_for(elapsed: u64, when: u64) -> usize {
}
impl Poll {
pub fn new(now: u64) -> Poll {
pub(crate) fn new(now: u64) -> Poll {
Poll {
now,
expiration: None,