Struct BTreeMapNonEmpty 

pub struct BTreeMapNonEmpty<K, V>(/* private fields */);

A BTreeMap that is guaranteed to be non-empty.

Implementations

impl<K, V> BTreeMapNonEmpty<K, V>

pub fn new(map: BTreeMap<K, V>) -> Result<Self, ValidationError>

Create a new BTreeMapNonEmpty, validating the map is non-empty.

pub fn get(&self) -> &BTreeMap<K, V>

Get the inner BTreeMap.

pub fn into_inner(self) -> BTreeMap<K, V>

Unwrap into the inner BTreeMap.

pub fn len(&self) -> usize

Get the length (always >= 1).

pub fn is_empty(&self) -> bool

Check if empty (always returns false for NonEmpty collections).

Trait Implementations

impl<K: Clone, V: Clone> Clone for BTreeMapNonEmpty<K, V>

fn clone(&self) -> BTreeMapNonEmpty<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for BTreeMapNonEmpty<K, V>

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

Formats the value using the given formatter.

impl ElicitSpec for BTreeMapNonEmpty<String, i32>

fn type_spec() -> TypeSpec

Returns the complete spec for this type.

impl<K, V> Elicitation for BTreeMapNonEmpty<K, V>

where K: Elicitation + Ord + Send, V: Elicitation + Send,

type Style = <BTreeMap<K, V> as Elicitation>::Style

The style enum for this type.

async fn elicit<Comm: ElicitCommunicator>( communicator: &Comm, ) -> ElicitResult<Self>

Elicit a value of this type from the user via style-aware client.

fn kani_proof() -> TokenStream

Generate a Kani symbolic execution proof harness for this type.

fn verus_proof() -> TokenStream

Generate a Verus specification proof for this type.

fn creusot_proof() -> TokenStream

Generate a Creusot contract proof for this type.

fn elicit_checked( peer: Peer<RoleServer>, ) -> impl Future<Output = ElicitResult<Self>> + Send

Server-side elicitation via MCP peer.

fn with_style(style: Self::Style) -> ElicitBuilder<Self>

Create a builder for one-off style override.

fn elicit_proven<C: ElicitCommunicator>( communicator: &C, ) -> impl Future<Output = ElicitResult<(Self, Established<Is<Self>>)>> + Send

Elicit a value with proof it inhabits type Self.

fn prusti_proof() -> TokenStream

Generate a Prusti separation logic proof for this type.

impl<K: PartialEq, V: PartialEq> PartialEq for BTreeMapNonEmpty<K, V>

fn eq(&self, other: &BTreeMapNonEmpty<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V> Prompt for BTreeMapNonEmpty<K, V>

where K: Elicitation + Send, V: Elicitation + Send,

fn prompt() -> Option<&'static str>

Optional prompt to guide user interaction.

impl<K: Eq, V: Eq> Eq for BTreeMapNonEmpty<K, V>

impl<K, V> StructuralPartialEq for BTreeMapNonEmpty<K, V>