org.xith3d.utility.general
Class SparseVector<T>
java.lang.Object
org.xith3d.utility.general.SparseVector<T>
public class SparseVector<T>
- extends java.lang.Object
:Id: SparseVector.java,v 1.5 2003/02/24 00:13:51 wurp Exp $
:Log: SparseVector.java,v $
Revision 1.5 2003/02/24 00:13:51 wurp
Formatted all java code for cvs (strictSunConvention.xml)
Revision 1.4 2001/06/20 04:05:42 wurp
added log4j.
Revision 1.3 2001/01/28 07:52:20 wurp
Removed from Id and Log in log comments.
Added several new commands to AdminApp
Unfortunately, several other changes that I have lost track of. Try diffing this
version with the previous one.
Revision 1.2 2000/12/16 22:07:33 wurp
Added Id and Log to almost all of the files that didn't have it. It's
possible that the script screwed something up. I did a commit and an update
right before I ran the script, so if a file is screwed up you should be able
to fix it by just going to the version before this one.
|
Method Summary |
T |
elementAt(int i)
|
void |
insertAt(int i,
T obj)
Inserts the element at the location specified. |
void |
removeAt(int i)
Removes the specified element from the list. |
void |
sortElements(java.util.ArrayList<T> within,
java.util.ArrayList<T> without,
int start,
int stop)
Sorts all the elements into two categories, those that fall within certain
certain bounds, and those that fall without those same bounds. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
SparseVector
public SparseVector()
insertAt
public void insertAt(int i,
T obj)
- Inserts the element at the location specified. If the element already exists then
the object will be replaced
elementAt
public T elementAt(int i)
- Returns:
- the element at the location specified or null if the
the object does not exist
removeAt
public void removeAt(int i)
- Removes the specified element from the list.
sortElements
public void sortElements(java.util.ArrayList<T> within,
java.util.ArrayList<T> without,
int start,
int stop)
- Sorts all the elements into two categories, those that fall within certain
certain bounds, and those that fall without those same bounds.