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  2000

COMP-FORTRAN-90 2000

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Re: template instruction

From:

Kurt W Hirchert <[log in to unmask]>

Reply-To:

Fortran 90 List <[log in to unmask]>

Date:

Mon, 4 Dec 2000 09:22:38 -0600

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (117 lines)

At 09:25 AM 12/4/00 +0100, Giampaolo Bottoni wrote:
>I look at ftp://ftp.j3-fortran.org/j3/doc/standing/007 but,
>if I have correctly understood, the  ASSOCIATE construct is,
>from some points of view,  LESS powerful than Pascal's and
>(this is for me more important) JavaScript's WITH.
>
>Whith the ASSOCIATE construct I must specify ALL the
>associated components. I would like instead to IMPLICITLY
>specify to the compiler that a lot of variables belongs to
>the same object.
>
>With the WITH construct I can look at any  Fortran 77
>old instruction sequence, create a service derived utility_type whose
>components are all the instruction sequence variables
>and then, using a simple WITH, perform the
>sequence instructions with the data of the created utility_object.
>Without any modification of the old instruction sequence
>and without a long list of all the instruction sequence variables !!!!
>
>If the same calculation must be performed with different
>data, a parallelization procedure (using the Unix pthread_create(...)
>or the Windows CreateThread(...)) can be set up where
>each thread works on a different element of a vector whose elements
>are of the type of the utility_object.
>
>A NEW PROPOSAL for the ASSOCIATE instruction: If I could write:
>
>ASSOCIATE ( *=> myobj%* )
>    a=b+c+d+...+z
>END ASSOCIATE
>
>that is if all the components would match to their own names (*=>myobj%*),
>the ASSOCIATE instruction could work exactly as the WITH !!!
>Now, instead, I must write:
>
>ASSOCIATE (a =>myobj%a, b=>myobj%b ,..., z=myobj%z)
>
>a very hard and tiring work if I have hundred of components!
>
>...
>
>Joking aside, do you think that my proposed enancement ( *=> xxx%* )
>can be accepted ?

I think it improbable.

The committee was unhappy with the Pascal-like version of WITH for a number
of reasons. I probably don't remember them all, but here are a couple:

1. The component names unconditionally override local variables with the
same name.  This may not be a problem for small programs written by a
single author, as that author can arrange for the names not to overlap, but
in larger programs with multiple authors, the probability for name
conflicts seemed high.  It would be possible to work around this if a
renaming facility (like that on the USE statement) were included, but that
seemed at odds with the original intent of having a _simple_ ASSOCIATE
construct.

2. Although the Pascal-like approach can work well when dealing with the
components of a single structure, it worked poorly when programming
interactions between two or more structures.  One could only "abbreviate"
the references to one of the structures, so references to the other(s) had
to be written in full.

For these reasons and others, the committee felt it better that the user,
rather than the compiler, be in control of the abbreviated names being
created by ASSOCIATE.  It was assumed that in the single structure case,
rather than write

ASSOCIATE (a =>myobj%a, b=>myobj%b ,..., z=myobj%z)
    a=b+c+d+...+z
END ASSOCIATE

one would be more likely to write something like

ASSOCIATE (M => myobj)
    M%a=M%b+M%c+M%d+...+M%z
END ASSOCIATE

[In practice, most of the components names are likely to be longer that one
character, but the "abbreviation" for the object really is likely to be one
or two characters long, so the "overhead" for referencing components would
be kept relatively small.]  This approach extends well to multiple
structures; all one has to do is add more "abbreviations" for the
designators of the other objects.

I realize that this approach does not work well for the particular problem
you are describing because of your requirement that the reference syntax
not be changed.  I suppose it _possible_ that the committee would consider
your proposed extension to support that particular class of problems, but I
think it likely that they would find the size of this problem domain too
small to justify this much extra baggage.

[I find it somewhat disingenuous for you to complain about dealing with
hundreds of component names in the ASSOCIATE statement when you were
willing to deal with those same hundreds of names in creating the
type.  Indeed, if I were faced with your application on a one-shot basis, I
would probably use my favorite editor to convert the type definition into
the required ASSOCIATE statement, so I wouldn't have to deal with those
hundreds of components individually.  (If I were doing it repeatedly, I
would probably use a Perl script instead -- higher initial cost but less
incremental cost each time I created a new ASSOCIATE statement.)]

Perhaps I am misjudging the extent of your problem domain, but its special
characteristics, i.e.,
a) the existence of extensive code that you wish to change from applying to
variables to applying to components without textual modifications,
b) the lack of need to access other variables in the surrounding
environment, and
c) the lack of need to deal with more than one instance of the structure at
at time,
collectively strike me as being relatively unusual.

--
Kurt W Hirchert                                  [log in to unmask]
UIUC Department of Atmospheric Sciences                  +1-217-265-0327

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