Commit 669fc01a authored by Claus Kleinwort's avatar Claus Kleinwort
Browse files

More robust sorting of constraints

git-svn-id: http://svnsrv.desy.de/public/MillepedeII/trunk@191 3547b9b0-65b8-46d3-b95d-921b3f43af62
parent 7e54474b
......@@ -1838,6 +1838,7 @@ SUBROUTINE sort2i(a,n)
IF(a(1,j) > a1) GO TO 30
IF(a(1,j) == a1.AND.a(2,j) > a2) GO TO 30
IF(i <= j) THEN
IF(a(1,i) == a(1,j).AND.a(2,i) == a(2,j)) GO TO 20 ! equal -> keep order
at=a(:,i) ! exchange I <-> J
a(:,i)=a(:,j)
a(:,j)=at
......
......@@ -51,7 +51,7 @@
!! 1. Download the software package from the DESY \c svn server to
!! \a target directory, e.g.:
!!
!! svn checkout http://svnsrv.desy.de/public/MillepedeII/tags/V04-07-01 target
!! svn checkout http://svnsrv.desy.de/public/MillepedeII/tags/V04-07-02 target
!!
!! 2. Create **Pede** executable (in \a target directory):
!!
......@@ -1374,7 +1374,7 @@ SUBROUTINE prpcon
END DO
! sort constraints
call sort2i(matConsSort,ncgb)
CALL sort2i(matConsSort,ncgb)
! loop over sorted constraints, try to split into blocks
ncblck=0
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment