2001-12-16 12:13:48 +03:00
|
|
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
// vim:cindent:ts=2:et:sw=2:
|
|
|
|
/* ***** BEGIN LICENSE BLOCK *****
|
2004-04-18 18:30:37 +04:00
|
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
2001-12-16 12:13:48 +03:00
|
|
|
*
|
2004-04-18 18:30:37 +04: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/
|
2001-12-16 12:13:48 +03: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.
|
|
|
|
*
|
|
|
|
* The Original Code is mozilla.org code.
|
|
|
|
*
|
2004-04-18 18:30:37 +04:00
|
|
|
* The Initial Developer of the Original Code is
|
2001-12-16 12:13:48 +03:00
|
|
|
* Netscape Communications Corporation.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
2004-04-18 18:30:37 +04: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-12-16 12:13:48 +03: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 18:30:37 +04:00
|
|
|
* use your version of this file under the terms of the MPL, indicate your
|
2001-12-16 12:13:48 +03: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 18:30:37 +04:00
|
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
2001-12-16 12:13:48 +03:00
|
|
|
*
|
|
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
|
2006-03-30 09:56:38 +04:00
|
|
|
/*
|
|
|
|
* used by nsCSSFrameConstructor to determine and iterate the child list
|
|
|
|
* used to construct frames (normal children or something from XBL)
|
|
|
|
*/
|
|
|
|
|
2001-12-16 12:13:48 +03:00
|
|
|
#include "nsCOMPtr.h"
|
|
|
|
#include "nsIContent.h"
|
2009-01-29 22:46:20 +03:00
|
|
|
#include "nsINodeList.h"
|
2001-12-16 12:13:48 +03:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Helper class for iterating children during frame construction.
|
|
|
|
* This class should always be used in lieu of the straight content
|
|
|
|
* node APIs, since it handles XBL-generated anonymous content as
|
|
|
|
* well.
|
|
|
|
*/
|
2008-07-01 23:16:45 +04:00
|
|
|
class NS_STACK_CLASS ChildIterator
|
2001-12-16 12:13:48 +03:00
|
|
|
{
|
|
|
|
protected:
|
2009-02-19 19:55:09 +03:00
|
|
|
nsIContent* mContent;
|
2010-07-15 08:38:21 +04:00
|
|
|
// If mNodes is non-null (so XBLInvolved() is true), mIndex is the
|
|
|
|
// index into mNodes for our current position. Otherwise, mChild is
|
|
|
|
// our current child (which might be null if we're done iterating).
|
|
|
|
union {
|
|
|
|
PRUint32 mIndex;
|
|
|
|
nsIContent* mChild;
|
|
|
|
};
|
2009-02-19 19:55:09 +03:00
|
|
|
nsINodeList* mNodes;
|
2001-12-16 12:13:48 +03:00
|
|
|
|
|
|
|
public:
|
|
|
|
ChildIterator()
|
2010-07-15 08:38:21 +04:00
|
|
|
: mContent(nsnull), mChild(0), mNodes(nsnull) {}
|
2001-12-16 12:13:48 +03:00
|
|
|
|
|
|
|
ChildIterator(const ChildIterator& aOther)
|
|
|
|
: mContent(aOther.mContent),
|
2010-07-15 08:38:21 +04:00
|
|
|
mNodes(aOther.mNodes) {
|
|
|
|
if (XBLInvolved()) {
|
|
|
|
mIndex = aOther.mIndex;
|
|
|
|
} else {
|
|
|
|
mChild = aOther.mChild;
|
|
|
|
}
|
|
|
|
}
|
2001-12-16 12:13:48 +03:00
|
|
|
|
|
|
|
ChildIterator& operator=(const ChildIterator& aOther) {
|
|
|
|
mContent = aOther.mContent;
|
|
|
|
mNodes = aOther.mNodes;
|
2010-07-15 08:38:21 +04:00
|
|
|
if (XBLInvolved()) {
|
|
|
|
mIndex = aOther.mIndex;
|
|
|
|
} else {
|
|
|
|
mChild = aOther.mChild;
|
|
|
|
}
|
2001-12-16 12:13:48 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
ChildIterator& operator++() {
|
2010-07-15 08:38:21 +04:00
|
|
|
if (XBLInvolved()) {
|
|
|
|
++mIndex;
|
|
|
|
} else {
|
|
|
|
NS_ASSERTION(mChild, "Walking off end of list?");
|
|
|
|
mChild = mChild->GetNextSibling();
|
|
|
|
}
|
|
|
|
|
2001-12-16 12:13:48 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
ChildIterator operator++(int) {
|
|
|
|
ChildIterator result(*this);
|
2010-07-15 08:38:21 +04:00
|
|
|
++(*this);
|
2001-12-16 12:13:48 +03:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
ChildIterator& operator--() {
|
2010-07-15 08:38:21 +04:00
|
|
|
if (XBLInvolved()) {
|
|
|
|
--mIndex;
|
|
|
|
} else if (mChild) {
|
|
|
|
mChild = mChild->GetPreviousSibling();
|
|
|
|
NS_ASSERTION(mChild, "Walking off beginning of list");
|
|
|
|
} else {
|
|
|
|
mChild = mContent->GetLastChild();
|
|
|
|
}
|
2001-12-16 12:13:48 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
ChildIterator operator--(int) {
|
|
|
|
ChildIterator result(*this);
|
2010-07-15 08:38:21 +04:00
|
|
|
--(*this);
|
2001-12-16 12:13:48 +03:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2009-01-29 22:46:20 +03:00
|
|
|
nsIContent* get() const {
|
|
|
|
if (XBLInvolved()) {
|
|
|
|
return mNodes->GetNodeAt(mIndex);
|
2001-12-16 12:13:48 +03:00
|
|
|
}
|
|
|
|
|
2010-07-15 08:38:21 +04:00
|
|
|
return mChild;
|
2001-12-16 12:13:48 +03:00
|
|
|
}
|
|
|
|
|
2009-01-29 22:46:20 +03:00
|
|
|
nsIContent* operator*() const { return get(); }
|
2001-12-16 12:13:48 +03:00
|
|
|
|
|
|
|
PRBool operator==(const ChildIterator& aOther) const {
|
2010-07-15 08:38:21 +04:00
|
|
|
if (XBLInvolved()) {
|
|
|
|
return mContent == aOther.mContent && mIndex == aOther.mIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
return mContent == aOther.mContent && mChild == aOther.mChild;
|
2001-12-16 12:13:48 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
PRBool operator!=(const ChildIterator& aOther) const {
|
|
|
|
return !aOther.operator==(*this);
|
|
|
|
}
|
|
|
|
|
2009-01-29 22:46:20 +03:00
|
|
|
void seek(nsIContent* aContent) {
|
|
|
|
if (XBLInvolved()) {
|
2010-07-15 08:38:21 +04:00
|
|
|
PRInt32 index = mNodes->IndexOf(aContent);
|
|
|
|
// XXXbz I wish we could assert that index != -1, but it seems to not be
|
|
|
|
// the case in some XBL cases with filtered insertion points and no
|
|
|
|
// default insertion point. I will now claim that XBL's management of
|
|
|
|
// its insertion points is broken in those cases, since it's returning an
|
|
|
|
// insertion parent for a node that doesn't actually have the node in its
|
|
|
|
// child list according to ChildIterator. See bug 474324.
|
|
|
|
if (index != -1) {
|
|
|
|
mIndex = index;
|
|
|
|
} else {
|
|
|
|
// If aContent isn't going to get hit by this iterator, just seek to the
|
|
|
|
// end of the list for lack of anything better to do.
|
|
|
|
mIndex = length();
|
|
|
|
}
|
|
|
|
} else if (aContent->GetParent() == mContent) {
|
|
|
|
mChild = aContent;
|
2009-01-29 22:46:20 +03:00
|
|
|
} else {
|
2010-07-15 08:38:21 +04:00
|
|
|
// XXXbz I wish we could assert this doesn't happen, but I think that's
|
|
|
|
// not necessarily the case when called from ContentInserted if
|
|
|
|
// first-letter frames are about.
|
|
|
|
mChild = nsnull;
|
2009-01-29 22:46:20 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
PRBool XBLInvolved() const { return mNodes != nsnull; }
|
|
|
|
|
2001-12-16 12:13:48 +03:00
|
|
|
/**
|
|
|
|
* Create a pair of ChildIterators for a content node. aFirst will
|
|
|
|
* point to the first child of aContent; aLast will point one past
|
|
|
|
* the last child of aContent.
|
|
|
|
*/
|
|
|
|
static nsresult Init(nsIContent* aContent,
|
|
|
|
ChildIterator* aFirst,
|
|
|
|
ChildIterator* aLast);
|
2009-01-29 22:46:20 +03:00
|
|
|
|
|
|
|
private:
|
|
|
|
PRUint32 length() {
|
2010-07-15 08:38:21 +04:00
|
|
|
NS_PRECONDITION(XBLInvolved(), "Don't call me");
|
2009-01-29 22:46:20 +03:00
|
|
|
PRUint32 l;
|
2010-07-15 08:38:21 +04:00
|
|
|
mNodes->GetLength(&l);
|
2009-01-29 22:46:20 +03:00
|
|
|
return l;
|
|
|
|
}
|
2001-12-16 12:13:48 +03:00
|
|
|
};
|