net/shop_template_back
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fixed 完善sku列表

Browse Source
This commit is contained in:
lwh 2023-06-23 11:27:46 +08:00
parent 5025f22c96
commit de87f5aa4e
1 changed files with 38 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

66
src/views/business/GoodsManager/Goodss/components/MultiSpec/MultiSpec.vue
View File

@ -46,12 +46,12 @@
:width="column.width"> :width="column.width">
</el-table-column> </el-table-column>
<!-- <el-table-column prop="goodsSkuPrice" label="预览图"> <el-table-column prop="goodsSkuPrice" label="预览图" width="120" align="center">
<template #default="scope"> <template #default="scope">
<UploadImage ref="uploadRef" v-model="scope.row.goodsSkuImg" :data=imgData :limit="1" <UploadImage ref="uploadRef" v-model="scope.row.goodsSkuImg" :data=imgData :limit="1" :fileSize="5" :drag="true"
:fileSize="5" :drag="true" :isShowTip="false" /> :isShowTip="false" />
</template> </template>
</el-table-column> --> </el-table-column>
<el-table-column prop="goodsSkuPrice" label="商品价格"> <el-table-column prop="goodsSkuPrice" label="商品价格">
<template #default="scope"> <template #default="scope">
@ -171,13 +171,12 @@ const getSpanArr = (data) => {
pos.value = ""; pos.value = "";
spanArr1.value = []; spanArr1.value = [];
pos1.value = ""; pos1.value = "";
for (var i = 0; i < data.length; i++) { data.forEach((item, i) => {
if (i === 0) { if (i === 0) {
spanArr.value.push(1); spanArr.value.push(1);
pos.value = 0; pos.value = 0;
} else { } else {
// 判断当前元素与上一个元素是否相同 if (item.specValue === data[i - 1].specValue) {
if (data[i].specValue === data[i - 1].specValue) {
spanArr.value[pos.value] += 1; spanArr.value[pos.value] += 1;
spanArr.value.push(0); spanArr.value.push(0);
} else { } else {
@ -185,24 +184,27 @@ const getSpanArr = (data) => {
pos.value = i; pos.value = i;
} }
} }
} });
for (var i = 0; i < data.length; i++) {
if (i === 0) { data.forEach((item, i) => {
spanArr1.value.push(1); if (item.specThirdValue != null) {
pos1.value = 0; if (i === 0) {
} else {
//如果笛卡尔积一直递增下去的话 这是一个很蠢的方法 由于我的要求层数是已知的 这里偷懒了 不然应该用for循环
if (data[i].specSecondValue === data[i - 1].specSecondValue) {
spanArr1.value[pos1.value] += 1;
spanArr1.value.push(0);
} else {
spanArr1.value.push(1); spanArr1.value.push(1);
pos1.value = i; pos1.value = 0;
} else {
if (item.specSecondValue === data[i - 1].specSecondValue) {
spanArr1.value[pos1.value] += 1;
spanArr1.value.push(0);
} else {
spanArr1.value.push(1);
pos1.value = i;
}
} }
} }
} });
console.log(spanArr.value, '排序Arr'); console.log(spanArr.value, '排序Arr');
console.log(spanArr1.value, '排序Arr1');
} }
@ -218,12 +220,14 @@ const objectSpanMethod = ({ row, column, rowIndex, columnIndex }) => {
}; };
// columnIndex === 1 找到第二列，合并他的列数 // columnIndex === 1 找到第二列，合并他的列数
} else if (columnIndex === 1) { } else if (columnIndex === 1) {
const _row = spanArr1.value[rowIndex]; if (spanArr1.value.length != 0) {
const _col = _row > 0 ? 1 : 0; const _row = spanArr1.value[rowIndex];
return { const _col = _row > 0 ? 1 : 0;
rowspan: _row, return {
colspan: _col rowspan: _row,
}; colspan: _col
};
}
} }
} }
@ -484,4 +488,10 @@ function handleDelSpecValue(item, specValue) {
.el-input-number { .el-input-number {
width: 140px; width: 140px;
} }
:deep(.el-upload--picture-card) {
width: 90px;
height: 90px;
}
</style> </style>