loop l.head
+
+
let length l = l.length
let is_empty l = l.head == nil
+let pop l =
+ if is_empty l then failwith "pop"
+ else
+ let v = l.head.node in
+ let nhead = l.head.next in
+ l.head <- nhead;
+ if nhead == nil then l.last <- nil;
+ v
+
+
+
let add n l =
let ncell = { node = n;
next = nil }
l.length <- l.length + 1;
end
+let append l1 l2 =
+ let len2 = l2.length in
+ if len2 != 0 then begin
+ l1.length <- l1.length + len2;
+ l1.last.next <- l2.head;
+ l1.last <- l2.last;
+ end;
+ l1
+
let head l = l.head
let last l = l.last
let next i = i.next