@iobroker/gui-components 10.3.11 → 10.3.13

package/build/Components/ObjectBrowser/utils.js

@@ -818,6 +818,10 @@ export function buildTree(objects, options) {
         aliasesMap: {},
     };
     let cRoot = root;
+    // `info.ids` is not sorted for a binary search: a generated level follows the ID that created it, and the
+    // sorting above ('.' as '!!!') is not the plain string order. A missed level was created a second time:
+    // two nodes with the same ID (https://github.com/ioBroker/ioBroker.admin/issues/3693)
+    const knownIds = new Set();
     for (let i = 0; i < ids.length; i++) {
         const id = ids[i];
         if (!id) {
@@ -888,6 +892,7 @@ export function buildTree(objects, options) {
             }
         }
         info.ids.push(id);
+        knownIds.add(id);
         let repeat;
         // if next level
         do {
@@ -901,7 +906,7 @@ export function buildTree(objects, options) {
                     for (let k = currentPathLen; k < parts.length - 1; k++) {
                         curPath += (curPath ? '.' : '') + parts[k];
                         // level does not exist
-                        if (!binarySearch(info.ids, curPath)) {
+                        if (!knownIds.has(curPath)) {
                             const _cRoot = {
                                 data: {
                                     name: parts[k],
@@ -916,7 +921,8 @@ export function buildTree(objects, options) {
                             cRoot.children ||= [];
                             cRoot.children.push(_cRoot);
                             cRoot = _cRoot;
-                            info.ids.push(curPath); // IDs will be added by alphabet
+                            info.ids.push(curPath);
+                            knownIds.add(curPath);
                         }
                         else if (cRoot.children) {
                             cRoot = cRoot.children.find(item => item.data.name === parts[k]);