informational question: compile time of large DATA arrays

[Bud Davis]

it's a data structure problem.  81% of the time is
spent in two routines.

gprof output below:


Each sample counts as 0.01 seconds.
  %   cumulative   self              self     total
 time   seconds   seconds    calls   s/call   s/call 
name
 45.58      1.03     1.03    25000     0.00     0.00 
find_con_by_offset
 35.40      1.83     0.80    25000     0.00     0.00 
gfc_insert_constructor
  3.10      1.90     0.07  7858528     0.00     0.00 
next_char
  3.10      1.97     0.07  6557635     0.00     0.00 
gfc_next_char_literal
  1.77      2.01     0.04   791725     0.00     0.00 
gfc_next_char
  1.33      2.04     0.03  6957869     0.00     0.00 
gfc_at_end
  1.33      2.07     0.03    25006     0.00     0.00 
load_line
  0.88      2.09     0.02   100065     0.00     0.00 
gfc_advance_line
  0.88      2.11     0.02        1     0.02     0.02 
gfc_scanner_init_1
  0.88      2.13     0.02                            
mpfr_round_prec
  0.88      2.15     0.02                            
mpfr_set_str

my example was with 25000 items.


--bud