]> git.lizzy.rs Git - rust.git/blob - src/libcollections/lib.rs
Rollup merge of #32158 - seanmonstar:dead-associated-type, r=alexcrichton
[rust.git] / src / libcollections / lib.rs
1 // Copyright 2013-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
4 //
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
10
11 //! Collection types.
12 //!
13 //! See [std::collections](../std/collections/index.html) for a detailed discussion of
14 //! collections in Rust.
15
16 #![crate_name = "collections"]
17 #![crate_type = "rlib"]
18 #![unstable(feature = "collections",
19             reason = "library is unlikely to be stabilized with the current \
20                       layout and name, use std::collections instead",
21             issue = "27783")]
22 #![doc(html_logo_url = "https://www.rust-lang.org/logos/rust-logo-128x128-blk-v2.png",
23        html_favicon_url = "https://doc.rust-lang.org/favicon.ico",
24        html_root_url = "https://doc.rust-lang.org/nightly/",
25        html_playground_url = "https://play.rust-lang.org/",
26        issue_tracker_base_url = "https://github.com/rust-lang/rust/issues/",
27        test(no_crate_inject, attr(allow(unused_variables), deny(warnings))))]
28
29 #![cfg_attr(test, allow(deprecated))] // rand
30 #![cfg_attr(not(test), feature(copy_from_slice))] // impl [T]
31 #![cfg_attr(not(stage0), deny(warnings))]
32
33 #![feature(alloc)]
34 #![feature(allow_internal_unstable)]
35 #![feature(box_patterns)]
36 #![feature(box_syntax)]
37 #![feature(core_intrinsics)]
38 #![feature(decode_utf16)]
39 #![feature(dropck_parametricity)]
40 #![feature(fmt_internals)]
41 #![feature(fmt_radix)]
42 #![feature(heap_api)]
43 #![feature(inclusive_range)]
44 #![feature(iter_arith)]
45 #![feature(lang_items)]
46 #![feature(nonzero)]
47 #![feature(num_bits_bytes)]
48 #![feature(pattern)]
49 #![feature(placement_in)]
50 #![feature(placement_new_protocol)]
51 #![feature(shared)]
52 #![feature(slice_bytes)]
53 #![feature(slice_patterns)]
54 #![feature(staged_api)]
55 #![feature(step_by)]
56 #![feature(str_char)]
57 #![feature(unboxed_closures)]
58 #![feature(unicode)]
59 #![feature(unique)]
60 #![feature(unsafe_no_drop_flag)]
61 #![cfg_attr(test, feature(rand, test))]
62
63 #![no_std]
64
65 extern crate rustc_unicode;
66 extern crate alloc;
67
68 #[cfg(test)]
69 #[macro_use]
70 extern crate std;
71 #[cfg(test)]
72 extern crate test;
73
74 #[doc(no_inline)]
75 pub use binary_heap::BinaryHeap;
76 #[doc(no_inline)]
77 pub use btree_map::BTreeMap;
78 #[doc(no_inline)]
79 pub use btree_set::BTreeSet;
80 #[doc(no_inline)]
81 pub use linked_list::LinkedList;
82 #[doc(no_inline)]
83 pub use enum_set::EnumSet;
84 #[doc(no_inline)]
85 pub use vec_deque::VecDeque;
86 #[doc(no_inline)]
87 pub use string::String;
88 #[doc(no_inline)]
89 pub use vec::Vec;
90
91 // Needed for the vec! macro
92 pub use alloc::boxed;
93
94 #[macro_use]
95 mod macros;
96
97 pub mod binary_heap;
98 mod btree;
99 pub mod borrow;
100 pub mod enum_set;
101 pub mod fmt;
102 pub mod linked_list;
103 pub mod range;
104 pub mod slice;
105 pub mod str;
106 pub mod string;
107 pub mod vec;
108 pub mod vec_deque;
109
110 #[stable(feature = "rust1", since = "1.0.0")]
111 pub mod btree_map {
112     #[stable(feature = "rust1", since = "1.0.0")]
113     pub use btree::map::*;
114 }
115
116 #[stable(feature = "rust1", since = "1.0.0")]
117 pub mod btree_set {
118     #[stable(feature = "rust1", since = "1.0.0")]
119     pub use btree::set::*;
120 }
121
122 #[cfg(not(test))]
123 mod std {
124     pub use core::ops;      // RangeFull
125 }
126
127 /// An endpoint of a range of keys.
128 #[unstable(feature = "collections_bound", issue = "27787")]
129 #[derive(Clone, Copy, Debug, Hash, PartialEq, Eq)]
130 pub enum Bound<T> {
131     /// An inclusive bound.
132     Included(T),
133     /// An exclusive bound.
134     Excluded(T),
135     /// An infinite endpoint. Indicates that there is no bound in this direction.
136     Unbounded,
137 }