// Copyright 2013-2014 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 or the MIT license // , at your // option. This file may not be copied, modified, or distributed // except according to those terms. //! Collection types. //! //! See [std::collections](../std/collections/index.html) for a detailed discussion of //! collections in Rust. #![crate_name = "collections"] #![crate_type = "rlib"] #![unstable(feature = "collections", reason = "library is unlikely to be stabilized with the current \ layout and name, use std::collections instead", issue = "27783")] #![doc(html_logo_url = "https://www.rust-lang.org/logos/rust-logo-128x128-blk-v2.png", html_favicon_url = "https://doc.rust-lang.org/favicon.ico", html_root_url = "https://doc.rust-lang.org/nightly/", html_playground_url = "https://play.rust-lang.org/", issue_tracker_base_url = "https://github.com/rust-lang/rust/issues/", test(no_crate_inject, attr(allow(unused_variables), deny(warnings))))] #![cfg_attr(test, allow(deprecated))] // rand #![cfg_attr(not(stage0), deny(warnings))] #![feature(alloc)] #![feature(allow_internal_unstable)] #![feature(box_patterns)] #![feature(box_syntax)] #![cfg_attr(not(test), feature(char_escape_debug))] #![feature(core_intrinsics)] #![feature(dropck_parametricity)] #![feature(fmt_internals)] #![feature(fused)] #![feature(heap_api)] #![feature(inclusive_range)] #![feature(lang_items)] #![feature(nonzero)] #![feature(pattern)] #![feature(placement_in)] #![feature(placement_new_protocol)] #![feature(shared)] #![feature(slice_patterns)] #![feature(specialization)] #![feature(staged_api)] #![feature(step_by)] #![feature(unicode)] #![feature(unique)] #![cfg_attr(stage0, feature(unsafe_no_drop_flag))] #![cfg_attr(test, feature(rand, test))] #![no_std] extern crate rustc_unicode; extern crate alloc; #[cfg(test)] #[macro_use] extern crate std; #[cfg(test)] extern crate test; #[doc(no_inline)] pub use binary_heap::BinaryHeap; #[doc(no_inline)] pub use btree_map::BTreeMap; #[doc(no_inline)] pub use btree_set::BTreeSet; #[doc(no_inline)] pub use linked_list::LinkedList; #[doc(no_inline)] pub use enum_set::EnumSet; #[doc(no_inline)] pub use vec_deque::VecDeque; #[doc(no_inline)] pub use string::String; #[doc(no_inline)] pub use vec::Vec; // Needed for the vec! macro pub use alloc::boxed; #[macro_use] mod macros; pub mod binary_heap; mod btree; pub mod borrow; pub mod enum_set; pub mod fmt; pub mod linked_list; pub mod range; pub mod slice; pub mod str; pub mod string; pub mod vec; pub mod vec_deque; #[stable(feature = "rust1", since = "1.0.0")] pub mod btree_map { //! A map based on a B-Tree. #[stable(feature = "rust1", since = "1.0.0")] pub use btree::map::*; } #[stable(feature = "rust1", since = "1.0.0")] pub mod btree_set { //! A set based on a B-Tree. #[stable(feature = "rust1", since = "1.0.0")] pub use btree::set::*; } #[cfg(not(test))] mod std { pub use core::ops; // RangeFull } /// An endpoint of a range of keys. #[unstable(feature = "collections_bound", issue = "27787")] #[derive(Clone, Copy, Debug, Hash, PartialEq, Eq)] pub enum Bound { /// An inclusive bound. Included(T), /// An exclusive bound. Excluded(T), /// An infinite endpoint. Indicates that there is no bound in this direction. Unbounded, } /// An intermediate trait for specialization of `Extend`. #[doc(hidden)] trait SpecExtend { /// Extends `self` with the contents of the given iterator. fn spec_extend(&mut self, iter: I); }