zxing_cpp_no_cmake 0.1.1

Sign up to get free protection for your applications and to get access to all the features.
Files changed (377) hide show
  1. checksums.yaml +7 -0
  2. data/.gitignore +13 -0
  3. data/.gitmodules +0 -0
  4. data/CHANGELOG.rdoc +6 -0
  5. data/Gemfile +3 -0
  6. data/Manifest.txt +375 -0
  7. data/README.rdoc +141 -0
  8. data/Rakefile +28 -0
  9. data/bin/zxd +87 -0
  10. data/bin/zxe +53 -0
  11. data/ext/zxing/extconf.rb +20 -0
  12. data/ext/zxing/zxing-cpp/.gitignore +2 -0
  13. data/ext/zxing/zxing-cpp/AUTHORS +115 -0
  14. data/ext/zxing/zxing-cpp/CMakeLists.txt +89 -0
  15. data/ext/zxing/zxing-cpp/COPYING +201 -0
  16. data/ext/zxing/zxing-cpp/NOTICE +65 -0
  17. data/ext/zxing/zxing-cpp/README.md +45 -0
  18. data/ext/zxing/zxing-cpp/build/CMakeCache.txt +382 -0
  19. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CMakeCCompiler.cmake +76 -0
  20. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CMakeCXXCompiler.cmake +79 -0
  21. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CMakeDetermineCompilerABI_C.bin +0 -0
  22. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CMakeDetermineCompilerABI_CXX.bin +0 -0
  23. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CMakeSystem.cmake +15 -0
  24. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CompilerIdC/CMakeCCompilerId.c +665 -0
  25. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CompilerIdC/a.out +0 -0
  26. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CompilerIdCXX/CMakeCXXCompilerId.cpp +644 -0
  27. data/ext/zxing/zxing-cpp/build/CMakeFiles/3.15.4/CompilerIdCXX/a.out +0 -0
  28. data/ext/zxing/zxing-cpp/build/CMakeFiles/CMakeDirectoryInformation.cmake +16 -0
  29. data/ext/zxing/zxing-cpp/build/CMakeFiles/CMakeOutput.log +447 -0
  30. data/ext/zxing/zxing-cpp/build/CMakeFiles/Makefile.cmake +125 -0
  31. data/ext/zxing/zxing-cpp/build/CMakeFiles/Makefile2 +177 -0
  32. data/ext/zxing/zxing-cpp/build/CMakeFiles/TargetDirectories.txt +9 -0
  33. data/ext/zxing/zxing-cpp/build/CMakeFiles/cmake.check_cache +1 -0
  34. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/CXX.includecache +1892 -0
  35. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/DependInfo.cmake +120 -0
  36. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/build.make +1584 -0
  37. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/cmake_clean.cmake +109 -0
  38. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/cmake_clean_target.cmake +3 -0
  39. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/depend.internal +1465 -0
  40. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/depend.make +1465 -0
  41. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/flags.make +10 -0
  42. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/link.txt +2 -0
  43. data/ext/zxing/zxing-cpp/build/CMakeFiles/libzxing.dir/progress.make +102 -0
  44. data/ext/zxing/zxing-cpp/build/CMakeFiles/progress.marks +1 -0
  45. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/CXX.includecache +344 -0
  46. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/DependInfo.cmake +33 -0
  47. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/build.make +266 -0
  48. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/cmake_clean.cmake +21 -0
  49. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/depend.internal +103 -0
  50. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/depend.make +103 -0
  51. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/flags.make +10 -0
  52. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/link.txt +1 -0
  53. data/ext/zxing/zxing-cpp/build/CMakeFiles/testrunner.dir/progress.make +14 -0
  54. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/CXX.includecache +378 -0
  55. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/DependInfo.cmake +25 -0
  56. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/build.make +145 -0
  57. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/cmake_clean.cmake +13 -0
  58. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/depend.internal +53 -0
  59. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/depend.make +53 -0
  60. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/flags.make +10 -0
  61. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/link.txt +1 -0
  62. data/ext/zxing/zxing-cpp/build/CMakeFiles/zxing.dir/progress.make +6 -0
  63. data/ext/zxing/zxing-cpp/build/Makefile +3706 -0
  64. data/ext/zxing/zxing-cpp/build/cmake_install.cmake +73 -0
  65. data/ext/zxing/zxing-cpp/build/libzxing.a +0 -0
  66. data/ext/zxing/zxing-cpp/build/testrunner +0 -0
  67. data/ext/zxing/zxing-cpp/build/zxing +0 -0
  68. data/ext/zxing/zxing-cpp/cli/src/ImageReaderSource.cpp +113 -0
  69. data/ext/zxing/zxing-cpp/cli/src/ImageReaderSource.h +40 -0
  70. data/ext/zxing/zxing-cpp/cli/src/jpgd.cpp +3174 -0
  71. data/ext/zxing/zxing-cpp/cli/src/jpgd.h +319 -0
  72. data/ext/zxing/zxing-cpp/cli/src/lodepng.cpp +6261 -0
  73. data/ext/zxing/zxing-cpp/cli/src/lodepng.h +1695 -0
  74. data/ext/zxing/zxing-cpp/cli/src/main.cpp +297 -0
  75. data/ext/zxing/zxing-cpp/cmake/FindCPPUNIT.cmake +54 -0
  76. data/ext/zxing/zxing-cpp/cmake/FindIconv.cmake +57 -0
  77. data/ext/zxing/zxing-cpp/core/src/bigint/.gitignore +6 -0
  78. data/ext/zxing/zxing-cpp/core/src/bigint/BigInteger.cc +405 -0
  79. data/ext/zxing/zxing-cpp/core/src/bigint/BigInteger.hh +215 -0
  80. data/ext/zxing/zxing-cpp/core/src/bigint/BigIntegerAlgorithms.cc +70 -0
  81. data/ext/zxing/zxing-cpp/core/src/bigint/BigIntegerAlgorithms.hh +25 -0
  82. data/ext/zxing/zxing-cpp/core/src/bigint/BigIntegerLibrary.hh +8 -0
  83. data/ext/zxing/zxing-cpp/core/src/bigint/BigIntegerUtils.cc +50 -0
  84. data/ext/zxing/zxing-cpp/core/src/bigint/BigIntegerUtils.hh +72 -0
  85. data/ext/zxing/zxing-cpp/core/src/bigint/BigUnsigned.cc +697 -0
  86. data/ext/zxing/zxing-cpp/core/src/bigint/BigUnsigned.hh +418 -0
  87. data/ext/zxing/zxing-cpp/core/src/bigint/BigUnsignedInABase.cc +125 -0
  88. data/ext/zxing/zxing-cpp/core/src/bigint/BigUnsignedInABase.hh +122 -0
  89. data/ext/zxing/zxing-cpp/core/src/bigint/ChangeLog +146 -0
  90. data/ext/zxing/zxing-cpp/core/src/bigint/Makefile +73 -0
  91. data/ext/zxing/zxing-cpp/core/src/bigint/NumberlikeArray.hh +177 -0
  92. data/ext/zxing/zxing-cpp/core/src/bigint/README +71 -0
  93. data/ext/zxing/zxing-cpp/core/src/win32/zxing/iconv.h +14 -0
  94. data/ext/zxing/zxing-cpp/core/src/win32/zxing/stdint.h +247 -0
  95. data/ext/zxing/zxing-cpp/core/src/win32/zxing/win_iconv.c +2035 -0
  96. data/ext/zxing/zxing-cpp/core/src/zxing/BarcodeFormat.cpp +40 -0
  97. data/ext/zxing/zxing-cpp/core/src/zxing/BarcodeFormat.h +60 -0
  98. data/ext/zxing/zxing-cpp/core/src/zxing/Binarizer.cpp +45 -0
  99. data/ext/zxing/zxing-cpp/core/src/zxing/Binarizer.h +50 -0
  100. data/ext/zxing/zxing-cpp/core/src/zxing/BinaryBitmap.cpp +70 -0
  101. data/ext/zxing/zxing-cpp/core/src/zxing/BinaryBitmap.h +56 -0
  102. data/ext/zxing/zxing-cpp/core/src/zxing/ChecksumException.cpp +28 -0
  103. data/ext/zxing/zxing-cpp/core/src/zxing/ChecksumException.h +34 -0
  104. data/ext/zxing/zxing-cpp/core/src/zxing/DecodeHints.cpp +142 -0
  105. data/ext/zxing/zxing-cpp/core/src/zxing/DecodeHints.h +85 -0
  106. data/ext/zxing/zxing-cpp/core/src/zxing/Exception.cpp +43 -0
  107. data/ext/zxing/zxing-cpp/core/src/zxing/Exception.h +51 -0
  108. data/ext/zxing/zxing-cpp/core/src/zxing/FormatException.cpp +41 -0
  109. data/ext/zxing/zxing-cpp/core/src/zxing/FormatException.h +37 -0
  110. data/ext/zxing/zxing-cpp/core/src/zxing/IllegalStateException.h +35 -0
  111. data/ext/zxing/zxing-cpp/core/src/zxing/InvertedLuminanceSource.cpp +68 -0
  112. data/ext/zxing/zxing-cpp/core/src/zxing/InvertedLuminanceSource.h +48 -0
  113. data/ext/zxing/zxing-cpp/core/src/zxing/LuminanceSource.cpp +86 -0
  114. data/ext/zxing/zxing-cpp/core/src/zxing/LuminanceSource.h +59 -0
  115. data/ext/zxing/zxing-cpp/core/src/zxing/MultiFormatReader.cpp +124 -0
  116. data/ext/zxing/zxing-cpp/core/src/zxing/MultiFormatReader.h +48 -0
  117. data/ext/zxing/zxing-cpp/core/src/zxing/NotFoundException.h +35 -0
  118. data/ext/zxing/zxing-cpp/core/src/zxing/Reader.cpp +31 -0
  119. data/ext/zxing/zxing-cpp/core/src/zxing/Reader.h +40 -0
  120. data/ext/zxing/zxing-cpp/core/src/zxing/ReaderException.h +37 -0
  121. data/ext/zxing/zxing-cpp/core/src/zxing/Result.cpp +61 -0
  122. data/ext/zxing/zxing-cpp/core/src/zxing/Result.h +55 -0
  123. data/ext/zxing/zxing-cpp/core/src/zxing/ResultIO.cpp +34 -0
  124. data/ext/zxing/zxing-cpp/core/src/zxing/ResultPoint.cpp +108 -0
  125. data/ext/zxing/zxing-cpp/core/src/zxing/ResultPoint.h +55 -0
  126. data/ext/zxing/zxing-cpp/core/src/zxing/ResultPointCallback.cpp +26 -0
  127. data/ext/zxing/zxing-cpp/core/src/zxing/ResultPointCallback.h +39 -0
  128. data/ext/zxing/zxing-cpp/core/src/zxing/ZXing.h +133 -0
  129. data/ext/zxing/zxing-cpp/core/src/zxing/aztec/AztecDetectorResult.cpp +54 -0
  130. data/ext/zxing/zxing-cpp/core/src/zxing/aztec/AztecDetectorResult.h +48 -0
  131. data/ext/zxing/zxing-cpp/core/src/zxing/aztec/AztecReader.cpp +68 -0
  132. data/ext/zxing/zxing-cpp/core/src/zxing/aztec/AztecReader.h +49 -0
  133. data/ext/zxing/zxing-cpp/core/src/zxing/aztec/decoder/Decoder.cpp +489 -0
  134. data/ext/zxing/zxing-cpp/core/src/zxing/aztec/decoder/Decoder.h +69 -0
  135. data/ext/zxing/zxing-cpp/core/src/zxing/aztec/detector/Detector.cpp +548 -0
  136. data/ext/zxing/zxing-cpp/core/src/zxing/aztec/detector/Detector.h +92 -0
  137. data/ext/zxing/zxing-cpp/core/src/zxing/common/Array.h +170 -0
  138. data/ext/zxing/zxing-cpp/core/src/zxing/common/BitArray.cpp +155 -0
  139. data/ext/zxing/zxing-cpp/core/src/zxing/common/BitArray.h +81 -0
  140. data/ext/zxing/zxing-cpp/core/src/zxing/common/BitArrayIO.cpp +31 -0
  141. data/ext/zxing/zxing-cpp/core/src/zxing/common/BitMatrix.cpp +143 -0
  142. data/ext/zxing/zxing-cpp/core/src/zxing/common/BitMatrix.h +91 -0
  143. data/ext/zxing/zxing-cpp/core/src/zxing/common/BitSource.cpp +76 -0
  144. data/ext/zxing/zxing-cpp/core/src/zxing/common/BitSource.h +74 -0
  145. data/ext/zxing/zxing-cpp/core/src/zxing/common/CharacterSetECI.cpp +105 -0
  146. data/ext/zxing/zxing-cpp/core/src/zxing/common/CharacterSetECI.h +53 -0
  147. data/ext/zxing/zxing-cpp/core/src/zxing/common/Counted.h +140 -0
  148. data/ext/zxing/zxing-cpp/core/src/zxing/common/DecoderResult.cpp +46 -0
  149. data/ext/zxing/zxing-cpp/core/src/zxing/common/DecoderResult.h +51 -0
  150. data/ext/zxing/zxing-cpp/core/src/zxing/common/DetectorResult.cpp +39 -0
  151. data/ext/zxing/zxing-cpp/core/src/zxing/common/DetectorResult.h +43 -0
  152. data/ext/zxing/zxing-cpp/core/src/zxing/common/GlobalHistogramBinarizer.cpp +212 -0
  153. data/ext/zxing/zxing-cpp/core/src/zxing/common/GlobalHistogramBinarizer.h +48 -0
  154. data/ext/zxing/zxing-cpp/core/src/zxing/common/GreyscaleLuminanceSource.cpp +80 -0
  155. data/ext/zxing/zxing-cpp/core/src/zxing/common/GreyscaleLuminanceSource.h +53 -0
  156. data/ext/zxing/zxing-cpp/core/src/zxing/common/GreyscaleRotatedLuminanceSource.cpp +81 -0
  157. data/ext/zxing/zxing-cpp/core/src/zxing/common/GreyscaleRotatedLuminanceSource.h +46 -0
  158. data/ext/zxing/zxing-cpp/core/src/zxing/common/GridSampler.cpp +122 -0
  159. data/ext/zxing/zxing-cpp/core/src/zxing/common/GridSampler.h +45 -0
  160. data/ext/zxing/zxing-cpp/core/src/zxing/common/HybridBinarizer.cpp +226 -0
  161. data/ext/zxing/zxing-cpp/core/src/zxing/common/HybridBinarizer.h +67 -0
  162. data/ext/zxing/zxing-cpp/core/src/zxing/common/IllegalArgumentException.cpp +27 -0
  163. data/ext/zxing/zxing-cpp/core/src/zxing/common/IllegalArgumentException.h +36 -0
  164. data/ext/zxing/zxing-cpp/core/src/zxing/common/PerspectiveTransform.cpp +107 -0
  165. data/ext/zxing/zxing-cpp/core/src/zxing/common/PerspectiveTransform.h +49 -0
  166. data/ext/zxing/zxing-cpp/core/src/zxing/common/Point.h +47 -0
  167. data/ext/zxing/zxing-cpp/core/src/zxing/common/Str.cpp +61 -0
  168. data/ext/zxing/zxing-cpp/core/src/zxing/common/Str.h +51 -0
  169. data/ext/zxing/zxing-cpp/core/src/zxing/common/StringUtils.cpp +198 -0
  170. data/ext/zxing/zxing-cpp/core/src/zxing/common/StringUtils.h +52 -0
  171. data/ext/zxing/zxing-cpp/core/src/zxing/common/detector/JavaMath.h +43 -0
  172. data/ext/zxing/zxing-cpp/core/src/zxing/common/detector/MathUtils.h +57 -0
  173. data/ext/zxing/zxing-cpp/core/src/zxing/common/detector/MonochromeRectangleDetector.cpp +175 -0
  174. data/ext/zxing/zxing-cpp/core/src/zxing/common/detector/MonochromeRectangleDetector.h +62 -0
  175. data/ext/zxing/zxing-cpp/core/src/zxing/common/detector/WhiteRectangleDetector.cpp +330 -0
  176. data/ext/zxing/zxing-cpp/core/src/zxing/common/detector/WhiteRectangleDetector.h +59 -0
  177. data/ext/zxing/zxing-cpp/core/src/zxing/common/reedsolomon/GenericGF.cpp +150 -0
  178. data/ext/zxing/zxing-cpp/core/src/zxing/common/reedsolomon/GenericGF.h +73 -0
  179. data/ext/zxing/zxing-cpp/core/src/zxing/common/reedsolomon/GenericGFPoly.cpp +218 -0
  180. data/ext/zxing/zxing-cpp/core/src/zxing/common/reedsolomon/GenericGFPoly.h +56 -0
  181. data/ext/zxing/zxing-cpp/core/src/zxing/common/reedsolomon/ReedSolomonDecoder.cpp +174 -0
  182. data/ext/zxing/zxing-cpp/core/src/zxing/common/reedsolomon/ReedSolomonDecoder.h +49 -0
  183. data/ext/zxing/zxing-cpp/core/src/zxing/common/reedsolomon/ReedSolomonException.cpp +30 -0
  184. data/ext/zxing/zxing-cpp/core/src/zxing/common/reedsolomon/ReedSolomonException.h +33 -0
  185. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/DataMatrixReader.cpp +54 -0
  186. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/DataMatrixReader.h +45 -0
  187. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/Version.cpp +199 -0
  188. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/Version.h +87 -0
  189. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/decoder/BitMatrixParser.cpp +361 -0
  190. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/decoder/BitMatrixParser.h +59 -0
  191. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/decoder/DataBlock.cpp +113 -0
  192. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/decoder/DataBlock.h +49 -0
  193. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/decoder/DecodedBitStreamParser.cpp +415 -0
  194. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/decoder/DecodedBitStreamParser.h +104 -0
  195. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/decoder/Decoder.cpp +93 -0
  196. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/decoder/Decoder.h +49 -0
  197. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/detector/CornerPoint.cpp +46 -0
  198. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/detector/CornerPoint.h +43 -0
  199. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/detector/Detector.cpp +447 -0
  200. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/detector/Detector.h +94 -0
  201. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/detector/DetectorException.cpp +23 -0
  202. data/ext/zxing/zxing-cpp/core/src/zxing/datamatrix/detector/DetectorException.h +23 -0
  203. data/ext/zxing/zxing-cpp/core/src/zxing/multi/ByQuadrantReader.cpp +75 -0
  204. data/ext/zxing/zxing-cpp/core/src/zxing/multi/ByQuadrantReader.h +42 -0
  205. data/ext/zxing/zxing-cpp/core/src/zxing/multi/GenericMultipleBarcodeReader.cpp +137 -0
  206. data/ext/zxing/zxing-cpp/core/src/zxing/multi/GenericMultipleBarcodeReader.h +51 -0
  207. data/ext/zxing/zxing-cpp/core/src/zxing/multi/MultipleBarcodeReader.cpp +29 -0
  208. data/ext/zxing/zxing-cpp/core/src/zxing/multi/MultipleBarcodeReader.h +41 -0
  209. data/ext/zxing/zxing-cpp/core/src/zxing/multi/qrcode/QRCodeMultiReader.cpp +58 -0
  210. data/ext/zxing/zxing-cpp/core/src/zxing/multi/qrcode/QRCodeMultiReader.h +36 -0
  211. data/ext/zxing/zxing-cpp/core/src/zxing/multi/qrcode/detector/MultiDetector.cpp +47 -0
  212. data/ext/zxing/zxing-cpp/core/src/zxing/multi/qrcode/detector/MultiDetector.h +37 -0
  213. data/ext/zxing/zxing-cpp/core/src/zxing/multi/qrcode/detector/MultiFinderPatternFinder.cpp +236 -0
  214. data/ext/zxing/zxing-cpp/core/src/zxing/multi/qrcode/detector/MultiFinderPatternFinder.h +47 -0
  215. data/ext/zxing/zxing-cpp/core/src/zxing/oned/CodaBarReader.cpp +340 -0
  216. data/ext/zxing/zxing-cpp/core/src/zxing/oned/CodaBarReader.h +57 -0
  217. data/ext/zxing/zxing-cpp/core/src/zxing/oned/Code128Reader.cpp +497 -0
  218. data/ext/zxing/zxing-cpp/core/src/zxing/oned/Code128Reader.h +48 -0
  219. data/ext/zxing/zxing-cpp/core/src/zxing/oned/Code39Reader.cpp +329 -0
  220. data/ext/zxing/zxing-cpp/core/src/zxing/oned/Code39Reader.h +63 -0
  221. data/ext/zxing/zxing-cpp/core/src/zxing/oned/Code93Reader.cpp +303 -0
  222. data/ext/zxing/zxing-cpp/core/src/zxing/oned/Code93Reader.h +58 -0
  223. data/ext/zxing/zxing-cpp/core/src/zxing/oned/EAN13Reader.cpp +85 -0
  224. data/ext/zxing/zxing-cpp/core/src/zxing/oned/EAN13Reader.h +49 -0
  225. data/ext/zxing/zxing-cpp/core/src/zxing/oned/EAN8Reader.cpp +65 -0
  226. data/ext/zxing/zxing-cpp/core/src/zxing/oned/EAN8Reader.h +47 -0
  227. data/ext/zxing/zxing-cpp/core/src/zxing/oned/ITFReader.cpp +337 -0
  228. data/ext/zxing/zxing-cpp/core/src/zxing/oned/ITFReader.h +54 -0
  229. data/ext/zxing/zxing-cpp/core/src/zxing/oned/MultiFormatOneDReader.cpp +96 -0
  230. data/ext/zxing/zxing-cpp/core/src/zxing/oned/MultiFormatOneDReader.h +38 -0
  231. data/ext/zxing/zxing-cpp/core/src/zxing/oned/MultiFormatUPCEANReader.cpp +110 -0
  232. data/ext/zxing/zxing-cpp/core/src/zxing/oned/MultiFormatUPCEANReader.h +41 -0
  233. data/ext/zxing/zxing-cpp/core/src/zxing/oned/OneDReader.cpp +228 -0
  234. data/ext/zxing/zxing-cpp/core/src/zxing/oned/OneDReader.h +81 -0
  235. data/ext/zxing/zxing-cpp/core/src/zxing/oned/OneDResultPoint.cpp +28 -0
  236. data/ext/zxing/zxing-cpp/core/src/zxing/oned/OneDResultPoint.h +35 -0
  237. data/ext/zxing/zxing-cpp/core/src/zxing/oned/UPCAReader.cpp +70 -0
  238. data/ext/zxing/zxing-cpp/core/src/zxing/oned/UPCAReader.h +50 -0
  239. data/ext/zxing/zxing-cpp/core/src/zxing/oned/UPCEANReader.cpp +309 -0
  240. data/ext/zxing/zxing-cpp/core/src/zxing/oned/UPCEANReader.h +88 -0
  241. data/ext/zxing/zxing-cpp/core/src/zxing/oned/UPCEReader.cpp +146 -0
  242. data/ext/zxing/zxing-cpp/core/src/zxing/oned/UPCEReader.h +47 -0
  243. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/PDF417Reader.cpp +170 -0
  244. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/PDF417Reader.h +49 -0
  245. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/BitMatrixParser.cpp +997 -0
  246. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/BitMatrixParser.h +84 -0
  247. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/DecodedBitStreamParser.cpp +563 -0
  248. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/DecodedBitStreamParser.h +84 -0
  249. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/Decoder.cpp +118 -0
  250. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/Decoder.h +62 -0
  251. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/ec/ErrorCorrection.cpp +214 -0
  252. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/ec/ErrorCorrection.h +71 -0
  253. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/ec/ModulusGF.cpp +120 -0
  254. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/ec/ModulusGF.h +72 -0
  255. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/ec/ModulusPoly.cpp +284 -0
  256. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/decoder/ec/ModulusPoly.h +68 -0
  257. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/detector/Detector.cpp +665 -0
  258. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/detector/Detector.h +106 -0
  259. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/detector/LinesSampler.cpp +715 -0
  260. data/ext/zxing/zxing-cpp/core/src/zxing/pdf417/detector/LinesSampler.h +122 -0
  261. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/ErrorCorrectionLevel.cpp +65 -0
  262. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/ErrorCorrectionLevel.h +52 -0
  263. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/FormatInformation.cpp +117 -0
  264. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/FormatInformation.h +54 -0
  265. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/QRCodeReader.cpp +52 -0
  266. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/QRCodeReader.h +48 -0
  267. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/Version.cpp +560 -0
  268. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/Version.h +85 -0
  269. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/BitMatrixParser.cpp +183 -0
  270. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/BitMatrixParser.h +56 -0
  271. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/DataBlock.cpp +118 -0
  272. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/DataBlock.h +50 -0
  273. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/DataMask.cpp +159 -0
  274. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/DataMask.h +50 -0
  275. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/DecodedBitStreamParser.cpp +428 -0
  276. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/DecodedBitStreamParser.h +72 -0
  277. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/Decoder.cpp +107 -0
  278. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/Decoder.h +46 -0
  279. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/Mode.cpp +90 -0
  280. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/decoder/Mode.h +57 -0
  281. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/AlignmentPattern.cpp +47 -0
  282. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/AlignmentPattern.h +45 -0
  283. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/AlignmentPatternFinder.cpp +208 -0
  284. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/AlignmentPatternFinder.h +68 -0
  285. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/Detector.cpp +315 -0
  286. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/Detector.h +69 -0
  287. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/FinderPattern.cpp +69 -0
  288. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/FinderPattern.h +48 -0
  289. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/FinderPatternFinder.cpp +559 -0
  290. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/FinderPatternFinder.h +76 -0
  291. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/FinderPatternInfo.cpp +41 -0
  292. data/ext/zxing/zxing-cpp/core/src/zxing/qrcode/detector/FinderPatternInfo.h +47 -0
  293. data/ext/zxing/zxing-cpp/core/tests/src/TestRunner.cpp +30 -0
  294. data/ext/zxing/zxing-cpp/core/tests/src/common/BitArrayTest.cpp +216 -0
  295. data/ext/zxing/zxing-cpp/core/tests/src/common/BitArrayTest.h +61 -0
  296. data/ext/zxing/zxing-cpp/core/tests/src/common/BitMatrixTest.cpp +106 -0
  297. data/ext/zxing/zxing-cpp/core/tests/src/common/BitMatrixTest.h +55 -0
  298. data/ext/zxing/zxing-cpp/core/tests/src/common/BitSourceTest.cpp +49 -0
  299. data/ext/zxing/zxing-cpp/core/tests/src/common/BitSourceTest.h +42 -0
  300. data/ext/zxing/zxing-cpp/core/tests/src/common/CountedTest.cpp +58 -0
  301. data/ext/zxing/zxing-cpp/core/tests/src/common/CountedTest.h +46 -0
  302. data/ext/zxing/zxing-cpp/core/tests/src/common/PerspectiveTransformTest.cpp +69 -0
  303. data/ext/zxing/zxing-cpp/core/tests/src/common/PerspectiveTransformTest.h +47 -0
  304. data/ext/zxing/zxing-cpp/core/tests/src/common/reedsolomon/ReedSolomonTest.cpp +129 -0
  305. data/ext/zxing/zxing-cpp/core/tests/src/common/reedsolomon/ReedSolomonTest.h +62 -0
  306. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/ErrorCorrectionLevelTest.cpp +47 -0
  307. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/ErrorCorrectionLevelTest.h +45 -0
  308. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/FormatInformationTest.cpp +88 -0
  309. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/FormatInformationTest.h +47 -0
  310. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/VersionTest.cpp +88 -0
  311. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/VersionTest.h +49 -0
  312. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/decoder/DataMaskTest.cpp +132 -0
  313. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/decoder/DataMaskTest.h +91 -0
  314. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/decoder/ModeTest.cpp +52 -0
  315. data/ext/zxing/zxing-cpp/core/tests/src/qrcode/decoder/ModeTest.h +47 -0
  316. data/ext/zxing/zxing.cc +224 -0
  317. data/lib/zxing.rb +50 -0
  318. data/lib/zxing/.gitignore +2 -0
  319. data/lib/zxing/aztec.rb +5 -0
  320. data/lib/zxing/aztec/aztec_reader.rb +14 -0
  321. data/lib/zxing/bad_image_exception.rb +4 -0
  322. data/lib/zxing/binarizer.rb +8 -0
  323. data/lib/zxing/binary_bitmap.rb +15 -0
  324. data/lib/zxing/checksum_exception.rb +4 -0
  325. data/lib/zxing/common.rb +7 -0
  326. data/lib/zxing/common/bit_matrix.rb +9 -0
  327. data/lib/zxing/common/hybrid_binarizer.rb +17 -0
  328. data/lib/zxing/common/illegal_argument_exception.rb +4 -0
  329. data/lib/zxing/datamatrix.rb +5 -0
  330. data/lib/zxing/datamatrix/data_matrix_reader.rb +14 -0
  331. data/lib/zxing/decodable.rb +11 -0
  332. data/lib/zxing/exception.rb +4 -0
  333. data/lib/zxing/ffi.rb +20 -0
  334. data/lib/zxing/ffi/aztec.rb +6 -0
  335. data/lib/zxing/ffi/aztec/aztec_reader.rb +9 -0
  336. data/lib/zxing/ffi/binarizer.rb +25 -0
  337. data/lib/zxing/ffi/binary_bitmap.rb +15 -0
  338. data/lib/zxing/ffi/common.rb +8 -0
  339. data/lib/zxing/ffi/common/bit_matrix.rb +12 -0
  340. data/lib/zxing/ffi/common/greyscale_luminance_source.rb +30 -0
  341. data/lib/zxing/ffi/common/hybrid_binarizer.rb +10 -0
  342. data/lib/zxing/ffi/datamatrix.rb +6 -0
  343. data/lib/zxing/ffi/datamatrix/data_matrix_reader.rb +9 -0
  344. data/lib/zxing/ffi/library.rb +102 -0
  345. data/lib/zxing/ffi/luminance_source.rb +18 -0
  346. data/lib/zxing/ffi/multi_format_reader.rb +9 -0
  347. data/lib/zxing/ffi/oned.rb +6 -0
  348. data/lib/zxing/ffi/oned/code_39_reader.rb +10 -0
  349. data/lib/zxing/ffi/qrcode.rb +8 -0
  350. data/lib/zxing/ffi/qrcode/decoder.rb +10 -0
  351. data/lib/zxing/ffi/qrcode/detector.rb +10 -0
  352. data/lib/zxing/ffi/reader.rb +58 -0
  353. data/lib/zxing/ffi/result.rb +23 -0
  354. data/lib/zxing/format_exception.rb +4 -0
  355. data/lib/zxing/illegal_argument_exception.rb +4 -0
  356. data/lib/zxing/image.rb +15 -0
  357. data/lib/zxing/luminance_source.rb +18 -0
  358. data/lib/zxing/multi_format_reader.rb +11 -0
  359. data/lib/zxing/not_found_exception.rb +4 -0
  360. data/lib/zxing/oned.rb +5 -0
  361. data/lib/zxing/oned/code_39_reader.rb +15 -0
  362. data/lib/zxing/qrcode.rb +8 -0
  363. data/lib/zxing/qrcode/decoder.rb +14 -0
  364. data/lib/zxing/qrcode/detector.rb +14 -0
  365. data/lib/zxing/qrcode/encoder.rb +8 -0
  366. data/lib/zxing/qrcode/encoder/byte_matrix.rb +18 -0
  367. data/lib/zxing/qrcode/encoder/encoder.rb +9 -0
  368. data/lib/zxing/qrcode/encoder/qrcode.rb +18 -0
  369. data/lib/zxing/reader.rb +8 -0
  370. data/lib/zxing/reader_exception.rb +4 -0
  371. data/lib/zxing/reed_solomon_exception.rb +2 -0
  372. data/lib/zxing/result.rb +18 -0
  373. data/lib/zxing/rmagick.rb +5 -0
  374. data/lib/zxing/rmagick/image.rb +109 -0
  375. data/lib/zxing/version.rb +33 -0
  376. data/zxing_cpp.gemspec +36 -0
  377. metadata +515 -0
