aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Just another update

Browse source
This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
Download patch file Download diff file Expand all files Collapse all files

10
Task/Self-referential-sequence/D/self-referential-sequence-3.d
View file

@ -58,7 +58,7 @@ Rec* findRec(char* s, Rec* root) nothrow {
next = root.p[c];
if (!next) {
nNodes++;
next = recPool.newItem();
next = recPool.newItem;
root.p[c] = next;
}
root = next;
@ -66,7 +66,7 @@ Rec* findRec(char* s, Rec* root) nothrow {
return root;
}
void nextNum(char* s) nothrow {
void nextNum(char* s) nothrow @nogc {
int[10] cnt;
for (int i = 0; s[i]; i++)
cnt[s[i] - '0']++;
@ -105,7 +105,7 @@ void main() nothrow {
char[32] buf;
rec_root = recPool.newItem();
foreach (i; 0 .. MAXN) {
foreach (immutable i; 0 .. MAXN) {
sprintf(buf.ptr, "%d", i);
int l = getLen(buf.ptr, 0);
if (l < ml)
@ -119,10 +119,10 @@ void main() nothrow {
}
printf("seq leng: %d\n\n", ml);
foreach (i; 0 .. nLongest) {
foreach (immutable i; 0 .. nLongest) {
sprintf(buf.ptr, "%d", longest[i]);
// print len+1 so we know repeating starts from when
foreach (l; 0 .. ml + 1) {
foreach (immutable l; 0 .. ml + 1) {
printf("%2d: %s\n", getLen(buf.ptr, 0), buf.ptr);
nextNum(buf.ptr);
}