X-Git-Url: http://www.lcore.org/git/lcore.git/blobdiff_plain/6cb6b7ede2d178e03fa817bc28474c175f5a93b9..42a61c59a81b03130f61e805474198eada033cd8:/httpserver_20080306/bsearchtree.pas

diff --git a/httpserver_20080306/bsearchtree.pas b/httpserver_20080306/bsearchtree.pas
deleted file mode 100755
index ad61751..0000000
--- a/httpserver_20080306/bsearchtree.pas
+++ /dev/null
@@ -1,101 +0,0 @@
-{ Copyright (C) 2005 Bas Steendijk and Peter Green
-  For conditions of distribution and use, see copyright notice in zlib_license.txt
-  which is included in the package
-  ----------------------------------------------------------------------------- }
-  
-{actually a hashtable. it was a tree in earlier versions}
-
-unit bsearchtree;
-
-interface
-
-uses blinklist;
-
-const
-  hashtable_size=$4000;
-
-type
-  thashitem=class(tlinklist)
-    hash:integer;
-    s:string;
-    p:pointer;
-  end;
-  thashtable=array[0..hashtable_size-1] of thashitem;
-  phashtable=^thashtable;
-
-{adds "item" to the tree for name "s". the name must not exist (no checking done)}
-procedure addtree(t:phashtable;s:string;item:pointer);
-
-{removes name "s" from the tree. the name must exist (no checking done)}
-procedure deltree(t:phashtable;s:string);
-
-{returns the item pointer for s, or nil if not found}
-function findtree(t:phashtable;s:string):pointer;
-
-implementation
-
-function makehash(s:string):integer;
-const
-  shifter=6;
-var
-  a,b:integer;
-begin
-  result := 0;
-  b := length(s);
-  for a := 1 to b do begin
-    result := (result shl shifter) xor byte(s[a]);
-  end;
-  result := (result xor result shr 16) and (hashtable_size-1);
-end;
-
-procedure addtree(t:phashtable;s:string;item:pointer);
-var
-  hash:integer;
-  p:thashitem;
-begin
-  hash := makehash(s);
-  p := thashitem.create;
-  p.hash := hash;
-  p.s := s;
-  p.p := item;
-  linklistadd(tlinklist(t[hash]),tlinklist(p));
-end;
-
-procedure deltree(t:phashtable;s:string);
-var
-  p,p2:thashitem;
-  hash:integer;
-begin
-  hash := makehash(s);
-  p := t[hash];
-  p2 := nil;
-  while p <> nil do begin
-    if p.s = s then begin
-      p2 := p;
-      break;
-    end;
-    p := thashitem(p.next);
-  end;
-  linklistdel(tlinklist(t[hash]),tlinklist(p2));
-  p2.destroy;
-end;
-
-
-function findtree(t:phashtable;s:string):pointer;
-var
-  p:thashitem;
-  hash:integer;
-begin
-  result := nil;
-  hash := makehash(s);
-  p := t[hash];
-  while p <> nil do begin
-    if p.s = s then begin
-      result := p.p;
-      exit;
-    end;
-    p := thashitem(p.next);
-  end;
-end;
-
-end.