@@ -0,0 +1,697 @@
1
+ #include "BigUnsigned.hh"
2
+
3
+ // Memory management definitions have moved to the bottom of NumberlikeArray.hh.
4
+
5
+ // The templates used by these constructors and converters are at the bottom of
6
+ // BigUnsigned.hh.
7
+
8
+ BigUnsigned::BigUnsigned(unsigned long x) { initFromPrimitive (x); }
9
+ BigUnsigned::BigUnsigned(unsigned int x) { initFromPrimitive (x); }
10
+ BigUnsigned::BigUnsigned(unsigned short x) { initFromPrimitive (x); }
11
+ BigUnsigned::BigUnsigned( long x) { initFromSignedPrimitive(x); }
12
+ BigUnsigned::BigUnsigned( int x) { initFromSignedPrimitive(x); }
13
+ BigUnsigned::BigUnsigned( short x) { initFromSignedPrimitive(x); }
14
+
15
+ unsigned long BigUnsigned::toUnsignedLong () const { return convertToPrimitive <unsigned long >(); }
16
+ unsigned int BigUnsigned::toUnsignedInt () const { return convertToPrimitive <unsigned int >(); }
17
+ unsigned short BigUnsigned::toUnsignedShort() const { return convertToPrimitive <unsigned short>(); }
18
+ long BigUnsigned::toLong () const { return convertToSignedPrimitive< long >(); }
19
+ int BigUnsigned::toInt () const { return convertToSignedPrimitive< int >(); }
20
+ short BigUnsigned::toShort () const { return convertToSignedPrimitive< short>(); }
21
+
22
+ // BIT/BLOCK ACCESSORS
23
+
24
+ void BigUnsigned::setBlock(Index i, Blk newBlock) {
25
+ if (newBlock == 0) {
26
+ if (i < len) {
27
+ blk[i] = 0;
28
+ zapLeadingZeros();
29
+ }
30
+ // If i >= len, no effect.
31
+ } else {
32
+ if (i >= len) {
33
+ // The nonzero block extends the number.
34
+ allocateAndCopy(i+1);
35
+ // Zero any added blocks that we aren't setting.
36
+ for (Index j = len; j < i; j++)
37
+ blk[j] = 0;
38
+ len = i+1;
39
+ }
40
+ blk[i] = newBlock;
41
+ }
42
+ }
43
+
44
+ /* Evidently the compiler wants BigUnsigned:: on the return type because, at
45
+ * that point, it hasn't yet parsed the BigUnsigned:: on the name to get the
46
+ * proper scope. */
47
+ BigUnsigned::Index BigUnsigned::bitLength() const {
48
+ if (isZero())
49
+ return 0;
50
+ else {
51
+ Blk leftmostBlock = getBlock(len - 1);
52
+ Index leftmostBlockLen = 0;
53
+ while (leftmostBlock != 0) {
54
+ leftmostBlock >>= 1;
55
+ leftmostBlockLen++;
56
+ }
57
+ return leftmostBlockLen + (len - 1) * N;
58
+ }
59
+ }
60
+
61
+ void BigUnsigned::setBit(Index bi, bool newBit) {
62
+ Index blockI = bi / N;
63
+ Blk block = getBlock(blockI), mask = Blk(1) << (bi % N);
64
+ block = newBit ? (block | mask) : (block & ~mask);
65
+ setBlock(blockI, block);
66
+ }
67
+
68
+ // COMPARISON
69
+ BigUnsigned::CmpRes BigUnsigned::compareTo(const BigUnsigned &x) const {
70
+ // A bigger length implies a bigger number.
71
+ if (len < x.len)
72
+ return less;
73
+ else if (len > x.len)
74
+ return greater;
75
+ else {
76
+ // Compare blocks one by one from left to right.
77
+ Index i = len;
78
+ while (i > 0) {
79
+ i--;
80
+ if (blk[i] == x.blk[i])
81
+ continue;
82
+ else if (blk[i] > x.blk[i])
83
+ return greater;
84
+ else
85
+ return less;
86
+ }
87
+ // If no blocks differed, the numbers are equal.
88
+ return equal;
89
+ }
90
+ }
91
+
92
+ // COPY-LESS OPERATIONS
93
+
94
+ /*
95
+ * On most calls to copy-less operations, it's safe to read the inputs little by
96
+ * little and write the outputs little by little. However, if one of the
97
+ * inputs is coming from the same variable into which the output is to be
98
+ * stored (an "aliased" call), we risk overwriting the input before we read it.
99
+ * In this case, we first compute the result into a temporary BigUnsigned
100
+ * variable and then copy it into the requested output variable *this.
101
+ * Each put-here operation uses the DTRT_ALIASED macro (Do The Right Thing on
102
+ * aliased calls) to generate code for this check.
103
+ *
104
+ * I adopted this approach on 2007.02.13 (see Assignment Operators in
105
+ * BigUnsigned.hh). Before then, put-here operations rejected aliased calls
106
+ * with an exception. I think doing the right thing is better.
107
+ *
108
+ * Some of the put-here operations can probably handle aliased calls safely
109
+ * without the extra copy because (for example) they process blocks strictly
110
+ * right-to-left. At some point I might determine which ones don't need the
111
+ * copy, but my reasoning would need to be verified very carefully. For now
112
+ * I'll leave in the copy.
113
+ */
114
+ #define DTRT_ALIASED(cond, op) \
115
+ if (cond) { \
116
+ BigUnsigned tmpThis; \
117
+ tmpThis.op; \
118
+ *this = tmpThis; \
119
+ return; \
120
+ }
121
+
122
+
123
+
124
+ void BigUnsigned::add(const BigUnsigned &a, const BigUnsigned &b) {
125
+ DTRT_ALIASED(this == &a || this == &b, add(a, b));
126
+ // If one argument is zero, copy the other.
127
+ if (a.len == 0) {
128
+ operator =(b);
129
+ return;
130
+ } else if (b.len == 0) {
131
+ operator =(a);
132
+ return;
133
+ }
134
+ // Some variables...
135
+ // Carries in and out of an addition stage
136
+ bool carryIn, carryOut;
137
+ Blk temp;
138
+ Index i;
139
+ // a2 points to the longer input, b2 points to the shorter
140
+ const BigUnsigned *a2, *b2;
141
+ if (a.len >= b.len) {
142
+ a2 = &a;
143
+ b2 = &b;
144
+ } else {
145
+ a2 = &b;
146
+ b2 = &a;
147
+ }
148
+ // Set prelimiary length and make room in this BigUnsigned
149
+ len = a2->len + 1;
150
+ allocate(len);
151
+ // For each block index that is present in both inputs...
152
+ for (i = 0, carryIn = false; i < b2->len; i++) {
153
+ // Add input blocks
154
+ temp = a2->blk[i] + b2->blk[i];
155
+ // If a rollover occurred, the result is less than either input.
156
+ // This test is used many times in the BigUnsigned code.
157
+ carryOut = (temp < a2->blk[i]);
158
+ // If a carry was input, handle it
159
+ if (carryIn) {
160
+ temp++;
161
+ carryOut |= (temp == 0);
162
+ }
163
+ blk[i] = temp; // Save the addition result
164
+ carryIn = carryOut; // Pass the carry along
165
+ }
166
+ // If there is a carry left over, increase blocks until
167
+ // one does not roll over.
168
+ for (; i < a2->len && carryIn; i++) {
169
+ temp = a2->blk[i] + 1;
170
+ carryIn = (temp == 0);
171
+ blk[i] = temp;
172
+ }
173
+ // If the carry was resolved but the larger number
174
+ // still has blocks, copy them over.
175
+ for (; i < a2->len; i++)
176
+ blk[i] = a2->blk[i];
177
+ // Set the extra block if there's still a carry, decrease length otherwise
178
+ if (carryIn)
179
+ blk[i] = 1;
180
+ else
181
+ len--;
182
+ }
183
+
184
+ void BigUnsigned::subtract(const BigUnsigned &a, const BigUnsigned &b) {
185
+ DTRT_ALIASED(this == &a || this == &b, subtract(a, b));
186
+ if (b.len == 0) {
187
+ // If b is zero, copy a.
188
+ operator =(a);
189
+ return;
190
+ } else if (a.len < b.len)
191
+ // If a is shorter than b, the result is negative.
192
+ throw "BigUnsigned::subtract: "
193
+ "Negative result in unsigned calculation";
194
+ // Some variables...
195
+ bool borrowIn, borrowOut;
196
+ Blk temp;
197
+ Index i;
198
+ // Set preliminary length and make room
199
+ len = a.len;
200
+ allocate(len);
201
+ // For each block index that is present in both inputs...
202
+ for (i = 0, borrowIn = false; i < b.len; i++) {
203
+ temp = a.blk[i] - b.blk[i];
204
+ // If a reverse rollover occurred,
205
+ // the result is greater than the block from a.
206
+ borrowOut = (temp > a.blk[i]);
207
+ // Handle an incoming borrow
208
+ if (borrowIn) {
209
+ borrowOut |= (temp == 0);
210
+ temp--;
211
+ }
212
+ blk[i] = temp; // Save the subtraction result
213
+ borrowIn = borrowOut; // Pass the borrow along
214
+ }
215
+ // If there is a borrow left over, decrease blocks until
216
+ // one does not reverse rollover.
217
+ for (; i < a.len && borrowIn; i++) {
218
+ borrowIn = (a.blk[i] == 0);
219
+ blk[i] = a.blk[i] - 1;
220
+ }
221
+ /* If there's still a borrow, the result is negative.
222
+ * Throw an exception, but zero out this object so as to leave it in a
223
+ * predictable state. */
224
+ if (borrowIn) {
225
+ len = 0;
226
+ throw "BigUnsigned::subtract: Negative result in unsigned calculation";
227
+ } else
228
+ // Copy over the rest of the blocks
229
+ for (; i < a.len; i++)
230
+ blk[i] = a.blk[i];
231
+ // Zap leading zeros
232
+ zapLeadingZeros();
233
+ }
234
+
235
+ /*
236
+ * About the multiplication and division algorithms:
237
+ *
238
+ * I searched unsucessfully for fast C++ built-in operations like the `b_0'
239
+ * and `c_0' Knuth describes in Section 4.3.1 of ``The Art of Computer
240
+ * Programming'' (replace `place' by `Blk'):
241
+ *
242
+ * ``b_0[:] multiplication of a one-place integer by another one-place
243
+ * integer, giving a two-place answer;
244
+ *
245
+ * ``c_0[:] division of a two-place integer by a one-place integer,
246
+ * provided that the quotient is a one-place integer, and yielding
247
+ * also a one-place remainder.''
248
+ *
249
+ * I also missed his note that ``[b]y adjusting the word size, if
250
+ * necessary, nearly all computers will have these three operations
251
+ * available'', so I gave up on trying to use algorithms similar to his.
252
+ * A future version of the library might include such algorithms; I
253
+ * would welcome contributions from others for this.
254
+ *
255
+ * I eventually decided to use bit-shifting algorithms. To multiply `a'
256
+ * and `b', we zero out the result. Then, for each `1' bit in `a', we
257
+ * shift `b' left the appropriate amount and add it to the result.
258
+ * Similarly, to divide `a' by `b', we shift `b' left varying amounts,
259
+ * repeatedly trying to subtract it from `a'. When we succeed, we note
260
+ * the fact by setting a bit in the quotient. While these algorithms
261
+ * have the same O(n^2) time complexity as Knuth's, the ``constant factor''
262
+ * is likely to be larger.
263
+ *
264
+ * Because I used these algorithms, which require single-block addition
265
+ * and subtraction rather than single-block multiplication and division,
266
+ * the innermost loops of all four routines are very similar. Study one
267
+ * of them and all will become clear.
268
+ */
269
+
270
+ /*
271
+ * This is a little inline function used by both the multiplication
272
+ * routine and the division routine.
273
+ *
274
+ * `getShiftedBlock' returns the `x'th block of `num << y'.
275
+ * `y' may be anything from 0 to N - 1, and `x' may be anything from
276
+ * 0 to `num.len'.
277
+ *
278
+ * Two things contribute to this block:
279
+ *
280
+ * (1) The `N - y' low bits of `num.blk[x]', shifted `y' bits left.
281
+ *
282
+ * (2) The `y' high bits of `num.blk[x-1]', shifted `N - y' bits right.
283
+ *
284
+ * But we must be careful if `x == 0' or `x == num.len', in
285
+ * which case we should use 0 instead of (2) or (1), respectively.
286
+ *
287
+ * If `y == 0', then (2) contributes 0, as it should. However,
288
+ * in some computer environments, for a reason I cannot understand,
289
+ * `a >> b' means `a >> (b % N)'. This means `num.blk[x-1] >> (N - y)'
290
+ * will return `num.blk[x-1]' instead of the desired 0 when `y == 0';
291
+ * the test `y == 0' handles this case specially.
292
+ */
293
+ inline BigUnsigned::Blk getShiftedBlock(const BigUnsigned &num,
294
+ BigUnsigned::Index x, unsigned int y) {
295
+ BigUnsigned::Blk part1 = (x == 0 || y == 0) ? 0 : (num.blk[x - 1] >> (BigUnsigned::N - y));
296
+ BigUnsigned::Blk part2 = (x == num.len) ? 0 : (num.blk[x] << y);
297
+ return part1 | part2;
298
+ }
299
+
300
+ void BigUnsigned::multiply(const BigUnsigned &a, const BigUnsigned &b) {
301
+ DTRT_ALIASED(this == &a || this == &b, multiply(a, b));
302
+ // If either a or b is zero, set to zero.
303
+ if (a.len == 0 || b.len == 0) {
304
+ len = 0;
305
+ return;
306
+ }
307
+ /*
308
+ * Overall method:
309
+ *
310
+ * Set this = 0.
311
+ * For each 1-bit of `a' (say the `i2'th bit of block `i'):
312
+ * Add `b << (i blocks and i2 bits)' to *this.
313
+ */
314
+ // Variables for the calculation
315
+ Index i, j, k;
316
+ unsigned int i2;
317
+ Blk temp;
318
+ bool carryIn, carryOut;
319
+ // Set preliminary length and make room
320
+ len = a.len + b.len;
321
+ allocate(len);
322
+ // Zero out this object
323
+ for (i = 0; i < len; i++)
324
+ blk[i] = 0;
325
+ // For each block of the first number...
326
+ for (i = 0; i < a.len; i++) {
327
+ // For each 1-bit of that block...
328
+ for (i2 = 0; i2 < N; i2++) {
329
+ if ((a.blk[i] & (Blk(1) << i2)) == 0)
330
+ continue;
331
+ /*
332
+ * Add b to this, shifted left i blocks and i2 bits.
333
+ * j is the index in b, and k = i + j is the index in this.
334
+ *
335
+ * `getShiftedBlock', a short inline function defined above,
336
+ * is now used for the bit handling. It replaces the more
337
+ * complex `bHigh' code, in which each run of the loop dealt
338
+ * immediately with the low bits and saved the high bits to
339
+ * be picked up next time. The last run of the loop used to
340
+ * leave leftover high bits, which were handled separately.
341
+ * Instead, this loop runs an additional time with j == b.len.
342
+ * These changes were made on 2005.01.11.
343
+ */
344
+ for (j = 0, k = i, carryIn = false; j <= b.len; j++, k++) {
345
+ /*
346
+ * The body of this loop is very similar to the body of the first loop
347
+ * in `add', except that this loop does a `+=' instead of a `+'.
348
+ */
349
+ temp = blk[k] + getShiftedBlock(b, j, i2);
350
+ carryOut = (temp < blk[k]);
351
+ if (carryIn) {
352
+ temp++;
353
+ carryOut |= (temp == 0);
354
+ }
355
+ blk[k] = temp;
356
+ carryIn = carryOut;
357
+ }
358
+ // No more extra iteration to deal with `bHigh'.
359
+ // Roll-over a carry as necessary.
360
+ for (; carryIn; k++) {
361
+ blk[k]++;
362
+ carryIn = (blk[k] == 0);
363
+ }
364
+ }
365
+ }
366
+ // Zap possible leading zero
367
+ if (blk[len - 1] == 0)
368
+ len--;
369
+ }
370
+
371
+ /*
372
+ * DIVISION WITH REMAINDER
373
+ * This monstrous function mods *this by the given divisor b while storing the
374
+ * quotient in the given object q; at the end, *this contains the remainder.
375
+ * The seemingly bizarre pattern of inputs and outputs was chosen so that the
376
+ * function copies as little as possible (since it is implemented by repeated
377
+ * subtraction of multiples of b from *this).
378
+ *
379
+ * "modWithQuotient" might be a better name for this function, but I would
380
+ * rather not change the name now.
381
+ */
382
+ void BigUnsigned::divideWithRemainder(const BigUnsigned &b, BigUnsigned &q) {
383
+ /* Defending against aliased calls is more complex than usual because we
384
+ * are writing to both *this and q.
385
+ *
386
+ * It would be silly to try to write quotient and remainder to the
387
+ * same variable. Rule that out right away. */
388
+ if (this == &q)
389
+ throw "BigUnsigned::divideWithRemainder: Cannot write quotient and remainder into the same variable";
390
+ /* Now *this and q are separate, so the only concern is that b might be
391
+ * aliased to one of them. If so, use a temporary copy of b. */
392
+ if (this == &b || &q == &b) {
393
+ BigUnsigned tmpB(b);
394
+ divideWithRemainder(tmpB, q);
395
+ return;
396
+ }
397
+
398
+ /*
399
+ * Knuth's definition of mod (which this function uses) is somewhat
400
+ * different from the C++ definition of % in case of division by 0.
401
+ *
402
+ * We let a / 0 == 0 (it doesn't matter much) and a % 0 == a, no
403
+ * exceptions thrown. This allows us to preserve both Knuth's demand
404
+ * that a mod 0 == a and the useful property that
405
+ * (a / b) * b + (a % b) == a.
406
+ */
407
+ if (b.len == 0) {
408
+ q.len = 0;
409
+ return;
410
+ }
411
+
412
+ /*
413
+ * If *this.len < b.len, then *this < b, and we can be sure that b doesn't go into
414
+ * *this at all. The quotient is 0 and *this is already the remainder (so leave it alone).
415
+ */
416
+ if (len < b.len) {
417
+ q.len = 0;
418
+ return;
419
+ }
420
+
421
+ // At this point we know (*this).len >= b.len > 0. (Whew!)
422
+
423
+ /*
424
+ * Overall method:
425
+ *
426
+ * For each appropriate i and i2, decreasing:
427
+ * Subtract (b << (i blocks and i2 bits)) from *this, storing the
428
+ * result in subtractBuf.
429
+ * If the subtraction succeeds with a nonnegative result:
430
+ * Turn on bit i2 of block i of the quotient q.
431
+ * Copy subtractBuf back into *this.
432
+ * Otherwise bit i2 of block i remains off, and *this is unchanged.
433
+ *
434
+ * Eventually q will contain the entire quotient, and *this will
435
+ * be left with the remainder.
436
+ *
437
+ * subtractBuf[x] corresponds to blk[x], not blk[x+i], since 2005.01.11.
438
+ * But on a single iteration, we don't touch the i lowest blocks of blk
439
+ * (and don't use those of subtractBuf) because these blocks are
440
+ * unaffected by the subtraction: we are subtracting
441
+ * (b << (i blocks and i2 bits)), which ends in at least `i' zero
442
+ * blocks. */
443
+ // Variables for the calculation
444
+ Index i, j, k;
445
+ unsigned int i2;
446
+ Blk temp;
447
+ bool borrowIn, borrowOut;
448
+
449
+ /*
450
+ * Make sure we have an extra zero block just past the value.
451
+ *
452
+ * When we attempt a subtraction, we might shift `b' so
453
+ * its first block begins a few bits left of the dividend,
454
+ * and then we'll try to compare these extra bits with
455
+ * a nonexistent block to the left of the dividend. The
456
+ * extra zero block ensures sensible behavior; we need
457
+ * an extra block in `subtractBuf' for exactly the same reason.
458
+ */
459
+ Index origLen = len; // Save real length.
460
+ /* To avoid an out-of-bounds access in case of reallocation, allocate
461
+ * first and then increment the logical length. */
462
+ allocateAndCopy(len + 1);
463
+ len++;
464
+ blk[origLen] = 0; // Zero the added block.
465
+
466
+ // subtractBuf holds part of the result of a subtraction; see above.
467
+ Blk *subtractBuf = new Blk[len];
468
+
469
+ // Set preliminary length for quotient and make room
470
+ q.len = origLen - b.len + 1;
471
+ q.allocate(q.len);
472
+ // Zero out the quotient
473
+ for (i = 0; i < q.len; i++)
474
+ q.blk[i] = 0;
475
+
476
+ // For each possible left-shift of b in blocks...
477
+ i = q.len;
478
+ while (i > 0) {
479
+ i--;
480
+ // For each possible left-shift of b in bits...
481
+ // (Remember, N is the number of bits in a Blk.)
482
+ q.blk[i] = 0;
483
+ i2 = N;
484
+ while (i2 > 0) {
485
+ i2--;
486
+ /*
487
+ * Subtract b, shifted left i blocks and i2 bits, from *this,
488
+ * and store the answer in subtractBuf. In the for loop, `k == i + j'.
489
+ *
490
+ * Compare this to the middle section of `multiply'. They
491
+ * are in many ways analogous. See especially the discussion
492
+ * of `getShiftedBlock'.
493
+ */
494
+ for (j = 0, k = i, borrowIn = false; j <= b.len; j++, k++) {
495
+ temp = blk[k] - getShiftedBlock(b, j, i2);
496
+ borrowOut = (temp > blk[k]);
497
+ if (borrowIn) {
498
+ borrowOut |= (temp == 0);
499
+ temp--;
500
+ }
501
+ // Since 2005.01.11, indices of `subtractBuf' directly match those of `blk', so use `k'.
502
+ subtractBuf[k] = temp;
503
+ borrowIn = borrowOut;
504
+ }
505
+ // No more extra iteration to deal with `bHigh'.
506
+ // Roll-over a borrow as necessary.
507
+ for (; k < origLen && borrowIn; k++) {
508
+ borrowIn = (blk[k] == 0);
509
+ subtractBuf[k] = blk[k] - 1;
510
+ }
511
+ /*
512
+ * If the subtraction was performed successfully (!borrowIn),
513
+ * set bit i2 in block i of the quotient.
514
+ *
515
+ * Then, copy the portion of subtractBuf filled by the subtraction
516
+ * back to *this. This portion starts with block i and ends--
517
+ * where? Not necessarily at block `i + b.len'! Well, we
518
+ * increased k every time we saved a block into subtractBuf, so
519
+ * the region of subtractBuf we copy is just [i, k).
520
+ */
521
+ if (!borrowIn) {
522
+ q.blk[i] |= (Blk(1) << i2);
523
+ while (k > i) {
524
+ k--;
525
+ blk[k] = subtractBuf[k];
526
+ }
527
+ }
528
+ }
529
+ }
530
+ // Zap possible leading zero in quotient
531
+ if (q.blk[q.len - 1] == 0)
532
+ q.len--;
533
+ // Zap any/all leading zeros in remainder
534
+ zapLeadingZeros();
535
+ // Deallocate subtractBuf.
536
+ // (Thanks to Brad Spencer for noticing my accidental omission of this!)
537
+ delete [] subtractBuf;
538
+ }
539
+
540
+ /* BITWISE OPERATORS
541
+ * These are straightforward blockwise operations except that they differ in
542
+ * the output length and the necessity of zapLeadingZeros. */
543
+
544
+ void BigUnsigned::bitAnd(const BigUnsigned &a, const BigUnsigned &b) {
545
+ DTRT_ALIASED(this == &a || this == &b, bitAnd(a, b));
546
+ // The bitwise & can't be longer than either operand.
547
+ len = (a.len >= b.len) ? b.len : a.len;
548
+ allocate(len);
549
+ Index i;
550
+ for (i = 0; i < len; i++)
551
+ blk[i] = a.blk[i] & b.blk[i];
552
+ zapLeadingZeros();
553
+ }
554
+
555
+ void BigUnsigned::bitOr(const BigUnsigned &a, const BigUnsigned &b) {
556
+ DTRT_ALIASED(this == &a || this == &b, bitOr(a, b));
557
+ Index i;
558
+ const BigUnsigned *a2, *b2;
559
+ if (a.len >= b.len) {
560
+ a2 = &a;
561
+ b2 = &b;
562
+ } else {
563
+ a2 = &b;
564
+ b2 = &a;
565
+ }
566
+ allocate(a2->len);
567
+ for (i = 0; i < b2->len; i++)
568
+ blk[i] = a2->blk[i] | b2->blk[i];
569
+ for (; i < a2->len; i++)
570
+ blk[i] = a2->blk[i];
571
+ len = a2->len;
572
+ // Doesn't need zapLeadingZeros.
573
+ }
574
+
575
+ void BigUnsigned::bitXor(const BigUnsigned &a, const BigUnsigned &b) {
576
+ DTRT_ALIASED(this == &a || this == &b, bitXor(a, b));
577
+ Index i;
578
+ const BigUnsigned *a2, *b2;
579
+ if (a.len >= b.len) {
580
+ a2 = &a;
581
+ b2 = &b;
582
+ } else {
583
+ a2 = &b;
584
+ b2 = &a;
585
+ }
586
+ allocate(a2->len);
587
+ for (i = 0; i < b2->len; i++)
588
+ blk[i] = a2->blk[i] ^ b2->blk[i];
589
+ for (; i < a2->len; i++)
590
+ blk[i] = a2->blk[i];
591
+ len = a2->len;
592
+ zapLeadingZeros();
593
+ }
594
+
595
+ void BigUnsigned::bitShiftLeft(const BigUnsigned &a, int b) {
596
+ DTRT_ALIASED(this == &a, bitShiftLeft(a, b));
597
+ if (b < 0) {
598
+ if (b << 1 == 0)
599
+ throw "BigUnsigned::bitShiftLeft: "
600
+ "Pathological shift amount not implemented";
601
+ else {
602
+ bitShiftRight(a, -b);
603
+ return;
604
+ }
605
+ }
606
+ Index shiftBlocks = b / N;
607
+ unsigned int shiftBits = b % N;
608
+ // + 1: room for high bits nudged left into another block
609
+ len = a.len + shiftBlocks + 1;
610
+ allocate(len);
611
+ Index i, j;
612
+ for (i = 0; i < shiftBlocks; i++)
613
+ blk[i] = 0;
614
+ for (j = 0, i = shiftBlocks; j <= a.len; j++, i++)
615
+ blk[i] = getShiftedBlock(a, j, shiftBits);
616
+ // Zap possible leading zero
617
+ if (blk[len - 1] == 0)
618
+ len--;
619
+ }
620
+
621
+ void BigUnsigned::bitShiftRight(const BigUnsigned &a, int b) {
622
+ DTRT_ALIASED(this == &a, bitShiftRight(a, b));
623
+ if (b < 0) {
624
+ if (b << 1 == 0)
625
+ throw "BigUnsigned::bitShiftRight: "
626
+ "Pathological shift amount not implemented";
627
+ else {
628
+ bitShiftLeft(a, -b);
629
+ return;
630
+ }
631
+ }
632
+ // This calculation is wacky, but expressing the shift as a left bit shift
633
+ // within each block lets us use getShiftedBlock.
634
+ Index rightShiftBlocks = (b + N - 1) / N;
635
+ unsigned int leftShiftBits = N * rightShiftBlocks - b;
636
+ // Now (N * rightShiftBlocks - leftShiftBits) == b
637
+ // and 0 <= leftShiftBits < N.
638
+ if (rightShiftBlocks >= a.len + 1) {
639
+ // All of a is guaranteed to be shifted off, even considering the left
640
+ // bit shift.
641
+ len = 0;
642
+ return;
643
+ }
644
+ // Now we're allocating a positive amount.
645
+ // + 1: room for high bits nudged left into another block
646
+ len = a.len + 1 - rightShiftBlocks;
647
+ allocate(len);
648
+ Index i, j;
649
+ for (j = rightShiftBlocks, i = 0; j <= a.len; j++, i++)
650
+ blk[i] = getShiftedBlock(a, j, leftShiftBits);
651
+ // Zap possible leading zero
652
+ if (blk[len - 1] == 0)
653
+ len--;
654
+ }
655
+
656
+ // INCREMENT/DECREMENT OPERATORS
657
+
658
+ // Prefix increment
659
+ void BigUnsigned::operator ++() {
660
+ Index i;
661
+ bool carry = true;
662
+ for (i = 0; i < len && carry; i++) {
663
+ blk[i]++;
664
+ carry = (blk[i] == 0);
665
+ }
666
+ if (carry) {
667
+ // Allocate and then increase length, as in divideWithRemainder
668
+ allocateAndCopy(len + 1);
669
+ len++;
670
+ blk[i] = 1;
671
+ }
672
+ }
673
+
674
+ // Postfix increment: same as prefix
675
+ void BigUnsigned::operator ++(int) {
676
+ operator ++();
677
+ }
678
+
679
+ // Prefix decrement
680
+ void BigUnsigned::operator --() {
681
+ if (len == 0)
682
+ throw "BigUnsigned::operator --(): Cannot decrement an unsigned zero";
683
+ Index i;
684
+ bool borrow = true;
685
+ for (i = 0; borrow; i++) {
686
+ borrow = (blk[i] == 0);
687
+ blk[i]--;
688
+ }
689
+ // Zap possible leading zero (there can only be one)
690
+ if (blk[len - 1] == 0)
691
+ len--;
692
+ }
693
+
694
+ // Postfix decrement: same as prefix
695
+ void BigUnsigned::operator --(int) {
696
+ operator --();
697
+ }