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 static const char DOMNodeIteratorTableStrings[] = {
00008     "\0"
00009     "expandEntityReferences\0"
00010     "whatToShow\0"
00011     "filter\0"
00012     "root\0"
00013 };
00014 
00015 
00016 static const struct HashEntry DOMNodeIteratorTableEntries[] = {
00017    { 0, 0, 0, 0, -1 },
00018    { 35, DOMNodeIterator::Filter, DontDelete|ReadOnly, 0, -1 },
00019    { 42, DOMNodeIterator::Root, DontDelete|ReadOnly, 0, -1 },
00020    { 24, DOMNodeIterator::WhatToShow, DontDelete|ReadOnly, 0, 5 },
00021    { 0, 0, 0, 0, -1 },
00022    { 1, DOMNodeIterator::ExpandEntityReferences, DontDelete|ReadOnly, 0, -1 }
00023 };
00024 
00025 const struct HashTable DOMNodeIteratorTable = { 2, 6, DOMNodeIteratorTableEntries, 5, DOMNodeIteratorTableStrings};
00026 
00027 } // namespace
00028 
00029 using namespace KJS;
00030 
00031 namespace KJS {
00032 
00033 static const char DOMNodeIteratorProtoTableStrings[] = {
00034     "\0"
00035     "previousNode\0"
00036     "nextNode\0"
00037     "detach\0"
00038 };
00039 
00040 
00041 static const struct HashEntry DOMNodeIteratorProtoTableEntries[] = {
00042    { 14, DOMNodeIterator::NextNode, DontDelete|Function, 0, -1 },
00043    { 0, 0, 0, 0, -1 },
00044    { 1, DOMNodeIterator::PreviousNode, DontDelete|Function, 0, 3 },
00045    { 23, DOMNodeIterator::Detach, DontDelete|Function, 0, -1 }
00046 };
00047 
00048 const struct HashTable DOMNodeIteratorProtoTable = { 2, 4, DOMNodeIteratorProtoTableEntries, 3, DOMNodeIteratorProtoTableStrings};
00049 
00050 } // namespace
00051 
00052 using namespace KJS;
00053 
00054 namespace KJS {
00055 
00056 static const char NodeFilterConstructorTableStrings[] = {
00057     "\0"
00058     "SHOW_PROCESSING_INSTRUCTION\0"
00059     "SHOW_DOCUMENT_FRAGMENT\0"
00060     "SHOW_ENTITY_REFERENCE\0"
00061     "SHOW_CDATA_SECTION\0"
00062     "SHOW_DOCUMENT_TYPE\0"
00063     "SHOW_ATTRIBUTE\0"
00064     "FILTER_ACCEPT\0"
00065     "FILTER_REJECT\0"
00066     "SHOW_DOCUMENT\0"
00067     "SHOW_NOTATION\0"
00068     "SHOW_COMMENT\0"
00069     "SHOW_ELEMENT\0"
00070     "FILTER_SKIP\0"
00071     "SHOW_ENTITY\0"
00072     "SHOW_TEXT\0"
00073     "SHOW_ALL\0"
00074 };
00075 
00076 
00077 static const struct HashEntry NodeFilterConstructorTableEntries[] = {
00078    { 1, DOM::NodeFilter::SHOW_PROCESSING_INSTRUCTION, DontDelete|ReadOnly, 0, -1 },
00079    { 0, 0, 0, 0, -1 },
00080    { 0, 0, 0, 0, -1 },
00081    { 196, DOM::NodeFilter::SHOW_ELEMENT, DontDelete|ReadOnly, 0, 17 },
00082    { 243, DOM::NodeFilter::SHOW_ALL, DontDelete|ReadOnly, 0, -1 },
00083    { 0, 0, 0, 0, -1 },
00084    { 0, 0, 0, 0, -1 },
00085    { 0, 0, 0, 0, -1 },
00086    { 141, DOM::NodeFilter::FILTER_REJECT, DontDelete|ReadOnly, 0, -1 },
00087    { 221, DOM::NodeFilter::SHOW_ENTITY, DontDelete|ReadOnly, 0, -1 },
00088    { 209, DOM::NodeFilter::FILTER_SKIP, DontDelete|ReadOnly, 0, 18 },
00089    { 52, DOM::NodeFilter::SHOW_ENTITY_REFERENCE, DontDelete|ReadOnly, 0, -1 },
00090    { 127, DOM::NodeFilter::FILTER_ACCEPT, DontDelete|ReadOnly, 0, 19 },
00091    { 0, 0, 0, 0, -1 },
00092    { 29, DOM::NodeFilter::SHOW_DOCUMENT_FRAGMENT, DontDelete|ReadOnly, 0, -1 },
00093    { 0, 0, 0, 0, -1 },
00094    { 74, DOM::NodeFilter::SHOW_CDATA_SECTION, DontDelete|ReadOnly, 0, 22 },
00095    { 112, DOM::NodeFilter::SHOW_ATTRIBUTE, DontDelete|ReadOnly, 0, 20 },
00096    { 233, DOM::NodeFilter::SHOW_TEXT, DontDelete|ReadOnly, 0, -1 },
00097    { 183, DOM::NodeFilter::SHOW_COMMENT, DontDelete|ReadOnly, 0, 21 },
00098    { 155, DOM::NodeFilter::SHOW_DOCUMENT, DontDelete|ReadOnly, 0, -1 },
00099    { 93, DOM::NodeFilter::SHOW_DOCUMENT_TYPE, DontDelete|ReadOnly, 0, -1 },
00100    { 169, DOM::NodeFilter::SHOW_NOTATION, DontDelete|ReadOnly, 0, -1 }
00101 };
00102 
00103 const struct HashTable NodeFilterConstructorTable = { 2, 23, NodeFilterConstructorTableEntries, 17, NodeFilterConstructorTableStrings};
00104 
00105 } // namespace
00106 
00107 using namespace KJS;
00108 
00109 namespace KJS {
00110 
00111 static const char DOMNodeFilterProtoTableStrings[] = {
00112     "\0"
00113     "acceptNode\0"
00114 };
00115 
00116 
00117 static const struct HashEntry DOMNodeFilterProtoTableEntries[] = {
00118    { 1, DOMNodeFilter::AcceptNode, DontDelete|Function, 0, -1 }
00119 };
00120 
00121 const struct HashTable DOMNodeFilterProtoTable = { 2, 1, DOMNodeFilterProtoTableEntries, 1, DOMNodeFilterProtoTableStrings};
00122 
00123 } // namespace
00124 
00125 using namespace KJS;
00126 
00127 namespace KJS {
00128 
00129 static const char DOMTreeWalkerTableStrings[] = {
00130     "\0"
00131     "expandEntityReferences\0"
00132     "currentNode\0"
00133     "whatToShow\0"
00134     "filter\0"
00135     "root\0"
00136 };
00137 
00138 
00139 static const struct HashEntry DOMTreeWalkerTableEntries[] = {
00140    { 0, 0, 0, 0, -1 },
00141    { 47, DOMTreeWalker::Filter, DontDelete|ReadOnly, 0, 6 },
00142    { 54, DOMTreeWalker::Root, DontDelete|ReadOnly, 0, -1 },
00143    { 36, DOMTreeWalker::WhatToShow, DontDelete|ReadOnly, 0, 5 },
00144    { 0, 0, 0, 0, -1 },
00145    { 1, DOMTreeWalker::ExpandEntityReferences, DontDelete|ReadOnly, 0, -1 },
00146    { 24, DOMTreeWalker::CurrentNode, DontDelete, 0, -1 }
00147 };
00148 
00149 const struct HashTable DOMTreeWalkerTable = { 2, 7, DOMTreeWalkerTableEntries, 5, DOMTreeWalkerTableStrings};
00150 
00151 } // namespace
00152 
00153 using namespace KJS;
00154 
00155 namespace KJS {
00156 
00157 static const char DOMTreeWalkerProtoTableStrings[] = {
00158     "\0"
00159     "previousSibling\0"
00160     "previousNode\0"
00161     "nextSibling\0"
00162     "firstChild\0"
00163     "parentNode\0"
00164     "lastChild\0"
00165     "nextNode\0"
00166 };
00167 
00168 
00169 static const struct HashEntry DOMTreeWalkerProtoTableEntries[] = {
00170    { 42, DOMTreeWalker::FirstChild, DontDelete|Function, 0, -1 },
00171    { 0, 0, 0, 0, -1 },
00172    { 1, DOMTreeWalker::PreviousSibling, DontDelete|Function, 0, 8 },
00173    { 64, DOMTreeWalker::LastChild, DontDelete|Function, 0, -1 },
00174    { 53, DOMTreeWalker::ParentNode, DontDelete|Function, 0, 7 },
00175    { 0, 0, 0, 0, -1 },
00176    { 0, 0, 0, 0, -1 },
00177    { 30, DOMTreeWalker::NextSibling, DontDelete|Function, 0, 9 },
00178    { 17, DOMTreeWalker::PreviousNode, DontDelete|Function, 0, -1 },
00179    { 74, DOMTreeWalker::NextNode, DontDelete|Function, 0, -1 }
00180 };
00181 
00182 const struct HashTable DOMTreeWalkerProtoTable = { 2, 10, DOMTreeWalkerProtoTableEntries, 7, DOMTreeWalkerProtoTableStrings};
00183 
00184 } // namespace
KDE Home | KDE Accessibility Home | Description of Access Keys