Javadoc fixes

src/main/java/net/openhft/chronicle/hash/ChronicleHashBuilder.java

@@ -45,7 +45,8 @@ import java.util.concurrent.ConcurrentHashMap;
 import java.util.concurrent.TimeUnit;
 
 /**
- * This interface defines the meaning of configurations, common to {@link net.openhft.chronicle.map.ChronicleMapOnHeapUpdatableBuilder} and
+ * This interface defines the meaning of configurations, common to
+ * {@link net.openhft.chronicle.map.OnHeapUpdatableChronicleMapBuilder} and
  * {@link ChronicleSetBuilder}, i. e. <i>Chronicle hash container</i> configurations.
  *
  * <p>{@code ChronicleHashBuilder} is mutable. Configuration methods mutate the builder and return
@@ -129,8 +130,9 @@ public interface ChronicleHashBuilder<K, C extends ChronicleHash,
      * memory overuse and improve speed, you should pay decent attention to this configuration.
      *
      * <p>There are three major patterns of this configuration usage: <ol> <li>Key (and value, in
-     * {@code ChronicleMap} case) sizes are constant. Configure them via {@link
-     * #constantKeySizeBySample(Object)} and {@link net.openhft.chronicle.map.ChronicleMapOnHeapUpdatableBuilder#constantValueSizeBySample(Object)}
+     * {@code ChronicleMap} case) sizes are constant. Configure them via
+     * {@link #constantKeySizeBySample(Object)} and
+     * {@link net.openhft.chronicle.map.OnHeapUpdatableChronicleMapBuilder#constantValueSizeBySample(Object)}
      * methods, and you will experience no memory waste at all.</li> <li>Key (and/or value size, in
      * {@code ChronicleMap} case) varies moderately. Specify them using corresponding methods, or
      * specify entry size directly by calling this method, by sizes somewhere between average and
@@ -183,7 +185,7 @@ public interface ChronicleHashBuilder<K, C extends ChronicleHash,
      * memory unit).</li> <li>If key (and/or value, in {@code ChronicleMap} case) size varies
      * moderately, you should pass to this method the maximum number of entries + 5-25%, depending
      * on your data properties and configured {@linkplain #keySize(int) key}/{@linkplain
-     * net.openhft.chronicle.map.ChronicleMapOnHeapUpdatableBuilder#valueSize(int) value}/{@linkplain #entrySize(int) entry} sizes.</li>
+     * net.openhft.chronicle.map.OnHeapUpdatableChronicleMapBuilder#valueSize(int) value}/{@linkplain #entrySize(int) entry} sizes.</li>
      * <li>If your data size varies in a wide range, pass the maximum number of entries multiplied
      * by average data size and divided by the configured "entry size" (i. e. chunk size). See an
      * example in the documentation to {@link #entrySize(int)} method.</li> </ol>