| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> | 2 * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> |
| 3 * Copyright (C) 2006, 2009 Apple Inc. | 3 * Copyright (C) 2006, 2009 Apple Inc. |
| 4 * | 4 * |
| 5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
| 6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
| 7 * are met: | 7 * are met: |
| 8 * | 8 * |
| 9 * 1. Redistributions of source code must retain the above copyright | 9 * 1. Redistributions of source code must retain the above copyright |
| 10 * notice, this list of conditions and the following disclaimer. | 10 * notice, this list of conditions and the following disclaimer. |
| (...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 52 | 52 |
| 53 class NodeTest { | 53 class NodeTest { |
| 54 WTF_MAKE_FAST_ALLOCATED; | 54 WTF_MAKE_FAST_ALLOCATED; |
| 55 public: | 55 public: |
| 56 enum Kind { | 56 enum Kind { |
| 57 TextNodeTest, CommentNodeTest, ProcessingInstructionNodeTest, AnyNod
eTest, NameTest | 57 TextNodeTest, CommentNodeTest, ProcessingInstructionNodeTest, AnyNod
eTest, NameTest |
| 58 }; | 58 }; |
| 59 | 59 |
| 60 NodeTest(Kind kind) : m_kind(kind) { } | 60 NodeTest(Kind kind) : m_kind(kind) { } |
| 61 NodeTest(Kind kind, const String& data) : m_kind(kind), m_data(data) { } | 61 NodeTest(Kind kind, const String& data) : m_kind(kind), m_data(data) { } |
| 62 NodeTest(Kind kind, const String& data, const String& namespaceURI) : m_
kind(kind), m_data(data), m_namespaceURI(namespaceURI) { } | 62 NodeTest(Kind kind, const AtomicString& data, const AtomicString& namesp
aceURI) : m_kind(kind), m_data(data), m_namespaceURI(namespaceURI) { } |
| 63 | 63 |
| 64 NodeTest(const NodeTest& o) | 64 NodeTest(const NodeTest& o) |
| 65 : m_kind(o.m_kind) | 65 : m_kind(o.m_kind) |
| 66 , m_data(o.m_data) | 66 , m_data(o.m_data) |
| 67 , m_namespaceURI(o.m_namespaceURI) | 67 , m_namespaceURI(o.m_namespaceURI) |
| 68 { | 68 { |
| 69 ASSERT(o.m_mergedPredicates.isEmpty()); | 69 ASSERT(o.m_mergedPredicates.isEmpty()); |
| 70 } | 70 } |
| 71 NodeTest& operator=(const NodeTest& o) | 71 NodeTest& operator=(const NodeTest& o) |
| 72 { | 72 { |
| (...skipping 43 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 116 Vector<OwnPtr<Predicate> > m_predicates; | 116 Vector<OwnPtr<Predicate> > m_predicates; |
| 117 }; | 117 }; |
| 118 | 118 |
| 119 void optimizeStepPair(Step*, Step*, bool& dropSecondStep); | 119 void optimizeStepPair(Step*, Step*, bool& dropSecondStep); |
| 120 | 120 |
| 121 } // namespace XPath | 121 } // namespace XPath |
| 122 | 122 |
| 123 } // namespace WebCore | 123 } // namespace WebCore |
| 124 | 124 |
| 125 #endif // XPathStep_h | 125 #endif // XPathStep_h |
| OLD | NEW |