Ada Programming/Libraries/Ada.Containers.Bounded_Ordered_Sets
This language feature has been introduced in Ada 2012.
Ada.Containers.Bounded_Ordered_Sets is a unit of the Predefined Language Environment since Ada 2012.
Specification
edit-- Standard Ada library specification -- Copyright (c) 2004-2016 AXE Consultants -- Copyright (c) 2004, 2005, 2006 Ada-Europe -- Copyright (c) 2000 The MITRE Corporation, Inc. -- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc. -- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual -- -------------------------------------------------------------------------with
Ada.Iterator_Interfaces;generic
type
Element_Typeis
private
;with
function
"<" (Left, Right : Element_Type)return
Booleanis
<>;with
function
"=" (Left, Right : Element_Type)return
Booleanis
<>;package
Ada.Containers.Bounded_Ordered_Setsis
pragma
Pure(Bounded_Ordered_Sets);pragma
Remote_Types(Bounded_Ordered_Sets);function
Equivalent_Elements (Left, Right : Element_Type)return
Boolean;type
Set (Capacity : Count_Type)is
tagged
private
with
Constant_Indexing => Constant_Reference, Default_Iterator => Iterate, Iterator_Element => Element_Type;pragma
Preelaborable_Initialization(Set);type
Cursoris
private
;pragma
Preelaborable_Initialization(Cursor); Empty_Set :constant
Set; No_Element :constant
Cursor;function
Has_Element (Position : Cursor)return
Boolean;package
Set_Iterator_Interfacesis
new
Ada.Iterator_Interfaces (Cursor, Has_Element);function
"=" (Left, Right : Set)return
Boolean;function
Equivalent_Sets (Left, Right : Set)return
Boolean;function
To_Set (New_Item : Element_Type)return
Set;function
Length (Container : Set)return
Count_Type;function
Is_Empty (Container : Set)return
Boolean;procedure
Clear (Container :in
out
Set);function
Element (Position : Cursor)return
Element_Type;procedure
Replace_Element (Container :in
out
Set; Position :in
Cursor; New_Item :in
Element_Type);procedure
Query_Element (Position :in
Cursor; Process :not
null
access
procedure
(Element :in
Element_Type));type
Constant_Reference_Type (Element :not
null
access
constant
Element_Type)is
private
with
Implicit_Dereference => Element;function
Constant_Reference (Container :aliased
in
Set; Position :in
Cursor)return
Constant_Reference_Type;procedure
Assign (Target :in
out
Set; Source :in
Set);function
Copy (Source : Set; Capacity : Count_Type := 0)return
Set;procedure
Move (Target :in
out
Set; Source :in
out
Set);procedure
Insert (Container :in
out
Set; New_Item :in
Element_Type; Position :out
Cursor; Inserted :out
Boolean);procedure
Insert (Container :in
out
Set; New_Item :in
Element_Type);procedure
Include (Container :in
out
Set; New_Item :in
Element_Type);procedure
Replace (Container :in
out
Set; New_Item :in
Element_Type);procedure
Exclude (Container :in
out
Set; Item :in
Element_Type);procedure
Delete (Container :in
out
Set; Item :in
Element_Type);procedure
Delete (Container :in
out
Set; Position :in
out
Cursor);procedure
Delete_First (Container :in
out
Set);procedure
Delete_Last (Container :in
out
Set);procedure
Union (Target :in
out
Set; Source :in
Set);function
Union (Left, Right : Set)return
Set;function
"or" (Left, Right : Set)return
Setrenames
Union;procedure
Intersection (Target :in
out
Set; Source :in
Set);function
Intersection (Left, Right : Set)return
Set;function
"and" (Left, Right : Set)return
Setrenames
Intersection;procedure
Difference (Target :in
out
Set; Source :in
Set);function
Difference (Left, Right : Set)return
Set;function
"-" (Left, Right : Set)return
Setrenames
Difference;procedure
Symmetric_Difference (Target :in
out
Set; Source :in
Set);function
Symmetric_Difference (Left, Right : Set)return
Set;function
"xor" (Left, Right : Set)return
Setrenames
Symmetric_Difference;function
Overlap (Left, Right : Set)return
Boolean;function
Is_Subset (Subset : Set; Of_Set : Set)return
Boolean;function
First (Container : Set)return
Cursor;function
First_Element (Container : Set)return
Element_Type;function
Last (Container : Set)return
Cursor;function
Last_Element (Container : Set)return
Element_Type;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 : Set; Item : Element_Type)return
Cursor;function
Floor (Container : Set; Item : Element_Type)return
Cursor;function
Ceiling (Container : Set; Item : Element_Type)return
Cursor;function
Contains (Container : Set; Item : Element_Type)return
Boolean;function
"<" (Left, Right : Cursor)return
Boolean;function
">" (Left, Right : Cursor)return
Boolean;function
"<" (Left : Cursor; Right : Element_Type)return
Boolean;function
">" (Left : Cursor; Right : Element_Type)return
Boolean;function
"<" (Left : Element_Type; Right : Cursor)return
Boolean;function
">" (Left : Element_Type; Right : Cursor)return
Boolean;procedure
Iterate (Container :in
Set; Process :not
null
access
procedure
(Position :in
Cursor));procedure
Reverse_Iterate (Container :in
Set; Process :not
null
access
procedure
(Position :in
Cursor));function
Iterate (Container :in
Set)return
Set_Iterator_Interfaces.Reversible_Iterator'Class;function
Iterate (Container :in
Set; Start :in
Cursor)return
Set_Iterator_Interfaces.Reversible_Iterator'Class;generic
type
Key_Type (<>)is
private
;with
function
Key (Element : Element_Type)return
Key_Type;with
function
"<" (Left, Right : Key_Type)return
Booleanis
<>;package
Generic_Keysis
function
Equivalent_Keys (Left, Right : Key_Type)return
Boolean;function
Key (Position : Cursor)return
Key_Type;function
Element (Container : Set; Key : Key_Type)return
Element_Type;procedure
Replace (Container :in
out
Set; Key :in
Key_Type; New_Item :in
Element_Type);procedure
Exclude (Container :in
out
Set; Key :in
Key_Type);procedure
Delete (Container :in
out
Set; Key :in
Key_Type);function
Find (Container : Set; Key : Key_Type)return
Cursor;function
Floor (Container : Set; Key : Key_Type)return
Cursor;function
Ceiling (Container : Set; Key : Key_Type)return
Cursor;function
Contains (Container : Set; Key : Key_Type)return
Boolean;procedure
Update_Element_Preserving_Key (Container :in
out
Set; Position :in
Cursor; Process :not
null
access
procedure
(Element :in
out
Element_Type));type
Reference_Type (Element :not
null
access
Element_Type)is
private
with
Implicit_Dereference => Element;function
Reference_Preserving_Key (Container :aliased
in
out
Set; Position :in
Cursor)return
Reference_Type;function
Constant_Reference (Container :aliased
in
Set; Key :in
Key_Type)return
Constant_Reference_Type;function
Reference_Preserving_Key (Container :aliased
in
out
Set; Key :in
Key_Type)return
Reference_Type;end
Generic_Keys;private
-- not specified by the languageend
Ada.Containers.Bounded_Ordered_Sets;
See also
editWikibook
editExternal examples
edit- Search for examples of
Ada.Containers.Bounded_Ordered_Sets
in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook. - Search for posts related to
Ada.Containers.Bounded_Ordered_Sets
in: Stack Overflow, comp.lang.ada or any Ada related page.
Ada Reference Manual
editAda 2012
editOpen-Source Implementations
editFSF GNAT
- Specification: a-cborse.ads
- Body: a-cborse.adb