整数和位数组之间的按位运算
[英]Bitwise operations between an integer and an array of bits
问题描述
Suppose I have a c++ array of bits, ones and zeros, and I want to have it bitwise XORed with an integer number, and get the result as an integer. 
假设我有一个c ++的位，一个和零数组，我想将它与一个整数按位进行XOR运算，并以整数形式获得结果。 What is the fastest way to do so? 最快的方法是什么？
1 个解决方案
解决方案1
4 已采纳 2011-10-28 13:55:16
假设您的意思是std::bitset 并假设它适合无unsigned long result = your_bits.to_ulong() ^ your_int ；
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.
相关问题
按位运算期间整数提升的行为 - Behavior of integer promotion during bitwise operations
仅按位操作即可反转（翻转）数字的最后n位 - Invert (flip) last n bits of a number with only bitwise operations
用于计算位或找到最右边|最左边的位的高效按位运算 - Efficient bitwise operations for counting bits or find the right|left most ones
对字符数组中的元素进行按位运算 - Bitwise operations on elements from array of chars
按位运算 - Bitwise operations
对整数的按位运算在DEBUG和RELEASE版本的项目中表现不同 - Bitwise operations on integer act differently in DEBUG and RELEASE versions of project
有没有办法在AVX上模拟_m256类型的整数按位运算？ - Is there a way to simulate integer bitwise operations for _m256 types on AVX?
C ++中8位整数和32位整数之间的按位AND - Bitwise AND between an 8-bit integer and 32 bit integer in C++
最快的函数，用于在无符号整数中将位设置为1 - Fastest function to set bits to one between two bits in an unsigned integer
精确的X位大小的变量支持按位运算（C ++） - Exact X-bits sized variables that support bitwise operations(c++)
相关标签