/*-----------------------------------------------------------------------------------------*
| <<< コマンド : Material >>>
| 入力 bUV = false : uv のチェックを行わない(法線マップを作成する際に使用)
*-----------------------------------------------------------------------------------------*/
static void ComMaterial(BOOL bUV)
{
float a;
iMetaCount += PARAM_GET(&a, &MetaText[iMetaCount]);
meta->iMatCount = (int)a; // マテリアル総数
iMetaCount += 1; // "{" 分移動
// テクスチャーデータの書き込み位置を設定
meta->pTex = &meta->atex[meta->iMatID];
//--- 各パラメータ抽出 ------------------------------------------
while(MetaText[iMetaCount] != '}')
{ // 改行を見つけたら、次へすすむ
char str[512];
if(MetaText[iMetaCount] == '\r' && MetaText[iMetaCount + 1] == '\n')
{
meta->iMatID++; // マテリアル読み込み終了なので、次へ進める
// テクスチャーデータの書き込み位置を設定
meta->pTex = &meta->atex[meta->iMatID];
iMetaCount += 2;
//--- マテリアル名を得る --------------------------------
int i = GET_STRING(str, &MetaText[iMetaCount]);
if(meta_obj_name_func != NULL) // オブジェ名を外部へ渡す
{
void(*func)(int iNum, char *str);
func = (void(*)(int iNum, char *str))meta_obj_name_func;
(*func)(meta->iMatID, str);
}
iMetaCount += i;
//-------------------------------------------------------
}
//--- コマンドチェック --------------------------------------
BOOL bRet = CommandCheck(bUV);
//--- 半角・全角チェック ------------------------------------
if(!bRet)
{
//char str[512]; // ﾀﾞﾌﾞﾙｸｫｰﾃｰｼｮﾝ中に コマンドが入っているのを防ぐため、こうする。
int i = GET_STRING(str, &MetaText[iMetaCount]);
iMetaCount += i;
if(i == 0)
{
if(ISKANJI(MetaText[iMetaCount])){ iMetaCount += 2;} // 全角
else { iMetaCount += 1;} // 半角
}
}
}
iMetaCount++;
meta->pTex = NULL; // テクスチャーデータの書き込み位置をクリアー
}
/*-----------------------------------------------------------------------------------------*
| <<< テキストメイン >>>
| 入力 bUV = false : uv のチェックを行わない(法線マップを作成する際に使用)
*-----------------------------------------------------------------------------------------*/
static void TextMain_(BOOL bUV)
{
while(MetaText[iMetaCount] != NULL) // 文字列の終端ならば処理しない
{
//--- コマンドチェック --------------------------------------
BOOL bRet = CommandCheck(bUV);
//--- 半角・全角チェック ------------------------------------
if(!bRet)
{
char str[4096]; // ﾀﾞﾌﾞﾙｸｫｰﾃｰｼｮﾝ中に コマンドが入っているのを防ぐため、こうする。
int i = GET_STRING(str, &MetaText[iMetaCount]);
iMetaCount += i;
if(i == 0)
{
if(ISKANJI(MetaText[iMetaCount])){ iMetaCount += 2;} // 全角
else { iMetaCount += 1;} // 半角
}
}
}
}
int main(int argc, char **argv)
{
// std::cerr << "Now starting...\n";
// malloc_stats();
int i=1;
char cmdLine[15];
BOOL end=FALSE;
compdists=IOread=IOwrite=objs=0;
std::cout << "** MTree: An M-Tree based on Generalized Search Trees\n";
while(strcmp(cmdLine, "quit")) {
scanf("%s", cmdLine);
if(!strcmp(cmdLine, "drop")) {
CommandDrop("graphs.M3");
if(argc<5) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] [sec_promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
MIN_UTIL=atof(argv[1]);
SPLIT_FUNCTION=(s_function)atoi(argv[2]);
PROMOTE_PART_FUNCTION=(pp_function)atoi(argv[3]);
SECONDARY_PART_FUNCTION=(pp_function)atoi(argv[4]);
if(SECONDARY_PART_FUNCTION==CONFIRMED) {
std::cout << "The secondary promotion function must be an unconfirmed one\n";
exit(-1);
}
if(PROMOTE_PART_FUNCTION==SAMPLING) {
if(argc<6) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
NUM_CANDIDATES=atoi(argv[5]);
}
if(PROMOTE_PART_FUNCTION==CONFIRMED) {
if(argc<6) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] [sec_promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
PROMOTE_VOTE_FUNCTION=(pv_function)atoi(argv[5]);
if(PROMOTE_VOTE_FUNCTION==SAMPLINGV) {
if(argc<7) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
NUM_CANDIDATES=atoi(argv[6]);
}
else if(PROMOTE_VOTE_FUNCTION==mM_RAD) {
if(argc<7) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
RADIUS_FUNCTION=(r_function)atoi(argv[6]);
}
}
switch(SPLIT_FUNCTION) {
case G_HYPERPL:
std::cout << "G_HYPL, ";
break;
case BAL_G_HYPERPL:
std::cout << "BAL_G_HYPL, ";
break;
case BALANCED:
std::cout << "BAL, ";
break;
}
switch(PROMOTE_PART_FUNCTION) {
case RANDOM:
std::cout << "RAN_2 ";
break;
case MAX_UB_DIST:
std::cout << "M_UB_d ";
break;
case SAMPLING:
std::cout << "SAMP" << NUM_CANDIDATES << "_2 ";
break;
case MIN_RAD:
std::cout << "m_R_2 ";
break;
case MIN_OVERLAPS:
std::cout << "m_O_2 ";
break;
case CONFIRMED:
switch(PROMOTE_VOTE_FUNCTION) {
case RANDOMV:
std::cout << "RAN_1 ";
break;
case SAMPLINGV:
std::cout << "SAMP" << NUM_CANDIDATES << "_1 ";
break;
case MAX_LB_DIST:
std::cout << "M_LB_d ";
break;
case mM_RAD:
std::cout << "mM_";
switch(RADIUS_FUNCTION) {
case LB:
std::cout << "m";
break;
case AVG:
std::cout << "A";
break;
case UB:
std::cout << "M";
break;
}
std::cout << "_r ";
break;
}
break;
}
switch(SECONDARY_PART_FUNCTION) {
case RANDOM:
std::cout << "(RAN_2)\n";
break;
case MAX_UB_DIST:
std::cout << "(M_UB_d)\n";
break;
case SAMPLING:
std::cout << "(SAMP" << NUM_CANDIDATES << "_2)\n";
break;
case MIN_RAD:
std::cout << "(m_R_2)\n";
break;
case MIN_OVERLAPS:
std::cout << "(m_O_2)\n";
break;
}
CommandCreate("mtree", "graphs.M3");
}
else if(!strcmp(cmdLine, "select")) {
MTobject *obj=Read();
Pred *pred=new Pred(*obj);
double r;
scanf("%s", cmdLine);
r=atof(cmdLine);
SimpleQuery query(pred, r);
delete obj;
delete pred;
if(!gist) CommandOpen("mtree", "graphs.M3");
CommandSelect(query);
CommandClose();
}
else if((!strcmp(cmdLine, "nearest"))||(!strcmp(cmdLine, "farthest"))) {
int k;
BOOL nearest=strcmp(cmdLine, "farthest");
MTpred *pred;
MTobject *obj=Read();
scanf("%s", cmdLine);
k=atoi(cmdLine);
if(nearest) pred=new Pred(*obj);
else {
MTpred *npred=new Pred(*obj);
pred=new NotPred(npred);
delete npred;
}
// eps=atof(argv[1]);
TopQuery query(pred, k);
delete pred;
if(!gist) CommandOpen("mtree", "graphs.M3");
CommandNearest(query);
CommandClose();
delete obj;
}
else if(!strcmp(cmdLine, "cursor")) {
MTobject *obj=Read();
Pred pred(*obj);
if(!gist) CommandOpen("mtree", "graphs.M3");
MTcursor cursor(*gist, pred);
scanf("%s", cmdLine);
while(strcmp(cmdLine, "close")) {
if(!strcmp(cmdLine, "next")) {
int k;
GiSTlist<MTentry *> list;
scanf("%s", cmdLine);
k=atoi(cmdLine);
// std::cout << "Fetching next " << k << " entries...\n";
for(; k>0; k--) list.Append(cursor.Next());
while(!list.IsEmpty()) {
MTentry *e=list.RemoveFront();
// std::cout << e;
delete e;
objs++;
}
}
scanf("%s", cmdLine);
}
delete obj;
CommandClose();
}
/* else if(!strcmp(cmdLine, "find")) {
int n, k, l, oldcompdists, oldIOread, oldobjs;
scanf("%s", cmdLine);
n=atoi(cmdLine);
double **x=(double **)calloc(n, sizeof(double *));
for(i=0; i<n; i++) x[i]=(double *)calloc(dimension, sizeof(double));
MTpred **p=(MTpred **)calloc(n, sizeof(MTpred *));
AndPred **ap=(AndPred **)calloc(n-1, sizeof(AndPred *));
for(i=0; i<n; i++) {
for(int j=0; j<dimension; j++) {
scanf("%s", cmdLine);
x[i][j]=atof(cmdLine);
}
if(x[i][0]>=0) {
MTobject obj(x[i]);
// std::cout << "obj=" << obj << std::endl;
p[i]=new Pred(obj);
}
else {
x[i][0]=-x[i][0];
MTobject obj(x[i]);
// std::cout << "obj=" << obj << std::endl;
Pred *pr=new Pred(obj);
p[i]=new NotPred(pr);
delete pr;
}
// std::cout << "pred=" << *p[i] << std::endl;
}
if(n==2) std::cout << "d=" << p[1]->distance(((Pred *)p[0])->obj()) << std::endl;
ap[0]=new AndPred(p[0], p[1]);
for(i=1; i<n-1; i++) ap[i]=new AndPred(ap[i-1], p[i+1]);
// std::cout << "Query: " << *ap[n-2] << std::endl;
scanf("%s", cmdLine);
k=atoi(cmdLine);
compdists=IOread=IOwrite=0;
TopQuery q(ap[n-2], k);
if(!gist) CommandOpen("mtree", "graphs.M3");
CommandNearest(q);
std::cout << "Computed dists=" << compdists << "\nIO reads=" << IOread << "\nIO writes=" << IOwrite << "\nObjs=" << objs << std::endl;
BOOL (*obs)[IndObjs]=new BOOL [n][IndObjs], pass=FALSE;
l=-90;
do {
int j;
for(j=0; j<IndObjs; j++)
for(i=0; i<n; i++) obs[i][j]=FALSE;
compdists=IOread=IOwrite=objs=0;
l+=100;
for(i=0; i<n; i++) {
TopQuery qi(p[i], l);
GiSTlist<GiSTobject *> list=gist->TopSearch(qi);
while(!list.IsEmpty()) {
MTentry *e=(MTentry *)list.RemoveFront();
obs[i][e->Ptr()]=TRUE;
delete e;
}
}
for(j=0; j<IndObjs; j++) {
BOOL check=TRUE;
for(i=0; (i<n)&✓ i++) check=obs[i][j];
if(check) objs++;
}
// std::cout << l << "=>" << objs << std::endl;
if(objs>k) {
pass=TRUE;
l-=110;
oldcompdists=compdists;
oldIOread=IOread;
oldobjs=objs;
}
if(!pass) {
oldcompdists=compdists;
oldIOread=IOread;
oldobjs=objs;
}
// else if(objs==0) l+=90; // dangerous: could lead to infinite loops...
} while(((objs<k)&&!pass)||((objs>k)&&pass));
std::cout << l << "=>" << objs << std::endl;
if(objs<k) std::cout << "Computed dists=" << oldcompdists << "\nIO reads=" << oldIOread << "\nObjs=" << oldobjs << std::endl;
else std::cout << "Computed dists=" << compdists << "\nIO reads=" << IOread << "\nObjs=" << objs << std::endl;
delete []obs;
for(i=0; i<n; i++) delete x[i];
free(x);
for(i=0; i<n; i++) delete p[i];
free(p);
for(i=0; i<n-1; i++) delete ap[i];
free(ap);
compdists=IOread=IOwrite=objs=0;
CommandClose();
}
*/ else if(!strcmp(cmdLine, "check")) {
if(!gist) CommandOpen("mtree", "graphs.M3");
CommandCheck();
CommandClose();
}
else if(!strcmp(cmdLine, "dump")) {
if(!gist) CommandOpen("mtree", "graphs.M3");
CommandDump();
CommandClose();
}
else if(!strcmp(cmdLine, "stats")) {
if(!gist) CommandOpen("mtree", "graphs.M3");
CommandStats();
CommandClose();
}
else if(!strcmp(cmdLine, "add")) {
if(!gist) CommandOpen("mtree", "graphs.M3");
scanf("%s", cmdLine);
i=atoi(cmdLine);
if(argc<5) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] [sec_promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
MIN_UTIL=atof(argv[1]);
SPLIT_FUNCTION=(s_function)atoi(argv[2]);
PROMOTE_PART_FUNCTION=(pp_function)atoi(argv[3]);
SECONDARY_PART_FUNCTION=(pp_function)atoi(argv[4]);
if(SECONDARY_PART_FUNCTION==CONFIRMED) {
std::cout << "The secondary promotion function must be an unconfirmed one\n";
exit(-1);
}
if(PROMOTE_PART_FUNCTION==SAMPLING) {
if(argc<6) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
NUM_CANDIDATES=atoi(argv[5]);
}
if(PROMOTE_PART_FUNCTION==CONFIRMED) {
if(argc<6) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] [sec_promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
PROMOTE_VOTE_FUNCTION=(pv_function)atoi(argv[5]);
if(PROMOTE_VOTE_FUNCTION==SAMPLINGV) {
if(argc<7) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
NUM_CANDIDATES=atoi(argv[6]);
}
else if(PROMOTE_VOTE_FUNCTION==mM_RAD) {
if(argc<7) {
std::cout << "Usage is: MTree [min_util] [split_f] [promote_f] ([vote_f] ([n_cand]|[radius_f]))\n";
exit(-1);
}
RADIUS_FUNCTION=(r_function)atoi(argv[6]);
}
}
switch(SPLIT_FUNCTION) {
case G_HYPERPL:
std::cout << "G_HYPL, ";
break;
case BAL_G_HYPERPL:
std::cout << "BAL_G_HYPL, ";
break;
case BALANCED:
std::cout << "BAL, ";
break;
}
switch(PROMOTE_PART_FUNCTION) {
case RANDOM:
std::cout << "RAN_2 ";
break;
case MAX_UB_DIST:
std::cout << "M_UB_d ";
break;
case SAMPLING:
std::cout << "SAMP" << NUM_CANDIDATES << "_2 ";
break;
case MIN_RAD:
std::cout << "m_R_2 ";
break;
case MIN_OVERLAPS:
std::cout << "m_O_2 ";
break;
case CONFIRMED:
switch(PROMOTE_VOTE_FUNCTION) {
case RANDOMV:
std::cout << "RAN_1 ";
break;
case SAMPLINGV:
std::cout << "SAMP" << NUM_CANDIDATES << "_1 ";
break;
case MAX_LB_DIST:
std::cout << "M_LB_d ";
break;
case mM_RAD:
std::cout << "mM_";
switch(RADIUS_FUNCTION) {
case LB:
std::cout << "m";
break;
case AVG:
std::cout << "A";
break;
case UB:
std::cout << "M";
break;
}
std::cout << "_r ";
break;
}
break;
}
switch(SECONDARY_PART_FUNCTION) {
case RANDOM:
std::cout << "(RAN_2)\n";
break;
case MAX_UB_DIST:
std::cout << "(M_UB_d)\n";
break;
case SAMPLING:
std::cout << "(SAMP" << NUM_CANDIDATES << "_2)\n";
break;
case MIN_RAD:
std::cout << "(m_R_2)\n";
break;
case MIN_OVERLAPS:
std::cout << "(m_O_2)\n";
break;
}
}
else if(!strcmp(cmdLine, "insert")) {
MTobject *obj=Read();
if(!gist) CommandOpen("mtree", "graphs.M3");
CommandInsert(MTkey(*obj, 0, 0), i++);
delete obj;
}
else if(!strcmp(cmdLine, "load")) {
MTentry **entries;
int n;
if(argc<2) {
std::cout << "Usage is: MTree [min_util]\n";
exit(-1);
}
MIN_UTIL=atof(argv[1]);
i=0;
scanf("%s", cmdLine);
n=atoi(cmdLine);
entries=new MTentry*[n];
for(i=0; i<n; i++) {
MTobject *obj=Read();
entries[i]=new MTentry(MTkey(*obj, 0, 0), i);
delete obj;
}
CommandLoad("graphs.M3", entries, n);
for(i=0; i<n; i++) delete entries[i];
delete []entries;
}
}
std::cout << "Computed dists=" << compdists << "\nIO reads=" << IOread << "\nIO writes=" << IOwrite << "\nObjs=" << objs << std::endl;
CommandQuit();
// std::cerr << "Now exiting...\n";
// malloc_stats();
}
