Trait Convert 

pub trait Convert<Item> {
    // Provided methods
    fn to_bmap<K, V>(self) -> BTreeMap<K, V>
       where K: Ord,
             Self: IntoIterator<Item = (K, V)> + Sized { ... }
    fn to_bset(self) -> BTreeSet<Item>
       where Item: Ord,
             Self: IntoIterator<Item = Item> + Sized { ... }
    fn to_deque(self) -> VecDeque<Item>
       where Self: IntoIterator<Item = Item> + Sized { ... }
    fn to_heap(self) -> BinaryHeap<Item>
       where Item: Ord,
             Self: IntoIterator<Item = Item> + Sized { ... }
    fn to_list(self) -> LinkedList<Item>
       where Self: IntoIterator<Item = Item> + Sized { ... }
    fn to_map<K, V>(self) -> HashMap<K, V>
       where K: Eq + Hash,
             Self: IntoIterator<Item = (K, V)> + Sized { ... }
    fn to_set(self) -> HashSet<Item>
       where Item: Eq + Hash,
             Self: IntoIterator<Item = Item> + Sized { ... }
    fn to_vec(self) -> Vec<Item>
       where Self: IntoIterator<Item = Item> + Sized { ... }
}

Conversion operations.

Methods have the following properties:

• Consumes the collection or its elements
• Creates a new collection

Provided Methods

fn to_bmap<K, V>(self) -> BTreeMap<K, V>

where K: Ord, Self: IntoIterator<Item = (K, V)> + Sized,

Creates a new, ordered map from the elements of this collection.

This is an equivalent of Iterator::collect.

Example

use std::collections::BTreeMap;

use cantrip::*;

let a = vec![(1, 1), (2, 2), (3, 3)];

assert_eq!(a.to_bmap(), BTreeMap::from([(1, 1), (2, 2), (3, 3)]));

fn to_bset(self) -> BTreeSet<Item>

where Item: Ord, Self: IntoIterator<Item = Item> + Sized,

Creates a new, ordered set from the elements of this collection.

This is an equivalent of Iterator::collect.

Example

use std::collections::BTreeSet;

use cantrip::*;

let a = vec![1, 2, 3];

assert_eq!(a.to_bset(), BTreeSet::from([1, 2, 3]));

fn to_deque(self) -> VecDeque<Item>

where Self: IntoIterator<Item = Item> + Sized,

Creates a new double-ended queue from the elements of this collection.

This is an equivalent of Iterator::collect.

Example

use std::collections::VecDeque;

use cantrip::*;

let a = vec![1, 2, 3];

assert_eq!(a.to_deque(), VecDeque::from([1, 2, 3]));

fn to_heap(self) -> BinaryHeap<Item>

where Item: Ord, Self: IntoIterator<Item = Item> + Sized,

Creates a new priority queue from the elements of this collection.

This is an equivalent of Iterator::collect.

Example

use std::collections::{BinaryHeap, HashSet};

use cantrip::*;

let a = vec![1, 2, 3];

assert_eq!(
  a.to_heap().into_iter().collect::<HashSet<_>>(),
  BinaryHeap::from([1, 2, 3]).into_iter().collect()
);

fn to_list(self) -> LinkedList<Item>

where Self: IntoIterator<Item = Item> + Sized,

Creates a new doubly linked list from the elements of this collection.

This is an equivalent of Iterator::collect.

Example

use std::collections::LinkedList;

use cantrip::*;

let a = vec![1, 2, 3];

assert_eq!(a.to_list(), LinkedList::from([1, 2, 3]));

fn to_map<K, V>(self) -> HashMap<K, V>

where K: Eq + Hash, Self: IntoIterator<Item = (K, V)> + Sized,

Creates a new hash map from the elements of this collection.

This is an equivalent of Iterator::collect.

Example

use std::collections::HashMap;

use cantrip::*;

let a = vec![(1, 1), (2, 2), (3, 3)];

assert_eq!(a.to_map(), HashMap::from([(1, 1), (2, 2), (3, 3)]));

fn to_set(self) -> HashSet<Item>

where Item: Eq + Hash, Self: IntoIterator<Item = Item> + Sized,

Creates a new hash set from the elements of this collection.

This is an equivalent of Iterator::collect.

Example

use std::collections::HashSet;

use cantrip::*;

let a = vec![1, 2, 3];

assert_eq!(a.to_set(), HashSet::from([1, 2, 3]));

fn to_vec(self) -> Vec<Item>

where Self: IntoIterator<Item = Item> + Sized,

Creates a new vector from the elements of this collection.

This is an equivalent of Iterator::collect.

Example

use std::collections::LinkedList;

use cantrip::*;

let a = LinkedList::from([1, 2, 3]);

assert_eq!(a.to_vec(), vec![1, 2, 3]);

Implementors

impl<Item, I> Convert<Item> for I

where I: IntoIterator<Item = Item>,