-- --
-- GNAT LIBRARY COMPONENTS --
-- --
--- ADA.CONTAINERS.DOUBLY_LINKED_LISTS --
+-- A D A . C O N T A I N E R S . D O U B L Y _ L I N K E D _ L I S T S --
-- --
-- S p e c --
-- --
--- Copyright (C) 2004 Free Software Foundation, Inc. --
+-- Copyright (C) 2004-2009, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
--- ware Foundation; either version 2, or (at your option) any later ver- --
+-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT 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 GNAT; see file COPYING. If not, write --
--- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
--- MA 02111-1307, USA. --
+-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
--- 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. --
+-- As a special exception under Section 7 of GPL version 3, you are granted --
+-- additional permissions described in the GCC Runtime Library Exception, --
+-- version 3.1, as published by the Free Software Foundation. --
+-- --
+-- You should have received a copy of the GNU General Public License and --
+-- a copy of the GCC Runtime Library Exception along with this program; --
+-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
+-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
-with Ada.Finalization;
-with Ada.Streams;
+private with Ada.Finalization;
+private with Ada.Streams;
generic
type Element_Type is private;
return Boolean is <>;
package Ada.Containers.Doubly_Linked_Lists is
- pragma Preelaborate (Doubly_Linked_Lists);
+ pragma Preelaborate;
+ pragma Remote_Types;
type List is tagged private;
+ pragma Preelaborable_Initialization (List);
type Cursor is private;
+ pragma Preelaborable_Initialization (Cursor);
Empty_List : constant List;
function Element (Position : Cursor) return Element_Type;
+ procedure Replace_Element
+ (Container : in out List;
+ Position : Cursor;
+ New_Item : Element_Type);
+
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Update_Element
- (Position : Cursor;
- Process : not null access procedure (Element : in out Element_Type));
-
- procedure Replace_Element
- (Position : Cursor;
- By : Element_Type);
+ (Container : in out List;
+ Position : Cursor;
+ Process : not null access procedure (Element : in out Element_Type));
procedure Move
(Target : in out List;
Source : in out List);
- procedure Prepend
+ procedure Insert
(Container : in out List;
+ Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1);
- procedure Append
+ procedure Insert
(Container : in out List;
+ Before : Cursor;
New_Item : Element_Type;
+ Position : out Cursor;
Count : Count_Type := 1);
procedure Insert
(Container : in out List;
Before : Cursor;
- New_Item : Element_Type;
+ Position : out Cursor;
Count : Count_Type := 1);
- procedure Insert
+ procedure Prepend
(Container : in out List;
- Before : Cursor;
New_Item : Element_Type;
- Position : out Cursor;
Count : Count_Type := 1);
- procedure Insert
+ procedure Append
(Container : in out List;
- Before : Cursor;
- Position : out Cursor;
+ New_Item : Element_Type;
Count : Count_Type := 1);
procedure Delete
(Container : in out List;
Count : Count_Type := 1);
- generic
- with function "<" (Left, Right : Element_Type)
- return Boolean is <>;
- procedure Generic_Sort (Container : in out List);
-
- generic
- with function "<" (Left, Right : Element_Type)
- return Boolean is <>;
- procedure Generic_Merge (Target : in out List; Source : in out List);
+ procedure Reverse_Elements (Container : in out List);
- procedure Reverse_List (Container : in out List);
-
- procedure Swap (I, J : in Cursor);
+ procedure Swap
+ (Container : in out List;
+ I, J : Cursor);
procedure Swap_Links
(Container : in out List;
procedure Splice
(Target : in out List;
Before : Cursor;
- Position : Cursor);
+ Source : in out List;
+ Position : in out Cursor);
procedure Splice
- (Target : in out List;
- Before : Cursor;
- Source : in out List;
- Position : Cursor);
+ (Container : in out List;
+ Before : Cursor;
+ Position : Cursor);
function First (Container : List) return Cursor;
function Last_Element (Container : List) return Element_Type;
- function Contains
- (Container : List;
- Item : Element_Type) return Boolean;
+ function Next (Position : Cursor) return Cursor;
+
+ procedure Next (Position : in out Cursor);
+
+ function Previous (Position : Cursor) return Cursor;
+
+ procedure Previous (Position : in out Cursor);
function Find
(Container : List;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
- function Next (Position : Cursor) return Cursor;
-
- function Previous (Position : Cursor) return Cursor;
-
- procedure Next (Position : in out Cursor);
-
- procedure Previous (Position : in out Cursor);
+ function Contains
+ (Container : List;
+ Item : Element_Type) return Boolean;
function Has_Element (Position : Cursor) return Boolean;
(Container : List;
Process : not null access procedure (Position : Cursor));
+ generic
+ with function "<" (Left, Right : Element_Type) return Boolean is <>;
+ package Generic_Sorting is
+
+ function Is_Sorted (Container : List) return Boolean;
+
+ procedure Sort (Container : in out List);
+
+ procedure Merge (Target, Source : in out List);
+
+ end Generic_Sorting;
+
private
+
+ pragma Inline (Next);
+ pragma Inline (Previous);
+
type Node_Type;
type Node_Access is access Node_Type;
type Node_Type is
- record
+ limited record
Element : Element_Type;
Next : Node_Access;
Prev : Node_Access;
end record;
- function "=" (L, R : Node_Type) return Boolean is abstract;
-
use Ada.Finalization;
type List is
First : Node_Access;
Last : Node_Access;
Length : Count_Type := 0;
+ Busy : Natural := 0;
+ Lock : Natural := 0;
end record;
+ overriding
procedure Adjust (Container : in out List);
+ overriding
procedure Finalize (Container : in out List) renames Clear;
use Ada.Streams;
procedure Read
- (Stream : access Root_Stream_Type'Class;
+ (Stream : not null access Root_Stream_Type'Class;
Item : out List);
for List'Read use Read;
procedure Write
- (Stream : access Root_Stream_Type'Class;
+ (Stream : not null access Root_Stream_Type'Class;
Item : List);
for List'Write use Write;
- Empty_List : constant List := List'(Controlled with null, null, 0);
-
type List_Access is access constant List;
for List_Access'Storage_Size use 0;
Node : Node_Access;
end record;
+ procedure Read
+ (Stream : not null access Root_Stream_Type'Class;
+ Item : out Cursor);
+
+ for Cursor'Read use Read;
+
+ procedure Write
+ (Stream : not null access Root_Stream_Type'Class;
+ Item : Cursor);
+
+ for Cursor'Write use Write;
+
+ Empty_List : constant List := (Controlled with null, null, 0, 0, 0);
+
No_Element : constant Cursor := Cursor'(null, null);
end Ada.Containers.Doubly_Linked_Lists;
-
OSDN Git Service
