Re: linker errors after upgrade to Ubuntu 11.10

== Quote from Jesse Phillips (jessekphillip...@gmail.com)'s article > Ubuntu made some changes to the linker. See if this information helps and > report back. This is from a post in digitalmars.D > "Changes to gcc or ld in Ubuntu 11.10 require a small addition to prevent > linker errors referencing

Re: Looking for documentation of D's lower-level aspects.

== Quote from Dmitry Olshansky (dmitry.o...@gmail.com)'s article > Less efficient is a moot point. > When you do iteration and other stuff you'd use range, like you'd use > iterators in c++. Range gets stack/register allocated pointers directly > to data (or close to it, that depends on container)

linker errors after upgrade to Ubuntu 11.10

I just upgraded to Ubuntu 11.10 (from 11.04). I have attached the error message. It looks like it is a problem with a reference to `clock_gettime`. Any suggestions? begin 644 errs.txt M+W5S"UG;G4O-"XV+C$O+BXO+BXO+BXO M+BXO;&EB+VQI8G!H;V)O'0N7T0S&ET('-T %871U

Re: Looking for documentation of D's lower-level aspects.

== Quote from Jonathan M Davis (jmdavisp...@gmx.com)'s article > On Sunday, October 23, 2011 00:01:42 Sean Silva wrote: > They're all supposed to be reference types. What prompted the decision for that? Doesn't that incur an extra heap allocation for the containers,

Re: Looking for documentation of D's lower-level aspects.

== Quote from Jonathan M Davis (jmdavisp...@gmx.com)'s article > On Saturday, October 22, 2011 17:04:57 Sean Silva wrote: > The main planned changes that I'm aware of are to > 1. Make all containers final classes (Array and SList are currently reference- > counted structs).

Re: Looking for documentation of D's lower-level aspects.

== Quote from Jonathan M Davis (jmdavisp...@gmx.com)'s article > The built-in sort on arrays is going away. std.algorithm.sort should be used > instead. I'm afraid that I don't understand what your comments on the STL have > to do with the GC though. And stuff in Phobos (such as std.algorithm) is v

Re: Looking for documentation of D's lower-level aspects.

> You _can_ use D with no to minimal GC, but you have to be very careful. A good > chunk of the standard library would be completely unusable without the GC > (primarily anything which might allocate or append to an array), you have to > be very careful when using arrays (since appending to them wo

opAssign for structs

In the language definition , it says: > Struct assignment t=s is defined to be semantically equivalent to: > t = S.opAssign(s); > where opAssign is a member function of S: > S* opAssign(S s) > { ... bitcopy *this into tmp ... > ... bitc

Re: Looking for documentation of D's lower-level aspects.

== Quote from Trass3r (u...@known.com)'s article > Am 20.10.2011, 00:06 Uhr, schrieb Sean Silva : > > == Quote from Jesse Phillips (jessekphillip...@gmail.com)'s article > >> Right now D isn't ready to be used in this fashion > > > > It looks there&#x

Re: Looking for documentation of D's lower-level aspects.

== Quote from Jesse Phillips (jessekphillip...@gmail.com)'s article > Right now D isn't ready to be used in this fashion It looks there's a more-or-less functional kernel written in D (and pretty well documented too): http://wiki.xomb.org/index.php?title=Main_Page

Looking for documentation of D's lower-level aspects.

I have just finished reading Alexandrescu's The D Programming Language, but it doesn't seem to talk at all about how to use D as a stand-in for C/C++ almost at all. E.g., the part of D that doesn't depend on a runtime or garbage collector. It's not that I have anything against those niceties---it