JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for COMP-FORTRAN-90 Archives


COMP-FORTRAN-90 Archives

COMP-FORTRAN-90 Archives


COMP-FORTRAN-90@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

COMP-FORTRAN-90 Home

COMP-FORTRAN-90 Home

COMP-FORTRAN-90  2006

COMP-FORTRAN-90 2006

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Re: array of derived types

From:

Richard E Maine <[log in to unmask]>

Reply-To:

Fortran 90 List <[log in to unmask]>

Date:

Thu, 12 Jan 2006 09:42:51 -0800

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (64 lines)

On Jan 12, 2006, at 8:48 AM, Aleksandar Donev wrote:

> Richard E Maine wrote:
>
>> So let's look at that question instead of the question of whether
>> ARRAY is a section, which doesn't seem to have much to do with the
>> definition of LBOUND.
> The "definition" of LBOUND is not really of relevance because it is
> circular, in that it uses the plain English "lower-bound"

The definition of LBOUND had better be of some relevance to determining 
what its results are; I don't think "not really of relevance" was what 
you meant. That the definition might be poorly or confusingly done, I 
could believe. But I won't "buy" that it could be irrelevant. And note 
that "lower bound" is a technical term rather than an English one. See 
5.1.2.5.1 for the bnf of lower-bound, and the tie of the term "lower 
bound" to that bnf.

While I might end up agreeing with your end point, I'm picky about 
wording matters here. The whole question is one of a picky wording 
matter in the standard, so it gets quite hard to answer if one uses 
sloppy wording in the analysis.

> We define what the "lower bound" is for explicit arrays, assumed-shape
> arrays, pointers, allocatables, etc., but not for array sections. It
> should say somewhere that it is 1 for array sections, but all I can
> find in the standard is what the shape and rank are, not the bounds???

Yes. I'm missing something here also. That could be one possible 
explanation - that this is both a component and a section, and that the 
undiscovered (also by me) words define  the lower bounds of the 
section. I could buy this answer; easy for me to believe that I just 
failed to find the missing words. That could make it all consistent 
anyway, but...

This business about being both a component and a section still bugs me 
though, because I could have sworn they were exclusive (and that 
distinction was the one I kept having to look up). But I keep 
rechecking and seeing the same thing. Maybe I'm blind to something 
today.

> Richard, can you please check F95 for this?

Looks the same to me.

> I am confident the answer to Bert's question is: The bounds in both
> cases are [1,5].

I'm not so confident either way. Mostly because my attempt at careful 
reading isn't jibing with my memory. Whether this means there is a 
fault in my reading, my memory, both, or perhaps in my logic that says 
they don't jibe - well, I can't confidently say right now.

There have been things that almost all compilers got wrong before, but 
that still came out with interp answers contrary to what compilers were 
doing. So while what most compilers seem to do is certainly a point to 
consider, it isn't definitive. For example, it can easily be trumped by 
internal inconsistency.

-- 
Richard Maine                |  Good judgment comes from experience;
[log in to unmask]       |  experience comes from bad judgment.
                             |        -- Mark Twain

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

December 2023
February 2023
November 2022
September 2022
February 2022
January 2022
June 2021
November 2020
September 2020
June 2020
May 2020
April 2020
December 2019
October 2019
September 2019
March 2019
February 2019
January 2019
November 2018
October 2018
September 2018
August 2018
July 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
December 2015
November 2015
October 2015
September 2015
August 2015
June 2015
April 2015
March 2015
January 2015
December 2014
November 2014
October 2014
August 2014
July 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
July 2013
June 2013
May 2013
April 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
August 2010
July 2010
June 2010
March 2010
February 2010
January 2010
December 2009
October 2009
August 2009
July 2009
June 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager