<?php
$lib = isset($_SERVER['TESTLIB']) ? $_SERVER['TESTLIB'] : 'Test-Simple.php';
require_once $lib;
plan('no_plan');
diag('Test of deprecated Test::More functions provided for compatibility completeness.');
$foo = array(0 => 1, 1 => 'B', 2 => 'third');
$oof = array(0 => 'third', 1 => 'B', 2 => 1);
$bar = array('q' => 23, 'Y' => 42);
$rab = array('Y' => 42, 'q' => 23);
ok(eq_array($foo, $oof), 'eq_array() with misordered array is ok');
ok(eq_array($bar, $rab), 'eq_array() with misordered assoc is ok');
ok(eq_hash($foo, $oof), 'eq_hash() with misordered array is ok');
ok(eq_hash($bar, $rab), 'eq_hash() with misordered assoc is ok');
ok(eq_set($foo, $oof), 'eq_set() with misordered array is ok');
ok(eq_set($bar, $rab), 'eq_set() with misordered assoc is ok');
done_testing();
is_deeply($rt->_unrev_node(['' => 0, 'a' => ['a', 'b'], 'b' => ['b', 'c', 'd', 'e', 'f', 'g']], $context), ['' => 0, 'b' => ['b', 'a'], 'g' => ['g', 'f', 'e', 'd', 'c', 'b']], 'node(*a,b2)');
is_deeply($rt->_unrev_path([['x' => ['x', '0'], '' => 0]], $context), [['0' => ['0', 'x'], '' => 0]], 'node(* 0)');
is_deeply($rt->_unrev_node(['ab' => ['ab', 'bc'], 'bc' => ['bc', 'cd', 'de', 'ef', 'fg', 'gh'], 'ef' => ['ef', 'gh', 'ij']], $context), ['bc' => ['bc', 'ab'], 'gh' => ['gh', 'fg', 'ef', 'de', 'cd', 'bc'], 'ij' => ['ij', 'gh', 'ef']], 'node(ab,bc,ef)');
is_deeply($rt->_unrev_node(['' => 0, 'b' => [[['b' => ['b'], 'b?' => [['' => 0, 'b' => ['b']], 'a']]], ['' => 0, 'c' => ['c']]]], $context), ['' => 0, 'c' => [['' => 0, 'c' => ['c']], [['a' => ['a', ['' => 0, 'b' => ['b']]], 'b' => ['b']]]]], 'node of (?:(?:ab?|b)c?)?');
is_deeply($rt->_unrev_path(['a', 'b', ['c' => ['c', 'd', 'e'], 'f' => ['f', 'g', 'h'], 'i' => ['i', 'j', ['k' => ['k', 'l', 'm'], 'n' => ['n', 'o', 'p']], 'x']]], $context), [['e' => ['e', 'd', 'c'], 'h' => ['h', 'g', 'f'], 'x' => ['x', ['m' => ['m', 'l', 'k'], 'p' => ['p', 'o', 'n']], 'j', 'i']], 'b', 'a'], 'path(node(path))');
//{
$r = new Regexp_Assemble();
$ra = $r->add('refused')->add('fused')->add('used');
$ra->_reduce();
ok(eq_set([array_keys($rt->_lookahead($ra->__path[0]))], ['f', 'r']), '_lookahead refused/fused/used');
$ra->reset()->add('refused')->add('reamused')->add('fused')->add('amused')->add('used')->_reduce();
ok(eq_set([array_keys($rt->_lookahead($ra->__path[0]))], ['a', 'f', 'r']), '_lookahead reamused/refused/amused/fused/used');
$ra->reset()->add('reran')->add('ran')->_reduce();
ok(eq_set([array_keys($rt->_lookahead($ra->__path[0]))], ['r']), '_lookahead reran/ran');
$ra->reset()->add('cruised')->add('bruised')->add('hosed')->add('gazed')->add('used')->_reduce();
ok(eq_set([array_keys($rt->_lookahead($ra->__path[0]))], ['b', 'c', 'g', 'h', 'u']), '_lookahead cruised/bruised/hosed/gazed/used');
//}
is($rt->_dump([1, 0, NULL]), '[1 0 *]', 'dump undef');
is($rt->_dump([1, 0, ' ']), "[1 0 ' ']", 'dump space');
is($rt->_dump(['a' => ['a', 'b'], 'b' => ['b']]), '{a=>[a b] b=>[b]}', 'dump node');
is($rt->_dump(['a', chr(7), 'b']), '[a \\x07 b]', 'dump pretty');
//保留
//is( $r->insert(' ')->insert(' ')->dump(),
// '[\\x07 {\\x05=>[\\x05] \\x06=>[\\x06]}]', 'dump pretty node'
//);
is($rt->_dump(['a', chr(7), 'b']), '[a \\x07 b]', 'dump pretty');
is($rt->_combine('?=', ['c', 'a', 'b']), '(?=[abc])', '_combine c a b');
is($rt->_combine('?=', ['c', 'ab', 'de']), '(?=ab|de|c)', '_combine c ab de');
is($rt->_combine('?=', ['in', 'og']), '(?=in|og)', '_combine in og');
is($rt->_combine('?=', ['in', 'og', 'j', 'k', 'l']), '(?=[jkl]|in|og)', '_combine in og j k l');
is($rt->_combine('?=', ['in', 'og', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9']), '(?=\\d|in|og)', '_combine in og 0 1 ... 9');
