Re: Idea for ECMA/C# Standard - compile time hash for performance
- From: "Bruce Wood" <brucewood@xxxxxxxxxx>
- Date: 7 Apr 2005 13:51:19 -0700
So...
You have an integer value and you need to get something based on that
value.
The set of integers never changes. It is always the same. The same
integer always maps to the same object.
The range of the set is very large and very sparse, so using the
integers as array indices is a non-starter. (How large is the range,
anyway, and how sparse? What is the min and max of the integer values?
How many objects are there, in the end?)
Did I miss anything?
.
- Follow-Ups:
- References:
- Idea for ECMA/C# Standard - compile time hash for performance
- From: wxs
- Re: Idea for ECMA/C# Standard - compile time hash for performance
- From: Bruce Wood
- Re: Idea for ECMA/C# Standard - compile time hash for performance
- From: WXS
- Re: Idea for ECMA/C# Standard - compile time hash for performance
- From: WXS
- Re: Idea for ECMA/C# Standard - compile time hash for performance
- From: Bruce Wood
- Re: Idea for ECMA/C# Standard - compile time hash for performance
- From: WXS
- Idea for ECMA/C# Standard - compile time hash for performance
- Prev by Date: Integrated Security
- Next by Date: Deep/Shallow copy when returning objects (DataTable) from methods
- Previous by thread: Re: Idea for ECMA/C# Standard - compile time hash for performance
- Next by thread: Re: Idea for ECMA/C# Standard - compile time hash for performance
- Index(es):
Relevant Pages
|