std::ops::Drop - Rust
Description: API documentation for the Rust `Drop` trait in crate `std`.
Keywords: rust, rustlang, rust-lang, Drop

# 1.0.0[−][src]Trait std::ops::Drop

    #[lang = "drop"]pub trait Drop {
        fn drop(&mut self);
    }

Custom code within the destructor.

When a value is no longer needed, Rust will run a "destructor" on that value. The most common way that a value is no longer needed is when it goes out of scope. Destructors may still run in other circumstances, but we're going to focus on scope for the examples here. To learn about some of those other cases, please see the reference section on destructors.

This destructor consists of two components:

- A call to `Drop::drop` for that value, if this special `Drop` trait is implemented for its type.
- The automatically generated "drop glue" which recursively calls the destructors of the all fields of this value.

As Rust automatically calls the destructors of all contained fields, you don't have to implement `Drop` in most cases. But there are some cases where it is useful, for example for types which directly manage a resource. That resource may be memory, it may be a file descriptor, it may be a network socket. Once a value of that type is no longer going to be used, it should "clean up" its resource by freeing the memory or closing the file or socket. This is the job of a destructor, and therefore the job of `Drop::drop`.

## Examples

To see destructors in action, let's take a look at the following program:

    struct HasDrop;

    impl Drop for HasDrop {
        fn drop(&mut self) {
            println!("Dropping HasDrop!");
        }
    }

    struct HasTwoDrops {
        one: HasDrop,
        two: HasDrop,
    }

    impl Drop for HasTwoDrops {
        fn drop(&mut self) {
            println!("Dropping HasTwoDrops!");
        }
    }

    fn main() {
        let _x = HasTwoDrops { one: HasDrop, two: HasDrop };
        println!("Running!");
    }

Run

Rust will first call `Drop::drop` for `_x` and then for both `_x.one` and `_x.two`, meaning that running this will print

    Running!
    Dropping HasTwoDrops!
    Dropping HasDrop!
    Dropping HasDrop!

Even if we remove the implementation of `Drop` for `HasTwoDrop`, the destructors of its fields are still called. This would result in

    Running!
    Dropping HasDrop!
    Dropping HasDrop!

## You cannot call `Drop::drop` yourself

Because `Drop::drop` is used to clean up a value, it may be dangerous to use this value after the method has been called. As `Drop::drop` does not take ownership of its input, Rust prevents misuse by not allowing you to call `Drop::drop` directly.

In other words, if you tried to explicitly call `Drop::drop` in the above example, you'd get a compiler error.

If you'd like explicitly call the destructor of a value, `std::mem::drop` can be used instead.

## Drop order

Which of our two `HasDrop` drops first, though? For structs, it's the same order that they're declared: first `one`, then `two`. If you'd like to try this yourself, you can modify `HasDrop` above to contain some data, like an integer, and then use it in the `println!` inside of `Drop`. This behavior is guaranteed by the language.

Unlike for structs, local variables are dropped in reverse order:

    struct Foo;

    impl Drop for Foo {
        fn drop(&mut self) {
            println!("Dropping Foo!")
        }
    }

    struct Bar;

    impl Drop for Bar {
        fn drop(&mut self) {
            println!("Dropping Bar!")
        }
    }

    fn main() {
        let _foo = Foo;
        let _bar = Bar;
    }

Run

This will print

    Dropping Bar!
    Dropping Foo!

Please see the reference for the full rules.

## `Copy` and `Drop` are exclusive

You cannot implement both `Copy` and `Drop` on the same type. Types that are `Copy` get implicitly duplicated by the compiler, making it very hard to predict when, and how often destructors will be executed. As such, these types cannot have destructors.

## Required methods

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

Executes the destructor for this type.

This method is called implicitly when the value goes out of scope, and cannot be called explicitly (this is compiler error E0040). However, the `std::mem::drop` function in the prelude can be used to call the argument's `Drop` implementation.

When this method has been called, `self` has not yet been deallocated. That only happens after the method is over. If this wasn't the case, `self` would be a dangling reference.

# Panics

Given that a `panic!` will call `drop` as it unwinds, any `panic!` in a `drop` implementation will likely abort.

Note that even if this panics, the value is considered to be dropped; you must not cause `drop` to be called again. This is normally automatically handled by the compiler, but when using unsafe code, can sometimes occur unintentionally, particularly when using `std::ptr::drop_in_place`.

Loading content...

## Implementations on Foreign Types

### `impl<'_, '_, '_> Drop for BacktraceFrameFmt<'_, '_, '_>`[src]

#### `fn drop(&mut self)`[src]

Loading content...

## Implementors

### `impl Drop for CString`[src]

#### `fn drop(&mut self)`[src]

### `impl Drop for Condvar`[src]

#### `fn drop(&mut self)`[src]

### `impl Drop for Waker`[src]

#### `fn drop(&mut self)`[src]

### `impl<'_> Drop for std::string::Drain<'_>`[src]

#### `fn drop(&mut self)`[src]

