1. 12 Dec, 2019 4 commits
  2. 11 Dec, 2019 5 commits
  3. 10 Dec, 2019 7 commits
  4. 09 Dec, 2019 6 commits
  5. 06 Dec, 2019 9 commits
  6. 03 Dec, 2019 1 commit
  7. 09 Dec, 2019 1 commit
  8. 06 Dec, 2019 2 commits
    • Mark OLESEN's avatar
      ENH: improve exprResult handling · 17869747
      Mark OLESEN authored
      - some support for "uniform" bool fields. Calculating an averaged
        value for a boolField does not work very well, but we simply define
        that the field average is 'true' when more than 1/2 of its values
        are true. Not exactly true, but allows templated definitions to work
      - additional output method writeValue().
        This outputs the single (uniform) value or the first value of the
    • Mark OLESEN's avatar
      ENH: add ITstream append and seek methods. · 9fd696e1
      Mark OLESEN authored
      - ITstream append() would previously have used the append from the
        underlying tokenList, which leaves the tokenIndex untouched and
        renders the freshly appended tokens effectively invisible if
        interspersed with primitiveEntry::read() that itself uses tokenIndex
        when building the list.
        The new append() method makes this hidden ITstream bi-directionality
        easier to manage. For efficiency, we only append lists
        (not individual tokens) and support a 'lazy' resizing that allows
        the final resizing to occur later when all tokens have been appended.
      - The new ITstream seek() method provides a conveniently means to move
        to the end of the list or reposition to the middle.
        Using rewind() and using seek(0) are identical.
      ENH: added OTstream to output directly to a list of tokens
      BUG: List::newElem resized incorrectly
      - had a simple doubling of the List size without checking that this
        would indeed be sufficient for the requested index.
        Bug was not triggered since primitiveEntry was the only class using
        this call, and it added the tokens sequentially.
  9. 07 Dec, 2019 2 commits
  10. 09 Dec, 2019 1 commit
    • mattijs's avatar
      ENH: snappyHexMesh: proximity check · b7c54bc0
      mattijs authored
      This adds automatic deletion of cells inside small gaps. This is
      generally used to avoid having excessive numbers of cells in irrelevant
      areas of a geometry. It is nearly the opposite of automatic gap refinement
       - that refines cells to resolve the gap; this functionality removes cells
      to not mesh the gap.
      The proximity handling will remove those cells which are inside 'thin' gaps
      where 'thin' is defined as a distance of 2*'blockLevel'
      It will
      - detect surfaces which have the new 'blockLevel' specification
      - convert this to a minimum gap distance
      - detect cells which are inside this gap
      - remove these cells and add exposed faces to the nearest 'real' patch
  11. 03 Dec, 2019 1 commit
  12. 02 Dec, 2019 1 commit