Tail
{ return fInstances.Tail(); }
{ return fUserBreakpoints.Tail(); }
inline Element *Tail() const { return fLast; }
inline Element* Tail() const { return fLast; }
Element* element = Tail();
device->index = (sDeviceList.Tail())->index + 1; // REVIEW!
fQueue.InsertAfter(fQueue.Tail(), entry);
fQueue.InsertAfter(fQueue.Tail(), entry);
&& node == fPackageDirectories.Tail();
&& fDependencies.Tail() == dependency;
&& fResolvables.Tail() == resolvable;
fPushPointer = fList.Tail()->sequence + fList.Tail()->size;
delete Tail();
Polygon* Tail() const;
if (Polygon* p = fQueues[i]->Tail()) {
Tail(ret, br);
Tail(ret, br);
Tail(ret, ender);
Tail(chain, latest);
Tail(ret, Node(kRegExpBranch));
Tail(ret, Node(kRegExpNothing));
Tail(ret, next);
Tail(Node(kRegExpBack), ret);
Tail(next, Node(kRegExpBranch));
Tail(ret, Node(kRegExpNothing));
Tail(ret, Node(kRegExpBranch));
Tail(ret, next);
Tail(Operand(p), val);
void Tail(char*, char*);
if (entry == fList.Tail())
&& !consumers.IsEmpty() && consumers.Head() == consumers.Tail();
return fPages.Tail();
inline vm_page* Tail() const;
B_PRIuPHYSADDR "\n", queue, queue->Head(), queue->Tail(),