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 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
57 | 57 |
58 NodeTest(Kind kind) : m_kind(kind) { } | 58 NodeTest(Kind kind) : m_kind(kind) { } |
59 NodeTest(Kind kind, const String& data) : m_kind(kind), m_data(data) { } | 59 NodeTest(Kind kind, const String& data) : m_kind(kind), m_data(data) { } |
60 NodeTest(Kind kind, const AtomicString& data, const AtomicString& namesp
aceURI) : m_kind(kind), m_data(data), m_namespaceURI(namespaceURI) { } | 60 NodeTest(Kind kind, const AtomicString& data, const AtomicString& namesp
aceURI) : m_kind(kind), m_data(data), m_namespaceURI(namespaceURI) { } |
61 | 61 |
62 NodeTest(const NodeTest& o) | 62 NodeTest(const NodeTest& o) |
63 : m_kind(o.m_kind) | 63 : m_kind(o.m_kind) |
64 , m_data(o.m_data) | 64 , m_data(o.m_data) |
65 , m_namespaceURI(o.m_namespaceURI) | 65 , m_namespaceURI(o.m_namespaceURI) |
66 { | 66 { |
67 ASSERT(o.m_mergedPredicates.isEmpty()); | 67 DCHECK(o.m_mergedPredicates.isEmpty()); |
68 } | 68 } |
69 NodeTest& operator=(const NodeTest& o) | 69 NodeTest& operator=(const NodeTest& o) |
70 { | 70 { |
71 m_kind = o.m_kind; | 71 m_kind = o.m_kind; |
72 m_data = o.m_data; | 72 m_data = o.m_data; |
73 m_namespaceURI = o.m_namespaceURI; | 73 m_namespaceURI = o.m_namespaceURI; |
74 ASSERT(o.m_mergedPredicates.isEmpty()); | 74 DCHECK(o.m_mergedPredicates.isEmpty()); |
75 return *this; | 75 return *this; |
76 } | 76 } |
77 DEFINE_INLINE_TRACE() { visitor->trace(m_mergedPredicates); } | 77 DEFINE_INLINE_TRACE() { visitor->trace(m_mergedPredicates); } |
78 | 78 |
79 Kind getKind() const { return m_kind; } | 79 Kind getKind() const { return m_kind; } |
80 const AtomicString& data() const { return m_data; } | 80 const AtomicString& data() const { return m_data; } |
81 const AtomicString& namespaceURI() const { return m_namespaceURI; } | 81 const AtomicString& namespaceURI() const { return m_namespaceURI; } |
82 HeapVector<Member<Predicate>>& mergedPredicates() { return m_mergedPredi
cates; } | 82 HeapVector<Member<Predicate>>& mergedPredicates() { return m_mergedPredi
cates; } |
83 const HeapVector<Member<Predicate>>& mergedPredicates() const { return m
_mergedPredicates; } | 83 const HeapVector<Member<Predicate>>& mergedPredicates() const { return m
_mergedPredicates; } |
84 | 84 |
(...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
117 HeapVector<Member<Predicate>> m_predicates; | 117 HeapVector<Member<Predicate>> m_predicates; |
118 }; | 118 }; |
119 | 119 |
120 bool optimizeStepPair(Step*, Step*); | 120 bool optimizeStepPair(Step*, Step*); |
121 | 121 |
122 } // namespace XPath | 122 } // namespace XPath |
123 | 123 |
124 } // namespace blink | 124 } // namespace blink |
125 | 125 |
126 #endif // XPathStep_h | 126 #endif // XPathStep_h |
OLD | NEW |