@crystaldesign/diva-navigator 26.10.0-beta.21 → 26.10.0-beta.23

package/build/esm/index.js

@@ -347,16 +347,16 @@ function HeaderDropdownPopper(_ref) {
 
 function ownKeys$4(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
 function _objectSpread$4(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$4(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$4(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
-function _createForOfIteratorHelper$3(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray$3(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
-function _unsupportedIterableToArray$3(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray$3(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray$3(r, a) : void 0; } }
-function _arrayLikeToArray$3(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+function _createForOfIteratorHelper$4(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray$4(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray$4(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray$4(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray$4(r, a) : void 0; } }
+function _arrayLikeToArray$4(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 /**
  * Returns path of node ids from root to target (inclusive), or null if not found.
  * Use `new Set(result)` for membership checks, or `result.slice(0, -1)` for ancestors only.
  */
 function findPathToNode(nodes, targetId) {
   var path = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
-  var _iterator = _createForOfIteratorHelper$3(nodes),
+  var _iterator = _createForOfIteratorHelper$4(nodes),
     _step;
   try {
     for (_iterator.s(); !(_step = _iterator.n()).done;) {
@@ -375,7 +375,7 @@ function findPathToNode(nodes, targetId) {
   return null;
 }
 function findNodeInTree(nodes, targetId) {
-  var _iterator2 = _createForOfIteratorHelper$3(nodes),
+  var _iterator2 = _createForOfIteratorHelper$4(nodes),
     _step2;
   try {
     for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
@@ -396,7 +396,7 @@ function findNodeInTree(nodes, targetId) {
 function flattenDisplayOrder(nodes, expandedIds) {
   var ids = [];
   var _walk = function walk(list) {
-    var _iterator3 = _createForOfIteratorHelper$3(list),
+    var _iterator3 = _createForOfIteratorHelper$4(list),
       _step3;
     try {
       for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
@@ -423,7 +423,7 @@ function flattenDisplayOrder(nodes, expandedIds) {
  */
 function computeEffectiveScores(nodes, scoreMap) {
   var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : new Map();
-  var _iterator4 = _createForOfIteratorHelper$3(nodes),
+  var _iterator4 = _createForOfIteratorHelper$4(nodes),
     _step4;
   try {
     for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
@@ -432,7 +432,7 @@ function computeEffectiveScores(nodes, scoreMap) {
       var best = (_scoreMap$get = scoreMap.get(node._id)) !== null && _scoreMap$get !== void 0 ? _scoreMap$get : Infinity;
       if (node.children) {
         computeEffectiveScores(node.children, scoreMap, result);
-        var _iterator5 = _createForOfIteratorHelper$3(node.children),
+        var _iterator5 = _createForOfIteratorHelper$4(node.children),
           _step5;
         try {
           for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
@@ -477,7 +477,7 @@ function sortTree(nodes, selectedPath, effectiveScores) {
 function collectTypes(nodes) {
   var types = new Set();
   var _walk2 = function walk(list) {
-    var _iterator6 = _createForOfIteratorHelper$3(list),
+    var _iterator6 = _createForOfIteratorHelper$4(list),
       _step6;
     try {
       for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
@@ -497,9 +497,9 @@ function collectTypes(nodes) {
 
 function ownKeys$3(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
 function _objectSpread$3(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$3(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$3(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
-function _createForOfIteratorHelper$2(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray$2(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
-function _unsupportedIterableToArray$2(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray$2(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray$2(r, a) : void 0; } }
-function _arrayLikeToArray$2(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+function _createForOfIteratorHelper$3(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray$3(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray$3(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray$3(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray$3(r, a) : void 0; } }
+function _arrayLikeToArray$3(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 function treeReducer(state, action) {
   switch (action.type) {
     case 'SET_TREE':
@@ -509,7 +509,7 @@ function treeReducer(state, action) {
           var path = findPathToNode(action.tree, action.selectedId);
           if (path) {
             var ancestors = path.slice(0, -1);
-            var _iterator = _createForOfIteratorHelper$2(ancestors),
+            var _iterator = _createForOfIteratorHelper$3(ancestors),
               _step;
             try {
               for (_iterator.s(); !(_step = _iterator.n()).done;) {
@@ -535,7 +535,7 @@ function treeReducer(state, action) {
     case 'SET_EXPANDED':
       {
         var next = new Set(state.expandedIds);
-        var _iterator2 = _createForOfIteratorHelper$2(action.nodeIds),
+        var _iterator2 = _createForOfIteratorHelper$3(action.nodeIds),
           _step2;
         try {
           for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
@@ -632,13 +632,290 @@ function useOrgTree(onSelect) {
   };
 }
 
+function _createForOfIteratorHelper$2(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray$2(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
+function _unsupportedIterableToArray$2(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray$2(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray$2(r, a) : void 0; } }
+function _arrayLikeToArray$2(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
+
+/** Minimal org shape the search operates on, produced by flattening the org tree. */
+
+var WORD_BOUNDARY = /[\s\-_./,()&]/;
+/** Added per token that appears left of its predecessor. Affects ranking only, never inclusion. */
+var ORDER_PENALTY = 0.5;
+/** Turns the name length into a sub-rank tie-breaker so shorter names win. */
+var NAME_LENGTH_TIEBREAK = 1000;
+/** Score for a node whose id was pasted verbatim; ranks above every name match. */
+var EXACT_ID_SCORE = -1;
+var FUZZY_THRESHOLD = 0.3;
+/** Below this length the fuzzy error ratio matches almost anything, so short tokens are skipped. */
+var MIN_FUZZY_TOKEN_LENGTH = 4;
+
+/**
+ * Lowercases and strips diacritics while emitting exactly one character per input
+ * character, so positions found in the folded text stay valid indices into the
+ * original string and can be used for highlighting.
+ */
+function foldForSearch(text) {
+  var folded = '';
+  for (var i = 0; i < text.length; i++) {
+    var _char = text[i];
+    var lower = _char.toLowerCase();
+    if (lower.length !== 1) {
+      folded += _char;
+      continue;
+    }
+    var decomposed = lower.normalize('NFD');
+    folded += decomposed.length > 1 ? decomposed[0] : lower;
+  }
+  return folded;
+}
+
+/** Splits a raw query into folded, non-empty tokens. */
+function tokenizeQuery(query) {
+  return foldForSearch(query).trim().split(/\s+/).filter(Boolean);
+}
+function findOccurrences(haystack, token) {
+  var positions = [];
+  var from = 0;
+  for (;;) {
+    var at = haystack.indexOf(token, from);
+    if (at === -1) return positions;
+    positions.push(at);
+    from = at + 1;
+  }
+}
+
+/** 0 = match at the start of the name, 1 = at the start of a word, 2 = inside a word. */
+function positionRank(haystack, at) {
+  if (at === 0) return 0;
+  return WORD_BOUNDARY.test(haystack[at - 1]) ? 1 : 2;
+}
+/**
+ * Requires every token to occur in the name, in any order and with any number of
+ * words in between. Returns null as soon as one token is missing.
+ */
+function matchAllTokens(displayName, tokens) {
+  var haystack = foldForSearch(displayName);
+  var ranges = [];
+  var bestPositions = [];
+  var positionScore = 0;
+  var _iterator = _createForOfIteratorHelper$2(tokens),
+    _step;
+  try {
+    for (_iterator.s(); !(_step = _iterator.n()).done;) {
+      var token = _step.value;
+      var positions = findOccurrences(haystack, token);
+      if (positions.length === 0) return null;
+      var bestRank = positionRank(haystack, positions[0]);
+      var bestPosition = positions[0];
+      var _iterator2 = _createForOfIteratorHelper$2(positions),
+        _step2;
+      try {
+        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+          var at = _step2.value;
+          ranges.push([at, at + token.length - 1]);
+          var rank = positionRank(haystack, at);
+          if (rank < bestRank) {
+            bestRank = rank;
+            bestPosition = at;
+          }
+        }
+      } catch (err) {
+        _iterator2.e(err);
+      } finally {
+        _iterator2.f();
+      }
+      positionScore += bestRank;
+      bestPositions.push(bestPosition);
+    }
+  } catch (err) {
+    _iterator.e(err);
+  } finally {
+    _iterator.f();
+  }
+  var outOfOrder = 0;
+  for (var i = 1; i < bestPositions.length; i++) {
+    if (bestPositions[i] < bestPositions[i - 1]) outOfOrder++;
+  }
+  var score = positionScore / tokens.length + outOfOrder * ORDER_PENALTY + displayName.length / NAME_LENGTH_TIEBREAK;
+  return {
+    ranges: ranges,
+    score: score
+  };
+}
+
+/** Creates the Fuse index for the typo-tolerant fallback. Memoize this per item list. */
+function createOrgFuse(items) {
+  return new Fuse(items, {
+    keys: ['displayName'],
+    getFn: function getFn(item) {
+      return foldForSearch(item.displayName);
+    },
+    threshold: FUZZY_THRESHOLD,
+    ignoreLocation: true,
+    includeScore: true
+  });
+}
+
+/**
+ * Typo-tolerant fallback. Intersects the per-token hits so a multi-word query still
+ * narrows, and returns no scores at all when any token has no fuzzy hit.
+ */
+function searchFuzzy(fuse, tokens) {
+  var _intersection;
+  var usableTokens = tokens.filter(function (token) {
+    return token.length >= MIN_FUZZY_TOKEN_LENGTH;
+  });
+  if (usableTokens.length === 0) return new Map();
+  var summedScores = new Map();
+  var intersection = null;
+  var _iterator3 = _createForOfIteratorHelper$2(usableTokens),
+    _step3;
+  try {
+    for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+      var token = _step3.value;
+      var hits = new Map();
+      var _iterator5 = _createForOfIteratorHelper$2(fuse.search(token)),
+        _step5;
+      try {
+        for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
+          var _result$score;
+          var _result = _step5.value;
+          hits.set(_result.item._id, (_result$score = _result.score) !== null && _result$score !== void 0 ? _result$score : 1);
+        }
+      } catch (err) {
+        _iterator5.e(err);
+      } finally {
+        _iterator5.f();
+      }
+      if (hits.size === 0) return new Map();
+      var _iterator6 = _createForOfIteratorHelper$2(hits),
+        _step6;
+      try {
+        for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
+          var _summedScores$get;
+          var _step6$value = _slicedToArray(_step6.value, 2),
+            _id = _step6$value[0],
+            score = _step6$value[1];
+          summedScores.set(_id, ((_summedScores$get = summedScores.get(_id)) !== null && _summedScores$get !== void 0 ? _summedScores$get : 0) + score);
+        }
+      } catch (err) {
+        _iterator6.e(err);
+      } finally {
+        _iterator6.f();
+      }
+      if (intersection === null) {
+        intersection = new Set(hits.keys());
+        continue;
+      }
+      for (var _i = 0, _arr = _toConsumableArray(intersection); _i < _arr.length; _i++) {
+        var id = _arr[_i];
+        if (!hits.has(id)) intersection["delete"](id);
+      }
+      if (intersection.size === 0) return new Map();
+    }
+  } catch (err) {
+    _iterator3.e(err);
+  } finally {
+    _iterator3.f();
+  }
+  var result = new Map();
+  var _iterator4 = _createForOfIteratorHelper$2((_intersection = intersection) !== null && _intersection !== void 0 ? _intersection : []),
+    _step4;
+  try {
+    for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
+      var _summedScores$get2;
+      var _id2 = _step4.value;
+      result.set(_id2, (_summedScores$get2 = summedScores.get(_id2)) !== null && _summedScores$get2 !== void 0 ? _summedScores$get2 : 1);
+    }
+  } catch (err) {
+    _iterator4.e(err);
+  } finally {
+    _iterator4.f();
+  }
+  return result;
+}
+
+/**
+ * Matches orgs by display name: every query token must occur in the name, in any
+ * order and with any words in between. A single-token query also matches an org id
+ * verbatim. Fuzzy matching runs only when nothing matched literally, so a typo
+ * still finds its org without letting fuzzy noise into normal results.
+ */
+function searchOrgs(items, query, fuse) {
+  var matchedIds = new Set();
+  var matchIndicesMap = new Map();
+  var scoreMap = new Map();
+  var tokens = tokenizeQuery(query);
+  if (tokens.length === 0) return {
+    matchedIds: matchedIds,
+    matchIndicesMap: matchIndicesMap,
+    scoreMap: scoreMap
+  };
+  var _iterator7 = _createForOfIteratorHelper$2(items),
+    _step7;
+  try {
+    for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
+      var _item = _step7.value;
+      var match = matchAllTokens(_item.displayName, tokens);
+      if (!match) continue;
+      matchedIds.add(_item._id);
+      matchIndicesMap.set(_item._id, match.ranges);
+      scoreMap.set(_item._id, match.score);
+    }
+  } catch (err) {
+    _iterator7.e(err);
+  } finally {
+    _iterator7.f();
+  }
+  if (tokens.length === 1) {
+    var _iterator8 = _createForOfIteratorHelper$2(items),
+      _step8;
+    try {
+      for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
+        var item = _step8.value;
+        if (foldForSearch(item._id) !== tokens[0]) continue;
+        matchedIds.add(item._id);
+        scoreMap.set(item._id, EXACT_ID_SCORE);
+      }
+    } catch (err) {
+      _iterator8.e(err);
+    } finally {
+      _iterator8.f();
+    }
+  }
+  if (matchedIds.size > 0) return {
+    matchedIds: matchedIds,
+    matchIndicesMap: matchIndicesMap,
+    scoreMap: scoreMap
+  };
+  var _iterator9 = _createForOfIteratorHelper$2(searchFuzzy(fuse, tokens)),
+    _step9;
+  try {
+    for (_iterator9.s(); !(_step9 = _iterator9.n()).done;) {
+      var _step9$value = _slicedToArray(_step9.value, 2),
+        id = _step9$value[0],
+        score = _step9$value[1];
+      matchedIds.add(id);
+      scoreMap.set(id, score);
+    }
+  } catch (err) {
+    _iterator9.e(err);
+  } finally {
+    _iterator9.f();
+  }
+  return {
+    matchedIds: matchedIds,
+    matchIndicesMap: matchIndicesMap,
+    scoreMap: scoreMap
+  };
+}
+
 function ownKeys$2(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
 function _objectSpread$2(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$2(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$2(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
 function _createForOfIteratorHelper$1(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray$1(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t["return"] || t["return"](); } finally { if (u) throw o; } } }; }
 function _unsupportedIterableToArray$1(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray$1(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray$1(r, a) : void 0; } }
 function _arrayLikeToArray$1(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 function flattenTree(nodes) {
-  var ancestors = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
   var result = [];
   var _iterator = _createForOfIteratorHelper$1(nodes),
     _step;
@@ -647,11 +924,10 @@ function flattenTree(nodes) {
       var node = _step.value;
       result.push({
         _id: node._id,
-        displayName: node.displayName,
-        ancestorIds: ancestors
+        displayName: node.displayName
       });
       if (node.children) {
-        result.push.apply(result, _toConsumableArray(flattenTree(node.children, [].concat(_toConsumableArray(ancestors), [node._id]))));
+        result.push.apply(result, _toConsumableArray(flattenTree(node.children)));
       }
     }
   } catch (err) {
@@ -681,33 +957,30 @@ function annotateSubtree(nodes, matchedIds, matchIndicesMap) {
 }
 
 /**
- * Filters the tree by optional text match and/or type filters.
- * Keeps matched nodes (with full subtrees) and their ancestors to preserve tree structure.
+ * Reduces the tree to matched nodes (keeping their full subtrees) plus the
+ * ancestors needed to keep the surrounding structure visible.
  */
-function filterTree(nodes, typeFilters, matchedIds, matchIndicesMap) {
-  var hasTextSearch = matchedIds != null && matchIndicesMap != null;
+function filterTree(nodes, matchedIds, matchIndicesMap) {
   var result = [];
   var _iterator2 = _createForOfIteratorHelper$1(nodes),
     _step2;
   try {
     for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
       var node = _step2.value;
-      var typeOk = typeFilters.size === 0 || typeFilters.has(node.orgType);
-      var directMatch = hasTextSearch ? matchedIds.has(node._id) && typeOk : typeFilters.has(node.orgType);
-      if (directMatch) {
+      if (matchedIds.has(node._id)) {
         result.push(_objectSpread$2(_objectSpread$2({}, node), {}, {
           matched: true,
-          matchIndices: hasTextSearch ? matchIndicesMap.get(node._id) : undefined,
-          children: node.children ? annotateSubtree(node.children, hasTextSearch ? matchedIds : undefined, hasTextSearch ? matchIndicesMap : undefined) : undefined
+          matchIndices: matchIndicesMap.get(node._id),
+          children: node.children ? annotateSubtree(node.children, matchedIds, matchIndicesMap) : undefined
+        }));
+        continue;
+      }
+      var filteredChildren = node.children ? filterTree(node.children, matchedIds, matchIndicesMap) : undefined;
+      if (filteredChildren && filteredChildren.length > 0) {
+        result.push(_objectSpread$2(_objectSpread$2({}, node), {}, {
+          matched: false,
+          children: filteredChildren
         }));
-      } else {
-        var filteredChildren = node.children ? filterTree(node.children, typeFilters, matchedIds, matchIndicesMap) : undefined;
-        if (filteredChildren && filteredChildren.length > 0) {
-          result.push(_objectSpread$2(_objectSpread$2({}, node), {}, {
-            matched: false,
-            children: filteredChildren
-          }));
-        }
       }
     }
   } catch (err) {
@@ -721,6 +994,8 @@ function filterTree(nodes, typeFilters, matchedIds, matchIndicesMap) {
 /**
  * Returns matching nodes with their full subtrees, flattened out of the
  * original hierarchy. Used to scope text search to type-matched nodes only.
+ * Descendants of a match are not emitted again: they are already visible inside
+ * the subtree that was kept.
  */
 function filterTreeByTypesOnly(nodes, typeFilters) {
   var result = [];
@@ -734,6 +1009,7 @@ function filterTreeByTypesOnly(nodes, typeFilters) {
           matched: true,
           children: node.children ? annotateSubtree(node.children) : undefined
         }));
+        continue;
       }
       if (node.children) {
         result.push.apply(result, _toConsumableArray(filterTreeByTypesOnly(node.children, typeFilters)));
@@ -746,203 +1022,25 @@ function filterTreeByTypesOnly(nodes, typeFilters) {
   }
   return result;
 }
-
-/**
- * Fuse.js indices include noisy single-char overlaps outside the actual match region.
- * Finds the densest cluster of matched chars within a pattern-sized window and
- * drops indices outside it.
- */
-function filterMatchIndices(indices, patternLength) {
-  if (indices.length <= 1) return indices;
-  var windowSize = patternLength + 2;
-  var positions = [];
-  var _iterator4 = _createForOfIteratorHelper$1(indices),
-    _step4;
-  try {
-    for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
-      var _step4$value = _slicedToArray(_step4.value, 2),
-        start = _step4$value[0],
-        end = _step4$value[1];
-      for (var i = start; i <= end; i++) positions.push(i);
-    }
-  } catch (err) {
-    _iterator4.e(err);
-  } finally {
-    _iterator4.f();
-  }
-  positions.sort(function (a, b) {
-    return a - b;
-  });
-  if (positions.length === 0) return indices;
-  var bestLeft = 0;
-  var bestRight = 0;
-  var bestCount = 0;
-  var left = 0;
-  for (var right = 0; right < positions.length; right++) {
-    while (positions[right] - positions[left] >= windowSize) left++;
-    if (right - left + 1 > bestCount) {
-      bestCount = right - left + 1;
-      bestLeft = positions[left];
-      bestRight = positions[right];
-    }
-  }
-  return indices.filter(function (_ref) {
-    var _ref2 = _slicedToArray(_ref, 2),
-      start = _ref2[0],
-      end = _ref2[1];
-    return end >= bestLeft && start <= bestRight;
-  });
-}
-
-/**
- * Returns 0 for match at start of string, 1 for start of a word, 2 for mid-word.
- * Used to boost score so matches at word boundaries rank higher.
- */
-function getMatchPositionScore(arg) {
-  var _arg$matches;
-  if (!((_arg$matches = arg.matches) !== null && _arg$matches !== void 0 && _arg$matches.length)) return 3;
-  var best = 3;
-  var _iterator5 = _createForOfIteratorHelper$1(arg.matches),
-    _step5;
-  try {
-    for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
-      var _match$indices, _match$value;
-      var match = _step5.value;
-      if (!((_match$indices = match.indices) !== null && _match$indices !== void 0 && _match$indices.length)) continue;
-      var startIdx = match.indices[0][0];
-      if (startIdx === 0) return 0;
-      var charBefore = (_match$value = match.value) === null || _match$value === void 0 ? void 0 : _match$value[startIdx - 1];
-      if (charBefore !== undefined && /[\s\-_./,()]/.test(charBefore)) best = Math.min(best, 1);else best = Math.min(best, 2);
-    }
-  } catch (err) {
-    _iterator5.e(err);
-  } finally {
-    _iterator5.f();
-  }
-  return best;
-}
 function collectExpandedIds(nodes) {
   var result = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : new Set();
-  var _iterator6 = _createForOfIteratorHelper$1(nodes),
-    _step6;
+  var _iterator4 = _createForOfIteratorHelper$1(nodes),
+    _step4;
   try {
-    for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
-      var node = _step6.value;
+    for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
+      var node = _step4.value;
       if (node.children && node.children.length > 0) {
         result.add(node._id);
         collectExpandedIds(node.children, result);
       }
     }
   } catch (err) {
-    _iterator6.e(err);
+    _iterator4.e(err);
   } finally {
-    _iterator6.f();
+    _iterator4.f();
   }
   return result;
 }
-var MAX_FUSE_SCORE = 0.4;
-var POSITION_WEIGHT = 0.15;
-var MATCH_COUNT_BONUS = 0.5;
-function collectExactIdMatches(flatItems, query) {
-  var normalizedQuery = query.trim().toLowerCase();
-  if (!normalizedQuery) return new Set();
-  return new Set(flatItems.filter(function (item) {
-    return item._id.toLowerCase() === normalizedQuery;
-  }).map(function (item) {
-    return item._id;
-  }));
-}
-function performSearch(fuse, flatItems, query) {
-  var words = query.trim().split(/\s+/);
-  var matchedIds = new Set();
-  var matchIndicesMap = new Map();
-  var scoreMap = new Map();
-  var _iterator7 = _createForOfIteratorHelper$1(words),
-    _step7;
-  try {
-    for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
-      var word = _step7.value;
-      var results = fuse.search(word).filter(function (r) {
-        var _r$score;
-        return ((_r$score = r.score) !== null && _r$score !== void 0 ? _r$score : 1) <= MAX_FUSE_SCORE;
-      });
-      var _iterator9 = _createForOfIteratorHelper$1(results),
-        _step9;
-      try {
-        for (_iterator9.s(); !(_step9 = _iterator9.n()).done;) {
-          var _scoreMap$get, _result$score;
-          var result = _step9.value;
-          var prev = (_scoreMap$get = scoreMap.get(result.item._id)) !== null && _scoreMap$get !== void 0 ? _scoreMap$get : 0;
-          // getMatchPositionScore returns rank (0 best -> 2 worst). Convert to boost
-          // so stronger positional matches receive larger score reductions.
-          var positionRank = getMatchPositionScore(result);
-          var positionBonus = Math.max(0, 2 - Math.min(positionRank, 2)) * POSITION_WEIGHT;
-          scoreMap.set(result.item._id, prev + ((_result$score = result.score) !== null && _result$score !== void 0 ? _result$score : 0) - positionBonus - MATCH_COUNT_BONUS);
-          if (result.matches) {
-            var _iterator10 = _createForOfIteratorHelper$1(result.matches),
-              _step10;
-            try {
-              for (_iterator10.s(); !(_step10 = _iterator10.n()).done;) {
-                var match = _step10.value;
-                if (match.indices && match.key === 'displayName') {
-                  var _matchIndicesMap$get;
-                  var cleaned = filterMatchIndices(match.indices, word.length);
-                  var existing = (_matchIndicesMap$get = matchIndicesMap.get(result.item._id)) !== null && _matchIndicesMap$get !== void 0 ? _matchIndicesMap$get : [];
-                  matchIndicesMap.set(result.item._id, [].concat(_toConsumableArray(existing), _toConsumableArray(cleaned)));
-                }
-              }
-            } catch (err) {
-              _iterator10.e(err);
-            } finally {
-              _iterator10.f();
-            }
-          }
-        }
-      } catch (err) {
-        _iterator9.e(err);
-      } finally {
-        _iterator9.f();
-      }
-      matchedIds = matchedIds.union(new Set(results.map(function (r) {
-        return r.item._id;
-      })));
-    }
-  } catch (err) {
-    _iterator7.e(err);
-  } finally {
-    _iterator7.f();
-  }
-  var exactIdMatchedIds = collectExactIdMatches(flatItems, query);
-  var _iterator8 = _createForOfIteratorHelper$1(exactIdMatchedIds),
-    _step8;
-  try {
-    var _loop = function _loop() {
-      var _scoreMap$get2;
-      var matchedId = _step8.value;
-      matchedIds.add(matchedId);
-      var prev = (_scoreMap$get2 = scoreMap.get(matchedId)) !== null && _scoreMap$get2 !== void 0 ? _scoreMap$get2 : 0;
-      scoreMap.set(matchedId, prev - 1);
-      var matchedItem = flatItems.find(function (item) {
-        return item._id === matchedId;
-      });
-      if (matchedItem && matchedItem.displayName.length > 0) {
-        matchIndicesMap.set(matchedId, [[0, matchedItem.displayName.length - 1]]);
-      }
-    };
-    for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
-      _loop();
-    }
-  } catch (err) {
-    _iterator8.e(err);
-  } finally {
-    _iterator8.f();
-  }
-  return {
-    matchedIds: matchedIds,
-    matchIndicesMap: matchIndicesMap,
-    scoreMap: scoreMap
-  };
-}
 function useTreeSearch(tree) {
   var _useState = useState(''),
     _useState2 = _slicedToArray(_useState, 2),
@@ -970,14 +1068,7 @@ function useTreeSearch(tree) {
     return flattenTree(treeForSearch);
   }, [treeForSearch]);
   var fuse = useMemo(function () {
-    return new Fuse(flatItems, {
-      keys: ['displayName'],
-      threshold: MAX_FUSE_SCORE,
-      ignoreLocation: true,
-      findAllMatches: true,
-      includeMatches: true,
-      includeScore: true
-    });
+    return createOrgFuse(flatItems);
   }, [flatItems]);
   var _useMemo = useMemo(function () {
       var emptyScoreMap = new Map();
@@ -991,11 +1082,11 @@ function useTreeSearch(tree) {
         };
       }
       if (hasTextSearch) {
-        var _performSearch = performSearch(fuse, flatItems, deferredQuery),
-          matchedIds = _performSearch.matchedIds,
-          matchIndicesMap = _performSearch.matchIndicesMap,
-          _scoreMap = _performSearch.scoreMap;
-        var filtered = filterTree(treeForSearch, new Set(), matchedIds, matchIndicesMap);
+        var _searchOrgs = searchOrgs(flatItems, deferredQuery, fuse),
+          matchedIds = _searchOrgs.matchedIds,
+          matchIndicesMap = _searchOrgs.matchIndicesMap,
+          _scoreMap = _searchOrgs.scoreMap;
+        var filtered = filterTree(treeForSearch, matchedIds, matchIndicesMap);
         var expandedIds = filtered ? collectExpandedIds(filtered) : new Set();
         return {
           filteredTree: filtered !== null && filtered !== void 0 ? filtered : [],

package/build/types/navigator/src/OrgTreeSelect/orgSearch.d.ts

@@ -0,0 +1,24 @@
+import Fuse from 'fuse.js';
+/** Minimal org shape the search operates on, produced by flattening the org tree. */
+export interface SearchableOrg {
+    _id: string;
+    displayName: string;
+}
+export interface OrgSearchResult {
+    matchedIds: Set<string>;
+    matchIndicesMap: Map<string, ReadonlyArray<readonly [number, number]>>;
+    /** Lower is better; consumed by `computeEffectiveScores` / `sortTree`. */
+    scoreMap: Map<string, number>;
+}
+/** Splits a raw query into folded, non-empty tokens. */
+export declare function tokenizeQuery(query: string): string[];
+/** Creates the Fuse index for the typo-tolerant fallback. Memoize this per item list. */
+export declare function createOrgFuse(items: SearchableOrg[]): Fuse<SearchableOrg>;
+/**
+ * Matches orgs by display name: every query token must occur in the name, in any
+ * order and with any words in between. A single-token query also matches an org id
+ * verbatim. Fuzzy matching runs only when nothing matched literally, so a typo
+ * still finds its org without letting fuzzy noise into normal results.
+ */
+export declare function searchOrgs(items: SearchableOrg[], query: string, fuse: Fuse<SearchableOrg>): OrgSearchResult;
+//# sourceMappingURL=orgSearch.d.ts.map

package/build/types/navigator/src/OrgTreeSelect/orgSearch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"orgSearch.d.ts","sourceRoot":"","sources":["../../../../../src/OrgTreeSelect/orgSearch.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,SAAS,CAAC;AAE3B,qFAAqF;AACrF,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,MAAM,CAAC;IACZ,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,eAAe;IAC9B,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACxB,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACvE,0EAA0E;IAC1E,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC/B;AAiCD,wDAAwD;AACxD,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAErD;AA6DD,yFAAyF;AACzF,wBAAgB,aAAa,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,CAQzE;AAmCD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,aAAa,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,eAAe,CA+B5G"}

package/build/types/navigator/src/OrgTreeSelect/useTreeSearch.d.ts

@@ -1,10 +1,10 @@
-import { OrgTreeNode, OrgType } from './types';
+import { OrgTreeNode, FilteredOrgTreeNode, OrgType } from './types';
 export default function useTreeSearch(tree: OrgTreeNode[]): {
     searchQuery: string;
     onSearchChange: (value: string) => void;
     typeFilters: Set<OrgType>;
     toggleTypeFilter: (type: OrgType) => void;
-    filteredTree: OrgTreeNode[] | null;
+    filteredTree: FilteredOrgTreeNode[] | null;
     searchExpandedIds: Set<string> | null;
     scoreMap: Map<string, number>;
     isSearchActive: boolean;

package/build/types/navigator/src/OrgTreeSelect/useTreeSearch.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"useTreeSearch.d.ts","sourceRoot":"","sources":["../../../../../src/OrgTreeSelect/useTreeSearch.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,WAAW,EAAuB,OAAO,EAAE,MAAM,SAAS,CAAC;AAkOpE,MAAM,CAAC,OAAO,UAAU,aAAa,CAAC,IAAI,EAAE,WAAW,EAAE;;4BAKZ,MAAM;;6BAIL,OAAO;;;;;EAuDpD"}
+{"version":3,"file":"useTreeSearch.d.ts","sourceRoot":"","sources":["../../../../../src/OrgTreeSelect/useTreeSearch.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,mBAAmB,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAqGpE,MAAM,CAAC,OAAO,UAAU,aAAa,CAAC,IAAI,EAAE,WAAW,EAAE;;4BAKZ,MAAM;;6BAIL,OAAO;;;;;EA8CpD"}

package/build/types/navigator/src/tests/unit/OrgTreeSelect/orgSearch.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=orgSearch.test.d.ts.map

package/build/types/navigator/src/tests/unit/OrgTreeSelect/orgSearch.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"orgSearch.test.d.ts","sourceRoot":"","sources":["../../../../../../../src/tests/unit/OrgTreeSelect/orgSearch.test.ts"],"names":[],"mappings":""}

package/build/types/navigator/src/tests/unit/OrgTreeSelect/useTreeSearch.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=useTreeSearch.test.d.ts.map

package/build/types/navigator/src/tests/unit/OrgTreeSelect/useTreeSearch.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useTreeSearch.test.d.ts","sourceRoot":"","sources":["../../../../../../../src/tests/unit/OrgTreeSelect/useTreeSearch.test.ts"],"names":[],"mappings":""}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@crystaldesign/diva-navigator",
-  "version": "26.10.0-beta.21",
+  "version": "26.10.0-beta.23",
   "license": "MIT",
   "devDependencies": {
     "@testing-library/jest-dom": "^6.5.0",
@@ -10,8 +10,8 @@
     "react-dom": "18.3.1"
   },
   "dependencies": {
-    "@crystaldesign/content-item": "26.10.0-beta.21",
-    "@crystaldesign/organization-selection": "26.10.0-beta.21",
+    "@crystaldesign/content-item": "26.10.0-beta.23",
+    "@crystaldesign/organization-selection": "26.10.0-beta.23",
     "classnames": "^2.5.1",
     "fuse.js": "^7.0.0",
     "html5-qrcode": "^2.3.8",
@@ -27,5 +27,5 @@
   },
   "module": "build/esm/index.js",
   "types": "./build/types/navigator/src/index.d.ts",
-  "gitHead": "5e88d0ebb780247f5a9d8f598381905682a1409d"
+  "gitHead": "b2e70ecdffcda726f5abaf4834ac6e1fdf8d7b22"
 }