Hashtable Contains() - byte arrays as keys -

[Joseph Lee]

Hi All,

I am having problem when i am using hashtable to keep an array of bytes
value as keys.

Take a look at the code snippet below

---------------------------------------------------

ASCIIEncoding asciiEncoder = new ASCIIEncoding() ;
byte[] bArray = asciiEncoder.Ge tBytes("Test");

Hashtable ht = new Hashtable();
ht.Add(bArray," Some value");

byte[] bArrayNew = asciiEncoder.Ge tBytes("Test");

Console.WriteLi ne("Result : "+ ht.Contains(bAr ray)); //true
Console.WriteLi ne("Result : "+ ht.Contains(bAr rayNew)); //false
Console.Read();

--------------------------------------------------

As seen here, by using the same object , the contains() will return true,
while using a new object with same 'value' returns false. If I am correct
the contains() command does not look at the values in an object. As for
primitive types like normal string, int and etc, it does not have any
problem.

So I was wondering if there is anyway i can keep byte arrays as keys in
hashtable and still find it in the time complexity of O(1). If i read all
the keys out and make a byte comparison it would be O(n) time complexity,
thus defeating the purpose of a hash table.

Is there any other command in hashtable or some functions i can overwrite?
Would prefer a much simpler way if possible.

Thanks in advance

Joseph Lee

[Bob Grommes]

You are correct; any array or collection object would test for the object
reference, not the contents. A match of an arbitrary number of items in a
collection would be cost-prohibitive.

Why do you need to match a byte array? What are you trying to accomplish?
Maybe there's a different approach.

--Bob

"Joseph Lee" <jo*********@ho tmail.com> wrote in message
news:ed******** *****@TK2MSFTNG P12.phx.gbl...

Hi All,

I am having problem when i am using hashtable to keep an array of bytes
value as keys.

[Rakesh Rajan]

As Bob said, it's the reference that is being tested and not the contents. If
I remember right, searching in the lines of overriding Equals and GetHashCode
might help. Sorry, I can't recollect them now...
"Joseph Lee" wrote:

Hi All,

I am having problem when i am using hashtable to keep an array of bytes
value as keys.

Take a look at the code snippet below

---------------------------------------------------

ASCIIEncoding asciiEncoder = new ASCIIEncoding() ;
byte[] bArray = asciiEncoder.Ge tBytes("Test");

Hashtable ht = new Hashtable();
ht.Add(bArray," Some value");

byte[] bArrayNew = asciiEncoder.Ge tBytes("Test");

Console.WriteLi ne("Result : "+ ht.Contains(bAr ray)); //true
Console.WriteLi ne("Result : "+ ht.Contains(bAr rayNew)); //false
Console.Read();

--------------------------------------------------

As seen here, by using the same object , the contains() will return true,
while using a new object with same 'value' returns false. If I am correct
the contains() command does not look at the values in an object. As for
primitive types like normal string, int and etc, it does not have any
problem.

So I was wondering if there is anyway i can keep byte arrays as keys in
hashtable and still find it in the time complexity of O(1). If i read all
the keys out and make a byte comparison it would be O(n) time complexity,
thus defeating the purpose of a hash table.

Is there any other command in hashtable or some functions i can overwrite?
Would prefer a much simpler way if possible.

Thanks in advance

Joseph Lee

[Joseph Lee]

I have a list of encrypted keywords and all of them are in an array of byte.
So I am trying to keep those keyword as keys in a hashtable for fast lookup,
then i will be able retrieve some information which is in the value part of
the hashtable

Joey

"Bob Grommes" <bo*@bobgrommes .com> wrote in message
news:#V******** ******@tk2msftn gp13.phx.gbl...

You are correct; any array or collection object would test for the object
reference, not the contents. A match of an arbitrary number of items in a
collection would be cost-prohibitive.

Why do you need to match a byte array? What are you trying to accomplish?
Maybe there's a different approach.

--Bob

"Joseph Lee" <jo*********@ho tmail.com> wrote in message
news:ed******** *****@TK2MSFTNG P12.phx.gbl...

Hi All,

I am having problem when i am using hashtable to keep an array of bytes
value as keys.

[Joseph Lee]

ic, i will look into it. Thanks

Joey

"Rakesh Rajan" <Ra*********@di scussions.micro soft.com> wrote in message
news:87******** *************** ***********@mic rosoft.com...

