nojhan/eodev
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

a different solution for lt_arity has been implemented (this time inside the

Browse source 
eoParseTreeDepthInit class
This commit is contained in:
jeggermo 2001-12-04 11:49:25 +00:00
commit 61ea207287
1 changed files with 9 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

17
eo/src/gp/eoParseTreeDepthInit.h
View file

@ -36,13 +36,6 @@
using namespace gp_parse_tree; using namespace gp_parse_tree;
using namespace std; using namespace std;
// we need this for sorting the initializor vector
template <class Node>
bool lt_arity(const Node &node1, const Node &node2)
{
return (node1.arity() < node2.arity());
}
/** eoParseTreeDepthInit : the initializer class for eoParseTree /** eoParseTreeDepthInit : the initializer class for eoParseTree
\class eoParseTreeDepthInit eoParseTreeDepthInit.h gp/eoParseTreeDepthInit.h \class eoParseTreeDepthInit eoParseTreeDepthInit.h gp/eoParseTreeDepthInit.h
\ingroup ParseTree \ingroup ParseTree
@ -54,6 +47,14 @@ bool lt_arity(const Node &node1, const Node &node2)
template <class FType, class Node> template <class FType, class Node>
class eoParseTreeDepthInit : public eoInit< eoParseTree<FType, Node> > class eoParseTreeDepthInit : public eoInit< eoParseTree<FType, Node> >
{ {
protected:
// a binary predicate for sorting
// hopefully this will work with M$VC++ 6.0
struct lt_arity:public binary_function<Node,Node,bool>
{
bool operator()(const Node &_node1, const Node &_node2) { return (_node1.arity() < _node2.arity());};
};
public : public :
typedef eoParseTree<FType, Node> EoType; typedef eoParseTree<FType, Node> EoType;
@ -80,7 +81,7 @@ class eoParseTreeDepthInit : public eoInit< eoParseTree<FType, Node> >
} }
// lets sort the initializor vector according to arity (so we can be sure the terminals are in front) // lets sort the initializor vector according to arity (so we can be sure the terminals are in front)
// we use stable_sort so that if element i was in front of element j and they have the same arity i remains in front of j // we use stable_sort so that if element i was in front of element j and they have the same arity i remains in front of j
stable_sort(initializor.begin(), initializor.end(), lt_arity<Node>); stable_sort(initializor.begin(), initializor.end(), lt_arity());
} }
/// My class name /// My class name
virtual string className() const { return "eoParseTreeDepthInit"; }; virtual string className() const { return "eoParseTreeDepthInit"; };