int main(void)
{
DOC head;
char *file_name = "news.txt";
char input[BUFFER_SIZE];
INDEX *res;
head.next = NULL;
read_file(&head, file_name);
make_indices(&head);
printf("Querry:");
fgets(input, BUFFER_SIZE, stdin);
res = search(input);
if (res == NULL)
{
printf("NOT FOUND\n");
}
else
{
print_line(res, &head);
}
return 0;
}
inline std::pair<cube_p<real>, cube_p<int>>
pooling_filter( cube_p<real>&& featuremap,
F const & f,
vec3i const & filter_size,
vec3i const & filter_stride = vec3i::one )
{
auto indices = make_indices(size(*featuremap));
inplace_pooling_filter(*featuremap, *indices, f,
filter_size, filter_stride);
// the real filter size equals to
// (SIZE-1) * STRIDE + 1
// the output is then
// FMAP_SIZE - REAL_FILTER_SIZE + 1
// = FMAP_SIZE - (SIZE-1) * STRIDE
vec3i out_size
= size(*featuremap) - (filter_size-vec3i::one) * filter_stride;
return { crop(*featuremap,out_size), crop(*indices,out_size) };
}
