2001-09-28 20:14:13 +00:00
|
|
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
2004-04-18 14:30:37 +00:00
|
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
1999-01-15 01:28:07 +00:00
|
|
|
*
|
2004-04-18 14:30:37 +00:00
|
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
|
|
* the License. You may obtain a copy of the License at
|
|
|
|
* http://www.mozilla.org/MPL/
|
1999-01-15 01:28:07 +00:00
|
|
|
*
|
2001-09-28 20:14:13 +00:00
|
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
|
|
* for the specific language governing rights and limitations under the
|
|
|
|
* License.
|
1999-01-15 01:28:07 +00:00
|
|
|
*
|
|
|
|
* The Original Code is Mozilla Communicator client code.
|
|
|
|
*
|
2004-04-18 14:30:37 +00:00
|
|
|
* The Initial Developer of the Original Code is
|
2001-09-28 20:14:13 +00:00
|
|
|
* Netscape Communications Corporation.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
1999-11-06 03:40:37 +00:00
|
|
|
*
|
2001-09-28 20:14:13 +00:00
|
|
|
* Contributor(s):
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
2004-04-18 14:30:37 +00:00
|
|
|
* either of the GNU General Public License Version 2 or later (the "GPL"),
|
|
|
|
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
2001-09-28 20:14:13 +00:00
|
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
2004-04-18 14:30:37 +00:00
|
|
|
* use your version of this file under the terms of the MPL, indicate your
|
2001-09-28 20:14:13 +00:00
|
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
|
|
* the provisions above, a recipient may use your version of this file under
|
2004-04-18 14:30:37 +00:00
|
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
2001-09-28 20:14:13 +00:00
|
|
|
*
|
|
|
|
* ***** END LICENSE BLOCK ***** */
|
2006-03-29 18:29:03 +00:00
|
|
|
|
|
|
|
/* class for maintaining a linked list of child frames */
|
|
|
|
|
1999-01-15 01:28:07 +00:00
|
|
|
#ifndef nsFrameList_h___
|
|
|
|
#define nsFrameList_h___
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
#include "nscore.h"
|
|
|
|
#include "nsTraceRefcnt.h"
|
|
|
|
#include <stdio.h> /* for FILE* */
|
|
|
|
#include "nsDebug.h"
|
|
|
|
|
|
|
|
class nsIFrame;
|
1999-01-15 01:28:07 +00:00
|
|
|
|
|
|
|
/**
|
2009-07-28 12:51:08 +00:00
|
|
|
* A class for managing a list of frames.
|
1999-01-15 01:28:07 +00:00
|
|
|
*/
|
|
|
|
class nsFrameList {
|
|
|
|
public:
|
2009-07-28 12:51:08 +00:00
|
|
|
nsFrameList() :
|
|
|
|
mFirstChild(nsnull)
|
|
|
|
{
|
|
|
|
MOZ_COUNT_CTOR(nsFrameList);
|
1999-01-15 01:28:07 +00:00
|
|
|
}
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
// XXX We should make this explicit when we can!
|
|
|
|
nsFrameList(nsIFrame* aHead) :
|
|
|
|
mFirstChild(aHead)
|
|
|
|
{
|
|
|
|
MOZ_COUNT_CTOR(nsFrameList);
|
2004-10-30 18:35:53 +00:00
|
|
|
#ifdef DEBUG
|
|
|
|
CheckForLoops();
|
|
|
|
#endif
|
1999-01-15 01:28:07 +00:00
|
|
|
}
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
nsFrameList(const nsFrameList& aOther) :
|
|
|
|
mFirstChild(aOther.mFirstChild)
|
|
|
|
{
|
|
|
|
MOZ_COUNT_CTOR(nsFrameList);
|
|
|
|
}
|
|
|
|
|
1999-01-15 01:28:07 +00:00
|
|
|
~nsFrameList() {
|
2009-07-28 12:51:08 +00:00
|
|
|
MOZ_COUNT_DTOR(nsFrameList);
|
|
|
|
// Don't destroy our frames here, so that we can have temporary nsFrameLists
|
1999-01-15 01:28:07 +00:00
|
|
|
}
|
|
|
|
|
2006-04-10 00:16:29 +00:00
|
|
|
void DestroyFrames();
|
1999-01-15 01:28:07 +00:00
|
|
|
|
2007-07-26 04:03:29 +00:00
|
|
|
// Delete this and destroy all its frames
|
|
|
|
void Destroy();
|
|
|
|
|
1999-01-15 22:53:39 +00:00
|
|
|
void SetFrames(nsIFrame* aFrameList) {
|
|
|
|
mFirstChild = aFrameList;
|
2004-10-30 18:35:53 +00:00
|
|
|
#ifdef DEBUG
|
|
|
|
CheckForLoops();
|
|
|
|
#endif
|
1999-01-15 22:53:39 +00:00
|
|
|
}
|
|
|
|
|
2009-07-28 12:53:20 +00:00
|
|
|
void Clear() { SetFrames(nsnull); }
|
|
|
|
|
|
|
|
void SetFrames(nsFrameList& aFrameList) {
|
|
|
|
NS_PRECONDITION(!mFirstChild, "Losing frames");
|
|
|
|
mFirstChild = aFrameList.FirstChild();
|
|
|
|
aFrameList.Clear();
|
|
|
|
}
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
class Slice;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Appends frames from aFrameList to this list. If aParent
|
|
|
|
* is not null, reparents the newly-added frames.
|
|
|
|
*/
|
2009-07-28 12:53:20 +00:00
|
|
|
void AppendFrames(nsIFrame* aParent, nsIFrame* aFrameList) {
|
|
|
|
InsertFrames(aParent, LastChild(), aFrameList);
|
|
|
|
}
|
1999-01-15 01:28:07 +00:00
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
/**
|
|
|
|
* Appends aFrameList to this list. If aParent is not null,
|
|
|
|
* reparents the newly added frames. Clears out aFrameList and
|
|
|
|
* returns a list slice represening the newly-appended frames.
|
|
|
|
*/
|
|
|
|
Slice AppendFrames(nsIFrame* aParent, nsFrameList& aFrameList) {
|
|
|
|
NS_PRECONDITION(!aFrameList.IsEmpty(), "Unexpected empty list");
|
|
|
|
nsIFrame* firstNewFrame = aFrameList.FirstChild();
|
|
|
|
AppendFrames(aParent, firstNewFrame);
|
2009-07-28 12:53:20 +00:00
|
|
|
aFrameList.Clear();
|
2009-07-28 12:51:08 +00:00
|
|
|
return Slice(*this, firstNewFrame, nsnull);
|
1999-01-15 01:28:07 +00:00
|
|
|
}
|
|
|
|
|
2009-07-28 12:53:20 +00:00
|
|
|
/* This is implemented in nsIFrame.h because it needs to know about
|
|
|
|
nsIFrame. */
|
|
|
|
inline void AppendFrame(nsIFrame* aParent, nsIFrame* aFrame);
|
1999-01-15 01:28:07 +00:00
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
/**
|
|
|
|
* Take aFrame out of the frame list. This also disconnects aFrame
|
|
|
|
* from the sibling list. This will return PR_FALSE if aFrame is
|
|
|
|
* nsnull or if aFrame is not in the list. The second frame is
|
|
|
|
* a hint for the prev-sibling of aFrame; if the hint is correct,
|
|
|
|
* then this is O(1) time. If successfully removed, the child's
|
|
|
|
* NextSibling pointer is cleared.
|
|
|
|
*/
|
2005-02-16 20:02:14 +00:00
|
|
|
PRBool RemoveFrame(nsIFrame* aFrame, nsIFrame* aPrevSiblingHint = nsnull);
|
1999-01-15 01:28:07 +00:00
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
/**
|
|
|
|
* Remove the first child from the list. The caller is assumed to be
|
|
|
|
* holding a reference to the first child. This call is equivalent
|
|
|
|
* in behavior to calling RemoveFrame(FirstChild()). If successfully
|
|
|
|
* removed the first child's NextSibling pointer is cleared.
|
|
|
|
*/
|
1999-01-15 22:53:39 +00:00
|
|
|
PRBool RemoveFirstChild();
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
/**
|
|
|
|
* Take aFrame out of the frame list and then destroy it. This also
|
|
|
|
* disconnects aFrame from the sibling list. This will return
|
2009-07-28 12:53:18 +00:00
|
|
|
* PR_FALSE if aFrame is nsnull or if aFrame is not in the list. The
|
|
|
|
* second frame is a hint for the prev-sibling of aFrame; if the
|
|
|
|
* hint is correct, then the time this method takes doesn't depend
|
|
|
|
* on the number of previous siblings of aFrame.
|
2009-07-28 12:51:08 +00:00
|
|
|
*/
|
2009-07-28 12:53:18 +00:00
|
|
|
PRBool DestroyFrame(nsIFrame* aFrame, nsIFrame* aPrevSiblingHint = nsnull);
|
1999-01-15 01:28:07 +00:00
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
/**
|
|
|
|
* Inserts aNewFrame right after aPrevSibling, or prepends to
|
|
|
|
* list if aPrevSibling is null. If aParent is not null, also
|
|
|
|
* reparents newly-added frame. Note that this method always
|
|
|
|
* sets the frame's nextSibling pointer.
|
2009-07-28 12:53:20 +00:00
|
|
|
* This is implemented in nsIFrame.h because it needs to know about nsIFrame.
|
2009-07-28 12:51:08 +00:00
|
|
|
*/
|
2009-07-28 12:53:20 +00:00
|
|
|
inline void InsertFrame(nsIFrame* aParent, nsIFrame* aPrevSibling,
|
|
|
|
nsIFrame* aNewFrame);
|
1999-01-15 01:28:07 +00:00
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
/**
|
|
|
|
* Inserts aFrameList right after aPrevSibling, or prepends to
|
|
|
|
* list if aPrevSibling is null. If aParent is not null, also
|
|
|
|
* reparents newly-added frame.
|
|
|
|
*/
|
1999-01-15 01:28:07 +00:00
|
|
|
void InsertFrames(nsIFrame* aParent,
|
|
|
|
nsIFrame* aPrevSibling,
|
|
|
|
nsIFrame* aFrameList);
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
/**
|
|
|
|
* Inserts aFrameList into this list after aPrevSibling (at the beginning if
|
|
|
|
* aPrevSibling is null). If aParent is not null, reparents the newly added
|
|
|
|
* frames. Clears out aFrameList and returns a list slice representing the
|
|
|
|
* newly-inserted frames.
|
|
|
|
*
|
|
|
|
* This is implemented in nsIFrame.h because it needs to know about nsIFrame.
|
|
|
|
*/
|
|
|
|
inline Slice InsertFrames(nsIFrame* aParent, nsIFrame* aPrevSibling,
|
|
|
|
nsFrameList& aFrameList);
|
1999-02-01 17:31:37 +00:00
|
|
|
|
2009-07-28 12:53:19 +00:00
|
|
|
class FrameLinkEnumerator;
|
|
|
|
|
|
|
|
/* Split this frame list such that all the frames before the link pointed to
|
|
|
|
* by aLink end up in the returned list, while the remaining frames stay in
|
|
|
|
* this list. After this call, aLink points to the beginning of this list.
|
|
|
|
*/
|
|
|
|
nsFrameList ExtractHead(FrameLinkEnumerator& aLink);
|
1999-01-15 01:28:07 +00:00
|
|
|
|
2009-07-28 12:53:19 +00:00
|
|
|
/* Split this frame list such that all the frames coming after the link
|
|
|
|
* pointed to by aLink end up in the returned list, while the frames before
|
|
|
|
* that link stay in this list. After this call, aLink is at end.
|
|
|
|
*/
|
|
|
|
nsFrameList ExtractTail(FrameLinkEnumerator& aLink);
|
|
|
|
|
2005-03-23 03:35:08 +00:00
|
|
|
/**
|
|
|
|
* Sort the frames according to content order so that the first
|
|
|
|
* frame in the list is the first in content order. Frames for
|
|
|
|
* the same content will be ordered so that a prev in flow
|
|
|
|
* comes before its next in flow.
|
|
|
|
*/
|
|
|
|
void SortByContentOrder();
|
|
|
|
|
1999-01-15 01:28:07 +00:00
|
|
|
nsIFrame* FirstChild() const {
|
|
|
|
return mFirstChild;
|
|
|
|
}
|
|
|
|
|
|
|
|
nsIFrame* LastChild() const;
|
|
|
|
|
1999-01-15 22:53:39 +00:00
|
|
|
nsIFrame* FrameAt(PRInt32 aIndex) const;
|
2009-04-25 08:33:32 +00:00
|
|
|
PRInt32 IndexOf(nsIFrame* aFrame) const;
|
1999-01-15 22:53:39 +00:00
|
|
|
|
1999-01-15 01:28:07 +00:00
|
|
|
PRBool IsEmpty() const {
|
|
|
|
return nsnull == mFirstChild;
|
|
|
|
}
|
|
|
|
|
1999-01-15 22:53:39 +00:00
|
|
|
PRBool NotEmpty() const {
|
|
|
|
return nsnull != mFirstChild;
|
|
|
|
}
|
|
|
|
|
|
|
|
PRBool ContainsFrame(const nsIFrame* aFrame) const;
|
2008-01-29 23:39:39 +00:00
|
|
|
PRBool ContainsFrameBefore(const nsIFrame* aFrame, const nsIFrame* aEnd) const;
|
1999-01-15 01:28:07 +00:00
|
|
|
|
|
|
|
PRInt32 GetLength() const;
|
|
|
|
|
|
|
|
nsIFrame* GetPrevSiblingFor(nsIFrame* aFrame) const;
|
|
|
|
|
2009-07-28 12:51:09 +00:00
|
|
|
/**
|
|
|
|
* If this frame list has only one frame, return that frame.
|
|
|
|
* Otherwise, return null.
|
|
|
|
*/
|
|
|
|
nsIFrame* OnlyChild() const {
|
|
|
|
if (FirstChild() == LastChild()) {
|
|
|
|
return FirstChild();
|
|
|
|
}
|
|
|
|
return nsnull;
|
|
|
|
}
|
|
|
|
|
2001-03-21 01:16:22 +00:00
|
|
|
#ifdef IBMBIDI
|
|
|
|
/**
|
2006-03-14 09:16:40 +00:00
|
|
|
* Return the frame before this frame in visual order (after Bidi reordering).
|
|
|
|
* If aFrame is null, return the last frame in visual order.
|
2001-03-21 01:16:22 +00:00
|
|
|
*/
|
|
|
|
nsIFrame* GetPrevVisualFor(nsIFrame* aFrame) const;
|
|
|
|
|
|
|
|
/**
|
2006-03-14 09:16:40 +00:00
|
|
|
* Return the frame after this frame in visual order (after Bidi reordering).
|
|
|
|
* If aFrame is null, return the first frame in visual order.
|
2001-03-21 01:16:22 +00:00
|
|
|
*/
|
|
|
|
nsIFrame* GetNextVisualFor(nsIFrame* aFrame) const;
|
|
|
|
#endif // IBMBIDI
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
#ifdef DEBUG
|
2005-09-06 21:34:50 +00:00
|
|
|
void List(FILE* out) const;
|
1999-11-01 22:12:45 +00:00
|
|
|
#endif
|
1999-02-03 19:10:26 +00:00
|
|
|
|
2009-07-28 12:51:09 +00:00
|
|
|
static nsresult Init();
|
|
|
|
static void Shutdown() { delete sEmptyList; }
|
|
|
|
static const nsFrameList& EmptyList() { return *sEmptyList; }
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
class Enumerator;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* A class representing a slice of a frame list.
|
|
|
|
*/
|
|
|
|
class Slice {
|
|
|
|
friend class Enumerator;
|
|
|
|
|
|
|
|
public:
|
|
|
|
// Implicit on purpose, so that we can easily create enumerators from
|
|
|
|
// nsFrameList via this impicit constructor.
|
|
|
|
Slice(const nsFrameList& aList) :
|
|
|
|
#ifdef DEBUG
|
|
|
|
mList(aList),
|
|
|
|
#endif
|
|
|
|
mStart(aList.FirstChild()),
|
|
|
|
mEnd(nsnull)
|
|
|
|
{}
|
|
|
|
|
|
|
|
Slice(const nsFrameList& aList, nsIFrame* aStart, nsIFrame* aEnd) :
|
|
|
|
#ifdef DEBUG
|
|
|
|
mList(aList),
|
|
|
|
#endif
|
|
|
|
mStart(aStart),
|
|
|
|
mEnd(aEnd)
|
|
|
|
{}
|
|
|
|
|
|
|
|
Slice(const Slice& aOther) :
|
|
|
|
#ifdef DEBUG
|
|
|
|
mList(aOther.mList),
|
|
|
|
#endif
|
|
|
|
mStart(aOther.mStart),
|
|
|
|
mEnd(aOther.mEnd)
|
|
|
|
{}
|
|
|
|
|
|
|
|
private:
|
|
|
|
#ifdef DEBUG
|
|
|
|
const nsFrameList& mList;
|
|
|
|
#endif
|
|
|
|
nsIFrame* const mStart; // our starting frame
|
|
|
|
const nsIFrame* const mEnd; // The first frame that is NOT in the slice.
|
|
|
|
// May be null.
|
|
|
|
};
|
|
|
|
|
|
|
|
class Enumerator {
|
|
|
|
public:
|
|
|
|
Enumerator(const Slice& aSlice) :
|
|
|
|
#ifdef DEBUG
|
|
|
|
mSlice(aSlice),
|
|
|
|
#endif
|
|
|
|
mFrame(aSlice.mStart),
|
|
|
|
mEnd(aSlice.mEnd)
|
|
|
|
{}
|
|
|
|
|
|
|
|
Enumerator(const Enumerator& aOther) :
|
|
|
|
#ifdef DEBUG
|
|
|
|
mSlice(aOther.mSlice),
|
|
|
|
#endif
|
|
|
|
mFrame(aOther.mFrame),
|
|
|
|
mEnd(aOther.mEnd)
|
|
|
|
{}
|
|
|
|
|
2009-07-30 17:23:32 +00:00
|
|
|
PRBool AtEnd() const {
|
|
|
|
// Can't just check mEnd, because some table code goes and destroys the
|
|
|
|
// tail of the frame list (including mEnd!) while iterating over the
|
|
|
|
// frame list.
|
|
|
|
return !mFrame || mFrame == mEnd;
|
|
|
|
}
|
2009-07-28 12:51:08 +00:00
|
|
|
|
|
|
|
/* Next() needs to know about nsIFrame, and nsIFrame will need to
|
|
|
|
know about nsFrameList methods, so in order to inline this put
|
|
|
|
the implementation in nsIFrame.h */
|
|
|
|
inline void Next();
|
|
|
|
|
2009-07-30 17:23:32 +00:00
|
|
|
/**
|
|
|
|
* Get the current frame we're pointing to. Do not call this on an
|
|
|
|
* iterator that is at end!
|
|
|
|
*/
|
|
|
|
nsIFrame* get() const {
|
|
|
|
NS_PRECONDITION(!AtEnd(), "Enumerator is at end");
|
|
|
|
return mFrame;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Get an enumerator that is just like this one, but not limited in terms of
|
|
|
|
* the part of the list it will traverse.
|
|
|
|
*/
|
|
|
|
Enumerator GetUnlimitedEnumerator() const {
|
|
|
|
return Enumerator(*this, nsnull);
|
|
|
|
}
|
2009-07-28 12:51:08 +00:00
|
|
|
|
2009-07-28 12:53:19 +00:00
|
|
|
#ifdef DEBUG
|
|
|
|
const nsFrameList& List() const { return mSlice.mList; }
|
|
|
|
#endif
|
|
|
|
|
|
|
|
protected:
|
2009-07-30 17:23:32 +00:00
|
|
|
Enumerator(const Enumerator& aOther, const nsIFrame* const aNewEnd):
|
|
|
|
#ifdef DEBUG
|
|
|
|
mSlice(aOther.mSlice),
|
|
|
|
#endif
|
|
|
|
mFrame(aOther.mFrame),
|
|
|
|
mEnd(aNewEnd)
|
|
|
|
{}
|
|
|
|
|
2009-07-28 12:51:08 +00:00
|
|
|
#ifdef DEBUG
|
2009-07-28 15:04:45 +00:00
|
|
|
/* Has to be an object, not a reference, since the slice could
|
|
|
|
well be a temporary constructed from an nsFrameList */
|
|
|
|
const Slice mSlice;
|
2009-07-28 12:51:08 +00:00
|
|
|
#endif
|
|
|
|
nsIFrame* mFrame; // our current frame.
|
|
|
|
const nsIFrame* const mEnd; // The first frame we should NOT enumerate.
|
|
|
|
// May be null.
|
|
|
|
};
|
|
|
|
|
2009-07-28 12:53:19 +00:00
|
|
|
/**
|
|
|
|
* A class that can be used to enumerate links between frames. When created
|
|
|
|
* from an nsFrameList, it points to the "link" immediately before the first
|
|
|
|
* frame. It can then be advanced until it points to the "link" immediately
|
|
|
|
* after the last frame. At any position, PrevFrame() and NextFrame() are
|
|
|
|
* the frames before and after the given link. This means PrevFrame() is
|
|
|
|
* null when the enumerator is at the beginning of the list and NextFrame()
|
|
|
|
* is null when it's AtEnd().
|
|
|
|
*/
|
|
|
|
class FrameLinkEnumerator : private Enumerator {
|
|
|
|
public:
|
|
|
|
friend class nsFrameList;
|
|
|
|
|
|
|
|
FrameLinkEnumerator(const nsFrameList& aList) :
|
|
|
|
Enumerator(aList),
|
|
|
|
mPrev(nsnull)
|
|
|
|
{}
|
|
|
|
|
|
|
|
FrameLinkEnumerator(const FrameLinkEnumerator& aOther) :
|
|
|
|
Enumerator(aOther),
|
|
|
|
mPrev(aOther.mPrev)
|
|
|
|
{}
|
|
|
|
|
2009-07-28 12:53:19 +00:00
|
|
|
void operator=(const FrameLinkEnumerator& aOther) {
|
|
|
|
NS_PRECONDITION(&List() == &aOther.List(), "Different lists?");
|
|
|
|
mFrame = aOther.mFrame;
|
|
|
|
mPrev = aOther.mPrev;
|
|
|
|
}
|
|
|
|
|
2009-07-28 12:53:19 +00:00
|
|
|
void Next() {
|
|
|
|
mPrev = mFrame;
|
|
|
|
Enumerator::Next();
|
|
|
|
}
|
|
|
|
|
|
|
|
PRBool AtEnd() const { return Enumerator::AtEnd(); }
|
|
|
|
|
|
|
|
nsIFrame* PrevFrame() const { return mPrev; }
|
|
|
|
nsIFrame* NextFrame() const { return mFrame; }
|
|
|
|
|
|
|
|
protected:
|
|
|
|
nsIFrame* mPrev;
|
|
|
|
};
|
|
|
|
|
2002-11-12 03:30:13 +00:00
|
|
|
private:
|
2004-10-30 18:35:53 +00:00
|
|
|
#ifdef DEBUG
|
|
|
|
void CheckForLoops();
|
|
|
|
#endif
|
2009-07-28 12:51:09 +00:00
|
|
|
|
|
|
|
static const nsFrameList* sEmptyList;
|
|
|
|
|
1999-01-15 01:28:07 +00:00
|
|
|
protected:
|
|
|
|
nsIFrame* mFirstChild;
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif /* nsFrameList_h___ */
|