1. 04 Mar, 2014 1 commit
  2. 03 Oct, 2013 1 commit
  3. 27 Jul, 2013 1 commit
  4. 25 Jul, 2013 1 commit
  5. 09 Mar, 2013 1 commit
  6. 06 Mar, 2013 1 commit
  7. 25 Feb, 2013 2 commits
  8. 21 Oct, 2012 1 commit
  9. 06 Oct, 2012 1 commit
  10. 22 Aug, 2012 2 commits
  11. 07 Aug, 2012 1 commit
  12. 05 Jun, 2012 1 commit
  13. 06 Apr, 2012 1 commit
  14. 23 Mar, 2012 1 commit
  15. 22 Mar, 2012 1 commit
  16. 21 Mar, 2012 1 commit
  17. 18 Mar, 2012 1 commit
  18. 09 Mar, 2012 1 commit
  19. 04 Mar, 2012 1 commit
  20. 25 Feb, 2012 1 commit
  21. 29 Jul, 2011 1 commit
  22. 12 May, 2011 1 commit
  23. 23 Apr, 2011 1 commit
  24. 17 Apr, 2011 2 commits
  25. 12 Apr, 2011 1 commit
    • Alex Converse's avatar
      Convert some undefined 1<<31 shifts into 1U<<31. · 187a5379
      Alex Converse authored
      According to ISO 9899:1999 S 6.5.7/4:
      
      The result of E1 << E2 is E1 left-shifted E2 bit positions; vacated bits
      are filled with zeros. If E1 has an unsigned type, the value of the
      result is E1× 2^E2, reduced modulo one more than the maximum value
      representable in the result type. If E1 has a signed type and
      nonnegative value, and E1× 2^E2 is representable in the result type, then
      that is the resulting value; otherwise, the behavior is undefined.
      187a5379
  26. 19 Mar, 2011 2 commits
  27. 28 Jan, 2011 1 commit
  28. 26 Jan, 2011 1 commit
  29. 12 Nov, 2010 1 commit
  30. 24 Sep, 2010 1 commit
  31. 24 Jul, 2010 1 commit
  32. 03 Jun, 2010 1 commit
  33. 02 Jun, 2010 1 commit
  34. 26 May, 2010 1 commit
  35. 25 May, 2010 1 commit
  36. 20 Apr, 2010 1 commit