hash table...again

[filox]

first of, i'd like to excuse myself for writing in this group, even though i
know this is not a standard C++ question. i've written to
microsoft.public.dotnet.lang.vc but no one seems to be answering me, and
it's pretty urgent.
any way, i have something like this:

hash_map<double, intmapa;

double md = 0;

for(int j=0;j<1000000;++j)

{

mapa[md] = 3;

md++;

}

as you can see, i'm simply trying to hash a lot of data. my problem is that
this uses up 70 MB of memory,which seems to me a bit too much. any ideas
what went wrong?
again, sorry for being offtopic

--
You're never too young to have a Vietnam flashback

[mlimber]

filox wrote:

first of, i'd like to excuse myself for writing in this group, even though i
know this is not a standard C++ question. i've written to
microsoft.public.dotnet.lang.vc but no one seems to be answering me, and
it's pretty urgent.

Actually, it's not off-topic. FAQ 5.9 says that the topic here is the
standard C++ language and libraries and "planned extensions and
adjustments." TR1, some planned extensions to the standard library,
includes unordered_map, which is (I believe) essentially the same as
hash_map but with a different name so as not to cause problems with
code using the common extension you are using.

any way, i have something like this:

hash_map<double, intmapa;

double md = 0;

for(int j=0;j<1000000;++j)

{

mapa[md] = 3;

md++;

}

as you can see, i'm simply trying to hash a lot of data. my problem is that
this uses up 70 MB of memory,which seems to me a bit too much. any ideas
what went wrong?

How do you know it takes 70 MB?

Cheers! --M

[filox]

"mlimber" <ml*****@gmail.comwrote in message
news:11********************@e64g2000cwd.googlegrou ps.com...

filox wrote:

>first of, i'd like to excuse myself for writing in this group, even
though i
know this is not a standard C++ question. i've written to
microsoft.public.dotnet.lang.vc but no one seems to be answering me, and
it's pretty urgent.

Actually, it's not off-topic. FAQ 5.9 says that the topic here is the
standard C++ language and libraries and "planned extensions and
adjustments." TR1, some planned extensions to the standard library,
includes unordered_map, which is (I believe) essentially the same as
hash_map but with a different name so as not to cause problems with
code using the common extension you are using.

>any way, i have something like this:

hash_map<double, intmapa;

double md = 0;

for(int j=0;j<1000000;++j)

{

mapa[md] = 3;

md++;

}

as you can see, i'm simply trying to hash a lot of data. my problem is
that
this uses up 70 MB of memory,which seems to me a bit too much. any ideas
what went wrong?

How do you know it takes 70 MB?

because the windows task manager says so...

[mlimber]

filox wrote:

"mlimber" <ml*****@gmail.comwrote

How do you know it takes 70 MB?

because the windows task manager says so...

>From what I've read, the Task Manager is not a trustworthy source of

information on this count. Ask about reliable ways to calculate memory
usage in a Windows newsgroup, and once you are confident in the
numbers, ask here again if necessary.

Cheers! --M

[loufoque]

filox wrote:

first of, i'd like to excuse myself for writing in this group, even though i
know this is not a standard C++ question. i've written to
microsoft.public.dotnet.lang.vc but no one seems to be answering me, and
it's pretty urgent.
any way, i have something like this:

hash_map<double, intmapa;

double md = 0;

for(int j=0;j<1000000;++j)

{

mapa[md] = 3;

md++;

}

as you can see, i'm simply trying to hash a lot of data. my problem is that
this uses up 70 MB of memory,which seems to me a bit too much. any ideas
what went wrong?

You could try to use the constructor to tell the container its size
beforehand, hence preventing multiple reallocation and exponential
memory reservation to amortize it.

[filox]

"loufoque" <lo******@remove.gmail.comwrote in message
news:45***********************@news.free.fr...

filox wrote:

>first of, i'd like to excuse myself for writing in this group, even
though i know this is not a standard C++ question. i've written to
microsoft.public.dotnet.lang.vc but no one seems to be answering me, and
it's pretty urgent.
any way, i have something like this:

hash_map<double, intmapa;

double md = 0;

for(int j=0;j<1000000;++j)

{

mapa[md] = 3;

md++;

}

as you can see, i'm simply trying to hash a lot of data. my problem is
that this uses up 70 MB of memory,which seems to me a bit too much. any
ideas what went wrong?

You could try to use the constructor to tell the container its size
beforehand, hence preventing multiple reallocation and exponential memory
reservation to amortize it.

that sounds like it could help. only, i don't know how to do it...
could you write an example how to call a constructor with a size of ,say,
100 bytes?

thanks

[loufoque]

filox wrote:

