PHPUnit知识点集聚（持续更新）-PHP Tutorial-php.cn

PHPUnit知识点汇聚（持续更新）

0、PHPUnit手册：https://phpunit.de/manual/current/zh_cn/phpunit-book.html

1、读取XML文件

developer-a.xml

<?xml version="1.0" encoding="UTF-8" ?><phpunit>    <php>        <var name="DB_DSN" value="mysql:dbname=myguestbook;host=localhost" />        <var name="DB_USER" value="root" />        <var name="DB_PASSWD" value="123456" />        <var name="DB_DBNAME" value="fetion" />    </php></phpunit>

Copy after login

MyTest.php

<?phpclass MyTest extends PHPUnit_Framework_TestCase{    public function testPushAndPop()    {        $stack = array();        $this->assertEquals(0, count($stack));        array_push($stack, $GLOBALS['DB_USER']);        $this->assertEquals('root', $stack[count($stack)-1]);        //$this->assertEquals(1, count($stack));        //$this->assertEquals('foo', array_pop($stack));        //$this->assertEquals(0, count($stack));    }}?>

Copy after login

测试命令：

写道

phpunit --configuration developer-a.xml MyTest.php

2、例 2.3: 利用测试之间的依赖关系

<?phpclass MultipleDependenciesTest extends PHPUnit_Framework_TestCase{    public function testProducerFirst()    {        $this->assertTrue(true);        return 'first';    }    public function testProducerSecond()    {        $this->assertTrue(true);        return 'second';    }    /**     * @depends testProducerFirst     * @depends testProducerSecond     */    public function testConsumer()    {        $this->assertEquals(            array('first', 'second'),            func_get_args()        );    }}?>

Copy after login

测试命令行：

写道

phpunit DependencyFailureTest.html

3、PHP 关联数组

关联数组是使用您分配给数组的指定键的数组。

有两种创建关联数组的方法：

$age=array("Peter"=>"35","Ben"=>"37","Joe"=>"43");

Copy after login

或者：

$age['Peter']="35";$age['Ben']="37";$age['Joe']="43";

Copy after login

?随后可以在脚本中使用指定键：

<?php$age=array("Bill"=>"35","Steve"=>"37","Peter"=>"43");echo "Peter is " . $age['Peter'] . " years old.";?>

Copy after login

Related labels：

gt phpunit stack this

source：php.cn

Previous article：[PHP]swoole_server几个过程的分工 Next article：依据前序序列和中序序列，重建一颗树（PHP递归实现）

Statement of this Website

The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn