Merge branch 'diagonal_platforms' of https://github.com/Montandalar/advtrains - advtrains.git

diff options

author	Gabriel Pérez-Cerezo <gabriel@gpcf.eu>	2020-03-15 12:04:10 +0100
committer	Gabriel Pérez-Cerezo <gabriel@gpcf.eu>	2020-03-15 12:04:10 +0100
commit	fb837a449af3bc3f5d70b10d807fc53982520e9f (patch)
tree	01775ba838aa648b0450d9af1714df62b6296b78 /advtrains_itrainmap/depends.txt
parent	372cd7eb802934a4b567f61c84dc634ee1a463dd (diff)
parent	301dcf953e9a73d0e92f1a48af141200891f0e55 (diff)
download	advtrains-fb837a449af3bc3f5d70b10d807fc53982520e9f.tar.gz advtrains-fb837a449af3bc3f5d70b10d807fc53982520e9f.tar.bz2 advtrains-fb837a449af3bc3f5d70b10d807fc53982520e9f.zip

Merge branch 'diagonal_platforms' of https://github.com/Montandalar/advtrainsrelease-2.1.2

Diffstat (limited to 'advtrains_itrainmap/depends.txt')

0 files changed, 0 insertions, 0 deletions

--- Lua module to serialize values as Lua code. -- From: https://github.com/fab13n/metalua/blob/no-dll/src/lib/serialize.lua -- License: MIT -- @copyright 2006-2997 Fabien Fleutot <metalua@gmail.com> -- @author Fabien Fleutot <metalua@gmail.com> -- @author ShadowNinja <shadowninja@minetest.net> -------------------------------------------------------------------------------- --- Serialize an object into a source code string. This string, when passed as -- an argument to deserialize(), returns an object structurally identical to -- the original one. The following are currently supported: -- * Booleans, numbers, strings, and nil. -- * Functions; uses interpreter-dependent (and sometimes platform-dependent) bytecode! -- * Tables; they can cantain multiple references and can be recursive, but metatables aren't saved. -- This works in two phases: -- 1. Recursively find and record multiple references and recursion. -- 2. Recursively dump the value into a string. -- @param x Value to serialize (nil is allowed). -- @return load()able string containing the value. function core.serialize(x) local local_index = 1 -- Top index of the "_" local table in the dump -- table->nil/1/2 set of tables seen. -- nil = not seen, 1 = seen once, 2 = seen multiple times. local seen = {} -- nest_points are places where a table appears within itself, directly -- or not. For instance, all of these chunks create nest points in -- table x: "x = {}; x[x] = 1", "x = {}; x[1] = x", -- "x = {}; x[1] = {y = {x}}". -- To handle those, two tables are used by mark_nest_point: -- * nested - Transient set of tables being currently traversed. -- Used for detecting nested tables. -- * nest_points - parent->{key=value, ...} table cantaining the nested -- keys and values in the parent. They're all dumped after all the -- other table operations have been performed. -- -- mark_nest_point(p, k, v) fills nest_points with information required -- to remember that key/value (k, v) creates a nest point in table -- parent. It also marks "parent" and the nested item(s) as occuring -- multiple times, since several references to it will be required in -- order to patch the nest points. local nest_points = {} local nested = {} local function mark_nest_point(parent, k, v) local nk, nv = nested[k], nested[v] local np = nest_points[parent] if not np then np = {} nest_points[parent] = np end np[k] = v seen[parent] = 2 if nk then seen[k] = 2 end if nv then seen[v] = 2 end end -- First phase, list the tables and functions which appear more than -- once in x. local function mark_multiple_occurences(x) local tp = type(x) if tp ~= "table" and tp ~= "function" then -- No identity (comparison is done by value, not by instance) return end if seen[x] == 1 then seen[x] = 2 elseif seen[x] ~= 2 then seen[x] = 1 end if tp == "table" then nested[x] = true for k, v in pairs(x) do if nested[k] or nested[v] then mark_nest_point(x, k, v) else mark_multiple_occurences(k) mark_multiple_occurences(v) end end


context:
space:
mode: