/usr/share/fpcsrc/2.6.2/compiler/nstate.pas is in fpc-source-2.6.2 2.6.2-8.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 | {
Copyright (c) 1998-2002 by Daniel Mantione
This unit contains support routines for the state tracker
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
****************************************************************************
}
unit nstate;
{$i fpcdefs.inc}
interface
uses cclasses,node;
type Tstate_entry=class(Tlinkedlistitem)
what:Tnode;
value:Tnode;
constructor create(w,v:Tnode);
end;
Tstate_storage=class
storage:Tlinkedlist;
constructor create;
procedure store_fact(w,v:Tnode);
function find_fact(what:Tnode):Tnode;
procedure delete_fact(what:Tnode);
end;
var aktstate:Tstate_storage;
implementation
constructor Tstate_entry.create(w,v:Tnode);
begin
inherited create;
what:=w;
value:=v;
end;
constructor Tstate_storage.create;
begin
storage:=Tlinkedlist.create;
end;
procedure Tstate_storage.store_fact(w,v:Tnode);
var se:Tstate_entry;
begin
{ writeln('fact:');
writenode(w);
writeln('=');
writenode(v);}
se:=Tstate_entry(storage.first);
while assigned(se) do
begin
if se.what.isequal(w) then
begin
storage.remove(se);
se.destroy;
break;
end;
se:=Tstate_entry(se.next);
end;
se:=Tstate_entry.create(w,v);
storage.concat(se);
end;
function Tstate_storage.find_fact(what:Tnode):Tnode;
var se:Tstate_entry;
begin
find_fact:=nil;
se:=storage.first as Tstate_entry;
while assigned(se) do
begin
if se.what.isequal(what) then
begin
find_fact:=se.value;
break;
end;
se:=se.next as Tstate_entry;
end;
end;
procedure Tstate_storage.delete_fact(what:Tnode);
var se:Tstate_entry;
begin
se:=storage.first as Tstate_entry;
while assigned(se) do
begin
if se.what.isequal(what) then
begin
storage.remove(se);
se.destroy;
break;
end;
se:=se.next as Tstate_entry;
end;
end;
end.
|