code: func (tab *Table) stuff(nodes []*Node) {
  outer:
  	for _, n := range nodes {
  		if n.ID == tab.self.ID {
  			continue // don't add self
  		}
  		bucket := tab.buckets[logdist(tab.self.sha, n.sha)]
  		for i := range bucket.entries {
  			if bucket.entries[i].ID == n.ID {
  				continue outer // already in bucket
  			}
  		}
  		if len(bucket.entries) < bucketSize {
  			bucket.entries = append(bucket.entries, n)
  			tab.count++
  			if tab.nodeAddedHook != nil {
  				tab.nodeAddedHook(n)
  			}
  		}
  	}
  }
docs: // stuff adds nodes the table to the end of their corresponding bucket
  // if the bucket is not full.