New returns an initialised Bitset with optional initial bits v.

Len returns the length of the Bitset in bits.

Bits returns the contents of the Bitset.

New constructs a QRCode. var q *qrcode.QRCode q, err := qrcode.New("my content", qrcode.Medium) An error occurs if the content is too long.

numTerms returns the number of

String returns a human readable representation of the Bitset's contents.

set sets the module at (x, y) to v.

At returns the value of the bit at |index|.

get returns the module value at (x, y).

AppendBools appends bits to the Bitset.

set2dPattern sets a 2D array of modules, starting at (x, y).

AppendUint32 appends the numBits least significant bits from value.

gfMultiply returns a * b.

newDataEncoder constructs a dataEncoder.

NewFromBase2String constructs and returns a Bitset from a string. The string consists of '1', '0' or ' ' characters, e.g. "1010 0101". The '1' and '0'

encodedLength returns the number of bits required to encode n symbols in dataMode. The number of bits required is affected by: - QR code type - Mode

equals returns true if e == other.

numDataBits returns the data capacity in bits.

Append bits copied from |other|. The new length is b.Len() + other.Len().

Equals returns true if the Bitset equals other.

PNG returns the QR Code as a PNG image. size is both the image width and height in pixels. If size is too small then a larger image is silently retur

encode completes the steps required to encode the QR Code. These include adding the terminator bits and padding, splitting the data into blocks and ap

ensureCapacity ensures the Bitset can store an additional |numBits|. The underlying array is expanded if necessary. To prevent frequent reallocation,

getQRCodeVersion returns the QR Code version by version number and recovery level. Returns nil if the requested combination is not defined.

AppendByte appends the numBits least significant bits from value.

AppendNumBools appends num bits of value value.

Substr returns a substring, consisting of the bits from indexes start to end.

WriteFile writes the QR Code as a PNG image to the specified file. size is both the image width and height in pixels. If size is too small then a lar

empty returns true if the module at (x, y) has not been set (to either true or false).

gfPolyMultiply returns a * b.

gfDivide returns a / b. Divide by zero results in a panic.

gfPolyAdd returns a + b.

newSymbol constructs a symbol of size size*size, with a border of quietZoneSize.

Bitmap returns the QR Code as a 2D array of 1-bit pixels. bitmap[y][x] is true if the pixel at (x, y) is set. The bitmap includes the required "quie

ByteAt returns a byte consisting of upto 8 bits starting at index.

Encode data for QR Code 2005 using the appropriate Reed-Solomon code. numECBytes is the number of error correction bytes to append, and is determined

Write writes the QR Code as a PNG image to io.Writer. size is both the image width and height in pixels. If size is too small then a larger image is

bitmap returns the entire symbol, including the quiet zone.

charCountBits returns the number of bits used to encode the length of a data segment of type dataMode.

dataModeString returns d as a short printable string.

encode data as one or more segments and return the encoded data. The returned data does not include the terminator bit sequence.

encodeDataRaw encodes data in dataMode. The encoded data is appended to encoded.

formatInfo returns the 15-bit Format Information value for a QR code.

gfInverse returns the multiplicative inverse of a, a^-1. a * a^-1 = 1

gfPolyRemainder return the remainder of numerator / denominator.

modeIndicator returns the segment header bits for a segment of type dataMode.

newGFPolyMonomial returns term*(x^degree).

numBitsToPadToCodeword returns the number of bits required to pad data of length numDataBits upto the nearest codeword size.

penalty1 returns the penalty score for "adjacent modules in row/column with same colour". The numbers of adjacent matching modules and scores are: 0-

penalty2 returns the penalty score for "block of modules in the same colour". m*n: score = penaltyWeight2 * (m-1) * (n-1).

penalty3 returns the penalty score for "1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column, preceded or followed by light area 4 modul

penalty4 returns the penalty score...

rsGeneratorPoly returns the Reed-Solomon generator polynomial with |degree|. The generator polynomial is calculated as: (x + a^0)(x + a^1)...(x + a^d

symbolSize returns the size of the QR Code symbol in number of modules (which is both the width and height, since QR codes are square). The QR Code ha

versionInfo returns the 18-bit Version Information value for a QR Code. Version Information is applicable only to QR Codes versions 7-40 inclusive. n

AppendBytes appends a list of whole bytes.

Clone returns a copy.

Encode a QR Code and return a raw PNG image. size is both the image width and height in pixels. If size is too small then a larger image is silently

Image returns the QR Code as an image.Image. A positive size sets a fixed image width and height (e.g. 256 yields an 256x256px image). Depending on

NewWithForcedVersion constructs a QRCode of a specific version. var q *qrcode.QRCode q, err := qrcode.NewWithForcedVersion("my content", 25, qrcode

ToString produces a multi-line string that forms a QR-code image.

WriteFile encodes, then writes a QR Code to the given filename in PNG format. size is both the image width and height in pixels. If size is too small

addPadding pads the encoded data upto the full length required.

addTerminatorBits adds final terminator bits to the encoded data. The number of terminator bits required is determined when the QR Code version is ch

chooseQRCodeVersion chooses the most suitable QR Code version for a stated data length in bits, the error recovery level required, and the data encode

classifyDataModes classifies the raw data into unoptimised segments. e.g. "123ZZ#!#!" => [numeric, 3, "123"] [alphanumeric, 2, "ZZ"] [byte, 4, "#!#!"]

encodeAlphanumericChar returns the QR Code encoded value of v. v must be a QR Code defined alphanumeric character: 0-9, A-Z, SP, $%*+-./ or :. The ch

encodeBlocks takes the completed (terminated & padded) encoded data, splits the data into blocks (as specified by the QR Code version), applies error

gfAdd returns a + b.

newGFPolyFromData returns |data| as a polynomial over GF(2^8). Each data byte becomes the coefficient of an x term. For an n byte input the polynomi

numBlocks returns the number of blocks.

numEmptyModules returns the number of empty modules. Initially numEmptyModules is symbolSize * symbolSize. After every module has been set (to either

optimiseDataModes optimises the list of segments to reduce the overall output encoded data length. The algorithm coalesces adjacent segments. segment

penaltyScore returns the penalty score of the symbol. The penalty score consists of the sum of the four individual penalty types.

quietZoneSize returns the number of pixels of border space on each side of the QR Code. The quiet space assists with decoding.