@@ -88,7 +88,7 @@ class EmbeddedQueue
8888 }
8989
9090 inline bool
91- queue_flush (unsigned *cmd, double *x, double *y)
91+ queue_pop (unsigned *cmd, double *x, double *y)
9292 {
9393 if (queue_nonempty ())
9494 {
@@ -159,7 +159,7 @@ class PathNanRemover : protected EmbeddedQueue<4>
159159 if (m_has_curves)
160160 {
161161 /* This is the slow method for when there might be curves. */
162- if (queue_flush (&code, x, y))
162+ if (queue_pop (&code, x, y))
163163 {
164164 return code;
165165 }
@@ -216,7 +216,7 @@ class PathNanRemover : protected EmbeddedQueue<4>
216216 }
217217 }
218218
219- if (queue_flush (&code, x, y))
219+ if (queue_pop (&code, x, y))
220220 {
221221 return code;
222222 }
@@ -567,7 +567,7 @@ class PathSimplifier : protected EmbeddedQueue<9>
567567 the queue before proceeding to the main loop below.
568568 -- Michael Droettboom */
569569
570- if (queue_flush (&cmd, x, y))
570+ if (queue_pop (&cmd, x, y))
571571 {
572572 return cmd;
573573 }
@@ -740,7 +740,7 @@ class PathSimplifier : protected EmbeddedQueue<9>
740740
741741 /* Return the first item in the queue, if any, otherwise
742742 indicate that we're done. */
743- if (queue_flush (&cmd, x, y))
743+ if (queue_pop (&cmd, x, y))
744744 {
745745 return cmd;
746746 }
0 commit comments