@atlaskit/editor-common
Version:
A package that contains common classes and components for editor and renderer
67 lines (66 loc) • 2.3 kB
JavaScript
import Fuse from 'fuse.js';
import memoizeOne from 'memoize-one';
var processQuickInsertItems = function processQuickInsertItems(items, intl) {
return items.reduce(function (acc, item) {
if (typeof item === 'function' &&
// we preserve handler items with disableMemo so that we
// can process them in a later step outside of memoizations
!item.disableMemo) {
var quickInsertItems = item(intl);
return acc.concat(quickInsertItems);
}
return acc.concat(item);
}, []);
};
var memoizedProcessQuickInsertItems = memoizeOne(processQuickInsertItems);
export var memoProcessQuickInsertItems = function memoProcessQuickInsertItems(items, intl) {
var memoizedResults = memoizedProcessQuickInsertItems(items, intl);
var hasDisabledMemos = items.some(function (item) {
return typeof item === 'function' && item.disableMemo;
});
if (!hasDisabledMemos) {
return memoizedResults;
}
return memoizedResults.flatMap(function (item) {
return typeof item === 'function' && item.disableMemo ? item(intl) : item;
});
};
var options = {
threshold: 0.3,
keys: [{
name: 'title',
weight: 0.57
}, {
name: 'priority',
weight: 0.3
}, {
name: 'keywords',
weight: 0.08
}, {
name: 'description',
weight: 0.04
}, {
name: 'keyshortcut',
weight: 0.01
}]
};
/**
* This function is used to find and sort QuickInsertItems based on a given query string.
*
* @export
* @param {string} query - The query string to be used in the search.
* @param {QuickInsertItem[]} items - An array of QuickInsertItems to be searched.
* @returns {QuickInsertItem[]} - Returns a sorted array of QuickInsertItems based on the priority. If the query string is empty, it will return the array sorted by priority. If a query string is provided, it will return an array of QuickInsertItems that match the query string, sorted by relevance to the query.
*/
export function find(query, items) {
var fuse = new Fuse(items, options);
if (query === '') {
// Copy and sort list by priority
return items.slice(0).sort(function (a, b) {
return (a.priority || Number.POSITIVE_INFINITY) - (b.priority || Number.POSITIVE_INFINITY);
});
}
return fuse.search(query).map(function (result) {
return result.item;
});
}