Alright, brace yourself for more stupid questions, Graydon. :)
On Thu, Dec 13, 2012 at 10:52 AM, Graydon Hoare wrote:
> On 12-12-13 12:17 AM, Tom Lee wrote:
>
> > It looks like the 'move' operations here are directly modifying the
> > contents of the vector by moving data around in the vector. T
On 12/17/12 6:27 PM, Michael Neumann wrote:
Am 18.12.2012 03:11, schrieb Patrick Walton:
* Use unsafe code by casting to an unsafe pointer and sending the
unsafe pointer over a channel; do this only as a last resort.
But don't I get into problems with GC when I do that? So I create the
data st
Am 18.12.2012 03:11, schrieb Patrick Walton:
On 12/17/12 6:03 PM, Michael Neumann wrote:
Hi,
We have a very huge immutable data structure that we want to share
(read-only) between many light-weight threads.
From what I have seen, I should use Arc. Is there any other way to
share the data betwe
On 12/17/12 6:03 PM, Michael Neumann wrote:
Hi,
We have a very huge immutable data structure that we want to share
(read-only) between many light-weight threads.
From what I have seen, I should use Arc. Is there any other way to
share the data between threads?
You can also:
* Use a reader-wr
Hi,
We have a very huge immutable data structure that we want to share
(read-only) between many light-weight threads.
From what I have seen, I should use Arc. Is there any other way to
share the data between threads?
And when using Arc, can I access the data in parallel by all threads?
Best r
Is it important for `traverse` to pass along an option type? Is it
important to inform end users that a key has been deleted? Or is that
implementation specific? If so, I suggest rewriting `traverse` to something
like this (assuming this actually works):
impl RBMap: iter::BaseIter<(&K, &V)> {
On 12-12-17 11:28 AM, Graydon Hoare wrote:
> On 12-12-14 03:51 PM, Steve Jenson wrote:
>> I recently ported Matt Might's Scala port of Okasaki's purely functional
>> red-black tree to Rust and am looking for some feedback.
>>
>> https://github.com/stevej/rustled/blob/master/red_black_tree.rs
>>
>>
On 12-12-14 03:51 PM, Steve Jenson wrote:
> I recently ported Matt Might's Scala port of Okasaki's purely functional
> red-black tree to Rust and am looking for some feedback.
>
> https://github.com/stevej/rustled/blob/master/red_black_tree.rs
>
> I've written this for 0.4 and will update it with
On 12/17/2012 04:42 PM, Patrick Walton wrote:
> Try returning a reference from find() instead. It's warning you that
> find() is copying out the data (since it returns V and not &V).
I read up on borrowed pointers and made find() return &self/V. After
turning this:
impl LinearMap: Map {
into thi
On 12/17/2012 04:42 PM, Patrick Walton wrote:
> On 12/17/12 6:42 AM, Tim Taubert wrote:
>> Is there anything I can do about this other than using managed boxes? I
>> really don't want to force people to use GC.
>
> Try returning a reference from find() instead. It's warning you that
> find() is co
On 12/17/12 6:42 AM, Tim Taubert wrote:
Is there anything I can do about this other than using managed boxes? I
really don't want to force people to use GC.
Try returning a reference from find() instead. It's warning you that
find() is copying out the data (since it returns V and not &V).
In
I'm trying to create simple hash map with an interface like this:
trait Map {
fn find(&const self, k: &K) -> Option;
fn insert(&mut self, k: K, +v: V);
fn remove(&mut self, k: &K);
}
The implementation itself is subject to change and I'll experiment with
that a bit. I copied some of the par
12 matches
Mail list logo
