chillerlan\QRCode\Polynomial

Complexity

Total Complexity

20

Size/Duplication

Total Lines	144
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Importance

Changes	3
Bugs	0	Features	1

7 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	3	1
A	setNum()	0	18	4
B	setTables()	0	22	4
A	multiply()	0	11	3
A	mod()	0	14	3
A	glog()	0	8	2
A	gexp()	0	11	3

<?php
/**
 * Class Polynomial
 *
 * @filesource   Polynomial.php
 * @created      25.11.2015
 * @package      chillerlan\QRCode
 * @author       Smiley <smiley@chillerlan.net>
 * @copyright    2015 Smiley
 * @license      MIT
 */

namespace chillerlan\QRCode;

/**
 *
 */
class Polynomial{

	/**
	 * @var array
	 */
	public $num = [];

	/**
	 * @var array
	 */
	protected $EXP_TABLE = [];

	/**
	 * @var array
	 */
	protected $LOG_TABLE = [];

	/**
	 * Polynomial constructor.
	 *
	 * @param array $num
	 * @param int   $shift
	 */
	public function __construct(array $num = [1], $shift = 0){
		$this->setNum($num, $shift)->setTables();
	}

	/**
	 * @param array $num
	 * @param int   $shift
	 *
	 * @return $this
	 */
	public function setNum(array $num, $shift = 0){
		$offset = 0;
		$numCount = count($num);

		while($offset < $numCount && $num[$offset] === 0){
			$offset++;
		}

		$this->num = array_fill(0, $numCount - $offset + $shift, 0);

		$i = 0;
		while($i < $numCount - $offset){
			$this->num[$i] = $num[$i + $offset];
			$i++;
		}

		return $this;
	}

	/**
	 *
	 */
	protected function setTables(){
		$this->EXP_TABLE = $this->LOG_TABLE = array_fill(0, 256, 0);

		$i = 0;
		while($i < 8){
			$this->EXP_TABLE[$i] = 1 << $i;
			$i++;
		}

		$i = 8;
		while($i < 256){
			$this->EXP_TABLE[$i] = $this->EXP_TABLE[$i - 4] ^ $this->EXP_TABLE[$i - 5] ^ $this->EXP_TABLE[$i - 6] ^ $this->EXP_TABLE[$i - 8];
			$i++;
		}

		$i = 0;
		while($i < 255){
			$this->LOG_TABLE[$this->EXP_TABLE[$i]] = $i;
			$i++;
		}

	}

	/**
	 * @param array $e
	 */
	public function multiply(array $e){
		$n = array_fill(0, count($this->num) + count($e) - 1, 0);

		foreach($this->num as $i => &$vi){
			foreach($e as $j => &$vj){
				$n[$i + $j] ^= $this->gexp($this->glog($vi) + $this->glog($vj));
			}
		}

		$this->setNum($n);
	}

	/**
	 * @param array $e
	 */
	public function mod(array $e){
		$n = $this->num;

		if(count($n) - count($e) < 0){
			return;
		}

		$ratio = $this->glog($n[0]) - $this->glog($e[0]);
		foreach($e as $i => &$v){
			$n[$i] ^= $this->gexp($this->glog($v) + $ratio);
		}

		$this->setNum($n)->mod($e);
	}

	/**
	 * @param int $n
	 *
	 * @return int
	 * @throws \chillerlan\QRCode\QRCodeException
	 */
	public function glog($n){

		if($n < 1){
			throw new QRCodeException('log('.$n.')');
		}

		return $this->LOG_TABLE[$n];
	}

	/**
	 * @param int $n
	 *
	 * @return int
	 */
	public function gexp($n){

		if($n < 0){
			$n += 255;
		}
		elseif($n >= 256){
			$n -= 255;
		}

		return $this->EXP_TABLE[$n];
	}

}