Struct AppsAndFeaturesEntries 

pub struct AppsAndFeaturesEntries(/* private fields */);

Implementations

impl AppsAndFeaturesEntries

pub const fn new() -> Self

Constructs a new, empty AppsAndFeaturesEntries.

The collection will not allocate until elements are pushed onto it.

Examples

let mut apps_and_features_entries = AppsAndFeaturesEntries::new();

pub fn into_inner(self) -> Vec<AppsAndFeaturesEntry>

Consumes self, returning the inner Vec<AppsAndFeaturesEntry>.

pub fn push(&mut self, entry: AppsAndFeaturesEntry)

Appends an AppsAndFeaturesEntry to the back of the apps and features entries.

pub fn clear(&mut self)

Clears the apps and features entries, removing all values.

Note that this method has no effect on the allocated capacity of the apps and features entries.

pub fn len(&self) -> usize

Returns the number of non-empty AppsAndFeaturesEntry in the apps and features entries.

pub fn is_empty(&self) -> bool

Returns true if there are no apps and features entries or all of the apps and features entries are empty.

Examples

let mut apps_and_features_entries = AppsAndFeaturesEntries::new();
assert!(apps_and_features_entries.is_empty());

apps_and_features_entries.push(AppsAndFeaturesEntry::default());
assert!(apps_and_features_entries.is_empty());

apps_and_features_entries.push(
    AppsAndFeaturesEntry::builder()
        .publisher("Microsoft")
        .build()
);
assert!(!apps_and_features_entries.is_empty());

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

Returns an iterator over the apps and features entries.

The iterator yields all items from start to end.

pub fn iter_mut(&mut self) -> IterMut<'_, AppsAndFeaturesEntry>

Returns an iterator that allows modifying each apps and features entry.

The iterator yields all items from start to end.

Trait Implementations

impl Clone for AppsAndFeaturesEntries

fn clone(&self) -> AppsAndFeaturesEntries

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AppsAndFeaturesEntries

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

Formats the value using the given formatter.

impl Default for AppsAndFeaturesEntries

fn default() -> AppsAndFeaturesEntries

Returns the “default value” for a type.

impl From<AppsAndFeaturesEntry> for AppsAndFeaturesEntries

fn from(apps_and_features_entries: AppsAndFeaturesEntry) -> Self

Creates a new AppsAndFeaturesEntries from a single AppsAndFeaturesEntry.

impl<T> From<T> for AppsAndFeaturesEntries

where T: Into<Vec<AppsAndFeaturesEntry>>,

fn from(apps_and_features_entries: T) -> Self

Creates a new AppsAndFeaturesEntries from any type that implements Into<Vec<AppsAndFeaturesEntry>>.

impl FromIterator<AppsAndFeaturesEntry> for AppsAndFeaturesEntries

fn from_iter<I: IntoIterator<Item = AppsAndFeaturesEntry>>(iter: I) -> Self

Creates a value from an iterator.

impl Hash for AppsAndFeaturesEntries

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a> IntoIterator for &'a AppsAndFeaturesEntries

type Item = &'a AppsAndFeaturesEntry

The type of the elements being iterated over.

type IntoIter = Iter<'a, AppsAndFeaturesEntry>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a> IntoIterator for &'a mut AppsAndFeaturesEntries

type Item = &'a mut AppsAndFeaturesEntry

The type of the elements being iterated over.

type IntoIter = IterMut<'a, AppsAndFeaturesEntry>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for AppsAndFeaturesEntries

type Item = AppsAndFeaturesEntry

The type of the elements being iterated over.

type IntoIter = IntoIter<<AppsAndFeaturesEntries as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Ord for AppsAndFeaturesEntries

fn cmp(&self, other: &AppsAndFeaturesEntries) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for AppsAndFeaturesEntries

fn eq(&self, other: &AppsAndFeaturesEntries) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for AppsAndFeaturesEntries

fn partial_cmp(&self, other: &AppsAndFeaturesEntries) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for AppsAndFeaturesEntries

impl StructuralPartialEq for AppsAndFeaturesEntries