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