Next: Initialization with Fibonacci, Previous: Initialization with first even numbers, Up: Initializing data
C code | Spl encoding
|
---|---|
#include "intlist.h" /* acyclic(x) and l[x]==_l and data(x) */ void seqInit(intlist x, int m) { int mp = m; intlist xi = x; while (xi != NULL) { xi->data = mp; mp = mp+1; } } |
var _data:real, _free:real, _len:real, _new:real, _next:real, _null:real, x:real, xi:real, z:real, _l:int, _k: int, m:int, mp:int; begin assume (x == 0); xi = _null; z = _null; mp = m; xi = x; while xi != _null do xi = mp / _data; z = xi*_next; xi = _null; xi = z; z = _null; mp = mp+1; done; end |
Domain | Param. | Log file | Interesting constraint
|
---|---|---|---|
LSUM-PRD | Anon=(0,1) | log/intlist-initSeq-lsum-prd-01 | x(n1) and d(n1)=m and mp>=m+1
|
LSUM-REL | Anon=(0,1) | log/intlist-initSeq-lsum-rel-01 | x(n1) and d(n1)=m and _l=l[n1]=mp-m
|
MSET | none (not interesting)
| ||
UCONS | Anon=(0,1) or (2,1), P11 or P211 | TODO | x(n1) and d(n1)=m
and \forall y \in n1 \implies d(y)=y+m
and \forall y1 <_1 y2 \in n1 \implies d(y2)=d(y1)+1
|