| 1 |
tim |
1916 |
/* |
| 2 |
|
|
* Copyright (C) 2000-2004 Object Oriented Parallel Simulation Engine (OOPSE) project |
| 3 |
|
|
* |
| 4 |
|
|
* Contact: oopse@oopse.org |
| 5 |
|
|
* |
| 6 |
|
|
* This program is free software; you can redistribute it and/or |
| 7 |
|
|
* modify it under the terms of the GNU Lesser General Public License |
| 8 |
|
|
* as published by the Free Software Foundation; either version 2.1 |
| 9 |
|
|
* of the License, or (at your option) any later version. |
| 10 |
|
|
* All we ask is that proper credit is given for our work, which includes |
| 11 |
|
|
* - but is not limited to - adding the above copyright notice to the beginning |
| 12 |
|
|
* of your source code files, and to any copyright notice that you may distribute |
| 13 |
|
|
* with programs based on this work. |
| 14 |
|
|
* |
| 15 |
|
|
* This program 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 |
| 18 |
|
|
* GNU Lesser General Public License for more details. |
| 19 |
|
|
* |
| 20 |
|
|
* You should have received a copy of the GNU Lesser General Public License |
| 21 |
|
|
* along with this program; if not, write to the Free Software |
| 22 |
|
|
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
| 23 |
|
|
* |
| 24 |
|
|
*/ |
| 25 |
|
|
|
| 26 |
|
|
#ifndef CONSTRAINTS_RATTLE_HPP |
| 27 |
|
|
#define CONSTRAINTS_RATTLE_HPP |
| 28 |
|
|
|
| 29 |
|
|
#include "brains/SimInfo.hpp" |
| 30 |
|
|
#include "constraints/ConstraintPair.hpp" |
| 31 |
|
|
namespace oopse { |
| 32 |
|
|
|
| 33 |
|
|
/** |
| 34 |
|
|
* @class Rattle Rattle.hpp "constraints/Rattle.hpp" |
| 35 |
|
|
* Velocity Verlet Constraint Algorithm |
| 36 |
|
|
*/ |
| 37 |
|
|
class Rattle { |
| 38 |
|
|
public: |
| 39 |
|
|
enum ConsStatus{ |
| 40 |
|
|
consFail = -1, //Constraint Fail |
| 41 |
|
|
consSuccess = 0, //constrain the pair by moving two elements |
| 42 |
|
|
consAlready = 1}; //current pair is already constrained, do not need to move the elements |
| 43 |
|
|
|
| 44 |
|
|
Rattle(SimInfo* info); |
| 45 |
|
|
void constraintA(); |
| 46 |
|
|
void constraintB(); |
| 47 |
|
|
|
| 48 |
|
|
int getMaxConsIteration() { return maxConsIteration_; } |
| 49 |
|
|
void setMaxConsIteration(int iteration) { maxConsIteration_ = iteration; } |
| 50 |
|
|
|
| 51 |
|
|
double getConsTolerance() { return consTolerance_; } |
| 52 |
|
|
void setConsTolerance(double tolerance) { consTolerance_ = tolerance;} |
| 53 |
|
|
|
| 54 |
|
|
private: |
| 55 |
|
|
typedef int (Rattle::*ConstraintPairFuncPtr)(ConstraintPair*); |
| 56 |
|
|
void doConstraint(ConstraintPairFuncPtr func); |
| 57 |
|
|
int constraintPairA(ConstraintPair* consPair); |
| 58 |
|
|
int constraintPairB(ConstraintPair* consPair); |
| 59 |
|
|
|
| 60 |
|
|
SimInfo* info_; |
| 61 |
|
|
int maxConsIteration_; |
| 62 |
|
|
double consTolerance_; |
| 63 |
|
|
double dt_; |
| 64 |
|
|
Snapshot* currentSnapshot_; |
| 65 |
|
|
}; |
| 66 |
|
|
|
| 67 |
|
|
} |
| 68 |
|
|
#endif |
