Module:String/sandbox - Revision history

Grufo: Return always strings

2024-10-18T05:09:27Z

Return always strings

← Previous revision		Revision as of 05:09, 18 October 2024
Line 44:		Line 44:
	local new_args = str._getParameters( frame.args, {'s'} )		local new_args = str._getParameters( frame.args, {'s'} )
	local s = new_args['s'] or ''		local s = new_args['s'] or ''
	return mw.ustring.len( s )		return tostring(mw.ustring.len( s ))
	end		end

Line 311:		Line 311:

	if target_str == '' then		if target_str == '' then
	return 1		return '1'
	end		end

	local start = mw.ustring.find( source_str, target_str, 1, true )		local start = mw.ustring.find( source_str, target_str, 1, true )
	if start == nil then		if start == nil then
	~~start =~~ -1		return '-1'
	end		end

	return start		return tostring(start)
	end		end

Line 359:		Line 359:

	if source_str == '' or pattern == '' then		if source_str == '' or pattern == '' then
	return 0		return '0'
	end		end

Line 366:		Line 366:
	local start = mw.ustring.find( source_str, pattern, start_pos, plain )		local start = mw.ustring.find( source_str, pattern, start_pos, plain )
	if start == nil then		if start == nil then
	~~start =~~ 0		return '0'
	end		end

	return start		return tostring(start)
	end		end

Line 468:		Line 468:
	end		end
	local _, count = mw.ustring.gsub(source, pattern, '')		local _, count = mw.ustring.gsub(source, pattern, '')
	return count		return tostring(count)
	end		end

Grufo: Synch with upstream

2024-10-18T05:05:57Z

Synch with upstream

← Previous revision		Revision as of 05:05, 18 October 2024
Line 59:		Line 59:
	Parameters		Parameters
	s: The string to return a subset of		s: The string to return a subset of
	i: The ~~fist~~ index of the substring to return, defaults to 1.		i: The first index of the substring to return, defaults to 1.
	j: The last index of the string to return, defaults to the last character.		j: The last index of the string to return, defaults to the last character.

Line 165:		Line 165:
	end		end

	local iterator = mw.ustring.gmatch( s, pattern )		local iterator = mw.ustring.gmatch(s, pattern)
	if match_index > 0 then		if match_index > 0 then
	-- Forward search		-- Forward search
Line 177:		Line 177:
	else		else
	-- Reverse search		-- Reverse search
	local ~~match_buffer~~ = {}		local result_table = {}
	local ~~index~~ = 1		local count = 1
	match_index = -match_index

	for w in iterator do		for w in iterator do
	~~match_buffer~~[~~index~~] = w		result_table[count] = w
			count = count + 1

	-- Circular buffer with length 'match_index'
	-- Wraps around to overwrite matches too old to be the result,
	-- so memory use is O(match_index) and not O(total match count))
	index = (index == match_index) and 1 or (index + 1)
	end		end

			result = result_table[ count + match_index ]
	-- 'index' is now at oldest element, which next iteration would have
	-- overwritten. If 'match_buffer' has fewer than 'index' elements,
	-- there were too few matches; the resulting nil is handled below.
	result = match_buffer[index]
	end		end
	end		end
Line 416:		Line 407:
	if plain then		if plain then
	pattern = str._escapePattern( pattern )		pattern = str._escapePattern( pattern )
	replace = ~~mw.ustring~~.gsub( replace, "%%", "%%%%" ) --Only need to escape replacement sequences.		replace = string.gsub( replace, "%%", "%%%%" ) --Only need to escape replacement sequences.
	end		end

Line 592:		Line 583:
	]]		]]
	function str._escapePattern( pattern_str )		function str._escapePattern( pattern_str )
	return ~~mw.ustring~~.gsub( pattern_str, "([%(%)%.%%%+%-%*%?%[%^%$%]])", "%%%1" )		return ( string.gsub( pattern_str, "[%(%)%.%%%+%-%*%?%[%^%$%]]", "%%%0" ) )
	end		end

Wqnvlz: More precise comment

2022-04-07T07:13:28Z

More precise comment

← Previous revision		Revision as of 07:13, 7 April 2022
Line 186:		Line 186:
	-- Circular buffer with length 'match_index'		-- Circular buffer with length 'match_index'
	-- Wraps around to overwrite matches too old to be the result,		-- Wraps around to overwrite matches too old to be the result,
	-- so memory use is O(match_index) ~~instead~~ of O(~~len(s~~))		-- so memory use is O(match_index) and not O(total match count))
	index = (index == match_index) and 1 or (index + 1)		index = (index == match_index) and 1 or (index + 1)
	end		end

Wqnvlz: Clearer comment

2022-04-07T07:10:29Z

Clearer comment

← Previous revision		Revision as of 07:10, 7 April 2022
Line 192:		Line 192:
	-- 'index' is now at oldest element, which next iteration would have		-- 'index' is now at oldest element, which next iteration would have
	-- overwritten. If 'match_buffer' has fewer than 'index' elements,		-- overwritten. If 'match_buffer' has fewer than 'index' elements,
	-- there were too few matches. In ~~that~~ ~~case,~~ we ~~rightly~~ ~~return nil~~.		-- there were too few matches; the resulting nil is handled below.
	result = match_buffer[index]		result = match_buffer[index]
	end		end

Wqnvlz: Off by one!

2022-04-07T07:07:40Z

Off by one!

