aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTom Smeding <tom@tomsmeding.com>2026-03-14 11:52:56 +0100
committerTom Smeding <tom@tomsmeding.com>2026-03-14 12:03:01 +0100
commit0f8db83a0c3043c7e8b7739b93e97de992c932d9 (patch)
treed92648248ff07cb3730f8d5ab3a5ce722633b784
parent1553db92a5524bbc4ebc93d1a5c93a5a446409e3 (diff)
Fix typo and reword docs
-rw-r--r--src/Data/Array/XArray.hs8
1 files changed, 3 insertions, 5 deletions
diff --git a/src/Data/Array/XArray.hs b/src/Data/Array/XArray.hs
index 1a4ffbb..ee29ae9 100644
--- a/src/Data/Array/XArray.hs
+++ b/src/Data/Array/XArray.hs
@@ -302,7 +302,7 @@ sumOuter ssh ssh' arr
arr
-- | This creates an array from a list of arrays of one less dimension.
--- The list is streamed, it's length is checked and it's verified
+-- The list is streamed, its length is checked and it's verified
-- that all arrays on the list have the same shape.
{-# INLINE fromListOuterSN #-}
fromListOuterSN :: forall n sh a. Storable a
@@ -316,10 +316,8 @@ fromListOuterSN m sh l
-- | This checks that the list has the given length and that all shapes in the
-- list are equal. The list is streamed.
--- We force the first array on the list early to free some previously used
--- memory (a lot of memory if it triggers evaluation of a big tensor
--- all list elements are made from) before @unsafeNew@ allocates
--- a big chunk of memory again.
+-- The first array in the list is forced early to potentially release some
+-- memory, before allocating the (large) new array.
{-# INLINEABLE ravelOuterN #-}
ravelOuterN :: (KnownNat k, Storable a)
=> Int -> NonEmpty (S.Array k a) -> S.Array (1 + k) a