- 16 Apr, 2010 2 commits
- 14 Apr, 2010 1 commit
-
-
mattijs authored
-
- 13 Apr, 2010 1 commit
-
-
Mark Olesen authored
ENH: change some iterator -> const_iterator access BUG: found some places with forAllIter and ::iterator !
-
- 12 Apr, 2010 4 commits
-
-
mattijs authored
-
mattijs authored
-
Mark Olesen authored
-
Mark Olesen authored
STYLE: use 'forAll(' NOT 'forAll (', as per coding guide
-
- 06 Apr, 2010 1 commit
-
-
mattijs authored
-
- 30 Mar, 2010 2 commits
-
-
mattijs authored
-
Mark Olesen authored
-
- 29 Mar, 2010 1 commit
-
-
Mark Olesen authored
-
- 26 Mar, 2010 1 commit
-
-
mattijs authored
-
- 23 Mar, 2010 1 commit
-
-
mattijs authored
-
- 17 Mar, 2010 2 commits
- 03 Mar, 2010 1 commit
-
-
mattijs authored
-
- 17 Feb, 2010 3 commits
- 16 Feb, 2010 1 commit
-
-
mattijs authored
-
- 12 Feb, 2010 1 commit
-
-
mattijs authored
Each collocated set of coupled points has a single master assigned to it. However when doing mergePoints on a patch the master does not have to be on the patch. So now it returns mesh point labels, not patch point labels.
-
- 10 Feb, 2010 1 commit
-
-
mattijs authored
-
- 08 Feb, 2010 4 commits
-
-
mattijs authored
-
Andrew Heather authored
-
mattijs authored
Now mapDistribute structure to pull data from slaves to master and vice versa.
-
mattijs authored
-
- 14 Jan, 2010 1 commit
-
-
mattijs authored
-
- 13 Jan, 2010 1 commit
-
-
mattijs authored
-
- 04 Jan, 2010 1 commit
-
-
mattijs authored
- Rewrote globalPoints to use globalIndex class so now only transfers single label instead of labelPair - Added addressing in globalMeshData - from coupled master points to slave points - ,, edges ,, edges - from coupled points (master or slave) to uncoupled boundary faces - ,, ,, cells - See test/globalMeshData for simple test
-
- 01 Jan, 2010 1 commit
-
-
mattijs authored
-
- 15 Dec, 2009 1 commit
-
-
mattijs authored
-
- 08 Dec, 2009 1 commit
-
-
Mark Olesen authored
- also PackedBoolList.get(x) == 1 can be written without the == comparison since the unsigned -> bool conversion is fast
-
- 04 Dec, 2009 2 commits
-
-
Mark Olesen authored
-
Mark Olesen authored
-
- 02 Dec, 2009 2 commits
-
-
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
- 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.
-
- 01 Dec, 2009 1 commit
-
-
mattijs authored
-
- 27 Nov, 2009 1 commit
-
-
Mark Olesen authored
- markup codingStyleGuide.org examples so they actually indent correctly - use 'Info<<' as per codingStyleGuide instead of 'Info <<'
-
- 23 Nov, 2009 1 commit
-
-
mattijs authored
-