3 * Copyright (C) 2007 EDIT
4 * European Distributed Institute of Taxonomy
5 * http://www.e-taxonomy.eu
7 * The contents of this file are subject to the Mozilla Public License Version 1.1
8 * See LICENSE.TXT at the top of this package for the full license terms.
11 package eu
.etaxonomy
.taxeditor
.store
;
13 import java
.util
.ArrayList
;
14 import java
.util
.Arrays
;
15 import java
.util
.Collections
;
16 import java
.util
.Comparator
;
17 import java
.util
.HashSet
;
18 import java
.util
.List
;
21 import eu
.etaxonomy
.cdm
.api
.service
.ITermService
;
22 import eu
.etaxonomy
.cdm
.model
.common
.DefinedTermBase
;
23 import eu
.etaxonomy
.cdm
.model
.common
.MarkerType
;
24 import eu
.etaxonomy
.cdm
.model
.description
.AbsenceTerm
;
25 import eu
.etaxonomy
.cdm
.model
.description
.Feature
;
26 import eu
.etaxonomy
.cdm
.model
.description
.PresenceAbsenceTermBase
;
27 import eu
.etaxonomy
.cdm
.model
.description
.PresenceTerm
;
28 import eu
.etaxonomy
.cdm
.model
.name
.Rank
;
29 import eu
.etaxonomy
.cdm
.model
.taxon
.TaxonRelationshipType
;
30 import eu
.etaxonomy
.taxeditor
.model
.DefaultTermComparator
;
31 import eu
.etaxonomy
.taxeditor
.model
.TaxonRelationshipTypeInverseContainer
;
32 import eu
.etaxonomy
.taxeditor
.preference
.PreferencesUtil
;
35 * All terms may be accessed through this store.
36 * Note: This is for internal use. When using vocabularies in the UI, try to use the preferred terms from
43 public class TermStore
{
46 * Returns an alphabetically sorted list of terms (anything that extends {@link DefinedTermBase}) of the given type currently available in the system.
48 * @param clazz a class that inherits from {@link DefinedTermBase}
49 * @return an alphabetically sorted list of terms
51 public static <TERM
extends DefinedTermBase
> List
<TERM
> getTerms(Class
<TERM
> clazz
){
52 return getTerms(clazz
, null, true);
56 * Returns a list of terms of the given type currently available in the system.
57 * If <code>filtered</code> is set to <code>true</code>, all terms for certain types will be
58 * gathered from edge cases.
60 * @param clazz a class that inherits from {@link DefinedTermBase}
61 * @param comparator a {@link Comparator} that defines the sorting algorithm. If set to null, {@link DefaultTermComparator} will be used
62 * @param filtered if set to true, some terms are filtered from the result (according to definition in {@link ITermStoreEdgeCase}s)
63 * @return a sorted list of terms
65 public static <TERM
extends DefinedTermBase
> List
<TERM
> getTerms(Class
<TERM
> clazz
, Comparator
<TERM
> comparator
, boolean filtered
){
66 List
<TERM
> terms
= new ArrayList
<TERM
>();
68 ITermStoreEdgeCase
<TERM
> edgeCase
= getEdgeCase(clazz
);
69 if(filtered
&& edgeCase
!= null){
70 terms
= edgeCase
.getTerms();
72 terms
= getTermsFromService(clazz
, comparator
);
85 private static <T
extends DefinedTermBase
> List
<T
> getTermsFromService(Class
<T
> termClass
, Comparator
<T
> comparator
){
86 if (comparator
== null){
87 comparator
= new DefaultTermComparator
<T
>();
90 List
<T
> terms
= CdmStore
.getService(ITermService
.class).listByTermClass(termClass
, null, null, null, null);
91 Collections
.sort(terms
, comparator
);
96 * @param term a {@link eu.etaxonomy.cdm.model.common.DefinedTermBase} object.
98 public static void saveTerm(DefinedTermBase term
){
99 CdmStore
.getService(ITermService
.class).saveOrUpdate(term
);
105 * @param selected a {@link eu.etaxonomy.cdm.model.common.DefinedTermBase} object.
107 public static void delete(DefinedTermBase selected
) {
108 CdmStore
.getService(ITermService
.class).delete(selected
);
112 * Save a vacabulary to data store
114 * @param term a {@link eu.etaxonomy.cdm.model.common.DefinedTermBase} object.
116 public static void updateVocabulary(DefinedTermBase term
) {
117 CdmStore
.getService(ITermService
.class).saveOrUpdate(term
);
121 * Handingling of special cases
124 private static Set
<ITermStoreEdgeCase
<?
extends DefinedTermBase
>> termStoreEdgeCases
= new HashSet
<ITermStoreEdgeCase
<?
extends DefinedTermBase
>>();
127 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<Feature
>() {
130 public Class
<Feature
> getTermClass() {
131 return Feature
.class;
135 public List
<Feature
> getTerms() {
136 List
<Feature
> features
= TermStore
.getTermsFromService(Feature
.class, null);
137 features
.remove(Feature
.IMAGE());
141 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<MarkerType
>(){
144 public Class
<MarkerType
> getTermClass() {
145 return MarkerType
.class;
149 public List
<MarkerType
> getTerms() {
150 // filter out non technical markers
151 List
<MarkerType
> nonTechnicalMarkerTypes
= new ArrayList
<MarkerType
>();
152 List
<MarkerType
> markerTypes
= TermStore
.getTermsFromService(MarkerType
.class, null);
154 for (Object type
: markerTypes
) {
155 if (((MarkerType
) type
).isTechnical() == false) {
156 nonTechnicalMarkerTypes
.add((MarkerType
) type
);
160 return nonTechnicalMarkerTypes
;
164 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<Rank
>() {
167 public Class
<Rank
> getTermClass() {
172 public List
<Rank
> getTerms() {
173 if(PreferencesUtil
.getSortRanksHierarchichally()){
174 return TermStore
.getTermsFromService(Rank
.class, new Comparator
<Rank
>(){
177 public int compare(Rank o1
, Rank o2
) {
178 return o1
.compareTo(o2
);
183 return TermStore
.getTermsFromService(Rank
.class, null);
188 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<PresenceAbsenceTermBase
>() {
191 public Class
<PresenceAbsenceTermBase
> getTermClass() {
192 return PresenceAbsenceTermBase
.class;
196 public List
<PresenceAbsenceTermBase
> getTerms() {
197 List presenceAbsenceTerms
= TermStore
.getTermsFromService(PresenceTerm
.class, null);
198 presenceAbsenceTerms
.addAll(TermStore
.getTermsFromService(AbsenceTerm
.class, null));
200 return presenceAbsenceTerms
;
203 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<TaxonRelationshipTypeInverseContainer
>() {
206 public Class
<TaxonRelationshipTypeInverseContainer
> getTermClass() {
207 return TaxonRelationshipTypeInverseContainer
.class;
211 public List
<TaxonRelationshipTypeInverseContainer
> getTerms() {
212 List
<TaxonRelationshipType
> excludeTaxonRelationshipTypes
= Arrays
.asList(new TaxonRelationshipType
[]{
213 TaxonRelationshipType
.TAXONOMICALLY_INCLUDED_IN(),
214 TaxonRelationshipType
.MISAPPLIED_NAME_FOR(),
215 TaxonRelationshipType
.ALL_RELATIONSHIPS()
218 List
<TaxonRelationshipTypeInverseContainer
> relationshipTypeInverseContainers
= new ArrayList
<TaxonRelationshipTypeInverseContainer
>();
220 List
<TaxonRelationshipType
> relationshipTypes
= TermStore
.getTerms(TaxonRelationshipType
.class);
222 relationshipTypes
.removeAll(excludeTaxonRelationshipTypes
);
224 for (TaxonRelationshipType relationshipType
: relationshipTypes
){
225 if(!relationshipType
.isSymmetric()){
226 TaxonRelationshipTypeInverseContainer inverseContainer
= new TaxonRelationshipTypeInverseContainer(relationshipType
, true);
227 relationshipTypeInverseContainers
.add(inverseContainer
);
229 TaxonRelationshipTypeInverseContainer container
= new TaxonRelationshipTypeInverseContainer(relationshipType
, false);
230 relationshipTypeInverseContainers
.add(container
);
233 return relationshipTypeInverseContainers
;
238 private static <T
extends DefinedTermBase
> ITermStoreEdgeCase
<T
> getEdgeCase(Class
<T
> termClass
) {
240 for (ITermStoreEdgeCase termStoreEdgeCase
: termStoreEdgeCases
){
241 if (termStoreEdgeCase
.getTermClass().equals(termClass
)){
242 return termStoreEdgeCase
;
249 private interface ITermStoreEdgeCase
<TERM
> {
251 public abstract Class
<TERM
> getTermClass();
253 public abstract List
<TERM
> getTerms();