@lingxiteam/ebe-utils 0.0.8 → 0.0.10

package/lib/pcpublic/src/components/pcfactory/src/Table/utils/index.ts

@@ -0,0 +1,442 @@
+import { Table } from 'antd';
+import { LevelItem } from '../types/prop';
+// 以下逻辑调整时需同步到packages/editor/src/Input/TableColorGroup/utils.ts
+export const treeRootName = 'tree-root';
+export type SingleRowInfo = {
+  [rowIndex: number]: {
+    rowIdAndTitleColMap: any;
+    nextRowsChildren: any;
+  };
+};
+export const handleMultiLevelHeader = (leftTree: any, column: any) => {
+  const { fixed = '' } = column;
+  let { group } = column;
+
+  // 兼容旧版的分组数据
+  if (typeof group === 'string') {
+    group = [group];
+  }
+
+  // 兼容可能存在的空数据
+  if (group === '' || group === null || group === undefined) {
+    group = [''];
+  }
+
+  // 过滤掉空的配置
+  group = group.filter((g: any) => g);
+  // 保留一个空配置，以进入构造
+  group = group.length === 0 ? [''] : group;
+
+  const groupLen = group.length;
+  if (Array.isArray(group) && groupLen > 0) {
+    // 标记右树从哪个节点开始至最后一个都为空(undefined/null/'')
+    let groupEmptyStartIndex = groupLen - 1;
+    while (
+      typeof group[groupEmptyStartIndex] === 'undefined' ||
+      group[groupEmptyStartIndex] === null ||
+      group[groupEmptyStartIndex] === ''
+    ) {
+      // 当分组数据遍历完成 或 下一个已经不为空时，退出循环
+      if (groupEmptyStartIndex - 1 < 0 || group[groupEmptyStartIndex - 1]) {
+        break;
+      }
+      groupEmptyStartIndex -= 1;
+    }
+
+    // 构造右树（记录左树每一层的最后一个节点）:
+    let rightLevel = 1;
+    const rightTree = {
+      title: treeRootName,
+    };
+    const rightTreeLevelMap: any = {
+      0: rightTree,
+    };
+    let tempRightTree: any = rightTree;
+    // 从第一层开始，最后一层会接入列信息
+    while (rightLevel <= groupLen) {
+      // 从当前层到最后一层都为空时：直接接入列信息，并退出循环
+      if (
+        rightLevel === groupEmptyStartIndex + 1 &&
+        !group[groupEmptyStartIndex]
+      ) {
+        // 将列数据放入最后一层分组最后一个节点的children，即再加最后一层
+        tempRightTree.children = [column];
+        // 记录最最后一层
+        rightTreeLevelMap[rightLevel] = column;
+        break;
+      }
+
+      const rightTreeCurrLevelLast: any = {
+        title: group[rightLevel - 1] || '', // 为空的话，强制设置为 ''
+        // 当前层为第一层时，将parent指向左树的根节点，为后续合并做准备
+        parent: tempRightTree.title === treeRootName ? leftTree : tempRightTree,
+        //
+        fixed,
+        align: 'center',
+      };
+      tempRightTree.children = [rightTreeCurrLevelLast];
+      tempRightTree = rightTreeCurrLevelLast;
+      rightTreeLevelMap[rightLevel] = rightTreeCurrLevelLast;
+      rightLevel += 1;
+
+      // 构造到最后一层分组时：接入列信息，并退出循环
+      if (rightLevel > groupLen) {
+        // 将列数据放入最后一层分组最后一个节点的children，即再加最后一层
+        rightTreeCurrLevelLast.children = [column];
+        // 记录最最后一层
+        rightTreeLevelMap[rightLevel] = column;
+        break;
+      }
+    }
+
+    // 分析左树（记录左树每一层的最后一个节点）：
+    let leftLevel = 0;
+    const leftTreeLevelMap = {
+      [leftLevel]: leftTree,
+    };
+    let leftTreeCurrLevelLast = leftTree;
+    // 遍历左树右边侧节点（生成数据结构记录节点情况）：
+    while (leftTreeCurrLevelLast?.children) {
+      leftLevel += 1;
+      const leftTreeCurrLevelLastChildren = leftTreeCurrLevelLast.children;
+      // 取左树当前层的最后一个
+      leftTreeCurrLevelLast =
+        leftTreeCurrLevelLastChildren[leftTreeCurrLevelLastChildren.length - 1];
+      leftTreeLevelMap[leftLevel] = leftTreeCurrLevelLast;
+    }
+
+    // 遍历右树（i 表示右树的层级）：
+    for (let i = 0; i <= groupLen + 1; i += 1) {
+      const leftTreeLast = leftTreeLevelMap[i]; // 左树第i层的最后一个
+      const current = rightTreeLevelMap[i]; // 右树第 i 层的最后一个（唯一一个）
+
+      // 当前层相同组名相同
+      if (
+        current?.title === leftTreeLast?.title &&
+        // 如果是第一层，还要额外比对列固定配置是否相同
+        i === 1
+          ? current?.fixed === leftTreeLast?.fixed
+          : true
+      ) {
+        // 需要进一步比较下一层组名是否相同
+        const currentNext = rightTreeLevelMap[i + 1];
+        const leftTreeNextLast = leftTreeLevelMap[i + 1]; // 左树第i层的最后一个
+
+        // 如果相同 且 右树下一层非最后一层(即，有 children)，则continue，直接进行下一层处理
+        if (
+          currentNext?.title === leftTreeNextLast?.title &&
+          currentNext?.children &&
+          Array.isArray(currentNext?.children)
+        ) {
+          // eslint-disable-next-line no-continue
+          continue;
+        } else {
+          // 如果不相同，则直接将右树的下一层接入左树的下一层
+          if (leftTreeLast?.children) {
+            leftTreeLast.children.push(...current.children);
+          } else {
+            leftTreeLast.children = [...current.children];
+          }
+          // 退出循环，等待合并下一列右树
+          break;
+        }
+      } else {
+        // 当前层组名不同，则直接将右树，并入左树
+        leftTreeLast.parent.children.push(current);
+        break;
+      }
+    }
+  }
+};
+
+export const handleExpandColumn = ({
+  expandComponents,
+  expandIconPositionRef,
+  expandIconPosition,
+  columns,
+}: any) => {
+  // 有设置扩展内容 且 存在行展开图标位置配置
+  if (
+    Array.isArray(expandComponents) &&
+    expandComponents.length &&
+    expandIconPositionRef
+  ) {
+    // 找到行展开图标位置 基准列的索引（有可能也是分组）
+    const refColIndex = columns?.findIndex((c: any) => {
+      if (c.dataIndex) {
+        return c.dataIndex === expandIconPositionRef?.dataIndex;
+      }
+
+      if (c.title) {
+        return c.title === expandIconPositionRef?.title;
+      }
+
+      return false;
+    });
+
+    // 说明存在基准列，则进一步定位左右侧
+    if (refColIndex !== -1) {
+      if (expandIconPosition === 'right') {
+        columns.splice(refColIndex + 1, 0, Table.EXPAND_COLUMN);
+      } else {
+        // 否则为左侧
+        columns.splice(refColIndex, 0, Table.EXPAND_COLUMN);
+      }
+    }
+  }
+};
+
+export const createAutoKey = (seqId: any) => {
+  return seqId.getId();
+};
+
+export const createTempRowKey = () => {
+  return `LX_TEMP_${parseInt(`${Math.random() * 10000}`, 10)}`;
+};
+
+export const EMPTY_ROW_TEMP_KEY_ATTR = '_lxTempKey';
+export const LATEST_EMPTY_ROW_FLAG_ATTR = '_latestCreation';
+
+export const deleteTempRowProperties = (row: any) => {
+  delete row?.[LATEST_EMPTY_ROW_FLAG_ATTR];
+};
+
+export const createEmptyRow = () => ({
+  [LATEST_EMPTY_ROW_FLAG_ATTR]: true, // 最新创建的
+  [EMPTY_ROW_TEMP_KEY_ATTR]: createTempRowKey(),
+});
+
+export const handleRecursiveParseColumns = (
+  columnList: any[],
+  rowIndex = 1,
+  styleInfo?: {
+    colorType: 'custom' | 'single';
+    singleColorSetting?: {
+      backgroundColor?: string;
+      color?: string;
+      fontWeight?: number;
+      fontSize?: string;
+    };
+    customColorSetting?: {
+      [id: string]: {
+        backgroundColor?: string;
+        color?: string;
+        fontWeight?: number;
+        fontSize?: string;
+      };
+    };
+  },
+) => {
+  const colChildList: any[] = [];
+  let colIdMap: { [id: string]: any } = {};
+  let cols = columnList;
+  if (Array.isArray(columnList) && columnList?.length) {
+    cols = columnList.map((col: any) => {
+      const newCol: any = {
+        id: col?.id,
+        title: col?.title,
+        fixed: col?.fixed,
+        style: col?.style,
+      };
+      if (col?.children) {
+        const {
+          cols: childColumns,
+          colChildList: childCols,
+          colIdMap: childColMap,
+        } = handleRecursiveParseColumns(col.children, rowIndex + 1, styleInfo);
+        newCol.children = childColumns;
+        colChildList.push(...childCols);
+        const dataColsStr = childCols.reduce(
+          (p, n) => (p ? `${p}&${n.id}` : `${n.id}`),
+          '',
+        );
+        const id = `group-${rowIndex}-${dataColsStr}`;
+        col.id = id;
+        newCol.id = id;
+        colIdMap = {
+          ...colIdMap,
+          ...childColMap,
+        };
+      } else {
+        // 当前层级无children的就是字段数据
+        colChildList.push(col);
+      }
+      if (styleInfo) {
+        const style =
+          styleInfo?.colorType === 'single'
+            ? styleInfo?.singleColorSetting
+            : styleInfo?.customColorSetting?.[newCol?.id];
+        col.style = style;
+        newCol.style = style;
+        // 给分组头部传递props
+        if (col?.children) {
+          col.onHeaderCell = () => ({
+            style: newCol?.style,
+          });
+        }
+      }
+      colIdMap[newCol.id] = newCol.style;
+      return newCol;
+    });
+  }
+  return {
+    cols,
+    // 当前分组下最底层表格列字段
+    colChildList,
+    colIdMap,
+  };
+};
+
+export const compareFn = (a: any, b: any) => {
+  if (typeof a === 'number' && typeof b === 'number') {
+    return a - b;
+  }
+  let prev = String(a || '');
+  let next = String(b || '');
+  // 匹配所有带单位的字符串数字
+  const numberRegexp = /^(-)?(\d+(\.\d+)?)([a-zA-Z]+)?$/;
+  const prevMatch = prev.match(numberRegexp) || [];
+  const nextMatch = next.match(numberRegexp) || [];
+  const [, prevNegative, , prevDecimal = '', prevUnit] = prevMatch;
+  const [, nextNegative, , nextDecimal = '', nextUnit] = nextMatch;
+  // 单位一致才比较，否则按字符串比
+  // 其中有一个为空值时，也进行比较
+  if (prevUnit === nextUnit || !a || !b) {
+    if (prevNegative !== nextNegative) {
+      // 一正一负,正的大
+      return prevNegative ? -1 : 1;
+    }
+    if (prevNegative === nextNegative) {
+      // 两数间最长的小数位长度
+      const expandedLen =
+        prevDecimal.length > nextDecimal?.length
+          ? prevDecimal.length - 1
+          : nextDecimal.length - 1;
+      const expand = (decimal: string, len: number) => {
+        // 小数部分内容
+        const num = decimal.indexOf('.') === 0 ? decimal.slice(1) : decimal;
+        // 长度不一的小数进行补位
+        const zero =
+          len - num.length > 0 ? new Array(len - num.length).fill('0') : [];
+        return `${num}${zero.join('')}`;
+      };
+      // 小数时两个数字同时扩大
+      const prevStr = prevDecimal
+        ? prev.replace(prevDecimal, expand(prevDecimal, expandedLen))
+        : prev;
+      const nextStr = nextDecimal
+        ? next.replace(nextDecimal, expand(nextDecimal, expandedLen))
+        : next;
+      if (prevNegative && nextNegative) {
+        // 负数，调换位置
+        prev = nextStr;
+        next = prevStr;
+      } else {
+        prev = prevStr;
+        next = nextStr;
+      }
+      if (prev?.length !== next?.length) {
+        // 长度不一致时，长的大
+        return prev?.length > next?.length ? 1 : -1;
+      }
+    }
+  }
+  return prev.localeCompare(next);
+};
+
+export function recursionDataSource<
+  T extends Record<string, any>,
+  U extends T = T,
+>(
+  dataSource: T[],
+  parseNodeFn?: (node: T, parentPath?: U[]) => U | void,
+  childrenKey: string = 'children',
+  parentPath: U[] = [],
+) {
+  if (!Array.isArray(dataSource)) return dataSource;
+  return dataSource.map((d) => {
+    let data: Record<string, any> = {
+      ...d,
+    };
+
+    if (parseNodeFn) {
+      const newData = parseNodeFn(data as T, parentPath);
+      if (newData) {
+        data = newData;
+      }
+    }
+    if (Array.isArray(data[childrenKey]) && data[childrenKey].length) {
+      data[childrenKey] = recursionDataSource(
+        data[childrenKey],
+        parseNodeFn,
+        childrenKey,
+        [...parentPath, data as U],
+      );
+    }
+
+    return data;
+  });
+}
+
+// 根据选中节点由下往上计算包含父节点在内的选中key
+export const getFullCheckedKeySet = <T extends {}>(params: {
+  levelEntries: Map<number, LevelItem<T>[]>;
+  maxLevel: number;
+  currentCheckedKey: (string | number)[];
+  disabledMap: Record<string | number, boolean>;
+  checked?: boolean;
+}) => {
+  const { maxLevel, levelEntries, currentCheckedKey, checked, disabledMap } =
+    params;
+  // key格式做弱等类型判断
+  const checkedLooseMap = currentCheckedKey.reduce((p, n) => {
+    p[n] = n;
+    return p;
+  }, {} as Record<string | number, string | number>);
+  const visitedKey = new Set();
+  // 从下往上收集选中的父节点
+  for (let level = maxLevel; level >= 0; level -= 1) {
+    const levelList = levelEntries.get(level);
+    levelList?.forEach((node) => {
+      let allChecked = true;
+      const parent = node.__parent__;
+      if (
+        parent &&
+        (disabledMap[parent?.__key__] || visitedKey.has(parent.__key__))
+      )
+        return;
+      if (disabledMap[node?.__key__]) return;
+      const siblings = parent?.__children__?.filter(
+        (c) => !disabledMap[c.__key__],
+      );
+      siblings?.forEach((child) => {
+        // 子节点都选中，父节点也要选中
+        if (allChecked && !checkedLooseMap[child.__key__]) {
+          allChecked = false;
+        }
+      });
+      // 反选子节点时去除之前勾选的父节点
+      if (
+        !checked &&
+        parent &&
+        !allChecked &&
+        checkedLooseMap[parent.__key__]
+      ) {
+        delete checkedLooseMap[parent.__key__];
+        visitedKey.add(parent?.__key__);
+      }
+
+      // 选中子节点时若父节点子级都选中，则补上父节点
+      if (checked && parent && allChecked && !checkedLooseMap[parent.__key__]) {
+        checkedLooseMap[parent.__key__] = parent.__key__;
+        visitedKey.add(parent?.__key__);
+      }
+    });
+  }
+  return new Set(
+    Object.keys(checkedLooseMap).reduce((p, n) => {
+      p.push(checkedLooseMap[n]);
+      return p;
+    }, [] as (string | number)[]),
+  );
+};

