CMake Error: Could not create named generator Visual Studio 17 2022 win32

环境: VS2022&cocos2d-x 4.0 & Win10 64位
在这里插入图片描述

解决方法

Cmake 不是最新版本 , 卸载安装最新版本

② 可以试试以下几条命令 肯定有一个合适:
如果你是VS2019 则把下面命令参数 的17 2022改为 16 2019

cmake  .. -G "Visual Studio 17 2022" -AWin32

cmake .. -G"Visual Studio 17 2022" -Tv142 -A win32

cmake -G"Visual Studio 17 2022 win32" ..

cmake .. -G "Visual Studio 17 2022" -A x64

完美解决!!

如果你是打算安装 COCOS -x 的 ,还没解决的话,可以参考这两个安装 看看哪一步少了
链接1
链接 2
在这里插入图片描述
在这里插入图片描述

class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>= 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
};class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>= 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
};
class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>=class Solution {

public:
    int lowbit(int n) {
        int an = 0;
        while(n) {
            if((n & 1) == 1) {
                an ++;
            }
            n >>= 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
};1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
};1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
}; 1;
        }
        return an;
    }
    vector<int> countBits(int n) {
        vector<int> ans;
        for(int i = 0; i <= n; i ++) {
            ans.push_back(lowbit(i));
        }
        return ans;
    }
};

版权声明:本文为weixin_49486457原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。