ns-base-module 1.1.61 → 1.1.63

package/LICENSE

@@ -1,21 +1,21 @@
-MIT License
-
-Copyright (c) 735249091@qq.com
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
+MIT License
+
+Copyright (c) 735249091@qq.com
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -1,20 +1,20 @@
-<!--
- * @Date: 2023-03-07 18:49:37
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
--->
-
-# ns-base-module
-
-项目基础依赖包
-
-```
-npm unlink
-npm run build:watch
-yarn link // npm link 经常丢链接
-
-在需要引入的项目中ns-rams-ui运行：
-yarn link ns-base-module
-```
+<!--
+ * @Date: 2023-03-07 18:49:37
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+-->
+
+# ns-base-module
+
+项目基础依赖包
+
+```
+npm unlink
+npm run build:watch
+yarn link // npm link 经常丢链接
+
+在需要引入的项目中ns-rams-ui运行：
+yarn link ns-base-module
+```

package/dist/Button/AntdIconButton.js

@@ -2,8 +2,8 @@ var _excluded = ["icon"];
 function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
 function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
 function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
-/**
- * icon 为antd4版本的icon
+/**
+ * icon 为antd4版本的icon
  */
 import React from 'react';
 import { Button } from 'antd';

package/dist/Button/ConfigButton.js

@@ -5,19 +5,19 @@ function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t =
 function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
 function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
 function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
-/*
- * @Date: 2023-04-07 10:27:41
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @Date: 2023-04-07 10:27:41
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
-/**
- * 根据配置渲染的按钮
- * @param button 按钮配置
- * @param loading 加载状态
- * @param selectedRowKeys 勾选key组（列表的勾选key组）
- * @param onClick 按钮点击事件
+/**
+ * 根据配置渲染的按钮
+ * @param button 按钮配置
+ * @param loading 加载状态
+ * @param selectedRowKeys 勾选key组（列表的勾选key组）
+ * @param onClick 按钮点击事件
  */
 import React from 'react';
 import Button from "./AntdIconButton";

package/dist/ChooseModal/index.js

