1. 15 Jan, 2019 3 commits
  2. 14 Jan, 2019 4 commits
  3. 10 Jan, 2019 1 commit
  4. 11 Jan, 2019 4 commits
  5. 10 Jan, 2019 10 commits
  6. 09 Jan, 2019 3 commits
  7. 10 Jan, 2019 2 commits
  8. 09 Jan, 2019 1 commit
  9. 07 Jan, 2019 1 commit
  10. 09 Jan, 2019 4 commits
  11. 08 Jan, 2019 2 commits
  12. 09 Jan, 2019 1 commit
  13. 08 Jan, 2019 1 commit
  14. 07 Jan, 2019 1 commit
  15. 08 Jan, 2019 2 commits
    • Mark OLESEN's avatar
      ENH: remove uniform compact output for FixedList (#1160) · 1458b4f6
      Mark OLESEN authored
      - a FixedList is generally small so there is little advantage
        in a compact output form for uniform content.  Eg, "2{-1}"
      
        By avoiding this compact form we obtain output that is also
        consistent with Tuple2, for example.
      
      - make FixedList construct from Istream explicit
      1458b4f6
    • 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.
      8eefc7b3