From b4b586268b711b05fb38f3c7db297fad21bd2daf Mon Sep 17 00:00:00 2001
From: Christoph Daum <christoph.daum@coding-pioneers.com>
Date: Mon, 13 Apr 2026 22:05:03 +0200
Subject: [PATCH] fix(sort): handle unequal version segment count

The dotsep sorter only iterated over the shorter
version's segments, treating 6.8 and 6.8.2 as
equal. Now iterates over the longer and treats
missing segments as 0, so 6.8 < 6.8.2.
---
 js/tablesort.dotsep.min.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/js/tablesort.dotsep.min.js b/js/tablesort.dotsep.min.js
index 9826335..a9208df 100644
--- a/js/tablesort.dotsep.min.js
+++ b/js/tablesort.dotsep.min.js
@@ -3,4 +3,4 @@
  * http://tristen.ca/tablesort/demo/
  * Copyright (c) 2025 ; Licensed MIT
 */
-Tablesort.extend("dotsep",function(t){return/^(\d+\.)+\d+$/.test(t)},function(t,r){t=t.split("."),r=r.split(".");for(var e,n,i=0,s=t.length;i<s;i++)if((e=parseInt(t[i],10))!==(n=parseInt(r[i],10))){if(n<e)return-1;if(e<n)return 1}return 0});
\ No newline at end of file
+Tablesort.extend("dotsep",function(t){return/^(\d+\.)+\d+$/.test(t)},function(t,r){t=t.split("."),r=r.split(".");for(var e,n,i=0,s=Math.max(t.length,r.length);i<s;i++){e=i<t.length?parseInt(t[i],10):0;n=i<r.length?parseInt(r[i],10):0;if(e!==n){if(n<e)return-1;if(e<n)return 1}}return 0});
\ No newline at end of file