Mercurial > hg > Applications > Grep

comparison c/regexParser/createBitVectorList.cc @ 99:1e5b56e8263b impl-bitvector

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
remove some variable
author Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
date Tue, 10 Nov 2015 20:57:59 +0900
parents d0d2262d4edf
children 804e51f19f17
comparison
equal deleted inserted replaced
98:d0d2262d4edf 99:1e5b56e8263b
6 extern BitVectorPtr bitSet(int); 6 extern BitVectorPtr bitSet(int);
7 extern void bitPrint(BitVectorPtr); 7 extern void bitPrint(BitVectorPtr);
8 BitVectorListPtr createBitVector(NodePtr); 8 BitVectorListPtr createBitVector(NodePtr);
9 BitVectorListPtr descendTreeNode(NodePtr,BitVectorListPtr); 9 BitVectorListPtr descendTreeNode(NodePtr,BitVectorListPtr);
10 10
11 int bvlIndex; 11 BitVectorListPtr initBvl;
12 12
13 BitVectorListPtr createBitVector(NodePtr n,BitVectorListPtr bvl) { 13 BitVectorListPtr createBitVector(NodePtr n,BitVectorListPtr bvl) {
14 BitVectorListPtr nextBvl = bvl->next[(int)n->Value.character] = (BitVectorListPtr)malloc(sizeof(BitVectorList)); 14 BitVectorListPtr nextBvl = bvl->next[(int)n->Value.character] = (BitVectorListPtr)malloc(sizeof(BitVectorList));
15 nextBvl->self = bvl->next[(int)n->Value.character];
15 nextBvl->bi = (BitVectorPtr)malloc(sizeof(BitVector)); 16 nextBvl->bi = (BitVectorPtr)malloc(sizeof(BitVector));
16 nextBvl->bi = bitSet(n->nodeNumber); 17 nextBvl->bi = bitSet(n->nodeNumber);
17 nextBvl->self = bvl->next[(int)n->Value.character]; 18 nextBvl->initBvl = initBvl;
18 19
19 puts("-----"); 20 puts("-----");
20 printf(" state : "); bitPrint(bvl->bi); 21 printf(" state : "); bitPrint(bvl->bi);
21 for (int i = 0; i < 256; i++) { 22 for (int i = 0; i < 256; i++) {
22 if (bvl->next[i] != NULL) { 23 if (bvl->next[i] != NULL) {
28 return bvl->next[(int)n->Value.character]; 29 return bvl->next[(int)n->Value.character];
29 } 30 }
30 31
31 BitVectorListPtr initBitVector() { 32 BitVectorListPtr initBitVector() {
32 BitVectorListPtr bvl = (BitVectorListPtr)malloc(sizeof(BitVectorList)); 33 BitVectorListPtr bvl = (BitVectorListPtr)malloc(sizeof(BitVectorList));
33 bvl->self = bvl; 34 bvl->initBvl = bvl->self = initBvl = bvl;
34 bvl->bi = (BitVectorPtr)malloc(sizeof(BitVector)); 35 bvl->bi = (BitVectorPtr)malloc(sizeof(BitVector));
35 bvl->bi = bitSet(0); 36 bvl->bi = bitSet(0);
36 return bvl; 37 return bvl;
37 } 38 }
38 39
52 53
53 return bvl; 54 return bvl;
54 } 55 }
55 56
56 BitVectorListPtr createBitVectorList(NodePtr n) { 57 BitVectorListPtr createBitVectorList(NodePtr n) {
57 bvlIndex = 0;
58 BitVectorListPtr bvl = initBitVector(); 58 BitVectorListPtr bvl = initBitVector();
59 descendTreeNode(n,bvl); 59 descendTreeNode(n,bvl);
60 60
61 return bvl; 61 return bvl;
62 } 62 }