{
template<>
- sat::detail::CQueue * rwcowClone<sat::detail::CQueue>( const sat::detail::CQueue * rhs )
+ struct ::_Queue * rwcowClone<struct ::_Queue>( const struct ::_Queue * rhs )
{
- sat::detail::CQueue * ret = new sat::detail::CQueue;
- ::queue_init_clone( ret, const_cast<sat::detail::CQueue *>(rhs) );
+ struct ::_Queue * ret = new ::_Queue;
+ ::queue_init_clone( ret, const_cast<struct ::_Queue *>(rhs) );
return ret;
}
{
Queue::Queue()
- : _pimpl( new detail::CQueue )
+ : _pimpl( new ::_Queue )
{ ::queue_init( _pimpl.get() ); }
Queue::~Queue()
Queue::value_type Queue::pop_front()
{ return ::queue_shift( _pimpl.get() ); }
- Queue::operator detail::CQueue *() // COW: nonconst version can't be inlined
- { return _pimpl.get(); } // without exposing detail::CQueue
+ Queue::operator struct ::_Queue *() // COW: nonconst version can't be inlined
+ { return _pimpl.get(); } // without exposing struct ::_Queue
std::ostream & operator<<( std::ostream & str, const Queue & obj )
{ return dumpRangeLine( str << "Queue ", obj.begin(), obj.end() ); }
bool operator==( const Queue & lhs, const Queue & rhs )
{
- const detail::CQueue * l = lhs;
- const detail::CQueue * r = rhs;
+ const struct ::_Queue * l = lhs;
+ const struct ::_Queue * r = rhs;
return( l == r || ( l->count == r->count && ::memcmp( l->elements, r->elements, l->count ) == 0 ) );
}