<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>What's under the hood? [Ariel Weinstein]</title><link>http://blogs.msdn.com/bclteam/archive/2005/08/06/448134.aspx</link><description>Well, I tried to solicit email from you with any cool ideas you have for Collections, ServiceProcesses, and Diagnostics, but that front has been a bit quiet. Thats quite ok though, because there is something else I would like to touch on today. My main</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>re: What's under the hood? [Ariel Weinstein]</title><link>http://blogs.msdn.com/bclteam/archive/2005/08/06/448134.aspx#448222</link><pubDate>Fri, 05 Aug 2005 20:49:03 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:448222</guid><dc:creator>jgalla</dc:creator><description>My thoughts are that the documentation should include the algorithmic complexity of a particular operation.  For example, I might not need to know exactly how a particular operation is performed, but I would like to know what the cost might be to use a particular function.  There are many libraries (the C++ STL comes to mind) that does a fairly good job of providing such information. </description></item><item><title>re: What's under the hood? [Ariel Weinstein]</title><link>http://blogs.msdn.com/bclteam/archive/2005/08/06/448134.aspx#448267</link><pubDate>Fri, 05 Aug 2005 22:11:48 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:448267</guid><dc:creator>Dmitry</dc:creator><description>+1 to describe asymptotic behaviours for memory and speed.&lt;br&gt;&lt;br&gt;Also could please describe the reasons for such a small set of collection classes?</description></item><item><title>re: What's under the hood? [Ariel Weinstein]</title><link>http://blogs.msdn.com/bclteam/archive/2005/08/06/448134.aspx#448642</link><pubDate>Sun, 07 Aug 2005 04:34:43 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:448642</guid><dc:creator>Milan Negovan</dc:creator><description>Collections are my biggest pet peeve with .NET. :) I've posted my views on collections at &lt;a rel="nofollow" target="_new" href="http://aspnetresources.com/blog/dotnet_collection_madness.aspx"&gt;http://aspnetresources.com/blog/dotnet_collection_madness.aspx&lt;/a&gt; and &lt;a rel="nofollow" target="_new" href="http://aspnetresources.com/blog/dotnet_collection_madness2.aspx"&gt;http://aspnetresources.com/blog/dotnet_collection_madness2.aspx&lt;/a&gt;.</description></item><item><title>re: What's under the hood? [Ariel Weinstein]</title><link>http://blogs.msdn.com/bclteam/archive/2005/08/06/448134.aspx#449123</link><pubDate>Mon, 08 Aug 2005 22:26:35 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:449123</guid><dc:creator>Michael Vanhoutte</dc:creator><description>I agree with jgalla. Often I want to have an idea of the algorithm used internally, not because I really want to know how it works, but because I want to have an idea of how fast a particular method works. Since most of these algorithms are not documented, I currently use reflector to learn what I want to know.</description></item><item><title>re: What's under the hood? [Ariel Weinstein]</title><link>http://blogs.msdn.com/bclteam/archive/2005/08/06/448134.aspx#449156</link><pubDate>Mon, 08 Aug 2005 23:32:37 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:449156</guid><dc:creator>Geoff Van Brunt</dc:creator><description>I agree, I often have to come up with a working solution just to test the performance of a collection/etc because there is no documentation on performance/algorithms are used. I've sometimes used reflector to dig through the code to figure out what is going on. Either way, not a fast way of gleening this information.</description></item><item><title>Idea: Indexes in .NET BCL 3.0 Collections</title><link>http://blogs.msdn.com/bclteam/archive/2005/08/06/448134.aspx#449669</link><pubDate>Wed, 10 Aug 2005 02:05:59 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:449669</guid><dc:creator>notgartner.com: Mitch Denny's Blog</dc:creator><description /></item><item><title>Suggestions</title><link>http://blogs.msdn.com/bclteam/archive/2005/08/06/448134.aspx#454018</link><pubDate>Sat, 20 Aug 2005 15:27:48 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:454018</guid><dc:creator>Brien</dc:creator><description>Cool Ideas for the Collections API:&lt;br&gt;&lt;br&gt;1. A performant dictionary that maintains insertion order (*cough* java.util.LinkedHashMap *cough*).&lt;br&gt;2. A performant dictionary that maintains sort order (*cough* java.util.TreeMap *cough*).</description></item></channel></rss>