Hi krhes and petri,
I hope this can help a little (sorry, I am a musician, not a programmer).
I have observed the ‘comp’ lisp code, I think it is founded on ‘pcs-complement’, that is founded on ‘pcs-complement-f1’ that is founded on ‘gen-integer’. You can select objects and press ‘e’ for visualizing the code.
If I understand good some how ‘gen-integer’ force the ‘comp’ algorithm to consider only integer from 0 to 11. And petri’s observation about putting 6 in third ‘comp’ inlet is right. I have also tried with 0 and 6 (second and third inlet). I think it is in dependence from some ‘<’ and ‘>’ evaluation inside ‘pcs-complement’ code, but I can not say I have understood it completely, sorry.
I enclose a figure. In first ‘comp’ chain (0 6 11 13 15 22) give me (1 2 3 4 5 7 8 9 10) because only (0 6 11) numbers are considered (that is only from 0 to 11). In fact (second ‘comp’ chain) to have krhes’s right solution I must first apply mod12 to (0 6 11 13 15 22).
Sorry for my not complete clearness…
Best
fdsdb