Mercurial > hg > Game > Cerium
view example/regex_mas/WordCount.h @ 1621:f907bbac14f2 draft
Implement Boyer-Moore String Search Algorithm.(But incomplete divided file point)
author | Masa <e085726@ie.u-ryukyu.ac.jp> |
---|---|
date | Tue, 21 May 2013 17:03:53 +0900 |
parents | 0f94d9d580f9 |
children | 5a294d8e5643 |
line wrap: on
line source
typedef struct wordCount { struct wordCount *self; int size; // remaining file size int division_size; // for each word count task int division_out_size; int out_size; int task_num; // remaining task count int task_blocks; // spawn task one at a time int status_num; int task_spwaned; unsigned long long *o_data; unsigned long long *head_tail_flag; int out_task_num; int pad; char * file_mmap; int file_size; HTaskPtr t_print; } WordCount;