Class: QrCodeMaker::QRPolynomial
- Inherits:
-
Object
- Object
- QrCodeMaker::QRPolynomial
- Defined in:
- lib/qr_code_maker/encoder.rb
Instance Method Summary collapse
- #get(index) ⇒ Object
- #get_length ⇒ Object
-
#initialize(num, shift) ⇒ QRPolynomial
constructor
A new instance of QRPolynomial.
- #mod(e) ⇒ Object
- #multiply(e) ⇒ Object
Constructor Details
#initialize(num, shift) ⇒ QRPolynomial
Returns a new instance of QRPolynomial.
112 113 114 115 116 117 118 119 120 121 122 123 124 125 |
# File 'lib/qr_code_maker/encoder.rb', line 112 def initialize(num, shift) raise QRCodeRunTimeError, "#{num.size}/#{shift}" if num.empty? offset = 0 while offset < num.size && num[offset] == 0 offset += 1 end @num = Array.new(num.size - offset + shift) (0...num.size - offset).each do |i| @num[i] = num[i + offset] end end |
Instance Method Details
#get(index) ⇒ Object
127 128 129 |
# File 'lib/qr_code_maker/encoder.rb', line 127 def get(index) @num[index] end |
#get_length ⇒ Object
131 132 133 |
# File 'lib/qr_code_maker/encoder.rb', line 131 def get_length @num.size end |
#mod(e) ⇒ Object
148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 |
# File 'lib/qr_code_maker/encoder.rb', line 148 def mod(e) if get_length - e.get_length < 0 return self end ratio = QRMath.glog(get(0)) - QRMath.glog(e.get(0)) num = Array.new(get_length) (0...get_length).each do |i| num[i] = get(i) end (0...e.get_length).each do |i| tmp = num[i].nil? ? 0 : num[i] num[i] = tmp ^ QRMath.gexp(QRMath.glog(e.get(i)) + ratio) end QRPolynomial.new(num, 0).mod(e) end |
#multiply(e) ⇒ Object
135 136 137 138 139 140 141 142 143 144 145 146 |
# File 'lib/qr_code_maker/encoder.rb', line 135 def multiply(e) num = Array.new(get_length + e.get_length - 1) (0...get_length).each do |i| (0...e.get_length).each do |j| tmp = num[i + j].nil? ? 0 : num[i + j] num[i + j] = tmp ^ QRMath.gexp(QRMath.glog(get(i)) + QRMath.glog(e.get(j))) end end QRPolynomial.new(num, 0) end |