NS_INTERFACE_MAP_END
NS_IMETHODIMP
nsAnonymousContentList::GetLength(uint32_t* aLength)
{
if (!mParent) {
*aLength = 0;
return NS_OK;
}
uint32_t count = 0;
for (nsIContent* child = mParent->GetFirstChild();
child;
child = child->GetNextSibling()) {
if (child->NodeInfo()->Equals(nsGkAtoms::children, kNameSpaceID_XBL)) {
XBLChildrenElement* point = static_cast<XBLChildrenElement*>(child);
if (!point->mInsertedChildren.IsEmpty()) {
count += point->mInsertedChildren.Length();
}
else {
count += point->GetChildCount();
}
}
else {
++count;
}
}
*aLength = count;
return NS_OK;
}
nsIContent* FlattenedChildIterator::GetPreviousChild()
{
// If we're already in the inserted-children array, look there first
if (mIndexInInserted) {
// NB: mIndexInInserted points one past the last returned child so we need
// to look *two* indices back in order to return the previous child.
XBLChildrenElement* point = static_cast<XBLChildrenElement*>(mChild);
if (--mIndexInInserted) {
return point->mInsertedChildren[mIndexInInserted - 1];
}
mChild = mChild->GetPreviousSibling();
} else if (mDefaultChild) {
// If we're already in default content, check if there are more nodes there
mDefaultChild = mDefaultChild->GetPreviousSibling();
if (mDefaultChild) {
return mDefaultChild;
}
mChild = mChild->GetPreviousSibling();
} else if (mIsFirst) { // at the beginning of the child list
return nullptr;
} else if (mChild) { // in the middle of the child list
mChild = mChild->GetPreviousSibling();
} else { // at the end of the child list
mChild = mParent->GetLastChild();
}
// Iterate until we find a non-<children>, or a <children> with content.
while (mChild &&
mChild->NodeInfo()->Equals(nsGkAtoms::children, kNameSpaceID_XBL)) {
XBLChildrenElement* point = static_cast<XBLChildrenElement*>(mChild);
if (!point->mInsertedChildren.IsEmpty()) {
mIndexInInserted = point->InsertedChildrenLength();
return point->mInsertedChildren[mIndexInInserted - 1];
}
mDefaultChild = mChild->GetLastChild();
if (mDefaultChild) {
return mDefaultChild;
}
mChild = mChild->GetPreviousSibling();
}
if (!mChild) {
mIsFirst = true;
}
return mChild;
}
int32_t
nsAnonymousContentList::IndexOf(nsIContent* aContent)
{
NS_ASSERTION(!aContent->NodeInfo()->Equals(nsGkAtoms::children,
kNameSpaceID_XBL),
"Looking for insertion point");
if (!mParent) {
return -1;
}
uint32_t index = 0;
for (nsIContent* child = mParent->GetFirstChild();
child;
child = child->GetNextSibling()) {
if (child->NodeInfo()->Equals(nsGkAtoms::children, kNameSpaceID_XBL)) {
XBLChildrenElement* point = static_cast<XBLChildrenElement*>(child);
if (!point->mInsertedChildren.IsEmpty()) {
uint32_t insIndex = point->mInsertedChildren.IndexOf(aContent);
if (insIndex != point->mInsertedChildren.NoIndex) {
return index + insIndex;
}
index += point->mInsertedChildren.Length();
}
else {
int32_t insIndex = point->IndexOf(aContent);
if (insIndex != -1) {
return index + (uint32_t)insIndex;
}
index += point->GetChildCount();
}
}
else {
if (child == aContent) {
return index;
}
++index;
}
}
return -1;
}
nsIContent*
nsAnonymousContentList::Item(uint32_t aIndex)
{
if (!mParent) {
return nullptr;
}
uint32_t remIndex = aIndex;
for (nsIContent* child = mParent->GetFirstChild();
child;
child = child->GetNextSibling()) {
if (child->NodeInfo()->Equals(nsGkAtoms::children, kNameSpaceID_XBL)) {
XBLChildrenElement* point = static_cast<XBLChildrenElement*>(child);
if (!point->mInsertedChildren.IsEmpty()) {
if (remIndex < point->mInsertedChildren.Length()) {
return point->mInsertedChildren[remIndex];
}
remIndex -= point->mInsertedChildren.Length();
}
else {
if (remIndex < point->GetChildCount()) {
return point->GetChildAt(remIndex);
}
remIndex -= point->GetChildCount();
}
}
else {
if (remIndex == 0) {
return child;
}
--remIndex;
}
}
return nullptr;
}
