view release on metacpan or  search on metacpan

t/lib/Test/NoMore.pm  view on Meta::CPAN

    my $pack = caller;

	my $ok=1;
	
    return $ok;
}




sub is_deeply {
	my $ok=1;
    return $ok;
}


sub diag {
	print "@_\n" ;
}

sub skip {
    my($why, $how_many) = @_;

    local $^W = 0;
    last SKIP;
}

sub todo_skip {
    my($why, $how_many) = @_;

    local $^W = 0;
    last TODO;
}


sub BAIL_OUT {
    my $reason = shift;
}

sub eq_array {
}


sub eq_hash {
}


sub eq_set  {
    my($a1, $a2) = @_;
    return 0 unless @$a1 == @$a2;

    # There's faster ways to do this, but this is easiest.
    local $^W = 0;

    # It really doesn't matter how we sort them, as long as both arrays are 
    # sorted with the same algorithm.
    #
    # Ensure that references are not accidentally treated the same as a
    # string containing the reference.
    #
    # Have to inline the sort routine due to a threading/sort bug.
    # See [rt.cpan.org 6782]
    #
    # I don't know how references would be sorted so we just don't sort
    # them.  This means eq_set doesn't really work with refs.
    return eq_array(
           [grep(ref, @$a1), sort( grep(!ref, @$a1) )],
           [grep(ref, @$a2), sort( grep(!ref, @$a2) )],
    );
}


1;