Struct Interest

impl Interest

const READABLE: Interest = _;

Returns a Interest set representing readable interests.

const WRITABLE: Interest = _;

Returns a Interest set representing writable interests.

const PRIORITY: Interest = _;

Returns a Interest set representing priority completion interests.

const fn add(self, other: Interest) -> Interest

Add together two Interest.

This does the same thing as the BitOr implementation, but is a constant function.

use mio::Interest;

const INTERESTS: Interest = Interest::READABLE.add(Interest::WRITABLE);
# fn silent_dead_code_warning(_: Interest) { }
# silent_dead_code_warning(INTERESTS)

fn remove(self, other: Interest) -> Option<Interest>

Removes other Interest from self.

Returns None if the set would be empty after removing other.

use mio::Interest;

const RW_INTERESTS: Interest = Interest::READABLE.add(Interest::WRITABLE);

// As long a one interest remain this will return `Some`.
let w_interest = RW_INTERESTS.remove(Interest::READABLE).unwrap();
assert!(!w_interest.is_readable());
assert!(w_interest.is_writable());

// Removing all interests from the set will return `None`.
assert_eq!(w_interest.remove(Interest::WRITABLE), None);

// Its also possible to remove multiple interests at once.
assert_eq!(RW_INTERESTS.remove(RW_INTERESTS), None);

const fn is_readable(self) -> bool

Returns true if the value includes readable readiness.

const fn is_writable(self) -> bool

Returns true if the value includes writable readiness.

const fn is_aio(self) -> bool

Returns true if Interest contains AIO readiness.

const fn is_lio(self) -> bool

Returns true if Interest contains LIO readiness.

const fn is_priority(self) -> bool

Returns true if Interest contains priority readiness.