digitalmars.D.bugs - Documentation bugs

=?ISO-8859-1?Q?Jari-Matti_M=E4kel=E4?= (42/42) Mar 07 2006 1. The following anchor does not work. There is one # too much.

Walter Bright (5/31) Mar 07 2006 There aren't any, other than identifier length limits.
Thomas Kuehne (14/38) Mar 09 2006 -----BEGIN PGP SIGNED MESSAGE-----

=?UTF-8?B?SmFyaS1NYXR0aSBNw6RrZWzDpA==?= (12/45) Mar 09 2006 No, I think I'm not. The program is consuming < 50 MB of memory and I

=?UTF-8?B?SmFyaS1NYXR0aSBNw6RrZWzDpA==?= (21/66) Mar 09 2006 Well, one thing I found out is that the algorithm segfaults exactly when

Thomas Kuehne (13/79) Mar 10 2006 -----BEGIN PGP SIGNED MESSAGE-----

=?UTF-8?B?SmFyaS1NYXR0aSBNw6RrZWzDpA==?= (17/33) Mar 10 2006 I tried that one too. Didn't help in any way. The only

=?UTF-8?B?SmFyaS1NYXR0aSBNw6RrZWzDpA==?= (64/71) Mar 14 2006 Actually the dchar-version doesn't work perfectly either. I tried to use

Thomas Kuehne (15/93) Mar 20 2006 -----BEGIN PGP SIGNED MESSAGE-----

=?UTF-8?B?SmFyaS1NYXR0aSBNw6RrZWzDpA==?= (70/90) Mar 21 2006 I'm really grateful that you want to help here. Ok, here are the results...

=?ISO-8859-1?Q?Jari-Matti_M=E4kel=E4?= <jmjmak utu.fi.invalid> writes:



http://www.digitalmars.com/d/faq.html#real

2. There's no mention about class templates
(e.g. class foo(type) { ... }) on

http://www.digitalmars.com/d/class.html

3. There aren't any examples of classes that inherit from super classes
/ interfaces with protection attributes. In fact I don't even know how
and why they should work (maybe the way C++ uses them?). E.g.

 class foo : private bar { ... }


Walter, please don't go the c++ way here. That would make the current
interfaces totally useless. E.g.

 interface foo { void fn(); }
 class bar : private foo { private void fn() { ..implementation.. } }
 foo a = new bar();
 a.fn();

would become illegal.

4. One other question - what are the hard limits of DMD? For example,
how many objects of a class can be instantiated at most? We have made a
suffix tree -algorithm that generates a huge amount of objects. I think
the compiler introduces some limits, since the algorithm segfaults only
after about >300 identical successful runs - the amount of successful
identical runs before segfault decreases when the tree depth increases.
It segfaults on the following code:

class Node {
  Node[char] children;
  char[] label;

  void fn(char[] s) {
    assert(s !is null);
    assert(s.length > 0);
    assert(s[0] in children);
    auto a = children[s[0]];
    assert(a !is null);
    char[] l = a.label;  // segfault exactly here
    assert(l != null);
    ...
  }
}

The segfault shouldn't be possible since all objects all guaranteed to
be properly allocated from the heap. We don't use any explicit memory
management. I can post the whole source if needs be.

-- 
Jari-Matti

Mar 07 2006

"Walter Bright" <newshound digitalmars.com> writes:

"Jari-Matti M�kel�" <jmjmak utu.fi.invalid> wrote in message 
news:dul6sh$30eu$1 digitaldaemon.com...
 4. One other question - what are the hard limits of DMD?

There aren't any, other than identifier length limits.

 For example,
 how many objects of a class can be instantiated at most?

Limited by memory the os can provide.

 We have made a
 suffix tree -algorithm that generates a huge amount of objects. I think
 the compiler introduces some limits, since the algorithm segfaults only
 after about >300 identical successful runs - the amount of successful
 identical runs before segfault decreases when the tree depth increases.
 It segfaults on the following code:

 class Node {
  Node[char] children;
  char[] label;

  void fn(char[] s) {
    assert(s !is null);
    assert(s.length > 0);
    assert(s[0] in children);
    auto a = children[s[0]];
    assert(a !is null);
    char[] l = a.label;  // segfault exactly here
    assert(l != null);
    ...
  }
 }

 The segfault shouldn't be possible since all objects all guaranteed to
 be properly allocated from the heap. We don't use any explicit memory
 management. I can post the whole source if needs be.

I'd start adding in more asserts to track it down.

Mar 07 2006