code: func (s Store) GetAll(pattern string) (KVPairs, error) {
  	ks := make(KVPairs, 0)
  	s.RLock()
  	defer s.RUnlock()
  	for _, kv := range s.m {
  		m, err := path.Match(pattern, kv.Key)
  		if err != nil {
  			return nil, err
  		}
  		if m {
  			ks = append(ks, kv)
  		}
  	}
  	if len(ks) == 0 {
  		return ks, nil
  	}
  	sort.Sort(ks)
  	return ks, nil
  }
docs: // GetAll returns a KVPair for all nodes with keys matching pattern.
  // The syntax of patterns is the same as in path.Match.