Strip trailing whitespace.

git-svn-id: http://svn.drobilla.net/lad/trunk/machina@1999 a436a847-0d15-0410-975c-d299462d15a1

1 files changed, 11 insertions, 11 deletions

diff --git a/src/engine/machina/Problem.hpp b/src/engine/machina/Problem.hpp
index c0c1662..58393e1 100644
--- a/src/engine/machina/Problem.hpp
+++ b/src/engine/machina/Problem.hpp
@@ -1,15 +1,15 @@
 /* This file is part of Machina.
  * Copyright (C) 2007 Dave Robillard <http://drobilla.net>
- * 
+ *
  * Machina is free software; you can redistribute it and/or modify it under the
  * terms of the GNU General Public License as published by the Free Software
  * Foundation; either version 2 of the License, or (at your option) any later
  * version.
- * 
+ *
  * Machina is distributed in the hope that it will be useful, but WITHOUT ANY
  * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for details.
- * 
+ *
  * You should have received a copy of the GNU General Public License along
  * with this program; if not, write to the Free Software Foundation, Inc.,
  * 51 Franklin St, Fifth Floor, Boston, MA  02110-1301, USA
@@ -33,11 +33,11 @@ public:
 	void seed(SharedPtr<Machine> parent) { _seed = parent; }
 
 	float fitness(const Machine& machine) const;
-	
+
 	bool fitness_less_than(float a, float b) const { return a < b; }
 
 	void clear_fitness_cache() { _fitness.clear(); }
-	
+
 	boost::shared_ptr<Population>
 	initial_population(size_t gene_size, size_t pop_size) const;
 
@@ -57,9 +57,9 @@ private:
 		                 const uint8_t* ev) throw (std::logic_error);
 		void compute();
 		const Problem& _problem;
-		
+
 		size_t n_notes() const { return _n_notes; }
-	
+
 		float  _note_frequency[128];
 		size_t _n_notes;
 		double _length;
@@ -75,11 +75,11 @@ private:
 		const Problem& _problem;
 
 		size_t n_notes() const { return _notes.size(); }
-	
+
 		std::vector<uint8_t> _notes;
 		float                _counts[128];
 	};*/
-	
+
 	struct Evaluator : public Raul::MIDISink {
 		Evaluator(const Problem& problem) : _problem(problem), _order(4), _n_notes(0), _first_note(0) {
 			for (uint8_t i=0; i < 128; ++i)
@@ -93,7 +93,7 @@ private:
 
 		size_t n_notes() const { return _n_notes; }
 		uint8_t first_note() const { return _first_note; }
-	
+
 		const uint32_t _order;
 
 		std::string _read;
@@ -109,7 +109,7 @@ private:
 
 	Evaluator          _target;
 	SharedPtr<Machine> _seed;
-	
+
 	/// for levenshtein distance
 	mutable std::vector< std::vector<uint16_t> > _matrix;