You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 

310 lines
6.1 KiB

  1. // go-qrcode
  2. // Copyright 2014 Tom Harwood
  3. package qrcode
  4. import (
  5. bitset "github.com/skip2/go-qrcode/bitset"
  6. )
  7. type regularSymbol struct {
  8. version qrCodeVersion
  9. mask int
  10. data *bitset.Bitset
  11. symbol *symbol
  12. size int
  13. }
  14. // Abbreviated true/false.
  15. const (
  16. b0 = false
  17. b1 = true
  18. )
  19. var (
  20. alignmentPatternCenter = [][]int{
  21. {}, // Version 0 doesn't exist.
  22. {}, // Version 1 doesn't use alignment patterns.
  23. {6, 18},
  24. {6, 22},
  25. {6, 26},
  26. {6, 30},
  27. {6, 34},
  28. {6, 22, 38},
  29. {6, 24, 42},
  30. {6, 26, 46},
  31. {6, 28, 50},
  32. {6, 30, 54},
  33. {6, 32, 58},
  34. {6, 34, 62},
  35. {6, 26, 46, 66},
  36. {6, 26, 48, 70},
  37. {6, 26, 50, 74},
  38. {6, 30, 54, 78},
  39. {6, 30, 56, 82},
  40. {6, 30, 58, 86},
  41. {6, 34, 62, 90},
  42. {6, 28, 50, 72, 94},
  43. {6, 26, 50, 74, 98},
  44. {6, 30, 54, 78, 102},
  45. {6, 28, 54, 80, 106},
  46. {6, 32, 58, 84, 110},
  47. {6, 30, 58, 86, 114},
  48. {6, 34, 62, 90, 118},
  49. {6, 26, 50, 74, 98, 122},
  50. {6, 30, 54, 78, 102, 126},
  51. {6, 26, 52, 78, 104, 130},
  52. {6, 30, 56, 82, 108, 134},
  53. {6, 34, 60, 86, 112, 138},
  54. {6, 30, 58, 86, 114, 142},
  55. {6, 34, 62, 90, 118, 146},
  56. {6, 30, 54, 78, 102, 126, 150},
  57. {6, 24, 50, 76, 102, 128, 154},
  58. {6, 28, 54, 80, 106, 132, 158},
  59. {6, 32, 58, 84, 110, 136, 162},
  60. {6, 26, 54, 82, 110, 138, 166},
  61. {6, 30, 58, 86, 114, 142, 170},
  62. }
  63. finderPattern = [][]bool{
  64. {b1, b1, b1, b1, b1, b1, b1},
  65. {b1, b0, b0, b0, b0, b0, b1},
  66. {b1, b0, b1, b1, b1, b0, b1},
  67. {b1, b0, b1, b1, b1, b0, b1},
  68. {b1, b0, b1, b1, b1, b0, b1},
  69. {b1, b0, b0, b0, b0, b0, b1},
  70. {b1, b1, b1, b1, b1, b1, b1},
  71. }
  72. finderPatternSize = 7
  73. finderPatternHorizontalBorder = [][]bool{
  74. {b0, b0, b0, b0, b0, b0, b0, b0},
  75. }
  76. finderPatternVerticalBorder = [][]bool{
  77. {b0},
  78. {b0},
  79. {b0},
  80. {b0},
  81. {b0},
  82. {b0},
  83. {b0},
  84. {b0},
  85. }
  86. alignmentPattern = [][]bool{
  87. {b1, b1, b1, b1, b1},
  88. {b1, b0, b0, b0, b1},
  89. {b1, b0, b1, b0, b1},
  90. {b1, b0, b0, b0, b1},
  91. {b1, b1, b1, b1, b1},
  92. }
  93. )
  94. func buildRegularSymbol(version qrCodeVersion, mask int,
  95. data *bitset.Bitset) (*symbol, error) {
  96. m := &regularSymbol{
  97. version: version,
  98. mask: mask,
  99. data: data,
  100. symbol: newSymbol(version.symbolSize(), version.quietZoneSize()),
  101. size: version.symbolSize(),
  102. }
  103. m.addFinderPatterns()
  104. m.addAlignmentPatterns()
  105. m.addTimingPatterns()
  106. m.addFormatInfo()
  107. m.addVersionInfo()
  108. ok, err := m.addData()
  109. if !ok {
  110. return nil, err
  111. }
  112. return m.symbol, nil
  113. }
  114. func (m *regularSymbol) addFinderPatterns() {
  115. fpSize := finderPatternSize
  116. fp := finderPattern
  117. fpHBorder := finderPatternHorizontalBorder
  118. fpVBorder := finderPatternVerticalBorder
  119. // Top left Finder Pattern.
  120. m.symbol.set2dPattern(0, 0, fp)
  121. m.symbol.set2dPattern(0, fpSize, fpHBorder)
  122. m.symbol.set2dPattern(fpSize, 0, fpVBorder)
  123. // Top right Finder Pattern.
  124. m.symbol.set2dPattern(m.size-fpSize, 0, fp)
  125. m.symbol.set2dPattern(m.size-fpSize-1, fpSize, fpHBorder)
  126. m.symbol.set2dPattern(m.size-fpSize-1, 0, fpVBorder)
  127. // Bottom left Finder Pattern.
  128. m.symbol.set2dPattern(0, m.size-fpSize, fp)
  129. m.symbol.set2dPattern(0, m.size-fpSize-1, fpHBorder)
  130. m.symbol.set2dPattern(fpSize, m.size-fpSize-1, fpVBorder)
  131. }
  132. func (m *regularSymbol) addAlignmentPatterns() {
  133. for _, x := range alignmentPatternCenter[m.version.version] {
  134. for _, y := range alignmentPatternCenter[m.version.version] {
  135. if !m.symbol.empty(x, y) {
  136. continue
  137. }
  138. m.symbol.set2dPattern(x-2, y-2, alignmentPattern)
  139. }
  140. }
  141. }
  142. func (m *regularSymbol) addTimingPatterns() {
  143. value := true
  144. for i := finderPatternSize + 1; i < m.size-finderPatternSize; i++ {
  145. m.symbol.set(i, finderPatternSize-1, value)
  146. m.symbol.set(finderPatternSize-1, i, value)
  147. value = !value
  148. }
  149. }
  150. func (m *regularSymbol) addFormatInfo() {
  151. fpSize := finderPatternSize
  152. l := formatInfoLengthBits - 1
  153. f := m.version.formatInfo(m.mask)
  154. // Bits 0-7, under the top right finder pattern.
  155. for i := 0; i <= 7; i++ {
  156. m.symbol.set(m.size-i-1, fpSize+1, f.At(l-i))
  157. }
  158. // Bits 0-5, right of the top left finder pattern.
  159. for i := 0; i <= 5; i++ {
  160. m.symbol.set(fpSize+1, i, f.At(l-i))
  161. }
  162. // Bits 6-8 on the corner of the top left finder pattern.
  163. m.symbol.set(fpSize+1, fpSize, f.At(l-6))
  164. m.symbol.set(fpSize+1, fpSize+1, f.At(l-7))
  165. m.symbol.set(fpSize, fpSize+1, f.At(l-8))
  166. // Bits 9-14 on the underside of the top left finder pattern.
  167. for i := 9; i <= 14; i++ {
  168. m.symbol.set(14-i, fpSize+1, f.At(l-i))
  169. }
  170. // Bits 8-14 on the right side of the bottom left finder pattern.
  171. for i := 8; i <= 14; i++ {
  172. m.symbol.set(fpSize+1, m.size-fpSize+i-8, f.At(l-i))
  173. }
  174. // Always dark symbol.
  175. m.symbol.set(fpSize+1, m.size-fpSize-1, true)
  176. }
  177. func (m *regularSymbol) addVersionInfo() {
  178. fpSize := finderPatternSize
  179. v := m.version.versionInfo()
  180. l := versionInfoLengthBits - 1
  181. if v == nil {
  182. return
  183. }
  184. for i := 0; i < v.Len(); i++ {
  185. // Above the bottom left finder pattern.
  186. m.symbol.set(i/3, m.size-fpSize-4+i%3, v.At(l-i))
  187. // Left of the top right finder pattern.
  188. m.symbol.set(m.size-fpSize-4+i%3, i/3, v.At(l-i))
  189. }
  190. }
  191. type direction uint8
  192. const (
  193. up direction = iota
  194. down
  195. )
  196. func (m *regularSymbol) addData() (bool, error) {
  197. xOffset := 1
  198. dir := up
  199. x := m.size - 2
  200. y := m.size - 1
  201. for i := 0; i < m.data.Len(); i++ {
  202. var mask bool
  203. switch m.mask {
  204. case 0:
  205. mask = (y+x+xOffset)%2 == 0
  206. case 1:
  207. mask = y%2 == 0
  208. case 2:
  209. mask = (x+xOffset)%3 == 0
  210. case 3:
  211. mask = (y+x+xOffset)%3 == 0
  212. case 4:
  213. mask = (y/2+(x+xOffset)/3)%2 == 0
  214. case 5:
  215. mask = (y*(x+xOffset))%2+(y*(x+xOffset))%3 == 0
  216. case 6:
  217. mask = ((y*(x+xOffset))%2+((y*(x+xOffset))%3))%2 == 0
  218. case 7:
  219. mask = ((y+x+xOffset)%2+((y*(x+xOffset))%3))%2 == 0
  220. }
  221. // != is equivalent to XOR.
  222. m.symbol.set(x+xOffset, y, mask != m.data.At(i))
  223. if i == m.data.Len()-1 {
  224. break
  225. }
  226. // Find next free bit in the symbol.
  227. for {
  228. if xOffset == 1 {
  229. xOffset = 0
  230. } else {
  231. xOffset = 1
  232. if dir == up {
  233. if y > 0 {
  234. y--
  235. } else {
  236. dir = down
  237. x -= 2
  238. }
  239. } else {
  240. if y < m.size-1 {
  241. y++
  242. } else {
  243. dir = up
  244. x -= 2
  245. }
  246. }
  247. }
  248. // Skip over the vertical timing pattern entirely.
  249. if x == 5 {
  250. x--
  251. }
  252. if m.symbol.empty(x+xOffset, y) {
  253. break
  254. }
  255. }
  256. }
  257. return true, nil
  258. }