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

arrayof_ttr_mapper_append_unique() integer function, private arrayof_ttr_mapper_append_unique ( type(arrayof_ttr_mapper) this, type(ttr_mapper), intent(in) content ) private Quick function to append an element to the array only if it is not present in the array yet. The return value is the position at which the element has been appended or at which it has been found. Parametri this array object to extend [in] content object of TYPE TYPE(ttr_mapper) to append Definizione alla linea 586 del file stat_proc_engine.F90. ! don't know a priori how many different (thus incompatible) reference ! times we have, so some assumption of regularity has to be made. For ! this reason msteps, the minimum step between two times, is ! computed. We choose to compute it as a difference between itime ! elements, it could be also computed as difference of itimerange%p1 ! elements. But what if it is not modulo steps? mstepms = steps*1000_int_ll DO i = 2, SIZE(itime) CALL getval(itime(i)-itime(i-1), amsec=stepms) IF (stepms > 0_int_ll .AND. stepms < mstepms) THEN msteps = stepms/1000_int_ll IF (mod(steps, msteps) == 0) mstepms = stepms ENDIF