title: countTrailingZeros for Integer
body: <p>I was wondering if there was a fast way to calculate the number of trailing zeros of an Integer in Haskell. This operation makes sense for Integer but is unfortunately wrapped up with other operations that don't make sense in FiniteBits. The only way I know to do this is with a loop. Isn't there a faster way to do this?</p>