1. 11 Feb, 2020 1 commit
  2. 31 Oct, 2019 1 commit
  3. 08 Jan, 2019 1 commit
    • Mark Olesen's avatar
      ENH: partial reorganization of HashTable internals (#1160) · 8eefc7b3
      Mark Olesen authored
      - relocate the pair_entry (HashTable) and unary_entry (HashSet) into
        the Detail namespace and add output handling.
        The output handling at this level removes the reliance on zero::null
        output (HashSet) and allows direct support of pointers.
        This means that the following now works
            HashTable<T*> tbl;
            os << tbl;
        It also means that we don't need to overload operator<< for
        HashPtrTable anymore.
      - avoid delete/new when calling HashSet::set(). If the entry already
        exists there is no reason to remove it and add another one with the
        same content.
      STYLE: HashTable iterators now have a val() method
      - identical to the object() iterator method, but shorter to type.
  4. 04 Jan, 2019 1 commit
  5. 20 Dec, 2018 1 commit
    • Mark Olesen's avatar
      ENH: allow direct testing of HashTable iterator as a bool · 3560884a
      Mark Olesen authored
      - can be used as a more natural test on the iterator.
        For example, with
           HashTable<..> table;
           auto iter = table.find(...);
        Following are now all equivalent:
          1.  if (iter != table.end()) ...
          2.  if (iter.found()) ...
          3.  if (iter) ...
  6. 31 Oct, 2017 1 commit
    • Mark Olesen's avatar
      ENH: improvements to HashTable internals · 053a648e
      Mark Olesen authored
      - make single-parameter construct (label) explicit
      - consolidate iterators
      - slightly reduced overhead for some HashSet types
      - improved resizing behaviour
      - compact output for empty Ptr hashes