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;
57 * original NCList-based IntervalStore
59 private final static int INTERVAL_STORE_NCLIST = 0;
62 * linked-list deferred-sort IntervalStore
64 private final static int INTERVAL_STORE_NOCLKIST = 1;
67 * no-IntervalStore option for JavaScript
69 private final static int INTERVAL_STORE_LINKED_LIST = -1;
71 private final int INTERVAL_STORE_MODE = (
72 // can be set differently for testing, but default is
73 // LINKED_LIST for JalviewJS and NCLIST for Java
75 INTERVAL_STORE_LINKED_LIST //
76 : INTERVAL_STORE_NCLIST//
82 public SequenceFeatures()
85 * use a TreeMap so that features are returned in alphabetical order of type
86 * ? wrap as a synchronized map for add and delete operations
88 // featureStore = Collections
89 // .synchronizedSortedMap(new TreeMap<String, FeatureStoreI>());
90 featureStore = new TreeMap<>();
94 * Constructor given a list of features
96 public SequenceFeatures(List<SequenceFeature> features)
101 for (SequenceFeature feature : features)
112 public boolean add(SequenceFeature sf)
114 String type = sf.getType();
117 System.err.println("Feature type may not be null: " + sf.toString());
121 if (featureStore.get(type) == null)
123 featureStore.put(type, newFeatureStore());
125 return featureStore.get(type).addFeature(sf);
128 private FeatureStoreI newFeatureStore()
130 switch (INTERVAL_STORE_MODE)
133 case INTERVAL_STORE_NCLIST:
134 return new FeatureStoreImpl(true);
135 case INTERVAL_STORE_NOCLKIST:
136 return new FeatureStoreImpl(false);
137 case INTERVAL_STORE_LINKED_LIST:
138 return new FeatureStoreJS();
146 public List<SequenceFeature> findFeatures(int from, int to,
149 List<SequenceFeature> result = new ArrayList<>();
150 for (FeatureStoreI featureSet : varargToTypes(type))
152 // System.err.println("SF findFeature " + System.currentTimeMillis()
153 // + " " + from + " " + to + " "
154 // + featureSet.getPositionalFeatures().get(0).type);
156 result.addAll(featureSet.findOverlappingFeatures(from, to, null));
165 public List<SequenceFeature> getAllFeatures(String... type)
167 List<SequenceFeature> result = new ArrayList<>();
169 result.addAll(getPositionalFeatures(type));
171 result.addAll(getNonPositionalFeatures());
180 public List<SequenceFeature> getFeaturesByOntology(String... ontologyTerm)
182 if (ontologyTerm == null || ontologyTerm.length == 0)
184 return new ArrayList<>();
187 Set<String> featureTypes = getFeatureTypes(ontologyTerm);
188 if (featureTypes.isEmpty())
191 * no features of the specified type or any sub-type
193 return new ArrayList<>();
196 return getAllFeatures(
197 featureTypes.toArray(new String[featureTypes.size()]));
204 public int getFeatureCount(boolean positional, String... type)
208 for (FeatureStoreI featureSet : varargToTypes(type))
210 result += featureSet.getFeatureCount(positional);
219 public int getTotalFeatureLength(String... type)
223 for (FeatureStoreI featureSet : varargToTypes(type))
225 result += featureSet.getTotalFeatureLength();
234 public List<SequenceFeature> getPositionalFeatures(String... type)
236 List<SequenceFeature> result = new ArrayList<>();
238 for (FeatureStoreI featureSet : varargToTypes(type))
240 featureSet.getPositionalFeatures(result);
246 * A convenience method that converts a vararg for feature types to an
247 * Iterable over matched feature sets in key order
252 protected Iterable<FeatureStoreI> varargToTypes(String... type)
254 if (type == null || type.length == 0)
257 * no vararg parameter supplied - return all
259 return featureStore.values();
262 List<FeatureStoreI> types = new ArrayList<>();
263 List<String> args = Arrays.asList(type);
264 for (Entry<String, FeatureStoreI> featureType : featureStore.entrySet())
266 if (args.contains(featureType.getKey()))
268 types.add(featureType.getValue());
278 public List<SequenceFeature> getContactFeatures(String... type)
280 List<SequenceFeature> result = new ArrayList<>();
282 for (FeatureStoreI featureSet : varargToTypes(type))
284 featureSet.getContactFeatures(result);
293 public List<SequenceFeature> getNonPositionalFeatures(String... type)
295 List<SequenceFeature> result = new ArrayList<>();
297 for (FeatureStoreI featureSet : varargToTypes(type))
299 featureSet.getNonPositionalFeatures(result);
308 public boolean delete(SequenceFeature sf)
310 for (FeatureStoreI featureSet : featureStore.values())
312 if (featureSet.delete(sf))
324 public boolean hasFeatures()
326 for (FeatureStoreI featureSet : featureStore.values())
328 if (!featureSet.isEmpty())
340 public Set<String> getFeatureGroups(boolean positionalFeatures,
343 Set<String> groups = new HashSet<>();
345 for (FeatureStoreI featureSet : varargToTypes(type))
347 groups.addAll(featureSet.getFeatureGroups(positionalFeatures));
357 public Set<String> getFeatureTypesForGroups(boolean positionalFeatures,
360 Set<String> result = new HashSet<>();
362 for (Entry<String, FeatureStoreI> featureType : featureStore.entrySet())
364 Set<String> featureGroups = featureType.getValue()
365 .getFeatureGroups(positionalFeatures);
366 for (String group : groups)
368 if (featureGroups.contains(group))
371 * yes this feature type includes one of the query groups
373 result.add(featureType.getKey());
386 public Set<String> getFeatureTypes(String... soTerm)
388 Set<String> types = new HashSet<>();
389 for (Entry<String, FeatureStoreI> entry : featureStore.entrySet())
391 String type = entry.getKey();
392 if (!entry.getValue().isEmpty() && isOntologyTerm(type, soTerm))
401 * Answers true if the given type matches one of the specified terms (or is a
402 * sub-type of one in the Sequence Ontology), or if no terms are supplied.
403 * Answers false if filter terms are specified and the given term does not
410 protected boolean isOntologyTerm(String type, String... soTerm)
412 if (soTerm == null || soTerm.length == 0)
416 SequenceOntologyI so = SequenceOntologyFactory.getSequenceOntology();
417 for (String term : soTerm)
419 if (type.equals(term) || so.isA(type, term))
431 public float getMinimumScore(String type, boolean positional)
433 return featureStore.containsKey(type)
434 ? featureStore.get(type).getMinimumScore(positional)
442 public float getMaximumScore(String type, boolean positional)
444 return featureStore.containsKey(type)
445 ? featureStore.get(type).getMaximumScore(positional)
450 * A convenience method to sort features by start position ascending (if on
451 * forward strand), or end position descending (if on reverse strand)
454 * @param forwardStrand
456 public static void sortFeatures(List<? extends IntervalI> features,
457 final boolean forwardStrand)
459 IntervalI.sortIntervals(features, forwardStrand);
463 * {@inheritDoc} This method is 'semi-optimised': it only inspects features
464 * for types that include the specified group, but has to inspect every
465 * feature of those types for matching feature group. This is efficient unless
466 * a sequence has features that share the same type but are in different
467 * groups - an unlikely case.
469 * For example, if RESNUM feature is created with group = PDBID, then features
470 * would only be retrieved for those sequences associated with the target
474 public List<SequenceFeature> getFeaturesForGroup(boolean positional,
475 String group, String... type)
477 List<SequenceFeature> result = new ArrayList<>();
478 for (FeatureStoreI featureSet : varargToTypes(type))
480 if (featureSet.getFeatureGroups(positional).contains(group))
482 result.addAll(featureSet.getFeaturesForGroup(positional, group));
492 public boolean shiftFeatures(int fromPosition, int shiftBy)
494 boolean modified = false;
495 for (FeatureStoreI fs : featureStore.values())
497 modified |= fs.shiftFeatures(fromPosition, shiftBy);
506 public void deleteAll()
508 featureStore.clear();
512 * Simplified find for features associated with a given position.
514 * JavaScript set to not use IntervalI, but easily testable by setting false
517 * FeatureRenderer has checked already that featureStore does contain type.
519 * @author Bob Hanson 2019.07.30
522 public List<SequenceFeature> findFeatures(int pos, String type,
523 List<SequenceFeature> list)
525 FeatureStoreI fs = featureStore.get(type);
526 return fs.findOverlappingFeatures(pos, pos, list);
529 // Chrome; developer console closed
531 // BH 2019.08.01 useIntervalStore true, redraw false:
532 // Platform: timer mark 13.848 0.367 overviewrender 16000 pixels row:14
533 // Platform: timer mark 15.391 0.39 overviewrender 16000 pixels row:14
534 // Platform: timer mark 16.498 0.39 overviewrender 16000 pixels row:14
535 // Platform: timer mark 17.596 0.401 overviewrender 16000 pixels row:14
536 // Platform: timer mark 18.738 0.363 overviewrender 16000 pixels row:14
537 // Platform: timer mark 19.659 0.358 overviewrender 16000 pixels row:14
538 // Platform: timer mark 20.737 0.359 overviewrender 16000 pixels row:14
539 // Platform: timer mark 21.797 0.391 overviewrender 16000 pixels row:14
540 // Platform: timer mark 22.851 0.361 overviewrender 16000 pixels row:14
541 // Platform: timer mark 24.019 0.395 overviewrender 16000 pixels row:14
543 // BH 2019.08.01 useIntervalStore false, redraw false:
544 // Platform: timer mark 19.011 0.181 overviewrender 16000 pixels row:14
545 // Platform: timer mark 20.311 0.183 overviewrender 16000 pixels row:14
546 // Platform: timer mark 21.368 0.175 overviewrender 16000 pixels row:14
547 // Platform: timer mark 22.347 0.178 overviewrender 16000 pixels row:14
548 // Platform: timer mark 23.605 0.216 overviewrender 16000 pixels row:14
549 // Platform: timer mark 24.836 0.191 overviewrender 16000 pixels row:14
550 // Platform: timer mark 26.016 0.181 overviewrender 16000 pixels row:14
551 // Platform: timer mark 27.278 0.178 overviewrender 16000 pixels row:14
552 // Platform: timer mark 28.158 0.181 overviewrender 16000 pixels row:14
553 // Platform: timer mark 29.227 0.196 overviewrender 16000 pixels row:14
554 // Platform: timer mark 30.1 0.171 overviewrender 16000 pixels row:14
555 // Platform: timer mark 31.684 0.196 overviewrender 16000 pixels row:14
556 // Platform: timer mark 32.779 0.18 overviewrender 16000 pixels row:14
557 // Platform: timer mark 52.355 0.185 overviewrender 16000 pixels row:14
558 // Platform: timer mark 53.829 0.186 overviewrender 16000 pixels row:14
561 * @author Bob Hanson 2019.08.01
564 public boolean hasFeatures(String type)
566 return featureStore.containsKey(type);