Tweaked a few documentation comments.

javascript/qrcodegen.js

@@ -32,7 +32,7 @@
  *   - Function encodeSegments(list<QrSegment> segs, QrCode.Ecc ecl,
  *         int minVersion=1, int maxVersion=40, mask=-1, boostEcl=true) -> QrCode
  *   - Constants int MIN_VERSION, MAX_VERSION
- *   - Constructor QrCode(int version, QrCode.Ecc ecl, list<int> dataCodewords, int mask)
+ *   - Constructor QrCode(int version, QrCode.Ecc ecl, list<byte> dataCodewords, int mask)
  *   - Fields int version, size, mask
  *   - Field QrCode.Ecc errorCorrectionLevel
  *   - Method getModule(int x, int y) -> bool
@@ -42,7 +42,7 @@
  *     - Constants LOW, MEDIUM, QUARTILE, HIGH
  *     - Field int ordinal
  * - Class QrSegment:
- *   - Function makeBytes(list<int> data) -> QrSegment
+ *   - Function makeBytes(list<byte> data) -> QrSegment
  *   - Function makeNumeric(str data) -> QrSegment
  *   - Function makeAlphanumeric(str data) -> QrSegment
  *   - Function makeSegments(str text) -> list<QrSegment>

rust/src/lib.rs

@@ -779,7 +779,7 @@ impl QrCodeEcc {
 
 // Computes the Reed-Solomon error correction codewords for a sequence of data codewords
 // at a given degree. Objects are immutable, and the state only depends on the degree.
-// This class exists because each data block in a QR Code shares the same the divisor polynomial.
+// This struct and impl exist because each data block in a QR Code shares the same the divisor polynomial.
 struct ReedSolomonGenerator {
 	
 	// Coefficients of the divisor polynomial, stored from highest to lowest power, excluding the leading term which