3 // FORESTER -- software libraries and applications
4 // for evolutionary biology research and applications.
6 // Copyright (C) 2008-2009 Christian M. Zmasek
7 // Copyright (C) 2008-2009 Burnham Institute for Medical Research
10 // This library is free software; you can redistribute it and/or
11 // modify it under the terms of the GNU Lesser General Public
12 // License as published by the Free Software Foundation; either
13 // version 2.1 of the License, or (at your option) any later version.
15 // This library is distributed in the hope that it will be useful,
16 // but WITHOUT ANY WARRANTY; without even the implied warranty of
17 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 // Lesser General Public License for more details.
20 // You should have received a copy of the GNU Lesser General Public
21 // License along with this library; if not, write to the Free Software
22 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
24 // Contact: phylosoft @ gmail . com
25 // WWW: https://sites.google.com/site/cmzmasek/home/software/forester
27 package org.forester.surfacing;
29 import org.forester.protein.BinaryDomainCombination;
30 import org.forester.util.ForesterUtil;
32 public class BasicBinaryDomainCombination implements BinaryDomainCombination {
38 BasicBinaryDomainCombination() {
43 private String getAsStr() {
44 return _id0 + SEPARATOR + _id1;
47 public BasicBinaryDomainCombination( final String id0, final String id1 ) {
48 if ( ( id0 == null ) || ( id1 == null ) ) {
49 throw new IllegalArgumentException( "attempt to create binary domain combination using null" );
51 if ( id0.toLowerCase().compareTo( id1.toLowerCase() ) < 0 ) {
62 public int compareTo( final BinaryDomainCombination binary_domain_combination ) {
63 if ( binary_domain_combination.getClass() != this.getClass() ) {
64 throw new IllegalArgumentException( "attempt to compare [" + binary_domain_combination.getClass() + "] to "
65 + "[" + this.getClass() + "]" );
67 if ( equals( binary_domain_combination ) ) {
70 final int x = getId0().compareTo( binary_domain_combination.getId0() );
75 return getId1().compareTo( binary_domain_combination.getId1() );
80 public boolean equals( final Object o ) {
84 else if ( o == null ) {
85 throw new IllegalArgumentException( "attempt to check [" + this.getClass() + "] equality to null" );
87 else if ( o.getClass() != this.getClass() ) {
88 throw new IllegalArgumentException( "attempt to check [" + this.getClass() + "] equality to ["
89 + o.getClass() + "]" );
92 return ( getId0().equals( ( ( BinaryDomainCombination ) o ).getId0() ) )
93 && ( getId1().equals( ( ( BinaryDomainCombination ) o ).getId1() ) );
98 public String getId0() {
103 public String getId1() {
108 public int hashCode() {
109 return getAsStr().hashCode();
113 public StringBuffer toGraphDescribingLanguage( final OutputFormat format,
114 final String node_attribute,
115 final String edge_attribute ) {
116 final StringBuffer sb = new StringBuffer();
119 if ( ForesterUtil.isEmpty( node_attribute ) ) {
120 sb.append( getId0() );
122 sb.append( getId1() );
123 if ( !ForesterUtil.isEmpty( edge_attribute ) ) {
125 sb.append( edge_attribute );
130 sb.append( getId0() );
132 sb.append( node_attribute );
134 sb.append( ForesterUtil.LINE_SEPARATOR );
135 sb.append( getId1() );
137 sb.append( node_attribute );
139 sb.append( ForesterUtil.LINE_SEPARATOR );
140 sb.append( getId0() );
142 sb.append( getId1() );
143 if ( !ForesterUtil.isEmpty( edge_attribute ) ) {
145 sb.append( edge_attribute );
151 throw new AssertionError( "unknown format:" + format );
157 public String toString() {
161 public static BinaryDomainCombination createInstance( final String ids ) {
162 if ( ids.indexOf( BinaryDomainCombination.SEPARATOR ) < 1 ) {
163 throw new IllegalArgumentException( "Unexpected format for binary domain combination [" + ids + "]" );
165 final String[] ids_ary = ids.split( BinaryDomainCombination.SEPARATOR );
166 if ( ids_ary.length != 2 ) {
167 throw new IllegalArgumentException( "Unexpected format for binary domain combination [" + ids + "]" );
169 return new BasicBinaryDomainCombination( ids_ary[ 0 ], ids_ary[ 1 ] );