func (p *Part) BreadthMatchAll(matcher PartMatcher) []*Part {
	q := list.New()
	q.PushBack(p)

	matches := make([]*Part, 0, 10)

	// Push children onto queue and attempt to match in that order
	for q.Len() > 0 {
		e := q.Front()
		p := e.Value.(*Part)
		if matcher(p) {
			matches = append(matches, p)
		}
		q.Remove(e)
		c := p.FirstChild
		for c != nil {
			q.PushBack(c)
			c = c.NextSibling
		}
	}

	return matches
}
func (p *Part) BreadthMatchAll(matcher PartMatcher) []*Part {
	q := list.New()
	q.PushBack(p)

	matches := make([]*Part, 0, 10)

	// Push children onto queue and attempt to match in that order
	for q.Len() > 0 {
		e := q.Front()
		p := e.Value.(*Part)
		if matcher(p) {
			matches = append(matches, p)
		}
		q.Remove(e)
		c := p.FirstChild
		for c != nil {
			q.PushBack(c)
			c = c.NextSibling
		}
	}

	return matches
}
func ( p * Part ) BreadthMatchAll ( matcher PartMatcher ) [ ] * Part { q := list . New ( ) q . PushBack ( p ) matches := make ( [ ] * Part , 0 , 10 ) // Push children onto queue and attempt to match in that order for q . Len ( ) > 0 { e := q . Front ( ) p := e . Value . ( * Part ) if matcher ( p ) { matches = append ( matches , p ) } q . Remove ( e ) c := p . FirstChild for c != nil { q . PushBack ( c ) c = c . NextSibling } } return matches }
// BreadthMatchAll performs a breadth first search of the Part tree and returns all parts that cause
// the given matcher to return true
BreadthMatchAll performs a breadth first search of the Part tree and returns all parts that cause the given matcher to return true