remove: legacy code

all_cases/CMakeLists.txt

@@ -1,4 +1,4 @@
 cmake_minimum_required(VERSION 3.0)
 set(CMAKE_CXX_STANDARD 14)
 
-add_executable(klotski all_cases.cc short_code.cc)
+add_executable(klotski short_code.cc)

all_cases/all_cases.h

@@ -1,21 +0,0 @@
-#pragma once
-
-#include <iostream>
-#include <vector>
-
-//class AllCases {
-//public:
-//    AllCases() {
-//        load_basic_ranges();
-//    }
-//    void find_all_cases();
-//    std::vector<uint32_t> all_cases[16];
-//    std::vector<uint32_t> basic_ranges;
-//
-//    static uint32_t binary_reverse(uint32_t bin);
-//    static bool check_case(uint32_t head, uint32_t range);
-//
-//private:
-//    void load_basic_ranges();
-//    void generate_ranges(int n1, int n2, int n3, int n4);
-//};

all_cases/short_code.cc

@@ -1,9 +1,6 @@
 #include <iostream>
 #include <algorithm>
-#include <unordered_map>
-#include "all_cases.h"
 #include "short_code.h"
-//#include "short_code_mark.h"
 
 // TODO: try to remove: `0` `O` `I` `l`
 
@@ -49,121 +46,8 @@ uint32_t code_from_string(const std::string &short_code) {
     return result;
 }
 
-//uint64_t unzip_short_code(uint32_t short_code) {
-//
-//    auto a = AllCases(); // load basic ranges
-//
-//    std::cout << "short code: " << short_code << std::endl;
-//
-//    uint32_t head = 0;
-//    for (; head < 16; ++head) {
-//        if (short_code < ALL_CASES_INDEX[head]) {
-//            break;
-//        }
-//        short_code -= ALL_CASES_INDEX[head];
-//    }
-//
-//    std::cout << "head: " << head << std::endl;
-//    std::cout << "short code: " << short_code << std::endl;
-//
-//    uint32_t prefix = 0;
-//    for (; prefix < 256; ++prefix) {
-//        if (short_code < RANGE_PREFIX_INDEX[head][prefix]) {
-//            break;
-//        }
-//        short_code -= RANGE_PREFIX_INDEX[head][prefix];
-//    }
-//
-//    std::cout << "prefix: " << prefix << std::endl;
-//    std::cout << "short code: " << short_code << std::endl;
-//
-//    uint32_t range;
-//    for (int i = 0; i < BASIC_RANGES_INDEX[prefix]; ++i) {
-//        range = a.basic_ranges[i + BASIC_RANGES_OFFSET[prefix]];
-//        if (AllCases::check_case(head, range)) {
-//            if (short_code == 0) {
-//                break;
-//            }
-//            --short_code;
-//        }
-//    }
-//    return (uint64_t)head << 32 | AllCases::binary_reverse(range);
-//}
-
-//uint32_t zip_short_code(uint64_t code) {
-//    auto a = AllCases(); // load basic ranges
-//
-//    uint32_t head = code >> 32;
-//    uint32_t head_offset = ALL_CASES_OFFSET[head];
-//
-//    std::cout << "head: " << head << std::endl;
-//    std::cout << "head offset: " << head_offset << std::endl;
-//
-//    uint32_t prefix = (code >> 24) & 0xFF;
-//    uint32_t prefix_offset = RANGE_PREFIX_OFFSET[head][prefix];
-//
-//    std::cout << "prefix: " << prefix << std::endl;
-//    std::cout << "prefix offset: " << prefix_offset << std::endl;
-//
-//    uint32_t basic_index = BASIC_RANGES_INDEX[prefix];
-//    uint32_t basic_offset = BASIC_RANGES_OFFSET[prefix];
-//
-//    std::cout << "basic index: " << basic_index << std::endl;
-//    std::cout << "basic offset: " << basic_offset << std::endl;
-//
-//    auto target_range = AllCases::binary_reverse((uint32_t)code);
-//    printf("target range -> %08X\n", target_range);
-//
-//    uint32_t sub_offset = 0;
-//    for (int i = 0; i < basic_index; ++i) {
-//        uint32_t range = a.basic_ranges[i + basic_offset];
-//        if (range == target_range) {
-//            break;
-//        }
-//        if (AllCases::check_case(head, range)) {
-//            ++sub_offset;
-//        }
-//    }
-//    std::cout << "sub offset: " << sub_offset << std::endl;
-//
-//    return head_offset + prefix_offset + sub_offset;
-//}
-
 int main() {
 
-    auto ret_code = unzip_short_code(14323231);
-    printf("result -> %08lX\n", ret_code);
-
-    auto ret_short_code = zip_short_code(0x6EC0F8800);
-    printf("result -> %d\n", ret_short_code);
-
-    return 0;
-
-//    auto a = AllCases();
-//    a.find_all_cases();
-
-//    std::vector<uint64_t> all_cases;
-//    for (int n = 0; n < 16; ++n) {
-//        uint64_t prefix = (uint64_t)n << 32;
-//        for (auto &code : a.all_cases[n]) {
-//            all_cases.emplace_back(prefix | code);
-//        }
-//    }
-//
-//    std::unordered_map<uint64_t, uint32_t> all_cases_dict;
-//    for (int i = 0; i < all_cases.size(); ++i) {
-//        all_cases_dict[all_cases[i]] = i;
-//    }
-
-//    uint32_t short_code = 14323231;
-//    printf("%09lX\n", all_cases[0]);
-//    printf("%09lX\n", all_cases[short_code]);
-//    printf("%09lX\n", all_cases[ALL_CASES_NUMBER - 1]);
-
-//    std::cout << code_to_string(all_cases_dict[0x6EC0F8800]) << std::endl;
-//    std::cout << code_to_string(all_cases_dict[0x1A9BF0C00]) << std::endl;
-//    std::cout << code_to_string(all_cases_dict[0x4FEA13400]) << std::endl;
-
 //    std::cout << code_to_string(14323231) << std::endl;
 //    std::cout << code_from_string("8IzVj") << std::endl;