Struct FileOwners

pub struct FileOwners<Tree: Ast>(/* private fields */);

Implementations

impl<Tree: Ast> FileOwners<Tree>

pub fn new() -> Self

pub fn push(&self, file: FileOwner<Tree>)

Methods from Deref<Target = FrozenVec<Box<FileOwner<Tree>>>>

pub fn push(&self, val: T)

Appends an element to the back of the vector.

pub fn push_get(&self, val: T) -> &<T as Deref>::Target

Push, immediately getting a reference to the element

pub fn get(&self, index: usize) -> Option<&<T as Deref>::Target>

Returns a reference to an element.

pub unsafe fn get_unchecked(&self, index: usize) -> &<T as Deref>::Target

Returns a reference to an element, without doing bounds checking.

Safety

index must be in bounds, i.e. it must be less than self.len()

pub fn get_copy(&self, index: usize) -> Option<T>

Returns a copy of an element.

pub fn len(&self) -> usize

Returns the number of elements in the vector.

pub fn is_empty(&self) -> bool

Returns true if the vector contains no elements.

pub fn first(&self) -> Option<&<T as Deref>::Target>

Returns the first element of the vector, or None if empty.

pub fn last(&self) -> Option<&<T as Deref>::Target>

Returns the last element of the vector, or None if empty.

pub fn iter(&self) -> Iter<'_, T>

Returns an iterator over the vector.

pub fn binary_search(&self, x: &<T as Deref>::Target) -> Result<usize, usize>

where <T as Deref>::Target: Ord,

Binary searches this sorted vector for a given element, analogous to slice::binary_search.

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>

where F: FnMut(&'a <T as Deref>::Target) -> Ordering,

Binary searches this sorted vector with a comparator function, analogous to slice::binary_search_by.

pub fn binary_search_by_key<'a, B, F>( &'a self, b: &B, f: F, ) -> Result<usize, usize>

where F: FnMut(&'a <T as Deref>::Target) -> B, B: Ord,

Binary searches this sorted vector with a key extraction function, analogous to slice::binary_search_by_key.

pub fn partition_point<P>(&self, pred: P) -> usize

where P: FnMut(&<T as Deref>::Target) -> bool,

Returns the index of the partition point according to the given predicate (the index of the first element of the second partition), analogous to slice::partition_point.

Trait Implementations

impl<Tree: Ast> Debug for FileOwners<Tree>

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

Formats the value using the given formatter.

impl<Tree: Ast> Default for FileOwners<Tree>

fn default() -> Self

Returns the “default value” for a type.

impl<Tree: Ast> Deref for FileOwners<Tree>

type Target = FrozenVec<Box<FileOwner<Tree>>>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.