On 06/05/2013 06:22 PM, Brian Anderson wrote:
On 06/05/2013 05:37 PM, Erick Tryzelaar wrote:
Hey folks!
I've made a reservation for 20 people at Tied House in Mountain View
next Wednesday, June 12th, at 7pm:
This sounds pretty great; you can count me in.
Jeaye
If only this weren't during WWDC.
I hope we can have another meetup sometime in the near future (perhaps
in SF?) that doesn't conflict with a large conference.
-Kevin
On Wed, Jun 5, 2013 at 7:00 PM, Brian Smith br...@linuxfood.net wrote:
Awesome! Looking forward to it.
On Jun 5, 2013 6:22
Yeah, I realized that after I made the reservation. Unfortunately there was
WWDC next week, and PLDI the week after. This is just the first of many
meet ups :) The next one I organize should be early to mid July, unless
someone else wants to plan another event earlier.
On Thursday, June 6, 2013,
On Sat, May 18, 2013 at 2:24 PM, Gábor Lehel illiss...@gmail.com wrote:
On Thu, May 16, 2013 at 7:58 PM, Graydon Hoare gray...@mozilla.comwrote:
I'm sympathetic to the desire here, as with all attempts to get
exceptions right. Sadly I've never really seen it; I don't think anyone
has
On Thu, Jun 6, 2013 at 11:59 AM, Gábor Lehel illiss...@gmail.com wrote:
Am I way off base with this? An embarrassing misconception? To summarize my
train of thought
* Catchable exceptions can be implemented
* But we don't want to, because it would force everyone to think about
exception
On Thu, Jun 6, 2013 at 12:44 PM, Abhijeet Gaiha
abhijeet.ga...@gmail.com wrote:
This suggests that any data allocated in C libs (including statics) is
basically part of a global address space available to all tasks in a Rust
program. Is that correct?
Is there as equivalent of malloc() for Rust
On 06/06/2013 8:59 AM, Gábor Lehel wrote:
Am I way off base with this? An embarrassing misconception? To summarize
my train of thought
* Catchable exceptions can be implemented
* But we don't want to, because it would force everyone to think about
exception safety
* That could however be
On 05/06/2013 9:15 PM, Patrick Walton wrote:
On 6/5/13 9:09 PM, Daniel Micay wrote:
I think extending the built-in `for` loop to work with external iterators
should be considered, because right now the verbosity discourages
using them
and makes borrow checking more painful than it has to be.
On Thu, Jun 6, 2013 at 4:13 PM, Daniel Micay danielmi...@gmail.com wrote:
On Thu, Jun 6, 2013 at 6:19 PM, Vadim vadi...@gmail.com wrote:
Based on my experience with iterators in other languages, I would like
throw
in the following idea:
pub trait BlockyIteratorA {
///
On Thu, Jun 6, 2013 at 6:19 PM, Vadim vadi...@gmail.com wrote:
Based on my experience with iterators in other languages, I would like throw
in the following idea:
pub trait BlockyIteratorA {
/// Advance the iterator and return the next block of values.
Return empty vector when the
On Wed, Jun 5, 2013 at 9:09 PM, Daniel Micay danielmi...@gmail.com wrote:
All kinds of external iterators implement the following trait, whether
they are
a fibonacci number generator, a reverse iterator over a vector or iterator
over
a range in a sorted set:
pub trait IteratorA {
Date: Thu, 16 May 2013 10:58:28 -0700
From: gray...@mozilla.com
To: bill_my...@outlook.com
CC: rust-dev@mozilla.org
Subject: Re: [rust-dev] Adding exception handling as syntax sugar with
declared exceptions
On 12/05/2013 8:00 PM, Bill Myers wrote:
This is a suggestion for adding an
Scala has a similar design, with the following traits:
- TraversableOnce: can be internally iterated once (has a foreach() method that
takes a closure)
- Traversable: can be internally iterated unlimited times (has a foreach()
method that takes a closure)
- Iterable: can be externally iterated
On Thu, Jun 6, 2013 at 7:22 PM, Bill Myers bill_my...@outlook.com wrote:
Scala has a similar design, with the following traits:
- TraversableOnce: can be internally iterated once (has a foreach() method
that takes a closure)
- Traversable: can be internally iterated unlimited times (has a
On Thu, Jun 6, 2013 at 11:01 PM, Sebastian Sylvan
sebastian.syl...@gmail.com wrote:
On Thu, Jun 6, 2013 at 7:22 PM, Bill Myers bill_my...@outlook.com wrote:
Scala has a similar design, with the following traits:
- TraversableOnce: can be internally iterated once (has a foreach() method
that
Hello all,
As of 5d2cadb, the default allocator used in the runtime on all
platforms is now jemalloc. This provides significant allocation
speedup on Windows and Mac, and good speedup on Linux. Additionally,
memory usage should be lower and (untested) less fragmented. There are
some numbers on
Reference counting is generally more desirable than garbage collection, since
it is simple and deterministic, and avoids scanning the whole heap of the
program, which causes pauses, destroys caches, prevents effective swapping and
requires to tolerate increasing memory usage by a multiplicative
Hi all,
I'm currently working on slides for a Rust tutorial, that I'm going to
be presenting at Open Source Bridge in Portland in two weeks. I wanted
the tutorial to be driven by examples from real code, but I've had a
hard time finding examples that are both relevant, and self-contained
enough
On 06/06/2013 09:21 PM, Tim Chevalier wrote:
Hi all,
I'm currently working on slides for a Rust tutorial, that I'm going to
be presenting at Open Source Bridge in Portland in two weeks.
Tim,
Not entirely sure if these are what you want, but bjz's glfw-rs repo has
some basic examples of
On Fri, Jun 7, 2013 at 12:21 AM, Tim Chevalier catamorph...@gmail.com wrote:
Hi all,
I'm currently working on slides for a Rust tutorial, that I'm going to
be presenting at Open Source Bridge in Portland in two weeks. I wanted
the tutorial to be driven by examples from real code, but I've had
The linked article contrasts them with the GoF-style iterators as well.
The Rust Iterator trait is similar to the one pass ranges (and possibly
forward ranges), but not double-ended ranges or random-access ranges. It's
the *family* of range-based iterators that makes it flexible (e.g. allowing
On Fri, Jun 7, 2013 at 12:58 AM, Sebastian Sylvan
sebastian.syl...@gmail.com wrote:
The linked article contrasts them with the GoF-style iterators as well.
The Rust Iterator trait is similar to the one pass ranges (and possibly
forward ranges), but not double-ended ranges or random-access
On Fri, Jun 7, 2013 at 12:03 AM, Bill Myers bill_my...@outlook.com wrote:
Reference counting is generally more desirable than garbage collection,
since it is simple and deterministic, and avoids scanning the whole heap of
the program, which causes pauses, destroys caches, prevents effective
23 matches
Mail list logo
