45 for (i = 1; i < maxe; i++)
Table[i-1].Fnum = i;
67T *
Apply(
int (*func)(T *,
void *),
void *Arg,
int Start=0)
69 for (i = Start; i <
curnum; i++)
80 if ((temp =
Remove(Tnum)))
delete temp;
85 if ((temp =
Remove(key)))
delete temp;
93T *
Find(
const char *key,
int *Tnum=0)
95 for (i = 0; i <
curnum; i++)
97 {
if (Tnum) *Tnum = i;
return Table[i].
Item;}
106 {
if ((Tnum < 0 && ((Tnum =
Alloc()) < 0)) || Tnum >=
maxnum)
return -1;
114T *
Item(
int Tnum,
char **ikey=0)
124 for (i = Tnum; i <
curnum; i++)
125 if (
Table[i].
Item) {Tnum = i+1;
return i;}
Definition XrdOucTable.hh:38
OucTable * Table
Definition XrdOucTable.hh:157
int curnum
Definition XrdOucTable.hh:160
XrdOucTable(int maxe)
Definition XrdOucTable.hh:41
T * Apply(int(*func)(T *, void *), void *Arg, int Start=0)
Definition XrdOucTable.hh:67
int Alloc()
Definition XrdOucTable.hh:54
~XrdOucTable()
Definition XrdOucTable.hh:49
T * Remove(const char *key)
Definition XrdOucTable.hh:144
T * Remove(int Tnum)
Definition XrdOucTable.hh:132
void Delete(const char *key)
Definition XrdOucTable.hh:83
int maxnum
Definition XrdOucTable.hh:159
T * Item(int Tnum, char **ikey=0)
Definition XrdOucTable.hh:114
int Insert(T *Item, const char *key=0, int Tnum=-1)
Definition XrdOucTable.hh:105
T * Find(const char *key, int *Tnum=0)
Definition XrdOucTable.hh:93
void Delete(int Tnum)
Definition XrdOucTable.hh:78
int avlnum
Definition XrdOucTable.hh:158
int Next(int &Tnum)
Definition XrdOucTable.hh:123
Definition XrdOucTable.hh:150
OucTable()
Definition XrdOucTable.hh:153
char * Key
Definition XrdOucTable.hh:151
int Fnum
Definition XrdOucTable.hh:152
T * Item
Definition XrdOucTable.hh:150
~OucTable()
Definition XrdOucTable.hh:154