Instead, just pass everything through as a Vec<u8> to get worried about later.
Closes #20091
$(foreach docname,$(DOCS),$(eval $(call DEF_DOC,$(docname))))
-# Localized documentation
-
-# FIXME: I (huonw) haven't actually been able to test properly, since
-# e.g. (by default) I'm doing an out-of-tree build (#12763), but even
-# adjusting for that, the files are too old(?) and are rejected by
-# po4a.
-#
-# As such, I've attempted to get it working as much as possible (and
-# switching from pandoc to rustdoc), but preserving the old behaviour
-# (e.g. only running on the guide)
-.PHONY: l10n-mds
-l10n-mds: $(D)/po4a.conf \
- $(foreach lang,$(L10N_LANG),$(D)/po/$(lang)/*.md.po)
- $(warning WARNING: localized documentation is experimental)
- po4a --copyright-holder="The Rust Project Developers" \
- --package-name="Rust" \
- --package-version="$(CFG_RELEASE)" \
- -M UTF-8 -L UTF-8 \
- $(D)/po4a.conf
-
-define DEF_L10N_DOC
-DOC_L10N_TARGETS += doc/l10n/$(1)/$(2).html
-doc/l10n/$(1)/$(2).html: l10n-mds $$(HTML_DEPS) $$(RUSTDOC_DEPS_$(2))
- @$$(call E, rustdoc: $$@)
- $$(RUSTDOC) $$(RUSTDOC_HTML_OPTS) $$(RUSTDOC_FLAGS_$(1)) doc/l10n/$(1)/$(2).md
-endef
-
-$(foreach lang,$(L10N_LANGS),$(eval $(call DEF_L10N_DOC,$(lang),guide)))
-
-
######################################################################
# Rustdoc (libstd/extra)
######################################################################
docs: $(DOC_TARGETS)
compiler-docs: $(COMPILER_DOC_TARGETS)
-
-docs-l10n: $(DOC_L10N_TARGETS)
-
-.PHONY: docs-l10n
TEST_LOG_FILE=tmp/check-stage$(1)-T-$(2)-H-$(3)-$(4).log
TEST_OK_FILE=tmp/check-stage$(1)-T-$(2)-H-$(3)-$(4).ok
-TEST_RATCHET_FILE=tmp/check-stage$(1)-T-$(2)-H-$(3)-$(4)-metrics.json
-TEST_RATCHET_NOISE_PERCENT=10.0
-
-# Whether to ratchet or merely save benchmarks
-ifdef CFG_RATCHET_BENCH
-CRATE_TEST_EXTRA_ARGS= \
- --test $(TEST_BENCH) \
- --ratchet-metrics $(call TEST_RATCHET_FILE,$(1),$(2),$(3),$(4)) \
- --ratchet-noise-percent $(TEST_RATCHET_NOISE_PERCENT)
-else
-CRATE_TEST_EXTRA_ARGS= \
- --test $(TEST_BENCH) \
- --save-metrics $(call TEST_RATCHET_FILE,$(1),$(2),$(3),$(4))
-endif
-
# If we're sharding the testsuite between parallel testers,
# pass this argument along to the compiletest and crate test
# invocations.
| xargs -n 10 $(CFG_PYTHON) $(S)src/etc/tidy.py
$(Q)echo $(ALL_HS) \
| xargs -n 10 $(CFG_PYTHON) $(S)src/etc/tidy.py
- $(Q)find $(S)src -type f -perm +a+x \
+ $(Q)find $(S)src -type f -perm /a+x \
-not -name '*.rs' -and -not -name '*.py' \
-and -not -name '*.sh' \
| grep '^$(S)src/jemalloc' -v \
$$(Q)touch tmp/check-stage$(1)-T-$(2)-H-$(3)-$(4).log
$$(Q)$(CFG_ADB) pull $(CFG_ADB_TEST_DIR)/check-stage$(1)-T-$(2)-H-$(3)-$(4).log tmp/
$$(Q)$(CFG_ADB) shell rm $(CFG_ADB_TEST_DIR)/check-stage$(1)-T-$(2)-H-$(3)-$(4).log
- $$(Q)$(CFG_ADB) pull $(CFG_ADB_TEST_DIR)/$$(call TEST_RATCHET_FILE,$(1),$(2),$(3),$(4)) tmp/
@if grep -q "result: ok" tmp/check-stage$(1)-T-$(2)-H-$(3)-$(4).tmp; \
then \
rm tmp/check-stage$(1)-T-$(2)-H-$(3)-$(4).tmp; \
$$(CTEST_COMMON_ARGS$(1)-T-$(2)-H-$(3)) \
--src-base $$(S)src/test/$$(CTEST_SRC_BASE_$(4))/ \
--build-base $(3)/test/$$(CTEST_BUILD_BASE_$(4))/ \
- --ratchet-metrics $(call TEST_RATCHET_FILE,$(1),$(2),$(3),$(4)) \
--mode $$(CTEST_MODE_$(4)) \
$$(CTEST_RUNTOOL_$(4))
stderr_out.as_slice());
ProcRes {
- status: process::ExitStatus(exitcode),
+ status: process::ProcessExit::ExitStatus(exitcode),
stdout: stdout_out,
stderr: stderr_out,
cmdline: cmdline
document converter, is required to generate docs as HTML from Rust's
source code.
-[po4a](http://po4a.alioth.debian.org/) is required for generating translated
-docs from the master (English) docs.
-
-[GNU gettext](http://www.gnu.org/software/gettext/) is required for managing
-the translation data.
-
## Building
To generate all the docs, just run `make docs` from the root of the repository.
A nice quick reference (for non-pandoc markdown) is at:
- http://kramdown.gettalong.org/quickref.html
-
-## Notes for translators
-
-Notice: The procedure described below is a work in progress. We are working on
-translation system but the procedure contains some manual operations for now.
-
-To start the translation for a new language, see `po4a.conf` at first.
-
-To generate `.pot` and `.po` files, do something like:
-
-~~~~
-po4a --copyright-holder="The Rust Project Developers" \
- --package-name="Rust" \
- --package-version="0.13.0" \
- -M UTF-8 -L UTF-8 \
- src/doc/po4a.conf
-~~~~
-
-(the version number must be changed if it is not `0.13.0` now.)
-
-Now you can translate documents with `.po` files, commonly used with gettext. If
-you are not familiar with gettext-based translation, please read the online
-manual linked from http://www.gnu.org/software/gettext/ . We use UTF-8 as the
-file encoding of `.po` files.
-
-When you want to make a commit, do the command below before staging your
-change:
-
-~~~~
-for f in src/doc/po/**/*.po; do
- msgattrib --translated $f -o $f.strip
- if [ -e $f.strip ]; then
- mv $f.strip $f
- else
- rm $f
- fi
-done
-~~~~
-
-This removes untranslated entries from `.po` files to save disk space.
let f = Foo { x: y }; // -+ f goes into scope
// stuff // |
// |
-} // -+ f & y go out of scope
+} // -+ f and y go out of scope
```
Our `f` lives within the scope of `y`, so everything works. What if it didn't?
let y = &5i; // ---+ y goes into scope
let f = Foo { x: y }; // ---+ f goes into scope
x = &f.x; // | | error here
- } // ---+ f & y go out of scope
+ } // ---+ f and y go out of scope
// |
println!("{}", x); // |
} // -+ x goes out of scope
}
fn main() {
- let car = Car { name: "DeLorian".to_string() };
+ let car = Car { name: "DeLorean".to_string() };
for _ in range(0u, 4) {
Wheel { size: 360, owner: car };
}
fn main() {
- let car = Car { name: "DeLorian".to_string() };
+ let car = Car { name: "DeLorean".to_string() };
let car_owner = Rc::new(car);
If you're on Windows, please download either the [32-bit
installer](https://static.rust-lang.org/dist/rust-nightly-i686-pc-windows-gnu.exe)
-
or the [64-bit
installer](https://static.rust-lang.org/dist/rust-nightly-x86_64-pc-windows-gnu.exe)
and run it.
ErrorReason(String),
}
```
-Where a `StringResult` is either an `StringOK`, with the result of a computation, or an
+Where a `StringResult` is either a `StringOK`, with the result of a computation, or an
`ErrorReason` with a `String` explaining what caused the computation to fail. These kinds of
`enum`s are actually very useful and are even part of the standard library.
```
Notice that we need both the enum name and the variant name: `StringResult::StringOK`, but
-we didn't need to with `Ordering`, we just said `Greater` rather than `Ordering::Greater`.
+we didn't need to with `Ordering` – we just said `Greater` rather than `Ordering::Greater`.
There's a reason: the Rust prelude imports the variants of `Ordering` as well as the enum
itself. We can use the `use` keyword to do something similar with `StringResult`:
also cause name conflicts, so do this with caution. It's considered good style to rarely import
variants for this reason.
-As you can see `enum`s with values are quite a powerful tool for data representation,
-and can be even more useful when they're generic across types. But before we get to
-generics, let's talk about how to use them with pattern matching, a tool that will
+As you can see, `enum`s with values are quite a powerful tool for data representation,
+and can be even more useful when they're generic across types. Before we get to generics,
+though, let's talk about how to use them with pattern matching, a tool that will
let us deconstruct this sum type (the type theory term for enums) in a very elegant
way and avoid all these messy `if`/`else`s.
# Match
Often, a simple `if`/`else` isn't enough, because you have more than two
-possible options. And `else` conditions can get incredibly complicated. So
+possible options. Also, `else` conditions can get incredibly complicated, so
what's the solution?
Rust has a keyword, `match`, that allows you to replace complicated `if`/`else`
}
```
-`match` takes an expression, and then branches based on its value. Each 'arm' of
+`match` takes an expression and then branches based on its value. Each 'arm' of
the branch is of the form `val => expression`. When the value matches, that arm's
expression will be evaluated. It's called `match` because of the term 'pattern
-matching,' which `match` is an implementation of.
+matching', which `match` is an implementation of.
So what's the big advantage here? Well, there are a few. First of all, `match`
-enforces 'exhaustiveness checking.' Do you see that last arm, the one with the
+enforces 'exhaustiveness checking'. Do you see that last arm, the one with the
underscore (`_`)? If we remove that arm, Rust will give us an error:
```text
```
In other words, Rust is trying to tell us we forgot a value. Because `x` is an
-integer, Rust knows that it can have a number of different values. For example,
-`6i`. But without the `_`, there is no arm that could match, and so Rust refuses
-to compile. `_` is sort of like a catch-all arm. If none of the other arms match,
-the arm with `_` will. And since we have this catch-all arm, we now have an arm
-for every possible value of `x`, and so our program will now compile.
+integer, Rust knows that it can have a number of different values – for example,
+`6i`. Without the `_`, however, there is no arm that could match, and so Rust refuses
+to compile. `_` acts like a 'catch-all arm'. If none of the other arms match,
+the arm with `_` will, and since we have this catch-all arm, we now have an arm
+for every possible value of `x`, and so our program will compile successfully.
`match` statements also destructure enums, as well. Remember this code from the
section on enums?
```
That is how you can get and use the values contained in `enum`s.
-It can also allow us to treat errors or unexpected computations, for example, a
-function that is not guaranteed to be able to compute a result (an `int` here),
+It can also allow us to handle errors or unexpected computations; for example, a
+function that is not guaranteed to be able to compute a result (an `int` here)
could return an `OptionalInt`, and we would handle that value with a `match`.
As you can see, `enum` and `match` used together are quite useful!
-`match` is also an expression, which means we can use it on the right
-hand side of a `let` binding or directly where an expression is
-used. We could also implement the previous line like this:
+`match` is also an expression, which means we can use it on the right-hand
+side of a `let` binding or directly where an expression is used. We could
+also implement the previous line like this:
```{rust}
fn cmp(a: int, b: int) -> Ordering {
The `for` loop is used to loop a particular number of times. Rust's `for` loops
work a bit differently than in other systems languages, however. Rust's `for`
-loop doesn't look like this "C style" `for` loop:
+loop doesn't look like this "C-style" `for` loop:
```{c}
for (x = 0; x < 10; x++) {
and gives an iterator over those values. The upper bound is exclusive, though,
so our loop will print `0` through `9`, not `10`.
-Rust does not have the "C style" `for` loop on purpose. Manually controlling
+Rust does not have the "C-style" `for` loop on purpose. Manually controlling
each element of the loop is complicated and error prone, even for experienced C
developers.
while true {
```
-Rust has a dedicated keyword, `loop`, to handle this case:
+However, Rust has a dedicated keyword, `loop`, to handle this case:
```{rust,ignore}
loop {
`while true`, since we know that it will always loop. The details of what
that _means_ aren't super important to understand at this stage, but in
general, the more information we can give to the compiler, the better it
-can do with safety and code generation. So you should always prefer
+can do with safety and code generation, so you should always prefer
`loop` when you plan to loop infinitely.
## Ending iteration early
```
We had to keep a dedicated `mut` boolean variable binding, `done`, to know
-when we should skip out of the loop. Rust has two keywords to help us with
+when we should exit out of the loop. Rust has two keywords to help us with
modifying iteration: `break` and `continue`.
In this case, we can write the loop in a better way with `break`:
}
```
-We now loop forever with `loop`, and use `break` to break out early.
+We now loop forever with `loop` and use `break` to break out early.
`continue` is similar, but instead of ending the loop, goes to the next
-iteration: This will only print the odd numbers:
+iteration. This will only print the odd numbers:
```{rust}
for x in range(0i, 10i) {
Strings are an important concept for any programmer to master. Rust's string
handling system is a bit different from other languages, due to its systems
focus. Any time you have a data structure of variable size, things can get
-tricky, and strings are a re-sizable data structure. That said, Rust's strings
-also work differently than in some other systems languages, such as C.
+tricky, and strings are a re-sizable data structure. That being said, Rust's
+strings also work differently than in some other systems languages, such as C.
Let's dig into the details. A **string** is a sequence of Unicode scalar values
encoded as a stream of UTF-8 bytes. All strings are guaranteed to be
}
```
-We had to match each time, to see if we had a value or not. In this case,
-though, we _know_ that `x` has a `Value`. But `match` forces us to handle
+We had to match each time to see if we had a value or not. In this case,
+though, we _know_ that `x` has a `Value`, but `match` forces us to handle
the `missing` case. This is what we want 99% of the time, but sometimes, we
know better than the compiler.
Likewise, `read_line()` does not return a line of input. It _might_ return a
-line of input. It might also fail to do so. This could happen if our program
+line of input, though it might also fail to do so. This could happen if our program
isn't running in a terminal, but as part of a cron job, or some other context
where there's no standard input. Because of this, `read_line` returns a type
very similar to our `OptionalInt`: an `IoResult<T>`. We haven't talked about
`IoResult<T>` yet because it is the **generic** form of our `OptionalInt`.
-Until then, you can think of it as being the same thing, just for any type, not
-just `int`s.
+Until then, you can think of it as being the same thing, just for any type –
+not just `int`s.
Rust provides a method on these `IoResult<T>`s called `ok()`, which does the
-same thing as our `match` statement, but assuming that we have a valid value.
+same thing as our `match` statement but assumes that we have a valid value.
We then call `expect()` on the result, which will terminate our program if we
don't have a valid value. In this case, if we can't get input, our program
doesn't work, so we're okay with that. In most cases, we would want to handle
}
```
-Sometimes, this makes things more readable. Sometimes, less. Use your judgment
+Sometimes, this makes things more readable – sometimes, less. Use your judgement
here.
That's all you need to get basic input from the standard input! It's not too
that page, but the best part is the search bar. Right up at the top, there's
a box that you can enter in a search term. The search is pretty primitive
right now, but is getting better all the time. If you type 'random' in that
-box, the page will update to [this
-one](std/index.html?search=random). The very first
-result is a link to
-[std::rand::random](std/rand/fn.random.html). If we
+box, the page will update to [this one](std/index.html?search=random). The very
+first result is a link to [`std::rand::random`](std/rand/fn.random.html). If we
click on that result, we'll be taken to its documentation page.
This page shows us a few things: the type signature of the function, some
```
This says "please give me a random `int` value." We can change our code to use
-this hint...
+this hint:
```{rust,no_run}
use std::io;
}
```
-We use a `match` to either give us the `uint` inside of the `Option`, or we
+We use a `match` to either give us the `uint` inside of the `Option`, or else
print an error message and return. Let's give this a shot:
```bash
... actually, we didn't. See, when you get a line of input from `stdin()`,
you get all the input. Including the `\n` character from you pressing Enter.
-So, `from_str()` sees the string `"5\n"` and says "nope, that's not a number,
-there's non-number stuff in there!" Luckily for us, `&str`s have an easy
+Therefore, `from_str()` sees the string `"5\n"` and says "nope, that's not a
+number; there's non-number stuff in there!" Luckily for us, `&str`s have an easy
method we can use defined on them: `trim()`. One small modification, and our
code looks like this:
the number works, as well as guessing a number too small.
The Rust compiler helped us out quite a bit there! This technique is called
-"lean on the compiler," and it's often useful when working on some code. Let
+"lean on the compiler", and it's often useful when working on some code. Let
the error messages help guide you towards the correct types.
Now we've got most of the game working, but we can only make one guess. Let's
## Looping
-As we already discussed, the `loop` keyword gives us an infinite loop. So
-let's add that in:
+As we already discussed, the `loop` keyword gives us an infinite loop.
+Let's add that in:
```{rust,no_run}
use std::io;
Hello, world!
```
-Excellent! So, we already have a single crate here: our `src/main.rs` is a crate.
+Excellent! We already have a single crate here: our `src/main.rs` is a crate.
Everything in that file is in the crate root. A crate that generates an executable
defines a `main` function inside its root, as we've done here.
-Let's define a new module inside our crate. Edit `src/main.rs` to look
-like this:
+Let's define a new module inside our crate. Edit `src/main.rs` to look like this:
```
fn main() {
`snake_case` naming, like functions and variable bindings.
Inside the `hello` module, we've defined a `print_hello` function. This will
-also print out our hello world message. Modules allow you to split up your
+also print out our "hello world" message. Modules allow you to split up your
program into nice neat boxes of functionality, grouping common things together,
and keeping different things apart. It's kinda like having a set of shelves:
a place for everything and everything in its place.
You may have noticed an exclamation point in the `warn` attribute declaration.
The `!` in this attribute means that this attribute applies to the enclosing
-item, rather than to the item that follows the attribute. So this `warn`
+item, rather than to the item that follows the attribute. This `warn`
attribute declaration applies to the enclosing crate itself, rather than
to whatever item statement follows it:
Great. Rust's infrastructure supports tests in two sorts of places, and they're
for two kinds of tests: you include **unit test**s inside of the crate itself,
and you place **integration test**s inside a `tests` directory. "Unit tests"
-are small tests that test one focused unit, "integration tests" tests multiple
-units in integration. That said, this is a social convention, they're no different
-in syntax. Let's make a `tests` directory:
+are small tests that test one focused unit; "integration tests" test multiple
+units in integration. That being said, this is a social convention – they're no
+different in syntax. Let's make a `tests` directory:
```{bash,ignore}
$ mkdir tests
Now we're getting somewhere. Remember when we talked about naming our tests
with good names? This is why. Here, it says 'test foo' because we called our
-test 'foo.' If we had given it a good name, it'd be more clear which test
+test 'foo'. If we had given it a good name, it'd be more clear which test
failed, especially as we accumulate more tests.
```text
include `main` when it's _not_ true. So we use `not` to negate things:
`cfg(not(test))` will only compile our code when the `cfg(test)` is false.
-With this attribute we won't get the warning (even
+With this attribute, we won't get the warning (even
though `src/main.rs` gets recompiled this time):
```bash
Build failed, waiting for other jobs to finish...
Could not compile `testing`.
-To learn more, run the command again with --verbose.
+To learn more, run the command again with `--verbose`.
```
Rust can't find this function. That makes sense, as we didn't write it yet!
In order to share this code with our tests, we'll need to make a library crate.
This is also just good software design: as we mentioned before, it's a good idea
to put most of your functionality into a library crate, and have your executable
-crate use that library. This allows for code re-use.
+crate use that library. This allows for code reuse.
To do that, we'll need to make a new module. Make a new file, `src/lib.rs`,
and put this in it:
Great! One test passed. We've got an integration test showing that our public
method works, but maybe we want to test some of the internal logic as well.
While this function is simple, if it were more complicated, you can imagine
-we'd need more tests. So let's break it up into two helper functions, and
-write some unit tests to test those.
+we'd need more tests. Let's break it up into two helper functions and write
+some unit tests to test those.
Change your `src/lib.rs` to look like this:
```
We don't want a mutable reference to immutable data! This error message uses a
-term we haven't talked about yet, 'borrow.' We'll get to that in just a moment.
+term we haven't talked about yet, 'borrow'. We'll get to that in just a moment.
This simple example actually illustrates a lot of Rust's power: Rust has
prevented us, at compile time, from breaking our own rules. Because Rust's
fn foo(x: &int) -> &int { x }
{
- let x = 5i; // x is the owner of this integer, which is memory on the stack.
+ // x is the owner of the integer, which is memory on the stack.
+ let x = 5i;
- // privilege 2: you may lend that resource, to as many borrowers as you'd like
+ // privilege 2: you may lend that resource to as many borrowers as you like
let y = &x;
let z = &x;
}
{
- let mut x = 5i; // x is the owner of this integer, which is memory on the stack.
+ // x is the owner of this integer, which is memory on the stack.
+ let mut x = 5i;
- let y = &mut x; // privilege 3: you may lend that resource to a single borrower,
- // mutably
+ // privilege 3: you may lend that resource to a single borrower, mutably
+ let y = &mut x;
}
```
return something, and you've lent it to someone, they need to give it back to
you for you to give it back! If we didn't, then the owner could deallocate
the memory, and the person we've loaned it out to would have a pointer to
-invalid memory. This is called a 'dangling pointer.'
+invalid memory. This is called a 'dangling pointer'.
Let's re-examine the error that led us to talk about all of this, which was a
violation of the restrictions placed on owners who lend something out mutably.
```
The great thing about boxes is that we don't have to manually free this
-allocation! Instead, when `x` reaches the end of its lifetime -- in this case,
-when it goes out of scope at the end of the block -- Rust `free`s `x`. This
+allocation! Instead, when `x` reaches the end of its lifetime – in this case,
+when it goes out of scope at the end of the block – Rust `free`s `x`. This
isn't because Rust has a garbage collector (it doesn't). Instead, by tracking
the ownership and lifetime of a variable (with a little help from you, the
programmer), the compiler knows precisely when it is no longer used.
(immutably!), lasting as long as any of those places, and disappearing when it
is no longer referenced. For instance, in a graph-like data structure, a node
might be referenced from all of its neighbors. In this case, it is not possible
-for the compiler to determine ahead of time when the value can be freed -- it
+for the compiler to determine ahead of time when the value can be freed – it
needs a little run-time support.
Rust's **Rc** type provides shared ownership of a dynamically allocated value
that is automatically freed at the end of its last owner's lifetime. (`Rc`
-stands for 'reference counted,' referring to the way these library types are
+stands for 'reference counted', referring to the way these library types are
implemented.) This provides more flexibility than single-owner boxes, but has
some runtime overhead.
it two arguments: an integer, `5`, and our closure, `square`. This is just like
passing any other two variable bindings to a function, but if you've never
worked with closures before, it can seem a little complex. Just think: "I'm
-passing two variables, one is an int, and one is a function."
+passing two variables: one is an int, and one is a function."
Next, let's look at how `twice` is defined:
```
Since our closure is named `f`, we can call it just like we called our closures
-before. And we pass in our `x` argument to each one. Hence 'twice.'
+before, and we pass in our `x` argument to each one, hence the name `twice`.
If you do the math, `(5 * 5) + (5 * 5) == 50`, so that's the output we get.
```
if we wanted to. Convention says that the first generic parameter should be
-`T`, for 'type,' and that we use `E` for 'error.' Rust doesn't care, however.
+`T`, for 'type,' and that we use `E` for 'error'. Rust doesn't care, however.
The `Result<T, E>` type is intended to
be used to return the result of a computation, and to have the ability to
The names don't actually change to this, it's just for illustration. But
as you can see, there's no overhead of deciding which version to call here,
-hence 'statically dispatched.' The downside is that we have two copies of
+hence 'statically dispatched'. The downside is that we have two copies of
the same function, so our binary is a little bit larger.
# Tasks
}
```
-You can have the macros expanded like this: `rustc print.rs --pretty=expanded` – which will
+You can have the macros expanded like this: `rustc print.rs --pretty=expanded`, which will
give us this huge result:
```{rust,ignore}
you will have a firm grasp of basic Rust development. There's a whole lot more
out there, we've just covered the surface. There's tons of topics that you can
dig deeper into, and we've built specialized guides for many of them. To learn
-more, dig into the [full documentation
-index](index.html).
+more, dig into the [full documentation index](index.html).
Happy hacking!
+++ /dev/null
-# Add here a list of target languages; po4a will automatically
-# generates .po for them and build .md when translated, eg:
-# [po4a_langs] es fr it pt_BR
-[po4a_langs] ja
-[po4a_paths] doc/po/$master.pot $lang:src/doc/po/$lang/$master.po
-
-# Add here below all source documents to be translated
-[type: text] src/doc/complement-bugreport.md $lang:doc/l10n/$lang/complement-bugreport.md
-[type: text] src/doc/complement-design-faq.md $lang:doc/l10n/$lang/complement-design-faq.md
-[type: text] src/doc/complement-lang-faq.md $lang:doc/l10n/$lang/complement-lang-faq.md
-[type: text] src/doc/complement-project-faq.md $lang:doc/l10n/$lang/complement-project-faq.md
-[type: text] src/doc/guide-container.md $lang:doc/l10n/$lang/guide-container.md
-[type: text] src/doc/guide-ffi.md $lang:doc/l10n/$lang/guide-ffi.md
-[type: text] src/doc/guide-ownership.md $lang:doc/l10n/$lang/guide-ownership.md
-[type: text] src/doc/guide-macros.md $lang:doc/l10n/$lang/guide-macros.md
-[type: text] src/doc/guide-plugin.md $lang:doc/l10n/$lang/guide-plugin.md
-[type: text] src/doc/guide-pointers.md $lang:doc/l10n/$lang/guide-pointers.md
-[type: text] src/doc/guide-strings.md $lang:doc/l10n/$lang/guide-strings.md
-[type: text] src/doc/guide-tasks.md $lang:doc/l10n/$lang/guide-tasks.md
-[type: text] src/doc/guide-testing.md $lang:doc/l10n/$lang/guide-testing.md
-[type: text] src/doc/guide-unsafe.md $lang:doc/l10n/$lang/guide-unsafe.md
-[type: text] src/doc/guide-crates.md $lang:doc/l10n/$lang/guide-crates.md
-[type: text] src/doc/guide-error-handling.md $lang:doc/l10n/$lang/guide-error-handling.md
-[type: text] src/doc/guide.md $lang:doc/l10n/$lang/guide.md
-[type: text] src/doc/index.md $lang:doc/l10n/$lang/index.md
-[type: text] src/doc/intro.md $lang:doc/l10n/$lang/intro.md
-[type: text] src/doc/rust.md $lang:doc/l10n/$lang/rust.md
-[type: text] src/doc/rustdoc.md $lang:doc/l10n/$lang/rustdoc.md
syntax with a floating point literal ending in a period. `2.f64` would attempt
to call a method named `f64` on `2`.
-##### Boolean literals
+#### Boolean literals
The two values of the boolean type are written `true` and `false`.
```{.ebnf .gram}
extern_crate_decl : "extern" "crate" crate_name
-crate_name: ident | ( string_lit as ident )
+crate_name: ident | ( string_lit "as" ident )
```
An _`extern crate` declaration_ specifies a dependency on an external crate.
/**
- * Copyright 2013 The Rust Project Developers. See the COPYRIGHT
+ * 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.
* With elements taken from Bootstrap v3.0.2 (MIT licensed).
code {
padding: 0 2px;
color: #8D1A38;
- white-space: pre-wrap;
}
pre code {
padding: 0;
#![stable]
-//! Concurrency-enabled mechanisms for sharing mutable and/or immutable state
-//! between tasks.
+//! Threadsafe reference-counted boxes (the `Arc<T>` type).
+//!
+//! The `Arc<T>` type provides shared ownership of an immutable value. Destruction is
+//! deterministic, and will occur as soon as the last owner is gone. It is marked as `Send` because
+//! it uses atomic reference counting.
+//!
+//! If you do not need thread-safety, and just need shared ownership, consider the [`Rc<T>`
+//! type](../rc/struct.Rc.html). It is the same as `Arc<T>`, but does not use atomics, making it
+//! both thread-unsafe as well as significantly faster when updating the reference count.
+//!
+//! The `downgrade` method can be used to create a non-owning `Weak<T>` pointer to the box. A
+//! `Weak<T>` pointer can be upgraded to an `Arc<T>` pointer, but will return `None` if the value
+//! has already been dropped.
+//!
+//! For example, a tree with parent pointers can be represented by putting the nodes behind strong
+//! `Arc<T>` pointers, and then storing the parent pointers as `Weak<T>` pointers.
+//!
+//! # Examples
+//!
+//! Sharing some immutable data between tasks:
+//!
+//! ```
+//! use std::sync::Arc;
+//!
+//! let five = Arc::new(5i);
+//!
+//! for i in range(0u, 10) {
+//! let five = five.clone();
+//!
+//! spawn(move || {
+//! println!("{}", five);
+//! });
+//! }
+//! ```
+//!
+//! Sharing mutable data safely between tasks with a `Mutex`:
+//!
+//! ```
+//! use std::sync::Arc;
+//! use std::sync::Mutex;
+//!
+//! let five = Arc::new(Mutex::new(5i));
+//!
+//! for _ in range(0u, 10) {
+//! let five = five.clone();
+//!
+//! spawn(move || {
+//! let mut number = five.lock();
+//!
+//! number += 1;
+//!
+//! println!("{}", *number); // prints 6
+//! });
+//! }
+//! ```
use core::atomic;
use core::borrow::BorrowFrom;
///
/// # Example
///
-/// In this example, a large vector of floats is shared between several tasks.
-/// With simple pipes, without `Arc`, a copy would have to be made for each
-/// task.
+/// In this example, a large vector of floats is shared between several tasks. With simple pipes,
+/// without `Arc`, a copy would have to be made for each task.
///
/// ```rust
/// use std::sync::Arc;
/// A weak pointer to an `Arc`.
///
-/// Weak pointers will not keep the data inside of the `Arc` alive, and can be
-/// used to break cycles between `Arc` pointers.
+/// Weak pointers will not keep the data inside of the `Arc` alive, and can be used to break cycles
+/// between `Arc` pointers.
#[unsafe_no_drop_flag]
#[experimental = "Weak pointers may not belong in this module."]
pub struct Weak<T> {
}
impl<T: Sync + Send> Arc<T> {
- /// Creates an atomically reference counted wrapper.
+ /// Constructs a new `Arc<T>`.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
+ /// ```
#[inline]
#[stable]
pub fn new(data: T) -> Arc<T> {
Arc { _ptr: unsafe { mem::transmute(x) } }
}
- /// Downgrades a strong pointer to a weak pointer.
+ /// Downgrades the `Arc<T>` to a `Weak<T>` reference.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
///
- /// Weak pointers will not keep the data alive. Once all strong references
- /// to the underlying data have been dropped, the data itself will be
- /// destroyed.
+ /// let weak_five = five.downgrade();
+ /// ```
#[experimental = "Weak pointers may not belong in this module."]
pub fn downgrade(&self) -> Weak<T> {
// See the clone() impl for why this is relaxed
impl<T> Arc<T> {
#[inline]
fn inner(&self) -> &ArcInner<T> {
- // This unsafety is ok because while this arc is alive we're guaranteed
- // that the inner pointer is valid. Furthermore, we know that the
- // `ArcInner` structure itself is `Sync` because the inner data is
- // `Sync` as well, so we're ok loaning out an immutable pointer to
- // these contents.
+ // This unsafety is ok because while this arc is alive we're guaranteed that the inner
+ // pointer is valid. Furthermore, we know that the `ArcInner` structure itself is `Sync`
+ // because the inner data is `Sync` as well, so we're ok loaning out an immutable pointer
+ // to these contents.
unsafe { &*self._ptr }
}
}
#[experimental]
pub fn strong_count<T>(this: &Arc<T>) -> uint { this.inner().strong.load(atomic::SeqCst) }
-#[unstable = "waiting on stability of Clone"]
+#[stable]
impl<T> Clone for Arc<T> {
- /// Duplicate an atomically reference counted wrapper.
+ /// Makes a clone of the `Arc<T>`.
+ ///
+ /// This increases the strong reference count.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
///
- /// The resulting two `Arc` objects will point to the same underlying data
- /// object. However, one of the `Arc` objects can be sent to another task,
- /// allowing them to share the underlying data.
+ /// five.clone();
+ /// ```
#[inline]
fn clone(&self) -> Arc<T> {
- // Using a relaxed ordering is alright here, as knowledge of the
- // original reference prevents other threads from erroneously deleting
- // the object.
+ // Using a relaxed ordering is alright here, as knowledge of the original reference
+ // prevents other threads from erroneously deleting the object.
//
- // As explained in the [Boost documentation][1], Increasing the
- // reference counter can always be done with memory_order_relaxed: New
- // references to an object can only be formed from an existing
- // reference, and passing an existing reference from one thread to
- // another must already provide any required synchronization.
+ // As explained in the [Boost documentation][1], Increasing the reference counter can
+ // always be done with memory_order_relaxed: New references to an object can only be formed
+ // from an existing reference, and passing an existing reference from one thread to another
+ // must already provide any required synchronization.
//
// [1]: (www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html)
self.inner().strong.fetch_add(1, atomic::Relaxed);
}
impl<T: Send + Sync + Clone> Arc<T> {
- /// Acquires a mutable pointer to the inner contents by guaranteeing that
- /// the reference count is one (no sharing is possible).
+ /// Make a mutable reference from the given `Arc<T>`.
///
- /// This is also referred to as a copy-on-write operation because the inner
- /// data is cloned if the reference count is greater than one.
+ /// This is also referred to as a copy-on-write operation because the inner data is cloned if
+ /// the reference count is greater than one.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let mut five = Arc::new(5i);
+ ///
+ /// let mut_five = five.make_unique();
+ /// ```
#[inline]
#[experimental]
pub fn make_unique(&mut self) -> &mut T {
- // Note that we hold a strong reference, which also counts as
- // a weak reference, so we only clone if there is an
- // additional reference of either kind.
+ // Note that we hold a strong reference, which also counts as a weak reference, so we only
+ // clone if there is an additional reference of either kind.
if self.inner().strong.load(atomic::SeqCst) != 1 ||
self.inner().weak.load(atomic::SeqCst) != 1 {
*self = Arc::new((**self).clone())
}
- // This unsafety is ok because we're guaranteed that the pointer
- // returned is the *only* pointer that will ever be returned to T. Our
- // reference count is guaranteed to be 1 at this point, and we required
- // the Arc itself to be `mut`, so we're returning the only possible
- // reference to the inner data.
+ // This unsafety is ok because we're guaranteed that the pointer returned is the *only*
+ // pointer that will ever be returned to T. Our reference count is guaranteed to be 1 at
+ // this point, and we required the Arc itself to be `mut`, so we're returning the only
+ // possible reference to the inner data.
let inner = unsafe { &mut *self._ptr };
&mut inner.data
}
#[unsafe_destructor]
#[experimental = "waiting on stability of Drop"]
impl<T: Sync + Send> Drop for Arc<T> {
+ /// Drops the `Arc<T>`.
+ ///
+ /// This will decrement the strong reference count. If the strong reference count becomes zero
+ /// and the only other references are `Weak<T>` ones, `drop`s the inner value.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// {
+ /// let five = Arc::new(5i);
+ ///
+ /// // stuff
+ ///
+ /// drop(five); // explict drop
+ /// }
+ /// {
+ /// let five = Arc::new(5i);
+ ///
+ /// // stuff
+ ///
+ /// } // implicit drop
+ /// ```
fn drop(&mut self) {
- // This structure has #[unsafe_no_drop_flag], so this drop glue may run
- // more than once (but it is guaranteed to be zeroed after the first if
- // it's run more than once)
+ // This structure has #[unsafe_no_drop_flag], so this drop glue may run more than once (but
+ // it is guaranteed to be zeroed after the first if it's run more than once)
if self._ptr.is_null() { return }
- // Because `fetch_sub` is already atomic, we do not need to synchronize
- // with other threads unless we are going to delete the object. This
- // same logic applies to the below `fetch_sub` to the `weak` count.
+ // Because `fetch_sub` is already atomic, we do not need to synchronize with other threads
+ // unless we are going to delete the object. This same logic applies to the below
+ // `fetch_sub` to the `weak` count.
if self.inner().strong.fetch_sub(1, atomic::Release) != 1 { return }
- // This fence is needed to prevent reordering of use of the data and
- // deletion of the data. Because it is marked `Release`, the
- // decreasing of the reference count synchronizes with this `Acquire`
- // fence. This means that use of the data happens before decreasing
- // the reference count, which happens before this fence, which
- // happens before the deletion of the data.
+ // This fence is needed to prevent reordering of use of the data and deletion of the data.
+ // Because it is marked `Release`, the decreasing of the reference count synchronizes with
+ // this `Acquire` fence. This means that use of the data happens before decreasing the
+ // reference count, which happens before this fence, which happens before the deletion of
+ // the data.
//
// As explained in the [Boost documentation][1],
//
- // It is important to enforce any possible access to the object in
- // one thread (through an existing reference) to *happen before*
- // deleting the object in a different thread. This is achieved by a
- // "release" operation after dropping a reference (any access to the
- // object through this reference must obviously happened before),
- // and an "acquire" operation before deleting the object.
+ // > It is important to enforce any possible access to the object in one thread (through an
+ // > existing reference) to *happen before* deleting the object in a different thread. This
+ // > is achieved by a "release" operation after dropping a reference (any access to the
+ // > object through this reference must obviously happened before), and an "acquire"
+ // > operation before deleting the object.
//
// [1]: (www.boost.org/doc/libs/1_55_0/doc/html/atomic/usage_examples.html)
atomic::fence(atomic::Acquire);
- // Destroy the data at this time, even though we may not free the box
- // allocation itself (there may still be weak pointers lying around).
+ // Destroy the data at this time, even though we may not free the box allocation itself
+ // (there may still be weak pointers lying around).
unsafe { drop(ptr::read(&self.inner().data)); }
if self.inner().weak.fetch_sub(1, atomic::Release) == 1 {
#[experimental = "Weak pointers may not belong in this module."]
impl<T: Sync + Send> Weak<T> {
- /// Attempts to upgrade this weak reference to a strong reference.
+ /// Upgrades a weak reference to a strong reference.
+ ///
+ /// Upgrades the `Weak<T>` reference to an `Arc<T>`, if possible.
+ ///
+ /// Returns `None` if there were no strong references and the data was destroyed.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
///
- /// This method will not upgrade this reference if the strong reference count has already
- /// reached 0, but if there are still other active strong references this function will return
- /// a new strong reference to the data.
+ /// let five = Arc::new(5i);
+ ///
+ /// let weak_five = five.downgrade();
+ ///
+ /// let strong_five: Option<Arc<_>> = weak_five.upgrade();
+ /// ```
pub fn upgrade(&self) -> Option<Arc<T>> {
- // We use a CAS loop to increment the strong count instead of a
- // fetch_add because once the count hits 0 is must never be above 0.
+ // We use a CAS loop to increment the strong count instead of a fetch_add because once the
+ // count hits 0 is must never be above 0.
let inner = self.inner();
loop {
let n = inner.strong.load(atomic::SeqCst);
#[experimental = "Weak pointers may not belong in this module."]
impl<T: Sync + Send> Clone for Weak<T> {
+ /// Makes a clone of the `Weak<T>`.
+ ///
+ /// This increases the weak reference count.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let weak_five = Arc::new(5i).downgrade();
+ ///
+ /// weak_five.clone();
+ /// ```
#[inline]
fn clone(&self) -> Weak<T> {
// See comments in Arc::clone() for why this is relaxed
#[unsafe_destructor]
#[experimental = "Weak pointers may not belong in this module."]
impl<T: Sync + Send> Drop for Weak<T> {
+ /// Drops the `Weak<T>`.
+ ///
+ /// This will decrement the weak reference count.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// {
+ /// let five = Arc::new(5i);
+ /// let weak_five = five.downgrade();
+ ///
+ /// // stuff
+ ///
+ /// drop(weak_five); // explict drop
+ /// }
+ /// {
+ /// let five = Arc::new(5i);
+ /// let weak_five = five.downgrade();
+ ///
+ /// // stuff
+ ///
+ /// } // implicit drop
+ /// ```
fn drop(&mut self) {
// see comments above for why this check is here
if self._ptr.is_null() { return }
- // If we find out that we were the last weak pointer, then its time to
- // deallocate the data entirely. See the discussion in Arc::drop() about
- // the memory orderings
+ // If we find out that we were the last weak pointer, then its time to deallocate the data
+ // entirely. See the discussion in Arc::drop() about the memory orderings
if self.inner().weak.fetch_sub(1, atomic::Release) == 1 {
atomic::fence(atomic::Acquire);
unsafe { deallocate(self._ptr as *mut u8, size_of::<ArcInner<T>>(),
#[unstable = "waiting on PartialEq"]
impl<T: PartialEq> PartialEq for Arc<T> {
+ /// Equality for two `Arc<T>`s.
+ ///
+ /// Two `Arc<T>`s are equal if their inner value are equal.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
+ ///
+ /// five == Arc::new(5i);
+ /// ```
fn eq(&self, other: &Arc<T>) -> bool { *(*self) == *(*other) }
+
+ /// Inequality for two `Arc<T>`s.
+ ///
+ /// Two `Arc<T>`s are unequal if their inner value are unequal.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
+ ///
+ /// five != Arc::new(5i);
+ /// ```
fn ne(&self, other: &Arc<T>) -> bool { *(*self) != *(*other) }
}
#[unstable = "waiting on PartialOrd"]
impl<T: PartialOrd> PartialOrd for Arc<T> {
+ /// Partial comparison for two `Arc<T>`s.
+ ///
+ /// The two are compared by calling `partial_cmp()` on their inner values.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
+ ///
+ /// five.partial_cmp(&Arc::new(5i));
+ /// ```
fn partial_cmp(&self, other: &Arc<T>) -> Option<Ordering> {
(**self).partial_cmp(&**other)
}
+
+ /// Less-than comparison for two `Arc<T>`s.
+ ///
+ /// The two are compared by calling `<` on their inner values.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
+ ///
+ /// five < Arc::new(5i);
+ /// ```
fn lt(&self, other: &Arc<T>) -> bool { *(*self) < *(*other) }
+
+ /// 'Less-than or equal to' comparison for two `Arc<T>`s.
+ ///
+ /// The two are compared by calling `<=` on their inner values.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
+ ///
+ /// five <= Arc::new(5i);
+ /// ```
fn le(&self, other: &Arc<T>) -> bool { *(*self) <= *(*other) }
- fn ge(&self, other: &Arc<T>) -> bool { *(*self) >= *(*other) }
+
+ /// Greater-than comparison for two `Arc<T>`s.
+ ///
+ /// The two are compared by calling `>` on their inner values.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
+ ///
+ /// five > Arc::new(5i);
+ /// ```
fn gt(&self, other: &Arc<T>) -> bool { *(*self) > *(*other) }
+
+ /// 'Greater-than or equal to' comparison for two `Arc<T>`s.
+ ///
+ /// The two are compared by calling `>=` on their inner values.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// use std::sync::Arc;
+ ///
+ /// let five = Arc::new(5i);
+ ///
+ /// five >= Arc::new(5i);
+ /// ```
+ fn ge(&self, other: &Arc<T>) -> bool { *(*self) >= *(*other) }
}
#[unstable = "waiting on Ord"]
impl<T: Ord> Ord for Arc<T> {
use core::raw::TraitObject;
use core::result::Result;
use core::result::Result::{Ok, Err};
+use core::ops::{Deref, DerefMut};
/// A value that represents the global exchange heap. This is the default
/// place that the `box` keyword allocates into when no place is supplied.
fn default() -> Box<[T]> { box [] }
}
-#[unstable]
+#[stable]
impl<T: Clone> Clone for Box<T> {
/// Returns a copy of the owned box.
#[inline]
}
}
+impl<Sized? T> Deref<T> for Box<T> {
+ fn deref(&self) -> &T { &**self }
+}
+
+impl<Sized? T> DerefMut<T> for Box<T> {
+ fn deref_mut(&mut self) -> &mut T { &mut **self }
+}
+
#[cfg(test)]
mod test {
#[test]
let s = format!("{}", b);
assert_eq!(s, "&Any");
}
+
+ #[test]
+ fn deref() {
+ fn homura<T: Deref<i32>>(_: T) { }
+ homura(box 765i32);
+ }
}
/// An immutable reference-counted pointer type.
///
-/// See the [module level documentation](../index.html) for more.
+/// See the [module level documentation](../index.html) for more details.
#[unsafe_no_drop_flag]
#[stable]
pub struct Rc<T> {
- // FIXME #12808: strange names to try to avoid interfering with
- // field accesses of the contained type via Deref
+ // FIXME #12808: strange names to try to avoid interfering with field accesses of the contained
+ // type via Deref
_ptr: *mut RcBox<T>,
_nosend: marker::NoSend,
_noshare: marker::NoSync
pub fn new(value: T) -> Rc<T> {
unsafe {
Rc {
- // there is an implicit weak pointer owned by all the
- // strong pointers, which ensures that the weak
- // destructor never frees the allocation while the
- // strong destructor is running, even if the weak
- // pointer is stored inside the strong one.
+ // there is an implicit weak pointer owned by all the strong pointers, which
+ // ensures that the weak destructor never frees the allocation while the strong
+ // destructor is running, even if the weak pointer is stored inside the strong one.
_ptr: transmute(box RcBox {
value: value,
strong: Cell::new(1),
if !is_unique(self) {
*self = Rc::new((**self).clone())
}
- // This unsafety is ok because we're guaranteed that the pointer
- // returned is the *only* pointer that will ever be returned to T. Our
- // reference count is guaranteed to be 1 at this point, and we required
- // the `Rc<T>` itself to be `mut`, so we're returning the only possible
- // reference to the inner value.
+ // This unsafety is ok because we're guaranteed that the pointer returned is the *only*
+ // pointer that will ever be returned to T. Our reference count is guaranteed to be 1 at
+ // this point, and we required the `Rc<T>` itself to be `mut`, so we're returning the only
+ // possible reference to the inner value.
let inner = unsafe { &mut *self._ptr };
&mut inner.value
}
if self.strong() == 0 {
ptr::read(&**self); // destroy the contained object
- // remove the implicit "strong weak" pointer now
- // that we've destroyed the contents.
+ // remove the implicit "strong weak" pointer now that we've destroyed the
+ // contents.
self.dec_weak();
if self.weak() == 0 {
}
}
-#[unstable = "Clone is unstable."]
+#[stable]
impl<T> Clone for Rc<T> {
/// Makes a clone of the `Rc<T>`.
///
unsafe {
if !self._ptr.is_null() {
self.dec_weak();
- // the weak count starts at 1, and will only go to
- // zero if all the strong pointers have disappeared.
+ // the weak count starts at 1, and will only go to zero if all the strong pointers
+ // have disappeared.
if self.weak() == 0 {
deallocate(self._ptr as *mut u8, size_of::<RcBox<T>>(),
min_align_of::<RcBox<T>>())
/// }
/// ```
#[unstable = "matches collection reform specification, waiting for dust to settle"]
- pub fn iter<'a>(&'a self) -> Items<'a, T> {
+ pub fn iter(&self) -> Items<T> {
Items { iter: self.data.iter() }
}
/// assert_eq!(heap.top(), Some(&5i));
///
/// ```
- pub fn top<'a>(&'a self) -> Option<&'a T> {
- if self.is_empty() { None } else { Some(&self.data[0]) }
+ pub fn top(&self) -> Option<&T> {
+ self.data.get(0)
}
/// Returns the number of elements the queue can hold without reallocating.
/// ```
#[unstable = "matches collection reform specification, waiting for dust to settle"]
pub fn push(&mut self, item: T) {
+ let old_len = self.len();
self.data.push(item);
- let new_len = self.len() - 1;
- self.siftup(0, new_len);
+ self.siftup(0, old_len);
}
/// Pushes an item onto a queue then pops the greatest item off the queue in
/// assert_eq!(heap.top(), Some(&3i));
/// ```
pub fn push_pop(&mut self, mut item: T) -> T {
- if !self.is_empty() && *self.top().unwrap() > item {
- swap(&mut item, &mut self.data[0]);
- self.siftdown(0);
+ match self.data.get_mut(0) {
+ None => return item,
+ Some(top) => if *top > item {
+ swap(&mut item, top);
+ } else {
+ return item;
+ },
}
+
+ self.siftdown(0);
item
}
/// println!("{}", x);
/// }
/// ```
- pub fn into_vec(self) -> Vec<T> { let BinaryHeap{data: v} = self; v }
+ pub fn into_vec(self) -> Vec<T> { self.data }
/// Consumes the `BinaryHeap` and returns a vector in sorted
/// (ascending) order.
/// let vec = heap.into_sorted_vec();
/// assert_eq!(vec, vec![1i, 2, 3, 4, 5, 6, 7]);
/// ```
- pub fn into_sorted_vec(self) -> Vec<T> {
- let mut q = self;
- let mut end = q.len();
+ pub fn into_sorted_vec(mut self) -> Vec<T> {
+ let mut end = self.len();
while end > 1 {
end -= 1;
- q.data.swap(0, end);
- q.siftdown_range(0, end)
+ self.data.swap(0, end);
+ self.siftdown_range(0, end)
}
- q.into_vec()
+ self.into_vec()
}
// The implementations of siftup and siftdown use unsafe blocks in
}
/// `BinaryHeap` iterator.
-pub struct Items <'a, T:'a> {
+pub struct Items<'a, T: 'a> {
iter: slice::Items<'a, T>,
}
impl<'a, T> Iterator<&'a T> for Items<'a, T> {
#[inline]
- fn next(&mut self) -> Option<(&'a T)> { self.iter.next() }
+ fn next(&mut self) -> Option<&'a T> { self.iter.next() }
#[inline]
fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
impl<'a, T> DoubleEndedIterator<&'a T> for Items<'a, T> {
#[inline]
- fn next_back(&mut self) -> Option<(&'a T)> { self.iter.next_back() }
+ fn next_back(&mut self) -> Option<&'a T> { self.iter.next_back() }
}
impl<'a, T> ExactSizeIterator<&'a T> for Items<'a, T> {}
impl<T: Ord> FromIterator<T> for BinaryHeap<T> {
fn from_iter<Iter: Iterator<T>>(iter: Iter) -> BinaryHeap<T> {
- let vec: Vec<T> = iter.collect();
- BinaryHeap::from_vec(vec)
+ BinaryHeap::from_vec(iter.collect())
}
}
#[test]
fn test_empty_pop() {
- let mut heap: BinaryHeap<int> = BinaryHeap::new();
+ let mut heap = BinaryHeap::<int>::new();
assert!(heap.pop().is_none());
}
#[test]
fn test_empty_top() {
- let empty: BinaryHeap<int> = BinaryHeap::new();
+ let empty = BinaryHeap::<int>::new();
assert!(empty.top().is_none());
}
#[test]
fn test_empty_replace() {
- let mut heap: BinaryHeap<int> = BinaryHeap::new();
- heap.replace(5).is_none();
+ let mut heap = BinaryHeap::<int>::new();
+ assert!(heap.replace(5).is_none());
}
#[test]
}
}
+#[stable]
impl Clone for Bitv {
#[inline]
fn clone(&self) -> Bitv {
}
// FIXME(gereeter) Write an efficient clone_from
+#[stable]
impl<K: Clone, V: Clone> Clone for Node<K, V> {
fn clone(&self) -> Node<K, V> {
let mut ret = if self.is_leaf() {
}
}
+#[stable]
impl<A: Clone> Clone for DList<A> {
fn clone(&self) -> DList<A> {
self.iter().map(|x| x.clone()).collect()
ptr: *mut T
}
+#[stable]
impl<T: Clone> Clone for RingBuf<T> {
fn clone(&self) -> RingBuf<T> {
self.iter().map(|t| t.clone()).collect()
#![doc(primitive = "str")]
-pub use self::MaybeOwned::*;
+use self::MaybeOwned::*;
use self::RecompositionState::*;
use self::DecompositionType::*;
use core::iter::AdditiveIterator;
use super::{eq_slice, from_utf8, is_utf8, is_utf16, raw};
use super::truncate_utf16_at_nul;
- use super::{Owned, Slice};
+ use super::MaybeOwned::{Owned, Slice};
#[test]
fn test_eq_slice() {
use slice::CloneSliceExt;
use str;
-use str::{CharRange, CowString, FromStr, StrAllocating, Owned};
+use str::{CharRange, CowString, FromStr, StrAllocating};
+use str::MaybeOwned::Owned;
use vec::{DerefVec, Vec, as_vec};
/// A growable string stored as a UTF-8 encoded buffer.
#[inline]
#[stable = "function just renamed from push_char"]
pub fn push(&mut self, ch: char) {
+ if (ch as u32) < 0x80 {
+ self.vec.push(ch as u8);
+ return;
+ }
+
let cur_len = self.len();
// This may use up to 4 bytes.
self.vec.reserve(4);
}
}
-#[cfg(not(stage0))] // NOTE(stage0): Remove cfg after a snapshot
-impl<'a> Add<String, String> for &'a str {
- fn add(self, mut other: String) -> String {
- other.push_str(self);
- other
- }
-}
-
impl ops::Slice<uint, str> for String {
#[inline]
fn as_slice_<'a>(&'a self) -> &'a str {
});
}
+ const REPETITIONS: u64 = 10_000;
+
+ #[bench]
+ fn bench_push_str_one_byte(b: &mut Bencher) {
+ b.bytes = REPETITIONS;
+ b.iter(|| {
+ let mut r = String::new();
+ for _ in range(0, REPETITIONS) {
+ r.push_str("a")
+ }
+ });
+ }
+
+ #[bench]
+ fn bench_push_char_one_byte(b: &mut Bencher) {
+ b.bytes = REPETITIONS;
+ b.iter(|| {
+ let mut r = String::new();
+ for _ in range(0, REPETITIONS) {
+ r.push('a')
+ }
+ });
+ }
+
+ #[bench]
+ fn bench_push_char_two_bytes(b: &mut Bencher) {
+ b.bytes = REPETITIONS * 2;
+ b.iter(|| {
+ let mut r = String::new();
+ for _ in range(0, REPETITIONS) {
+ r.push('â')
+ }
+ });
+ }
+
#[bench]
fn from_utf8_lossy_100_ascii(b: &mut Bencher) {
let s = b"Hello there, the quick brown fox jumped over the lazy dog! \
}
}
+ /// Resizes the `Vec` in-place so that `len()` is equal to `new_len`.
+ ///
+ /// Calls either `extend()` or `truncate()` depending on whether `new_len`
+ /// is larger than the current value of `len()` or not.
+ ///
+ /// # Examples
+ ///
+ /// ```
+ /// let mut vec = vec!["hello"];
+ /// vec.resize(3, "world");
+ /// assert_eq!(vec, vec!["hello", "world", "world"]);
+ ///
+ /// let mut vec = vec![1i, 2, 3, 4];
+ /// vec.resize(2, 0);
+ /// assert_eq!(vec, vec![1, 2]);
+ /// ```
+ #[unstable = "matches collection reform specification; waiting for dust to settle"]
+ pub fn resize(&mut self, new_len: uint, value: T) {
+ let len = self.len();
+
+ if new_len > len {
+ self.extend(repeat(value).take(new_len - len));
+ } else {
+ self.truncate(new_len);
+ }
+ }
+
/// Partitions a vector based on a predicate.
///
/// Clones the elements of the vector, partitioning them into two `Vec<T>`s
}
}
-#[unstable]
+#[stable]
impl<T:Clone> Clone for Vec<T> {
fn clone(&self) -> Vec<T> { self.as_slice().to_vec() }
}
}
-#[cfg(not(stage0))] // NOTE(stage0): Remove impl after a snapshot
-impl<'a, T: Clone> Add<Vec<T>, Vec<T>> for &'a [T] {
- #[inline]
- fn add(self, mut rhs: Vec<T>) -> Vec<T> {
- rhs.push_all(self);
- rhs
- }
-}
-
#[unsafe_destructor]
impl<T> Drop for Vec<T> {
fn drop(&mut self) {
macro_rules! array_impls {
($($N:expr)+) => {
$(
- #[unstable = "waiting for Clone to stabilize"]
+ #[stable]
impl<T:Copy> Clone for [T, ..$N] {
fn clone(&self) -> [T, ..$N] {
*self
20 21 22 23 24 25 26 27 28 29
30 31 32
}
-
+++ /dev/null
-// Copyright 2013 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.
-
-//! The boolean type
-
-#![doc(primitive = "bool")]
-#![unstable = "this module is purely for documentation and it will likely be \
- removed from the public api"]
-
Owned(T)
}
+#[stable]
impl<'a, T, Sized? B> Clone for Cow<'a, T, B> where B: ToOwned<T> {
fn clone(&self) -> Cow<'a, T, B> {
match *self {
use option::Option::{None, Some};
/// A mutable memory location that admits only `Copy` data.
-#[unstable = "likely to be renamed; otherwise stable"]
+#[stable]
pub struct Cell<T> {
value: UnsafeCell<T>,
noshare: marker::NoSync,
}
}
-#[unstable = "waiting for `Clone` trait to become stable"]
+#[stable]
impl<T:Copy> Clone for Cell<T> {
fn clone(&self) -> Cell<T> {
Cell::new(self.get())
}
/// A mutable memory location with dynamically checked borrow rules
-#[unstable = "likely to be renamed; otherwise stable"]
+#[stable]
pub struct RefCell<T> {
value: UnsafeCell<T>,
borrow: Cell<BorrowFlag>,
}
/// Consumes the `RefCell`, returning the wrapped value.
- #[unstable = "recently renamed per RFC 430"]
+ #[stable]
pub fn into_inner(self) -> T {
// Since this function takes `self` (the `RefCell`) by value, the
// compiler statically verifies that it is not currently borrowed.
/// immutable borrows can be taken out at the same time.
///
/// Returns `None` if the value is currently mutably borrowed.
- #[unstable = "may be renamed, depending on global conventions"]
+ #[unstable = "may be renamed or removed"]
pub fn try_borrow<'a>(&'a self) -> Option<Ref<'a, T>> {
match BorrowRef::new(&self.borrow) {
Some(b) => Some(Ref { _value: unsafe { &*self.value.get() }, _borrow: b }),
/// # Panics
///
/// Panics if the value is currently mutably borrowed.
- #[unstable]
+ #[stable]
pub fn borrow<'a>(&'a self) -> Ref<'a, T> {
match self.try_borrow() {
Some(ptr) => ptr,
/// cannot be borrowed while this borrow is active.
///
/// Returns `None` if the value is currently borrowed.
- #[unstable = "may be renamed, depending on global conventions"]
+ #[unstable = "may be renamed or removed"]
pub fn try_borrow_mut<'a>(&'a self) -> Option<RefMut<'a, T>> {
match BorrowRefMut::new(&self.borrow) {
Some(b) => Some(RefMut { _value: unsafe { &mut *self.value.get() }, _borrow: b }),
/// # Panics
///
/// Panics if the value is currently borrowed.
- #[unstable]
+ #[stable]
pub fn borrow_mut<'a>(&'a self) -> RefMut<'a, T> {
match self.try_borrow_mut() {
Some(ptr) => ptr,
}
}
-#[unstable = "waiting for `Clone` to become stable"]
+#[stable]
impl<T: Clone> Clone for RefCell<T> {
fn clone(&self) -> RefCell<T> {
RefCell::new(self.borrow().clone())
}
/// Wraps a borrowed reference to a value in a `RefCell` box.
-#[unstable]
+#[stable]
pub struct Ref<'b, T:'b> {
// FIXME #12808: strange name to try to avoid interfering with
// field accesses of the contained type via Deref
}
/// Wraps a mutable borrowed reference to a value in a `RefCell` box.
-#[unstable]
+#[stable]
pub struct RefMut<'b, T:'b> {
// FIXME #12808: strange name to try to avoid interfering with
// field accesses of the contained type via Deref
/// is not recommended to access its fields directly, `get` should be used
/// instead.
#[lang="unsafe"]
-#[unstable = "this type may be renamed in the future"]
+#[stable]
pub struct UnsafeCell<T> {
/// Wrapped value
///
}
/// Gets a mutable pointer to the wrapped value.
- ///
- /// This function is unsafe as the pointer returned is an unsafe pointer and
- /// no guarantees are made about the aliasing of the pointers being handed
- /// out in this or other tasks.
#[inline]
- #[unstable = "conventions around acquiring an inner reference are still \
- under development"]
- pub unsafe fn get(&self) -> *mut T { &self.value as *const T as *mut T }
+ #[stable]
+ pub fn get(&self) -> *mut T { &self.value as *const T as *mut T }
/// Unwraps the value
///
/// This function is unsafe because there is no guarantee that this or other
/// tasks are currently inspecting the inner value.
#[inline]
- #[unstable = "conventions around the name `unwrap` are still under \
- development"]
+ #[stable]
pub unsafe fn into_inner(self) -> T { self.value }
/// Deprecated, use into_inner() instead
//! explicitly, by convention implementing the `Clone` trait and calling
//! the `clone` method.
-#![unstable]
+#![stable]
use kinds::Sized;
/// A common trait for cloning an object.
+#[stable]
pub trait Clone {
/// Returns a copy of the value.
+ #[stable]
fn clone(&self) -> Self;
/// Perform copy-assignment from `source`.
/// but can be overridden to reuse the resources of `a` to avoid unnecessary
/// allocations.
#[inline(always)]
- #[experimental = "this function is mostly unused"]
+ #[unstable = "this function rarely unused"]
fn clone_from(&mut self, source: &Self) {
*self = source.clone()
}
}
+#[stable]
impl<'a, Sized? T> Clone for &'a T {
/// Return a shallow copy of the reference.
#[inline]
macro_rules! clone_impl {
($t:ty) => {
+ #[stable]
impl Clone for $t {
/// Return a deep copy of the value.
#[inline]
extern_fn_clone! { A, B, C, D, E, F }
extern_fn_clone! { A, B, C, D, E, F, G }
extern_fn_clone! { A, B, C, D, E, F, G, H }
-
}
}
+#[stable]
impl Clone for SipState {
#[inline]
fn clone(&self) -> SipState {
/// Both types must have the same size and alignment, and this guarantee
/// is enforced at compile-time.
///
- /// # Example
+ /// # Examples
///
/// ```rust
/// use std::mem;
/// integer, since the conversion would throw away aliasing information.
pub fn offset<T>(dst: *const T, offset: int) -> *const T;
- /// Copies data from one location to another.
- ///
- /// Copies `count` elements (not bytes) from `src` to `dst`. The source
+ /// Copies `count * size_of<T>` bytes from `src` to `dst`. The source
/// and destination may *not* overlap.
///
/// `copy_nonoverlapping_memory` is semantically equivalent to C's `memcpy`.
///
- /// # Example
+ /// # Safety
+ ///
+ /// Beyond requiring that both regions of memory be allocated, it is Undefined Behaviour
+ /// for source and destination to overlap. Care must also be taken with the ownership of
+ /// `src` and `dst`. This method semantically moves the values of `src` into `dst`.
+ /// However it does not drop the contents of `dst`, or prevent the contents of `src`
+ /// from being dropped or used.
+ ///
+ /// # Examples
///
/// A safe swap function:
///
/// }
/// }
/// ```
- ///
- /// # Safety Note
- ///
- /// If the source and destination overlap then the behavior of this
- /// function is undefined.
#[unstable]
pub fn copy_nonoverlapping_memory<T>(dst: *mut T, src: *const T, count: uint);
- /// Copies data from one location to another.
- ///
- /// Copies `count` elements (not bytes) from `src` to `dst`. The source
+ /// Copies `count * size_of<T>` bytes from `src` to `dst`. The source
/// and destination may overlap.
///
/// `copy_memory` is semantically equivalent to C's `memmove`.
///
- /// # Example
+ /// # Safety
+ ///
+ /// Care must be taken with the ownership of `src` and `dst`.
+ /// This method semantically moves the values of `src` into `dst`.
+ /// However it does not drop the contents of `dst`, or prevent the contents of `src`
+ /// from being dropped or used.
+ ///
+ /// # Examples
///
/// Efficiently create a Rust vector from an unsafe buffer:
///
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, B, I, F> Clone for Map<A, B, I, F> where
I: Clone + Iterator<A>,
F: Clone + FnMut(A) -> B,
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, I, P> Clone for Filter<A, I, P> where
I: Clone + Iterator<A>,
P: Clone + FnMut(&A) -> bool,
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, B, I, F> Clone for FilterMap<A, B, I, F> where
I: Clone + Iterator<A>,
F: Clone + FnMut(A) -> Option<B>,
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, I, P> Clone for SkipWhile<A, I, P> where
I: Clone + Iterator<A>,
P: Clone + FnMut(&A) -> bool,
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, I, P> Clone for TakeWhile<A, I, P> where
I: Clone + Iterator<A>,
P: Clone + FnMut(&A) -> bool,
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, B, I, St, F> Clone for Scan<A, B, I, St, F> where
I: Clone + Iterator<A>,
St: Clone,
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, B, I, U, F> Clone for FlatMap<A, B, I, U, F> where
I: Clone + Iterator<A>,
U: Clone + Iterator<B>,
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, I, F> Clone for Inspect<A, I, F> where
I: Clone + Iterator<A>,
F: Clone + FnMut(&A),
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<A, St, F> Clone for Unfold<A, St, F> where
F: Clone + FnMut(&mut St) -> Option<A>,
St: Clone,
/// implemented using unsafe code. In that case, you may want to embed
/// some of the marker types below into your type.
pub mod marker {
- use super::Copy;
+ use super::{Copy,Sized};
+ use clone::Clone;
/// A marker type whose type parameter `T` is considered to be
/// covariant with respect to the type itself. This is (typically)
/// (for example, `S<&'static int>` is a subtype of `S<&'a int>`
/// for some lifetime `'a`, but not the other way around).
#[lang="covariant_type"]
- #[deriving(Clone, PartialEq, Eq, PartialOrd, Ord)]
- pub struct CovariantType<T>;
+ #[deriving(PartialEq, Eq, PartialOrd, Ord)]
+ pub struct CovariantType<Sized? T>;
- impl<T> Copy for CovariantType<T> {}
+ impl<Sized? T> Copy for CovariantType<T> {}
+ impl<Sized? T> Clone for CovariantType<T> {
+ fn clone(&self) -> CovariantType<T> { *self }
+ }
/// A marker type whose type parameter `T` is considered to be
/// contravariant with respect to the type itself. This is (typically)
/// function requires arguments of type `T`, it must also accept
/// arguments of type `U`, hence such a conversion is safe.
#[lang="contravariant_type"]
- #[deriving(Clone, PartialEq, Eq, PartialOrd, Ord)]
- pub struct ContravariantType<T>;
+ #[deriving(PartialEq, Eq, PartialOrd, Ord)]
+ pub struct ContravariantType<Sized? T>;
- impl<T> Copy for ContravariantType<T> {}
+ impl<Sized? T> Copy for ContravariantType<T> {}
+ impl<Sized? T> Clone for ContravariantType<T> {
+ fn clone(&self) -> ContravariantType<T> { *self }
+ }
/// A marker type whose type parameter `T` is considered to be
/// invariant with respect to the type itself. This is (typically)
/// never written, but in fact `Cell` uses unsafe code to achieve
/// interior mutability.
#[lang="invariant_type"]
- #[deriving(Clone, PartialEq, Eq, PartialOrd, Ord)]
- pub struct InvariantType<T>;
+ #[deriving(PartialEq, Eq, PartialOrd, Ord)]
+ pub struct InvariantType<Sized? T>;
- impl<T> Copy for InvariantType<T> {}
+ impl<Sized? T> Copy for InvariantType<T> {}
+ impl<Sized? T> Clone for InvariantType<T> {
+ fn clone(&self) -> InvariantType<T> { *self }
+ }
/// As `CovariantType`, but for lifetime parameters. Using
/// `CovariantLifetime<'a>` indicates that it is ok to substitute
/// and this pointer is itself stored in an inherently mutable
/// location (such as a `Cell`).
#[lang="invariant_lifetime"]
- #[deriving(Clone, PartialEq, Eq, PartialOrd, Ord)]
+ #[deriving(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
pub struct InvariantLifetime<'a>;
- impl<'a> Copy for InvariantLifetime<'a> {}
-
/// A type which is considered "not sendable", meaning that it cannot
/// be safely sent between tasks, even if it is owned. This is
/// typically embedded in other types, such as `Gc`, to ensure that
pub mod any;
pub mod atomic;
-pub mod bool;
pub mod borrow;
pub mod cell;
pub mod char;
pub mod simd;
pub mod slice;
pub mod str;
-pub mod tuple;
pub mod hash;
-// FIXME #15320: primitive documentation needs top-level modules, this
-// should be `core::tuple::unit`.
-#[path = "tuple/unit.rs"]
-pub mod unit;
pub mod fmt;
// note: does not need to be public
+mod tuple;
mod array;
#[doc(hidden)]
//! Operations and constants for architecture-sized signed integers (`int` type)
-#![unstable]
+#![stable]
#![doc(primitive = "int")]
#[cfg(target_word_size = "32")] int_module! { int, 32 }
#[cfg(target_word_size = "64")] int_module! { int, 64 }
-
// FIXME(#11621): Should be deprecated once CTFE is implemented in favour of
// calling the `Bounded::min_value` function.
-#[unstable]
+#[stable]
pub const MIN: $T = (-1 as $T) << (BITS - 1);
// FIXME(#9837): Compute MIN like this so the high bits that shouldn't exist are 0.
// FIXME(#11621): Should be deprecated once CTFE is implemented in favour of
// calling the `Bounded::max_value` function.
-#[unstable]
+#[stable]
pub const MAX: $T = !MIN;
) }
-
//! Operations and constants for architecture-sized unsigned integers (`uint` type)
-#![unstable]
+#![stable]
#![doc(primitive = "uint")]
uint_module! { uint, int, ::int::BITS }
-
#[unstable]
pub const BYTES : uint = ($bits / 8);
-#[unstable]
+#[stable]
pub const MIN: $T = 0 as $T;
-#[unstable]
+#[stable]
pub const MAX: $T = 0 as $T - 1 as $T;
) }
-
impl<'a, A> ExactSizeIterator<&'a A> for Iter<'a, A> {}
+#[stable]
impl<'a, A> Clone for Iter<'a, A> {
fn clone(&self) -> Iter<'a, A> {
Iter { inner: self.inner.clone() }
use cmp::Ordering;
use cmp::Ordering::{Less, Equal, Greater};
-pub use intrinsics::copy_memory;
+// FIXME #19649: instrinsic docs don't render, so these have no docs :(
+
+#[unstable]
pub use intrinsics::copy_nonoverlapping_memory;
+
+#[unstable]
+pub use intrinsics::copy_memory;
+
+#[experimental = "uncertain about naming and semantics"]
pub use intrinsics::set_memory;
-/// Create a null pointer.
+/// Creates a null raw pointer.
///
-/// # Example
+/// # Examples
///
/// ```
/// use std::ptr;
#[unstable = "may need a different name after pending changes to pointer types"]
pub fn null<T>() -> *const T { 0 as *const T }
-/// Create an unsafe mutable null pointer.
+/// Creates a null mutable raw pointer.
///
-/// # Example
+/// # Examples
///
/// ```
/// use std::ptr;
#[unstable = "may need a different name after pending changes to pointer types"]
pub fn null_mut<T>() -> *mut T { 0 as *mut T }
-/// Zeroes out `count * size_of::<T>` bytes of memory at `dst`
+/// Zeroes out `count * size_of::<T>` bytes of memory at `dst`. `count` may be `0`.
+///
+/// # Safety
+///
+/// Beyond accepting a raw pointer, this is unsafe because it will not drop the contents of `dst`,
+/// and may be used to create invalid instances of `T`.
#[inline]
#[experimental = "uncertain about naming and semantics"]
#[allow(experimental)]
set_memory(dst, 0, count);
}
-/// Swap the values at two mutable locations of the same type, without
-/// deinitialising either. They may overlap.
+/// Swaps the values at two mutable locations of the same type, without
+/// deinitialising either. They may overlap, unlike `mem::swap` which is otherwise
+/// equivalent.
+///
+/// # Safety
+///
+/// This is only unsafe because it accepts a raw pointer.
#[inline]
#[unstable]
pub unsafe fn swap<T>(x: *mut T, y: *mut T) {
mem::forget(tmp);
}
-/// Replace the value at a mutable location with a new one, returning the old
-/// value, without deinitialising either.
+/// Replaces the value at `dest` with `src`, returning the old
+/// value, without dropping either.
+///
+/// # Safety
+///
+/// This is only unsafe because it accepts a raw pointer.
+/// Otherwise, this operation is identical to `mem::replace`.
#[inline]
#[unstable]
pub unsafe fn replace<T>(dest: *mut T, mut src: T) -> T {
src
}
-/// Reads the value from `*src` and returns it.
+/// Reads the value from `src` without dropping it. This leaves the
+/// memory in `src` unchanged.
+///
+/// # Safety
+///
+/// Beyond accepting a raw pointer, this is unsafe because it semantically
+/// moves the value out of `src` without preventing further usage of `src`.
+/// If `T` is not `Copy`, then care must be taken to ensure that the value at
+/// `src` is not used before the data is overwritten again (e.g. with `write`,
+/// `zero_memory`, or `copy_memory`). Note that `*src = foo` counts as a use
+/// because it will attempt to drop the value previously at `*src`.
#[inline(always)]
#[unstable]
pub unsafe fn read<T>(src: *const T) -> T {
tmp
}
-/// Reads the value from `*src` and nulls it out.
-/// This currently prevents destructors from executing.
+/// Reads the value from `src` and nulls it out without dropping it.
+///
+/// # Safety
+///
+/// This is unsafe for the same reasons that `read` is unsafe.
#[inline(always)]
#[experimental]
#[allow(experimental)]
tmp
}
-/// Unsafely overwrite a memory location with the given value without destroying
+/// Overwrites a memory location with the given value without reading or dropping
/// the old value.
///
-/// This operation is unsafe because it does not destroy the previous value
-/// contained at the location `dst`. This could leak allocations or resources,
-/// so care must be taken to previously deallocate the value at `dst`.
+/// # Safety
+///
+/// Beyond accepting a raw pointer, this operation is unsafe because it does
+/// not drop the contents of `dst`. This could leak allocations or resources,
+/// so care must be taken not to overwrite an object that should be dropped.
+///
+/// This is appropriate for initializing uninitialized memory, or overwritting memory
+/// that has previously been `read` from.
#[inline]
#[unstable]
pub unsafe fn write<T>(dst: *mut T, src: T) {
/// Methods on raw pointers
pub trait RawPtr<T> {
- /// Returns the null pointer.
+ /// Returns a null raw pointer.
fn null() -> Self;
- /// Returns true if the pointer is equal to the null pointer.
+ /// Returns true if the pointer is null.
fn is_null(&self) -> bool;
- /// Returns true if the pointer is not equal to the null pointer.
+ /// Returns true if the pointer is not null.
fn is_not_null(&self) -> bool { !self.is_null() }
- /// Returns the value of this pointer (ie, the address it points to)
+ /// Returns the address of the pointer.
fn to_uint(&self) -> uint;
/// Returns `None` if the pointer is null, or else returns a reference to the
/// value wrapped in `Some`.
///
- /// # Safety Notes
+ /// # Safety
///
/// While this method and its mutable counterpart are useful for null-safety,
/// it is important to note that this is still an unsafe operation because
/// the returned value could be pointing to invalid memory.
unsafe fn as_ref<'a>(&self) -> Option<&'a T>;
- /// Calculates the offset from a pointer. The offset *must* be in-bounds of
- /// the object, or one-byte-past-the-end. `count` is in units of T; e.g. a
+ /// Calculates the offset from a pointer. `count` is in units of T; e.g. a
/// `count` of 3 represents a pointer offset of `3 * sizeof::<T>()` bytes.
+ ///
+ /// # Safety
+ ///
+ /// The offset must be in-bounds of the object, or one-byte-past-the-end. Otherwise
+ /// `offset` invokes Undefined Behaviour, regardless of whether the pointer is used.
unsafe fn offset(self, count: int) -> Self;
}
/// Methods on mutable raw pointers
pub trait RawMutPtr<T>{
/// Returns `None` if the pointer is null, or else returns a mutable reference
- /// to the value wrapped in `Some`. As with `as_ref`, this is unsafe because
- /// it cannot verify the validity of the returned pointer.
+ /// to the value wrapped in `Some`.
+ ///
+ /// # Safety
+ ///
+ /// As with `as_ref`, this is unsafe because it cannot verify the validity
+ /// of the returned pointer.
unsafe fn as_mut<'a>(&self) -> Option<&'a mut T>;
}
}
}
+#[stable]
impl<T> Clone for *const T {
#[inline]
fn clone(&self) -> *const T {
}
}
+#[stable]
impl<T> Clone for *mut T {
#[inline]
fn clone(&self) -> *mut T {
#[inline]
fn ge(&self, other: &*mut T) -> bool { *self >= *other }
}
-
#![stable]
-use self::Result::*;
+use self::Result::{Ok, Err};
-use std::fmt::Show;
-use slice;
-use slice::AsSlice;
+use clone::Clone;
+use fmt::Show;
use iter::{Iterator, IteratorExt, DoubleEndedIterator, FromIterator, ExactSizeIterator};
-use option::Option;
-use option::Option::{None, Some};
use ops::{FnMut, FnOnce};
+use option::Option::{mod, None, Some};
+use slice::AsSlice;
+use slice;
/// `Result` is a type that represents either success (`Ok`) or failure (`Err`).
///
#[stable]
pub enum Result<T, E> {
/// Contains the success value
+ #[stable]
Ok(T),
/// Contains the error value
+ #[stable]
Err(E)
}
// Type implementation
/////////////////////////////////////////////////////////////////////////////
+#[stable]
impl<T, E> Result<T, E> {
/////////////////////////////////////////////////////////////////////////
// Querying the contained values
!self.is_ok()
}
-
/////////////////////////////////////////////////////////////////////////
// Adapter for each variant
/////////////////////////////////////////////////////////////////////////
/// ```
#[inline]
#[stable]
- pub fn as_ref<'r>(&'r self) -> Result<&'r T, &'r E> {
+ pub fn as_ref(&self) -> Result<&T, &E> {
match *self {
Ok(ref x) => Ok(x),
Err(ref x) => Err(x),
/// assert_eq!(x.unwrap_err(), 0);
/// ```
#[inline]
- #[unstable = "waiting for mut conventions"]
- pub fn as_mut<'r>(&'r mut self) -> Result<&'r mut T, &'r mut E> {
+ #[stable]
+ pub fn as_mut(&mut self) -> Result<&mut T, &mut E> {
match *self {
Ok(ref mut x) => Ok(x),
Err(ref mut x) => Err(x),
/// ```
#[inline]
#[unstable = "waiting for mut conventions"]
- pub fn as_mut_slice<'r>(&'r mut self) -> &'r mut [T] {
+ pub fn as_mut_slice(&mut self) -> &mut [T] {
match *self {
Ok(ref mut x) => slice::mut_ref_slice(x),
Err(_) => {
/// assert!(sum == 10);
/// ```
#[inline]
- #[unstable = "waiting for unboxed closures"]
+ #[stable]
pub fn map<U, F: FnOnce(T) -> U>(self, op: F) -> Result<U,E> {
match self {
- Ok(t) => Ok(op(t)),
- Err(e) => Err(e)
+ Ok(t) => Ok(op(t)),
+ Err(e) => Err(e)
}
}
/// assert_eq!(x.map_err(stringify), Err("error code: 13".to_string()));
/// ```
#[inline]
- #[unstable = "waiting for unboxed closures"]
+ #[stable]
pub fn map_err<F, O: FnOnce(E) -> F>(self, op: O) -> Result<T,F> {
match self {
- Ok(t) => Ok(t),
- Err(e) => Err(op(e))
+ Ok(t) => Ok(t),
+ Err(e) => Err(op(e))
}
}
-
/////////////////////////////////////////////////////////////////////////
// Iterator constructors
/////////////////////////////////////////////////////////////////////////
/// assert_eq!(x.iter().next(), None);
/// ```
#[inline]
- #[unstable = "waiting for iterator conventions"]
- pub fn iter<'r>(&'r self) -> Item<&'r T> {
- Item{opt: self.as_ref().ok()}
+ #[stable]
+ pub fn iter(&self) -> Iter<T> {
+ Iter { inner: self.as_ref().ok() }
}
/// Returns a mutable iterator over the possibly contained value.
/// assert_eq!(x.iter_mut().next(), None);
/// ```
#[inline]
- #[unstable = "waiting for iterator conventions"]
- pub fn iter_mut<'r>(&'r mut self) -> Item<&'r mut T> {
- Item{opt: self.as_mut().ok()}
+ #[stable]
+ pub fn iter_mut(&mut self) -> IterMut<T> {
+ IterMut { inner: self.as_mut().ok() }
}
/// Returns a consuming iterator over the possibly contained value.
/// assert_eq!(v, vec![]);
/// ```
#[inline]
- #[unstable = "waiting for iterator conventions"]
- pub fn into_iter(self) -> Item<T> {
- Item{opt: self.ok()}
+ #[stable]
+ pub fn into_iter(self) -> IntoIter<T> {
+ IntoIter { inner: self.ok() }
}
////////////////////////////////////////////////////////////////////////
/// assert_eq!(Err(3).and_then(sq).and_then(sq), Err(3));
/// ```
#[inline]
- #[unstable = "waiting for unboxed closures"]
+ #[stable]
pub fn and_then<U, F: FnOnce(T) -> Result<U, E>>(self, op: F) -> Result<U, E> {
match self {
Ok(t) => op(t),
/// assert_eq!(Err(3).or_else(err).or_else(err), Err(3));
/// ```
#[inline]
- #[unstable = "waiting for unboxed closures"]
+ #[stable]
pub fn or_else<F, O: FnOnce(E) -> Result<T, F>>(self, op: O) -> Result<T, F> {
match self {
Ok(t) => Ok(t),
/// assert_eq!(x.unwrap_or(optb), optb);
/// ```
#[inline]
- #[unstable = "waiting for conventions"]
+ #[stable]
pub fn unwrap_or(self, optb: T) -> T {
match self {
Ok(t) => t,
/// assert_eq!(Err("foo").unwrap_or_else(count), 3u);
/// ```
#[inline]
- #[unstable = "waiting for conventions"]
+ #[stable]
pub fn unwrap_or_else<F: FnOnce(E) -> T>(self, op: F) -> T {
match self {
Ok(t) => t,
}
}
+#[stable]
impl<T, E: Show> Result<T, E> {
/// Unwraps a result, yielding the content of an `Ok`.
///
/// x.unwrap(); // panics with `emergency failure`
/// ```
#[inline]
- #[unstable = "waiting for conventions"]
+ #[stable]
pub fn unwrap(self) -> T {
match self {
Ok(t) => t,
}
}
+#[stable]
impl<T: Show, E> Result<T, E> {
/// Unwraps a result, yielding the content of an `Err`.
///
/// assert_eq!(x.unwrap_err(), "emergency failure");
/// ```
#[inline]
- #[unstable = "waiting for conventions"]
+ #[stable]
pub fn unwrap_err(self) -> E {
match self {
Ok(t) =>
}
/////////////////////////////////////////////////////////////////////////////
-// The Result Iterator
+// The Result Iterators
/////////////////////////////////////////////////////////////////////////////
-/// A `Result` iterator that yields either one or zero elements
-///
-/// The `Item` iterator is returned by the `iter`, `iter_mut` and `into_iter`
-/// methods on `Result`.
-#[deriving(Clone)]
-#[unstable = "waiting for iterator conventions"]
-pub struct Item<T> {
- opt: Option<T>
-}
+/// An iterator over a reference to the `Ok` variant of a `Result`.
+#[stable]
+pub struct Iter<'a, T: 'a> { inner: Option<&'a T> }
-impl<T> Iterator<T> for Item<T> {
+impl<'a, T> Iterator<&'a T> for Iter<'a, T> {
#[inline]
- fn next(&mut self) -> Option<T> {
- self.opt.take()
+ fn next(&mut self) -> Option<&'a T> { self.inner.take() }
+ #[inline]
+ fn size_hint(&self) -> (uint, Option<uint>) {
+ let n = if self.inner.is_some() {1} else {0};
+ (n, Some(n))
}
+}
+
+impl<'a, T> DoubleEndedIterator<&'a T> for Iter<'a, T> {
+ #[inline]
+ fn next_back(&mut self) -> Option<&'a T> { self.inner.take() }
+}
+
+impl<'a, T> ExactSizeIterator<&'a T> for Iter<'a, T> {}
+
+impl<'a, T> Clone for Iter<'a, T> {
+ fn clone(&self) -> Iter<'a, T> { Iter { inner: self.inner } }
+}
+
+/// An iterator over a mutable reference to the `Ok` variant of a `Result`.
+#[stable]
+pub struct IterMut<'a, T: 'a> { inner: Option<&'a mut T> }
+impl<'a, T> Iterator<&'a mut T> for IterMut<'a, T> {
+ #[inline]
+ fn next(&mut self) -> Option<&'a mut T> { self.inner.take() }
#[inline]
fn size_hint(&self) -> (uint, Option<uint>) {
- match self.opt {
- Some(_) => (1, Some(1)),
- None => (0, Some(0)),
- }
+ let n = if self.inner.is_some() {1} else {0};
+ (n, Some(n))
}
}
-impl<A> DoubleEndedIterator<A> for Item<A> {
+impl<'a, T> DoubleEndedIterator<&'a mut T> for IterMut<'a, T> {
#[inline]
- fn next_back(&mut self) -> Option<A> {
- self.opt.take()
+ fn next_back(&mut self) -> Option<&'a mut T> { self.inner.take() }
+}
+
+impl<'a, T> ExactSizeIterator<&'a mut T> for IterMut<'a, T> {}
+
+/// An iterator over the value in a `Ok` variant of a `Result`.
+#[stable]
+pub struct IntoIter<T> { inner: Option<T> }
+
+impl<T> Iterator<T> for IntoIter<T> {
+ #[inline]
+ fn next(&mut self) -> Option<T> { self.inner.take() }
+ #[inline]
+ fn size_hint(&self) -> (uint, Option<uint>) {
+ let n = if self.inner.is_some() {1} else {0};
+ (n, Some(n))
}
}
-impl<A> ExactSizeIterator<A> for Item<A> {}
+impl<T> DoubleEndedIterator<T> for IntoIter<T> {
+ #[inline]
+ fn next_back(&mut self) -> Option<T> { self.inner.take() }
+}
+
+impl<T> ExactSizeIterator<T> for IntoIter<T> {}
/////////////////////////////////////////////////////////////////////////////
// FromIterator
#[experimental = "needs review"]
impl<'a, T> ExactSizeIterator<&'a T> for Items<'a, T> {}
-#[experimental = "needs review"]
+#[stable]
impl<'a, T> Clone for Items<'a, T> {
fn clone(&self) -> Items<'a, T> { *self }
}
}
// FIXME(#19839) Remove in favor of `#[deriving(Clone)]`
+#[stable]
impl<'a, T, P> Clone for Splits<'a, T, P> where P: Clone + FnMut(&T) -> bool {
fn clone(&self) -> Splits<'a, T, P> {
Splits {
impl_int_slice! { u32, i32 }
impl_int_slice! { u64, i64 }
impl_int_slice! { uint, int }
-
--- /dev/null
+// Copyright 2012 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.
+
+//! Operations on tuples
+//!
+//! To access a single element of a tuple one can use the following
+//! methods:
+//!
+//! * `valN` - returns a value of _N_-th element
+//! * `refN` - returns a reference to _N_-th element
+//! * `mutN` - returns a mutable reference to _N_-th element
+//!
+//! Indexing starts from zero, so `val0` returns first value, `val1`
+//! returns second value, and so on. In general, a tuple with _S_
+//! elements provides aforementioned methods suffixed with numbers
+//! from `0` to `S-1`. Traits which contain these methods are
+//! implemented for tuples with up to 12 elements.
+//!
+//! If every type inside a tuple implements one of the following
+//! traits, then a tuple itself also implements it.
+//!
+//! * `Clone`
+//! * `PartialEq`
+//! * `Eq`
+//! * `PartialOrd`
+//! * `Ord`
+//! * `Default`
+//!
+//! # Examples
+//!
+//! Using methods:
+//!
+//! ```
+//! #[allow(deprecated)]
+//! # fn main() {
+//! let pair = ("pi", 3.14f64);
+//! assert_eq!(pair.val0(), "pi");
+//! assert_eq!(pair.val1(), 3.14f64);
+//! # }
+//! ```
+//!
+//! Using traits implemented for tuples:
+//!
+//! ```
+//! use std::default::Default;
+//!
+//! let a = (1i, 2i);
+//! let b = (3i, 4i);
+//! assert!(a != b);
+//!
+//! let c = b.clone();
+//! assert!(b == c);
+//!
+//! let d : (u32, f32) = Default::default();
+//! assert_eq!(d, (0u32, 0.0f32));
+//! ```
+
+#![stable]
+
+#[unstable = "this is just a documentation module and should not be part \
+ of the public api"]
+
+use clone::Clone;
+use cmp::*;
+use default::Default;
+use option::Option;
+use option::Option::Some;
+
+// FIXME(#19630) Remove this work-around
+macro_rules! e {
+ ($e:expr) => { $e }
+}
+
+// macro for implementing n-ary tuple functions and operations
+macro_rules! tuple_impls {
+ ($(
+ $Tuple:ident {
+ $(($valN:ident, $refN:ident, $mutN:ident, $idx:tt) -> $T:ident)+
+ }
+ )+) => {
+ $(
+ #[allow(missing_docs)]
+ #[deprecated]
+ pub trait $Tuple<$($T),+> {
+ $(
+ #[deprecated = "use tuple indexing: `tuple.N`"]
+ fn $valN(self) -> $T;
+ #[deprecated = "use tuple indexing: `&tuple.N`"]
+ fn $refN<'a>(&'a self) -> &'a $T;
+ #[deprecated = "use tuple indexing: `&mut tuple.N`"]
+ fn $mutN<'a>(&'a mut self) -> &'a mut $T;
+ )+
+ }
+
+ impl<$($T),+> $Tuple<$($T),+> for ($($T,)+) {
+ $(
+ #[inline]
+ #[allow(unused_variables)]
+ #[deprecated = "use tuple indexing: `tuple.N`"]
+ fn $valN(self) -> $T {
+ e!(self.$idx)
+ }
+
+ #[inline]
+ #[allow(unused_variables)]
+ #[deprecated = "use tuple indexing: `&tuple.N`"]
+ fn $refN<'a>(&'a self) -> &'a $T {
+ e!(&self.$idx)
+ }
+
+ #[inline]
+ #[allow(unused_variables)]
+ #[deprecated = "use tuple indexing: &mut tuple.N"]
+ fn $mutN<'a>(&'a mut self) -> &'a mut $T {
+ e!(&mut self.$idx)
+ }
+ )+
+ }
+
+ #[stable]
+ impl<$($T:Clone),+> Clone for ($($T,)+) {
+ fn clone(&self) -> ($($T,)+) {
+ ($(e!(self.$idx.clone()),)+)
+ }
+ }
+
+ #[unstable = "waiting for PartialEq to stabilize"]
+ impl<$($T:PartialEq),+> PartialEq for ($($T,)+) {
+ #[inline]
+ fn eq(&self, other: &($($T,)+)) -> bool {
+ e!($(self.$idx == other.$idx)&&+)
+ }
+ #[inline]
+ fn ne(&self, other: &($($T,)+)) -> bool {
+ e!($(self.$idx != other.$idx)||+)
+ }
+ }
+
+ #[unstable = "waiting for Eq to stabilize"]
+ impl<$($T:Eq),+> Eq for ($($T,)+) {}
+
+ #[unstable = "waiting for PartialOrd to stabilize"]
+ impl<$($T:PartialOrd + PartialEq),+> PartialOrd for ($($T,)+) {
+ #[inline]
+ fn partial_cmp(&self, other: &($($T,)+)) -> Option<Ordering> {
+ lexical_partial_cmp!($(self.$idx, other.$idx),+)
+ }
+ #[inline]
+ fn lt(&self, other: &($($T,)+)) -> bool {
+ lexical_ord!(lt, $(self.$idx, other.$idx),+)
+ }
+ #[inline]
+ fn le(&self, other: &($($T,)+)) -> bool {
+ lexical_ord!(le, $(self.$idx, other.$idx),+)
+ }
+ #[inline]
+ fn ge(&self, other: &($($T,)+)) -> bool {
+ lexical_ord!(ge, $(self.$idx, other.$idx),+)
+ }
+ #[inline]
+ fn gt(&self, other: &($($T,)+)) -> bool {
+ lexical_ord!(gt, $(self.$idx, other.$idx),+)
+ }
+ }
+
+ #[unstable = "waiting for Ord to stabilize"]
+ impl<$($T:Ord),+> Ord for ($($T,)+) {
+ #[inline]
+ fn cmp(&self, other: &($($T,)+)) -> Ordering {
+ lexical_cmp!($(self.$idx, other.$idx),+)
+ }
+ }
+
+ #[stable]
+ impl<$($T:Default),+> Default for ($($T,)+) {
+ #[stable]
+ #[inline]
+ fn default() -> ($($T,)+) {
+ ($({ let x: $T = Default::default(); x},)+)
+ }
+ }
+ )+
+ }
+}
+
+// Constructs an expression that performs a lexical ordering using method $rel.
+// The values are interleaved, so the macro invocation for
+// `(a1, a2, a3) < (b1, b2, b3)` would be `lexical_ord!(lt, a1, b1, a2, b2,
+// a3, b3)` (and similarly for `lexical_cmp`)
+macro_rules! lexical_ord {
+ ($rel: ident, $a:expr, $b:expr, $($rest_a:expr, $rest_b:expr),+) => {
+ if $a != $b { lexical_ord!($rel, $a, $b) }
+ else { lexical_ord!($rel, $($rest_a, $rest_b),+) }
+ };
+ ($rel: ident, $a:expr, $b:expr) => { ($a) . $rel (& $b) };
+}
+
+macro_rules! lexical_partial_cmp {
+ ($a:expr, $b:expr, $($rest_a:expr, $rest_b:expr),+) => {
+ match ($a).partial_cmp(&$b) {
+ Some(Equal) => lexical_partial_cmp!($($rest_a, $rest_b),+),
+ ordering => ordering
+ }
+ };
+ ($a:expr, $b:expr) => { ($a).partial_cmp(&$b) };
+}
+
+macro_rules! lexical_cmp {
+ ($a:expr, $b:expr, $($rest_a:expr, $rest_b:expr),+) => {
+ match ($a).cmp(&$b) {
+ Equal => lexical_cmp!($($rest_a, $rest_b),+),
+ ordering => ordering
+ }
+ };
+ ($a:expr, $b:expr) => { ($a).cmp(&$b) };
+}
+
+tuple_impls! {
+ Tuple1 {
+ (val0, ref0, mut0, 0) -> A
+ }
+ Tuple2 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ }
+ Tuple3 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ }
+ Tuple4 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ }
+ Tuple5 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ (val4, ref4, mut4, 4) -> E
+ }
+ Tuple6 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ (val4, ref4, mut4, 4) -> E
+ (val5, ref5, mut5, 5) -> F
+ }
+ Tuple7 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ (val4, ref4, mut4, 4) -> E
+ (val5, ref5, mut5, 5) -> F
+ (val6, ref6, mut6, 6) -> G
+ }
+ Tuple8 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ (val4, ref4, mut4, 4) -> E
+ (val5, ref5, mut5, 5) -> F
+ (val6, ref6, mut6, 6) -> G
+ (val7, ref7, mut7, 7) -> H
+ }
+ Tuple9 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ (val4, ref4, mut4, 4) -> E
+ (val5, ref5, mut5, 5) -> F
+ (val6, ref6, mut6, 6) -> G
+ (val7, ref7, mut7, 7) -> H
+ (val8, ref8, mut8, 8) -> I
+ }
+ Tuple10 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ (val4, ref4, mut4, 4) -> E
+ (val5, ref5, mut5, 5) -> F
+ (val6, ref6, mut6, 6) -> G
+ (val7, ref7, mut7, 7) -> H
+ (val8, ref8, mut8, 8) -> I
+ (val9, ref9, mut9, 9) -> J
+ }
+ Tuple11 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ (val4, ref4, mut4, 4) -> E
+ (val5, ref5, mut5, 5) -> F
+ (val6, ref6, mut6, 6) -> G
+ (val7, ref7, mut7, 7) -> H
+ (val8, ref8, mut8, 8) -> I
+ (val9, ref9, mut9, 9) -> J
+ (val10, ref10, mut10, 10) -> K
+ }
+ Tuple12 {
+ (val0, ref0, mut0, 0) -> A
+ (val1, ref1, mut1, 1) -> B
+ (val2, ref2, mut2, 2) -> C
+ (val3, ref3, mut3, 3) -> D
+ (val4, ref4, mut4, 4) -> E
+ (val5, ref5, mut5, 5) -> F
+ (val6, ref6, mut6, 6) -> G
+ (val7, ref7, mut7, 7) -> H
+ (val8, ref8, mut8, 8) -> I
+ (val9, ref9, mut9, 9) -> J
+ (val10, ref10, mut10, 10) -> K
+ (val11, ref11, mut11, 11) -> L
+ }
+}
+++ /dev/null
-// Copyright 2012 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.
-
-//! Operations on tuples
-//!
-//! To access a single element of a tuple one can use the following
-//! methods:
-//!
-//! * `valN` - returns a value of _N_-th element
-//! * `refN` - returns a reference to _N_-th element
-//! * `mutN` - returns a mutable reference to _N_-th element
-//!
-//! Indexing starts from zero, so `val0` returns first value, `val1`
-//! returns second value, and so on. In general, a tuple with _S_
-//! elements provides aforementioned methods suffixed with numbers
-//! from `0` to `S-1`. Traits which contain these methods are
-//! implemented for tuples with up to 12 elements.
-//!
-//! If every type inside a tuple implements one of the following
-//! traits, then a tuple itself also implements it.
-//!
-//! * `Clone`
-//! * `PartialEq`
-//! * `Eq`
-//! * `PartialOrd`
-//! * `Ord`
-//! * `Default`
-//!
-//! # Examples
-//!
-//! Using methods:
-//!
-//! ```
-//! #[allow(deprecated)]
-//! # fn main() {
-//! let pair = ("pi", 3.14f64);
-//! assert_eq!(pair.val0(), "pi");
-//! assert_eq!(pair.val1(), 3.14f64);
-//! # }
-//! ```
-//!
-//! Using traits implemented for tuples:
-//!
-//! ```
-//! use std::default::Default;
-//!
-//! let a = (1i, 2i);
-//! let b = (3i, 4i);
-//! assert!(a != b);
-//!
-//! let c = b.clone();
-//! assert!(b == c);
-//!
-//! let d : (u32, f32) = Default::default();
-//! assert_eq!(d, (0u32, 0.0f32));
-//! ```
-
-#![doc(primitive = "tuple")]
-#![stable]
-
-#[unstable = "this is just a documentation module and should not be part \
- of the public api"]
-pub use unit;
-
-use clone::Clone;
-use cmp::*;
-use default::Default;
-use option::Option;
-use option::Option::Some;
-
-// FIXME(#19630) Remove this work-around
-macro_rules! e {
- ($e:expr) => { $e }
-}
-
-// macro for implementing n-ary tuple functions and operations
-macro_rules! tuple_impls {
- ($(
- $Tuple:ident {
- $(($valN:ident, $refN:ident, $mutN:ident, $idx:tt) -> $T:ident)+
- }
- )+) => {
- $(
- #[allow(missing_docs)]
- #[deprecated]
- pub trait $Tuple<$($T),+> {
- $(
- #[deprecated = "use tuple indexing: `tuple.N`"]
- fn $valN(self) -> $T;
- #[deprecated = "use tuple indexing: `&tuple.N`"]
- fn $refN<'a>(&'a self) -> &'a $T;
- #[deprecated = "use tuple indexing: `&mut tuple.N`"]
- fn $mutN<'a>(&'a mut self) -> &'a mut $T;
- )+
- }
-
- impl<$($T),+> $Tuple<$($T),+> for ($($T,)+) {
- $(
- #[inline]
- #[allow(unused_variables)]
- #[deprecated = "use tuple indexing: `tuple.N`"]
- fn $valN(self) -> $T {
- e!(self.$idx)
- }
-
- #[inline]
- #[allow(unused_variables)]
- #[deprecated = "use tuple indexing: `&tuple.N`"]
- fn $refN<'a>(&'a self) -> &'a $T {
- e!(&self.$idx)
- }
-
- #[inline]
- #[allow(unused_variables)]
- #[deprecated = "use tuple indexing: &mut tuple.N"]
- fn $mutN<'a>(&'a mut self) -> &'a mut $T {
- e!(&mut self.$idx)
- }
- )+
- }
-
- #[unstable = "waiting for Clone to stabilize"]
- impl<$($T:Clone),+> Clone for ($($T,)+) {
- fn clone(&self) -> ($($T,)+) {
- ($(e!(self.$idx.clone()),)+)
- }
- }
-
- #[unstable = "waiting for PartialEq to stabilize"]
- impl<$($T:PartialEq),+> PartialEq for ($($T,)+) {
- #[inline]
- fn eq(&self, other: &($($T,)+)) -> bool {
- e!($(self.$idx == other.$idx)&&+)
- }
- #[inline]
- fn ne(&self, other: &($($T,)+)) -> bool {
- e!($(self.$idx != other.$idx)||+)
- }
- }
-
- #[unstable = "waiting for Eq to stabilize"]
- impl<$($T:Eq),+> Eq for ($($T,)+) {}
-
- #[unstable = "waiting for PartialOrd to stabilize"]
- impl<$($T:PartialOrd + PartialEq),+> PartialOrd for ($($T,)+) {
- #[inline]
- fn partial_cmp(&self, other: &($($T,)+)) -> Option<Ordering> {
- lexical_partial_cmp!($(self.$idx, other.$idx),+)
- }
- #[inline]
- fn lt(&self, other: &($($T,)+)) -> bool {
- lexical_ord!(lt, $(self.$idx, other.$idx),+)
- }
- #[inline]
- fn le(&self, other: &($($T,)+)) -> bool {
- lexical_ord!(le, $(self.$idx, other.$idx),+)
- }
- #[inline]
- fn ge(&self, other: &($($T,)+)) -> bool {
- lexical_ord!(ge, $(self.$idx, other.$idx),+)
- }
- #[inline]
- fn gt(&self, other: &($($T,)+)) -> bool {
- lexical_ord!(gt, $(self.$idx, other.$idx),+)
- }
- }
-
- #[unstable = "waiting for Ord to stabilize"]
- impl<$($T:Ord),+> Ord for ($($T,)+) {
- #[inline]
- fn cmp(&self, other: &($($T,)+)) -> Ordering {
- lexical_cmp!($(self.$idx, other.$idx),+)
- }
- }
-
- #[stable]
- impl<$($T:Default),+> Default for ($($T,)+) {
- #[stable]
- #[inline]
- fn default() -> ($($T,)+) {
- ($({ let x: $T = Default::default(); x},)+)
- }
- }
- )+
- }
-}
-
-// Constructs an expression that performs a lexical ordering using method $rel.
-// The values are interleaved, so the macro invocation for
-// `(a1, a2, a3) < (b1, b2, b3)` would be `lexical_ord!(lt, a1, b1, a2, b2,
-// a3, b3)` (and similarly for `lexical_cmp`)
-macro_rules! lexical_ord {
- ($rel: ident, $a:expr, $b:expr, $($rest_a:expr, $rest_b:expr),+) => {
- if $a != $b { lexical_ord!($rel, $a, $b) }
- else { lexical_ord!($rel, $($rest_a, $rest_b),+) }
- };
- ($rel: ident, $a:expr, $b:expr) => { ($a) . $rel (& $b) };
-}
-
-macro_rules! lexical_partial_cmp {
- ($a:expr, $b:expr, $($rest_a:expr, $rest_b:expr),+) => {
- match ($a).partial_cmp(&$b) {
- Some(Equal) => lexical_partial_cmp!($($rest_a, $rest_b),+),
- ordering => ordering
- }
- };
- ($a:expr, $b:expr) => { ($a).partial_cmp(&$b) };
-}
-
-macro_rules! lexical_cmp {
- ($a:expr, $b:expr, $($rest_a:expr, $rest_b:expr),+) => {
- match ($a).cmp(&$b) {
- Equal => lexical_cmp!($($rest_a, $rest_b),+),
- ordering => ordering
- }
- };
- ($a:expr, $b:expr) => { ($a).cmp(&$b) };
-}
-
-tuple_impls! {
- Tuple1 {
- (val0, ref0, mut0, 0) -> A
- }
- Tuple2 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- }
- Tuple3 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- }
- Tuple4 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- }
- Tuple5 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- (val4, ref4, mut4, 4) -> E
- }
- Tuple6 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- (val4, ref4, mut4, 4) -> E
- (val5, ref5, mut5, 5) -> F
- }
- Tuple7 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- (val4, ref4, mut4, 4) -> E
- (val5, ref5, mut5, 5) -> F
- (val6, ref6, mut6, 6) -> G
- }
- Tuple8 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- (val4, ref4, mut4, 4) -> E
- (val5, ref5, mut5, 5) -> F
- (val6, ref6, mut6, 6) -> G
- (val7, ref7, mut7, 7) -> H
- }
- Tuple9 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- (val4, ref4, mut4, 4) -> E
- (val5, ref5, mut5, 5) -> F
- (val6, ref6, mut6, 6) -> G
- (val7, ref7, mut7, 7) -> H
- (val8, ref8, mut8, 8) -> I
- }
- Tuple10 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- (val4, ref4, mut4, 4) -> E
- (val5, ref5, mut5, 5) -> F
- (val6, ref6, mut6, 6) -> G
- (val7, ref7, mut7, 7) -> H
- (val8, ref8, mut8, 8) -> I
- (val9, ref9, mut9, 9) -> J
- }
- Tuple11 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- (val4, ref4, mut4, 4) -> E
- (val5, ref5, mut5, 5) -> F
- (val6, ref6, mut6, 6) -> G
- (val7, ref7, mut7, 7) -> H
- (val8, ref8, mut8, 8) -> I
- (val9, ref9, mut9, 9) -> J
- (val10, ref10, mut10, 10) -> K
- }
- Tuple12 {
- (val0, ref0, mut0, 0) -> A
- (val1, ref1, mut1, 1) -> B
- (val2, ref2, mut2, 2) -> C
- (val3, ref3, mut3, 3) -> D
- (val4, ref4, mut4, 4) -> E
- (val5, ref5, mut5, 5) -> F
- (val6, ref6, mut6, 6) -> G
- (val7, ref7, mut7, 7) -> H
- (val8, ref8, mut8, 8) -> I
- (val9, ref9, mut9, 9) -> J
- (val10, ref10, mut10, 10) -> K
- (val11, ref11, mut11, 11) -> L
- }
-}
-
+++ /dev/null
-// Copyright 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 <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.
-
-#![doc(primitive = "unit")]
-#![unstable = "this module is purely for documentation and it will likely be \
- removed from the public api"]
-
-//! The `()` type, sometimes called "unit" or "nil".
-//!
-//! The `()` type has exactly one value `()`, and is used when there
-//! is no other meaningful value that could be returned. `()` is most
-//! commonly seen implicitly: functions without a `-> ...` implicitly
-//! have return type `()`, that is, these are equivalent:
-//!
-//! ```rust
-//! fn long() -> () {}
-//!
-//! fn short() {}
-//! ```
-//!
-//! The semicolon `;` can be used to discard the result of an
-//! expression at the end of a block, making the expression (and thus
-//! the block) evaluate to `()`. For example,
-//!
-//! ```rust
-//! fn returns_i64() -> i64 {
-//! 1i64
-//! }
-//! fn returns_unit() {
-//! 1i64;
-//! }
-//!
-//! let is_i64 = {
-//! returns_i64()
-//! };
-//! let is_unit = {
-//! returns_i64();
-//! };
-//! ```
use lint::{Context, LintPass, LintArray};
use std::{cmp, slice};
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use std::num::SignedInt;
use std::{i8, i16, i32, i64, u8, u16, u32, u64, f32, f64};
use syntax::{abi, ast, ast_map};
ast::ExprIf(ref cond, _, _) => (cond, "`if` condition", true),
ast::ExprWhile(ref cond, _, _) => (cond, "`while` condition", true),
ast::ExprMatch(ref head, _, source) => match source {
- ast::MatchNormal => (head, "`match` head expression", true),
- ast::MatchIfLetDesugar => (head, "`if let` head expression", true),
- ast::MatchWhileLetDesugar => (head, "`while let` head expression", true),
+ ast::MatchSource::Normal => (head, "`match` head expression", true),
+ ast::MatchSource::IfLetDesugar { .. } => (head, "`if let` head expression", true),
+ ast::MatchSource::WhileLetDesugar => (head, "`while let` head expression", true),
},
ast::ExprRet(Some(ref value)) => (value, "`return` value", false),
ast::ExprAssign(_, ref value) => (value, "assigned value", false),
use util::nodemap::FnvHashMap;
use std::rc::Rc;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use syntax::ast;
use syntax::abi;
use syntax::attr;
if abi == abi::RustIntrinsic {
encode_inlined_item(ecx, rbml_w, IIForeignRef(nitem));
}
+ encode_attributes(rbml_w, &*nitem.attrs);
+ let stab = stability::lookup(ecx.tcx, ast_util::local_def(nitem.id));
+ encode_stability(rbml_w, stab);
encode_symbol(ecx, rbml_w, nitem.id);
}
ast::ForeignItemStatic(_, mutbl) => {
}
encode_bounds_and_type(rbml_w, ecx,
&lookup_item_type(ecx.tcx,local_def(nitem.id)));
+ encode_attributes(rbml_w, &*nitem.attrs);
+ let stab = stability::lookup(ecx.tcx, ast_util::local_def(nitem.id));
+ encode_stability(rbml_w, stab);
encode_symbol(ecx, rbml_w, nitem.id);
encode_name(rbml_w, nitem.ident.name);
}
use std::c_str::ToCStr;
use std::cmp;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use std::collections::{HashMap, HashSet};
use std::io::fs::PathExtensions;
use std::io;
None => {}
}
let pos = w.tell().unwrap();
- enc_sty(w, cx, &t.sty);
+
+ match t.sty {
+ ty::ty_bool => mywrite!(w, "b"),
+ ty::ty_char => mywrite!(w, "c"),
+ ty::ty_int(t) => {
+ match t {
+ ast::TyI => mywrite!(w, "i"),
+ ast::TyI8 => mywrite!(w, "MB"),
+ ast::TyI16 => mywrite!(w, "MW"),
+ ast::TyI32 => mywrite!(w, "ML"),
+ ast::TyI64 => mywrite!(w, "MD")
+ }
+ }
+ ty::ty_uint(t) => {
+ match t {
+ ast::TyU => mywrite!(w, "u"),
+ ast::TyU8 => mywrite!(w, "Mb"),
+ ast::TyU16 => mywrite!(w, "Mw"),
+ ast::TyU32 => mywrite!(w, "Ml"),
+ ast::TyU64 => mywrite!(w, "Md")
+ }
+ }
+ ty::ty_float(t) => {
+ match t {
+ ast::TyF32 => mywrite!(w, "Mf"),
+ ast::TyF64 => mywrite!(w, "MF"),
+ }
+ }
+ ty::ty_enum(def, ref substs) => {
+ mywrite!(w, "t[{}|", (cx.ds)(def));
+ enc_substs(w, cx, substs);
+ mywrite!(w, "]");
+ }
+ ty::ty_trait(box ty::TyTrait { ref principal,
+ ref bounds }) => {
+ mywrite!(w, "x[");
+ enc_trait_ref(w, cx, &principal.0);
+ enc_existential_bounds(w, cx, bounds);
+ mywrite!(w, "]");
+ }
+ ty::ty_tup(ref ts) => {
+ mywrite!(w, "T[");
+ for t in ts.iter() { enc_ty(w, cx, *t); }
+ mywrite!(w, "]");
+ }
+ ty::ty_uniq(typ) => { mywrite!(w, "~"); enc_ty(w, cx, typ); }
+ ty::ty_ptr(mt) => { mywrite!(w, "*"); enc_mt(w, cx, mt); }
+ ty::ty_rptr(r, mt) => {
+ mywrite!(w, "&");
+ enc_region(w, cx, r);
+ enc_mt(w, cx, mt);
+ }
+ ty::ty_vec(t, sz) => {
+ mywrite!(w, "V");
+ enc_ty(w, cx, t);
+ mywrite!(w, "/");
+ match sz {
+ Some(n) => mywrite!(w, "{}|", n),
+ None => mywrite!(w, "|"),
+ }
+ }
+ ty::ty_str => {
+ mywrite!(w, "v");
+ }
+ ty::ty_closure(ref f) => {
+ mywrite!(w, "f");
+ enc_closure_ty(w, cx, &**f);
+ }
+ ty::ty_bare_fn(ref f) => {
+ mywrite!(w, "F");
+ enc_bare_fn_ty(w, cx, f);
+ }
+ ty::ty_infer(_) => {
+ cx.diag.handler().bug("cannot encode inference variable types");
+ }
+ ty::ty_param(ParamTy {space, idx: id, def_id: did}) => {
+ mywrite!(w, "p{}|{}|{}|", (cx.ds)(did), id, space.to_uint())
+ }
+ ty::ty_struct(def, ref substs) => {
+ mywrite!(w, "a[{}|", (cx.ds)(def));
+ enc_substs(w, cx, substs);
+ mywrite!(w, "]");
+ }
+ ty::ty_unboxed_closure(def, region, ref substs) => {
+ mywrite!(w, "k[{}|", (cx.ds)(def));
+ enc_region(w, cx, region);
+ enc_substs(w, cx, substs);
+ mywrite!(w, "]");
+ }
+ ty::ty_err => {
+ mywrite!(w, "e");
+ }
+ ty::ty_open(_) => {
+ cx.diag.handler().bug("unexpected type in enc_sty (ty_open)");
+ }
+ }
+
let end = w.tell().unwrap();
let len = end - pos;
fn estimate_sz(u: u64) -> u64 {
}
}
-fn enc_sty<'a, 'tcx>(w: &mut SeekableMemWriter, cx: &ctxt<'a, 'tcx>,
- st: &ty::sty<'tcx>) {
- match *st {
- ty::ty_bool => mywrite!(w, "b"),
- ty::ty_char => mywrite!(w, "c"),
- ty::ty_int(t) => {
- match t {
- ast::TyI => mywrite!(w, "i"),
- ast::TyI8 => mywrite!(w, "MB"),
- ast::TyI16 => mywrite!(w, "MW"),
- ast::TyI32 => mywrite!(w, "ML"),
- ast::TyI64 => mywrite!(w, "MD")
- }
- }
- ty::ty_uint(t) => {
- match t {
- ast::TyU => mywrite!(w, "u"),
- ast::TyU8 => mywrite!(w, "Mb"),
- ast::TyU16 => mywrite!(w, "Mw"),
- ast::TyU32 => mywrite!(w, "Ml"),
- ast::TyU64 => mywrite!(w, "Md")
- }
- }
- ty::ty_float(t) => {
- match t {
- ast::TyF32 => mywrite!(w, "Mf"),
- ast::TyF64 => mywrite!(w, "MF"),
- }
- }
- ty::ty_enum(def, ref substs) => {
- mywrite!(w, "t[{}|", (cx.ds)(def));
- enc_substs(w, cx, substs);
- mywrite!(w, "]");
- }
- ty::ty_trait(box ty::TyTrait { ref principal,
- ref bounds }) => {
- mywrite!(w, "x[");
- enc_trait_ref(w, cx, &principal.0);
- enc_existential_bounds(w, cx, bounds);
- mywrite!(w, "]");
- }
- ty::ty_tup(ref ts) => {
- mywrite!(w, "T[");
- for t in ts.iter() { enc_ty(w, cx, *t); }
- mywrite!(w, "]");
- }
- ty::ty_uniq(typ) => { mywrite!(w, "~"); enc_ty(w, cx, typ); }
- ty::ty_ptr(mt) => { mywrite!(w, "*"); enc_mt(w, cx, mt); }
- ty::ty_rptr(r, mt) => {
- mywrite!(w, "&");
- enc_region(w, cx, r);
- enc_mt(w, cx, mt);
- }
- ty::ty_vec(t, sz) => {
- mywrite!(w, "V");
- enc_ty(w, cx, t);
- mywrite!(w, "/");
- match sz {
- Some(n) => mywrite!(w, "{}|", n),
- None => mywrite!(w, "|"),
- }
- }
- ty::ty_str => {
- mywrite!(w, "v");
- }
- ty::ty_closure(ref f) => {
- mywrite!(w, "f");
- enc_closure_ty(w, cx, &**f);
- }
- ty::ty_bare_fn(ref f) => {
- mywrite!(w, "F");
- enc_bare_fn_ty(w, cx, f);
- }
- ty::ty_infer(_) => {
- cx.diag.handler().bug("cannot encode inference variable types");
- }
- ty::ty_param(ParamTy {space, idx: id, def_id: did}) => {
- mywrite!(w, "p{}|{}|{}|", (cx.ds)(did), id, space.to_uint())
- }
- ty::ty_struct(def, ref substs) => {
- mywrite!(w, "a[{}|", (cx.ds)(def));
- enc_substs(w, cx, substs);
- mywrite!(w, "]");
- }
- ty::ty_unboxed_closure(def, region, ref substs) => {
- mywrite!(w, "k[{}|", (cx.ds)(def));
- enc_region(w, cx, region);
- enc_substs(w, cx, substs);
- mywrite!(w, "]");
- }
- ty::ty_err => {
- mywrite!(w, "e");
- }
- ty::ty_open(_) => {
- cx.diag.handler().bug("unexpected type in enc_sty (ty_open)");
- }
- }
-}
-
fn enc_unsafety(w: &mut SeekableMemWriter, p: ast::Unsafety) {
match p {
ast::Unsafety::Normal => mywrite!(w, "n"),
blk: &ast::Block) -> CFG {
construct::construct(tcx, blk)
}
+
+ pub fn node_is_reachable(&self, id: ast::NodeId) -> bool {
+ self.graph.depth_traverse(self.entry).any(|node| node.id == id)
+ }
}
match is_useful(cx, &seen, v.as_slice(), LeaveOutWitness) {
NotUseful => {
match source {
- ast::MatchIfLetDesugar => {
+ ast::MatchSource::IfLetDesugar { .. } => {
if printed_if_let_err {
// we already printed an irrefutable if-let pattern error.
// We don't want two, that's just confusing.
}
},
- ast::MatchWhileLetDesugar => {
+ ast::MatchSource::WhileLetDesugar => {
// find the first arm pattern so we can use its span
let &(ref first_arm_pats, _) = &arms[0];
let first_pat = &first_arm_pats[0];
span_err!(cx.tcx.sess, span, E0165, "irrefutable while-let pattern");
},
- ast::MatchNormal => {
+ ast::MatchSource::Normal => {
span_err!(cx.tcx.sess, pat.span, E0001, "unreachable pattern")
},
}
use syntax::{ast_map, ast_util, codemap};
use std::rc::Rc;
-use std::collections::hash_map::Vacant;
+use std::collections::hash_map::Entry::Vacant;
//
// This pass classifies expressions by their constant-ness.
use std::fmt::{Formatter, Error, Show};
use std::uint;
+use std::collections::BitvSet;
pub struct Graph<N,E> {
nodes: Vec<Node<N>> ,
}
}
}
+
+ pub fn depth_traverse<'a>(&'a self, start: NodeIndex) -> DepthFirstTraversal<'a, N, E> {
+ DepthFirstTraversal {
+ graph: self,
+ stack: vec![start],
+ visited: BitvSet::new()
+ }
+ }
+}
+
+pub struct DepthFirstTraversal<'g, N:'g, E:'g> {
+ graph: &'g Graph<N, E>,
+ stack: Vec<NodeIndex>,
+ visited: BitvSet
+}
+
+impl<'g, N, E> Iterator<&'g N> for DepthFirstTraversal<'g, N, E> {
+ fn next(&mut self) -> Option<&'g N> {
+ while let Some(idx) = self.stack.pop() {
+ if !self.visited.insert(idx.node_id()) {
+ continue;
+ }
+ self.graph.each_outgoing_edge(idx, |_, e| -> bool {
+ if !self.visited.contains(&e.target().node_id()) {
+ self.stack.push(e.target());
+ }
+ true
+ });
+
+ return Some(self.graph.node_data(idx));
+ }
+
+ return None;
+ }
}
pub fn each_edge_index<F>(max_edge_index: EdgeIndex, mut f: F) where
b.repr(self.get_ref().infcx.tcx));
// Consider coercing the subtype to a DST
- let unsize = self.unpack_actual_value(a, |sty_a| {
- self.coerce_unsized(a, sty_a, b)
+ let unsize = self.unpack_actual_value(a, |a| {
+ self.coerce_unsized(a, b)
});
if unsize.is_ok() {
return unsize;
ty::ty_ptr(mt_b) => {
match mt_b.ty.sty {
ty::ty_str => {
- return self.unpack_actual_value(a, |sty_a| {
- self.coerce_unsafe_ptr(a, sty_a, b, ast::MutImmutable)
+ return self.unpack_actual_value(a, |a| {
+ self.coerce_unsafe_ptr(a, b, ast::MutImmutable)
});
}
ty::ty_trait(..) => {
- let result = self.unpack_actual_value(a, |sty_a| {
- self.coerce_unsafe_object(a, sty_a, b, mt_b.mutbl)
+ let result = self.unpack_actual_value(a, |a| {
+ self.coerce_unsafe_object(a, b, mt_b.mutbl)
});
match result {
}
_ => {
- return self.unpack_actual_value(a, |sty_a| {
- self.coerce_unsafe_ptr(a, sty_a, b, mt_b.mutbl)
+ return self.unpack_actual_value(a, |a| {
+ self.coerce_unsafe_ptr(a, b, mt_b.mutbl)
});
}
};
ty::ty_rptr(_, mt_b) => {
match mt_b.ty.sty {
ty::ty_str => {
- return self.unpack_actual_value(a, |sty_a| {
- self.coerce_borrowed_pointer(a, sty_a, b, ast::MutImmutable)
+ return self.unpack_actual_value(a, |a| {
+ self.coerce_borrowed_pointer(a, b, ast::MutImmutable)
});
}
ty::ty_trait(..) => {
- let result = self.unpack_actual_value(a, |sty_a| {
- self.coerce_borrowed_object(a, sty_a, b, mt_b.mutbl)
+ let result = self.unpack_actual_value(a, |a| {
+ self.coerce_borrowed_object(a, b, mt_b.mutbl)
});
match result {
}
_ => {
- return self.unpack_actual_value(a, |sty_a| {
- self.coerce_borrowed_pointer(a, sty_a, b, mt_b.mutbl)
+ return self.unpack_actual_value(a, |a| {
+ self.coerce_borrowed_pointer(a, b, mt_b.mutbl)
});
}
};
store: ty::RegionTraitStore(..),
..
}) => {
- return self.unpack_actual_value(a, |sty_a| {
- self.coerce_borrowed_fn(a, sty_a, b)
+ return self.unpack_actual_value(a, |a| {
+ self.coerce_borrowed_fn(a, b)
});
}
_ => {}
}
- self.unpack_actual_value(a, |sty_a| {
- match *sty_a {
+ self.unpack_actual_value(a, |a| {
+ match a.sty {
ty::ty_bare_fn(ref a_f) => {
// Bare functions are coercible to any closure type.
//
}
pub fn unpack_actual_value<T, F>(&self, a: Ty<'tcx>, f: F) -> T where
- F: FnOnce(&ty::sty<'tcx>) -> T,
+ F: FnOnce(Ty<'tcx>) -> T,
{
- f(&self.get_ref().infcx.shallow_resolve(a).sty)
+ f(self.get_ref().infcx.shallow_resolve(a))
}
// ~T -> &T or &mut T -> &T (including where T = [U] or str)
pub fn coerce_borrowed_pointer(&self,
a: Ty<'tcx>,
- sty_a: &ty::sty<'tcx>,
b: Ty<'tcx>,
mutbl_b: ast::Mutability)
-> CoerceResult<'tcx> {
- debug!("coerce_borrowed_pointer(a={}, sty_a={}, b={})",
- a.repr(self.get_ref().infcx.tcx), sty_a,
+ debug!("coerce_borrowed_pointer(a={}, b={})",
+ a.repr(self.get_ref().infcx.tcx),
b.repr(self.get_ref().infcx.tcx));
// If we have a parameter of type `&M T_a` and the value
let coercion = Coercion(self.get_ref().trace.clone());
let r_borrow = self.get_ref().infcx.next_region_var(coercion);
- let inner_ty = match *sty_a {
+ let inner_ty = match a.sty {
ty::ty_uniq(_) => return Err(ty::terr_mismatch),
ty::ty_rptr(_, mt_a) => mt_a.ty,
_ => {
// or &Concrete -> &Trait, etc.
fn coerce_unsized(&self,
a: Ty<'tcx>,
- sty_a: &ty::sty<'tcx>,
b: Ty<'tcx>)
-> CoerceResult<'tcx> {
- debug!("coerce_unsized(a={}, sty_a={}, b={})",
- a.repr(self.get_ref().infcx.tcx), sty_a,
+ debug!("coerce_unsized(a={}, b={})",
+ a.repr(self.get_ref().infcx.tcx),
b.repr(self.get_ref().infcx.tcx));
// Note, we want to avoid unnecessary unsizing. We don't want to coerce to
let sub = Sub(self.get_ref().clone());
- let sty_b = &b.sty;
- match (sty_a, sty_b) {
+ match (&a.sty, &b.sty) {
(&ty::ty_rptr(_, ty::mt{ty: t_a, mutbl: mutbl_a}), &ty::ty_rptr(_, mt_b)) => {
- self.unpack_actual_value(t_a, |sty_a| {
- match self.unsize_ty(t_a, sty_a, mt_b.ty) {
+ self.unpack_actual_value(t_a, |a| {
+ match self.unsize_ty(t_a, a, mt_b.ty) {
Some((ty, kind)) => {
if !can_coerce_mutbls(mutbl_a, mt_b.mutbl) {
return Err(ty::terr_mutability);
})
}
(&ty::ty_rptr(_, ty::mt{ty: t_a, mutbl: mutbl_a}), &ty::ty_ptr(mt_b)) => {
- self.unpack_actual_value(t_a, |sty_a| {
- match self.unsize_ty(t_a, sty_a, mt_b.ty) {
+ self.unpack_actual_value(t_a, |a| {
+ match self.unsize_ty(t_a, a, mt_b.ty) {
Some((ty, kind)) => {
if !can_coerce_mutbls(mutbl_a, mt_b.mutbl) {
return Err(ty::terr_mutability);
})
}
(&ty::ty_uniq(t_a), &ty::ty_uniq(t_b)) => {
- self.unpack_actual_value(t_a, |sty_a| {
- match self.unsize_ty(t_a, sty_a, t_b) {
+ self.unpack_actual_value(t_a, |a| {
+ match self.unsize_ty(t_a, a, t_b) {
Some((ty, kind)) => {
let ty = ty::mk_uniq(self.get_ref().infcx.tcx, ty);
try!(self.get_ref().infcx.try(|_| sub.tys(ty, b)));
// E.g., `[T, ..n]` -> `([T], UnsizeLength(n))`
fn unsize_ty(&self,
ty_a: Ty<'tcx>,
- sty_a: &ty::sty<'tcx>,
+ a: Ty<'tcx>,
ty_b: Ty<'tcx>)
-> Option<(Ty<'tcx>, ty::UnsizeKind<'tcx>)> {
- debug!("unsize_ty(sty_a={}, ty_b={})", sty_a, ty_b.repr(self.get_ref().infcx.tcx));
+ debug!("unsize_ty(a={}, ty_b={})", a, ty_b.repr(self.get_ref().infcx.tcx));
let tcx = self.get_ref().infcx.tcx;
- self.unpack_actual_value(ty_b, |sty_b|
- match (sty_a, sty_b) {
+ self.unpack_actual_value(ty_b, |b|
+ match (&a.sty, &b.sty) {
(&ty::ty_vec(t_a, Some(len)), &ty::ty_vec(_, None)) => {
let ty = ty::mk_vec(tcx, t_a, None);
Some((ty, ty::UnsizeLength(len)))
fn coerce_borrowed_object(&self,
a: Ty<'tcx>,
- sty_a: &ty::sty<'tcx>,
b: Ty<'tcx>,
b_mutbl: ast::Mutability) -> CoerceResult<'tcx>
{
let tcx = self.get_ref().infcx.tcx;
- debug!("coerce_borrowed_object(a={}, sty_a={}, b={}, b_mutbl={})",
- a.repr(tcx), sty_a,
+ debug!("coerce_borrowed_object(a={}, b={}, b_mutbl={})",
+ a.repr(tcx),
b.repr(tcx), b_mutbl);
let coercion = Coercion(self.get_ref().trace.clone());
let r_a = self.get_ref().infcx.next_region_var(coercion);
- self.coerce_object(a, sty_a, b, b_mutbl,
+ self.coerce_object(a, b, b_mutbl,
|tr| ty::mk_rptr(tcx, r_a, ty::mt{ mutbl: b_mutbl, ty: tr }),
|| AutoPtr(r_a, b_mutbl, None))
}
fn coerce_unsafe_object(&self,
a: Ty<'tcx>,
- sty_a: &ty::sty<'tcx>,
b: Ty<'tcx>,
b_mutbl: ast::Mutability) -> CoerceResult<'tcx>
{
let tcx = self.get_ref().infcx.tcx;
- debug!("coerce_unsafe_object(a={}, sty_a={}, b={}, b_mutbl={})",
- a.repr(tcx), sty_a,
+ debug!("coerce_unsafe_object(a={}, b={}, b_mutbl={})",
+ a.repr(tcx),
b.repr(tcx), b_mutbl);
- self.coerce_object(a, sty_a, b, b_mutbl,
+ self.coerce_object(a, b, b_mutbl,
|tr| ty::mk_ptr(tcx, ty::mt{ mutbl: b_mutbl, ty: tr }),
|| AutoUnsafe(b_mutbl, None))
}
fn coerce_object<F, G>(&self,
a: Ty<'tcx>,
- sty_a: &ty::sty<'tcx>,
b: Ty<'tcx>,
b_mutbl: ast::Mutability,
mk_ty: F,
{
let tcx = self.get_ref().infcx.tcx;
- match *sty_a {
+ match a.sty {
ty::ty_rptr(_, ty::mt{ty, mutbl}) => match ty.sty {
ty::ty_trait(box ty::TyTrait { ref principal, bounds }) => {
debug!("mutbl={} b_mutbl={}", mutbl, b_mutbl);
pub fn coerce_borrowed_fn(&self,
a: Ty<'tcx>,
- sty_a: &ty::sty<'tcx>,
b: Ty<'tcx>)
-> CoerceResult<'tcx> {
- debug!("coerce_borrowed_fn(a={}, sty_a={}, b={})",
- a.repr(self.get_ref().infcx.tcx), sty_a,
+ debug!("coerce_borrowed_fn(a={}, b={})",
+ a.repr(self.get_ref().infcx.tcx),
b.repr(self.get_ref().infcx.tcx));
- match *sty_a {
+ match a.sty {
ty::ty_bare_fn(ref f) => {
self.coerce_from_bare_fn(a, f, b)
}
/// `proc`.
fn coerce_from_bare_fn(&self, a: Ty<'tcx>, fn_ty_a: &ty::BareFnTy<'tcx>, b: Ty<'tcx>)
-> CoerceResult<'tcx> {
- self.unpack_actual_value(b, |sty_b| {
+ self.unpack_actual_value(b, |b| {
debug!("coerce_from_bare_fn(a={}, b={})",
a.repr(self.get_ref().infcx.tcx), b.repr(self.get_ref().infcx.tcx));
return self.subtype(a, b);
}
- let fn_ty_b = match *sty_b {
+ let fn_ty_b = match b.sty {
ty::ty_closure(ref f) => (*f).clone(),
_ => return self.subtype(a, b)
};
pub fn coerce_unsafe_ptr(&self,
a: Ty<'tcx>,
- sty_a: &ty::sty<'tcx>,
b: Ty<'tcx>,
mutbl_b: ast::Mutability)
-> CoerceResult<'tcx> {
- debug!("coerce_unsafe_ptr(a={}, sty_a={}, b={})",
- a.repr(self.get_ref().infcx.tcx), sty_a,
+ debug!("coerce_unsafe_ptr(a={}, b={})",
+ a.repr(self.get_ref().infcx.tcx),
b.repr(self.get_ref().infcx.tcx));
- let mt_a = match *sty_a {
+ let mt_a = match a.sty {
ty::ty_rptr(_, mt) | ty::ty_ptr(mt) => mt,
_ => {
return self.subtype(a, b);
use middle::ty_fold;
use middle::ty_fold::TypeFoldable;
use middle::ty_fold::TypeFolder;
-use std::collections::hash_map;
+use std::collections::hash_map::{mod, Entry};
use super::InferCtxt;
use super::unify::InferCtxtMethodsForSimplyUnifiableTypes;
}
match self.freshen_map.entry(key) {
- hash_map::Occupied(entry) => *entry.get(),
- hash_map::Vacant(entry) => {
+ Entry::Occupied(entry) => *entry.get(),
+ Entry::Vacant(entry) => {
let index = self.freshen_count;
self.freshen_count += 1;
let t = ty::mk_infer(self.infcx.tcx, freshener(index));
use util::nodemap::{FnvHashMap, FnvHashSet};
use util::ppaux::Repr;
-use std::collections::hash_map::Vacant;
+use std::collections::hash_map::Entry::Vacant;
use std::io::{mod, File};
use std::os;
use std::sync::atomic;
impl Annotator {
// Determine the stability for a node based on its attributes and inherited
// stability. The stability is recorded in the index and used as the parent.
- fn annotate<F>(&mut self, id: NodeId, attrs: &Vec<Attribute>, f: F) where
+ fn annotate<F>(&mut self, id: NodeId, use_parent: bool,
+ attrs: &Vec<Attribute>, f: F) where
F: FnOnce(&mut Annotator),
{
match attr::find_stability(attrs.as_slice()) {
}
}
None => {
- self.parent.clone().map(|stab| self.index.local.insert(id, stab));
+ if use_parent {
+ self.parent.clone().map(|stab| self.index.local.insert(id, stab));
+ }
f(self);
}
}
impl<'v> Visitor<'v> for Annotator {
fn visit_item(&mut self, i: &Item) {
- self.annotate(i.id, &i.attrs, |v| visit::walk_item(v, i));
+ // FIXME (#18969): the following is a hack around the fact
+ // that we cannot currently annotate the stability of
+ // `deriving`. Basically, we do *not* allow stability
+ // inheritance on trait implementations, so that derived
+ // implementations appear to be unannotated. This then allows
+ // derived implementations to be automatically tagged with the
+ // stability of the trait. This is WRONG, but expedient to get
+ // libstd stabilized for the 1.0 release.
+ let use_parent = match i.node {
+ ast::ItemImpl(_, _, Some(_), _, _) => false,
+ _ => true,
+ };
+
+ self.annotate(i.id, use_parent, &i.attrs, |v| visit::walk_item(v, i));
if let ast::ItemStruct(ref sd, _) = i.node {
sd.ctor_id.map(|id| {
- self.annotate(id, &i.attrs, |_| {})
+ self.annotate(id, true, &i.attrs, |_| {})
});
}
}
_: &'v Block, _: Span, _: NodeId) {
if let FkMethod(_, _, meth) = fk {
// Methods are not already annotated, so we annotate it
- self.annotate(meth.id, &meth.attrs, |_| {});
+ self.annotate(meth.id, true, &meth.attrs, |_| {});
}
// Items defined in a function body have no reason to have
// a stability attribute, so we don't recurse.
TypeTraitItem(ref typedef) => (typedef.ty_param.id, &typedef.attrs),
};
- self.annotate(id, attrs, |v| visit::walk_trait_item(v, t));
+ self.annotate(id, true, attrs, |v| visit::walk_trait_item(v, t));
}
fn visit_variant(&mut self, var: &Variant, g: &'v Generics) {
- self.annotate(var.node.id, &var.node.attrs, |v| visit::walk_variant(v, var, g))
+ self.annotate(var.node.id, true, &var.node.attrs,
+ |v| visit::walk_variant(v, var, g))
}
fn visit_struct_field(&mut self, s: &StructField) {
- self.annotate(s.node.id, &s.node.attrs, |v| visit::walk_struct_field(v, s));
+ self.annotate(s.node.id, true, &s.node.attrs,
+ |v| visit::walk_struct_field(v, s));
+ }
+
+ fn visit_foreign_item(&mut self, i: &ast::ForeignItem) {
+ self.annotate(i.id, &i.attrs, |_| {});
}
}
},
parent: None
};
- annotator.annotate(ast::CRATE_NODE_ID, &krate.attrs, |v| visit::walk_crate(v, krate));
+ annotator.annotate(ast::CRATE_NODE_ID, true, &krate.attrs,
+ |v| visit::walk_crate(v, krate));
annotator.index
}
}
match ty::trait_item_of_item(tcx, id) {
Some(ty::MethodTraitItemId(trait_method_id))
if trait_method_id != id => {
- lookup(tcx, trait_method_id)
- }
- _ if is_local(id) => {
- tcx.stability.borrow().local.get(&id.node).cloned()
- }
- _ => {
- let stab = csearch::get_stability(&tcx.sess.cstore, id);
- let mut index = tcx.stability.borrow_mut();
- (*index).extern_cache.insert(id, stab.clone());
- stab
+ return lookup(tcx, trait_method_id)
}
+ _ => {}
}
+
+ let item_stab = if is_local(id) {
+ tcx.stability.borrow().local.get(&id.node).cloned()
+ } else {
+ let stab = csearch::get_stability(&tcx.sess.cstore, id);
+ let mut index = tcx.stability.borrow_mut();
+ (*index).extern_cache.insert(id, stab.clone());
+ stab
+ };
+
+ item_stab.or_else(|| {
+ if let Some(trait_id) = ty::trait_id_of_impl(tcx, id) {
+ // FIXME (#18969): for the time being, simply use the
+ // stability of the trait to determine the stability of any
+ // unmarked impls for it. See FIXME above for more details.
+
+ lookup(tcx, trait_id)
+ } else {
+ None
+ }
+ })
}
use middle::mem_categorization::Typer;
use middle::ty::{mod, Ty};
use std::collections::HashSet;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use std::default::Default;
use std::rc::Rc;
use syntax::ast;
use std::ops;
use std::rc::Rc;
use collections::enum_set::{EnumSet, CLike};
-use std::collections::hash_map::{HashMap, Occupied, Vacant};
+use std::collections::hash_map::HashMap;
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use syntax::abi;
use syntax::ast::{CrateNum, DefId, DUMMY_NODE_ID, Ident, ItemTrait, LOCAL_CRATE};
use syntax::ast::{MutImmutable, MutMutable, Name, NamedField, NodeId};
super_fold_trait_ref(self, t)
}
- fn fold_sty(&mut self, sty: &ty::sty<'tcx>) -> ty::sty<'tcx> {
- super_fold_sty(self, sty)
- }
-
fn fold_substs(&mut self,
substs: &subst::Substs<'tcx>)
-> subst::Substs<'tcx> {
}
}
-impl<'tcx> TypeFoldable<'tcx> for ty::sty<'tcx> {
- fn fold_with<F: TypeFolder<'tcx>>(&self, folder: &mut F) -> ty::sty<'tcx> {
- folder.fold_sty(self)
- }
-}
-
impl<'tcx> TypeFoldable<'tcx> for ty::TraitRef<'tcx> {
fn fold_with<F: TypeFolder<'tcx>>(&self, folder: &mut F) -> ty::TraitRef<'tcx> {
folder.fold_trait_ref(self)
// They should invoke `foo.fold_with()` to do recursive folding.
pub fn super_fold_ty<'tcx, T: TypeFolder<'tcx>>(this: &mut T,
- t: Ty<'tcx>)
+ ty: Ty<'tcx>)
-> Ty<'tcx> {
- let sty = t.sty.fold_with(this);
+ let sty = match ty.sty {
+ ty::ty_uniq(typ) => {
+ ty::ty_uniq(typ.fold_with(this))
+ }
+ ty::ty_ptr(ref tm) => {
+ ty::ty_ptr(tm.fold_with(this))
+ }
+ ty::ty_vec(typ, sz) => {
+ ty::ty_vec(typ.fold_with(this), sz)
+ }
+ ty::ty_open(typ) => {
+ ty::ty_open(typ.fold_with(this))
+ }
+ ty::ty_enum(tid, ref substs) => {
+ ty::ty_enum(tid, substs.fold_with(this))
+ }
+ ty::ty_trait(box ty::TyTrait { ref principal, bounds }) => {
+ ty::ty_trait(box ty::TyTrait {
+ principal: (*principal).fold_with(this),
+ bounds: bounds.fold_with(this),
+ })
+ }
+ ty::ty_tup(ref ts) => {
+ ty::ty_tup(ts.fold_with(this))
+ }
+ ty::ty_bare_fn(ref f) => {
+ ty::ty_bare_fn(f.fold_with(this))
+ }
+ ty::ty_closure(ref f) => {
+ ty::ty_closure(box f.fold_with(this))
+ }
+ ty::ty_rptr(r, ref tm) => {
+ ty::ty_rptr(r.fold_with(this), tm.fold_with(this))
+ }
+ ty::ty_struct(did, ref substs) => {
+ ty::ty_struct(did, substs.fold_with(this))
+ }
+ ty::ty_unboxed_closure(did, ref region, ref substs) => {
+ ty::ty_unboxed_closure(did, region.fold_with(this), substs.fold_with(this))
+ }
+ ty::ty_bool | ty::ty_char | ty::ty_str |
+ ty::ty_int(_) | ty::ty_uint(_) | ty::ty_float(_) |
+ ty::ty_err | ty::ty_infer(_) |
+ ty::ty_param(..) => {
+ ty.sty.clone()
+ }
+ };
ty::mk_t(this.tcx(), sty)
}
mutbl: mt.mutbl}
}
-pub fn super_fold_sty<'tcx, T: TypeFolder<'tcx>>(this: &mut T,
- sty: &ty::sty<'tcx>)
- -> ty::sty<'tcx> {
- match *sty {
- ty::ty_uniq(typ) => {
- ty::ty_uniq(typ.fold_with(this))
- }
- ty::ty_ptr(ref tm) => {
- ty::ty_ptr(tm.fold_with(this))
- }
- ty::ty_vec(typ, sz) => {
- ty::ty_vec(typ.fold_with(this), sz)
- }
- ty::ty_open(typ) => {
- ty::ty_open(typ.fold_with(this))
- }
- ty::ty_enum(tid, ref substs) => {
- ty::ty_enum(tid, substs.fold_with(this))
- }
- ty::ty_trait(box ty::TyTrait { ref principal, bounds }) => {
- ty::ty_trait(box ty::TyTrait {
- principal: (*principal).fold_with(this),
- bounds: bounds.fold_with(this),
- })
- }
- ty::ty_tup(ref ts) => {
- ty::ty_tup(ts.fold_with(this))
- }
- ty::ty_bare_fn(ref f) => {
- ty::ty_bare_fn(f.fold_with(this))
- }
- ty::ty_closure(ref f) => {
- ty::ty_closure(box f.fold_with(this))
- }
- ty::ty_rptr(r, ref tm) => {
- ty::ty_rptr(r.fold_with(this), tm.fold_with(this))
- }
- ty::ty_struct(did, ref substs) => {
- ty::ty_struct(did, substs.fold_with(this))
- }
- ty::ty_unboxed_closure(did, ref region, ref substs) => {
- ty::ty_unboxed_closure(did, region.fold_with(this), substs.fold_with(this))
- }
- ty::ty_bool | ty::ty_char | ty::ty_str |
- ty::ty_int(_) | ty::ty_uint(_) | ty::ty_float(_) |
- ty::ty_err | ty::ty_infer(_) |
- ty::ty_param(..) => {
- (*sty).clone()
- }
- }
-}
-
pub fn super_fold_trait_store<'tcx, T: TypeFolder<'tcx>>(this: &mut T,
trait_store: ty::TraitStore)
-> ty::TraitStore {
use syntax::parse::token::InternedString;
use std::collections::HashMap;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use getopts::{optopt, optmulti, optflag, optflagopt};
use getopts;
use std::cell::{RefCell};
ast::ExprMethodCall(..) => {
explain_span(cx, "method call", expr.span)
},
- ast::ExprMatch(_, _, ast::MatchIfLetDesugar) => explain_span(cx, "if let", expr.span),
- ast::ExprMatch(_, _, ast::MatchWhileLetDesugar) => {
+ ast::ExprMatch(_, _, ast::MatchSource::IfLetDesugar { .. }) =>
+ explain_span(cx, "if let", expr.span),
+ ast::ExprMatch(_, _, ast::MatchSource::WhileLetDesugar) => {
explain_span(cx, "while let", expr.span)
},
ast::ExprMatch(..) => explain_span(cx, "match", expr.span),
ty_vec(t, sz) => {
let inner_str = ty_to_string(cx, t);
match sz {
- Some(n) => format!("[{}, ..{}]", inner_str, n),
+ Some(n) => format!("[{}; {}]", inner_str, n),
None => format!("[{}]", inner_str),
}
}
if cx.lang_items.fn_trait_kind(did).is_some() {
format!("{}({}){}",
base,
- strs[0][1 .. strs[0].len() - (strs[0].ends_with(",)") as uint+1)],
+ if strs[0].starts_with("(") && strs[0].ends_with(",)") {
+ strs[0][1 .. strs[0].len() - 2] // Remove '(' and ',)'
+ } else {
+ strs[0][]
+ },
if &*strs[1] == "()" { String::new() } else { format!(" -> {}", strs[1]) })
} else if strs.len() > 0 {
format!("{}<{}>", base, strs.connect(", "))
/// The diagnostic emitter yielded to the procedure should be used for reporting
/// errors of the compiler.
pub fn monitor<F:FnOnce()+Send>(f: F) {
- static STACK_SIZE: uint = 32000000; // 32MB
+ static STACK_SIZE: uint = 8 * 1024 * 1024; // 8MB
let (tx, rx) = channel();
let w = io::ChanWriter::new(tx);
use syntax::visit::{mod, Visitor};
use std::collections::{HashMap, HashSet};
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use std::cell::{Cell, RefCell};
use std::mem::replace;
use std::rc::{Rc, Weak};
use llvm;
use metadata::{csearch, encoder, loader};
use middle::astencode;
+use middle::cfg;
use middle::lang_items::{LangItem, ExchangeMallocFnLangItem, StartFnLangItem};
use middle::subst;
use middle::weak_lang_items;
}
}
-struct CheckForNestedReturnsVisitor {
+struct FindNestedReturn {
found: bool,
- in_return: bool
}
-impl CheckForNestedReturnsVisitor {
- fn explicit() -> CheckForNestedReturnsVisitor {
- CheckForNestedReturnsVisitor { found: false, in_return: false }
- }
- fn implicit() -> CheckForNestedReturnsVisitor {
- CheckForNestedReturnsVisitor { found: false, in_return: true }
+impl FindNestedReturn {
+ fn new() -> FindNestedReturn {
+ FindNestedReturn { found: false }
}
}
-impl<'v> Visitor<'v> for CheckForNestedReturnsVisitor {
+impl<'v> Visitor<'v> for FindNestedReturn {
fn visit_expr(&mut self, e: &ast::Expr) {
match e.node {
ast::ExprRet(..) => {
- if self.in_return {
- self.found = true;
- } else {
- self.in_return = true;
- visit::walk_expr(self, e);
- self.in_return = false;
- }
+ self.found = true;
}
_ => visit::walk_expr(self, e)
}
}
}
-fn has_nested_returns(tcx: &ty::ctxt, id: ast::NodeId) -> bool {
- match tcx.map.find(id) {
+fn build_cfg(tcx: &ty::ctxt, id: ast::NodeId) -> (ast::NodeId, Option<cfg::CFG>) {
+ let blk = match tcx.map.find(id) {
Some(ast_map::NodeItem(i)) => {
match i.node {
ast::ItemFn(_, _, _, _, ref blk) => {
- let mut explicit = CheckForNestedReturnsVisitor::explicit();
- let mut implicit = CheckForNestedReturnsVisitor::implicit();
- visit::walk_item(&mut explicit, &*i);
- visit::walk_expr_opt(&mut implicit, &blk.expr);
- explicit.found || implicit.found
+ blk
}
_ => tcx.sess.bug("unexpected item variant in has_nested_returns")
}
ast::ProvidedMethod(ref m) => {
match m.node {
ast::MethDecl(_, _, _, _, _, _, ref blk, _) => {
- let mut explicit = CheckForNestedReturnsVisitor::explicit();
- let mut implicit = CheckForNestedReturnsVisitor::implicit();
- visit::walk_method_helper(&mut explicit, &**m);
- visit::walk_expr_opt(&mut implicit, &blk.expr);
- explicit.found || implicit.found
+ blk
}
ast::MethMac(_) => tcx.sess.bug("unexpanded macro")
}
ast::MethodImplItem(ref m) => {
match m.node {
ast::MethDecl(_, _, _, _, _, _, ref blk, _) => {
- let mut explicit = CheckForNestedReturnsVisitor::explicit();
- let mut implicit = CheckForNestedReturnsVisitor::implicit();
- visit::walk_method_helper(&mut explicit, &**m);
- visit::walk_expr_opt(&mut implicit, &blk.expr);
- explicit.found || implicit.found
+ blk
}
ast::MethMac(_) => tcx.sess.bug("unexpanded macro")
}
Some(ast_map::NodeExpr(e)) => {
match e.node {
ast::ExprClosure(_, _, _, ref blk) => {
- let mut explicit = CheckForNestedReturnsVisitor::explicit();
- let mut implicit = CheckForNestedReturnsVisitor::implicit();
- visit::walk_expr(&mut explicit, e);
- visit::walk_expr_opt(&mut implicit, &blk.expr);
- explicit.found || implicit.found
+ blk
}
_ => tcx.sess.bug("unexpected expr variant in has_nested_returns")
}
}
-
- Some(ast_map::NodeVariant(..)) | Some(ast_map::NodeStructCtor(..)) => false,
+ Some(ast_map::NodeVariant(..)) |
+ Some(ast_map::NodeStructCtor(..)) => return (ast::DUMMY_NODE_ID, None),
// glue, shims, etc
- None if id == ast::DUMMY_NODE_ID => false,
+ None if id == ast::DUMMY_NODE_ID => return (ast::DUMMY_NODE_ID, None),
_ => tcx.sess.bug(format!("unexpected variant in has_nested_returns: {}",
tcx.map.path_to_string(id)).as_slice())
+ };
+
+ (blk.id, Some(cfg::CFG::new(tcx, &**blk)))
+}
+
+// Checks for the presence of "nested returns" in a function.
+// Nested returns are when the inner expression of a return expression
+// (the 'expr' in 'return expr') contains a return expression. Only cases
+// where the outer return is actually reachable are considered. Implicit
+// returns from the end of blocks are considered as well.
+//
+// This check is needed to handle the case where the inner expression is
+// part of a larger expression that may have already partially-filled the
+// return slot alloca. This can cause errors related to clean-up due to
+// the clobbering of the existing value in the return slot.
+fn has_nested_returns(tcx: &ty::ctxt, cfg: &cfg::CFG, blk_id: ast::NodeId) -> bool {
+ for n in cfg.graph.depth_traverse(cfg.entry) {
+ match tcx.map.find(n.id) {
+ Some(ast_map::NodeExpr(ex)) => {
+ if let ast::ExprRet(Some(ref ret_expr)) = ex.node {
+ let mut visitor = FindNestedReturn::new();
+ visit::walk_expr(&mut visitor, &**ret_expr);
+ if visitor.found {
+ return true;
+ }
+ }
+ }
+ Some(ast_map::NodeBlock(blk)) if blk.id == blk_id => {
+ let mut visitor = FindNestedReturn::new();
+ visit::walk_expr_opt(&mut visitor, &blk.expr);
+ if visitor.found {
+ return true;
+ }
+ }
+ _ => {}
+ }
}
+
+ return false;
}
// NB: must keep 4 fns in sync:
ty::FnDiverging => false
};
let debug_context = debuginfo::create_function_debug_context(ccx, id, param_substs, llfndecl);
- let nested_returns = has_nested_returns(ccx.tcx(), id);
+ let (blk_id, cfg) = build_cfg(ccx.tcx(), id);
+ let nested_returns = if let Some(ref cfg) = cfg {
+ has_nested_returns(ccx.tcx(), cfg, blk_id)
+ } else {
+ false
+ };
let mut fcx = FunctionContext {
llfn: llfndecl,
block_arena: block_arena,
ccx: ccx,
debug_context: debug_context,
- scopes: RefCell::new(Vec::new())
+ scopes: RefCell::new(Vec::new()),
+ cfg: cfg
};
if has_env {
use llvm;
use llvm::{ValueRef, BasicBlockRef, BuilderRef, ContextRef};
use llvm::{True, False, Bool};
+use middle::cfg;
use middle::def;
use middle::infer;
use middle::lang_items::LangItem;
// Cleanup scopes.
pub scopes: RefCell<Vec<cleanup::CleanupScope<'a, 'tcx>>>,
+
+ pub cfg: Option<cfg::CFG>,
}
impl<'a, 'tcx> FunctionContext<'a, 'tcx> {
if dest != expr::Ignore {
let block_ty = node_id_type(bcx, b.id);
+
if b.expr.is_none() || type_is_zero_size(bcx.ccx(), block_ty) {
dest = expr::Ignore;
+ } else if b.expr.is_some() {
+ // If the block has an expression, but that expression isn't reachable,
+ // don't save into the destination given, ignore it.
+ if let Some(ref cfg) = bcx.fcx.cfg {
+ if !cfg.node_is_reachable(b.expr.as_ref().unwrap().id) {
+ dest = expr::Ignore;
+ }
+ }
}
}
debug!("iterator type is {}, datum type is {}",
ppaux::ty_to_string(bcx.tcx(), iterator_type),
ppaux::ty_to_string(bcx.tcx(), iterator_datum.ty));
+
let lliterator = load_ty(bcx, iterator_datum.val, iterator_datum.ty);
// Create our basic blocks and set up our loop cleanups.
llpayload,
binding_cleanup_scope_id);
+ debuginfo::create_for_loop_var_metadata(body_bcx_in, pat);
+
// Codegen the body.
body_bcx_out = trans_block(body_bcx_out, body, expr::Ignore);
body_bcx_out =
//! comparatively expensive to construct, though, `ty::type_id()` is still used
//! additionally as an optimization for cases where the exact same type has been
//! seen before (which is most of the time).
-use self::FunctionDebugContextRepr::*;
use self::VariableAccess::*;
use self::VariableKind::*;
use self::MemberOffset::*;
// mut ptr (*mut) -> {*mut :pointee-uid:}
// unique ptr (~) -> {~ :pointee-uid:}
// @-ptr (@) -> {@ :pointee-uid:}
- // sized vec ([T, ..x]) -> {[:size:] :element-uid:}
+ // sized vec ([T; x]) -> {[:size:] :element-uid:}
// unsized vec ([T]) -> {[] :element-uid:}
// trait (T) -> {trait_:svh: / :node-id:_<(:param-uid:),*> }
// closure -> {<unsafe_> <once_> :store-sigil: |(:param-uid:),* <,_...>| -> \
}
}
-pub struct FunctionDebugContext {
- repr: FunctionDebugContextRepr,
-}
-
-enum FunctionDebugContextRepr {
- DebugInfo(Box<FunctionDebugContextData>),
+pub enum FunctionDebugContext {
+ RegularContext(Box<FunctionDebugContextData>),
DebugInfoDisabled,
FunctionWithoutDebugInfo,
}
cx: &CrateContext,
span: Span)
-> &'a FunctionDebugContextData {
- match self.repr {
- DebugInfo(box ref data) => data,
- DebugInfoDisabled => {
+ match *self {
+ FunctionDebugContext::RegularContext(box ref data) => data,
+ FunctionDebugContext::DebugInfoDisabled => {
cx.sess().span_bug(span,
FunctionDebugContext::debuginfo_disabled_message());
}
- FunctionWithoutDebugInfo => {
+ FunctionDebugContext::FunctionWithoutDebugInfo => {
cx.sess().span_bug(span,
FunctionDebugContext::should_be_ignored_message());
}
/// Creates debug information for the given local variable.
///
+/// This function assumes that there's a datum for each pattern component of the
+/// local in `bcx.fcx.lllocals`.
/// Adds the created metadata nodes directly to the crate's IR.
pub fn create_local_var_metadata(bcx: Block, local: &ast::Local) {
if fn_should_be_ignored(bcx.fcx) {
let cx = bcx.ccx();
let def_map = &cx.tcx().def_map;
+ let locals = bcx.fcx.lllocals.borrow();
- pat_util::pat_bindings(def_map, &*local.pat, |_, node_id, span, path1| {
- let var_ident = path1.node;
-
- let datum = match bcx.fcx.lllocals.borrow().get(&node_id).cloned() {
+ pat_util::pat_bindings(def_map, &*local.pat, |_, node_id, span, var_ident| {
+ let datum = match locals.get(&node_id) {
Some(datum) => datum,
None => {
bcx.sess().span_bug(span,
}
};
+ if unsafe { llvm::LLVMIsAAllocaInst(datum.val) } == ptr::null_mut() {
+ cx.sess().span_bug(span, "debuginfo::create_local_var_metadata() - \
+ Referenced variable location is not an alloca!");
+ }
+
let scope_metadata = scope_metadata(bcx.fcx, node_id, span);
declare_local(bcx,
- var_ident,
+ var_ident.node,
datum.ty,
scope_metadata,
DirectVariable { alloca: datum.val },
// for the binding. For ByRef bindings that's a `T*` but for ByMove bindings we
// actually have `T**`. So to get the actual variable we need to dereference once
// more. For ByCopy we just use the stack slot we created for the binding.
- let var_type = match binding.trmode {
+ let var_access = match binding.trmode {
TrByCopy(llbinding) => DirectVariable {
alloca: llbinding
},
variable_ident,
binding.ty,
scope_metadata,
- var_type,
+ var_access,
LocalVariable,
binding.span);
}
/// Creates debug information for the given function argument.
///
+/// This function assumes that there's a datum for each pattern component of the
+/// argument in `bcx.fcx.lllocals`.
/// Adds the created metadata nodes directly to the crate's IR.
pub fn create_argument_metadata(bcx: Block, arg: &ast::Arg) {
if fn_should_be_ignored(bcx.fcx) {
return;
}
- let fcx = bcx.fcx;
- let cx = fcx.ccx;
+ let def_map = &bcx.tcx().def_map;
+ let scope_metadata = bcx
+ .fcx
+ .debug_context
+ .get_ref(bcx.ccx(), arg.pat.span)
+ .fn_metadata;
+ let locals = bcx.fcx.lllocals.borrow();
- let def_map = &cx.tcx().def_map;
- let scope_metadata = bcx.fcx.debug_context.get_ref(cx, arg.pat.span).fn_metadata;
-
- pat_util::pat_bindings(def_map, &*arg.pat, |_, node_id, span, path1| {
- let llarg = match bcx.fcx.lllocals.borrow().get(&node_id).cloned() {
+ pat_util::pat_bindings(def_map, &*arg.pat, |_, node_id, span, var_ident| {
+ let datum = match locals.get(&node_id) {
Some(v) => v,
None => {
bcx.sess().span_bug(span,
}
};
- if unsafe { llvm::LLVMIsAAllocaInst(llarg.val) } == ptr::null_mut() {
- cx.sess().span_bug(span, "debuginfo::create_argument_metadata() - \
- Referenced variable location is not an alloca!");
+ if unsafe { llvm::LLVMIsAAllocaInst(datum.val) } == ptr::null_mut() {
+ bcx.sess().span_bug(span, "debuginfo::create_argument_metadata() - \
+ Referenced variable location is not an alloca!");
}
let argument_index = {
- let counter = &fcx.debug_context.get_ref(cx, span).argument_counter;
+ let counter = &bcx
+ .fcx
+ .debug_context
+ .get_ref(bcx.ccx(), span)
+ .argument_counter;
let argument_index = counter.get();
counter.set(argument_index + 1);
argument_index
};
declare_local(bcx,
- path1.node,
- llarg.ty,
+ var_ident.node,
+ datum.ty,
scope_metadata,
- DirectVariable { alloca: llarg.val },
+ DirectVariable { alloca: datum.val },
ArgumentVariable(argument_index),
span);
})
}
+/// Creates debug information for the given for-loop variable.
+///
+/// This function assumes that there's a datum for each pattern component of the
+/// loop variable in `bcx.fcx.lllocals`.
+/// Adds the created metadata nodes directly to the crate's IR.
+pub fn create_for_loop_var_metadata(bcx: Block, pat: &ast::Pat) {
+ if fn_should_be_ignored(bcx.fcx) {
+ return;
+ }
+
+ let def_map = &bcx.tcx().def_map;
+ let locals = bcx.fcx.lllocals.borrow();
+
+ pat_util::pat_bindings(def_map, pat, |_, node_id, span, var_ident| {
+ let datum = match locals.get(&node_id) {
+ Some(datum) => datum,
+ None => {
+ bcx.sess().span_bug(span,
+ format!("no entry in lllocals table for {}",
+ node_id).as_slice());
+ }
+ };
+
+ if unsafe { llvm::LLVMIsAAllocaInst(datum.val) } == ptr::null_mut() {
+ bcx.sess().span_bug(span, "debuginfo::create_for_loop_var_metadata() - \
+ Referenced variable location is not an alloca!");
+ }
+
+ let scope_metadata = scope_metadata(bcx.fcx, node_id, span);
+
+ declare_local(bcx,
+ var_ident.node,
+ datum.ty,
+ scope_metadata,
+ DirectVariable { alloca: datum.val },
+ LocalVariable,
+ span);
+ })
+}
+
pub fn get_cleanup_debug_loc_for_ast_node<'a, 'tcx>(cx: &CrateContext<'a, 'tcx>,
node_id: ast::NodeId,
node_span: Span,
pub fn set_source_location(fcx: &FunctionContext,
node_id: ast::NodeId,
span: Span) {
- match fcx.debug_context.repr {
- DebugInfoDisabled => return,
- FunctionWithoutDebugInfo => {
+ match fcx.debug_context {
+ FunctionDebugContext::DebugInfoDisabled => return,
+ FunctionDebugContext::FunctionWithoutDebugInfo => {
set_debug_location(fcx.ccx, UnknownLocation);
return;
}
- DebugInfo(box ref function_debug_context) => {
+ FunctionDebugContext::RegularContext(box ref function_debug_context) => {
let cx = fcx.ccx;
debug!("set_source_location: {}", cx.sess().codemap().span_to_string(span));
/// switches source location emitting on and must therefore be called before the
/// first real statement/expression of the function is translated.
pub fn start_emitting_source_locations(fcx: &FunctionContext) {
- match fcx.debug_context.repr {
- DebugInfo(box ref data) => {
+ match fcx.debug_context {
+ FunctionDebugContext::RegularContext(box ref data) => {
data.source_locations_enabled.set(true)
},
_ => { /* safe to ignore */ }
param_substs: &Substs<'tcx>,
llfn: ValueRef) -> FunctionDebugContext {
if cx.sess().opts.debuginfo == NoDebugInfo {
- return FunctionDebugContext { repr: DebugInfoDisabled };
+ return FunctionDebugContext::DebugInfoDisabled;
}
// Clear the debug location so we don't assign them in the function prelude.
if fn_ast_id == ast::DUMMY_NODE_ID {
// This is a function not linked to any source location, so don't
// generate debuginfo for it.
- return FunctionDebugContext { repr: FunctionWithoutDebugInfo };
+ return FunctionDebugContext::FunctionWithoutDebugInfo;
}
let empty_generics = ast_util::empty_generics();
let (ident, fn_decl, generics, top_level_block, span, has_path) = match fnitem {
ast_map::NodeItem(ref item) => {
if contains_nodebug_attribute(item.attrs.as_slice()) {
- return FunctionDebugContext { repr: FunctionWithoutDebugInfo };
+ return FunctionDebugContext::FunctionWithoutDebugInfo;
}
match item.node {
match **item {
ast::MethodImplItem(ref method) => {
if contains_nodebug_attribute(method.attrs.as_slice()) {
- return FunctionDebugContext {
- repr: FunctionWithoutDebugInfo
- };
+ return FunctionDebugContext::FunctionWithoutDebugInfo;
}
(method.pe_ident(),
match **trait_method {
ast::ProvidedMethod(ref method) => {
if contains_nodebug_attribute(method.attrs.as_slice()) {
- return FunctionDebugContext {
- repr: FunctionWithoutDebugInfo
- };
+ return FunctionDebugContext::FunctionWithoutDebugInfo;
}
(method.pe_ident(),
ast_map::NodeForeignItem(..) |
ast_map::NodeVariant(..) |
ast_map::NodeStructCtor(..) => {
- return FunctionDebugContext { repr: FunctionWithoutDebugInfo };
+ return FunctionDebugContext::FunctionWithoutDebugInfo;
}
_ => cx.sess().bug(format!("create_function_debug_context: \
unexpected sort of node: {}",
// This can be the case for functions inlined from another crate
if span == codemap::DUMMY_SP {
- return FunctionDebugContext { repr: FunctionWithoutDebugInfo };
+ return FunctionDebugContext::FunctionWithoutDebugInfo;
}
let loc = span_start(cx, span);
})
});
+ let scope_map = create_scope_map(cx,
+ fn_decl.inputs.as_slice(),
+ &*top_level_block,
+ fn_metadata,
+ fn_ast_id);
+
// Initialize fn debug context (including scope map and namespace map)
let fn_debug_context = box FunctionDebugContextData {
- scope_map: RefCell::new(NodeMap::new()),
+ scope_map: RefCell::new(scope_map),
fn_metadata: fn_metadata,
argument_counter: Cell::new(1),
source_locations_enabled: Cell::new(false),
};
- populate_scope_map(cx,
- fn_decl.inputs.as_slice(),
- &*top_level_block,
- fn_metadata,
- fn_ast_id,
- &mut *fn_debug_context.scope_map.borrow_mut());
- return FunctionDebugContext { repr: DebugInfo(fn_debug_context) };
+
+ return FunctionDebugContext::RegularContext(fn_debug_context);
fn get_function_signature<'a, 'tcx>(cx: &CrateContext<'a, 'tcx>,
fn_ast_id: ast::NodeId,
}
fn fn_should_be_ignored(fcx: &FunctionContext) -> bool {
- match fcx.debug_context.repr {
- DebugInfo(_) => false,
+ match fcx.debug_context {
+ FunctionDebugContext::RegularContext(_) => false,
_ => true
}
}
// what belongs to which scope, creating DIScope DIEs along the way, and
// introducing *artificial* lexical scope descriptors where necessary. These
// artificial scopes allow GDB to correctly handle name shadowing.
-fn populate_scope_map(cx: &CrateContext,
- args: &[ast::Arg],
- fn_entry_block: &ast::Block,
- fn_metadata: DISubprogram,
- fn_ast_id: ast::NodeId,
- scope_map: &mut NodeMap<DIScope>) {
+fn create_scope_map(cx: &CrateContext,
+ args: &[ast::Arg],
+ fn_entry_block: &ast::Block,
+ fn_metadata: DISubprogram,
+ fn_ast_id: ast::NodeId)
+ -> NodeMap<DIScope> {
+ let mut scope_map = NodeMap::new();
+
let def_map = &cx.tcx().def_map;
struct ScopeStackEntry {
with_new_scope(cx,
fn_entry_block.span,
&mut scope_stack,
- scope_map,
+ &mut scope_map,
|cx, scope_stack, scope_map| {
walk_block(cx, fn_entry_block, scope_stack, scope_map);
});
+ return scope_map;
+
+
// local helper functions for walking the AST.
fn with_new_scope<F>(cx: &CrateContext,
scope_span: Span,
}
ast::PatMac(_) => {
- cx.sess().span_bug(pat.span, "debuginfo::populate_scope_map() - \
+ cx.sess().span_bug(pat.span, "debuginfo::create_scope_map() - \
Found unexpanded macro.");
}
}
}
ast::ExprIfLet(..) => {
- cx.sess().span_bug(exp.span, "debuginfo::populate_scope_map() - \
+ cx.sess().span_bug(exp.span, "debuginfo::create_scope_map() - \
Found unexpanded if-let.");
}
}
ast::ExprWhileLet(..) => {
- cx.sess().span_bug(exp.span, "debuginfo::populate_scope_map() - \
+ cx.sess().span_bug(exp.span, "debuginfo::create_scope_map() - \
Found unexpanded while-let.");
}
}
ast::ExprMac(_) => {
- cx.sess().span_bug(exp.span, "debuginfo::populate_scope_map() - \
+ cx.sess().span_bug(exp.span, "debuginfo::create_scope_map() - \
Found unexpanded macro.");
}
match optional_length {
Some(len) => {
- output.push_str(format!(", ..{}", len).as_slice());
+ output.push_str(format!("; {}", len).as_slice());
}
None => { /* nothing to do */ }
};
controlflow::trans_cont(bcx, expr.id, label_opt)
}
ast::ExprRet(ref ex) => {
- controlflow::trans_ret(bcx, ex.as_ref().map(|e| &**e))
+ // Check to see if the return expression itself is reachable.
+ // This can occur when the inner expression contains a return
+ let reachable = if let Some(ref cfg) = bcx.fcx.cfg {
+ cfg.node_is_reachable(expr.id)
+ } else {
+ true
+ };
+
+ if reachable {
+ controlflow::trans_ret(bcx, ex.as_ref().map(|e| &**e))
+ } else {
+ // If it's not reachable, just translate the inner expression
+ // directly. This avoids having to manage a return slot when
+ // it won't actually be used anyway.
+ if let &Some(ref x) = ex {
+ bcx = trans_into(bcx, &**x, Ignore);
+ }
+ // Mark the end of the block as unreachable. Once we get to
+ // a return expression, there's no more we should be doing
+ // after this.
+ Unreachable(bcx);
+ bcx
+ }
}
ast::ExprWhile(ref cond, ref body, _) => {
controlflow::trans_while(bcx, expr.id, &**cond, &**body)
use util::ppaux::Repr;
use std::cmp;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use syntax::ast;
use syntax::ast_util;
use syntax::codemap::{Span, Spanned};
expr: &ast::Expr,
discrim: &ast::Expr,
arms: &[ast::Arm],
- expected: Expectation<'tcx>) {
+ expected: Expectation<'tcx>,
+ match_src: ast::MatchSource) {
let tcx = fcx.ccx.tcx;
let discrim_ty = fcx.infcx().next_ty_var();
if ty::type_is_error(result_ty) || ty::type_is_error(bty) {
ty::mk_err()
} else {
+ let (origin, expected, found) = match match_src {
+ /* if-let construct without an else block */
+ ast::MatchSource::IfLetDesugar { contains_else_clause }
+ if !contains_else_clause => (
+ infer::IfExpressionWithNoElse(expr.span),
+ bty,
+ result_ty,
+ ),
+ _ => (
+ infer::MatchExpressionArm(expr.span, arm.body.span),
+ result_ty,
+ bty,
+ ),
+ };
+
infer::common_supertype(
fcx.infcx(),
- infer::MatchExpressionArm(expr.span, arm.body.span),
- true, // result_ty is "expected" here
- result_ty,
- bty
+ origin,
+ true,
+ expected,
+ found,
)
}
});
// Find the expected input/output types (if any). Substitute
// fresh bound regions for any bound regions we find in the
// expected types so as to avoid capture.
- let expected_sty = expected.map_to_option(fcx, |x| Some((*x).clone()));
- let (expected_sig,
- expected_onceness,
- expected_bounds) = {
- match expected_sty {
- Some(ty::ty_closure(ref cenv)) => {
- let (sig, _) =
- ty::replace_late_bound_regions(
- tcx,
- &cenv.sig,
- |_, debruijn| fcx.inh.infcx.fresh_bound_region(debruijn));
- let onceness = match (&store, &cenv.store) {
- // As the closure type and onceness go, only three
- // combinations are legit:
- // once closure
- // many closure
- // once proc
- // If the actual and expected closure type disagree with
- // each other, set expected onceness to be always Once or
- // Many according to the actual type. Otherwise, it will
- // yield either an illegal "many proc" or a less known
- // "once closure" in the error message.
- (&ty::UniqTraitStore, &ty::UniqTraitStore) |
- (&ty::RegionTraitStore(..), &ty::RegionTraitStore(..)) =>
- cenv.onceness,
- (&ty::UniqTraitStore, _) => ast::Once,
- (&ty::RegionTraitStore(..), _) => ast::Many,
- };
- (Some(sig), onceness, cenv.bounds)
- }
- _ => {
- // Not an error! Means we're inferring the closure type
- let region = fcx.infcx().next_region_var(
- infer::AddrOfRegion(expr.span));
- let bounds = ty::region_existential_bound(region);
- let onceness = ast::Many;
- (None, onceness, bounds)
- }
+ let expected_cenv = expected.map_to_option(fcx, |ty| match ty.sty {
+ ty::ty_closure(ref cenv) => Some(cenv),
+ _ => None
+ });
+ let (expected_sig, expected_onceness, expected_bounds) = match expected_cenv {
+ Some(cenv) => {
+ let (sig, _) =
+ ty::replace_late_bound_regions(
+ tcx,
+ &cenv.sig,
+ |_, debruijn| fcx.inh.infcx.fresh_bound_region(debruijn));
+ let onceness = match (&store, &cenv.store) {
+ // As the closure type and onceness go, only three
+ // combinations are legit:
+ // once closure
+ // many closure
+ // once proc
+ // If the actual and expected closure type disagree with
+ // each other, set expected onceness to be always Once or
+ // Many according to the actual type. Otherwise, it will
+ // yield either an illegal "many proc" or a less known
+ // "once closure" in the error message.
+ (&ty::UniqTraitStore, &ty::UniqTraitStore) |
+ (&ty::RegionTraitStore(..), &ty::RegionTraitStore(..)) =>
+ cenv.onceness,
+ (&ty::UniqTraitStore, _) => ast::Once,
+ (&ty::RegionTraitStore(..), _) => ast::Many,
+ };
+ (Some(sig), onceness, cenv.bounds)
+ }
+ _ => {
+ // Not an error! Means we're inferring the closure type
+ let region = fcx.infcx().next_region_var(
+ infer::AddrOfRegion(expr.span));
+ let bounds = ty::region_existential_bound(region);
+ let onceness = ast::Many;
+ (None, onceness, bounds)
}
};
-> bool {
// Bail out if the callee is a bare function or a closure. We check those
// manually.
- match *structure_of(fcx, callee.span, callee_type) {
+ match structurally_resolved_type(fcx, callee.span, callee_type).sty {
ty::ty_bare_fn(_) | ty::ty_closure(_) => return false,
_ => {}
}
ast::LitInt(_, ast::SignedIntLit(t, _)) => ty::mk_mach_int(t),
ast::LitInt(_, ast::UnsignedIntLit(t)) => ty::mk_mach_uint(t),
ast::LitInt(_, ast::UnsuffixedIntLit(_)) => {
- let opt_ty = expected.map_to_option(fcx, |sty| {
- match *sty {
- ty::ty_int(i) => Some(ty::mk_mach_int(i)),
- ty::ty_uint(i) => Some(ty::mk_mach_uint(i)),
+ let opt_ty = expected.map_to_option(fcx, |ty| {
+ match ty.sty {
+ ty::ty_int(_) | ty::ty_uint(_) => Some(ty),
ty::ty_char => Some(ty::mk_mach_uint(ast::TyU8)),
ty::ty_ptr(..) => Some(ty::mk_mach_uint(ast::TyU)),
ty::ty_bare_fn(..) => Some(ty::mk_mach_uint(ast::TyU)),
}
ast::LitFloat(_, t) => ty::mk_mach_float(t),
ast::LitFloatUnsuffixed(_) => {
- let opt_ty = expected.map_to_option(fcx, |sty| {
- match *sty {
- ty::ty_float(i) => Some(ty::mk_mach_float(i)),
+ let opt_ty = expected.map_to_option(fcx, |ty| {
+ match ty.sty {
+ ty::ty_float(_) => Some(ty),
_ => None
}
});
let fn_ty = fcx.expr_ty(f);
// Extract the function signature from `in_fty`.
- let fn_sty = structure_of(fcx, f.span, fn_ty);
+ let fn_ty = structurally_resolved_type(fcx, f.span, fn_ty);
// This is the "default" function signature, used in case of error.
// In that case, we check each argument against "error" in order to
variadic: false
});
- let fn_sig = match *fn_sty {
+ let fn_sig = match fn_ty.sty {
ty::ty_bare_fn(ty::BareFnTy {ref sig, ..}) |
ty::ty_closure(box ty::ClosureTy {ref sig, ..}) => sig,
_ => {
}
}
ast::ExprUnary(unop, ref oprnd) => {
- let expected_inner = expected.map(fcx, |sty| {
+ let expected_inner = expected.map(fcx, |ty| {
match unop {
- ast::UnUniq => match *sty {
+ ast::UnUniq => match ty.sty {
ty::ty_uniq(ty) => {
ExpectHasType(ty)
}
}
ast::ExprAddrOf(mutbl, ref oprnd) => {
let expected = expected.only_has_type();
- let hint = expected.map(fcx, |sty| {
- match *sty { ty::ty_rptr(_, ref mt) | ty::ty_ptr(ref mt) => ExpectHasType(mt.ty),
- _ => NoExpectation }
+ let hint = expected.map(fcx, |ty| {
+ match ty.sty {
+ ty::ty_rptr(_, ref mt) | ty::ty_ptr(ref mt) => ExpectHasType(mt.ty),
+ _ => NoExpectation
+ }
});
let lvalue_pref = match mutbl {
ast::MutMutable => PreferMutLvalue,
fcx.write_nil(id);
}
}
- ast::ExprMatch(ref discrim, ref arms, _) => {
- _match::check_match(fcx, expr, &**discrim, arms.as_slice(), expected);
+ ast::ExprMatch(ref discrim, ref arms, match_src) => {
+ _match::check_match(fcx, expr, &**discrim, arms.as_slice(), expected, match_src);
}
ast::ExprClosure(_, opt_kind, ref decl, ref body) => {
closure::check_expr_closure(fcx, expr, opt_kind, &**decl, &**body, expected);
}
ast::ExprTup(ref elts) => {
let expected = expected.only_has_type();
- let flds = expected.map_to_option(fcx, |sty| {
- match *sty {
- ty::ty_tup(ref flds) => Some((*flds).clone()),
+ let flds = expected.map_to_option(fcx, |ty| {
+ match ty.sty {
+ ty::ty_tup(ref flds) => Some(flds[]),
_ => None
}
});
}
fn map<'a, F>(self, fcx: &FnCtxt<'a, 'tcx>, unpack: F) -> Expectation<'tcx> where
- F: FnOnce(&ty::sty<'tcx>) -> Expectation<'tcx>
+ F: FnOnce(Ty<'tcx>) -> Expectation<'tcx>
{
match self.resolve(fcx) {
NoExpectation => NoExpectation,
- ExpectCastableToType(t) | ExpectHasType(t) => unpack(&t.sty),
+ ExpectCastableToType(ty) | ExpectHasType(ty) => unpack(ty),
}
}
fn map_to_option<'a, O, F>(self, fcx: &FnCtxt<'a, 'tcx>, unpack: F) -> Option<O> where
- F: FnOnce(&ty::sty<'tcx>) -> Option<O>,
+ F: FnOnce(Ty<'tcx>) -> Option<O>,
{
match self.resolve(fcx) {
NoExpectation => None,
- ExpectCastableToType(t) | ExpectHasType(t) => unpack(&t.sty),
+ ExpectCastableToType(ty) | ExpectHasType(ty) => unpack(ty),
}
}
}
ty
}
-// Returns the one-level-deep structure of the given type.
-pub fn structure_of<'a, 'tcx>(fcx: &FnCtxt<'a, 'tcx>, sp: Span, typ: Ty<'tcx>)
- -> &'tcx ty::sty<'tcx> {
- &structurally_resolved_type(fcx, sp, typ).sty
-}
-
// Returns true if b contains a break that can exit from b
pub fn may_break(cx: &ty::ctxt, id: ast::NodeId, b: &ast::Block) -> bool {
// First: is there an unlabeled break immediately
use syntax::visit::Visitor;
use std::cell::{RefCell};
-use std::collections::hash_map::{Vacant, Occupied};
+use std::collections::hash_map::Entry::{Vacant, Occupied};
use self::RepeatingScope::Repeating;
use self::SubjectNode::Subject;
use middle::traits;
use middle::ty::{mod, Ty};
use middle::ty::liberate_late_bound_regions;
-use middle::ty_fold::{TypeFolder, TypeFoldable};
+use middle::ty_fold::{TypeFolder, TypeFoldable, super_fold_ty};
use util::ppaux::Repr;
use std::collections::HashSet;
self.binding_count -= 1;
}
- ref sty => {
- self.fold_sty(sty);
+ _ => {
+ super_fold_ty(self, t);
}
}
};
let mut tmp = Vec::new();
for child in m.items.iter_mut() {
- let inner = match child.inner {
- ModuleItem(ref mut m) => m,
+ match child.inner {
+ ModuleItem(..) => {}
_ => continue,
- };
+ }
let prim = match PrimitiveType::find(child.attrs.as_slice()) {
Some(prim) => prim,
None => continue,
};
primitives.push(prim);
- let mut i = Item {
+ tmp.push(Item {
source: Span::empty(),
name: Some(prim.to_url_str().to_string()),
- attrs: Vec::new(),
- visibility: None,
+ attrs: child.attrs.clone(),
+ visibility: Some(ast::Public),
stability: None,
def_id: ast_util::local_def(prim.to_node_id()),
inner: PrimitiveItem(prim),
- };
- // Push one copy to get indexed for the whole crate, and push a
- // another copy in the proper location which will actually get
- // documented. The first copy will also serve as a redirect to
- // the other copy.
- tmp.push(i.clone());
- i.visibility = Some(ast::Public);
- i.attrs = child.attrs.clone();
- inner.items.push(i);
-
+ });
}
m.items.extend(tmp.into_iter());
}
pub use self::ExternalLocation::*;
use std::cell::RefCell;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use std::collections::{HashMap, HashSet};
use std::default::Default;
use std::fmt;
use std::cell::RefCell;
use std::collections::HashMap;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use std::io::File;
use std::io;
use std::rc::Rc;
impl ::Decoder<DecoderError> for Decoder {
fn read_nil(&mut self) -> DecodeResult<()> {
- debug!("read_nil");
expect!(self.pop(), Null)
}
fn read_f32(&mut self) -> DecodeResult<f32> { self.read_f64().map(|x| x as f32) }
fn read_f64(&mut self) -> DecodeResult<f64> {
- debug!("read_f64");
match self.pop() {
Json::I64(f) => Ok(f as f64),
Json::U64(f) => Ok(f as f64),
}
fn read_bool(&mut self) -> DecodeResult<bool> {
- debug!("read_bool");
expect!(self.pop(), Boolean)
}
}
fn read_str(&mut self) -> DecodeResult<string::String> {
- debug!("read_str");
expect!(self.pop(), String)
}
- fn read_enum<T, F>(&mut self, name: &str, f: F) -> DecodeResult<T> where
+ fn read_enum<T, F>(&mut self, _name: &str, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_enum({})", name);
f(self)
}
mut f: F) -> DecodeResult<T>
where F: FnMut(&mut Decoder, uint) -> DecodeResult<T>,
{
- debug!("read_enum_variant(names={})", names);
let name = match self.pop() {
Json::String(s) => s,
Json::Object(mut o) => {
f(self, idx)
}
- fn read_enum_variant_arg<T, F>(&mut self, idx: uint, f: F) -> DecodeResult<T> where
+ fn read_enum_variant_arg<T, F>(&mut self, _idx: uint, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_enum_variant_arg(idx={})", idx);
f(self)
}
fn read_enum_struct_variant<T, F>(&mut self, names: &[&str], f: F) -> DecodeResult<T> where
F: FnMut(&mut Decoder, uint) -> DecodeResult<T>,
{
- debug!("read_enum_struct_variant(names={})", names);
self.read_enum_variant(names, f)
}
fn read_enum_struct_variant_field<T, F>(&mut self,
- name: &str,
+ _name: &str,
idx: uint,
f: F)
-> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_enum_struct_variant_field(name={}, idx={})", name, idx);
self.read_enum_variant_arg(idx, f)
}
- fn read_struct<T, F>(&mut self, name: &str, len: uint, f: F) -> DecodeResult<T> where
+ fn read_struct<T, F>(&mut self, _name: &str, _len: uint, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_struct(name={}, len={})", name, len);
let value = try!(f(self));
self.pop();
Ok(value)
fn read_struct_field<T, F>(&mut self,
name: &str,
- idx: uint,
+ _idx: uint,
f: F)
-> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_struct_field(name={}, idx={})", name, idx);
let mut obj = try!(expect!(self.pop(), Object));
let value = match obj.remove(&name.to_string()) {
fn read_tuple<T, F>(&mut self, tuple_len: uint, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_tuple()");
self.read_seq(move |d, len| {
if len == tuple_len {
f(d)
fn read_tuple_arg<T, F>(&mut self, idx: uint, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_tuple_arg(idx={})", idx);
self.read_seq_elt(idx, f)
}
fn read_tuple_struct<T, F>(&mut self,
- name: &str,
+ _name: &str,
len: uint,
f: F)
-> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_tuple_struct(name={})", name);
self.read_tuple(len, f)
}
-> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_tuple_struct_arg(idx={})", idx);
self.read_tuple_arg(idx, f)
}
fn read_option<T, F>(&mut self, mut f: F) -> DecodeResult<T> where
F: FnMut(&mut Decoder, bool) -> DecodeResult<T>,
{
- debug!("read_option()");
match self.pop() {
Json::Null => f(self, false),
value => { self.stack.push(value); f(self, true) }
fn read_seq<T, F>(&mut self, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder, uint) -> DecodeResult<T>,
{
- debug!("read_seq()");
let array = try!(expect!(self.pop(), Array));
let len = array.len();
for v in array.into_iter().rev() {
f(self, len)
}
- fn read_seq_elt<T, F>(&mut self, idx: uint, f: F) -> DecodeResult<T> where
+ fn read_seq_elt<T, F>(&mut self, _idx: uint, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_seq_elt(idx={})", idx);
f(self)
}
fn read_map<T, F>(&mut self, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder, uint) -> DecodeResult<T>,
{
- debug!("read_map()");
let obj = try!(expect!(self.pop(), Object));
let len = obj.len();
for (key, value) in obj.into_iter() {
f(self, len)
}
- fn read_map_elt_key<T, F>(&mut self, idx: uint, f: F) -> DecodeResult<T> where
+ fn read_map_elt_key<T, F>(&mut self, _idx: uint, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_map_elt_key(idx={})", idx);
f(self)
}
- fn read_map_elt_val<T, F>(&mut self, idx: uint, f: F) -> DecodeResult<T> where
+ fn read_map_elt_val<T, F>(&mut self, _idx: uint, f: F) -> DecodeResult<T> where
F: FnOnce(&mut Decoder) -> DecodeResult<T>,
{
- debug!("read_map_elt_val(idx={})", idx);
f(self)
}
use super::ParserError::*;
use super::DecoderError::*;
use super::JsonEvent::*;
- use super::ParserState::*;
use super::StackElement::*;
- use super::InternalStackElement::*;
use super::{PrettyEncoder, Json, from_str, DecodeResult, DecoderError, JsonEvent, Parser,
StackElement, Stack, Encoder, Decoder};
use std::{i64, u64, f32, f64, io};
}
fn with_str_writer<F>(f: F) -> string::String where F: FnOnce(&mut io::Writer){
- use std::str;
-
let mut m = Vec::new();
f(&mut m as &mut io::Writer);
string::String::from_utf8(m).unwrap()
fn test_write_char() {
check_encoder_for_simple!('a', "\"a\"");
check_encoder_for_simple!('\t', "\"\\t\"");
- check_encoder_for_simple!('\u00a0', "\"\u00a0\"");
- check_encoder_for_simple!('\uabcd', "\"\uabcd\"");
- check_encoder_for_simple!('\U0010ffff', "\"\U0010ffff\"");
+ check_encoder_for_simple!('\u{00a0}', "\"\u{00a0}\"");
+ check_encoder_for_simple!('\u{abcd}', "\"\u{abcd}\"");
+ check_encoder_for_simple!('\u{10ffff}', "\"\u{10ffff}\"");
}
#[test]
/// ```{.rust}
/// bitflags! {
/// flags Flags: u32 {
-/// const FLAG_A = 0x00000001,
-/// const FLAG_B = 0x00000010,
-/// const FLAG_C = 0x00000100,
+/// const FLAG_A = 0b00000001,
+/// const FLAG_B = 0b00000010,
+/// const FLAG_C = 0b00000100,
/// const FLAG_ABC = FLAG_A.bits
/// | FLAG_B.bits
/// | FLAG_C.bits,
///
/// bitflags! {
/// flags Flags: u32 {
-/// const FLAG_A = 0x00000001,
-/// const FLAG_B = 0x00000010,
+/// const FLAG_A = 0b00000001,
+/// const FLAG_B = 0b00000010,
/// }
/// }
///
#[doc = "> "]
#[doc = "> - Richard Feynman"]
flags Flags: u32 {
- const FlagA = 0x00000001,
+ const FlagA = 0b00000001,
#[doc = "<pcwalton> macros are way better at generating code than trans is"]
- const FlagB = 0x00000010,
- const FlagC = 0x00000100,
+ const FlagB = 0b00000010,
+ const FlagC = 0b00000100,
#[doc = "* cmr bed"]
#[doc = "* strcat table"]
#[doc = "<strcat> wait what?"]
#[test]
fn test_bits(){
- assert_eq!(Flags::empty().bits(), 0x00000000);
- assert_eq!(FlagA.bits(), 0x00000001);
- assert_eq!(FlagABC.bits(), 0x00000111);
+ assert_eq!(Flags::empty().bits(), 0b00000000);
+ assert_eq!(FlagA.bits(), 0b00000001);
+ assert_eq!(FlagABC.bits(), 0b00000111);
- assert_eq!(AnotherSetOfFlags::empty().bits(), 0x00);
+ assert_eq!(AnotherSetOfFlags::empty().bits(), 0b00);
assert_eq!(AnotherFlag.bits(), !0_i8);
}
#[test]
fn test_from_bits() {
assert!(Flags::from_bits(0) == Some(Flags::empty()));
- assert!(Flags::from_bits(0x1) == Some(FlagA));
- assert!(Flags::from_bits(0x10) == Some(FlagB));
- assert!(Flags::from_bits(0x11) == Some(FlagA | FlagB));
- assert!(Flags::from_bits(0x1000) == None);
+ assert!(Flags::from_bits(0b1) == Some(FlagA));
+ assert!(Flags::from_bits(0b10) == Some(FlagB));
+ assert!(Flags::from_bits(0b11) == Some(FlagA | FlagB));
+ assert!(Flags::from_bits(0b1000) == None);
assert!(AnotherSetOfFlags::from_bits(!0_i8) == Some(AnotherFlag));
}
#[test]
fn test_from_bits_truncate() {
assert!(Flags::from_bits_truncate(0) == Flags::empty());
- assert!(Flags::from_bits_truncate(0x1) == FlagA);
- assert!(Flags::from_bits_truncate(0x10) == FlagB);
- assert!(Flags::from_bits_truncate(0x11) == (FlagA | FlagB));
- assert!(Flags::from_bits_truncate(0x1000) == Flags::empty());
- assert!(Flags::from_bits_truncate(0x1001) == FlagA);
+ assert!(Flags::from_bits_truncate(0b1) == FlagA);
+ assert!(Flags::from_bits_truncate(0b10) == FlagB);
+ assert!(Flags::from_bits_truncate(0b11) == (FlagA | FlagB));
+ assert!(Flags::from_bits_truncate(0b1000) == Flags::empty());
+ assert!(Flags::from_bits_truncate(0b1001) == FlagA);
assert!(AnotherSetOfFlags::from_bits_truncate(0_i8) == AnotherSetOfFlags::empty());
}
--- /dev/null
+// Copyright 2013 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.
+
+//! The boolean type
+
+#![doc(primitive = "bool")]
+#![stable]
+
//
// ignore-lexer-test FIXME #15883
-pub use self::Entry::*;
+use self::Entry::*;
use self::SearchResult::*;
use self::VacantEntryState::*;
use result::Result;
use result::Result::{Ok, Err};
-use super::table;
use super::table::{
+ mod,
Bucket,
- Empty,
EmptyBucket,
- Full,
FullBucket,
FullBucketImm,
FullBucketMut,
RawTable,
SafeHash
};
+use super::table::BucketState::{
+ Empty,
+ Full,
+};
const INITIAL_LOG2_CAP: uint = 5;
pub const INITIAL_CAPACITY: uint = 1 << INITIAL_LOG2_CAP; // 2^5
assert!(probe.index() != idx_end);
let full_bucket = match probe.peek() {
- table::Empty(bucket) => {
+ Empty(bucket) => {
// Found a hole!
let b = bucket.put(old_hash, old_key, old_val);
// Now that it's stolen, just read the value's pointer
.into_mut_refs()
.1;
},
- table::Full(bucket) => bucket
+ Full(bucket) => bucket
};
let probe_ib = full_bucket.index() - full_bucket.distance();
use prelude::*;
use super::HashMap;
- use super::{Occupied, Vacant};
+ use super::Entry::{Occupied, Vacant};
+ use cmp::Equiv;
use hash;
use iter::{range_inclusive, range_step_inclusive};
use cell::RefCell;
use fmt::Show;
use fmt;
use hash::{Hash, Hasher, RandomSipHasher};
-use iter::{Iterator, IteratorExt, FromIterator, Map, FilterMap, Chain, Repeat, Zip, Extend, repeat};
+use iter::{Iterator, IteratorExt, FromIterator, Map, Chain, Extend};
use option::Option::{Some, None, mod};
use result::Result::{Ok, Err};
/// }
/// ```
#[unstable = "matches collection reform specification, waiting for dust to settle"]
- pub fn iter<'a>(&'a self) -> SetItems<'a, T> {
- SetItems { iter: self.map.keys() }
+ pub fn iter<'a>(&'a self) -> Iter<'a, T> {
+ Iter { iter: self.map.keys() }
}
/// Creates a consuming iterator, that is, one that moves each value out
/// }
/// ```
#[unstable = "matches collection reform specification, waiting for dust to settle"]
- pub fn into_iter(self) -> SetMoveItems<T> {
+ pub fn into_iter(self) -> IntoIter<T> {
fn first<A, B>((a, _): (A, B)) -> A { a }
- SetMoveItems { iter: self.map.into_iter().map(first) }
+ IntoIter { iter: self.map.into_iter().map(first) }
}
/// Visit the values representing the difference.
/// assert_eq!(diff, [4i].iter().map(|&x| x).collect());
/// ```
#[unstable = "matches collection reform specification, waiting for dust to settle"]
- pub fn difference<'a>(&'a self, other: &'a HashSet<T, H>) -> SetAlgebraItems<'a, T, H> {
- fn filter<'a, T, S, H>((other, elt): (&HashSet<T, H>, &'a T)) -> Option<&'a T> where
- T: Eq + Hash<S>, H: Hasher<S>
- {
- if !other.contains(elt) { Some(elt) } else { None }
+ pub fn difference<'a>(&'a self, other: &'a HashSet<T, H>) -> Difference<'a, T, H> {
+ Difference {
+ iter: self.iter(),
+ other: other,
}
-
- SetAlgebraItems { iter: repeat(other).zip(self.iter()).filter_map(filter) }
}
/// Visit the values representing the symmetric difference.
/// ```
#[unstable = "matches collection reform specification, waiting for dust to settle"]
pub fn symmetric_difference<'a>(&'a self, other: &'a HashSet<T, H>)
- -> SymDifferenceItems<'a, T, H> {
- SymDifferenceItems { iter: self.difference(other).chain(other.difference(self)) }
+ -> SymmetricDifference<'a, T, H> {
+ SymmetricDifference { iter: self.difference(other).chain(other.difference(self)) }
}
/// Visit the values representing the intersection.
/// assert_eq!(diff, [2i, 3].iter().map(|&x| x).collect());
/// ```
#[unstable = "matches collection reform specification, waiting for dust to settle"]
- pub fn intersection<'a>(&'a self, other: &'a HashSet<T, H>) -> SetAlgebraItems<'a, T, H> {
- fn filter<'a, T, S, H>((other, elt): (&HashSet<T, H>, &'a T)) -> Option<&'a T> where
- T: Eq + Hash<S>, H: Hasher<S>
- {
- if other.contains(elt) { Some(elt) } else { None }
+ pub fn intersection<'a>(&'a self, other: &'a HashSet<T, H>) -> Intersection<'a, T, H> {
+ Intersection {
+ iter: self.iter(),
+ other: other,
}
-
- SetAlgebraItems { iter: repeat(other).zip(self.iter()).filter_map(filter) }
}
/// Visit the values representing the union.
/// assert_eq!(diff, [1i, 2, 3, 4].iter().map(|&x| x).collect());
/// ```
#[unstable = "matches collection reform specification, waiting for dust to settle"]
- pub fn union<'a>(&'a self, other: &'a HashSet<T, H>) -> UnionItems<'a, T, H> {
- UnionItems { iter: self.iter().chain(other.difference(self)) }
+ pub fn union<'a>(&'a self, other: &'a HashSet<T, H>) -> Union<'a, T, H> {
+ Union { iter: self.iter().chain(other.difference(self)) }
}
/// Return the number of elements in the set
}
/// HashSet iterator
-pub struct SetItems<'a, K: 'a> {
+pub struct Iter<'a, K: 'a> {
iter: Keys<'a, K, ()>
}
/// HashSet move iterator
-pub struct SetMoveItems<K> {
+pub struct IntoIter<K> {
iter: Map<(K, ()), K, MoveEntries<K, ()>, fn((K, ())) -> K>
}
iter: Map<(K, ()), K, map::Drain<'a, K, ()>, fn((K, ())) -> K>,
}
-// `Repeat` is used to feed the filter closure an explicit capture
-// of a reference to the other set
-/// Set operations iterator, used directly for intersection and difference
-pub struct SetAlgebraItems<'a, T: 'a, H: 'a> {
- iter: FilterMap<
- (&'a HashSet<T, H>, &'a T),
- &'a T,
- Zip<Repeat<&'a HashSet<T, H>>, SetItems<'a, T>>,
- for<'b> fn((&HashSet<T, H>, &'b T)) -> Option<&'b T>,
- >
+/// Intersection iterator
+pub struct Intersection<'a, T: 'a, H: 'a> {
+ // iterator of the first set
+ iter: Iter<'a, T>,
+ // the second set
+ other: &'a HashSet<T, H>,
+}
+
+/// Difference iterator
+pub struct Difference<'a, T: 'a, H: 'a> {
+ // iterator of the first set
+ iter: Iter<'a, T>,
+ // the second set
+ other: &'a HashSet<T, H>,
}
/// Symmetric difference iterator.
-pub struct SymDifferenceItems<'a, T: 'a, H: 'a> {
- iter: Chain<SetAlgebraItems<'a, T, H>, SetAlgebraItems<'a, T, H>>
+pub struct SymmetricDifference<'a, T: 'a, H: 'a> {
+ iter: Chain<Difference<'a, T, H>, Difference<'a, T, H>>
}
/// Set union iterator.
-pub struct UnionItems<'a, T: 'a, H: 'a> {
- iter: Chain<SetItems<'a, T>, SetAlgebraItems<'a, T, H>>
+pub struct Union<'a, T: 'a, H: 'a> {
+ iter: Chain<Iter<'a, T>, Difference<'a, T, H>>
}
-impl<'a, K> Iterator<&'a K> for SetItems<'a, K> {
+impl<'a, K> Iterator<&'a K> for Iter<'a, K> {
fn next(&mut self) -> Option<&'a K> { self.iter.next() }
fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
}
-impl<K> Iterator<K> for SetMoveItems<K> {
+impl<K> Iterator<K> for IntoIter<K> {
fn next(&mut self) -> Option<K> { self.iter.next() }
fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
}
fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
}
-impl<'a, T, H> Iterator<&'a T> for SetAlgebraItems<'a, T, H> {
- fn next(&mut self) -> Option<&'a T> { self.iter.next() }
- fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
+impl<'a, T, S, H> Iterator<&'a T> for Intersection<'a, T, H>
+ where T: Eq + Hash<S>, H: Hasher<S>
+{
+ fn next(&mut self) -> Option<&'a T> {
+ loop {
+ match self.iter.next() {
+ None => return None,
+ Some(elt) => if self.other.contains(elt) {
+ return Some(elt)
+ },
+ }
+ }
+ }
+
+ fn size_hint(&self) -> (uint, Option<uint>) {
+ let (_, upper) = self.iter.size_hint();
+ (0, upper)
+ }
+}
+
+impl<'a, T, S, H> Iterator<&'a T> for Difference<'a, T, H>
+ where T: Eq + Hash<S>, H: Hasher<S>
+{
+ fn next(&mut self) -> Option<&'a T> {
+ loop {
+ match self.iter.next() {
+ None => return None,
+ Some(elt) => if !self.other.contains(elt) {
+ return Some(elt)
+ },
+ }
+ }
+ }
+
+ fn size_hint(&self) -> (uint, Option<uint>) {
+ let (_, upper) = self.iter.size_hint();
+ (0, upper)
+ }
}
-impl<'a, T, H> Iterator<&'a T> for SymDifferenceItems<'a, T, H> {
+impl<'a, T, S, H> Iterator<&'a T> for SymmetricDifference<'a, T, H>
+ where T: Eq + Hash<S>, H: Hasher<S>
+{
fn next(&mut self) -> Option<&'a T> { self.iter.next() }
fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
}
-impl<'a, T, H> Iterator<&'a T> for UnionItems<'a, T, H> {
+impl<'a, T, S, H> Iterator<&'a T> for Union<'a, T, H>
+ where T: Eq + Hash<S>, H: Hasher<S>
+{
fn next(&mut self) -> Option<&'a T> { self.iter.next() }
fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
}
//
// ignore-lexer-test FIXME #15883
-pub use self::BucketState::*;
+use self::BucketState::*;
use clone::Clone;
use cmp;
}
}
-#[unstable]
+#[stable]
impl<T: Send> Clone for Sender<T> {
fn clone(&self) -> Sender<T> {
let (packet, sleeper, guard) = match *unsafe { self.inner() } {
}
}
-#[unstable]
+#[stable]
impl<T: Send> Clone for SyncSender<T> {
fn clone(&self) -> SyncSender<T> {
unsafe { (*self.inner.get()).clone_chan(); }
target_os = "freebsd",
target_os = "dragonfly"))]
pub mod dl {
- pub use self::Rtld::*;
+ use self::Rtld::*;
use prelude::*;
use c_str::CString;
}
}
+#[stable]
impl Clone for ChanWriter {
fn clone(&self) -> ChanWriter {
ChanWriter { tx: self.tx.clone() }
inner: Arc<Mutex<BufferedReader<StdReader>>>,
}
-/// A guard for exlusive access to `StdinReader`'s internal `BufferedReader`.
+/// A guard for exclusive access to `StdinReader`'s internal `BufferedReader`.
pub struct StdinReaderGuard<'a> {
inner: MutexGuard<'a, BufferedReader<StdReader>>,
}
/// A wrapper for a path to temporary directory implementing automatic
/// scope-based deletion.
+///
+/// # Examples
+///
+/// ```no_run
+/// use std::io::TempDir;
+///
+/// {
+/// // create a temporary directory
+/// let tmpdir = match TempDir::new("mysuffix") {
+/// Ok(dir) => dir,
+/// Err(e) => panic!("couldn't create temporary directory: {}", e)
+/// };
+///
+/// // get the path of the temporary directory without affecting the wrapper
+/// let tmppath = tmpdir.path();
+///
+/// println!("The path of temporary directory is {}", tmppath.display());
+///
+/// // the temporary directory is automatically removed when tmpdir goes
+/// // out of scope at the end of the block
+/// }
+/// {
+/// // create a temporary directory, this time using a custom path
+/// let tmpdir = match TempDir::new_in(&Path::new("/tmp/best/custom/path"), "mysuffix") {
+/// Ok(dir) => dir,
+/// Err(e) => panic!("couldn't create temporary directory: {}", e)
+/// };
+///
+/// // get the path of the temporary directory and disable automatic deletion in the wrapper
+/// let tmppath = tmpdir.into_inner();
+///
+/// println!("The path of the not-so-temporary directory is {}", tmppath.display());
+///
+/// // the temporary directory is not removed here
+/// // because the directory is detached from the wrapper
+/// }
+/// {
+/// // create a temporary directory
+/// let tmpdir = match TempDir::new("mysuffix") {
+/// Ok(dir) => dir,
+/// Err(e) => panic!("couldn't create temporary directory: {}", e)
+/// };
+///
+/// // close the temporary directory manually and check the result
+/// match tmpdir.close() {
+/// Ok(_) => println!("success!"),
+/// Err(e) => panic!("couldn't remove temporary directory: {}", e)
+/// };
+/// }
+/// ```
pub struct TempDir {
path: Option<Path>,
disarmed: bool
// NB: These reexports are in the order they should be listed in rustdoc
pub use core::any;
-pub use core::bool;
pub use core::borrow;
pub use core::cell;
pub use core::clone;
pub use core::ptr;
pub use core::raw;
pub use core::simd;
-pub use core::tuple;
-// FIXME #15320: primitive documentation needs top-level modules, this
-// should be `std::tuple::unit`.
-pub use core::unit;
pub use core::result;
pub use core::option;
pub mod rt;
mod failure;
+// Documentation for primitive types
+
+mod bool;
+mod unit;
+mod tuple;
+
// A curious inner-module that's not exported that contains the binding
// 'std' so that macro-expanded references to std::error and such
// can be resolved within libstd.
use libc::c_int;
use num::{Float, FloatMath};
use num::strconv;
+use num::strconv::ExponentFormat::{ExpNone, ExpDec};
+use num::strconv::SignificantDigits::{DigAll, DigMax, DigExact};
+use num::strconv::SignFormat::SignNeg;
pub use core::f32::{RADIX, MANTISSA_DIGITS, DIGITS, EPSILON, MIN_VALUE};
pub use core::f32::{MIN_POS_VALUE, MAX_VALUE, MIN_EXP, MAX_EXP, MIN_10_EXP};
#[experimental = "may be removed or relocated"]
pub fn to_string(num: f32) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigAll, strconv::ExpNone, false);
+ num, 10u, true, SignNeg, DigAll, ExpNone, false);
r
}
#[experimental = "may be removed or relocated"]
pub fn to_str_hex(num: f32) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 16u, true, strconv::SignNeg, strconv::DigAll, strconv::ExpNone, false);
+ num, 16u, true, SignNeg, DigAll, ExpNone, false);
r
}
#[inline]
#[experimental = "may be removed or relocated"]
pub fn to_str_radix_special(num: f32, rdx: uint) -> (String, bool) {
- strconv::float_to_str_common(num, rdx, true,
- strconv::SignNeg, strconv::DigAll, strconv::ExpNone, false)
+ strconv::float_to_str_common(num, rdx, true, SignNeg, DigAll, ExpNone, false)
}
/// Converts a float to a string with exactly the number of
#[experimental = "may be removed or relocated"]
pub fn to_str_exact(num: f32, dig: uint) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigExact(dig), strconv::ExpNone, false);
+ num, 10u, true, SignNeg, DigExact(dig), ExpNone, false);
r
}
#[experimental = "may be removed or relocated"]
pub fn to_str_digits(num: f32, dig: uint) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigMax(dig), strconv::ExpNone, false);
+ num, 10u, true, SignNeg, DigMax(dig), ExpNone, false);
r
}
#[experimental = "may be removed or relocated"]
pub fn to_str_exp_exact(num: f32, dig: uint, upper: bool) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigExact(dig), strconv::ExpDec, upper);
+ num, 10u, true, SignNeg, DigExact(dig), ExpDec, upper);
r
}
#[experimental = "may be removed or relocated"]
pub fn to_str_exp_digits(num: f32, dig: uint, upper: bool) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigMax(dig), strconv::ExpDec, upper);
+ num, 10u, true, SignNeg, DigMax(dig), ExpDec, upper);
r
}
use libc::c_int;
use num::{Float, FloatMath};
use num::strconv;
+use num::strconv::ExponentFormat::{ExpNone, ExpDec};
+use num::strconv::SignificantDigits::{DigAll, DigMax, DigExact};
+use num::strconv::SignFormat::SignNeg;
pub use core::f64::{RADIX, MANTISSA_DIGITS, DIGITS, EPSILON, MIN_VALUE};
pub use core::f64::{MIN_POS_VALUE, MAX_VALUE, MIN_EXP, MAX_EXP, MIN_10_EXP};
#[experimental = "may be removed or relocated"]
pub fn to_string(num: f64) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigAll, strconv::ExpNone, false);
+ num, 10u, true, SignNeg, DigAll, ExpNone, false);
r
}
#[experimental = "may be removed or relocated"]
pub fn to_str_hex(num: f64) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 16u, true, strconv::SignNeg, strconv::DigAll, strconv::ExpNone, false);
+ num, 16u, true, SignNeg, DigAll, ExpNone, false);
r
}
#[inline]
#[experimental = "may be removed or relocated"]
pub fn to_str_radix_special(num: f64, rdx: uint) -> (String, bool) {
- strconv::float_to_str_common(num, rdx, true,
- strconv::SignNeg, strconv::DigAll, strconv::ExpNone, false)
+ strconv::float_to_str_common(num, rdx, true, SignNeg, DigAll, ExpNone, false)
}
/// Converts a float to a string with exactly the number of
#[experimental = "may be removed or relocated"]
pub fn to_str_exact(num: f64, dig: uint) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigExact(dig), strconv::ExpNone, false);
+ num, 10u, true, SignNeg, DigExact(dig), ExpNone, false);
r
}
#[experimental = "may be removed or relocated"]
pub fn to_str_digits(num: f64, dig: uint) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigMax(dig), strconv::ExpNone, false);
+ num, 10u, true, SignNeg, DigMax(dig), ExpNone, false);
r
}
#[experimental = "may be removed or relocated"]
pub fn to_str_exp_exact(num: f64, dig: uint, upper: bool) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigExact(dig), strconv::ExpDec, upper);
+ num, 10u, true, SignNeg, DigExact(dig), ExpDec, upper);
r
}
#[experimental = "may be removed or relocated"]
pub fn to_str_exp_digits(num: f64, dig: uint, upper: bool) -> String {
let (r, _) = strconv::float_to_str_common(
- num, 10u, true, strconv::SignNeg, strconv::DigMax(dig), strconv::ExpDec, upper);
+ num, 10u, true, SignNeg, DigMax(dig), ExpDec, upper);
r
}
//! Operations and constants for architecture-sized signed integers (`int` type)
-#![unstable]
+#![stable]
#![doc(primitive = "int")]
pub use core::int::{BITS, BYTES, MIN, MAX};
#![allow(missing_docs)]
-pub use self::ExponentFormat::*;
-pub use self::SignificantDigits::*;
-pub use self::SignFormat::*;
+use self::ExponentFormat::*;
+use self::SignificantDigits::*;
+use self::SignFormat::*;
use char::{mod, Char};
use num::{mod, Int, Float, FPNaN, FPInfinite, ToPrimitive};
//! Operations and constants for architecture-sized unsigned integers (`uint` type)
-#![unstable]
+#![stable]
#![doc(primitive = "uint")]
pub use core::uint::{BITS, BYTES, MIN, MAX};
#![allow(non_snake_case)]
#![allow(unused_imports)]
-pub use self::MemoryMapKind::*;
-pub use self::MapOption::*;
-pub use self::MapError::*;
+use self::MemoryMapKind::*;
+use self::MapOption::*;
+use self::MapError::*;
use clone::Clone;
use error::{FromError, Error};
use result::Result::{Ok, Err};
let chunk = match os::MemoryMap::new(16, &[
- os::MapReadable,
- os::MapWritable
+ os::MapOption::MapReadable,
+ os::MapOption::MapWritable
]) {
Ok(chunk) => chunk,
Err(msg) => panic!("{}", msg)
file.write_u8(0);
let chunk = MemoryMap::new(size / 2, &[
- MapReadable,
- MapWritable,
- MapFd(get_fd(&file)),
- MapOffset(size / 2)
+ MapOption::MapReadable,
+ MapOption::MapWritable,
+ MapOption::MapFd(get_fd(&file)),
+ MapOption::MapOffset(size / 2)
]).unwrap();
assert!(chunk.len > 0);
//! Windows file path handling
-pub use self::PathPrefix::*;
+use self::PathPrefix::*;
use ascii::AsciiCast;
use c_str::{CString, ToCStr};
mod tests {
use prelude::*;
use super::*;
+ use super::PathPrefix::*;
use super::parse_prefix;
macro_rules! t {
#[doc(no_inline)] pub use io::{Buffer, Writer, Reader, Seek, BufferPrelude};
#[doc(no_inline)] pub use str::{Str, StrVector, StrPrelude};
#[doc(no_inline)] pub use str::{StrAllocating, UnicodeStrPrelude};
-#[doc(no_inline)] pub use tuple::{Tuple1, Tuple2, Tuple3, Tuple4};
-#[doc(no_inline)] pub use tuple::{Tuple5, Tuple6, Tuple7, Tuple8};
-#[doc(no_inline)] pub use tuple::{Tuple9, Tuple10, Tuple11, Tuple12};
+#[doc(no_inline)] pub use core::prelude::{Tuple1, Tuple2, Tuple3, Tuple4};
+#[doc(no_inline)] pub use core::prelude::{Tuple5, Tuple6, Tuple7, Tuple8};
+#[doc(no_inline)] pub use core::prelude::{Tuple9, Tuple10, Tuple11, Tuple12};
#[doc(no_inline)] pub use slice::AsSlice;
#[doc(no_inline)] pub use slice::{VectorVector, PartialEqSliceExt};
#[doc(no_inline)] pub use slice::{CloneSliceExt, OrdSliceExt, SliceExt};
//! so the "quality" of `/dev/random` is not better than `/dev/urandom` in most cases.
//! However, this means that `/dev/urandom` can yield somewhat predictable randomness
//! if the entropy pool is very small, such as immediately after first booting.
-//! Linux 3,17 added `getrandom(2)` system call which solves the issue: it blocks if entropy
+//! Linux 3.17 added the `getrandom(2)` system call which solves the issue: it blocks if entropy
//! pool is not initialized yet, but it does not block once initialized.
//! `OsRng` tries to use `getrandom(2)` if available, and use `/dev/urandom` fallback if not.
//! If an application does not have `getrandom` and likely to be run soon after first booting,
//! > Is it to your advantage to switch your choice?
//!
//! The rather unintuitive answer is that you will have a 2/3 chance of winning if
-//! you switch and a 1/3 chance of winning of you don't, so it's better to switch.
+//! you switch and a 1/3 chance of winning if you don't, so it's better to switch.
//!
//! This program will simulate the game show and with large enough simulation steps
//! it will indeed confirm that it is better to switch.
extern crate libc;
use io::{IoResult};
- use kinds::marker;
use mem;
use os;
use rand::Rng;
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-pub use self::SocketStatus::*;
-pub use self::InAddr::*;
+use self::SocketStatus::*;
+use self::InAddr::*;
use alloc::arc::Arc;
use libc::{mod, c_char, c_int};
#[cfg(all(target_os = "ios", target_arch = "arm"))]
#[inline(never)]
pub fn write(w: &mut Writer) -> IoResult<()> {
- use iter::{Iterator, range};
+ use iter::{IteratorExt, range};
use result;
use slice::SliceExt;
// while it doesn't requires lock for work as everything is
// local, it still displays much nicer backtraces when a
// couple of tasks panic simultaneously
- static LOCK: StaticNativeMutex = NATIVE_MUTEX_INIT;
+ static LOCK: StaticMutex = MUTEX_INIT;
let _g = unsafe { LOCK.lock() };
try!(writeln!(w, "stack backtrace:"));
use sys::{mod, timer, retry, c, set_nonblocking, wouldblock};
use sys::fs::{fd_t, FileDesc};
use sys_common::net::*;
+use sys_common::net::SocketStatus::*;
use sys_common::{eof, mkerr_libc};
fn unix_socket(ty: libc::c_int) -> IoResult<fd_t> {
use sys;
use sys_common;
use sys_common::net;
+use sys_common::net::SocketStatus::Readable;
pub use sys_common::net::TcpStream;
fd => return Ok(TcpStream::new(fd as sock_t)),
}
try!(net::await(&[self.fd(), self.inner.reader.fd()],
- deadline, net::Readable));
+ deadline, Readable));
}
Err(sys_common::eof())
//!
//! Note that all time units in this file are in *milliseconds*.
-pub use self::Req::*;
+use self::Req::*;
use libc;
use mem;
//! Other than that, the implementation is pretty straightforward in terms of
//! the other two implementations of timers with nothing *that* new showing up.
-pub use self::Req::*;
+use self::Req::*;
use libc;
use ptr;
--- /dev/null
+// Copyright 2012 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.
+
+//! Operations on tuples
+//!
+//! To access a single element of a tuple one can use the following
+//! methods:
+//!
+//! * `valN` - returns a value of _N_-th element
+//! * `refN` - returns a reference to _N_-th element
+//! * `mutN` - returns a mutable reference to _N_-th element
+//!
+//! Indexing starts from zero, so `val0` returns first value, `val1`
+//! returns second value, and so on. In general, a tuple with _S_
+//! elements provides aforementioned methods suffixed with numbers
+//! from `0` to `S-1`. Traits which contain these methods are
+//! implemented for tuples with up to 12 elements.
+//!
+//! If every type inside a tuple implements one of the following
+//! traits, then a tuple itself also implements it.
+//!
+//! * `Clone`
+//! * `PartialEq`
+//! * `Eq`
+//! * `PartialOrd`
+//! * `Ord`
+//! * `Default`
+//!
+//! # Examples
+//!
+//! Using methods:
+//!
+//! ```
+//! #[allow(deprecated)]
+//! # fn main() {
+//! let pair = ("pi", 3.14f64);
+//! assert_eq!(pair.val0(), "pi");
+//! assert_eq!(pair.val1(), 3.14f64);
+//! # }
+//! ```
+//!
+//! Using traits implemented for tuples:
+//!
+//! ```
+//! use std::default::Default;
+//!
+//! let a = (1i, 2i);
+//! let b = (3i, 4i);
+//! assert!(a != b);
+//!
+//! let c = b.clone();
+//! assert!(b == c);
+//!
+//! let d : (u32, f32) = Default::default();
+//! assert_eq!(d, (0u32, 0.0f32));
+//! ```
+
+#![doc(primitive = "tuple")]
+#![stable]
--- /dev/null
+// Copyright 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 <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.
+
+#![doc(primitive = "unit")]
+#![stable]
+
+//! The `()` type, sometimes called "unit" or "nil".
+//!
+//! The `()` type has exactly one value `()`, and is used when there
+//! is no other meaningful value that could be returned. `()` is most
+//! commonly seen implicitly: functions without a `-> ...` implicitly
+//! have return type `()`, that is, these are equivalent:
+//!
+//! ```rust
+//! fn long() -> () {}
+//!
+//! fn short() {}
+//! ```
+//!
+//! The semicolon `;` can be used to discard the result of an
+//! expression at the end of a block, making the expression (and thus
+//! the block) evaluate to `()`. For example,
+//!
+//! ```rust
+//! fn returns_i64() -> i64 {
+//! 1i64
+//! }
+//! fn returns_unit() {
+//! 1i64;
+//! }
+//!
+//! let is_i64 = {
+//! returns_i64()
+//! };
+//! let is_unit = {
+//! returns_i64();
+//! };
+//! ```
pub use self::LocalSource::*;
pub use self::Mac_::*;
pub use self::MacStmtStyle::*;
-pub use self::MatchSource::*;
pub use self::MetaItem_::*;
pub use self::Method_::*;
pub use self::Mutability::*;
#[deriving(Clone, Copy, PartialEq, Eq, Encodable, Decodable, Hash, Show)]
pub enum MatchSource {
- MatchNormal,
- MatchIfLetDesugar,
- MatchWhileLetDesugar,
+ Normal,
+ IfLetDesugar { contains_else_clause: bool },
+ WhileLetDesugar,
}
#[deriving(Clone, Copy, PartialEq, Eq, Encodable, Decodable, Hash, Show)]
/// Returns a `Folder` for deeply expanding all macros in a AST node.
pub fn expander<'b>(&'b mut self) -> expand::MacroExpander<'b, 'a> {
- expand::MacroExpander { cx: self }
+ expand::MacroExpander::new(self)
}
pub fn new_parser_from_tts(&self, tts: &[ast::TokenTree])
}
fn expr_match(&self, span: Span, arg: P<ast::Expr>, arms: Vec<ast::Arm>) -> P<Expr> {
- self.expr(span, ast::ExprMatch(arg, arms, ast::MatchNormal))
+ self.expr(span, ast::ExprMatch(arg, arms, ast::MatchSource::Normal))
}
fn expr_if(&self, span: Span, cond: P<ast::Expr>,
use ast::{StmtExpr, StmtSemi};
use ast::TokenTree;
use ast;
+use ast_util::path_to_ident;
use ext::mtwt;
use ext::build::AstBuilder;
use attr;
Right(R)
}
+pub fn expand_type(t: P<ast::Ty>,
+ fld: &mut MacroExpander,
+ impl_ty: Option<P<ast::Ty>>)
+ -> P<ast::Ty> {
+ debug!("expanding type {} with impl_ty {}", t, impl_ty);
+ let t = match (t.node.clone(), impl_ty) {
+ // Expand uses of `Self` in impls to the concrete type.
+ (ast::Ty_::TyPath(ref path, _), Some(ref impl_ty)) => {
+ let path_as_ident = path_to_ident(path);
+ // Note unhygenic comparison here. I think this is correct, since
+ // even though `Self` is almost just a type parameter, the treatment
+ // for this expansion is as if it were a keyword.
+ if path_as_ident.is_some() &&
+ path_as_ident.unwrap().name == token::special_idents::type_self.name {
+ impl_ty.clone()
+ } else {
+ t
+ }
+ }
+ _ => t
+ };
+ fold::noop_fold_ty(t, fld)
+}
+
pub fn expand_expr(e: P<ast::Expr>, fld: &mut MacroExpander) -> P<ast::Expr> {
e.and_then(|ast::Expr {id, node, span}| match node {
// expr_mac should really be expr_ext or something; it's the
// `match <expr> { ... }`
let arms = vec![pat_arm, break_arm];
let match_expr = fld.cx.expr(span,
- ast::ExprMatch(expr, arms, ast::MatchWhileLetDesugar));
+ ast::ExprMatch(expr, arms, ast::MatchSource::WhileLetDesugar));
// `[opt_ident]: loop { ... }`
let loop_block = fld.cx.block_expr(match_expr);
arms
};
+ let contains_else_clause = elseopt.is_some();
+
// `_ => [<elseopt> | ()]`
let else_arm = {
let pat_under = fld.cx.pat_wild(span);
arms.extend(else_if_arms.into_iter());
arms.push(else_arm);
- let match_expr = fld.cx.expr(span, ast::ExprMatch(expr, arms, ast::MatchIfLetDesugar));
+ let match_expr = fld.cx.expr(span,
+ ast::ExprMatch(expr, arms,
+ ast::MatchSource::IfLetDesugar {
+ contains_else_clause: contains_else_clause,
+ }));
fld.fold_expr(match_expr)
}
/// A tree-folder that performs macro expansion
pub struct MacroExpander<'a, 'b:'a> {
pub cx: &'a mut ExtCtxt<'b>,
+ // The type of the impl currently being expanded.
+ current_impl_type: Option<P<ast::Ty>>,
+}
+
+impl<'a, 'b> MacroExpander<'a, 'b> {
+ pub fn new(cx: &'a mut ExtCtxt<'b>) -> MacroExpander<'a, 'b> {
+ MacroExpander { cx: cx, current_impl_type: None }
+ }
}
impl<'a, 'b> Folder for MacroExpander<'a, 'b> {
}
fn fold_item(&mut self, item: P<ast::Item>) -> SmallVector<P<ast::Item>> {
- expand_item(item, self)
+ let prev_type = self.current_impl_type.clone();
+ if let ast::Item_::ItemImpl(_, _, _, ref ty, _) = item.node {
+ self.current_impl_type = Some(ty.clone());
+ }
+
+ let result = expand_item(item, self);
+ self.current_impl_type = prev_type;
+ result
}
fn fold_item_underscore(&mut self, item: ast::Item_) -> ast::Item_ {
expand_method(method, self)
}
+ fn fold_ty(&mut self, t: P<ast::Ty>) -> P<ast::Ty> {
+ let impl_type = self.current_impl_type.clone();
+ expand_type(t, self, impl_type)
+ }
+
fn new_span(&mut self, span: Span) -> Span {
new_span(self.cx, span)
}
user_exts: Vec<NamedSyntaxExtension>,
c: Crate) -> Crate {
let mut cx = ExtCtxt::new(parse_sess, c.config.clone(), cfg);
- let mut expander = MacroExpander {
- cx: &mut cx,
- };
+ let mut expander = MacroExpander::new(&mut cx);
for ExportedMacros { crate_name, macros } in imported_macros.into_iter() {
let name = format!("<{} macros>", token::get_ident(crate_name))
Known(ref tyname) => {
match tyname.as_slice() {
"" => "Show",
+ "?" => "Show",
"e" => "LowerExp",
"E" => "UpperExp",
"o" => "Octal",
use std::cell::RefCell;
use std::collections::HashMap;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
/// The SCTable contains a table of SyntaxContext_'s. It
/// represents a flattened tree structure, to avoid having
use std::mem;
use std::rc::Rc;
use std::collections::HashMap;
-use std::collections::hash_map::{Vacant, Occupied};
+use std::collections::hash_map::Entry::{Vacant, Occupied};
// To avoid costly uniqueness checks, we require that `MatchSeq` always has
// a nonempty body.
use ast::{LitBool, LitChar, LitByte, LitBinary};
use ast::{LitStr, LitInt, Local, LocalLet};
use ast::{MacStmtWithBraces, MacStmtWithSemicolon, MacStmtWithoutBraces};
-use ast::{MutImmutable, MutMutable, Mac_, MacInvocTT, MatchNormal};
+use ast::{MutImmutable, MutMutable, Mac_, MacInvocTT, MatchSource};
use ast::{Method, MutTy, BiMul, Mutability};
use ast::{MethodImplItem, NamedField, UnNeg, NoReturn, NodeId, UnNot};
use ast::{Pat, PatEnum, PatIdent, PatLit, PatRange, PatRegion, PatStruct};
self.expect(&token::OpenDelim(token::Bracket));
let t = self.parse_ty_sum();
- // Parse the `, ..e` in `[ int, ..e ]`
+ // Parse the `; e` in `[ int; e ]`
// where `e` is a const expression
let t = match self.maybe_parse_fixed_vstore() {
None => TyVec(t),
self.bump();
self.bump();
Some(self.parse_expr())
+ } else if self.check(&token::Semi) {
+ self.bump();
+ Some(self.parse_expr())
} else {
None
}
let count = self.parse_expr();
self.expect(&token::CloseDelim(token::Bracket));
ex = ExprRepeat(first_expr, count);
+ } else if self.check(&token::Semi) {
+ // Repeating vector syntax: [ 0; 512 ]
+ self.bump();
+ let count = self.parse_expr();
+ self.expect(&token::CloseDelim(token::Bracket));
+ ex = ExprRepeat(first_expr, count);
} else if self.check(&token::Comma) {
// Vector with two or more elements.
self.bump();
}
let hi = self.span.hi;
self.bump();
- return self.mk_expr(lo, hi, ExprMatch(discriminant, arms, MatchNormal));
+ return self.mk_expr(lo, hi, ExprMatch(discriminant, arms, MatchSource::Normal));
}
pub fn parse_arm(&mut self) -> Arm {
ast::TyFixedLengthVec(ref ty, ref v) => {
try!(word(&mut self.s, "["));
try!(self.print_type(&**ty));
- try!(word(&mut self.s, ", .."));
+ try!(word(&mut self.s, "; "));
try!(self.print_expr(&**v));
try!(word(&mut self.s, "]"));
}
try!(self.ibox(indent_unit));
try!(word(&mut self.s, "["));
try!(self.print_expr(&**element));
- try!(word(&mut self.s, ","));
- try!(word(&mut self.s, ".."));
+ try!(self.word_space(";"));
try!(self.print_expr(&**count));
try!(word(&mut self.s, "]"));
try!(self.end());
#![allow(missing_docs)]
use std::collections::hash_map;
-use std::collections::hash_map::{Occupied, Vacant};
+use std::collections::hash_map::Entry::{Occupied, Vacant};
use std::fmt::Show;
use std::hash::Hash;
use std::io;
+S 2014-12-20 8443b09
+ freebsd-x86_64 004f54dce86faeebc15abf92c8742634b53987e6
+ linux-i386 3daf531aed03f5769402f2fef852377e2838db98
+ linux-x86_64 4f3c8b092dd4fe159d6f25a217cf62e0e899b365
+ macos-i386 2a3e647b9c400505bd49cfe56091e866c83574ca
+ macos-x86_64 78f952a3e77a9921a23c957bb133131017b57324
+ winnt-i386 8ea056043de82096d5ce5abc98c8c74ebac7e77d
+ winnt-x86_64 9804100dafae9b64a76e0ea7e1be157719dae151
+
S 2014-12-15 1b97cd3
freebsd-x86_64 a5d7ff81ec04e01e64dc201c7aa2d875ebd0cbbb
linux-i386 47e13c2f1d26a0d13e593e0881a80ca103aa7b2e
pub struct Parser<T>;
impl<T: std::iter::Iterator<char>> Parser<T> {
fn in_doctype(&mut self) {
- static DOCTYPEPattern: [char, ..6] = ['O', 'C', 'T', 'Y', 'P', 'E'];
+ static DOCTYPEPattern: [char; 6] = ['O', 'C', 'T', 'Y', 'P', 'E'];
}
}
}
struct Noise2DContext {
- rgradients: [Vec2, ..256],
- permutations: [i32, ..256],
+ rgradients: [Vec2; 256],
+ permutations: [i32; 256],
}
impl Noise2DContext {
fn new() -> Noise2DContext {
let mut rng = StdRng::new().unwrap();
- let mut rgradients = [Vec2 { x: 0.0, y: 0.0 }, ..256];
+ let mut rgradients = [Vec2 { x: 0.0, y: 0.0 }; 256];
for x in rgradients.iter_mut() {
*x = random_gradient(&mut rng);
}
- let mut permutations = [0i32, ..256];
+ let mut permutations = [0i32; 256];
for (i, x) in permutations.iter_mut().enumerate() {
*x = i as i32;
}
self.rgradients[(idx & 255) as uint]
}
- fn get_gradients(&self, x: f32, y: f32) -> ([Vec2, ..4], [Vec2, ..4]) {
+ fn get_gradients(&self, x: f32, y: f32) -> ([Vec2; 4], [Vec2; 4]) {
let x0f = x.floor();
let y0f = y.floor();
let x1f = x0f + 1.0;
fn main() {
let symbols = [' ', 'â–‘', 'â–’', 'â–“', 'â–ˆ', 'â–ˆ'];
- let mut pixels = [0f32, ..256*256];
+ let mut pixels = [0f32; 256*256];
let n2d = Noise2DContext::new();
for _ in range(0u, 100) {
}
struct P {
- p: [i32, .. 16],
+ p: [i32; 16],
}
impl Copy for P {}
struct Perm {
- cnt: [i32, .. 16],
- fact: [u32, .. 16],
+ cnt: [i32; 16],
+ fact: [u32; 16],
n: u32,
permcount: u32,
perm: P,
impl Perm {
fn new(n: u32) -> Perm {
- let mut fact = [1, .. 16];
+ let mut fact = [1; 16];
for i in range(1, n as uint + 1) {
fact[i] = fact[i - 1] * i as u32;
}
Perm {
- cnt: [0, .. 16],
+ cnt: [0; 16],
fact: fact,
n: n,
permcount: 0,
- perm: P { p: [0, .. 16 ] }
+ perm: P { p: [0; 16 ] }
}
}
fn get(&mut self, mut idx: i32) -> P {
- let mut pp = [0u8, .. 16];
+ let mut pp = [0u8; 16];
self.permcount = idx as u32;
for (i, place) in self.perm.p.iter_mut().enumerate() {
*place = i as i32 + 1;
const NULL_AMINO_ACID: AminoAcid = AminoAcid { c: ' ' as u8, p: 0.0 };
-static IUB: [AminoAcid, ..15] = [
+static IUB: [AminoAcid;15] = [
AminoAcid { c: 'a' as u8, p: 0.27 },
AminoAcid { c: 'c' as u8, p: 0.12 },
AminoAcid { c: 'g' as u8, p: 0.12 },
AminoAcid { c: 'Y' as u8, p: 0.02 },
];
-static HOMO_SAPIENS: [AminoAcid, ..4] = [
+static HOMO_SAPIENS: [AminoAcid;4] = [
AminoAcid { c: 'a' as u8, p: 0.3029549426680 },
AminoAcid { c: 'c' as u8, p: 0.1979883004921 },
AminoAcid { c: 'g' as u8, p: 0.1975473066391 },
}
}
-fn make_lookup(a: &[AminoAcid]) -> [AminoAcid, ..LOOKUP_SIZE] {
- let mut lookup = [ NULL_AMINO_ACID, ..LOOKUP_SIZE ];
+fn make_lookup(a: &[AminoAcid]) -> [AminoAcid;LOOKUP_SIZE] {
+ let mut lookup = [ NULL_AMINO_ACID;LOOKUP_SIZE ];
let mut j = 0;
for (i, slot) in lookup.iter_mut().enumerate() {
while a[j].p < (i as f32) {
struct RandomFasta<'a, W:'a> {
seed: u32,
- lookup: [AminoAcid, ..LOOKUP_SIZE],
+ lookup: [AminoAcid;LOOKUP_SIZE],
out: &'a mut W,
}
fn make(&mut self, n: uint) -> IoResult<()> {
let lines = n / LINE_LEN;
let chars_left = n % LINE_LEN;
- let mut buf = [0, ..LINE_LEN + 1];
+ let mut buf = [0;LINE_LEN + 1];
for _ in range(0, lines) {
for i in range(0u, LINE_LEN) {
-> std::io::IoResult<()>
{
try!(wr.write(header.as_bytes()));
- let mut line = [0u8, .. LINE_LENGTH + 1];
+ let mut line = [0u8; LINE_LENGTH + 1];
while n > 0 {
let nb = min(LINE_LENGTH, n);
for i in range(0, nb) {
use std::slice;
use std::sync::{Arc, Future};
-static TABLE: [u8, ..4] = [ 'A' as u8, 'C' as u8, 'G' as u8, 'T' as u8 ];
+static TABLE: [u8;4] = [ 'A' as u8, 'C' as u8, 'G' as u8, 'T' as u8 ];
static TABLE_SIZE: uint = 2 << 16;
-static OCCURRENCES: [&'static str, ..5] = [
+static OCCURRENCES: [&'static str;5] = [
"GGT",
"GGTA",
"GGTATT",
const YEAR: f64 = 365.24;
const N_BODIES: uint = 5;
-static BODIES: [Planet, ..N_BODIES] = [
+static BODIES: [Planet;N_BODIES] = [
// Sun
Planet {
x: 0.0, y: 0.0, z: 0.0,
impl Copy for Planet {}
-fn advance(bodies: &mut [Planet, ..N_BODIES], dt: f64, steps: int) {
+fn advance(bodies: &mut [Planet;N_BODIES], dt: f64, steps: int) {
for _ in range(0, steps) {
let mut b_slice = bodies.as_mut_slice();
loop {
}
}
-fn energy(bodies: &[Planet, ..N_BODIES]) -> f64 {
+fn energy(bodies: &[Planet;N_BODIES]) -> f64 {
let mut e = 0.0;
let mut bodies = bodies.iter();
loop {
e
}
-fn offset_momentum(bodies: &mut [Planet, ..N_BODIES]) {
+fn offset_momentum(bodies: &mut [Planet;N_BODIES]) {
let mut px = 0.0;
let mut py = 0.0;
let mut pz = 0.0;
use std::io::{IoResult, EndOfFile};
struct Tables {
- table8: [u8, ..1 << 8],
- table16: [u16, ..1 << 16]
+ table8: [u8;1 << 8],
+ table16: [u16;1 << 16]
}
impl Tables {
fn new() -> Tables {
- let mut table8 = [0, ..1 << 8];
+ let mut table8 = [0;1 << 8];
for (i, v) in table8.iter_mut().enumerate() {
*v = Tables::computed_cpl8(i as u8);
}
- let mut table16 = [0, ..1 << 16];
+ let mut table16 = [0;1 << 16];
for (i, v) in table16.iter_mut().enumerate() {
*v = table8[i & 255] as u16 << 8 |
table8[i >> 8] as u16;
return Sudoku { grid: g }
}
- pub fn from_vec(vec: &[[u8, ..9], ..9]) -> Sudoku {
+ pub fn from_vec(vec: &[[u8;9];9]) -> Sudoku {
let g = Vec::from_fn(9u, |i| {
Vec::from_fn(9u, |j| { vec[i][j] })
});
}
}
-static DEFAULT_SUDOKU: [[u8, ..9], ..9] = [
+static DEFAULT_SUDOKU: [[u8;9];9] = [
/* 0 1 2 3 4 5 6 7 8 */
/* 0 */ [0u8, 4u8, 0u8, 6u8, 0u8, 0u8, 0u8, 3u8, 2u8],
/* 1 */ [0u8, 0u8, 8u8, 0u8, 2u8, 0u8, 0u8, 0u8, 0u8],
];
#[cfg(test)]
-static DEFAULT_SOLUTION: [[u8, ..9], ..9] = [
+static DEFAULT_SOLUTION: [[u8;9];9] = [
/* 0 1 2 3 4 5 6 7 8 */
/* 0 */ [1u8, 4u8, 9u8, 6u8, 7u8, 5u8, 8u8, 3u8, 2u8],
/* 1 */ [5u8, 3u8, 8u8, 1u8, 2u8, 9u8, 7u8, 4u8, 6u8],
// except according to those terms.
fn main() {
- let x: [int ..3]; //~ ERROR expected one of `(`, `+`, `,`, `::`, or `]`, found `..`
+ let x: [int 3]; //~ ERROR expected one of `(`, `+`, `,`, `::`, `;`, or `]`, found `3`
}
// Issue #16205.
struct Foo {
- a: [Box<int>, ..3],
+ a: [Box<int>; 3],
}
fn main() {
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-// Tests that we forbid coercion from `[T, ..n]` to `&[T]`
+// Tests that we forbid coercion from `[T; n]` to `&[T]`
fn main() {
- let _: &[int] = [0i]; //~ERROR: mismatched types: expected `&[int]`, found `[int, ..1]`
+ let _: &[int] = [0i]; //~ERROR: mismatched types: expected `&[int]`, found `[int; 1]`
}
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-static a: [u8, ..3] = ['h' as u8, 'i' as u8, 0 as u8];
+static a: [u8; 3] = ['h' as u8, 'i' as u8, 0 as u8];
static b: *const i8 = &a as *const i8; //~ ERROR mismatched types
fn main() {
pub fn main() {
// With a vec of ints.
let f1 = Fat { ptr: [1, 2, 3] };
- let f2: &Fat<[int, ..3]> = &f1;
+ let f2: &Fat<[int; 3]> = &f1;
let f3: &Fat<[uint]> = f2;
- //~^ ERROR mismatched types: expected `&Fat<[uint]>`, found `&Fat<[int, ..3]>`
+ //~^ ERROR mismatched types: expected `&Fat<[uint]>`, found `&Fat<[int; 3]>`
// With a trait.
let f1 = Fat { ptr: Foo };
pub fn main() {
// With a vec of ints.
let f1 = Fat { ptr: [1, 2, 3] };
- let f2: &Fat<[int, ..3]> = &f1;
+ let f2: &Fat<[int; 3]> = &f1;
let f3: &mut Fat<[int]> = f2; //~ ERROR mismatched types
// With a trait.
fn baz<'a>() {
// With a vec of ints.
let f1 = Fat { ptr: [1, 2, 3] };
- let f2: &Fat<[int, ..3]> = &f1; //~ ERROR `f1` does not live long enough
+ let f2: &Fat<[int; 3]> = &f1; //~ ERROR `f1` does not live long enough
let f3: &'a Fat<[int]> = f2;
// With a trait.
pub fn main() {
// With a vec of ints.
let f1: &Fat<[int]> = &Fat { ptr: [1, 2, 3] };
- let f2: &Fat<[int, ..3]> = f1;
- //~^ ERROR mismatched types: expected `&Fat<[int, ..3]>`, found `&Fat<[int]>`
+ let f2: &Fat<[int; 3]> = f1;
+ //~^ ERROR mismatched types: expected `&Fat<[int; 3]>`, found `&Fat<[int]>`
}
}
pub fn main() {
- let f: Fat<[int, ..3]> = Fat { ptr: [5i, 6, 7] };
+ let f: Fat<[int; 3]> = Fat { ptr: [5i, 6, 7] };
let g: &Fat<[int]> = &f;
let h: &Fat<Fat<[int]>> = &Fat { ptr: *g };
//~^ ERROR the trait `core::kinds::Sized` is not implemented
// error-pattern: too big for the current
fn main() {
- let fat : [u8, ..(1<<61)+(1<<31)] = [0, ..(1u64<<61) as uint +(1u64<<31) as uint];
+ let fat : [u8; (1<<61)+(1<<31)] = [0; (1u64<<61) as uint +(1u64<<31) as uint];
}
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-// error-pattern: ..1518599999
+// error-pattern:; 1518599999
fn generic<T: Copy>(t: T) {
- let s: [T, ..1518600000] = [t, ..1518600000];
+ let s: [T; 1518600000] = [t; 1518600000];
}
fn main() {
- let x: [u8, ..1518599999] = [0, ..1518599999];
- generic::<[u8, ..1518599999]>(x);
+ let x: [u8; 1518599999] = [0; 1518599999];
+ generic::<[u8; 1518599999]>(x);
}
#[cfg(target_word_size = "32")]
fn main() {
- let big: Option<[u32, ..(1<<29)-1]> = None;
+ let big: Option<[u32; (1<<29)-1]> = None;
}
#[cfg(target_word_size = "64")]
fn main() {
- let big: Option<[u32, ..(1<<45)-1]> = None;
+ let big: Option<[u32; (1<<45)-1]> = None;
}
// error-pattern: mismatched types
-static VEC: [u32, ..256] = vec!();
+static VEC: [u32; 256] = vec!();
fn main() {}
let x = [1,2];
let y = match x {
[] => None,
- //~^ ERROR types: expected `[_#0i, ..2]`, found `[_#7t, ..0]`
+ //~^ ERROR types: expected `[_#0i; 2]`, found `[_#7t; 0]`
// (expected array of 2 elements, found array of 0 elements)
[a,_] => Some(a)
};
let x = [1,2];
let y = match x {
[] => None,
-//~^ ERROR types: expected `[_, ..2]`, found `[_, ..0]`
+//~^ ERROR types: expected `[_; 2]`, found `[_; 0]`
// (expected array of 2 elements, found array of 0 elements)
[a,_] => Some(a)
};
struct X {
- a: [u8, ..1]
+ a: [u8; 1]
}
fn main() {
let x = X { a: [0] };
let _f = &x.a as *mut u8;
- //~^ ERROR mismatched types: expected `*mut u8`, found `&[u8, ..1]`
+ //~^ ERROR mismatched types: expected `*mut u8`, found `&[u8; 1]`
let local = [0u8];
let _v = &local as *mut u8;
- //~^ ERROR mismatched types: expected `*mut u8`, found `&[u8, ..1]`
+ //~^ ERROR mismatched types: expected `*mut u8`, found `&[u8; 1]`
}
static FOO: uint = FOO; //~ ERROR recursive constant
fn main() {
- let _x: [u8, ..FOO]; // caused stack overflow prior to fix
+ let _x: [u8; FOO]; // caused stack overflow prior to fix
let _y: uint = 1 + {
static BAR: uint = BAR; //~ ERROR recursive constant
- let _z: [u8, ..BAR]; // caused stack overflow prior to fix
+ let _z: [u8; BAR]; // caused stack overflow prior to fix
1
};
}
fn main() {
let _foo = &[1u, 2] as [uint];
- //~^ ERROR cast to unsized type: `&[uint, ..2]` as `[uint]`
+ //~^ ERROR cast to unsized type: `&[uint; 2]` as `[uint]`
//~^^ HELP consider using an implicit coercion to `&[uint]` instead
let _bar = box 1u as std::fmt::Show;
//~^ ERROR cast to unsized type: `Box<uint>` as `core::fmt::Show`
//~^ ERROR cast to unsized type: `uint` as `core::fmt::Show`
//~^^ HELP consider using a box or reference as appropriate
let _quux = [1u, 2] as [uint];
- //~^ ERROR cast to unsized type: `[uint, ..2]` as `[uint]`
+ //~^ ERROR cast to unsized type: `[uint; 2]` as `[uint]`
//~^^ HELP consider using a box or reference as appropriate
}
static C: &'static uint = &(A.a);
//~^ ERROR: cannot refer to the interior of another static
-static D: [uint, ..1] = [1];
+static D: [uint; 1] = [1];
static E: uint = D[0];
//~^ ERROR: cannot refer to other statics by value
static F: &'static uint = &D[0];
const TUP: (uint,) = (42,);
fn main() {
- let a: [int, ..TUP.1];
+ let a: [int; TUP.1];
//~^ ERROR expected constant expr for array length: tuple index out of bounds
}
const STRUCT: MyStruct = MyStruct { field: 42 };
fn main() {
- let a: [int, ..STRUCT.nonexistent_field];
+ let a: [int; STRUCT.nonexistent_field];
//~^ ERROR expected constant expr for array length: nonexistent struct field
}
--- /dev/null
+// Copyright 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 <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.
+
+// Test if the sugared if-let construct correctly prints "missing an else clause" when an else
+// clause does not exist, instead of the unsympathetic "match arms have incompatible types"
+
+fn main() {
+ if let Some(homura) = Some("madoka") { //~ ERROR missing an else clause: expected `()`
+ 765i32
+ };
+}
}
fn main() {
["hi"].bind(|x| [x] );
- //~^ ERROR type `[&str, ..1]` does not implement any method in scope named `bind`
+ //~^ ERROR type `[&str; 1]` does not implement any method in scope named `bind`
}
fn bar(int_param: int) {}
fn main() {
- let foo: [u8, ..4] = [1u8, ..4u];
+ let foo: [u8; 4] = [1u8; 4u];
bar(foo);
- //~^ ERROR mismatched types: expected `int`, found `[u8, ..4]`
+ //~^ ERROR mismatched types: expected `int`, found `[u8; 4]`
// (expected int, found vector)
}
pub extern crate core; //~ ERROR: `pub` visibility is not allowed
fn main() {
- pub use std::bool; //~ ERROR: imports in functions are never reachable
+ pub use std::uint; //~ ERROR: imports in functions are never reachable
}
println!("{}", Test);
let mut f = File::open(&Path::new("something.txt"));
- let mut buff = [0u8, ..16];
+ let mut buff = [0u8; 16];
match f.read(&mut buff) {
Ok(cnt) => println!("read this many bytes: {}", cnt),
Err(IoError{ kind: EndOfFile, .. }) => println!("Got end of file: {}", EndOfFile.to_string()),
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-// Test moving array structures, e.g. `[T, ..3]` as well as moving
+// Test moving array structures, e.g. `[T; 3]` as well as moving
// elements in and out of such arrays.
//
// Note also that the `test_move_array_then_overwrite` tests represent
impl Drop for D { fn drop(&mut self) { } }
#[rustc_move_fragments]
-pub fn test_move_array_via_return(a: [D, ..3]) -> [D, ..3] {
+pub fn test_move_array_via_return(a: [D; 3]) -> [D; 3] {
//~^ ERROR assigned_leaf_path: `$(local a)`
//~| ERROR moved_leaf_path: `$(local a)`
return a;
}
#[rustc_move_fragments]
-pub fn test_move_array_into_recv(a: [D, ..3], recv: &mut [D, ..3]) {
+pub fn test_move_array_into_recv(a: [D; 3], recv: &mut [D; 3]) {
//~^ ERROR parent_of_fragments: `$(local recv)`
//~| ERROR assigned_leaf_path: `$(local a)`
//~| ERROR moved_leaf_path: `$(local a)`
}
#[rustc_move_fragments]
-pub fn test_extract_array_elem(a: [D, ..3], i: uint) -> D {
+pub fn test_extract_array_elem(a: [D; 3], i: uint) -> D {
//~^ ERROR parent_of_fragments: `$(local a)`
//~| ERROR assigned_leaf_path: `$(local i)`
//~| ERROR moved_leaf_path: `$(local a).[]`
}
#[rustc_move_fragments]
-pub fn test_overwrite_array_elem(mut a: [D, ..3], i: uint, d: D) {
+pub fn test_overwrite_array_elem(mut a: [D; 3], i: uint, d: D) {
//~^ ERROR parent_of_fragments: `$(local mut a)`
//~| ERROR assigned_leaf_path: `$(local i)`
//~| ERROR assigned_leaf_path: `$(local d)`
// See RFC PR 320 for more discussion.
#[rustc_move_fragments]
-pub fn test_move_array_then_overwrite_elem1(mut a: [D, ..3], i: uint, recv: &mut [D, ..3], d: D) {
+pub fn test_move_array_then_overwrite_elem1(mut a: [D; 3], i: uint, recv: &mut [D; 3], d: D) {
//~^ ERROR parent_of_fragments: `$(local mut a)`
//~| ERROR parent_of_fragments: `$(local recv)`
//~| ERROR assigned_leaf_path: `$(local recv).*`
}
#[rustc_move_fragments]
-pub fn test_move_array_then_overwrite_elem2(mut a: [D, ..3], i: uint, j: uint,
- recv: &mut [D, ..3], d1: D, d2: D) {
+pub fn test_move_array_then_overwrite_elem2(mut a: [D; 3], i: uint, j: uint,
+ recv: &mut [D; 3], d1: D, d2: D) {
//~^^ ERROR parent_of_fragments: `$(local mut a)`
//~| ERROR parent_of_fragments: `$(local recv)`
//~| ERROR assigned_leaf_path: `$(local recv).*`
fn f110() {
let x = vec!("hi".to_string());
- let _y = [x.into_iter().next().unwrap(), ..1];
+ let _y = [x.into_iter().next().unwrap(); 1];
touch(&x); //~ ERROR use of moved value: `x`
}
enum State { ST_NULL, ST_WHITESPACE }
fn main() {
- [State::ST_NULL, ..(State::ST_WHITESPACE as uint)];
+ [State::ST_NULL; (State::ST_WHITESPACE as uint)];
//~^ ERROR expected constant integer for repeat count, found non-constant expression
}
fn main() {
fn bar(n: int) {
- let _x: [int, ..n];
+ let _x: [int; n];
//~^ ERROR expected constant expr for array length: non-constant path in constant expr
}
}
fn main() {
fn bar(n: uint) {
- let _x = [0, ..n]; //~ ERROR expected constant integer for repeat count, found variable
+ let _x = [0; n]; //~ ERROR expected constant integer for repeat count, found variable
}
}
struct Foo {
first: bool,
- second: Option<[uint, ..4]>
+ second: Option<[uint; 4]>
}
enum Color {
fn main() {
let foo = Foo { bar: [1u8, 2, 3, 4, 5], baz: 10i32 };
unsafe {
- let oof: Oof<[u8, .. 5], i32> = mem::transmute(foo);
+ let oof: Oof<[u8; 5], i32> = mem::transmute(foo);
println!("{} {}", oof.rab[], oof.zab);
}
}
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-type v = [int * 3]; //~ ERROR expected one of `(`, `+`, `,`, `::`, or `]`, found `*`
+type v = [int * 3]; //~ ERROR expected one of `(`, `+`, `,`, `::`, `;`, or `]`, found `*`
fn f() {
let v = [mut 1, 2, 3, 4];
//~^ ERROR expected identifier, found keyword `mut`
- //~^^ ERROR expected one of `!`, `,`, `.`, `::`, `]`, `{`, or an operator, found `1`
+ //~^^ ERROR expected one of `!`, `,`, `.`, `::`, `;`, `]`, `{`, or an operator, found `1`
}
type v = [mut int];
//~^ ERROR expected identifier, found keyword `mut`
- //~^^ ERROR expected one of `(`, `+`, `,`, `::`, or `]`, found `int`
+ //~^^ ERROR expected one of `(`, `+`, `,`, `::`, `;`, or `]`, found `int`
fn main() {
let a = Foo { x: 3 };
- let _ = [ a, ..5 ];
+ let _ = [ a; 5 ];
//~^ ERROR the trait `core::kinds::Copy` is not implemented for the type `Foo`
}
fn main() {
let n = 1;
- let a = [0, ..n]; //~ ERROR expected constant integer for repeat count, found variable
- let b = [0, ..()];
+ let a = [0; n]; //~ ERROR expected constant integer for repeat count, found variable
+ let b = [0; ()];
//~^ ERROR expected constant integer for repeat count, found non-constant expression
//~^^ ERROR: expected `uint`, found `()`
- let c = [0, ..true]; //~ ERROR expected positive integer for repeat count, found boolean
+ let c = [0; true]; //~ ERROR expected positive integer for repeat count, found boolean
//~^ ERROR: expected `uint`, found `bool`
- let d = [0, ..0.5]; //~ ERROR expected positive integer for repeat count, found float
+ let d = [0; 0.5]; //~ ERROR expected positive integer for repeat count, found float
//~^ ERROR: expected `uint`, found `_`
- let e = [0, .."foo"]; //~ ERROR expected positive integer for repeat count, found string
+ let e = [0; "foo"]; //~ ERROR expected positive integer for repeat count, found string
//~^ ERROR: expected `uint`, found `&'static str`
- let f = [0, ..-4];
+ let f = [0; -4];
//~^ ERROR expected positive integer for repeat count, found negative integer
- let f = [0u, ..-1];
+ let f = [0u; -1];
//~^ ERROR expected positive integer for repeat count, found negative integer
}
fn foo() -> int { 23 }
-static a: [int, ..2] = [foo(), ..2];
+static a: [int; 2] = [foo(); 2];
//~^ ERROR: function calls in constants are limited to struct and enum constructors
fn main() {}
+++ /dev/null
-// Copyright 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 <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.
-
-fn main() {
- let [_, ..,] = [(), ()]; //~ ERROR unexpected token: `]`
-}
let _: int = transmute(x); //~ ERROR cannot transmute
}
-unsafe fn h<T>(x: [T, ..10]) {
+unsafe fn h<T>(x: [T; 10]) {
let _: int = transmute(x); //~ ERROR cannot transmute
}
// presence of the `_` type shorthand notation.
struct X {
- y: [u8, ..2],
+ y: [u8; 2],
}
fn main() {
let x1 = X { y: [0, 0] };
let p1: *const u8 = &x1.y as *const _; //~ ERROR mismatched types
- let t1: *const [u8, ..2] = &x1.y as *const _;
- let h1: *const [u8, ..2] = &x1.y as *const [u8, ..2];
+ let t1: *const [u8; 2] = &x1.y as *const _;
+ let h1: *const [u8; 2] = &x1.y as *const [u8; 2];
let mut x1 = X { y: [0, 0] };
let p1: *mut u8 = &mut x1.y as *mut _; //~ ERROR mismatched types
- let t1: *mut [u8, ..2] = &mut x1.y as *mut _;
- let h1: *mut [u8, ..2] = &mut x1.y as *mut [u8, ..2];
+ let t1: *mut [u8; 2] = &mut x1.y as *mut _;
+ let h1: *mut [u8; 2] = &mut x1.y as *mut [u8; 2];
}
--- /dev/null
+// 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 <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.
+
+// ignore-android: FIXME(#10381)
+// min-lldb-version: 310
+
+// compile-flags:-g
+
+// === GDB TESTS ===================================================================================
+
+// gdb-command:run
+
+// DESTRUCTURED STRUCT
+// gdb-command:print x
+// gdb-check:$1 = 400
+// gdb-command:print y
+// gdb-check:$2 = 401.5
+// gdb-command:print z
+// gdb-check:$3 = true
+// gdb-command:continue
+
+// DESTRUCTURED TUPLE
+// gdb-command:print/x _i8
+// gdb-check:$4 = 0x6f
+// gdb-command:print/x _u8
+// gdb-check:$5 = 0x70
+// gdb-command:print _i16
+// gdb-check:$6 = -113
+// gdb-command:print _u16
+// gdb-check:$7 = 114
+// gdb-command:print _i32
+// gdb-check:$8 = -115
+// gdb-command:print _u32
+// gdb-check:$9 = 116
+// gdb-command:print _i64
+// gdb-check:$10 = -117
+// gdb-command:print _u64
+// gdb-check:$11 = 118
+// gdb-command:print _f32
+// gdb-check:$12 = 119.5
+// gdb-command:print _f64
+// gdb-check:$13 = 120.5
+// gdb-command:continue
+
+// MORE COMPLEX CASE
+// gdb-command:print v1
+// gdb-check:$14 = 80000
+// gdb-command:print x1
+// gdb-check:$15 = 8000
+// gdb-command:print *y1
+// gdb-check:$16 = 80001.5
+// gdb-command:print z1
+// gdb-check:$17 = false
+// gdb-command:print *x2
+// gdb-check:$18 = -30000
+// gdb-command:print y2
+// gdb-check:$19 = -300001.5
+// gdb-command:print *z2
+// gdb-check:$20 = true
+// gdb-command:print v2
+// gdb-check:$21 = 854237.5
+// gdb-command:continue
+
+
+// === LLDB TESTS ==================================================================================
+
+// lldb-command:type format add --format hex char
+// lldb-command:type format add --format hex 'unsigned char'
+
+// lldb-command:run
+
+// DESTRUCTURED STRUCT
+// lldb-command:print x
+// lldb-check:[...]$0 = 400
+// lldb-command:print y
+// lldb-check:[...]$1 = 401.5
+// lldb-command:print z
+// lldb-check:[...]$2 = true
+// lldb-command:continue
+
+// DESTRUCTURED TUPLE
+// lldb-command:print _i8
+// lldb-check:[...]$3 = 0x6f
+// lldb-command:print _u8
+// lldb-check:[...]$4 = 0x70
+// lldb-command:print _i16
+// lldb-check:[...]$5 = -113
+// lldb-command:print _u16
+// lldb-check:[...]$6 = 114
+// lldb-command:print _i32
+// lldb-check:[...]$7 = -115
+// lldb-command:print _u32
+// lldb-check:[...]$8 = 116
+// lldb-command:print _i64
+// lldb-check:[...]$9 = -117
+// lldb-command:print _u64
+// lldb-check:[...]$10 = 118
+// lldb-command:print _f32
+// lldb-check:[...]$11 = 119.5
+// lldb-command:print _f64
+// lldb-check:[...]$12 = 120.5
+// lldb-command:continue
+
+// MORE COMPLEX CASE
+// lldb-command:print v1
+// lldb-check:[...]$13 = 80000
+// lldb-command:print x1
+// lldb-check:[...]$14 = 8000
+// lldb-command:print *y1
+// lldb-check:[...]$15 = 80001.5
+// lldb-command:print z1
+// lldb-check:[...]$16 = false
+// lldb-command:print *x2
+// lldb-check:[...]$17 = -30000
+// lldb-command:print y2
+// lldb-check:[...]$18 = -300001.5
+// lldb-command:print *z2
+// lldb-check:[...]$19 = true
+// lldb-command:print v2
+// lldb-check:[...]$20 = 854237.5
+// lldb-command:continue
+
+
+struct Struct {
+ x: i16,
+ y: f32,
+ z: bool
+}
+
+fn main() {
+
+ let s = Struct {
+ x: 400,
+ y: 401.5,
+ z: true
+ };
+
+ for &Struct { x, y, z } in [s].iter() {
+ zzz(); // #break
+ }
+
+ let tuple: (i8, u8, i16, u16, i32, u32, i64, u64, f32, f64) =
+ (0x6f, 0x70, -113, 114, -115, 116, -117, 118, 119.5, 120.5);
+
+ for &(_i8, _u8, _i16, _u16, _i32, _u32, _i64, _u64, _f32, _f64) in [tuple].iter() {
+ zzz(); // #break
+ }
+
+ let more_complex: (i32, &Struct, Struct, Box<f64>) =
+ (80000,
+ &Struct {
+ x: 8000,
+ y: 80001.5,
+ z: false
+ },
+ Struct {
+ x: -30000,
+ y: -300001.5,
+ z: true
+ },
+ box 854237.5);
+
+ for &(v1,
+ &Struct { x: x1, y: ref y1, z: z1 },
+ Struct { x: ref x2, y: y2, z: ref z2 },
+ box v2) in [more_complex].iter() {
+ zzz(); // #break
+ }
+}
+
+fn zzz() {()}
#![allow(unused_variables)]
struct NoPadding1 {
- x: [u32, ..3],
+ x: [u32; 3],
y: i32,
- z: [f32, ..2]
+ z: [f32; 2]
}
struct NoPadding2 {
- x: [u32, ..3],
- y: [[u32, ..2], ..2]
+ x: [u32; 3],
+ y: [[u32; 2]; 2]
}
struct StructInternalPadding {
- x: [i16, ..2],
- y: [i64, ..2]
+ x: [i16; 2],
+ y: [i64; 2]
}
struct SingleVec {
- x: [i16, ..5]
+ x: [i16; 5]
}
struct StructPaddedAtEnd {
- x: [i64, ..2],
- y: [i16, ..2]
+ x: [i64; 2],
+ y: [i16; 2]
}
fn main() {
// except according to those terms.
// ignore-android: FIXME(#10381)
-// ignore-test: Not sure what is going on here --pcwalton
// min-lldb-version: 310
// compile-flags:-g
sentinel();
val
- }, ..10];
+ }; 10];
zzz(); // #break
sentinel();
sentinel();
// index expression
- let a_vector = [10i, ..20];
+ let a_vector = [10i; 20];
let _ = a_vector[{
zzz(); // #break
sentinel();
value: 2,
};
- let vec_unique: [UniqueNode<f32>, ..1] = [UniqueNode {
+ let vec_unique: [UniqueNode<f32>; 1] = [UniqueNode {
next: Val {
val: box UniqueNode {
next: Empty,
// VECTORS
// gdb-command:whatis fixed_size_vec1
-// gdb-check:type = struct ([type-names::Struct1, ..3], i16)
+// gdb-check:type = struct ([type-names::Struct1; 3], i16)
// gdb-command:whatis fixed_size_vec2
-// gdb-check:type = struct ([uint, ..3], i16)
+// gdb-check:type = struct ([uint; 3], i16)
// gdb-command:whatis slice1
// gdb-check:type = struct &[uint]
#![allow(unused_variables)]
-static mut VECT: [i32, ..3] = [1, 2, 3];
+static mut VECT: [i32; 3] = [1, 2, 3];
fn main() {
let a = [1i, 2, 3];
// except according to those terms.
// pp-exact
-fn f() -> [int, ..3] {
+fn f() -> [int; 3] {
let picard = 0;
let data = 1;
// #4264 fixed-length vector types
-pub fn foo(_: [int, ..(3 as uint)]) { }
+pub fn foo(_: [int; (3 as uint)]) { }
pub fn bar() {
const FOO: uint = ((5u as uint) - (4u as uint) as uint);
- let _: [(), ..(FOO as uint)] = ([(() as ())] as [(), ..1]);
+ let _: [(); (FOO as uint)] = ([(() as ())] as [(); 1]);
- let _: [(), ..(1u as uint)] = ([(() as ())] as [(), ..1]);
+ let _: [(); (1u as uint)] = ([(() as ())] as [(); 1]);
let _ =
- (((&((([(1i as int), (2 as int), (3 as int)] as [int, ..3])) as
- [int, ..3]) as &[int, ..3]) as *const _ as *const [int, ..3])
- as *const [int, ..(3u as uint)] as *const [int, ..3]);
+ (((&((([(1i as int), (2 as int), (3 as int)] as [int; 3])) as
+ [int; 3]) as &[int; 3]) as *const _ as *const [int; 3]) as
+ *const [int; (3u as uint)] as *const [int; 3]);
(match (() as ()) {
() => {
#[inline]
#[allow(dead_code)]
static __STATIC_FMTSTR: &'static [&'static str] =
- (&([("test" as &'static str)] as [&'static str, ..1]) as
- &'static [&'static str, ..1]);
+ (&([("test" as &'static str)] as [&'static str; 1]) as
+ &'static [&'static str; 1]);
&'static [&'static str]),
(&([]
as
- [core::fmt::Argument<'_>, ..0])
+ [core::fmt::Argument<'_>; 0])
as
- &[core::fmt::Argument<'_>, ..0]))
+ &[core::fmt::Argument<'_>; 0]))
as
core::fmt::Arguments<'_>)
as
}
} as collections::string::String);
}
-pub type Foo = [int, ..(3u as uint)];
+pub type Foo = [int; (3u as uint)];
pub struct Bar {
- pub x: [int, ..(3u as uint)],
+ pub x: [int; (3u as uint)],
}
-pub struct TupleBar([int, ..(4u as uint)]);
-pub enum Baz { BazVariant([int, ..(5u as uint)]), }
+pub struct TupleBar([int; (4u as uint)]);
+pub enum Baz { BazVariant([int; (5u as uint)]), }
pub fn id<T>(x: T) -> T { (x as T) }
pub fn use_id() {
let _ =
- ((id::<[int, ..(3u as uint)]> as
- fn([int, ..3]) -> [int, ..3])(([(1 as int), (2 as int),
- (3 as int)] as [int, ..3])) as
- [int, ..3]);
+ ((id::<[int; (3u as uint)]> as
+ fn([int; 3]) -> [int; 3])(([(1 as int), (2 as int), (3 as int)]
+ as [int; 3])) as [int; 3]);
}
fn main() { }
#[no_stack_check]
pub unsafe fn foo() {
// Make sure we use the stack
- let x: [u8, ..50] = [0, ..50];
+ let x: [u8; 50] = [0; 50];
black_box(x.as_ptr());
}
pub unsafe fn foo() {
// Make sure we use the stack
- let x: [u8, ..50] = [0, ..50];
+ let x: [u8; 50] = [0; 50];
black_box(x.as_ptr());
}
fn start(_main: *const u8, _argc: int, _argv: *const *const u8) -> int { 0 }
extern {
- fn _foo() -> [u8, ..16];
+ fn _foo() -> [u8; 16];
}
fn _main() {
const SIZE: int = 25;
fn main() {
- let _a: [bool, ..1 as uint];
- let _b: [int, ..SIZE as uint] = [1, ..SIZE as uint];
- let _c: [bool, ..'\n' as uint] = [true, ..'\n' as uint];
- let _d: [bool, ..true as uint] = [true, ..true as uint];
+ let _a: [bool; 1 as uint];
+ let _b: [int; SIZE as uint] = [1; SIZE as uint];
+ let _c: [bool; '\n' as uint] = [true; '\n' as uint];
+ let _d: [bool; true as uint] = [true; true as uint];
}
// Check that the various ways of getting to a reference to a vec (both sized
// and unsized) work properly.
-const aa: [int, ..3] = [1, 2, 3];
-const ab: &'static [int, ..3] = &aa;
+const aa: [int; 3] = [1, 2, 3];
+const ab: &'static [int; 3] = &aa;
const ac: &'static [int] = ab;
const ad: &'static [int] = &aa;
-const ae: &'static [int, ..3] = &[1, 2, 3];
+const ae: &'static [int; 3] = &[1, 2, 3];
const af: &'static [int] = &[1, 2, 3];
static ca: int = aa[0];
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-static A: [u8, ..1] = ['h' as u8];
+static A: [u8; 1] = ['h' as u8];
static B: u8 = (&A)[0];
-static C: &'static &'static &'static &'static [u8, ..1] = & & & &A;
+static C: &'static &'static &'static &'static [u8; 1] = & & & &A;
static D: u8 = (&C)[0];
pub fn main() {
const C: &'static [E] = &[E::V0, E::V1(0xDEADBEE)];
static C0: E = C[0];
static C1: E = C[1];
-const D: &'static [E, ..2] = &[E::V0, E::V1(0xDEADBEE)];
+const D: &'static [E; 2] = &[E::V0, E::V1(0xDEADBEE)];
static D0: E = C[0];
static D1: E = C[1];
// except according to those terms.
enum E { V1(int), V0 }
-static C: [E, ..3] = [E::V0, E::V1(0xDEADBEE), E::V0];
+static C: [E; 3] = [E::V0, E::V1(0xDEADBEE), E::V0];
pub fn main() {
match C[1] {
pub fn main() {
const FOO: uint = 2;
- let _v: [int, ..FOO*3];
+ let _v: [int; FOO*3];
}
pub fn main() {
const FOO: uint = 2;
- let _v = [0i, ..FOO*3*2/2];
+ let _v = [0i; FOO*3*2/2];
}
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-const x : [int, ..4] = [1,2,3,4];
+const x : [int; 4] = [1,2,3,4];
static p : int = x[2];
const y : &'static [int] = &[1,2,3,4];
static q : int = y[2];
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-type Big = [u64, ..8];
+type Big = [u64; 8];
struct Pair<'a> { a: int, b: &'a Big }
const x: &'static Big = &([13, 14, 10, 13, 11, 14, 14, 15]);
const y: &'static Pair<'static> = &Pair {a: 15, b: x};
use std::{str, string};
-const A: [u8, ..2] = ['h' as u8, 'i' as u8];
-const B: &'static [u8, ..2] = &A;
+const A: [u8; 2] = ['h' as u8, 'i' as u8];
+const B: &'static [u8; 2] = &A;
const C: *const u8 = B as *const u8;
pub fn main() {
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-static x : [int, ..4] = [1,2,3,4];
+static x : [int; 4] = [1,2,3,4];
static y : &'static [int] = &[1,2,3,4];
-static z : &'static [int, ..4] = &[1,2,3,4];
+static z : &'static [int; 4] = &[1,2,3,4];
static zz : &'static [int] = &[1,2,3,4];
pub fn main() {
assert!((*f2)[1] == 2);
// Nested Box.
- let f1 : Box<Fat<[int, ..3]>> = box Fat { f1: 5, f2: "some str", ptr: [1, 2, 3] };
+ let f1 : Box<Fat<[int; 3]>> = box Fat { f1: 5, f2: "some str", ptr: [1, 2, 3] };
foo(&*f1);
let f2 : Box<Fat<[int]>> = f1;
foo(&*f2);
const BAR2:uint = BAR;
pub fn main() {
- let _v = [0i, .. Flopsy::Bunny as uint];
- let _v = [0i, .. BAR];
- let _v = [0i, .. BAR2];
+ let _v = [0i; Flopsy::Bunny as uint];
+ let _v = [0i; BAR];
+ let _v = [0i; BAR2];
const BAR3:uint = BAR2;
- let _v = [0i, .. BAR3];
+ let _v = [0i; BAR3];
}
// Doesn't work; needs a design decision.
pub fn main() {
- let x : [int, ..5] = [1,2,3,4,5];
- let _y : [int, ..5] = [1,2,3,4,5];
+ let x : [int; 5] = [1,2,3,4,5];
+ let _y : [int; 5] = [1,2,3,4,5];
let mut z = [1,2,3,4,5];
z = x;
assert_eq!(z[0], 1);
assert_eq!(z[4], 5);
- let a : [int, ..5] = [1,1,1,1,1];
- let b : [int, ..5] = [2,2,2,2,2];
- let c : [int, ..5] = [2,2,2,2,3];
+ let a : [int; 5] = [1,1,1,1,1];
+ let b : [int; 5] = [2,2,2,2,2];
+ let c : [int; 5] = [2,2,2,2,3];
log(debug, a);
#![feature(macro_rules)]
-use std::num::strconv as s;
+use std::num::strconv::ExponentFormat::{ExpBin, ExpDec};
+use std::num::strconv::SignificantDigits::DigMax;
+use std::num::strconv::SignFormat::{SignAll, SignNeg};
use std::num::strconv::float_to_str_common as to_string;
macro_rules! t(($a:expr, $b:expr) => { { let (r, _) = $a; assert_eq!(r, $b.to_string()); } });
pub fn main() {
// Basic usage
- t!(to_string(1.2345678e-5f64, 10u, true, s::SignNeg, s::DigMax(6), s::ExpDec, false),
+ t!(to_string(1.2345678e-5f64, 10u, true, SignNeg, DigMax(6), ExpDec, false),
"1.234568e-5");
// Hexadecimal output
- t!(to_string(7.281738281250e+01f64, 16u, true, s::SignAll, s::DigMax(6), s::ExpBin, false),
+ t!(to_string(7.281738281250e+01f64, 16u, true, SignAll, DigMax(6), ExpBin, false),
"+1.2345p+6");
- t!(to_string(-1.777768135071e-02f64, 16u, true, s::SignAll, s::DigMax(6), s::ExpBin, false),
+ t!(to_string(-1.777768135071e-02f64, 16u, true, SignAll, DigMax(6), ExpBin, false),
"-1.2345p-6");
// Some denormals
- t!(to_string(4.9406564584124654e-324f64, 10u, true, s::SignNeg, s::DigMax(6), s::ExpBin, false),
+ t!(to_string(4.9406564584124654e-324f64, 10u, true, SignNeg, DigMax(6), ExpBin, false),
"1p-1074");
- t!(to_string(2.2250738585072009e-308f64, 10u, true, s::SignNeg, s::DigMax(6), s::ExpBin, false),
+ t!(to_string(2.2250738585072009e-308f64, 10u, true, SignNeg, DigMax(6), ExpBin, false),
"1p-1022");
}
#[cfg(target_word_size = "32")]
pub fn main() {
- assert_eq!(size_of::<[u8, ..(1 << 31) - 1]>(), (1 << 31) - 1);
+ assert_eq!(size_of::<[u8; (1 << 31) - 1]>(), (1 << 31) - 1);
}
#[cfg(target_word_size = "64")]
pub fn main() {
- assert_eq!(size_of::<[u8, ..(1 << 47) - 1]>(), (1 << 47) - 1);
+ assert_eq!(size_of::<[u8; (1 << 47) - 1]>(), (1 << 47) - 1);
}
t!(format!("{}", 10i), "10");
t!(format!("{}", 10i), "10");
t!(format!("{}", 10u), "10");
+ t!(format!("{:?}", true), "true");
t!(format!("{:o}", 10u), "12");
t!(format!("{:x}", 10u), "a");
t!(format!("{:X}", 10u), "A");
trait Foo {}
impl Foo for int {}
-fn foo(_: [&Foo, ..2]) {}
+fn foo(_: [&Foo; 2]) {}
fn foos(_: &[&Foo]) {}
fn foog<T>(_: &[T], _: &[T]) {}
-fn bar(_: [Box<Foo>, ..2]) {}
+fn bar(_: [Box<Foo>; 2]) {}
fn bars(_: &[Box<Foo>]) {}
fn main() {
- let x: [&Foo, ..2] = [&1i, &2i];
+ let x: [&Foo; 2] = [&1i, &2i];
foo(x);
foo([&1i, &2i]);
let r = &1i;
- let x: [&Foo, ..2] = [r, ..2];
+ let x: [&Foo; 2] = [r; 2];
foo(x);
- foo([&1i, ..2]);
+ foo([&1i; 2]);
let x: &[&Foo] = &[&1i, &2i];
foos(x);
let r = &1i;
foog(x, &[r]);
- let x: [Box<Foo>, ..2] = [box 1i, box 2i];
+ let x: [Box<Foo>; 2] = [box 1i, box 2i];
bar(x);
bar([box 1i, box 2i]);
foog(x, &[box 1i]);
struct T<'a> {
- t: [&'a (Foo+'a), ..2]
+ t: [&'a (Foo+'a); 2]
}
let _n = T {
t: [&1i, &2i]
};
let r = &1i;
let _n = T {
- t: [r, ..2]
+ t: [r; 2]
};
- let x: [&Foo, ..2] = [&1i, &2i];
+ let x: [&Foo; 2] = [&1i, &2i];
let _n = T {
t: x
};
t: &[&1i, &2i]
};
let r = &1i;
- let r: [&Foo, ..2] = [r, ..2];
+ let r: [&Foo; 2] = [r; 2];
let _n = F {
t: &r
};
- let x: [&Foo, ..2] = [&1i, &2i];
+ let x: [&Foo; 2] = [&1i, &2i];
let _n = F {
t: &x
};
let _n = M {
t: &[box 1i, box 2i]
};
- let x: [Box<Foo>, ..2] = [box 1i, box 2i];
+ let x: [Box<Foo>; 2] = [box 1i, box 2i];
let _n = M {
t: &x
};
}
pub fn test() {
- let mut buf: [u16, ..50] = [0, ..50];
+ let mut buf: [u16; 50] = [0; 50];
let ret = unsafe {
FormatMessageW(0x1000, 0 as *mut c_void, 1, 0x400,
buf.as_mut_ptr(), buf.len() as u32, 0 as *const c_void)
const NUM: uint = u8::BITS as uint;
-struct MyStruct { nums: [uint, ..8] }
+struct MyStruct { nums: [uint; 8] }
fn main() {
- let _s = MyStruct { nums: [0, ..NUM] };
+ let _s = MyStruct { nums: [0; NUM] };
}
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-static TEST_VALUE : *const [int, ..2] = 0x1234 as *const [int, ..2];
+static TEST_VALUE : *const [int; 2] = 0x1234 as *const [int; 2];
fn main() {}
let args = os::args();
if args.len() > 1 {
let mut out = stdio::stdout();
- out.write(&['a' as u8, ..128 * 1024]).unwrap();
+ out.write(&['a' as u8; 128 * 1024]).unwrap();
} else {
let out = Command::new(args[0].as_slice()).arg("child").output();
let out = out.unwrap();
use std::iter::AdditiveIterator;
fn main() {
- let x: [u64, ..3] = [1, 2, 3];
+ let x: [u64; 3] = [1, 2, 3];
assert_eq!(6, range(0, 3).map(|i| x[i]).sum());
}
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-static mut DROPPED: [bool, ..2] = [false, false];
+static mut DROPPED: [bool; 2] = [false, false];
struct A(uint);
struct Foo { _a: A, _b: int }
// except according to those terms.
fn main() {
- assert_eq!(match [0u8, ..1024] {
+ assert_eq!(match [0u8; 1024] {
_ => 42u,
}, 42u);
- assert_eq!(match [0u8, ..1024] {
+ assert_eq!(match [0u8; 1024] {
[1, _..] => 0u,
[0, _..] => 1u,
_ => 2u
// expression with a count of 1 and a non-Copy element type.
fn main() {
- let _ = [box 1u, ..1];
+ let _ = [box 1u; 1];
}
const TUP: (uint,) = (43,);
fn main() {
- let a = [0i, ..STRUCT.field];
- let b = [0i, ..TUP.0];
+ let a = [0i; STRUCT.field];
+ let b = [0i; TUP.0];
assert!(a.len() == 42);
assert!(b.len() == 43);
--- /dev/null
+// Copyright 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 <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.
+
+fn main() {
+ let mut escaped = String::from_str("");
+ for c in '\u{10401}'.escape_unicode() {
+ escaped.push(c);
+ }
+ assert_eq!("\\u{10401}", escaped);
+}
-> Vec<Vec<square>> {
let mut input: &mut io::Reader = &mut input;
let mut grid = Vec::new();
- let mut line = [0, ..10];
+ let mut line = [0; 10];
input.read(&mut line);
let mut row = Vec::new();
for c in line.iter() {
use libc::{c_uint, uint32_t, c_void};
pub struct KEYGEN {
- hash_algorithm: [c_uint, ..2],
+ hash_algorithm: [c_uint; 2],
count: uint32_t,
salt: *const c_void,
salt_size: uint32_t,
// except according to those terms.
pub fn main() {
- let _foo = [0i, ..2*4];
+ let _foo = [0i; 2*4];
}
...should print &[1, 2, 3] but instead prints something like
&[4492532864, 24]. It is pretty evident that the compiler messed up
-with the representation of [int, ..n] and [int] somehow, or at least
+with the representation of [int; n] and [int] somehow, or at least
failed to typecheck correctly.
*/
#![feature(advanced_slice_patterns)]
-fn foo<T: Add<T, T> + Clone>([x, y, z]: [T, ..3]) -> (T, T, T) {
+fn foo<T: Add<T, T> + Clone>([x, y, z]: [T; 3]) -> (T, T, T) {
(x.clone(), x.clone() + y.clone(), x + y + z)
}
-fn bar(a: &'static str, b: &'static str) -> [&'static str, ..4] {
+fn bar(a: &'static str, b: &'static str) -> [&'static str; 4] {
[a, b, b, a]
}
// except according to those terms.
pub fn main() {
- const S: uint = 23 as uint; [0i, ..S]; ()
+ const S: uint = 23 as uint; [0i; S]; ()
}
);
fn main() {
- let _x: [u16, ..four!()];
+ let _x: [u16; four!()];
}
}
fn issue_13626() {
- const VAL: [u8, ..1] = [0];
+ const VAL: [u8; 1] = [0];
match [1] {
VAL => unreachable!(),
_ => ()
}
fn main() {
- let mut buf = [0_u8, .. 6];
+ let mut buf = [0_u8; 6];
{
let mut writer = buf.as_mut_slice();
}
fn main() {
- let x: [int, ..4] = [1,2,3,4];
+ let x: [int; 4] = [1,2,3,4];
let xptr = x.as_slice() as *const _;
xptr.foo();
}
// except according to those terms.
fn test1() {
- let mut ints = [0i, ..32];
+ let mut ints = [0i; 32];
ints[0] += 1;
assert_eq!(ints[0], 1);
}
fn test2() {
- let mut ints = [0i, ..32];
+ let mut ints = [0i; 32];
for i in ints.iter_mut() { *i += 22; }
for i in ints.iter() { assert!(*i == 22); }
}
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-static FOO: [int, ..3] = [1, 2, 3];
+static FOO: [int; 3] = [1, 2, 3];
pub fn main() {
println!("{} {} {}", FOO[0], FOO[1], FOO[2]);
// trying to get assert failure messages that at least identify which case
// failed.
-enum E<T> { Thing(int, T), Nothing((), ((), ()), [i8, ..0]) }
+enum E<T> { Thing(int, T), Nothing((), ((), ()), [i8; 0]) }
impl<T> E<T> {
fn is_none(&self) -> bool {
match *self {
check_fancy!($e: $T, |ptr| assert!(*ptr == $e));
}};
($e:expr: $T:ty, |$v:ident| $chk:expr) => {{
- assert!(E::Nothing::<$T>((), ((), ()), [23i8, ..0]).is_none());
+ assert!(E::Nothing::<$T>((), ((), ()), [23i8; 0]).is_none());
let e = $e;
let t_ = E::Thing::<$T>(23, e);
match t_.get_ref() {
use std::mem;
-enum E<T> { Thing(int, T), Nothing((), ((), ()), [i8, ..0]) }
+enum E<T> { Thing(int, T), Nothing((), ((), ()), [i8; 0]) }
struct S<T>(int, T);
// These are macros so we get useful assert messages.
// in ORDER matching up to when it ran.
// Correct order is: matched, inner, outer
-static mut ORDER: [uint, ..3] = [0, 0, 0];
+static mut ORDER: [uint; 3] = [0, 0, 0];
static mut INDEX: uint = 0;
struct A;
#[no_stack_check]
fn recurse() {
- let buf = [0i, ..10];
+ let buf = [0i; 10];
black_box(buf);
recurse();
}
#[no_stack_check]
fn recurse() {
- let buf = [0i, ..10];
+ let buf = [0i; 10];
black_box(buf);
recurse();
}
pub fn black_box<T>(dummy: T) { unsafe { asm!("" : : "r"(&dummy)) } }
fn silent_recurse() {
- let buf = [0i, ..1000];
+ let buf = [0i; 1000];
black_box(buf);
silent_recurse();
}
pub fn main() {
unsafe {
let s = S { a: 0xff_ff_ff_ffu32, b: 1, c: 0xaa_aa_aa_aa as i32 };
- let transd : [u8, .. 9] = mem::transmute(s);
+ let transd : [u8; 9] = mem::transmute(s);
// Don't worry about endianness, the numbers are palindromic.
assert!(transd ==
[0xff, 0xff, 0xff, 0xff,
let s = S { a: 1u8, b: 2u8, c: 0b10000001_10000001 as i16};
- let transd : [u8, .. 4] = mem::transmute(s);
+ let transd : [u8; 4] = mem::transmute(s);
// Again, no endianness problems.
assert!(transd ==
[1, 2, 0b10000001, 0b10000001]);
#[repr(packed)]
struct S4 {
a: u8,
- b: [u8, .. 3],
+ b: [u8; 3],
}
#[repr(packed)]
pub fn main() {
unsafe {
let s4 = S4 { a: 1, b: [2,3,4] };
- let transd : [u8, .. 4] = mem::transmute(s4);
+ let transd : [u8; 4] = mem::transmute(s4);
assert!(transd == [1, 2, 3, 4]);
let s5 = S5 { a: 1, b: 0xff_00_00_ff };
- let transd : [u8, .. 5] = mem::transmute(s5);
+ let transd : [u8; 5] = mem::transmute(s5);
// Don't worry about endianness, the u32 is palindromic.
assert!(transd == [1, 0xff, 0, 0, 0xff]);
}
#[repr(packed)]
struct S4 {
a: u8,
- b: [u8, .. 3],
+ b: [u8; 3],
}
#[repr(packed)]
impl Copy for Foo {}
pub fn main() {
- let foos = [Foo { bar: 1, baz: 2 }, .. 10];
+ let foos = [Foo { bar: 1, baz: 2 }; 10];
- assert_eq!(mem::size_of::<[Foo, .. 10]>(), 90);
+ assert_eq!(mem::size_of::<[Foo; 10]>(), 90);
for i in range(0u, 10) {
assert_eq!(foos[i], Foo { bar: 1, baz: 2});
use std::mem;
#[repr(packed)]
-struct S4(u8,[u8, .. 3]);
+struct S4(u8,[u8; 3]);
#[repr(packed)]
struct S5(u8,u32);
pub fn main() {
unsafe {
let s4 = S4(1, [2,3,4]);
- let transd : [u8, .. 4] = mem::transmute(s4);
+ let transd : [u8; 4] = mem::transmute(s4);
assert!(transd == [1, 2, 3, 4]);
let s5 = S5(1, 0xff_00_00_ff);
- let transd : [u8, .. 5] = mem::transmute(s5);
+ let transd : [u8; 5] = mem::transmute(s5);
// Don't worry about endianness, the u32 is palindromic.
assert!(transd == [1, 0xff, 0, 0, 0xff]);
}
use std::mem;
#[repr(packed)]
-struct S4(u8,[u8, .. 3]);
+struct S4(u8,[u8; 3]);
#[repr(packed)]
struct S5(u8, u32);
struct B {
v1: int,
- v2: [int, ..3],
+ v2: [int; 3],
v3: Vec<int> ,
v4: C,
v5: Box<C>,
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-static FOO: [int, ..4] = [32, ..4];
-static BAR: [int, ..4] = [32, 32, 32, 32];
+static FOO: [int; 4] = [32; 4];
+static BAR: [int; 4] = [32, 32, 32, 32];
pub fn main() {
assert!(FOO == BAR);
#![feature(slicing_syntax)]
pub fn main() {
- let x = [ [true], ..512 ];
- let y = [ 0i, ..1 ];
+ let x = [ [true]; 512 ];
+ let y = [ 0i; 1 ];
print!("[");
for xi in x.iter() {
--- /dev/null
+// Copyright 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 <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.
+
+// Test that we can use `Self` types in impls in the expected way.
+
+struct Foo;
+
+// Test uses on inherant impl.
+impl Foo {
+ fn foo(_x: Self, _y: &Self, _z: Box<Self>) -> Self {
+ Foo
+ }
+}
+
+// Test uses when implementing a trait and with a type parameter.
+pub struct Baz<X> {
+ pub f: X,
+}
+
+trait Bar<X> {
+ fn bar(x: Self, y: &Self, z: Box<Self>) -> Self;
+}
+
+impl Bar<int> for Box<Baz<int>> {
+ fn bar(_x: Self, _y: &Self, _z: Box<Self>) -> Self {
+ box Baz { f: 42 }
+ }
+}
+
+fn main() {
+ let _: Foo = Foo::foo(Foo, &Foo, box Foo);
+ let _: Box<Baz<int>> = Bar::bar(box Baz { f: 42 },
+ &box Baz { f: 42 },
+ box box Baz { f: 42 });
+}
pub fn main() {
unsafe {
let _x: Foo = mem::uninitialized();
- let _x: [Foo, ..2] = mem::uninitialized();
+ let _x: [Foo; 2] = mem::uninitialized();
}
}
unsafe {
struct Foo_<T> {
- f: [T, ..3]
+ f: [T; 3]
}
let data = box Foo_{f: [1i32, 2, 3] };
struct Baz_ {
f1: uint,
- f2: [u8, ..5],
+ f2: [u8; 5],
}
let data = box Baz_{ f1: 42, f2: ['a' as u8, 'b' as u8, 'c' as u8, 'd' as u8, 'e' as u8] };
}
unsafe fn check<T>(expected: &str, f: |*mut c_char| -> T) {
- let mut x = [0 as c_char, ..50];
+ let mut x = [0 as c_char; 50];
f(&mut x[0] as *mut c_char);
let res = CString::new(&x[0], false);
assert_eq!(expected, res.as_str().unwrap());
// except according to those terms.
pub fn main() {
- // Tests for indexing into box/& [T, ..n]
- let x: [int, ..3] = [1, 2, 3];
- let mut x: Box<[int, ..3]> = box x;
+ // Tests for indexing into box/& [T; n]
+ let x: [int; 3] = [1, 2, 3];
+ let mut x: Box<[int; 3]> = box x;
assert!(x[0] == 1);
assert!(x[1] == 2);
assert!(x[2] == 3);
assert!(x[1] == 45);
assert!(x[2] == 3);
- let mut x: [int, ..3] = [1, 2, 3];
- let x: &mut [int, ..3] = &mut x;
+ let mut x: [int; 3] = [1, 2, 3];
+ let x: &mut [int; 3] = &mut x;
assert!(x[0] == 1);
assert!(x[1] == 2);
assert!(x[2] == 3);
use std::mem::size_of;
pub fn main() {
- let x: [int, ..4] = [1, 2, 3, 4];
+ let x: [int; 4] = [1, 2, 3, 4];
assert_eq!(x[0], 1);
assert_eq!(x[1], 2);
assert_eq!(x[2], 3);
assert_eq!(x[3], 4);
- assert_eq!(size_of::<[u8, ..4]>(), 4u);
+ assert_eq!(size_of::<[u8; 4]>(), 4u);
// FIXME #10183
// FIXME #18069
//if cfg!(target_word_size = "64") {
- // assert_eq!(size_of::<[u8, ..(1 << 32)]>(), (1u << 32));
+ // assert_eq!(size_of::<[u8; (1 << 32)]>(), (1u << 32));
//}
}
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-pub fn main() { let _a = [0i, ..1 as uint]; }
+pub fn main() { let _a = [0i; 1 as uint]; }
const REPEATS: uint = 5;
const MAX_LEN: uint = 32;
-static drop_counts: [AtomicUint, .. MAX_LEN] =
+static drop_counts: [AtomicUint; MAX_LEN] =
// FIXME #5244: AtomicUint is not Copy.
[
INIT_ATOMIC_UINT, INIT_ATOMIC_UINT, INIT_ATOMIC_UINT, INIT_ATOMIC_UINT,