Ignore:
Timestamp:
Apr 30, 2010, 10:07:23 AM (16 years ago)
Author:
Tillmann Crueger <crueger@…>
Children:
59e7832
Parents:
f70c2a
Message:

Declared the Vector class as single point spaces

File:
1 edited

Legend:

Unmodified
Added
Removed
  • molecuilder/src/molecule_dynamics.cpp

    rf70c2a r4eee8f  
    4848    // check whether either is zero()
    4949    if ((Norm1 < MYEPSILON) && (Norm2 < MYEPSILON)) {
    50       tmp = Walker->Trajectory.R.at(Params.startstep).Distance(Runner->Trajectory.R.at(Params.startstep));
     50      tmp = Walker->Trajectory.R.at(Params.startstep).distance(Runner->Trajectory.R.at(Params.startstep));
    5151    } else if (Norm1 < MYEPSILON) {
    5252      Sprinter = Params.PermutationMap[Walker->nr];   // find first target point
     
    6666  //        Log() << Verbose(0) << " and ";
    6767  //        Log() << Verbose(0) << trajectory2;
    68       tmp = Walker->Trajectory.R.at(Params.startstep).Distance(Runner->Trajectory.R.at(Params.startstep));
     68      tmp = Walker->Trajectory.R.at(Params.startstep).distance(Runner->Trajectory.R.at(Params.startstep));
    6969  //        Log() << Verbose(0) << " with distance " << tmp << "." << endl;
    7070    } else { // determine distance by finding minimum distance
     
    166166    // first term: distance to target
    167167    Runner = Params.PermutationMap[Walker->nr];   // find target point
    168     tmp = (Walker->Trajectory.R.at(Params.startstep).Distance(Runner->Trajectory.R.at(Params.endstep)));
     168    tmp = (Walker->Trajectory.R.at(Params.startstep).distance(Runner->Trajectory.R.at(Params.endstep)));
    169169    tmp *= Params.IsAngstroem ? 1. : 1./AtomicLengthToAngstroem;
    170170    result += Params.PenaltyConstants[0] * tmp;
     
    225225    while(Runner->next != mol->end) {
    226226      Runner = Runner->next;
    227       Params.DistanceList[Walker->nr]->insert( DistancePair(Walker->Trajectory.R.at(Params.startstep).Distance(Runner->Trajectory.R.at(Params.endstep)), Runner) );
     227      Params.DistanceList[Walker->nr]->insert( DistancePair(Walker->Trajectory.R.at(Params.startstep).distance(Runner->Trajectory.R.at(Params.endstep)), Runner) );
    228228    }
    229229  }
Note: See TracChangeset for help on using the changeset viewer.