Untitled
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374
import std.stdio;
struct Int {
int value;
Int opBinary(string op: "+")(Int other) const {
writefln("%s + %s = %s", value, other.value, value + other.value);
return Int(value + other.value);
}
}
void main() {
const l0 = DList!Int();
const l1 = l0.append(
Int(1) + Int(1),
);
const l2 = l1.append(
Int(2) + Int(2),
Int(3) + Int(3),
Int(4) + Int(4)
);
writeln(l2.popFront().front);
}
struct DList(T) {
struct Node {
T delegate() payload;
Node* prev, next;
}
private Node* m_first, m_last;
bool empty() const { return m_first == null; }
T front() const { assert(!empty); return m_first.payload(); }
T back() const { assert(!empty); return m_last.payload(); }
const(DList) popFront() const {
assert(!empty);
return m_first == m_last ? const DList() : const DList(m_first.next, m_last);
}
const(DList) popBack() const {
assert(!empty);
return m_first == m_last ? const DList() : const DList(m_first, m_last.prev);
}
const(DList) append(ARGS...)(lazy ARGS args) const {
auto list = dup();
static foreach(arg; args) {
if(list.empty) {
list.m_first = list.m_last = new Node(&arg);
} else {
list.m_last.next = new Node(&arg, list.m_last);
list.m_last = list.m_last.next;
}
}
return list;
}
private DList dup() const {
auto list = DList();
if(!empty) {
auto prev = new Node(m_first.payload);
list.m_first = prev;
const(Node)* cur = m_first.next;
while(cur != null && cur != m_last) {
auto node = new Node(cur.payload, prev);
prev.next = node;
prev = node;
cur = cur.next;
}
list.m_last = prev;
}
return list;
}
}
D
INFO