OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. |
3 * Copyright (C) 2005 Alexey Proskuryakov. | 3 * Copyright (C) 2005 Alexey Proskuryakov. |
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 140 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
151 return m_words.last() & (1U << shift); | 151 return m_words.last() & (1U << shift); |
152 } | 152 } |
153 | 153 |
154 unsigned BitStack::size() const | 154 unsigned BitStack::size() const |
155 { | 155 { |
156 return m_size; | 156 return m_size; |
157 } | 157 } |
158 | 158 |
159 // -------- | 159 // -------- |
160 | 160 |
161 #if !ASSERT_DISABLED | 161 #if ASSERT_ENABLED |
162 | 162 |
163 static unsigned depthCrossingShadowBoundaries(Node* node) | 163 static unsigned depthCrossingShadowBoundaries(Node* node) |
164 { | 164 { |
165 unsigned depth = 0; | 165 unsigned depth = 0; |
166 for (Node* parent = node->parentOrShadowHostNode(); parent; parent = parent-
>parentOrShadowHostNode()) | 166 for (Node* parent = node->parentOrShadowHostNode(); parent; parent = parent-
>parentOrShadowHostNode()) |
167 ++depth; | 167 ++depth; |
168 return depth; | 168 return depth; |
169 } | 169 } |
170 | 170 |
171 #endif | 171 #endif |
(...skipping 2030 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2202 resultEnd = collapseTo; | 2202 resultEnd = collapseTo; |
2203 return; | 2203 return; |
2204 } | 2204 } |
2205 } | 2205 } |
2206 | 2206 |
2207 CharacterIterator computeRangeIterator(inputStart, inputEnd, iteratorFlagsFo
rFindPlainText); | 2207 CharacterIterator computeRangeIterator(inputStart, inputEnd, iteratorFlagsFo
rFindPlainText); |
2208 calculateCharacterSubrange(computeRangeIterator, matchStart, matchLength, re
sultStart, resultEnd); | 2208 calculateCharacterSubrange(computeRangeIterator, matchStart, matchLength, re
sultStart, resultEnd); |
2209 } | 2209 } |
2210 | 2210 |
2211 } | 2211 } |
OLD | NEW |