summaryrefslogtreecommitdiffstats
path: root/WebCore/platform/text/StringBuilder.cpp
blob: 1c4712930e4f6aff717ff7af19938972a1626d96 (plain)
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
/*
 * Copyright (C) 2008 Apple Inc. All rights reserved.
 * Copyright (C) Research In Motion Limited 2010. 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.
 * 3.  Neither the name of Apple Computer, Inc. ("Apple") nor the names of
 *     its contributors may be used to endorse or promote products derived
 *     from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "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 OR ITS 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 "StringBuilder.h"

#include <wtf/text/StringBuffer.h>

namespace WebCore {

void StringBuilder::append(const String& string)
{
    if (string.isNull())
        return;

    if (m_totalLength == UINT_MAX)
        m_totalLength = string.length();
    else
        m_totalLength += string.length();

    if (!string.isEmpty())
        m_strings.append(string);
}

void StringBuilder::append(UChar c)
{
    if (m_totalLength == UINT_MAX)
        m_totalLength = 1;
    else
        m_totalLength += 1;

    m_strings.append(String(&c, 1));
}

void StringBuilder::append(char c)
{
    if (m_totalLength == UINT_MAX)
        m_totalLength = 1;
    else
        m_totalLength += 1;

    m_strings.append(String(&c, 1));
}

String StringBuilder::toString(ConcatMode mode) const
{
    if (isNull())
        return String();

    unsigned count = m_strings.size();

    if (!count)
        return String(StringImpl::empty());
    if (count == 1)
        return m_strings[0];

    UChar* buffer;
    unsigned totalLength = m_totalLength;
    if (mode == ConcatAddingSpacesBetweenIndividualStrings)
        totalLength += count - 1;
    String result = String::createUninitialized(totalLength, buffer);

    UChar* p = buffer;

    // We could handle both Concat modes in a single for loop, not doing that for performance reasons.
    if (mode == ConcatUnaltered) {
        for (unsigned i = 0; i < count; ++i) {
            StringImpl* string = m_strings[i].impl();
            unsigned length = string->length(); 
            memcpy(p, string->characters(), length * 2);
            p += length;
        }
    } else {
        ASSERT(mode == ConcatAddingSpacesBetweenIndividualStrings);
        for (unsigned i = 0; i < count; ++i) {
            StringImpl* string = m_strings[i].impl();
            unsigned length = string->length(); 
            memcpy(p, string->characters(), length * 2);
            p += length;

            // Add space after string before the start of the next string, if we're not processing the last string.
            if (i < count - 1) {
                *p = ' ';
                ++p;
            }
        }
    }
    ASSERT(p == totalLength + buffer);

    return result;
}

void StringBuilder::clear()
{
    m_totalLength = UINT_MAX;
    m_strings.clear();
}

unsigned StringBuilder::length() const
{
    if (m_totalLength == UINT_MAX)
        return 0;
    return m_totalLength;
}

}