- Dec 04, 2009
-
-
Mark Olesen authored
-
Mark Olesen authored
- the current B-Splines deliver rubbish
-
Mark Olesen authored
-
Mark Olesen authored
-
Mark Olesen authored
-
Mark Olesen authored
-
- Dec 03, 2009
-
-
Mark Olesen authored
-
- Dec 02, 2009
- Dec 03, 2009
-
-
Mark Olesen authored
- now that I re-examined the code, the note in commit 51fd6327 can be mostly ignored PackedList isMaster(nPoints, 1u); is not really inefficient at all, since the '1u' is packed into 32/64-bits before the subsequent assignment and doesn't involve shifts/masking for each index The same misinformation applies to the PackedList(size, 0u) form. It isn't much slower at all. Nonetheless, add bool specialization so that it is a simple assign.
-
Mark Olesen authored
-
Mark Olesen authored
-
Mark Olesen authored
- to match coding guidelines
-
Mark Olesen authored
- ensure that the standard options (eg, from timeSelector) also have some usage information
-
Mark Olesen authored
- bugfix: noParallel() didn't remove 'parallel' from validParOptions allowing it to sneak through to the Pstream layer. noParallel() now clears the entire validParOptions as well - new convenience methods * addOption() * removeOption() * addBoolOption() - as per addOption(), but for bool options (no param) - printUsage() output format * options sorted alphabetically * options listed on separate lines for better readability - new optionUsage static member for short usage information about an option * corresponding addUsage() method or provide usage information in addOption() / addBoolOption()
-
- Dec 02, 2009
-
-
henry authored
-
Mark Olesen authored
Note: PackedList constructor initializes to zero, faster not to do it ourselves. ie, PackedList foo(nPoints); vs. PackedList foo(nPoints, 0); saves an extra nPoints operations with shifts/masks etc. If speed is important, change this type of code PackedList isMaster(nPoints, 1u); for (loop) { if (condition) { isMaster.set(i, 0u); // unset bit } } return isMaster; into this: PackedList notMaster(nPoints); for (loop) { if (!condition) { notMaster.set(i, 1u); } } notMaster.flip(); return notMaster; or this: PackedList isMaster(nPoints); isMaster.flip(); for (loop) { if (condition) { isMaster.set(i, 0u); } } return isMaster;
-
Mark Olesen authored
-
Mark Olesen authored
- exception calcType.H since it'll most likely be used for building applications anyhow - use quailified names in more of the lagrangian code - killed some tab indents in various places.
-
Mark Olesen authored
- was not touched for a very long time, seems to be left over from the pre-git era
-
Mark Olesen authored
- new optionLookupOrDefault and additional form of optionReadIfPresent with a default value
-
Mark Olesen authored
-
Mark Olesen authored
-
- Dec 01, 2009
-
-
Mark Olesen authored
-
Mark Olesen authored
- this probably should have been in commit c7c9a6e0 (2009-11-04) but got overseen in the HashTbl -> HashTable switch
-
Mark Olesen authored
-
Mark Olesen authored
- allow insert() and set() from a UList of Key This complements the existing erase(const UList<Key>&) method
-
Mark Olesen authored
-
Mark Olesen authored
- adjust code to more closely resemble sampledSets / sampledSurfaces
-
mattijs authored
Conflicts: applications/utilities/postProcessing/dataConversion/foamToTecplot360/Allwmake
-
mattijs authored
-