raintee-maputils 1.0.22 → 1.0.24

package/dist/index.js

@@ -5754,74 +5754,74 @@ var RainteeGISUtil = /*#__PURE__*/Object.freeze({
 });
 
 const treeDataAdapter = (data) => {
-    let i = 0;
-    let treeData = [];
-    let checkedKeys = [];
-    data.forEach((item) => {
-        let kvs = item.id.split(';').map(kvstr => kvstr.split('='));
-        let groups = kvs.find(item => item[0] === 'Main')[1].split('/');
-        let layerName = kvs.find(item => item[0] === 'CN')[1];
-        let currentNode = treeData;
-        groups.forEach((group, index) => {
-            currentNode.find(item => item.label === group) || i++;
-            currentNode.find(item => item.label === group) || currentNode.push({
-                id: i,
-                label: group,
-                children: []
-            });
-            currentNode = currentNode.find(item => item.label === group).children;
-        });
-        i++;
-        currentNode.push({
-            id: i,
-            label: layerName,
-            fullLayerName: groups.length === 0 ? layerName : groups.join('-') + '-' + layerName,
-            layerId: item.id,
-            opacity: '1.0',
-        });
-        if (item.layout && item.layout.visibility == 'visible') {
-            checkedKeys.push(i);
-        }
+  let i = 0;
+  let treeData = [];
+  let checkedKeys = [];
+  data.forEach((item) => {
+    let kvs = item.id.split(';').map(kvstr => kvstr.split('='));
+    let groups = kvs.find(item => item[0] === 'Main')[1].split('/');
+    let layerName = kvs.find(item => item[0] === 'CN')[1];
+    let currentNode = treeData;
+    groups.forEach((group, index) => {
+      currentNode.find(item => item.label === group) || i++;
+      currentNode.find(item => item.label === group) || currentNode.push({
+        id: i,
+        label: group,
+        children: []
+      });
+      currentNode = currentNode.find(item => item.label === group).children;
     });
-    return { treeData, checkedKeys }
+    i++;
+    currentNode.push({
+      id: i,
+      label: layerName,
+      fullLayerName: groups.length === 0 ? layerName : groups.join('-') + '-' + layerName,
+      layerId: item.id,
+      opacity: '1.0',
+    });
+    if (item.layout && item.layout.visibility == 'visible') {
+      checkedKeys.push(i);
+    }
+  });
+  return { treeData, checkedKeys }
 };
 const treeDataAdapterNext = (data) => {
-    let i = 0;
-    let treeData = [];
-    let checkedKeys = [];
-    data.forEach((item) => {
-        let kvs = item.id.split(';').map(kvstr => kvstr.split('='));
-        let groups = kvs.find(item => item[0] === 'Main')[1].split('/');
-        let layerName = kvs.find(item => item[0] === 'CN')[1];
-        let currentNode = treeData;
-        groups.length === 0 ? layerName : groups.join('-') + '-' + layerName;
-        groups.forEach((group, index) => {
-            currentNode.find(item => item.label === group) || i++;
-            currentNode.find(item => item.label === group) || currentNode.push({
-                id: `TreeId=${i};`,
-                label: group,
-                children: []
-            });
-            currentNode = currentNode.find(item => item.label === group).children;
-        });
-        i++;
-        currentNode.push({
-            id: item.id,
-            label: layerName,
-            fullLayerName: getLayerIdFidld(item.id, 'Main') + '-' + getLayerIdFidld(item.id, 'CN'),
-            layerId: item.id,
-            opacity: '1.0',
-        });
-        if (item.layout && item.layout.visibility == 'visible') {
-            checkedKeys.push(i);
-        }
+  let i = 0;
+  let treeData = [];
+  let checkedKeys = [];
+  data.forEach((item) => {
+    let kvs = item.id.split(';').map(kvstr => kvstr.split('='));
+    let groups = kvs.find(item => item[0] === 'Main')[1].split('/');
+    let layerName = kvs.find(item => item[0] === 'CN')[1];
+    let currentNode = treeData;
+    groups.length === 0 ? layerName : groups.join('-') + '-' + layerName;
+    groups.forEach((group, index) => {
+      currentNode.find(item => item.label === group) || i++;
+      currentNode.find(item => item.label === group) || currentNode.push({
+        id: `TreeId=${i};`,
+        label: group,
+        children: []
+      });
+      currentNode = currentNode.find(item => item.label === group).children;
     });
-    return { treeData, checkedKeys }
+    i++;
+    currentNode.push({
+      id: item.id,
+      label: layerName,
+      fullLayerName: getLayerIdFidld(item.id, 'Main') + '-' + getLayerIdFidld(item.id, 'CN'),
+      layerId: item.id,
+      opacity: '1.0',
+    });
+    if (item.layout && item.layout.visibility == 'visible') {
+      checkedKeys.push(i);
+    }
+  });
+  return { treeData, checkedKeys }
 };
 const getLayerIdFidld = (str, field) => {
-    let kvs = str.split(';').map(kvstr => kvstr.split('='));
-    let layerId = kvs.find(item => item[0] === field)[1];
-    return layerId
+  const kvs = str.split(';').map(kvstr => kvstr.split('='));
+  const val = kvs.find(item => item[0] === field)[1];
+  return val
 };
 /**
  * 生成唯一ID字符串
@@ -5832,30 +5832,30 @@ const getLayerIdFidld = (str, field) => {
  * @returns {string} 唯一ID字符串
  */
 const GenerateUniqueId = (
-    projectId,
-    objectTypeId,
-    groupId,
-    objectId
+  projectId,
+  objectTypeId,
+  groupId,
+  objectId
 ) => {
-    // 将参数组合成一个字符串
-    const combinedString = `${projectId}|${objectTypeId}|${groupId}|${objectId}`;
-
-    // 使用简单的哈希函数生成固定长度的字符串
-    let hash = 0;
-    for (let i = 0; i < combinedString.length; i++) {
-        const char = combinedString.charCodeAt(i);
-        hash = (hash << 5) - hash + char;
-        hash = hash & hash; // Convert to 32bit integer
-    }
+  // 将参数组合成一个字符串
+  const combinedString = `${projectId}|${objectTypeId}|${groupId}|${objectId}`;
+
+  // 使用简单的哈希函数生成固定长度的字符串
+  let hash = 0;
+  for (let i = 0; i < combinedString.length; i++) {
+    const char = combinedString.charCodeAt(i);
+    hash = (hash << 5) - hash + char;
+    hash = hash & hash; // Convert to 32bit integer
+  }
 
-    // 转换为16进制字符串并补零到8位
-    const hexHash = (hash >>> 0).toString(16).padStart(8, "0");
+  // 转换为16进制字符串并补零到8位
+  const hexHash = (hash >>> 0).toString(16).padStart(8, "0");
 
-    // 添加前缀和分隔符增强可读性
-    return `UID-${projectId.slice(0, 2)}-${objectTypeId.slice(
-        0,
-        2
-    )}-${groupId.slice(0, 2)}-${hexHash}`;
+  // 添加前缀和分隔符增强可读性
+  return `UID-${projectId.slice(0, 2)}-${objectTypeId.slice(
+    0,
+    2
+  )}-${groupId.slice(0, 2)}-${hexHash}`;
 };
 /**
  * 生成一个带斑马纹、固定宽高、支持滚动条的键值对表格 HTML 字符串
@@ -5866,10 +5866,10 @@ const GenerateUniqueId = (
  * @returns {string} - 返回一个完整的 HTML 字符串，可直接插入到 innerHTML 中
  */
 function generateKeyValueTableHTML(data, options = {}) {
-    const { width = 600, height = 400 } = options;
+  const { width = 600, height = 400 } = options;
 
-    // 开始拼接 HTML 字符串
-    let html = `
+  // 开始拼接 HTML 字符串
+  let html = `
       <div style="
         width: ${width}px;
         height: ${height}px;
@@ -5884,15 +5884,28 @@ function generateKeyValueTableHTML(data, options = {}) {
           font-size: 14px;
         ">
           <tbody>
+                  <tr style="background-color: '#f9f9f9';">
+          <td style="
+            padding: 8px 12px;
+            border: 1px solid #f9f9f9;
+            font-weight: bold;
+            min-width: 100px;
+          ">属性</td>
+          <td style="
+            padding: 8px 12px;
+            border: 1px solid #f9f9f9;
+            word-break: break-word;
+          ">值</td>
+        </tr>
     `;
 
-    // 遍历键值对，生成行
-    data.forEach((item, index) => {
-        const bgColor = index % 2 === 0 ? '#ffffff' : '#f9f9f9'; // 斑马纹背景色
-        const label = item.label || '';
-        const value = item.value || '';
+  // 遍历键值对，生成行
+  data.forEach((item, index) => {
+    const bgColor = index % 2 === 0 ? '#ffffff' : '#f9f9f9'; // 斑马纹背景色
+    const label = item.label || '';
+    const value = item.value || '';
 
-        html += `
+    html += `
         <tr style="background-color: ${bgColor};">
           <td style="
             padding: 8px 12px;
@@ -5907,24 +5920,133 @@ function generateKeyValueTableHTML(data, options = {}) {
           ">${value}</td>
         </tr>
       `;
-    });
+  });
 
-    // 闭合标签
-    html += `
+  // 闭合标签
+  html += `
           </tbody>
         </table>
       </div>
     `;
 
-    // 返回拼接好的 HTML 字符串
-    return html;
+  // 返回拼接好的 HTML 字符串
+  return html;
+}
+
+function downloadByUrl(url, filename = '') {
+  const a = document.createElement('a');
+  a.href = url;
+  a.download = filename || ''; // 为空则使用服务器返回的默认文件名
+  document.body.appendChild(a);
+  a.click();
+  document.body.removeChild(a);
+}
+/**
+ * 合并字符串键值对和对象，重复键的值覆盖，新键添加到末尾
+ * @param {string} str - 用';'分隔的key=value格式字符串
+ * @param {Object} obj - 要合并的对象
+ * @returns {string} - 合并后的key=value;key=value格式字符串
+ */
+function mergeStringAndObject(str, obj) {
+  // 1. 解析字符串为键值对数组
+  const parseStringToPairs = (inputStr) => {
+    if (!inputStr || typeof inputStr !== 'string') {
+      return [];
+    }
+
+    const pairs = [];
+    const segments = inputStr.split(';');
+
+    for (const segment of segments) {
+      const trimmedSegment = segment.trim();
+      if (!trimmedSegment) continue; // 跳过空字符串
+
+      const equalIndex = trimmedSegment.indexOf('=');
+      if (equalIndex === -1) {
+        // 如果没有等号，当作键，值为空字符串
+        pairs.push([trimmedSegment, '']);
+      } else {
+        const key = trimmedSegment.substring(0, equalIndex).trim();
+        const value = trimmedSegment.substring(equalIndex + 1).trim();
+        pairs.push([key, value]);
+      }
+    }
+
+    return pairs;
+  };
+
+  // 2. 解析对象为键值对数组
+  const parseObjectToPairs = (inputObj) => {
+    if (!inputObj || typeof inputObj !== 'object' || Array.isArray(inputObj)) {
+      return [];
+    }
+
+    const pairs = [];
+    for (const [key, value] of Object.entries(inputObj)) {
+      // 处理值的类型转换
+      let stringValue = '';
+      if (value === null || value === undefined) {
+        stringValue = '';
+      } else if (typeof value === 'string') {
+        stringValue = value;
+      } else if (typeof value === 'number' || typeof value === 'boolean') {
+        stringValue = value.toString();
+      } else {
+        // 对象、数组等复杂类型转为JSON字符串
+        stringValue = JSON.stringify(value);
+      }
+      pairs.push([key, stringValue]);
+    }
+
+    return pairs;
+  };
+
+  // 3. 合并键值对数组（重复键覆盖，新键追加）
+  const mergePairs = (strPairs, objPairs) => {
+    const mergedMap = new Map(); // 用于存储合并后的键值对，便于覆盖
+
+    // 先添加字符串中的键值对
+    for (const [key, value] of strPairs) {
+      mergedMap.set(key, value);
+    }
+
+    // 再添加对象中的键值对（重复键会覆盖）
+    for (const [key, value] of objPairs) {
+      mergedMap.set(key, value); // Map.set() 会自动覆盖重复键
+    }
+
+    // 转换为数组（Map 会保持插入顺序，新键自然在末尾）
+    return Array.from(mergedMap.entries());
+  };
+
+  // 4. 将键值对数组合并为字符串
+  const pairsToString = (pairs) => {
+    return pairs
+      .map(([key, value]) => `${key}=${value}`)
+      .join(';');
+  };
+
+  // 主流程
+  try {
+    const strPairs = parseStringToPairs(str);
+    const objPairs = parseObjectToPairs(obj);
+    const mergedPairs = mergePairs(strPairs, objPairs);
+    const result = pairsToString(mergedPairs);
+
+    return result;
+  } catch (error) {
+    console.error('合并过程中发生错误:', error);
+    return str; // 出错时返回原字符串
+  }
 }
 
 var RainteeSourceMapTool = /*#__PURE__*/Object.freeze({
     __proto__: null,
     GenerateUniqueId: GenerateUniqueId,
+    downloadByUrl: downloadByUrl,
     generateKeyValueTableHTML: generateKeyValueTableHTML,
     getLayerIdFidld: getLayerIdFidld,
+    mergeStringAndObject: mergeStringAndObject,
     treeDataAdapter: treeDataAdapter,
     treeDataAdapterNext: treeDataAdapterNext
 });