As Bob said, it's the reference that is being tested and not the contents. If I remember right, searching in the lines of overriding Equals and GetHashCode might help. Sorry, I can't recollect them now...
"Joseph Lee" wrote:

Hi All,

I am having problem when i am using hashtable to keep an array of bytes
value as keys.

Take a look at the code snippet below

---------------------------------------------------

ASCIIEncoding asciiEncoder = new ASCIIEncoding() ;
byte[] bArray = asciiEncoder.Ge tBytes("Test");

Hashtable ht = new Hashtable();
ht.Add(bArray," Some value");

byte[] bArrayNew = asciiEncoder.Ge tBytes("Test");

Console.WriteLi ne("Result : "+ ht.Contains(bAr ray)); //true
Console.WriteLi ne("Result : "+ ht.Contains(bAr rayNew)); //false
Console.Read();

--------------------------------------------------

As seen here, by using the same object , the contains() will return true, while using a new object with same 'value' returns false. If I am correct the contains() command does not look at the values in an object. As for
primitive types like normal string, int and etc, it does not have any
problem.

So I was wondering if there is anyway i can keep byte arrays as keys in
hashtable and still find it in the time complexity of O(1). If i read all the keys out and make a byte comparison it would be O(n) time complexity, thus defeating the purpose of a hash table.

Is there any other command in hashtable or some functions i can overwrite? Would prefer a much simpler way if possible.

Thanks in advance

Joseph Lee

[mikeb]

Joseph Lee wrote:

ic, i will look into it. Thanks
You can create your Hashtable with custom Hashcode provider and comparer.

Look at the Hashtable( IHashCodeProvid er, IComparer) constructor.

With a Hashtable created with that constructor you can provide your own
methods for comparing the byte arrays instead of using the default
methods provided by the Array class.

Joey

"Rakesh Rajan" <Ra*********@di scussions.micro soft.com> wrote in message
news:87******** *************** ***********@mic rosoft.com...

As Bob said, it's the reference that is being tested and not the contents.

If

I remember right, searching in the lines of overriding Equals and

GetHashCode

might help. Sorry, I can't recollect them now...
"Joseph Lee" wrote:

Hi All,

I am having problem when i am using hashtable to keep an array of bytes
value as keys.

Take a look at the code snippet below

---------------------------------------------------

ASCIIEncodin g asciiEncoder = new ASCIIEncoding() ;
byte[] bArray = asciiEncoder.Ge tBytes("Test");

Hashtable ht = new Hashtable();
ht.Add(bArra y,"Some value");

byte[] bArrayNew = asciiEncoder.Ge tBytes("Test");

Console.Writ eLine("Result : "+ ht.Contains(bAr ray)); //true
Console.Writ eLine("Result : "+ ht.Contains(bAr rayNew)); //false
Console.Read ();

--------------------------------------------------

As seen here, by using the same object , the contains() will return
true,
while using a new object with same 'value' returns false. If I am
correct
the contains() command does not look at the values in an object. As for
primitive types like normal string, int and etc, it does not have any
problem.

So I was wondering if there is anyway i can keep byte arrays as keys in
hashtable and still find it in the time complexity of O(1). If i read
all
the keys out and make a byte comparison it would be O(n) time
complexity,
thus defeating the purpose of a hash table.

Is there any other command in hashtable or some functions i can
overwrite?
Would prefer a much simpler way if possible.

Thanks in advance

Joseph Lee

--
mikeb

[Rakesh Rajan]

But that would again mean he will have to iterate and compare each entries
right? Wonder whether there are any other efficient implementations ?
"mikeb" wrote:

Joseph Lee wrote:

ic, i will look into it. Thanks

You can create your Hashtable with custom Hashcode provider and comparer.

Look at the Hashtable( IHashCodeProvid er, IComparer) constructor.

With a Hashtable created with that constructor you can provide your own
methods for comparing the byte arrays instead of using the default
methods provided by the Array class.

Joey

"Rakesh Rajan" <Ra*********@di scussions.micro soft.com> wrote in message
news:87******** *************** ***********@mic rosoft.com...

As Bob said, it's the reference that is being tested and not the contents.

If

I remember right, searching in the lines of overriding Equals and

GetHashCode

might help. Sorry, I can't recollect them now...
"Joseph Lee" wrote:
Hi All,

I am having problem when i am using hashtable to keep an array of bytes
value as keys.

Take a look at the code snippet below

