implementation_files/cyclic_shift.cpp - master - Krahjotdaan/ArrayModule-for-cpp

implementation_files/cyclic_shift.cpp
212 строк6 KB
Ostapenko
Docs: added Doxygen comments to implementation files
06 июн 2023, 14:36
06 июн 2023, 14:362def49f
#include "../arraymodule.hpp"
#include <iostream>

using namespace std;

/// @brief function of cyclic shift
/// @details if value over zero, array will move to right; if value under zero, array will move to left
/// @param array source array
/// @param size size of array
/// @param value amount of shifts
void shift(int array[], int size, int value) {
    if (value > 0) {
        for (int i = 0; i < value; i++) {
            int tmp = array[size - 1];
            for (int j = size - 1; j >= 0; j--) {
                array[j + 1] = array[j];
            }
            array[0] = tmp;
        }
    }
    else if (value < 0) {
        for (int i = 0; i < value * -1; i++) {
            int tmp = array[0];
            for (int j = 0; j < size; j++) {
                array[j] = array[j + 1];
            }
            array[size - 1] = tmp;
        }
    }
}

/// @brief function of cyclic shift
/// @details if value over zero, array will move to right; if value under zero, array will move to left
/// @param array source array
/// @param size size of array
/// @param value amount of shifts
void shift(long long array[], int size, int value) {
    if (value > 0) {
        for (int i = 0; i < value; i++) {
            long long tmp = array[size - 1];
            for (int j = size - 1; j >= 0; j--) {
                array[j + 1] = array[j];
            }
            array[0] = tmp;
        }
    }
    else if (value < 0) {
        for (int i = 0; i < value * -1; i++) {
            long long tmp = array[0];
            for (int j = 0; j < size; j++) {
                array[j] = array[j + 1];
            }
            array[size - 1] = tmp;
        }
    }
}

/// @brief function of cyclic shift
/// @details if value over zero, array will move to right; if value under zero, array will move to left
/// @param array source array
/// @param size size of array
/// @param value amount of shifts
void shift(float array[], int size, int value) {
    if (value > 0) {
        for (int i = 0; i < value; i++) {
            float tmp = array[size - 1];
            for (int j = size - 1; j >= 0; j--) {
                array[j + 1] = array[j];
            }
            array[0] = tmp;
        }
    }
    else if (value < 0) {
        for (int i = 0; i < value * -1; i++) {
            float tmp = array[0];
            for (int j = 0; j < size; j++) {
                array[j] = array[j + 1];
            }
            array[size - 1] = tmp;
        }
    }
}

/// @brief function of cyclic shift
/// @details if value over zero, array will move to right; if value under zero, array will move to left
/// @param array source array
/// @param size size of array
/// @param value amount of shifts
void shift(double array[], int size, int value) {
    if (value > 0) {
        for (int i = 0; i < value; i++) {
            double tmp = array[size - 1];
            for (int j = size - 1; j >= 0; j--) {
                array[j + 1] = array[j];
            }
            array[0] = tmp;
        }
    }
    else if (value < 0) {
        for (int i = 0; i < value * -1; i++) {
            double tmp = array[0];
            for (int j = 0; j < size; j++) {
                array[j] = array[j + 1];
            }
            array[size - 1] = tmp;
        }
    }
}

/// @brief function of cyclic shift
/// @details if value over zero, array will move to right; if value under zero, array will move to left
/// @param array source array
/// @param size size of array
/// @param value amount of shifts
void shift(int array[], long long size, int value) {
    if (value > 0) {
        for (int i = 0; i < value; i++) {
            int tmp = array[size - 1];
            for (int j = size - 1; j >= 0; j--) {
                array[j + 1] = array[j];
            }
            array[0] = tmp;
        }
    }
    else if (value < 0) {
        for (int i = 0; i < value * -1; i++) {
            int tmp = array[0];
            for (int j = 0; j < size; j++) {
                array[j] = array[j + 1];
            }
            array[size - 1] = tmp;
        }
    }
}

/// @brief function of cyclic shift
/// @details if value over zero, array will move to right; if value under zero, array will move to left
/// @param array source array
/// @param size size of array
/// @param value amount of shifts
void shift(long long array[], long long size, int value) {
    if (value > 0) {
        for (int i = 0; i < value; i++) {
            long long tmp = array[size - 1];
            for (int j = size - 1; j >= 0; j--) {
                array[j + 1] = array[j];
            }
            array[0] = tmp;
        }
    }
    else if (value < 0) {
        for (int i = 0; i < value * -1; i++) {
            long long tmp = array[0];
            for (int j = 0; j < size; j++) {
                array[j] = array[j + 1];
            }
            array[size - 1] = tmp;
        }
    }
}

/// @brief function of cyclic shift
/// @details if value over zero, array will move to right; if value under zero, array will move to left
/// @param array source array
/// @param size size of array
/// @param value amount of shifts
void shift(float array[], long long size, int value) {
    if (value > 0) {
        for (int i = 0; i < value; i++) {
            float tmp = array[size - 1];
            for (int j = size - 1; j >= 0; j--) {
                array[j + 1] = array[j];
            }
            array[0] = tmp;
        }
    }
    else if (value < 0) {
        for (int i = 0; i < value * -1; i++) {
            float tmp = array[0];
            for (int j = 0; j < size; j++) {
                array[j] = array[j + 1];
            }
            array[size - 1] = tmp;
        }
    }
}

/// @brief function of cyclic shift
/// @details if value over zero, array will move to right; if value under zero, array will move to left
/// @param array source array
/// @param size size of array
/// @param value amount of shifts
void shift(double array[], long long size, int value) {
    if (value > 0) {
        for (int i = 0; i < value; i++) {
            double tmp = array[size - 1];
            for (int j = size - 1; j >= 0; j--) {
                array[j + 1] = array[j];
            }
            array[0] = tmp;
        }
    }
    else if (value < 0) {
        for (int i = 0; i < value * -1; i++) {
            double tmp = array[0];
            for (int j = 0; j < size; j++) {
                array[j] = array[j + 1];
            }
            array[size - 1] = tmp;
        }
    }
}