@@ -5,12 +5,12 @@ function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o =
 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(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
 function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
-/*
- * @Date: 2023-05-08 13:49:30
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @Date: 2023-05-08 13:49:30
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 import { Button, Drawer, Modal, Space } from "antd";
 import React, { forwardRef, useImperativeHandle, useState } from "react";

package/dist/Entry/components/ChooseModalTable.js

@@ -7,12 +7,12 @@ function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol"
 function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
 function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
 function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
-/*
- * @Date: 2023-05-08 13:49:29
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @Date: 2023-05-08 13:49:29
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 import React, { useRef } from 'react';
 import { ETable2 } from "../../components/v2/Table";

package/dist/Entry/components/ImageText.js

@@ -5,11 +5,11 @@ function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len
 function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
 function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
 function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
-/*
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 import { Form, Tooltip } from "antd";
 import React, { useEffect, useState } from "react";

package/dist/Entry/components/InputNumber.js

@@ -8,17 +8,17 @@ function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
 function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
 function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
 function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
-/*
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
-/*
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 import React, { useState, useEffect } from 'react';
 import { InputNumber } from 'antd';

package/dist/Entry/components/ListSelect.js

@@ -8,12 +8,12 @@ function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol"
 function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
 function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
 function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
-/*
- * @Date: 2023-05-08 13:49:29
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @Date: 2023-05-08 13:49:29
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 import React, { useRef } from 'react';
 import Input from "./Input";

package/dist/Entry/components/ObjectSelect.js

@@ -10,11 +10,11 @@ function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol"
 function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
 function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
 function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
-/*
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 import React, { useEffect, useRef } from 'react';
 import Select from "./Select";

package/dist/Entry/components/Select.js

@@ -9,11 +9,11 @@ function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o =
 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(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
 function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
-/*
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 import React, { useCallback, useEffect, useState } from 'react';
 import { Select } from 'antd';

package/dist/Entry/components/TagsDatePicker.js

@@ -13,12 +13,12 @@ function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" !=
 function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
 function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
 function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
-/*
- * @Date: 2023-06-12 18:56:06
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @Date: 2023-06-12 18:56:06
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 import React, { useCallback, useEffect, useState, useRef } from 'react';
 import { DatePicker, Space, Select, Row, Col, Radio } from 'antd';

package/dist/Entry/components/TreeSelect.js

@@ -5,11 +5,11 @@ function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t =
 function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
 function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
 function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
-/*
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */
 
 import { TreeSelect } from "antd";

package/dist/Entry/components/index.scss

@@ -1,97 +1,97 @@
-.image-text {
-  display: flex;
-  flex-wrap: wrap;
-  // flex-direction: row-reverse;
-  flex-wrap: wrap-reverse;
-  justify-content: flex-start;
-  .ant-form-item {
-    margin-bottom: 10px;
-  }
-  .ant-col {
-    // &:hover {
-    //   background-color: #eee;
-    //   cursor: pointer;
-    // }
-    // &:first-child {
-    //   .card-list-item {
-    //     border-top: 1px solid #cacaca99;
-    //   }
-    // }
-  }
-
-  .card-list-item {
-    display: flex;
-    width: 230px;
-    // border-bottom: 1px solid #cacaca99;
-    margin-bottom: 15px;
-    margin-left: 24px;
-
-    .item-img {
-      width: 100px;
-      min-width: 100px;
-      height: 100px;
-      margin: auto;
-      margin-right: 10px;
-      overflow: hidden;
-      // background: #eee;
-      background-color: #fff;
-      background-repeat: no-repeat;
-      background-position: center;
-      background-size: contain;
-      img {
-        display: block;
-        max-width: 100%;
-        max-height: 100%;
-        margin: auto;
-      }
-    }
-    .stepsItem {
-      margin-top: 20px;
-      margin-bottom: 35px;
-      padding-left: 34px;
-    }
-    .item-desc {
-      flex: 1;
-      margin: auto;
-      text-align: left;
-
-      .item-body {
-        display: inline-block;
-        align-items: center;
-        vertical-align: middle;
-      }
-      .ant-form-item-label > label {
-        height: 20px;
-      }
-      .ant-form-item-control-input {
-        min-height: 20px;
-      }
-      p {
-        width: 100%;
-        margin-bottom: 8px;
-        overflow: hidden;
-        text-overflow: ellipsis;
-        overflow-wrap: break-word;
-      }
-    }
-
-    &.horizontal {
-      display: flex;
-      // margin-top: 10px;
-      // margin-bottom: 10px;
-      // flex: 1;
-      .item-desc {
-        flex: 1;
-        padding: 24px 10px 10px 10px;
-        overflow: hidden;
-        text-align: left;
-      }
-    }
-    &.vertical {
-      margin-left: 0;
-      .item-img {
-        margin-right: auto;
-      }
-    }
-  }
-}
+.image-text {
+  display: flex;
+  flex-wrap: wrap;
+  // flex-direction: row-reverse;
+  flex-wrap: wrap-reverse;
+  justify-content: flex-start;
+  .ant-form-item {
+    margin-bottom: 10px;
+  }
+  .ant-col {
+    // &:hover {
+    //   background-color: #eee;
+    //   cursor: pointer;
+    // }
+    // &:first-child {
+    //   .card-list-item {
+    //     border-top: 1px solid #cacaca99;
+    //   }
+    // }
+  }
+
+  .card-list-item {
+    display: flex;
+    width: 230px;
+    // border-bottom: 1px solid #cacaca99;
+    margin-bottom: 15px;
+    margin-left: 24px;
+
+    .item-img {
+      width: 100px;
+      min-width: 100px;
+      height: 100px;
+      margin: auto;
+      margin-right: 10px;
+      overflow: hidden;
+      // background: #eee;
+      background-color: #fff;
+      background-repeat: no-repeat;
+      background-position: center;
+      background-size: contain;
+      img {
+        display: block;
+        max-width: 100%;
+        max-height: 100%;
+        margin: auto;
+      }
+    }
+    .stepsItem {
+      margin-top: 20px;
+      margin-bottom: 35px;
+      padding-left: 34px;
+    }
+    .item-desc {
+      flex: 1;
+      margin: auto;
+      text-align: left;
+
+      .item-body {
+        display: inline-block;
+        align-items: center;
+        vertical-align: middle;
+      }
+      .ant-form-item-label > label {
+        height: 20px;
+      }
+      .ant-form-item-control-input {
+        min-height: 20px;
+      }
+      p {
+        width: 100%;
+        margin-bottom: 8px;
+        overflow: hidden;
+        text-overflow: ellipsis;
+        overflow-wrap: break-word;
+      }
+    }
+
+    &.horizontal {
+      display: flex;
+      // margin-top: 10px;
+      // margin-bottom: 10px;
+      // flex: 1;
+      .item-desc {
+        flex: 1;
+        padding: 24px 10px 10px 10px;
+        overflow: hidden;
+        text-align: left;
+      }
+    }
+    &.vertical {
+      margin-left: 0;
+      .item-img {
+        margin-right: auto;
+      }
+    }
+  }
+}

package/dist/Entry/components/utils.js

@@ -1,6 +1,6 @@
-/*
- * @description:
- * @author chenchangfu
- * Copyright (c) 2019, AUTHOR. All rights reserved.
- * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
+/*
+ * @description:
+ * @author chenchangfu
+ * Copyright (c) 2019, AUTHOR. All rights reserved.
+ * AUTHOR PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
  */