diff --git a/java/io/nayuki/qrcodegen/QrCode.java b/java/io/nayuki/qrcodegen/QrCode.java index 04b58aa..361ba3a 100644 --- a/java/io/nayuki/qrcodegen/QrCode.java +++ b/java/io/nayuki/qrcodegen/QrCode.java @@ -82,8 +82,8 @@ public final class QrCode { * Returns a QR Code symbol representing the specified data segments at the specified error correction * level or higher. The smallest possible QR Code version is automatically chosen for the output. *
This function allows the user to create a custom sequence of segments that switches - * between modes (such as alphanumeric and binary) to encode text more efficiently. This - * function is considered to be lower level than simply encoding text or binary data.
+ * between modes (such as alphanumeric and binary) to encode text more efficiently. + * This function is considered to be lower level than simply encoding text or binary data. * @param segs the segments to encode * @param ecl the error correction level to use (will be boosted) * @return a QR Code representing the segments diff --git a/javascript/qrcodegen.js b/javascript/qrcodegen.js index b15868b..a035436 100644 --- a/javascript/qrcodegen.js +++ b/javascript/qrcodegen.js @@ -206,6 +206,7 @@ var qrcodegen = new function() { // Based on the given number of border modules to add as padding, this returns a // string whose contents represents an SVG XML file that depicts this QR Code symbol. + // Note that Unix newlines (\n) are always used, regardless of the platform. this.toSvgString = function(border) { if (border < 0) throw "Border must be non-negative"; diff --git a/rust/src/lib.rs b/rust/src/lib.rs index a25723e..6bcab38 100644 --- a/rust/src/lib.rs +++ b/rust/src/lib.rs @@ -598,7 +598,7 @@ impl QrCode { /*---- Private static helper functions ----*/ // Returns a set of positions of the alignment patterns in ascending order. These positions are - // used on both the x and y axes. Each value in the resulting array is in the range [0, 177). + // used on both the x and y axes. Each value in the resulting list is in the range [0, 177). // This stateless pure function could be implemented as table of 40 variable-length lists of unsigned bytes. fn get_alignment_pattern_positions(ver: u8) -> Vec