• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (C) 2006 Zack Rusin <zack@kde.org>
3  *
4  * All rights reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  * 1. Redistributions of source code must retain the above copyright
10  *    notice, this list of conditions and the following disclaimer.
11  * 2. Redistributions in binary form must reproduce the above copyright
12  *    notice, this list of conditions and the following disclaimer in the
13  *    documentation and/or other materials provided with the distribution.
14  *
15  * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
16  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
18  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE COMPUTER, INC. OR
19  * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
20  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
21  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
22  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
23  * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
25  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26  */
27 
28 #include "config.h"
29 
30 #include "TextBoundaries.h"
31 #include "NotImplemented.h"
32 
33 #include <QString>
34 #include <QChar>
35 
36 #include <QDebug>
37 #include <stdio.h>
38 
39 #if QT_VERSION >= 0x040400
40 #include <qtextboundaryfinder.h>
41 
42 namespace WebCore {
43 
findNextWordFromIndex(UChar const * buffer,int len,int position,bool forward)44 int findNextWordFromIndex(UChar const* buffer, int len, int position, bool forward)
45 {
46     QString str(reinterpret_cast<QChar const*>(buffer), len);
47     QTextBoundaryFinder iterator(QTextBoundaryFinder::Word, str);
48     iterator.setPosition(position >= len ? len - 1 : position);
49     if (forward) {
50         int pos = iterator.toNextBoundary();
51         while (pos > 0) {
52             if (QChar(buffer[pos-1]).isLetterOrNumber())
53                 return pos;
54             pos = iterator.toNextBoundary();
55         }
56         return len;
57     } else {
58         int pos = iterator.toPreviousBoundary();
59         while (pos > 0) {
60             if (QChar(buffer[pos]).isLetterOrNumber())
61                 return pos;
62             pos = iterator.toPreviousBoundary();
63         }
64         return 0;
65     }
66 }
67 
findWordBoundary(UChar const * buffer,int len,int position,int * start,int * end)68 void findWordBoundary(UChar const* buffer, int len, int position, int* start, int* end)
69 {
70     QString str(reinterpret_cast<QChar const*>(buffer), len);
71     QTextBoundaryFinder iterator(QTextBoundaryFinder::Word, str);
72     iterator.setPosition(position);
73     *start = position > 0 ? iterator.toPreviousBoundary() : 0;
74     *end = position == len ? len : iterator.toNextBoundary();
75 }
76 
77 }
78 
79 #else
80 namespace WebCore {
81 
findNextWordFromIndex(UChar const * buffer,int len,int position,bool forward)82 int findNextWordFromIndex(UChar const* buffer, int len, int position, bool forward)
83 {
84     QString str(reinterpret_cast<QChar const*>(buffer), len);
85     notImplemented();
86     return 0;
87 }
88 
findWordBoundary(UChar const * buffer,int len,int position,int * start,int * end)89 void findWordBoundary(UChar const* buffer, int len, int position, int* start, int* end)
90 {
91     QString str(reinterpret_cast<QChar const*>(buffer), len);
92 
93     if (position > str.length()) {
94         *start = 0;
95         *end = 0;
96         return;
97     }
98 
99     int currentPosition = position - 1;
100     QString foundWord;
101     while (currentPosition >= 0 &&
102            str[currentPosition].isLetter()) {
103         foundWord.prepend(str[currentPosition]);
104         --currentPosition;
105     }
106 
107     // currentPosition == 0 means the first char is not letter
108     // currentPosition == -1 means we reached the beginning
109     int startPos = (currentPosition < 0) ? 0 : ++currentPosition;
110     currentPosition = position;
111     if (str[currentPosition].isLetter()) {
112             while (str[currentPosition].isLetter()) {
113                 foundWord.append(str[currentPosition]);
114                 ++currentPosition;
115             }
116     }
117 
118     *start = startPos;
119     *end = currentPosition;
120 }
121 
122 }
123 #endif
124