[jboss-svn-commits] JBL Code SVN: r5164 - labs/jbossrules/branches/3.0.x/drools-examples/src/main/rules/org/drools/examples

[jboss-svn-commits at lists.jboss.org]

Author: mark.proctor at jboss.com
Date: 2006-07-18 19:58:51 -0400 (Tue, 18 Jul 2006)
New Revision: 5164

Modified:
   labs/jbossrules/branches/3.0.x/drools-examples/src/main/rules/org/drools/examples/Fibonacci.drl
Log:
-fixed line endings

Modified: labs/jbossrules/branches/3.0.x/drools-examples/src/main/rules/org/drools/examples/Fibonacci.drl
===================================================================
--- labs/jbossrules/branches/3.0.x/drools-examples/src/main/rules/org/drools/examples/Fibonacci.drl	2006-07-18 23:36:14 UTC (rev 5163)
+++ labs/jbossrules/branches/3.0.x/drools-examples/src/main/rules/org/drools/examples/Fibonacci.drl	2006-07-18 23:58:51 UTC (rev 5164)
@@ -1,43 +1,43 @@
-package org.drools.examples
-
-import org.drools.examples.FibonacciExample.Fibonacci;
-
-rule Recurse
-	salience 10
-	when
-		f : Fibonacci ( value == -1 )
-	then
-		assert( new Fibonacci( f.getSequence() - 1 ) );
-		System.out.println( "recurse for " + f.getSequence() );
-end
-
-rule Bootstrap1
-	salience 20
-	when
-		f : Fibonacci( sequence == 1, value == -1 )
-	then 
-		f.setValue( 1 );		
-		modify( f );
-		System.out.println( f.getSequence() + " == " + f.getValue() );
-end
-
-rule Bootstrap2
-	when
-		f : Fibonacci( sequence == 2, value == -1 )
-	then 
-		f.setValue( 1 );		
-		modify( f );
-		System.out.println( f.getSequence() + " == " + f.getValue() );		
-end
-
-rule Calculate
-	when
-		f1 : Fibonacci( s1 : sequence, value != -1 )
-		f2 : Fibonacci( s2 : sequence == (new Integer( s1.intValue() + 1  ) ), value != -1 )
- 		f3 : Fibonacci( sequence == (new Integer( s2.intValue() + 1 ) ), value == -1 )				
-	then	
-		f3.setValue( f1.getValue() + f2.getValue() );
-		modify( f3 );
-		retract( f1 );
-		System.out.println( f3.getSequence() + " == " + f3.getValue() );
-end	
+package org.drools.examples
+
+import org.drools.examples.FibonacciExample.Fibonacci;
+
+rule Recurse
+	salience 10
+	when
+		f : Fibonacci ( value == -1 )
+	then
+		assert( new Fibonacci( f.getSequence() - 1 ) );
+		System.out.println( "recurse for " + f.getSequence() );
+end
+
+rule Bootstrap1
+	salience 20
+	when
+		f : Fibonacci( sequence == 1, value == -1 )
+	then 
+		f.setValue( 1 );		
+		modify( f );
+		System.out.println( f.getSequence() + " == " + f.getValue() );
+end
+
+rule Bootstrap2
+	when
+		f : Fibonacci( sequence == 2, value == -1 )
+	then 
+		f.setValue( 1 );		
+		modify( f );
+		System.out.println( f.getSequence() + " == " + f.getValue() );		
+end
+
+rule Calculate
+	when
+		f1 : Fibonacci( s1 : sequence, value != -1 )
+		f2 : Fibonacci( s2 : sequence == (new Integer( s1.intValue() + 1  ) ), value != -1 )
+ 		f3 : Fibonacci( sequence == (new Integer( s2.intValue() + 1 ) ), value == -1 )				
+	then	
+		f3.setValue( f1.getValue() + f2.getValue() );
+		modify( f3 );
+		retract( f1 );
+		System.out.println( f3.getSequence() + " == " + f3.getValue() );
+end