- Dec 08, 2009
-
-
Mark Olesen authored
- resize with factor 2 as per DynamicList Old insertion speed: 1000000 in 0.61 s 2000000 in 2.24 s 3000000 in 3.97 s 4000000 in 5.76 s 5000000 in 7.54 s 6000000 in 9.41 s 7000000 in 11.5 s New insertion speed: 1000000 in 0.01 s 2000000 in 0.02 s 3000000 in 0.01 s 4000000 in 0.02 s 5000000 in 0.01 s 6000000 in 0.01 s 7000000 in 0.01 s
-
- Dec 07, 2009
-
-
Mark Olesen authored
-
Mark Olesen authored
- compatibility: * 'polySpline' and 'simpleSpline' accepted * detect and discard end tangent specifications - a BSpline is also included (eg, for future support of NURBS), but is not selectable from blockMesh since it really isn't as nice as the Catmull-Rom (ie, doesn't *exactly* go through each point).
-
- Dec 04, 2009
-
-
graham authored
-
graham authored
triangle, from: http://en.wikipedia.org/wiki/Inertia_tensor_of_triangle Adding the ability to calculate the inertia tensor of a polygon face by summing the triangle inertias. Added a test application to draw a test face with its principal axes and moments of inertia.
-
Mark Olesen authored
-
Mark Olesen authored
- also looks reasonable and doesn't deviate much from Catmull-Rom
-
Mark Olesen authored
-
Mark Olesen authored
-
Mark Olesen authored
-
Mark Olesen authored
- the current B-Splines deliver rubbish
-
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
-
- Dec 02, 2009
-
-
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
- new optionLookupOrDefault and additional form of optionReadIfPresent with a default value
-
- Dec 01, 2009
-
-
Mark Olesen authored
- allow insert() and set() from a UList of Key This complements the existing erase(const UList<Key>&) method
-
mattijs authored
-
- forgot to use readList in removeEntry, which caused the test failure. - remaining problem: it doesn't work as might be expected This is the problem: dict { foo xxx; bar yyy; } dict { baz zzz; #remove foo } This only removes 'foo' from the current scope (the second dict), since it occurs before the dictionary merge does. To remove from the final, merged dictionary, we'd need a new deleteEntry type that would do the right thing on the merge before self-destructing (ie, removing itself too).
-
Mark Olesen authored
- forgot to use readList in removeEntry, which caused the test failure. - remaining problem: it doesn't work as might be expected This is the problem: dict { foo xxx; bar yyy; } dict { baz zzz; #remove foo } This only removes 'foo' from the current scope (the second dict), since it occurs before the dictionary merge does. To remove from the final, merged dictionary, we'd need a new deleteEntry type that would do the right thing on the merge before self-destructing (ie, removing itself too).
-
henry authored
-
henry authored
-
- Nov 30, 2009
-
-
Mark Olesen authored
- space between keyword and bracket in 'for(..)', 'if(..)', 'while(..)'
-
Mark Olesen authored
-
- Nov 27, 2009
-
-
Mark Olesen authored
- markup codingStyleGuide.org examples so they actually indent correctly - use 'Info<<' as per codingStyleGuide instead of 'Info <<'
-
- Nov 26, 2009
-
-
mattijs authored
-
Mark Olesen authored
- use first() method in some places as well where it helps clarity - there are a few remaining cases: git grep 'size()-1]'
-
- Nov 25, 2009
-
-
henry authored
This currently only runs in serial, parallelisation is worked on.
-
Mark Olesen authored
-
- Nov 24, 2009
-
-
Andrew Heather authored
-
- Nov 23, 2009
-
-
Mark Olesen authored
- Include Sets/Zones now scans immediately to refresh the list of available mesh parts. Unfortunately, this also causes the object panel to be modified, even although the selection doesn't acutally need to change. This seems to be due to how the pqNamedWidgets are getting the information from the proxy properties. I can't figure if it's possible to acheive what I want, but we can probably live with the current implementation. After IncludeZones, simply us 'Reset' to undo the spurious GUI changes. Works fine - just looks a bit silly. - Added 'Refresh' button to rescan for new times/fields. Good for post-processing ongoing calculations without exiting the reader. - Added 'Skip Zero Time' checkbox: many (some) calculations have data missing at time=0 (eg, rho, lagrangian, etc). This provides a convenient way to skip over this time. - Future?: We could probably pick up favourite default values for these switches from ~OpenFOAM/controlDict, from a case system/paraview, or simply by making the casename.OpenFOAM also be an OpenFOAM dictionary with the settings.
-
- Nov 21, 2009
-
-
mattijs authored
-
- Nov 20, 2009
-
-
Mark Olesen authored
- in preparation for adding an optional '-reconstruct' to a few utilities re-use as -lreconstruct library - move related stuff there too src/decompositionMethods/decompositionMethods -> src/parallel/decompositionMethods - added missing namespace qualifiers
-