Source code
Revision control
Copy as Markdown
Other Tools
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
#include "nsReadableUtils.h"
#include "nsTreeUtils.h"
#include "ChildIterator.h"
#include "nsCRT.h"
#include "nsAtom.h"
#include "nsNameSpaceManager.h"
#include "nsGkAtoms.h"
#include "nsIContent.h"
using namespace mozilla;
nsresult nsTreeUtils::TokenizeProperties(const nsAString& aProperties,
AtomArray& aPropertiesArray) {
nsAString::const_iterator end;
aProperties.EndReading(end);
nsAString::const_iterator iter;
aProperties.BeginReading(iter);
do {
// Skip whitespace
while (iter != end && nsCRT::IsAsciiSpace(*iter)) ++iter;
// If only whitespace, we're done
if (iter == end) break;
// Note the first non-whitespace character
nsAString::const_iterator first = iter;
// Advance to the next whitespace character
while (iter != end && !nsCRT::IsAsciiSpace(*iter)) ++iter;
// XXX this would be nonsensical
NS_ASSERTION(iter != first, "eh? something's wrong here");
if (iter == first) break;
RefPtr<nsAtom> atom = NS_Atomize(Substring(first, iter));
aPropertiesArray.AppendElement(atom);
} while (iter != end);
return NS_OK;
}
nsIContent* nsTreeUtils::GetImmediateChild(nsIContent* aContainer,
nsAtom* aTag) {
dom::FlattenedChildIterator iter(aContainer);
for (nsIContent* child = iter.GetNextChild(); child;
child = iter.GetNextChild()) {
if (child->IsXULElement(aTag)) {
return child;
}
// <slot> is in the flattened tree, but <tree> code is used to work with
// <xbl:children> which is not, so recurse in <slot> here.
if (child->IsHTMLElement(nsGkAtoms::slot)) {
if (nsIContent* c = GetImmediateChild(child, aTag)) {
return c;
}
}
}
return nullptr;
}
nsIContent* nsTreeUtils::GetDescendantChild(nsIContent* aContainer,
nsAtom* aTag) {
dom::FlattenedChildIterator iter(aContainer);
for (nsIContent* child = iter.GetNextChild(); child;
child = iter.GetNextChild()) {
if (child->IsXULElement(aTag)) {
return child;
}
child = GetDescendantChild(child, aTag);
if (child) {
return child;
}
}
return nullptr;
}
nsresult nsTreeUtils::UpdateSortIndicators(dom::Element* aColumn,
const nsAString& aDirection) {
aColumn->SetAttr(kNameSpaceID_None, nsGkAtoms::sortDirection, aDirection,
true);
aColumn->SetAttr(kNameSpaceID_None, nsGkAtoms::sortActive, u"true"_ns, true);
// Unset sort attribute(s) on the other columns
nsCOMPtr<nsIContent> parentContent = aColumn->GetParent();
if (parentContent && parentContent->NodeInfo()->Equals(nsGkAtoms::treecols,
kNameSpaceID_XUL)) {
for (nsINode* childContent = parentContent->GetFirstChild(); childContent;
childContent = childContent->GetNextSibling()) {
if (childContent != aColumn &&
childContent->NodeInfo()->Equals(nsGkAtoms::treecol,
kNameSpaceID_XUL)) {
childContent->AsElement()->UnsetAttr(kNameSpaceID_None,
nsGkAtoms::sortDirection, true);
childContent->AsElement()->UnsetAttr(kNameSpaceID_None,
nsGkAtoms::sortActive, true);
}
}
}
return NS_OK;
}
nsresult nsTreeUtils::GetColumnIndex(dom::Element* aColumn, int32_t* aResult) {
nsIContent* parentContent = aColumn->GetParent();
if (parentContent && parentContent->NodeInfo()->Equals(nsGkAtoms::treecols,
kNameSpaceID_XUL)) {
int32_t colIndex = 0;
for (nsINode* childContent = parentContent->GetFirstChild(); childContent;
childContent = childContent->GetNextSibling()) {
if (childContent->NodeInfo()->Equals(nsGkAtoms::treecol,
kNameSpaceID_XUL)) {
if (childContent == aColumn) {
*aResult = colIndex;
return NS_OK;
}
++colIndex;
}
}
}
*aResult = -1;
return NS_OK;
}