﻿<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><title>Ayende @ Rahien</title><link>http://ayende.com</link><description>Ayende @ Rahien</description><copyright>Copyright (C) Ayende Rahien  2004 - 2021 (c) 2026</copyright><ttl>60</ttl><item><title>[ICR] commented on UberProf performance improvements</title><description>"Sorry, but that is a limitation of the screen resolution, I am afraid."
  
This is what floating divs are for.
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment11</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment11</guid><pubDate>Mon, 28 Dec 2009 12:01:22 GMT</pubDate></item><item><title>Dennis commented on UberProf performance improvements</title><description>The sortedlist has amortized insertion time of O(lg N), but only if you insert random values... If you insert values that are already in order, then it is pretty much the same as a normal List with regards to runtime.
  
That would also make the code more robust, since as you say there is a good likelyhood that it is not always 100% sorted, and you have no real control over when it is not.
  
(and your remember me, forgot me yet again)
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment10</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment10</guid><pubDate>Wed, 23 Dec 2009 09:21:07 GMT</pubDate></item><item><title>Ayende Rahien commented on UberProf performance improvements</title><description>firefly,
  
Yes, I _love_ dotTrace.
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment9</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment9</guid><pubDate>Wed, 23 Dec 2009 08:28:53 GMT</pubDate></item><item><title>firefly commented on UberProf performance improvements</title><description>What did you use to profile your application? dotTrace?
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment8</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment8</guid><pubDate>Tue, 22 Dec 2009 22:09:31 GMT</pubDate></item><item><title>Patrick Smacchia commented on UberProf performance improvements</title><description>Often, more performance means more code and more complexity.
  
  
Often, more performance means algorithms refining 
  
which end up appending code dedicated to prevent execution of unnecessary branches of code.
  
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment7</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment7</guid><pubDate>Tue, 22 Dec 2009 15:00:23 GMT</pubDate></item><item><title>Rik Hemsley commented on UberProf performance improvements</title><description>Of course SortedList requires the keys to be unique, so if you're dealing with the possibility of more than one identical timestamp, it wouldn't be suitable.
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment6</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment6</guid><pubDate>Tue, 22 Dec 2009 14:08:01 GMT</pubDate></item><item><title>Rik Hemsley commented on UberProf performance improvements</title><description>Assuming you already have benchmarks set up as you've been through a round of optimisation, it might be interesting to plug SortedList in and see how it compares. I don't doubt there could be performance issues, but I've found that it's often best to assume the built-in collections have reasonable performance characteristics before trying to build your own version of the same functionality.
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment5</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment5</guid><pubDate>Tue, 22 Dec 2009 14:06:22 GMT</pubDate></item><item><title>Ayende Rahien commented on UberProf performance improvements</title><description>Rik,
  
Making this into a sorted list will lead to a potential sort operation at each insert, which I would rather avoid.
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment4</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment4</guid><pubDate>Tue, 22 Dec 2009 14:00:57 GMT</pubDate></item><item><title>Ayende Rahien commented on UberProf performance improvements</title><description>wcoenen,
  
Sorry, but that is a limitation of the screen resolution, I am afraid.
  
It should be clear enough as it is.
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment3</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment3</guid><pubDate>Tue, 22 Dec 2009 13:59:54 GMT</pubDate></item><item><title>Rik Hemsley commented on UberProf performance improvements</title><description>If the list of IHaveTimestamp is to be kept ordered, have you considered using a SortedList? I don't know if it would perform any better than what you have, but it might help you avoid reinventing the wheel.
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment2</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment2</guid><pubDate>Tue, 22 Dec 2009 12:16:14 GMT</pubDate></item><item><title>wcoenen commented on UberProf performance improvements</title><description>The new code is appearing *under* the old code for me, rather than to the right. (I tried multiple browsers and stretching the browser out over two screens.)
</description><link>http://ayende.com/4334/uberprof-performance-improvements#comment1</link><guid>http://ayende.com/4334/uberprof-performance-improvements#comment1</guid><pubDate>Tue, 22 Dec 2009 12:13:42 GMT</pubDate></item></channel></rss>