- final int dc1 = domains_1.getKeyDomainCount();
- final int dc2 = domains_2.getKeyDomainCount();
- return new CountsBasedPairwiseDomainSimilarity( dc1 - dc2, dc1 + dc2 );
+ if ( ( domains_1.getKeyDomainCount() > Short.MAX_VALUE ) || ( domains_2.getKeyDomainCount() > Short.MAX_VALUE )
+ || ( ( domains_1.getKeyDomainCount() + domains_2.getKeyDomainCount() ) > Short.MAX_VALUE ) ) {
+ throw new IllegalArgumentException( "too large for short!" );
+ }
+ final short dc1 = ( short ) domains_1.getKeyDomainCount();
+ final short dc2 = ( short ) domains_2.getKeyDomainCount();
+ return new CountsBasedPairwiseDomainSimilarity( ( short ) ( dc1 - dc2 ), ( short ) ( dc1 + dc2 ) );