|
|
@@ -0,0 +1,349 @@
|
|
|
+package com.etotem.cfc.unit;
|
|
|
+
|
|
|
+import org.junit.jupiter.api.Test;
|
|
|
+
|
|
|
+import java.io.InputStream;
|
|
|
+import java.lang.reflect.Field;
|
|
|
+import java.lang.reflect.Method;
|
|
|
+import java.nio.charset.StandardCharsets;
|
|
|
+import java.util.List;
|
|
|
+import java.util.Scanner;
|
|
|
+
|
|
|
+import static org.junit.jupiter.api.Assertions.assertEquals;
|
|
|
+import static org.junit.jupiter.api.Assertions.assertTrue;
|
|
|
+import static org.junit.jupiter.api.Assertions.fail;
|
|
|
+
|
|
|
+/**
|
|
|
+ * 契约级单测:团队分润池层级瓜分——档位权重加权分配(能力键 {@code cf.teamshare.weightedShare},
|
|
|
+ * 单元 team.share;TDD-RED 阶段,任务 S-cfc-397)。
|
|
|
+ *
|
|
|
+ * <p><b>契约溯源</b>:
|
|
|
+ * <ul>
|
|
|
+ * <li>需求:{@code docs/superpowers/plans/2026-11-14-cf-reward-model-v2.md} §3 —— 团队分润池
|
|
|
+ * = 成本 × T%(新通道,用户口径 R2);池内按决策 <b>D2</b>「沿用 referral_tree 层级树 +
|
|
|
+ * 销售档位」瓜分(与直推档位体系一致的瓜分规则);</li>
|
|
|
+ * <li>设计:{@code docs/superpowers/plans/2026-11-14-cf-reward-model-v2-design.md}
|
|
|
+ * §5(层级树瓜分算法 {@code distributeTeamPool} 伪代码)、§6 T05(能力键
|
|
|
+ * {@code cf.teamshare.share.weighted} / remainder / family-skip)、§2.3(cf_team_pool_share 表)、
|
|
|
+ * §8 用例 #1(数学锚点)/ #9(尾差守恒)。</li>
|
|
|
+ * </ul>
|
|
|
+ *
|
|
|
+ * <p><b>契约范围</b>:「加权瓜分」——池金额按成员档位权重({@code weight = rate_percent},与 F03a
|
|
|
+ * 直推档位同一口径,权重数据源 = {@link com.etotem.cfc.service.CfReferralService#getTeamAnnualPpoints}
|
|
|
+ * + {@code matchDirectSalesTier})比例分配;尾差守恒(最后一人补齐,Σ share_cent == pool_cent,
|
|
|
+ * 金额不蒸发);无档位(totalW ≤ 0)无人可分(池置 unclaimed,不私发)。</p>
|
|
|
+ *
|
|
|
+ * <p><b>数学校验锚点</b>(设计 §8#1,单位:分):池 3000 分(30 元),成员权重 {70, 50},totalW=120:</p>
|
|
|
+ * <pre>
|
|
|
+ * raw₁ = floor(3000 × 70 / 120) = 1750
|
|
|
+ * raw₂ = 3000 − 1750 = 1250 // 最后一人补齐(尾差守恒)
|
|
|
+ * Σ = 3000 == pool_cent ✓(§8#9)
|
|
|
+ * </pre>
|
|
|
+ *
|
|
|
+ * <p><b>宿主契约(TDD-RED 锚点)</b>:{@code com.etotem.cfc.service.CfCommissionService} ——
|
|
|
+ * 设计 §3.1(T04/T05)新增 {@code distributeTeamPool(...)} 入口与常量 {@code RULE_TEAM_POOL = "F03c"};
|
|
|
+ * 以及新实体 {@code CfTeamPoolOrder} / {@code CfTeamPoolShare}(§2.2/§2.3)与 schema.sql 建表
|
|
|
+ * (迁移 463/464)。当前 src/main <b>均未落地</b>(全库 0 引用、schema.sql 无对应建表)——
|
|
|
+ * 本测试通过反射锚定宿主契约,运行时探测缺失即断言失败(红);GREEN 阶段实现方按
|
|
|
+ * 「契约方法签名」落地后转绿。</p>
|
|
|
+ *
|
|
|
+ * <p><b>契约方法签名(实现方按此落地)</b>:
|
|
|
+ * <ul>
|
|
|
+ * <li>{@code void distributeTeamPool(Long orderId, String orderType, Long buyerUserId,
|
|
|
+ * Long buyerFamilyId, Integer paidCent, Long productId)}
|
|
|
+ * —— 层级树瓜分流水入口(§3.1 T05 / §5),内部完成取层级树 → 档位权重 → 加权瓜分 →
|
|
|
+ * {@code earnByRule(memberId, "F03c", poolId, {amount: raw})} + cf_team_pool_share 幂等落库;
|
|
|
+ * 与 {@code allocateTeamPoolShareByWeight} 分治,使加权算法可独立单测;</li>
|
|
|
+ * <li>{@code List<Integer> allocateTeamPoolShareByWeight(int[] weights, int poolCent)}
|
|
|
+ * —— 纯加权瓜分(§5 step 5 算法抽离):返回每人分得(分),长度 = 成员数;
|
|
|
+ * 末位成员吸收尾差保证 Σ = poolCent;权重全 0(totalW ≤ 0,无档位)返回空列表
|
|
|
+ * (不私发,调用方将池置 unclaimed);</li>
|
|
|
+ * <li>常量 {@code RULE_TEAM_POOL = "F03c"}(§3.1 cf_earn_rule 新规则码)。</li>
|
|
|
+ * </ul>
|
|
|
+ *
|
|
|
+ * <p><b>权限流</b>:本能力为后端内部结算链路(订单结算 → 团队池瓜分 → CF 发放),无用户权限维度,
|
|
|
+ * 权限流不适用(以说明性用例标注)。</p>
|
|
|
+ *
|
|
|
+ * <p><b>RED 预期</b>:宿主 {@code CfCommissionService} 缺 {@code distributeTeamPool} /
|
|
|
+ * {@code allocateTeamPoolShareByWeight} / {@code RULE_TEAM_POOL},新实体与 schema 建表全部缺失,
|
|
|
+ * 对应用例在反射探测处失败(红)。</p>
|
|
|
+ */
|
|
|
+class TeamShareWeightedContractTest {
|
|
|
+
|
|
|
+ /** 规格设计宿主服务(类已存在,契约方法未落地)。 */
|
|
|
+ private static final String HOST_CLASS = "com.etotem.cfc.service.CfCommissionService";
|
|
|
+
|
|
|
+ /** 规格设计宿主实体(§2.3,T05 新增,未实现)。 */
|
|
|
+ private static final String ENTITY_SHARE = "com.etotem.cfc.entity.CfTeamPoolShare";
|
|
|
+
|
|
|
+ /** 规格设计宿主实体(§2.2,T04 新增,T05 依赖,未实现)。 */
|
|
|
+ private static final String ENTITY_ORDER = "com.etotem.cfc.entity.CfTeamPoolOrder";
|
|
|
+
|
|
|
+ /** 数学校验锚点(§8#1):池 = 30 元 = 3000 分。 */
|
|
|
+ private static final int POOL_CENT = 3000;
|
|
|
+
|
|
|
+ /** 数学校验锚点(§8#1):2 名团队成员档位权重(rate_percent 同 F03a 直推档位)。 */
|
|
|
+ private static final int[] WEIGHTS_70_50 = {70, 50};
|
|
|
+
|
|
|
+ /** 期望份额:3000×70/120 = 1750 分。 */
|
|
|
+ private static final int EXPECT_FIRST_CENT = 1750;
|
|
|
+
|
|
|
+ /** 期望份额(尾差守恒补最后一人):3000 − 1750 = 1250 分。 */
|
|
|
+ private static final int EXPECT_LAST_CENT = 1250;
|
|
|
+
|
|
|
+ // ==================== 正常流:加权瓜分数学校验(§8#1 / §8#9) ====================
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 正常流_加权瓜分_规格数学锚点_3000分与70和50权重() {
|
|
|
+ Object host = contractHost();
|
|
|
+ // 数学锚点:池 3000 分、权重 {70,50}、totalW=120 → 1750 / 1250(末位补齐尾差)
|
|
|
+ List<Integer> shares = callListInteger(host, "allocateTeamPoolShareByWeight",
|
|
|
+ WEIGHTS_70_50, POOL_CENT);
|
|
|
+ assertNotNullOrEmpty(shares, "应返回 2 名成员各自分得份额");
|
|
|
+ assertEquals(2, shares.size(), "2 名成员");
|
|
|
+ assertEquals(Integer.valueOf(EXPECT_FIRST_CENT), shares.get(0),
|
|
|
+ "成员1 应得 3000×70/120 = 1750 分(§8#1)");
|
|
|
+ assertEquals(Integer.valueOf(EXPECT_LAST_CENT), shares.get(1),
|
|
|
+ "成员2(末位)应得 3000−1750 = 1250 分,补齐尾差(§8#1/#9)");
|
|
|
+ }
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 正常流_加权瓜分_尾差守恒_任意权重组合份额之和恒等于池() {
|
|
|
+ Object host = contractHost();
|
|
|
+ assertConserved(host, new int[]{70, 50});
|
|
|
+ assertConserved(host, new int[]{33, 33, 34});
|
|
|
+ assertConserved(host, new int[]{80, 15, 5});
|
|
|
+ assertConserved(host, new int[]{100});
|
|
|
+ assertConserved(host, new int[]{12, 30, 58});
|
|
|
+ assertConserved(host, new int[]{25, 25, 25, 25});
|
|
|
+ }
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 正常流_加权瓜分_单人持有_全池归一人() {
|
|
|
+ Object host = contractHost();
|
|
|
+ List<Integer> shares = callListInteger(host, "allocateTeamPoolShareByWeight",
|
|
|
+ new int[]{100}, POOL_CENT);
|
|
|
+ assertNotNullOrEmpty(shares, "单人成员应返回 1 条份额");
|
|
|
+ assertEquals(Integer.valueOf(POOL_CENT), shares.get(0),
|
|
|
+ "唯一成员权重 100 → 全池 3000 分归其一人");
|
|
|
+ }
|
|
|
+
|
|
|
+ // ==================== 边界流:无档位(totalW ≤ 0)→ 无人可分 ====================
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 边界流_无档位零权重_无人可分不私发() {
|
|
|
+ Object host = contractHost();
|
|
|
+ // §5 step 4/5:totalW ≤ 0 → 无成员可分 → 池置 unclaimed(不私发);纯函数返回空列表
|
|
|
+ List<Integer> shares = callListInteger(host, "allocateTeamPoolShareByWeight",
|
|
|
+ new int[]{0, 0}, POOL_CENT);
|
|
|
+ assertTrue(shares.isEmpty(),
|
|
|
+ "权重全 0(无档位)→ 返回空列表,调用方将池置 unclaimed(不私发,§5)");
|
|
|
+ }
|
|
|
+
|
|
|
+ // ==================== 正常流(结构契约):宿主方法 / 常量应存在 ====================
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 宿主入口_distributeTeamPool_应存在() {
|
|
|
+ Object host = contractHost();
|
|
|
+ boolean hasMethod = false;
|
|
|
+ for (Method m : host.getClass().getDeclaredMethods()) {
|
|
|
+ if ("distributeTeamPool".equals(m.getName())) {
|
|
|
+ hasMethod = true;
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ assertTrue(hasMethod,
|
|
|
+ "RED[cf.teamshare.weightedShare] CfCommissionService 应提供 distributeTeamPool(...) "
|
|
|
+ + "层级树瓜分入口(设计 §3.1 T05 / §5)。实现未落地。");
|
|
|
+ }
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 宿主入口_allocateTeamPoolShareByWeight_应存在() {
|
|
|
+ Object host = contractHost();
|
|
|
+ // 直接调用:方法缺失即 fail(RED 信号更清晰)
|
|
|
+ callListInteger(host, "allocateTeamPoolShareByWeight", new int[]{1}, 1);
|
|
|
+ }
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 宿主常量_RULE_TEAM_POOL_应为F03c() {
|
|
|
+ Object value = staticFieldValue(HOST_CLASS, "RULE_TEAM_POOL");
|
|
|
+ assertEquals("F03c", String.valueOf(value),
|
|
|
+ "RED[cf.teamshare.weightedShare] RULE_TEAM_POOL 应为 \"F03c\"(cf_earn_rule 团队分润池"
|
|
|
+ + " 规则码,§3.1)。实现未落地。");
|
|
|
+ }
|
|
|
+
|
|
|
+ // ==================== 正常流(结构契约):新实体应存在(§2.2 / §2.3) ====================
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 实体_CfTeamPoolShare_字段契约() {
|
|
|
+ String[] fields = {"poolId", "memberId", "userId", "layer", "ratePercent",
|
|
|
+ "weight", "shareCent", "status"};
|
|
|
+ assertEntityFields(ENTITY_SHARE, fields,
|
|
|
+ "cf_team_pool_share 成员瓜分明细(§2.3):weight 为档位权重(=rate_percent,0=无档位跳过),"
|
|
|
+ + "shareCent 为分得金额(分)。实现未落地。");
|
|
|
+ }
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 实体_CfTeamPoolOrder_状态承载() {
|
|
|
+ String[] fields = {"orderId", "orderType", "poolCent", "tBps", "configScope", "status"};
|
|
|
+ assertEntityFields(ENTITY_ORDER, fields,
|
|
|
+ "cf_team_pool_order 团队池整单(§2.2):status 承载 pooled/share_issued/unclaimed 生命周期"
|
|
|
+ + "(§5:建池 pooled → 瓜分 share_issued / 无成员可瓜分 unclaimed)。实现未落地。");
|
|
|
+ }
|
|
|
+
|
|
|
+ // ==================== 正常流(结构契约):schema.sql 应落地建表 + 唯一键 ====================
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void schema_cf_team_pool_share_建表与uk_pool_member唯一键() {
|
|
|
+ String schema = readSchemaSql();
|
|
|
+ assertTrue(schema.contains("cf_team_pool_share"),
|
|
|
+ "RED[cf.teamshare.weightedShare] schema.sql 缺少 cf_team_pool_share 建表(§2.3,"
|
|
|
+ + "迁移464)。实现未落地。");
|
|
|
+ assertTrue(schema.contains("uk_pool_member"),
|
|
|
+ "RED[cf.teamshare.weightedShare] cf_team_pool_share 应含 uk_pool_member 唯一键"
|
|
|
+ + " `(pool_id, member_id)`,保证重复结算不重复瓜分(§2.3 / §1.5 三层兜底)。实现未落地。");
|
|
|
+ }
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void schema_cf_team_pool_order_建表与uk_order唯一键() {
|
|
|
+ String schema = readSchemaSql();
|
|
|
+ assertTrue(schema.contains("cf_team_pool_order"),
|
|
|
+ "RED[cf.teamshare.weightedShare] schema.sql 缺少 cf_team_pool_order 建表(§2.2,"
|
|
|
+ + "迁移463)。实现未落地。");
|
|
|
+ assertTrue(schema.contains("uk_order"),
|
|
|
+ "RED[cf.teamshare.weightedShare] cf_team_pool_order 应含 uk_order 唯一键"
|
|
|
+ + " `(order_type, order_id)`(建池幂等,§2.2)。实现未落地。");
|
|
|
+ }
|
|
|
+
|
|
|
+ // ==================== 权限流(不适用):后端内部结算链路 ====================
|
|
|
+
|
|
|
+ @Test
|
|
|
+ void 权限流_不适用() {
|
|
|
+ // 契约 AC(§8#1/#9)为「订单结算 → 团队池加权瓜分 → F03c CF 发放」内部链路,无用户权限断言维度。
|
|
|
+ assertTrue(true, "权限流不适用:cf.teamshare.weightedShare 为后端内部结算链路,无用户权限维度。");
|
|
|
+ }
|
|
|
+
|
|
|
+ // ==================== 断言辅助 ====================
|
|
|
+
|
|
|
+ private void assertConserved(Object host, int[] weights) {
|
|
|
+ List<Integer> shares = callListInteger(host, "allocateTeamPoolShareByWeight", weights, POOL_CENT);
|
|
|
+ assertNotNullOrEmpty(shares, "每次瓜分都应返回份额数组");
|
|
|
+ long sum = 0;
|
|
|
+ for (Integer s : shares) {
|
|
|
+ if (s != null) sum += s;
|
|
|
+ }
|
|
|
+ assertEquals(POOL_CENT, sum,
|
|
|
+ "尾差守恒(§8#9):Σ 份额必须恒 = 池金额 " + POOL_CENT
|
|
|
+ + " 分,最后一人补齐,无金额蒸发");
|
|
|
+ assertEquals(weights.length, shares.size(), "份额数量 = 成员数");
|
|
|
+ }
|
|
|
+
|
|
|
+ private static void assertNotNullOrEmpty(List<Integer> list, String msg) {
|
|
|
+ if (list == null) {
|
|
|
+ fail(msg);
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ // ==================== 反射辅助(锚定宿主契约,避免编译期依赖不存在类) ====================
|
|
|
+
|
|
|
+ /** 加载宿主服务;宿主类不可实例化即断言失败(红,暴露实现未落地)。 */
|
|
|
+ private Object contractHost() {
|
|
|
+ try {
|
|
|
+ Class<?> clazz = Class.forName(HOST_CLASS);
|
|
|
+ return clazz.getDeclaredConstructor().newInstance();
|
|
|
+ } catch (ClassNotFoundException e) {
|
|
|
+ fail("RED[cf.teamshare.weightedShare] 契约宿主 CfCommissionService 未实现:" + e.getMessage());
|
|
|
+ throw new IllegalStateException("unreachable");
|
|
|
+ } catch (Exception e) {
|
|
|
+ fail("契约宿主 CfCommissionService 实例化失败:" + e.getMessage());
|
|
|
+ throw new IllegalStateException("unreachable");
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ /** 按方法名 + 参数个数匹配并调用(宽松适配基本/包装类型),契约方法缺失即断言失败(红)。 */
|
|
|
+ private Object call(Object host, String method, Object... args) {
|
|
|
+ for (Method m : host.getClass().getMethods()) {
|
|
|
+ if (m.getName().equals(method) && m.getParameterCount() == args.length) {
|
|
|
+ try {
|
|
|
+ return m.invoke(host, args);
|
|
|
+ } catch (Exception e) {
|
|
|
+ fail("契约方法 " + HOST_CLASS + "#" + method + " 调用失败:" + e.getMessage());
|
|
|
+ throw new IllegalStateException("unreachable");
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+ fail("RED[cf.teamshare.weightedShare] 契约方法 " + HOST_CLASS + "#" + method + " 未实现"
|
|
|
+ + "(设计 §5 加权瓜分 / §3.1 T05)。实现未落地。");
|
|
|
+ throw new IllegalStateException("unreachable");
|
|
|
+ }
|
|
|
+
|
|
|
+ @SuppressWarnings("unchecked")
|
|
|
+ private List<Integer> callListInteger(Object host, String method, Object... args) {
|
|
|
+ Object r = call(host, method, args);
|
|
|
+ if (r instanceof List) {
|
|
|
+ return (List<Integer>) r;
|
|
|
+ }
|
|
|
+ fail("契约方法 " + method + " 应返回 List,实际 " + r);
|
|
|
+ throw new IllegalStateException("unreachable");
|
|
|
+ }
|
|
|
+
|
|
|
+ private void assertEntityFields(String className, String[] fields, String reason) {
|
|
|
+ Class<?> clazz = loadClass(className);
|
|
|
+ if (clazz == null) {
|
|
|
+ fail("RED[cf.teamshare.weightedShare] 契约实体 " + className + " 不存在:" + reason);
|
|
|
+ }
|
|
|
+ for (String field : fields) {
|
|
|
+ boolean found = false;
|
|
|
+ for (Field f : clazz.getDeclaredFields()) {
|
|
|
+ if (field.equals(f.getName())) {
|
|
|
+ found = true;
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ assertTrue(found,
|
|
|
+ "RED[cf.teamshare.weightedShare] 契约实体 " + className + " 应含字段 " + field + ":" + reason);
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ /** 读取宿主静态常量字段;类或字段缺失即断言失败(红)。 */
|
|
|
+ private Object staticFieldValue(String className, String fieldName) {
|
|
|
+ Class<?> clazz = loadClass(className);
|
|
|
+ if (clazz == null) {
|
|
|
+ fail("RED[cf.teamshare.weightedShare] 宿主类 " + className + " 未实现:" + fieldName);
|
|
|
+ }
|
|
|
+ try {
|
|
|
+ Field f = clazz.getDeclaredField(fieldName);
|
|
|
+ f.setAccessible(true);
|
|
|
+ return f.get(null);
|
|
|
+ } catch (NoSuchFieldException e) {
|
|
|
+ fail("RED[cf.teamshare.weightedShare] 契约常量 " + className + "#" + fieldName + " 未实现"
|
|
|
+ + "(§3.1 RULE_TEAM_POOL)。实现未落地。");
|
|
|
+ throw new IllegalStateException("unreachable");
|
|
|
+ } catch (Exception e) {
|
|
|
+ fail("读取常量 " + className + "#" + fieldName + " 失败:" + e.getMessage());
|
|
|
+ throw new IllegalStateException("unreachable");
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ private Class<?> loadClass(String name) {
|
|
|
+ try {
|
|
|
+ return Class.forName(name, false, Thread.currentThread().getContextClassLoader());
|
|
|
+ } catch (ClassNotFoundException e) {
|
|
|
+ return null;
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ private String readSchemaSql() {
|
|
|
+ try (InputStream is = getClass().getClassLoader().getResourceAsStream("schema.sql")) {
|
|
|
+ if (is == null) {
|
|
|
+ return "";
|
|
|
+ }
|
|
|
+ try (Scanner scanner = new Scanner(is, StandardCharsets.UTF_8.name())) {
|
|
|
+ scanner.useDelimiter("\\A");
|
|
|
+ return scanner.hasNext() ? scanner.next() : "";
|
|
|
+ }
|
|
|
+ } catch (Exception e) {
|
|
|
+ return "";
|
|
|
+ }
|
|
|
+ }
|
|
|
+}
|