/* Automatically generated from /tmp/buildd/tde-packaging/arch/tde-core/tde-tdelibs/src/tdelibs-trinity-14.1.6/tdehtml/ecma/kjs_traversal.cpp using /tmp/buildd/tde-packaging/arch/tde-core/tde-tdelibs/src/tdelibs-trinity-14.1.6/kjs/create_hash_table. DO NOT EDIT ! */

#include "lookup.h"

using namespace KJS;

namespace KJS {

static const char DOMNodeIteratorTableStrings[] = {
    "\0"
    "expandEntityReferences\0"
    "whatToShow\0"
    "filter\0"
    "root\0"
};


static const struct HashEntry DOMNodeIteratorTableEntries[] = {
   { 0, 0, 0, 0, -1 },
   { 35, (short)DOMNodeIterator::Filter, DontDelete|ReadOnly, 0, -1 },
   { 42, (short)DOMNodeIterator::Root, DontDelete|ReadOnly, 0, -1 },
   { 24, (short)DOMNodeIterator::WhatToShow, DontDelete|ReadOnly, 0, 5 },
   { 0, 0, 0, 0, -1 },
   { 1, (short)DOMNodeIterator::ExpandEntityReferences, DontDelete|ReadOnly, 0, -1 }
};

const struct HashTable DOMNodeIteratorTable = { 2, 6, DOMNodeIteratorTableEntries, 5, DOMNodeIteratorTableStrings};

} // namespace

#include "lookup.h"

using namespace KJS;

namespace KJS {

static const char DOMNodeIteratorProtoTableStrings[] = {
    "\0"
    "previousNode\0"
    "nextNode\0"
    "detach\0"
};


static const struct HashEntry DOMNodeIteratorProtoTableEntries[] = {
   { 14, (short)DOMNodeIterator::NextNode, DontDelete|Function, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 1, (short)DOMNodeIterator::PreviousNode, DontDelete|Function, 0, 3 },
   { 23, (short)DOMNodeIterator::Detach, DontDelete|Function, 0, -1 }
};

const struct HashTable DOMNodeIteratorProtoTable = { 2, 4, DOMNodeIteratorProtoTableEntries, 3, DOMNodeIteratorProtoTableStrings};

} // namespace

#include "lookup.h"

using namespace KJS;

namespace KJS {

static const char NodeFilterConstructorTableStrings[] = {
    "\0"
    "SHOW_PROCESSING_INSTRUCTION\0"
    "SHOW_DOCUMENT_FRAGMENT\0"
    "SHOW_ENTITY_REFERENCE\0"
    "SHOW_CDATA_SECTION\0"
    "SHOW_DOCUMENT_TYPE\0"
    "SHOW_ATTRIBUTE\0"
    "FILTER_ACCEPT\0"
    "FILTER_REJECT\0"
    "SHOW_DOCUMENT\0"
    "SHOW_NOTATION\0"
    "SHOW_COMMENT\0"
    "SHOW_ELEMENT\0"
    "FILTER_SKIP\0"
    "SHOW_ENTITY\0"
    "SHOW_TEXT\0"
    "SHOW_ALL\0"
};


static const struct HashEntry NodeFilterConstructorTableEntries[] = {
   { 1, (short)DOM::NodeFilter::SHOW_PROCESSING_INSTRUCTION, DontDelete|ReadOnly, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 196, (short)DOM::NodeFilter::SHOW_ELEMENT, DontDelete|ReadOnly, 0, 17 },
   { 243, (short)DOM::NodeFilter::SHOW_ALL, DontDelete|ReadOnly, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 141, (short)DOM::NodeFilter::FILTER_REJECT, DontDelete|ReadOnly, 0, -1 },
   { 221, (short)DOM::NodeFilter::SHOW_ENTITY, DontDelete|ReadOnly, 0, -1 },
   { 209, (short)DOM::NodeFilter::FILTER_SKIP, DontDelete|ReadOnly, 0, 18 },
   { 52, (short)DOM::NodeFilter::SHOW_ENTITY_REFERENCE, DontDelete|ReadOnly, 0, -1 },
   { 127, (short)DOM::NodeFilter::FILTER_ACCEPT, DontDelete|ReadOnly, 0, 19 },
   { 0, 0, 0, 0, -1 },
   { 29, (short)DOM::NodeFilter::SHOW_DOCUMENT_FRAGMENT, DontDelete|ReadOnly, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 74, (short)DOM::NodeFilter::SHOW_CDATA_SECTION, DontDelete|ReadOnly, 0, 22 },
   { 112, (short)DOM::NodeFilter::SHOW_ATTRIBUTE, DontDelete|ReadOnly, 0, 20 },
   { 233, (short)DOM::NodeFilter::SHOW_TEXT, DontDelete|ReadOnly, 0, -1 },
   { 183, (short)DOM::NodeFilter::SHOW_COMMENT, DontDelete|ReadOnly, 0, 21 },
   { 155, (short)DOM::NodeFilter::SHOW_DOCUMENT, DontDelete|ReadOnly, 0, -1 },
   { 93, (short)DOM::NodeFilter::SHOW_DOCUMENT_TYPE, DontDelete|ReadOnly, 0, -1 },
   { 169, (short)DOM::NodeFilter::SHOW_NOTATION, DontDelete|ReadOnly, 0, -1 }
};

const struct HashTable NodeFilterConstructorTable = { 2, 23, NodeFilterConstructorTableEntries, 17, NodeFilterConstructorTableStrings};

} // namespace

