赠品类商品在平台上会随购买数量重复出现(数量 3 就是 3 件),也可能同时出现在多个组合里 (两份组合、不同组合都含同一赠品)。业务上赠品每单只送一份,需要按商品维度收敛。 - 迁移 add-unique-gift-to-products:products.is_order_unique_gift TINYINT 默认 0 + 索引 (已在本机执行) - 模型/契约/列表接口:字段透传;列表支持 is_order_unique_gift=1/0 筛选 - 明细解析:rebuildOrderItems 展开成最小单位后调用 collapseUniqueGifts → collapseUniqueGiftRows 收敛:同一赠品只保留第一行、数量固定 1 (多数量 / 同一组合多份 / 不同组合都含该赠品,均只落一行);重复重建不会涨回数量 - 系统商品页:新增「订单唯一赠品」开关(带说明)、列表「唯一赠品」标记、筛选下拉; 导出(exportDefs.product)同步加筛选与列 - 单测:orderItemUniqueGift.test.js(纯函数 5 例)+ orderItemUniqueGiftRebuild.test.js (真实库事务内验证两条明细数量 3 → 1 行数量 1,跑完回滚) - 顺带修 model/product.js 里重复定义的 brand_name(eslint no-dupe-keys,两行内容相同) - 文档 §6.1.1 补「组合拆分 + 订单唯一赠品」口径 Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
69 lines
2.7 KiB
JavaScript
69 lines
2.7 KiB
JavaScript
'use strict';
|
|
|
|
const { assert } = require('egg-mock/bootstrap');
|
|
const { collapseUniqueGiftRows } = require('../../../app/lib/orderItemExpand');
|
|
|
|
/**
|
|
* 造一行明细
|
|
* @param {Object} overrides 覆盖字段
|
|
* @return {Object} 明细行
|
|
*/
|
|
function row(overrides) {
|
|
return { product_id: null, plan_qty: 1, quantity: 1, item_code: 'X', ...overrides };
|
|
}
|
|
|
|
describe('app/lib/orderItemExpand 订单唯一赠品收敛', () => {
|
|
it('同一赠品数量 3 → 只留 1 行且数量 1', () => {
|
|
const rows = [ row({ product_id: 100, plan_qty: 3, quantity: 3 }) ];
|
|
const out = collapseUniqueGiftRows(rows, new Set([ 100 ]));
|
|
assert.strictEqual(out.length, 1);
|
|
assert.strictEqual(Number(out[0].quantity), 1);
|
|
assert.strictEqual(Number(out[0].plan_qty), 1);
|
|
});
|
|
|
|
it('不同组合都含同一赠品 → 只留 1 行', () => {
|
|
const rows = [
|
|
row({ product_id: 100, combo_product_id: 7, quantity: 2 }),
|
|
row({ product_id: 100, combo_product_id: 8, quantity: 4 }),
|
|
row({ product_id: 200, quantity: 1 }),
|
|
];
|
|
const out = collapseUniqueGiftRows(rows, [ 100 ]);
|
|
assert.strictEqual(out.length, 2, '赠品 1 行 + 普通商品 1 行');
|
|
assert.strictEqual(Number(out[0].combo_product_id), 7, '保留第一次出现的那行');
|
|
assert.strictEqual(Number(out[0].quantity), 1);
|
|
assert.strictEqual(Number(out[1].product_id), 200);
|
|
});
|
|
|
|
it('多个不同赠品各自保留 1 行,数量都归 1', () => {
|
|
const rows = [
|
|
row({ product_id: 100, quantity: 5 }),
|
|
row({ product_id: 101, quantity: 2 }),
|
|
row({ product_id: 100, quantity: 1 }),
|
|
row({ product_id: 101, quantity: 9 }),
|
|
];
|
|
const out = collapseUniqueGiftRows(rows, new Set([ 100, 101 ]));
|
|
assert.strictEqual(out.length, 2);
|
|
assert.deepStrictEqual(out.map(item => Number(item.product_id)), [ 100, 101 ]);
|
|
assert.deepStrictEqual(out.map(item => Number(item.quantity)), [ 1, 1 ]);
|
|
});
|
|
|
|
it('非赠品不受影响(数量原样保留)', () => {
|
|
const rows = [
|
|
row({ product_id: 100, quantity: 3 }),
|
|
row({ product_id: 100, quantity: 3 }),
|
|
row({ product_id: null, quantity: 2 }),
|
|
];
|
|
const out = collapseUniqueGiftRows(rows, new Set([ 999 ]));
|
|
assert.strictEqual(out.length, 3);
|
|
assert.deepStrictEqual(out.map(item => Number(item.quantity)), [ 3, 3, 2 ]);
|
|
});
|
|
|
|
it('空标记 / 空明细直接返回', () => {
|
|
const rows = [ row({ product_id: 100, quantity: 2 }) ];
|
|
assert.strictEqual(collapseUniqueGiftRows(rows, new Set()).length, 1);
|
|
assert.strictEqual(collapseUniqueGiftRows(rows, new Set()).at(0).quantity, 2);
|
|
assert.deepStrictEqual(collapseUniqueGiftRows(null, new Set([ 100 ])), []);
|
|
assert.deepStrictEqual(collapseUniqueGiftRows([], [ 100 ]), []);
|
|
});
|
|
});
|