spieleprogrammierer.de - Forum und Wiki zur Spieleprogrammierung und Spieleentwicklung

C-/C++-Quelltext

#include <cstdint>
#include <cmath>
#include <algorithm>
#include <iostream>



template <int N, int M>
void print(std::ostream& file, int(&b)[N][M])
{
    for (int j = 0; j < N; ++j)
    {
        file << '[';
        for (int i = 0; i < M; ++i)
            file << static_cast<char>(b[j][i] == 0 ? ' ' : '0' + b[j][i]);
        file << "]\n";
    }
}


template <unsigned int n, unsigned int i = 0, unsigned int j = 0, bool r = true>
struct ZCurveOrder;

template <unsigned int n, unsigned int i, unsigned int j>
struct ZCurveOrder<n, i, j, false>
{
    static std::uint32_t deZ(std::uint32_t x)
    {
        return 0U;
    }
};

template <unsigned int n, unsigned int i, unsigned int j, bool r>
struct ZCurveOrder
{
    static_assert(i < n, "invalid z-curve parameters");

    static std::uint32_t deZ(std::uint32_t x)
    {
        return ZCurveOrder<n, i, j + 1, n * (j + 1) + i < 31>::deZ(x) | (((x & (1U << (n * j + i))) >> (n * j + i)) << j);
    }
};

template <unsigned int n, unsigned int i>
std::uint32_t deZ(std::uint32_t x)
{
    return ZCurveOrder<n, i, 0>::deZ(x);
}


int main()
{
    const int w = 1 << 5;

    int blub[w][w] = {};

    for (int k = static_cast<int>(std::floor(std::log2(w * w))); k >= 0; --k)
    {
        int step = 1 << (k + 1);
        int start = (1 << k) - 1;

        for (int i = start; i < w * w; i += step)
        {
            int x = deZ<2, 0>(i);
            int y = deZ<2, 1>(i);

            //int y = i / w;
            //int x = i % w;

            ++blub[y][x];
        }

        print(std::cout, blub);
        std::cout << '\n';
    }

    return 0;
}

C-/C++-Quelltext

bool arr[8] = {false};
for(int i = 3; i > 0; --i)
{
  int start = (1 << i) -1;
  int step = (1 << (i+1));
  for(int u1 = start; u1 < 8; u1 += step)
     for(int u2 = start; u2 < 8; u2 += step)
    arr[u1][u2] = true;
}