From 4acee56de8280ad7c263bd582feb2daebe22a550 Mon Sep 17 00:00:00 2001
From: sergeych <real.sergeych@gmail.com>
Date: Mon, 20 Apr 2026 14:09:09 +0300
Subject: [PATCH] small optimization of List.fill

---
 lynglib/stdlib/lyng/root.lyng | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/lynglib/stdlib/lyng/root.lyng b/lynglib/stdlib/lyng/root.lyng
index e3615ff..d5afb71 100644
--- a/lynglib/stdlib/lyng/root.lyng
+++ b/lynglib/stdlib/lyng/root.lyng
@@ -438,10 +438,9 @@ fun List<T>.sort(): void {
 */
 static fun List<T>.fill(size: Int, capacity = -1, block: (Int)->T): List<T> {
     require(size >= 0, "size must not be negative")
-    val capacity = capacity < size ? size : capacity
     List<T>().also {
         if( size > 0 ) {
-            it.ensureCapacity(capacity)
+            it.ensureCapacity(capacity < size ? size : capacity)
             for( i in 0..<size ) it += block(i)
         }
     }