Fix inadvertent "TQ" changes.

1 files changed, 5 insertions, 5 deletions

diff --git a/kpat/freecell-solver/pqueue.c b/kpat/freecell-solver/pqueue.c
index 47e6280d..0e4df49b 100644
--- a/kpat/freecell-solver/pqueue.c
+++ b/kpat/freecell-solver/pqueue.c
@@ -33,7 +33,7 @@
    the list is sorted ascending or descending... */
 
 void freecell_solver_PQueueInitialise(
-    PTQUEUE *pq,
+    PQUEUE *pq,
     int32 MaxElements
     )
 {
@@ -53,7 +53,7 @@ void freecell_solver_PQueueInitialise(
    returns TRUE if successful, FALSE if fails. (You fail by filling the pqueue.)
    PGetRating is a function which returns the rating of the item you're adding for sorting purposes */
 
-int freecell_solver_PQueuePush( PTQUEUE *pq, void *item, pq_rating_t r)
+int freecell_solver_PQueuePush( PQUEUE *pq, void *item, pq_rating_t r)
 {
     uint32 i;
     pq_element_t * Elements = pq->Elements;
@@ -83,7 +83,7 @@ int freecell_solver_PQueuePush( PTQUEUE *pq, void *item, pq_rating_t r)
         {
 
             while( ( i==PTQ_FIRST_ENTRY ?
-                     (PTQUEUE_MaxRating) /* return biggest possible rating if first element */
+                     (PQUEUE_MaxRating) /* return biggest possible rating if first element */
                      :
                      (PGetRating(Elements[ PTQ_PARENT_INDEX(i) ]) )
                    )
@@ -110,14 +110,14 @@ int freecell_solver_PQueuePush( PTQUEUE *pq, void *item, pq_rating_t r)
 #define PQueueIsEmpty(pq) ((pq)->CurrentSize == 0)
 
 /* free up memory for pqueue */
-void freecell_solver_PQueueFree( PTQUEUE *pq )
+void freecell_solver_PQueueFree( PQUEUE *pq )
 {
     free( pq->Elements );
 }
 
 /* remove the first node from the pqueue and provide a pointer to it */
 
-void *freecell_solver_PQueuePop( PTQUEUE *pq)
+void *freecell_solver_PQueuePop( PQUEUE *pq)
 {
     int32 i;
     int32 child;