int
yyparse (void)
{
int yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* The stacks and their tools:
'yyss': related to states.
'yyvs': related to semantic values.
Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
YYSIZE_T yystacksize;
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken = 0;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
yyssp = yyss = yyssa;
yyvsp = yyvs = yyvsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
if (yystate == YYFINAL)
YYACCEPT;
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yypact_value_is_default (yyn))
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = yylex ();
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yytable_value_is_error (yyn))
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the lookahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token. */
yychar = YYEMPTY;
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
'$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 4:
#line 70 "hcl.y" /* yacc.c:1646 */
{ insert_code((yyvsp[0])); }
#line 1299 "hcl.tab.c" /* yacc.c:1646 */
break;
case 5:
#line 71 "hcl.y" /* yacc.c:1646 */
{ add_arg((yyvsp[-1]), (yyvsp[0]), 1); }
#line 1305 "hcl.tab.c" /* yacc.c:1646 */
break;
case 6:
#line 72 "hcl.y" /* yacc.c:1646 */
{ add_arg((yyvsp[-1]), (yyvsp[0]), 0); }
#line 1311 "hcl.tab.c" /* yacc.c:1646 */
break;
case 7:
#line 73 "hcl.y" /* yacc.c:1646 */
{ gen_funct((yyvsp[-3]), (yyvsp[-1]), 1); }
#line 1317 "hcl.tab.c" /* yacc.c:1646 */
break;
case 8:
#line 74 "hcl.y" /* yacc.c:1646 */
{ gen_funct((yyvsp[-3]), (yyvsp[-1]), 0); }
#line 1323 "hcl.tab.c" /* yacc.c:1646 */
break;
case 9:
#line 78 "hcl.y" /* yacc.c:1646 */
{ (yyval)=(yyvsp[0]); }
#line 1329 "hcl.tab.c" /* yacc.c:1646 */
break;
case 10:
#line 79 "hcl.y" /* yacc.c:1646 */
{ (yyval)=(yyvsp[0]); }
#line 1335 "hcl.tab.c" /* yacc.c:1646 */
break;
case 11:
#line 80 "hcl.y" /* yacc.c:1646 */
{ (yyval)=(yyvsp[-1]); }
#line 1341 "hcl.tab.c" /* yacc.c:1646 */
break;
case 12:
#line 81 "hcl.y" /* yacc.c:1646 */
{ (yyval)=make_not((yyvsp[0])); }
#line 1347 "hcl.tab.c" /* yacc.c:1646 */
break;
case 13:
#line 82 "hcl.y" /* yacc.c:1646 */
{ (yyval)=make_and((yyvsp[-2]), (yyvsp[0])); }
#line 1353 "hcl.tab.c" /* yacc.c:1646 */
break;
case 14:
#line 83 "hcl.y" /* yacc.c:1646 */
{ (yyval)=make_or((yyvsp[-2]), (yyvsp[0])); }
#line 1359 "hcl.tab.c" /* yacc.c:1646 */
break;
case 15:
#line 84 "hcl.y" /* yacc.c:1646 */
{ (yyval)=make_comp((yyvsp[-1]),(yyvsp[-2]),(yyvsp[0])); }
#line 1365 "hcl.tab.c" /* yacc.c:1646 */
break;
case 16:
#line 85 "hcl.y" /* yacc.c:1646 */
{ (yyval)=make_ele((yyvsp[-4]), (yyvsp[-1]));}
#line 1371 "hcl.tab.c" /* yacc.c:1646 */
break;
case 17:
#line 86 "hcl.y" /* yacc.c:1646 */
{ (yyval)=(yyvsp[-1]); }
#line 1377 "hcl.tab.c" /* yacc.c:1646 */
break;
case 18:
#line 90 "hcl.y" /* yacc.c:1646 */
{ (yyval)=(yyvsp[0]); }
#line 1383 "hcl.tab.c" /* yacc.c:1646 */
break;
case 19:
#line 91 "hcl.y" /* yacc.c:1646 */
{ (yyval)=concat((yyvsp[-2]), (yyvsp[0])); }
#line 1389 "hcl.tab.c" /* yacc.c:1646 */
break;
case 20:
#line 94 "hcl.y" /* yacc.c:1646 */
{ (yyval)=NULL; }
#line 1395 "hcl.tab.c" /* yacc.c:1646 */
break;
case 21:
#line 95 "hcl.y" /* yacc.c:1646 */
{ (yyval)=concat((yyvsp[-4]), make_case((yyvsp[-3]), (yyvsp[-1])));}
#line 1401 "hcl.tab.c" /* yacc.c:1646 */
break;
#line 1405 "hcl.tab.c" /* yacc.c:1646 */
default: break;
}
/* User semantic actions sometimes alter yychar, and that requires
that yytoken be updated with the new translation. We take the
approach of translating immediately before every use of yytoken.
One alternative is translating here after every semantic action,
but that translation would be missed if the semantic action invokes
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
incorrect destructor might then be invoked immediately. In the
case of YYERROR or YYBACKUP, subsequent parser actions might lead
to an incorrect destructor call or verbose syntax error message
before the lookahead is translated. */
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
/* Now 'shift' the result of the reduction. Determine what state
that goes to, based on the state we popped back to and the rule
number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
/*--------------------------------------.
| yyerrlab -- here on detecting error. |
`--------------------------------------*/
yyerrlab:
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
yyssp, yytoken)
{
char const *yymsgp = YY_("syntax error");
int yysyntax_error_status;
yysyntax_error_status = YYSYNTAX_ERROR;
if (yysyntax_error_status == 0)
yymsgp = yymsg;
else if (yysyntax_error_status == 1)
{
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
if (!yymsg)
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
yysyntax_error_status = 2;
}
else
{
yysyntax_error_status = YYSYNTAX_ERROR;
yymsgp = yymsg;
}
}
yyerror (yymsgp);
if (yysyntax_error_status == 2)
goto yyexhaustedlab;
}
# undef YYSYNTAX_ERROR
#endif
}
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
}
/* Else will try to reuse lookahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers like GCC when the user code never invokes
YYERROR and the label yyerrorlab therefore never appears in user
code. */
if (/*CONSTCOND*/ 0)
goto yyerrorlab;
/* Do not reclaim the symbols of the rule whose action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (!yypact_value_is_default (yyn))
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yydestruct ("Error: popping",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#if !defined yyoverflow || YYERROR_VERBOSE
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEMPTY)
{
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = YYTRANSLATE (yychar);
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
}
/* Do not reclaim the symbols of the rule whose action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
return yyresult;
}
namespace clustering {
namespace {
class make_case_type {
public:
make_case_type& operator()(const string& key, const string& value) {
cases_.insert(make_pair(key, value));
return *this;
}
map<string, string> operator()() {
map<string, string> ret;
ret.swap(cases_);
return ret;
}
private:
map<string, string> cases_;
} make_case;
} // namespace
class clustering_test
: public ::testing::TestWithParam<map<string, string> > {
};
TEST_P(clustering_test, config_validation) {
string n("name");
map<string, string> param = GetParam();
string m = param["method"];
clustering_config c;
c.compressor_method = param["compressor_method"];
if (param["result"] == "true") {
ASSERT_NO_THROW(clustering k(n, m, c));
} else {
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
return;
}
// 1 <= k
c.k = 0;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.k = 1;
ASSERT_NO_THROW(clustering k(n, m, c));
c.k = 2;
ASSERT_NO_THROW(clustering k(n, m, c));
// 2 <= bucket_size
c.compressed_bucket_size = 2;
c.bicriteria_base_size = 1;
c.bucket_size = 1;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
// this case not will be passed;
// (1 <= bicriteria_base_size < compressed_bucket_size < bucket_size)
// c.bucket_size = 2;
// ASSERT_NO_THROW(clustering k(n, m, c));
c.bucket_size = 3;
ASSERT_NO_THROW(clustering k(n, m, c));
// 2 <= bucket_length
c.bucket_length = 1;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.bucket_length = 2;
ASSERT_NO_THROW(clustering k(n, m, c));
c.bucket_length = 3;
ASSERT_NO_THROW(clustering k(n, m, c));
// 1 <= bicriteria_base_size < compressed_bucket_size
c.bucket_size = 4;
c.compressed_bucket_size = 3;
c.bicriteria_base_size = 0;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.bicriteria_base_size = 3;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.bicriteria_base_size = 4;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.bicriteria_base_size = 1;
ASSERT_NO_THROW(clustering k(n, m, c));
c.bicriteria_base_size = 2;
ASSERT_NO_THROW(clustering k(n, m, c));
// compressed_bucket_size < bucket_size
c.compressed_bucket_size = 4;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.compressed_bucket_size = 5;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.compressed_bucket_size = 3;
ASSERT_NO_THROW(clustering k(n, m, c));
// 0.0 <= forgetting_factor
c.forgetting_factor = std::numeric_limits<double>::quiet_NaN();
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.forgetting_factor = -1.0;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.forgetting_factor = 0.0;
ASSERT_NO_THROW(clustering k(n, m, c));
c.forgetting_factor = 1.0;
ASSERT_NO_THROW(clustering k(n, m, c));
// 0.0 <= forgetting_threshold <= 1.0
c.forgetting_threshold = std::numeric_limits<double>::quiet_NaN();
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.forgetting_threshold = -1.0;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
c.forgetting_threshold = 0.0;
ASSERT_NO_THROW(clustering k(n, m, c));
c.forgetting_threshold = 0.5;
ASSERT_NO_THROW(clustering k(n, m, c));
c.forgetting_threshold = 1.0;
ASSERT_NO_THROW(clustering k(n, m, c));
c.forgetting_threshold = 2.0;
ASSERT_THROW(clustering k(n, m, c), common::invalid_parameter);
}
const map<string, string> test_cases[] = {
#ifdef JUBATUS_USE_EIGEN
make_case("method", "gmm")
("compressor_method", "compressive_kmeans")
("result", "false")(),
make_case("method", "gmm")
("compressor_method", "compressive_gmm")
("result", "true")(),
make_case("method", "gmm")
("compressor_method", "simple")
("result", "true")(),
#endif
make_case("method", "kmeans")
("compressor_method", "compressive_kmeans")
("result", "true")(),
make_case("method", "kmeans")
("compressor_method", "compressive_gmm")
("result", "false")(),
make_case("method", "kmeans")
("compressor_method", "simple")
("result", "true")()
};
INSTANTIATE_TEST_CASE_P(
clustering_tests,
clustering_test,
::testing::ValuesIn(test_cases));
} // namespace clustering
namespace clustering {
common::jsonconfig::config make_simple_config() {
json js(new json_object);
js = new json_object;
js["bucket_size"] = to_json(200);
common::jsonconfig::config conf(js);
return conf;
}
common::jsonconfig::config make_compressive_config() {
json js(new json_object);
js = new json_object;
js["bucket_size"] = to_json(200);
js["bucket_length"] = to_json(2);
js["compressed_bucket_size"] = to_json(20);
js["bicriteria_base_size"] = to_json(2);
js["forgetting_factor"] = to_json(0.0);
js["forgetting_threshold"] = to_json(0.5);
js["seed"] = to_json(0);
common::jsonconfig::config conf(js);
return conf;
}
common::jsonconfig::config make_kmeans_config() {
json js(new json_object);
js["k"] = to_json(2);
js["seed"] = to_json(0);
common::jsonconfig::config conf(js);
return conf;
}
common::jsonconfig::config make_gmm_config() {
json js(new json_object);
js["k"] = to_json(2);
js["seed"] = to_json(0);
common::jsonconfig::config conf(js);
return conf;
}
common::jsonconfig::config make_dbscan_config() {
json js(new json_object);
js["eps"] = to_json(2.0);
js["min_core_point"] = to_json(1);
common::jsonconfig::config conf(js);
return conf;
}
class make_case_type {
public:
make_case_type& operator()(const string& key, const string& value) {
cases_.insert(make_pair(key, value));
return *this;
}
map<string, string> operator()() {
map<string, string> ret;
ret.swap(cases_);
return ret;
}
private:
map<string, string> cases_;
} make_case;
class clustering_test
: public ::testing::TestWithParam<map<string, string> > {
};
TEST_P(clustering_test, clustering_tests) {
string n("name");
map<string, string> param = GetParam();
string m = param["method"];
common::jsonconfig::config method_config;
common::jsonconfig::config storage_config;
if (param["method"] == "kmeans") {
method_config = make_kmeans_config();
} else if (param["method"] == "gmm") {
method_config = make_gmm_config();
} else if (param["method"] == "dbscan") {
method_config = make_dbscan_config();
} else {
throw JUBATUS_EXCEPTION(common::unsupported_method(param["method"]));
}
if (param["compressor_method"] == "simple") {
storage_config = make_simple_config();
} else if (param["compressor_method"] == "compressive") {
storage_config = make_compressive_config();
} else {
throw JUBATUS_EXCEPTION(
common::unsupported_method(param["compressor_method"]));
}
ASSERT_NO_THROW(
clustering k(
clustering_method_factory::create(
param["method"],
method_config),
storage_factory::create(
n,
param["method"],
param["compressor_method"],
storage_config)));
}
const map<string, string> test_cases[] = {
#ifdef JUBATUS_USE_EIGEN
make_case("method", "gmm")
("compressor_method", "compressive")
("result", "false")(),
make_case("method", "gmm")
("compressor_method", "compressive")
("result", "true")(),
make_case("method", "gmm")
("compressor_method", "simple")
("result", "true")(),
#endif
make_case("method", "kmeans")
("compressor_method", "compressive")
("result", "true")(),
make_case("method", "kmeans")
("compressor_method", "compressive")
("result", "false")(),
make_case("method", "kmeans")
("compressor_method", "simple")
("result", "true")(),
};
const map<string, string> test_cases_nocenter[] = {
make_case("method", "dbscan")
("compressor_method", "simple")
("result", "true")(),
make_case("method", "dbscan")
("compressor_method", "compressive")
("result", "false")()
};
INSTANTIATE_TEST_CASE_P(
clustering_tests,
clustering_test,
::testing::ValuesIn(test_cases));
} // namespace clustering