TKey* FindMethod( TString name, TDirectory *dir=0 )
{
// find the key for a method
if (dir==0) dir = gDirectory;
TIter mnext(dir->GetListOfKeys());
TKey *mkey;
TKey *retkey=0;
Bool_t loop=kTRUE;
while (loop) {
mkey = (TKey*)mnext();
if (mkey==0) {
loop = kFALSE;
}
else {
TString clname = mkey->GetClassName();
TClass *cl = gROOT->GetClass(clname);
if (cl->InheritsFrom("TDirectory")) {
TString mname = mkey->GetName(); // method name
TString tname = "Method_"+name; // target name
if (mname==tname) { // target found!
loop = kFALSE;
retkey = mkey;
}
}
}
}
return retkey;
}
UInt_t GetListOfKeys( TList& keys, TString inherits, TDirectory *dir=0 )
{
// get a list of keys with a given inheritance
// the list contains TKey objects
if (dir==0) dir = gDirectory;
TIter mnext(dir->GetListOfKeys());
TKey *mkey;
keys.Clear();
keys.SetOwner(kFALSE);
UInt_t ni=0;
while ((mkey = (TKey*)mnext())) {
// make sure, that we only look at TDirectory with name Method_<xxx>
TClass *cl = gROOT->GetClass(mkey->GetClassName());
if (cl->InheritsFrom(inherits)) {
keys.Add(mkey);
ni++;
}
}
return ni;
}
Bool_t ExistMethodName( TString name, TDirectory *dir=0 )
{
// find the key for a method
if (dir==0) dir = gDirectory;
TIter mnext(dir->GetListOfKeys());
TKey *mkey;
Bool_t loop=kTRUE;
while (loop) {
mkey = (TKey*)mnext();
if (mkey==0) {
loop = kFALSE;
}
else {
TString clname = mkey->GetClassName();
TString keyname = mkey->GetName();
TClass *cl = gROOT->GetClass(clname);
if (keyname.Contains("Method") && cl->InheritsFrom("TDirectory")) {
TDirectory* d_ = (TDirectory*)dir->Get( keyname );
if (!d_) {
cout << "HUUUGE TROUBLES IN TMVAGlob::ExistMethodName() --> contact authors" << endl;
return kFALSE;
}
TIter mnext_(d_->GetListOfKeys());
TKey *mkey_;
while ((mkey_ = (TKey*)mnext_())) {
TString clname_ = mkey_->GetClassName();
TClass *cl_ = gROOT->GetClass(clname_);
if (cl_->InheritsFrom("TDirectory")) {
TString mname = mkey_->GetName(); // method name
if (mname==name) { // target found!
return kTRUE;
}
}
}
}
}
}
return kFALSE;
}
UInt_t GetListOfMethods( TList & methods, TDirectory *dir=0 )
{
// get a list of methods
// the list contains TKey objects
if (dir==0) dir = gDirectory;
TIter mnext(dir->GetListOfKeys());
TKey *mkey;
methods.Clear();
methods.SetOwner(kFALSE);
UInt_t ni=0;
while ((mkey = (TKey*)mnext())) {
// make sure, that we only look at TDirectory with name Method_<xxx>
TString name = mkey->GetClassName();
TClass *cl = gROOT->GetClass(name);
if (cl->InheritsFrom("TDirectory")) {
if (TString(mkey->GetName()).BeginsWith("Method_")) {
methods.Add(mkey);
ni++;
}
}
}
cout << "--- Found " << ni << " classifier types" << endl;
return ni;
}
int main()
{
int8_t m1, m2, m3, m4, m5, m6, m7, m8, m9, m10, m11, m12, m13, m14, m15, m16, m17, m18, m19, m20, m21, m22, m23, m24, m25;
uint32_t used=(uint32_t)0;
uint32_t used1, used2, used3, used5, used6, used7, used8, used9, used11, used13, used17, used19, used22, used23;
long long int count=0;
printf("line sum: %d\n", ls);
#define mfor(en) \
used##en=used; \
for(m##en=1; m##en<=25; m##en++){
#define mnext(en) \
used=used##en; \
}
#define douse(en) \
if(used&((uint32_t)1<<m##en)){ \
continue; \
}else{ \
used|=(uint32_t)1<<m##en; \
}
#define unuse(m) used&=~((uint32_t)1<<m)
#define tcont(c) \
if(c){ \
continue; \
}
/* left-top to right-below */
mfor(1)
douse(1);
mfor(7)
douse(7);
mfor(13)
douse(13);
tcont(m1+m7+m13<ls-25-24);
mfor(19)
douse(19);
tcont(m1+m7+m13+m19<ls-25);
m25=ls-(m19+m13+m7+m1);
tcont(m25<=0);
tcont(!(m1<m25));
douse(25);
/* Now the square is like:
o
o
o
o
-
*/
/* right-top to left-below */
mfor(5)
tcont(!(m1<m5));
douse(5);
mfor(9)
douse(9);
tcont(m5+m9+m13<ls-25-24);
mfor(17)
douse(17);
tcont(m5+m9+m13+m17<ls-25);
m21=ls-(m5+m9+m13+m17);
tcont(m21<=0);
tcont(!(m5<m21));
douse(21);
/* Now the square is like:
o o
o o
o
o o
- -
*/
/* the first horizontal line from the top */
mfor(2)
douse(2);
tcont(m1+m2+m5<ls-25-24);
tcont(m2+m7+m17<ls-25-24);
mfor(3)
douse(3);
tcont(m1+m2+m5+m3<ls-25);
m4=ls-(m1+m2+m5+m3);
tcont(m4<=0);
douse(4);
tcont(m4+m9+m19<ls-25-24);
/* Now the square is like:
ooo-o
o o
o
o o
- -
*/
/* the second horizontal line from the top */
mfor(6)
douse(6);
tcont(m6+m7+m9<ls-25-24);
tcont(m1+m6+m21<ls-25-24);
mfor(8)
douse(8);
tcont(m6+m7+m9+m8<ls-25);
tcont(m3+m8+m13<ls-25-24);
m10=ls-(m6+m7+m9+m8);
tcont(m10<=0);
douse(10);
tcont(m5+m10+m25<ls-25-24);
/* Now the square is like:
ooo-o
oooo-
o
o o
- -
*/
/* the fifth horizontal line from the top */
mfor(22)
douse(22);
tcont(m21+m22+m25<ls-25-24);
m12=ls-(m2+m7+m17+m22);
tcont(m12<=0);
douse(12);
mfor(23)
douse(23);
tcont(m3+m8+m13+m23<ls-25);
tcont(m21+m22+m25+m23<ls-25);
m18=ls-(m3+m8+m13+m23);
tcont(m18<=0);
douse(18);
tcont(m17+m18+m19<ls-25-24);
m24=ls-(m21+m22+m25+m23);
tcont(m24<=0);
douse(24);
tcont(m4+m9+m19+m24<ls-25);
m14=ls-(m4+m9+m19+m24);
tcont(m14<=0);
douse(14);
tcont(m12+m13+m14<ls-25-24);
/* Now the square is like:
ooo-o
oooo-
-o-
o-o
-oo--
*/
/* fill m11 manually and others automatically */
mfor(11)
douse(11);
tcont(m11+m12+m13+m14<ls-25);
tcont(m1+m6+m11+m21<ls-25);
m15=ls-(m11+m12+m13+m14);
tcont(m15<=0);
douse(15);
tcont(m5+m10+m15+m25<ls-25);
m16=ls-(m1+m6+m11+m21);
tcont(m16<=0);
douse(16);
tcont(m16+m17+m18+m19<ls-25);
tcont((m5+m10+m15+m25)!=(m16+m17+m18+m19));
m20=ls-(m16+m17+m18+m19);
tcont(m20<=0);
douse(20);
count++;
#if 1
#elif 0
printf("%2d %2d %2d %2d %2d\n", m1, m2, m3, m4, m5);
printf("%2d %2d %2d %2d %2d\n", m6, m7, m8, m9, m10);
printf("%2d %2d %2d %2d %2d\n", m11, m12, m13, m14, m15);
printf("%2d %2d %2d %2d %2d\n", m16, m17, m18, m19, m20);
printf("%2d %2d %2d %2d %2d\n", m21, m22, m23, m24, m25);
puts("---------------");
#elif 0
printf("%d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d %d\n", m1, m2, m3, m4, m5, m6, m7, m8, m9, m10, m11, m12, m13, m14, m15, m16, m17, m18, m19, m20, m21, m22, m23, m24, m25);
#endif
mnext(11)
mnext(23)
mnext(22)
mnext(8)
mnext(6)
mnext(3)
mnext(2)
mnext(17)
mnext(9)
mnext(5)
mnext(19)
mnext(13)
mnext(7)
mnext(1)
printf("last count: %lld\n", count);
return 0;
}
