| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2008 Apple Inc. All Rights Reserved. | 2 * Copyright (C) 2008 Apple Inc. All Rights Reserved. |
| 3 * Copyright (C) 2010 Google, Inc. All Rights Reserved. | 3 * Copyright (C) 2010 Google, Inc. All Rights Reserved. |
| 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 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
| (...skipping 158 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 169 // | 169 // |
| 170 // The main failures in the approximation are as follows: | 170 // The main failures in the approximation are as follows: |
| 171 // | 171 // |
| 172 // * The first set of character tokens emitted for a <pre> element might | 172 // * The first set of character tokens emitted for a <pre> element might |
| 173 // contain an extra leading newline. | 173 // contain an extra leading newline. |
| 174 // * The replacement of U+0000 with U+FFFD will not be sensitive to the | 174 // * The replacement of U+0000 with U+FFFD will not be sensitive to the |
| 175 // tree builder's insertion mode. | 175 // tree builder's insertion mode. |
| 176 // * CDATA sections in foreign content will be tokenized as bogus comments | 176 // * CDATA sections in foreign content will be tokenized as bogus comments |
| 177 // instead of as character tokens. | 177 // instead of as character tokens. |
| 178 // | 178 // |
| 179 void updateStateFor(const AtomicString& tagName); | 179 void updateStateFor(const String& tagName); |
| 180 | 180 |
| 181 bool forceNullCharacterReplacement() const { return m_forceNullCharacterRepl
acement; } | 181 bool forceNullCharacterReplacement() const { return m_forceNullCharacterRepl
acement; } |
| 182 void setForceNullCharacterReplacement(bool value) { m_forceNullCharacterRepl
acement = value; } | 182 void setForceNullCharacterReplacement(bool value) { m_forceNullCharacterRepl
acement = value; } |
| 183 | 183 |
| 184 bool shouldAllowCDATA() const { return m_shouldAllowCDATA; } | 184 bool shouldAllowCDATA() const { return m_shouldAllowCDATA; } |
| 185 void setShouldAllowCDATA(bool value) { m_shouldAllowCDATA = value; } | 185 void setShouldAllowCDATA(bool value) { m_shouldAllowCDATA = value; } |
| 186 | 186 |
| 187 State state() const { return m_state; } | 187 State state() const { return m_state; } |
| 188 void setState(State state) { m_state = state; } | 188 void setState(State state) { m_state = state; } |
| 189 | 189 |
| (...skipping 94 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 284 // token (e.g., when lexing script). We buffer the name of the end tag | 284 // token (e.g., when lexing script). We buffer the name of the end tag |
| 285 // token here so we remember it next time we re-enter the tokenizer. | 285 // token here so we remember it next time we re-enter the tokenizer. |
| 286 Vector<LChar, 32> m_bufferedEndTagName; | 286 Vector<LChar, 32> m_bufferedEndTagName; |
| 287 | 287 |
| 288 HTMLParserOptions m_options; | 288 HTMLParserOptions m_options; |
| 289 }; | 289 }; |
| 290 | 290 |
| 291 } | 291 } |
| 292 | 292 |
| 293 #endif | 293 #endif |
| OLD | NEW |