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
|
//
// C++ Interface: tstring
//
// Description:
//
// Copyright: See COPYING file that comes with this distribution
//
//
#ifndef __TAGSTRING__H
#define __TAGSTRING__H
#include <tqstring.h>
#include <tqvaluelist.h>
#include <utility>
#include <cassert>
using namespace std;
template <class T>
class TagString_t
{
TQString str;
typedef TQValueList<std::pair<uint,T> > taglist; // may change
taglist tags;
public:
TagString_t(const TQString& s) : str(s) {}
TagString_t() {}
bool isSimple() const { return tags.empty(); }
const TQString& string() const { return str; }
unsigned length() const { return str.length(); }
TagString_t mid(unsigned idx,unsigned len=~0) const;
TagString_t left(unsigned) const;
TagString_t right(unsigned) const;
void insert(uint,const TQString& s);
int find ( TQChar c, int index = 0, bool cs = true ) const {
return str.find(c,index,cs);
}
TagString_t& operator+=(const TagString_t& s);
typename taglist::const_iterator tagsBegin() const { return tags.begin(); }
typename taglist::const_iterator tagsEnd() const { return tags.end(); }
typename taglist::iterator tagsBegin() { return tags.begin(); }
typename taglist::iterator tagsEnd() { return tags.end(); }
void insertTag(uint pos,const T& t);
void eraseTag(const typename taglist::iterator& which) { tags.erase(which); }
/* void insert(uint idx,const TQString&);
void insert(uint idx,const char*);
void addTag(uint);
void remove(uint start,uint len);*/
};
template <class T>
TagString_t<T> TagString_t<T>::mid(unsigned idx,unsigned len) const
{
TagString_t ret(str.mid(idx,len));
unsigned max=idx+len;
if(max<idx) max=~0;
for(typename taglist::const_iterator it=tags.begin(),end=tags.end();it!=end;++it) {
if((*it).first>=idx && (*it).first<max)
ret.tags.push_back(*it);
}
return ret;
}
template <class T>
TagString_t<T> TagString_t<T>::left(unsigned len) const
{
TagString_t ret(str.left(len));
for(typename taglist::const_iterator it=tags.begin(),end=tags.end();it!=end;++it) {
if((*it).first<len)
ret.tags.push_back(*it);
}
return ret;
}
template <class T>
TagString_t<T> TagString_t<T>::right(unsigned len) const
{
TagString_t ret(str.right(len));
for(typename taglist::const_iterator it=tags.begin(),end=tags.end();it!=end;++it) {
if((*it).first>=str.length()-len)
ret.tags.push_back(*it);
}
return ret;
}
template <class T>
void TagString_t<T>::insert(uint idx,const TQString& s)
{
str.insert(idx,s);
const unsigned disp=s.length();
for(typename taglist::iterator it=tags.begin(),end=tags.end();it!=end;++it) {
if((*it).first>=idx)
(*it).first+=disp;
}
}
template <class T>
TagString_t<T>& TagString_t<T>::operator+=(const TagString_t& s)
{
str+=s.str;
const unsigned disp=length();
for(typename taglist::const_iterator it=s.tags.begin(),end=s.tags.end();it!=end;++it) {
tags.push_back(make_pair((*it).first+disp,(*it).second));
}
return *this;
}
template <class T>
void TagString_t<T>::insertTag(uint pos,const T& t)
{
assert(pos<=length());
tags.push_back(make_pair(pos,t));
}
#endif
|
