We're almost to rule/command generation, then only a couple of steps before it

will do it all!

1 files changed, 29 insertions, 8 deletions

diff --git a/src/rule.cpp b/src/rule.cpp
index a7ebf9b..a240855 100644
--- a/src/rule.cpp
+++ b/src/rule.cpp
@@ -2,8 +2,7 @@
 #include "builder.h" // for BuildException
 
 Rule::Rule( const char *sName ) :
-        sName( sName ),
-        sProduces("{target}")
+        sName( sName )
 {
 }
 
@@ -14,11 +13,23 @@ Rule::~Rule()
 
 void Rule::debug()
 {
-        printf("   Rule %s produces %s:\n",
-                sName.getString(),
-                sProduces.getString()
+        printf("   Rule %s:\n",
+                sName.getString()
                 );
-        printf("      Matches ");
+        printf("      Produces: ");
+        if( lProduces.empty() )
+                printf("{target}");
+        else
+        {
+                for( std::list<std::string>::iterator i = lProduces.begin();
+                         i != lProduces.end(); i++ )
+                {
+                        if( i != lProduces.begin() )
+                                printf(", ");
+                        printf("%s", (*i).c_str() );
+                }
+        }
+        printf("\n      Matches ");
         if( mHow == matchOne )
                 printf("one ");
         else if( mHow == matchAll )
@@ -31,9 +42,9 @@ void Rule::debug()
         printf("\"%s\"\n", sPerfCmd.getString() );
 }
 
-void Rule::setProduces( const char *sP )
+void Rule::addProduces( const char *sP )
 {
-        sProduces = sP;
+        lProduces.push_back( sP );
 }
 
 void Rule::setMatches( Matches how, const char *sW )
@@ -59,3 +70,13 @@ void Rule::setPerforms( Perform pwhat, const char *sperfcmd )
         sPerfCmd = sperfcmd;
 }
 
+std::list<std::string> Rule::execute( Builder &bld, std::list<std::string> lInput )
+{
+        std::list<Rule *> lRule = bld.findRuleChain( this );
+
+        std::list<std::string> ret;
+
+        return ret;
+
+}
+