📄 html_miscimpl.cpp
字号:
/**
* This file is part of the DOM implementation for KDE.
*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* Copyright (C) 2003 Apple Computer, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*
*/
// -------------------------------------------------------------------------
#include "html/html_miscimpl.h"
#include "html/html_formimpl.h"
#include "html/html_imageimpl.h"
#include "html/html_documentimpl.h"
#include "misc/htmlhashes.h"
#include "dom/dom_node.h"
using namespace DOM;
#include <kdebug.h>
HTMLBaseFontElementImpl::HTMLBaseFontElementImpl(DocumentPtr *doc)
: HTMLElementImpl(doc)
{
}
HTMLBaseFontElementImpl::~HTMLBaseFontElementImpl()
{
}
NodeImpl::Id HTMLBaseFontElementImpl::id() const
{
return ID_BASEFONT;
}
// -------------------------------------------------------------------------
HTMLCollectionImpl::HTMLCollectionImpl(NodeImpl *_base, int _type)
{
base = _base;
base->ref();
type = _type;
idsDone = false;
info = base->isDocumentNode() && base->getDocument()->isHTMLDocument() ? static_cast<HTMLDocumentImpl*>(base->getDocument())->collectionInfo(type) : 0;
}
HTMLCollectionImpl::~HTMLCollectionImpl()
{
base->deref();
}
HTMLCollectionImpl::CollectionInfo::CollectionInfo() :
version(0)
{
idCache.setAutoDelete(true);
nameCache.setAutoDelete(true);
reset();
}
void HTMLCollectionImpl::CollectionInfo::reset()
{
current = 0;
position = 0;
length = 0;
haslength = false;
elementsArrayPosition = 0;
idCache.clear();
nameCache.clear();
hasNameCache = false;
}
void HTMLCollectionImpl::resetCollectionInfo() const
{
unsigned int docversion = static_cast<HTMLDocumentImpl*>(base->getDocument())->domTreeVersion();
if (!info) {
info = new CollectionInfo;
info->version = docversion;
return;
}
if (info->version != docversion) {
info->reset();
info->version = docversion;
}
}
NodeImpl *HTMLCollectionImpl::traverseNextItem(NodeImpl *current) const
{
assert(current);
current = current->traverseNextNode(base);
while (current) {
if(current->nodeType() == Node::ELEMENT_NODE) {
bool found = false;
bool deep = true;
HTMLElementImpl *e = static_cast<HTMLElementImpl *>(current);
switch(type) {
case DOC_IMAGES:
if(e->id() == ID_IMG)
found = true;
break;
case DOC_FORMS:
if(e->id() == ID_FORM)
found = true;
break;
case DOC_NAMEABLE_ITEMS:
if(e->id() == ID_IMG)
found = true;
if(e->id() == ID_FORM)
found = true;
if(e->id() == ID_APPLET)
found = true;
if(e->id() == ID_EMBED)
found = true;
if(e->id() == ID_OBJECT)
found = true;
break;
case TABLE_TBODIES:
if(e->id() == ID_TBODY)
found = true;
else if(e->id() == ID_TABLE)
deep = false;
break;
case TR_CELLS:
if(e->id() == ID_TD || e->id() == ID_TH)
found = true;
else if(e->id() == ID_TABLE)
deep = false;
break;
case TABLE_ROWS:
case TSECTION_ROWS:
if(e->id() == ID_TR)
found = true;
else if(e->id() == ID_TABLE)
deep = false;
break;
case SELECT_OPTIONS:
if(e->id() == ID_OPTION)
found = true;
break;
case MAP_AREAS:
if(e->id() == ID_AREA)
found = true;
break;
case DOC_APPLETS: // all OBJECT and APPLET elements
if(e->id() == ID_OBJECT || e->id() == ID_APPLET)
found = true;
break;
case DOC_EMBEDS: // all EMBED elements
if(e->id() == ID_EMBED)
found = true;
break;
case DOC_OBJECTS: // all OBJECT elements
if(e->id() == ID_OBJECT)
found = true;
break;
case DOC_LINKS: // all A _and_ AREA elements with a value for href
if(e->id() == ID_A || e->id() == ID_AREA)
if(!e->getAttribute(ATTR_HREF).isNull())
found = true;
break;
case DOC_ANCHORS: // all A elements with a value for name or an id attribute
if(e->id() == ID_A)
if(!e->getAttribute(ATTR_NAME).isNull())
found = true;
break;
case DOC_ALL:
found = true;
break;
case NODE_CHILDREN:
found = true;
deep = false;
break;
default:
kdDebug( 6030 ) << "Error in HTMLCollection, wrong tagId!" << endl;
}
if (found) {
return current;
}
if (deep) {
current = current->traverseNextNode(base);
continue;
}
}
current = current->traverseNextSibling(base);
}
return 0;
}
unsigned long HTMLCollectionImpl::calcLength() const
{
unsigned long len = 0;
for (NodeImpl *current = traverseNextItem(base); current; current = traverseNextItem(current)) {
len++;
}
return len;
}
// since the collections are to be "live", we have to do the
// calculation every time if anything has changed
unsigned long HTMLCollectionImpl::length() const
{
resetCollectionInfo();
if (!info->haslength) {
info->length = calcLength();
info->haslength = true;
}
return info->length;
}
NodeImpl *HTMLCollectionImpl::item( unsigned long index ) const
{
resetCollectionInfo();
if (info->current && info->position == index) {
return info->current;
}
if (info->haslength && info->length <= index) {
return 0;
}
if (!info->current || info->position > index) {
info->current = traverseNextItem(base);
info->position = 0;
if (!info->current)
return 0;
}
NodeImpl *node = info->current;
for (unsigned pos = info->position; node && pos < index; pos++) {
node = traverseNextItem(node);
}
info->current = node;
info->position = index;
return info->current;
}
NodeImpl *HTMLCollectionImpl::firstItem() const
{
return item(0);
}
NodeImpl *HTMLCollectionImpl::nextItem() const
{
resetCollectionInfo();
// Look for the 'second' item. The first one is currentItem, already given back.
NodeImpl *retval = traverseNextItem(info->current);
info->current = retval;
info->position++;
return retval;
}
bool HTMLCollectionImpl::checkForNameMatch(NodeImpl *node, bool checkName, const DOMString &name, bool caseSensitive) const
{
ElementImpl *e = static_cast<ElementImpl *>(node);
if (caseSensitive) {
if (checkName) {
// document.all returns only images, forms, applets, objects and embeds
// by name (though everything by id)
if (type == DOC_ALL &&
!(e->id() == ID_IMG || e->id() == ID_FORM ||
e->id() == ID_APPLET || e->id() == ID_OBJECT ||
e->id() == ID_EMBED))
return false;
return e->getAttribute(ATTR_NAME) == name && e->getAttribute(ATTR_ID) != name;
} else {
return e->getAttribute(ATTR_ID) == name;
}
} else {
if (checkName) {
// document.all returns only images, forms, applets, objects and embeds
// by name (though everything by id)
if (type == DOC_ALL &&
!(e->id() == ID_IMG || e->id() == ID_FORM ||
e->id() == ID_APPLET || e->id() == ID_OBJECT ||
e->id() == ID_EMBED))
return false;
return e->getAttribute(ATTR_NAME).domString().lower() == name.lower() &&
e->getAttribute(ATTR_ID).domString().lower() != name.lower();
} else {
return e->getAttribute(ATTR_ID).domString().lower() == name.lower();
}
}
}
NodeImpl *HTMLCollectionImpl::namedItem( const DOMString &name, bool caseSensitive ) const
{
// http://msdn.microsoft.com/workshop/author/dhtml/reference/methods/nameditem.asp
// This method first searches for an object with a matching id
// attribute. If a match is not found, the method then searches for an
// object with a matching name attribute, but only on those elements
// that are allowed a name attribute.
resetCollectionInfo();
idsDone = false;
NodeImpl *n;
for (n = traverseNextItem(base); n; n = traverseNextItem(n)) {
if (checkForNameMatch(n, idsDone, name, caseSensitive)) {
break;
}
}
info->current = n;
if(info->current)
return info->current;
idsDone = true;
for (n = traverseNextItem(base); n; n = traverseNextItem(n)) {
if (checkForNameMatch(n, idsDone, name, caseSensitive)) {
break;
}
}
info->current = n;
return info->current;
}
template<class T> static void appendToVector(QPtrVector<T> *vec, T *item)
{
unsigned size = vec->size();
unsigned count = vec->count();
if (size == count)
vec->resize(size == 0 ? 8 : (int)(size * 1.5));
vec->insert(count, item);
}
void HTMLCollectionImpl::updateNameCache() const
{
if (info->hasNameCache)
return;
for (NodeImpl *n = traverseNextItem(base); n; n = traverseNextItem(n)) {
ElementImpl *e = static_cast<ElementImpl *>(n);
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -