pub enum PrRefresh {
Fetch,
ServeCached,
}Expand description
Whether a scan may reach the network for its PR block.
The lookup is one gh api call: a full TLS + API round trip measured at
0.9 s on this machine, and it sat on the record a client waits for. A read
somebody is waiting on serves the PR it already holds and leaves the
refresh to the seat’s own loop, which nobody waits on.
Variants§
Fetch
A cache past its window is looked up again.
ServeCached
A cache past its window is served as it stands for the branch and sha it belongs to - anything else answers nothing - and is never looked up.
Trait Implementations§
impl Copy for PrRefresh
impl Eq for PrRefresh
impl StructuralPartialEq for PrRefresh
Auto Trait Implementations§
impl Freeze for PrRefresh
impl RefUnwindSafe for PrRefresh
impl Send for PrRefresh
impl Sync for PrRefresh
impl Unpin for PrRefresh
impl UnsafeUnpin for PrRefresh
impl UnwindSafe for PrRefresh
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.