Search results
The page "Module:Exponential search/sandbox" does not exist. You can request that it be created, but consider checking the search results below to see whether the topic is already covered.
- This module provides a generic exponential search algorithm. This kind of search can be useful when you want to find a key in some kind of sorted array...4 KB (542 words) - 21:17, 29 August 2024
- number for a set of talk -- archive pages. local expSearch = require('Module:Exponential search') local p = {} local function raiseStartNumberError(start)...2 KB (252 words) - 15:01, 1 October 2019
- local search = require('Exponential search') local work = function(init, predicate, linkformat, listformat) local max = search(predicate, init) local...543 bytes (78 words) - 16:13, 25 February 2015
- that [[Module:Exponential search]] which is -- only needed by this one function doesn't get millions of transclusions local expSearch = require("Module:Exponential...16 KB (1,924 words) - 20:03, 14 August 2024
- with an optional prefix such as "data1", "data2", etc. It uses an exponential search algorithm to find the length, so as to use as few table lookups as...12 KB (1,338 words) - 02:01, 19 August 2024
- 'query'; end decode = base62(dt[2]); -- base62 string -> exponential number if not decode then return nil; -- nil return...38 KB (5,328 words) - 17:18, 9 August 2023
- 'query'; end decode = base62(dt[2]); -- base62 string -> exponential number if not decode then return nil; -- nil return...38 KB (5,288 words) - 12:04, 22 October 2022
- with an optional prefix such as "data1", "data2", etc. It uses an exponential search algorithm to find the length, so as to use as few table lookups as
- 'query'; end decode = base62(dt[2]); -- base62 string -> exponential number if not decode then return nil; -- nil return