Bitmap principle code record

#include <iostream>
#include <string>
#include <cstdint>
#include <algorithm>
#include <vector>

// The conventional bit Bit setting 
#define set_bit(x,y) y|=(1<<(x))
#define check_bit(x,y) (1<<(x)&(y))?1:0

int main(void){
    
    std::vector<int32_t> sort  = {
    1,3,5,7,8,2,4,6};
    int32_t bitmask=0;
    //little 
    set_bit(8,bitmask); // The brand needs to be sorted for the first time 
    
    for(int32_t i = 0 ; i < 8 ; i++){
    
        set_bit(sort[i],bitmask);
    }

    for(int32_t i = 0 ; i < 9 ; i++){
    
        if(check_bit(i,bitmask)){
    
            std::cout << i << " ";
        }
    }
    std::cout << std::endl;
}

bitmap It can be used to remove weight and , Non duplicate allocation index

• linux pid The way of distribution