Glib实例学习(1)单链表
1:SList结构
- typedef struct _GSList GSList;
- struct _GSList
- {
- gpointer data;
- GSList *next;
- };
2: SList 原型
- GSList* g_slist_append (GSList *list,
- gpointer data) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_prepend (GSList *list,
- gpointer data) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_insert (GSList *list,
- gpointer data,
- gint position) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_insert_sorted (GSList *list,
- gpointer data,
- GCompareFunc func) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_insert_sorted_with_data (GSList *list,
- gpointer data,
- GCompareDataFunc func,
- gpointer user_data) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_insert_before (GSList *slist,
- GSList *sibling,
- gpointer data) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_concat (GSList *list1,
- GSList *list2) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_remove (GSList *list,
- gconstpointer data) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_remove_all (GSList *list,
- gconstpointer data) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_remove_link (GSList *list,
- GSList *link_) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_delete_link (GSList *list,
- GSList *link_) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_reverse (GSList *list) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_copy (GSList *list) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_nth (GSList *list,
- guint n);
- GSList* g_slist_find (GSList *list,
- gconstpointer data);
- GSList* g_slist_find_custom (GSList *list,
- gconstpointer data,
- GCompareFunc func);
- gint g_slist_position (GSList *list,
- GSList *llink);
- gint g_slist_index (GSList *list,
- gconstpointer data);
- GSList* g_slist_last (GSList *list);
- guint g_slist_length (GSList *list);
- void g_slist_foreach (GSList *list,
- GFunc func,
- gpointer user_data);
- GSList* g_slist_sort (GSList *list,
- GCompareFunc compare_func) G_GNUC_WARN_UNUSED_RESULT;
- GSList* g_slist_sort_with_data (GSList *list,
- GCompareDataFunc compare_func,
- gpointer user_data) G_GNUC_WARN_UNUSED_RESULT;
- gpointer g_slist_nth_data (GSList *list,
- guint n);
3:SList 实例
- #include <stdio.h>
- #include <stdlib.h>
- #include <time.h>
- #include <glib.h>
- #include <glib/gprintf.h>
- /*
- * g_slist_append
- * g_slist_prepend
- * g_slist_reverse
- */
- static void
- test_slist_1(void)
- {
- GSList *slist = NULL;
- GSList *st;
- gint nums[10] = {0,1,2,3,4,5,6,7,8,9};
- gint i;
- for (i = 0; i < 10; i++)
- // GSList* g_slist_append(GSList *list, gpointer data);
- slist = g_slist_append(slist, &nums[i]);
- g_printf("The result should be: 0,1,2,3,4,5,6,7,8,9\n");
- g_printf("Begin:\n");
- for (i = 0; i < 10; i++) {
- st = g_slist_nth(slist, i);
- g_printf("%d,", *(gint*)st->data);
- }
- g_printf("\nDone\n");
- // GSList* g_slist_reverse(GSList *list);
- slist = g_slist_reverse(slist);
- g_printf("The result should be: 9,8,7,6,5,4,3,2,1,0\n");
- g_printf("Begin:\n");
- for (i = 0; i < 10; i++) {
- st = g_slist_nth(slist, i);
- g_printf("%d,", *(gint*)st->data);
- }
- g_printf("\nDone\n");
- for (i = 0; i < 10; i++)
- // GSList* g_slist_prepend(GSList *list, gpointer data);
- slist = g_slist_prepend(slist, &nums[i]);
- g_printf("The result should be: 9,8,7,6,5,4,3,2,1,0,9,8,7,6,5,4,3,2,1,0\n");
- g_printf("Begin:\n");
- for (i = 0; i < 20; i++) {
- st = g_slist_nth(slist, i);
- g_printf("%d,", *(gint*)st->data);
- }
- g_printf("\nDone\n");
- g_slist_free(slist);
- }
- /*
- * g_slist_insert_before
- * g_slist_insert
- * g_slist_nth
- * g_slist_copy
- */
- static void
- test_slist_2(void)
- {
- GSList *slist = NULL;
- GSList *st;
- GSList *st2;
- gint nums[10] = {0,1,2,3,4,5,6,7,8,9};
- gint i;
- // GSList* g_slist_insert_before(GSList *slist, GSList *sibling, gpointer data);
- slist = g_slist_insert_before(NULL, NULL, &nums[1]);
- // GSList* g_slist_insert(GSList *list, gpointer data, gint position);
- slist = g_slist_insert(slist, &nums[3], 1);
- slist = g_slist_insert(slist, &nums[4], -1);
- slist = g_slist_insert(slist, &nums[0], 0);
- slist = g_slist_insert(slist, &nums[5], 100);
- slist = g_slist_insert_before(slist, NULL, &nums[6]);
- slist = g_slist_insert_before(slist, slist->next->next, &nums[2]);
- slist = g_slist_insert(slist, &nums[9], 7);
- slist = g_slist_insert(slist, &nums[8], 7);
- slist = g_slist_insert(slist, &nums[7], 7);
- g_printf("The result should be: 0,1,2,3,4,5,6,7,8,9\n");
- g_printf("Begin:\n");
- for (i = 0; i < 10; i++) {
- // GSList* g_slist_nth(GSList *list, guint n);
- st = g_slist_nth(slist, i);
- g_printf("%d,", *(gint*)st->data);
- }
- g_printf("\nDone\n");
- // GSList* g_slist_copy(GSList *list);
- st = g_slist_copy(slist);
- g_printf("The result should be: 0,1,2,3,4,5,6,7,8,9\n");
- g_printf("Begin:\n");
- for (i = 0; i < 10; i++) {
- st2 = g_slist_nth(st, i);
- g_printf("%d,", *(gint*)st2->data);
- }
- g_printf("\nDone\n");
- g_slist_free(st);
- g_slist_free(slist);
- }
- /*
- * g_slist_lenth
- * g_slist_remove
- * g_slist_remove_all
- * g_slist_last
- * g_slist_next
- */
- static void
- test_slist_3(void)
- {
- GSList *slist = NULL;
- GSList *st;
- gint nums[10] = {0,1,2,3,4,5,6,7,8,9};
- gint i;
- for (i = 0; i < 10; i++) {
- slist = g_slist_append(slist, &nums[i]);
- slist = g_slist_append(slist, &nums[i]);
- }
- // guint g_slist_lenth(GSList *list);
- g_printf("The length should be 20.\nResult:%d\n", g_slist_length(slist));
- for (i = 0; i < 10; i++)
- // GSList* g_slist_remove_all(GSList *list, gconstpointer data);
- slist = g_slist_remove_all(slist, &nums[i]);
- g_printf("The length should be 0.\nResult:%d\n", g_slist_length(slist));
- for (i = 0; i < 10; i++) {
- slist = g_slist_append(slist, &nums[i]);
- slist = g_slist_append(slist, &nums[i]);
- }
- for (i = 0; i < 10; i++)
- // GSList* g_slist_remove(GSList *list, gconstpointer data);
- slist = g_slist_remove(slist, &nums[i]);
- g_printf("The length should be 10.\nResult:%d\n", g_slist_length(slist));
- g_printf("The first should be 0.\nResult:%d\n", *(gint*)slist->data);
- // GSList* g_slist_last(GSList *list);
- g_printf("The last should be 9.\nResult:%d\n", *(gint*)g_slist_last(slist)->data);
- g_printf("The first:");
- g_printf("%d\n", *(gint*)slist->data);
- st = slist;
- for (i = 0; i < 9; i++) {
- // #define g_slist_next (slist)
- st = g_slist_next(st);
- g_printf("The next:%d\n", *(gint*)st->data);
- }
- g_slist_free(slist);
- }
- static gint
- find_num(gconstpointer l, gconstpointer data)
- {
- return *(gint*)l - GPOINTER_TO_INT(data);
- }
- /*
- * g_slist_index
- * g_slist_position
- * g_slist_find_custom
- */
- static void
- test_slist_4(void)
- {
- GSList *slist = NULL;
- GSList *st;
- gint nums[10] = {0,1,2,3,4,5,6,7,8,9};
- gint i;
- for (i = 0; i < 10; i++) {
- slist = g_slist_append(slist, &nums[i]);
- }
- // gint g_slist_index(GSList *list, gconstpointer data);
- g_printf("The index should be -1.\nResult:%d\n", g_slist_index(slist, NULL));
- // gint g_slist_position(GSList *list, GSList *llink);
- g_printf("The position should be -1.\nResult:%d\n", g_slist_position(slist, NULL));
- for (i = 0; i < 10; i++) {
- // GSList* g_slist_find_custom(GSList *list, gconstpointer data, GCompareFunc func);
- st = g_slist_find_custom(slist, GINT_TO_POINTER(i), find_num);
- g_printf("The position should be %d.\nResult:%d\n", i, g_slist_position(slist, st));
- }
- g_slist_free(slist);
- }
- #define SIZE 10
- #define NUMBER_MAX 99
- static guint32 array[SIZE];
- static gint
- sort(gconstpointer p1, gconstpointer p2)
- {
- gint32 a, b;
- a = GPOINTER_TO_INT (p1);
- b = GPOINTER_TO_INT (p2);
- return (a > b ? +1 : a == b ? 0 : -1);
- }
- static gint
- sort_r(gconstpointer p1, gconstpointer p2)
- {
- gint32 a, b;
- a = GPOINTER_TO_INT (p1);
- b = GPOINTER_TO_INT (p2);
- return (a < b ? +1 : a == b ? 0 : -1);
- }
- /*
- * g_slist_sort
- * g_slist_sort_with_data
- * g_slist_nth_data
- */
- static void
- test_slist_5(void)
- {
- GSList *slist = NULL;
- gint i;
- for (i = 0; i < SIZE; i++)
- slist = g_slist_append(slist, GINT_TO_POINTER(array[i]));
- // GSList* g_slist_sort(GSList *list, GCompareFunc compare);
- slist = g_slist_sort(slist, sort);
- g_printf("The result should be sorted.\nResult:");
- for (i = 0; i < SIZE; i++) {
- // gpointer g_slist_nth_data(GSList *list, guint n);
- gpointer p = g_slist_nth_data(slist, i);
- g_printf("%d,", GPOINTER_TO_INT(p));
- }
- g_printf("\n");
- // GSList* g_slist_sort_with_data(GSList *list, GCompareDataFunc compare_func, gpinter user_data);
- slist = g_slist_sort_with_data(slist, (GCompareDataFunc)sort_r, NULL);
- g_printf("The result should be sorted[reversed].\nResult:");
- for (i = 0; i < SIZE; i++) {
- gpointer p = g_slist_nth_data(slist, i);
- g_printf("%d,", GPOINTER_TO_INT(p));
- }
- g_printf("\n");
- g_slist_free(slist);
- }
- static void
- print(gpointer p1, gpointer p2)
- {
- g_printf("%d,", GPOINTER_TO_INT(p1));
- }
- /*
- * g_slist_insert_sorted
- * g_slist_insert_sorted_with_data
- * g_slist_concat
- * g_slist_foreach
- */
- static void
- test_slist_6(void)
- {
- GSList *slist = NULL;
- GSList *st = NULL;
- GSList *sc = NULL;
- gint i;
- for (i = 0; i < SIZE; i++) {
- // GSList* g_slist_insert_sorted(GSList *list, gpointer data, GCompareFunc func);
- slist = g_slist_insert_sorted(slist, GINT_TO_POINTER(array[i]), sort);
- // GSList* g_slist_insert_sorted_with_data(GSList *list, gpointer data,
- // GCompareDataFunc func,
- // gpinter user_data);
- st = g_slist_insert_sorted_with_data(st, GINT_TO_POINTER(array[i]),
- (GCompareDataFunc)sort_r,
- NULL);
- }
- g_printf("The result should be sorted.\nResult:");
- for (i = 0; i < SIZE; i++) {
- gpointer p = g_slist_nth_data(slist, i);
- g_printf("%d,", GPOINTER_TO_INT(p));
- }
- g_printf("\n");
- g_printf("The result should be sorted[reversed].\nResult:");
- for (i = 0; i < SIZE; i++) {
- gpointer p = g_slist_nth_data(st, i);
- g_printf("%d,", GPOINTER_TO_INT(p));
- }
- g_printf("\n");
- // GSList* g_slist_concat(GSList *list1, *list2);
- sc = g_slist_concat(slist, st);
- g_printf("The result should be concated.\nResult:");
- // void g_slist_foreach(GSList *list, GFunc func, gpointer user_data);
- g_slist_foreach(sc, (GFunc)print, NULL);
- g_printf("\n");
- g_slist_free(slist);
- g_slist_free(st);
- }
- int
- main(void)
- {
- printf("BEGIN:\n************************************************************\n");
- printf("\n------------------------------------------------------------\ntest_slist_1:\n");
- printf("------------------------------------------------------------\n");
- test_slist_1();
- printf("\n------------------------------------------------------------\ntest_slist_2:\n");
- printf("------------------------------------------------------------\n");
- test_slist_2();
- printf("\n------------------------------------------------------------\ntest_slist_3:\n");
- printf("------------------------------------------------------------\n");
- test_slist_3();
- printf("\n------------------------------------------------------------\ntest_slist_4:\n");
- printf("------------------------------------------------------------\n");
- test_slist_4();
- int i;
- srand((unsigned)time(0));
- printf("The init array is:\n");
- for (i = 0; i < SIZE; i++) {
- array[i] = rand() % (NUMBER_MAX+1);
- printf("%d,", array[i]);
- }
- printf("\n");
- printf("\n------------------------------------------------------------\ntest_slist_5:\n");
- printf("------------------------------------------------------------\n");
- test_slist_5();
- printf("\n------------------------------------------------------------\ntest_slist_6:\n");
- printf("------------------------------------------------------------\n");
- test_slist_6();
- printf("\n************************************************************\nDONE\n");
- return 0;
- }
转载自:http://blog.chinaunix.net/space.php?uid=25696269&do=blog&id=483448
转载于:https://blog.51cto.com/yifangyou/610321
Glib实例学习(1)单链表相关推荐
- Go 学习笔记(80)— Go 标准库 container/list(单链表、双链表)
列表是一种非连续存储的容器,由多个节点组成,节点通过一些变量记录彼此之间的关系.列表有多种实现方法,如单链表.双链表等. 在 Go 语言中,将列表使用 container/list 包来实现,内部 ...
- 数据结构(08)— 线性单链表基本操作
1. 线性单链表数据结构 // 假定每个结点的类型用 SNode 表示 typedef struct SNodeTag {int data; // 所存储的数据元素SNodeTag *next; // ...
- 数据结构(05)— 线性单链表实战
1. 设计思路 本项目的实质是完成对考生信息的建立.查找.插入.修改.删除等功能,可以首先定义项目的数据结构,然后将每个功能写成一个函数来完成对数据的操作,最后完成主函数以验证各个函数功能并得出运行结 ...
- 带头节点单链表的增删改查
单链表有很多结构循环单链表,有头节点的单链表,无头节点的单链表,双节点单链表,以下源码是以有一个头节点的单链表为例写的增删改查的各种功能,就是下图 然后各个注释也在函数后面写着,这玩意确实还挺难,源码 ...
- 数据结构--单链表(数组)
文章目录 单链表 单链表 用数组实现的单链表可以在任意位置插入.删除.替换一个数,相比于用结构体和指针实现的动态链表而言,数组模拟链表运行的速度非常快,动态链表基本会出现超时的现象.但缺点是浪费内存 ...
- 数据结构和算法:(3)3.2.2单链表的整表删除
我们不使用这个单链表时,我们需要把他在内存中释放掉,以便于流出空间给其他程序和软件使用. 单链表整表删除的算法思路如下: 声明结点p和q: 将第一个结点赋值给p,下一个结点(也就是第一个结点的下一个结 ...
- 数据结构和算法:(3)3.2.1单链表的整表创建
对于顺序存储结构的线性表的整表创建,我们可以用数组的初始化来直观理解.(因为之前说过我们线性表的顺序存储结构呢事实上也就是在数组的基础上加多一个变量来存储当前线性表的长度构成的一个结构,所以我们用数组 ...
- 数据结构与算法(2-2)线性表之链式存储(单链表、静态链表、循环链表、双向循环链表)
目录 一.单链表 1.存储方式 2.插入 3.删除 总代码: 二.静态链表 1.存储方式 2.插入 3.删除 4.遍历 总代码: 三.循环链表 总代码: 四.双向循环链表 1.存储方式: 2.插入和删 ...
- 删除单链表中的重复节点(c语言版本)
这是一道经典的面试题,下面是我的研究和举一反三,特整理如下: 分为三种情形: (1)删除有序链表的重复节点,重复节点一个都不留 (2)删除有序链表的重复节点,重复节点只留一个 (3)删除无序链表的重复 ...
- C语言的单链表求交点
单链表求交点,问题如下: 使用o(1)的空间复杂度,求两个链表相交的时候的交点,这个思想就类似于使用o(1)的空间复杂度和o(n)的时间复杂度来求链表的第k个节点. 过程如下: 获取两个链表的长度 将 ...
最新文章
- java 前端基础知识_【计算机·知识】关于前端的计算机基础知识
- 海量数据处理:从并发编程到分布式系统
- C++运算符重载形式--成员函数or友元函数?
- java中的localDate类_java8-LocalDate类
- 主从复制1062错误的解决方法
- 本文将引导你使用XNA Game Studio Express一步一步地创建一个简单的游戏
- python zipfile模块 ZIP64
- 企业实战03:Oracle数据库_用户和表空间
- c++里面的内联函数
- [Ext JS]Grid的列过滤
- Android数据库hibernate框架
- 全新的移动界面设计素材
- IOS UIScrollView中 使用 touch 无法响应的问题
- 函数r语言_[R learning]-0006-R语言的基本函数
- linux sleeping进程多_你知道Linux进程的睡眠和唤醒操作?
- 拼音模糊查询+java,拼音模糊查询实现
- FreeCAD源码分析:Path模块
- mcu AD采样值和物理值
- linux查显卡型号_Windows/Linux下怎么查看笔记本显卡型号
- 【UnblockNeteaseMusic】代理网易云后隐藏NODE代理窗口方法