title: McCabe Complexity in Win32 C++ applications
body: <p>Having read this question:</p>
  
  <p><a href="https://stackoverflow.com/questions/8291183/mccabe-cyclomatic-complexity-for-switch-in-java">McCabe Cyclomatic Complexity for switch in Java</a></p>
  
  <p>My interest went towards switch statements that cannot be solved in such a way (?).</p>
  
  <p>Realising the McCabe decisions should be less then 20 to guarentee better maintainability I started to wonder about Win32 applications.</p>
  
  <p>When making a Win32 application one can make buttons. Now as for these buttons, putting a handler on them is pretty typical and handling the message they send when they are pressed is often done in the Win32 callback function.</p>
  
  <p>Now as an application grows bigger, this switch-statement becomes bigger (exceeding the 20). Does this mean that maintainability is worse for Win32 applications then others (Java Swing?)?</p>
  
  <p>Or is this an exception to the McCabe complexity, and if so then in what way is this actually on par with the maintainability of other application types?</p>