query: gcc optimisation with LEA
positive_passages.docid: 42784
positive_passages.text: What's the purpose of the LEA instruction?
negative_passages.docid: 146741
negative_passages.text: The effect of auto on compile time
negative_passages.docid: 104390
negative_passages.text: How can we rewrite this optimization problem in standard form?
negative_passages.docid: 84375
negative_passages.text: Building multiple executables with similar rules
negative_passages.docid: 93456
negative_passages.text: ParallelEvaluate for function minimization
negative_passages.docid: 136284
negative_passages.text: Orderless pattern matching
negative_passages.docid: 115157
negative_passages.text: Is there a way to use gcc to convert C to MIPS?
negative_passages.docid: 121420
negative_passages.text: How to use multiple versions of GCC
negative_passages.docid: 51197
negative_passages.text: A generic priority queue for Python
negative_passages.docid: 93560
negative_passages.text: Solving a logic puzzle using Prolog
negative_passages.docid: 71978
negative_passages.text: Tower of Hanoi: Recursive Algorithm
negative_passages.docid: 63967
negative_passages.text: Memory and CPU optimizers: Are they gimmicks?
negative_passages.docid: 66202
negative_passages.text: undefined reference to `__sync_val_compare_and_swap_4' error at compilation, using gcc 4.1.1 and 4.2.0 for Sparc v8 target
negative_passages.docid: 8893
negative_passages.text: The Definitive C++ Book Guide and List
negative_passages.docid: 15842
negative_passages.text: Lambda calculus expression reduction
negative_passages.docid: 18996
negative_passages.text: Compiling with g++ using multiple cores
negative_passages.docid: 42715
negative_passages.text: C state-machine design