arrayof_ttr_mapper_append arrayof_ttr_mapper_append_unique arrayof_ttr_mapper_delete arrayof_ttr_mapper_insert arrayof_ttr_mapper_insert_array arrayof_ttr_mapper_insert_sorted arrayof_ttr_mapper_insert_unique arrayof_ttr_mapper_packarray arrayof_ttr_mapper_remove count_distinct_sorted_ttr_mapper count_distinct_ttr_mapper index_sorted_ttr_mapper index_ttr_mapper inssor_ttr_mapper map_distinct_ttr_mapper map_inv_distinct_ttr_mapper pack_distinct_sorted_ttr_mapper pack_distinct_ttr_mapper sort_ttr_mapper

count_distinct_sorted_ttr_mapper() integer function stat_proc_engine::count_distinct_sorted_ttr_mapper ( type(ttr_mapper), dimension(:), intent(in)  vect, logical, dimension(:), intent(in), optional  mask  ) conta gli elementi distinti in un sorted array Definizione alla linea 838 del file stat_proc_engine.F90. END SUBROUTINE time_timerange_get_period ! get start of period, end of period and reference time from time, ! timerange, according to time_definition. SUBROUTINE ttr_decoder_decode(time, timerange, time_definition, decoded) TYPE(datetime),INTENT(in) :: time TYPE(vol7d_timerange),INTENT(in) :: timerange INTEGER,INTENT(in) :: time_definition TYPE(ttr_decoder),INTENT(out) :: decoded TYPE(timedelta) :: p1, p2 p1 = timedelta_new(sec=timerange%p1) ! end of period p2 = timedelta_new(sec=timerange%p2) ! length of period IF (time == datetime_miss .OR. .NOT.c_e(timerange%p1) .OR. .NOT.c_e(timerange%p2) .OR. & ! (timerange%p1 > 0 .AND. timerange%p1 < timerange%p2) .OR. & timerange%p1 < 0 .OR. timerange%p2 < 0) THEN ! is this too pedantic and slow? decoded%pstart = datetime_miss decoded%pend = datetime_miss decoded%reftime = datetime_miss RETURN ENDIF IF (time_definition == 0) THEN ! time == reference time decoded%reftime = time decoded%pend = time + p1