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
.api
.service
.exception
.ReferencedObjectUndeletableException
;
23 import eu
.etaxonomy
.cdm
.model
.common
.DefinedTermBase
;
24 import eu
.etaxonomy
.cdm
.model
.common
.MarkerType
;
25 import eu
.etaxonomy
.cdm
.model
.description
.AbsenceTerm
;
26 import eu
.etaxonomy
.cdm
.model
.description
.Feature
;
27 import eu
.etaxonomy
.cdm
.model
.description
.PresenceAbsenceTermBase
;
28 import eu
.etaxonomy
.cdm
.model
.description
.PresenceTerm
;
29 import eu
.etaxonomy
.cdm
.model
.name
.Rank
;
30 import eu
.etaxonomy
.cdm
.model
.taxon
.TaxonRelationshipType
;
31 import eu
.etaxonomy
.taxeditor
.model
.DefaultTermComparator
;
32 import eu
.etaxonomy
.taxeditor
.model
.TaxonRelationshipTypeInverseContainer
;
33 import eu
.etaxonomy
.taxeditor
.preference
.PreferencesUtil
;
36 * All terms may be accessed through this store.
37 * Note: This is for internal use. When using vocabularies in the UI, try to use the preferred terms from
44 public class TermStore
{
47 * Returns an alphabetically sorted list of terms (anything that extends {@link DefinedTermBase}) of the given type currently available in the system.
49 * @param clazz a class that inherits from {@link DefinedTermBase}
50 * @return an alphabetically sorted list of terms
52 public static <TERM
extends DefinedTermBase
> List
<TERM
> getTerms(Class
<TERM
> clazz
){
53 return getTerms(clazz
, null, true);
57 * Returns a list of terms of the given type currently available in the system.
58 * If <code>filtered</code> is set to <code>true</code>, all terms for certain types will be
59 * gathered from edge cases.
61 * @param clazz a class that inherits from {@link DefinedTermBase}
62 * @param comparator a {@link Comparator} that defines the sorting algorithm. If set to null, {@link DefaultTermComparator} will be used
63 * @param filtered if set to true, some terms are filtered from the result (according to definition in {@link ITermStoreEdgeCase}s)
64 * @return a sorted list of terms
66 public static <TERM
extends DefinedTermBase
> List
<TERM
> getTerms(Class
<TERM
> clazz
, Comparator
<TERM
> comparator
, boolean filtered
){
67 List
<TERM
> terms
= new ArrayList
<TERM
>();
69 ITermStoreEdgeCase
<TERM
> edgeCase
= getEdgeCase(clazz
);
70 if(filtered
&& edgeCase
!= null){
71 terms
= edgeCase
.getTerms();
73 terms
= getTermsFromService(clazz
, comparator
);
86 private static <T
extends DefinedTermBase
> List
<T
> getTermsFromService(Class
<T
> termClass
, Comparator
<T
> comparator
){
87 if (comparator
== null){
88 comparator
= new DefaultTermComparator
<T
>();
91 List
<T
> terms
= CdmStore
.getService(ITermService
.class).listByTermClass(termClass
, null, null, null, null);
92 Collections
.sort(terms
, comparator
);
97 * @param term a {@link eu.etaxonomy.cdm.model.common.DefinedTermBase} object.
99 public static void saveTerm(DefinedTermBase term
){
100 CdmStore
.getService(ITermService
.class).saveOrUpdate(term
);
106 * @param selected a {@link eu.etaxonomy.cdm.model.common.DefinedTermBase} object.
107 * @throws ReferencedObjectUndeletableException
109 public static void delete(DefinedTermBase selected
) throws ReferencedObjectUndeletableException
{
110 CdmStore
.getService(ITermService
.class).delete(selected
);
114 * Save a vacabulary to data store
116 * @param term a {@link eu.etaxonomy.cdm.model.common.DefinedTermBase} object.
118 public static void updateVocabulary(DefinedTermBase term
) {
119 CdmStore
.getService(ITermService
.class).saveOrUpdate(term
);
123 * Handingling of special cases
126 private static Set
<ITermStoreEdgeCase
<?
extends DefinedTermBase
>> termStoreEdgeCases
= new HashSet
<ITermStoreEdgeCase
<?
extends DefinedTermBase
>>();
129 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<Feature
>() {
132 public Class
<Feature
> getTermClass() {
133 return Feature
.class;
137 public List
<Feature
> getTerms() {
138 List
<Feature
> features
= TermStore
.getTermsFromService(Feature
.class, null);
139 features
.remove(Feature
.IMAGE());
143 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<MarkerType
>(){
146 public Class
<MarkerType
> getTermClass() {
147 return MarkerType
.class;
151 public List
<MarkerType
> getTerms() {
152 // filter out non technical markers
153 List
<MarkerType
> nonTechnicalMarkerTypes
= new ArrayList
<MarkerType
>();
154 List
<MarkerType
> markerTypes
= TermStore
.getTermsFromService(MarkerType
.class, null);
156 for (Object type
: markerTypes
) {
157 if (((MarkerType
) type
).isTechnical() == false) {
158 nonTechnicalMarkerTypes
.add((MarkerType
) type
);
162 return nonTechnicalMarkerTypes
;
166 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<Rank
>() {
169 public Class
<Rank
> getTermClass() {
174 public List
<Rank
> getTerms() {
175 if(PreferencesUtil
.getSortRanksHierarchichally()){
176 return TermStore
.getTermsFromService(Rank
.class, new Comparator
<Rank
>(){
179 public int compare(Rank o1
, Rank o2
) {
180 return o1
.compareTo(o2
);
185 return TermStore
.getTermsFromService(Rank
.class, null);
190 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<PresenceAbsenceTermBase
>() {
193 public Class
<PresenceAbsenceTermBase
> getTermClass() {
194 return PresenceAbsenceTermBase
.class;
198 public List
<PresenceAbsenceTermBase
> getTerms() {
199 List presenceAbsenceTerms
= TermStore
.getTermsFromService(PresenceTerm
.class, null);
200 presenceAbsenceTerms
.addAll(TermStore
.getTermsFromService(AbsenceTerm
.class, null));
202 return presenceAbsenceTerms
;
205 termStoreEdgeCases
.add(new ITermStoreEdgeCase
<TaxonRelationshipTypeInverseContainer
>() {
208 public Class
<TaxonRelationshipTypeInverseContainer
> getTermClass() {
209 return TaxonRelationshipTypeInverseContainer
.class;
213 public List
<TaxonRelationshipTypeInverseContainer
> getTerms() {
214 List
<TaxonRelationshipType
> excludeTaxonRelationshipTypes
= Arrays
.asList(new TaxonRelationshipType
[]{
215 TaxonRelationshipType
.TAXONOMICALLY_INCLUDED_IN(),
216 TaxonRelationshipType
.MISAPPLIED_NAME_FOR(),
217 TaxonRelationshipType
.ALL_RELATIONSHIPS()
220 List
<TaxonRelationshipTypeInverseContainer
> relationshipTypeInverseContainers
= new ArrayList
<TaxonRelationshipTypeInverseContainer
>();
222 List
<TaxonRelationshipType
> relationshipTypes
= TermStore
.getTerms(TaxonRelationshipType
.class);
224 relationshipTypes
.removeAll(excludeTaxonRelationshipTypes
);
226 for (TaxonRelationshipType relationshipType
: relationshipTypes
){
227 if(!relationshipType
.isSymmetric()){
228 TaxonRelationshipTypeInverseContainer inverseContainer
= new TaxonRelationshipTypeInverseContainer(relationshipType
, true);
229 relationshipTypeInverseContainers
.add(inverseContainer
);
231 TaxonRelationshipTypeInverseContainer container
= new TaxonRelationshipTypeInverseContainer(relationshipType
, false);
232 relationshipTypeInverseContainers
.add(container
);
235 return relationshipTypeInverseContainers
;
240 private static <T
extends DefinedTermBase
> ITermStoreEdgeCase
<T
> getEdgeCase(Class
<T
> termClass
) {
242 for (ITermStoreEdgeCase termStoreEdgeCase
: termStoreEdgeCases
){
243 if (termStoreEdgeCase
.getTermClass().equals(termClass
)){
244 return termStoreEdgeCase
;
251 private interface ITermStoreEdgeCase
<TERM
> {
253 public abstract Class
<TERM
> getTermClass();
255 public abstract List
<TERM
> getTerms();