<commit_before>/*****************************************************************************************
 *                                                                                       *
 * OpenSpace                                                                             *
 *                                                                                       *
 * Copyright (c) 2014-2016                                                               *
 *                                                                                       *
 * Permission is hereby granted, free of charge, to any person obtaining a copy of this  *
 * software and associated documentation files (the "Software"), to deal in the Software *
 * without restriction, including without limitation the rights to use, copy, modify,    *
 * merge, publish, distribute, sublicense, and/or sell copies of the Software, and to    *
 * permit persons to whom the Software is furnished to do so, subject to the following   *
 * conditions:                                                                           *
 *                                                                                       *
 * The above copyright notice and this permission notice shall be included in all copies *
 * or substantial portions of the Software.                                              *
 *                                                                                       *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,   *
 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A         *
 * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT    *
 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF  *
 * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE  *
 * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                                         *
 ****************************************************************************************/

#include <modules/globebrowsing/tile/tileindex.h>
#include <modules/globebrowsing/geometry/geodetic2.h>

#include <sstream>

namespace {
    const std::string _loggerCat = "TileIndex";
}

namespace openspace {

    /**
    Creates the geodetic tile index for the Geodetic patch that covers the
    point p at the specified level
    */
    TileIndex::TileIndex(const Geodetic2& point, int level)
    : level(level) {
        int numIndicesAtLevel = 1 << level;
        double u = 0.5 + point.lon / (2 * M_PI);
        double v = 0.25 - point.lat / (2 * M_PI);
        double xIndexSpace = u * numIndicesAtLevel;
        double yIndexSpace = v * numIndicesAtLevel;

        x = floor(xIndexSpace);
        y = floor(yIndexSpace);
    }

    TileIndex TileIndex::child(Quad q) const {
        return TileIndex(2 * x + q % 2, 2 * y + q / 2, level + 1);
    }

    TileIndex TileIndex::parent() const {
        //ghoul_assert(level > 0, "tile at level 0 has no parent!");
        return TileIndex(x / 2, y / 2, level - 1);
    }

    TileIndex& TileIndex::operator--() {
        x /= 2;
        y /= 2;
        level--;
        return *this;
    }

    TileIndex TileIndex::operator--(int) {
        TileIndex tmp(*this);
        --(*this);
        return tmp;
    }

    TileIndex& TileIndex::operator-=(unsigned int levels) {
        x <<= levels;
        y <<= levels;
        level -= levels;
        return *this;
    }


    /**
    Gets the tile at a specified offset from this tile.
    Accepts delta indices ranging from [-2^level, Infinity[
    */
    TileIndex TileIndex::getRelatedTile(int deltaX, int deltaY) const {
        int indicesAtThisLevel = 1 << level;
        int newX = (indicesAtThisLevel + x + deltaX) % indicesAtThisLevel;
        int newY = (indicesAtThisLevel + y + deltaY) % indicesAtThisLevel;
        return TileIndex(newX, newY, level);
    }

    int TileIndex::manhattan(const TileIndex& other) const {
        ghoul_assert(level == other.level, "makes no sense if not on same level");
        return std::abs(x - other.x) + std::abs(y - other.y);
    }


    /**
    Creates a hash which can be used as key in hash maps
        BITS | USAGE
         0-6 | level
        6-26 | x
       26-46 | y
       46-64 | reserved for future use, e.g. time key
    */
    TileHashKey TileIndex::hashKey() const {
        TileHashKey key = 0LL;
        key |= level;
        key |= x << 6;
        key |= ((TileHashKey)y) << 26;
        return key;
    }


