Struct thrussh::MethodSet

pub struct MethodSet { /* fields omitted */ }

Set of methods, represented by bit flags.

Methods

impl MethodSet

const NONE: MethodSet

NONE: MethodSet = MethodSet{bits: 1,}

The SSH none method (no authentication).

const PASSWORD: MethodSet

PASSWORD: MethodSet = MethodSet{bits: 2,}

The SSH password method (plaintext passwords).

const PUBLICKEY: MethodSet

PUBLICKEY: MethodSet = MethodSet{bits: 4,}

The SSH publickey method (sign a challenge sent by the server).

const HOSTBASED: MethodSet

HOSTBASED: MethodSet = MethodSet{bits: 8,}

The SSH hostbased method (certain hostnames are allowed by the server).

const KEYBOARD_INTERACTIVE: MethodSet

KEYBOARD_INTERACTIVE: MethodSet = MethodSet{bits: 16,}

The SSH keyboard-interactive method (answer to a challenge, where the "challenge" can be a password prompt, a bytestring to sign with a smartcard, or something else).

fn empty() -> MethodSet

Returns an empty set of flags.

fn all() -> MethodSet

Returns the set containing all flags.

fn bits(&self) -> u32

Returns the raw value of the flags currently stored.

fn from_bits(bits: u32) -> Option<MethodSet>

Convert from underlying bit representation, unless that representation contains bits that do not correspond to a flag.

fn from_bits_truncate(bits: u32) -> MethodSet

Convert from underlying bit representation, dropping any bits that do not correspond to flags.

fn is_empty(&self) -> bool

Returns true if no flags are currently stored.

fn is_all(&self) -> bool

Returns true if all flags are currently set.

fn intersects(&self, other: MethodSet) -> bool

Returns true if there are flags common to both self and other.

fn contains(&self, other: MethodSet) -> bool

Returns true all of the flags in other are contained within self.

fn insert(&mut self, other: MethodSet)

Inserts the specified flags in-place.

fn remove(&mut self, other: MethodSet)

Removes the specified flags in-place.

fn toggle(&mut self, other: MethodSet)

Toggles the specified flags in-place.

fn set(&mut self, other: MethodSet, value: bool)

Inserts or removes the specified flags depending on the passed value.

Trait Implementations

impl Copy for MethodSet

impl PartialEq for MethodSet

fn eq(&self, __arg_0: &MethodSet) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &MethodSet) -> bool

This method tests for !=.

impl Eq for MethodSet

impl Clone for MethodSet

fn clone(&self) -> MethodSet

Returns a copy of the value.

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

Performs copy-assignment from source.

impl PartialOrd for MethodSet

fn partial_cmp(&self, __arg_0: &MethodSet) -> Option<Ordering>

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

fn lt(&self, __arg_0: &MethodSet) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, __arg_0: &MethodSet) -> bool

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

fn gt(&self, __arg_0: &MethodSet) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, __arg_0: &MethodSet) -> bool

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

impl Ord for MethodSet

fn cmp(&self, __arg_0: &MethodSet) -> Ordering

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

impl Hash for MethodSet

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

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

impl Debug for MethodSet

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

Formats the value using the given formatter.

impl Binary for MethodSet

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

Formats the value using the given formatter.

impl Octal for MethodSet

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

Formats the value using the given formatter.

impl LowerHex for MethodSet

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

Formats the value using the given formatter.

impl UpperHex for MethodSet

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

Formats the value using the given formatter.

impl BitOr for MethodSet

type Output = MethodSet

The resulting type after applying the | operator.

fn bitor(self, other: MethodSet) -> MethodSet

Returns the union of the two sets of flags.

impl BitOrAssign for MethodSet

fn bitor_assign(&mut self, other: MethodSet)

Adds the set of flags.

impl BitXor for MethodSet

type Output = MethodSet

The resulting type after applying the ^ operator.

fn bitxor(self, other: MethodSet) -> MethodSet

Returns the left flags, but with all the right flags toggled.

impl BitXorAssign for MethodSet

fn bitxor_assign(&mut self, other: MethodSet)

Toggles the set of flags.

impl BitAnd for MethodSet

type Output = MethodSet

The resulting type after applying the & operator.

fn bitand(self, other: MethodSet) -> MethodSet

Returns the intersection between the two sets of flags.

impl BitAndAssign for MethodSet

fn bitand_assign(&mut self, other: MethodSet)

Disables all flags disabled in the set.

impl Sub for MethodSet

type Output = MethodSet

The resulting type after applying the - operator.

fn sub(self, other: MethodSet) -> MethodSet

Returns the set difference of the two sets of flags.

impl SubAssign for MethodSet

