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
|
#ifndef GROWBUF_H
#define GROWBUF_H
#include <stdlib.h>
#include <string.h>
#define GROW_AMOUNT 1024
/** Class representing a string buffer optimised for growing. */
class GrowBuf
{
public:
GrowBuf() : m_str(0), m_pos(0), m_len(0) {}
GrowBuf(uint initialSize) : m_pos(0), m_len(initialSize) { m_str=(char*)malloc(m_len); }
~GrowBuf() { free(m_str); }
void reserve(uint size) { if (m_len<size) { m_len = size; m_str = (char*)realloc(m_str,m_len); } }
void clear() { m_pos=0; }
void addChar(char c) { if (m_pos>=m_len) { m_len+=GROW_AMOUNT; m_str = (char*)realloc(m_str,m_len); }
m_str[m_pos++]=c;
}
void addStr(const QCString &s) {
if (!s.isEmpty())
{
uint l=s.length();
if (m_pos+l>=m_len) { m_len+=l+GROW_AMOUNT; m_str = (char*)realloc(m_str,m_len); }
strcpy(&m_str[m_pos],s.data());
m_pos+=l;
}
}
void addStr(const char *s) {
if (s)
{
uint l=(uint)strlen(s);
if (m_pos+l>=m_len) { m_len+=l+GROW_AMOUNT; m_str = (char*)realloc(m_str,m_len); }
strcpy(&m_str[m_pos],s);
m_pos+=l;
}
}
void addStr(const char *s,uint n) {
if (s)
{
uint l=(uint)strlen(s);
if (n<l) l=n;
if (m_pos+l>=m_len) { m_len+=l+GROW_AMOUNT; m_str = (char*)realloc(m_str,m_len); }
strncpy(&m_str[m_pos],s,n);
m_pos+=l;
}
}
const char *get() { return m_str; }
uint getPos() const { return m_pos; }
void setPos(uint newPos) { m_pos = newPos; }
char at(uint i) const { return m_str[i]; }
private:
char *m_str;
uint m_pos;
uint m_len;
};
#endif
|
