From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD,
	FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4
X-Received: by 2002:a6b:7614:: with SMTP id g20mr5879218iom.14.1553899199860;
        Fri, 29 Mar 2019 15:39:59 -0700 (PDT)
X-Received: by 2002:aca:355:: with SMTP id 82mr5482596oid.30.1553899199590;
 Fri, 29 Mar 2019 15:39:59 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!136no162325itk.0!news-out.google.com!r82ni159ita.0!nntp.google.com!78no162555itl.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Fri, 29 Mar 2019 15:39:59 -0700 (PDT)
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=84.214.208.229;
 posting-account=bPTmZAoAAAC_6HP9XLKB9aAAxBa6BuOR
NNTP-Posting-Host: 84.214.208.229
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <b5bbc7b4-f685-4392-b8cd-b3f971c2b564@googlegroups.com>
Subject: Question on speed of set operations
From: reinert <reinkor@gmail.com>
Injection-Date: Fri, 29 Mar 2019 22:39:59 +0000
Content-Type: text/plain; charset="UTF-8"
Xref: reader01.eternal-september.org comp.lang.ada:56011
Date: 2019-03-29T15:39:59-07:00
List-Id: <comp.lang.ada>

Dear all,

I try to make an "Include" procedure similar to

procedure Include(Container: in out Set; New_Item: in Element_Type);

(under Containers.Ordered_sets) and where one includes 
(eventually replaces) elements in a set instead of including 
one element at a time. The intention is to make the user code 
clean/readable and efficient.

So what is the best alternative among the following tree procedures
for the above purpose (in terms of *speed*):

procedure Include(Container: in out Set; New_Items: in Set) is
begin
   for e of New_Items loop
       Container.Include(e);
   end loop;
end include_set;

procedure Include(Container: in out Set; New_Items: in Set) is
begin
   Container.Difference(New_Items);
   Container.Union(New_Items);
end include_set;

procedure Include(Container: in out Set; New_Items: in Set) is
begin
   Container := New_Items or Container
end include_set; 

Could there be other/better alternatives? And/or am I trying
to reinvent the wheel?

reinert