summaryrefslogtreecommitdiff
path: root/aapl/rope.h
blob: 7a5e7b58bc55a729b8bad0405662e5257109130e (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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
/*
 * Copyright 2016 Adrian Thurston <thurston@colm.net>
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to
 * deal in the Software without restriction, including without limitation the
 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
 * sell copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

#ifndef _AAPL_ROPE_H
#define _AAPL_ROPE_H

#include <string.h>
#include <iostream>
#include <stdio.h>

struct RopeBlock
{
	static const int BLOCK_SZ = 8192;

	RopeBlock()
	:
		size(BLOCK_SZ),
		hoff(0),
		toff(0)
	{
	}

	int size;
	int hoff;
	int toff;
	RopeBlock *next;
};

struct Rope
{
	Rope()
	:
		hblk(0),
		tblk(0),
		ropeLen(0)
	{
	}

	/* Write to the tail block, at tail offset. */
	RopeBlock *hblk;
	RopeBlock *tblk;

	/* Number of bytes in rope. */
	int ropeLen;

	RopeBlock *allocateBlock( int supporting )
	{
		int size = ( supporting > RopeBlock::BLOCK_SZ ) ? supporting : RopeBlock::BLOCK_SZ;
		char *bd = new char[sizeof(RopeBlock) + size];
		RopeBlock *block = (RopeBlock*) bd;
		block->size = size;
		block->hoff = 0;
		block->toff = 0;
		block->next = 0;
		return block;
	}

	char *data( RopeBlock *rb )
		{ return (char*)rb + sizeof( RopeBlock ) + rb->hoff; }
	
	char *writeTo( RopeBlock *rb )
		{ return (char*)rb + sizeof( RopeBlock ) + rb->toff; }

	int length( RopeBlock *rb )
		{ return rb->toff - rb->hoff; }
	
	int length()
		{ return ropeLen; }

	int available( RopeBlock *rb )
		{ return rb->size - rb->toff; }

	char *append( const char *src, int len )
	{
		if ( tblk == 0 ) {
			/* There are no blocks. */
			hblk = tblk = allocateBlock( len );
		}
		else {
			int avail = available( tblk );

			/* Move to the next block? */
			if ( len > avail ) {
				RopeBlock *block = allocateBlock( len );
				tblk->next = block;
				tblk = block;
			}
		}

		char *ret = writeTo(tblk);
		tblk->toff += len;
		ropeLen += len;

		if ( src != 0 )
			memcpy( ret, src, len );
		return ret;
	}

	char *appendBlock( int len )
	{
		if ( tblk == 0 ) {
			/* There are no blocks. */
			hblk = tblk = allocateBlock( len );
		}
		else {
			RopeBlock *block = allocateBlock( len );
			tblk->next = block;
			tblk = block;
		}

		char *ret = writeTo(tblk);
		tblk->toff += len;
		ropeLen += len;
		return ret;
	}

	/* Transfer data from other. Leaves it empty. */
	void append( Rope &other )
	{
		if ( hblk == 0 ) {
			transfer( other );
		}
		else if ( other.hblk == 0 ) {
			/* nothing to do, other list empty. */
		}
		else {
			tblk->next = other.hblk;
			tblk = other.tblk;
			ropeLen += other.ropeLen;
		}

		other.abandon();
	}

	void empty()
	{
		RopeBlock *blk = hblk;
		while ( blk != 0 ) {
			RopeBlock *next = blk->next;
			delete[] (char*)blk;
			blk = next;
		}

		hblk = 0;
		tblk = 0;
		ropeLen = 0;
	}

	void abandon()
	{
		hblk = 0;
		tblk = 0;
		ropeLen = 0;
	}

	void transfer( Rope &from )
	{
		empty();

		this->hblk = from.hblk;
		this->tblk = from.tblk;
		this->ropeLen = from.ropeLen;

		from.hblk = from.tblk = 0;
		from.ropeLen = 0;
	}
};


/*
 * StringStream for appending to streams with an ostream.
 */
struct RopeOutBuf
:
	public std::streambuf
{
	RopeOutBuf( Rope &r )
	:
		r(r)
	{
	}

	int_type overflow( int_type c )
	{
		if ( c != EOF ) {
			char z = c;
			r.append( &z, 1 );
		}
		return c;
	}

	std::streamsize xsputn( const char *data, std::streamsize num )
	{
		r.append( data, num );
		return num;
	}

	Rope &r;
};

struct RopeStream
:
	public std::ostream
{
	RopeStream( Rope &r )
	:
		std::ostream( 0 ),
		buf( r )
	{
		rdbuf( &buf );
	}

	RopeOutBuf buf;
};


#endif