1.1 --- a/PrivateQueue.h	Tue Jul 23 07:28:22 2013 -0700
     1.2 +++ b/PrivateQueue.h	Sat Jul 27 13:10:10 2013 -0700
     1.3 @@ -8,7 +8,7 @@
     1.4  #ifndef _PRIVATE_QUEUE_H
     1.5  #define	_PRIVATE_QUEUE_H
     1.6  
     1.7 -#include "PR__common_includes/PR__primitive_data_types.h"
     1.8 +#include <PR__include/PR__primitive_data_types.h>
     1.9  
    1.10  #define TRUE     1
    1.11  #define FALSE    0
    1.12 @@ -17,27 +17,5 @@
    1.13  #define UNLOCKED 0
    1.14  
    1.15  
    1.16 -/* It is the data that is shared so only need one mutex. */
    1.17 -typedef struct
    1.18 - { void      **insertPos;
    1.19 -   void      **extractPos;
    1.20 -   void      **startOfData;  //data is pointers
    1.21 -   void      **endOfData;    //set when alloc data
    1.22 - }
    1.23 -PrivQueueStruc;
    1.24 -
    1.25 -typedef void  (*DynArrayFnPtr)  ( void * );  //fn has to cast void *
    1.26 -
    1.27 -PrivQueueStruc*  makePrivQ ( );
    1.28 -bool32           isEmptyPrivQ ( PrivQueueStruc *Q ); //ret TRUE if empty
    1.29 -void*            peekPrivQ ( PrivQueueStruc *Q ); //ret NULL if empty
    1.30 -void*            readPrivQ ( PrivQueueStruc *Q ); //ret NULL if empty
    1.31 -void             writePrivQ( void *in, PrivQueueStruc *Q );
    1.32 -                    //return false when full
    1.33 -bool32           writeIfSpacePrivQ( void * in, PrivQueueStruc* Q );
    1.34 -int32            numInPrivQ( PrivQueueStruc *Q );
    1.35 -void             pushPrivQ( void * in, PrivQueueStruc* Q );
    1.36 -void             freePrivQ( PrivQueueStruc *Q );
    1.37 -
    1.38  #endif	/* _PRIVATE_QUEUE_H */
    1.39