#include "lookup.h"

using namespace KJS;

namespace KJS {

static const char DOMNodeFilterProtoTableStrings[] = {
    "\0"
    "acceptNode\0"
};


static const struct HashEntry DOMNodeFilterProtoTableEntries[] = {
   { 1, (short)DOMNodeFilter::AcceptNode, DontDelete|Function, 0, -1 }
};

const struct HashTable DOMNodeFilterProtoTable = { 2, 1, DOMNodeFilterProtoTableEntries, 1, DOMNodeFilterProtoTableStrings};

} // namespace

#include "lookup.h"

using namespace KJS;

namespace KJS {

static const char DOMTreeWalkerTableStrings[] = {
    "\0"
    "expandEntityReferences\0"
    "currentNode\0"
    "whatToShow\0"
    "filter\0"
    "root\0"
};


static const struct HashEntry DOMTreeWalkerTableEntries[] = {
   { 0, 0, 0, 0, -1 },
   { 47, (short)DOMTreeWalker::Filter, DontDelete|ReadOnly, 0, 6 },
   { 54, (short)DOMTreeWalker::Root, DontDelete|ReadOnly, 0, -1 },
   { 36, (short)DOMTreeWalker::WhatToShow, DontDelete|ReadOnly, 0, 5 },
   { 0, 0, 0, 0, -1 },
   { 1, (short)DOMTreeWalker::ExpandEntityReferences, DontDelete|ReadOnly, 0, -1 },
   { 24, (short)DOMTreeWalker::CurrentNode, DontDelete, 0, -1 }
};

const struct HashTable DOMTreeWalkerTable = { 2, 7, DOMTreeWalkerTableEntries, 5, DOMTreeWalkerTableStrings};

} // namespace

#include "lookup.h"

using namespace KJS;

namespace KJS {

static const char DOMTreeWalkerProtoTableStrings[] = {
    "\0"
    "previousSibling\0"
    "previousNode\0"
    "nextSibling\0"
    "firstChild\0"
    "parentNode\0"
    "lastChild\0"
    "nextNode\0"
};


static const struct HashEntry DOMTreeWalkerProtoTableEntries[] = {
   { 42, (short)DOMTreeWalker::FirstChild, DontDelete|Function, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 1, (short)DOMTreeWalker::PreviousSibling, DontDelete|Function, 0, 8 },
   { 64, (short)DOMTreeWalker::LastChild, DontDelete|Function, 0, -1 },
   { 53, (short)DOMTreeWalker::ParentNode, DontDelete|Function, 0, 7 },
   { 0, 0, 0, 0, -1 },
   { 0, 0, 0, 0, -1 },
   { 30, (short)DOMTreeWalker::NextSibling, DontDelete|Function, 0, 9 },
   { 17, (short)DOMTreeWalker::PreviousNode, DontDelete|Function, 0, -1 },
   { 74, (short)DOMTreeWalker::NextNode, DontDelete|Function, 0, -1 }
};

const struct HashTable DOMTreeWalkerProtoTable = { 2, 10, DOMTreeWalkerProtoTableEntries, 7, DOMTreeWalkerProtoTableStrings};

} // namespace
