Yo ! > Did you profile your code on the C-level? e.g. using gprof? As a rule of > thumb, guesses about where the bottleneck is are wrong :-) Its entirely > conceivable that branch prediction and speculative execution solve this > already for you.
Yeees daddy :-P I did that like a grown man with perf record :-P > C++ std::sort will be able to inline the comparator. Oh cool ! Thanks I will try to call that from Cython. > Link-time optimization (e.g. gcc -flto) can in principle also inline on the > level of object code, after the compilation did not inline (because of > different compilation units, say).Though the libc sort is in a shared library. Oh... So when does that work ? I mean, if you compile everything from source already there is nothing to optimize at link time, is there ? Nathann -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
