合托入库逻辑

This commit is contained in:
2025-12-19 17:28:44 +08:00
parent a6106d1fde
commit e0bb2d84f7

View File

@@ -152,6 +152,7 @@
methods: { methods: {
toCancel() { toCancel() {
this.show = false this.show = false
this.clearUp()
}, },
handleChange (e) { handleChange (e) {
if (e) { if (e) {
@@ -265,6 +266,7 @@
}) })
} else { } else {
this._combineMaterials() this._combineMaterials()
// this.show = true
} }
}, },
async _combineMaterials () { async _combineMaterials () {
@@ -277,16 +279,24 @@
icon: 'none' icon: 'none'
}) })
} else if (res.need_store_in) { } else if (res.need_store_in) {
uni.showModal({ // 如果全选 现在只会进行1次入库如果没有全选 仍然进行两次入库
title: '提示', if (this.selectedItems.length < this.oPalletData.length) {
content: '请将托盘放置在SD01/SD02点位扫描托盘码进行入库。', // 部分选择 弹出二次入库
showCancel: false, uni.showModal({
success: (res) => { title: '提示',
if (res.confirm) { content: '请将托盘放置在SD01/SD02点位扫描托盘码进行入库。',
this.show = true showCancel: false,
success: (res) => {
if (res.confirm) {
this.show = true
}
} }
} })
}) } else {
// 全选 直接入库
this.show = true
// this._generateStoreInTask()
}
} }
this.disabled = false this.disabled = false
} catch (e) { } catch (e) {
@@ -314,6 +324,9 @@
this.val2 = '' this.val2 = ''
this.val3 = '' this.val3 = ''
this.times = 1 this.times = 1
if (this.selectedItems.length === this.oPalletData.length) {
this.clearUp()
}
} }
} else { } else {
if (res.is_second_store_in) { if (res.is_second_store_in) {