On 11/16/2011 12:44 PM, Alexandru Ciobanu wrote:
For each library the steps are: - regcomp() the regular expression - regexec() the expression on the string
Can you time each of these steps separately for each library? I would not be surprised if the compilation time is the bottleneck. The evaluation and matching of a given string just followed a DFA which should be pretty fast. If it turns out that compilation is the bottleneck then we should refactor things to make sure CTest compiles each regex at most once so we can re-use the same DFA every time. -Brad -- Powered by www.kitware.com Visit other Kitware open-source projects at http://www.kitware.com/opensource/opensource.html Please keep messages on-topic and check the CMake FAQ at: http://www.cmake.org/Wiki/CMake_FAQ Follow this link to subscribe/unsubscribe: http://public.kitware.com/cgi-bin/mailman/listinfo/cmake-developers
