c++ equivalent of java collections

[3rdshiftcoder]

hi-

where would someone find things like lists, sets, map classes like a
hash map or tree map. not specifically those but in general is there
a book section that deals with it? in java you can use the interface
to these without having to know all of the implementation details.
is there an interface to a library with these kind of methods in c++?

i knew a little c++ from 2 really basic introductory courses.
however, each time we wanted this functionality we had to program
it. an example where this would be cool is if i wanted a data structure
that TCL didn't have. i could extend TCL with C++.

thanks for letting me know what people use.
jim

[3rdshiftcoder]

i just found a listing point to the STL.
thanks,
later

[Gianni Mariani]

3rdshiftcoder wrote:

hi-

where would someone find things like lists, sets, map classes like a
hash map or tree map. not specifically those but in general is there
a book section that deals with it?

This is referred to as the "standard template library" (STL) and is a
normative part of the C++ standard. Not only does the STL encompass
containers like you have mentioned but also algorithms like sort or find.

There are many books that discuss these.

The "reference" I used often but it is a little dated is the SGI web
site on the STL (I have not looked at them for a while myself - maybe it
is updated).
http://www.sgi.com/tech/stl/

SGI has implemented some containers that are not part of the standard so
you need to be a little careful.

The ones you will use almost all the time in modern c++ code are:

basic_string
vector
list
map
sort
The ones I know are not part of the current standard are:

hash_map
rope

.... probably others.

The SGI examples are missing a few namespace specifiers. Usually a
using namespace std; somewhere in the example fixes those probs.

[3rdshiftcoder]

Hi Gianni -

that is a very cool link :-)
i think this is worth checking out !
the first 2 semesters of coding at school were very basic.
this is definitely some of the stuff that is missing.

thanks very much,
jim


"Gianni Mariani" <gi*******@mari ani.wswrote in message
news:46******** *************** @per-qv1-newsreader-01.iinet.net.au ...

3rdshiftcoder wrote:

>hi-

where would someone find things like lists, sets, map classes like a
hash map or tree map. not specifically those but in general is there
a book section that deals with it?

This is referred to as the "standard template library" (STL) and is a
normative part of the C++ standard. Not only does the STL encompass
containers like you have mentioned but also algorithms like sort or find.

There are many books that discuss these.

The "reference" I used often but it is a little dated is the SGI web site
on the STL (I have not looked at them for a while myself - maybe it is
updated).
http://www.sgi.com/tech/stl/

SGI has implemented some containers that are not part of the standard so
you need to be a little careful.

The ones you will use almost all the time in modern c++ code are:

basic_string
vector
list
map
sort
The ones I know are not part of the current standard are:

hash_map
rope

... probably others.

The SGI examples are missing a few namespace specifiers. Usually a using
namespace std; somewhere in the example fixes those probs.

[Roland Pibinger]

On Tue, 19 Jun 2007 00:36:32 -0400, "3rdshiftco der" wrote:

>where would someone find things like lists, sets, map classes like a
hash map or tree map. not specifically those but in general is there
a book section that deals with it? in java you can use the interface
to these without having to know all of the implementation details.
is there an interface to a library with these kind of methods in c++?

Actually, there is no equivalent for Java collections in Standard C++.
Java collections work only with objects but not with values, Standard
C++ collections (a.k.a. STL) work only with values but not with
objects.
--
Roland Pibinger
"The best software is simple, elegant, and full of drama" - Grady Booch

[=?ISO-8859-1?Q?Erik_Wikstr=F6m?=]

On 2007-06-19 07:27, 3rdshiftcoder wrote:

"Gianni Mariani" <gi*******@mari ani.wswrote in message
news:46******** *************** @per-qv1-newsreader-01.iinet.net.au ...

>3rdshiftcode r wrote:

>>hi-

where would someone find things like lists, sets, map classes like a
hash map or tree map. not specifically those but in general is there
a book section that deals with it?

This is referred to as the "standard template library" (STL) and is a
normative part of the C++ standard. Not only does the STL encompass
containers like you have mentioned but also algorithms like sort or find.

There are many books that discuss these.

The "reference" I used often but it is a little dated is the SGI web site
on the STL (I have not looked at them for a while myself - maybe it is
updated).
http://www.sgi.com/tech/stl/

SGI has implemented some containers that are not part of the standard so
you need to be a little careful.

The ones you will use almost all the time in modern c++ code are:

basic_string
vector
list
map
sort
The ones I know are not part of the current standard are:

hash_map
rope

... probably others.

The SGI examples are missing a few namespace specifiers. Usually a using
namespace std; somewhere in the example fixes those probs.

Hi Gianni -

that is a very cool link :-)
i think this is worth checking out !
the first 2 semesters of coding at school were very basic.
this is definitely some of the stuff that is missing.

