|
SoPlex Doxygen Documentation
|
Go to the documentation of this file.
33 const Name nstr (str);
54 char* tmp = &( mem[idx]);
55 memused += int(strlen(str)) + 1;
58 *( set.create(p_key)) = idx;
66 for ( int i = 0; i < p_set. num(); ++i)
76 for ( int i = 0; i < p_set. num(); ++i)
80 add(p_key[i], p_set[i]);
106 for ( int i = 0; i < n; ++i)
112 for ( int i = 0; i < n; ++i)
118 for( int i = 0; i < set.num(); i++)
151 for ( int i = num() - 1; i >= 0; --i)
165 for(i = 0; i < num(); i++)
167 const char* t = & mem[ set[i]];
168 strcpy(&newmem[newlast], t);
170 newlast += int(strlen(t)) + 1;
172 memcpy( mem, newmem, static_cast<size_t>(newlast));
179 for (i = 0; i < num(); i++)
186 unsigned int res = 0;
187 const char* sptr = str-> name;
192 res += *sptr++ - int( '0');
203 if ( max() < rhs.size())
205 if ( memMax() < rhs.memSize())
211 for ( int i = 0; i < set.num(); ++i)
213 Name iname( set[i].name);
214 DataKey ikey = DataKey( set. key(i));
225 , hashtab(org.hashtab)
227 , memFactor(org.memFactor)
230 memmax = org.memSize();
235 for ( int i = 0; i < set.num(); ++i)
237 list.append(&( set[i]));
239 DataKey k = DataKey( set.key(i));
240 hashtab.add(iname, k);
246 NameSet::NameSet( int p_max, int mmax, Real fac, Real memFac)
254 memmax = (mmax < 1) ? (8 * set. max() + 1) : mmax;
265 #ifdef ENABLE_CONSISTENCY_CHECKS
271 for(i = 0; i < num(); i++)
273 const char* t = & mem[ set[i]];
278 if (strcmp(t, operator[]( key(t))))
281 return set.isConsistent() && hashtab.isConsistent();
289 for( int i = 0; i < nset. num(); i++)
293 << nset. key(i). idx << "= "
|