From: Fraser Wilson <newsfraser@blancolioni.org>
Subject: Re: Composing sequences (interesting to solve)
Date: 17 Jan 2003 09:27:49 +0100
Date: 2003-01-17T09:27:54+01:00 [thread overview]
Message-ID: <u1y3cyyd6.fsf@FWILSON.i-did-not-set--mail-host-address--so-shoot-me> (raw)
In-Reply-To: 3e2712ff$0$33929$bed64819@news.gradwell.net
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.
It's not an Ada thing as such; more of an ambiguity in the problem
definition.
Fraser.
next prev parent reply other threads:[~2003-01-17 8:27 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-01-16 3:01 Composing sequences (interesting to solve) Victor Porton
2003-01-16 18:20 ` Dmitry A. Kazakov
2003-01-16 20:09 ` Victor Porton
2003-01-17 8:27 ` Fraser Wilson [this message]
2003-01-17 16:27 ` Dmitry A. Kazakov
2003-01-17 20:45 ` Victor Porton
2003-01-17 21:04 ` Victor Porton
2003-01-18 12:31 ` Dmitry A. Kazakov
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox