Skip to content

Commit

Permalink
Remove some old TODO comments
Browse files Browse the repository at this point in the history
  • Loading branch information
einar90 committed Jan 22, 2016
1 parent 50a23f2 commit e337770
Show file tree
Hide file tree
Showing 5 changed files with 5 additions and 12 deletions.
2 changes: 0 additions & 2 deletions FieldOpt/Optimization/constraints/constraint.h
Original file line number Diff line number Diff line change
Expand Up @@ -35,8 +35,6 @@ namespace Optimization { namespace Constraints {
/*!
* \brief The Constraint class is the abstract parent class to all other constraint classes. One Constraint
* object should be created for each defined constraint.
*
* \todo Find a way to determine which variables a constraint should be applied to.
*/
class Constraint
{
Expand Down
6 changes: 0 additions & 6 deletions FieldOpt/Optimization/optimizer.h
Original file line number Diff line number Diff line change
Expand Up @@ -38,8 +38,6 @@ namespace Optimization {
/*!
* \brief The Optimizer class is the abstract parent class for all optimizers. It is primarily
* designed to support direct search optimization algorithms.
*
* \todo GetProgress method
*/
class Optimizer
{
Expand Down Expand Up @@ -102,16 +100,12 @@ class Optimizer
/*!
* \brief BetterCaseFoundLastEvaluation Searches the list of recently evaluated cases in the case handler for a case
* with a better objective function value than the current tentative best case.
*
* \todo Implement both minimization and maximization. Currently only maximization is implemented.
* \return True if a better case is found, otherwise false.
*/
bool betterCaseFoundLastEvaluation();

/*!
* \brief ApplyNewTentativeBestCase Sets the tentative best case to the best case found in the case handler (if one is found).
*
* \todo Implement both minimization and maximization. Currently only maximization is implemented.
*/
void applyNewTentativeBestCase();

Expand Down
6 changes: 5 additions & 1 deletion FieldOpt/Optimization/optimizers/compass_search.h
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,11 @@ namespace Optimization { namespace Optimizers {
*
* This algorithm only supports integer and real variables.
*
* \todo Insert complete reference here.
* Reference:
*
* Kolda, Tamara G., Robert Michael Lewis, and Virginia Torczon.
* "Optimization by direct search: New perspectives on some classical and modern methods."
* SIAM review 45.3 (2003): 385-482.
*/
class CompassSearch : public Optimizer
{
Expand Down
2 changes: 0 additions & 2 deletions FieldOpt/Runner/runners/abstract_runner.h
Original file line number Diff line number Diff line change
Expand Up @@ -46,8 +46,6 @@ class MainRunner;
*
* It also defines the purely virtual Execute() method which should be implemented by all concrete
* runners.
*
* \todo Methods for logging common to all runnes (maybe make them virtual so they can be overridden)
*/
class AbstractRunner
{
Expand Down
1 change: 0 additions & 1 deletion FieldOpt/Simulation/simulator_interfaces/eclsimulator.h
Original file line number Diff line number Diff line change
Expand Up @@ -48,7 +48,6 @@ namespace SimulatorInterfaces {
* sim.CleanUp();
* \endcode
*
* \todo Support other execution scripts (i.e. get it from settings)
* \todo Support custom execution commands.
*/
class ECLSimulator : public Simulator
Expand Down

0 comments on commit e337770

Please sign in to comment.