It takes a bit of work to get around the mutable buffers problem in D
language arrays. I found it made a performance difference in xml parsing.
https://github.com/betrixed/dlang-xml/blob/master/xml/util/buffer.d
/**
Buffer(T) - Versatile appendable D array for buffer reuse,
append,
On Thu, 12 Apr 2012 15:08:54 -0400, Matt Soucy wrote:
On 04/12/2012 02:58 PM, Ali Çehreli wrote:
On 04/12/2012 11:49 AM, Alvaro wrote:
The changelog mentions DMD 2.059 as released on April 1, 2012, but
there is no link to it. Is it released?
http://dlang.org/changelog.html
I don't think
or less complete and working
interface for an aaA, I have made 2 different implementations, which use
IAA
http://bazaar.launchpad.net/~michael-rynn-500/d2-xml/d2-xml-dev/view/
head:/rt/aaSLink.d, a direct rip off, with above mentioned few warts
erased, of the current rt.aaA implementation.
and
http
://bazaar.launchpad.net/~michael-rynn-500/d2-xml/trunk/view/head:/alt/
arraymap.d
I took and adapted the idea from Ultimate++ library code. Ultimate++ is
worth a try, even if it is C++.
arraymap.d implements a hashmap, that will maintain insertion order, but
only if no deletions are made.
Each
On Thu, 02 Feb 2012 15:44:56 +, Richard Webb wrote:
With the xml package (xmlp) , and the linked node DOM, the GC is likely
to fail cleanup. I divided the generated test file, with its 2 layer
elements, into 5, 50, 500, 5000 sized files. I put in a mixin on the
Node class to do
to
replace much more of the original source, so the speed advantage
diminishes. Also the entire document stays in memory till the last
reference is garbage collectable. Its all on dsource.org/xml/trunk/
Michael Rynn.
On Mon, 07 Feb 2011 10:37:46 -0500, Robert Jacques wrote:
On Mon, 07 Feb 2011 07:40:30 -0500, Steven Schveighoffer
schvei...@yahoo.com wrote:
On Fri, 04 Feb 2011 17:36:50 -0500, Tomek Sowiński j...@ask.me wrote:
Steven Schveighoffer napisał:
Here is how I would approach it (without doing
in std.xml.
-- std.xmlp.arraydom.
The arraydom DocumentParser is also faster than the std.xml,
as it uses the std.xmlp.coreparse.
Its not complete or final, nor much reviewed.
The layout and interfaces seem to be OK.
I expect its already more useful than std.xml.
Michael Rynn.
On Tue, 19 Oct 2010 21:53:56 +0200, Jacob Carlborg wrote:
On 2010-10-19 21:37, Andrei Alexandrescu wrote:
More detail about the design please? I browsed through the code and the
main issue seems to be heavy reliance on granular delegates to do
pretty much anything. Would fixing that improve
On Fri, 20 Aug 2010 02:22:56 +, dsimcha wrote:
As I mentioned buried deep in another thread, std.string is in serious
need of fixing, for two reasons:
1. Most of it doesn't work with UTF-16/UTF-32 strings.
2. Much of it requires the input to be immutable even when there's no
good
I noted a little while ago here a mention of the superhash, someone was
curious about it, and I found it hidden in the D runtime library
Superhash , published online, From Hash Functions , Paul Hsieh
http://www.azillionmonkeys.com/qed/hash.htm.
Since I had an almost ready made hash
The issue is that the scope keyword is impossible to check against
escapes without extra additions to the language (e.g. marking a method
or a function parameter as scoped). Such an uncheckable pattern is best
left to a library feature, it doesn't deserve a keyword. I agree that
scoped() has
On Thu, 15 Jul 2010 00:18:38 -0700, Jonathan M Davis wrote:
Okay. I really don't know much about garbage collectors, how they work,
or what makes one particularly good or bad
Me too.
But its a central part of the D langauge, its design and runtime.
Even though D programmmers can replace
On Fri, 28 May 2010 20:26:50 -0500, Andrei Alexandrescu wrote:
Walter has had a great idea last night: allow classes to define
this(ref S src);
where S is the name of the struct being defined, as an alternative for
this(this);
The result would be a function similar with a C++ copy
On Fri, 28 May 2010 20:26:50 -0500, Andrei Alexandrescu wrote:
Walter has had a great idea last night: allow classes to define
this(ref S src);
where S is the name of the struct being defined, as an alternative for
this(this);
The result would be a function similar with a C++ copy
On Sun, 18 Apr 2010 17:06:22 +0200, Rainer Schuetze wrote:
Hello,
I'd like to announce the initial release of Visual D, a Visual Studio
package providing both project management and language services for
integration of the D programming language into Visual Studio.
The cv2pdb was already
On Fri, 09 Apr 2010 12:08:54 -0700, Walter Bright wrote:
Michael Rynn wrote:
In playing around trying to understand and make a better AA, I have
updated again the dsource/projects/aa/trunk/druntime/aaA.d, this time
to be a single linked list version.
I don't understand, the latest release
In playing around trying to understand and make a better AA, I have
updated again the dsource/projects/aa/trunk/druntime/aaA.d, this time to
be a single linked list version.
In the template versions of various implementations, and in Java HashMap,
I noticed that its nice to be able to
so I don't see where the linear congruent random probe thingy is g.
You *could* get rid of the left and right pointers and use linear
congruent probing, and that might be worth a try.
Thank you for the suggestion , I will give it a try.
---
Michael Rynn
.
-- taf
Michael Rynn.
.
---
Michael Rynn
On Tue, 23 Mar 2010 13:41:56 -0700, Walter Bright wrote:
Michael Rynn wrote:
On Mon, 22 Mar 2010 00:52:24 -0700, Walter Bright wrote:
bearophile wrote:
A way to know the usage patterns of D AAs is to add instrumentation
in nonrelease mode, they can save few statistical data once
On Tue, 16 Mar 2010 16:12:25 +, Moritz Warning wrote:
On Tue, 16 Mar 2010 04:41:55 +, Michael Rynn wrote:
The use of built in Associative Array can have deleterious effects on
Garbage Collection.
:(
Fwiw, here is the original Python Dictionary implementation:
http
makes it a piece of superflous, redundent information.
There are many roots more to choice from, and maybe it be nice to have
the root module path be more informative?
-- Michael Rynn
On Tue, 16 Mar 2010 16:12:25 +, Moritz Warning wrote:
On Tue, 16 Mar 2010 04:41:55 +, Michael Rynn wrote:
The use of built in Associative Array can have deleterious effects on
Garbage Collection.
:(
Fwiw, here is the original Python Dictionary implementation:
http
The use of built in Associative Array can have deleterious effects on
Garbage Collection.
D by default uses garbage collection for memory management.
This means that any blocks of memory that contain random bits can be
mistaken as containing pointers to valid data, and can prevent complete
a major overhaul, and I introduced a nasty bug that causes this. Please
apply the fix identified here:
http://www.digitalmars.com/webnews/newsgroups.php?
art_group=digitalmars.D.announcearticle_id=17841
Sorry again. I hope this can be fixed soon.
-Steve
This particular progressive
When there is such a drop in replacement, it will be easier for others
to try it out in existing code and uncover quirks and limitations. Then
there might be benefits.
Committed a struct AA wrapper and a modified PyDict class in hash\pydict.d
as builtin AA behave-alike, to the DSource - aa
removed on
the release compile.
The trie class however, at least can do prefix key completion well.
PyDictD1 is updated with the same change.
The code is updated in SVN, so anyone can check out the changes. (and
even update with any Dsource login).
--tof--
Michael Rynn
On Mon, 08 Mar 2010 06:57:00 -0500, Hamish McTavish wrote:
Jane Doe Wrote:
Is D a cult?
Who you calling a cult?
http://en.wikipedia.org/wiki/Cult
Cult pejoratively refers to a group whose beliefs or practices could be,
reasonably or unreasonably, considered strange. The term was
That IS what Walter thinks, actually. It's being moved to libraries
(which is why there have been some nasty AA regressions in the past few
compiler releases :-( ).
Sounds good. So the source is in druntime?
Does that mean I can find out how to implement opIn ?.
I found the file
On Fri, 04 Dec 2009 10:05:16 +0200, Lionello Lunesu wrote:
Perhaps reusing a constructor of an inherited class should be easier.
Something like alias this? But how to refer to specific ctor
overloads?
L.
On 30-11-2009 1:03, Andrei Alexandrescu wrote:
Walter and I just discussed the
On the D2 online pages
(http://www.digitalmars.com/d/2.0/statement.html#ForeachStatement)there
is
Foreach over Structs and Classes with Ranges
My question is , is there a working example of foreach ( e ; range )?
Iteration over struct and class objects can be done with ranges, which
image.
Am I too pedantic or what?
Michael Rynn...
]; // this should not be a literal, but
memory allocated like a structure.
Am I too pedantic or what?
Michael Rynn...
be memory filled in dynamically at
point of execution. If mypointers is static then it is immutable?.
How does it work for struct?
Michael Rynn...
On Thu, 04 Feb 2010 18:41:48 -0700, Rainer Deyke wrote:
Andrei Alexandrescu wrote:
One idea I've had for a while was to have a universal string type:
struct UString {
union {
char[] utf8;
wchar[] utf16;
dchar[] utf32;
}
enum Discriminator { utf8,
On Mon, 04 Jan 2010 04:10:28 +, retard wrote:
Sat, 02 Jan 2010 12:23:36 -0800, Walter Bright wrote:
yigal chripun wrote:
Have you ever actually used Smalltalk?? I have used it and it's the
easiest language to use by far, having conditionals as methods of
Boolean is much better, easier
elegant to wrap the struct contents in a
class anyway. And this is probably a good thing.
Still , its a bug in D2 types functionality.
Michael Rynn
the documentation what is the recommendation D2 struct
opAssign. struct seems to work for most of the other facilities in D2.
The DPL book fails to cover such intricasies, apart from the metaphorical
There be Dragons... This is wise, since this is flunky.
Michael Rynn
F:\DLang\DEx\D2ExF:\laguangeD\dlang\dtwo\dmd\windows\bin\dmd anoy.d
object.d: Error: module object cannot read file 'object.d'
F:\DLang\DEx\D2Ex
What does this mean?I can compile all my d2 programs just use: dmd *.d
under any path:
I remember getting that same message compiling with
On Mon, 16 Nov 2009 18:57:13 -0600, Ellery Newcomer wrote:
Bill Baxter wrote:
Note that if comma-as-sequencer was removed, and repurposed as a tuple
literal (with a,b making a tuple), and if we specify that tuple
elements are evaluated in order, then I think this would work as a
The XMLP project is on DSource.
http://www.dsource.org/projects/xmlp
I have got as far getting it to pass all the namespace and XML 1.0/1.1
test cases.
I have been having a look at the w3c XPath recommendations, but I am
still baulking at getting deep into that.
--
michael *^^*
me a little worried, as I liked using
the value returned by in operator, and had not used .get at all.
P 128 20-25
..To support this encoding, Unicode
allocates no valid characters to numbers in the range 0xD800 through
0xDBFF
Typo , should be: 0xD800 through 0xDFFF here.
--
Michael Rynn
No one seems to be answering ad...@dsource.org.
Either they or I am a dead person.
Believing the former to be much more likely,
I have setup , at least for the time being a server at
http://source.miryn.org running trac and subversion.
I am not a natural server admin or web designer, so
has a base module name of xmlp. I am not aiming for
std.xml as yet.
-
Michael Rynn
KB source code zip?
-
Michael Rynn
I have made a little beginning attempt at understanding the phobos xml
modules. For a warm up exercise, I took the std.xml and std.encoding
from phobos 2, and made them into std2.xml and std2.encoding in the
DSource project std2, so the dmd 1.0 compiler took a tour tripping up
all over the code.
On Mon, 27 Jul 2009 20:15:46 -0400, llee l...@jhsph.edu wrote:
The std.xml module contains several bugs that need to be fixed. The most
important one is that the parser fails to parse empty elements (IE elements
that use the tag name=value / format). I'd like to report this bug to the
modules'
On Thu, 30 Jul 2009 18:03:39 +1000, Michael Rynn
michaelr...@optushome.com.au wrote:
corrections..
I had little trouble in compiling a static library version of the
Expat 2.01
Whoops, I used an import library to the LibExpat.dll.
Pity I seen jobs yet offering for D language programmers.
Any jobs
50 matches
Mail list logo
