Use MathJax format for complexity annotations

containers-tests/benchmarks/LookupGE/LookupGE_IntMap.hs

@@ -72,7 +72,7 @@ lookupGE4 k t = k `seq` case t of
 -- Utilities
 -------------------------------------------------------------------------------
 
--- | /O(log n)/. The minimal key of the map.
+-- | \(O(\log n)\). The minimal key of the map.
 findMinMaybe :: IntMap a -> Maybe (Key, a)
 findMinMaybe m
   | null m = Nothing

containers/src/Data/IntMap.hs

@@ -50,9 +50,9 @@
 --
 -- Operation comments contain the operation time complexity in
 -- the Big-O notation <http://en.wikipedia.org/wiki/Big_O_notation>.
--- Many operations have a worst-case complexity of /O(min(n,W))/.
+-- Many operations have a worst-case complexity of \(O(\min(n,W))\).
 -- This means that the operation can become linear in the number of
--- elements with a maximum of /W/ -- the number of bits in an 'Int'
+-- elements with a maximum of \(W\) -- the number of bits in an 'Int'
 -- (32 or 64).
 -----------------------------------------------------------------------------
 

containers/src/Data/IntMap/Lazy.hs

@@ -40,8 +40,8 @@
 --
 -- == Detailed performance information
 --
--- The amortized running time is given for each operation, with /n/ referring to
--- the number of entries in the map and /W/ referring to the number of bits in
+-- The amortized running time is given for each operation, with \(n\) referring to
+-- the number of entries in the map and \(W\) referring to the number of bits in
 -- an 'Int' (32 or 64).
 --
 -- Benchmarks comparing "Data.IntMap.Lazy" with other dictionary

containers/src/Data/IntMap/Strict.hs

@@ -48,8 +48,8 @@
 --
 -- == Detailed performance information
 --
--- The amortized running time is given for each operation, with /n/ referring to
--- the number of entries in the map and /W/ referring to the number of bits in
+-- The amortized running time is given for each operation, with \(n\) referring to
+-- the number of entries in the map and \(W\) referring to the number of bits in
 -- an 'Int' (32 or 64).
 --
 -- Benchmarks comparing "Data.IntMap.Strict" with other dictionary

containers/src/Data/IntSet.hs

@@ -31,9 +31,9 @@
 --
 -- == Performance information
 --
--- Many operations have a worst-case complexity of /O(min(n,W))/.
+-- Many operations have a worst-case complexity of \(O(\min(n,W))\).
 -- This means that the operation can become linear in the number of
--- elements with a maximum of /W/ -- the number of bits in an 'Int'
+-- elements with a maximum of \(W\) -- the number of bits in an 'Int'
 -- (32 or 64).
 --
 --