Details of Link
 
 
TITLE
  Splay 
SUBTITLE
  A hopefully efficient implementation of splay trees. 
DESCRIPTION
  "Splay trees, due to Sleator and Tarjan, are binary trees
where often accessed items tend to be near the root.
Operations doing a splay are find, find_min, find_max,
add and remove. Other opertations, like fold, iter, elements
leave the tree unchanged.

This implementation of splay uses in-place modification
of the tree."
 
REPORTER
  Walter Rader 
AUTHOR
  moninjf 
AUTHOR'S LINK
  http://membres.lycos.fr/moninjf/ 
COAUTHOR
   
COAUTHOR'S LINK
   
CLASSIFICATION
  Data structures 
RELEASE
  0.4.2 
STABILITY
  unknown stability 
STABLE RELEASE
   
RECENT CHANGES
   
DEPENDS ON OCAML VERSION
   
DEPENDS ON OPERATING SYSTEM
   
DEPENDS ON OTHER SOFTWARE
   
INFO LINK
  http://membres.lycos.fr/moninjf/Ocaml/00_README.txt 
DOWNLOAD LINK
  http://membres.lycos.fr/moninjf/Ocaml/splay-0.4.2.tar.gz 
DATE OF LAST MODIFICATION
  21 Oct 2002 


Navigation: [Sort by date] [Sort by author] [Sort by title] [Sort by classification] [New author] [Login]