fn into_iter(self) -> IntoIter<T> {
        IntoIter {
            iter: self.data.into_iter(),
        }
    }
/// Creates a consuming iterator, that is, one that moves each value out of
/// the weak heap in arbitrary order. The weak heap cannot be used
/// after calling this.
///
/// # Examples
///
/// Basic usage:
///
/// ```
/// use weakheap::WeakHeap;
/// let heap = WeakHeap::from(vec![1, 2, 3, 4]);
///
/// // Print 1, 2, 3, 4 in arbitrary order
/// for x in heap.into_iter() {
///     // x has type i32, not &i32
///     println!("{}", x);
/// }
/// ```
Creates a consuming iterator, that is, one that moves each value out of
the weak heap in arbitrary order. The weak heap cannot be used
after calling this.
Creates a consuming iterator that is one that moves each value out of the weak heap in arbitrary order . The weak heap cannot be used after calling this .
fn into_iter(self) -> IntoIter<T> {
        IntoIter {
            iter: self.data.into_iter(),
        }
    }
fn into_iter ( self ) -> IntoIter < T > { IntoIter { iter : self . data . into_iter ( ) , } }
Creates a consuming iterator, that is, one that moves each value out of
the weak heap in arbitrary order.
Creates a consuming iterator that is one that moves each value out of the weak heap in arbitrary order .
self
examples
Basic usage.

```
use weakheap::WeakHeap;
let heap = WeakHeap::from(vec![1, 2, 3, 4]).

Print 1, 2, 3, 4 in arbitrary order
for x in heap.into_iter() {
x has type i32, not &i32
println!("{}", x);
}
```
Basic usage . ` ` ` use weakheap :: WeakHeap ; let heap = WeakHeap :: from ( vec! [ 1 2 3 4 ] ) . Print 1 2 3 4 in arbitrary order for x in heap . into_iter () { x has type i32 not &i32 println! ( " {} " x ) ; } ` ` `