# Struct collections::enum_set::EnumSet [−] [src]

    pub struct EnumSet<E> {
        // some fields omitted
    }

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

A specialized set implementation to use enum types.

It is a logic error for an item to be modified in such a way that the transformation of the item to or from a `usize`, as determined by the `CLike` trait, changes while the item is in the set. This is normally only possible through `Cell`, `RefCell`, global state, I/O, or unsafe code.

## Methods

### `impl<E: CLike> EnumSet<E>`

#### `fn new() -> EnumSet<E>`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns an empty `EnumSet`.

#### `fn len(&self) -> usize`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns the number of elements in the given `EnumSet`.

#### `fn is_empty(&self) -> bool`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns true if the `EnumSet` is empty.

#### `fn clear(&mut self)`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

#### `fn is_disjoint(&self, other: &EnumSet<E>) -> bool`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns `false` if the `EnumSet` contains any enum of the given `EnumSet`.

#### `fn is_superset(&self, other: &EnumSet<E>) -> bool`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns `true` if a given `EnumSet` is included in this `EnumSet`.

#### `fn is_subset(&self, other: &EnumSet<E>) -> bool`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns `true` if this `EnumSet` is included in the given `EnumSet`.

#### `fn union(&self, e: EnumSet<E>) -> EnumSet<E>`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns the union of both `EnumSets`.

#### `fn intersection(&self, e: EnumSet<E>) -> EnumSet<E>`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns the intersection of both `EnumSets`.

#### `fn insert(&mut self, e: E) -> bool`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Adds an enum to the `EnumSet`, and returns `true` if it wasn't there before

#### `fn remove(&mut self, e: &E) -> bool`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Removes an enum from the EnumSet

#### `fn contains(&self, e: &E) -> bool`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns `true` if an `EnumSet` contains a given enum.

#### `fn iter(&self) -> Iter<E>`

Unstable (`enumset`)

: matches collection reform specification, waiting for dust to settle

Returns an iterator over an `EnumSet`.

## Trait Implementations

### `impl<E> Copy for EnumSet<E>`

### `impl<E> Clone for EnumSet<E>`

#### `fn clone(&self) -> EnumSet<E>`

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

### `impl<E: CLike + Debug> Debug for EnumSet<E>`

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

### `impl<E: CLike> Sub for EnumSet<E>`

#### `type Output = EnumSet<E>`

#### `fn sub(self, e: EnumSet<E>) -> EnumSet<E>`

### `impl<E: CLike> BitOr for EnumSet<E>`

#### `type Output = EnumSet<E>`

#### `fn bitor(self, e: EnumSet<E>) -> EnumSet<E>`

### `impl<E: CLike> BitAnd for EnumSet<E>`

#### `type Output = EnumSet<E>`

#### `fn bitand(self, e: EnumSet<E>) -> EnumSet<E>`

### `impl<E: CLike> BitXor for EnumSet<E>`

#### `type Output = EnumSet<E>`

#### `fn bitxor(self, e: EnumSet<E>) -> EnumSet<E>`

### `impl<E: CLike> FromIterator<E> for EnumSet<E>`

#### `fn from_iter<I: IntoIterator<Item=E>>(iter: I) -> EnumSet<E>`

### `impl<'a, E> IntoIterator for &'a EnumSet<E> where E: CLike`

#### `type Item = E`

#### `type IntoIter = Iter<E>`

#### `fn into_iter(self) -> Iter<E>`

### `impl<E: CLike> Extend<E> for EnumSet<E>`

#### `fn extend<I: IntoIterator<Item=E>>(&mut self, iter: I)`

### `impl<'a, E: 'a + CLike + Copy> Extend<&'a E> for EnumSet<E>`

#### `fn extend<I: IntoIterator<Item=&'a E>>(&mut self, iter: I)`

### Derived Implementations

### `impl<E: Hash> Hash for EnumSet<E>`

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

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

### `impl<E: Ord> Ord for EnumSet<E>`

#### `fn cmp(&self, __arg_0: &EnumSet<E>) -> Ordering`

### `impl<E: PartialOrd> PartialOrd for EnumSet<E>`

#### `fn partial_cmp(&self, __arg_0: &EnumSet<E>) -> Option<Ordering>`

#### `fn lt(&self, __arg_0: &EnumSet<E>) -> bool`

#### `fn le(&self, __arg_0: &EnumSet<E>) -> bool`

#### `fn gt(&self, __arg_0: &EnumSet<E>) -> bool`

#### `fn ge(&self, __arg_0: &EnumSet<E>) -> bool`

### `impl<E: Eq> Eq for EnumSet<E>`

### `impl<E: PartialEq> PartialEq for EnumSet<E>`

#### `fn eq(&self, __arg_0: &EnumSet<E>) -> bool`

#### `fn ne(&self, __arg_0: &EnumSet<E>) -> bool`

# 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

## 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`)