mirror of
https://github.com/dschmenk/PLASMA.git
synced 2024-09-07 12:54:31 +00:00
Working background GC
This commit is contained in:
parent
82130cb2e8
commit
86669849d9
@ -43,14 +43,15 @@ import sexpr
|
||||
var fmt_fpfrac
|
||||
|
||||
predef gc#0
|
||||
predef print_expr(expr)#0
|
||||
predef parse_expr(evalptr, level, refill)#2
|
||||
predef eval_expr(expr)#1
|
||||
predef bool_pred(bool)#1
|
||||
predef new_int(intlo, inthi)#1
|
||||
predef new_sym(symstr)#1
|
||||
predef new_assoc(symptr, valptr)#0
|
||||
predef set_assoc(symptr, valptr)#0
|
||||
predef print_expr(expr)#0
|
||||
predef parse_expr(evalptr, level, refill)#2
|
||||
predef eval_expr(expr)#1
|
||||
predef eval_quote(expr)#1
|
||||
predef bool_pred(bool)#1
|
||||
end
|
||||
|
||||
import smath
|
||||
@ -152,7 +153,8 @@ def natv_fpfrac(symptr, expr)
|
||||
return fmt
|
||||
end
|
||||
|
||||
def natv_memavail(symptr, expr)
|
||||
def natv_gc(symptr, expr)
|
||||
gc
|
||||
return new_int(heapavail, 0)
|
||||
end
|
||||
|
||||
@ -260,13 +262,12 @@ sym_cond = new_sym("COND") // This should actually match COND
|
||||
new_sym("PROG")=>natv = @natv_prog
|
||||
new_sym("GO")=>natv = @natv_go
|
||||
new_sym("RETURN")=>natv = @natv_return
|
||||
new_sym("MEM")=>natv = @natv_memavail
|
||||
new_sym("BYE")=>natv = @natv_bye
|
||||
new_sym("GC")=>natv = @natv_gc
|
||||
new_sym("QUIT")=>natv = @natv_bye
|
||||
|
||||
parse_cmdline
|
||||
while not quit
|
||||
putln; print_expr(eval_expr(readfn()))
|
||||
gc
|
||||
putln; print_expr(eval_quote(readfn()))
|
||||
loop
|
||||
putln
|
||||
done
|
||||
|
@ -46,6 +46,7 @@ struc t_array
|
||||
res[t_elem]
|
||||
word dimension[4]
|
||||
word offset[4]
|
||||
word arraysize
|
||||
word arraymem
|
||||
end
|
||||
|
||||
@ -56,26 +57,27 @@ export var fmt_fpfrac = 4
|
||||
var assoc_list = NULL // SYM->value association list
|
||||
var cons_list = NULL
|
||||
var cons_free = NULL
|
||||
var cons_last = NULL
|
||||
var int_list = NULL
|
||||
var int_free = NULL
|
||||
var int_last = NULL
|
||||
var float_list = NULL
|
||||
var float_free = NULL
|
||||
var float_last = NULL
|
||||
var sym_list = NULL
|
||||
var build_list = NULL
|
||||
var eval_last = NULL
|
||||
|
||||
var sym_nil, sym_quote, sym_lambda, sym_cond, sym_set
|
||||
res[t_elem] pred_true = 0, 0, BOOL_TRUE
|
||||
|
||||
byte parsing = 0 // Flag for GC to skip during parsing
|
||||
|
||||
predef eval_expr(expr)
|
||||
predef print_expr(expr)#0
|
||||
predef eval_expr(expr)#1
|
||||
|
||||
//
|
||||
// Garbage collector
|
||||
//
|
||||
|
||||
const GC_TRIGGER = 50
|
||||
byte gc_pull = 0
|
||||
|
||||
def mark_list(list)#0
|
||||
while list
|
||||
list->type = list->type | MARK_BIT
|
||||
@ -106,6 +108,8 @@ def sweep_used#0
|
||||
var symptr
|
||||
|
||||
sweep_expr(assoc_list)
|
||||
sweep_expr(build_list)
|
||||
sweep_expr(eval_last)
|
||||
symptr = sym_list
|
||||
while symptr
|
||||
if symptr=>lambda
|
||||
@ -116,9 +120,6 @@ def sweep_used#0
|
||||
fin
|
||||
symptr = symptr=>link
|
||||
loop
|
||||
sweep_expr(cons_last)
|
||||
sweep_expr(int_last)
|
||||
sweep_expr(float_last)
|
||||
end
|
||||
|
||||
def collect_list(listhead, freehead)#2
|
||||
@ -128,6 +129,8 @@ def collect_list(listhead, freehead)#2
|
||||
elemptr = listhead
|
||||
while elemptr
|
||||
if elemptr->type & MARK_BIT
|
||||
elemptr->type = elemptr->type & MARK_MASK
|
||||
//puts("Free: "); print_expr(elemptr); putln
|
||||
if prevptr
|
||||
prevptr=>link = elemptr=>link
|
||||
elemptr=>link = freehead
|
||||
@ -154,10 +157,10 @@ def collect_unused#0
|
||||
end
|
||||
|
||||
export def gc#0
|
||||
if parsing; return; fin
|
||||
mark_elems
|
||||
sweep_used
|
||||
collect_unused
|
||||
gc_pull = 0
|
||||
end
|
||||
|
||||
//
|
||||
@ -171,6 +174,7 @@ export def new_cons#1
|
||||
consptr = cons_free
|
||||
cons_free = cons_free=>link
|
||||
else
|
||||
gc_pull++
|
||||
consptr = heapalloc(t_cons)
|
||||
fin
|
||||
consptr=>link = cons_list
|
||||
@ -188,6 +192,7 @@ export def new_int(intlo, inthi)#1
|
||||
intptr = int_free
|
||||
int_free = int_free=>link
|
||||
else
|
||||
gc_pull++
|
||||
intptr = heapalloc(t_numint)
|
||||
fin
|
||||
intptr=>link = int_list
|
||||
@ -205,6 +210,7 @@ export def new_float(extptr)#1
|
||||
floatptr = float_free
|
||||
float_free = float_free=>link
|
||||
else
|
||||
gc_pull++
|
||||
floatptr = heapalloc(t_numfloat)
|
||||
fin
|
||||
floatptr=>link = float_list
|
||||
@ -251,6 +257,7 @@ def new_array(dim0, dim1, dim2, dim3)
|
||||
aptr=>offset[1] = ofst1
|
||||
aptr=>offset[2] = ofst2
|
||||
aptr=>offset[3] = ofst3
|
||||
aptr=>arraysize = size
|
||||
aptr=>arraymem = memptr
|
||||
return aptr
|
||||
end
|
||||
@ -362,7 +369,7 @@ def print_atom(atom)#0
|
||||
puts("]\n")
|
||||
break
|
||||
otherwise
|
||||
puts("Unknown atom type\n")
|
||||
puts("Unknown atom type: $"); putb(atom->type); putln
|
||||
wend
|
||||
fin
|
||||
end
|
||||
@ -467,7 +474,6 @@ end
|
||||
export def parse_expr(evalptr, level, refill)#2 // return evalptr, exprptr
|
||||
var exprptr, consptr, elemptr, quotecons
|
||||
|
||||
parsing++
|
||||
exprptr = NULL
|
||||
consptr = NULL
|
||||
while TRUE
|
||||
@ -480,7 +486,6 @@ export def parse_expr(evalptr, level, refill)#2 // return evalptr, exprptr
|
||||
if level
|
||||
evalptr = refill() // Refill input buffer
|
||||
else
|
||||
parsing--
|
||||
return evalptr, exprptr
|
||||
fin
|
||||
break
|
||||
@ -492,7 +497,6 @@ export def parse_expr(evalptr, level, refill)#2 // return evalptr, exprptr
|
||||
if not exprptr
|
||||
exprptr = sym_nil
|
||||
fin
|
||||
parsing--
|
||||
return evalptr + 1, exprptr
|
||||
is '('
|
||||
evalptr++
|
||||
@ -511,7 +515,6 @@ export def parse_expr(evalptr, level, refill)#2 // return evalptr, exprptr
|
||||
quotecons=>cdr=>car = elemptr
|
||||
elemptr = quotecons
|
||||
if level == 0
|
||||
parsing--
|
||||
return evalptr, elemptr
|
||||
fin
|
||||
break
|
||||
@ -523,7 +526,6 @@ export def parse_expr(evalptr, level, refill)#2 // return evalptr, exprptr
|
||||
//
|
||||
if not (consptr and consptr=>car)
|
||||
puts("Invalid . operator\n")
|
||||
parsing--
|
||||
return evalptr, exprptr
|
||||
fin
|
||||
consptr=>cdr = elemptr
|
||||
@ -540,7 +542,6 @@ export def parse_expr(evalptr, level, refill)#2 // return evalptr, exprptr
|
||||
evalptr++
|
||||
fin
|
||||
if level == 0
|
||||
parsing--
|
||||
return evalptr, elemptr
|
||||
fin
|
||||
wend
|
||||
@ -554,7 +555,6 @@ export def parse_expr(evalptr, level, refill)#2 // return evalptr, exprptr
|
||||
else
|
||||
if consptr=>cdr
|
||||
puts("Improperly formed .\n")
|
||||
parsing--
|
||||
return evalptr, exprptr
|
||||
fin
|
||||
consptr=>cdr = new_cons
|
||||
@ -566,7 +566,6 @@ export def parse_expr(evalptr, level, refill)#2 // return evalptr, exprptr
|
||||
consptr=>car = elemptr
|
||||
fin
|
||||
loop
|
||||
parsing--
|
||||
return evalptr, exprptr
|
||||
end
|
||||
|
||||
@ -649,29 +648,51 @@ end
|
||||
//
|
||||
|
||||
def enter_lambda(curl, expr, params)#2 // curl, expr
|
||||
var args, arglist, pairlist, pair
|
||||
var args, arglist, pairlist
|
||||
var paramvals[16]
|
||||
byte paramcnt
|
||||
|
||||
if !expr or expr=>car <> sym_lambda
|
||||
puts("Invalid LAMBDA expression: ")
|
||||
print_expr(expr)
|
||||
puts("Invalid LAMBDA expression: "); print_expr(expr); putln
|
||||
return NULL, NULL
|
||||
fin
|
||||
//
|
||||
// Evaluate the parameters
|
||||
//
|
||||
paramcnt = 0
|
||||
while params
|
||||
paramvals[paramcnt] = eval_expr(params=>car)
|
||||
params = params=>cdr
|
||||
paramcnt++
|
||||
if paramcnt > 15
|
||||
puts("Parameter overflow:"); print_expr(expr); putln
|
||||
break
|
||||
fin
|
||||
loop
|
||||
args = expr=>cdr=>car
|
||||
paramcnt = 0
|
||||
if curl == expr
|
||||
//puts("Tail: "); print_expr(expr); putln
|
||||
//
|
||||
// Update current associations during tail recursion
|
||||
// Set associations
|
||||
//
|
||||
arglist = assoc_list
|
||||
while args
|
||||
assoc_pair(args=>car)=>cdr = eval_expr(params=>car)
|
||||
args = args=>cdr
|
||||
params = params=>cdr
|
||||
arglist=>car=>cdr = paramvals[paramcnt]
|
||||
arglist = arglist=>cdr
|
||||
args = args=>cdr
|
||||
paramcnt++
|
||||
loop
|
||||
else
|
||||
//puts("Enter: "); print_expr(expr); putln
|
||||
//
|
||||
// Build arg list before prepending to assoc_list
|
||||
//
|
||||
arglist = NULL
|
||||
while args
|
||||
//
|
||||
// Build argument/value pairs
|
||||
//
|
||||
if arglist
|
||||
pairlist=>cdr = new_cons
|
||||
pairlist = pairlist=>cdr
|
||||
@ -679,24 +700,25 @@ def enter_lambda(curl, expr, params)#2 // curl, expr
|
||||
arglist = new_cons
|
||||
pairlist = arglist
|
||||
fin
|
||||
pair = new_cons
|
||||
pair=>car = args=>car
|
||||
pair=>cdr = eval_expr(params=>car)
|
||||
pairlist=>car = pair
|
||||
args = args=>cdr
|
||||
params = params=>cdr
|
||||
pairlist=>car = new_cons
|
||||
pairlist=>car=>car = args=>car
|
||||
pairlist=>car=>cdr = paramvals[paramcnt]
|
||||
args = args=>cdr
|
||||
paramcnt++
|
||||
loop
|
||||
if arglist
|
||||
pairlist=>cdr = assoc_list
|
||||
assoc_list = arglist
|
||||
fin
|
||||
fin
|
||||
//print_expr(assoc_list); putln; getc
|
||||
return expr, expr=>cdr=>cdr=>car
|
||||
end
|
||||
|
||||
export def eval_expr(expr)#1
|
||||
var alist_enter, curl, expr_car
|
||||
|
||||
if gc_pull > GC_TRIGGER; gc; fin
|
||||
curl = NULL // Current lambda
|
||||
alist_enter = assoc_list
|
||||
while expr
|
||||
@ -748,6 +770,13 @@ export def eval_expr(expr)#1
|
||||
return expr
|
||||
end
|
||||
|
||||
export def eval_quote(expr)#1
|
||||
eval_last = expr
|
||||
expr = eval_expr(expr)
|
||||
eval_last = NULL
|
||||
return expr
|
||||
end
|
||||
|
||||
//
|
||||
// Base native functions
|
||||
//
|
||||
@ -767,48 +796,61 @@ end
|
||||
|
||||
def natv_eq(symptr, expr)
|
||||
byte iseq, i
|
||||
var int[2], ext[5]
|
||||
|
||||
iseq = FALSE
|
||||
symptr = eval_expr(expr=>car)
|
||||
expr = eval_expr(expr=>cdr=>car)
|
||||
if symptr == expr
|
||||
return @pred_true
|
||||
fin
|
||||
iseq = FALSE
|
||||
if symptr->type == NUM_INT and expr->type == NUM_INT
|
||||
iseq = symptr=>intval[0] == expr=>intval[0]
|
||||
if iseq
|
||||
iseq = symptr=>intval[1] == expr=>intval[1]
|
||||
if symptr->type == NUM_INT
|
||||
int[0] = symptr=>intval[0]
|
||||
int[1] = symptr=>intval[1]
|
||||
expr = eval_expr(expr=>cdr=>car)
|
||||
if expr->type == NUM_INT
|
||||
iseq = int[0] == expr=>intval[0] and int[1] == expr=>intval[1]
|
||||
fin
|
||||
elsif symptr->type == NUM_FLOAT and expr->type == NUM_FLOAT
|
||||
iseq = TRUE
|
||||
for i = 0 to 4
|
||||
if symptr=>floatval[i] <> expr=>floatval[i]
|
||||
iseq = FALSE
|
||||
break
|
||||
fin
|
||||
next
|
||||
elsif symptr->type == NUM_FLOAT
|
||||
ext[0] = symptr=>floatval[0]
|
||||
ext[1] = symptr=>floatval[1]
|
||||
ext[2] = symptr=>floatval[2]
|
||||
ext[3] = symptr=>floatval[3]
|
||||
ext[4] = symptr=>floatval[4]
|
||||
expr = eval_expr(expr=>cdr=>car)
|
||||
if expr->type == NUM_FLOAT
|
||||
iseq = TRUE
|
||||
for i = 0 to 4
|
||||
if ext[i] <> expr=>floatval[i]
|
||||
iseq = FALSE
|
||||
break
|
||||
fin
|
||||
next
|
||||
fin
|
||||
else
|
||||
iseq = symptr == eval_expr(expr=>cdr=>car)
|
||||
fin
|
||||
return bool_pred(iseq)
|
||||
end
|
||||
|
||||
def natv_and(symptr, expr)
|
||||
while (expr and eval_expr(expr=>car) == @pred_true)
|
||||
while expr and eval_expr(expr=>car) == @pred_true
|
||||
expr = expr=>cdr
|
||||
loop
|
||||
return bool_pred(!expr)
|
||||
end
|
||||
|
||||
def natv_or(symptr, expr)
|
||||
while (expr and eval_expr(expr=>car) == NULL)
|
||||
while expr and eval_expr(expr=>car) == NULL
|
||||
expr = expr=>cdr
|
||||
loop
|
||||
return bool_pred(expr)
|
||||
end
|
||||
|
||||
def natv_cons(symptr, expr)
|
||||
symptr = new_cons
|
||||
symptr=>car = eval_expr(expr=>car)
|
||||
symptr=>cdr = eval_expr(expr=>cdr=>car)
|
||||
symptr = new_cons
|
||||
symptr=>cdr = build_list // Don't let this cons get freed up in GC
|
||||
build_list = symptr
|
||||
symptr=>car = eval_expr(expr=>car)
|
||||
expr = eval_expr(expr=>cdr=>car)
|
||||
build_list = symptr=>cdr
|
||||
symptr=>cdr = expr
|
||||
return symptr
|
||||
end
|
||||
|
||||
|
@ -46,6 +46,7 @@ import sexpr
|
||||
predef new_sym(symstr)#1
|
||||
predef new_int(intlo, inthi)#1
|
||||
predef new_float(extptr)#1
|
||||
predef print_expr(expr)#0
|
||||
predef eval_expr(expr)#1
|
||||
predef bool_pred(bool)#1
|
||||
end
|
||||
@ -59,7 +60,7 @@ def eval_num(expr)
|
||||
if result and (result->type & TYPE_MASK == NUM_TYPE)
|
||||
return result
|
||||
fin
|
||||
puts("Not an number\n")
|
||||
puts("Evaluated not an number type: "); print_expr(expr=>car); putln
|
||||
return @nan
|
||||
end
|
||||
|
||||
@ -108,7 +109,7 @@ def push_num(numptr)#0
|
||||
elsif numptr->type == NUM_INT
|
||||
push_int32(numptr + intval)
|
||||
else
|
||||
puts("Pushing non number!\n")
|
||||
puts("Pushing non number type: $"); putb(numptr->type); putln
|
||||
int = 0
|
||||
fpu:pushInt(@int)
|
||||
fin
|
||||
@ -160,79 +161,79 @@ def natv_add(symptr, expr)
|
||||
end
|
||||
|
||||
def natv_sub(symptr, expr)
|
||||
var num1, num2
|
||||
res[t_numfloat] num1, num2
|
||||
var[2] dif
|
||||
var[5] ext
|
||||
|
||||
num1 = eval_num(expr)
|
||||
num2 = eval_num(expr=>cdr)
|
||||
if num1->type == NUM_INT and num2->type == NUM_INT
|
||||
load32(num1 + intval)
|
||||
sub32(num2 + intval)
|
||||
memcpy(@num1, eval_num(expr), t_numfloat)
|
||||
memcpy(@num2, eval_num(expr=>cdr), t_numfloat)
|
||||
if num1.type == NUM_INT and num2.type == NUM_INT
|
||||
load32(@num1 + intval)
|
||||
sub32(@num2 + intval)
|
||||
store32(@dif)
|
||||
return new_int(dif[0], dif[1])
|
||||
fin
|
||||
push_num(num1)
|
||||
push_num(num2)
|
||||
push_num(@num1)
|
||||
push_num(@num2)
|
||||
fpu:subXY()
|
||||
fpu:pullExt(@ext)
|
||||
return new_float(@ext)
|
||||
end
|
||||
|
||||
def natv_mul(symptr, expr)
|
||||
var num1, num2
|
||||
res[t_numfloat] num1, num2
|
||||
var[2] mul
|
||||
var[5] ext
|
||||
|
||||
num1 = eval_num(expr)
|
||||
num2 = eval_num(expr=>cdr)
|
||||
if num1->type == NUM_INT and num2->type == NUM_INT
|
||||
load32(num1 + intval)
|
||||
mul32(num2 + intval)
|
||||
memcpy(@num1, eval_num(expr), t_numfloat)
|
||||
memcpy(@num2, eval_num(expr=>cdr), t_numfloat)
|
||||
if num1.type == NUM_INT and num2.type == NUM_INT
|
||||
load32(@num1 + intval)
|
||||
mul32(@num2 + intval)
|
||||
store32(@mul)
|
||||
return new_int(mul[0], mul[1])
|
||||
fin
|
||||
push_num(num1)
|
||||
push_num(num2)
|
||||
push_num(@num1)
|
||||
push_num(@num2)
|
||||
fpu:mulXY()
|
||||
fpu:pullExt(@ext)
|
||||
return new_float(@ext)
|
||||
end
|
||||
|
||||
def natv_div(symptr, expr)
|
||||
var num1, num2
|
||||
res[t_numfloat] num1, num2
|
||||
var[2] div
|
||||
var[5] ext
|
||||
|
||||
num1 = eval_num(expr)
|
||||
num2 = eval_num(expr=>cdr)
|
||||
if num1->type == NUM_INT and num2->type == NUM_INT
|
||||
load32(num1 + intval)
|
||||
div32(num2 + intval)
|
||||
memcpy(@num1, eval_num(expr), t_numfloat)
|
||||
memcpy(@num2, eval_num(expr=>cdr), t_numfloat)
|
||||
if num1.type == NUM_INT and num2.type == NUM_INT
|
||||
load32(@num1 + intval)
|
||||
div32(@num2 + intval)
|
||||
store32(@div)
|
||||
return new_int(div[0], div[1])
|
||||
fin
|
||||
push_num(num1)
|
||||
push_num(num2)
|
||||
push_num(@num1)
|
||||
push_num(@num2)
|
||||
fpu:divXY()
|
||||
fpu:pullExt(@ext)
|
||||
return new_float(@ext)
|
||||
end
|
||||
|
||||
def natv_rem(symptr, expr)
|
||||
var num1, num2
|
||||
res[t_numfloat] num1, num2
|
||||
var[2] rem, div
|
||||
var[5] ext
|
||||
|
||||
num1 = eval_num(expr)
|
||||
num2 = eval_num(expr=>cdr)
|
||||
if num1->type == NUM_INT and num2->type == NUM_INT
|
||||
load32(num1 + intval)
|
||||
rem[1], rem[0] = div32(num2 + intval)
|
||||
memcpy(@num1, eval_num(expr), t_numfloat)
|
||||
memcpy(@num2, eval_num(expr=>cdr), t_numfloat)
|
||||
if num1.type == NUM_INT and num2.type == NUM_INT
|
||||
load32(@num1 + intval)
|
||||
rem[1], rem[0] = div32(@num2 + intval)
|
||||
return new_int(rem[0], rem[1])
|
||||
fin
|
||||
push_num(num1)
|
||||
push_num(num2)
|
||||
push_num(@num1)
|
||||
push_num(@num2)
|
||||
fpu:remXY()
|
||||
fpu:pullExt(@ext)
|
||||
return new_float(@ext)
|
||||
@ -257,34 +258,34 @@ def natv_neg(symptr, expr)
|
||||
end
|
||||
|
||||
def natv_gt(symptr, expr)
|
||||
var num1, num2
|
||||
res[t_numfloat] num1, num2
|
||||
var[5] ext
|
||||
|
||||
num1 = eval_num(expr)
|
||||
num2 = eval_num(expr=>cdr)
|
||||
if num1->type == NUM_INT and num2->type == NUM_INT
|
||||
load32(num1 + intval)
|
||||
return bool_pred(isgt32(num2 + intval))
|
||||
memcpy(@num1, eval_num(expr), t_numfloat)
|
||||
memcpy(@num2, eval_num(expr=>cdr), t_numfloat)
|
||||
if num1.type == NUM_INT and num2.type == NUM_INT
|
||||
load32(@num1 + intval)
|
||||
return bool_pred(isgt32(@num2 + intval))
|
||||
fin
|
||||
push_num(num2)
|
||||
push_num(num1)
|
||||
push_num(@num2)
|
||||
push_num(@num1)
|
||||
fpu:subXY()
|
||||
fpu:pullExt(@ext)
|
||||
return bool_pred(ext[4] < 0)
|
||||
end
|
||||
|
||||
def natv_lt(symptr, expr)
|
||||
var num1, num2
|
||||
res[t_numfloat] num1, num2
|
||||
var[5] ext
|
||||
|
||||
num1 = eval_num(expr)
|
||||
num2 = eval_num(expr=>cdr)
|
||||
if num1->type == NUM_INT and num2->type == NUM_INT
|
||||
load32(num1 + intval)
|
||||
return bool_pred(islt32(num2 + intval))
|
||||
memcpy(@num1, eval_num(expr), t_numfloat)
|
||||
memcpy(@num2, eval_num(expr=>cdr), t_numfloat)
|
||||
if num1.type == NUM_INT and num2.type == NUM_INT
|
||||
load32(@num1 + intval)
|
||||
return bool_pred(islt32(@num2 + intval))
|
||||
fin
|
||||
push_num(num1)
|
||||
push_num(num2)
|
||||
push_num(@num1)
|
||||
push_num(@num2)
|
||||
fpu:subXY()
|
||||
fpu:pullExt(@ext)
|
||||
return bool_pred(ext[4] < 0)
|
||||
|
@ -19,3 +19,9 @@
|
||||
))
|
||||
)
|
||||
)
|
||||
|
||||
(setq l1 '(a b c d e f))
|
||||
(setq l2 '(a c e g i k))
|
||||
(union l1 l2)
|
||||
(intersection l1 l2)
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user