func (x ExoKin) Join() []KinXID {
	m := make(map[lang.ReceiverID]KinXID)
	for i := 0; i < Spread; i++ {
		peerXID := x.Walk(Depth)
		if XID(peerXID).IsNil() {
			continue
		}
		if _, ok := m[peerXID.ID]; ok {
			// Duplicate
			continue
		}
		m[peerXID.ID] = peerXID
	}
	r := make([]KinXID, 0, len(m))
	for _, peerXID := range m {
		r = append(r, peerXID)
	}
	return r
}
// Join returns an initial set of peers that the joining kin should use as initial entry into the kin system.
Join returns an initial set of peers that the joining kin should use as initial entry into the kin system.
// Join returns an initial set of peers that the joining kin should use as initial entry into the kin system .
func (x ExoKin) Join() []KinXID {
	m := make(map[lang.ReceiverID]KinXID)
	for i := 0; i < Spread; i++ {
		peerXID := x.Walk(Depth)
		if XID(peerXID).IsNil() {
			continue
		}
		if _, ok := m[peerXID.ID]; ok {
			continue
		}
		m[peerXID.ID] = peerXID
	}
	r := make([]KinXID, 0, len(m))
	for _, peerXID := range m {
		r = append(r, peerXID)
	}
	return r
}
func ( x ExoKin ) Join ( ) [ ] KinXID { m := make ( map [ lang . ReceiverID ] KinXID ) for i := 0 ; i < Spread ; i ++ { peerXID := x . Walk ( Depth ) if XID ( peerXID ) . IsNil ( ) { continue } if _ , ok := m [ peerXID . ID ] ; ok { continue } m [ peerXID . ID ] = peerXID } r := make ( [ ] KinXID , 0 , len ( m ) ) for _ , peerXID := range m { r = append ( r , peerXID ) } return r }
Join returns an initial set of peers that the joining kin should use as initial entry into the kin system.
Join returns an initial set of peers that the joining kin should use as initial entry into the kin system .
// Duplicate