]> https://gitweb.dealii.org/ - dealii.git/commit
Use a more sophisticated algorithm for the compressed sparsity pattern that uses...
authorWolfgang Bangerth <bangerth@math.tamu.edu>
Mon, 21 Jun 2004 17:02:47 +0000 (17:02 +0000)
committerWolfgang Bangerth <bangerth@math.tamu.edu>
Mon, 21 Jun 2004 17:02:47 +0000 (17:02 +0000)
commitdd61fabc1b8f0a2f092a746b7a5f212f8ed499ed
tree1774bb0487c09f9f3f1ee021444977190818f029
parent93c1ab318bd48678c0a3164b4ae6d957142b2185
Use a more sophisticated algorithm for the compressed sparsity pattern that uses caches and std::vector instead of std::set. std::set allocates 20 bytes each time we add a single integer, which can't be efficient both from memory and run-time viewpoints.

git-svn-id: https://svn.dealii.org/trunk@9440 0785d39b-7218-0410-832d-ea1e28bc413d
deal.II/lac/include/lac/compressed_sparsity_pattern.h
deal.II/lac/source/compressed_sparsity_pattern.cc

In the beginning the Universe was created. This has made a lot of people very angry and has been widely regarded as a bad move.

Douglas Adams


Typeset in Trocchi and Trocchi Bold Sans Serif.