### `impl<'_, I> Drop for Splice<'_, I> where
I: Iterator,` [src]

#### `fn drop(&mut self)`[src]

### `impl<'_, K, V, F> Drop for std::collections::btree_map::DrainFilter<'_, K, V, F> where
F: FnMut(&K, &mut V) -> bool,` [src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T> Drop for PeekMut<'_, T> where
T: Ord,` [src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T> Drop for std::collections::vec_deque::Drain<'_, T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T> Drop for std::vec::Drain<'_, T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T, F> Drop for std::collections::btree_set::DrainFilter<'_, T, F> where
F: FnMut(&T) -> bool,` [src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T, F> Drop for std::collections::linked_list::DrainFilter<'_, T, F> where
F: FnMut(&mut T) -> bool,` [src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T, F> Drop for std::vec::DrainFilter<'_, T, F> where
F: FnMut(&mut T) -> bool,` [src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T: ?Sized> Drop for MutexGuard<'_, T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T: ?Sized> Drop for RwLockReadGuard<'_, T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<'_, T: ?Sized> Drop for RwLockWriteGuard<'_, T>`[src]

#### `fn drop(&mut self)`[src]

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

#### `fn drop(&mut self)`[src]

Removes heap elements in heap order.

### `impl<'f> Drop for VaListImpl<'f>`[src]

#### `fn drop(&mut self)`[src]

### `impl<K, V> Drop for std::collections::btree_map::IntoIter<K, V>`[src]

#### `fn drop(&mut self)`[src]

### `impl<K, V> Drop for BTreeMap<K, V>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T> Drop for Box<T> where
T: ?Sized,` [src]

#### `fn drop(&mut self)`[src]

### `impl<T> Drop for LinkedList<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T> Drop for VecDeque<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T> Drop for Rc<T> where
T: ?Sized,` [src]

#### `fn drop(&mut self)`[src]

Drops the `Rc`.

This will decrement the strong reference count. If the strong reference count reaches zero then the only other references (if any) are `Weak`, so we `drop` the inner value.

# Examples

    use std::rc::Rc;

    struct Foo;

    impl Drop for Foo {
        fn drop(&mut self) {
            println!("dropped!");
        }
    }

    let foo  = Rc::new(Foo);
    let foo2 = Rc::clone(&foo);

    drop(foo);    // Doesn't print anything
    drop(foo2);   // Prints "dropped!"

Run

### `impl<T> Drop for std::rc::Weak<T> where
T: ?Sized,` [src]

#### `fn drop(&mut self)`[src]

Drops the `Weak` pointer.

# Examples

    use std::rc::{Rc, Weak};

    struct Foo;

    impl Drop for Foo {
        fn drop(&mut self) {
            println!("dropped!");
        }
    }

    let foo = Rc::new(Foo);
    let weak_foo = Rc::downgrade(&foo);
    let other_weak_foo = Weak::clone(&weak_foo);

    drop(weak_foo);   // Doesn't print anything
    drop(foo);        // Prints "dropped!"

    assert!(other_weak_foo.upgrade().is_none());

Run

### `impl<T> Drop for Receiver<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T> Drop for Sender<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T> Drop for SyncSender<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T> Drop for Arc<T> where
T: ?Sized,` [src]

#### `fn drop(&mut self)`[src]

Drops the `Arc`.

This will decrement the strong reference count. If the strong reference count reaches zero then the only other references (if any) are `Weak`, so we `drop` the inner value.

# Examples

    use std::sync::Arc;

    struct Foo;

    impl Drop for Foo {
        fn drop(&mut self) {
            println!("dropped!");
        }
    }

    let foo  = Arc::new(Foo);
    let foo2 = Arc::clone(&foo);

    drop(foo);    // Doesn't print anything
    drop(foo2);   // Prints "dropped!"

Run

### `impl<T> Drop for std::sync::Weak<T> where
T: ?Sized,` [src]

#### `fn drop(&mut self)`[src]

Drops the `Weak` pointer.

# Examples

    use std::sync::{Arc, Weak};

    struct Foo;

    impl Drop for Foo {
        fn drop(&mut self) {
            println!("dropped!");
        }
    }

    let foo = Arc::new(Foo);
    let weak_foo = Arc::downgrade(&foo);
    let other_weak_foo = Weak::clone(&weak_foo);

    drop(weak_foo);   // Doesn't print anything
    drop(foo);        // Prints "dropped!"

    assert!(other_weak_foo.upgrade().is_none());

Run

### `impl<T> Drop for std::vec::IntoIter<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T> Drop for Vec<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T: ?Sized> Drop for Mutex<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<T: ?Sized> Drop for RwLock<T>`[src]

#### `fn drop(&mut self)`[src]

### `impl<W: Write> Drop for BufWriter<W>`[src]

#### `fn drop(&mut self)`[src]

### `impl<const N: usize, T> Drop for std::array::IntoIter<T, N> where
[T; N]: LengthAtMost32,` [src]

#### `fn drop(&mut self)`[src]

Loading content...