contact - Githubissues

Hi,

Impossible to conctact you with the email :
-------------------------------------------------------------------------
We're writing to let you know that the group that you tried to contact
(google-sparsehash) either doesn't exist, or you don't have permission to post
to it. There are a few possible reasons why this happened:

 * You might have spelled or formatted the group name incorrectly.
 * The owner of the group removed this group, so there's nobody there to
contact.
 * You may need to join the group before being allowed to post.
 * This group may not be open to posting.

 If you have questions about this or any other group, please visit the Google
Groups Help Center at http://groups.google.com/support.

 Thanks, and we hope you'll continue to enjoy Google Groups.

 The Google Groups Team
-------------------------------------------------------------------------

If i use a set_empty_key(0), i have to check if one of my arg is not NULL
unless it try to access getVertex on a null pointer.

if(n2==NULL)
            return false;

if(n1==NULL || n2==NULL)
            return false;
I get assertion : Assertion failed: num_probes < bucket_count(), file
d:\dev\oofelie\oo-src\oofelie\o
le.h, line 719

And as you said earlier
if(n2==NULL)
            return true;
Assertion failed: !use_empty || !equals(get_key(obj), get_key(emptyval)),
file d:\d
elset.d\google\densehashtable.h, line 764

So I don't know how to do?

Moreover, on nearly similar topic, i already have another algo doing the
same that  uses a C array of std::vector< XFace *> with at index i of the C
array all the faces that have a vertex id ==i. And this algo, by doing hand
comparison is again faster than MSFT hash_set. It seems that the time of
insertion in hash_set is the cause, because when i add an insertion in
hash_set in same algo the timing are the same.

Sorry to use the issues so much
Etienne
Original issue reported on code.google.com by ory...@gmail.com on 27 Feb 2009 at 11:29
chenan2005 / sparsehash

contact #33
