Struct MinLevelPathMap 

pub struct MinLevelPathMap<L = Level> { /* private fields */ }

A filter that applies a MinLevelFilter based on the module of an event.

This type allows different modules to apply different level filters. In particular, modules generating a lot of diagnostic noise can be silenced without affecting other modules.

Event modules are matched based on Path::is_child_of. If an event’s module is a child of one in the map then its MinLevelFilter will be checked against it. If an event’s module doesn’t match any in the map then it will pass the filter.

Implementations

impl<L> MinLevelPathMap<L>

pub const fn new() -> Self

Create an empty map.

pub fn default_min_level( &mut self, min_level: impl Into<MinLevelFilter<L>>, ) -> &mut Self

Specify the minimum level for any modules that don’t match any added by MinLevelPathMap::min_level.

pub fn min_level( &mut self, path: impl Into<Path<'static>>, min_level: impl Into<MinLevelFilter<L>>, ) -> &mut Self

Specify the minimum level for a module and its children.

Trait Implementations

impl<L: Debug> Debug for MinLevelPathMap<L>

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

Formats the value using the given formatter.

impl<L: for<'a> FromValue<'a> + Ord + Default> Filter for MinLevelPathMap<L>

fn matches<E: ToEvent>(&self, evt: E) -> bool

Evaluate an event against the filter.

fn and_when<U>(self, other: U) -> And<Self, U>

where Self: Sized,

self && other.

fn or_when<U>(self, other: U) -> Or<Self, U>

where Self: Sized,

self || other.

impl<L, P: Into<Path<'static>>, T: Into<MinLevelFilter<L>>> FromIterator<(P, T)> for MinLevelPathMap<L>

fn from_iter<I: IntoIterator<Item = (P, T)>>(iter: I) -> Self

Creates a value from an iterator.

impl InternalFilter for MinLevelPathMap