Mercurial > hg > Applications > Grep
view c/regexParser/bitVector.cc @ 89:50a146c05192
add NodeNumber in Regex Parser tree
author | Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Fri, 23 Oct 2015 17:20:54 +0900 |
parents | 1d7ca366b199 |
children | 43b807f88961 |
line wrap: on
line source
#include <stdio.h> #include <stdlib.h> #include <string.h> #include "bitVector.h" int bitBlock = sizeof(unsigned long) * 8; void bitSet(BitVectorPtr bi, int bitSetPosition) { unsigned long tmp = 1; int arrayPosition = 0; arrayPosition = bitSetPosition / bitBlock; bitSetPosition = bitSetPosition % bitBlock; tmp = tmp << (bitBlock - 1 - bitSetPosition); bi->bitContainer[arrayPosition] = bi->bitContainer[arrayPosition] | tmp; } void bitPrint(BitVectorPtr bi) { for (int i = 0; i < bi->arrayNum ; i++) { for (int j = bitBlock - 1; j >= 0; j--) { printf( "%lu", ( bi->bitContainer[i] >> j ) & 1 ); } printf(" "); } puts(""); } /* int main(int argc, char **argv) { BitVectorPtr bi = (BitVectorPtr)malloc(sizeof(BitVector)); int bitSetPosition = 0; for (int i = 1; i < argc ; i++) { if (strcmp(argv[i],"-n") == 0) { bitSetPosition = atoi(argv[i+1]); } } bi->arrayNum = (bitSetPosition + 1) / bitBlock; if (((bitSetPosition + 1) % bitBlock) != 0) bi->arrayNum++; printf("Array Num : %d\n",bi->arrayNum); unsigned long bitContainer[bi->arrayNum]; for (int i = 0; i < bi->arrayNum; i++) { bitContainer[i] = 0; } bi->bitContainer = bitContainer; bitSet(bi,bitSetPosition); bitPrint(bi); return 0; } */