2 -- Copyright (C) 2008-2010 Matthew Wild
3 -- Copyright (C) 2008-2010 Waqas Hussain
5 -- This project is MIT/X11 licensed. Please see the
6 -- COPYING file in the source package for more information.
13 local t_insert = table.insert;
14 local select, next = select, next;
15 local unpack = table.unpack or unpack; --luacheck: ignore 113
16 local pack = table.pack or function (...) return { n = select("#", ...), ... }; end
18 -- Reverse an iterator
19 function it.reverse(f, s, var)
22 -- First call the normal iterator
24 local ret = { f(s, var) };
26 if var == nil then break; end
27 t_insert(results, 1, ret);
30 -- Then return our reverse one
31 local i,max = 0, #results;
32 return function (_results)
35 return unpack(_results[i]);
40 -- Iterate only over keys in a table
41 local function _keys_it(t, key)
42 return (next(t, key));
48 -- Iterate only over values in a table
52 key, val = next(_t, key);
57 -- Given an iterator, iterate only over unique items
58 function it.unique(f, s, var)
63 local ret = pack(f(s, var));
65 if var == nil then break; end
68 return unpack(ret, 1, ret.n);
74 --[[ Return the number of items an iterator returns ]]--
75 function it.count(f, s, var)
80 if var == nil then break; end
87 -- Return the first n items an iterator returns
88 function it.head(n, f, s, var)
90 return function (_s, _var)
99 -- Skip the first n items an iterator returns
100 function it.skip(n, f, s, var)
107 -- Return the last n items an iterator returns
108 function it.tail(n, f, s, var)
109 local results, count = {}, 0;
111 local ret = pack(f(s, var));
113 if var == nil then break; end
114 results[(count%n)+1] = ret;
118 if n > count then n = count; end
123 if pos > n then return nil; end
124 local ret = results[((count-1+pos)%n)+1];
125 return unpack(ret, 1, ret.n);
127 --return reverse(head(n, reverse(f, s, var))); -- !
130 function it.filter(filter, f, s, var)
131 if type(filter) ~= "function" then
132 local filter_value = filter;
133 function filter(x) return x ~= filter_value; end
135 return function (_s, _var)
137 repeat ret = pack(f(_s, _var));
139 until _var == nil or filter(unpack(ret, 1, ret.n));
140 return unpack(ret, 1, ret.n);
144 local function _ripairs_iter(t, key) if key > 1 then return key-1, t[key-1]; end end
145 function it.ripairs(t)
146 return _ripairs_iter, t, #t+1;
149 local function _range_iter(max, curr) if curr < max then return curr + 1; end end
150 function it.range(x, y)
151 if not y then x, y = 1, x; end -- Default to 1..x if y not given
152 return _range_iter, y, x-1;
155 -- Convert the values returned by an iterator to an array
156 function it.to_array(f, s, var)
160 if var == nil then break; end
166 -- Treat the return of an iterator as key,value pairs,
168 function it.to_table(f, s, var)
171 var, var2 = f(s, var);
172 if var == nil then break; end