/* | |
* Copyright (C) 2006 Zack Rusin <zack@kde.org> | |
* Copyright (C) 2007-2009 Torch Mobile, Inc. All rights reserved. | |
* | |
* Redistribution and use in source and binary forms, with or without | |
* modification, are permitted provided that the following conditions | |
* are met: | |
* 1. Redistributions of source code must retain the above copyright | |
* notice, this list of conditions and the following disclaimer. | |
* 2. Redistributions in binary form must reproduce the above copyright | |
* notice, this list of conditions and the following disclaimer in the | |
* documentation and/or other materials provided with the distribution. | |
* | |
* THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY | |
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | |
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | |
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | |
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | |
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
*/ | |
#include "config.h" | |
#include "TextBoundaries.h" | |
#include "NotImplemented.h" | |
#include "PlatformString.h" | |
using namespace WTF::Unicode; | |
namespace WebCore { | |
int findNextWordFromIndex(const UChar * buffer, int len, int position, bool forward) | |
{ | |
notImplemented(); | |
return 0; | |
} | |
void findWordBoundary(const UChar * buffer, int len, int position, int* start, int* end) | |
{ | |
if (position > len) { | |
*start = 0; | |
*end = 0; | |
return; | |
} | |
String str(buffer, len); | |
int currentPosition = position - 1; | |
String foundWord; | |
while (currentPosition >= 0 && isLetter(str[currentPosition])) { | |
UChar c = str[currentPosition]; | |
foundWord.insert(&c, 1, 0); | |
--currentPosition; | |
} | |
// currentPosition == 0 means the first char is not letter | |
// currentPosition == -1 means we reached the beginning | |
int startPos = (currentPosition < 0) ? 0 : ++currentPosition; | |
currentPosition = position; | |
while (isLetter(str[currentPosition])) { | |
foundWord.append(str[currentPosition]); | |
++currentPosition; | |
} | |
*start = startPos; | |
*end = currentPosition; | |
} | |
} |