Comments on: First look at NDepend http://blog.brianhartsock.com/2009/10/08/first-look-at-ndepend/ The exciting life of a software developer and nerd Tue, 29 Nov 2011 22:19:28 +0000 hourly 1 http://wordpress.org/?v=3.3 By: bhartsock http://blog.brianhartsock.com/2009/10/08/first-look-at-ndepend/comment-page-1/#comment-905 bhartsock Tue, 13 Oct 2009 02:24:42 +0000 http://blog.brianhartsock.com/?p=968#comment-905 Wow. I feel dumb. I played around with CQL but didn't really read the comments :) Wow. I feel dumb. I played around with CQL but didn’t really read the comments :)

]]> By: Patrick Smacchia http://blog.brianhartsock.com/2009/10/08/first-look-at-ndepend/comment-page-1/#comment-898 Patrick Smacchia Sun, 11 Oct 2009 17:41:13 +0000 http://blog.brianhartsock.com/?p=968#comment-898 >Here is an example, why is List.Contains() worth warning? This rule is a default rule because we (the NDepend team) have seen (in the real-world) so many algorithm with poor performance only because of a wrong use of Contain. Here is the explanation we put in the rule. // The cost of checking if a list contains an // object is proportional to the size of the list // (O(N) operation). For large lists and/or frequent // calls to Contains(), prefer using the // System.Collections.Generic.HashSet class // where calls to Contains() takes a constant // time (O(0) operation). >Here is an example, why is List.Contains() worth warning?

This rule is a default rule because we (the NDepend team) have seen (in the real-world) so many algorithm with poor performance only because of a wrong use of Contain. Here is the explanation we put in the rule.

// The cost of checking if a list contains an
// object is proportional to the size of the list
// (O(N) operation). For large lists and/or frequent
// calls to Contains(), prefer using the
// System.Collections.Generic.HashSet class
// where calls to Contains() takes a constant
// time (O(0) operation).

]]>