Conflicts: mk/tests.mk src/liballoc/arc.rs src/liballoc/boxed.rs src/liballoc/rc.rs src/libcollections/bit.rs src/libcollections/btree/map.rs src/libcollections/btree/set.rs src/libcollections/dlist.rs src/libcollections/ring_buf.rs src/libcollections/slice.rs src/libcollections/str.rs src/libcollections/string.rs src/libcollections/vec.rs src/libcollections/vec_map.rs src/libcore/any.rs src/libcore/array.rs src/libcore/borrow.rs src/libcore/error.rs src/libcore/fmt/mod.rs src/libcore/iter.rs src/libcore/marker.rs src/libcore/ops.rs src/libcore/result.rs src/libcore/slice.rs src/libcore/str/mod.rs src/libregex/lib.rs src/libregex/re.rs src/librustc/lint/builtin.rs src/libstd/collections/hash/map.rs src/libstd/collections/hash/set.rs src/libstd/sync/mpsc/mod.rs src/libstd/sync/mutex.rs src/libstd/sync/poison.rs src/libstd/sync/rwlock.rs src/libsyntax/feature_gate.rs src/libsyntax/test.rs
271 lines
7.6 KiB
Rust
271 lines
7.6 KiB
Rust
// Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
|
|
// file at the top-level directory of this distribution and at
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
// option. This file may not be copied, modified, or distributed
|
|
// except according to those terms.
|
|
|
|
//! A pointer type for heap allocation.
|
|
//!
|
|
//! `Box<T>`, casually referred to as a 'box', provides the simplest form of heap allocation in
|
|
//! Rust. Boxes provide ownership for this allocation, and drop their contents when they go out of
|
|
//! scope.
|
|
//!
|
|
//! Boxes are useful in two situations: recursive data structures, and occasionally when returning
|
|
//! data. [The Pointer chapter of the Book](../../../book/pointers.html#best-practices-1) explains
|
|
//! these cases in detail.
|
|
//!
|
|
//! # Examples
|
|
//!
|
|
//! Creating a box:
|
|
//!
|
|
//! ```
|
|
//! let x = Box::new(5);
|
|
//! ```
|
|
//!
|
|
//! Creating a recursive data structure:
|
|
//!
|
|
//! ```
|
|
//! #[derive(Show)]
|
|
//! enum List<T> {
|
|
//! Cons(T, Box<List<T>>),
|
|
//! Nil,
|
|
//! }
|
|
//!
|
|
//! fn main() {
|
|
//! let list: List<i32> = List::Cons(1, Box::new(List::Cons(2, Box::new(List::Nil))));
|
|
//! println!("{:?}", list);
|
|
//! }
|
|
//! ```
|
|
//!
|
|
//! This will print `Cons(1i32, Box(Cons(2i32, Box(Nil))))`.
|
|
|
|
#![stable(feature = "rust1", since = "1.0.0")]
|
|
|
|
use core::any::Any;
|
|
use core::clone::Clone;
|
|
use core::cmp::{PartialEq, PartialOrd, Eq, Ord, Ordering};
|
|
use core::default::Default;
|
|
use core::error::{Error, FromError};
|
|
use core::fmt;
|
|
use core::hash::{self, Hash};
|
|
use core::iter::Iterator;
|
|
use core::marker::Sized;
|
|
use core::mem;
|
|
use core::ops::{Deref, DerefMut};
|
|
use core::option::Option;
|
|
use core::ptr::Unique;
|
|
use core::raw::TraitObject;
|
|
use core::result::Result::{Ok, Err};
|
|
use core::result::Result;
|
|
|
|
/// A value that represents the heap. This is the default place that the `box` keyword allocates
|
|
/// into when no place is supplied.
|
|
///
|
|
/// The following two examples are equivalent:
|
|
///
|
|
/// ```rust
|
|
/// #![feature(box_syntax)]
|
|
/// use std::boxed::HEAP;
|
|
///
|
|
/// fn main() {
|
|
/// let foo = box(HEAP) 5;
|
|
/// let foo = box 5;
|
|
/// }
|
|
/// ```
|
|
#[lang = "exchange_heap"]
|
|
#[unstable(feature = "alloc",
|
|
reason = "may be renamed; uncertain about custom allocator design")]
|
|
pub static HEAP: () = ();
|
|
|
|
/// A pointer type for heap allocation.
|
|
///
|
|
/// See the [module-level documentation](../../std/boxed/index.html) for more.
|
|
#[lang = "owned_box"]
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
pub struct Box<T>(Unique<T>);
|
|
|
|
impl<T> Box<T> {
|
|
/// Allocates memory on the heap and then moves `x` into it.
|
|
///
|
|
/// # Examples
|
|
///
|
|
/// ```
|
|
/// let x = Box::new(5);
|
|
/// ```
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
pub fn new(x: T) -> Box<T> {
|
|
box x
|
|
}
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: Default> Default for Box<T> {
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
fn default() -> Box<T> { box Default::default() }
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T> Default for Box<[T]> {
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
fn default() -> Box<[T]> { box [] }
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: Clone> Clone for Box<T> {
|
|
/// Returns a new box with a `clone()` of this box's contents.
|
|
///
|
|
/// # Examples
|
|
///
|
|
/// ```
|
|
/// let x = Box::new(5);
|
|
/// let y = x.clone();
|
|
/// ```
|
|
#[inline]
|
|
fn clone(&self) -> Box<T> { box {(**self).clone()} }
|
|
|
|
/// Copies `source`'s contents into `self` without creating a new allocation.
|
|
///
|
|
/// # Examples
|
|
///
|
|
/// ```
|
|
/// let x = Box::new(5);
|
|
/// let mut y = Box::new(10);
|
|
///
|
|
/// y.clone_from(&x);
|
|
///
|
|
/// assert_eq!(*y, 5);
|
|
/// ```
|
|
#[inline]
|
|
fn clone_from(&mut self, source: &Box<T>) {
|
|
(**self).clone_from(&(**source));
|
|
}
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: ?Sized + PartialEq> PartialEq for Box<T> {
|
|
#[inline]
|
|
fn eq(&self, other: &Box<T>) -> bool { PartialEq::eq(&**self, &**other) }
|
|
#[inline]
|
|
fn ne(&self, other: &Box<T>) -> bool { PartialEq::ne(&**self, &**other) }
|
|
}
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: ?Sized + PartialOrd> PartialOrd for Box<T> {
|
|
#[inline]
|
|
fn partial_cmp(&self, other: &Box<T>) -> Option<Ordering> {
|
|
PartialOrd::partial_cmp(&**self, &**other)
|
|
}
|
|
#[inline]
|
|
fn lt(&self, other: &Box<T>) -> bool { PartialOrd::lt(&**self, &**other) }
|
|
#[inline]
|
|
fn le(&self, other: &Box<T>) -> bool { PartialOrd::le(&**self, &**other) }
|
|
#[inline]
|
|
fn ge(&self, other: &Box<T>) -> bool { PartialOrd::ge(&**self, &**other) }
|
|
#[inline]
|
|
fn gt(&self, other: &Box<T>) -> bool { PartialOrd::gt(&**self, &**other) }
|
|
}
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: ?Sized + Ord> Ord for Box<T> {
|
|
#[inline]
|
|
fn cmp(&self, other: &Box<T>) -> Ordering {
|
|
Ord::cmp(&**self, &**other)
|
|
}
|
|
}
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: ?Sized + Eq> Eq for Box<T> {}
|
|
|
|
impl<S: hash::Hasher, T: ?Sized + Hash<S>> Hash<S> for Box<T> {
|
|
#[inline]
|
|
fn hash(&self, state: &mut S) {
|
|
(**self).hash(state);
|
|
}
|
|
}
|
|
|
|
/// Extension methods for an owning `Any` trait object.
|
|
#[unstable(feature = "alloc",
|
|
reason = "this trait will likely disappear once compiler bugs blocking \
|
|
a direct impl on `Box<Any>` have been fixed ")]
|
|
// FIXME(#18737): this should be a direct impl on `Box<Any>`. If you're
|
|
// removing this please make sure that you can downcase on
|
|
// `Box<Any + Send>` as well as `Box<Any>`
|
|
pub trait BoxAny {
|
|
/// Returns the boxed value if it is of type `T`, or
|
|
/// `Err(Self)` if it isn't.
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
fn downcast<T: 'static>(self) -> Result<Box<T>, Self>;
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl BoxAny for Box<Any> {
|
|
#[inline]
|
|
fn downcast<T: 'static>(self) -> Result<Box<T>, Box<Any>> {
|
|
if self.is::<T>() {
|
|
unsafe {
|
|
// Get the raw representation of the trait object
|
|
let to: TraitObject =
|
|
mem::transmute::<Box<Any>, TraitObject>(self);
|
|
|
|
// Extract the data pointer
|
|
Ok(mem::transmute(to.data))
|
|
}
|
|
} else {
|
|
Err(self)
|
|
}
|
|
}
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: fmt::Display + ?Sized> fmt::Display for Box<T> {
|
|
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
|
|
fmt::Display::fmt(&**self, f)
|
|
}
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: fmt::Debug + ?Sized> fmt::Debug for Box<T> {
|
|
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
|
|
fmt::Debug::fmt(&**self, f)
|
|
}
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl fmt::Debug for Box<Any> {
|
|
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
|
|
f.pad("Box<Any>")
|
|
}
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: ?Sized> Deref for Box<T> {
|
|
type Target = T;
|
|
|
|
fn deref(&self) -> &T { &**self }
|
|
}
|
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]
|
|
impl<T: ?Sized> DerefMut for Box<T> {
|
|
fn deref_mut(&mut self) -> &mut T { &mut **self }
|
|
}
|
|
|
|
// FIXME(#21363) remove `old_impl_check` when bug is fixed
|
|
#[old_impl_check]
|
|
impl<'a, T> Iterator for Box<Iterator<Item=T> + 'a> {
|
|
type Item = T;
|
|
|
|
fn next(&mut self) -> Option<T> {
|
|
(**self).next()
|
|
}
|
|
|
|
fn size_hint(&self) -> (usize, Option<usize>) {
|
|
(**self).size_hint()
|
|
}
|
|
}
|
|
|
|
impl<'a, E: Error + 'a> FromError<E> for Box<Error + 'a> {
|
|
fn from_error(err: E) -> Box<Error + 'a> {
|
|
Box::new(err)
|
|
}
|
|
}
|