当前位置: 编程技术>php
本页文章导读:
▪PHP接口实现多重继承的实例分享 本文主要内容:
php接口实现多重继承。
说明:
PHP类是单继承的,不过可以通过其它特殊的方式实现多重继承,比如使用接口实现,只要把类的特征抽象为接口,并通过实现接口的方式让对.........
▪有关php=操作符的优先级问题 在php中,有时会遇到=操作符的优先级问题。
比如:
代码示例:
$a = '1';
$b = '2';
$c = '3';
($a == $b || !$c = '4' || $c = '5') && $c = '6';
echo $c;
!$c = '4' || $c = '5' 表达式等价于!$c = (.........
▪PHP实现双向链表的一例代码 本节主要内容:
PHP双向链表
实例代码:
代码示例:
<?php
/**
* **双向链表
* @author zhiyuan12@
* @modified 2012-10-25
* @site: www.
*/
/**
* 链表元素结点类
*/
class Node_Element.........
[1]PHP接口实现多重继承的实例分享
来源: 互联网 发布时间: 2013-12-24
本文主要内容:
php接口实现多重继承。
说明:
PHP类是单继承的,不过可以通过其它特殊的方式实现多重继承,比如使用接口实现,只要把类的特征抽象为接口,并通过实现接口的方式让对象有多重身份,如此便可以模拟多重继承。
这里分享一个用接口模拟多重继承的例子:
代码示例:
<?
/**
* php接口实现多重继承
* edit: www.
*/
interface UserInterface{ // 定义User的接口
function getname();
}
interface TeacherInterface{ //teacher 相关接口
function getLengthOfService();
}
class User implements UserInterface { // 实现UserInterface接口
private $name = "tom";
public function getName(){
return $this->name;
}
}
class Teacher implements TeacherInterface { // 实现TeacherInterface接口
private $lengthOfService = 5; // 工 龄
public function getLengthOfService(){
return $this->lengthOfService;
}
}
// 继承自User类,同时实现了 TeacherInterface接口.
class GraduateStudent extends User implements TeacherInterface {
private $teacher ;
public function __construct(){
$this->teacher = new Teacher();
}
public function getLengthOfService(){
return $this->teacher->getLengthOfService();
}
}
class Act{
//注意,类型提示改成了接口类型
public static function getUserName(UserInterface $_user){
echo "Name is " . $_user->getName() ."<br>";
}
//类型提示改成了 TeacherInterface类型.
public static function getLengthOfService(TeacherInterface $_teacher){
echo "Age is " .$_teacher->getLengthOfService() ."<br>";
}
}
$graduateStudent = new GraduateStudent();
Act::getUserName($graduateStudent);
Act::getLengthOfService($graduateStudent);
//实现多重身份的一个对象.
?>
/**
* php接口实现多重继承
* edit: www.
*/
interface UserInterface{ // 定义User的接口
function getname();
}
interface TeacherInterface{ //teacher 相关接口
function getLengthOfService();
}
class User implements UserInterface { // 实现UserInterface接口
private $name = "tom";
public function getName(){
return $this->name;
}
}
class Teacher implements TeacherInterface { // 实现TeacherInterface接口
private $lengthOfService = 5; // 工 龄
public function getLengthOfService(){
return $this->lengthOfService;
}
}
// 继承自User类,同时实现了 TeacherInterface接口.
class GraduateStudent extends User implements TeacherInterface {
private $teacher ;
public function __construct(){
$this->teacher = new Teacher();
}
public function getLengthOfService(){
return $this->teacher->getLengthOfService();
}
}
class Act{
//注意,类型提示改成了接口类型
public static function getUserName(UserInterface $_user){
echo "Name is " . $_user->getName() ."<br>";
}
//类型提示改成了 TeacherInterface类型.
public static function getLengthOfService(TeacherInterface $_teacher){
echo "Age is " .$_teacher->getLengthOfService() ."<br>";
}
}
$graduateStudent = new GraduateStudent();
Act::getUserName($graduateStudent);
Act::getLengthOfService($graduateStudent);
//实现多重身份的一个对象.
?>
示例结果:
Name is tom
Age is 5
[2]有关php=操作符的优先级问题
来源: 互联网 发布时间: 2013-12-24
在php中,有时会遇到=操作符的优先级问题。
比如:
代码示例:
$a = '1';
$b = '2';
$c = '3';
($a == $b || !$c = '4' || $c = '5') && $c = '6';
echo $c;
!$c = '4' || $c = '5' 表达式等价于!$c = ('4' || $c = '5')并等价于false。
$b = '2';
$c = '3';
($a == $b || !$c = '4' || $c = '5') && $c = '6';
echo $c;
!$c = '4' || $c = '5' 表达式等价于!$c = ('4' || $c = '5')并等价于false。
PHP在线中文手册中的说明:
Although = has a lower precedence than most other operators, PHP will still allow expressions similar to the following: if (!$a = foo()), in which case the return value of foo() is put into $a.
因此,输出结果为1。
希望以上的小例子,有助于大家理解php中=操作符的优先级,及其用法。
[3]PHP实现双向链表的一例代码
来源: 互联网 发布时间: 2013-12-24
本节主要内容:
PHP双向链表
实例代码:
代码示例:
<?php
/**
* **双向链表
* @author zhiyuan12@
* @modified 2012-10-25
* @site: www.
*/
/**
* 链表元素结点类
*/
class Node_Element {
public $pre = NULL; // 前驱
public $next = NULL; // 后继
public $key = NULL; // 元素键值
public $data = NULL; // 结点值
function __Construct($key, $data) {
$this->key = $key;
$this->data = $data;
}
}
/**
* 双向链表类
*/
class DoubleLinkedList {
private $head; // 头指针
private $tail; // 尾指针
private $current; // 当前指针
private $len; // 链表长度
function __Construct() {
$this->head = self::_getNode ( null, null );
$this->curelement = $this->head;
$this->tail = $this->head;
$len = 0;
}
/**
* @ desc: 读取链表全部结点
*/
public function readAll() {
$tmp = $this->head;
while ( $tmp->next !== null ) {
$tmp = $tmp->next;
var_dump ( $tmp->key, $tmp->data );
}
}
public function move($pos1, $pos2) {
$pos1Node = $this->findPosition ( $pos1 );
$pos2Node = $this->findPosition ( $pos2 );
if ($pos1Node !== null && $pos2Node !== null) {
$tmpKey = $pos1Node->key;
$tmpData = $pos1Node->data;
$pos1Node->key = $pos2Node->key;
$pos1Node->data = $pos2Node->data;
$pos2Node->key = $tmpKey;
$pos2Node->data = $tmpData;
return true;
}
return false;
}
/**
* @ desc: 在指定关键词删除结点
*
* @param : $key
* 指定位置的链表元素key
*/
public function delete($key) {
$pos = $this->find ( $key );
if ($pos !== null) {
$tmp = $pos;
$last = null;
$first = true;
while ( $tmp->next !== null && $tmp->next->key === $key ) {
$tmp = $tmp->next;
if (! $first) {
$this->delNode ( $last );
} else {
$first = false;
}
$last = $tmp;
}
if ($tmp->next !== null) {
$pos->pre->next = $tmp->next;
$tmp->next->pre = $pos->pre;
} else {
$pos->pre->next = null;
}
$this->delNode ( $pos );
$this->delNode ( $tmp );
}
}
/**
* @ desc: 在指定位置删除结点
*
* @param : $key
* 指定位置的链表元素key
*/
public function deletePosition($pos) {
$tmp = $this->findPosition ( $pos );
if ($tmp === null) {
return true;
}
if ($tmp === $this->getTail ()) {
$tmp->pre->next = null;
$this->delNode ( $tmp );
return true;
}
$tmp->pre->next = $tmp->next;
$tmp->next->pre = $tmp->pre;
$this->delNode ( $tmp );
}
/**
* @ desc: 在指定键值之前插入结点
*
* @param : $key
* //指定位置的链表元素key
* @param : $data
* //要插入的链表元素数据
* @param : $flag
* //是否顺序查找位置进行插入
*/
public function insert($key, $data, $flag = true) {
$newNode = self::_getNode ( $key, $data );
$tmp = $this->find ( $key, $flag );
if ($tmp !== null) {
$newNode->pre = $tmp->pre;
$newNode->next = $tmp;
$tmp->pre = $newNode;
$newNode->pre->next = $newNode;
} else {
$newNode->pre = $this->tail;
$this->tail->next = $newNode;
$this->tail = $newNode;
}
$this->len ++;
}
/**
* @ desc: 在指定位置之前插入结点
*
* @param : $pos
* 指定插入链表的位置
* @param : $key
* 指定位置的链表元素key
* @param : $data
* 要插入的链表元素数据
*/
public function insertPosition($pos, $key, $data) {
$newNode = self::_getNode ( $key, $data );
$tmp = $this->findPosition ( $pos );
if ($tmp !== null) {
$newNode->pre = $tmp->pre;
$newNode->next = $tmp;
$tmp->pre = $newNode;
$newNode->pre->next = $newNode;
} else {
$newNode->pre = $this->tail;
$this->tail->next = $newNode;
$this->tail = $newNode;
}
$this->len ++;
return true;
}
/**
* @ desc: 根据key值查询指定位置数据
*
* @param : $key
* //指定位置的链表元素key
* @param : $flag
* //是否顺序查找
*/
public function find($key, $flag = true) {
if ($flag) {
$tmp = $this->head;
while ( $tmp->next !== null ) {
$tmp = $tmp->next;
if ($tmp->key === $key) {
return $tmp;
}
}
} else {
$tmp = $this->getTail ();
while ( $tmp->pre !== null ) {
if ($tmp->key === $key) {
return $tmp;
}
$tmp = $tmp->pre;
}
}
return null;
}
/**
* @ desc: 根据位置查询指定位置数据
*
* @param : $pos
* //指定位置的链表元素key
*/
public function findPosition($pos) {
if ($pos <= 0 || $pos > $this->len)
return null;
if ($pos < ($this->len / 2 + 1)) {
$tmp = $this->head;
$count = 0;
while ( $tmp->next !== null ) {
$tmp = $tmp->next;
$count ++;
if ($count === $pos) {
return $tmp;
}
}
} else {
$tmp = $this->tail;
$pos = $this->len - $pos + 1;
$count = 1;
while ( $tmp->pre !== null ) {
if ($count === $pos) {
return $tmp;
}
$tmp = $tmp->pre;
$count ++;
}
}
return null;
}
/**
* @ desc: 返回链表头节点
*/
public function getHead() {
return $this->head->next;
}
/**
* @ desc: 返回链表尾节点
*/
public function getTail() {
return $this->tail;
}
/**
* @ desc: 查询链表节点个数
*/
public function getLength() {
return $this->len;
}
private static function _getNode($key, $data) {
$newNode = new Node_Element ( $key, $data );
if ($newNode === null) {
echo "new node fail!";
}
return $newNode;
}
private function delNode($node) {
unset ( $node );
$this->len --;
}
}
// $myList = new DoubleLinkedList ();
// $myList->insert ( 1, "test1" );
// $myList->insert ( 2, "test2" );
// $myList->insert ( "2b", "test2-b" );
// $myList->insert ( 2, "test2-c" );
// $myList->insert ( 3, "test3" );
// $myList->insertPosition ( 5, "t", "testt" );
// $myList->readAll ();
// echo "+++";
// $myList->deletePosition(0);
// $myList->readAll ();
// echo "..." . $myList->getLength ();
// var_dump ( $myList->findPosition ( 3 )->data );
?>
/**
* **双向链表
* @author zhiyuan12@
* @modified 2012-10-25
* @site: www.
*/
/**
* 链表元素结点类
*/
class Node_Element {
public $pre = NULL; // 前驱
public $next = NULL; // 后继
public $key = NULL; // 元素键值
public $data = NULL; // 结点值
function __Construct($key, $data) {
$this->key = $key;
$this->data = $data;
}
}
/**
* 双向链表类
*/
class DoubleLinkedList {
private $head; // 头指针
private $tail; // 尾指针
private $current; // 当前指针
private $len; // 链表长度
function __Construct() {
$this->head = self::_getNode ( null, null );
$this->curelement = $this->head;
$this->tail = $this->head;
$len = 0;
}
/**
* @ desc: 读取链表全部结点
*/
public function readAll() {
$tmp = $this->head;
while ( $tmp->next !== null ) {
$tmp = $tmp->next;
var_dump ( $tmp->key, $tmp->data );
}
}
public function move($pos1, $pos2) {
$pos1Node = $this->findPosition ( $pos1 );
$pos2Node = $this->findPosition ( $pos2 );
if ($pos1Node !== null && $pos2Node !== null) {
$tmpKey = $pos1Node->key;
$tmpData = $pos1Node->data;
$pos1Node->key = $pos2Node->key;
$pos1Node->data = $pos2Node->data;
$pos2Node->key = $tmpKey;
$pos2Node->data = $tmpData;
return true;
}
return false;
}
/**
* @ desc: 在指定关键词删除结点
*
* @param : $key
* 指定位置的链表元素key
*/
public function delete($key) {
$pos = $this->find ( $key );
if ($pos !== null) {
$tmp = $pos;
$last = null;
$first = true;
while ( $tmp->next !== null && $tmp->next->key === $key ) {
$tmp = $tmp->next;
if (! $first) {
$this->delNode ( $last );
} else {
$first = false;
}
$last = $tmp;
}
if ($tmp->next !== null) {
$pos->pre->next = $tmp->next;
$tmp->next->pre = $pos->pre;
} else {
$pos->pre->next = null;
}
$this->delNode ( $pos );
$this->delNode ( $tmp );
}
}
/**
* @ desc: 在指定位置删除结点
*
* @param : $key
* 指定位置的链表元素key
*/
public function deletePosition($pos) {
$tmp = $this->findPosition ( $pos );
if ($tmp === null) {
return true;
}
if ($tmp === $this->getTail ()) {
$tmp->pre->next = null;
$this->delNode ( $tmp );
return true;
}
$tmp->pre->next = $tmp->next;
$tmp->next->pre = $tmp->pre;
$this->delNode ( $tmp );
}
/**
* @ desc: 在指定键值之前插入结点
*
* @param : $key
* //指定位置的链表元素key
* @param : $data
* //要插入的链表元素数据
* @param : $flag
* //是否顺序查找位置进行插入
*/
public function insert($key, $data, $flag = true) {
$newNode = self::_getNode ( $key, $data );
$tmp = $this->find ( $key, $flag );
if ($tmp !== null) {
$newNode->pre = $tmp->pre;
$newNode->next = $tmp;
$tmp->pre = $newNode;
$newNode->pre->next = $newNode;
} else {
$newNode->pre = $this->tail;
$this->tail->next = $newNode;
$this->tail = $newNode;
}
$this->len ++;
}
/**
* @ desc: 在指定位置之前插入结点
*
* @param : $pos
* 指定插入链表的位置
* @param : $key
* 指定位置的链表元素key
* @param : $data
* 要插入的链表元素数据
*/
public function insertPosition($pos, $key, $data) {
$newNode = self::_getNode ( $key, $data );
$tmp = $this->findPosition ( $pos );
if ($tmp !== null) {
$newNode->pre = $tmp->pre;
$newNode->next = $tmp;
$tmp->pre = $newNode;
$newNode->pre->next = $newNode;
} else {
$newNode->pre = $this->tail;
$this->tail->next = $newNode;
$this->tail = $newNode;
}
$this->len ++;
return true;
}
/**
* @ desc: 根据key值查询指定位置数据
*
* @param : $key
* //指定位置的链表元素key
* @param : $flag
* //是否顺序查找
*/
public function find($key, $flag = true) {
if ($flag) {
$tmp = $this->head;
while ( $tmp->next !== null ) {
$tmp = $tmp->next;
if ($tmp->key === $key) {
return $tmp;
}
}
} else {
$tmp = $this->getTail ();
while ( $tmp->pre !== null ) {
if ($tmp->key === $key) {
return $tmp;
}
$tmp = $tmp->pre;
}
}
return null;
}
/**
* @ desc: 根据位置查询指定位置数据
*
* @param : $pos
* //指定位置的链表元素key
*/
public function findPosition($pos) {
if ($pos <= 0 || $pos > $this->len)
return null;
if ($pos < ($this->len / 2 + 1)) {
$tmp = $this->head;
$count = 0;
while ( $tmp->next !== null ) {
$tmp = $tmp->next;
$count ++;
if ($count === $pos) {
return $tmp;
}
}
} else {
$tmp = $this->tail;
$pos = $this->len - $pos + 1;
$count = 1;
while ( $tmp->pre !== null ) {
if ($count === $pos) {
return $tmp;
}
$tmp = $tmp->pre;
$count ++;
}
}
return null;
}
/**
* @ desc: 返回链表头节点
*/
public function getHead() {
return $this->head->next;
}
/**
* @ desc: 返回链表尾节点
*/
public function getTail() {
return $this->tail;
}
/**
* @ desc: 查询链表节点个数
*/
public function getLength() {
return $this->len;
}
private static function _getNode($key, $data) {
$newNode = new Node_Element ( $key, $data );
if ($newNode === null) {
echo "new node fail!";
}
return $newNode;
}
private function delNode($node) {
unset ( $node );
$this->len --;
}
}
// $myList = new DoubleLinkedList ();
// $myList->insert ( 1, "test1" );
// $myList->insert ( 2, "test2" );
// $myList->insert ( "2b", "test2-b" );
// $myList->insert ( 2, "test2-c" );
// $myList->insert ( 3, "test3" );
// $myList->insertPosition ( 5, "t", "testt" );
// $myList->readAll ();
// echo "+++";
// $myList->deletePosition(0);
// $myList->readAll ();
// echo "..." . $myList->getLength ();
// var_dump ( $myList->findPosition ( 3 )->data );
?>
最新技术文章: