donatj\Printf\StringLexer

Complexity

Total Complexity

8

Size/Duplication

Total Lines	47
Duplicated Lines	0 %

Test Coverage

Coverage

95%

Importance

Changes	2
Bugs	0	Features	0

7 Methods

Rating	Name	Duplication	Size	Complexity
A	substr()	0	2	1
A	__construct()	0	2	1
A	next()	0	6	1
A	peek()	0	4	1
A	pos()	0	2	1
A	hasPrefix()	0	4	1
A	rewind()	0	5	2

<?php

namespace donatj\Printf;

class StringLexer {

	private int $pos = 0;

	private string $string;

	/**
	 * StringScanner constructor.
	 */
	public function __construct( string $string ) {
		$this->string = $string;
	}

	public function peek( int $size = 1 ) : CharData {
		$str = substr($this->string, $this->pos, $size);

		return new CharData($str, strlen($str) < $size);
	}

	public function pos() : int {
		return $this->pos;
	}

	public function next() : CharData {
		$data = $this->peek();

		$this->pos += $data->length();

		return $data;
	}

	public function rewind() : void {
		$this->pos--;
		if( $this->pos < 0 ) {
			//@todo custom exception
			throw new \RuntimeException('cannot rewind');
		}
	}

	public function hasPrefix( string $prefix ) : bool {
		$peek = $this->peek(strlen($prefix));

		return $peek->getString() === $prefix;
	}

	public function substr( int $start, int $length ) : string {
		return substr($this->string, $start, $length);
	}

}