/**
*
- * Implements the SequenceI interface for a char[] based sequence object.
- *
- * @author $author$
- * @version $Revision$
+ * Implements the SequenceI interface for a char[] based sequence object
*/
public class Sequence extends ASequence implements SequenceI
{
{
if (name == null)
{
- System.err
- .println("POSSIBLE IMPLEMENTATION ERROR: null sequence name passed to constructor.");
+ System.err.println(
+ "POSSIBLE IMPLEMENTATION ERROR: null sequence name passed to constructor.");
name = "";
}
// Does sequence have the /start-end signature?
protected void initSeqFrom(SequenceI seq,
AlignmentAnnotation[] alAnnotation)
{
- char[] oseq = seq.getSequence();
- initSeqAndName(seq.getName(), Arrays.copyOf(oseq, oseq.length),
- seq.getStart(), seq.getEnd());
+ char[] oseq = seq.getSequence(); // returns a copy of the array
+ initSeqAndName(seq.getName(), oseq, seq.getStart(), seq.getEnd());
description = seq.getDescription();
if (seq != datasetSequence)
@Override
public char[] getSequence()
{
- return sequence;
+ // return sequence;
+ return sequence == null ? null : Arrays.copyOf(sequence,
+ sequence.length);
}
/*
*/
protected void updateCursor(int residuePos, int column, int startColumn)
{
- int endColumn = cursor == null ? 0 : cursor.lastColumnPosition;
+ /*
+ * preserve end residue column provided cursor was valid
+ */
+ int endColumn = isValidCursor(cursor) ? cursor.lastColumnPosition : 0;
if (residuePos == this.end)
{
endColumn = column;
}
/**
+ * {@inheritDoc}
+ */
+ @Override
+ public Range findPositions(int fromColumn, int toColumn)
+ {
+ if (toColumn < fromColumn || fromColumn < 1)
+ {
+ return null;
+ }
+
+ /*
+ * find the first non-gapped position, if any
+ */
+ int firstPosition = 0;
+ int col = fromColumn - 1;
+ int length = sequence.length;
+ while (col < length && col < toColumn)
+ {
+ if (!Comparison.isGap(sequence[col]))
+ {
+ firstPosition = findPosition(col++);
+ break;
+ }
+ col++;
+ }
+
+ if (firstPosition == 0)
+ {
+ return null;
+ }
+
+ /*
+ * find the last non-gapped position
+ */
+ int lastPosition = firstPosition;
+ while (col < length && col < toColumn)
+ {
+ if (!Comparison.isGap(sequence[col++]))
+ {
+ lastPosition++;
+ }
+ }
+
+ return new Range(firstPosition, lastPosition);
+ }
+
+ /**
* Returns an int array where indices correspond to each residue in the
* sequence and the element value gives its position in the alignment
*
@Override
public AlignmentAnnotation[] getAnnotation()
{
- return annotation == null ? null : annotation
- .toArray(new AlignmentAnnotation[annotation.size()]);
+ return annotation == null ? null
+ : annotation
+ .toArray(new AlignmentAnnotation[annotation.size()]);
}
@Override
private boolean _isNa;
- private long _seqhash = 0;
+ private int _seqhash = 0;
/**
* Answers false if the sequence is more than 85% nucleotide (ACGTU), else
{
if (datasetSequence == null)
{
- Sequence dsseq = new Sequence(getName(), AlignSeq.extractGaps(
- jalview.util.Comparison.GapChars, getSequenceAsString()),
+ Sequence dsseq = new Sequence(getName(),
+ AlignSeq.extractGaps(jalview.util.Comparison.GapChars,
+ getSequenceAsString()),
getStart(), getEnd());
datasetSequence = dsseq;
List<SequenceFeature> sfs = entry.getSequenceFeatures();
for (SequenceFeature feature : sfs)
{
- SequenceFeature sf[] = (mp != null) ? mp.locateFeature(feature)
+ SequenceFeature sf[] = (mp != null) ? mp.locateFeature(feature)
: new SequenceFeature[] { new SequenceFeature(feature) };
if (sf != null)
{
}
}
// whilst it looks like it is a primary ref, we also sanity check type
- if (DBRefUtils.getCanonicalName(DBRefSource.PDB).equals(
- DBRefUtils.getCanonicalName(ref.getSource())))
+ if (DBRefUtils.getCanonicalName(DBRefSource.PDB)
+ .equals(DBRefUtils.getCanonicalName(ref.getSource())))
{
// PDB dbrefs imply there should be a PDBEntry associated
// TODO: tighten PDB dbrefs
String... types)
{
int startPos = findPosition(fromColumn - 1); // convert base 1 to base 0
- int endPos = findPosition(toColumn - 1);
- // to trace / debug behaviour:
- // System.out
- // .println(String
- // .format("%s.findFeatures columns [%d-%d] positions [%d-%d] leaves cursor %s",
- // getName(), fromColumn, toColumn, startPos,
- // endPos, cursor));
- List<SequenceFeature> result = new ArrayList<>();
- if (datasetSequence != null)
- {
- result = datasetSequence.getFeatures().findFeatures(startPos, endPos,
- types);
- }
- else
- {
- result = sequenceFeatureStore.findFeatures(startPos, endPos, types);
- }
+ int endPos = fromColumn == toColumn ? startPos
+ : findPosition(toColumn - 1);
+
+ List<SequenceFeature> result = getFeatures().findFeatures(startPos,
+ endPos, types);
/*
- * if the start or end column is gapped, startPos or endPos may be to the
- * left or right, and we may have included adjacent or enclosing features;
+ * if end column is gapped, endPos may be to the right,
+ * and we may have included adjacent or enclosing features;
* remove any that are not enclosing, non-contact features
*/
- if (endPos > this.end || Comparison.isGap(sequence[fromColumn - 1])
- || Comparison.isGap(sequence[toColumn - 1]))
+ if (endPos > this.end || Comparison.isGap(sequence[toColumn - 1]))
{
ListIterator<SequenceFeature> it = result.listIterator();
while (it.hasNext())
{
SequenceFeature sf = it.next();
- int featureStartColumn = findIndex(sf.getBegin());
- int featureEndColumn = findIndex(sf.getEnd());
- boolean noOverlap = featureStartColumn > toColumn
- || featureEndColumn < fromColumn;
-
- /*
- * reject an 'enclosing' feature if it is actually a contact feature
- */
- if (sf.isContactFeature() && featureStartColumn < fromColumn
- && featureEndColumn > toColumn)
+ int sfBegin = sf.getBegin();
+ int sfEnd = sf.getEnd();
+ int featureStartColumn = findIndex(sfBegin);
+ if (featureStartColumn > toColumn)
{
- noOverlap = true;
+ it.remove();
}
- if (noOverlap)
+ else if (featureStartColumn < fromColumn)
{
- it.remove();
+ int featureEndColumn = sfEnd == sfBegin ? featureStartColumn
+ : findIndex(sfEnd);
+ if (featureEndColumn < fromColumn)
+ {
+ it.remove();
+ }
+ else if (featureEndColumn > toColumn && sf.isContactFeature())
+ {
+ /*
+ * remove an enclosing feature if it is a contact feature
+ */
+ it.remove();
+ }
}
}
}
{
changeCount++;
}
+
+ /**
+ * {@inheritDoc}
+ */
+ @Override
+ public int replace(char c1, char c2)
+ {
+ if (c1 == c2)
+ {
+ return 0;
+ }
+ int count = 0;
+ synchronized (sequence)
+ {
+ for (int c = 0; c < sequence.length; c++)
+ {
+ if (sequence[c] == c1)
+ {
+ sequence[c] = c2;
+ count++;
+ }
+ }
+ }
+ if (count > 0)
+ {
+ sequenceChanged();
+ }
+
+ return count;
+ }
+
+ @Override
+ public List<SequenceFeature[]> adjustFeatures(int fromColumn, int toColumn)
+ {
+ List<SequenceFeature[]> amended = new ArrayList<>();
+
+ if (toColumn < fromColumn)
+ {
+ return amended;
+ }
+
+ synchronized (sequenceFeatureStore)
+ {
+ /*
+ * get features that overlap or span the cut region
+ */
+ List<SequenceFeature> overlaps = findFeatures(fromColumn, toColumn);
+ int cutWidth = toColumn - fromColumn + 1;
+
+ /*
+ * get features that strictly follow the cut region,
+ * and shift them left by the width of the cut
+ */
+ List<SequenceFeature> follow = findFeatures(toColumn + 1,
+ Integer.MAX_VALUE);
+ follow.removeAll(overlaps);
+ for (SequenceFeature sf : follow)
+ {
+ SequenceFeature copy = new SequenceFeature(sf, sf.getBegin()
+ - cutWidth, sf.getEnd() - cutWidth, sf.getFeatureGroup(),
+ sf.getScore());
+ deleteFeature(sf);
+ addSequenceFeature(copy);
+ }
+
+ /*
+ * adjust start-end of overlapping features, and delete if enclosed by
+ * the cut, or a partially overlapping contact feature
+ */
+ for (SequenceFeature sf : overlaps)
+ {
+ // TODO recode to compute newBegin, newEnd, isDelete
+ // then perform the action
+ int sfBegin = sf.getBegin();
+ int sfEnd = sf.getEnd();
+ int startCol = findIndex(sfBegin);
+ int endCol = findIndex(sfEnd);
+ if (startCol >= fromColumn && endCol <= toColumn)
+ {
+ // within cut region - delete feature
+ deleteFeature(sf);
+ amended.add(new SequenceFeature[] { sf, null });
+ continue;
+ }
+ if (startCol < fromColumn && endCol > toColumn)
+ {
+ // feature spans cut region - shift end left
+ SequenceFeature copy = new SequenceFeature(sf, sf.getBegin(),
+ sf.getEnd() - cutWidth, sf.getFeatureGroup(),
+ sf.getScore());
+ deleteFeature(sf);
+ addSequenceFeature(copy);
+ amended.add(new SequenceFeature[] { sf, copy });
+ continue;
+ }
+ // todo partial overlap - delete if contact feature
+ }
+ }
+
+ return amended;
+ }
}