4 commits

Author	SHA1	Message	Date
Johan T. Halseth	4ac3c171ec	autopilot/choice: avoid costly map allocations ... This commit makes the weightedChoice algorithm take a slice of weights instead of a map of node scores. This let us avoid costly map allocation and iteration. In addition we make the chooseN algorithm keep track of the remaining nodes by keeping a slice of weights through its entire run, similarly avoiding costly map allocation and iteration. In total this brings the runtime of the TestChooseNSample testcase down from ~73s to ~3.6s.	2018-12-19 08:27:34 +01:00
Johan T. Halseth	a202860ce1	autopilot: make n uint32 in chooseN ... To avoid negative values being input, as it doesn't really make sense.	2018-12-19 08:27:34 +01:00
Johan T. Halseth	40db2dd5a5	autopilot/choice: return ErrNoPositive in case no choice can be made	2018-12-10 13:53:36 +01:00
Johan T. Halseth	f1e8c8d5b5	autopilot/agent: move choice algorithms to new file choice.go	2018-12-10 13:53:31 +01:00