On Monday, 8 October 2018 at 13:47:44 UTC, Russel Winder wrote:
The purpose of these books is for students to learn the
academic material, not the creation of production libraries.
Most programming language libraries have all the algorithms
coded up in the libraries. And for those algorithms th
On Monday, 8 October 2018 at 05:18:35 UTC, bauss wrote:
On Sunday, 7 October 2018 at 20:27:47 UTC, eastanon wrote:
Are there reading resources on Data structures and Algorithms
in D? There are several such books in the C/C++ and Java world
and many senior/experienced D users might have come acr
Are there reading resources on Data structures and Algorithms in
D? There are several such books in the C/C++ and Java world and
many senior/experienced D users might have come across them in C.
But for people who join D after reading Ali's book, a data
structures and algorithms book in D would
Maybe I have not searched well, but I am wondering whether there
are suffix tree or suffix array implementations in D. I have seen
a couple from other programming languages and before I translate
one to D, there could be a something existing already.
Does D array implementation support an array of null values?
int a[4] = null;
But I ran into a type error while checking if a[i] is null
foreach(i; 0..3){
if(i == null){
writeln("it is null");
}
}
}
How do you set fixed size array of null values and check if they
are null?
On Sunday, 27 May 2018 at 16:00:15 UTC, Jonathan M Davis wrote:
On Sunday, May 27, 2018 16:28:56 Russel Winder via
Digitalmars-d-learn wrote:
[...]
Honestly, I'd suggest that folks never use in at this point.
There's zero benefit to it. In principle, in was supposed to be
const scope, but sc
I have been reading the D forums for a while and following on its
amazing progress for a long time. Over time I have even written
some basic D programs for myself, nothing major or earth
shuttering. I have downloaded and read Ali's excellent book.
I would like to dive deeper into D, however s
On Thursday, 24 March 2016 at 06:34:51 UTC, rikki cattermole
wrote:
void popFront() {
import std.string : indexOf;
if (source is null) {
On Thursday, 24 March 2016 at 13:38:32 UTC, Marc Schütz wrote:
Yes, it's read into your processes memory. You can use
std.mmfile [1] to make things a bit more efficient. It will,
too, read the data into memory, but it will do so in a way
(memory mapping) that only loads what is actually accesse
On Thursday, 24 March 2016 at 06:34:51 UTC, rikki cattermole
wrote:
As a little fun thing to do I implemented it for you.
It won't allocate. Making this perfect for you.
With a bit of work you could make Result have buffers for
result instead of using the input array allow for the source to
be
Fastq is a format for storing DNA sequences together with the
associated quality information often encoded in ascii characters.
It is typically made of 4 lines for example 2 fastq entries
would look like this.
@seq1
TTAAAT
+
?+BBB/DHH@
@seq2
GACCCTTTGCA
+
?+BHB/DIH@
I do not have a lot o
11 matches
Mail list logo
