SRF\vCard\Address

Complexity

Total Complexity

5

Size/Duplication

Total Lines	52
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Importance

Changes

0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	4	1
B	text()	0	26	4

<?php

namespace SRF\vCard;

/**
 * Represents a single address entry in an vCard
 *
 * @see http://www.semantic-mediawiki.org/wiki/vCard
 *
 * @license GNU GPL v2+
 * @since 1.5
 *
 * @author Markus Krötzsch
 * @author Denny Vrandecic
 * @author Frank Dengler
 */
class Address {

	/**
	 * @var string
	 */
	private $type;

	/**
	 * @var array
	 */
	private $adr = [];

	/**
	 * @param string $type
	 * @param array $adr
	 */
	public function __construct( $type, array $adr ) {
		$this->type = $type;
		$this->adr = $adr;
	}

	/**
	 * @return string
	 */
	public function text() {

		if ( $this->type == "" ) {
			$this->type = "WORK";
		}

		$adr = [];

		// Expected sequence as defined by
		// https://tools.ietf.org/html/rfc6350#section-6.3.1
		$map = [
			'pobox',
			'ext',
			'street',
			'locality',
			'region',
			'code',
			'country'
		];

		foreach ( $map as $k ) {
			$adr[] = isset( $this->adr[$k] ) ? vCard::escape( $this->adr[$k] ) : '';
		}

		return "ADR;TYPE=$this->type;CHARSET=UTF-8:" . implode( ';', $adr ) . "\r\n";
	}

}