Improve itextcore's javadocs.

Do not use paragraph's end tags for separation reasons in Javadoc.
Javadoc isn't xml-based. It has its own markdown.

The changes have been inplemented during the third technical-debt session.

DEVSIX-3096

Autoported commit.
Original commit hash: [dbc6439b9]
Manual files:
io/src/main/java/com/itextpdf/io/codec/Base64.java
layout/src/main/java/com/itextpdf/layout/hyphenation/PatternParser.java
styled-xml-parser/src/main/java/com/itextpdf/styledxmlparser/jsoup/nodes/Attributes.java
styled-xml-parser/src/main/java/com/itextpdf/styledxmlparser/jsoup/select/Elements.java

Author: ars18wrw

itext/itext.barcodes/itext/barcodes/qrcode/BitArray.cs

@@ -45,7 +45,7 @@ source product.
 using System.Text;
 
 namespace iText.Barcodes.Qrcode {
-    /// <summary><p>A simple, fast array of bits, represented compactly by an array of ints internally.</p></summary>
+    /// <summary>A simple, fast array of bits, represented compactly by an array of ints internally.</summary>
     /// <author>Sean Owen</author>
     internal sealed class BitArray {
         private int[] bits;

itext/itext.barcodes/itext/barcodes/qrcode/BitMatrix.cs

@@ -45,16 +45,18 @@ source product.
 using System.Text;
 
 namespace iText.Barcodes.Qrcode {
-    /// <summary><p>Represents a 2D matrix of bits.</summary>
+    /// <summary>Represents a 2D matrix of bits.</summary>
     /// <remarks>
-    /// <p>Represents a 2D matrix of bits. In function arguments below, and throughout the common
+    /// Represents a 2D matrix of bits. In function arguments below, and throughout the common
     /// module, x is the column position, and y is the row position. The ordering is always x, y.
-    /// The origin is at the top-left.</p>
-    /// <p>Internally the bits are represented in a 1-D array of 32-bit ints. However, each row begins
+    /// The origin is at the top-left.
+    /// <p>
+    /// Internally the bits are represented in a 1-D array of 32-bit ints. However, each row begins
     /// with a new int. This is done intentionally so that we can copy out a row into a BitArray very
-    /// efficiently.</p>
-    /// <p>The ordering of bits is row-major. Within each int, the least significant bits are used first,
-    /// meaning they represent lower x values. This is compatible with BitArray's implementation.</p>
+    /// efficiently.
+    /// <p>
+    /// The ordering of bits is row-major. Within each int, the least significant bits are used first,
+    /// meaning they represent lower x values. This is compatible with BitArray's implementation.
     /// </remarks>
     /// <author>Sean Owen</author>
     /// <author>[email protected] (Daniel Switkin)</author>
@@ -86,7 +88,7 @@ public BitMatrix(int width, int height) {
             bits = new int[rowSize * height];
         }
 
-        /// <summary><p>Gets the requested bit, where true means black.</p></summary>
+        /// <summary>Gets the requested bit, where true means black.</summary>
         /// <param name="x">The horizontal component (i.e. which column)</param>
         /// <param name="y">The vertical component (i.e. which row)</param>
         /// <returns>value of given bit in matrix</returns>
@@ -95,15 +97,15 @@ public bool Get(int x, int y) {
             return (((int)(((uint)bits[offset]) >> (x & 0x1f))) & 1) != 0;
         }
 
-        /// <summary><p>Sets the given bit to true.</p></summary>
+        /// <summary>Sets the given bit to true.</summary>
         /// <param name="x">The horizontal component (i.e. which column)</param>
         /// <param name="y">The vertical component (i.e. which row)</param>
         public void Set(int x, int y) {
             int offset = y * rowSize + (x >> 5);
             bits[offset] |= 1 << (x & 0x1f);
         }
 
-        /// <summary><p>Flips the given bit.</p></summary>
+        /// <summary>Flips the given bit.</summary>
         /// <param name="x">The horizontal component (i.e. which column)</param>
         /// <param name="y">The vertical component (i.e. which row)</param>
         public void Flip(int x, int y) {
@@ -119,7 +121,7 @@ public void Clear() {
             }
         }
 
-        /// <summary><p>Sets a square region of the bit matrix to true.</p></summary>
+        /// <summary>Sets a square region of the bit matrix to true.</summary>
         /// <param name="left">The horizontal position to begin at (inclusive)</param>
         /// <param name="top">The vertical position to begin at (inclusive)</param>
         /// <param name="width">The width of the region</param>

itext/itext.barcodes/itext/barcodes/qrcode/ErrorCorrectionLevel.cs

@@ -44,10 +44,10 @@ source product.
 using System;
 
 namespace iText.Barcodes.Qrcode {
-    /// <summary><p>See ISO 18004:2006, 6.5.1.</summary>
+    /// <summary>See ISO 18004:2006, 6.5.1.</summary>
     /// <remarks>
-    /// <p>See ISO 18004:2006, 6.5.1. This enum encapsulates the four error correction levels
-    /// defined by the QR code standard.</p>
+    /// See ISO 18004:2006, 6.5.1. This enum encapsulates the four error correction levels
+    /// defined by the QR code standard.
     /// </remarks>
     /// <author>Sean Owen</author>
     public sealed class ErrorCorrectionLevel {

itext/itext.barcodes/itext/barcodes/qrcode/FormatInformation.cs

@@ -45,8 +45,8 @@ source product.
 
 namespace iText.Barcodes.Qrcode {
     /// <summary>
-    /// <p>Encapsulates a QR Code's format information, including the data mask used and
-    /// error correction level.</p>
+    /// Encapsulates a QR Code's format information, including the data mask used and
+    /// error correction level.
     /// </summary>
     /// <author>Sean Owen</author>
     /// <seealso cref="ErrorCorrectionLevel"/>

itext/itext.barcodes/itext/barcodes/qrcode/GF256.cs

@@ -45,15 +45,16 @@ source product.
 
 namespace iText.Barcodes.Qrcode {
     /// <summary>
-    /// <p>This class contains utility methods for performing mathematical operations over
+    /// This class contains utility methods for performing mathematical operations over
     /// the Galois Field GF(256).
     /// </summary>
     /// <remarks>
-    /// <p>This class contains utility methods for performing mathematical operations over
-    /// the Galois Field GF(256). Operations use a given primitive polynomial in calculations.</p>
-    /// <p>Throughout this package, elements of GF(256) are represented as an <code>int</code>
+    /// This class contains utility methods for performing mathematical operations over
+    /// the Galois Field GF(256). Operations use a given primitive polynomial in calculations.
+    /// <p>
+    /// Throughout this package, elements of GF(256) are represented as an <code>int</code>
     /// for convenience and speed (but at the cost of memory).
-    /// Only the bottom 8 bits are really used.</p>
+    /// Only the bottom 8 bits are really used.
     /// </remarks>
     /// <author>Sean Owen</author>
     internal sealed class GF256 {

itext/itext.barcodes/itext/barcodes/qrcode/GF256Poly.cs

@@ -45,12 +45,13 @@ source product.
 using System.Text;
 
 namespace iText.Barcodes.Qrcode {
-    /// <summary><p>Represents a polynomial whose coefficients are elements of GF(256).</summary>
+    /// <summary>Represents a polynomial whose coefficients are elements of GF(256).</summary>
     /// <remarks>
-    /// <p>Represents a polynomial whose coefficients are elements of GF(256).
-    /// Instances of this class are immutable.</p>
-    /// <p>Much credit is due to William Rucklidge since portions of this code are an indirect
-    /// port of his C++ Reed-Solomon implementation.</p>
+    /// Represents a polynomial whose coefficients are elements of GF(256).
+    /// Instances of this class are immutable.
+    /// <p>
+    /// Much credit is due to William Rucklidge since portions of this code are an indirect
+    /// port of his C++ Reed-Solomon implementation.
     /// </remarks>
     /// <author>Sean Owen</author>
     internal sealed class GF256Poly {

itext/itext.barcodes/itext/barcodes/qrcode/Mode.cs

@@ -44,10 +44,10 @@ source product.
 using System;
 
 namespace iText.Barcodes.Qrcode {
-    /// <summary><p>See ISO 18004:2006, 6.4.1, Tables 2 and 3.</summary>
+    /// <summary>See ISO 18004:2006, 6.4.1, Tables 2 and 3.</summary>
     /// <remarks>
-    /// <p>See ISO 18004:2006, 6.4.1, Tables 2 and 3. This enum encapsulates the various modes in which
-    /// data can be encoded to bits in the QR code standard.</p>
+    /// See ISO 18004:2006, 6.4.1, Tables 2 and 3. This enum encapsulates the various modes in which
+    /// data can be encoded to bits in the QR code standard.
     /// </remarks>
     /// <author>Sean Owen</author>
     internal sealed class Mode {

itext/itext.barcodes/itext/barcodes/qrcode/ReedSolomonEncoder.cs

@@ -45,7 +45,7 @@ source product.
 using System.Collections.Generic;
 
 namespace iText.Barcodes.Qrcode {
-    /// <summary><p>Implements Reed-Solomon encoding, as the name implies.</p></summary>
+    /// <summary>Implements Reed-Solomon encoding, as the name implies.</summary>
     /// <author>Sean Owen</author>
     /// <author>William Rucklidge</author>
     internal sealed class ReedSolomonEncoder {

itext/itext.barcodes/itext/barcodes/qrcode/ReedSolomonException.cs

@@ -45,8 +45,8 @@ source product.
 
 namespace iText.Barcodes.Qrcode {
     /// <summary>
-    /// <p>Thrown when an exception occurs during Reed-Solomon decoding, such as when
-    /// there are too many errors to correct.</p>
+    /// Thrown when an exception occurs during Reed-Solomon decoding, such as when
+    /// there are too many errors to correct.
     /// </summary>
     /// <author>Sean Owen</author>
     internal sealed class ReedSolomonException : Exception {

itext/itext.barcodes/itext/barcodes/qrcode/Version.cs

@@ -109,7 +109,7 @@ public Version.ECBlocks GetECBlocksForLevel(ErrorCorrectionLevel ecLevel) {
             return ecBlocks[ecLevel.Ordinal()];
         }
 
-        /// <summary><p>Deduces version information purely from QR Code dimensions.</p></summary>
+        /// <summary>Deduces version information purely from QR Code dimensions.</summary>
         /// <param name="dimension">dimension in modules</param>
         /// <returns>
         /// 
@@ -202,12 +202,12 @@ internal BitMatrix BuildFunctionPattern() {
             return bitMatrix;
         }
 
-        /// <summary><p>Encapsulates a set of error-correction blocks in one symbol version.</summary>
+        /// <summary>Encapsulates a set of error-correction blocks in one symbol version.</summary>
         /// <remarks>
-        /// <p>Encapsulates a set of error-correction blocks in one symbol version. Most versions will
+        /// Encapsulates a set of error-correction blocks in one symbol version. Most versions will
         /// use blocks of differing sizes within one version, so, this encapsulates the parameters for
         /// each set of blocks. It also holds the number of error-correction codewords per block since it
-        /// will be the same across all blocks within one version.</p>
+        /// will be the same across all blocks within one version.
         /// </remarks>
         public sealed class ECBlocks {
             private readonly int ecCodewordsPerBlock;
@@ -247,11 +247,11 @@ public Version.ECB[] GetECBlocks() {
             }
         }
 
-        /// <summary><p>Encapsualtes the parameters for one error-correction block in one symbol version.</summary>
+        /// <summary>Encapsualtes the parameters for one error-correction block in one symbol version.</summary>
         /// <remarks>
-        /// <p>Encapsualtes the parameters for one error-correction block in one symbol version.
+        /// Encapsualtes the parameters for one error-correction block in one symbol version.
         /// This includes the number of data codewords, and the number of times a block with these
-        /// parameters is used consecutively in the QR code version's format.</p>
+        /// parameters is used consecutively in the QR code version's format.
         /// </remarks>
         public sealed class ECB {
             private readonly int count;