🚀 go-pugleaf

I dount it will be depreciated ever since it is a well known
stucture/algorithm. It may however, be superceeded by other data stuctures,
but I am sure it wont become obsolete.

"BH" <bobcat99@usa.net> wrote in message
news:dyp07.64$c3.37126@newsrump.sjc.telocity.net...
> I'm using Vector in the application I'm developing now but a colleague
told
> me that Vector is deprecated in Java 2.  The java doc doesn't mention
> whether it's deprecated or not.  I just want to make sure.  Could someone
> help?
>
> Thanks a lot
> Bob
>
>
>
>
>
>

"BH" <bobcat99@usa.net> wrote in message
news:dyp07.64$c3.37126@newsrump.sjc.telocity.net...
> I'm using Vector in the application I'm developing now but a colleague
told
> me that Vector is deprecated in Java 2.  The java doc doesn't mention
> whether it's deprecated or not.  I just want to make sure.  Could someone
> help?
>
> Thanks a lot
> Bob
>
>
>
>
>
>

There may be some deprecated API inside of Vector, but the class as a whole
is not. I doubt it
will be.

- pete

No Vector is not depreciated, however unless you are doing a threaded
application where multiple threads accessing the Vector may be dangerous,
you shouldn't use the Vector class.

What your colleague meant was that with Java 1.2, the re-did the API a
little (Vector wasn't very well written in the first place - its methods,
pre Java 1.2, are mostly final and synchronized). The BETTER class to use is
from the Collection framework (to which Vector now belongs). There are four
major classes that can be used to dynamically store any number of Objects.

java.util.ArrayList : Basically just like Vector, except that the methods
aren't final and synchronized. Great if you need to loop through the list a
lot as it is basically an array. Bad if you need to insert into the list, as
items in the list have to be copied to accomidate the insert.

java.util.LinkedList : If you don't know what a linked list is, go back to
school. This class is good if you do a lot of insert and delete operations.
Slower to find items not at the begining of the list (if you have 1000 items
and want the 900th item, you have to 'walk' through 899 links instead of
just getting the object you want.

java.util.TreeSet : Two important features - sorted, and its a set (no
duplicates allowed). This means your objects need to have .equals() defined
to make sence (for custom classes) and the need to implement the comparable
interface. Use when sorting and searching are priorities.

java.util.HashSet : Again this is a set, so uniqueness is a feature. The
biggest feature is order 1 lookup. Here your Objects need to implement
.equals() and .hashcode() properly.

Most likely, since you were using Vector, you should use instances of
ArrayList, but using them as Collection objects will let you make the change
to another specific type, if your needs change.


"BH" <bobcat99@usa.net> wrote in message
news:dyp07.64$c3.37126@newsrump.sjc.telocity.net...
> I'm using Vector in the application I'm developing now but a colleague
told
> me that Vector is deprecated in Java 2.  The java doc doesn't mention
> whether it's deprecated or not.  I just want to make sure.  Could someone
> help?
>
> Thanks a lot
> Bob
>
>
>
>
>
>