Revision: 19531
          http://sourceforge.net/p/gate/code/19531
Author:   markagreenwood
Date:     2016-08-20 16:59:57 +0000 (Sat, 20 Aug 2016)
Log Message:
-----------
fixed the javadoc errors, all of them I hope

Modified Paths:
--------------
    
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/com/ontotext/jape/pda/SimpleSet.java
    
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/com/ontotext/jape/pda/TransitionPDA.java
    
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/gate/jape/plus/SPTBase.java
    
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/gate/jape/plus/SPTBuilder.java

Modified: 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/com/ontotext/jape/pda/SimpleSet.java
===================================================================
--- 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/com/ontotext/jape/pda/SimpleSet.java
 2016-08-20 16:14:40 UTC (rev 19530)
+++ 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/com/ontotext/jape/pda/SimpleSet.java
 2016-08-20 16:59:57 UTC (rev 19531)
@@ -21,7 +21,7 @@
  * This class stores an index of annotations. The index provides the following
  * functionalities: 1. Given i, for worst case constant time extracts the list
  * of all annotations with start node having offset i. 2. Given j, for worst
- * case constant time finds the smallest i >= j such that there is an 
annotation
+ * case constant time finds the smallest i >= j such that there is an 
annotation
  * with start node having offset i. The time complexity to build the index is
  * O(the length of the document).
  */
@@ -35,7 +35,7 @@
        private ArrayList<Annotation>[] annotations;
 
        /**
-        * next[j] is the smallest i such that j <= i and annotations[i] != 
null. If
+        * next[j] is the smallest i such that j &lt;= i and annotations[i] != 
null. If
         * there is not such i, then next[j] = -1.
         */
        private int[] next;
@@ -109,7 +109,7 @@
 
        /**
         * If endOffset is the offset of the end node of some annotation, for 
worst
-        * case constant time returns the smallest i >= endOffset such that 
there is
+        * case constant time returns the smallest i &gt;= endOffset such that 
there is
         * an annotation with start node having offset i. Returns -1 if no
         * annotation starts after endOffset. If endOffset is 0, returns the
         * smallest i such that there is an annotation with start node having 
offset

Modified: 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/com/ontotext/jape/pda/TransitionPDA.java
===================================================================
--- 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/com/ontotext/jape/pda/TransitionPDA.java
     2016-08-20 16:14:40 UTC (rev 19530)
+++ 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/com/ontotext/jape/pda/TransitionPDA.java
     2016-08-20 16:59:57 UTC (rev 19531)
@@ -44,7 +44,7 @@
         * associated with constraints. 2. type is TYPE_OPENING_ROUND_BRACKET = 
-2;
         * When a transition of this type is consumed during the traversal a new
         * binding set is opened. All consequent annotations are added in this 
set
-        * until it is not closed 3. type >= 0 When a transition of this type is
+        * until it is not closed 3. type &gt;= 0 When a transition of this 
type is
         * consumed during the traversal the last binding set is closed. The 
binding
         * label of all annotations in this last binding set is
         * arrayOfBindingNames[type], (arrayOfBindingNames is the member of 
FSM).

Modified: 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/gate/jape/plus/SPTBase.java
===================================================================
--- 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/gate/jape/plus/SPTBase.java
  2016-08-20 16:14:40 UTC (rev 19530)
+++ 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/gate/jape/plus/SPTBase.java
  2016-08-20 16:59:57 UTC (rev 19531)
@@ -127,7 +127,7 @@
      * Array representing the required constraints for applying this 
transition.
      * Each row represents a set of constraints; there is one row for each
      * annotation that needs to be matched. The elements of each row are:
-     * <table>
+     * <table summary="">
      * <tr>
      * <th>Position</th>
      * <th>Interpretation</th>

Modified: 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/gate/jape/plus/SPTBuilder.java
===================================================================
--- 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/gate/jape/plus/SPTBuilder.java
       2016-08-20 16:14:40 UTC (rev 19530)
+++ 
gate/branches/sawdust2/plugins/JAPE_Plus/src/main/java/gate/jape/plus/SPTBuilder.java
       2016-08-20 16:59:57 UTC (rev 19531)
@@ -491,7 +491,7 @@
    * Generates new states for all the old states in the provided FSM. Stores 
the newly 
    * created states into the {@link #newStates} list, and populates the 
mapping 
    * between old state IDs and new state IDs in {@link #oldToNewStates}.
-   * @param the {@link FSMPDA} from which the old states are obtained. 
+   * @param fsm the {@link FSMPDA} from which the old states are obtained. 
    */
   protected void createNewStates(FSMPDA fsm){
     LinkedList<StatePDA> oldStatesQueue = new LinkedList<StatePDA>();

This was sent by the SourceForge.net collaborative development platform, the 
world's largest Open Source development site.


------------------------------------------------------------------------------
_______________________________________________
GATE-cvs mailing list
GATE-cvs@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/gate-cvs

Reply via email to