heuristic-utils.go

package limited_rationality

import (
	"github.com/Azbesciak/RealDecisionMaker/lib/model"
	"github.com/Azbesciak/RealDecisionMaker/lib/utils"
)

type HeuristicParams interface {
	GetCurrentChoice() string
	GetRandomSeed() int64
	IsRandomAlternativesOrdering() bool
}

func GetAlternativesSearchOrder(
	dm *model.DecisionMakingParams,
	params HeuristicParams,
	generator utils.ValueGenerator,
) (model.AlternativeWithCriteria, []model.AlternativeWithCriteria) {
	if len(params.GetCurrentChoice()) > 0 {
		allAlternatives := dm.AllAlternatives()
		choice := model.FetchAlternative(&allAlternatives, params.GetCurrentChoice())
		leftAlternatives := model.RemoveAlternative(dm.ConsideredAlternatives, choice)
		otherAlternatives := OrderAlternatives(params.IsRandomAlternativesOrdering(), &leftAlternatives, generator)
		return choice, *otherAlternatives
	} else {
		alternatives := *OrderAlternatives(params.IsRandomAlternativesOrdering(), &dm.ConsideredAlternatives, generator)
		return alternatives[0], alternatives[1:]
	}
}

func OrderAlternatives(isRandomOrder bool, alternatives *[]model.AlternativeWithCriteria, generator utils.ValueGenerator) *[]model.AlternativeWithCriteria {
	if isRandomOrder {
		return model.ShuffleAlternatives(alternatives, generator)
	} else {
		return model.CopyAlternatives(alternatives)
	}
}

func PrepareSequentialRanking(result model.AlternativeResults, resultIds []model.Alternative) model.AlternativesRanking {
	resultsCount := len(result)
	ranking := make(model.AlternativesRanking, resultsCount)
	for i, r := range result {
		lastIndex := i + 2
		if lastIndex > resultsCount {
			lastIndex = resultsCount
		}
		ranking[i] = model.AlternativesRankEntry{
			AlternativeResult:  r,
			BetterThanOrSameAs: resultIds[i+1 : lastIndex],
		}
	}
	return ranking
}