-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package 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 distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support-unbounded.ads,v $ -- $Revision: 1.15.2.1 $ -- $Date: 2002/12/26 14:48:24 $ -- $Author: simon $ with Ada.Finalization; with Ada.Streams; with System.Storage_Pools; generic type Item is private; with function "=" (L, R : Item) return Boolean is <>; type Item_Ptr is access all Item; Storage : in out System.Storage_Pools.Root_Storage_Pool'Class; package BC.Support.Unbounded is pragma Elaborate_Body; type Unb_Node is private; -- An unpacked container whose items are stored on the heap. -- Items are effectively indexed from 1. function "=" (Left, Right : Unb_Node) return Boolean; procedure Clear (Obj : in out Unb_Node); -- Empty the container of all Items procedure Insert (Obj : in out Unb_Node; Elem : Item); -- Add an item to the front of the container procedure Insert (Obj : in out Unb_Node; Elem : Item; Before : Positive); -- Add an item to the container, before the given index procedure Append (Obj : in out Unb_Node; Elem : Item); -- Add an item to the end of the container procedure Append (Obj : in out Unb_Node; Elem : Item; After : Positive); -- Add an item to the container, after the given index procedure Remove (Obj : in out Unb_Node; From : Positive); -- Remove the item at the given index procedure Replace (Obj : in out Unb_Node; Index : Positive; Elem : Item); -- Replace the item at index with the new elem function Length (Obj : Unb_Node) return Natural; -- Returns the number of items in the container function First (Obj : Unb_Node) return Item; -- Returns the item at the front of the container function Last (Obj : Unb_Node) return Item; -- Returns the item at the end of the container function Item_At (Obj : Unb_Node; Index : Positive) return Item; function Item_At (Obj : Unb_Node; Index : Positive) return Item_Ptr; -- Returns the item at the given index function Location (Obj : Unb_Node; Elem : Item; Start : Positive := 1) return Natural; -- Returns the first index in which the given item is -- found. Returns 0 if unsuccessful. private type Node; type Node_Ref is access Node; for Node_Ref'Storage_Pool use Storage; type Node is record Element : Item; Next : Node_Ref; Previous : Node_Ref; end record; type Unb_Node is new Ada.Finalization.Controlled with record Rep : Node_Ref; Last : Node_Ref; Size : Natural := 0; Cache : Node_Ref; Cache_Index : Natural := 0; -- 0 means invalid end record; procedure Adjust (U : in out Unb_Node); procedure Finalize (U : in out Unb_Node); procedure Write_Unb_Node (Stream : access Ada.Streams.Root_Stream_Type'Class; Obj : Unb_Node); procedure Read_Unb_Node (Stream : access Ada.Streams.Root_Stream_Type'Class; Obj : out Unb_Node); for Unb_Node'Write use Write_Unb_Node; for Unb_Node'Read use Read_Unb_Node; end BC.Support.Unbounded;