throwAXIfNull(c_lass, "c_lass", "add");
if(bsd == null) {
//This is the first element.
bsd = new BinarySearchData(1, true);
v.add(new ClassStuff(c_lass));
return;
}
//There is the second or subsequent element. Insert it at
//the proper place.
bsd.reset();
int iClosest = -1;
while(bsd.getIdxMiddle() != -1) {
iClosest = bsd.getIdxMiddle();
String sMiddle = ((ClassStuff)v.elementAt(bsd.getIdxMiddle())).cThis.getName();
int iCmpr = c_lass.getName().compareTo(sMiddle);
if(iCmpr == 0) {
throwAX("add: c_lass '" + c_lass.getName() + "' already exists.");
}
bsd.prepareForNextSearch(iCmpr < 0);
}
v.insertElementAt(new ClassStuff(c_lass), iClosest);
}