Parsing Capital Letters

Dew Drop – October 2, 2009 | Alvin Ashcraft's Morning Dew

Dew Drop – October 2, 2009 | Alvin Ashcraft's Morning Dew — Fri, 02 Oct 2009 12:47:37 GMT

PingBack from http://www.alvinashcraft.com/2009/10/02/dew-drop-october-2-2009/

re: Parsing Capital Letters

Scott Mitchell — Fri, 02 Oct 2009 19:42:14 GMT

LINQ chews through problems like this with a minimal number of characters and, some would argue, better readability than regular expressions. crazyString.ToCharArray().Count(c => char.IsUpper(c)); Also, no magic strings needed.

re: Parsing Capital Letters

Chris Love — Mon, 05 Oct 2009 19:28:50 GMT

Come on Scott, you know Regex are always awesome, just see this example ;) http://thedailywtf.com/Articles/RegExp-From-Down-Under.aspx

re: Parsing Capital Letters

Charli — Tue, 06 Oct 2009 22:26:38 GMT

Depends on how often this function is called, but I would recomend to avoid regexp when possible. The most nice looking solution is not always the best solution! (mostly it's the worst solution) From experience I know that RegExp is awfully >>> SLOW <<< and should be avoided when possible.. Better to build a function that loops through the string and counts if it's upper case or not! probably will take you the same amount of time to write, so why not?

re: Parsing Capital Letters

Chris Love — Wed, 07 Oct 2009 14:47:29 GMT

Charli you can't be serious! If it were not for regular expressions SPAM filters, browsers, etc could not function as fast as they do. Regex are very fast and efficient.