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

update

Browse source
This commit is contained in:
Ingy döt Net 2013-06-05 21:47:54 +00:00
parent 1f1ad49427
commit 6f050a029e
2496 changed files with 37609 additions and 3031 deletions
Download patch file Download diff file Expand all files Collapse all files

10
Task/Queue-Usage/D/queue-usage-2.d
View file

@ -1,12 +1,9 @@
module queue_usage2;
import std.traits: hasIndirections;
struct GrowableCircularQueue(T) {
public size_t length;
private size_t head, tail;
private T[] A = [T.init];
private uint power2 = 0;
bool empty() const pure nothrow {
return length == 0;
@ -21,20 +18,21 @@ struct GrowableCircularQueue(T) {
A[(old.length - head) .. old.length] = old[0 .. head];
head = 0;
tail = length;
power2++;
}
A[tail] = item;
tail = (tail + 1) & ((cast(size_t)1 << power2) - 1);
tail = (tail + 1) & (A.length - 1);
length++;
}
T pop() pure {
import std.traits: hasIndirections;
if (length == 0)
throw new Exception("GrowableCircularQueue is empty.");
auto saved = A[head];
static if (hasIndirections!T)
A[head] = T.init; // Help for the GC.
head = (head + 1) & ((cast(size_t)1 << power2) - 1);
head = (head + 1) & (A.length - 1);
length--;
return saved;
}