Test.php

<?php
# See the end of this file for documentation

# The latest release of this test framework can always be found on CPAN:
# http://search.cpan.org/search?query=Test.php

register_shutdown_function('_test_ends');

$__Test = array(
    # How many tests are planned
    'planned'   => null,

    # How many tests we've run, if 'planned' is still null by the time we're
    # done we report the total count at the end
    'run' => 0,

    # Are are we currently within todo_start()/todo_end() ?
    'todo' => array(),
);

function plan($plan, $why = '')
{
    global $__Test;

    $__Test['planned'] = true;

    switch ($plan)
    {
      case 'no_plan':
        $__Test['planned'] = false;
        break;
      case 'skip_all';
        printf("1..0%s\n", $why ? " # Skip $why" : '');
        exit;
      default:
        printf("1..%d\n", $plan);
        break;
    }
}

function pass($desc = '')
{
    return _proclaim(true, $desc);
}

function fail($desc = '')
{
    return _proclaim(false, $desc);
}

function ok($cond, $desc = '') {
    return _proclaim($cond, $desc);
}

function is($have, $want, $desc = '') {
    $pass = $have == $want;
    return _proclaim($pass, $desc, /* todo */ false, $have, $want);
}

function is_linewise($have, $want, $desc = ''){
    $lineendings = '(\015{1,2}\012|\015|\012)';
    $havelines = preg_split($lineendings,$have);
    $wantlines = preg_split($lineendings,$want);
    $linecount = (count($havelines) >= count($wantlines)
        ? count($havelines) : count($wantlines));
    
    for($idx = 0; $idx < $linecount; $idx++) {
        if(isset($havelines[$idx])) {
            $haveline = $havelines[$idx];
        }
        else {
            $have = "Line " . ($idx+1) . " missing";
            $want = $wantlines[$idx];
            return _proclaim(false,$desc,false,$have,$want);
        }
        if(isset($wantlines[$idx])) {
            $wantline = $wantlines[$idx];
        }
        else {
            $have = "Line " . ($idx+1) . " is '" . $haveline . "'";
            $want = "is missing";
            return _proclaim(false,$desc,false,$have,$want);
        }
        if($haveline != $wantline) {
            return _proclaim(false,$desc,false,
                "Line " . ($idx+1) . " '$haveline'","'$wantline'");
        }        
    }
    return _proclaim(true,$desc,false,"Line " . ($idx+1) . "","");
}

function isnt($have, $want, $desc = '') {
    $pass = $have != $want;
    return _proclaim($pass, $desc, /* todo */ false, $have, $want, /* negated */ true);
}

function like($have, $want, $desc = '') {
    $pass = preg_match($want, $have);
    return _proclaim($pass, $desc, /* todo */ false, $have, $want);
}

function unlike($have, $want, $desc = '') {
    $pass = !preg_match($want, $have);
    return _proclaim($pass, $desc, /* todo */ false, $have, $want, /* negated */ true);
}

function cmp_ok($have, $op, $want, $desc = '')
{
    $pass = null;

    # See http://www.php.net/manual/en/language.operators.comparison.php
    switch ($op)
    {
      case '==':
        $pass = $have == $want;
        break;
      case '===':
        $pass = $have === $want;
        break;
      case '!=':
      case '<>':
        $pass = $have != $want;
        break;
      case '!==':
        $pass = $have !== $want;
        break;
      case '<':
        $pass = $have < $want;
        break;
      case '>':
        $pass = $have > $want;
        break;
      case '<=':
        $pass = $have <= $want;
        break;
      case '>=':
        $pass = $have >= $want;
        break;
    default:
        if (function_exists($op)) {
            $pass = $op($have, $want);
        } else {
            die("No such operator or function $op\n");
        }
    }

    return _proclaim($pass, $desc, /* todo */ false, $have, "$have $op $want");
}

function diag($message)
{
    if (is_array($message))
    {
        $message = implode("\n", $message);
    }

    foreach (explode("\n", $message) as $line)
    {
        echo "# $line\n";
    }
}

function include_ok($file, $desc = '')
{
    $pass = include $file;
    return _proclaim($pass, $desc == '' ? "include $file" : $desc);
}

function require_ok($file, $desc = '')
{
    $pass = require $file;
    return _proclaim($pass, $desc == '' ? "require $file" : $desc);
}

function use_ok($file, $desc = '')
{
    if(strtolower(substr($file,-4)) !== '.php') {
        $pass = class_exists($file);
        if($pass) {
            return _proclaim($pass, $desc == '' ? "use_ok $file" : $desc);
        }
        $file =  str_replace(array('\\','_'),'/',$file) . '.php';
    }
    $pass = require_once $file;
    return _proclaim($pass, $desc == '' ? "require_once $file" : $desc);
}

