Module:CoffreRécompenses

[voir | modifier | historique | purger]DocumentationAller au code ↴

Ce module permet de gérer les modèles {{CoffreRécompenses}} et {{CoffreRécompensesObjet}}.

• p.base() est la fonction qui permet de générer un tableau pour chaque coffre ;
• p.base2() est la fonction qui permet de générer un tableau avec un ou plusieurs objets.

Voir les modèles respectifs pour plus d'information sur l'utilisation.

Les données utilisées par le module sont situées dans les tableaux du haut de la page.

Maintenance

Voir aussi : Module:CoffreRécompenses/objets et Module:CoffreRécompenses/coffres

[voir | modifier | historique | purger]La documentation ci-dessus est insérée depuis Module:CoffreRécompenses/doc.

local p = {

	calc_average_amount_this_item_per_pool = function( 
			min_stacksize, max_stacksize,
			min_pool_rolls, max_pool_rolls, 
			item_weight, pool_total_item_weight )

		local avg_stacksize = ( min_stacksize + max_stacksize ) / 2
		local avg_rolls = ( min_pool_rolls + max_pool_rolls ) / 2
		
		return avg_stacksize * avg_rolls * item_weight / pool_total_item_weight
		
	end,
	
	calc_chance_any_of_this_item_per_pool = function( 
			min_pool_rolls, max_pool_rolls,
			item_weight, pool_total_item_weight )

		local inverse_result = 0 -- 1 - inverse_result = return value
		local inverse_item_weight = pool_total_item_weight - item_weight
		
		-- will be used for the division in the for loop to avoid the slightly
		-- less performant math.pow(). The divisor already includes the probability
		-- of picking any specific number of rolls.
		local cur_dividend = pool_total_item_weight
		local cur_divisor = pool_total_item_weight * (max_pool_rolls - min_pool_rolls + 1)
		
		for i = 0, max_pool_rolls do
			if i >= min_pool_rolls then
				inverse_result = inverse_result + cur_dividend / cur_divisor
			end
			cur_dividend = cur_dividend * inverse_item_weight -- simulate pow
			cur_divisor = cur_divisor * pool_total_item_weight -- simulate pow
		end
		
		return 1 - inverse_result
		
	end,
	
	java = '[[version Java]]\n',
	['java-upcoming'] = '[[version Java 1.20]]\n',
	bedrock = '[[version Bedrock]]\n',
	['bedrock-upcoming']= '[[version Bedrock 1.20.0]]\n',
	
	-- These 'items' define which sprite, label and link to use in the table.
	-- Properties 'cannot_stack', 'preserve_case', and 'plural' describe how to display the single-item summary in p.base2.
	-- Order within this 'items' list doesn't matter.
	-- mettre article="partitif" fait utiliser "du" ou "de la" devant l'objet
	-- il faut mettre genre="féminin" pour les objets au nom féminin
	

	items = require("Module:CoffreRécompenses/objets"),

	notes = {
		["enchant-aléatoire"] = "La probabilité de tous les enchantements et niveaux d'enchantement est égale, ''y compris'' les enchantements de type Trésor (sauf [[Agilité des âmes]] et [[Furtivité rapide]]).",
		["enchant-aléatoire-agilité-âmes"] = "Enchanté avec un niveau aléatoire d'[[Agilité des âmes]].",
		["enchant-aléatoire-furtivité-rapide"] = "Enchanté avec un niveau aléatoire de [[Furtivité rapide]].",
		["enchant-5-15"] = "La probabilité de tous les enchantements (sauf [[Agilité des âmes]] et [[Furtivité rapide]]) est la même que pour une utilisation d'une [[table d'enchantement]] de niveau compris entre 5 et 15, mais la probabilité des enchantements multiples n'est pas réduite.",
		["enchant-5-20"] = "La probabilité de tous les enchantements (sauf [[Agilité des âmes]] et [[Furtivité rapide]]) est la même que pour une utilisation d'une [[table d'enchantement]] de niveau compris entre 5 et 20, mais la probabilité des enchantements multiples n'est pas réduite.",
		["enchant-20-25"] = "La probabilité de tous les enchantements (sauf [[Agilité des âmes]] et [[Furtivité rapide]]) est la même que pour une utilisation d'une [[table d'enchantement]] de niveau compris entre 20 et 25, mais la probabilité des enchantements multiples n'est pas réduite.",
		["enchant-20-39"] = "La probabilité de tous les enchantements (sauf [[Agilité des âmes]] et [[Furtivité rapide]]) est la même que pour une utilisation d'une [[table d'enchantement]] de niveau compris entre 20 et 39, mais la probabilité des enchantements multiples n'est pas réduite.",
		["enchant-30"] = "La probabilité de tous les enchantements (sauf [[Agilité des âmes]] et [[Furtivité rapide]]) est la même que pour une utilisation d'une [[table d'enchantement]] de niveau 30, mais la probabilité des enchantements multiples n'est pas réduite.",
		["enchant-30-50"] = "La probabilité de tous les enchantements (sauf [[Agilité des âmes]] et [[Furtivité rapide]]) est la même que pour une utilisation d'une [[table d'enchantement]] de niveau compris entre 30 et 50, mais la probabilité des enchantements multiples n'est pas réduite.",

		["endommagé-0.05-0.15"] = "L'objet aura entre 5 % et 15 % de sa durabilité totale.",
		["endommagé-0.1-0.5"] = "L'objet aura entre 10 % et 50 % de sa durabilité totale.",
		["endommagé-0.1-0.9"] = "L'objet aura entre 10 % et 90 % de sa durabilité totale.",
		["endommagé-0.1-0.95"] = "L'objet aura entre 10 % et 95 % de sa durabilité totale.",
		["endommagé-0.15-0.45"] = "L'objet aura entre 15 % et 45 % de sa durabilité totale.",
	    ["endommagé-0.15-0.8"] = "L'objet aura entre 15 % et 80 % de sa durabilité totale.",
		["endommagé-0.15-0.85"] = "L'objet aura entre 15 % et 85 % de sa durabilité totale.",
		["endommagé-0.15-0.95"] = "L'objet aura entre 15 % et 95 % de sa durabilité totale.",
		["endommagé-0.2-0.65"] = "L'objet aura entre 20 % et 64 % de sa durabilité totale.",
		["endommagé-0.8-1.0"] = "L'objet aura entre 80 % et 100 % de sa durabilité totale.",
		["rien"] = "'Rien' ne fait pas référence à la chance d'avoir un coffre vide. Il fait plutôt référence à la chance que le générateur de butin aléatoire n'ajoute aucun butin ''sur un seul jet .",
		
        ["soupe-suspecte"] = "La soupe confère l'un des effets suivants : 5 à 7 secondes de [[Cécité]], 7 à 10 secondes de [[Sauts améliorés]], 7 à 10 secondes de [[Nyctalopie]], 10 à 20 secondes de [[Poison]], 7 à 10 secondes de [[Saturation]] ou 6 à 8 secondes de [[Faiblesse]].",
        ["soupe-suspecte-2"] = "La soupe confère l'un des effets suivants : 5 à 7 secondes de [[Cécité]] ou 7 à 10 secondes de [[Nyctalopie]].",

	},
	
	-- <ref group='FN' name='enchant-randomly'>
	
	-- NOTE: order here doesn't matter.  
	--		 * in the table, chests are sorted in alphabetical order
	--       * in the table, items are sorted by chance, then by avg#, then alphabetically.
	--       * If poolsJavaUpcoming is omitted, poolsJava is used. To omit a pool entirely, set it to {}.
	--       * If the loot is the same on both editions, use the same loot table twice.
	
	chests = require("Module:CoffreRécompenses/coffres"),

	-- these values are used:
	-- * in place of the keys, when the key is used as a parameter
	
	-- chest-param -> internally-valid-chest-param
	
	synonyms = {
		["jungle"] = "temple-jungle",
		["pyramide"] = "temple-désert",
		["nether"] = "forteresse-nether",
		["forteresse"] = "forteresse-nether",
		
		["armurerie"] = "village-armurerie",
		["boucherie"] = "village-boucherie",
		["cartographe"] = "village-cartographe",
		["maçon"] = "village-maçon",
		["bergerie"] = "village-bergerie",
		["tannerie"] = "village-tannerie",
		["forgeron-armes"] = "village-forgeron-armes",
		["forgeron-outils"]     = "village-forgeron-outils",
		
		["désert"] = "village-désert",
		["plaine"] = "village-plaine",
		["savane"] = "village-savane",
		["toundra"] = "village-toundra",
		["taïga"] = "village-taïga",

		["autel"] = "autel-fort",
		["entrepôt"] = "entrepôt-fort",
		["bibliothèque"] = "bibliothèque-fort",
		["écuries-hoglin"] = "bastion-écuries-hoglin",
		["bastion-autre"] = "bastion",

        ["pyramide-brosse"] = "temple-désert-brosse"
		
	},

	-- these values are used:
	-- * in the header-description of a table showing only a single chest
	-- * if the key is not here, but it is a valid chest parameter,
	--   that header-description will default to use the key string from p.chests,
	--   e.g. "forteresse-nether"
	
	-- chest-param -> description-string
	
	display_names = {
		["puits-de-mine-abandonné"] = "puits de mine abandonné",
		["forteresse-nether"] = "forteresse du Nether",
		["nether"] = "forteresse du Nether",
		["forteresse"] = "forteresse du Nether",
		["armurerie"] = "armurerie de village",
		["boucherie"] = "boucherie de village",
		["cartographe"] = "cartographe de village",
		["maçon"] = "maçon de village",
		["bergerie"] = "bergerie de village",
		["tannerie"] = "tannerie de village",
		["village-temple"] = "temple de village",
		["forgeron-armes"] = "forgeron d'armes de village",
		["forgeron-outils"] = "forgeron d'outils de village",
		["désert"] = "maison de village du desert",
		["plaine"] = "maison de village des plaines",
		["savane"] = "maison de village de la savane",
		["toundra"] = "maison de village de la toundra",
		["taïga"] = "maison de village de la taïga",
		["jungle"] = "temple de la jungle",
		["temple-désert"] = "pyramide",
		["temple-jungle"] = "temple de la jungle",
		["distributeur-temple-jungle"] = "distributeur de temple de la jungle",
		["autel-fort"] = "autel",
		["bibliothèque-fort"] = "bibliothèque",
		["entrepôt-fort"] = "entrepôt",
		["cité-end"] = "cité de l\'End",
		["bastion-pont"] = "pont de vestiges de bastion",
		["bastion-écuries-hoglin"] = "écuries de Hoglin",
		["bastion-autre"] =  "bastion",
		["bastion-trésor"] = "salle au trésor de vestiges de bastion",
		["temple-désert-brosse"] = "sable suspect de pyramide",
		["ruines-sous-marines-froides-brosse"] = "gravier suspect de ruines sous-marines froides",
		["ruines-sous-marines-chaudes-brosse"] = "sable suspect de ruines sous-marines chaudes",
		["puits-du-désert-brosse"] = "sable suspect de puits du désert",
		["ruines-de-sentier-brosse"] = "gravier suspect commun de ruines de sentier",
		["ruines-de-sentier-brosse-rare"] = "gravier suspect rare de ruines de sentier"
	},
	
	-- these descriptions are used:
	-- * in column <abbr> titles,
	-- * and above the table when only a single column-type is chosen
	
	columns = {
		["taillepiles"] = "la taille des piles d&apos;objets (ou le nombre d&apos;objets pas empilables) pouvant être trouvées dans ce coffre. Une pile est un &quot;stack&quot; en anglais.",
		["poids"] = "le poids relatif de cet objet par rapport aux autres objets du groupe.",
	    ["probabilité"] = "la probabilité d&apos;obtenir l&apos;un de ces objets dans le coffre.",
		["objets"] = "le nombre d&apos;objets espérés par coffre (moyenne pour un grand nombre de coffres).",
		["coffres"] = "le nombre moyen de coffres à ouvrir pour espérer trouver l&apos;un de ces objets."
	},
	
	current_frame = nil
}

