Struct InMemory 

pub struct InMemory { /* private fields */ }

Map-backed SourceTree: the test and web seam.

Built from a BTreeMap<key, source>, so list()’s sortedness falls out of BTreeMap’s own ordering guarantee rather than an extra sort step — the map stays sorted by key no matter what order entries were inserted in.

Implementations

impl InMemory

pub fn new(files: BTreeMap<String, String>) -> Self

Build an in-memory SourceTree from a root-relative key → source map.

Trait Implementations

impl Clone for InMemory

fn clone(&self) -> InMemory

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InMemory

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

Formats the value using the given formatter.

impl Default for InMemory

fn default() -> InMemory

Returns the “default value” for a type.

impl SourceTree for InMemory

fn list(&self) -> Result<Vec<String>>

Enumerate every source key under the implementation’s own root, sorted deterministically by key.

fn read(&self, key: &str) -> Result<String>

Read the source text for key.