. * Portions created by the Initial Developer are Copyright (C) 2006 * the Initial Developer. All Rights Reserved. * * Contributor(s): * * Alternatively, the contents of this file may be used under the terms of * either the GNU General Public License Version 2 or later (the "GPL"), or * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), * in which case the provisions of the GPL or the LGPL are applicable instead * of those above. If you wish to allow use of your version of this file only * under the terms of either the GPL or the LGPL, and not to allow others to * use your version of this file under the terms of the MPL, indicate your * decision by deleting the provisions above and replace them with the notice * and other provisions required by the GPL or the LGPL. If you do not delete * the provisions above, a recipient may use your version of this file under * the terms of any one of the MPL, the GPL or the LGPL. * * ***** END LICENSE BLOCK ***** */ ?> addLocale = false; ?>

Available Test Cases: (Expand All)

    $testCase) { $nodes = explode('/', $testCase, 3); if (!empty($testlist[$k+1])) { $nextNodes = explode('/', $testlist[$k+1], 3); } for ($i = -1; $i <= 3; $i++) { if (empty($previousNodes[$i])) { $previousNodes[$i] = ''; } if (empty($nodes[$i])) { $nodes[$i] = ''; } if (empty($nextNodes[$i])) { $nextNodes[$i] = ''; } } foreach ($nodes as $n => $node) { if ($previousNodes[$n] != $node && !empty($node)) { if ($previousNodes[$n-1] != $nodes[$n-1]) { echo ''; } } } $previousNodes = $nodes; } ?>

Available Group Tests:

    $group) { $count = 0; foreach($group['cases'] as $case) { if (strpos($case, '*') !== false) { $count += count(TestManager::getTestCaseList(TESTS.str_replace('/*', '', $case))); } else { $count++; } } echo '
  • '.$group['name'].' ['.$count.'] ('.$group['description'].')
  • '; } ?>