1. 14 May, 2020 1 commit
  2. 31 Oct, 2019 1 commit
  3. 06 Feb, 2019 1 commit
  4. 30 May, 2018 1 commit
  5. 07 Mar, 2018 1 commit
    • Mark Olesen's avatar
      ENH: new bitSet class and improved PackedList class (closes #751) · bac943e6
      Mark Olesen authored
      - The bitSet class replaces the old PackedBoolList class.
        The redesign provides better block-wise access and reduced method
        calls. This helps both in cases where the bitSet may be relatively
        sparse, and in cases where advantage of contiguous operations can be
        made. This makes it easier to work with a bitSet as top-level object.
      
        In addition to the previously available count() method to determine
        if a bitSet is being used, now have simpler queries:
      
          - all()  - true if all bits in the addressable range are empty
          - any()  - true if any bits are set at all.
          - none() - true if no bits are set.
      
        These are faster than count() and allow early termination.
      
        The new test() method tests the value of a single bit position and
        returns a bool without any ambiguity caused by the return type
        (like the get() method), nor the const/non-const access (like
        operator[] has). The name corresponds to what std::bitset uses.
      
        The new find_first(), find_last(), find_next() methods provide a faster
        means of searching for bits that are set.
      
        This can be especially useful when using a bitSet to control an
        conditional:
      
        OLD (with macro):
      
            forAll(selected, celli)
            {
                if (selected[celli])
                {
                    sumVol += mesh_.cellVolumes()[celli];
                }
            }
      
        NEW (with const_iterator):
      
            for (const label celli : selected)
            {
                sumVol += mesh_.cellVolumes()[celli];
            }
      
            or manually
      
            for
            (
                label celli = selected.find_first();
                celli != -1;
                celli = selected.find_next()
            )
            {
                sumVol += mesh_.cellVolumes()[celli];
            }
      
      - When marking up contiguous parts of a bitset, an interval can be
        represented more efficiently as a labelRange of start/size.
        For example,
      
        OLD:
      
            if (isA<processorPolyPatch>(pp))
            {
                forAll(pp, i)
                {
                    ignoreFaces.set(i);
                }
            }
      
        NEW:
      
            if (isA<processorPolyPatch>(pp))
            {
                ignoreFaces.set(pp.range());
            }
      bac943e6
  6. 25 Apr, 2016 1 commit
  7. 09 Jan, 2013 1 commit
  8. 19 Apr, 2012 1 commit
  9. 15 Mar, 2012 1 commit
  10. 18 Nov, 2011 1 commit
    • laurence's avatar
      ENH: Merge cvMesh functionality into cv2DMesh · 075e47ea
      laurence authored
      - Added conformationSurface and searchableSurface classes in place
        of querySurface.
      - Added cellSizeControl class.
      - Change cvMesh argument of relaxation model constructor to Time.
      - Add writePrecision option to surfaceConvert.
      - Add onLine function to surfaceFeatureExtract.
      - Remove querySurface.
      - Move createShellMesh and extrude2DMesh to their own libraries.
      - Replace controls and tolerances with a cv2DControls object.
      - Add patchToPoly2DMesh class to extrude2DMesh.
      075e47ea
  11. 19 Oct, 2011 1 commit
  12. 14 Aug, 2011 1 commit
  13. 19 Jan, 2011 1 commit
  14. 07 Jan, 2011 1 commit
  15. 05 Jan, 2011 2 commits
  16. 20 Dec, 2010 1 commit
  17. 16 Dec, 2010 2 commits
  18. 27 Jul, 2010 1 commit
  19. 29 Mar, 2010 1 commit
  20. 17 Mar, 2010 2 commits