2014-01-24 01:40:54 -06:00
|
|
|
// Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
|
2012-12-03 18:48:01 -06:00
|
|
|
// 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.
|
|
|
|
|
2014-04-25 02:39:58 -05:00
|
|
|
//! # The Rust Standard Library
|
2013-10-31 17:09:24 -05:00
|
|
|
//!
|
2014-04-25 02:39:58 -05:00
|
|
|
//! The Rust Standard Library provides the essential runtime
|
|
|
|
//! functionality for building portable Rust software.
|
|
|
|
//! It is linked to all Rust crates by default.
|
2013-10-31 17:09:24 -05:00
|
|
|
//!
|
2014-04-25 02:39:58 -05:00
|
|
|
//! ## Intrinsic types and operations
|
2013-10-31 17:09:24 -05:00
|
|
|
//!
|
2014-05-24 13:56:38 -05:00
|
|
|
//! The [`ptr`](ptr/index.html) and [`mem`](mem/index.html)
|
2014-05-19 23:51:21 -05:00
|
|
|
//! modules deal with unsafe pointers and memory manipulation.
|
2015-01-18 08:17:44 -06:00
|
|
|
//! [`marker`](marker/index.html) defines the special built-in traits,
|
2014-05-24 13:56:38 -05:00
|
|
|
//! and [`raw`](raw/index.html) the runtime representation of Rust types.
|
2014-05-22 11:44:54 -05:00
|
|
|
//! These are some of the lowest-level building blocks in Rust.
|
2013-10-31 17:09:24 -05:00
|
|
|
//!
|
2014-04-25 02:39:58 -05:00
|
|
|
//! ## Math on primitive types and math traits
|
2013-10-31 17:09:24 -05:00
|
|
|
//!
|
2014-04-25 02:39:58 -05:00
|
|
|
//! Although basic operations on primitive types are implemented
|
|
|
|
//! directly by the compiler, the standard library additionally
|
|
|
|
//! defines many common operations through traits defined in
|
|
|
|
//! mod [`num`](num/index.html).
|
2013-10-31 17:09:24 -05:00
|
|
|
//!
|
2014-04-25 02:39:58 -05:00
|
|
|
//! ## Pervasive types
|
2013-10-31 17:09:24 -05:00
|
|
|
//!
|
2014-05-24 13:56:38 -05:00
|
|
|
//! The [`option`](option/index.html) and [`result`](result/index.html)
|
2014-04-25 02:39:58 -05:00
|
|
|
//! modules define optional and error-handling types, `Option` and `Result`.
|
2014-05-24 13:56:38 -05:00
|
|
|
//! [`iter`](iter/index.html) defines Rust's iterator protocol
|
2014-04-25 02:39:58 -05:00
|
|
|
//! along with a wide variety of iterators.
|
2014-05-24 13:56:38 -05:00
|
|
|
//! [`Cell` and `RefCell`](cell/index.html) are for creating types that
|
2014-04-25 02:39:58 -05:00
|
|
|
//! manage their own mutability.
|
2013-10-31 17:09:24 -05:00
|
|
|
//!
|
2014-04-25 02:39:58 -05:00
|
|
|
//! ## Vectors, slices and strings
|
|
|
|
//!
|
|
|
|
//! The common container type, `Vec`, a growable vector backed by an
|
|
|
|
//! array, lives in the [`vec`](vec/index.html) module. References to
|
|
|
|
//! arrays, `&[T]`, more commonly called "slices", are built-in types
|
|
|
|
//! for which the [`slice`](slice/index.html) module defines many
|
|
|
|
//! methods.
|
|
|
|
//!
|
2014-05-19 19:23:26 -05:00
|
|
|
//! `&str`, a UTF-8 string, is a built-in type, and the standard library
|
|
|
|
//! defines methods for it on a variety of traits in the
|
|
|
|
//! [`str`](str/index.html) module. Rust strings are immutable;
|
2014-05-27 13:37:30 -05:00
|
|
|
//! use the `String` type defined in [`string`](string/index.html)
|
2014-04-25 02:39:58 -05:00
|
|
|
//! for a mutable string builder.
|
|
|
|
//!
|
|
|
|
//! For converting to strings use the [`format!`](fmt/index.html)
|
|
|
|
//! macro, and for converting from strings use the
|
2014-11-14 22:52:00 -06:00
|
|
|
//! [`FromStr`](str/trait.FromStr.html) trait.
|
2014-04-25 02:39:58 -05:00
|
|
|
//!
|
|
|
|
//! ## Platform abstractions
|
|
|
|
//!
|
|
|
|
//! Besides basic data types, the standard library is largely concerned
|
|
|
|
//! with abstracting over differences in common platforms, most notably
|
|
|
|
//! Windows and Unix derivatives. The [`os`](os/index.html) module
|
|
|
|
//! provides a number of basic functions for interacting with the
|
|
|
|
//! operating environment, including program arguments, environment
|
|
|
|
//! variables, and directory navigation. The [`path`](path/index.html)
|
|
|
|
//! module encapsulates the platform-specific rules for dealing
|
|
|
|
//! with file paths.
|
|
|
|
//!
|
|
|
|
//! `std` also includes modules for interoperating with the
|
|
|
|
//! C language: [`c_str`](c_str/index.html) and
|
|
|
|
//! [`c_vec`](c_vec/index.html).
|
|
|
|
//!
|
|
|
|
//! ## Concurrency, I/O, and the runtime
|
|
|
|
//!
|
2015-01-10 18:12:00 -06:00
|
|
|
//! The [`thread`](thread/index.html) module contains Rust's threading abstractions,
|
2014-04-25 02:39:58 -05:00
|
|
|
//! while [`comm`](comm/index.html) contains the channel types for message
|
|
|
|
//! passing. [`sync`](sync/index.html) contains further, primitive, shared
|
2014-11-10 01:22:10 -06:00
|
|
|
//! memory types, including [`atomic`](sync/atomic/index.html).
|
2014-04-25 02:39:58 -05:00
|
|
|
//!
|
2014-07-12 20:06:53 -05:00
|
|
|
//! Common types of I/O, including files, TCP, UDP, pipes, Unix domain sockets,
|
2014-05-07 01:29:57 -05:00
|
|
|
//! timers, and process spawning, are defined in the [`io`](io/index.html) module.
|
2014-04-25 02:39:58 -05:00
|
|
|
//!
|
|
|
|
//! Rust's I/O and concurrency depends on a small runtime interface
|
|
|
|
//! that lives, along with its support code, in mod [`rt`](rt/index.html).
|
|
|
|
//! While a notable part of the standard library's architecture, this
|
|
|
|
//! module is not intended for public use.
|
|
|
|
//!
|
|
|
|
//! ## The Rust prelude and macros
|
|
|
|
//!
|
2014-05-07 01:29:57 -05:00
|
|
|
//! Finally, the [`prelude`](prelude/index.html) defines a
|
2014-04-25 02:39:58 -05:00
|
|
|
//! common set of traits, types, and functions that are made available
|
|
|
|
//! to all code by default. [`macros`](macros/index.html) contains
|
2014-10-09 14:17:22 -05:00
|
|
|
//! all the standard macros, such as `assert!`, `panic!`, `println!`,
|
2014-05-07 01:29:57 -05:00
|
|
|
//! and `format!`, also available to all Rust code.
|
2012-11-30 02:47:45 -06:00
|
|
|
|
2014-07-01 09:12:04 -05:00
|
|
|
#![crate_name = "std"]
|
2015-01-12 20:40:19 -06:00
|
|
|
#![stable(feature = "grandfathered", since = "1.0.0")]
|
2015-01-21 20:21:14 -06:00
|
|
|
#![feature(staged_api)]
|
Preliminary feature staging
This partially implements the feature staging described in the
[release channel RFC][rc]. It does not yet fully conform to the RFC as
written, but does accomplish its goals sufficiently for the 1.0 alpha
release.
It has three primary user-visible effects:
* On the nightly channel, use of unstable APIs generates a warning.
* On the beta channel, use of unstable APIs generates a warning.
* On the beta channel, use of feature gates generates a warning.
Code that does not trigger these warnings is considered 'stable',
modulo pre-1.0 bugs.
Disabling the warnings for unstable APIs continues to be done in the
existing (i.e. old) style, via `#[allow(...)]`, not that specified in
the RFC. I deem this marginally acceptable since any code that must do
this is not using the stable dialect of Rust.
Use of feature gates is itself gated with the new 'unstable_features'
lint, on nightly set to 'allow', and on beta 'warn'.
The attribute scheme used here corresponds to an older version of the
RFC, with the `#[staged_api]` crate attribute toggling the staging
behavior of the stability attributes, but the user impact is only
in-tree so I'm not concerned about having to make design changes later
(and I may ultimately prefer the scheme here after all, with the
`#[staged_api]` crate attribute).
Since the Rust codebase itself makes use of unstable features the
compiler and build system to a midly elaborate dance to allow it to
bootstrap while disobeying these lints (which would otherwise be
errors because Rust builds with `-D warnings`).
This patch includes one significant hack that causes a
regression. Because the `format_args!` macro emits calls to unstable
APIs it would trigger the lint. I added a hack to the lint to make it
not trigger, but this in turn causes arguments to `println!` not to be
checked for feature gates. I don't presently understand macro
expansion well enough to fix. This is bug #20661.
Closes #16678
[rc]: https://github.com/rust-lang/rfcs/blob/master/text/0507-release-channels.md
2015-01-06 08:26:08 -06:00
|
|
|
#![staged_api]
|
2014-03-21 20:05:05 -05:00
|
|
|
#![crate_type = "rlib"]
|
|
|
|
#![crate_type = "dylib"]
|
|
|
|
#![doc(html_logo_url = "http://www.rust-lang.org/logos/rust-logo-128x128-blk-v2.png",
|
|
|
|
html_favicon_url = "http://www.rust-lang.org/favicon.ico",
|
2014-10-09 12:47:22 -05:00
|
|
|
html_root_url = "http://doc.rust-lang.org/nightly/",
|
2014-06-06 11:12:18 -05:00
|
|
|
html_playground_url = "http://play.rust-lang.org/")]
|
2014-06-17 18:00:04 -05:00
|
|
|
|
2014-09-26 00:48:16 -05:00
|
|
|
#![allow(unknown_features)]
|
2015-01-06 11:24:46 -06:00
|
|
|
#![feature(linkage, thread_local, asm)]
|
2015-01-06 18:16:35 -06:00
|
|
|
#![feature(lang_items, unsafe_destructor)]
|
2014-12-03 17:58:26 -06:00
|
|
|
#![feature(slicing_syntax, unboxed_closures)]
|
2015-01-07 08:15:34 -06:00
|
|
|
#![feature(box_syntax)]
|
2015-01-05 13:01:31 -06:00
|
|
|
#![feature(old_impl_check)]
|
2015-01-11 04:10:04 -06:00
|
|
|
#![feature(optin_builtin_traits)]
|
2015-01-16 14:20:03 -06:00
|
|
|
#![feature(int_uint)]
|
2015-01-17 00:33:24 -06:00
|
|
|
#![feature(int_uint)]
|
2015-01-14 17:20:14 -06:00
|
|
|
#![feature(unnamed_feature)]
|
2013-10-02 20:10:16 -05:00
|
|
|
|
2013-05-17 15:12:42 -05:00
|
|
|
// Don't link to std. We are std.
|
2014-03-21 20:05:05 -05:00
|
|
|
#![no_std]
|
2012-04-19 03:00:52 -05:00
|
|
|
|
2014-10-27 17:37:07 -05:00
|
|
|
#![deny(missing_docs)]
|
2012-06-04 20:34:24 -05:00
|
|
|
|
2015-01-06 11:24:46 -06:00
|
|
|
#[cfg(test)]
|
2014-12-31 22:43:46 -06:00
|
|
|
#[macro_use]
|
|
|
|
extern crate log;
|
2013-10-22 17:13:18 -05:00
|
|
|
|
2014-12-31 22:43:46 -06:00
|
|
|
#[macro_use]
|
2015-01-08 14:21:51 -06:00
|
|
|
#[macro_reexport(assert, assert_eq, debug_assert, debug_assert_eq,
|
|
|
|
unreachable, unimplemented, write, writeln)]
|
2014-04-30 22:04:56 -05:00
|
|
|
extern crate core;
|
2014-12-31 22:43:46 -06:00
|
|
|
|
|
|
|
#[macro_use]
|
2015-01-01 18:37:47 -06:00
|
|
|
#[macro_reexport(vec)]
|
2014-09-01 10:59:23 -05:00
|
|
|
extern crate "collections" as core_collections;
|
2014-12-31 22:43:46 -06:00
|
|
|
|
2014-09-01 10:59:23 -05:00
|
|
|
extern crate "rand" as core_rand;
|
2014-09-15 21:29:47 -05:00
|
|
|
extern crate alloc;
|
|
|
|
extern crate unicode;
|
2014-06-03 22:09:39 -05:00
|
|
|
extern crate libc;
|
2014-02-24 12:16:03 -06:00
|
|
|
|
2015-01-16 14:20:03 -06:00
|
|
|
#[macro_use] #[no_link] extern crate rustc_bitflags;
|
|
|
|
|
2013-06-17 01:21:49 -05:00
|
|
|
// Make std testable by not duplicating lang items. See #2912
|
2014-09-01 10:59:23 -05:00
|
|
|
#[cfg(test)] extern crate "std" as realstd;
|
2015-01-06 16:33:42 -06:00
|
|
|
#[cfg(test)] pub use realstd::marker;
|
2014-05-13 18:10:05 -05:00
|
|
|
#[cfg(test)] pub use realstd::ops;
|
|
|
|
#[cfg(test)] pub use realstd::cmp;
|
2014-07-10 16:19:17 -05:00
|
|
|
#[cfg(test)] pub use realstd::boxed;
|
2013-03-26 21:53:33 -05:00
|
|
|
|
2014-05-20 12:38:05 -05:00
|
|
|
|
|
|
|
// NB: These reexports are in the order they should be listed in rustdoc
|
2014-04-30 22:22:55 -05:00
|
|
|
|
2014-04-30 22:36:58 -05:00
|
|
|
pub use core::any;
|
2014-11-12 14:01:26 -06:00
|
|
|
pub use core::borrow;
|
2014-05-01 13:19:56 -05:00
|
|
|
pub use core::cell;
|
2014-04-30 22:55:38 -05:00
|
|
|
pub use core::clone;
|
2014-05-20 12:38:05 -05:00
|
|
|
#[cfg(not(test))] pub use core::cmp;
|
2014-04-30 22:46:51 -05:00
|
|
|
pub use core::default;
|
2014-05-21 00:27:24 -05:00
|
|
|
pub use core::finally;
|
std: Stabilize the std::hash module
This commit aims to prepare the `std::hash` module for alpha by formalizing its
current interface whileholding off on adding `#[stable]` to the new APIs. The
current usage with the `HashMap` and `HashSet` types is also reconciled by
separating out composable parts of the design. The primary goal of this slight
redesign is to separate the concepts of a hasher's state from a hashing
algorithm itself.
The primary change of this commit is to separate the `Hasher` trait into a
`Hasher` and a `HashState` trait. Conceptually the old `Hasher` trait was
actually just a factory for various states, but hashing had very little control
over how these states were used. Additionally the old `Hasher` trait was
actually fairly unrelated to hashing.
This commit redesigns the existing `Hasher` trait to match what the notion of a
`Hasher` normally implies with the following definition:
trait Hasher {
type Output;
fn reset(&mut self);
fn finish(&self) -> Output;
}
This `Hasher` trait emphasizes that hashing algorithms may produce outputs other
than a `u64`, so the output type is made generic. Other than that, however, very
little is assumed about a particular hasher. It is left up to implementors to
provide specific methods or trait implementations to feed data into a hasher.
The corresponding `Hash` trait becomes:
trait Hash<H: Hasher> {
fn hash(&self, &mut H);
}
The old default of `SipState` was removed from this trait as it's not something
that we're willing to stabilize until the end of time, but the type parameter is
always required to implement `Hasher`. Note that the type parameter `H` remains
on the trait to enable multidispatch for specialization of hashing for
particular hashers.
Note that `Writer` is not mentioned in either of `Hash` or `Hasher`, it is
simply used as part `derive` and the implementations for all primitive types.
With these definitions, the old `Hasher` trait is realized as a new `HashState`
trait in the `collections::hash_state` module as an unstable addition for
now. The current definition looks like:
trait HashState {
type Hasher: Hasher;
fn hasher(&self) -> Hasher;
}
The purpose of this trait is to emphasize that the one piece of functionality
for implementors is that new instances of `Hasher` can be created. This
conceptually represents the two keys from which more instances of a
`SipHasher` can be created, and a `HashState` is what's stored in a
`HashMap`, not a `Hasher`.
Implementors of custom hash algorithms should implement the `Hasher` trait, and
only hash algorithms intended for use in hash maps need to implement or worry
about the `HashState` trait.
The entire module and `HashState` infrastructure remains `#[unstable]` due to it
being recently redesigned, but some other stability decision made for the
`std::hash` module are:
* The `Writer` trait remains `#[experimental]` as it's intended to be replaced
with an `io::Writer` (more details soon).
* The top-level `hash` function is `#[unstable]` as it is intended to be generic
over the hashing algorithm instead of hardwired to `SipHasher`
* The inner `sip` module is now private as its one export, `SipHasher` is
reexported in the `hash` module.
And finally, a few changes were made to the default parameters on `HashMap`.
* The `RandomSipHasher` default type parameter was renamed to `RandomState`.
This renaming emphasizes that it is not a hasher, but rather just state to
generate hashers. It also moves away from the name "sip" as it may not always
be implemented as `SipHasher`. This type lives in the
`std::collections::hash_map` module as `#[unstable]`
* The associated `Hasher` type of `RandomState` is creatively called...
`Hasher`! This concrete structure lives next to `RandomState` as an
implemenation of the "default hashing algorithm" used for a `HashMap`. Under
the hood this is currently implemented as `SipHasher`, but it draws an
explicit interface for now and allows us to modify the implementation over
time if necessary.
There are many breaking changes outlined above, and as a result this commit is
a:
[breaking-change]
2014-12-09 14:37:23 -06:00
|
|
|
pub use core::hash;
|
2014-04-30 22:04:56 -05:00
|
|
|
pub use core::intrinsics;
|
2014-04-30 23:41:03 -05:00
|
|
|
pub use core::iter;
|
2015-01-06 16:33:42 -06:00
|
|
|
#[cfg(not(test))] pub use core::marker;
|
2014-04-30 22:13:05 -05:00
|
|
|
pub use core::mem;
|
2014-05-20 12:38:05 -05:00
|
|
|
#[cfg(not(test))] pub use core::ops;
|
2014-04-30 22:17:50 -05:00
|
|
|
pub use core::ptr;
|
2014-04-30 22:38:31 -05:00
|
|
|
pub use core::raw;
|
2014-05-20 22:24:17 -05:00
|
|
|
pub use core::simd;
|
2014-05-10 15:46:05 -05:00
|
|
|
pub use core::result;
|
2014-06-02 17:49:42 -05:00
|
|
|
pub use core::option;
|
2014-04-30 22:04:56 -05:00
|
|
|
|
2014-12-19 06:02:22 -06:00
|
|
|
#[cfg(not(test))] pub use alloc::boxed;
|
2014-05-13 18:10:05 -05:00
|
|
|
pub use alloc::rc;
|
|
|
|
|
std: Recreate a `collections` module
As with the previous commit with `librand`, this commit shuffles around some
`collections` code. The new state of the world is similar to that of librand:
* The libcollections crate now only depends on libcore and liballoc.
* The standard library has a new module, `std::collections`. All functionality
of libcollections is reexported through this module.
I would like to stress that this change is purely cosmetic. There are very few
alterations to these primitives.
There are a number of notable points about the new organization:
* std::{str, slice, string, vec} all moved to libcollections. There is no reason
that these primitives shouldn't be necessarily usable in a freestanding
context that has allocation. These are all reexported in their usual places in
the standard library.
* The `hashmap`, and transitively the `lru_cache`, modules no longer reside in
`libcollections`, but rather in libstd. The reason for this is because the
`HashMap::new` contructor requires access to the OSRng for initially seeding
the hash map. Beyond this requirement, there is no reason that the hashmap
could not move to libcollections.
I do, however, have a plan to move the hash map to the collections module. The
`HashMap::new` function could be altered to require that the `H` hasher
parameter ascribe to the `Default` trait, allowing the entire `hashmap` module
to live in libcollections. The key idea would be that the default hasher would
be different in libstd. Something along the lines of:
// src/libstd/collections/mod.rs
pub type HashMap<K, V, H = RandomizedSipHasher> =
core_collections::HashMap<K, V, H>;
This is not possible today because you cannot invoke static methods through
type aliases. If we modified the compiler, however, to allow invocation of
static methods through type aliases, then this type definition would
essentially be switching the default hasher from `SipHasher` in libcollections
to a libstd-defined `RandomizedSipHasher` type. This type's `Default`
implementation would randomly seed the `SipHasher` instance, and otherwise
perform the same as `SipHasher`.
This future state doesn't seem incredibly far off, but until that time comes,
the hashmap module will live in libstd to not compromise on functionality.
* In preparation for the hashmap moving to libcollections, the `hash` module has
moved from libstd to libcollections. A previously snapshotted commit enables a
distinct `Writer` trait to live in the `hash` module which `Hash`
implementations are now parameterized over.
Due to using a custom trait, the `SipHasher` implementation has lost its
specialized methods for writing integers. These can be re-added
backwards-compatibly in the future via default methods if necessary, but the
FNV hashing should satisfy much of the need for speedier hashing.
A list of breaking changes:
* HashMap::{get, get_mut} no longer fails with the key formatted into the error
message with `{:?}`, instead, a generic message is printed. With backtraces,
it should still be not-too-hard to track down errors.
* The HashMap, HashSet, and LruCache types are now available through
std::collections instead of the collections crate.
* Manual implementations of hash should be parameterized over `hash::Writer`
instead of just `Writer`.
[breaking-change]
2014-05-29 20:50:12 -05:00
|
|
|
pub use core_collections::slice;
|
|
|
|
pub use core_collections::str;
|
|
|
|
pub use core_collections::string;
|
2015-01-12 20:40:19 -06:00
|
|
|
#[stable(feature = "grandfathered", since = "1.0.0")]
|
std: Recreate a `collections` module
As with the previous commit with `librand`, this commit shuffles around some
`collections` code. The new state of the world is similar to that of librand:
* The libcollections crate now only depends on libcore and liballoc.
* The standard library has a new module, `std::collections`. All functionality
of libcollections is reexported through this module.
I would like to stress that this change is purely cosmetic. There are very few
alterations to these primitives.
There are a number of notable points about the new organization:
* std::{str, slice, string, vec} all moved to libcollections. There is no reason
that these primitives shouldn't be necessarily usable in a freestanding
context that has allocation. These are all reexported in their usual places in
the standard library.
* The `hashmap`, and transitively the `lru_cache`, modules no longer reside in
`libcollections`, but rather in libstd. The reason for this is because the
`HashMap::new` contructor requires access to the OSRng for initially seeding
the hash map. Beyond this requirement, there is no reason that the hashmap
could not move to libcollections.
I do, however, have a plan to move the hash map to the collections module. The
`HashMap::new` function could be altered to require that the `H` hasher
parameter ascribe to the `Default` trait, allowing the entire `hashmap` module
to live in libcollections. The key idea would be that the default hasher would
be different in libstd. Something along the lines of:
// src/libstd/collections/mod.rs
pub type HashMap<K, V, H = RandomizedSipHasher> =
core_collections::HashMap<K, V, H>;
This is not possible today because you cannot invoke static methods through
type aliases. If we modified the compiler, however, to allow invocation of
static methods through type aliases, then this type definition would
essentially be switching the default hasher from `SipHasher` in libcollections
to a libstd-defined `RandomizedSipHasher` type. This type's `Default`
implementation would randomly seed the `SipHasher` instance, and otherwise
perform the same as `SipHasher`.
This future state doesn't seem incredibly far off, but until that time comes,
the hashmap module will live in libstd to not compromise on functionality.
* In preparation for the hashmap moving to libcollections, the `hash` module has
moved from libstd to libcollections. A previously snapshotted commit enables a
distinct `Writer` trait to live in the `hash` module which `Hash`
implementations are now parameterized over.
Due to using a custom trait, the `SipHasher` implementation has lost its
specialized methods for writing integers. These can be re-added
backwards-compatibly in the future via default methods if necessary, but the
FNV hashing should satisfy much of the need for speedier hashing.
A list of breaking changes:
* HashMap::{get, get_mut} no longer fails with the key formatted into the error
message with `{:?}`, instead, a generic message is printed. With backtraces,
it should still be not-too-hard to track down errors.
* The HashMap, HashSet, and LruCache types are now available through
std::collections instead of the collections crate.
* Manual implementations of hash should be parameterized over `hash::Writer`
instead of just `Writer`.
[breaking-change]
2014-05-29 20:50:12 -05:00
|
|
|
pub use core_collections::vec;
|
|
|
|
|
Add libunicode; move unicode functions from core
- created new crate, libunicode, below libstd
- split Char trait into Char (libcore) and UnicodeChar (libunicode)
- Unicode-aware functions now live in libunicode
- is_alphabetic, is_XID_start, is_XID_continue, is_lowercase,
is_uppercase, is_whitespace, is_alphanumeric, is_control,
is_digit, to_uppercase, to_lowercase
- added width method in UnicodeChar trait
- determines printed width of character in columns, or None if it is
a non-NULL control character
- takes a boolean argument indicating whether the present context is
CJK or not (characters with 'A'mbiguous widths are double-wide in
CJK contexts, single-wide otherwise)
- split StrSlice into StrSlice (libcore) and UnicodeStrSlice
(libunicode)
- functionality formerly in StrSlice that relied upon Unicode
functionality from Char is now in UnicodeStrSlice
- words, is_whitespace, is_alphanumeric, trim, trim_left, trim_right
- also moved Words type alias into libunicode because words method is
in UnicodeStrSlice
- unified Unicode tables from libcollections, libcore, and libregex into
libunicode
- updated unicode.py in src/etc to generate aforementioned tables
- generated new tables based on latest Unicode data
- added UnicodeChar and UnicodeStrSlice traits to prelude
- libunicode is now the collection point for the std::char module,
combining the libunicode functionality with the Char functionality
from libcore
- thus, moved doc comment for char from core::char to unicode::char
- libcollections remains the collection point for std::str
The Unicode-aware functions that previously lived in the Char and
StrSlice traits are no longer available to programs that only use
libcore. To regain use of these methods, include the libunicode crate
and use the UnicodeChar and/or UnicodeStrSlice traits:
extern crate unicode;
use unicode::UnicodeChar;
use unicode::UnicodeStrSlice;
use unicode::Words; // if you want to use the words() method
NOTE: this does *not* impact programs that use libstd, since UnicodeChar
and UnicodeStrSlice have been added to the prelude.
closes #15224
[breaking-change]
2014-06-30 16:04:10 -05:00
|
|
|
pub use unicode::char;
|
|
|
|
|
2014-04-29 22:05:51 -05:00
|
|
|
/* Exported macros */
|
|
|
|
|
2015-01-06 11:24:46 -06:00
|
|
|
#[macro_use]
|
2015-01-06 13:07:09 -06:00
|
|
|
mod macros;
|
2014-12-18 22:09:57 -06:00
|
|
|
|
Add generation of static libraries to rustc
This commit implements the support necessary for generating both intermediate
and result static rust libraries. This is an implementation of my thoughts in
https://mail.mozilla.org/pipermail/rust-dev/2013-November/006686.html.
When compiling a library, we still retain the "lib" option, although now there
are "rlib", "staticlib", and "dylib" as options for crate_type (and these are
stackable). The idea of "lib" is to generate the "compiler default" instead of
having too choose (although all are interchangeable). For now I have left the
"complier default" to be a dynamic library for size reasons.
Of the rust libraries, lib{std,extra,rustuv} will bootstrap with an
rlib/dylib pair, but lib{rustc,syntax,rustdoc,rustpkg} will only be built as a
dynamic object. I chose this for size reasons, but also because you're probably
not going to be embedding the rustc compiler anywhere any time soon.
Other than the options outlined above, there are a few defaults/preferences that
are now opinionated in the compiler:
* If both a .dylib and .rlib are found for a rust library, the compiler will
prefer the .rlib variant. This is overridable via the -Z prefer-dynamic option
* If generating a "lib", the compiler will generate a dynamic library. This is
overridable by explicitly saying what flavor you'd like (rlib, staticlib,
dylib).
* If no options are passed to the command line, and no crate_type is found in
the destination crate, then an executable is generated
With this change, you can successfully build a rust program with 0 dynamic
dependencies on rust libraries. There is still a dynamic dependency on
librustrt, but I plan on removing that in a subsequent commit.
This change includes no tests just yet. Our current testing
infrastructure/harnesses aren't very amenable to doing flavorful things with
linking, so I'm planning on adding a new mode of testing which I believe belongs
as a separate commit.
Closes #552
2013-11-15 16:03:29 -06:00
|
|
|
mod rtdeps;
|
2013-03-06 21:09:17 -06:00
|
|
|
|
2013-01-08 21:37:25 -06:00
|
|
|
/* The Prelude. */
|
|
|
|
|
|
|
|
pub mod prelude;
|
2011-12-13 18:25:51 -06:00
|
|
|
|
2013-10-31 17:09:24 -05:00
|
|
|
|
2012-11-30 02:47:45 -06:00
|
|
|
/* Primitive types */
|
2012-04-14 19:21:10 -05:00
|
|
|
|
2014-12-18 22:09:57 -06:00
|
|
|
#[path = "num/float_macros.rs"]
|
2015-01-06 11:24:46 -06:00
|
|
|
#[macro_use]
|
2014-12-18 22:09:57 -06:00
|
|
|
mod float_macros;
|
|
|
|
|
|
|
|
#[path = "num/int_macros.rs"]
|
2015-01-06 11:24:46 -06:00
|
|
|
#[macro_use]
|
2014-12-18 22:09:57 -06:00
|
|
|
mod int_macros;
|
|
|
|
|
|
|
|
#[path = "num/uint_macros.rs"]
|
2015-01-06 11:24:46 -06:00
|
|
|
#[macro_use]
|
2014-12-18 22:09:57 -06:00
|
|
|
mod uint_macros;
|
2013-05-12 20:14:40 -05:00
|
|
|
|
|
|
|
#[path = "num/int.rs"] pub mod int;
|
2015-01-07 12:39:37 -06:00
|
|
|
#[path = "num/isize.rs"] pub mod isize;
|
2013-05-12 20:14:40 -05:00
|
|
|
#[path = "num/i8.rs"] pub mod i8;
|
|
|
|
#[path = "num/i16.rs"] pub mod i16;
|
|
|
|
#[path = "num/i32.rs"] pub mod i32;
|
|
|
|
#[path = "num/i64.rs"] pub mod i64;
|
|
|
|
|
|
|
|
#[path = "num/uint.rs"] pub mod uint;
|
2015-01-07 12:39:37 -06:00
|
|
|
#[path = "num/usize.rs"] pub mod usize;
|
2013-05-12 20:14:40 -05:00
|
|
|
#[path = "num/u8.rs"] pub mod u8;
|
|
|
|
#[path = "num/u16.rs"] pub mod u16;
|
|
|
|
#[path = "num/u32.rs"] pub mod u32;
|
|
|
|
#[path = "num/u64.rs"] pub mod u64;
|
|
|
|
|
|
|
|
#[path = "num/f32.rs"] pub mod f32;
|
|
|
|
#[path = "num/f64.rs"] pub mod f64;
|
2012-11-30 02:47:45 -06:00
|
|
|
|
2013-04-22 14:42:25 -05:00
|
|
|
pub mod ascii;
|
2014-11-23 21:21:17 -06:00
|
|
|
pub mod thunk;
|
2013-04-22 14:42:25 -05:00
|
|
|
|
2012-11-30 02:47:45 -06:00
|
|
|
/* Common traits */
|
|
|
|
|
2014-10-03 16:23:09 -05:00
|
|
|
pub mod error;
|
2012-10-03 21:24:06 -05:00
|
|
|
pub mod num;
|
std: Recreate a `collections` module
As with the previous commit with `librand`, this commit shuffles around some
`collections` code. The new state of the world is similar to that of librand:
* The libcollections crate now only depends on libcore and liballoc.
* The standard library has a new module, `std::collections`. All functionality
of libcollections is reexported through this module.
I would like to stress that this change is purely cosmetic. There are very few
alterations to these primitives.
There are a number of notable points about the new organization:
* std::{str, slice, string, vec} all moved to libcollections. There is no reason
that these primitives shouldn't be necessarily usable in a freestanding
context that has allocation. These are all reexported in their usual places in
the standard library.
* The `hashmap`, and transitively the `lru_cache`, modules no longer reside in
`libcollections`, but rather in libstd. The reason for this is because the
`HashMap::new` contructor requires access to the OSRng for initially seeding
the hash map. Beyond this requirement, there is no reason that the hashmap
could not move to libcollections.
I do, however, have a plan to move the hash map to the collections module. The
`HashMap::new` function could be altered to require that the `H` hasher
parameter ascribe to the `Default` trait, allowing the entire `hashmap` module
to live in libcollections. The key idea would be that the default hasher would
be different in libstd. Something along the lines of:
// src/libstd/collections/mod.rs
pub type HashMap<K, V, H = RandomizedSipHasher> =
core_collections::HashMap<K, V, H>;
This is not possible today because you cannot invoke static methods through
type aliases. If we modified the compiler, however, to allow invocation of
static methods through type aliases, then this type definition would
essentially be switching the default hasher from `SipHasher` in libcollections
to a libstd-defined `RandomizedSipHasher` type. This type's `Default`
implementation would randomly seed the `SipHasher` instance, and otherwise
perform the same as `SipHasher`.
This future state doesn't seem incredibly far off, but until that time comes,
the hashmap module will live in libstd to not compromise on functionality.
* In preparation for the hashmap moving to libcollections, the `hash` module has
moved from libstd to libcollections. A previously snapshotted commit enables a
distinct `Writer` trait to live in the `hash` module which `Hash`
implementations are now parameterized over.
Due to using a custom trait, the `SipHasher` implementation has lost its
specialized methods for writing integers. These can be re-added
backwards-compatibly in the future via default methods if necessary, but the
FNV hashing should satisfy much of the need for speedier hashing.
A list of breaking changes:
* HashMap::{get, get_mut} no longer fails with the key formatted into the error
message with `{:?}`, instead, a generic message is printed. With backtraces,
it should still be not-too-hard to track down errors.
* The HashMap, HashSet, and LruCache types are now available through
std::collections instead of the collections crate.
* Manual implementations of hash should be parameterized over `hash::Writer`
instead of just `Writer`.
[breaking-change]
2014-05-29 20:50:12 -05:00
|
|
|
|
2014-11-14 16:20:57 -06:00
|
|
|
/* Runtime and platform support */
|
|
|
|
|
2015-01-06 11:24:46 -06:00
|
|
|
#[macro_use]
|
2014-11-14 16:20:57 -06:00
|
|
|
pub mod thread_local;
|
2014-12-18 22:09:57 -06:00
|
|
|
|
2014-11-14 16:20:57 -06:00
|
|
|
pub mod dynamic_lib;
|
2014-11-25 15:28:35 -06:00
|
|
|
pub mod ffi;
|
2014-11-14 16:20:57 -06:00
|
|
|
pub mod fmt;
|
|
|
|
pub mod io;
|
|
|
|
pub mod os;
|
|
|
|
pub mod path;
|
|
|
|
pub mod rand;
|
|
|
|
pub mod time;
|
|
|
|
|
std: Recreate a `collections` module
As with the previous commit with `librand`, this commit shuffles around some
`collections` code. The new state of the world is similar to that of librand:
* The libcollections crate now only depends on libcore and liballoc.
* The standard library has a new module, `std::collections`. All functionality
of libcollections is reexported through this module.
I would like to stress that this change is purely cosmetic. There are very few
alterations to these primitives.
There are a number of notable points about the new organization:
* std::{str, slice, string, vec} all moved to libcollections. There is no reason
that these primitives shouldn't be necessarily usable in a freestanding
context that has allocation. These are all reexported in their usual places in
the standard library.
* The `hashmap`, and transitively the `lru_cache`, modules no longer reside in
`libcollections`, but rather in libstd. The reason for this is because the
`HashMap::new` contructor requires access to the OSRng for initially seeding
the hash map. Beyond this requirement, there is no reason that the hashmap
could not move to libcollections.
I do, however, have a plan to move the hash map to the collections module. The
`HashMap::new` function could be altered to require that the `H` hasher
parameter ascribe to the `Default` trait, allowing the entire `hashmap` module
to live in libcollections. The key idea would be that the default hasher would
be different in libstd. Something along the lines of:
// src/libstd/collections/mod.rs
pub type HashMap<K, V, H = RandomizedSipHasher> =
core_collections::HashMap<K, V, H>;
This is not possible today because you cannot invoke static methods through
type aliases. If we modified the compiler, however, to allow invocation of
static methods through type aliases, then this type definition would
essentially be switching the default hasher from `SipHasher` in libcollections
to a libstd-defined `RandomizedSipHasher` type. This type's `Default`
implementation would randomly seed the `SipHasher` instance, and otherwise
perform the same as `SipHasher`.
This future state doesn't seem incredibly far off, but until that time comes,
the hashmap module will live in libstd to not compromise on functionality.
* In preparation for the hashmap moving to libcollections, the `hash` module has
moved from libstd to libcollections. A previously snapshotted commit enables a
distinct `Writer` trait to live in the `hash` module which `Hash`
implementations are now parameterized over.
Due to using a custom trait, the `SipHasher` implementation has lost its
specialized methods for writing integers. These can be re-added
backwards-compatibly in the future via default methods if necessary, but the
FNV hashing should satisfy much of the need for speedier hashing.
A list of breaking changes:
* HashMap::{get, get_mut} no longer fails with the key formatted into the error
message with `{:?}`, instead, a generic message is printed. With backtraces,
it should still be not-too-hard to track down errors.
* The HashMap, HashSet, and LruCache types are now available through
std::collections instead of the collections crate.
* Manual implementations of hash should be parameterized over `hash::Writer`
instead of just `Writer`.
[breaking-change]
2014-05-29 20:50:12 -05:00
|
|
|
/* Common data structures */
|
|
|
|
|
|
|
|
pub mod collections;
|
2012-08-01 18:04:43 -05:00
|
|
|
|
2014-11-25 10:52:10 -06:00
|
|
|
/* Threads and communication */
|
2012-11-30 02:47:45 -06:00
|
|
|
|
2014-11-25 10:52:10 -06:00
|
|
|
pub mod thread;
|
2013-12-12 19:27:37 -06:00
|
|
|
pub mod sync;
|
2012-02-22 06:06:38 -06:00
|
|
|
|
2014-09-30 19:03:56 -05:00
|
|
|
#[cfg(unix)]
|
|
|
|
#[path = "sys/unix/mod.rs"] mod sys;
|
|
|
|
#[cfg(windows)]
|
|
|
|
#[path = "sys/windows/mod.rs"] mod sys;
|
|
|
|
|
2014-12-31 12:20:31 -06:00
|
|
|
#[path = "sys/common/mod.rs"] mod sys_common;
|
|
|
|
|
2014-11-14 18:30:16 -06:00
|
|
|
pub mod rt;
|
2014-06-03 22:09:39 -05:00
|
|
|
mod failure;
|
2012-11-30 02:47:45 -06:00
|
|
|
|
2014-12-18 21:13:32 -06:00
|
|
|
// Documentation for primitive types
|
|
|
|
|
|
|
|
mod bool;
|
|
|
|
mod unit;
|
|
|
|
mod tuple;
|
|
|
|
|
2012-11-28 14:33:00 -06:00
|
|
|
// A curious inner-module that's not exported that contains the binding
|
2013-05-17 17:28:44 -05:00
|
|
|
// 'std' so that macro-expanded references to std::error and such
|
|
|
|
// can be resolved within libstd.
|
2013-03-13 21:12:55 -05:00
|
|
|
#[doc(hidden)]
|
2013-05-20 17:20:16 -05:00
|
|
|
mod std {
|
2014-05-25 18:21:07 -05:00
|
|
|
// mods used for deriving
|
2013-05-20 17:20:16 -05:00
|
|
|
pub use clone;
|
|
|
|
pub use cmp;
|
2014-02-21 23:33:23 -06:00
|
|
|
pub use hash;
|
std: Stabilize the std::hash module
This commit aims to prepare the `std::hash` module for alpha by formalizing its
current interface whileholding off on adding `#[stable]` to the new APIs. The
current usage with the `HashMap` and `HashSet` types is also reconciled by
separating out composable parts of the design. The primary goal of this slight
redesign is to separate the concepts of a hasher's state from a hashing
algorithm itself.
The primary change of this commit is to separate the `Hasher` trait into a
`Hasher` and a `HashState` trait. Conceptually the old `Hasher` trait was
actually just a factory for various states, but hashing had very little control
over how these states were used. Additionally the old `Hasher` trait was
actually fairly unrelated to hashing.
This commit redesigns the existing `Hasher` trait to match what the notion of a
`Hasher` normally implies with the following definition:
trait Hasher {
type Output;
fn reset(&mut self);
fn finish(&self) -> Output;
}
This `Hasher` trait emphasizes that hashing algorithms may produce outputs other
than a `u64`, so the output type is made generic. Other than that, however, very
little is assumed about a particular hasher. It is left up to implementors to
provide specific methods or trait implementations to feed data into a hasher.
The corresponding `Hash` trait becomes:
trait Hash<H: Hasher> {
fn hash(&self, &mut H);
}
The old default of `SipState` was removed from this trait as it's not something
that we're willing to stabilize until the end of time, but the type parameter is
always required to implement `Hasher`. Note that the type parameter `H` remains
on the trait to enable multidispatch for specialization of hashing for
particular hashers.
Note that `Writer` is not mentioned in either of `Hash` or `Hasher`, it is
simply used as part `derive` and the implementations for all primitive types.
With these definitions, the old `Hasher` trait is realized as a new `HashState`
trait in the `collections::hash_state` module as an unstable addition for
now. The current definition looks like:
trait HashState {
type Hasher: Hasher;
fn hasher(&self) -> Hasher;
}
The purpose of this trait is to emphasize that the one piece of functionality
for implementors is that new instances of `Hasher` can be created. This
conceptually represents the two keys from which more instances of a
`SipHasher` can be created, and a `HashState` is what's stored in a
`HashMap`, not a `Hasher`.
Implementors of custom hash algorithms should implement the `Hasher` trait, and
only hash algorithms intended for use in hash maps need to implement or worry
about the `HashState` trait.
The entire module and `HashState` infrastructure remains `#[unstable]` due to it
being recently redesigned, but some other stability decision made for the
`std::hash` module are:
* The `Writer` trait remains `#[experimental]` as it's intended to be replaced
with an `io::Writer` (more details soon).
* The top-level `hash` function is `#[unstable]` as it is intended to be generic
over the hashing algorithm instead of hardwired to `SipHasher`
* The inner `sip` module is now private as its one export, `SipHasher` is
reexported in the `hash` module.
And finally, a few changes were made to the default parameters on `HashMap`.
* The `RandomSipHasher` default type parameter was renamed to `RandomState`.
This renaming emphasizes that it is not a hasher, but rather just state to
generate hashers. It also moves away from the name "sip" as it may not always
be implemented as `SipHasher`. This type lives in the
`std::collections::hash_map` module as `#[unstable]`
* The associated `Hasher` type of `RandomState` is creatively called...
`Hasher`! This concrete structure lives next to `RandomState` as an
implemenation of the "default hashing algorithm" used for a `HashMap`. Under
the hood this is currently implemented as `SipHasher`, but it draws an
explicit interface for now and allows us to modify the implementation over
time if necessary.
There are many breaking changes outlined above, and as a result this commit is
a:
[breaking-change]
2014-12-09 14:37:23 -06:00
|
|
|
pub use default;
|
2014-05-04 15:20:47 -05:00
|
|
|
|
2014-12-23 13:53:35 -06:00
|
|
|
pub use sync; // used for select!()
|
2014-10-03 16:23:09 -05:00
|
|
|
pub use error; // used for try!()
|
2014-05-25 18:21:07 -05:00
|
|
|
pub use fmt; // used for any formatting strings
|
|
|
|
pub use io; // used for println!()
|
2014-09-04 01:35:06 -05:00
|
|
|
pub use option; // used for bitflags!{}
|
2014-10-09 14:17:22 -05:00
|
|
|
pub use rt; // used for panic!()
|
2014-05-25 18:21:07 -05:00
|
|
|
pub use vec; // used for vec![]
|
2014-11-14 16:20:57 -06:00
|
|
|
pub use cell; // used for tls!
|
|
|
|
pub use thread_local; // used for thread_local!
|
2015-01-06 16:33:42 -06:00
|
|
|
pub use marker; // used for tls!
|
2014-12-22 11:04:23 -06:00
|
|
|
pub use ops; // used for bitflags!
|
2014-05-25 18:21:07 -05:00
|
|
|
|
|
|
|
// The test runner calls ::std::os::args() but really wants realstd
|
2014-08-18 10:29:44 -05:00
|
|
|
#[cfg(test)] pub use realstd::os as os;
|
2014-05-04 15:20:47 -05:00
|
|
|
// The test runner requires std::slice::Vector, so re-export std::slice just for it.
|
2014-10-10 05:19:40 -05:00
|
|
|
//
|
|
|
|
// It is also used in vec![]
|
|
|
|
pub use slice;
|
2014-07-11 12:12:38 -05:00
|
|
|
|
2014-10-10 05:19:40 -05:00
|
|
|
pub use boxed; // used for vec![]
|
2014-11-14 16:20:57 -06:00
|
|
|
|
2013-05-20 17:20:16 -05:00
|
|
|
}
|