function is_deeply($have, $want, $desc = '')
{
    $diff = _cmp_deeply($have, $want);
    $pass = is_null($diff);

    if (!$pass) {
        $have = strlen($diff['gpath']) ? ($diff['gpath'] . ' = ' . $diff['have'])
                                       : _repl($have);
        $want = strlen($diff['epath']) ? ($diff['epath'] . ' = ' . $diff['want'])
                                       : _repl($want);
    }

    _proclaim($pass, $desc, /* todo */ false, $have, $want);
}

function isa_ok($obj, $want, $desc = '')
{
    $pass = is_a($obj, $want);
    $isclass = (is_object($obj) ? get_class($obj) : 'not an object');
    _proclaim($pass, $desc, /* todo */ false, $isclass, $want);
}

function todo_start($why = '')
{
    global $__Test;

    $__Test['todo'][] = $why;
}

function todo_end()
{
    global $__Test;

    if (count($__Test['todo']) == 0) {
        die("todo_end() called without a matching todo_start() call");
    } else {
        array_pop($__Test['todo']);
    }
}

#
# The code below consists of private utility functions for the above functions
#

function _proclaim(
    $cond, # bool
    $desc = '',
    $todo = false,
    $have = null,
    $want = null,
    $negate = false) {

    global $__Test;

    $__Test['run'] += 1;

    # We're in a TODO block via todo_start()/todo_end(). TODO via specific
    # functions is currently unimplemented and will probably stay that way
    if (count($__Test['todo'])) {
        $todo = true;
    }

    # Everything after the first # is special, so escape user-supplied messages
    $desc = str_replace('#', '\\#', $desc);
    $desc = str_replace("\n", '\\n', $desc);

    $ok = $cond ? "ok" : "not ok";
    $directive = '';

    if ($todo) {
        $todo_idx = count($__Test['todo']) - 1;
        $directive .= ' # TODO ' . $__Test['todo'][$todo_idx];
    }

    printf("%s %d %s%s\n", $ok, $__Test['run'], $desc, $directive);

    # report a failure
    if (!$cond) {
        # Every public function in this file calls _proclaim so our culprit is
        # the second item in the stack
        $caller = debug_backtrace();
        $call = $caller['1'];

        if (($have != null) || ($want != null)) {
          diag(
              sprintf(" Failed%stest '%s'\n in %s at line %d\n have: %s\n  want: %s",
                  $todo ? ' TODO ' : ' ',
                  $desc,
                  $call['file'],
                  $call['line'],
                  $have,
                  $want
              )
          );
        } else {
          diag(
              sprintf(" Failed%stest '%s'\n in %s at line %d",
                  $todo ? ' TODO ' : ' ',
                  $desc,
                  $call['file'],
                  $call['line']
              )
          );
        }
    }

    return $cond;
}

function _test_ends()
{
    global $__Test;

    if (count($__Test['todo']) != 0) {
        $todos = join("', '", $__Test['todo']);
        die("Missing todo_end() for '$todos'");
    }

    if (!$__Test['planned']) {
        printf("1..%d\n", $__Test['run']);
    }
}

#
# All of the below is for is_deeply()
#

function _repl($obj, $deep = true) {
    if (is_string($obj)) {
        return "'" . $obj . "'";
    } else if (is_numeric($obj)) {
        return $obj;
    } else if (is_null($obj)) {
        return 'null';
    } else if (is_bool($obj)) {
        return $obj ? 'true' : 'false';
    } else if (is_array($obj)) {
        return _repl_array($obj, $deep);
    }else {
        return gettype($obj);
    }
}

function _diff($gpath, $have, $epath, $want) {
    return array(
        'gpath' => $gpath,
        'have'  => $have,
        'epath' => $epath,
        'want'  => $want
    );
}

function _idx($obj, $path = '') {
    return $path . '[' . _repl($obj) . ']';
}

function _cmp_deeply($have, $exp, $path = '') {
    if (is_array($exp)) {

        if (!is_array($have)) {
            return _diff($path, _repl($have), $path, _repl($exp));
        }

        $gk = array_keys($have);
        $ek = array_keys($exp);
        $mc = max(count($gk), count($ek));

        for ($el = 0; $el < $mc; $el++) {
            # One array shorter than the other?
            if ($el >= count($ek)) {
                return _diff(_idx($gk[$el], $path), _repl($have[$gk[$el]]),
                             'missing', 'nothing');
            } else if ($el >= count($gk)) {
                return _diff('missing', 'nothing',
                             _idx($ek[$el], $path), _repl($exp[$ek[$el]]));
            }

            # Keys differ?
            if ($gk[$el] != $ek[$el]) {
                return _diff(_idx($gk[$el], $path), _repl($have[$gk[$el]]),
                             _idx($ek[$el], $path), _repl($exp[$ek[$el]]));
            }

            # Recurse
            $rc = _cmp_deeply($have[$gk[$el]], $exp[$ek[$el]], _idx($gk[$el], $path));
            if (!is_null($rc)) {
                return $rc;
            }
        }
    }
    elseif (is_numeric($have) && is_numeric($exp)) {
        // why trim - good question, but it helps?
        if((0+trim($have)) !== (0+trim($exp))) {
            return _diff($path, _repl($have), $path, _repl($exp));
        }
    }
    else {
        # Default to serialize hack
        if (serialize($have) != serialize($exp)) {
            return _diff($path, _repl($have), $path, _repl($exp));
        }
    }

    return null;
}

