public static final class FeatureFilter.BySource extends Object implements OptimizableFilter
FeatureFilter.And, FeatureFilter.AnnotationContains, FeatureFilter.ByAncestor, FeatureFilter.ByAnnotation, FeatureFilter.ByAnnotationType, FeatureFilter.ByChild, FeatureFilter.ByClass, FeatureFilter.ByComponentName, FeatureFilter.ByDescendant, FeatureFilter.ByFeature, FeatureFilter.ByPairwiseScore, FeatureFilter.ByParent, FeatureFilter.BySequenceName, FeatureFilter.BySource, FeatureFilter.ByType, FeatureFilter.ContainedByLocation, FeatureFilter.FrameFilter, FeatureFilter.HasAnnotation, FeatureFilter.Not, FeatureFilter.OnlyChildren, FeatureFilter.OnlyDescendants, FeatureFilter.Or, FeatureFilter.OverlapsLocation, FeatureFilter.ShadowContainedByLocation, FeatureFilter.ShadowOverlapsLocation, FeatureFilter.StrandFilter
all, leaf, none, top_level
Constructor and Description |
---|
FeatureFilter.BySource(String source)
Create a BySource filter that filters in all features which have sources
equal to source.
|
Modifier and Type | Method and Description |
---|---|
boolean |
accept(Feature f)
This method determines whether a feature is to be accepted.
|
boolean |
equals(Object o) |
String |
getSource() |
int |
hashCode() |
boolean |
isDisjoint(FeatureFilter filt)
Returns true if this filter is disjoint from filt - that is, there is no
Feature that is accepted by both filters.
|
boolean |
isProperSubset(FeatureFilter sup)
Returns true if this filter is a proper subset of sup - that is, for every
feature that matches this, it also matches sup.
|
String |
toString() |
public FeatureFilter.BySource(String source)
source
- the String to match source fields againstpublic boolean accept(Feature f)
FeatureFilter
accept
in interface FeatureFilter
f
- the Feature to evaluatepublic boolean isProperSubset(FeatureFilter sup)
OptimizableFilter
isProperSubset
in interface OptimizableFilter
sup
- the potential super setpublic boolean isDisjoint(FeatureFilter filt)
OptimizableFilter
isDisjoint
in interface OptimizableFilter
Copyright © 2014 BioJava. All rights reserved.