meant to do.
On Sat, Dec 7, 2013 at 12:10 AM, David Piepgrass qwertie...@gmail.comwrote:
Rust newb here. I have theoretical questions.
Recently I noticed that Higher-Kinded Types (HKTs) have been mentioned on
the mailing list a lot, but I had no idea what a HKT was, or what it might
be good
Rust newb here. I have theoretical questions.
Recently I noticed that Higher-Kinded Types (HKTs) have been mentioned on
the mailing list a lot, but I had no idea what a HKT was, or what it might
be good for. After reading about them a little, they reminded me of C++'s
template template
My next goal is a persistent tree-map, probably cribbing from Haskell's
Data.Map.
I look forward to hearing how that goes!
I've been meaning to make a data structure in Rust too, but it's hard to
find the time, so how's about I tell you guys about it instead.
I call my data structure an
Please disregard this message; I hadn't seen Bill Myers' solution
(copy-on-write
by cloning only when reference count 1), which sounds like it's probably
perfect for Rust.
On Wed, Dec 4, 2013 at 9:03 PM, David Piepgrass qwertie...@gmail.comwrote:
My next goal is a persistent tree-map
David Piepgrass qwertie...@gmail.com wrote:
Okay, well, I've never liked mailing lists at all, because:
1. In non-digest mode, My inbox gets flooded.
2. In digest mode, it's quite inconvenient to write a reply, having to
cut out all the messages that I don't want to reply
Hey, why not set up a Discourse forum? That would be so. much. better. than
a mailing list. As an OSS dev I've been itching to get one myself, but
don't have time or much money to set it up. For Mozilla, though? No problem
I'm sure.
http://www.discourse.org/
Google: discourse hosting.
On 02/12/2013 16:21, David Piepgrass wrote:
That would be so. much. better. than a mailing list.
Hi. Could you expand on this? I don?t necessarily disagree, but as the
one proposing change it?s up to you to convince everyone else :)
--
Simon Sapin
Okay, well, I've never liked mailing
I'm wondering something. Have the Rust developers considered the
possibility of using references instead of pointers? It seems to me
that this would eliminate a lot of the need for autoderef. Now I'm
not well-equipped to talk about Rust (some of the rules I am totally
ignorant about, e.g. I know
Personally I'd appreciate a type system that's able to express SI units,
which C++ and Haskell are powerful enough to do[1].
I agree. This is of huge importance when it comes to providing compile
time safety guarantees. And if the language is powerful enough to express
SI units, then it also
Segmented stacks aren't the only solution though.
If the concern is many tasks that block for a long time, I imagine a
mechanism to bundle a bunch of small, dormant stacks into a single page so
that the original pages could be released to the OS.
If stacks were additionally relocatable (which
Mozilla is going to hire another engineer to work on Rust! As we head
toward Rust 1.0 we are looking for a motivated individual with serious
chops to help us grind through the remaining blocking bugs. Enthusiasm
for Servo will also be looked upon with great favor. See all the gory
details
This is meant as a followup to an earlier thread[1] on the subject and
the
related ticket[2].
[1]: http://thread.gmane.org/gmane.comp.lang.rust.devel/2622/
[2]: https://github.com/mozilla/rust/issues/6974
The idea in those earlier discussions is that methods could also be
called
* Use postfix syntax for pointer dereference, like in Pascal:
(~rect).area() becomes rect~.area() . That reads left-to-right
with nary a precedence mistake.
While Rust?s auto-dereference feature and type checker will
sometimes catch that mistake, it's better to just
On Wed, Aug 28, 2013 at 11:19 AM, David Piepgrass qwertie...@gmail.comwrote:
From: Bill Myers bill_my...@outlook.com
I was reading a proposal about adding datasort refinements to make enum
variants first-class types, and it seems to me there is a simpler and more
effective way of solving
From: Bill Myers bill_my...@outlook.com
I was reading a proposal about adding datasort refinements to make enum
variants first-class types, and it seems to me there is a simpler and more
effective way of solving the problem.
The idea is that if A, B and C are types, then A | B | C is a
I think at the least we should offer a #[deriving(Basics)] for use on
public
types so that people aren't forced to memorize Eq Ord TotalOrd TotalEq
IterBytes Clone (unless we can find a silly SFINAE-esque acronym...
http://www.wordsmith.org/anagram/anagram.cgi?anagram=eottic ).
Plenty
It might be worth looking into how .NET or other platforms with similar
architecture accomplish this, if at all.
The C# compiler has a switch that converts C# XML doc comments into an XML
file, which is placed in the output folder beside the .DLL or .EXE file.
This starting point makes a lot of
This requires arbitrary lookahead to disambiguate from tuples.
This bit in particular. Really really don't want to cross the bridge to
arbitrary lookahead in the grammar.
Pardon me, but I'm not convinced that there is a problem in lambdas
like (x, y) - (x + y). By analogy, you can realize
18 matches
Mail list logo