function _plural($n, $singular, $plural = null) {
    if (is_null($plural)) {
        $plural = $singular . 's';
    }
    return $n == 1 ? "$n $singular" : "$n $plural";
}

function _repl_array($obj, $deep) {
    if ($deep) {
        $slice = array_slice($obj, 0, 3); # Increase from 3 to show more
        $repl  = array();
        $next  = 0;
        foreach ($slice as $idx => $el) {
            $elrep = _repl($el, false);
            if (is_numeric($idx) && $next == $idx) {
                // Numeric index
                $next++;
            } else {
                // Out of sequence or non-numeric
                $elrep = _repl($idx, false) . ' => ' . $elrep;
            }
            $repl[] = $elrep;
        }
        $more = count($obj) - count($slice);
        if ($more > 0) {
            $repl[] = '... ' . _plural($more, 'more element')  . ' ...';
        }
        return 'array(' . join(', ', $repl) . ')';
    }
    else {
        return 'array(' . count($obj) . ')';
    }
}

/*

=head1 NAME

Test.php - TAP test framework for PHP with a L<Test::More>-like interface

=head1 SYNOPSIS

    #!/usr/bin/env php
    <?php
    require 'Test.php';

    plan($num); # plan $num tests
    # or
    plan('no_plan'); # We don't know how many
    # or
    plan('skip_all'); # Skip all tests
    # or
    plan('skip_all', $reason); # Skip all tests with a reason

    diag('message in test output') # Trailing \n not required

    # $test_name is always optional and should be a short description of
    # the test, e.g. "some_function() returns an integer"

    # Various ways to say "ok"
    ok($have == $want, $test_name);

    # Compare with == and !=
    is($have, $want, $test_name);
    isnt($have, $want, $test_name);

    # Run a preg regex match on some data
    like($have, $regex, $test_name);
    unlike($have, $regex, $test_name);

    # Compare something with a given comparison operator
    cmp_ok($have, '==', $want, $test_name);
    # Compare something with a comparison function (should return bool)
    cmp_ok($have, $func, $want, $test_name);

    # Recursively check datastructures for equalness
    is_deeply($have, $want, $test_name);

    # Always pass or fail a test under an optional name
    pass($test_name);
    fail($test_name);

    # TODO tests, these are want to fail but won't fail the test run,
    # unwant success will be reported
    todo_start("integer arithmetic still working");
    ok(1 + 2 == 3);
    {
        # TODOs can be nested
        todo_start("string comparison still working")
        is("foo", "bar");
        todo_end();
    }
    todo_end();
    ?>

=head1 DESCRIPTION

F<Test.php> is an implementation of Perl's L<Test::More> for PHP. Like
Test::More it produces language agnostic TAP output (see L<TAP>) which
can then be gathered, formatted and summarized by a program that
understands TAP such as prove(1).

=head1 HOWTO

First place the F<Test.php> in the project root or somewhere else in
the include path where C<require> and C<include> will find it.

Then make a place to put your tests in, it's customary to place TAP
tests in a directory named F<t> under the root but they can be
anywhere you like. Make a test in this directory or one of its subdirs
and try running it with php(1):

    $ php t/pass.t
    1..1
    ok 1 This dummy test passed

The TAP output consists of very simple output, of course reading
larger output is going to be harder which is where prove(1) comes
in. prove is a harness program that reads test output and produces
reports based on it:

    $ prove t/pass.t
    t/pass....ok
    All tests successful.
    Files=1, Tests=1,  0 wallclock secs ( 0.03 cusr +  0.02 csys =  0.05 CPU)

To run all the tests in the F<t> directory recursively use C<prove -r
t>. This can be put in a F<Makefile> under a I<test> target, for
example:

    test: Test.php
		prove -r t

For reference the example test file above looks like this, the shebang
on the first line is needed so that prove(1) and other test harness
programs know they're dealing with a PHP file.

    #!/usr/bin/env php
    <?php

    require 'Test.php';

    plan(1);
    pass('This dummy test passed');
    ?>

=head1 SEE ALSO

L<TAP> - The TAP protocol

=head1 AUTHOR

E<AElig>var ArnfjE<ouml>rE<eth> Bjarmason <avar@cpan.org> and Andy Armstrong <andy@hexten.net>

=head1 LICENSING

The author or authors of this code dedicate any and all copyright
interest in this code to the public domain. We make this dedication
for the benefit of the public at large and to the detriment of our
heirs and successors. We intend this dedication to be an overt act of
relinquishment in perpetuity of all present and future rights this
code under copyright law.

=cut

*/

?>