Context Navigation

main

Timestamp:

11/29/17 14:55:48 (7 years ago)

Author:

pharms

Message:

Location:

Files:

-                      r2026
+                      r2218
      * Generates a random sequence of events. The sequence starts with {@link Event#STARTEVENT} and
      * finishes with
+     * </p>
      * <ul>
      * <li>{@link Event#ENDEVENT} if validEnd==true.</li>
 …
      * is reached and the final event of the sequence must not be {@link Event#ENDEVENT}.</li>
      * </ul>
-     * </p>
+     *
      * @param maxLength

r2049	r2218
58	58	* <p>
59	59	* Calculates the probability of the next Event being symbol based on the order of the Markov
60		* model. The order is defined in the constructor {@link #HighOrderMarkovModel(int, Random)}.
	60	* model. The order is defined in the constructor {@link #InvertedHighOrderMarkovModel(int, Random)}.
61	61	* </p>
62	62	*

r927	r2218
30	30	* <p>
31	31	* If possible, the normal high-order markov model should be used, as the Events may be broken by
32		* the flattener, as, e.g., the information ~~{@link ReplayableEvent}~~s contain is not preserved.
	32	* the flattener, as, e.g., the information replayable events contain is not preserved.
33	33	* </p>
34	34	*

r1282	r2218
31	31	* symbols as equal. The method must be commutative and transitive, i.e.,
32	32	* <code>equals(symbol1, symbol2) == equals(symbol2, symbol1)</code> and
33		* <code>if (equals(symbol1, symbol2) && equals(symbol2, symbol3)) then
	33	* <code>if (equals(symbol1, symbol2) && equals(symbol2, symbol3)) then
34	34	* equals(symbol1, symbol3)</code>.
35	35	* </p>

-                      r1282
+                      r2218
  * @author Patrick Harms
+ *
  * @param <T>
+ * @param <K>
  *            Type of the symbols that are stored
  * @param <V>
 …
      * @param value  the value to associate to the symbol in this map
+     *
-     * @return as described
+     *
      * @throws IllegalArgumentException if the provided symbol is null
      */

r1282	r2218
29	29	/**
30	30	* <p>
31		* This class implements a ~~<it>trie</it>~~, i.e., a tree of sequences that represents the occurrence
	31	* This class implements a trie, i.e., a tree of sequences that represents the occurrence
32	32	* of subsequences up to a predefined length. This length is the trie order.
33	33	* </p>

Note: See TracChangeset for help on using the changeset viewer.