56 return s <<
"<<EST_FeatureFunctionPackage::Entry>>";
59 #if defined(INSTANTIATE_TEMPLATES) 61 #include "../base_class/EST_THash.cc" 75 : p_name(name), p_entries(n)
78 cerr <<
"initialise functionon package " << p_name <<
"\n";
83 : p_name(name), p_entries(n)
91 cerr <<
"register " << p_name <<
"::" << name <<
"\n";
93 if (p_entries.present(name))
100 p_entries.add_item(name, e);
106 return p_entries.val(name, found);
113 for(p.
begin(p_entries); p; ++p)
114 if (p->v.
func == func)
EST_Val(* EST_Item_featfunc)(class EST_Item *)
const EST_String name(void)
void register_func(const EST_String &name, const EST_Item_featfunc func)
EST_FeatureFunctionPackage(const EST_String name, int n)
#define Instantiate_TStringHash_T(VAL, TAG)
ostream & operator<<(ostream &s, EST_FeatureFunctionPackage::Entry &e)
void begin(const Container &over)
Set the iterator ready to run over this container.
An open hash table. The number of buckets should be set to allow enough space that there are relative...
const Entry & lookup(const EST_String &name, int &found) const
int operator==(const EST_FeatureFunctionPackage::Entry &e1, const EST_FeatureFunctionPackage::Entry &e2)