@@ -1,5 +1,5 @@
11
2−module Bits where
2+module Bitwise where
33
44{-| Library for [bitwise operations](http://en.wikipedia.org/wiki/Bitwise_operation).
55
@@ -12,27 +12,27 @@ module Bits where
1212@docs shiftLeft, shiftRight, shiftRightLogical
1313-}
1414
15−import Native.Bits
15+import Native.Bitwise
1616
1717{-| Bitwise “and”
1818-}
1919and : Int -> Int -> Int
20−and = Native.Bits.and
20+and = Native.Bitwise.and
2121
2222{-| Bitwise “or”
2323-}
2424or : Int -> Int -> Int
25−or = Native.Bits.or
25+or = Native.Bitwise.or
2626
2727{-| Bitwise “xor”
2828-}
2929xor : Int -> Int -> Int
30−xor = Native.Bits.xor
30+xor = Native.Bitwise.xor
3131
3232{-| Flip each bit individually, often called “bitwise not”
3333-}
3434complement : Int -> Int
35−complement = Native.Bits.complement
35+complement = Native.Bitwise.complement
3636
3737{-| Shift bits to the left by a given offset, filling new bits with zeros.
3838This can be used to multiply numbers by powers of two.
@@ -41,7 +41,7 @@ This can be used to multiply numbers by powers of two.
4141 8 `shiftLeft` 2 == 32
4242-}
4343shiftLeft : Int -> Int -> Int
44−shiftLeft = Native.Bits.shiftLeft
44+shiftLeft = Native.Bitwise.shiftLeft
4545
4646{-| Shift bits to the right by a given offset, filling new bits with
4747whatever is the topmost bit. This can be used to divide numbers by powers of two.
@@ -56,7 +56,7 @@ often written (>>), and sometimes called a “sign-propagating”
5656right shift because it fills empty spots with copies of the highest bit.
5757-}
5858shiftRight : Int -> Int -> Int
59−shiftRight = Native.Bits.shiftRightArithmatic
59+shiftRight = Native.Bitwise.shiftRightArithmatic
6060
6161{-| Shift bits to the right by a given offset, filling new bits with
6262zeros.
@@ -71,5 +71,5 @@ and sometimes called a “zero-fill” right shift because it fills empt
7171with zeros.
7272-}
7373shiftRightLogical : Int -> Int -> Int
74−shiftRightLogical = Native.Bits.shiftRightLogical
74+shiftRightLogical = Native.Bitwise.shiftRightLogical
7575