- May 29, 2017
-
-
Mark OLESEN authored
-
Mark OLESEN authored
-
Mark OLESEN authored
-
Mark OLESEN authored
-
Mark OLESEN authored
-
Mark OLESEN authored
- the NamedEnum wrapper is somewhate too rigid. * All enumerated values are contiguous, starting as zero. * The implicit one-to-one mapping precludes using it for aliases. * For example, perhaps we want to support alternative lookup names for an enumeration, or manage an enumeration lookup for a sub-range.
-
Mark OLESEN authored
- was only included indirectly via FixedList.H
-
Mark OLESEN authored
- no penalty compared to Tuple2, potential future benefits with C++ constructor forwarding.
-
Mark OLESEN authored
- Remove the unused enums() method since it delivers wholly unreliable results. It is not guaranteed to cover the full enumeration range, but only the listed names. - Remove the unused strings() method. Duplicated functionality of the words(), but was never used. - Change access of words() method from static to object. Better code isolation. Permits the constructor to take over as the single point of failure for bad input. - Add values() method - do not expose internal (HashTable) lookup since it makes it more difficult to enforce constness and the implementation detail should not be exposed. However leave toc() and sortedToc() for the interface. STYLE: relocated NamedEnum under primitives (was containers) - internal typedef as 'value_type' for some consistency with STL conventions
-
- May 26, 2017
-
-
Mark OLESEN authored
- The unset() method never auto-vivifies, whereas the set() method always auto-vivifies. In the case where set() is called with a zero for its argument - eg, set(index, 0) - this should behave identically to an unset() and not auto-vivify out-of-range entries.
-
Mark OLESEN authored
-
Mark OLESEN authored
-
Mark OLESEN authored
- This follows the same idea as cbegin/cend and is helpful when using C++11 auto to ensure we have unambiguous const-safe access. Previously: ==== typename someLongClass::const_iterator iter = someTable.find(key); ... later on: *iter = value; // Oops, but caught by compiler. We can save some typing with auto, but it is uncertain what we get: ==== auto iter = someTable.find(key); // iterator or const_iterator? // depends on someTable having const or non-const access. ... later on: *iter = value; // Oops, but not caught by compiler. Using cfind instead, auto will deduce const_iterator as the type: ==== auto iter = someTable.cfind(key); // definitely const_iterator ... later on: *iter = value; // Oops, but caught by compiler.
-
Mark OLESEN authored
-
Mark OLESEN authored
- when a plain word is used as a directory-local name for file. We don't have a full blown fileName, but still want to check/remove extensions etc.
-
Mark OLESEN authored
-
Mark OLESEN authored
- both classes are nearly identical and should be merged in the future.
-
Mark OLESEN authored
-
- May 25, 2017
- May 24, 2017
-
-
mattijs authored
-
Andrew Heather authored
Initial attempt to track oriented surface fields See merge request !104
-
mattijs authored
-
mattijs authored
-
Andrew Heather authored
Merge branch 'feature-oriented-fields' of develop.openfoam.com:Development/OpenFOAM-plus into feature-oriented-fields
-
Andrew Heather authored
-
Andrew Heather authored
-
Mark OLESEN authored
STYLE: adjust parameter names and template types in invertManyToMany - more explicit about the acceptable list types
-
Mark OLESEN authored
- The inGroups is a wordList. It can be flattened on output to make files more readable.
-
- May 22, 2017
-
-
Mark OLESEN authored
- holding a pointer instead of a reference for edgeFaceCirculator simplifies overall handling.
-
Andrew Heather authored
Integration foundation See merge request !99
-
Mark OLESEN authored
-
Mark OLESEN authored
-
- May 19, 2017
-
-
Andrew Heather authored
Further hash table iter clean-up See merge request !113
-
Andrew Heather authored
-
- May 18, 2017
-
-
mattijs authored
-
Mark OLESEN authored
Hash table method enhancements See merge request !112
-
Andrew Heather authored
-
Andrew Heather authored
-