LC
Arguments: prog-lc [generic-function]
Computes a set of sieves (cribles) from a set of sieve expressions contained
in a 'text-win' box connected to it.
A sieve is a list of increasing positive integers.
See the tutorial for examples of
the language (lc) used for writing sieve expressions.
Once evaluated, all the symbols that appear on the left side of the '=' operator
(e.g. c1 in the expression 'c1 = c2 + c3') inside the text-win are defined and can be used
in the 'eval-crible' 'crible-list' and 'crible-rtm' modules, in the 'crible' parameter.
in a 'text-win' box connected to it.
A sieve is a list of increasing positive integers.
See the tutorial for examples of
the language (lc) used for writing sieve expressions.
Once evaluated, all the symbols that appear on the left side of the '=' operator
(e.g. c1 in the expression 'c1 = c2 + c3') inside the text-win are defined and can be used
in the 'eval-crible' 'crible-list' and 'crible-rtm' modules, in the 'crible' parameter.
simple sieve : (step offset begin end)
example : c = (2 0 0 8) defines a sieve with a period 2 between 0 and 8: (0 2 4 6 8)
c = (2 1 4 10) defines (5 7 9)
example : c = (2 0 0 8) defines a sieve with a period 2 between 0 and 8: (0 2 4 6 8)
c = (2 1 4 10) defines (5 7 9)
binary operators :
- union
- intersection
sieve composition
/ set difference
unary operators :
c (x) complementary sieve of the sieve 'x'
d(i1 i2 .. in) defines an arbitrary sieve (i1 i2 ... in) with i1,i2... increasing integers
a(s b e) defines a random sieve with step close to 'a', between values 'b' and 'e'
e <lisp form> evaluates <lisp form>
examples : c = e (append (c1) (reverse (c1)) computes
a palindrome from the sieve c1 and puts it into c. If you use sieve-symbols in <lisp form>
put them between parentheses (e.g. (c1)).
examples : c = e (append (c1) (reverse (c1)) computes
a palindrome from the sieve c1 and puts it into c. If you use sieve-symbols in <lisp form>
put them between parentheses (e.g. (c1)).
p(s c1 c2 ... cn) where 's' is a symbol, 'c1'...'cn' are previously defined sieves. Computes
a set partition of the set c1 U c2 U ... cn. Then the subsets are put in symbols built from 's'.
Example : after evaluating p(x c1 c2 c3), the symbol x1 (resp. x2, x3) is set to contain
the element of c1 (resp. c2 c3) that are not elements of the 2 other sets. The symbol x12 contains
elements common to c1 and c2 but not members of c3. x13 and x23 follow the same model.
x123 is the intersection of the three sets.
a set partition of the set c1 U c2 U ... cn. Then the subsets are put in symbols built from 's'.
Example : after evaluating p(x c1 c2 c3), the symbol x1 (resp. x2, x3) is set to contain
the element of c1 (resp. c2 c3) that are not elements of the 2 other sets. The symbol x12 contains
elements common to c1 and c2 but not members of c3. x13 and x23 follow the same model.
x123 is the intersection of the three sets.
parameters :
list : the output of a text-win box
output :
nil
