EnakGame phases 1-8 of docs/tasks-enakgame.md (EG-101 to EG-803), built on the existing EnakPoint/EnakCoin wallet (docs/rfc-enakgame.md). Foundation (phase 1) - Migrations 000103-000106: games extended with organization, slug, status, entry cost and result rules, old games archived (not deleted); budgets, versioned reward configs, sessions and session rewards; the ledger types GAME_SPEND_REFUND, GAME_REWARD and REWARD_REDEEM_REFUND; audit_logs. - AuditLogger writes in the caller's transaction only. - enakgame.limit.user_daily and global_daily organization settings. Games and sessions (phases 2-4) - Admin /marketing/enakgame: games, reward config versions (immutable but for status, one ACTIVE per game), budgets with non-overlapping global periods and a daily job opening the next month. - Customer /customer/enakgame: start (Idempotency-Key, entry cost and config frozen on the session), complete (result validation, reward engine, max_reward cap, daily limits via game_reward_counters, one GAME_REWARD per budget), automatic refunds for system errors and deactivated games, and a session job. - Reward engine: FIXED, SCORE_BASED, OUTCOME_BASED, PROBABILITY (crypto/rand), rounded down. Vouchers and budgets (phases 5-6) - Migration 000108 and 000107: vouchers, codes, redemptions, cost attribution; Economy Guard counters. - STATIC and CODE_POOL redemption in one transaction with the REDEEM PIN action; realized cost traced through the lots to the budget that paid the reward. - Budget metrics: realized cost, forecast, exposure and status. Migrations 000109-000110 add the wallet_lots indexes they need, built CONCURRENTLY. Events (phase 7) - Migration 000111: game events, each with its own EVENT budget. Event extras stack per PRD §16 defaults, with event and per-customer limits. External vouchers (phase 8) - VoucherProvider contract, two-step PENDING redemption and a recovery job, tested with a fake provider. No provider adapter is registered yet, so EXTERNAL vouchers stay out of the catalog. Not yet decided before release: reward rounding, event stacking, budget exhaustion policy and thresholds (RFC §19.2). Migrations 000103-000111 have not been run on any shared database. Also fixes a leftover PAYMENT filter in a wallet test and a data race in a test PIN fake. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
53 lines
2.0 KiB
Go
53 lines
2.0 KiB
Go
package processor
|
|
|
|
import (
|
|
"math/rand"
|
|
"testing"
|
|
|
|
"github.com/google/uuid"
|
|
"github.com/stretchr/testify/assert"
|
|
|
|
"apskel-pos-be/internal/constants"
|
|
"apskel-pos-be/internal/repository"
|
|
)
|
|
|
|
func TestSplitVoucherCost(t *testing.T) {
|
|
october := uuid.New()
|
|
// RFC §7.6: Rp10.000 voucher for 8.000 EnakPoint, 6.000 from an EnakGame reward
|
|
// and 2.000 from shopping.
|
|
parts := SplitVoucherCost(10_000, []repository.RedemptionPointSource{
|
|
{Points: 2_000, SourceType: constants.WalletTxTypeEarn},
|
|
{Points: 6_000, SourceType: constants.WalletTxTypeGameReward, BudgetID: &october},
|
|
})
|
|
assert.EqualValues(t, 2_500, parts[0].Cost)
|
|
assert.EqualValues(t, 7_500, parts[1].Cost)
|
|
|
|
// Not evenly divisible: the remainder goes to the largest part, the first of equals.
|
|
parts = SplitVoucherCost(10_000, []repository.RedemptionPointSource{{Points: 3}, {Points: 3}, {Points: 3}})
|
|
assert.Equal(t, []int64{3_334, 3_333, 3_333}, []int64{parts[0].Cost, parts[1].Cost, parts[2].Cost})
|
|
parts = SplitVoucherCost(100, []repository.RedemptionPointSource{{Points: 1}, {Points: 5}, {Points: 1}})
|
|
assert.Equal(t, []int64{14, 72, 14}, []int64{parts[0].Cost, parts[1].Cost, parts[2].Cost})
|
|
|
|
// No overflow on large numbers.
|
|
parts = SplitVoucherCost(9_000_000_000_000, []repository.RedemptionPointSource{{Points: 3_000_000_000_000}, {Points: 6_000_000_000_000}})
|
|
assert.Equal(t, []int64{3_000_000_000_000, 6_000_000_000_000}, []int64{parts[0].Cost, parts[1].Cost})
|
|
|
|
assert.Empty(t, SplitVoucherCost(10, nil))
|
|
|
|
// Whatever the numbers, the parts add up to the face value and none is negative.
|
|
rng := rand.New(rand.NewSource(7))
|
|
for i := 0; i < 2_000; i++ {
|
|
face := rng.Int63n(1_000_000) + 1
|
|
sources := make([]repository.RedemptionPointSource, rng.Intn(5)+1)
|
|
for j := range sources {
|
|
sources[j].Points = rng.Int63n(10_000) + 1
|
|
}
|
|
var sum int64
|
|
for _, p := range SplitVoucherCost(face, sources) {
|
|
assert.GreaterOrEqual(t, p.Cost, int64(0))
|
|
sum += p.Cost
|
|
}
|
|
assert.Equal(t, face, sum)
|
|
}
|
|
}
|