pub struct EpollInterestTable(BTreeMap<FdId, Vec<(FdId, WeakFileDescriptionRef<Epoll>)>>);Expand description
The table of all EpollEventInterest.
This tracks, for each file description, which epoll instances have an interest in events
for this file description. The FdId is the ID of the epoll instance, so that we can recognize
it later when it is slated for removal. The vector is sorted by that ID.
Tuple Fields§
§0: BTreeMap<FdId, Vec<(FdId, WeakFileDescriptionRef<Epoll>)>>Implementations§
Source§impl EpollInterestTable
impl EpollInterestTable
pub(crate) fn new() -> Self
fn insert(&mut self, id: FdId, epoll: &FileDescriptionRef<Epoll>)
fn remove(&mut self, id: FdId, epoll_id: FdId)
fn get_epolls( &self, id: FdId, ) -> Option<impl Iterator<Item = &WeakFileDescriptionRef<Epoll>>>
pub fn remove_epolls(&mut self, id: FdId)
Auto Trait Implementations§
impl Freeze for EpollInterestTable
impl !RefUnwindSafe for EpollInterestTable
impl !Send for EpollInterestTable
impl !Sync for EpollInterestTable
impl Unpin for EpollInterestTable
impl !UnwindSafe for EpollInterestTable
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 24 bytes