Struct OidTable 

pub struct OidTable<V> { /* private fields */ }

Helper for implementing GETNEXT with lexicographic OID ordering.

This struct simplifies implementing the get_next method of MibHandler by maintaining a sorted list of OID-value pairs and providing efficient lookup for the next OID.

Example

use async_snmp::handler::{MibHandler, RequestContext, GetResult, GetNextResult, OidTable, BoxFuture};
use async_snmp::{Oid, Value, VarBind, oid};

struct MyHandler {
    table: OidTable<Value>,
}

impl MyHandler {
    fn new() -> Self {
        let mut table = OidTable::new();
        table.insert(oid!(1, 3, 6, 1, 4, 1, 99999, 1, 0), Value::Integer(42));
        table.insert(oid!(1, 3, 6, 1, 4, 1, 99999, 2, 0), Value::OctetString("test".into()));
        Self { table }
    }
}

impl MibHandler for MyHandler {
    fn get<'a>(&'a self, _ctx: &'a RequestContext, oid: &'a Oid) -> BoxFuture<'a, GetResult> {
        Box::pin(async move {
            self.table.get(oid)
                .cloned()
                .map(GetResult::Value)
                .unwrap_or(GetResult::NoSuchObject)
        })
    }

    fn get_next<'a>(&'a self, _ctx: &'a RequestContext, oid: &'a Oid) -> BoxFuture<'a, GetNextResult> {
        Box::pin(async move {
            self.table.get_next(oid)
                .map(|(next_oid, value)| GetNextResult::Value(VarBind::new(next_oid.clone(), value.clone())))
                .unwrap_or(GetNextResult::EndOfMibView)
        })
    }
}

Implementations

impl<V> OidTable<V>

pub fn new() -> Self

Create a new empty OID table.

pub fn with_capacity(capacity: usize) -> Self

Create an OID table with pre-allocated capacity.

pub fn insert(&mut self, oid: Oid, value: V)

Insert an OID-value pair, maintaining sorted order.

If the OID already exists, its value is replaced.

pub fn remove(&mut self, oid: &Oid) -> Option<V>

Remove an OID from the table.

Returns the removed value if the OID was present.

pub fn get(&self, oid: &Oid) -> Option<&V>

Get the value for an exact OID match.

pub fn get_next(&self, oid: &Oid) -> Option<(&Oid, &V)>

Get the lexicographically next OID and value after the given OID.

Returns None if there are no OIDs greater than the given one.

pub fn len(&self) -> usize

Get the number of entries in the table.

pub fn is_empty(&self) -> bool

Check if the table is empty.

pub fn clear(&mut self)

Clear all entries from the table.

pub fn iter(&self) -> impl Iterator<Item = (&Oid, &V)>

Iterate over all OID-value pairs in lexicographic order.

Trait Implementations

impl<V: Clone> Clone for OidTable<V>

fn clone(&self) -> OidTable<V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug> Debug for OidTable<V>

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

Formats the value using the given formatter.

impl<V> Default for OidTable<V>

fn default() -> Self

Returns the “default value” for a type.