Re: Standards conforming or not?


"glen herrmannsfeldt" <gah@xxxxxxxxxxxxxxxx> wrote in message
news:XtWdnVBif8pKupnZRVn-iQ@xxxxxxxxxxxxxx
Sorry, no. My answer was unfortunately incomplete: the value of dim must
be less than the rank of the array, which is not possible for a rank-1
array.

I must be too used to C, I read that and didn't even notice. In C
subscripts start at zero, so the maximum is one less than the number
in the declaration. You get used to it after a while.

But there you mean extent, not rank.

Regards,

Mike Metcalf


.

Relevant Pages

  • Part 4 of Short Steps Toward Generic Programming: KIND Genericity
    ... In this part I will again be discussing a feature that has been ... KIND and select the appropriate instance at compile-time in the ... Assumed Rank Arrays ... argument that don't require knowledge of the rank of the array. ...
    (comp.lang.fortran)
  • can this code be improved
    ... // the new array containing unique numbers only ... int number = 0; ... boolean dupLocated=false; ... Rank 1 number is 43 ...
    (comp.lang.java.programmer)
  • Re: Ranking Without Sorting
    ... you have just reinvented the rank sort. ... >> 'rank' array you want. ... >> Doing a 'heap sort', for example, where the heap holds the index into ...
    (comp.programming)
  • Re: Display the max, then the next down, then the next down, etc.
    ... > I just had to fix a couple of cell references. ... > the ROWwill give you the second lowest rank, and so on down the line. ... > The IF/ROW functions will return an array to feed into LARGE. ... The COUNTIF will count only one ...
    (microsoft.public.excel.misc)
  • Re: Ranking Without Sorting
    ... >> contradicted in my first post where I gave an example of how to rank ... > It seems quite clear to me that your 'ranking' array contains the exact ... The ranking array is completed from left to right as it might in a selection sort and unlike insertion sort. ...
    (comp.programming)