fn sub_assign(&mut self, other: MethodSet)

Disables all flags enabled in the set.

impl Not for MethodSet

type Output = MethodSet

The resulting type after applying the ! operator.

fn not(self) -> MethodSet

Returns the complement of this set of flags.

impl Extend<MethodSet> for MethodSet

fn extend<T: IntoIterator<Item = MethodSet>>(&mut self, iterator: T)

Extends a collection with the contents of an iterator.

impl FromIterator<MethodSet> for MethodSet

fn from_iter<T: IntoIterator<Item = MethodSet>>(iterator: T) -> MethodSet

Creates a value from an iterator.

impl Iterator for MethodSet

type Item = MethodSet

The type of the elements being iterated over.

fn next(&mut self) -> Option<MethodSet>

Advances the iterator and returns the next value.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

🔬 This is a nightly-only experimental API. (iterator_step_by)

unstable replacement of Range::step_by

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator<Item = Self::Item>, 

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
    U: IntoIterator, 

'Zips up' two iterators into a single iterator of pairs.

fn map<B, F>(self, f: F) -> Map<Self, F> where
    F: FnMut(Self::Item) -> B, 

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F) where
    F: FnMut(Self::Item) -> (), 

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
    F: FnMut(Self::Item) -> Option<B>, 

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

Creates an iterator which can use peek to look at the next element of the iterator without consuming it.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that [skip]s elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
    P: FnMut(&Self::Item) -> bool, 

Creates an iterator that yields elements based on a predicate.

fn skip(self, n: usize) -> Skip<Self>

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

Creates an iterator that yields its first n elements.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
    F: FnMut(&mut St, Self::Item) -> Option<B>, 

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
    F: FnMut(Self::Item) -> U,
    U: IntoIterator, 

Creates an iterator that works like map, but flattens nested structure.

fn fuse(self) -> Fuse<Self>

Creates an iterator which ends after the first [None].

fn inspect<F>(self, f: F) -> Inspect<Self, F> where
    F: FnMut(&Self::Item) -> (), 

Do something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

Borrows an iterator, rather than consuming it.

fn collect<B>(self) -> B where
    B: FromIterator<Self::Item>, 

Transforms an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B) where
    B: Default + Extend<Self::Item>,
    F: FnMut(&Self::Item) -> bool, 

Consumes an iterator, creating two collections from it.

fn fold<B, F>(self, init: B, f: F) -> B where
    F: FnMut(B, Self::Item) -> B, 

An iterator adaptor that applies a function, producing a single, final value.

fn all<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool where
    F: FnMut(Self::Item) -> bool, 

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
    P: FnMut(&Self::Item) -> bool, 

Searches for an element of an iterator that satisfies a predicate.

fn position<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool, 

Searches for an element in an iterator, returning its index.

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
    P: FnMut(Self::Item) -> bool,
    Self: ExactSizeIterator + DoubleEndedIterator, 

Searches for an element in an iterator from the right, returning its index.

fn max(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item> where
    Self::Item: Ord, 

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
    B: Ord,
    F: FnMut(&Self::Item) -> B, 

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item> where
    F: FnMut(&Self::Item, &Self::Item) -> Ordering, 

Returns the element that gives the minimum value with respect to the specified comparison function.

fn rev(self) -> Rev<Self> where
    Self: DoubleEndedIterator, 

Reverses an iterator's direction.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
    FromA: Default + Extend<A>,
    FromB: Default + Extend<B>,
    Self: Iterator<Item = (A, B)>, 

Converts an iterator of pairs into a pair of containers.

fn cloned<'a, T>(self) -> Cloned<Self> where
    Self: Iterator<Item = &'a T>,
    T: 'a + Clone, 

Creates an iterator which [clone]s all of its elements.

fn cycle(self) -> Cycle<Self> where
    Self: Clone, 

Repeats an iterator endlessly.

fn sum<S>(self) -> S where
    S: Sum<Self::Item>, 

Sums the elements of an iterator.

fn product<P>(self) -> P where
    P: Product<Self::Item>, 

Iterates over the entire iterator, multiplying all the elements

fn cmp<I>(self, other: I) -> Ordering where
    I: IntoIterator<Item = Self::Item>,
    Self::Item: Ord, 

Lexicographically compares the elements of this Iterator with those of another.

fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Lexicographically compares the elements of this Iterator with those of another.

fn eq<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are equal to those of another.

fn ne<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialEq<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are unequal to those of another.

fn lt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool where
    I: IntoIterator,
    Self::Item: PartialOrd<<I as IntoIterator>::Item>, 

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

impl Bytes for MethodSet

fn bytes(&self) -> &'static [u8]