1 ------------------------------------------------------------------------------
3 -- GNAT RUN-TIME COMPONENTS --
5 -- G N A T . S E T S --
9 -- Copyright (C) 2018, AdaCore --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
32 package body GNAT
.Sets
is
38 package body Membership_Set
is
44 function Contains
(S
: Instance
; Elem
: Element_Type
) return Boolean is
46 return Hashed_Set
.Get
(Hashed_Set
.Instance
(S
), Elem
);
53 function Create
(Initial_Size
: Positive) return Instance
is
55 return Instance
(Hashed_Set
.Create
(Initial_Size
));
62 procedure Delete
(S
: Instance
; Elem
: Element_Type
) is
64 Hashed_Set
.Delete
(Hashed_Set
.Instance
(S
), Elem
);
71 procedure Destroy
(S
: in out Instance
) is
73 Hashed_Set
.Destroy
(Hashed_Set
.Instance
(S
));
80 function Has_Next
(Iter
: Iterator
) return Boolean is
82 return Hashed_Set
.Has_Next
(Hashed_Set
.Iterator
(Iter
));
89 procedure Insert
(S
: Instance
; Elem
: Element_Type
) is
91 Hashed_Set
.Put
(Hashed_Set
.Instance
(S
), Elem
, True);
98 function Is_Empty
(S
: Instance
) return Boolean is
100 return Hashed_Set
.Is_Empty
(Hashed_Set
.Instance
(S
));
107 function Iterate
(S
: Instance
) return Iterator
is
109 return Iterator
(Hashed_Set
.Iterate
(Hashed_Set
.Instance
(S
)));
116 procedure Next
(Iter
: in out Iterator
; Elem
: out Element_Type
) is
118 Hashed_Set
.Next
(Hashed_Set
.Iterator
(Iter
), Elem
);
125 function Size
(S
: Instance
) return Natural is
127 return Hashed_Set
.Size
(Hashed_Set
.Instance
(S
));