Class AffinityEngine<K>

java.lang.Object

ke.ric.api.affinity.AffinityEngine<K>

public final class AffinityEngine<K>
extends Object

Deterministic evidence aggregation and guidance shared by addon-owned processes. Addons supply candidates, evidence, eligibility and route completion; this class has no item, recipe, climate or process-specific rules.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final record	AffinityEngine.ContenderPolicy
static final record	AffinityEngine.Contribution<K>	One independent piece of evidence, optionally weighted by quantity.
static final record	AffinityEngine.Ranked<K>

Constructor Summary

Constructors

Constructor	Description
AffinityEngine(List<K> tieOrder)

Method Summary

Modifier and Type	Method	Description
Map<K,Double>	aggregate(Collection<AffinityEngine.Contribution<K>> contributions)	Applies contributions in caller order, preserving fractional evidence.
List<AffinityEngine.Ranked<K>>	contenders(Map<K,Double> scores, Predicate<K> eligible, AffinityEngine.ContenderPolicy policy)	A clear leader stands alone; otherwise keep the closest bounded contenders.
static <T> Optional<T>	nextStep(List<T> steps, Predicate<T> completed)	Selects the first unfinished action without exposing scores to the player.
List<AffinityEngine.Ranked<K>>	rank(Map<K,Double> scores, Predicate<K> eligible)	Missing candidate scores are zero; ineligible candidates never participate.

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

AffinityEngine

public AffinityEngine(List<K> tieOrder)

Method Details

aggregate

public Map<K,Double> aggregate(Collection<AffinityEngine.Contribution<K>> contributions)

Applies contributions in caller order, preserving fractional evidence.

rank

public List<AffinityEngine.Ranked<K>> rank(Map<K,Double> scores,
 Predicate<K> eligible)

Missing candidate scores are zero; ineligible candidates never participate.

contenders

public List<AffinityEngine.Ranked<K>> contenders(Map<K,Double> scores,
 Predicate<K> eligible,
 AffinityEngine.ContenderPolicy policy)

A clear leader stands alone; otherwise keep the closest bounded contenders.

nextStep

public static <T> Optional<T> nextStep(List<T> steps,
 Predicate<T> completed)

Selects the first unfinished action without exposing scores to the player.