oop-benchmarks/benchmarkTuringSP.cpp

#include <iostream>
#include <cstdlib>
#include <stdexcept>
#include <chrono>

using namespace std;
using namespace std::chrono;

#define CASES (100000)
#define MAX_VALUE (0xffff)

// depends on max value
#define MAX_BAND_SIZE (16 + 1)

#define SEED (1337)

int inputs[CASES];
bool results[CASES];

bool isBinaryPalindrome(int input) {
    int numberOfDigits = input == 0 ? 1 : static_cast<int>(floor(log2(input)) + 1);

    for (int i = 0; i < numberOfDigits / 2; i++) {
        if (((input & (1 << i)) ? 1 : 0) != ((input & (1 << (numberOfDigits - i - 1))) ? 1 : 0)) {
            return false;
        }
    }

    return true;
}

void resetTestData() {
    srand(SEED);

    for (int i = 0; i < CASES; i++) {
        inputs[i] = rand() % (MAX_VALUE + 1);
        results[i] = isBinaryPalindrome(inputs[i]);
    }
}

enum Direction {
    LEFT, RIGHT
};

enum Symbol {
    UNDEFINED, TRUE, FALSE
};

auto transitionTable(int state, Symbol symbolRead) {
    switch (state) {
        case 0: // init; look for first symbol
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(200, RIGHT, UNDEFINED);
                case TRUE:      return make_tuple(10, RIGHT, UNDEFINED);
                case FALSE:     return make_tuple(20, RIGHT, UNDEFINED);
            }
        case 10: // look for right hand side - we need TRUE
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(11, LEFT, UNDEFINED);
                case TRUE:      return make_tuple(10, RIGHT, TRUE);
                case FALSE:     return make_tuple(10, RIGHT, FALSE);
            }
        case 11: // right hand side - this should be TRUE
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(200, LEFT, UNDEFINED);
                case TRUE:      return make_tuple(12, LEFT, UNDEFINED);
                case FALSE:     return make_tuple(100, LEFT, UNDEFINED);
            }
        case 12: // right hand side - new decision
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(200, RIGHT, UNDEFINED);
                case TRUE:      return make_tuple(13, LEFT, UNDEFINED);
                case FALSE:     return make_tuple(23, LEFT, UNDEFINED);
            }
        case 13: // look for left hand side - we need TRUE
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(14, RIGHT, UNDEFINED);
                case TRUE:      return make_tuple(13, LEFT, TRUE);
                case FALSE:     return make_tuple(13, LEFT, FALSE);
            }
        case 14: // left hand side - should be TRUE
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(200, RIGHT, UNDEFINED);
                case TRUE:      return make_tuple(0, RIGHT, UNDEFINED);
                case FALSE:     return make_tuple(100, RIGHT, UNDEFINED);
            }

        case 20: // look for right hand side - we need FALSE
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(21, LEFT, UNDEFINED);
                case TRUE:      return make_tuple(20, RIGHT, TRUE);
                case FALSE:     return make_tuple(20, RIGHT, FALSE);
            }
        case 21: // right hand side - this should be FALSE
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(200, LEFT, UNDEFINED);
                case TRUE:      return make_tuple(100, LEFT, UNDEFINED);
                case FALSE:     return make_tuple(22, LEFT, UNDEFINED);
            }
        case 22: // right hand side - new decision
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(200, RIGHT, UNDEFINED);
                case TRUE:      return make_tuple(13, LEFT, UNDEFINED);
                case FALSE:     return make_tuple(23, LEFT, UNDEFINED);
            }
        case 23: // look for left hand side - we need FALSE
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(24, RIGHT, UNDEFINED);
                case TRUE:      return make_tuple(23, LEFT, TRUE);
                case FALSE:     return make_tuple(23, LEFT, FALSE);
            }
        case 24: // left hand side - should be FALSE
            switch (symbolRead) {
                case UNDEFINED: return make_tuple(200, RIGHT, UNDEFINED);
                case TRUE:      return make_tuple(100, RIGHT, UNDEFINED);
                case FALSE:     return make_tuple(0, RIGHT, UNDEFINED);
            }
        default:
            return make_tuple(100, RIGHT, UNDEFINED);
    }
}

bool reject(int state) {
    return state == 100;
}

bool accept(int state) {
    return state == 200;
}

int getNextPosition(int position, Direction direction) {
    if (direction == LEFT) {
        return position - 1;
    } else {
        return position + 1;
    }
}

void initBand(Symbol band[MAX_BAND_SIZE], int input) {
    int numberOfDigits = input == 0 ? 1 : static_cast<int>(floor(log2(input)) + 1);

    int i = 0;
    for (; i < numberOfDigits; i++) {
        band[i] = (input & (1 << (numberOfDigits - i - 1))) ? TRUE : FALSE;
    }
    for (; i < MAX_BAND_SIZE; i++) {
        band[i] = UNDEFINED;
    }
}

Symbol getFromBand(Symbol band[MAX_BAND_SIZE], int position) {
    if (position < 0 || position >= MAX_BAND_SIZE) {
        return UNDEFINED;
    } else {
        return band[position];
    }
}

void setOnBand(Symbol band[MAX_BAND_SIZE], int position, Symbol symbol) {
    if (!(position < 0 || position >= MAX_BAND_SIZE)) {
        band[position] = symbol;
    }
}

bool abort(int state) {
    return reject(state) || accept(state);
}

bool runMachine(Symbol band[MAX_BAND_SIZE]) {
    int state = 0;
    int position = 0;

    while(!abort(state)) {
        Symbol read = getFromBand(band, position);
        auto transition = transitionTable(state, read);
        state = get<0>(transition);
        setOnBand(band, position, get<2>(transition));
        position = getNextPosition(position, get<1>(transition));
    }

    return accept(state);
}


bool test(int input) {
    Symbol band[MAX_BAND_SIZE];
    initBand(band, input);

    return runMachine(band);
}

int main() {
    resetTestData();

    auto t1 = high_resolution_clock::now();
    for (int i = 0; i < CASES; i++) {
        if (test(inputs[i]) != results[i]) {
            cout << i << ": " << inputs[i] << ", " << results[i] << " -> "<< "FAIL" << endl;
        }
    }
    auto t2 = high_resolution_clock::now();

    duration<double, std::milli> ms = t2 - t1;
    cout << ms.count() << " ms, " << (ms.count() / CASES) << " ms/case" << endl;

}