1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
/*******************************************************************************
* Copyright (c) 2008-2010 Sonatype, Inc.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Sonatype, Inc. - initial API and implementation
*******************************************************************************/
package org.eclipse.m2e.core.internal.index.nexus;
import java.io.File;
import java.util.Collection;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;
import org.eclipse.core.runtime.CoreException;
import org.eclipse.m2e.core.embedder.ArtifactKey;
import org.eclipse.m2e.core.internal.index.IIndex;
import org.eclipse.m2e.core.internal.index.IndexedArtifact;
import org.eclipse.m2e.core.internal.index.IndexedArtifactFile;
import org.eclipse.m2e.core.internal.index.SearchExpression;
/**
* CompositeIndex
*
* @author igor
*/
public class CompositeIndex implements IIndex {
private List<IIndex> indexes;
public CompositeIndex(List<IIndex> indexes) {
this.indexes = indexes;
}
public IndexedArtifactFile getIndexedArtifactFile(ArtifactKey artifact) throws CoreException {
for(IIndex index : indexes) {
IndexedArtifactFile aif = index.getIndexedArtifactFile(artifact);
if(aif != null) {
// first one wins
return aif;
}
}
// did not find anything
return null;
}
public IndexedArtifactFile identify(File file) throws CoreException {
for(IIndex index : indexes) {
IndexedArtifactFile aif = index.identify(file);
if(aif != null) {
// first one wins
return aif;
}
}
// did not find anything
return null;
}
public Collection<IndexedArtifact> find(SearchExpression groupId, SearchExpression artifactId,
SearchExpression version, SearchExpression packaging) throws CoreException {
Set<IndexedArtifact> result = new TreeSet<IndexedArtifact>();
for(IIndex index : indexes) {
Collection<IndexedArtifact> findResults = index.find(groupId, artifactId, version, packaging);
if(findResults != null) {
result.addAll(findResults);
}
}
return result;
}
public Collection<IndexedArtifact> find(Collection<SearchExpression> groupId,
Collection<SearchExpression> artifactId, Collection<SearchExpression> version,
Collection<SearchExpression> packaging) throws CoreException {
Set<IndexedArtifact> result = new TreeSet<IndexedArtifact>();
for(IIndex index : indexes) {
Collection<IndexedArtifact> findResults = index.find(groupId, artifactId, version, packaging);
if(findResults != null) {
result.addAll(findResults);
}
}
return result;
}
public Map<String, IndexedArtifact> search(SearchExpression term, String searchType) throws CoreException {
Map<String, IndexedArtifact> result = new TreeMap<String, IndexedArtifact>();
for(IIndex index : indexes) {
Map<String, IndexedArtifact> iresult = index.search(term, searchType);
if(iresult != null) {
result.putAll(iresult);
}
}
return result;
}
public Map<String, IndexedArtifact> search(SearchExpression term, String searchType, int classifier)
throws CoreException {
Map<String, IndexedArtifact> result = new TreeMap<String, IndexedArtifact>();
for(IIndex index : indexes) {
Map<String, IndexedArtifact> iresult = index.search(term, searchType, classifier);
if(iresult != null) {
result.putAll(iresult);
}
}
return result;
}
}
|
