- 04 Mar, 2009 2 commits
-
-
Mark Olesen authored
-
Mark Olesen authored
- If the underlying type is contiguous, FixedList hashes its storage directly. - Drop labelPairHash (non-commutative) from fvMeshDistribute since FixedList::Hash does the right thing anyhow. - Hash<edge> specialization is commutative, without multiplication. - Hash<triFace> specialization kept multiplication (but now uLabel). There's not much point optimizing it, since it's not used much anyhow. Misc. changes - added StaticAssert to NamedEnum.H - label.H / uLabel.H : define FOAM_LABEL_MAX, FOAM_ULABEL_MAX with the values finally used for the storage. These can be useful for pre-processor checks elsewhere (although I stopped needing them in the meantime).
-
- 02 Mar, 2009 1 commit
-
-
Mark Olesen authored
- not much speed difference between SuperFastHash and Jenkin's lookup3 but both are 5-10% faster than what is currently implemented in Foam::string, albeit inlining probably helps there. - TODO: integration with existing infrastructure
-
- 27 Feb, 2009 4 commits
-
-
Mark Olesen authored
-
Mark Olesen authored
- catch people using silly template sizes for FixedList, PackedList
-
Mark Olesen authored
- compare iteratorBase == iteratorBase by value, not position thus this works list[a] == list[b] ... - compare iterator == iteratorBase and const_iterator == iteratorBase by position, not value. The inheritance rules means that this works: iter == list.end() ... this will compare positions: iter == list[5]; Of course, this will still compare values: *iter == list[5];
-
Mark Olesen authored
- Hash returns unsigned - FixedList templated on unsigned int - include uLabel.H in UList, HashTable etc. so the output function is know throughout
-
- 26 Feb, 2009 2 commits
-
-
Mark Olesen authored
- make table power-of-two, but since it seems to give 1-2% performance improvement, maybe forget it too. - remove two-argument form of hashing classes and do the modulus direclty within HashTable instead. This simplifies things a fair bit. - migrate Hash<void*> from db/dlLibrary to primitives/hashes/Hash
-
Mark Olesen authored
- it was possible to create a PackedList::iterator from a PackedList::const_iterator and violate const-ness - added HashTable::printInfo for emitting some information - changed default table sizes from 100 -> 128 in preparation for future 2^n table sizes
-
- 25 Feb, 2009 5 commits
-
-
Mark Olesen authored
- much better performance on empty tables (4-6x speedup), neutral performance change on filled tables. Since tableSize_ is non-zero when nElmts_ is, there is no modulus zero problem.
-
Mark Olesen authored
-
Mark Olesen authored
-
-
Mark Olesen authored
- this allows SubField<point> for unallocated storage in PrimitivePatch
-
- 24 Feb, 2009 8 commits
- 20 Feb, 2009 2 commits
- 19 Feb, 2009 3 commits
- 18 Feb, 2009 9 commits
-
-
mattijs authored
-
Andrew Heather authored
-
mattijs authored
-
mattijs authored
-
Andrew Heather authored
- still not consistent for pd as does not include buoyancy effects
-
-
Andrew Heather authored
-
Andrew Heather authored
-
Mark Olesen authored
- change system/controlDict to use functions {..} instead of functions (..); * This is internally more efficient - fixed formatting of system/controlDict functions entry - pedantic change: use 'return 0' instead of 'return(0)' in the applications, since return is a C/C++ keyword, not a function.
-
- 17 Feb, 2009 4 commits