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=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,dff686f95f235879
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-01-17 14:17:27 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!arclight.uoregon.edu!wn13feed!worldnet.att.net!204.71.34.3!newsfeed.cwix.com!newsfeed.icl.net!newsfeed.fjserv.net!proxad.net!newsfeed.hostname.nl!zen.net.uk!news.cabal.org.uk!news-peer.gradwell.net!not-for-mail
Newsgroups: comp.lang.ada
From: porton@ex-code.com (Victor Porton)
Date: Sat, 18 Jan 2003 01:45:34 +0500
References: <3e2620ad$0$33930$bed64819@news.gradwell.net>
Organization: Extreme Code Software (http://ex-code.com)
Subject: Re: Composing sequences (interesting to solve)
Mime-Version: 1.0
X-Newsreader: knews 1.0b.1
Content-Type: text/plain; charset=us-ascii
X-URL: http://www.ex-code.com/
Message-ID: <3e2880f6$0$33930$bed64819@news.gradwell.net>
NNTP-Posting-Date: 17 Jan 2003 22:17:26 GMT
NNTP-Posting-Host: 195.149.39.13
X-Trace: 1042841846 news.gradwell.net 33930 mail2news/195.149.39.13
X-Complaints-To: news-abuse@gradwell.net
Xref: archiver1.google.com comp.lang.ada:33160
Date: 2003-01-17T22:17:26+00:00
List-Id: <comp.lang.ada>

In article <u1y3cyyd6.fsf@fwilson.i-did-not-set--mail-host-address--so-shoot-me>,
	Fraser Wilson <newsfraser@blancolioni.org> writes:
> porton@ex-code.com (Victor Porton) writes:
> 
>> In article <b06t4c$m4h27$3@id-77047.news.dfncis.de>,> You haven't given me a solution. (I suspect that it is even impossible 
>> in Ada9X.)
> 
> Presented with
> 
>    S & T
> 
> where S is a sequence, and T is something else, how can you know
> whether the desired result is a new sequence of S and T, or the
> sequence S with T tacked onto the end (i.e. an intermediate result
> from "P & Q & T")?  Unless you add an extra rule which says that all
> sequences get merged (i.e. always choose the second option in this
> case), I don't think this is possible.

I mean to merge all sequences at compile time, but probably not at run 
time. Well, now I'm almost sure that it is impossible in Ada (however 
possible in C++). I'm switching to an another syntax.