khtml Library API Documentation

kjs_traversal.lut.h

00001 /* Automatically generated from kjs_traversal.cpp using ../../kjs/create_hash_table. DO NOT EDIT ! */
00002 
00003 using namespace KJS;
00004 
00005 namespace KJS {
00006 
00007 const struct HashEntry DOMNodeIteratorTableEntries[] = {
00008    { 0, 0, 0, 0, 0 },
00009    { "filter", DOMNodeIterator::Filter, DontDelete|ReadOnly, 0, 0 },
00010    { "root", DOMNodeIterator::Root, DontDelete|ReadOnly, 0, 0 },
00011    { "whatToShow", DOMNodeIterator::WhatToShow, DontDelete|ReadOnly, 0, &DOMNodeIteratorTableEntries[5] },
00012    { 0, 0, 0, 0, 0 },
00013    { "expandEntityReferences", DOMNodeIterator::ExpandEntityReferences, DontDelete|ReadOnly, 0, 0 }
00014 };
00015 
00016 const struct HashTable DOMNodeIteratorTable = { 2, 6, DOMNodeIteratorTableEntries, 5 };
00017 
00018 }; // namespace
00019 
00020 using namespace KJS;
00021 
00022 namespace KJS {
00023 
00024 const struct HashEntry DOMNodeIteratorProtoTableEntries[] = {
00025    { "nextNode", DOMNodeIterator::NextNode, DontDelete|Function, 0, 0 },
00026    { 0, 0, 0, 0, 0 },
00027    { "previousNode", DOMNodeIterator::PreviousNode, DontDelete|Function, 0, &DOMNodeIteratorProtoTableEntries[3] },
00028    { "detach", DOMNodeIterator::Detach, DontDelete|Function, 0, 0 }
00029 };
00030 
00031 const struct HashTable DOMNodeIteratorProtoTable = { 2, 4, DOMNodeIteratorProtoTableEntries, 3 };
00032 
00033 }; // namespace
00034 
00035 using namespace KJS;
00036 
00037 namespace KJS {
00038 
00039 const struct HashEntry NodeFilterConstructorTableEntries[] = {
00040    { "SHOW_PROCESSING_INSTRUCTION", DOM::NodeFilter::SHOW_PROCESSING_INSTRUCTION, DontDelete|ReadOnly, 0, 0 },
00041    { 0, 0, 0, 0, 0 },
00042    { 0, 0, 0, 0, 0 },
00043    { "SHOW_ELEMENT", DOM::NodeFilter::SHOW_ELEMENT, DontDelete|ReadOnly, 0, &NodeFilterConstructorTableEntries[17] },
00044    { "SHOW_ALL", DOM::NodeFilter::SHOW_ALL, DontDelete|ReadOnly, 0, 0 },
00045    { 0, 0, 0, 0, 0 },
00046    { 0, 0, 0, 0, 0 },
00047    { 0, 0, 0, 0, 0 },
00048    { "FILTER_REJECT", DOM::NodeFilter::FILTER_REJECT, DontDelete|ReadOnly, 0, 0 },
00049    { "SHOW_ENTITY", DOM::NodeFilter::SHOW_ENTITY, DontDelete|ReadOnly, 0, 0 },
00050    { "FILTER_SKIP", DOM::NodeFilter::FILTER_SKIP, DontDelete|ReadOnly, 0, &NodeFilterConstructorTableEntries[18] },
00051    { "SHOW_ENTITY_REFERENCE", DOM::NodeFilter::SHOW_ENTITY_REFERENCE, DontDelete|ReadOnly, 0, 0 },
00052    { "FILTER_ACCEPT", DOM::NodeFilter::FILTER_ACCEPT, DontDelete|ReadOnly, 0, &NodeFilterConstructorTableEntries[19] },
00053    { 0, 0, 0, 0, 0 },
00054    { "SHOW_DOCUMENT_FRAGMENT", DOM::NodeFilter::SHOW_DOCUMENT_FRAGMENT, DontDelete|ReadOnly, 0, 0 },
00055    { 0, 0, 0, 0, 0 },
00056    { "SHOW_CDATA_SECTION", DOM::NodeFilter::SHOW_CDATA_SECTION, DontDelete|ReadOnly, 0, &NodeFilterConstructorTableEntries[22] },
00057    { "SHOW_ATTRIBUTE", DOM::NodeFilter::SHOW_ATTRIBUTE, DontDelete|ReadOnly, 0, &NodeFilterConstructorTableEntries[20] },
00058    { "SHOW_TEXT", DOM::NodeFilter::SHOW_TEXT, DontDelete|ReadOnly, 0, 0 },
00059    { "SHOW_COMMENT", DOM::NodeFilter::SHOW_COMMENT, DontDelete|ReadOnly, 0, &NodeFilterConstructorTableEntries[21] },
00060    { "SHOW_DOCUMENT", DOM::NodeFilter::SHOW_DOCUMENT, DontDelete|ReadOnly, 0, 0 },
00061    { "SHOW_DOCUMENT_TYPE", DOM::NodeFilter::SHOW_DOCUMENT_TYPE, DontDelete|ReadOnly, 0, 0 },
00062    { "SHOW_NOTATION", DOM::NodeFilter::SHOW_NOTATION, DontDelete|ReadOnly, 0, 0 }
00063 };
00064 
00065 const struct HashTable NodeFilterConstructorTable = { 2, 23, NodeFilterConstructorTableEntries, 17 };
00066 
00067 }; // namespace
00068 
00069 using namespace KJS;
00070 
00071 namespace KJS {
00072 
00073 const struct HashEntry DOMNodeFilterProtoTableEntries[] = {
00074    { "acceptNode", DOMNodeFilter::AcceptNode, DontDelete|Function, 0, 0 }
00075 };
00076 
00077 const struct HashTable DOMNodeFilterProtoTable = { 2, 1, DOMNodeFilterProtoTableEntries, 1 };
00078 
00079 }; // namespace
00080 
00081 using namespace KJS;
00082 
00083 namespace KJS {
00084 
00085 const struct HashEntry DOMTreeWalkerTableEntries[] = {
00086    { 0, 0, 0, 0, 0 },
00087    { "filter", DOMTreeWalker::Filter, DontDelete|ReadOnly, 0, &DOMTreeWalkerTableEntries[6] },
00088    { "root", DOMTreeWalker::Root, DontDelete|ReadOnly, 0, 0 },
00089    { "whatToShow", DOMTreeWalker::WhatToShow, DontDelete|ReadOnly, 0, &DOMTreeWalkerTableEntries[5] },
00090    { 0, 0, 0, 0, 0 },
00091    { "expandEntityReferences", DOMTreeWalker::ExpandEntityReferences, DontDelete|ReadOnly, 0, 0 },
00092    { "currentNode", DOMTreeWalker::CurrentNode, DontDelete, 0, 0 }
00093 };
00094 
00095 const struct HashTable DOMTreeWalkerTable = { 2, 7, DOMTreeWalkerTableEntries, 5 };
00096 
00097 }; // namespace
00098 
00099 using namespace KJS;
00100 
00101 namespace KJS {
00102 
00103 const struct HashEntry DOMTreeWalkerProtoTableEntries[] = {
00104    { "firstChild", DOMTreeWalker::FirstChild, DontDelete|Function, 0, 0 },
00105    { 0, 0, 0, 0, 0 },
00106    { "previousSibling", DOMTreeWalker::PreviousSibling, DontDelete|Function, 0, &DOMTreeWalkerProtoTableEntries[8] },
00107    { "lastChild", DOMTreeWalker::LastChild, DontDelete|Function, 0, 0 },
00108    { "parentNode", DOMTreeWalker::ParentNode, DontDelete|Function, 0, &DOMTreeWalkerProtoTableEntries[7] },
00109    { 0, 0, 0, 0, 0 },
00110    { 0, 0, 0, 0, 0 },
00111    { "nextSibling", DOMTreeWalker::NextSibling, DontDelete|Function, 0, &DOMTreeWalkerProtoTableEntries[9] },
00112    { "previousNode", DOMTreeWalker::PreviousNode, DontDelete|Function, 0, 0 },
00113    { "nextNode", DOMTreeWalker::NextNode, DontDelete|Function, 0, 0 }
00114 };
00115 
00116 const struct HashTable DOMTreeWalkerProtoTable = { 2, 10, DOMTreeWalkerProtoTableEntries, 7 };
00117 
00118 }; // namespace
KDE Logo
This file is part of the documentation for kdelibs Version 3.1.0.
Documentation copyright © 1996-2002 the KDE developers.
Generated on Wed Oct 8 12:22:41 2003 by doxygen 1.2.18 written by Dimitri van Heesch, © 1997-2001