FWIW, were I proposing a "Database Engine for D" I'd be proposing a
B+Tree that was restricted to storing explicit data (no pointers or
other indirection...including strings, you'd need to specify fixed size
arrays of char, wchar, or dchar). There would be one "type"/file, and
the "type" would be given by a struct that contained no pointers either
obvious or hidden (i.e., dynamic arrays, strings, etc.). This would be
for simplicity of implementation and basic functionality. Later I would
consider implementing secondary keys which would be implemented as
databases storing only the key value and the record number. Since
records are of fixed size, sorting them would be trivial, but only the
secondary keys would provide this option because you want the record
number of the main file to be reliable and invariant.
SQL seems like a poor fit to D. At some point one might consider a
fancier front end to the database that would allow indirections, but
that's a whole can of worms, with threats of multiple copies that have
different values for items that started out pointing to the same variable.
On 01/04/2016 12:39 PM, Andrei Alexandrescu via Digitalmars-d wrote:
On 01/04/2016 01:28 PM, Russel Winder via Digitalmars-d wrote:
Rusts macros show it can be done well.
Do you have a few examples handy? Thanks. -- Andrei
