| cvs.gedasymbols.org/djgpp/doc/libc/libc_660.html | search | 
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] | 
#include <search.h> void remque(struct qelem *elem);  | 
This function manipulates queues built from doubly linked lists.  Each element
in the queue must be in the form of struct qelem which is defined
thus:
struct qelem {
  struct qelem *q_forw;
  struct qelem *q_back;
  char q_data[0];
}
 | 
This function removes the entry elem from a queue.
None.
| ANSI/ISO C | No | 
| POSIX | No | 
| webmaster | delorie software privacy | 
| Copyright © 2004 | Updated Apr 2004 |