equal
deleted
inserted
replaced
190 } |
190 } |
191 |
191 |
192 m_currentMask = m_currentMask->nextMask(); |
192 m_currentMask = m_currentMask->nextMask(); |
193 } |
193 } |
194 |
194 |
195 // did we use up all the masks? |
195 // this check doesn't seem to be proper as the check is done for |
196 if(m_currentMask && m_currentMask->multitude() != kInfinite) |
196 // the partial text.Because the checkText() is called for every character input by user, |
197 return false; |
197 // there are remaining masks after complete text length has been checked, |
|
198 // that is valid case and it should not return false. |
|
199 // If text length is bigger than mask length then that case is handled within for loop |
|
200 //before this condition check. So it is redundant in current implementation |
|
201 // did we use up all the masks? |
|
202 /* if(m_currentMask && m_currentMask->multitude() != kInfinite) |
|
203 return false;*/ |
198 |
204 |
199 return (eb.m_start == -1); |
205 return (eb.m_start == -1); |
200 } |
206 } |
201 |
207 |
202 MaskBase* WebTextFormatMask::getMask(int aOffset) |
208 MaskBase* WebTextFormatMask::getMask(int aOffset) |