Search “insque” — BetterMan

Search

Tip: Use ssh_config or systemd.unit for dotted names.

Did you mean: insb, insl, insw?

insert/remove an item from a queue

NAME insque, remque - insert/remove an item from a queue LIBRARY Standard C library ( libc ... SYNOPSIS #include   void insque(void * elem , void * prev ); void remque(void * elem …

remque(3)

insert/remove an item from a queue

NAME insque, remque - insert/remove an item from a queue LIBRARY Standard C library ( libc ... SYNOPSIS #include   void insque(void * elem , void * prev ); void remque(void * elem …

queue(7)

implementations of linked lists and queues

STAILQ_CONCAT (). SEE ALSO circleq (3), insque (3), list (3), slist (3), stailq (3), tailq

tailq_insert_tail(3)
implementation of a doubly linked tail queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```

list_insert_head(3)

implementation of a doubly linked list

INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue

stailq_insert_tail(3)
implementation of a singly linked tail queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```

list_insert_after(3)

implementation of a doubly linked list

INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue

tailq_insert_head(3)
implementation of a doubly linked tail queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```

slist_insert_head(3)

implementation of a singly linked list

INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue

list_init(3)

implementation of a doubly linked list

INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue

tailq_insert_after(3)
implementation of a doubly linked tail queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```
stailq_insert_head(3)
implementation of a singly linked tail queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```

list_insert_before(3)

implementation of a doubly linked list

INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue

slist_insert_after(3)

implementation of a singly linked list

INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue

tailq_init(3)

implementation of a doubly linked tail queue

INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue

slist_init(3)

implementation of a singly linked list

INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue

simpleq_insert_head(3)
implementation of a singly linked tail queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```
circleq_insert_tail(3)
implementation of a doubly linked circular queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```
simpleq_insert_tail(3)
implementation of a singly linked tail queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```
tailq_insert_before(3)
implementation of a doubly linked tail queue
```
INIT(&head); exit(EXIT_SUCCESS); } SEE ALSO insque (3), queue
```

20 results loaded