pairing

Documentation

Index

• type Alpha
  • func (ap Alpha) Pair(p *pop.Population, populated int) [][]int
• type Method
• type Random
  • func (rp Random) Pair(p *pop.Population, populated int) [][]int
• type ValIndexHeap
  • func (h ValIndexHeap) Len() int
  • func (h ValIndexHeap) Less(i, j int) bool
  • func (h *ValIndexHeap) Pop() interface{}
  • func (h *ValIndexHeap) Push(x interface{})
  • func (h ValIndexHeap) Swap(i, j int)

Types

type Alpha

type Alpha struct {
	AlphaCount int
}

Alpha pairing makes sure every new child has at least one parent who was one of the best of the previous generation.

func (Alpha) Pair

func (ap Alpha) Pair(p *pop.Population, populated int) [][]int

type Method

type Method interface {
	Pair(p *pop.Population, populated int) [][]int
}

type Random

type Random struct{}

func (Random) Pair

func (rp Random) Pair(p *pop.Population, populated int) [][]int

type ValIndexHeap

type ValIndexHeap [][2]int

The first element in each heap node is the value of that node, and the second is the index that value represents in some external structure.

func (ValIndexHeap) Len

func (h ValIndexHeap) Len() int

func (ValIndexHeap) Less

func (h ValIndexHeap) Less(i, j int) bool

func (*ValIndexHeap) Pop

func (h *ValIndexHeap) Pop() interface{}

func (*ValIndexHeap) Push

func (h *ValIndexHeap) Push(x interface{})

func (ValIndexHeap) Swap

func (h ValIndexHeap) Swap(i, j int)