2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $$Year-Rel$$ The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
21 package jalview.datamodel.features;
23 import jalview.datamodel.SequenceFeature;
24 import jalview.io.gff.SequenceOntologyFactory;
25 import jalview.io.gff.SequenceOntologyI;
26 import jalview.util.Platform;
28 import java.util.ArrayList;
29 import java.util.Arrays;
30 import java.util.Collections;
31 import java.util.HashSet;
32 import java.util.List;
34 import java.util.Map.Entry;
36 import java.util.TreeMap;
38 import intervalstore.api.IntervalI;
41 * A class that stores sequence features in a way that supports efficient
42 * querying by type and location (overlap). Intended for (but not limited to)
43 * storage of features for one sequence.
48 public class SequenceFeatures implements SequenceFeaturesI
51 * map from feature type to structured store of features for that type
52 * null types are permitted (but not a good idea!)
54 private Map<String, FeatureStore> featureStore;
59 public SequenceFeatures()
62 * use a TreeMap so that features are returned in alphabetical order of type
63 * ? wrap as a synchronized map for add and delete operations
65 // featureStore = Collections
66 // .synchronizedSortedMap(new TreeMap<String, FeatureStore>());
67 featureStore = new TreeMap<>();
71 * Constructor given a list of features
73 public SequenceFeatures(List<SequenceFeature> features)
78 for (SequenceFeature feature : features)
89 public boolean add(SequenceFeature sf)
91 String type = sf.getType();
94 System.err.println("Feature type may not be null: " + sf.toString());
98 if (featureStore.get(type) == null)
100 featureStore.put(type, new FeatureStore());
102 return featureStore.get(type).addFeature(sf);
109 public List<SequenceFeature> findFeatures(int from, int to,
112 List<SequenceFeature> result = new ArrayList<>();
113 for (FeatureStore featureSet : varargToTypes(type))
115 // BH MUCH more efficient to pass the list
116 featureSet.findFeatures(from, to, result);
125 public List<SequenceFeature> getAllFeatures(String... type)
127 List<SequenceFeature> result = new ArrayList<>();
129 result.addAll(getPositionalFeatures(type));
131 result.addAll(getNonPositionalFeatures());
140 public List<SequenceFeature> getFeaturesByOntology(String... ontologyTerm)
142 if (ontologyTerm == null || ontologyTerm.length == 0)
144 return new ArrayList<>();
147 Set<String> featureTypes = getFeatureTypes(ontologyTerm);
148 if (featureTypes.isEmpty())
151 * no features of the specified type or any sub-type
153 return new ArrayList<>();
156 return getAllFeatures(featureTypes.toArray(new String[featureTypes
164 public int getFeatureCount(boolean positional, String... type)
168 for (FeatureStore featureSet : varargToTypes(type))
170 result += featureSet.getFeatureCount(positional);
179 public int getTotalFeatureLength(String... type)
183 for (FeatureStore featureSet : varargToTypes(type))
185 result += featureSet.getTotalFeatureLength();
194 public List<SequenceFeature> getPositionalFeatures(String... type)
196 List<SequenceFeature> result = new ArrayList<>();
198 for (FeatureStore featureSet : varargToTypes(type))
200 featureSet.getPositionalFeatures(result);
206 * A convenience method that converts a vararg for feature types to an
207 * Iterable over matched feature sets. If no types are specified, all feature
208 * sets are returned. If one or more types are specified, feature sets for
209 * those types are returned, preserving the order of the types.
214 protected Iterable<FeatureStore> varargToTypes(String... type)
216 if (type == null || type.length == 0)
219 * no vararg parameter supplied - return all
221 return featureStore.values();
224 List<FeatureStore> types = new ArrayList<>();
225 for (String theType : type)
227 if (theType != null && featureStore.containsKey(theType))
229 types.add(featureStore.get(theType));
239 public List<SequenceFeature> getContactFeatures(String... type)
241 List<SequenceFeature> result = new ArrayList<>();
243 for (FeatureStore featureSet : varargToTypes(type))
245 featureSet.getContactFeatures(result);
254 public List<SequenceFeature> getNonPositionalFeatures(String... type)
256 List<SequenceFeature> result = new ArrayList<>();
258 for (FeatureStore featureSet : varargToTypes(type))
260 featureSet.getNonPositionalFeatures(result);
269 public boolean delete(SequenceFeature sf)
271 for (FeatureStore featureSet : featureStore.values())
273 if (featureSet.delete(sf))
285 public boolean hasFeatures()
287 for (FeatureStore featureSet : featureStore.values())
289 if (!featureSet.isEmpty())
301 public Set<String> getFeatureGroups(boolean positionalFeatures,
304 // BH 2020.03.21 This is the set that orders the list of groups
305 // at the top of the FeatureSettings panel.
306 // In order to keep the same order as a Java HashSet, we must
307 // request that specifically. See Platform.
308 Set<String> groups = Platform.getJavaOrderedHashSet();
310 for (FeatureStore featureSet : varargToTypes(type))
312 groups.addAll(featureSet.getFeatureGroups(positionalFeatures));
322 public Set<String> getFeatureTypesForGroups(boolean positionalFeatures,
325 // BH 2020.03.21 This set is the one that sets the initial ordering for
326 // feature rendering. We set it to new HashSet<>(16,0.75) to force it to
327 // be backed by a Java hash-ordered HashMap instead of a JavaScript Map.
328 Set<String> result = Platform.getJavaOrderedHashSet();
330 for (Entry<String, FeatureStore> featureType : featureStore.entrySet())
332 Set<String> featureGroups = featureType.getValue().getFeatureGroups(
334 for (String group : groups)
336 if (featureGroups.contains(group))
339 * yes this feature type includes one of the query groups
341 result.add(featureType.getKey());
354 public Set<String> getFeatureTypes(String... soTerm)
356 Set<String> types = Platform.getJavaOrderedHashSet();
357 for (Entry<String, FeatureStore> entry : featureStore.entrySet())
359 String type = entry.getKey();
360 if (!entry.getValue().isEmpty() && isOntologyTerm(type, soTerm))
369 * Answers true if the given type matches one of the specified terms (or is a
370 * sub-type of one in the Sequence Ontology), or if no terms are supplied.
371 * Answers false if filter terms are specified and the given term does not
378 protected boolean isOntologyTerm(String type, String... soTerm)
380 if (soTerm == null || soTerm.length == 0)
384 SequenceOntologyI so = SequenceOntologyFactory.getSequenceOntology();
385 for (String term : soTerm)
387 if (type.equals(term) || so.isA(type, term))
399 public float getMinimumScore(String type, boolean positional)
401 return featureStore.containsKey(type) ? featureStore.get(type)
402 .getMinimumScore(positional) : Float.NaN;
409 public float getMaximumScore(String type, boolean positional)
411 return featureStore.containsKey(type) ? featureStore.get(type)
412 .getMaximumScore(positional) : Float.NaN;
416 * A convenience method to sort features by start position ascending (if on
417 * forward strand), or end position descending (if on reverse strand)
420 * @param forwardStrand
422 public static void sortFeatures(List<? extends IntervalI> features,
423 final boolean forwardStrand)
425 IntervalI.sortIntervals(features, forwardStrand);
429 * {@inheritDoc} This method is 'semi-optimised': it only inspects features
430 * for types that include the specified group, but has to inspect every
431 * feature of those types for matching feature group. This is efficient unless
432 * a sequence has features that share the same type but are in different
433 * groups - an unlikely case.
435 * For example, if RESNUM feature is created with group = PDBID, then features
436 * would only be retrieved for those sequences associated with the target
440 public List<SequenceFeature> getFeaturesForGroup(boolean positional,
441 String group, String... type)
443 List<SequenceFeature> result = new ArrayList<>();
444 for (FeatureStore featureSet : varargToTypes(type))
446 if (featureSet.getFeatureGroups(positional).contains(group))
448 result.addAll(featureSet.getFeaturesForGroup(positional, group));
458 public boolean shiftFeatures(int fromPosition, int shiftBy)
460 boolean modified = false;
461 for (FeatureStore fs : featureStore.values())
463 modified |= fs.shiftFeatures(fromPosition, shiftBy);
472 public void deleteAll()
474 featureStore.clear();
478 public List<SequenceFeature> findFeatures(int pos, String type,
479 List<SequenceFeature> list)
481 FeatureStore fs = featureStore.get(type);
484 return list == null ? new ArrayList<>() : list;
486 return fs.findFeatures(pos, pos, list);
490 public boolean hasFeatures(String type)
492 return featureStore.containsKey(type)
493 && !featureStore.get(type).isEmpty();