that sounds like it could help. only, i don't know how to do it...
could you write an example how to call a constructor with a size of ,say,
100 bytes?

1) I already told you it is in constructor
2) If you have doubts you should check your reference documentation
3) It is the same syntax than with all other containers.

[Pete Becker]

loufoque wrote:

filox wrote:

>that sounds like it could help. only, i don't know how to do it...
could you write an example how to call a constructor with a size of
,say, 100 bytes?

1) I already told you it is in constructor
2) If you have doubts you should check your reference documentation
3) It is the same syntax than with all other containers.

That's too broad. The standard sequence containers (vector, list, deque)
have constructors that initialize them with a specified number of
elements. The standard associative containers (set, multi_set, map,
multi_map) do not. Indeed, you wouldn't really want to create a
map<double, intwith 1,000,000 identical elements.

Associative containers allocate nodes as needed. There is no need for
exponential memory reservation.

--

-- Pete

Author of "The Standard C++ Library Extensions: a Tutorial and
Reference." For more information about this book, see
www.petebecker.com/tr1book.

[mlimber]

Pete Becker wrote:

loufoque wrote:

filox wrote:

that sounds like it could help. only, i don't know how to do it...
could you write an example how to call a constructor with a size of
,say, 100 bytes?

1) I already told you it is in constructor
2) If you have doubts you should check your reference documentation
3) It is the same syntax than with all other containers.

That's too broad. The standard sequence containers (vector, list, deque)
have constructors that initialize them with a specified number of
elements. The standard associative containers (set, multi_set, map,
multi_map) do not. Indeed, you wouldn't really want to create a
map<double, intwith 1,000,000 identical elements.

Moreover, you couldn't since a std::map's keys must be unique.

Associative containers allocate nodes as needed. There is no need for
exponential memory reservation.

Exactly. The resize member function for the SGI's hash_map
(http://www.sgi.com/tech/stl/HashedAs...Container.html) and the
constructor for SGI's and TR1's
(http://www.open-std.org/jtc1/sc22/wg...2005/n1836.pdf)
hash maps both accept a parameter specifying number of buckets (which
has to do with look-up speed), not number of allocated/reserved pairs.

Cheers! --M

[Pete Becker]

mlimber wrote:

Pete Becker wrote:

>loufoque wrote:

>>filox wrote:

that sounds like it could help. only, i don't know how to do it...
could you write an example how to call a constructor with a size of
,say, 100 bytes?
1) I already told you it is in constructor
2) If you have doubts you should check your reference documentation
3) It is the same syntax than with all other containers.

That's too broad. The standard sequence containers (vector, list, deque)
have constructors that initialize them with a specified number of
elements. The standard associative containers (set, multi_set, map,
multi_map) do not. Indeed, you wouldn't really want to create a
map<double, intwith 1,000,000 identical elements.

Moreover, you couldn't since a std::map's keys must be unique.

<gThat should have been multi_map.

--

-- Pete

Author of "The Standard C++ Library Extensions: a Tutorial and
Reference." For more information about this book, see
www.petebecker.com/tr1book.

[filox]

"mlimber" <ml*****@gmail.comwrote in message
news:11**********************@m73g2000cwd.googlegr oups.com...

filox wrote:

>"mlimber" <ml*****@gmail.comwrote

How do you know it takes 70 MB?

because the windows task manager says so...

>>From what I've read, the Task Manager is not a trustworthy source of

information on this count. Ask about reliable ways to calculate memory
usage in a Windows newsgroup, and once you are confident in the
numbers, ask here again if necessary.

Cheers! --M

i'm confident in the numbers...

[Pete Becker]

filox wrote:

"mlimber" <ml*****@gmail.comwrote in message
news:11**********************@m73g2000cwd.googlegr oups.com...

>filox wrote:

>>"mlimber" <ml*****@gmail.comwrote
How do you know it takes 70 MB?
because the windows task manager says so...
From what I've read, the Task Manager is not a trustworthy source of

information on this count. Ask about reliable ways to calculate memory
usage in a Windows newsgroup, and once you are confident in the
numbers, ask here again if necessary.

i'm confident in the numbers...

The numbers are right, but they're not saying what you think they're
saying. The task manager tells you the total amount of memory currently
assigned to each task. When you do a bunch of allocations the OS may
have to give the task more memory. The amount it gives the task will be
at least as much as the task has asked for, but it may be more, too.
Unless you know the details of how the OS decides to divvy up memory,
there's not much you can conclude about actual memory use from looking
at this number. The time to worry is if you've allocated 70MB and the
task manager says you have 10MB.

--

-- Pete

Author of "The Standard C++ Library Extensions: a Tutorial and
Reference." For more information about this book, see
www.petebecker.com/tr1book.