1. 07 Jun, 2010 1 commit
  2. 18 May, 2010 2 commits
  3. 12 Apr, 2010 2 commits
  4. 08 Apr, 2010 1 commit
  5. 07 Apr, 2010 1 commit
  6. 06 Apr, 2010 1 commit
  7. 30 Mar, 2010 1 commit
  8. 29 Mar, 2010 1 commit
  9. 03 Mar, 2010 1 commit
  10. 27 Jan, 2010 1 commit
    • mattijs's avatar
      BUG: slicing of empty list · adc15181
      mattijs authored
      An empty list (m_) has no pointer so cannot be referenced. Instead we
      now return a null pointer (which is no problem for UList)
      adc15181
  11. 15 Jan, 2010 1 commit
  12. 14 Jan, 2010 1 commit
  13. 15 Dec, 2009 2 commits
  14. 08 Dec, 2009 2 commits
    • Mark Olesen's avatar
      HashSet and PackedList get an unset() method · d2d39c32
      Mark Olesen authored
      - provides a convenient (and lazy) means of removing entries
      d2d39c32
    • Mark Olesen's avatar
      Applied Mattijs' PackedList improvements · 16c715ce
      Mark Olesen authored
      - resize with factor 2 as per DynamicList
      
      Old insertion speed:
          1000000 in 0.61 s
          2000000 in 2.24 s
          3000000 in 3.97 s
          4000000 in 5.76 s
          5000000 in 7.54 s
          6000000 in 9.41 s
          7000000 in 11.5 s
      
      New insertion speed:
          1000000 in 0.01 s
          2000000 in 0.02 s
          3000000 in 0.01 s
          4000000 in 0.02 s
          5000000 in 0.01 s
          6000000 in 0.01 s
          7000000 in 0.01 s
      16c715ce
  15. 07 Dec, 2009 1 commit
  16. 04 Dec, 2009 1 commit
  17. 02 Dec, 2009 2 commits
  18. 03 Dec, 2009 1 commit
    • Mark Olesen's avatar
      PackedBoolList specializaton for operator= · 063d8ede
      Mark Olesen authored
      - now that I re-examined the code, the note in commit 51fd6327
        can be mostly ignored
      
        PackedList isMaster(nPoints, 1u);
        is not really inefficient at all, since the '1u' is packed into
        32/64-bits before the subsequent assignment and doesn't involve
        shifts/masking for each index
      
        The same misinformation applies to the PackedList(size, 0u) form.
        It isn't much slower at all.
      
        Nonetheless, add bool specialization so that it is a simple assign.
      063d8ede
  19. 02 Dec, 2009 1 commit
  20. 01 Dec, 2009 2 commits
  21. 25 Nov, 2009 1 commit
    • Mark Olesen's avatar
      Lists get first() and last() member functions · b2d7439b
      Mark Olesen authored
      - this builds on Mattijs' commit 968f0bbd but with a first()
        as well.
      
      - Added both to FixedList, IndirectList, UIndirectList and *PtrList and
        since they can certainly be useful there. Did not add to BiIndirectList,
        since I'm not sure what it should mean there. Did not add to PackedList,
        since it's not clear how useful they'd be yet in these contexts (and I'm
        not sure how it would interact with the iterator proxy implementation).
      
      - Note: STL defines front() and back() for these methods.
      b2d7439b
  22. 23 Nov, 2009 1 commit
  23. 20 Nov, 2009 1 commit
  24. 12 Nov, 2009 1 commit
  25. 06 Nov, 2009 1 commit
  26. 04 Nov, 2009 3 commits
  27. 03 Nov, 2009 4 commits
  28. 31 Oct, 2009 2 commits