- 20 5月, 2013 2 次提交
-
-
由 Steve Klabnik 提交于
Thanks @catamorphism!
-
由 Steve Klabnik 提交于
Let's actually give a top-level description of what's in here, eh?
-
- 19 5月, 2013 22 次提交
-
-
由 bors 提交于
I don't have a strong opinion on the function vs. method, but there's no point in having both. I'd like to make a `repeat` adaptor like Python/Haskell for turning a value into an infinite stream of the value, so this has to at least be renamed.
-
由 bors 提交于
-
由 Corey Richardson 提交于
-
由 bors 提交于
-
由 Huon Wilson 提交于
-
由 bors 提交于
-
由 bors 提交于
I don't see a reason to encode this information in all the `extern mod` statements, it's not a precise enough version to actually provide any sort of robustness.
-
由 Daniel Micay 提交于
-
由 bors 提交于
-
由 Daniel Micay 提交于
-
由 Daniel Micay 提交于
-
由 bors 提交于
r? This is all of my scheduler work on #4419 from the last 3 weeks or so. I've had a few failed pull requests so far but I think the problems are ironed out. * TCP * The beginnings of runtime embedding APIs * Porting various corners of core to be compatible with both schedulers * libuv timer bindings * Further refinement of I/O error handling, including a new, incomplete, `read_error` condition * Incomplete refactoring to make tasks work without coroutines and user-space scheduling * Implementations of Reader/Writer extension methods * Implementations of the most important part of core::comm I'm particularly happy with how easy the [comm types on top of the scheduler](https://github.com/brson/rust/blob/io-upstream/src/libcore/rt/comm.rs). Note that these implementations do not use pipes. If anything here needs careful review though it's this code. This branch passes 95% of the run-pass tests (with `TESTARGS=--newrt`) In the next week I'll probably spend some time adding preliminary multithreading and seeing how close we are to removing the old runtime.
-
由 bors 提交于
-
由 Brian Anderson 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
Make n{0..11} methods return cloned values, and create n{0..12}_ref methods for returning references
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
-
- 18 5月, 2013 16 次提交
-
-
由 bors 提交于
* The example given in future.rs was corrected. * I have added a small section describing futures in tutorial on tasks. It is far from being complete as I am stil learning ! (This is an updated version of PR 6537).
-
由 bors 提交于
This commit implements element getters for tuples with an arity of 2 to 12. The getters return references to the elements, so no copying occurs. The traits are re-exported in `core::prelude` so you can use them from regular Rust code. Here is an example of one of the getters in use: ~~~rust assert_eq!((2, "hi", 75.0).n1(), &"hi"); ~~~
-
由 Brendan Zabarauskas 提交于
-
由 Olivier Saut 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Brendan Zabarauskas 提交于
-
由 Daniel Micay 提交于
-
由 Daniel Micay 提交于
-
由 Daniel Micay 提交于
-
由 Daniel Micay 提交于
-
由 Daniel Micay 提交于
There isn't a way to take the length of any iterator, so failing on a zero length would make these much less useful.
-
由 Daniel Micay 提交于
it's the same as `next.unwrap()`, but there's no way to check the length of an iterator so this isn't a good pattern
-
由 bors 提交于
-
由 Brendan Zabarauskas 提交于
-