Parameter Sweeps

Parameter Grid Count

Total Cases

A parameter sweep often starts by counting how many combinations will be evaluated.

Program

Play the program to change one dimension of the grid and see the total case count.

parameter_grid_count.f90 
program parameter_grid_count_demo
    implicit none
    integer :: alpha_count
    integer :: beta_count
    integer :: total_cases

    alpha_count = 
    beta_count = 2
    total_cases = alpha_count * beta_count
    print '(I0, 1X, I0, 1X, I0)', alpha_count, beta_count, total_cases
end program parameter_grid_count_demo

program parameter_grid_count_demo
    implicit none
    integer :: alpha_count
    integer :: beta_count
    integer :: total_cases

    alpha_count = 
    beta_count = 2
    total_cases = alpha_count * beta_count
    print '(I0, 1X, I0, 1X, I0)', alpha_count, beta_count, total_cases
end program parameter_grid_count_demo

program parameter_grid_count_demo
    implicit none
    integer :: alpha_count
    integer :: beta_count
    integer :: total_cases

    alpha_count = 
    beta_count = 2
    total_cases = alpha_count * beta_count
    print '(I0, 1X, I0, 1X, I0)', alpha_count, beta_count, total_cases
end program parameter_grid_count_demo
grid dimension Each parameter list contributes one dimension to the sweep grid.
case count Multiplying dimension sizes gives the number of combinations.
planning pass Counting cases before evaluating them keeps sweep work visible.