A simple doubt about // operator ....

Heron heron_carvalho at bol.com.br
Sat Nov 1 02:08:02 EST 2003


     The GHC documentation says about // (update array operator):

"For MOST array types, this operation is O(n) where n is the size of the
array. However, the DiffArray type provides this operation with complexity
linear in the number of updates".

  The word "MOST" sugggests that there are other array variants for which //
is linear on the number of updates. For unboxed arrays, // is linear on the
array size or number of updates ?


More information about the Glasgow-haskell-users mailing list