← Previous revision		Revision as of 07:07, 7 April 2022
Line 184:		Line 184:
	match_buffer[index] = w		match_buffer[index] = w

	-- Circular buffer with length match_index		-- Circular buffer with length 'match_index'
	-- Wraps around to overwrite matches too old to be the result,		-- Wraps around to overwrite matches too old to be the result,
	-- so memory use is O(match_index) instead of O(len(s))		-- so memory use is O(match_index) instead of O(len(s))
Line 190:		Line 190:
	end		end

			-- 'index' is now at oldest element, which next iteration would have
	-- Return value at position before index, minding the wraparound
	~~result~~ = match_buffer~~[(index~~ == 1) ~~and~~ ~~match_index or (~~index ~~- 1)]~~		-- overwritten. If 'match_buffer' has fewer than 'index' elements,
			-- there were too few matches. In that case, we rightly return nil.
			result = match_buffer[index]
	end		end
	end		end

Wqnvlz: Finish incomplete rename

2022-04-07T06:17:24Z

Finish incomplete rename

← Previous revision		Revision as of 06:17, 7 April 2022
Line 177:		Line 177:
	else		else
	-- Reverse search		-- Reverse search
	local ~~result_table~~ = {}		local match_buffer = {}
	local index = 1		local index = 1
	match_index = -match_index		match_index = -match_index

Wqnvlz: Increase readability

2022-04-07T06:15:52Z

Increase readability

← Previous revision		Revision as of 06:15, 7 April 2022
Line 182:		Line 182:

	for w in iterator do		for w in iterator do
	~~result_table~~[index] = w		match_buffer[index] = w

	-- Circular buffer with length = match_index
	-- ~~Overwrites~~ ~~matches~~ ~~too~~ ~~old~~ ~~to be the result~~		-- Circular buffer with length match_index
			-- Wraps around to overwrite matches too old to be the result,
⚫	index = index == match_index and 1 or index + 1
			-- so memory use is O(match_index) instead of O(len(s))
		⚫	index = (index == match_index) and 1 or (index + 1)
	end		end

			-- Return value at position before index, minding the wraparound
	result = ~~result_table~~[index == 1 and match_index or index - 1]		result = match_buffer[(index == 1) and match_index or (index - 1)]
	end		end
	end		end

Wqnvlz: Don't store unneeded matches in reverse search

2022-04-04T22:08:51Z

Don't store unneeded matches in reverse search

← Previous revision		Revision as of 22:08, 4 April 2022
Line 165:		Line 165:
	end		end

	local iterator = mw.ustring.gmatch(s, pattern)		local iterator = mw.ustring.gmatch( s, pattern )
	if match_index > 0 then		if match_index > 0 then
	-- Forward search		-- Forward search
Line 178:		Line 178:
	-- Reverse search		-- Reverse search
	local result_table = {}		local result_table = {}
	local ~~count~~ = 1		local index = 1
			match_index = -match_index

	for w in iterator do		for w in iterator do
	result_table[~~count~~] = w		result_table[index] = w
			-- Circular buffer with length = match_index
	count = count + 1
			-- Overwrites matches too old to be the result
			index = index == match_index and 1 or index + 1
	end		end

	result = result_table[ ~~count~~ + match_index ]		result = result_table[index == 1 and match_index or index - 1]
	end		end
	end		end

Wqnvlz: Sync

2022-04-04T21:29:02Z

Sync

← Previous revision		Revision as of 21:29, 4 April 2022
Line 148:		Line 148:
	if math.abs(start) < 1 or math.abs(start) > mw.ustring.len( s ) then		if math.abs(start) < 1 or math.abs(start) > mw.ustring.len( s ) then
	return str._error( 'Requested start is out of range' )		return str._error( 'Requested start is out of range' )
		⚫	end
		⚫	if match_index == 0 then
			return str._error( 'Match index is out of range' )
	end		end
	if plain_flag then		if plain_flag then
Line 163:		Line 166:

	local iterator = mw.ustring.gmatch(s, pattern)		local iterator = mw.ustring.gmatch(s, pattern)
	if match_index == 0 then		if match_index > 0 then
	~~local~~ ~~tbl~~ ~~= {}~~		-- Forward search
	for w in iterator do		for w in iterator do
		⚫	match_index = match_index - 1
	table.insert(tbl, w)
			if match_index == 0 then
			result = w
		⚫	break
		⚫	end
	end		end
	result = table.concat(tbl)
	else		else
		⚫	-- Reverse search
⚫	if match_index > 0 then
		⚫	local result_table = {}
	-- Forward search
	~~for~~ w in ~~iterator do~~		local count = 1
		⚫	for w in iterator do
⚫	match_index = match_index - 1
	~~if match_index~~ =~~= 0~~ ~~then~~		result_table[count] = w
	~~result~~ = w		count = count + 1
⚫	break
	end
⚫	end
	else
⚫	-- Reverse search
⚫	local result_table = {}
	local count = 1
⚫	for w in iterator do
⚫	result_table[count] = w
	count = count + 1
⚫	end

	result = result_table[ count + match_index ]
	end		end

		⚫	result = result_table[ count + match_index ]
	end		end
	end		end

Andrybak: test

2020-08-29T10:27:39Z

test

← Previous revision		Revision as of 10:27, 29 August 2020
Line 166:		Line 166:
	local tbl = {}		local tbl = {}
	for w in iterator do		for w in iterator do
	~~tbl~~.insert(w)		table.insert(tbl, w)
	end		end
	result = table.concat(tbl)		result = table.concat(tbl)