1 /*
2 * Copyright (C) 2006 Zack Rusin <zack@kde.org>
3 * Copyright (C) 2007-2009 Torch Mobile, Inc. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
15 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
17 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
18 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
19 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
20 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
21 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
22 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27 #include "config.h"
28 #include "TextBoundaries.h"
29
30 #include "NotImplemented.h"
31 #include "PlatformString.h"
32
33 using namespace WTF::Unicode;
34
35 namespace WebCore {
36
findNextWordFromIndex(const UChar * buffer,int len,int position,bool forward)37 int findNextWordFromIndex(const UChar* buffer, int len, int position, bool forward)
38 {
39 notImplemented();
40 return 0;
41 }
42
findWordBoundary(const UChar * buffer,int len,int position,int * start,int * end)43 void findWordBoundary(const UChar* buffer, int len, int position, int* start, int* end)
44 {
45 if (position > len) {
46 *start = 0;
47 *end = 0;
48 return;
49 }
50
51 String str(buffer, len);
52
53 int currentPosition = position - 1;
54 String foundWord;
55 while (currentPosition >= 0 && isLetter(str[currentPosition])) {
56 UChar c = str[currentPosition];
57 foundWord.insert(&c, 1, 0);
58 --currentPosition;
59 }
60
61 // currentPosition == 0 means the first char is not letter
62 // currentPosition == -1 means we reached the beginning
63 int startPos = (currentPosition < 0) ? 0 : ++currentPosition;
64 currentPosition = position;
65 while (isLetter(str[currentPosition])) {
66 foundWord.append(str[currentPosition]);
67 ++currentPosition;
68 }
69
70 *start = startPos;
71 *end = currentPosition;
72 }
73
74 }
75