BLOG | DOCUMENTATION | TRAC

Home --> Documentations --> PJLIB Reference

Example: List Manipulation

Below is sample program to demonstrate how to manipulate linked list.

1 /* $Id: list.c 3553 2011-05-05 06:14:19Z nanang $ */
2 /*
3  * Copyright (C) 2008-2011 Teluu Inc. (http://www.teluu.com)
4  * Copyright (C) 2003-2008 Benny Prijono <benny@prijono.org>
5  *
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.
10  *
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.
15  *
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
19  */
20 #include <pj/list.h>
21 #include <pj/assert.h>
22 #include <pj/log.h>
23 
32 struct my_node
33 {
34  // This must be the first member declared in the struct!
35  PJ_DECL_LIST_MEMBER(struct my_node);
36  int value;
37 };
38 
39 
40 int main()
41 {
42  struct my_node nodes[10];
43  struct my_node list;
44  struct my_node *it;
45  int i;
46 
47  // Initialize the list as empty.
48  pj_list_init(&list);
49 
50  // Insert nodes.
51  for (i=0; i<10; ++i) {
52  nodes[i].value = i;
53  pj_list_insert_before(&list, &nodes[i]);
54  }
55 
56  // Iterate list nodes.
57  it = list.next;
58  while (it != &list) {
59  PJ_LOG(3,("list", "value = %d", it->value));
60  it = it->next;
61  }
62 
63  // Erase all nodes.
64  for (i=0; i<10; ++i) {
65  pj_list_erase(&nodes[i]);
66  }
67 
68  // List must be empty by now.
69  pj_assert( pj_list_empty(&list) );
70 
71  return 0;
72 };
void pj_list_erase(pj_list_type *node)
Assertion macro pj_assert().
#define PJ_LOG(level, arg)
Definition: log.h:107
#define pj_assert(expr)
Definition: assert.h:49
Linked List data structure.
int pj_list_empty(const pj_list_type *node)
Definition: list.h:102
void pj_list_init(pj_list_type *node)
Definition: list.h:88
Definition: pjlib-samples/list.c:32
Logging Utility.
void pj_list_insert_before(pj_list_type *pos, pj_list_type *node)

 


PJLIB Open Source, high performance, small footprint, and very very portable framework
Copyright (C) 2006-2009 Teluu Inc.