76 lines
1.0 KiB
C++
76 lines
1.0 KiB
C++
#include "stdafx.h"
|
|
|
|
//-----------------------------------------------------------------------------
|
|
//
|
|
// Scan expr for vars, return in vector
|
|
//
|
|
// Input: Expression on stack
|
|
//
|
|
// Output: Vector
|
|
//
|
|
//-----------------------------------------------------------------------------
|
|
|
|
#include "defs.h"
|
|
|
|
static void __scan(U *);
|
|
static int __cmp(const void *, const void *);
|
|
|
|
static int h;
|
|
|
|
void
|
|
variables(void)
|
|
{
|
|
int i, n;
|
|
|
|
save();
|
|
|
|
p1 = pop();
|
|
|
|
h = tos;
|
|
|
|
__scan(p1);
|
|
|
|
n = tos - h;
|
|
|
|
if (n > 1)
|
|
qsort(stack + h, n, sizeof (U *), __cmp);
|
|
|
|
p1 = alloc_tensor(n);
|
|
|
|
p1->u.tensor->ndim = 1;
|
|
p1->u.tensor->dim[0] = n;
|
|
|
|
for (i = 0; i < n; i++)
|
|
p1->u.tensor->elem[i] = stack[i];
|
|
|
|
tos = h;
|
|
|
|
push(p1);
|
|
|
|
restore();
|
|
}
|
|
|
|
static void
|
|
__scan(U *p)
|
|
{
|
|
int i;
|
|
if (iscons(p)) {
|
|
p1 = cdr(p);
|
|
while (iscons(p)) {
|
|
__scan(car(p));
|
|
p = cdr(p);
|
|
}
|
|
} else if (issymbol(p) && p != symbol(E)) {
|
|
for (i = h; i < tos; i++)
|
|
if (stack[i] == p)
|
|
return;
|
|
push(p);
|
|
}
|
|
}
|
|
|
|
static int
|
|
__cmp(const void *p1, const void *p2)
|
|
{
|
|
return cmp_expr(*((U **) p1), *((U **) p2));
|
|
}
|