Test suite results for test file webtbs/tw1044.pp

Test run data :

Run ID:
Operating system: linux
Processor: x86_64
Version: 3.3.1
Fails/OK/Total: 25/9462/9487
Version: 3.3.1
Full version: 3.3.1-15624-g3cfec5e6a4
Comment: -gl -Fl/usr/lib -Fl/usr/lib/gcc/x86_64-linux-gnu/11 -Fl/usr/lib/x86_64-linux-gnu -Cg -gwl -Fd
Machine: gcclocal
Category: 1
SVN revisions: e601156b8c:3cfec5e6a4:7629cdb4a5:6a109634b0
Submitter: pierre
Date: 2024/04/28 01:30:00 <> 2024/04/27
Previous run: 939961
Next run: 941448

Hide skipped tests

Hide successful tests

Test file "webtbs/tw1044.pp" information:

t_id 751
t_adddate 2003/10/03
t_result 0
Flag t_norun set
t_knownrunerror 0

Detailed test run results:

tr_idruntr_oktr_skiptr_result
479151147940703FalseTrueSkipping run test

Record count: 1

No log of 940703.

Source:

{ %NORUN }
{ DONT RUN THIS CODE, its creates an infinite recursion }
{ Code unchanged as this is a test for a compile time GPF. PM }
{ Source provided for Free Pascal Bug Report 1044 }
{ Submitted by "Geoffrey A Swift" on  2000-07-16 }
{ e-mail: blimey@toke.com }
{$mode objfpc}
type
  subrange = 1..6;
  subset = set of subrange;
function solve(numbers : subset) : boolean;
var
  i: subrange;
begin
  if numbers <> [] then
    for i := low(subrange) to high(subrange) do
      result := solve(numbers - [i])
end;
begin
  solve([1,2,3,4,5,6])
end.

Link to SVN view of webtbs/tw1044.pp source.