001/*
002 *                    BioJava development code
003 *
004 * This code may be freely distributed and modified under the
005 * terms of the GNU Lesser General Public Licence.  This should
006 * be distributed with the code.  If you do not have a copy,
007 * see:
008 *
009 *      http://www.gnu.org/copyleft/lesser.html
010 *
011 * Copyright for this code is held jointly by the individual
012 * authors.  These should be listed in @author doc comments.
013 *
014 * For more information on the BioJava project and its aims,
015 * or to join the biojava-l mailing list, visit the home page
016 * at:
017 *
018 *      http://www.biojava.org/
019 *
020 */
021package org.biojava.nbio.structure.secstruc;
022
023/**
024 * A Ladder is a set of one or more consecutive bridges of identical type. A
025 * Bridge is a Ladder of length one.
026 *
027 * @author Andreas Prlic
028 * @author Aleix Lafita
029 *
030 */
031public class Ladder {
032
033        int from; // start of the first strand
034        int to; // end of the first strand
035        int lfrom; // start of the second strand
036        int lto; // end of the second strand
037
038        BridgeType btype;
039
040        int connectedTo; // another ladder with higher index connected to this
041        int connectedFrom; // another ladder with lower index connected to this
042
043        public int getFrom() {
044                return from;
045        }
046
047        public int getTo() {
048                return to;
049        }
050
051        public int getLfrom() {
052                return lfrom;
053        }
054
055        public int getLto() {
056                return lto;
057        }
058
059        public BridgeType getBtype() {
060                return btype;
061        }
062
063        public int getConnectedTo() {
064                return connectedTo;
065        }
066
067        public int getConnectedFrom() {
068                return connectedFrom;
069        }
070
071}