1*b1cdbd2cSJim Jagielski /************************************************************** 2*b1cdbd2cSJim Jagielski * 3*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one 4*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file 5*b1cdbd2cSJim Jagielski * distributed with this work for additional information 6*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file 7*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the 8*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance 9*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at 10*b1cdbd2cSJim Jagielski * 11*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0 12*b1cdbd2cSJim Jagielski * 13*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing, 14*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an 15*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY 16*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the 17*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations 18*b1cdbd2cSJim Jagielski * under the License. 19*b1cdbd2cSJim Jagielski * 20*b1cdbd2cSJim Jagielski *************************************************************/ 21*b1cdbd2cSJim Jagielski 22*b1cdbd2cSJim Jagielski 23*b1cdbd2cSJim Jagielski 24*b1cdbd2cSJim Jagielski #ifndef _QUEUE_HXX 25*b1cdbd2cSJim Jagielski #define _QUEUE_HXX 26*b1cdbd2cSJim Jagielski 27*b1cdbd2cSJim Jagielski #include <tools/solar.h> 28*b1cdbd2cSJim Jagielski #include <tools/contnr.hxx> 29*b1cdbd2cSJim Jagielski 30*b1cdbd2cSJim Jagielski // --------- 31*b1cdbd2cSJim Jagielski // - Queue - 32*b1cdbd2cSJim Jagielski // --------- 33*b1cdbd2cSJim Jagielski 34*b1cdbd2cSJim Jagielski #define QUEUE_ENTRY_NOTFOUND CONTAINER_ENTRY_NOTFOUND 35*b1cdbd2cSJim Jagielski 36*b1cdbd2cSJim Jagielski class Queue : private Container 37*b1cdbd2cSJim Jagielski { 38*b1cdbd2cSJim Jagielski public: 39*b1cdbd2cSJim Jagielski using Container::Clear; 40*b1cdbd2cSJim Jagielski using Container::Count; 41*b1cdbd2cSJim Jagielski using Container::GetObject; 42*b1cdbd2cSJim Jagielski using Container::GetPos; 43*b1cdbd2cSJim Jagielski Queue(sal_uInt16 _nInitSize=16,sal_uInt16 _nReSize=16)44*b1cdbd2cSJim Jagielski Queue( sal_uInt16 _nInitSize = 16, sal_uInt16 _nReSize = 16 ) : 45*b1cdbd2cSJim Jagielski Container( _nReSize, _nInitSize, _nReSize ) {} Queue(const Queue & rQueue)46*b1cdbd2cSJim Jagielski Queue( const Queue& rQueue ) : Container( rQueue ) {} 47*b1cdbd2cSJim Jagielski Put(void * p)48*b1cdbd2cSJim Jagielski void Put( void* p ) { Container::Insert( p, CONTAINER_APPEND ); } Get()49*b1cdbd2cSJim Jagielski void* Get() { return Container::Remove( (sal_uIntPtr)0 ); } 50*b1cdbd2cSJim Jagielski operator =(const Queue & rQueue)51*b1cdbd2cSJim Jagielski Queue& operator =( const Queue& rQueue ) 52*b1cdbd2cSJim Jagielski { Container::operator =( rQueue ); return *this; } 53*b1cdbd2cSJim Jagielski operator ==(const Queue & rQueue) const54*b1cdbd2cSJim Jagielski sal_Bool operator ==( const Queue& rQueue ) const 55*b1cdbd2cSJim Jagielski { return Container::operator ==( rQueue ); } operator !=(const Queue & rQueue) const56*b1cdbd2cSJim Jagielski sal_Bool operator !=( const Queue& rQueue ) const 57*b1cdbd2cSJim Jagielski { return Container::operator !=( rQueue ); } 58*b1cdbd2cSJim Jagielski }; 59*b1cdbd2cSJim Jagielski 60*b1cdbd2cSJim Jagielski // ----------------- 61*b1cdbd2cSJim Jagielski // - DECLARE_QUEUE - 62*b1cdbd2cSJim Jagielski // ----------------- 63*b1cdbd2cSJim Jagielski 64*b1cdbd2cSJim Jagielski #define DECLARE_QUEUE( ClassName, Type ) \ 65*b1cdbd2cSJim Jagielski class ClassName : private Queue \ 66*b1cdbd2cSJim Jagielski { \ 67*b1cdbd2cSJim Jagielski public: \ 68*b1cdbd2cSJim Jagielski using Queue::Clear; \ 69*b1cdbd2cSJim Jagielski using Queue::Count; \ 70*b1cdbd2cSJim Jagielski \ 71*b1cdbd2cSJim Jagielski ClassName( sal_uInt16 _nInitSize = 16, \ 72*b1cdbd2cSJim Jagielski sal_uInt16 _nReSize = 16 ) : \ 73*b1cdbd2cSJim Jagielski Queue( _nInitSize, _nReSize ) {} \ 74*b1cdbd2cSJim Jagielski ClassName( const ClassName& rClassName ) : \ 75*b1cdbd2cSJim Jagielski Queue( rClassName ) {} \ 76*b1cdbd2cSJim Jagielski \ 77*b1cdbd2cSJim Jagielski void Put( Type p ) { Queue::Put( (void*)p ); } \ 78*b1cdbd2cSJim Jagielski Type Get() { return (Type)Queue::Get(); } \ 79*b1cdbd2cSJim Jagielski \ 80*b1cdbd2cSJim Jagielski Type GetObject( sal_uIntPtr nIndex ) const \ 81*b1cdbd2cSJim Jagielski { return (Type)Queue::GetObject( nIndex ); } \ 82*b1cdbd2cSJim Jagielski sal_uIntPtr GetPos( const Type p ) const \ 83*b1cdbd2cSJim Jagielski { return Queue::GetPos( (const void*)p ); } \ 84*b1cdbd2cSJim Jagielski sal_uIntPtr GetPos( const Type p, sal_uIntPtr nStartIndex, \ 85*b1cdbd2cSJim Jagielski sal_Bool bForward = sal_True ) const \ 86*b1cdbd2cSJim Jagielski { return Queue::GetPos( (const void*)p, \ 87*b1cdbd2cSJim Jagielski nStartIndex, \ 88*b1cdbd2cSJim Jagielski bForward ); } \ 89*b1cdbd2cSJim Jagielski \ 90*b1cdbd2cSJim Jagielski ClassName& operator =( const ClassName& rClassName ) \ 91*b1cdbd2cSJim Jagielski { Queue::operator =( rClassName ); \ 92*b1cdbd2cSJim Jagielski return *this; } \ 93*b1cdbd2cSJim Jagielski \ 94*b1cdbd2cSJim Jagielski sal_Bool operator ==( const Queue& rQueue ) const \ 95*b1cdbd2cSJim Jagielski { return Queue::operator ==( rQueue ); } \ 96*b1cdbd2cSJim Jagielski sal_Bool operator !=( const Queue& rQueue ) const \ 97*b1cdbd2cSJim Jagielski { return Queue::operator !=( rQueue ); } \ 98*b1cdbd2cSJim Jagielski }; 99*b1cdbd2cSJim Jagielski 100*b1cdbd2cSJim Jagielski #endif // _QUEUE_HXX 101