    std::string TileIndex::toString() const {
        std::stringstream ss;
        for (int i = level; i > 0; i--){
            char digit = '0';<commit_msg>Optimally utilize tile hash key bits<commit_after>/*****************************************************************************************
 *                                                                                       *
 * OpenSpace                                                                             *
 *                                                                                       *
 * Copyright (c) 2014-2016                                                               *
 *                                                                                       *
 * Permission is hereby granted, free of charge, to any person obtaining a copy of this  *
 * software and associated documentation files (the "Software"), to deal in the Software *
 * without restriction, including without limitation the rights to use, copy, modify,    *
 * merge, publish, distribute, sublicense, and/or sell copies of the Software, and to    *
 * permit persons to whom the Software is furnished to do so, subject to the following   *
 * conditions:                                                                           *
 *                                                                                       *
 * The above copyright notice and this permission notice shall be included in all copies *
 * or substantial portions of the Software.                                              *
 *                                                                                       *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,   *
 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A         *
 * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT    *
 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF  *
 * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE  *
 * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.                                         *
 ****************************************************************************************/

#include <modules/globebrowsing/tile/tileindex.h>
#include <modules/globebrowsing/geometry/geodetic2.h>

#include <sstream>

namespace {
    const std::string _loggerCat = "TileIndex";
}

namespace openspace {

    /**
    Creates the geodetic tile index for the Geodetic patch that covers the
    point p at the specified level
    */
    TileIndex::TileIndex(const Geodetic2& point, int level)
    : level(level) {
        int numIndicesAtLevel = 1 << level;
        double u = 0.5 + point.lon / (2 * M_PI);
        double v = 0.25 - point.lat / (2 * M_PI);
        double xIndexSpace = u * numIndicesAtLevel;
        double yIndexSpace = v * numIndicesAtLevel;

        x = floor(xIndexSpace);
        y = floor(yIndexSpace);
    }

    TileIndex TileIndex::child(Quad q) const {
        return TileIndex(2 * x + q % 2, 2 * y + q / 2, level + 1);
    }

    TileIndex TileIndex::parent() const {
        //ghoul_assert(level > 0, "tile at level 0 has no parent!");
        return TileIndex(x / 2, y / 2, level - 1);
    }

    TileIndex& TileIndex::operator--() {
        x /= 2;
        y /= 2;
        level--;
        return *this;
    }

    TileIndex TileIndex::operator--(int) {
        TileIndex tmp(*this);
        --(*this);
        return tmp;
    }

    TileIndex& TileIndex::operator-=(unsigned int levels) {
        x <<= levels;
        y <<= levels;
        level -= levels;
        return *this;
    }


    /**
    Gets the tile at a specified offset from this tile.
    Accepts delta indices ranging from [-2^level, Infinity[
    */
    TileIndex TileIndex::getRelatedTile(int deltaX, int deltaY) const {
        int indicesAtThisLevel = 1 << level;
        int newX = (indicesAtThisLevel + x + deltaX) % indicesAtThisLevel;
        int newY = (indicesAtThisLevel + y + deltaY) % indicesAtThisLevel;
        return TileIndex(newX, newY, level);
    }

    int TileIndex::manhattan(const TileIndex& other) const {
        ghoul_assert(level == other.level, "makes no sense if not on same level");
        return std::abs(x - other.x) + std::abs(y - other.y);
    }


    /**
    Creates a hash which can be used as key in hash maps.
    
    +-------+------------+-------+------------+
    | USAGE | BIT RANGE  | #BITS | MAX VALUE  |
    +-------+------------+-------+------------+
    | level |   0 -  5   |   5   |         31 |
    |     x |   6 - 34   |  30   | 1073741824 |
    |     y |  35 - 63   |  29   |  536870912 |
    +-------+------------+-------+------------+
     
    */
    TileHashKey TileIndex::hashKey() const {
        TileHashKey key = 0LL;
        key |= level;
        key |= x << 5;
        key |= ((TileHashKey)y) << 35;
        return key;
    }


    std::string TileIndex::toString() const {
        std::stringstream ss;
        for (int i = level; i > 0; i--){
            char digit = '0';
{'fraction_non_alphanumeric': 0.13341556172268476, 'fraction_numerical': 0.012745400349470654, 'mean_word_length': 1.503215847697453, 'pattern_counts': {'":': 0, '<': 33, '<?xml version=': 0, '>': 13, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 62, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6600390', 'n_tokens_mistral': 2516, 'n_tokens_neox': 2342, 'n_words': 841}