Delete HTMLStackItem

sky/engine/core/html/parser/HTMLConstructionSite.h

 /*
  * Copyright (C) 2010 Google, Inc. All Rights Reserved.
  * Copyright (C) 2011 Apple Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 108 matching lines @@
 
     void processEndOfFile();
     void finishedParsing();
 
     void insertHTMLElement(AtomicHTMLToken*);
     void insertSelfClosingHTMLElement(AtomicHTMLToken*);
     void insertScriptElement(AtomicHTMLToken*);
     void insertTextNode(const String&, WhitespaceMode = WhitespaceUnknown);
 
     bool isEmpty() const { return !m_openElements.stackDepth(); }
-    HTMLElementStack::ElementRecord* currentElementRecord() const { return m_openElements.topRecord(); }
     Element* currentElement() const { return m_openElements.top(); }
     ContainerNode* currentNode() const { return m_openElements.topNode(); }
-    HTMLStackItem* currentStackItem() const { return m_openElements.topStackItem(); }
-    HTMLStackItem* oneBelowTop() const { return m_openElements.oneBelowTop(); }
     Document& ownerDocumentForCurrentNode();
     HTMLElementStack* openElements() const { return &m_openElements; }
-    bool currentIsRootNode() { return m_openElements.topNode() == m_openElements.rootNode(); }
-
-    Element* head() const { return m_head->element(); }
-    HTMLStackItem* headStackItem() const { return m_head.get(); }
 
     ParserContentPolicy parserContentPolicy() { return m_parserContentPolicy; }
 
 private:
     // In the common case, this queue will have only one task because most
     // tokens produce only one DOM mutation.
     typedef WillBeHeapVector<HTMLConstructionSiteTask, 1> TaskQueue;
 
     void attachLater(ContainerNode* parent, PassRefPtrWillBeRawPtr<Node> child, bool selfClosing = false);
 
     PassRefPtrWillBeRawPtr<HTMLElement> createHTMLElement(AtomicHTMLToken*);
     PassRefPtrWillBeRawPtr<Element> createElement(AtomicHTMLToken*, const AtomicString& namespaceURI);
 
     void queueTask(const HTMLConstructionSiteTask&);
 
     RawPtrWillBeMember<Document> m_document;
 
     // This is the root ContainerNode to which the parser attaches all newly
     // constructed nodes. It points to a DocumentFragment when parsing fragments
     // and a Document in all other cases.
     RawPtrWillBeMember<ContainerNode> m_attachmentRoot;
 
-    RefPtrWillBeMember<HTMLStackItem> m_head;
     mutable HTMLElementStack m_openElements;
 
     TaskQueue m_taskQueue;
 
     class PendingText {
         DISALLOW_ALLOCATION();
     public:
         PendingText()
             : whitespaceMode(WhitespaceUnknown)
         {
@@ skipping 41 matching lines @@
     };
 
     PendingText m_pendingText;
 
     ParserContentPolicy m_parserContentPolicy;
 };
 
 } // namespace blink
 
 #endif