Please, try not to top-post (fixed here), it makes it much harder to
read your posts and there are people who will not reply to people who
top-post which means you might miss out on some valuable information.

Another link to check out would be the following: www.cppreference.com,
which I believe is fully standards compliant and quite easy to navigate.

--
Erik Wikström

[JH Trauntvein]

On Jun 19, 1:37 am, rpbg...@yahoo.c om (Roland Pibinger) wrote:

On Tue, 19 Jun 2007 00:36:32 -0400, "3rdshiftco der" wrote:

where would someone find things like lists, sets, map classes like a
hash map or tree map. not specifically those but in general is there
a book section that deals with it? in java you can use the interface
to these without having to know all of the implementation details.
is there an interface to a library with these kind of methods in c++?

Actually, there is no equivalent for Java collections in Standard C++.
Java collections work only with objects but not with values, Standard
C++ collections (a.k.a. STL) work only with values but not with
objects.

Having worked with both, I can kind of see what you mean. However, I
fundamentally disagree
with what you imply. It is true that c++ standard containers are by
value but there is no
restriction whatsoever regarding the type of that value. The value
can be a class in which
case, the objects themselves will be copied, potentially many times.
You can specify that
the containers carry pointers to objects. Finally, you can specify
that the containers can
carry shared pointers to objects which provide the same basic
advantages as Java's school marm
garbage collection.

regards,

Jon Trauntvein

[Lance Diduck]

On Jun 19, 3:37 am, rpbg...@yahoo.c om (Roland Pibinger) wrote:

Actually, there is no equivalent for Java collections in Standard C++.
Java collections work only with objects but not with values, Standard
C++ collections (a.k.a. STL) work only with values but not with
objects.

In a frameowrk like COM, where everything already inherits from
IUnknown, tt is easy to use a shared pointer, and have something that
can store references to any object.
Even with such a framework, I agree that it is fairly difficult to
emulate Java Collections using C++. However, I have found the model
useful in some cases, when I want to model a sequence or collection in
an abstract interface.
In other words you have something like:
tempalte <class Tstruct Collection{
Iterator<Tbegin ()=0;
Iterator<Tend() =0;
ConstIterator<T begin()const=0;
ConstIterator<T end()const=0;
bool empty()const=0;
std::size_t size()const=0;

//plus all the requred typedefs
};
I have actually gotten this to work for read-only containers that
return const InputIterators. But going further (e.g. Forward
iterators, modifyable containers) was a lot of work for little
payoff.

[James Kanze]

On Jun 19, 9:37 am, rpbg...@yahoo.c om (Roland Pibinger) wrote:

On Tue, 19 Jun 2007 00:36:32 -0400, "3rdshiftco der" wrote:

where would someone find things like lists, sets, map classes like a
hash map or tree map. not specifically those but in general is there
a book section that deals with it? in java you can use the interface
to these without having to know all of the implementation details.
is there an interface to a library with these kind of methods in c++?

Actually, there is no equivalent for Java collections in Standard C++.
Java collections work only with objects but not with values, Standard
C++ collections (a.k.a. STL) work only with values but not with
objects.

That's to be expected, since C++ as a language works only with
values, where as Java works mainly with pointers. In this
respect, each of the libraries "fits in" with the language; a
C++ library which worked with pointers would be
counter-intuitive.

On the the other hand, the interfaces of the collections are
significantly different---the C++ two iterator idiom makes most
things significantly more verbose, is much more awkward to work
with, and much less flexible. (Of course, the Java iterator
combines access and increment, which has a few drawbacks as
well.)

--
James Kanze (GABI Software, from CAI) email:ja******* **@gmail.com
Conseils en informatique orientée objet/
Beratung in objektorientier ter Datenverarbeitu ng
9 place Sémard, 78210 St.-Cyr-l'École, France, [phone]

[Roland Pibinger]

On Tue, 19 Jun 2007 11:16:27 -0000, JH Trauntvein wrote:

>Having worked with both, I can kind of see what you mean. However, I
fundamentall y disagree
with what you imply. It is true that c++ standard containers are by
value but there is no
restriction whatsoever regarding the type of that value. The value
can be a class in which
case, the objects themselves will be copied, potentially many times.
You can specify that
the containers carry pointers to objects.

You are right that the container value type can be a value or a
pointer to an object. But nevertheless STL is designed with 'value
semantics' in mind, e.g.

std::vector<T*v ;
std::sort (v.begin(), v.end());

compiles but gives false results.

>Finally, you can specify that the containers can
carry shared pointers to objects

pointers in C/C++ are shared by default ;-)
--
Roland Pibinger
"The best software is simple, elegant, and full of drama" - Grady Booch