TFree

class TFree : public TObject

    public:

                TFree TFree()
                TFree TFree(Seek_t first, Seek_t last)
                TFree TFree(TFree&)
         virtual void ~TFree()
               TFree* AddFree(Seek_t first, Seek_t last)
              TClass* Class()
         virtual void FillBuffer(char*& buffer)
               TFree* GetBestFree(Int_t nbytes)
               Seek_t GetFirst()
               Seek_t GetLast()
      virtual TClass* IsA() const
         virtual void ReadBuffer(char*& buffer)
                 void SetFirst(Seek_t first)
                 void SetLast(Seek_t last)
         virtual void ShowMembers(TMemberInspector& insp, char* parent)
                Int_t Sizeof() const
         virtual void Streamer(TBuffer& b)

  Data Members

    protected:

      Seek_t fFirst  First free word of segment
      Seek_t fLast   Last free word of segment

Class Description

 Service class for TFile.
 Each file has a linked list of free segments. Each free segment
 is described by its firts and last address.
 When an object is written to a file via TObject::Write, a new Key (see TKey)
 is created. The first free segment big enough to accomodate the object
 is used.
 If the object size has a length corresponding to the size of the free segment,
 the free segment is deleted from the list of free segments.
 When an object is deleted from a file, a new TFree object is generated.
 If the deleted object is contiguous to an already deleted object, the free
 segments are merged in one single segment.

*-*-*-*-*-*-*-*-*-*-*TFree default constructor*-*-*-*-*-*-*-*-*-*-*-*-*
*-*                  =========================

*-*-*-*-*-*-*-*-*-*-*Constructor for a FREE segment*-*-*-*-*-*-*-*-*-*-*-*-*
*-*                  ==============================

*-*-*-*-*-*-*-*-*-*Add a new free segment to the list of free segments*-*-*
*-*                ===================================================
  If last just preceedes an existing free segment, then first becomes
     the new starting location of the free segment.
  if first just follows an existing free segment, then last becomes
     the new ending location of the free segment.
  if first just follows an existing free segment AND last just preceedes
     an existing free segment, these two segments are merged into
     one single segment.

*-*-*-*-*-*-*-*-*-*-*-*TFree Destructor*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
*-*                    ================

*-*-*-*-*-*-*-*-*-*-*Encode FREE structure into output buffer*-*-*-*-*-*-*
*-*                  ========================================

*-*-*-*-*-*-*-*-*-*Return the best free segment where to store nbytes*-*-*-*
*-*                ==================================================

*-*-*-*-*-*-*-*-*-*-*-*Decode one FREE structure from input buffer*-*-*-*-*
*-*                    ===========================================

Inline Functions

             Seek_t GetFirst()
             Seek_t GetLast()
               void SetFirst(Seek_t first)
               void SetLast(Seek_t last)
              Int_t Sizeof() const
            TClass* Class()
            TClass* IsA() const
               void ShowMembers(TMemberInspector& insp, char* parent)
               void Streamer(TBuffer& b)
              TFree TFree(TFree&)