choerodon-ui/lib/animate/ChildrenUtils.js

An enterprise-class UI design language and React-based implementation

"use strict";

Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.findChildInChildrenByKey = findChildInChildrenByKey;
exports.findShownChildInChildrenByKey = findShownChildInChildrenByKey;
exports.isSameChildren = isSameChildren;
exports.mergeChildren = mergeChildren;
exports.toArrayChildren = toArrayChildren;

var _react = require("react");

function toArrayChildren(children) {
  var ret = [];

  _react.Children.forEach(children, function (child) {
    if ( /*#__PURE__*/(0, _react.isValidElement)(child)) {
      ret.push(child);
    }
  });

  return ret;
}

function findChildInChildrenByKey(children, key) {
  if (children) {
    return children.find(function (child) {
      return child && child.key === key;
    });
  }
}

function findShownChildInChildrenByKey(children, key, hiddenProp) {
  var ret;

  if (children) {
    children.forEach(function (child) {
      if (child && child.key === key && !child.props[hiddenProp]) {
        if (ret) {
          throw new Error('two child with same key for animate children');
        }

        ret = child;
      }
    });
  }

  return ret;
} // export function findHiddenChildInChildrenByKey(children, key, showProp):boolean {
//   let found = false;
//   if (children) {
//     children.forEach(function (child) {
//       if (found) {
//         return;
//       }
//       found = child && child.key === key && !child.props[showProp];
//     });
//   }
//   return found;
// }


function isSameChildren(c1, c2, hiddenProp) {
  var same = c1.length === c2.length;

  if (same) {
    c1.forEach(function (child, index) {
      var child2 = c2[index];

      if (child && child2) {
        if (child && !child2 || !child && child2) {
          same = false;
        } else if (child.key !== child2.key) {
          same = false;
        } else if (hiddenProp && child.props[hiddenProp] !== child2.props[hiddenProp]) {
          same = false;
        }
      }
    });
  }

  return same;
}

function mergeChildren(prev, next) {
  var ret = [];
  var nextChildrenPending = {};
  var pendingChildren = [];
  prev.forEach(function (child) {
    if (child && child.key && findChildInChildrenByKey(next, child.key)) {
      if (pendingChildren.length) {
        nextChildrenPending[child.key] = pendingChildren;
        pendingChildren = [];
      }
    } else {
      pendingChildren.push(child);
    }
  });
  next.forEach(function (child) {
    if (child && child.key && {}.hasOwnProperty.call(nextChildrenPending, child.key)) {
      ret = ret.concat(nextChildrenPending[child.key]);
    }

    ret.push(child);
  });
  return ret.concat(pendingChildren);
}
//# sourceMappingURL=ChildrenUtils.js.map