---------------------------------------------------

ASCIIEncodin g asciiEncoder = new ASCIIEncoding() ;
byte[] bArray = asciiEncoder.Ge tBytes("Test");

Hashtable ht = new Hashtable();
ht.Add(bArra y,"Some value");

byte[] bArrayNew = asciiEncoder.Ge tBytes("Test");

Console.Writ eLine("Result : "+ ht.Contains(bAr ray)); //true
Console.Writ eLine("Result : "+ ht.Contains(bAr rayNew)); //false
Console.Read ();

--------------------------------------------------

As seen here, by using the same object , the contains() will return

true,

while using a new object with same 'value' returns false. If I am

correct

the contains() command does not look at the values in an object. As for
primitive types like normal string, int and etc, it does not have any
problem.

So I was wondering if there is anyway i can keep byte arrays as keys in
hashtable and still find it in the time complexity of O(1). If i read

all

the keys out and make a byte comparison it would be O(n) time

complexity,

thus defeating the purpose of a hash table.

Is there any other command in hashtable or some functions i can

overwrite?

Would prefer a much simpler way if possible.

Thanks in advance

Joseph Lee

--
mikeb

[mikeb]

Rakesh Rajan wrote:

But that would again mean he will have to iterate and compare each entries
right? Wonder whether there are any other efficient implementations ?
Assuming I understand his problem (that he needs the byte arrays to
perform a 'deep' compare of the contents of the arrays), then yes -
these interface implementations would need to generate a hash value that
was dependent on the contents of the byte array and to compare the
entries of the arrays.

The check for equality could certainly have some short cuts so that a
member-by-member comparison might not always be needed:

1) if there's reference equality, the arrays are by definition equal
2) if the array lengths are different, then the arrays must not be
equal.

The hashcode might be cacheable if the byte arrays are not changed once
they are created. Indeed, once the byte arrays are added to the
hashtable, it would be a bug to modify them in such a way that the
hashcode (or equality test) would render different results.

There may be other techniques that can improve the efficiency
(particularly if unsafe code can be used). However, my main point was
that there's a way for the OP to get the behavior he needs without too
much work.

Performance is of no consequence if things don't even work correctly in
the first place.


"mikeb" wrote:

Joseph Lee wrote:

ic, i will look into it. Thanks

You can create your Hashtable with custom Hashcode provider and comparer.

Look at the Hashtable( IHashCodeProvid er, IComparer) constructor.

With a Hashtable created with that constructor you can provide your own
methods for comparing the byte arrays instead of using the default
methods provided by the Array class.

Joey

"Rakesh Rajan" <Ra*********@di scussions.micro soft.com> wrote in message
news:87***** *************** **************@ microsoft.com.. .
As Bob said, it's the reference that is being tested and not the contents.

If
I remember right, searching in the lines of overriding Equals and

GetHashCod e
might help. Sorry, I can't recollect them now...
"Joseph Lee" wrote:

>Hi All,
>
>I am having problem when i am using hashtable to keep an array of bytes
>value as keys.
>
>Take a look at the code snippet below
>
>---------------------------------------------------
>
>ASCIIEncod ing asciiEncoder = new ASCIIEncoding() ;
>byte[] bArray = asciiEncoder.Ge tBytes("Test");
>
>Hashtabl e ht = new Hashtable();
>ht.Add(bAr ray,"Some value");
>
>byte[] bArrayNew = asciiEncoder.Ge tBytes("Test");
>
>Console.Wr iteLine("Result : "+ ht.Contains(bAr ray)); //true
>Console.Wr iteLine("Result : "+ ht.Contains(bAr rayNew)); //false
>Console.Re ad();
>
>--------------------------------------------------
>
>As seen here, by using the same object , the contains() will return

true,
>while using a new object with same 'value' returns false. If I am

correct
>the contains() command does not look at the values in an object. As for
>primitiv e types like normal string, int and etc, it does not have any
>problem.
>
>So I was wondering if there is anyway i can keep byte arrays as keys in
>hashtabl e and still find it in the time complexity of O(1). If i read

all
>the keys out and make a byte comparison it would be O(n) time

complexity ,
>thus defeating the purpose of a hash table.
>
>Is there any other command in hashtable or some functions i can

overwrite?
>Would prefer a much simpler way if possible.
>
>Thanks in advance
>
>Joseph Lee
>
>
>

--
mikeb

--
mikeb