Struct mc_oblivious_ram::TrivialPositionMap[][src]

pub struct TrivialPositionMap<R: RngCore + CryptoRng> { /* fields omitted */ }

A trivial position map implemented via linear scanning. Positions are represented as 32 bytes inside a page.

Implementations

impl<R: RngCore + CryptoRng> TrivialPositionMap<R>[src]

pub fn new(size: u64, height: u32, rng_maker: &mut impl FnMut() -> R) -> Self[src]

Create trivial position map

Trait Implementations

impl<R: RngCore + CryptoRng> PositionMap for TrivialPositionMap<R>[src]

Auto Trait Implementations

impl<R> Send for TrivialPositionMap<R> where
    R: Send

impl<R> Sync for TrivialPositionMap<R> where
    R: Sync

impl<R> Unpin for TrivialPositionMap<R> where
    R: Unpin

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.