---

CFiFo Class Reference

A first-in first-out queue of pixels. More...

#include <FiFo.h>

Inheritance diagram for CFiFo

[legend]Collaboration diagram for CFiFo:

[legend]List of all members.

Public Methods
	CFiFo ()
	~CFiFo ()
bool	empty ()
	Check if the queue is empty.
void	add (LPPIXEL entry)
	Adding a pixel to the queue in 4 or 8 connectivity.
void	add (LPPIXEL entry, short parity)
	Adding a pixel to the queue in 6 connectivity.
void	first (LPPIXEL *p)
	Get the first pixel of the queue in 4 or 8 connectivity.
void	first (LPPIXEL *p, short *parity)
	Get the first pixel of the queue in 6 connectivity.
void	invert (void)
	invert the queue (not always possible).
Private Attributes
short	dir
deque<LPPIXEL>	queue
deque<short>	qparity

---

Detailed Description

A first-in first-out queue of pixels.

Author(s):

Laurent Najman

Date:

7/22/01

Keywords:

Queue

Version:

Id: FiFo.h,v 1.2 2001/08/28 22:00:17 laurentnajman Exp

Content:

An implementation of FiFo (first-in, first out) queue for use in morphological algorithm.

---

The documentation for this class was generated from the following file:

• FiFo.h

---