X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fdatamodel%2FMapping.java;h=cb87719bc3cd9f810b7900c40537fa54fa17ca25;hb=bda12c8fbbfeb46d9754e37084f7cb2ded35476d;hp=fcb9ed3a83b69ce1f4ffa6fb267a69aa9784412c;hpb=34d0e74532d41a1b46d253e0190baf6c7c29b8da;p=jalview.git diff --git a/src/jalview/datamodel/Mapping.java b/src/jalview/datamodel/Mapping.java index fcb9ed3..cb87719 100644 --- a/src/jalview/datamodel/Mapping.java +++ b/src/jalview/datamodel/Mapping.java @@ -1,3 +1,23 @@ +/* + * Jalview - A Sequence Alignment Editor and Viewer (Version 2.8.2) + * Copyright (C) 2014 The Jalview Authors + * + * This file is part of Jalview. + * + * Jalview is free software: you can redistribute it and/or + * modify it under the terms of the GNU General Public License + * as published by the Free Software Foundation, either version 3 + * of the License, or (at your option) any later version. + * + * Jalview is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty + * of MERCHANTABILITY or FITNESS FOR A PARTICULAR + * PURPOSE. See the GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with Jalview. If not, see . + * The Jalview Authors are detailed in the 'AUTHORS' file. + */ package jalview.datamodel; import java.util.Vector; @@ -219,7 +239,7 @@ public class Mapping if (map != null) { int[] frange = map.locateInFrom(f.getBegin(), f.getEnd()); - if (frange==null) + if (frange == null) { // JBPNote - this isprobably not the right thing to doJBPHack return null; @@ -231,7 +251,7 @@ public class Mapping vf[v].setBegin(frange[i]); vf[v].setEnd(frange[i + 1]); if (frange.length > 2) - vf[v].setDescription(f.getDescription() + "\nPart " + v); + vf[v].setDescription(f.getDescription() + "\nPart " + (v + 1)); } return vf; } @@ -347,7 +367,8 @@ public class Mapping for (int vc = 0; vc < viscontigs.length; vc += 2) { // find a mapped range in this visible region - int[] mpr = locateMappedRange(1+viscontigs[vc], viscontigs[vc + 1]-1); + int[] mpr = locateMappedRange(1 + viscontigs[vc], + viscontigs[vc + 1] - 1); if (mpr != null) { for (int m = 0; m < mpr.length; m += 2) @@ -363,49 +384,58 @@ public class Mapping } } } - int[] from = new int[fromRange.size()*2]; - int[] to = new int[toRange.size()*2]; + int[] from = new int[fromRange.size() * 2]; + int[] to = new int[toRange.size() * 2]; int[] r; - for (int f=0,fSize=fromRange.size(); f Protein exon map and a range of visContigs + * trite test of the intersectVisContigs method for a simple DNA -> Protein + * exon map and a range of visContigs */ - MapList fk = new MapList(new int[] { 1,6,8,13,15,23}, new int[] { 1,7}, 3, 1); + MapList fk = new MapList(new int[] + { 1, 6, 8, 13, 15, 23 }, new int[] + { 1, 7 }, 3, 1); Mapping m = new Mapping(fk); - Mapping m_1 = m.intersectVisContigs(new int[] {fk.getFromLowest(), fk.getFromHighest()}); - Mapping m_2 = m.intersectVisContigs(new int[] {1,7,11,20}); - System.out.println(""+m_1.map.getFromRanges()); - - + Mapping m_1 = m.intersectVisContigs(new int[] + { fk.getFromLowest(), fk.getFromHighest() }); + Mapping m_2 = m.intersectVisContigs(new int[] + { 1, 7, 11, 20 }); + System.out.println("" + m_1.map.getFromRanges()); + } + /** * get the sequence being mapped to - if any + * * @return null or a dataset sequence */ public SequenceI getTo() { return to; } + /** * set the dataset sequence being mapped to if any + * * @param tto */ public void setTo(SequenceI tto) @@ -413,7 +443,9 @@ public class Mapping to = tto; } - /* (non-Javadoc) + /* + * (non-Javadoc) + * * @see java.lang.Object#finalize() */ protected void finalize() throws Throwable @@ -422,5 +454,5 @@ public class Mapping to = null; super.finalize(); } - + }