Differences

This shows you the differences between two versions of the page.

--- codesnippets:folds [2021/04/08 17:51] – [Keeping order and beeing fast?] f2b216
+++ codesnippets:folds [2025/10/08 00:48] (current) – external edit 127.0.0.1
@@ Line 347: / Line 347: @@
 -50000000
 </code>
-    * executes in approximately 15 seconds
+    * executes within approximately __**15 seconds**__ on Intel(R) Core(TM) i5-8400 @ 2.80GHz
     * executes using large heap space
-      * {{:codesnippets:heapconsumptionfoldronnoncommutativeop.png?400|}}
+      * {{:codesnippets:heapconsumptionfoldronnoncommutativeop.png?200|}}
-  * example, using foldl and reverse:<code Haskell>
+  * example, using ''foldl'' and ''reverse'':<code Haskell>
 import qualified Data.List as L
@@ Line 375: / Line 375: @@
 -50000000
 </code>
-    * executes in approximately 15 seconds
+    * executes within approximately __**15 seconds**__ on Intel(R) Core(TM) i5-8400 @ 2.80GHz
     * executes using large heap space
-      * {{:codesnippets:heapconsumptionfoldlfronnoncommutativeop.png?400|}}
+      * {{:codesnippets:heapconsumptionfoldlfronnoncommutativeop.png?200|}}
+      * regardless of whether ''L.foldl' '' or ''foldl'' is used
+      * regardless of whether alternative ''reverse'' functions are implemented
+        * e.g.:<code Haskell>
+reverse' :: [a] -> [a]
+reverse' (x:rlx) = reverse'' [x] rlx
+    where
+        reverse'' :: [a] -> [a] -> [a]
+        reverse'' lxReverse [] = lxReverse
+        reverse'' lxReverse (x:rlx) = reverse'' (x : lxReverse) rlx
+</code>
+        * or<code Haskell>
+reverse' :: [a] -> [a]
+reverse' l = foldl (flip (:)) [] l
+</code>
+        * or<code Haskell>
+reverse' :: [a] -> [a]
+reverse' l = L.foldl' (flip (:)) [] l
+</code>
 ====== Conclusion and selection ======
@@ Line 388: / Line 406: @@
       * if the initial value is the first and the last respectively use ''foldr1''
+===== ✎ =====
+~~DISCUSSION~~