// ListVersions lists current versions, and current deleted
// versions returns error for unexpected entries.
// showPendingDeletes is set to true if ListVersions needs to list objects marked deleted
// but waiting to be replicated
func (x xlMetaV2) ListVersions(volume, path string, allParts bool) ([]FileInfo, error) {
	versions := make([]FileInfo, 0, len(x.versions))
	var err error

	var dst xlMetaV2Version

   *
   * <p>Collections with weak, soft, or phantom references are not supported. Each call to {@code
   * createCollection} should create a new instance.
   *
   * <p>The returned collection class determines whether duplicate key-value pairs are allowed.
   *
   * @return an empty collection of values
   */
  abstract Collection<V> createCollection();

  /**

labels.dict_stemmeroverride_details=Dict Stemmeroverride Details
labels.dict_stopwords_details=Dict Stopwords Details
labels.dict_synonym_details=Dict Synonym Details
labels.duplicate_host_details=Duplicate Host Details
labels.elevate_word_details=Elevate Word Details
labels.failure_url_details=Failure Url Details
labels.file_auth_details=File Auth Details
labels.file_config_details=File Config Details

	f := strings.Join(w.scope, ", ") + ", " + fmt.Sprintf(format, args...)
	if strings.Contains(f, "\n") {
		panic("feature contains newlines: " + f)
	}

	if _, dup := w.features[f]; dup {
		panic("duplicate feature inserted: " + f)
	}
	w.features[f] = true

	if verbose {
		log.Printf("feature: %s", f)
	}
}

func needApproval(filename string) bool {
	name := filepath.Base(filename)

}

// Metadata metadata items implemented to ensure XML marshaling works.
type Metadata struct {
	Items []struct {
		Key   string
		Value string
	}
}

// Set add items, duplicate items get replaced.
func (s *Metadata) Set(k, v string) {
	for i, item := range s.Items {
		if item.Key == k {
			s.Items[i] = struct {
				Key   string
				Value string
			}{
				Key:   k,

    }

    /*MNG-4010*/
    @Test
    void testDuplicateExclusionsDependency() throws Exception {
        PomTestWrapper pom = buildPom("duplicate-exclusions-dependency/sub");
        assertEquals(1, ((List<?>) pom.getValue("dependencies[1]/exclusions")).size());
    }

    /*MNG-4008*/
    @Test
    void testMultipleFilters() throws Exception {

    assertThat(stats.missCount()).isEqualTo(4);
    assertThat(stats.loadSuccessCount()).isEqualTo(4);
    assertThat(stats.loadExceptionCount()).isEqualTo(0);
    assertThat(stats.hitCount()).isEqualTo(3);

    // duplicate keys are ignored, and don't impact stats
    assertThat(cache.getAll(asList(4, 5))).containsExactly(4, 4, 5, 5);
    stats = cache.stats();
    assertThat(stats.missCount()).isEqualTo(5);

labels.dict_protwords_details=Dict Protwords 詳情
labels.dict_stemmeroverride_details=Dict Stemmeroverride 詳情
labels.dict_stopwords_details=Dict Stopwords 詳情
labels.dict_synonym_details=Dict Synonym 詳情
labels.duplicate_host_details=Duplicate Host 詳情
labels.elevate_word_details=Elevate Word 詳情
labels.failure_url_details=Failure Url 詳情
labels.file_auth_details=File Auth 詳情
labels.file_config_details=File Config 詳情
labels.group_details=Group 詳情

    // Note: Not all random access lists support set(). Additionally, it's possible
    // for a list to reject setting an element, such as when the list does not permit
    // duplicate elements. For both of those cases,  we need to fall back to a slower
    // implementation.
    int from = 0;
    int to = 0;

    for (; from < list.size(); from++) {
      T element = list.get(from);

    assertThat(stats.missCount()).isEqualTo(4);
    assertThat(stats.loadSuccessCount()).isEqualTo(4);
    assertThat(stats.loadExceptionCount()).isEqualTo(0);
    assertThat(stats.hitCount()).isEqualTo(3);

    // duplicate keys are ignored, and don't impact stats
    assertThat(cache.getAll(asList(4, 5))).containsExactly(4, 4, 5, 5);
    stats = cache.stats();
    assertThat(stats.missCount()).isEqualTo(5);