query: Reducing complexity of large switch statements
positive_passages.docid: 82673
positive_passages.text: Ways to eliminate switch in code
negative_passages.docid: 154917
negative_passages.text: strlen performance implementation
negative_passages.docid: 132288
negative_passages.text: Switch with range of values
negative_passages.docid: 68711
negative_passages.text: C optimisation of string literals
negative_passages.docid: 11408
negative_passages.text: long long implementation in 32 bit machine
negative_passages.docid: 153013
negative_passages.text: How to implement an efficient bidirectional hash table?
negative_passages.docid: 104749
negative_passages.text: Implement the Bisection algorithm elegantly and easily
negative_passages.docid: 93385
negative_passages.text: Can const-correctness improve performance?
negative_passages.docid: 10543
negative_passages.text: A new environment based on enumerate
negative_passages.docid: 37636
negative_passages.text: Advice on alternatives to using dozens of check boxes in an interface
negative_passages.docid: 65856
negative_passages.text: How to make C# Switch Statement use IgnoreCase
negative_passages.docid: 74476
negative_passages.text: C/C++: switch for non-integers
negative_passages.docid: 158708
negative_passages.text: Counting the adjacent swaps required to convert one permutation into another
negative_passages.docid: 87684
negative_passages.text: Memory Efficiency and Performance of String.Replace .NET Framework
negative_passages.docid: 73289
negative_passages.text: How to implement a switch in spice?
negative_passages.docid: 114981
negative_passages.text: List of 'if' switches anywhere?
negative_passages.docid: 5874
negative_passages.text: Java switch statement: Constant expression required, but it IS constant