| |
 |
Monday, June 10, 2002 |
Class SortedList.
Following on from the previous entry, the System.Collections.SortedList class is available if you want a collection you can access by key but which is also ordered when enumerated. However I examined this class in mscorlib.dll using Anakrino and it is implemented using two arrays, one to hold the keys, the other to hold the values. Insertion and deletion is achieved by brute force copying of the array elements, so this is not going to perform very well for large collections (well, thats what I'd guess but I really should verify this with some sample code).
There is a useful brief overview of .NET collections in this article by Jeffrey Richter.
[I wonder how many developers recognized the origin of the name anakrino?] [Cook Computing]
4:27:18 PM 
|
|
ADO.NET and You - This month theRockford Lhotka teaches a crash course in ADO.NET that will have you creating, reading, updating, and deleting data using ADO.NET.
10:08:53 AM
|
|
Except the missing piece here is that Chris Sells is doing research into determinstic finalization on the platform, and I'd bet good money that it'll be tied somehow to IDisposable (i.e., objects that say they want disposable semantics will automatically get reference counts). At least, if I were doing it, that's the first thing I'd consider. [The .NET Guy]
Absolutely. This was also one of the things I suggested to John Lam when he made an RFC to the DOTNET list for suggestions on possible aspects he could write as examples for his CLAW technology. Here's a recap of our exchange:The entire thread of conversation can be viewed via the list archives.[Drew's Blog]
For those joing us late on Monday (those not obbessed enough to be blogging all weekend and reading this), this was initiated by my posts of .NET COM Interop is Flawed.
9:56:38 AM
|
|
© Copyright 2002 Sam Gentile.
|
|
|
|
|
