//
// This file is part of the Jlisp implementation of Standard Lisp
// Copyright \u00a9 (C) Codemist Ltd, 1998-2000.
//
import java.io.*;
class LispVector extends LispObject
{
LispObject [] vec;
LispVector(int n)
{
vec = new LispObject [n];
for (int i=0; i<n; i++) vec[i] = Jlisp.nil;
}
LispVector(LispObject [] v)
{
vec = v;
}
LispObject eval()
{
return this;
}
void iprint()
{
if ((currentFlags & noLineBreak) == 0 &&
currentOutput.column + 1 > currentOutput.lineLength)
currentOutput.println();
currentOutput.print("[");
if (vec.length == 0)
{ if ((currentFlags & noLineBreak) == 0 &&
currentOutput.column + 1 > currentOutput.lineLength)
currentOutput.println();
currentOutput.print("]");
return;
}
if (vec[0] == null)
{ if ((currentFlags & noLineBreak) == 0 &&
currentOutput.column + 1 > currentOutput.lineLength)
currentOutput.println();
currentOutput.print(".");
}
else vec[0].iprint();
for (int i=1; i<vec.length; i++)
{ if (vec[i] == null)
{ if ((currentFlags & noLineBreak) == 0 &&
currentOutput.column + 1 >= currentOutput.lineLength)
currentOutput.println();
else currentOutput.print(" ");
currentOutput.print(".");
}
else vec[i].blankprint();
}
if ((currentFlags & noLineBreak) == 0 &&
currentOutput.column + 1 > currentOutput.lineLength)
currentOutput.println();
currentOutput.print("]");
}
void blankprint()
{
if ((currentFlags & noLineBreak) == 0 &&
currentOutput.column + 1 >= currentOutput.lineLength)
currentOutput.println();
else currentOutput.print(" ");
iprint();
}
public boolean lispequals(Object b)
{
if (!(b instanceof LispVector)) return false;
if (b == this) return true;
else if (this == Jlisp.obvector || b == Jlisp.obvector) return false;
LispVector vb = (LispVector)b;
if (vec.length != vb.vec.length) return false;
for (int i=0; i<vec.length; i++)
if (!vec[i].lispequals(vb.vec[i])) return false;
return true;
}
public int lisphashCode()
{
return lisphashCode(100);
}
int lisphashCode(int n)
{
int r = 19937;
for (int i=0; i<vec.length; i++)
{ LispObject b = vec[i];
if (b == null) r = 54321*r;
else if (!b.atom)
r = 169*r + ((Cons)b).lisphashCode(b, n-10);
else r = 0x8040201*r + b.lisphashCode();
}
return r;
}
void scan()
{
if (this == Jlisp.obvector) return;
if (Jlisp.objects.contains(this)) // seen before?
{ if (!Jlisp.repeatedObjects.containsKey(this))
{ Jlisp.repeatedObjects.put(
this,
Jlisp.nil); // value is junk at this stage
}
}
else Jlisp.objects.add(this);
for (int i=0; i<vec.length; i++)
Jlisp.stack.push(vec[i]);
}
void dump() throws IOException
{
if (this == Jlisp.obvector)
{ Jlisp.odump.write(X_OBLIST);
return;
}
Object w = Jlisp.repeatedObjects.get(this);
if (w != null &&
w instanceof Integer) putSharedRef(w); // processed before
else
{ if (w != null) // will be used again sometime
{ Jlisp.repeatedObjects.put(
this,
new Integer(Jlisp.sharedIndex++));
Jlisp.odump.write(X_STORE);
}
int length = vec.length;
putPrefix(length, X_VEC);
for (int i=0; i<length; i++)
Jlisp.stack.push(vec[i]);
}
}
}
// end of LispVector.java