adt23tree.pas.mcp

(* This file is a part of the PascalAdt library, which provides
   commonly used algorithms and data structures for
   the FPC and Delphi compilers.
   
   Copyright (C) 2005 by Lukasz Czajka
   
   This library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public License
   as published by the Free Software Foundation; either version 2.1 of
   the License, or (at your option) any later version.
   
   This library 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
   Lesser General Public License for more details.
   
   You should have received a copy of the GNU Lesser General Public
   License along with this library; if not, write to the Free Software
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
   02110-1301 USA *)

unit adt23tree;

{ This unit provides an implementation of a 2-3 tree - a data
  structure that provides all set operations with the worst-case
  O(log(n)) time and can be used as a concatenable priority queue. }

interface

uses
   adtcont, adtcontbase, adtfunct, adtiters, adtmem, adtdarray, adtutils;

&include adtdefs.inc
   
&_mcp_generic_include(adt23tree.i)
   
implementation

uses
   SysUtils, adtmsg;

&_mcp_generic_include(adt23tree_impl.i)

end.