d.)
>
> There's one good reason to avoid catch(...): on Win32 it interferes with
> system exceptions handling. If someone uses __try/__catch/__finally,
> these won't be called after throw; and also it won't be possible
> to fix and continue system exception.
>
> I
e.
> Small note: the source code contains some tabs. Boost requirement is to use
> spaces only.
>
I forgot. Now should be everything OK.
S pozdravom,
Jano
P.S. I will be on holiday next week.
--
Jan Gaspar | [EMAIL PROTECTED]
Whitest
Hi Pavel,
I agree with most of your comments.
>
> 2. in function cb_iterator::operator -(), shouldn't it be std::less instead
> of less? (actually I do not see why < isn't enough here).
I call less() just because efficiency reasons. If I called operator < it would
result in unnecessary calls
pt
one special case when the capacity == 0).
Regards,
Jan
--
Jan Gaspar | [EMAIL PROTECTED]
Whitestein Technologies | www.whitestein.com
Panenska 28 | SK-81103 Bratislava | Slovak Republic
Tel +421(2)5930-0735 | Fax +421(2)5443-5512
___
Unsubscribe &a
could present result as (nonresizable) vector<>
>
> Alternatives are simple but much more CPU/memory expensive.
>
> /Pavel
>
> _______
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
--
Jan Gaspar | [EMA
re the semantics of inserting a huge sequence to
> the middle of a circular buffer? What exactly gets kept?
>
> Nigel
>
> ___
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
--
Jan Gaspar | [EMAIL PROTECT
functions like insert/erase cannot use
>reverse iterators (similarly to standard
>containers).
>
>Some structures like LRU could find use for it.
>
I don't want to bother with this.
>
> --
>
> "Jan Gaspar&
when buffer is being saved to file or written to socket
> - special purpose adaptor could present result as (nonresizable) vector<>
>
> Alternatives are simple but much more CPU/memory expensive.
>
> /Pavel
>
> ___________
> Unsubscribe
gt;
> Daryle
>
> ___
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
--
Jan Gaspar | [EMAIL PROTECTED]
Whitestein Technologies | www.whitestein.com
Panenska 28 | SK-81103 Bratislava | Slovak Republic
Tel +421(2)5930
rom some other file, or should I simply
> hand-edit it?
>
> Cheers,
>
> Nigel
>
> ___
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
--
Jan Gaspar | [EMAIL PROTECTED]
Whitestein Technologies | www
uff(new_size, begin(), pos);
buff.insert(buff.end(), first, last);
buff.insert(buff.end(), pos, end());
m_buff.swap(buff);
} else {
m_buff.insert(pos, first, last);
}
}
};
Regards,
Jan
--
Jan Gaspar | [EMAIL PROTECTED]
Whitestein
Hi all Cyclics!
I want to summarize what we have till now. What should be changed in the proposed
cyclic_buffer.
- Rename to circular_buffer.
- Add push_front() and pop_front().
- resize() to behave similarly to vector::resize().
- change_capacity() becomes again change_capacity(). I think the
Hi Howard!
Howard Hinnant wrote:
> For the general container I propose that insert reallocates if size()
> would exceed capacity (invalidating all iterators, pointers and
> references). And if size() does not exceed capacity, all iterators,
> pointers and references are still invalidated, unless
> }
>}
>
>change_capacity(size_type new_cap)
>{
> if (new_cap > c.capacity())
> c.reserve(new_cap);
> else if (new_cap < c.capacity())
> {
> c.erase(c.begin(), c.begin() + c.size() - new_cap);
> Container t
vector and keep only first n items.
>
> - change_capacity() becomes reserve()
>
> For consistency with std::vector.
>
> Otherwise, should cyclic_buffer be named cyclic_fifo ?
>
> Cheers, and thanks for being open to input and r
Hi Nigel,
Nigel Stewart wrote:
>
> So the issue here seems to be whether a cyclic_buffer
> should be circular-list-like or FIFO-like. Given
> that there is already a queue container adapter,
> perhaps it's worth listing some applications
> of cyclic_buffer
st code?
>
> Thanks
>
> Paul
>
> Paul A Bristow, Prizet Farmhouse, Kendal, Cumbria, LA8 8AB UK
> +44 1539 561830 Mobile +44 7714 33 02 04
> Mobile mailto:[EMAIL PROTECTED]
> mailto:[EMAIL PROTECTED]
>
> | -Original Message-
> | From: [EMAIL PROTEC
ECTED]
>
> | -Original Message-
> | From: [EMAIL PROTECTED]
> | [mailto:[EMAIL PROTECTED] Behalf Of Jan Gaspar
> | Sent: Wednesday, June 04, 2003 10:49 AM
> | To: [EMAIL PROTECTED]
> | Subject: [boost] Review Request: cyclic_buffer
> |
> |
> | Hi all!
> |
>
TED]
>
> | -Original Message-
> | From: [EMAIL PROTECTED]
> | [mailto:[EMAIL PROTECTED] Behalf Of Jan Gaspar
> | Sent: Wednesday, June 04, 2003 10:49 AM
> | To: [EMAIL PROTECTED]
> | Subject: [boost] Review Request: cyclic_buffer
> |
> |
> | Hi all!
> |
&g
Hi all!
The cyclic buffer implementation and documentation (cyclic_buffer.zip) can be
found at:
http://groups.yahoo.com/group/boost/files/
Regards,
Jan
--
Jan Gaspar | [EMAIL PROTECTED]
Whitestein Technologies | www.whitestein.com
Panenska 28 | SK-81103 Bratislava | Slovak Republic
Tel +421(2
Rob Stewart wrote:
> From: Jan Gaspar <[EMAIL PROTECTED]>
> >
> > This is something different - it is an iterator; if it reaches an end of the
>container it shifts to its beginning. Cyclic buffer is a
> > container with different capabilities. I can send it to y
21 matches
Mail list logo
