使用lua_next()遍历表

转自:http://hi.baidu.com/bitbull/blog/item/bc27581eca1886f61bd5768e.html

问题概要: 用lua写了个函数,返回的是一个表.需要在C里对返回的表里元素做二次处理.

在C里我们可以通过lua_gettable()或者lua_rawget()来获取表里元素值,但使用这两个接口的前提是你得知道key,它才能给你value. 当然对于顺序下标倒无所谓,但恰巧这次我用到的是关联数组,下标是无规则字符串.这时候如何遍历出表里元素就是个问题.

lua_next()就成了比较合适的选择.画了下图对整个逻辑做了解释

上图对简单的表遍历做了介绍, 但事实上的情况是我返回了一个二维表,如果你了解了lua_next()的处理过程,那下面的代码看起来就没什么问题了.

t_idx = lua_gettop(L);

lua_pushnil(L);

while (lua_next(L, t_idx))

{

printf("============================\n");

it_idx = lua_gettop(L);

lua_pushnil(L);

while(lua_next(L, it_idx))

{

printf("%s\n", lua_tostring(L, -1));

lua_pop(L, 1);

}

lua_pop(L, 1);

}

本文仅起个抛砖引玉的作用, 实际上lua的栈逻辑基本就是这样.其他接口的调用方式也很类似.

1.参数压栈

2.call 函数

3.返回值位于栈顶

4.pop返回值

附加例子

例子转自: http://blog.sina.com.cn/s/blog_4e45aa000100msvx.html

在C中遍历脚本中的table主要是通过lua c api lua_next来完成
具体实践如下:

代码如下:
#include <stdio.h>
#include "lua.h"
#include "lualib.h"
#include "lauxlib.h"

int table_next(lua_State *L, int i,char **k, char **v)
{
<wbr><wbr><wbr><wbr><wbr><wbr><wbr> if ( lua_next(L, i) !=0 )<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> {<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr> *k = (char *)lua_tostring(L, -2);<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr> *v = (char *)lua_tostring(L, -1);<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr> lua_pop(L, 1);<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr> return 1;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> }<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> else<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr> return 0;<br> }<br><br> int main(void)<br> {<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> lua_State *L;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> int t_idx;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> char *k= NULL;<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> char *v= NULL;<br><br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> L = lua_open();<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> luaL_openlibs(L);<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> luaL_loadfile(L, "luatest.lua");<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> lua_pcall(L,0,0,0);<br><br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> lua_getglobal(L,"testtab");<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> t_idx = lua_gettop(L);<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> lua_pushnil(L);<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> while( table_next(L,1,&amp;k,&amp;v) != 0)<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> {<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr><wbr> fprintf(stderr, "k[%s]-v[%s]\n",k,v);<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> }<br><br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> lua_close(L);<br><wbr><wbr><wbr><wbr><wbr><wbr><wbr> return 1;<br> }<br> 脚本代码为:<br> [opensource@localhost ppt]$ cat luatest.lua<br> testtab={<br> MsgCode = "1",<br> Host = "127.0.0.1",<br> abc = "test",<br> id=100,<br> }<br> print("ok")<br></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr></wbr>

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值