1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
// Copyright (c) 2011 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/i18n/bidi_line_iterator.h"
#include "base/logging.h"
namespace base {
namespace i18n {
BiDiLineIterator::BiDiLineIterator() : bidi_(NULL) {
}
BiDiLineIterator::~BiDiLineIterator() {
if (bidi_) {
ubidi_close(bidi_);
bidi_ = NULL;
}
}
bool BiDiLineIterator::Open(const string16& text,
bool right_to_left,
bool url) {
DCHECK(!bidi_);
UErrorCode error = U_ZERO_ERROR;
bidi_ = ubidi_openSized(static_cast<int>(text.length()), 0, &error);
if (U_FAILURE(error))
return false;
if (right_to_left && url)
ubidi_setReorderingMode(bidi_, UBIDI_REORDER_RUNS_ONLY);
ubidi_setPara(bidi_, text.data(), static_cast<int>(text.length()),
right_to_left ? UBIDI_DEFAULT_RTL : UBIDI_DEFAULT_LTR,
NULL, &error);
return U_SUCCESS(error) ? true : false;
}
int BiDiLineIterator::CountRuns() {
DCHECK(bidi_ != NULL);
UErrorCode error = U_ZERO_ERROR;
const int runs = ubidi_countRuns(bidi_, &error);
return U_SUCCESS(error) ? runs : 0;
}
UBiDiDirection BiDiLineIterator::GetVisualRun(int index,
int* start,
int* length) {
DCHECK(bidi_ != NULL);
return ubidi_getVisualRun(bidi_, index, start, length);
}
void BiDiLineIterator::GetLogicalRun(int start,
int* end,
UBiDiLevel* level) {
DCHECK(bidi_ != NULL);
ubidi_getLogicalRun(bidi_, start, end, level);
}
} // namespace i18n
} // namespace base
|
