Fix a few Javadoc typos.

enabler/src/de/schildbach/pte/LocationUtils.java

@@ -25,7 +25,7 @@ public final class LocationUtils {
      * @param lat1
      *            latitude of origin point in decimal degrees
      * @param lon1
-     *            longitude of origin point in deceimal degrees
+     *            longitude of origin point in decimal degrees
      * @param lat2
      *            latitude of destination point in decimal degrees
      * @param lon2

enabler/src/de/schildbach/pte/dto/Trip.java

@@ -128,7 +128,7 @@ public final class Trip implements Serializable {
             return null;
     }
 
-    /** Minimum time occuring in this trip. */
+    /** Minimum time occurring in this trip. */
     public Date getMinTime() {
         Date minTime = null;
 
@@ -139,7 +139,7 @@ public final class Trip implements Serializable {
         return minTime;
     }
 
-    /** Maximum time occuring in this trip. */
+    /** Maximum time occurring in this trip. */
     public Date getMaxTime() {
         Date maxTime = null;
 
@@ -282,10 +282,10 @@ public final class Trip implements Serializable {
         /** Coarse arrival time. */
         public abstract Date getArrivalTime();
 
-        /** Minimum time occuring in this leg. */
+        /** Minimum time occurring in this leg. */
         public abstract Date getMinTime();
 
-        /** Maximum time occuring in this leg. */
+        /** Maximum time occurring in this leg. */
         public abstract Date getMaxTime();
     }
 

enabler/src/de/schildbach/pte/util/CharQueue.java

@@ -21,7 +21,7 @@ package de.schildbach.pte.util;
  */
 
 /**
- * This class implements a characater queue. Yes the JKD does contain a general queue. However that queue
+ * This class implements a character queue. Yes the JDK does contain a general queue. However that queue
  * operates on objects. This queue just handles char elements. Use in IO operations where converting chars to
  * objects will be too expensive.
  *
@@ -133,7 +133,7 @@ final public class CharQueue {
 
     /**
      * Places chars from queue in charsRemoved starting at charsRemoved[offset]. Will place numCharsRequested
-     * into charsRemoved if queue has enougth chars.
+     * into charsRemoved if queue has enough chars.
      * 
      * @return actual number of chars put in charsRemoved
      */

enabler/src/de/schildbach/pte/util/StringReplaceReader.java

@@ -30,13 +30,13 @@ import java.io.StringReader;
 
 /**
  * Given a string <b>pattern</b>, a string <b>replacementPattern</b> and an input stream, this class will
- * replace all occurances of <b>pattern</b> with <b>replacementPattern</b> in the inputstream. You can give
+ * replace all occurrences of <b>pattern</b> with <b>replacementPattern</b> in the inputstream. You can give
  * multiple pattern-replacementPattern pairs. Multiple pairs are done in order they are given. If first pair
- * is "cat"-"dog" and second pair is "dog"-"house", then the result will be all occurences of "cat" or "dog"
+ * is "cat"-"dog" and second pair is "dog"-"house", then the result will be all occurrences of "cat" or "dog"
  * will be replaced with "house".
  *
  * @version 0.6 21 August 1997
- * @since version 0.5, Fixed error that occured when input was shorter than the pattern
+ * @since version 0.5, Fixed error that occurred when input was shorter than the pattern
  * @author Roger Whitney (<a href=mailto:whitney@cs.sdsu.edu>whitney@cs.sdsu.edu</a>)
  */
 
@@ -54,7 +54,7 @@ public class StringReplaceReader extends FilterReader implements Cloneable {
     protected static int DEFAULT_BUFFER_SIZE = 1024;
 
     /**
-     * Create an StringReplaceReader object that will replace all occurrences ofpattern with
+     * Create an StringReplaceReader object that will replace all occurrences of pattern with
      * replacementPattern in the Reader in.
      */
     public StringReplaceReader(Reader in, String pattern, String replacementPattern) {
@@ -132,7 +132,7 @@ public class StringReplaceReader extends FilterReader implements Cloneable {
      * @parm buffer Destination buffer
      * @parm offset location in buffer to start storing characters
      * @parm charsToRead maximum characters to read
-     * @return number of characters actually read, -1 if reah EOF on reading first character
+     * @return number of characters actually read, -1 if reach EOF on reading first character
      * @exception IOException
      *                if an I/O error occurs
      */
@@ -203,10 +203,10 @@ public class StringReplaceReader extends FilterReader implements Cloneable {
     }
 
     /**
-     * Read inpout to see if we have found the pattern. <B>Requires:</B> When this is called we have already
+     * Read input to see if we have found the pattern. <B>Requires:</B> When this is called we have already
      * have read first character in pattern.<BR>
      * <B>Side Effects: </B> After attempt to find pattern, output buffer contains either the replacement
-     * pattern or all characters we konw are not part of pattern.
+     * pattern or all characters we know are not part of pattern.
      */
     protected void filterInput() throws IOException {
         // Use quick-search to find pattern. Fill inputBuffer with text.

enabler/src/de/schildbach/pte/util/XmlPullUtil.java

@@ -192,8 +192,8 @@ public final class XmlPullUtil {
     }
 
     /**
-     * Skip sub tree that is currently porser positioned on. <br>
-     * NOTE: parser must be on START_TAG and when funtion returns parser will be positioned on corresponding
+     * Skip sub tree that is currently parser positioned on. <br>
+     * NOTE: parser must be on START_TAG and when function returns parser will be positioned on corresponding
      * END_TAG
      */
     public static void skipSubTree(final XmlPullParser pp) throws XmlPullParserException, IOException {
@@ -222,7 +222,7 @@ public final class XmlPullUtil {
     }
 
     /**
-     * Read text content of element ith given namespace and name (use null namespace do indicate that nemspace
+     * Read text content of element ith given namespace and name (use null namespace do indicate that namespace
      * should not be checked)
      */