C++ (Cpp) add_to_resultの例

コード例 #1

ファイル: acseg_tree.c プロジェクト: Angos/acfilter

acseg_result_t *
acseg_full_seg(acseg_index_t *acseg_index, acseg_str_t *text,int max_seek)
{
	int j,current_pos,tmp_j;
	acseg_str_t atom,atom2,tmp_atom;
	acseg_result_t *seg_result;
	acseg_index_item_t *index_item, *s_index_item,* tmp_s_index_item;
	seg_result = acseg_result_init();
//    int max_seek=5;
    int seeks=0;
	if (acseg_index->state != AC_INDEX_FIXED) {
		return seg_result;
	}
	current_pos=j = 0;
	index_item = acseg_index->root;
	while (j < text->len) {
        seeks=0;
		atom.data = &(text->data[j]);
		atom.len = get_mblen( ((u_char) atom.data[0]) );
		tmp_atom = atom;	
		tmp_s_index_item = s_index_item = find_child_index_item(index_item, &atom);
        while(
                tmp_s_index_item ==NULL &&
                seeks<max_seek && current_pos <(text->len)){
            atom2.data = &(text->data[current_pos+tmp_atom.len]);
            atom2.len = get_mblen( ((u_char) atom2.data[0]) );
            print_atom(&atom2);
		    tmp_s_index_item = find_child_index_item(index_item, &atom2);
            seeks++;
            if(tmp_s_index_item!=NULL){
                current_pos = j = current_pos +tmp_atom.len; 
                atom = atom2;
                s_index_item = tmp_s_index_item;
                break;
            }
            else{
                current_pos =  current_pos +tmp_atom.len; 
                tmp_atom = atom2;
            }
        }
		while(s_index_item == NULL) {
			if (index_item == acseg_index->root) {
				s_index_item = index_item;
				break;
			}
			index_item = index_item->failure;
			s_index_item = find_child_index_item(index_item, &atom);
		}

		index_item = s_index_item;

		add_to_result(seg_result, index_item->output);

		add_to_result(seg_result, index_item->extra_outputs);

		current_pos = tmp_j =  j = j + atom.len;
	}

	return seg_result;
}

コード例 #2

ファイル: acseg_tree.c プロジェクト: xurenlu/py_acseg_ext

acseg_result_t *
acseg_full_seg3(acseg_index_t *acseg_index, acseg_str_t *text)
{
    int j;

    acseg_str_t atom;

    acseg_result_t *seg_result;

    acseg_index_item_t *index_item, *s_index_item;

    seg_result = acseg_result_init();


    if (acseg_index->state != AC_INDEX_FIXED) {
        return seg_result;
    }


    j = 0;
    index_item = acseg_index->root;
    while (j < text->len) {
        atom.data = &(text->data[j]);
        atom.len = get_mblen( ((u_char) atom.data[0]) );

        s_index_item = find_child_index_item(index_item, &atom);

        while(s_index_item == NULL) {
            if (index_item == acseg_index->root) {
                s_index_item = index_item;
                break;
            }
            index_item = index_item->failure;
            s_index_item = find_child_index_item(index_item, &atom);
        }

        index_item = s_index_item;

        add_to_result(seg_result, index_item->output);

        add_to_result(seg_result, index_item->extra_outputs);

        j = j + atom.len;
    }

    return seg_result;
}

コード例 #3

ファイル: searchd.c プロジェクト: wizardcypress/simple-ftp-search-engine

void search_site(char *query,int start,int end,int cursite)
{
  int i,val;
  for(i=start;i<end;i++)
  {
  val=match(query,list[i].name);  /* return match degree */
  if(val>100)   add_to_result(val,start,&list[i],site[cursite]);
  }
}