# Struct collections::btree_set::Intersection 1.0.0 [−] [src]

    pub struct Intersection<'a, T> where
        T: 'a,  { /* fields omitted */ }

A lazy iterator producing elements in the intersection of `BTreeSet`s.

This `struct` is created by the `intersection` method on `BTreeSet`. See its documentation for more.

## Trait Implementations

### `impl<'a, T> Debug for Intersection<'a, T> where
T: 'a + Debug,`
1.17.0
[src]

#### `fn fmt(&self, f: &mut Formatter) -> Result<(), Error>`
[src]

Formats the value using the given formatter.

### `impl<'a, T> Iterator for Intersection<'a, T> where
T: Ord,`
[src]

#### `type Item = &'a T`

#### `fn next(&mut self) -> Option<&'a T>`
[src]

#### `fn size_hint(&self) -> (usize, Option<usize>)`
[src]

### `impl<'a, T> FusedIterator for Intersection<'a, T> where
T: Ord,`
[src]

### `impl<'a, T> Clone for Intersection<'a, T>`
[src]

#### `fn clone(&self) -> Intersection<'a, T>`
[src]

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)