hash有关

ELFHASH的pascal版本

function elfhash(key:string):longint;
const
	m=477779;
var
	h,g,i:dword;
begin
	for i:=1 to length(key) do begin
		h:=(h shl 4) + ord(key[i]);
		g:=h and $F0000000;
		if (g<>0) then h:=h xor (g shr 24);
		h:=h and (not g);
	end;
	elfhash:=h mod m;
end;

hash冲突的开散列法,由于用习惯了pascal,也不想改.但pascal的指针当真蛋疼.所以只能用数组模拟了.

date,next,h:array[1..n]of longint;
p:longint;
//
p:=0;
//
function f_hash();
//
procedure in_hash(x:longint);
var t:longint;
begin

t:=h[f_hash(x)];
inc(p);
date[p]:=x;

if t<>0 then begin
while next[t]<>0 do t:=next[t];
next[t]:=p;
end else h[f_hash(x)]:=p;
end;

随手写的,也不知道对不对啊.