diff options
| author | Martin Ridgers <[email protected]> | 2025-09-16 13:19:48 +0200 |
|---|---|---|
| committer | GitHub Enterprise <[email protected]> | 2025-09-16 13:19:48 +0200 |
| commit | 709c21ed94a9a2c4a18a1686084019e5c953611c (patch) | |
| tree | 10c393ecc1166910a19d1b4038b9112504424411 | |
| parent | 5.7.2-pre0 (diff) | |
| download | zen-709c21ed94a9a2c4a18a1686084019e5c953611c.tar.xz zen-709c21ed94a9a2c4a18a1686084019e5c953611c.zip | |
Sorting oplog tree view by size would raise an error. (#497)
* Sorting oplog tree view by size would raise an error
* Updated frontend .zip archive
* Updated changelog
| -rw-r--r-- | CHANGELOG.md | 1 | ||||
| -rw-r--r-- | src/zenserver/frontend/html.zip | bin | 161185 -> 161191 bytes | |||
| -rw-r--r-- | src/zenserver/frontend/html/pages/tree.js | 2 |
3 files changed, 2 insertions, 1 deletions
diff --git a/CHANGELOG.md b/CHANGELOG.md index b14f5385a..8b51c4bc6 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -4,6 +4,7 @@ - Improvement: Make exceptions handled in http request processing to warnings - Improvement: Revised project oplog in-memory representation which reduces load times and memory usage - Improvement: Updated README.md to state the required version vcpkg +- Bugfix: Self-hosted dashboard; sorting oplog by size in the tree view would raise an error ## 5.7.1 - Improvement: Oplogs that have not been touched for 15 min are unloaded from memory during GC pass, oplogs are reloaded on demand diff --git a/src/zenserver/frontend/html.zip b/src/zenserver/frontend/html.zip Binary files differindex 1de4c3d74..bb3d61198 100644 --- a/src/zenserver/frontend/html.zip +++ b/src/zenserver/frontend/html.zip diff --git a/src/zenserver/frontend/html/pages/tree.js b/src/zenserver/frontend/html/pages/tree.js index 23ff3e819..08a578492 100644 --- a/src/zenserver/frontend/html/pages/tree.js +++ b/src/zenserver/frontend/html/pages/tree.js @@ -93,7 +93,7 @@ export class Page extends ZenPage const is_node_l = l.endsWith("/"); const any_nodes = is_node_l + r.endsWith("/"); if (any_nodes == 1) return is_node_l ? -1 : 1; - if (sort_by >= 0) return (new_nodes[r][sort_by] - new_nodes[l][sort_by]); + if (sort_by >= 0) return Number(new_nodes[r][sort_by] - new_nodes[l][sort_by]); return r < l; }) |