UNPKG

@sanity/default-layout

Version:

The default layout components for Sanity

44 lines (42 loc) 3.09 kB
"use strict"; Object.defineProperty(exports, "__esModule", { value: true }); exports.useMeasureSearchResultsIndex = useMeasureSearchResultsIndex; var _react = require("react"); var _constants = require("../constants"); function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); } function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); } function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; } function _iterableToArrayLimit(arr, i) { var _i = null == arr ? null : "undefined" != typeof Symbol && arr[Symbol.iterator] || arr["@@iterator"]; if (null != _i) { var _s, _e, _x, _r, _arr = [], _n = !0, _d = !1; try { if (_x = (_i = _i.call(arr)).next, 0 === i) { if (Object(_i) !== _i) return; _n = !1; } else for (; !(_n = (_s = _x.call(_i)).done) && (_arr.push(_s.value), _arr.length !== i); _n = !0); } catch (err) { _d = !0, _e = err; } finally { try { if (!_n && null != _i.return && (_r = _i.return(), Object(_r) !== _r)) return; } finally { if (_d) throw _e; } } return _arr; } } function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; } function useMeasureSearchResultsIndex(childContainerElement) { var _useState = (0, _react.useState)(0), _useState2 = _slicedToArray(_useState, 2), lastSearchIndex = _useState2[0], setSavedSearchIndex = _useState2[1]; var resetLastSearchIndex = (0, _react.useCallback)(() => { setSavedSearchIndex(0); }, []); /** * Query search result children for the 'top most' visible element (factoring in overscan) * and obtain its index. */ var setLastSearchIndex = (0, _react.useCallback)(() => { var childContainerParentElement = childContainerElement === null || childContainerElement === void 0 ? void 0 : childContainerElement.parentElement; if (childContainerParentElement && childContainerElement) { var childContainerParentElementTop = childContainerParentElement.getBoundingClientRect().top; var childContainerElementTop = childContainerElement.getBoundingClientRect().top; var index = Math.floor((childContainerParentElementTop - childContainerElementTop) / _constants.VIRTUAL_LIST_ITEM_HEIGHT); setSavedSearchIndex(index); } else { setSavedSearchIndex(0); } }, [childContainerElement]); return { lastSearchIndex, resetLastSearchIndex, setLastSearchIndex }; }