1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
/*
Copyright (C) 2022 Sutou Kouhei <kou@clear-code.com>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "grn_progress.h"
grn_progress_type
grn_progress_get_type(grn_ctx *ctx, grn_progress *progress)
{
return progress->type;
}
grn_progress_index_phase
grn_progress_index_get_phase(grn_ctx *ctx, grn_progress *progress)
{
if (progress->type != GRN_PROGRESS_INDEX) {
return 0;
}
return progress->value.index.phase;
}
uint32_t
grn_progress_index_get_n_target_records(grn_ctx *ctx, grn_progress *progress)
{
if (progress->type != GRN_PROGRESS_INDEX) {
return 0;
}
return progress->value.index.n_target_records;
}
uint32_t
grn_progress_index_get_n_processed_records(grn_ctx *ctx, grn_progress *progress)
{
if (progress->type != GRN_PROGRESS_INDEX) {
return 0;
}
return progress->value.index.n_processed_records;
}
uint32_t
grn_progress_index_get_n_target_terms(grn_ctx *ctx, grn_progress *progress)
{
if (progress->type != GRN_PROGRESS_INDEX) {
return 0;
}
return progress->value.index.n_target_terms;
}
uint32_t
grn_progress_index_get_n_processed_terms(grn_ctx *ctx, grn_progress *progress)
{
if (progress->type != GRN_PROGRESS_INDEX) {
return 0;
}
return progress->value.index.n_processed_terms;
}
uint32_t
grn_progress_language_model_inferencer_get_n_processed_records(grn_ctx *ctx, grn_progress *progress)
{
if (progress->type != GRN_PROGRESS_LANGUAGE_MODEL_INFERENCER) {
return 0;
}
return progress->value.language_model_inferencer.n_processed_records;
}
|
