| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright 2005 Maksim Orlovich <maksim@kde.org> | 2 * Copyright 2005 Maksim Orlovich <maksim@kde.org> |
| 3 * Copyright (C) 2006 Apple Computer, Inc. | 3 * Copyright (C) 2006 Apple Computer, 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 61 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 72 static Parser* current() { return currentParser; } | 72 static Parser* current() { return currentParser; } |
| 73 | 73 |
| 74 int lex(void* yylval); | 74 int lex(void* yylval); |
| 75 | 75 |
| 76 RawPtrWillBeMember<Expression> m_topExpr; | 76 RawPtrWillBeMember<Expression> m_topExpr; |
| 77 bool m_gotNamespaceError; | 77 bool m_gotNamespaceError; |
| 78 | 78 |
| 79 void registerParseNode(ParseNode*); | 79 void registerParseNode(ParseNode*); |
| 80 void unregisterParseNode(ParseNode*); | 80 void unregisterParseNode(ParseNode*); |
| 81 | 81 |
| 82 void registerPredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate>
>*); | 82 void registerPredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate>>
*); |
| 83 void deletePredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate> >*
); | 83 void deletePredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate>>*)
; |
| 84 | 84 |
| 85 void registerExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expression
> >*); | 85 void registerExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expression
>>*); |
| 86 void deleteExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expression>
>*); | 86 void deleteExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expression>>
*); |
| 87 | 87 |
| 88 void registerString(String*); | 88 void registerString(String*); |
| 89 void deleteString(String*); | 89 void deleteString(String*); |
| 90 | 90 |
| 91 void registerNodeTest(Step::NodeTest*); | 91 void registerNodeTest(Step::NodeTest*); |
| 92 void deleteNodeTest(Step::NodeTest*); | 92 void deleteNodeTest(Step::NodeTest*); |
| 93 | 93 |
| 94 private: | 94 private: |
| 95 bool isBinaryOperatorContext() const; | 95 bool isBinaryOperatorContext() const; |
| 96 | 96 |
| (...skipping 16 matching lines...) Expand all Loading... |
| 113 | 113 |
| 114 static Parser* currentParser; | 114 static Parser* currentParser; |
| 115 | 115 |
| 116 unsigned m_nextPos; | 116 unsigned m_nextPos; |
| 117 String m_data; | 117 String m_data; |
| 118 int m_lastTokenType; | 118 int m_lastTokenType; |
| 119 RefPtrWillBeMember<XPathNSResolver> m_resolver; | 119 RefPtrWillBeMember<XPathNSResolver> m_resolver; |
| 120 | 120 |
| 121 #if !ENABLE(OILPAN) | 121 #if !ENABLE(OILPAN) |
| 122 HashSet<ParseNode*> m_parseNodes; | 122 HashSet<ParseNode*> m_parseNodes; |
| 123 HashSet<Vector<OwnPtr<Predicate> >*> m_predicateVectors; | 123 HashSet<Vector<OwnPtr<Predicate>>*> m_predicateVectors; |
| 124 HashSet<Vector<OwnPtr<Expression> >*> m_expressionVectors; | 124 HashSet<Vector<OwnPtr<Expression>>*> m_expressionVectors; |
| 125 HashSet<OwnPtr<Step::NodeTest> > m_nodeTests; | 125 HashSet<OwnPtr<Step::NodeTest>> m_nodeTests; |
| 126 #endif | 126 #endif |
| 127 HashSet<OwnPtr<String> > m_strings; | 127 HashSet<OwnPtr<String>> m_strings; |
| 128 }; | 128 }; |
| 129 | 129 |
| 130 } // namespace XPath | 130 } // namespace XPath |
| 131 | 131 |
| 132 } // namespace blink | 132 } // namespace blink |
| 133 | 133 |
| 134 int xpathyyparse(blink::XPath::Parser*); | 134 int xpathyyparse(blink::XPath::Parser*); |
| 135 #endif | 135 #endif |
| OLD | NEW |