@@ -13,22 +13,22 @@ module Bitwise where
1313
1414import Native.Bitwise
1515
16−{-| Bitwise “and”
16+{-| Bitwise AND
1717-}
1818and : Int -> Int -> Int
1919and = Native.Bitwise.and
2020
21−{-| Bitwise “or”
21+{-| Bitwise OR
2222-}
2323or : Int -> Int -> Int
2424or = Native.Bitwise.or
2525
26−{-| Bitwise “xor”
26+{-| Bitwise XOR
2727-}
2828xor : Int -> Int -> Int
2929xor = Native.Bitwise.xor
3030
31−{-| Flip each bit individually, often called “bitwise not”
31+{-| Flip each bit individually, often called bitwise NOT
3232-}
3333complement : Int -> Int
3434complement = Native.Bitwise.complement
@@ -51,7 +51,7 @@ whatever is the topmost bit. This can be used to divide numbers by powers of two
5151
5252This is called an [arithmatic right
5353shift](http://en.wikipedia.org/wiki/Bitwise_operation#Arithmetic_shift),
54−often written (>>), and sometimes called a “sign-propagating”
54+often written (>>), and sometimes called a sign-propagating
5555right shift because it fills empty spots with copies of the highest bit.
5656-}
5757shiftRight : Int -> Int -> Int
@@ -66,7 +66,7 @@ zeros.
6666
6767This is called an [logical right
6868shift](http://en.wikipedia.org/wiki/Bitwise_operation#Logical_shift), often written (>>>),
69−and sometimes called a “zero-fill” right shift because it fills empty spots
69+and sometimes called a zero-fill right shift because it fills empty spots
7070with zeros.
7171-}
7272shiftRightLogical : Int -> Int -> Int