p.base = function( ... )

	p.current_frame = mw.getCurrentFrame()

	local args = { ... }
	if args[1] == p.current_frame then 
		args = require( 'Module:ProcessArgs' ).merge( true )
	else
		args = args[1]
	end
	
	-- transform args into usable list
	
	local chests, columns = q.massage_args( args )
	
	assert(#chests > 0, "pas d'arguments valides")

	q.fill_in_chest_derivative_data( chests )
	
	-- construct an ordered list dictating the order of the rows
	
	local ordered_item_rows_java = {}
	local ordered_item_rows_java_upcoming = {}
	local ordered_item_rows_bedrock = {}
	local ordered_item_rows_bedrock_upcoming = {}

	local ret = {}
	
	local java_specified             = args.java                and args.java ~= '0';
	local java_upcoming_specified    = args['java-upcoming']    and args['java-upcoming'] ~= '0';
	local bedrock_specified          = args.bedrock             and args.bedrock ~= '0';
	local bedrock_upcoming_specified = args['bedrock-upcoming'] and args['bedrock-upcoming'] ~= '0';
	
	local any_specified = java_specified or java_upcoming_specified or bedrock_specified or bedrock_upcoming_specified
	
	if any_specified then
	
		if java_specified then
			ordered_item_rows_java = q.construct_ordered_item_rows( chests, 'Java' )
		end	
		if java_upcoming_specified then
			ordered_item_rows_java_upcoming = q.construct_ordered_item_rows( chests, 'JavaUpcoming' )
		end	
		if bedrock_specified then
			ordered_item_rows_bedrock = q.construct_ordered_item_rows( chests, 'Bedrock' )
		end	
		if bedrock_upcoming_specified then
			ordered_item_rows_bedrock_upcoming = q.construct_ordered_item_rows( chests, 'BedrockUpcoming' )
		end
	
	else
	
		local java_excluded             = args.java                and args.java == '0';
		local java_upcoming_excluded    = args['java-upcoming']    and args['java-upcoming'] == '0';
		local bedrock_excluded          = args.bedrock             and args.bedrock == '0';
		local bedrock_upcoming_excluded = args['bedrock-upcoming'] and args['bedrock-upcoming'] == '0';
		
		if not java_excluded then
			ordered_item_rows_java = q.construct_ordered_item_rows( chests, 'Java' )
		end	
		if not java_upcoming_excluded then
			ordered_item_rows_java_upcoming = q.construct_ordered_item_rows( chests, 'JavaUpcoming' )
		end	
		if not bedrock_excluded then
			ordered_item_rows_bedrock = q.construct_ordered_item_rows( chests, 'Bedrock' )
		end	
		if not bedrock_upcoming_excluded then
			ordered_item_rows_bedrock_upcoming = q.construct_ordered_item_rows( chests, 'BedrockUpcoming' )
		end
	
	end
	
	if q.tablelength( ordered_item_rows_java ) > 0 then
		table.insert( ret, 'Dans la ' .. p.current_frame:preprocess( p.java ) .. ', ' .. q.lcfirst( q.print_table( chests, columns, ordered_item_rows_java, 'Java' ) ) )
	end
	if q.tablelength( ordered_item_rows_java_upcoming ) > 0 and q.compare_tables( ordered_item_rows_java, ordered_item_rows_java_upcoming ) then
		table.insert( ret, 'Dans la ' .. p.current_frame:preprocess( p['java-upcoming'] ) .. ', ' .. q.lcfirst( q.print_table( chests, columns, ordered_item_rows_java_upcoming, 'JavaUpcoming' ) ) )
	end
	if q.tablelength( ordered_item_rows_bedrock ) > 0 and q.compare_tables( ordered_item_rows_java, ordered_item_rows_bedrock ) then
		table.insert( ret, 'Dans la ' .. p.current_frame:preprocess( p.bedrock ) .. ', ' .. q.lcfirst( q.print_table( chests, columns, ordered_item_rows_bedrock, 'Bedrock' ) ) )
	end
	if q.tablelength( ordered_item_rows_bedrock_upcoming ) > 0 and q.compare_tables( ordered_item_rows_bedrock, ordered_item_rows_bedrock_upcoming ) then
		table.insert( ret, 'Dans la ' .. p.current_frame:preprocess( p['bedrock-upcoming'] ) .. ', ' .. q.lcfirst( q.print_table( chests, columns, ordered_item_rows_bedrock_upcoming, 'BedrockUpcoming' ) ) )
	end

	table.insert( ret, "<div class=mobileonly>" )
	table.insert( ret, p.current_frame:expandTemplate{ title = 'FNlist', args = {} } )
	table.insert( ret, "</div>" )

	return table.concat( ret, '\n\n' )
end

p.doc = function()

	local valid_args = {}
	for chest_name, val in pairs(p.chests) do
		local synonyms = {}
		for syn, orig in pairs(p.synonyms) do
			if orig == chest_name then
				table.insert( synonyms, syn )
			end
		end
		if #synonyms > 0 then
			chest_name = chest_name .. " ( " .. table.concat( synonyms, ", " ) .. " )"
		end
		table.insert( valid_args, chest_name )
	end
	table.sort( valid_args )
	return table.concat( valid_args, ",\n<br>" )

end

p.doc2 = function()

	local valid_args = {}
	for column_name, val in pairs(p.columns) do
		table.insert( valid_args, column_name .. ": " .. val )
	end
	table.sort( valid_args )
	return table.concat( valid_args, ",\n<br>" )

end

p.doc3 = function()

	local valid_args = {}
	for item_name, val in pairs(p.items) do
		table.insert( valid_args, item_name )
	end
	table.sort( valid_args )
	return table.concat( valid_args, ", " )

end

p.base2 = function( ... )

	p.current_frame = mw.getCurrentFrame()

	local args = { ... }
	if args[1] == p.current_frame then
		args = require( 'Module:ProcessArgs' ).merge( true )
	else
		args = args[1]
	end

	local itemname = args[1]

	if p.items[itemname] == nil then
        return '<span style="color:red;">Objet "' .. itemname .. '" inconnu</span>'
	end

	if args.java and args.java ~= '0' then
		javaChances = q.single_item_find_values( itemname, 'poolsJava' )
		javaUpcomingChances = {}
		bedrockChances = {}
		bedrockUpcomingChances = {}
	else
		if args['java-upcoming'] and args['java-upcoming'] ~= '0' then
			javaChances = q.single_item_find_values( itemname, 'poolsJavaUpcoming' )
			javaUpcomingChances = {}
			bedrockChances = {}
			bedrockUpcomingChances = {}
		else
			if args.bedrock and args.bedrock ~= '0' then
				javaChances = q.single_item_find_values( itemname, 'poolsBedrock' )
				javaUpcomingChances = {}
				bedrockChances = {}
				bedrockUpcomingChances = {}
			else
				if args['bedrock-upcoming'] and args['bedrock-upcoming'] ~= '0' then
					javaChances = q.single_item_find_values( itemname, 'poolsBedrockUpcoming' )
					javaUpcomingChances = {}
					bedrockChances = {}
					bedrockUpcomingChances = {}
				else
					javaChances = q.single_item_find_values( itemname, 'poolsJava' )
					javaUpcomingChances = q.single_item_find_values( itemname, 'poolsJavaUpcoming', javaChances )
					bedrockChances = q.single_item_find_values( itemname, 'poolsBedrock' )
					bedrockUpcomingChances = q.single_item_find_values( itemname, 'poolsBedrockUpcoming', javaChances, bedrockChances )
				end
			end
		end
	end
	
	local html = {}

	local any_current = q.tablelength( javaChances ) > 0
	local any_changes_upcoming = q.tablelength( javaUpcomingChances ) > 0 and q.compare_tables( javaChances, javaUpcomingChances )
	local any_standard = any_current or any_changes_upcoming

	local any_bedrock_current = q.tablelength( bedrockChances ) > 0
	local any_bedrock_upcoming = q.tablelength( bedrockUpcomingChances ) > 0 and q.compare_tables( bedrockChances, bedrockUpcomingChances )
	local any_bedrock = any_bedrock_current or any_bedrock_upcoming

	local change_case = p.items[itemname].preserve_case == nil or p.items[itemname].preserve_case ~= true

	if any_current then
		table.insert( html, p.base2_sub( itemname, javaChances ) )
	end
	if any_changes_upcoming then
		table.insert( html, p.current_frame:preprocess( p['java-upcoming']  ) .. ( change_case and q.lcfirst( p.base2_sub( itemname, javaUpcomingChances, any_current ) ) or p.base2_sub( itemname, javaUpcomingChances, any_current ) ) )
	end
	if any_bedrock_current then
		table.insert( html, ( any_standard and '\n\n' or '' ) .. p.current_frame:preprocess( p.bedrock ) .. ( change_case and q.lcfirst( p.base2_sub( itemname, bedrockChances, any_standard ) ) or p.base2_sub( itemname, bedrockChances, any_standard ) ) )
	end
	if any_bedrock_upcoming then
		table.insert( html, ( any_standard and not any_bedrock_current and '\n\n' or '' ) .. p.current_frame:preprocess( p['bedrock-upcoming'] ) .. ( change_case and q.lcfirst( p.base2_sub( itemname, bedrockUpcomingChances, any_bedrock_current or any_standard ) ) or p.base2_sub( itemname, bedrockUpcomingChances, any_bedrock_current or any_standard ) ) )
	end

	if args.nocat then
	else
		table.insert( html, '[[Catégorie:Pages avec des modèles de coffre à récompenses]]' )
		if p.items[itemname].category ~= nil and p.items[itemname].category ~= false then
			table.insert( html, '[[Catégorie:Pages contenant des objets spécifiques de coffre à récompenses]]' )
		end
		if any_bedrock and (mw.title.getCurrentTitle().namespace == 0) then
			table.insert( html, '[[Catégorie:Information spécifique à la version Bedrock]]' )
		end
	end

	return table.concat( html, ' ' )
end

p.base2_sub = function( itemname, chances, use_they )

	local html = {}
	local item_display_name = ''

	if use_they then
		item_display_name = 'ils'
	else
		if p.items[itemname].plural ~= nil and p.items[itemname].plural ~= false then
			item_display_name = p.items[itemname].plural
		else
			if p.items[itemname].title ~= nil then
				item_display_name = p.items[itemname].title
			else
				item_display_name = string.gsub( itemname, '-', ' ' )
			end
			if p.items[itemname].plural == nil or p.items[itemname].plural ~= false then
				item_display_name = q.single_item_plural( item_display_name )
			end
		end

		if p.items[itemname].preserve_case == nil or p.items[itemname].preserve_case ~= true then
			item_display_name = q.capitalize( item_display_name )
		end

		if p.items[itemname].note and p.notes[p.items[itemname].note] then
			item_display_name = item_display_name .. p.current_frame:extensionTag( 'ref', p.notes[p.items[itemname].note], { group='FN', name=p.items[itemname].note } )
		end

		if p.items[itemname].note1 and p.notes[p.items[itemname].note1] then
			if p.items[itemname].note == nil or p.notes[p.items[itemname].note] == nil or p.items[itemname].note ~= p.items[itemname].note1 then
				item_display_name = item_display_name .. p.current_frame:extensionTag( 'ref', p.notes[p.items[itemname].note1], { group='FN', name=p.items[itemname].note1 } )
			end
		end
	end

	table.insert( html, item_display_name )
	table.insert( html, ' peut être trouvé(e) ' )

	local html_stacks = {}
	local stack_sep = ', '
	local ns = q.tablelength( chances )
	local s = 0

	for stacksize, chest_details in pairs( chances ) do
		s = s + 1

		local html_per_stack = { 'dans ' }
		local c = 0
		local nc = q.tablelength( chest_details )
		local sep = ( nc > 2 and ', ' or ' ' )
		if nc > 2 and s ~= ns then
			stack_sep = '; '
		end
		for k, chest in pairs( chest_details ) do
			c = c + 1
			if c == nc and nc > 1 then
				table.insert( html_per_stack, 'et ' )
			end
			if chest.chance == 1 then
				table.insert( html_per_stack, " tout " )
			else
				table.insert( html_per_stack, string.format("%.1f", chest.chance*100) )
				table.insert( html_per_stack, "% de " )
			end
			if chest.chest_type == 'wagonnet de stockage' then
				table.insert( html_per_stack, ' [[wagonnet de stockage|wagonnets de stockage]] dans ' )
				table.insert( html_per_stack, p.chests[chest.chest_name].link )
			elseif chest.chest_type == 'distributeur' then
				table.insert( html_per_stack, ' [[distributeur]]s dans ' )
				table.insert( html_per_stack, p.chests[chest.chest_name].link )
			else
				table.insert( html_per_stack, p.chests[chest.chest_name].link )
				table.insert( html_per_stack, ' coffres' )
			end
			table.insert( html_per_stack, sep )
		end
		if nc > 2 then
			table.insert( html_per_stack, 'tout ' )
		end
		table.insert( html_per_stack, 'dans ' )
		if p.items[itemname].cannot_stack ~= nil then
			table.insert( html_per_stack, 'groupes de ' )
		else
			table.insert( html_per_stack, 'piles de ' )
		end
		table.insert( html_per_stack, stacksize )

		table.insert( html_stacks, table.concat( html_per_stack ) )
	end

	local stackwise_summaries = ''
	if #html_stacks == 1 then
		table.insert( html, html_stacks[1] )
	else
		for i = 1, #html_stacks - 1 do
			table.insert( html, html_stacks[ i ] )
			table.insert( html, stack_sep )
		end
		table.insert( html, 'et ' )
		table.insert( html, html_stacks[#html_stacks] )
	end

	table.insert( html, '.' )

	return table.concat( html )

end

p.base2_test = function()

	items = {}
	for item_name, v in pairs( p.items ) do
		table.insert( items, p.base2{ item_name, ["nocat"]=true } .. '\n\n' )
	end

	table.sort( items )

	return table.concat(items)
end








p.base3 = function( ... )

	p.current_frame = mw.getCurrentFrame()

	local args = { ... }
	if args[1] == p.current_frame then
		args = require( 'Module:ProcessArgs' ).merge( true )
	else
		args = args[1]
	end

	local z = args[1]

	local html_java = {}
	local html_java_u = {}
	local html_bedrock = {}
	local html_bedrock_u = {}

	local rErr = ""

	local zT = {}
	if args[1] == "!!!TOUS!!!" then
		for item_name, v in pairs( p.items ) do
			table.insert( zT, item_name )
			table.sort( zT )
		end
	else
		zT = mw.text.split( args[1], ',' )
	end

	for x, itemname in pairs( zT ) do

		if p.items[itemname] == nil then
			rErr = rErr .. "<span class='error'>Objet " .. itemname .. " inconnu.</span>\n"
		else

			local javaChances, javaUpcomingChances, bedrockChances, bedrockUpcomingChances

			if args.java and args.java ~= '0' then
				javaChances = q.single_item_find_values( itemname, 'poolsJava' )
				javaUpcomingChances = {}
				bedrockChances = {}
				bedrockUpcomingChances = {}
			else
				if args['java-upcoming'] and args['java-upcoming'] ~= '0' then
					javaChances = q.single_item_find_values( itemname, 'poolsJavaUpcoming' )
					javaUpcomingChances = {}
					bedrockChances = {}
					bedrockUpcomingChances = {}
				else
					if args.bedrock and args.bedrock ~= '0' then
						javaChances = q.single_item_find_values( itemname, 'poolsBedrock' )
						javaUpcomingChances = {}
						bedrockChances = {}
						bedrockUpcomingChances = {}
					else
						if args['bedrock-upcoming'] and args['bedrock-upcoming'] ~= '0' then
							javaChances = q.single_item_find_values( itemname, 'poolsBedrockUpcoming' )
							javaUpcomingChances = {}
							bedrockChances = {}
							bedrockUpcomingChances = {}
						else
							javaChances = q.single_item_find_values( itemname, 'poolsJava' )
							javaUpcomingChances = q.single_item_find_values( itemname, 'poolsJavaUpcoming', javaChances )
							bedrockChances = q.single_item_find_values( itemname, 'poolsBedrock' )
							bedrockUpcomingChances = q.single_item_find_values( itemname, 'poolsBedrockUpcoming', javaChances, bedrockChances )
						end
					end
				end
			end

			local any_current = q.tablelength( javaChances ) > 0
			local any_changes_upcoming = q.tablelength( javaUpcomingChances ) > 0 and q.compare_tables( javaChances, javaUpcomingChances )
			local any_standard = any_current or any_changes_upcoming

			local any_bedrock_current = q.tablelength( bedrockChances ) > 0
			local any_bedrock_upcoming = q.tablelength( bedrockUpcomingChances ) > 0 and q.compare_tables( bedrockChances, bedrockUpcomingChances )
			local any_bedrock = any_bedrock_current or any_bedrock_upcoming

			if any_current then
				table.insert( html_java, p.base3_sub( itemname, javaChances ) )
			end
			if any_changes_upcoming then
				table.insert( html_java_u, p.base3_sub( itemname, javaUpcomingChances ) )
			end
			if any_bedrock_current then
				table.insert( html_bedrock, p.base3_sub( itemname, bedrockChances ) )
			end
			if any_bedrock_upcoming then
				table.insert( html_bedrock_u, p.base3_sub( itemname, bedrockUpcomingChances ) )
			end

		end
	end

	local output = rErr .. '{| class="wikitable sortable" \n! Objet \n! Structure \n! Conteneur \n! Quantité \n! Chance \n'
	if q.tablelength( html_java ) > 0 then
		output = output .. '|-\n!colspan=5|' .. p['java'] .. ' \n' .. table.concat( html_java )
	end
	if q.tablelength( html_java_u ) > 0 then
		output = output .. '|-\n!colspan=5|' .. p['java-upcoming'] .. ' \n' .. table.concat( html_java_u )
	end
	if q.tablelength( html_bedrock ) > 0 then
		output = output .. '|-\n!colspan=5|' .. p.bedrock .. ' \n' .. table.concat( html_bedrock )
	end
	if q.tablelength( html_bedrock_u ) > 0 then
		output = output .. '|-\n!colspan=5|' .. p['bedrock-upcoming'] .. ' \n' .. table.concat( html_bedrock_u )
	end
	output = output .. '|}' .. p.current_frame:extensionTag( 'references', "", { group="FN" } )

	return output
end

p.base3_sub = function( itemname, chances )
	local html = {}
	local item_display_name = ''
	local output = ""
	lang = mw.getContentLanguage()

	if p.items[itemname].title ~= nil then
		item_display_name = p.items[itemname].title
	else
		item_display_name = q.capitalize( string.gsub( itemname, '-', ' ' ) )
	end

	local listeObjet = {}
	local ns = q.tablelength( chances )
	local s = 0
	local m = 0

	local rn = 0

	for stacksize, chest_details in pairs( chances ) do
		s = s + 1

		local nc = q.tablelength( chest_details )
		local c = 0
		for k, chest in pairs( chest_details ) do
			c = c + 1
			rn = rn + 1
            local containerText = p.chests[chest.chest_name].conteneur
            if string.len(containerText) == 0 then
                containerText = 'Coffre'
            end
			local r = ""

			r = r .. '|' .. string.gsub( containerText, ' ', '&nbsp;' ) .. '\n|' .. stacksize .. '\n|' .. lang:formatNum( math.floor( chest.chance*1000 + 0.5 ) /10 ) .. '%' .. '\n'
			if ns ~= s or nc ~= c then
				r = r
			end

			table.insert( listeObjet , { p.chests[chest.chest_name].structID , p.chests[chest.chest_name].structure, r } )

		end
		m = m + nc
	end
	table.sort( listeObjet, function(a,b) return a[1] < b[1] end )
	local struct = ""
	local t = ""
	local nt = 1
	local ntt = 0
	for v, w  in pairs( listeObjet ) do
		ntt = ntt + 1
		if w[1] ~= struct then
			if t ~= "" then
				output = output .. "|rowspan=" .. nt .. t
			end
			t = "|'''" .. p.current_frame:expandTemplate{ title = 'LienEnv', args = { w[2],  id = w[1] } } .. "'''\n" .. w[3]
			struct = w[1]
			nt = 1
		else
			t = t .. w[3]
			nt = nt + 1
		end
		if ntt == m then
			output = output .. "|rowspan=" .. nt .. t
		else
			t = t .. '|-' .. '\n'
		end
	end

	return "|-\n| rowspan=" .. m .. "|'''" .. p.getItem(itemname, item_display_name) .. "'''\n" .. output

end

p.getItem = function( itemname, item_display_name )
	local s = ""
	local k = item_display_name
	local link = item_display_name
	local m = itemname

	if p.items[itemname].title ~= nil then
		k = p.items[itemname].title
	end
	if p.items[itemname].link ~= nil then
		link = p.items[itemname].link
	end
	if p.items[itemname].id ~= nil then
		m = p.items[itemname].id
	end

	if p.items[itemname][1] == "objet" then
		s = p.current_frame:expandTemplate{ title = 'LienObjet', args = { link , k , id = m } }
	elseif p.items[itemname][1] == "bloc" then
		s = p.current_frame:expandTemplate{ title = 'LienBloc', args = { link , k , id = m } }
	end

	if p.items[itemname].note and p.notes[p.items[itemname].note] then
		s = s .. p.current_frame:extensionTag( 'ref', p.notes[p.items[itemname].note], { group='FN', name=p.items[itemname].note } )
	end

	if p.items[itemname].note1 and p.notes[p.items[itemname].note1] then
		if p.items[itemname].note == nil or p.notes[p.items[itemname].note] == nil or p.items[itemname].note ~= p.items[itemname].note1 then
			s = s .. p.current_frame:extensionTag( 'ref', p.notes[p.items[itemname].note1], { group='FN', name=p.items[itemname].note1 } )
		end
	end

	return s

end








q = {

	tablelength = function(T)
		local count = 0
		for _ in pairs(T) do count = count + 1 end
		return count
	end,

	deepcopy = function(orig)
	    local orig_type = type(orig)
	    local copy
	    if orig_type == 'table' then
	        copy = {}
	        for orig_key, orig_value in next, orig, nil do
	            copy[q.deepcopy(orig_key)] = q.deepcopy(orig_value)
	        end
	        setmetatable(copy, q.deepcopy(getmetatable(orig)))
	    else -- number, string, boolean, etc
	        copy = orig
	    end
	    return copy
	end,

	single_item_find_values = function( itemname, poolsKey, exclusions_param, other_exclusions_param )

		local chances = {}

		local exclusions = q.deepcopy(exclusions_param or {})
		local other_exclusions = q.deepcopy(other_exclusions_param or {})

		for stacksize, other_exclusion_list in pairs(other_exclusions) do
			if exclusions[stacksize] == nil then
				exclusions[stacksize] = {}
			end
			for _, other_exclusion in pairs(other_exclusion_list) do
				local already_in_here = false
				for _, exclusion in pairs(exclusions[stacksize]) do
					if exclusion["chest_name"] == other_exclusion["chest_name"] and exclusion["chance"] == other_exclusion["chance"] then
						already_in_here = true
						break
					end
				end
				if not already_in_here then
					table.insert( exclusions[stacksize], other_exclusion )
				end
			end
		end

		for chest_name, chest in pairs( p.chests ) do
			local poolchances = {}
			for k, pool in pairs( chest[poolsKey] or chest.poolsJava or {} ) do
				local poolitem = pool.items[itemname]
				if poolitem ~= nil then

					local stacksize = poolitem[1]
					if poolitem[1] ~= poolitem[2] then
						stacksize = stacksize .. "–" .. poolitem[2]
					end

					local itemweight = poolitem[3]

					local pool_total_item_weight = 0
					for itemname, item in pairs(pool.items) do
						pool_total_item_weight = pool_total_item_weight + item[3]
					end

					local chance = p.calc_chance_any_of_this_item_per_pool(
						pool.rolls[1], pool.rolls[2],
						itemweight, pool_total_item_weight )

					if poolchances[stacksize] == nil then
						poolchances[stacksize] = chance
					else
						poolchances[stacksize] = poolchances[stacksize] + (1 - poolchances[stacksize]) * chance
					end
				end
			end
			for stacksize, chance in pairs( poolchances ) do
				local excluded = false
				for _, exclusion in pairs( exclusions[stacksize] or {} ) do
					if exclusion["chest_name"] == chest_name and exclusion["chance"] == chance then
						excluded = true
						break
					end
				end
				if not excluded then
					if chances[stacksize] == nil then
						chances[stacksize] = {}
					end
					table.insert( chances[stacksize], { ["chance"]=chance, ["chest_name"]=chest_name, ["chest_type"]=( chest.chest_type or "chest" ) } )
				end
			end
		end

		return chances

	end,

	single_item_plural = function( itemname )

		if string.sub( itemname, -2 ) == 'ss'
			or string.sub( itemname, -2 ) == 'ch'
			or string.sub( itemname, -2 ) == 'sh'
			or string.sub( itemname, -1 ) == 's' then
				return itemname .. 'es'
		end

		return itemname .. 's'

	end,

	massage_args = function( args )

		-- find what columns to put

		local columns = {}

		for k, _arg in pairs(args) do
			if p.columns[_arg] ~= nil then
				columns[_arg] = true
			end
		end

		if q.tablelength(columns) == 0 then
			for column_name, v in pairs(p.columns) do
				columns[column_name] = true
			end
		end

		-- find what chests to show

		local chests = {}

		for k, _arg in pairs(args) do
			if p.chests[_arg] ~= nil then
				table.insert( chests, _arg )
			elseif p.synonyms[_arg] ~= nil then
				table.insert( chests, p.synonyms[_arg] )
			end
			if p.display_names[_arg] ~= nil then
				local chestname = _arg
				if p.chests[chestname] == nil then
					chestname = p.synonyms[_arg]
				end
				p.chests[chestname].display_name = p.display_names[_arg]
			end
		end

		table.sort( chests )

		return chests, columns

	end,

	sort_items = function( e1, e2 )

		if e1.chanceany ~= e2.chanceany then return ( e1.chanceany > e2.chanceany ) end
		if e1.avgamount ~= e2.avgamount then return ( e1.avgamount > e2.avgamount ) end

		if e1.material == nil then

			e1.material = 0
			if string.find( e1.itemname, "cuir" ) ~= nil then e1.material = 1 end
			if string.find( e1.itemname, "fer" ) ~= nil then e1.material = 2 end
			if string.find( e1.itemname, "or" ) ~= nil then e1.material = 3 end
			if string.find( e1.itemname, "diamant" ) ~= nil then e1.material = 4 end
			if string.find( e1.itemname, "netherite" ) ~= nil then e1.material = 5 end
			e1.armor = 0
			if string.find( e1.itemname, "casque" ) ~= nil or string.find( e1.itemname, "chapeau" ) ~= nil then e1.armor = 1 end
			if string.find( e1.itemname, "plastron" ) ~= nil or string.find( e1.itemname, "tunique" ) ~= nil then e1.armor = 2 end
			if string.find( e1.itemname, "jambières" ) ~= nil or string.find( e1.itemname, "pantalon" ) ~= nil then e1.armor = 3 end
			if string.find( e1.itemname, "bottes" ) ~= nil then e1.armor = 4 end

		end

		if e2.material == nil then

			e2.material = 0
			if string.find( e2.itemname, "cuir" ) ~= nil then e2.material = 1 end
			if string.find( e2.itemname, "fer" ) ~= nil then e2.material = 2 end
			if string.find( e2.itemname, "or" ) ~= nil then e2.material = 3 end
			if string.find( e2.itemname, "diamant" ) ~= nil then e2.material = 4 end
			e2.armor = 0
			if string.find( e2.itemname, "casque" ) ~= nil or string.find( e2.itemname, "chapeau" ) ~= nil then e2.armor = 1 end
			if string.find( e2.itemname, "plastron" ) ~= nil or string.find( e2.itemname, "tunique" ) ~= nil then e2.armor = 2 end
			if string.find( e2.itemname, "jambières" ) ~= nil or string.find( e2.itemname, "pantalon" ) ~= nil then e2.armor = 3 end
			if string.find( e2.itemname, "bottes" ) ~= nil then e2.armor = 4 end

		end

		if e1.material ~= e2.material then return ( e1.material < e2.material ) end
		if e1.armor ~= e2.armor then return ( e1.armor < e2.armor ) end

		return ( e1.itemname < e2.itemname )

	end,

	fill_in_chest_derivative_data = function( chest_names )

		for k, chest_name in pairs(chest_names) do
			local chest = p.chests[chest_name]
			if chest == nil then break end

			chest.allRollsJava = {}
			chest.itemDataJava = {}
			for k, pool in pairs( chest.poolsJava or {} ) do
				table.insert( chest.allRollsJava, ( pool.rolls[1] == pool.rolls[2] and pool.rolls[1] or pool.rolls[1]..'–'..pool.rolls[2] ) )

				local total_weight = 0
				for itemname, item in pairs(pool.items) do
					total_weight = total_weight + item[3]
				end
				pool.totalweight = total_weight

				q.fill_in_chest_item_details( chest.itemDataJava, pool, #chest.allRollsJava )
			end

			chest.allRollsJavaUpcoming = {}
			chest.itemDataJavaUpcoming = {}
			for k, pool in pairs( chest.poolsJavaUpcoming or chest.poolsJava or {} ) do
				table.insert( chest.allRollsJavaUpcoming, ( pool.rolls[1] == pool.rolls[2] and pool.rolls[1] or pool.rolls[1]..'–'..pool.rolls[2] ) )

				local total_weight = 0
				for itemname, item in pairs(pool.items) do
					total_weight = total_weight + item[3]
				end
				pool.totalweight = total_weight

				q.fill_in_chest_item_details( chest.itemDataJavaUpcoming, pool, #chest.allRollsJavaUpcoming )
			end

			chest.allRollsBedrock = {}
			chest.itemDataBedrock = {}
			for k, pool in pairs( chest.poolsBedrock or chest.poolsJava or {} ) do
				table.insert( chest.allRollsBedrock, ( pool.rolls[1] == pool.rolls[2] and pool.rolls[1] or pool.rolls[1]..'–'..pool.rolls[2] ) )

				local total_weight = 0
				for itemname, item in pairs(pool.items) do
					total_weight = total_weight + item[3]
				end
				pool.totalweight = total_weight

				q.fill_in_chest_item_details( chest.itemDataBedrock, pool, #chest.allRollsBedrock )
			end

			chest.allRollsBedrockUpcoming = {}
			chest.itemDataBedrockUpcoming = {}
			for k, pool in pairs( chest.poolsBedrockUpcoming or chest.poolsJava or {} ) do
				table.insert( chest.allRollsBedrockUpcoming, ( pool.rolls[1] == pool.rolls[2] and pool.rolls[1] or pool.rolls[1]..'–'..pool.rolls[2] ) )

				local total_weight = 0
				for itemname, item in pairs(pool.items) do
					total_weight = total_weight + item[3]
				end
				pool.totalweight = total_weight

				q.fill_in_chest_item_details( chest.itemDataBedrockUpcoming, pool, #chest.allRollsBedrockUpcoming )
			end
		end
	end,

	fill_in_chest_item_details = function( data, pool, ct )
		for item_name, item in pairs(pool.items) do
			if p.items[item_name] then
				local min_stacksize = item[1]
				local max_stacksize = item[2]
				local min_pool_rolls = pool.rolls[1]
				local max_pool_rolls = pool.rolls[2]
				local item_weight = item[3]

				if data[item_name] == nil then
					data[item_name] = {
						avgamount = 0,
						chanceany = 0,
						itemname = item_name,
						sortsize = {},
						sortweight = {},
						sizes = {},
						weights = {},
					}
					for i = 1, ct-1 do
						data[item_name].sortsize[i] = 0
						data[item_name].sortweight[i] = 0
						data[item_name].sizes[i] = '—'
						data[item_name].weights[i] = '—'
					end
				end

				data[item_name].avgamount = data[item_name].avgamount + p.calc_average_amount_this_item_per_pool(
					min_stacksize, max_stacksize,
					min_pool_rolls, max_pool_rolls,
					item_weight, pool.totalweight )

				data[item_name].chanceany = data[item_name].chanceany + (1 - data[item_name].chanceany) * p.calc_chance_any_of_this_item_per_pool(
					min_pool_rolls, max_pool_rolls,
					item_weight, pool.totalweight )

				data[item_name].sortsize[ct] = ( min_stacksize + max_stacksize ) / 2
				data[item_name].sortweight[ct] = item_weight;
				data[item_name].sizes[ct] = ( min_stacksize == max_stacksize and min_stacksize or min_stacksize .. '–' .. max_stacksize )
				data[item_name].weights[ct] = p.current_frame:expandTemplate{ title = 'fraction', args = { item_weight, pool.totalweight } }
			end
		end

		for item_name, d in pairs(data) do
			if not d.sizes[ct] then
				d.sortsize[ct] = 0
				d.sortweight[ct] = 0
				d.sizes[ct] = '—'
				d.weights[ct] = '—'
			end
		end
	end,

	construct_ordered_items_from_first_chest = function( chest_names, suffix )
		local items_from_first_table = {}
		local item_chests = {}
		local item_names_ordered = {}
		for item_name, item in pairs( p.chests[chest_names[1]]['itemData'..suffix] ) do
			table.insert( items_from_first_table, item )
		end

		table.sort( items_from_first_table, q.sort_items )

		for k, item in pairs( items_from_first_table ) do
			table.insert( item_names_ordered, item.itemname )
			item_chests[item.itemname] = true
		end

		return item_names_ordered, item_chests
	end,

	get_ordered_items_from_other_chests = function( chest_names, item_chests, suffix )
		local items_not_from_first_table = {}

		for chest_idx = 2, #chest_names do
			for item_name, item in pairs( p.chests[chest_names[chest_idx]]['itemData'..suffix] ) do
				if item_chests[item_name] == nil then
					p.items[item_name].itemname = item_name
					table.insert( items_not_from_first_table, p.chests[chest_names[chest_idx]]['itemData'..suffix][item_name] )
					item_chests[item_name] = true
				end
			end
		end

		table.sort( items_not_from_first_table, q.sort_items )

		return items_not_from_first_table
	end,

	add_other_items_to_first_list = function( chest_names, item_names_ordered, item_chests, items_not_from_first_table )
		for k, item in pairs( items_not_from_first_table ) do
			table.insert( item_names_ordered, item.itemname )
		end

		return item_names_ordered
	end,

	set_up_ordered_item_rows = function( chest_names, item_names_ordered, suffix )
		for k, itemname in pairs(item_names_ordered) do
			item_names_ordered[k] = {itemname}
			for chest_idx = 1, #chest_names do
				if suffix == 'JavaUpcoming' or p.chests[chest_names[chest_idx]]['pools'..suffix] ~= nil then
					local item_data = p.chests[chest_names[chest_idx]]['itemData'..suffix][itemname]
					if item_data == nil then
						table.insert( item_names_ordered[k], false )
					else
						table.insert( item_names_ordered[k], item_data )
					end
				end
			end
		end

		return item_names_ordered
	end,

	construct_ordered_item_rows = function( chest_names, suffix )
		-- for the first chest, sort its by chance desc, then by avg amount desc, then alphabetically asc
		local item_names_ordered, item_chests = q.construct_ordered_items_from_first_chest( chest_names, suffix )

		if #chest_names > 1 then
			-- after that, sort all the remaining items in list order
			local items_not_from_first_table = q.get_ordered_items_from_other_chests( chest_names, item_chests, suffix )
			item_names_ordered = q.add_other_items_to_first_list( chest_names, item_names_ordered, item_chests, items_not_from_first_table )
		end

		-- set up item_names_ordered so that each is a row, representing chest values
		item_names_ordered = q.set_up_ordered_item_rows( chest_names, item_names_ordered, suffix )

		return item_names_ordered
	end,

	print_table = function( chest_names, columns, ordered_item_rows, suffix )
		local html = {}

		local use_roll_row = false
		local use_superheader = false
		local superheader_sizes = {}
		for i = 1, #chest_names do
			sh = p.chests[chest_names[i]].superheader
			if sh ~= nil then
				if superheader_sizes[sh] == nil then
					superheader_sizes[sh] = 0
				end
				superheader_sizes[sh] = superheader_sizes[sh] + 1

				if #chest_names > 1 then
					use_superheader = true
				end
			end
			local allRolls = p.chests[chest_names[i]]['allRolls'..suffix]
			if #allRolls > 1 then
				use_roll_row = true
			end
		end
		if columns['taillepiles'] == nil and columns['poids'] == nil then
			use_roll_row = false
		end

		local rowspan = ( #chest_names > 1 and 1 or 0 ) + ( use_superheader and 1 or 0 ) + 1
		local hide_col_description = rowspan > 1 and q.tablelength(columns) == 1
		if use_roll_row then
			rowspan = rowspan + 1
		end

		if q.tablelength(columns) == 1 then
			for column_name, v in pairs(columns) do
				table.insert( html, "Les valeurs représentent " )
				table.insert( html, p.columns[column_name]:lower() )
				table.insert( html, "\n" )
			end
		end

		if #chest_names == 1 then

			if q.tablelength(columns) == 1 then
				table.insert( html, "<br>" )
			end

			local chest_name = chest_names[1]
			local allRolls = p.chests[chest_name]['allRolls'..suffix]
			local chest_type = p.chests[chest_name].chest_type or "coffre"

			local display_name = p.chests[chest_name].display_name

			chest_name = chest_name:gsub( "-", " " )

		    if chest_type ~= 'coffre' and chest_type ~= 'wagonnet de stockage' then
				table.insert( html, "Chaque " )
			else
				table.insert( html, "Chaque coffre " )
			if string.find(mw.ustring.lower(chest_name), 'bonus') == nil then -- "coffre bonus", pas "coffre de bonus"
				if string.find(mw.ustring.lower(chest_name), '^[aeiouyéÉ]') ~= nil then -- "coffre d'entrepôt", pas "coffre de entrepôt"
					table.insert( html, "d'" )
				else
					table.insert( html, "de " )
				end
			end
			end

			table.insert( html, display_name or chest_name )
			table.insert( html, " contient " )
			if #allRolls == 1 then
				table.insert( html, allRolls[1] )
			else
				table.insert( html, #allRolls )
				table.insert( html, ' groupes de ' )
				local s = ( #allRolls > 2 and ', ' or ' ' )
				for i = 1, #allRolls-1 do
					table.insert( html, allRolls[i] )
					table.insert( html, s )
				end
				table.insert( html, 'et ' )
				table.insert( html, allRolls[#allRolls] )
			end
			table.insert( html, " piles d'objets, avec la répartition suivante : \n" )
		end

		table.insert( html, '<div style="overflow:auto">\n' )
		table.insert( html, '<table class="wikitable sortable jquery-tablesorter">\n' )
		table.insert( html, "<tr>\n" )
		table.insert( html, "<th rowspan=" )
		table.insert( html, ( rowspan - ( hide_col_description and 1 or 0 ) ) )
		table.insert( html, "> Objet </th>\n" )

		local superheader_cols_used = {}

		if #chest_names > 1 then
			local row1, row2 = {}, {}

			for i = 1, #chest_names do

				if suffix == 'JavaUpcoming' or p.chests[chest_names[i]]['pools'..suffix] ~= nil then
					local allRolls = p.chests[chest_names[i]]['allRolls'..suffix]
					local colspan = q.tablelength(columns)
					local allRollsSpan = #allRolls == 0 and 1 or #allRolls
					if columns['taillepiles'] ~= nil then
						colspan = colspan - 1 + allRollsSpan
					end
					if columns['poids'] ~= nil then
						colspan = colspan - 1 + allRollsSpan
					end
					local row = row1

					rowspan = 1
					if use_superheader then
						sh = p.chests[chest_names[i]].superheader
						if sh ~= nil then
							if superheader_cols_used[sh] == nil then
								table.insert( row, "<th colspan=" )
								table.insert( row, ( colspan * superheader_sizes[sh] ) )
								table.insert( row, ">" )
								table.insert( row, sh )
								table.insert( row, "</th>\n" )
								superheader_cols_used[sh] = 0
							end
							row = row2
						else
							rowspan = rowspan + 1
						end
					end
					if use_roll_row and hide_col_description and #allRolls < 2 then
						rowspan = rowspan + 1
					end

					table.insert( row, "<th colspan=" )
					table.insert( row, colspan )
					if rowspan > 1 then
						table.insert( row, " rowspan=" )
						table.insert( row, rowspan )
					end
					table.insert( row, ">" )
					table.insert( row, p.chests[ chest_names[i] ].header )
					if #allRolls > 0 then
						table.insert( row, ' <br><span style="font-weight:normal; font-style:italic; font-size:11px;">(' )
						if #allRolls == 1 then
							table.insert( row, allRolls[1] )
						else
							local s = ( #allRolls > 2 and ', ' or ' ' )
							for i = 1, #allRolls-1 do
								table.insert( row, allRolls[i] )
								table.insert( row, s )
							end
							table.insert( row, 'et ' )
							table.insert( row, allRolls[#allRolls] )
						end
						table.insert( row, ' piles)</span>' )
					end
					table.insert( row, "</th>\n" )
				end
			end

			table.insert( html, table.concat( row1 ) )
			table.insert( html, "</tr><tr>\n" )
			if #row2 then
				table.insert( html, table.concat( row2 ) )
				table.insert( html, "</tr><tr>\n" )
			end
		end

		if not hide_col_description then
			local headersort_th_open
			if use_roll_row then
				headersort_th_open = "<th rowspan='2' class='headersort' role='columnheader button' data-sort-type='number'> <abbr title='"
			else
				headersort_th_open = "<th class='headersort' role='columnheader button' data-sort-type='number'> <abbr title='"
			end
			for i = 1, #chest_names do
				if suffix == 'JavaUpcoming' or p.chests[chest_names[i]]['pools'..suffix] ~= nil then
					local allRolls = p.chests[chest_names[i]]['allRolls'..suffix]
					local allRollsSpan = #allRolls == 0 and 1 or #allRolls
					local headersort_th_colspan_open
					if #allRolls > 1 then
						headersort_th_colspan_open = "<th colspan='" .. allRollsSpan .. "' role='columnheader'> <abbr title='"
					else
						headersort_th_colspan_open = headersort_th_open
					end

					if columns['taillepiles'] ~= nil then
						table.insert( html, headersort_th_colspan_open )
						table.insert( html, p.columns['taillepiles'] )
						table.insert( html, "'> Taille des piles </abbr> <span class=mobileonly>")
						table.insert( html, p.current_frame:extensionTag{
							name = 'ref', content = p.columns['taillepiles'], args = { name = 'taillepiles', group = 'FN' }
						} )
						table.insert( html, "</span></th>\n" )
					end
					if columns['poids'] ~= nil then
						table.insert( html, headersort_th_colspan_open )
						table.insert( html, p.columns['poids'] )
						table.insert( html, "'> Poids </abbr> <span class=mobileonly> ")
						table.insert( html, p.current_frame:extensionTag{
							name = 'ref', content = p.columns['poids'], args = { name = 'poids', group = 'FN' }
						} )
						table.insert( html, "</span></th>\n" )
					end
					if columns['probabilité'] ~= nil then
						table.insert( html, headersort_th_open )
						table.insert( html, p.columns['probabilité'] )
						table.insert( html, "'> Probabilité </abbr> <span class=mobileonly> ")
						table.insert( html, p.current_frame:extensionTag{
							name = 'ref', content = p.columns['probabilité'], args = { name = 'probabilité', group = 'FN' }
						} )
						table.insert( html, "</span></th>\n" )
					end
					if columns['objets'] ~= nil then
						table.insert( html, headersort_th_open )
						table.insert( html, p.columns['objets'] )
						table.insert( html, "'> Nb. d'objets </abbr> <span class=mobileonly> ")
						table.insert( html, p.current_frame:extensionTag{
							name = 'ref', content = p.columns['objets'], args = { name = 'objets', group = 'FN' }
						} )
						table.insert( html, "</span></th>\n" )
					end
					if columns['coffres'] ~= nil then
						table.insert( html, headersort_th_open )
						table.insert( html, p.columns['coffres'] )
						table.insert( html, "'> Nb. de coffres à ouvrir </abbr> <span class=mobileonly> ")
						table.insert( html, p.current_frame:extensionTag{
							name = 'ref', content = p.columns['coffres'], args = { name = 'coffres', group = 'FN' }
						} )
						table.insert( html, "</span></th>\n" )
					end
				end
			end
			table.insert( html, "</tr><tr>\n" )
		end

		if use_roll_row then
			local rowcols = ( columns['taillepiles'] ~= nil and 1 or 0 ) + ( columns['poids'] ~= nil and 1 or 0 )
			for i = 1, #chest_names do
				local allRolls = p.chests[chest_names[i]]['allRolls'..suffix]
				if #allRolls > 1 then
					for j = 1, rowcols do
						for k = 1, #allRolls do
							table.insert( html, "<th class='headersort' role='columnheader button' data-sort-type='number' style='font-weight:normal'><abbr title='Le coffre choisit " )
							table.insert( html, allRolls[k] )
							table.insert( html, " pile(s) aléatoirement parmi celles-ci.'>" )
							table.insert( html, allRolls[k] )
							table.insert( html, "×</abbr></th>\n" )
						end
					end
				end
			end
			table.insert( html, "</tr><tr>\n" )
		end

		for i = 1, #ordered_item_rows do
			if type( ordered_item_rows[i] ) == "table" then
				for j = 1, #ordered_item_rows[i] do

					local chest_item = ordered_item_rows[i][j]

					if type( chest_item ) == "table" then

						local avg_amount = string.format("%.3f", chest_item.avgamount)
						local chance_any = string.format("%.1f", chest_item.chanceany*100) .. "%"
						local num_chests = string.format("%.1f", 1/chest_item.chanceany)

						table.insert( html, "\n" )
						if columns['taillepiles'] ~= nil then
							for k = 1, #chest_item.sizes do
								table.insert( html, "<td style='text-align:center;' data-sort-value='" )
								table.insert( html, ( chest_item.sortsize[k] == 0 and "9e99" or chest_item.sortsize[k] ) )
								table.insert( html, "'>" )
								table.insert( html, chest_item.sizes[k] )
								table.insert( html, "</td>" )
							end
						end
						if columns['poids'] ~= nil then
							for k = 1, #chest_item.sizes do
								table.insert( html, "<td style='text-align:center;' data-sort-value='" )
								table.insert( html, ( chest_item.sortweight[k] == 0 and "9e99" or chest_item.sortweight[k] ) )
								table.insert( html, "'>" )
								table.insert( html, chest_item.weights[k] )
								table.insert( html, "</td>" )
							end
						end
						if columns['probabilité'] ~= nil then
							table.insert( html, "<td style='text-align:center;'>" )
							table.insert( html, chance_any )
							table.insert( html, "</td>" )
						end
						if columns['objets'] ~= nil then
							table.insert( html, "<td style='text-align:center;'>" )
							table.insert( html, avg_amount )
							table.insert( html, "</td>" )
						end
						if columns['coffres'] ~= nil then
							table.insert( html, "<td style='text-align:center;'>" )
							table.insert( html, num_chests )
							table.insert( html, "</td>" )
						end

					elseif type( chest_item ) == "boolean" then
						local allRolls = p.chests[chest_names[j-1]]['allRolls'..suffix]
						local allRollsSpan = #allRolls == 0 and 1 or #allRolls

						table.insert( html, "\n" )
						if columns['taillepiles'] ~= nil then
							for k = 1, allRollsSpan do
								table.insert( html, "<td data-sort-value='9e99' style='text-align:center;'>—</td>" )
							end
						end
						if columns['poids'] ~= nil then
							for k = 1, allRollsSpan do
								table.insert( html, "<td data-sort-value='9e99' style='text-align:center;'>—</td>" )
							end
						end
						if columns['probabilité'] ~= nil then
							table.insert( html, "<td data-sort-value='9e99' style='text-align:center;'>—</td>" )
						end
						if columns['objets'] ~= nil then
							table.insert( html, "<td data-sort-value='9e99' style='text-align:center;'>—</td>" )
						end
						if columns['coffres'] ~= nil then
							table.insert( html, "<td data-sort-value='9e99' style='text-align:center;'>—</td>" )
						end
					else
						if i > 1 then
							table.insert( html, "</tr><tr>" )
						end

						local item = p.items[chest_item]

						local s = require( 'Module:Sprite' )
						table.insert( html, "\n<td>" )
						local image, spriteCat = s.link {
							id = item.id or chest_item,
							link = item.link or item.title or string.gsub(chest_item,'-',' '),
							text = q.capitalize(item.title or string.gsub(chest_item,'-',' ')),
							wrap = 'true',
							data = ( item[1] == 'objet' and 'ObjetSprite' or 'BlocSprite' )
						}
						table.insert( html, image )
						table.insert( html, spriteCat )

						if item.note and p.notes[item.note] then
							table.insert( html, p.current_frame:extensionTag( 'ref', p.notes[item.note], { group='FN', name=item.note } ) )
						end

						if item.note1 and p.notes[item.note1] then
							if item.note == nil or p.notes[item.note] == nil or item.note ~= item.note1 then
								table.insert( html, p.current_frame:extensionTag( 'ref', p.notes[item.note1], { group='FN', name=item.note1 } ) )
							end
						end

						table.insert( html, "</td>" )
					end

					if j == #ordered_item_rows[i] then
						table.insert( html, "</tr>" )
					end

				end
				table.insert( html, "\n" )
			end
		end

		table.insert( html, "</table></div>")

		return table.concat( html )

	end,

	titlecase = function( str )
		local buf = {}
		for word in string.gfind(str, "%S+") do
			if word == "et" then
				table.insert( buf, word )
			else
				local first, rest = string.sub( word, 1, 1 ), string.sub( word, 2 )
				table.insert( buf, string.upper(first) .. string.lower(rest) )
			end
		end
		return table.concat( buf, " " )
	end,

	capitalize = function( str )
		return ( string.lower(str):gsub( "^%l", string.upper ):gsub( "^é", "É" ) )
	end,

	lcfirst = function( str )
		return ( string.gsub( str, "^%u", string.lower ) )
	end,

	compare_tables = function( a, b )
		local seen = {}
		for k, v in pairs( a ) do
			if type( v ) ~= type( b[k] ) then
				return true
			end
			if v ~= b[k] then
				return true
			end
			if type( v ) == 'table' and q.compare_tables( v, b[k] ) then
				return true
			end
			seen[k] = true
		end
		for k, v in pairs( b ) do
			if not seen[k] then
				return true
			end
		end
		return false
	end,
}

string.lpad = function(str, len, char)
	if char == nil then char = ' ' end
	return string.rep(char, len - #(''..str)) .. str
end

return p