Dynamic buffer management question - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>Programming - 葵花宝典

Dynamic buffer management question

Dynamic buffer management question# Programming - 葵花宝典

s*v2008-05-08 07:05

1 楼

I'm looking for the best possible solution to this problem:
My class maintains a dynamic buffer that outside callers can write into.
Callers may write in anything with any size. So my buffer has to grow
dynamically. What's the best way to maintain this buffer so that heap
allocation cost is minimized?
Or: a completely different implementation strategy/thinking recommendation
is
also welcome.
Thanks.

h*e2008-05-08 07:05

2 楼

use a linked list, each node has a address pointing to the start of big
chunk of contiguous memory of size N. Whenever it needs to grow, just
allocate another chunk of memory of size N and append a new node having the
starting address to the linked list.

【在 s*v 的大作中提到】

: I'm looking for the best possible solution to this problem:
: My class maintains a dynamic buffer that outside callers can write into.
: Callers may write in anything with any size. So my buffer has to grow
: dynamically. What's the best way to maintain this buffer so that heap
: allocation cost is minimized?
: Or: a completely different implementation strategy/thinking recommendation
: is
: also welcome.
: Thanks.

b*n2008-05-08 07:05

3 楼

but writing anything of any size ...

the

【在 h****e 的大作中提到】

: use a linked list, each node has a address pointing to the start of big
: chunk of contiguous memory of size N. Whenever it needs to grow, just
: allocate another chunk of memory of size N and append a new node having the
: starting address to the linked list.