1. 03 Apr, 2018 9 commits
  2. 28 Mar, 2018 2 commits
  3. 27 Mar, 2018 2 commits
  4. 26 Mar, 2018 5 commits
  5. 24 Mar, 2018 3 commits
  6. 22 Mar, 2018 4 commits
  7. 21 Mar, 2018 5 commits
  8. 20 Mar, 2018 2 commits
  9. 19 Mar, 2018 1 commit
  10. 16 Mar, 2018 7 commits
    • Mark OLESEN's avatar
    • Mark OLESEN's avatar
      COMP: avoid attempted auto-vivify with PackedBoolList [] · 6c8b60cf
      Mark OLESEN authored
      - also ensure fewer side-effects from inplaceReorder
      - provide ListOps::reorder especially for PackedList and PackedBoolList
        since they behave differently from regular lists.
    • Mark OLESEN's avatar
      ENH: consistency of HashSet setMany(), insertMany() with packed-list version · fd0c709c
      Mark OLESEN authored
      - this also provides a better separation of the intent
        (ie, inserting a single value, or inserting multiply values)
    • Mark OLESEN's avatar
      ENH: code reduction in PackedList, PackedBoolList (issue #751) · 87bcedcc
      Mark OLESEN authored
      - eliminate iterators from PackedList since they were unused, had
        lower performance than direct access and added unneeded complexity.
      - eliminate auto-vivify for the PackedList '[] operator.
        The set() method provides any required auto-vivification and
        removing this ability from the '[]' operator allows for a lower
        when accessing the values. Replaced the previous cascade of iterators
        with simpler reference class.
      - (temporarily) eliminate logic and addition operators since
        these contained partially unclear semantics.
      - 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.
      - more consistent use of PackedBoolList test(), set(), unset() methods
        for fewer operation and clearer code. Eg,
            if (list.test(index)) ...    |  if (list[index]) ...
            if (!list.test(index)) ...   |  if (list[index] == 0u) ...
            list.set(index);             |  list[index] = 1u;
            list.unset(index);           |  list[index] = 0u;
      - deleted the operator=(const labelUList&) and replaced with a setMany()
        method for more clarity about the intended operation and to avoid any
        potential inadvertent behaviour.
    • Mark OLESEN's avatar
      ENH: provide iterators for IndirectList, UIndirectList · 14bac7fa
      Mark OLESEN authored
      - consistency with other containers.
        Allows range-for, enables various std algorithms, and can be used
        with ListOp::create() with an iterator range.
    • Mark OLESEN's avatar
      ENH: reduce overhead for clockTime, cpuTime · 9b8317b7
      Mark OLESEN authored
      - clockValue class for managing the clock values only, with a null
        constructor that does not query the system clock (can defer to later).
        Can also be used directly for +/- operations.
      - refactor clockTime, cpuTime, clock to reduce storage.
    • Mark OLESEN's avatar