On 3/31/2011 7:15 PM, Andrej Mitrovic wrote:
*When I say tutorials I don't mean tutorials on the language itself.
But a tutorial on how to create some type of software by using D.
Yes to both.
I just quickly wrote this up describing an idea I had earlier
today on combining rest api calls (example: foo(bar(10)) should be
just one call to the server) on a little forum I post to:
http://www.sveit.com/forum/viewtopic.php?f=11t=3364
It's not really D specific, but I used D as my language
On Fri, 01 Apr 2011 02:02:38 +0300, teo teo.ubu...@yahoo.com wrote:
1. all observers must be disconnected from the event before destroying
them
I think this is the only correct solution, especially given that the
delete keyword is going away.
--
Best regards,
Vladimir
On 2011-03-29 14:06, Jacob Carlborg wrote:
I've made a few minor changes:
* Renamed EmailStatusCode.Off - None and On - Any
* Added and clarified the documentation for EmailStatusCode.Any and None
* Updated the documentation
Github: https://github.com/jacob-carlborg/phobos/tree/isemail
On 31/03/2011 18:37, Jonathan M Davis wrote:
On 2011-03-31 06:35, Kagamin wrote:
Ary Manzana Wrote:
I just hate it when you have to write too much
hasMember!(S, m)
is only 1 character longer than
S::hasMember(m)
not too much for me
And hasMember!(S, m) is actually consistent with the rest
On Fri, 01 Apr 2011 00:39:42 -0400, Ian Bishop bisho...@gmail.com wrote:
What about the stuff over at
http://www.dsource.org/projects/dcollections? It's licensed under
Boost,
I haven't looked at it too hard but it seems like some of this stuff
would be a good fit for the
std.container. Is
On 31/03/2011 18:30, Piotr Szturmaj wrote:
Andrei Alexandrescu wrote:
4. Database API
This is a high impact item. I'd need to collect more information about
the specifics of the application before creating an opinion about its
chances of success. I see Piotr and others have some related ideas;
Piotr Szturmaj:
I think the end goal of a database module for Phobos should be to
have native D clients for the more popular (R)DMBSs.
Isn't both a large undertaking as well as difficult to keep in sync
with the reference implementations? I think wrapping the c libs would
make everything less
On 01/04/2011 14:43, simendsjo wrote:
Piotr Szturmaj:
I think the end goal of a database module for Phobos should be to
have native D clients for the more popular (R)DMBSs.
Isn't both a large undertaking as well as difficult to keep in sync
with the reference implementations? I think wrapping
Christian Manning wrote:
On 31/03/2011 18:30, Piotr Szturmaj wrote:
Andrei Alexandrescu wrote:
4. Database API
This is a high impact item. I'd need to collect more information about
the specifics of the application before creating an opinion about its
chances of success. I see Piotr and
simendsjo wrote:
Piotr Szturmaj:
I think the end goal of a database module for Phobos should be to
have native D clients for the more popular (R)DMBSs.
Isn't both a large undertaking as well as difficult to keep in sync
with the reference implementations? I think wrapping the c libs would
make
Ok, my proposal is up, I'm looking forward to feedback.
*fingers crossed*
(Cristi Cobzarenco)
Pofile: http://www.google.com/profiles/cristi.cobzarenco
On 30 March 2011 17:03, Cristi Cobzarenco cristi.cobzare...@gmail.comwrote:
Hmmm, the only problem with this is that we would have to require
2011/3/31 Jonas Drewsen jdrew...@nospam.com:
On 31/03/11 21.19, Torarin wrote:
I'm currently working on an http and networking library that uses
asynchronous sockets running in fibers and an event loop a la libev.
These async sockets have the same interface as regular Berkeley
sockets, so
On Mar 31, 2011, at 4:03 PM, dsimcha wrote:
== Quote from Sean Kelly (s...@invisibleduck.org)'s article
On Mar 31, 2011, at 11:48 AM, dsimcha wrote:
== Quote from Andrej Mitrovic (andrej.mitrov...@gmail.com)'s
article
Are fibers really better/faster than threads? I've heard rumors that
they
== Quote from Sean Kelly (s...@invisibleduck.org)'s article
On Mar 31, 2011, at 4:03 PM, dsimcha wrote:
== Quote from Sean Kelly (s...@invisibleduck.org)'s article
On Mar 31, 2011, at 11:48 AM, dsimcha wrote:
== Quote from Andrej Mitrovic (andrej.mitrov...@gmail.com)'s
article
Are
On Apr 1, 2011, at 7:49 AM, Jonas Drewsen wrote:
On 01/04/11 01.07, dsimcha wrote:
Again forgive my naiveness, as most of my experience with concurrency is
concurrency to implement parallelism, not concurrency for its own sake.
Shouldn't
32,000 threads be more than enough for
On 01/04/11 01.07, dsimcha wrote:
== Quote from Jonas Drewsen (jdrew...@nospam.com)'s article
On 31/03/11 23.20, Max Klyga wrote:
On 2011-03-31 22:35:43 +0300, Jonas Drewsen said:
On 31/03/11 18.26, Andrei Alexandrescu wrote:
snip
I believe that we would need both the threaded async IO
hi,
who are the project mentors for gsoc2011??
i want to discuss the image processing in D idea from the WIKI4D gsoc 2011
ideas list.
--
aman bansal
namaban...@gmail.com
usit.a...@aol.in
== Quote from Sean Kelly (s...@invisibleduck.org)'s article
On Apr 1, 2011, at 7:49 AM, Jonas Drewsen wrote:
On 01/04/11 01.07, dsimcha wrote:
Again forgive my naiveness, as most of my experience with concurrency
is
concurrency to implement parallelism, not concurrency for its own
On 31/03/11 18.43, dsimcha wrote:
== Quote from Andrei Alexandrescu (seewebsiteforem...@erdani.org)'s article
On 3/31/11 6:35 AM, Max Klyga wrote:
I've been thinking on things I can change in my GSoC proposal to make it
stronger and noticed that currently Phobos does not address asynchronous
On Apr 1, 2011, at 8:47 AM, dsimcha wrote:
== Quote from Sean Kelly (s...@invisibleduck.org)'s article
It's more an issue of creating an understandable programming model. If
someone is using statics, the result should be the same regardless of
whether the code gets a dedicated thread or is
Fawzi Mohamed from Humboldt University has been accepted as a mentor for
the Google Summer of Code 2011 program for Digital Mars. He is
particularly interested in topics related to concurrency, parallelism,
and garbage collection.
Please join me in congratulating and wishing the best to
On 4/1/11 8:29 AM, aman bansal wrote:
hi,
who are the project mentors for gsoc2011??
i want to discuss the image processing in D idea from the WIKI4D gsoc
2011 ideas list.
--
aman bansal
namaban...@gmail.com mailto:namaban...@gmail.com
usit.a...@aol.in mailto:usit.a...@aol.in
Refer to
On 4/1/2011 10:29 AM, Andrei Alexandrescu wrote:
Fawzi Mohamed from Humboldt University has been accepted as a mentor for the
Google Summer of Code 2011 program for Digital Mars. He is particularly
interested in topics related to concurrency, parallelism, and garbage
collection.
Great!
On 18/03/2011 18:42, Russel Winder wrote:
On Fri, 2011-03-18 at 10:41 -0400, Jesse Phillips wrote:
[ . . . ]
Otherwise I would be for using the native packaging system, but it
isn't easy for the contributor, the maintainer of the server, or the
one building a system that works with all of them.
On 19/03/2011 14:36, Jacob Carlborg wrote:
On 2011-03-18 18:04, Chris Manning wrote:
On 17/03/2011 22:49, Jason E. Aten wrote:
Somewhat tongue in cheek, we could call it dabal.
As in, get on dabal! :-)
If D gets accepted for Google Summer of Code, I think this would be a
great idea for a
I'm posting this mail for the third time. The earlier posted ones are not yet
displayed in the mailing list :s. So I had to take all the burden to re-type the
things
Sorry for being idle in the last few days. But I really needed time to get deep
in
to D and learn about advanced concepts( such
On 22/03/2011 23:41, Jonas Drewsen wrote:
Hi,
It seems that every now and then a discussion about build tools or D
package management pops up in this group. Many people on this list have
a huge amount of experience and knowledge in this area. Some has even
created their own tools for D.
This may be belated, but I'm thinking of applying for mentoring a garbage
collection project for GSoC 2011. I think GC quality of implementation is one
of D's biggest weaknesses and one of the areas I know most about.
I can't seem to find information about time commitments in the GSoC FAQ or how
On 28/03/2011 20:19, Walter Bright wrote:
On 3/28/2011 12:18 PM, dsimcha wrote:
== Quote from Walter Bright (newshou...@digitalmars.com)'s article
A further issue with the review process is that the bulk of people
won't look at
something until it is actually released. I think the only way to
Alix Pexton wrote:
On 31/03/2011 18:37, Jonathan M Davis wrote:
On 2011-03-31 06:35, Kagamin wrote:
Ary Manzana Wrote:
I just hate it when you have to write too much
hasMember!(S, m)
is only 1 character longer than
S::hasMember(m)
not too much for me
And hasMember!(S, m) is actually
On Fri, Apr 1, 2011 at 1:13 PM, Walter Bright
newshou...@digitalmars.com wrote:
On 4/1/2011 10:29 AM, Andrei Alexandrescu wrote:
Fawzi Mohamed from Humboldt University has been accepted as a mentor for
the
Google Summer of Code 2011 program for Digital Mars. He is particularly
interested in
On Fri, 01 Apr 2011 14:44:36 -0400, Ishan Thilina ishanthil...@gmail.com
wrote:
Also I tried to implement a Queue(which is not available in
DCollections) using my
novice D knowledge. But I get two compiler errors when using it. Can
some help me
to sort out the mess?
The std.container
== Quote from Caligo (iteronve...@gmail.com)'s article
Congrats, Fawzi and every one who has been accepted as a mentor.
BTW, I live in Texas, and I just got back from Texas AM where I was
meeting a friend. I also had a chance to meet up with Bjarne
Stroustrup because I wanted to give him a
On Fri, 01 Apr 2011 11:38:14 +0300, Vladimir Panteleev wrote:
On Fri, 01 Apr 2011 02:02:38 +0300, teo teo.ubu...@yahoo.com wrote:
1. all observers must be disconnected from the event before
destroying
them
I think this is the only correct solution, especially given that the
delete
On 4/1/11, dsimcha dsim...@yahoo.com wrote:
== Quote from Caligo (iteronve...@gmail.com)'s article
Congrats, Fawzi and every one who has been accepted as a mentor.
BTW, I live in Texas, and I just got back from Texas AM where I was
meeting a friend. I also had a chance to meet up with Bjarne
== Quote from Andrej Mitrovic (andrej.mitrov...@gmail.com)'s article
On 4/1/11, dsimcha dsim...@yahoo.com wrote:
== Quote from Caligo (iteronve...@gmail.com)'s article
Congrats, Fawzi and every one who has been accepted as a mentor.
BTW, I live in Texas, and I just got back from Texas AM
So, here it is :)
Code:
http://github.com/pszturmaj/ddb
Documentation:
http://pszturmaj.github.com/ddb/db.html
http://pszturmaj.github.com/ddb/postgres.html
Some things are unfinished yet.
Hi Russel. (BTW, I was the guy a few weeks ago at the London Java
Community Meetup pub meet that Barry Cranford mentioned in an SMS. Sorry
you couldn't make it, maybe next time. :p )
On 18/03/2011 08:52, Russel Winder wrote:
Note that every language-specific package manager conflicts
On 01/04/11 17.21, Sean Kelly wrote:
On Apr 1, 2011, at 7:49 AM, Jonas Drewsen wrote:
On 01/04/11 01.07, dsimcha wrote:
Again forgive my naiveness, as most of my experience with concurrency is
concurrency to implement parallelism, not concurrency for its own sake.
Shouldn't
32,000
On 01/04/11 20.44, Caligo wrote:
On Fri, Apr 1, 2011 at 1:13 PM, Walter Bright
newshou...@digitalmars.com wrote:
On 4/1/2011 10:29 AM, Andrei Alexandrescu wrote:
Fawzi Mohamed from Humboldt University has been accepted as a mentor for
the
Google Summer of Code 2011 program for Digital Mars.
On 01/04/11 20.53, Bruno Medeiros wrote:
On 22/03/2011 23:41, Jonas Drewsen wrote:
Hi,
It seems that every now and then a discussion about build tools or D
package management pops up in this group. Many people on this list have
a huge amount of experience and knowledge in this area. Some has
On Fri, 1 Apr 2011, Sean Kelly wrote:
On Apr 1, 2011, at 12:59 PM, Jonas Drewsen wrote:
On 01/04/11 17.21, Sean Kelly wrote:
On Apr 1, 2011, at 7:49 AM, Jonas Drewsen wrote:
There doesn't have to be a thread for each socket. Actually many servers
have very few threads with many
On 01/04/11 18.12, dsimcha wrote:
== Quote from Sean Kelly (s...@invisibleduck.org)'s article
On Apr 1, 2011, at 7:49 AM, Jonas Drewsen wrote:
On 01/04/11 01.07, dsimcha wrote:
Again forgive my naiveness, as most of my experience with concurrency
is
concurrency to implement parallelism,
Sean Kelly wrote:
Fair enough. Though I'd still say it's a terrible use of resources,
given available asynchronous socket APIs. And as an aside,
I think 32K sockets per process is not at all surprising.
I've seen apps that use orders of magnitude more than that, though
breaking the 64K
== Quote from Brad Roberts (bra...@puremagic.com)'s article
I've got an app that regularly runs with hundreds of thousands of
connections (though most of them are mostly idle). I haven't seen it
break 1M yet, but the only thing stopping it is file descriptor limits and
memory. It runs a very
On Apr 1, 2011, at 12:59 PM, Jonas Drewsen wrote:
On 01/04/11 17.21, Sean Kelly wrote:
On Apr 1, 2011, at 7:49 AM, Jonas Drewsen wrote:
There doesn't have to be a thread for each socket. Actually many servers
have very few threads with many sockets each. 32000 sockets is not
dsimcha wrote:
This may be belated, but I'm thinking of applying for mentoring a garbage
collection project for GSoC 2011. I think GC quality of implementation is one
of D's biggest weaknesses and one of the areas I know most about.
I can't seem to find information about time commitments in
Thanks Andrei, I'm back in my home country :)
Does somebody has any other constructive critique on my proposal?
I think I have polished the points that Bruno brought up, maybe the
timeline should be adjusted.
Any suggestions?
Thank you very much
Luca Boasso
On 3/31/11, Andrei Alexandrescu
Since my proposal theme shifted a little towards asyncronicity, I've
been eagerly consuming information that might help me with this.
I would be glad to know if I am moving in to the right direction.
Comments are welcome.
So far, here is the status report:
I looked at approaches to
On Apr 1, 2011, at 1:43 PM, Piotr Szturmaj wrote:
Sean Kelly wrote:
Fair enough. Though I'd still say it's a terrible use of resources,
given available asynchronous socket APIs. And as an aside,
I think 32K sockets per process is not at all surprising.
I've seen apps that use orders of
On Apr 1, 2011, at 2:24 PM, dsimcha wrote:
== Quote from Brad Roberts (bra...@puremagic.com)'s article
I've got an app that regularly runs with hundreds of thousands of
connections (though most of them are mostly idle). I haven't seen it
break 1M yet, but the only thing stopping it is file
On 4/1/2011 7:27 PM, Sean Kelly wrote:
On Apr 1, 2011, at 2:24 PM, dsimcha wrote:
== Quote from Brad Roberts (bra...@puremagic.com)'s article
I've got an app that regularly runs with hundreds of thousands of
connections (though most of them are mostly idle). I haven't seen it
break 1M yet,
On Fri, 1 Apr 2011, dsimcha wrote:
On 4/1/2011 7:27 PM, Sean Kelly wrote:
On Apr 1, 2011, at 2:24 PM, dsimcha wrote:
== Quote from Brad Roberts (bra...@puremagic.com)'s article
I've got an app that regularly runs with hundreds of thousands of
connections (though most of them are
Mind you that Async IO is different from Non-blocking IO (which is
what most literature talks about). I am not an expert with Async IO
but it has serious limitations in Windows like the kernel thread that
starts the IO must complete it. Not very familiar with the state of
AIO in Linux.
Good luck.
That all sounds good. I would add Flash to your investigation:
http://www.cs.princeton.edu/~vivek/flash/. There is a must read
research paper for any distributed system person at:
http://www.cs.princeton.edu/~vivek/flash_usenix_99/
On Fri, Apr 1, 2011 at 8:17 PM, Max Klyga max.kl...@gmail.com
The file you attached does not work, gzip says the file end prematurely.
I tried to upload that file three times. In the first two times plainly as the
container.d file, and it didn't work( the mail isn't shown on the mailing list).
Next I tried to upload the tar.gz file and it worked( also that
sir,
i have refered the announce list archive for march but could not find the
person mentoring projects related to the image processing ideas.
please help.
--
aman bansal
namaban...@gmail.com
usit.a...@aol.in
On 3/31/11 11:18 PM, Andrej Mitrovic wrote:
Actually, this still suffers from the problem when the returned char*
doesn't have a null terminator. It really sucks when C code does that,
and I've just experienced that. There is a solution though:
In those cases, doesn't the function return the
On Mon, 28 Mar 2011 17:54:29 +0100, bearophile bearophileh...@lycps.com
wrote:
Steven Schveighoffer:
So essentially, you are getting the same thing, but using [] is slower.
It seems I was right then, thank you and Kagamin for the answers.
This may be slightly OT but I just wanted to raise
Regan Heath:
conceptually it's nice to be able to express (exists but is empty) and
(does not exist).
You may want to express that, but for the implementation of the language those
two situations are the same, because in the [] literal the ptr is null. So I
think it's better for the
2011/4/1 Regan Heath re...@netmail.co.nz:
On Mon, 28 Mar 2011 17:54:29 +0100, bearophile bearophileh...@lycps.com
wrote:
Steven Schveighoffer:
So essentially, you are getting the same thing, but using [] is slower.
It seems I was right then, thank you and Kagamin for the answers.
This
On 04/01/2011 12:38 PM, Regan Heath wrote:
On Mon, 28 Mar 2011 17:54:29 +0100, bearophile bearophileh...@lycps.com wrote:
Steven Schveighoffer:
So essentially, you are getting the same thing, but using [] is slower.
It seems I was right then, thank you and Kagamin for the answers.
This
I managed to get the file, and even compile it, but apparently the type Ticks
doesn't exists any more, it is now (DMD2.052)
TickDuration, with methods TickDuration.seconds (msecs, hnsecs, ...).
on my computer, it does not generate slower code without the writeln than with.
( .38-.39 secs with,
On Fri, 01 Apr 2011 06:38:56 -0400, Regan Heath re...@netmail.co.nz
wrote:
On Mon, 28 Mar 2011 17:54:29 +0100, bearophile
bearophileh...@lycps.com wrote:
Steven Schveighoffer:
So essentially, you are getting the same thing, but using [] is slower.
It seems I was right then, thank you
On Fri, 01 Apr 2011 13:38:45 +0100, Steven Schveighoffer
schvei...@yahoo.com wrote:
On Fri, 01 Apr 2011 06:38:56 -0400, Regan Heath re...@netmail.co.nz
wrote:
On Mon, 28 Mar 2011 17:54:29 +0100, bearophile
bearophileh...@lycps.com wrote:
Steven Schveighoffer:
So essentially, you are
On 4/1/11, Jacob Carlborg d...@me.com wrote:
In those cases, doesn't the function return the length of the filled
data or something like that?
I know what you mean. I would expect a C function to do just that, but
in this case it does not. Its lame but I have to deal with it.
On Fri, 01 Apr 2011 11:52:47 -0400, Regan Heath re...@netmail.co.nz
wrote:
On Fri, 01 Apr 2011 13:38:45 +0100, Steven Schveighoffer
schvei...@yahoo.com wrote:
On Fri, 01 Apr 2011 06:38:56 -0400, Regan Heath re...@netmail.co.nz
wrote:
On Mon, 28 Mar 2011 17:54:29 +0100, bearophile
At least on Windows, as far as I know, the casing of a file extension doesn't
come into play. But when comparing extensions, you have to be careful to
lowercase the result of `getExt()`, for example:
foreach (string name; dirEntries(curdir, SpanMode.shallow))
{
if (name.isFile name.getExt
On 4/1/11, Andrej Mitrovic n...@none.none wrote:
I often have to search for files that have a certain extension. Having to
expand the code to the following becomes ugly real fast:
foreach (string name; dirEntries(curdir, SpanMode.shallow))
{
if (name.isFile name.hasExt.tolower == ini ||
On 04/01/2011 11:03 PM, Andrej Mitrovic wrote:
At least on Windows, as far as I know, the casing of a file extension doesn't
come into play. But when comparing extensions, you have to be careful to
lowercase the result of `getExt()`, for example:
foreach (string name; dirEntries(curdir,
Match a single extension or any number of extensions. I've said
range, but I didn't mean a custom type. Just that it works with
either 1 value or an array of values.
Hello,
the is expression is a great feature of D - but its use is not very
intuitive, at least for me.
I'm trying to write a template that figures out if the template
parameter is of a given type.
This is the type I would like to check for:
struct A( T, string s )
{ ... };
One possibility to
On Fri, Apr 1, 2011 at 5:14 PM, enuhtac enuhtac_li...@gmx.de wrote:
Hello,
the is expression is a great feature of D - but its use is not very
intuitive, at least for me.
I'm trying to write a template that figures out if the template
parameter is of a given type.
This is the type I would
Btw disregard that handle function, I've used it first but then
decided to change `result` directly in the receiveTimeout function.
It's better that way.
Actually I have a bug in `foo()`, the switch statement is executed
even if I didn't get a message back. Here's a fix:
void foo()
{
int result;
bool gotMessage;
while (true)
{
gotMessage = receiveTimeout(1000,
(int x) { result = x; }
http://d.puremagic.com/issues/show_bug.cgi?id=5804
Vladimir thecybersha...@gmail.com changed:
What|Removed |Added
CC|
http://d.puremagic.com/issues/show_bug.cgi?id=5657
--- Comment #1 from SHOO zan77...@nifty.com 2011-04-01 04:44:14 PDT ---
I tested following commit:
https://github.com/D-Programming-Language/dmd/commit/e764b3949ae0f95f8fc4d7d2e9114e29fee12493
with following code:
http://ideone.com/Yqomf
and
http://d.puremagic.com/issues/show_bug.cgi?id=5805
Summary: std.regex match captures property horribly broken
Product: D
Version: D2
Platform: x86
OS/Version: All
Status: NEW
Severity: critical
Priority: P2
http://d.puremagic.com/issues/show_bug.cgi?id=5729
Harry Vennik htven...@zonnet.nl changed:
What|Removed |Added
CC||htven...@zonnet.nl
http://d.puremagic.com/issues/show_bug.cgi?id=5729
--- Comment #2 from Harry Vennik htven...@zonnet.nl 2011-04-01 09:42:57 PDT
---
Really amazing:
typeof(A.bla) // int
typeof(A.bla) // int function() @property ref
typeof(*A.bla) // int
(The difference with the previous post is that I
http://d.puremagic.com/issues/show_bug.cgi?id=4360
Walter Bright bugzi...@digitalmars.com changed:
What|Removed |Added
Status|NEW |RESOLVED
http://d.puremagic.com/issues/show_bug.cgi?id=5788
Vladimir thecybersha...@gmail.com changed:
What|Removed |Added
CC|
http://d.puremagic.com/issues/show_bug.cgi?id=5788
--- Comment #2 from Vladimir thecybersha...@gmail.com 2011-04-01 19:08:43 PDT
---
Erm, never mind, [] still creates a null array. I just remembered I had to do
something more tricky in my code to make empty non-null arrays.
http://d.puremagic.com/issues/show_bug.cgi?id=5233
--- Comment #4 from Rob Jacques sandf...@jhu.edu 2011-04-01 22:01:14 PDT ---
Patch version 5.
*** API Addition ***
Optional template boolean parameter asArray. If true, put bypasses testing
r.put(e), r.put(e[]), r(e) and r(e[]). This allows
85 matches
Mail list logo
