You are viewing a plain text version of this content. The canonical link for it is here.

Posted to commits@commons.apache.org by mb...@apache.org on 2011/10/21 17:17:07 UTC

svn commit: r1187394 - /commons/proper/functor/trunk/src/site/xdoc/examples.xml

Author: mbenson
Date: Fri Oct 21 15:17:07 2011
New Revision: 1187394

URL: http://svn.apache.org/viewvc?rev=1187394&view=rev
Log:
typos

Modified:
    commons/proper/functor/trunk/src/site/xdoc/examples.xml

Modified: commons/proper/functor/trunk/src/site/xdoc/examples.xml
URL: http://svn.apache.org/viewvc/commons/proper/functor/trunk/src/site/xdoc/examples.xml?rev=1187394&r1=1187393&r2=1187394&view=diff
==============================================================================
--- commons/proper/functor/trunk/src/site/xdoc/examples.xml (original)
+++ commons/proper/functor/trunk/src/site/xdoc/examples.xml Fri Oct 21 15:17:07 2011
@@ -71,7 +71,7 @@
           <a href="http://pragprog.com/pragdave/">blogging</a> 
           a series of programming exercises he calls 
           <a href="http://pragprog.com/pragdave/Practices/Kata">Code Katas</a>.
-          These exercises are intended to provide "practice sesssions" that allow
+          These exercises are intended to provide "practice sessions" that allow
           programmers to hone their craft.  The notion is borrowed from the 
           practice of Karate, where, in Dave's words 
           "a kata is an exercise where you repeat a form many, many times, 
@@ -94,8 +94,8 @@
           <dt><a href="http://svn.apache.org/viewvc/commons/proper/functor/trunk/src/test/java/org/apache/commons/functor/example/kata/two/">Kata Two: Binary Chop</a></dt>
           <dd>
             <a href="http://pragprog.com/pragdave/Practices/Kata/KataTwo.rdoc,v">Kata Two</a> asks us
-            to create several different implemenations of the binary search algorithm, which once you
-            get past three or four implemenations, is more difficult that it sounds.            
+            to create several different implementations of the binary search algorithm, which once you
+            get past three or four implementations, is more difficult that it sounds.            
             <a href="http://svn.apache.org/repos/asf/commons/proper/functor/trunk/src/test/java/org/apache/commons/functor/example/kata/two/TestBinaryChop.java">TestBinaryChop</a>
             presents several implementations, with functor and non-functor variations.
           </dd>