Struct EraserState 

pub struct EraserState {
    pub candidate_set: Option<BTreeSet<usize>>,
    pub race_reported: bool,
    pub last_writer: Option<usize>,
    pub has_write: bool,
}

Eraser algorithm state for a single memory location.

Fields

candidate_set: Option<BTreeSet<usize>>

Current candidate lock set C(v): intersection of all observed lock sets.

race_reported: bool

Whether a data race has been reported.

last_writer: Option<usize>

Last writer thread.

has_write: bool

Last access was a write.

Implementations

impl EraserState

pub fn new() -> Self

pub fn observe_access( &mut self, thread: usize, locks: &BTreeSet<usize>, is_write: bool, )

Record an access from thread holding locks. is_write is true if this is a write access.

pub fn has_race(&self) -> bool

Has a potential race been detected?

Trait Implementations

impl Clone for EraserState

fn clone(&self) -> EraserState

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for EraserState

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for EraserState

fn default() -> Self

Returns the “default value” for a type.