The Big Programming Thread - Page 446

#pragma strict_types

#include "../puzzle.h"

// global variables
private nosave int active_cube = 0;
private nosave int *cubes = ({ 1, 2, 3, 4, 5 });
private nosave int *displays = ({ 1, 2, 3, 4, 5 });
private nosave int *holes = ({ 1, 2, 3, 4, 5 });
private nosave int *values  = ({ 16, 17, 18, 19, 20 });
private nosave string *patterns = ({ "     ",
                                     "=    ",
                                     "==   ",
                                     "===  ",
                                     "==== ",
                                     "=====" });
                                                                        
// prototypes
public int query_cube(int x, string filepath, string funcname);
public int query_display(int x, string filepath, string funcname);
public int query_value(int x, string filepath, string funcname);
public int query_hole(int x, string filepath, string funcname);
public int empty_hole(int x, string filepath, string funcname);
public int query_active_cube();
public string query_pattern(int x, string filepath, string funcname);
public void set_hole(int x, int y, string filepath, string funcname);
public void set_active_cube(int x, string filepath, string funcname);
public void remove_cube(int x, string filepath, string funcname);
public void return_cube();
public void update_values();
public void reset_puzzle();
private int validate_data(int n, string filepath, string funcname,
    int errscope);
private int * shuffle_array(int *arr);


// data retrieval
public int query_cube(int x, string filepath, string funcname)
{
    int n = validate_data(x, filepath, funcname, 4);

    return cubes[n];
}

public int query_active_cube()
{
    return active_cube;
}

public int query_display(int x, string filepath, string funcname)
{
    int n = validate_data(x, filepath, funcname, 4);

    return displays[n];
}

public int query_value(int x, string filepath, string funcname)
{
    int n = validate_data(x, filepath, funcname, 4);

    return values[n];
}

public int query_hole(int x, string filepath, string funcname)
{
    int n = validate_data(x, filepath, funcname, 4);

    return holes[n];
}

public string query_pattern(int x, string filepath, string funcname)
{    
    int n = validate_data(x, filepath, funcname, 5);

    return patterns[n];
}
                                     
// data manipulation
private int validate_data(int n, string filepath, string funcname,
    int errscope)
{
    if (n < 0)
    {
        LOGGER->write_error_log(n, filepath, funcname, errscope);

        return 0;
    }

    if (n > errscope)
    {
        LOGGER->write_error_log(n, filepath, funcname, errscope);

        return errscope;
    }

    return n;
}

public void set_hole(int x, int y, string filepath, string funcname)
{
    int n = validate_data(x, filepath, funcname, 4);
    int cube = validate_data(y, filepath, funcname, 5);

    holes[n] = cube;
}

public void remove_cube(int x, string filepath, string funcname)
{
    int n = validate_data(x, filepath, funcname, 4);

    cubes[n] = 0;
}

public void return_cube()
{
    int i = 0;
    
    /* locate first missing cube in the array and replace it */
    while (i < 5)
    {
        if (!query_cube(i, DATA, "return_cube"))
        {
            cubes[i] = active_cube;

            break;
        }
        
        i += 1;
    }
}

public int empty_hole(int x, string filepath, string funcname)
{
    int n = validate_data(x, filepath, funcname, 4);

    holes[n] = 0;
}

public void set_active_cube(int x, string filepath, string funcname)
{
    int n = validate_data(x, filepath, funcname, 5);

    active_cube = n;
}

public void update_values()
{   
    int sum = 0;
    
    /* test for presence of cubes */
    for (int i = 0; i < 5; i += 1)
    {
        if (query_hole(i, DATA, "update_values"))
        {
            sum += holes[i];
        }
    }
    
    /* update values across all displays */
    for (int i = 0; i < 5; i += 1)
    {
        values[i] = displays[i] + sum;
    }
}

public void reset_puzzle()
{
    int n = 0;

    /* restore all available cubes */
    while (n < 5)
    {
        if (!cubes[n])
        {
            cubes = ({ 1, 2, 3, 4, 5 });

            break;
        }

        n += 1;
    }

    /* remove cubes from holes under displays */
    for (int i = 0; i < 5; i += 1)
    {
        empty_hole(i, DATA, "reset_puzzle");
    }
    
    /* reset data */
    shuffle_array(displays);
    shuffle_array(cubes);
    update_values();
}

private int * shuffle_array(int *arr)
{
    for (int i = 0; i < 5; i += 1)
    {
        int s = random(5);
        int tmp = arr[i];
        
        arr[i] = arr[s];
        arr[s] = tmp;
    }
    
    return arr;
}