1
/* $Id: list.c 3553 2011-05-05 06:14:19Z nanang $ */
3
* Copyright (C) 2008-2011 Teluu Inc. (http://www.teluu.com)
4
* Copyright (C) 2003-2008 Benny Prijono <benny@prijono.org>
6
* This program is free software; you can redistribute it and/or modify
7
* it under the terms of the GNU General Public License as published by
8
* the Free Software Foundation; either version 2 of the License, or
9
* (at your option) any later version.
11
* This program is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU General Public License for more details.
16
* You should have received a copy of the GNU General Public License
17
* along with this program; if not, write to the Free Software
18
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21
#include <pj/assert.h>
25
* \page page_pjlib_samples_list_c Example: List Manipulation
27
* Below is sample program to demonstrate how to manipulate linked list.
29
* \includelineno pjlib-samples/list.c
34
// This must be the first member declared in the struct!
35
PJ_DECL_LIST_MEMBER(struct my_node);
42
struct my_node nodes[10];
47
// Initialize the list as empty.
51
for (i=0; i<10; ++i) {
53
pj_list_insert_before(&list, &nodes[i]);
56
// Iterate list nodes.
59
PJ_LOG(3,("list", "value = %d", it->value));
64
for (i=0; i<10; ++i) {
65
pj_list_erase(&nodes[i]);
68
// List must be empty by now.
69
pj_assert( pj_list_empty(&list) );