package/lib/pcpublic/src/components/pcfactory/src/Tabs/index.tsx

@@ -0,0 +1,209 @@
+import { LingxiForwardRef } from '@lingxiteam/types';
+import { Tabs } from 'antd';
+import type { TabsProps } from 'antd/es/tabs';
+import classnames from 'classnames';
+import React, { useEffect, useImperativeHandle, useRef, useState } from 'react';
+import { basicStatusTransfer } from '../utils';
+import ChannelContainer, {
+  ChannelContainerOptions,
+} from '../utils/ChannelContainer';
+
+/**
+ * 修改原因：
+ * 由于原逻辑是通过在Tabs组件外渲染完成后，把组件再移动到Tabs内部。导致页面加载完成后 无法获取TabPanel内的表单值。
+ */
+export interface MyTabsProps extends TabsProps {
+  value: string;
+  visible: boolean;
+  getEngineApis: any;
+}
+
+const { TabPane } = Tabs;
+
+const MyTabs = LingxiForwardRef<any, MyTabsProps>((props, ref) => {
+  const {
+    value,
+    visible = true,
+    children,
+    onChange,
+    defaultActiveKey,
+    style,
+    getEngineApis,
+    className,
+    ...restProps
+  } = props;
+
+  const childKeys = useRef<string[]>([]);
+
+  const { padding, ...restStyle } = style || {};
+
+  const [activeKey, setActiveKey] = useState(() => props.defaultActiveKey);
+  const memoActiveKeys = useRef<string[]>([]).current;
+  const hiddenTabsKeyMap = useRef<
+    Record<string, { visible: string; index: number; key: string }>
+  >({}).current; // 隐藏的tabs
+  // 缓存下来key 标识当前TabPanel已经渲染
+  if (activeKey && !memoActiveKeys.includes(activeKey)) {
+    memoActiveKeys.push(activeKey);
+  }
+
+  const [tabs, setTabs] = useState<any[]>([]);
+
+  useImperativeHandle(ref, () => ({
+    setValue: (key: any) => {
+      setActiveKey(key);
+    },
+    get value() {
+      return activeKey;
+    },
+    setSubTabsData: console.log,
+    setTabsData: (tabsDataOptions: any = {}) => {
+      const { data, key, title, status, badge } = tabsDataOptions;
+
+      const resolvedData = data.map((tab: any) => {
+        const tabKey = tab[key || 'key'];
+        const tabTitle = tab[title || 'title'];
+        const tabStatus = tab[status];
+        const tabBadge = tab[badge || 'badge'];
+
+        const matchTab: any = tabs?.find((t: any) => t.id === tabKey) || {};
+        const newTab = { ...matchTab };
+
+        if (typeof tabKey !== 'undefined') {
+          newTab.key = tabKey;
+        }
+
+        if (typeof tabTitle !== 'undefined') {
+          newTab.title = tabTitle;
+        }
+
+        if (typeof status !== 'undefined') {
+          newTab.isShow = basicStatusTransfer(tabStatus)?.visible;
+        }
+
+        if (typeof tabBadge !== 'undefined') {
+          newTab.badge = tabBadge;
+        }
+
+        return newTab;
+      });
+
+      setTabs(resolvedData);
+    },
+  }));
+
+  useEffect(() => {
+    // 如果页面渲染完成的时候activeKey不存在，那么默认设置第一个
+    if (
+      (activeKey &&
+        !memoActiveKeys.includes(activeKey) &&
+        !hiddenTabsKeyMap[activeKey]) ||
+      !activeKey
+    ) {
+      const fistKey = Object.values(hiddenTabsKeyMap).filter(
+        (i) => i.index === 0,
+      );
+      setActiveKey(fistKey?.[0].key);
+    }
+  }, []);
+
+  const renderTabPane = (options: ChannelContainerOptions) => {
+    childKeys.current = [];
+    return React.Children.toArray(children).map((t, index) => {
+      const { getProps, uploadChannelProps } = options;
+      const c = t;
+      if (React.isValidElement(c)) {
+        const {
+          schema: {
+            props: { key },
+          },
+          // @ts-ignore
+        } = t.props;
+        // if (isShow) {
+        if (!childKeys.current?.includes(key)) {
+          childKeys.current.push(key);
+        }
+
+        // 将控件‘内边距’配置设置到子面板上(还原原逻辑)
+        if (typeof padding !== 'undefined') {
+          Object.assign(c.props.schema.style, { padding });
+        }
+
+        const {
+          visible = true,
+          forceRender = false,
+          ...extendProps
+        } = getProps(c);
+
+        hiddenTabsKeyMap[key] = {
+          visible,
+          index,
+          key,
+        };
+
+        return (
+          <TabPane
+            forceRender
+            {...(c?.props.schema?.props || {})}
+            key={key}
+            {...extendProps}
+          >
+            <ChannelContainer.Item
+              extendProps={{
+                // TabPane是否应该渲染子节点
+                visited: memoActiveKeys.includes(key) || forceRender,
+                currentIndex: index,
+              }}
+              uploadChannelProps={uploadChannelProps}
+            >
+              {c}
+            </ChannelContainer.Item>
+          </TabPane>
+        );
+      }
+
+      return null;
+    });
+  };
+
+  if (!visible) {
+    return null;
+  }
+
+  return (
+    <div className={classnames('ued-tabs-wrap', className)}>
+      <ChannelContainer>
+        {(options) => (
+          <Tabs
+            activeKey={activeKey}
+            defaultActiveKey={defaultActiveKey}
+            {...restProps}
+            style={restStyle}
+            onChange={(activeKey) => {
+              if (onChange) {
+                onChange(activeKey);
+              }
+              setActiveKey(activeKey);
+            }}
+            renderTabBar={(props, DefaultTabBar) => {
+              return (
+                <DefaultTabBar {...props}>
+                  {(node) => {
+                    if (node.key && !hiddenTabsKeyMap[node.key]?.visible) {
+                      return <React.Fragment key={node.key} />;
+                    }
+                    return node;
+                  }}
+                </DefaultTabBar>
+              );
+            }}
+          >
+            {renderTabPane(options)}
+          </Tabs>
+        )}
+      </ChannelContainer>
+    </div>
+  );
+});
+
+export default MyTabs;

package/lib/pcpublic/src/components/pcfactory/src/Tag/index.tsx

@@ -0,0 +1,39 @@
+import { LingxiForwardRef } from '@lingxiteam/types';
+import { Tag } from 'antd';
+import type { TagProps } from 'antd/lib/tag';
+import classnames from 'classnames';
+import React from 'react';
+
+const WrapperTag = ({ children }: Record<string, any>) =>
+  React.cloneElement(children, {
+    className: `ued-tag-wrap ${children.props.className || ''}`,
+  });
+export interface MyTagProps extends TagProps {
+  name?: string;
+  tagType?: any;
+  visible?: boolean;
+}
+
+const MyTag = LingxiForwardRef<any, MyTagProps>((props, ref) => {
+  const { name, visible = true, title, ...restProps } = props;
+
+  return visible ? (
+    <WrapperTag>
+      <div>
+        <Tag
+          {...restProps}
+          color={restProps?.tagType?.color || restProps.color}
+          className={classnames(
+            restProps.className,
+            restProps?.tagType?.classname,
+          )}
+        >
+          {title}
+        </Tag>
+      </div>
+    </WrapperTag>
+  ) : null;
+});
+
+export default MyTag;
+export { WrapperTag };