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

这篇博客主要介绍了如何解决在Visual Studio 2022环境下配置Cocos2d-x 4.0遇到的问题,提到了CMake版本更新和不同命令行选项的尝试。同时,给出了一个C++代码片段,展示了计算二进制中最低位1的个数的函数`lowbit`及其应用在`countBits`函数中生成前n位二进制表示的1数量的向量。
摘要由CSDN通过智能技术生成

环境: 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;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

CPT1024

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值