Module:Infobox - Revision history

Sintel: Add infobox class

2026-04-10T11:19:57Z

Add infobox class

← Older revision		Revision as of 11:19, 10 April 2026
Line 132:		Line 132:
	-- Infobox boilerplate		-- Infobox boilerplate
	table.insert(lines,		table.insert(lines,
	[[<div style="		[[<div class="infobox" style="
	border: 1px solid #999;		border: 1px solid #999;
	margin: 0;		margin: 0;

Ganaram inukshuk: simplify code

2025-10-15T11:29:20Z

simplify code

← Older revision		Revision as of 11:29, 15 October 2025
Line 213:		Line 213:
	local is_upper_lower_links_present =		local is_upper_lower_links_present =
	any_keys_present(args, upper_links) or any_keys_present(args, lower_links)		any_keys_present(args, upper_links) or any_keys_present(args, lower_links)
			local is_side_links_present = any_keys_present(args, side_links)

	-- Build adjacent_links		-- Build adjacent_links
Line 233:		Line 234:
	args[key] = nil		args[key] = nil
	end		end
	~~else~~		elseif is_side_links_present then
	-- Left and right links only		-- Left and right links only
	for _, key in ipairs(side_links) do		for _, key in ipairs(side_links) do
Line 240:		Line 241:
	end		end
	end		end
			args["Adjacent Links"] = adjacent_links
	~~-- Quick fix for no-link navbox~~
	~~if #adjacent_links == 2 then~~
	~~if adjacent_links[1] == "" and adjacent_links[2] == "" then~~
	~~args["Adjacent Links"] = {}~~
	~~else~~
	~~args["Adjacent Links"] = adjacent_links~~
	~~end~~
	~~else~~
	args["Adjacent Links"] = adjacent_links
	~~end~~

	-- Preprocess rows		-- Preprocess rows

Ganaram inukshuk: bugfix infobox title

2025-10-15T11:16:14Z

bugfix infobox title

← Older revision		Revision as of 11:16, 15 October 2025
Line 9:		Line 9:
	-- TODO (medium priority):		-- TODO (medium priority):
	-- - Use templatestyles		-- - Use templatestyles
	~~-- - Bugfix infobox title so numlinks nests in properly~~

	--------------------------------------------------------------------------------		--------------------------------------------------------------------------------
Line 241:		Line 240:
	end		end
	end		end
	args["Adjacent Links"] = adjacent_links
			-- Quick fix for no-link navbox
			if #adjacent_links == 2 then
			if adjacent_links[1] == "" and adjacent_links[2] == "" then
			args["Adjacent Links"] = {}
			else
			args["Adjacent Links"] = adjacent_links
			end
			else
			args["Adjacent Links"] = adjacent_links
			end

	-- Preprocess rows		-- Preprocess rows

Ganaram inukshuk: todo

2025-10-15T09:42:26Z

todo

← Older revision		Revision as of 09:42, 15 October 2025
Line 7:		Line 7:
	local p = {}		local p = {}

	-- TODO (medium priority): ~~use~~ templatestyles		-- TODO (medium priority):
			-- - Use templatestyles
			-- - Bugfix infobox title so numlinks nests in properly

	--------------------------------------------------------------------------------		--------------------------------------------------------------------------------

Ganaram inukshuk at 08:56, 15 October 2025

2025-10-15T08:56:31Z

← Older revision		Revision as of 08:56, 15 October 2025
Line 214:		Line 214:

	-- Build adjacent_links		-- Build adjacent_links
			-- Links from args are removed, as they're stored in a separate table
	local adjacent_links = {}		local adjacent_links = {}
	if is_upper_lower_links_present then		if is_upper_lower_links_present then
Line 219:		Line 220:
	for _, key in ipairs(upper_links) do		for _, key in ipairs(upper_links) do
	table.insert(adjacent_links, args[key] or "")		table.insert(adjacent_links, args[key] or "")
			args[key] = nil
	end		end
	-- Middle row of links		-- Middle row of links
	for _, key in ipairs(side_links) do		for _, key in ipairs(side_links) do
	table.insert(adjacent_links, args[key] or "")		table.insert(adjacent_links, args[key] or "")
			args[key] = nil
	end		end
	-- Bottom row of links		-- Bottom row of links
	for _, key in ipairs(lower_links) do		for _, key in ipairs(lower_links) do
	table.insert(adjacent_links, args[key] or "")		table.insert(adjacent_links, args[key] or "")
			args[key] = nil
	end		end
	else		else
Line 232:		Line 236:
	for _, key in ipairs(side_links) do		for _, key in ipairs(side_links) do
	table.insert(adjacent_links, args[key] or "")		table.insert(adjacent_links, args[key] or "")
			args[key] = nil
	end		end
	end		end
	args["Adjacent Links"] = adjacent_links		args["Adjacent Links"] = adjacent_links

	~~-- Cleanup individual links, as they've been combined into one table~~
	~~args["Upper Left Link" ] = nil~~
	~~args["Upper Link" ] = nil~~
	~~args["Upper Right Link"] = nil~~
	~~args["Left Link" ] = nil~~
	~~args["Right Link" ] = nil~~
	~~args["Lower Left Link" ] = nil~~
	~~args["Lower Link" ] = nil~~
	~~args["Lower Right Link"] = nil~~

	-- Preprocess rows		-- Preprocess rows

Ganaram inukshuk: move preprocess function as a nested function; refactor link-detector code

2025-10-15T08:55:06Z

move preprocess function as a nested function; refactor link-detector code

← Older revision		Revision as of 08:55, 15 October 2025
Line 12:		Line 12:
	-------------------------------- MAIN FUNCTIONS --------------------------------		-------------------------------- MAIN FUNCTIONS --------------------------------
	--------------------------------------------------------------------------------		--------------------------------------------------------------------------------

	~~-- Helper function~~
	~~-- Preprocess rows from jagged array to header-data pairs~~
	~~function p.preprocess_rows(rows)~~
	~~-- Preproces rows~~
	~~local is_jagged = true~~
	~~for i = 1, #rows do~~
	~~local row = rows[i]~~
	~~is_jagged = is_jagged and (#row == 1 or #row == 2)~~
	~~end~~

	~~if is_jagged then return tiu.jagged_array_to_header_data_pairs(rows)~~
	~~else return rows end~~
	~~end~~

	-- Function to be called by other modules; also called by wrapper function		-- Function to be called by other modules; also called by wrapper function
Line 35:		Line 21:
	local footer_row = args["Footer Row"]		local footer_row = args["Footer Row"]
	local name = args["name"]		local name = args["name"]

			-- Helper function; preprocess rows
			function preprocess_rows()
			-- Preproces rows
			local is_jagged = true
			for i = 1, #rows do
			local row = rows[i]
			is_jagged = is_jagged and (#row == 1 or #row == 2)
			end

			if is_jagged then return tiu.jagged_array_to_header_data_pairs(rows)
			else return rows end
			end

	-- Preprocess rows		-- Preprocess rows
	rows = p.preprocess_rows(~~rows~~)		rows = preprocess_rows()

	-- Nested helper function		-- Nested helper function
Line 187:		Line 186:
	-- placed on the left and right of the title:		-- placed on the left and right of the title:
	-- [Link 1] Title [Link 2]		-- [Link 1] Title [Link 2]
	~~-- - Link 1 is previous, link 2 is next~~
	-- If there are eight adjacent links (such as with mosses), then links		-- If there are eight adjacent links (such as with mosses), then links
	-- surround the title in a 3x3 grid:		-- surround the title in a 3x3 grid:
Line 193:		Line 191:
	-- [Link 4] Title [Link 5]		-- [Link 4] Title [Link 5]
	-- [Link 6] [Link 7] [Link 8]		-- [Link 6] [Link 7] [Link 8]
	-- ~~Individual~~ links ~~can be omitted~~. If at least one upper or lower ~~link is~~		local function any_keys_present(tbl, keys)
	-- present, ~~then rows for those two sets~~ of links ~~are added~~. ~~Having no links~~		for _, key in ipairs(keys) do
	-- ~~defaults to having only the title~~.		if tbl[key] ~= nil then
	local ~~is_upper_lower_links_present~~ = ~~args[~~"Upper Left Link"~~] ~= nil or args[~~"Upper Link"~~] ~= nil or args[~~"Upper Right Link"~~] ~~~= ~~nil~~		return true
	~~or args[~~"~~Lower~~ Left Link"~~] ~= nil or args["Lower Link"] ~= nil or args[~~"~~Lower~~ Right Link"~~] ~= nil~~		end
	local ~~is_side_links_present~~ = ~~args[~~"Left Link"~~] ~= nil or args[~~"Right Link"~~] ~= nil~~		end
			return false
			end

			-- Keys to links
			-- Left and right are added if at least one is present -> 2-element table.
			-- All three rows are added if at least one link from the upper or lower
			-- rows is present, regardless of side links -> 8-element table.
			-- No links are added if none of them are present -> 0-element table.
			local upper_links = { "Upper Left Link", "Upper Link", "Upper Right Link" }
			local side_links = { "Left Link", "Right Link" }
			local lower_links = { "Lower Left Link", "Lower Link", "Lower Right Link" }

			-- Check which links are present
			local is_upper_lower_links_present =
			any_keys_present(args, upper_links) or any_keys_present(args, lower_links)

			-- Build adjacent_links
	local adjacent_links = {}		local adjacent_links = {}
	if is_upper_lower_links_present then		if is_upper_lower_links_present then
	table.insert(adjacent_links, args[~~"Upper Left Link"~~ ] or "")		-- Upper row of links
	~~table.insert~~(~~adjacent_links, args["Upper Link" ] or ""~~)		for _, key in ipairs(upper_links) do
	table.insert(adjacent_links, args[~~"Upper Right Link"~~] or "")		table.insert(adjacent_links, args[key] or "")
	end		end
	~~if is_side_links_present then~~		-- Middle row of links
	~~table.insert~~(~~adjacent_links, args["Left Link" ] or ""~~)		for _, key in ipairs(side_links) do
	table.insert(adjacent_links, args[~~"Right Link"~~] or "")		table.insert(adjacent_links, args[key] or "")
	end		end
	~~if is_upper_lower_links_present then~~		-- Bottom row of links
	~~table.insert(adjacent_links, args["Lower~~ Left ~~Link" ] or "")~~		for _, key in ipairs(lower_links) do
	~~table.insert~~(~~adjacent_links, args["Lower Link" ] or ""~~)		table.insert(adjacent_links, args[key] or "")
	table.insert(adjacent_links, args[~~"Lower Right Link"~~] or "")		end
			else
			-- Left and right links only
			for _, key in ipairs(side_links) do
			table.insert(adjacent_links, args[key] or "")
			end
	end		end
	args["Adjacent Links"] = adjacent_links		args["Adjacent Links"] = adjacent_links

Ganaram inukshuk: update todo

2025-10-15T07:23:50Z

update todo

← Older revision		Revision as of 07:23, 15 October 2025
Line 6:		Line 6:

	local p = {}		local p = {}

	~~-- TODO (high priority):~~
	~~-- - Add the following backwards-compatibility feature: if rows are entered as~~
	~~-- a jagged array instead of the expected format of header-data pairs, convert~~
	~~-- it from a jagged array to a table of header-data pairs.~~

	-- TODO (medium priority): use templatestyles		-- TODO (medium priority): use templatestyles

Ganaram inukshuk: rollback changes to old build functions; current function should auto-convert jagged arrays

2025-10-15T06:02:55Z

rollback changes to old build functions; current function should auto-convert jagged arrays

← Older revision		Revision as of 06:02, 15 October 2025
Line 258:		Line 258:
	["Adjacent Links"] = { (prev_link or ""), (next_link or "") },		["Adjacent Links"] = { (prev_link or ""), (next_link or "") },
	["Title"] = title,		["Title"] = title,
	["Rows"] = ~~tiu.jagged_array_to_header_data_pairs(~~entries)		["Rows"] = entries
	}		}

Line 269:		Line 269:
	["Adjacent Links"] = adjacent_links,		["Adjacent Links"] = adjacent_links,
	["Title"] = title,		["Title"] = title,
	["Rows"] = ~~tiu.jagged_array_to_header_data_rows(~~entries)		["Rows"] = entries
	}		}

Ganaram inukshuk: minor renaming

2025-10-15T05:58:20Z

minor renaming

← Older revision		Revision as of 05:58, 15 October 2025
Line 235:		Line 235:
	-- Set row count to 30, under the reasoning that an infobox may need more		-- Set row count to 30, under the reasoning that an infobox may need more
	-- rows and/or headers. This may be increased to 40 if needed.		-- rows and/or headers. This may be increased to 40 if needed.
	args["Rows"] = tiu.~~header_data_pairs_to_table~~(args, 30)		args["Rows"] = tiu.numbered_header_data_args_to_table(args, 30)

	local result = p._infobox(args)		local result = p._infobox(args)

Ganaram inukshuk: wrong function name

2025-10-15T05:40:06Z

wrong function name

← Older revision		Revision as of 05:40, 15 October 2025
Line 258:		Line 258:
	["Adjacent Links"] = { (prev_link or ""), (next_link or "") },		["Adjacent Links"] = { (prev_link or ""), (next_link or "") },
	["Title"] = title,		["Title"] = title,
	["Rows"] = tiu.~~jagged_array_to_header_data_rows~~(entries)		["Rows"] = tiu.jagged_array_to_header_data_pairs(entries)
	}		}