2121
2222package org .biojava .nbio .structure .symmetry .core ;
2323
24- import java .util .ArrayList ;
25- import java .util .HashMap ;
26- import java .util .HashSet ;
27- import java .util .List ;
28- import java .util .Map ;
29- import java .util .Set ;
3024
3125import javax .vecmath .AxisAngle4d ;
3226import javax .vecmath .Matrix4d ;
4034import org .biojava .nbio .structure .symmetry .geometry .DistanceBox ;
4135import org .biojava .nbio .structure .symmetry .geometry .SphereSampler ;
4236
37+ import java .util .ArrayList ;
38+ import java .util .HashMap ;
39+ import java .util .HashSet ;
40+ import java .util .List ;
41+ import java .util .Map ;
42+ import java .util .Objects ;
43+ import java .util .Set ;
44+
4345
4446/**
4547 *
@@ -90,7 +92,7 @@ private void solve() {
9092 // isSpherical check added 08-04-11
9193 if (maxSymOps % 60 == 0 && isSpherical ) {
9294 maxSymOps = 60 ;
93- }
95+ }
9496
9597 AxisAngle4d sphereAngle = new AxisAngle4d ();
9698 Matrix4d transformation = new Matrix4d ();
@@ -122,7 +124,7 @@ private void solve() {
122124
123125 // get permutation of subunits and check validity/uniqueness
124126 List <Integer > permutation = getPermutation ();
125- // System.out.println("Rotation Solver: permutation: " + i + ": " + permutation);
127+ // System.out.println("Rotation Solver: permutation: " + i + ": " + permutation);
126128
127129 // check if novel
128130 if ( evaluatedPermutations .containsKey (permutation )) {
@@ -277,7 +279,7 @@ private List<Double> getAngles() {
277279 int n = subunits .getSubunitCount ();
278280 // for spherical symmetric cases, n cannot be higher than 60
279281 if (n % 60 == 0 && isSpherical ()) {
280- n = 60 ;
282+ n = 60 ;
281283 }
282284 List <Integer > folds = subunits .getFolds ();
283285 List <Double > angles = new ArrayList <Double >(folds .size ()-1 );
@@ -334,7 +336,7 @@ private boolean isAllowedPermutation(List<Integer> permutation) {
334336 int selfaligned = 0 ;
335337 for (int i = 0 ; i < permutation .size (); i ++) {
336338 int j = permutation .get (i );
337- if ( seqClusterId .get (i ) != seqClusterId .get (j )) {
339+ if (! Objects . equals ( seqClusterId .get (i ), seqClusterId .get (j ) )) {
338340 return false ;
339341 }
340342 if (i == j ) {
@@ -344,6 +346,7 @@ private boolean isAllowedPermutation(List<Integer> permutation) {
344346 // either identity (all self aligned) or all unique
345347 return selfaligned == 0 || selfaligned == permutation .size ();
346348 }
349+
347350 /**
348351 * Adds translational component to rotation matrix
349352 * @param rotation
@@ -407,7 +410,7 @@ private List<Integer> getPermutation() {
407410 int closest = -1 ;
408411 double minDist = Double .MAX_VALUE ;
409412
410- for (int j : neighbors ) {
413+ for (int j : neighbors ) {
411414 double dist = t .distanceSquared (originalCoords [j ]);
412415 if (dist < minDist ) {
413416 closest = j ;
@@ -417,7 +420,7 @@ private List<Integer> getPermutation() {
417420
418421 sum += minDist ;
419422 if (closest == -1 ) {
420- break ;
423+ break ;
421424 }
422425 permutation .add (closest );
423426 }
0 commit comments