Struct mc_oblivious_ram::TrivialPositionMap

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

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

Implementations

impl<R: RngCore + CryptoRng> TrivialPositionMap<R>

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

Create trivial position map

Trait Implementations

impl<R: RngCore + CryptoRng> PositionMap for TrivialPositionMap<R>

fn len(&self) -> u64

The number of keys in the map. The valid keys are in the range 0..len.

fn write(&mut self, key: &u64, new_val: &u64) -> u64

Write a new value to a particular key. The new value should be a random nonce from a CSPRNG. Returns the old value. It is illegal to write to a key that is out of bounds.