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.HashSet;
31 import java.util.List;
33 import java.util.Map.Entry;
35 import java.util.TreeMap;
37 import intervalstore.api.IntervalI;
40 * A class that stores sequence features in a way that supports efficient
41 * querying by type and location (overlap). Intended for (but not limited to)
42 * storage of features for one sequence.
47 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, FeatureStoreI> 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, FeatureStoreI>());
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, newFeatureStore());
102 return featureStore.get(type).addFeature(sf);
105 private FeatureStoreI newFeatureStore()
109 ? new FeatureStoreJS()
110 : new FeatureStoreImpl());
117 public List<SequenceFeature> findFeatures(int from, int to,
120 List<SequenceFeature> result = new ArrayList<>();
121 for (FeatureStoreI featureSet : varargToTypes(type))
123 // System.err.println("SF findFeature " + System.currentTimeMillis()
124 // + " " + from + " " + to + " "
125 // + featureSet.getPositionalFeatures().get(0).type);
127 result.addAll(featureSet.findOverlappingFeatures(from, to, null));
136 public List<SequenceFeature> getAllFeatures(String... type)
138 List<SequenceFeature> result = new ArrayList<>();
140 result.addAll(getPositionalFeatures(type));
142 result.addAll(getNonPositionalFeatures());
151 public List<SequenceFeature> getFeaturesByOntology(String... ontologyTerm)
153 if (ontologyTerm == null || ontologyTerm.length == 0)
155 return new ArrayList<>();
158 Set<String> featureTypes = getFeatureTypes(ontologyTerm);
159 if (featureTypes.isEmpty())
162 * no features of the specified type or any sub-type
164 return new ArrayList<>();
167 return getAllFeatures(
168 featureTypes.toArray(new String[featureTypes.size()]));
175 public int getFeatureCount(boolean positional, String... type)
179 for (FeatureStoreI featureSet : varargToTypes(type))
181 result += featureSet.getFeatureCount(positional);
190 public int getTotalFeatureLength(String... type)
194 for (FeatureStoreI featureSet : varargToTypes(type))
196 result += featureSet.getTotalFeatureLength();
205 public List<SequenceFeature> getPositionalFeatures(String... type)
207 List<SequenceFeature> result = new ArrayList<>();
209 for (FeatureStoreI featureSet : varargToTypes(type))
211 featureSet.getPositionalFeatures(result);
217 * A convenience method that converts a vararg for feature types to an
218 * Iterable over matched feature sets in key order
223 protected Iterable<FeatureStoreI> varargToTypes(String... type)
225 if (type == null || type.length == 0)
228 * no vararg parameter supplied - return all
230 return featureStore.values();
233 List<FeatureStoreI> types = new ArrayList<>();
234 List<String> args = Arrays.asList(type);
235 for (Entry<String, FeatureStoreI> featureType : featureStore.entrySet())
237 if (args.contains(featureType.getKey()))
239 types.add(featureType.getValue());
249 public List<SequenceFeature> getContactFeatures(String... type)
251 List<SequenceFeature> result = new ArrayList<>();
253 for (FeatureStoreI featureSet : varargToTypes(type))
255 featureSet.getContactFeatures(result);
264 public List<SequenceFeature> getNonPositionalFeatures(String... type)
266 List<SequenceFeature> result = new ArrayList<>();
268 for (FeatureStoreI featureSet : varargToTypes(type))
270 featureSet.getNonPositionalFeatures(result);
279 public boolean delete(SequenceFeature sf)
281 for (FeatureStoreI featureSet : featureStore.values())
283 if (featureSet.delete(sf))
295 public boolean hasFeatures()
297 for (FeatureStoreI featureSet : featureStore.values())
299 if (!featureSet.isEmpty())
311 public Set<String> getFeatureGroups(boolean positionalFeatures,
314 Set<String> groups = new HashSet<>();
316 for (FeatureStoreI featureSet : varargToTypes(type))
318 groups.addAll(featureSet.getFeatureGroups(positionalFeatures));
328 public Set<String> getFeatureTypesForGroups(boolean positionalFeatures,
331 Set<String> result = new HashSet<>();
333 for (Entry<String, FeatureStoreI> featureType : featureStore.entrySet())
335 Set<String> featureGroups = featureType.getValue()
336 .getFeatureGroups(positionalFeatures);
337 for (String group : groups)
339 if (featureGroups.contains(group))
342 * yes this feature type includes one of the query groups
344 result.add(featureType.getKey());
357 public Set<String> getFeatureTypes(String... soTerm)
359 Set<String> types = new HashSet<>();
360 for (Entry<String, FeatureStoreI> entry : featureStore.entrySet())
362 String type = entry.getKey();
363 if (!entry.getValue().isEmpty() && isOntologyTerm(type, soTerm))
372 * Answers true if the given type matches one of the specified terms (or is a
373 * sub-type of one in the Sequence Ontology), or if no terms are supplied.
374 * Answers false if filter terms are specified and the given term does not
381 protected boolean isOntologyTerm(String type, String... soTerm)
383 if (soTerm == null || soTerm.length == 0)
387 SequenceOntologyI so = SequenceOntologyFactory.getSequenceOntology();
388 for (String term : soTerm)
390 if (type.equals(term) || so.isA(type, term))
402 public float getMinimumScore(String type, boolean positional)
404 return featureStore.containsKey(type)
405 ? featureStore.get(type).getMinimumScore(positional)
413 public float getMaximumScore(String type, boolean positional)
415 return featureStore.containsKey(type)
416 ? featureStore.get(type).getMaximumScore(positional)
421 * A convenience method to sort features by start position ascending (if on
422 * forward strand), or end position descending (if on reverse strand)
425 * @param forwardStrand
427 public static void sortFeatures(List<? extends IntervalI> features,
428 final boolean forwardStrand)
430 IntervalI.sortIntervals(features, forwardStrand);
434 * {@inheritDoc} This method is 'semi-optimised': it only inspects features
435 * for types that include the specified group, but has to inspect every
436 * feature of those types for matching feature group. This is efficient unless
437 * a sequence has features that share the same type but are in different
438 * groups - an unlikely case.
440 * For example, if RESNUM feature is created with group = PDBID, then features
441 * would only be retrieved for those sequences associated with the target
445 public List<SequenceFeature> getFeaturesForGroup(boolean positional,
446 String group, String... type)
448 List<SequenceFeature> result = new ArrayList<>();
449 for (FeatureStoreI featureSet : varargToTypes(type))
451 if (featureSet.getFeatureGroups(positional).contains(group))
453 result.addAll(featureSet.getFeaturesForGroup(positional, group));
463 public boolean shiftFeatures(int fromPosition, int shiftBy)
465 boolean modified = false;
466 for (FeatureStoreI fs : featureStore.values())
468 modified |= fs.shiftFeatures(fromPosition, shiftBy);
477 public void deleteAll()
479 featureStore.clear();
483 * Simplified find for features associated with a given position.
485 * JavaScript set to not use IntervalI, but easily testable by setting false
488 * FeatureRenderer has checked already that featureStore does contain type.
490 * @author Bob Hanson 2019.07.30
493 public List<SequenceFeature> findFeatures(int pos, String type,
494 List<SequenceFeature> list)
496 FeatureStoreI fs = featureStore.get(type);
497 return fs.findOverlappingFeatures(pos, pos, list);
500 // Chrome; developer console closed
502 // BH 2019.08.01 useIntervalStore true, redraw false:
503 // Platform: timer mark 13.848 0.367 overviewrender 16000 pixels row:14
504 // Platform: timer mark 15.391 0.39 overviewrender 16000 pixels row:14
505 // Platform: timer mark 16.498 0.39 overviewrender 16000 pixels row:14
506 // Platform: timer mark 17.596 0.401 overviewrender 16000 pixels row:14
507 // Platform: timer mark 18.738 0.363 overviewrender 16000 pixels row:14
508 // Platform: timer mark 19.659 0.358 overviewrender 16000 pixels row:14
509 // Platform: timer mark 20.737 0.359 overviewrender 16000 pixels row:14
510 // Platform: timer mark 21.797 0.391 overviewrender 16000 pixels row:14
511 // Platform: timer mark 22.851 0.361 overviewrender 16000 pixels row:14
512 // Platform: timer mark 24.019 0.395 overviewrender 16000 pixels row:14
514 // BH 2019.08.01 useIntervalStore false, redraw false:
515 // Platform: timer mark 19.011 0.181 overviewrender 16000 pixels row:14
516 // Platform: timer mark 20.311 0.183 overviewrender 16000 pixels row:14
517 // Platform: timer mark 21.368 0.175 overviewrender 16000 pixels row:14
518 // Platform: timer mark 22.347 0.178 overviewrender 16000 pixels row:14
519 // Platform: timer mark 23.605 0.216 overviewrender 16000 pixels row:14
520 // Platform: timer mark 24.836 0.191 overviewrender 16000 pixels row:14
521 // Platform: timer mark 26.016 0.181 overviewrender 16000 pixels row:14
522 // Platform: timer mark 27.278 0.178 overviewrender 16000 pixels row:14
523 // Platform: timer mark 28.158 0.181 overviewrender 16000 pixels row:14
524 // Platform: timer mark 29.227 0.196 overviewrender 16000 pixels row:14
525 // Platform: timer mark 30.1 0.171 overviewrender 16000 pixels row:14
526 // Platform: timer mark 31.684 0.196 overviewrender 16000 pixels row:14
527 // Platform: timer mark 32.779 0.18 overviewrender 16000 pixels row:14
528 // Platform: timer mark 52.355 0.185 overviewrender 16000 pixels row:14
529 // Platform: timer mark 53.829 0.186 overviewrender 16000 pixels row:14
532 * @author Bob Hanson 2019.08.01
535 public boolean hasFeatures(String type)
537 return featureStore.containsKey(type);