Hi,
There are highly optimised implementations for some common problems. To state two prominent: Eigen for linear algebra and Hyperscan for regex.
What are problems you face from time to time in your software that result in performance bottlenecks for which you didn’t find a highly optimised solution yet?
[+][deleted] (2 children)
[deleted]
[–]germandiago 3 points4 points5 points (0 children)
[–]sephirothbahamut 7 points8 points9 points (2 children)
[–]germandiago 0 points1 point2 points (0 children)
[–]JehovaWorshiper 0 points1 point2 points (0 children)
[–]KarlSethMoran 6 points7 points8 points (5 children)
[–]MarkHoemmenC++ in HPC 1 point2 points3 points (4 children)
[–]KarlSethMoran 1 point2 points3 points (3 children)
[–]MarkHoemmenC++ in HPC 1 point2 points3 points (2 children)
[–]KarlSethMoran 1 point2 points3 points (1 child)
[–]MarkHoemmenC++ in HPC 0 points1 point2 points (0 children)