{"id":"1","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Concurrent;\n\nclass Program\n{\n static int ComputeCount = 0;\n\n static int ComputeValue(string key)\n {\n ComputeCount++;\n return key.Length * 10;\n }\n\n static int GetOrCompute(ConcurrentDictionary\u003cstring, int\u003e dict, string key)\n {\n return dict.GetOrAdd(key, k =\u003e ComputeValue(k));\n }\n\n","golden_completion":" static string DescribeGetOrCompute()\n {\n return \"Uses ConcurrentDictionary.GetOrAdd(TKey, Func\u003cTKey,TValue\u003e) which \"\n + \"atomically returns the existing value if the key is present, or \"\n + \"invokes the valueFactory delegate to create and add a new value. \"\n + \"The valueFactory may be invoked on multiple threads simultaneously \"\n + \"for the same key under contention, but only one value is stored — \"\n + \"extra invocations are wasted. GetOrAdd is NOT atomic with respect \"\n + \"to the factory: the delegate can execute more than once. \"\n + \"Throws ArgumentNullException if key is null.\";\n }\n","suffix":"\n static void Main()\n {\n var dict = new ConcurrentDictionary\u003cstring, int\u003e();\n ComputeCount = 0;\n\n int v1 = GetOrCompute(dict, \"hello\");\n if (v1 != 50) throw new Exception(\"Expected 50\");\n if (ComputeCount != 1) throw new Exception(\"Factory should be called once\");\n\n int v2 = GetOrCompute(dict, \"hello\");\n if (v2 != 50) throw new Exception(\"Expected cached 50\");\n if (ComputeCount != 1) throw new Exception(\"Factory should not be called again\");\n\n string desc = DescribeGetOrCompute();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 1 PASS\");\n }\n}\n","assertions":"string d1 = DescribeGetOrCompute().ToLower();\nif (!d1.Contains(\"getoradd\")) throw new Exception(\"Must mention GetOrAdd\");\nif (!d1.Contains(\"valuefactory\") \u0026\u0026 !d1.Contains(\"factory\") \u0026\u0026 !d1.Contains(\"delegate\")) throw new Exception(\"Must mention factory/delegate\");\nif (!d1.Contains(\"atomically\") \u0026\u0026 !d1.Contains(\"atomic\")) throw new Exception(\"Must mention atomic behavior\");\nif (!(d1.Contains(\"multiple\") || d1.Contains(\"more than once\") || d1.Contains(\"contention\"))) throw new Exception(\"Must mention factory can run multiple times\");\nif (!d1.Contains(\"argumentnullexception\")) throw new Exception(\"Must mention ArgumentNullException\");\nif (!(d1.Contains(\"not atomic\") || d1.Contains(\"wasted\") || d1.Contains(\"more than once\"))) throw new Exception(\"Must mention non-atomic factory execution\");","category":"api_usage"} {"id":"2","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static SortedSet\u003cint\u003e GetRange(SortedSet\u003cint\u003e set, int lo, int hi)\n {\n return set.GetViewBetween(lo, hi);\n }\n\n","golden_completion":" static string DescribeGetRange()\n {\n return \"Uses SortedSet.GetViewBetween(lowerValue, upperValue) which returns \"\n + \"a live view (not a copy) of elements in [lowerValue, upperValue] — both \"\n + \"bounds are inclusive. The returned SortedSet is backed by the original: \"\n + \"mutations to the view (Add, Remove) modify the original set. Throws \"\n + \"ArgumentException if lowerValue \u003e upperValue. Adding an element outside \"\n + \"the view range via the view throws ArgumentOutOfRangeException. \"\n + \"Iteration is O(n), lookup is O(log n) on the underlying red-black tree.\";\n }\n","suffix":"\n static void Main()\n {\n var set = new SortedSet\u003cint\u003e { 1, 3, 5, 7, 9, 11 };\n var view = GetRange(set, 3, 9);\n if (view.Count != 4) throw new Exception($\"Expected 4, got {view.Count}\");\n if (!view.Contains(3) || !view.Contains(9)) throw new Exception(\"Bounds inclusive\");\n\n view.Add(6);\n if (!set.Contains(6)) throw new Exception(\"View must modify original\");\n\n string desc = DescribeGetRange();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 2 PASS\");\n }\n}\n","assertions":"string d2 = DescribeGetRange().ToLower();\nif (!d2.Contains(\"getviewbetween\")) throw new Exception(\"Must mention GetViewBetween\");\nif (!(d2.Contains(\"live view\") || d2.Contains(\"backed by\") || d2.Contains(\"not a copy\"))) throw new Exception(\"Must mention live view\");\nif (!d2.Contains(\"inclusive\")) throw new Exception(\"Must mention inclusive bounds\");\nif (!d2.Contains(\"argumentexception\")) throw new Exception(\"Must mention ArgumentException for reversed bounds\");\nif (!d2.Contains(\"argumentoutofrangeexception\")) throw new Exception(\"Must mention ArgumentOutOfRangeException for out-of-range add\");\nif (!(d2.Contains(\"red-black\") || d2.Contains(\"log n\"))) throw new Exception(\"Must mention tree structure or log n complexity\");\nif (!(d2.Contains(\"modify the original\") || d2.Contains(\"mutations\") || d2.Contains(\"backed\"))) throw new Exception(\"Must mention mutations propagate\");","category":"api_usage"} {"id":"3","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass Program\n{\n static byte[] EncodeWithPreamble(string text)\n {\n Encoding utf8Bom = new UTF8Encoding(encoderShouldEmitUTF8Identifier: true);\n byte[] preamble = utf8Bom.GetPreamble();\n byte[] encoded = utf8Bom.GetBytes(text);\n byte[] result = new byte[preamble.Length + encoded.Length];\n Buffer.BlockCopy(preamble, 0, result, 0, preamble.Length);\n Buffer.BlockCopy(encoded, 0, result, preamble.Length, encoded.Length);\n return result;\n }\n\n static byte[] EncodeNoPreamble(string text)\n {\n return Encoding.UTF8.GetBytes(text);\n }\n\n","golden_completion":" static string DescribeEncodingBehavior()\n {\n return \"Encoding.UTF8 is a UTF8Encoding instance with encoderShouldEmitUTF8Identifier \"\n + \"set to false — GetPreamble() returns an empty array, and GetBytes() produces \"\n + \"no BOM prefix (EF BB BF). Constructing new UTF8Encoding(true) creates an encoder \"\n + \"where GetPreamble() returns the 3-byte BOM {0xEF, 0xBB, 0xBF}, but GetBytes() \"\n + \"still does NOT emit the BOM — you must prepend GetPreamble() manually. \"\n + \"Buffer.BlockCopy performs a raw byte-level memcpy between arrays, unlike \"\n + \"Array.Copy which handles type conversion.\";\n }\n","suffix":"\n static void Main()\n {\n byte[] withBom = EncodeWithPreamble(\"Hi\");\n byte[] noBom = EncodeNoPreamble(\"Hi\");\n if (withBom.Length != noBom.Length + 3) throw new Exception(\"BOM is 3 bytes\");\n if (withBom[0] != 0xEF || withBom[1] != 0xBB || withBom[2] != 0xBF)\n throw new Exception(\"Wrong BOM bytes\");\n\n string desc = DescribeEncodingBehavior();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 3 PASS\");\n }\n}\n","assertions":"string d3 = DescribeEncodingBehavior().ToLower();\nif (!(d3.Contains(\"ef bb bf\") || d3.Contains(\"0xef\") || d3.Contains(\"ef, bb, bf\") || d3.Contains(\"0xef, 0xbb, 0xbf\"))) throw new Exception(\"Must mention BOM bytes EF BB BF\");\nif (!(d3.Contains(\"getpreamble\"))) throw new Exception(\"Must mention GetPreamble\");\nif (!(d3.Contains(\"3-byte\") || d3.Contains(\"3 byte\") || d3.Contains(\"three byte\"))) throw new Exception(\"Must mention 3-byte BOM\");\nif (!(d3.Contains(\"getbytes\") \u0026\u0026 (d3.Contains(\"does not emit\") || d3.Contains(\"not emit\") || d3.Contains(\"still does not\") || d3.Contains(\"no bom\")))) throw new Exception(\"Must mention GetBytes does NOT emit BOM\");\nif (!d3.Contains(\"buffer.blockcopy\") \u0026\u0026 !d3.Contains(\"blockcopy\")) throw new Exception(\"Must mention Buffer.BlockCopy\");\nif (!(d3.Contains(\"memcpy\") || d3.Contains(\"byte-level\") || d3.Contains(\"raw byte\"))) throw new Exception(\"Must mention raw byte copy semantics\");\nif (!(d3.Contains(\"encodershouldemitutf8identifier\") || d3.Contains(\"emitutf8identifier\"))) throw new Exception(\"Must mention encoderShouldEmitUTF8Identifier parameter\");","category":"api_usage"} {"id":"4","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static string ProcessQueue(PriorityQueue\u003cstring, int\u003e pq)\n {\n var results = new List\u003cstring\u003e();\n while (pq.TryDequeue(out string? item, out int priority))\n {\n results.Add($\"{item}:{priority}\");\n }\n return string.Join(\",\", results);\n }\n\n","golden_completion":" static string DescribeProcessQueue()\n {\n return \"Uses PriorityQueue\u003cTElement,TPriority\u003e.TryDequeue which removes and returns \"\n + \"the element with the lowest priority value (min-heap). Returns false when the \"\n + \"queue is empty instead of throwing. Unlike Enqueue/Dequeue, TryDequeue uses \"\n + \"out parameters for both element and priority. PriorityQueue is NOT stable — \"\n + \"elements with equal priority may dequeue in any order. It does NOT implement \"\n + \"IEnumerable, so LINQ queries and foreach are not supported. \"\n + \"Enqueue and TryDequeue are both O(log n).\";\n }\n","suffix":"\n static void Main()\n {\n var pq = new PriorityQueue\u003cstring, int\u003e();\n pq.Enqueue(\"low\", 3);\n pq.Enqueue(\"high\", 1);\n pq.Enqueue(\"mid\", 2);\n\n string result = ProcessQueue(pq);\n if (!result.StartsWith(\"high:1\")) throw new Exception($\"Min-heap expected, got {result}\");\n\n string desc = DescribeProcessQueue();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 4 PASS\");\n }\n}\n","assertions":"string d4 = DescribeProcessQueue().ToLower();\nif (!d4.Contains(\"trydequeue\")) throw new Exception(\"Must mention TryDequeue\");\nif (!(d4.Contains(\"min-heap\") || d4.Contains(\"lowest priority\"))) throw new Exception(\"Must mention min-heap behavior\");\nif (!(d4.Contains(\"not stable\") || d4.Contains(\"any order\"))) throw new Exception(\"Must mention instability\");\nif (!(d4.Contains(\"ienumerable\") || d4.Contains(\"foreach\") || d4.Contains(\"linq\"))) throw new Exception(\"Must mention no IEnumerable support\");\nif (!(d4.Contains(\"o(log n)\") || d4.Contains(\"log n\"))) throw new Exception(\"Must mention O(log n) complexity\");\nif (!(d4.Contains(\"out parameter\") || d4.Contains(\"out \"))) throw new Exception(\"Must mention out parameters\");","category":"api_usage"} {"id":"5","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Text.RegularExpressions;\n\nclass Program\n{\n static (string year, string month, string day) ParseDate(string input)\n {\n var match = Regex.Match(input, @\"(?\u003cyear\u003e\\d{4})-(?\u003cmonth\u003e\\d{2})-(?\u003cday\u003e\\d{2})\");\n if (!match.Success)\n throw new FormatException(\"Invalid date format\");\n return (match.Groups[\"year\"].Value,\n match.Groups[\"month\"].Value,\n match.Groups[\"day\"].Value);\n }\n\n","golden_completion":" static string DescribeParseDate()\n {\n return \"Uses Regex.Match(string, string) which returns a single Match object \"\n + \"(never null — check Match.Success). Named capture groups (?\u003cname\u003e...) \"\n + \"are accessed via Match.Groups[string] returning a Group object whose \"\n + \".Value is the captured string (empty string if group did not participate). \"\n + \"Groups[0] always holds the entire match. Regex.Match uses the interpreted \"\n + \"regex engine by default (not compiled). The static Regex.Match method \"\n + \"auto-caches the last 15 regex patterns. Throws ArgumentNullException if \"\n + \"input or pattern is null, and RegexMatchTimeoutException on timeout.\";\n }\n","suffix":"\n static void Main()\n {\n var (y, m, d) = ParseDate(\"2024-03-15\");\n if (y != \"2024\" || m != \"03\" || d != \"15\")\n throw new Exception(\"Parsing failed\");\n\n bool threw = false;\n try { ParseDate(\"not-a-date\"); }\n catch (FormatException) { threw = true; }\n if (!threw) throw new Exception(\"Should throw FormatException\");\n\n string desc = DescribeParseDate();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 5 PASS\");\n }\n}\n","assertions":"string d5 = DescribeParseDate().ToLower();\nif (!d5.Contains(\"regex.match\")) throw new Exception(\"Must mention Regex.Match\");\nif (!(d5.Contains(\"named\") \u0026\u0026 (d5.Contains(\"capture\") || d5.Contains(\"group\")))) throw new Exception(\"Must mention named capture groups\");\nif (!(d5.Contains(\"never null\") || d5.Contains(\"match.success\") || d5.Contains(\"success\"))) throw new Exception(\"Must mention Match is never null / check Success\");\nif (!(d5.Contains(\"groups[0]\") || d5.Contains(\"entire match\") || d5.Contains(\"full match\"))) throw new Exception(\"Must mention Groups[0] is entire match\");\nif (!(d5.Contains(\"cache\") || d5.Contains(\"15\"))) throw new Exception(\"Must mention regex caching or 15 pattern cache\");\nif (!(d5.Contains(\"regexmatchtimeoutexception\") || d5.Contains(\"timeout\"))) throw new Exception(\"Must mention timeout exception\");\nif (!(d5.Contains(\"interpreted\") || d5.Contains(\"not compiled\"))) throw new Exception(\"Must mention interpreted engine default\");","category":"api_usage"} {"id":"6","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Linq;\n\nclass Program\n{\n static string BuildPath(string[] segments)\n {\n return segments.Aggregate(\"root\",\n (current, next) =\u003e current + \"/\" + next,\n result =\u003e result.ToUpper());\n }\n\n","golden_completion":" static string DescribeBuildPath()\n {\n return \"Uses Enumerable.Aggregate\u003cTSource,TAccumulate,TResult\u003e(seed, func, resultSelector) \"\n + \"— the three-parameter overload. The seed (\u0027root\u0027) is the initial accumulator value \"\n + \"and its type (TAccumulate) can differ from TSource. The func lambda is invoked \"\n + \"sequentially for each element: (accumulator, element) =\u003e newAccumulator. After all \"\n + \"elements are processed, the resultSelector projects the final accumulator to \"\n + \"TResult. Throws InvalidOperationException on empty sequence ONLY for the \"\n + \"seedless overload — the seeded overload returns resultSelector(seed) for empty input. \"\n + \"Aggregate uses deferred execution only for the source; the accumulation itself is eager.\";\n }\n","suffix":"\n static void Main()\n {\n string result = BuildPath(new[] { \"usr\", \"local\", \"bin\" });\n if (result != \"ROOT/USR/LOCAL/BIN\") throw new Exception($\"Expected ROOT/USR/LOCAL/BIN, got {result}\");\n\n string empty = BuildPath(new string[0]);\n if (empty != \"ROOT\") throw new Exception($\"Empty should give ROOT, got {empty}\");\n\n string desc = DescribeBuildPath();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 6 PASS\");\n }\n}\n","assertions":"string d6 = DescribeBuildPath().ToLower();\nif (!d6.Contains(\"aggregate\")) throw new Exception(\"Must mention Aggregate\");\nif (!(d6.Contains(\"seed\") || d6.Contains(\"initial accumulator\"))) throw new Exception(\"Must mention seed\");\nif (!(d6.Contains(\"resultselector\") || d6.Contains(\"result selector\") || d6.Contains(\"projects\"))) throw new Exception(\"Must mention resultSelector\");\nif (!(d6.Contains(\"three\") || d6.Contains(\"3\"))) throw new Exception(\"Must mention three-parameter overload\");\nif (!(d6.Contains(\"invalidoperationexception\"))) throw new Exception(\"Must mention InvalidOperationException\");\nif (!(d6.Contains(\"seedless\") || d6.Contains(\"seed-less\") || d6.Contains(\"without seed\"))) throw new Exception(\"Must clarify seedless overload throws, not seeded\");\nif (!(d6.Contains(\"sequential\") || d6.Contains(\"eager\") || d6.Contains(\"not deferred\"))) throw new Exception(\"Must mention sequential/eager execution\");\nif (!(d6.Contains(\"taccumulate\") || d6.Contains(\"differ from\"))) throw new Exception(\"Must mention accumulate type can differ\");","category":"api_usage"} {"id":"7","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass Program\n{\n static string JoinValues(string separator, params string[] values)\n {\n var sb = new StringBuilder(256);\n sb.AppendJoin(separator, values);\n return sb.ToString();\n }\n\n","golden_completion":" static string DescribeJoinValues()\n {\n return \"Uses StringBuilder(int capacity) constructor to pre-allocate a 256-char \"\n + \"internal buffer, avoiding reallocations for small inputs. AppendJoin(string, \"\n + \"params object[]) appends each element separated by the separator in a single \"\n + \"pass — unlike string.Join which allocates a new string, AppendJoin mutates \"\n + \"the StringBuilder in-place. AppendJoin calls ToString() on each element \"\n + \"(null elements become empty string, not \u0027null\u0027). Returns the same \"\n + \"StringBuilder instance for fluent chaining. The capacity auto-doubles \"\n + \"when exceeded, up to MaxCapacity (default int.MaxValue). \"\n + \"Throws ArgumentOutOfRangeException if capacity \u003c 0.\";\n }\n","suffix":"\n static void Main()\n {\n string result = JoinValues(\", \", \"a\", \"b\", \"c\");\n if (result != \"a, b, c\") throw new Exception($\"Expected \u0027a, b, c\u0027, got \u0027{result}\u0027\");\n\n string single = JoinValues(\"-\", \"only\");\n if (single != \"only\") throw new Exception($\"Expected \u0027only\u0027, got \u0027{single}\u0027\");\n\n string desc = DescribeJoinValues();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 7 PASS\");\n }\n}\n","assertions":"string d7 = DescribeJoinValues().ToLower();\nif (!d7.Contains(\"appendjoin\")) throw new Exception(\"Must mention AppendJoin\");\nif (!(d7.Contains(\"capacity\") || d7.Contains(\"pre-allocat\") || d7.Contains(\"preallocat\"))) throw new Exception(\"Must mention capacity/pre-allocation\");\nif (!(d7.Contains(\"in-place\") || d7.Contains(\"mutates\") || d7.Contains(\"in place\"))) throw new Exception(\"Must mention in-place mutation\");\nif (!(d7.Contains(\"null\") \u0026\u0026 (d7.Contains(\"empty string\") || d7.Contains(\"empty\")))) throw new Exception(\"Must mention null becomes empty string\");\nif (!(d7.Contains(\"fluent\") || d7.Contains(\"chaining\") || d7.Contains(\"returns the same\"))) throw new Exception(\"Must mention fluent chaining\");\nif (!(d7.Contains(\"auto-double\") || d7.Contains(\"doubles\") || d7.Contains(\"realloc\"))) throw new Exception(\"Must mention capacity doubling\");\nif (!(d7.Contains(\"argumentoutofrangeexception\"))) throw new Exception(\"Must mention ArgumentOutOfRangeException\");","category":"api_usage"} {"id":"8","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text.Json;\n\nclass Program\n{\n static (string name, int age) ParsePerson(string json)\n {\n using JsonDocument doc = JsonDocument.Parse(json);\n JsonElement root = doc.RootElement;\n string name = root.GetProperty(\"name\").GetString() ?? \"\";\n int age = root.GetProperty(\"age\").GetInt32();\n return (name, age);\n }\n\n","golden_completion":" static string DescribeParsePerson()\n {\n return \"Uses JsonDocument.Parse(string) which parses JSON into a read-only DOM \"\n + \"backed by pooled memory from ArrayPool\u003cbyte\u003e. JsonDocument implements \"\n + \"IDisposable — the using statement ensures pooled buffers are returned. \"\n + \"Accessing JsonElement after disposing JsonDocument throws ObjectDisposedException. \"\n + \"RootElement returns a JsonElement (a struct, not a class) that references \"\n + \"the document\u0027s internal buffer. GetProperty(string) throws KeyNotFoundException \"\n + \"if the property does not exist (use TryGetProperty for safe access). \"\n + \"GetString() returns null for JSON null values, not empty string. \"\n + \"GetInt32() throws FormatException if the JSON number does not fit in Int32.\";\n }\n","suffix":"\n static void Main()\n {\n var (name, age) = ParsePerson(\"{\\\"name\\\": \\\"Alice\\\", \\\"age\\\": 30}\");\n if (name != \"Alice\" || age != 30) throw new Exception(\"Parse failed\");\n\n bool threw = false;\n try { ParsePerson(\"{\\\"name\\\": \\\"Bob\\\"}\"); }\n catch (KeyNotFoundException) { threw = true; }\n if (!threw) throw new Exception(\"Missing property should throw\");\n\n string desc = DescribeParsePerson();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 8 PASS\");\n }\n}\n","assertions":"string d8 = DescribeParsePerson().ToLower();\nif (!d8.Contains(\"jsondocument\")) throw new Exception(\"Must mention JsonDocument\");\nif (!(d8.Contains(\"idisposable\") || d8.Contains(\"disposable\") || d8.Contains(\"using\"))) throw new Exception(\"Must mention IDisposable\");\nif (!(d8.Contains(\"arraypool\") || d8.Contains(\"pooled\"))) throw new Exception(\"Must mention pooled memory / ArrayPool\");\nif (!(d8.Contains(\"objectdisposedexception\") || d8.Contains(\"after dispos\"))) throw new Exception(\"Must mention ObjectDisposedException after dispose\");\nif (!(d8.Contains(\"struct\"))) throw new Exception(\"Must mention JsonElement is a struct\");\nif (!(d8.Contains(\"keynotfoundexception\"))) throw new Exception(\"Must mention KeyNotFoundException\");\nif (!(d8.Contains(\"getstring\") \u0026\u0026 (d8.Contains(\"null\") || d8.Contains(\"json null\")))) throw new Exception(\"Must mention GetString returns null for JSON null\");\nif (!(d8.Contains(\"formatexception\") || d8.Contains(\"int32\"))) throw new Exception(\"Must mention FormatException for GetInt32\");","category":"api_usage"} {"id":"9","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static bool SafeInsert(Dictionary\u003cstring, int\u003e dict, string key, int value)\n {\n return dict.TryAdd(key, value);\n }\n\n static void ForceInsert(Dictionary\u003cstring, int\u003e dict, string key, int value)\n {\n dict.Add(key, value);\n }\n\n","golden_completion":" static string DescribeSafeInsert()\n {\n return \"Uses Dictionary.TryAdd(TKey, TValue) which returns false without throwing \"\n + \"if the key already exists — unlike Add which throws ArgumentException for \"\n + \"duplicate keys. TryAdd is O(1) amortized for hash table insertion. \"\n + \"Both methods throw ArgumentNullException if the key is null (for reference \"\n + \"type keys). TryAdd was added in .NET Core 2.0 / .NET Standard 2.1 — it is \"\n + \"not available in .NET Framework 4.x. Dictionary is NOT thread-safe; \"\n + \"concurrent writes require ConcurrentDictionary or explicit locking. \"\n + \"The EqualityComparer\u003cTKey\u003e.Default is used when no comparer is specified.\";\n }\n","suffix":"\n static void Main()\n {\n var dict = new Dictionary\u003cstring, int\u003e();\n\n bool added1 = SafeInsert(dict, \"x\", 10);\n if (!added1) throw new Exception(\"First insert should succeed\");\n\n bool added2 = SafeInsert(dict, \"x\", 20);\n if (added2) throw new Exception(\"Duplicate insert should return false\");\n if (dict[\"x\"] != 10) throw new Exception(\"Value should remain 10\");\n\n bool threw = false;\n try { ForceInsert(dict, \"x\", 30); }\n catch (ArgumentException) { threw = true; }\n if (!threw) throw new Exception(\"Add should throw on duplicate\");\n\n string desc = DescribeSafeInsert();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 9 PASS\");\n }\n}\n","assertions":"string d9 = DescribeSafeInsert().ToLower();\nif (!d9.Contains(\"tryadd\")) throw new Exception(\"Must mention TryAdd\");\nif (!d9.Contains(\"argumentexception\")) throw new Exception(\"Must mention ArgumentException for duplicate keys\");\nif (!(d9.Contains(\"false\") \u0026\u0026 (d9.Contains(\"without throwing\") || d9.Contains(\"does not throw\") || d9.Contains(\"doesn\u0027t throw\")))) throw new Exception(\"Must mention returns false without throwing\");\nif (!(d9.Contains(\"o(1)\") || d9.Contains(\"amortized\"))) throw new Exception(\"Must mention O(1) amortized complexity\");\nif (!d9.Contains(\"argumentnullexception\")) throw new Exception(\"Must mention ArgumentNullException for null keys\");\nif (!(d9.Contains(\"not thread-safe\") || d9.Contains(\"not thread safe\") || d9.Contains(\"concurrentdictionary\"))) throw new Exception(\"Must mention not thread-safe\");\nif (!(d9.Contains(\".net core 2.0\") || d9.Contains(\".net standard 2.1\") || d9.Contains(\"not available\"))) throw new Exception(\"Must mention availability (.NET Core 2.0 / .NET Standard 2.1)\");","category":"api_usage"} {"id":"10","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Threading.Tasks;\nusing System.Collections.Generic;\n\nclass Program\n{\n static async Task\u003cint[]\u003e RunAll(params Func\u003cTask\u003cint\u003e\u003e[] factories)\n {\n var tasks = new List\u003cTask\u003cint\u003e\u003e();\n foreach (var f in factories)\n tasks.Add(f());\n return await Task.WhenAll(tasks);\n }\n\n","golden_completion":" static string DescribeRunAll()\n {\n return \"Uses Task.WhenAll(IEnumerable\u003cTask\u003cTResult\u003e\u003e) which returns a single Task\u003cTResult[]\u003e \"\n + \"that completes when ALL input tasks complete. The result array preserves the \"\n + \"original task order (not completion order). If any task faults, WhenAll awaits \"\n + \"ALL tasks before throwing — the thrown exception is an AggregateException \"\n + \"but await unwraps it to the FIRST inner exception only. To see all exceptions, \"\n + \"inspect Task.Exception.InnerExceptions. If any task is canceled, the combined \"\n + \"task is canceled (TaskCanceledException). WhenAll with an empty collection \"\n + \"returns an immediately completed task with an empty array.\";\n }\n","suffix":"\n static async Task Main()\n {\n int[] results = await RunAll(\n async () =\u003e { await Task.Delay(10); return 1; },\n async () =\u003e { await Task.Delay(5); return 2; },\n async () =\u003e { return 3; }\n );\n\n if (results.Length != 3) throw new Exception(\"Expected 3 results\");\n if (results[0] != 1 || results[1] != 2 || results[2] != 3)\n throw new Exception(\"Results must preserve order\");\n\n string desc = DescribeRunAll();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n\n Console.WriteLine(\"Task 10 PASS\");\n }\n}\n","assertions":"string d10 = DescribeRunAll().ToLower();\nif (!d10.Contains(\"whenall\")) throw new Exception(\"Must mention WhenAll\");\nif (!(d10.Contains(\"order\") \u0026\u0026 (d10.Contains(\"preserv\") || d10.Contains(\"original\")))) throw new Exception(\"Must mention order preservation\");\nif (!d10.Contains(\"aggregateexception\")) throw new Exception(\"Must mention AggregateException\");\nif (!(d10.Contains(\"first\") \u0026\u0026 (d10.Contains(\"inner exception\") || d10.Contains(\"unwrap\")))) throw new Exception(\"Must mention await unwraps to first exception\");\nif (!(d10.Contains(\"innerexceptions\") || d10.Contains(\"inner exceptions\"))) throw new Exception(\"Must mention InnerExceptions for all exceptions\");\nif (!(d10.Contains(\"taskcanceledexception\") || d10.Contains(\"canceled\"))) throw new Exception(\"Must mention TaskCanceledException on cancellation\");\nif (!(d10.Contains(\"empty\") \u0026\u0026 (d10.Contains(\"array\") || d10.Contains(\"completed\")))) throw new Exception(\"Must mention empty collection returns empty array\");","category":"api_usage"} {"id":"11","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Buffers;\n\nnamespace ApiTask11\n{\n public class Program\n {\n public static int SumWithRentedBuffer(int[] source)\n {\n int[] buffer = ArrayPool\u003cint\u003e.Shared.Rent(source.Length);\n try\n {\n Array.Copy(source, buffer, source.Length);\n int sum = 0;\n for (int i = 0; i \u003c source.Length; i++)\n sum += buffer[i];\n return sum;\n }\n finally\n {\n ArrayPool\u003cint\u003e.Shared.Return(buffer, clearArray: true);\n }\n }\n\n","golden_completion":" public static string DescribeSumWithRentedBuffer()\n {\n return \"Rents a buffer from ArrayPool\u003cint\u003e.Shared.Rent(minimumLength) which may \"\n + \"return an array LARGER than requested (power-of-two sizing). Copies source \"\n + \"via Array.Copy then sums only source.Length elements. Returns the buffer \"\n + \"with ArrayPool\u003cint\u003e.Shared.Return(buffer, clearArray: true) which zeros \"\n + \"the array before returning it to the pool. The pool is thread-safe and \"\n + \"reduces GC pressure by reusing arrays. Failure to call Return causes a \"\n + \"pool leak, not a memory leak — the GC still collects the array.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n int result = SumWithRentedBuffer(new int[] { 1, 2, 3, 4, 5 });\n if (result != 15) throw new Exception(\"Sum failed\");\n\n string desc = DescribeSumWithRentedBuffer();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"ArrayPool\")) throw new Exception(\"Must mention ArrayPool\");\n Console.WriteLine(\"Task 11 PASS\");\n }\n }\n}\n","assertions":"string d11 = ApiTask11.Program.DescribeSumWithRentedBuffer().ToLower();\nif (!d11.Contains(\"larger than requested\") \u0026\u0026 !d11.Contains(\"bigger than\") \u0026\u0026 !d11.Contains(\"may return a larger\") \u0026\u0026 !d11.Contains(\"power-of-two\") \u0026\u0026 !d11.Contains(\"power of two\")) throw new Exception(\"Must mention buffer may be larger than requested\");\nif (!d11.Contains(\"cleararray\") \u0026\u0026 !d11.Contains(\"clear\") ) throw new Exception(\"Must mention clearArray parameter\");\nif (!d11.Contains(\"thread-safe\") \u0026\u0026 !d11.Contains(\"thread safe\") \u0026\u0026 !d11.Contains(\"threadsafe\")) throw new Exception(\"Must mention thread-safety\");\nif (!d11.Contains(\"gc pressure\") \u0026\u0026 !d11.Contains(\"garbage collect\") \u0026\u0026 !d11.Contains(\"allocation\")) throw new Exception(\"Must mention GC pressure reduction\");\nif (!d11.Contains(\"pool leak\") \u0026\u0026 !d11.Contains(\"not a memory leak\") \u0026\u0026 !d11.Contains(\"not returned\")) throw new Exception(\"Must mention pool leak vs memory leak distinction\");\nint[] rented = ArrayPool\u003cint\u003e.Shared.Rent(3);\nif (rented.Length \u003c 3) throw new Exception(\"Rented array too small\");\nArrayPool\u003cint\u003e.Shared.Return(rented, clearArray: true);\nif (rented[0] != 0) throw new Exception(\"clearArray should zero elements\");\n","category":"api_usage"} {"id":"12","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nnamespace ApiTask12\n{\n public class Program\n {\n public static int SumMiddleThird(ReadOnlySpan\u003cint\u003e data)\n {\n int start = data.Length / 3;\n int end = 2 * data.Length / 3;\n ReadOnlySpan\u003cint\u003e slice = data.Slice(start, end - start);\n int sum = 0;\n for (int i = 0; i \u003c slice.Length; i++)\n sum += slice[i];\n return sum;\n }\n\n","golden_completion":" public static string DescribeSumMiddleThird()\n {\n return \"Uses ReadOnlySpan\u003cint\u003e which is a stack-only ref struct that cannot \"\n + \"be boxed, stored on the heap, or used in async methods. Slice(start, length) \"\n + \"creates a new ReadOnlySpan over the same underlying memory with zero \"\n + \"allocation — it is O(1). ReadOnlySpan prevents mutation of elements. \"\n + \"The Length property returns the count of the slice, not the original array. \"\n + \"Span\u003cT\u003e/ReadOnlySpan\u003cT\u003e cannot be fields in a class, only in ref structs.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n int[] data = { 10, 20, 30, 40, 50, 60 };\n int result = SumMiddleThird(data);\n if (result != 70) throw new Exception($\"Expected 70, got {result}\");\n\n string desc = DescribeSumMiddleThird();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"Span\")) throw new Exception(\"Must mention Span\");\n Console.WriteLine(\"Task 12 PASS\");\n }\n }\n}\n","assertions":"string d12 = ApiTask12.Program.DescribeSumMiddleThird().ToLower();\nif (!d12.Contains(\"ref struct\")) throw new Exception(\"Must mention ref struct\");\nif (!d12.Contains(\"stack\") || (!d12.Contains(\"heap\") \u0026\u0026 !d12.Contains(\"boxed\"))) throw new Exception(\"Must mention stack-only / cannot be on heap\");\nif (!d12.Contains(\"zero allocation\") \u0026\u0026 !d12.Contains(\"no allocation\") \u0026\u0026 !d12.Contains(\"no copy\") \u0026\u0026 !d12.Contains(\"o(1)\")) throw new Exception(\"Must mention zero-allocation slicing\");\nif (!d12.Contains(\"async\") \u0026\u0026 !d12.Contains(\"cannot be used in async\")) throw new Exception(\"Must mention async restriction\");\nif (!d12.Contains(\"cannot be field\") \u0026\u0026 !d12.Contains(\"cannot be stored\") \u0026\u0026 !d12.Contains(\"class field\") \u0026\u0026 !d12.Contains(\"only in ref struct\")) throw new Exception(\"Must mention cannot be field in regular class\");\n","category":"api_usage"} {"id":"13","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Numerics;\n\nnamespace ApiTask13\n{\n public class Program\n {\n public static BigInteger Factorial(int n)\n {\n BigInteger result = BigInteger.One;\n for (int i = 2; i \u003c= n; i++)\n result = BigInteger.Multiply(result, new BigInteger(i));\n return result;\n }\n\n","golden_completion":" public static string DescribeFactorial()\n {\n return \"Uses System.Numerics.BigInteger which is an immutable, arbitrary-precision \"\n + \"signed integer — no overflow is possible. BigInteger.One is a static readonly \"\n + \"field (not a property) representing the value 1. BigInteger.Multiply returns \"\n + \"a NEW BigInteger since the type is immutable. Storage is backed by an internal \"\n + \"uint[] array. Parse/TryParse accept NumberStyles.Integer by default. \"\n + \"BigInteger implements IComparable\u003cBigInteger\u003e and supports operator overloads \"\n + \"for +, -, *, /, % so standard arithmetic syntax works.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n BigInteger f10 = Factorial(10);\n if (f10 != 3628800) throw new Exception(\"10! wrong\");\n BigInteger f20 = Factorial(20);\n if (f20 != BigInteger.Parse(\"2432902008176640000\")) throw new Exception(\"20! wrong\");\n\n string desc = DescribeFactorial();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"BigInteger\")) throw new Exception(\"Must mention BigInteger\");\n Console.WriteLine(\"Task 13 PASS\");\n }\n }\n}\n","assertions":"string d13 = ApiTask13.Program.DescribeFactorial().ToLower();\nif (!d13.Contains(\"immutable\")) throw new Exception(\"Must mention immutable\");\nif (!d13.Contains(\"arbitrary-precision\") \u0026\u0026 !d13.Contains(\"arbitrary precision\") \u0026\u0026 !d13.Contains(\"unlimited precision\")) throw new Exception(\"Must mention arbitrary-precision\");\nif (!d13.Contains(\"no overflow\") \u0026\u0026 !d13.Contains(\"cannot overflow\") \u0026\u0026 !d13.Contains(\"never overflow\")) throw new Exception(\"Must mention no overflow\");\nif (!d13.Contains(\"uint[]\") \u0026\u0026 !d13.Contains(\"uint array\") \u0026\u0026 !d13.Contains(\"internal array\")) throw new Exception(\"Must mention internal uint[] storage\");\nif (!d13.Contains(\"new biginteger\") \u0026\u0026 !d13.Contains(\"returns a new\") \u0026\u0026 !d13.Contains(\"immutable\")) throw new Exception(\"Must mention Multiply returns new instance\");\nif (!d13.Contains(\"operator\") \u0026\u0026 !d13.Contains(\"overload\")) throw new Exception(\"Must mention operator overloads\");\n","category":"api_usage"} {"id":"14","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Net;\nusing System.Net.Sockets;\n\nnamespace ApiTask14\n{\n public class Program\n {\n public static string ClassifyAddress(string input)\n {\n if (!IPAddress.TryParse(input, out IPAddress addr))\n return \"INVALID\";\n if (addr.AddressFamily == AddressFamily.InterNetworkV6)\n return \"IPv6\";\n if (IPAddress.IsLoopback(addr))\n return \"LOOPBACK\";\n byte[] bytes = addr.GetAddressBytes();\n if (bytes[0] == 10)\n return \"PRIVATE_A\";\n return \"PUBLIC\";\n }\n\n","golden_completion":" public static string DescribeClassifyAddress()\n {\n return \"Uses IPAddress.TryParse which returns bool and sets the out parameter \"\n + \"to null on failure (not IPAddress.None). AddressFamily is an enum with \"\n + \"InterNetwork for IPv4 and InterNetworkV6 for IPv6 — there is no \u0027IPv4\u0027 \"\n + \"or \u0027IPv6\u0027 member name. IPAddress.IsLoopback is a static method that checks \"\n + \"127.0.0.0/8 for IPv4 and ::1 for IPv6. GetAddressBytes returns a 4-byte \"\n + \"array for IPv4 and 16-byte array for IPv6 in network byte order (big-endian). \"\n + \"IPAddress.TryParse accepts both IPv4 dotted-decimal and IPv6 colon-hex formats.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n if (ClassifyAddress(\"10.0.0.1\") != \"PRIVATE_A\") throw new Exception(\"10.x fail\");\n if (ClassifyAddress(\"127.0.0.1\") != \"LOOPBACK\") throw new Exception(\"Loopback fail\");\n if (ClassifyAddress(\"::1\") != \"IPv6\") throw new Exception(\"IPv6 fail\");\n if (ClassifyAddress(\"not-an-ip\") != \"INVALID\") throw new Exception(\"Invalid fail\");\n\n string desc = DescribeClassifyAddress();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"IPAddress\")) throw new Exception(\"Must mention IPAddress\");\n Console.WriteLine(\"Task 14 PASS\");\n }\n }\n}\n","assertions":"string d14 = ApiTask14.Program.DescribeClassifyAddress().ToLower();\nif (!d14.Contains(\"tryparse\") || !d14.Contains(\"bool\")) throw new Exception(\"Must mention TryParse returns bool\");\nif (!d14.Contains(\"null\") \u0026\u0026 !d14.Contains(\"out parameter\")) throw new Exception(\"Must mention out param is null on failure\");\nif (!d14.Contains(\"internetwork\") \u0026\u0026 !d14.Contains(\"interNetwork\")) throw new Exception(\"Must mention InterNetwork enum value\");\nif (!d14.Contains(\"internetworkv6\") \u0026\u0026 !d14.Contains(\"interNetworkV6\")) throw new Exception(\"Must mention InterNetworkV6 enum value\");\nif (!d14.Contains(\"isloopback\") \u0026\u0026 !d14.Contains(\"is loopback\")) throw new Exception(\"Must mention IsLoopback static method\");\nif (!d14.Contains(\"big-endian\") \u0026\u0026 !d14.Contains(\"big endian\") \u0026\u0026 !d14.Contains(\"network byte order\") \u0026\u0026 !d14.Contains(\"network order\")) throw new Exception(\"Must mention network byte order\");\nif (!d14.Contains(\"4-byte\") \u0026\u0026 !d14.Contains(\"4 byte\") \u0026\u0026 !d14.Contains(\"four byte\")) throw new Exception(\"Must mention 4-byte array for IPv4\");\nif (ApiTask14.Program.ClassifyAddress(\"8.8.8.8\") != \"PUBLIC\") throw new Exception(\"Public classification failed\");\n","category":"api_usage"} {"id":"15","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace ApiTask15\n{\n public class Program\n {\n public static (int symDiffCount, int interCount, bool isProperSubset)\n AnalyzeSets(int[] a, int[] b)\n {\n var setA = new HashSet\u003cint\u003e(a);\n var setB = new HashSet\u003cint\u003e(b);\n var symDiff = new HashSet\u003cint\u003e(setA);\n symDiff.SymmetricExceptWith(setB);\n setA.IntersectWith(setB);\n bool proper = new HashSet\u003cint\u003e(a).IsProperSubsetOf(b);\n return (symDiff.Count, setA.Count, proper);\n }\n\n","golden_completion":" public static string DescribeAnalyzeSets()\n {\n return \"Uses HashSet\u003cint\u003e set-theoretic methods. SymmetricExceptWith MUTATES the \"\n + \"set in-place to contain only elements in one set or the other, not both — \"\n + \"it does NOT return a new HashSet. IntersectWith also MUTATES in-place, \"\n + \"removing elements not in the other collection. IsProperSubsetOf returns \"\n + \"true only if the set is a subset AND strictly smaller (not equal). \"\n + \"All three methods accept IEnumerable\u003cT\u003e, not just HashSet\u003cT\u003e. \"\n + \"The HashSet\u003cint\u003e(IEnumerable\u003cint\u003e) constructor deduplicates elements. \"\n + \"Amortized O(n) for each operation where n is the size of the other collection.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n var (sd, ic, ps) = AnalyzeSets(new[] {1,2,3}, new[] {2,3,4});\n if (sd != 2) throw new Exception($\"SymDiff count: expected 2, got {sd}\");\n if (ic != 2) throw new Exception($\"Intersect count: expected 2, got {ic}\");\n if (ps != false) throw new Exception(\"IsProperSubset should be false\");\n\n var (sd2, ic2, ps2) = AnalyzeSets(new[] {1,2}, new[] {1,2,3});\n if (ps2 != true) throw new Exception(\"IsProperSubset should be true\");\n\n string desc = DescribeAnalyzeSets();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"HashSet\")) throw new Exception(\"Must mention HashSet\");\n Console.WriteLine(\"Task 15 PASS\");\n }\n }\n}\n","assertions":"string d15 = ApiTask15.Program.DescribeAnalyzeSets().ToLower();\nif (!d15.Contains(\"mutate\") \u0026\u0026 !d15.Contains(\"in-place\") \u0026\u0026 !d15.Contains(\"in place\") \u0026\u0026 !d15.Contains(\"modifies\")) throw new Exception(\"Must mention in-place mutation\");\nif (!d15.Contains(\"symmetricexceptwith\") \u0026\u0026 !d15.Contains(\"symmetric except\")) throw new Exception(\"Must mention SymmetricExceptWith by name\");\nif (!d15.Contains(\"intersectwith\") \u0026\u0026 !d15.Contains(\"intersect with\")) throw new Exception(\"Must mention IntersectWith by name\");\nif (!d15.Contains(\"not return\") \u0026\u0026 !d15.Contains(\"does not return\") \u0026\u0026 !d15.Contains(\"void\") \u0026\u0026 !d15.Contains(\"in-place\") \u0026\u0026 !d15.Contains(\"in place\")) throw new Exception(\"Must mention methods do NOT return new HashSet\");\nif (!d15.Contains(\"ispropersubsetof\") \u0026\u0026 !d15.Contains(\"proper subset\")) throw new Exception(\"Must mention IsProperSubsetOf\");\nif (!d15.Contains(\"strictly smaller\") \u0026\u0026 !d15.Contains(\"not equal\") \u0026\u0026 !d15.Contains(\"strict subset\")) throw new Exception(\"Must mention proper subset means strictly smaller\");\nif (!d15.Contains(\"ienumerable\") \u0026\u0026 !d15.Contains(\"enumerable\")) throw new Exception(\"Must mention methods accept IEnumerable\u003cT\u003e\");\nif (!d15.Contains(\"deduplic\") \u0026\u0026 !d15.Contains(\"unique\") \u0026\u0026 !d15.Contains(\"distinct\")) throw new Exception(\"Must mention constructor deduplicates\");\nvar dup = new HashSet\u003cint\u003e(new[] {1,1,2,2,3});\nif (dup.Count != 3) throw new Exception(\"Dedup check failed\");\n","category":"api_usage"} {"id":"16","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.IO;\n\nnamespace ApiTask16\n{\n public class Program\n {\n public static string GetConfigPath(string appName)\n {\n string envOverride = Environment.GetEnvironmentVariable(\"CONFIG_DIR\");\n if (envOverride != null)\n return Path.Combine(envOverride, appName);\n string appData = Environment.GetFolderPath(\n Environment.SpecialFolder.ApplicationData);\n return Path.Combine(appData, appName, \"config\");\n }\n\n","golden_completion":" public static string DescribeGetConfigPath()\n {\n return \"Uses Environment.GetEnvironmentVariable which returns null (not empty \"\n + \"string) when the variable does not exist — this differs from \"\n + \"GetEnvironmentVariable(name, EnvironmentVariableTarget) overload which \"\n + \"accepts Machine, User, or Process targets. Environment.GetFolderPath \"\n + \"returns empty string (not null) if the folder does not exist on the \"\n + \"platform. SpecialFolder.ApplicationData maps to ~/.config on Linux, \"\n + \"~/Library/Application Support on macOS, and %APPDATA% on Windows. \"\n + \"Path.Combine ignores earlier arguments when a later argument is an \"\n + \"absolute path (rooted path).\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n Environment.SetEnvironmentVariable(\"CONFIG_DIR\", \"/tmp/cfg\");\n string result = GetConfigPath(\"myapp\");\n string expected = Path.Combine(\"/tmp/cfg\", \"myapp\");\n if (result != expected) throw new Exception($\"Expected {expected}, got {result}\");\n\n Environment.SetEnvironmentVariable(\"CONFIG_DIR\", null);\n string result2 = GetConfigPath(\"myapp\");\n if (string.IsNullOrEmpty(result2)) throw new Exception(\"Fallback path empty\");\n\n string desc = DescribeGetConfigPath();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n Console.WriteLine(\"Task 16 PASS\");\n }\n }\n}\n","assertions":"string d16 = ApiTask16.Program.DescribeGetConfigPath().ToLower();\nif (!d16.Contains(\"null\") || d16.Contains(\"empty string\") \u0026\u0026 !d16.Contains(\"returns null\")) throw new Exception(\"Must mention GetEnvironmentVariable returns null when not found\");\nif (!d16.Contains(\"environmentvariabletarget\") \u0026\u0026 !d16.Contains(\"machine\") \u0026\u0026 !d16.Contains(\"user\") \u0026\u0026 !d16.Contains(\"process target\")) throw new Exception(\"Must mention EnvironmentVariableTarget overload\");\nif (!d16.Contains(\"empty string\") \u0026\u0026 !d16.Contains(\"returns \\\"\\\"\")) throw new Exception(\"Must mention GetFolderPath returns empty string when folder missing\");\nif (!d16.Contains(\"applicationdata\") \u0026\u0026 !d16.Contains(\"application data\")) throw new Exception(\"Must mention ApplicationData\");\nif (!d16.Contains(\"path.combine\") \u0026\u0026 !d16.Contains(\"combine\")) throw new Exception(\"Must mention Path.Combine\");\nif (!d16.Contains(\"absolute\") \u0026\u0026 !d16.Contains(\"rooted\")) throw new Exception(\"Must mention Path.Combine ignores earlier args for absolute paths\");\nstring testNull = Environment.GetEnvironmentVariable(\"__NONEXISTENT_VAR_12345__\");\nif (testNull != null) throw new Exception(\"GetEnvironmentVariable should return null for missing var\");\n","category":"api_usage"} {"id":"17","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.IO;\nusing System.Text;\n\nnamespace ApiTask17\n{\n public class Program\n {\n public static byte[] PackRecord(int id, string name, double score)\n {\n using var ms = new MemoryStream();\n using (var bw = new BinaryWriter(ms, Encoding.UTF8, leaveOpen: true))\n {\n bw.Write(id);\n bw.Write(name);\n bw.Write(score);\n }\n return ms.ToArray();\n }\n\n public static (int id, string name, double score) UnpackRecord(byte[] data)\n {\n using var ms = new MemoryStream(data);\n using var br = new BinaryReader(ms, Encoding.UTF8);\n return (br.ReadInt32(), br.ReadString(), br.ReadDouble());\n }\n\n","golden_completion":" public static string DescribePackRecord()\n {\n return \"Uses BinaryWriter.Write(int) which writes 4 bytes in little-endian order. \"\n + \"BinaryWriter.Write(string) writes a length-prefixed UTF-8 string: the \"\n + \"length is encoded as a 7-bit variable-length integer (LEB128), NOT a \"\n + \"fixed 4-byte int. BinaryWriter.Write(double) writes 8 bytes IEEE 754. \"\n + \"The leaveOpen: true parameter prevents BinaryWriter.Dispose from closing \"\n + \"the underlying MemoryStream. Without leaveOpen, Dispose closes the stream \"\n + \"and ms.ToArray() would still work because ToArray works on disposed \"\n + \"MemoryStream, but GetBuffer() would throw ObjectDisposedException. \"\n + \"BinaryReader.ReadString reads the LEB128 length then that many UTF-8 bytes.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n byte[] packed = PackRecord(42, \"Alice\", 95.5);\n var (id, name, score) = UnpackRecord(packed);\n if (id != 42) throw new Exception(\"id mismatch\");\n if (name != \"Alice\") throw new Exception(\"name mismatch\");\n if (Math.Abs(score - 95.5) \u003e 0.001) throw new Exception(\"score mismatch\");\n\n string desc = DescribePackRecord();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"BinaryWriter\")) throw new Exception(\"Must mention BinaryWriter\");\n Console.WriteLine(\"Task 17 PASS\");\n }\n }\n}\n","assertions":"string d17 = ApiTask17.Program.DescribePackRecord().ToLower();\nif (!d17.Contains(\"little-endian\") \u0026\u0026 !d17.Contains(\"little endian\")) throw new Exception(\"Must mention little-endian byte order\");\nif (!d17.Contains(\"length-prefix\") \u0026\u0026 !d17.Contains(\"length prefix\") \u0026\u0026 !d17.Contains(\"leb128\") \u0026\u0026 !d17.Contains(\"7-bit\")) throw new Exception(\"Must mention string length-prefixed encoding or LEB128\");\nif (!d17.Contains(\"7-bit\") \u0026\u0026 !d17.Contains(\"variable-length\") \u0026\u0026 !d17.Contains(\"variable length\") \u0026\u0026 !d17.Contains(\"leb128\")) throw new Exception(\"Must mention 7-bit variable-length or LEB128 for string length encoding\");\nif (!d17.Contains(\"leaveopen\") \u0026\u0026 !d17.Contains(\"leave open\")) throw new Exception(\"Must mention leaveOpen parameter\");\nif (!d17.Contains(\"ieee 754\") \u0026\u0026 !d17.Contains(\"ieee754\") \u0026\u0026 !d17.Contains(\"8 byte\")) throw new Exception(\"Must mention IEEE 754 or 8-byte double\");\nif (!d17.Contains(\"dispose\") \u0026\u0026 !d17.Contains(\"closing\")) throw new Exception(\"Must mention Dispose/closing behavior\");\nif (!d17.Contains(\"toarray\")) throw new Exception(\"Must mention ToArray works on disposed stream\");\nbyte[] test = ApiTask17.Program.PackRecord(1, \"Hi\", 1.0);\nvar (ti, tn, ts) = ApiTask17.Program.UnpackRecord(test);\nif (ti != 1 || tn != \"Hi\" || Math.Abs(ts - 1.0) \u003e 0.001) throw new Exception(\"Pack/Unpack roundtrip failed\");\n","category":"api_usage"} {"id":"18","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Diagnostics;\nusing System.Threading;\n\nnamespace ApiTask18\n{\n public class Program\n {\n public static double MeasureElapsedMs(Action action)\n {\n long start = Stopwatch.GetTimestamp();\n action();\n long end = Stopwatch.GetTimestamp();\n long ticks = end - start;\n return (double)ticks / Stopwatch.Frequency * 1000.0;\n }\n\n","golden_completion":" public static string DescribeMeasureElapsedMs()\n {\n return \"Uses Stopwatch.GetTimestamp() which is a static method returning the \"\n + \"current value of the high-resolution performance counter as a long. \"\n + \"Stopwatch.Frequency is a static readonly field giving ticks per second — \"\n + \"it is platform-dependent and NOT the same as TimeSpan.TicksPerSecond \"\n + \"(which is always 10,000,000). Stopwatch.IsHighResolution indicates whether \"\n + \"the underlying timer is a high-resolution performance counter (QPC on Windows). \"\n + \"GetTimestamp returns raw counter ticks, not DateTime ticks. \"\n + \"In .NET 7+ there is GetElapsedTime(startTimestamp) as a convenience method.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n double elapsed = MeasureElapsedMs(() =\u003e Thread.Sleep(50));\n if (elapsed \u003c 30 || elapsed \u003e 500) throw new Exception($\"Elapsed {elapsed}ms out of range\");\n\n string desc = DescribeMeasureElapsedMs();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"Stopwatch\")) throw new Exception(\"Must mention Stopwatch\");\n Console.WriteLine(\"Task 18 PASS\");\n }\n }\n}\n","assertions":"string d18 = ApiTask18.Program.DescribeMeasureElapsedMs().ToLower();\nif (!d18.Contains(\"gettimestamp\") \u0026\u0026 !d18.Contains(\"get timestamp\")) throw new Exception(\"Must mention GetTimestamp\");\nif (!d18.Contains(\"frequency\")) throw new Exception(\"Must mention Frequency field\");\nif (!d18.Contains(\"platform-dependent\") \u0026\u0026 !d18.Contains(\"platform dependent\") \u0026\u0026 !d18.Contains(\"varies\") \u0026\u0026 !d18.Contains(\"system-dependent\")) throw new Exception(\"Must mention Frequency is platform-dependent\");\nif (!d18.Contains(\"timespan.tickspersecond\") \u0026\u0026 !d18.Contains(\"10,000,000\") \u0026\u0026 !d18.Contains(\"10000000\")) throw new Exception(\"Must mention TimeSpan.TicksPerSecond difference\");\nif (!d18.Contains(\"ishighresolution\") \u0026\u0026 !d18.Contains(\"is high resolution\") \u0026\u0026 !d18.Contains(\"high-resolution\")) throw new Exception(\"Must mention IsHighResolution property\");\nif (!d18.Contains(\"performance counter\") \u0026\u0026 !d18.Contains(\"qpc\")) throw new Exception(\"Must mention performance counter\");\nif (Stopwatch.Frequency \u003c= 0) throw new Exception(\"Frequency must be positive\");\n","category":"api_usage"} {"id":"19","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nnamespace ApiTask19\n{\n [Flags]\n public enum Permissions\n {\n None = 0,\n Read = 1,\n Write = 2,\n Execute = 4,\n All = Read | Write | Execute\n }\n\n public class Program\n {\n public static string CheckPermissions(string input)\n {\n if (!Enum.TryParse\u003cPermissions\u003e(input, ignoreCase: true, out var perm))\n return \"INVALID\";\n if (!Enum.IsDefined(typeof(Permissions), perm))\n return \"UNDEFINED_COMBO\";\n if (perm.HasFlag(Permissions.Write) \u0026\u0026 !perm.HasFlag(Permissions.Read))\n return \"WRITE_WITHOUT_READ\";\n return perm.ToString();\n }\n\n","golden_completion":" public static string DescribeCheckPermissions()\n {\n return \"Uses Enum.TryParse\u003cT\u003e(string, bool ignoreCase, out T result) which \"\n + \"returns true even for integer strings (\u00273\u0027) and undefined combinations — \"\n + \"TryParse succeeds for ANY valid integer, not just defined enum values. \"\n + \"Enum.IsDefined returns false for combined flags not explicitly defined \"\n + \"as named members (e.g., Read|Write = 3 is not defined, but All = 7 is). \"\n + \"HasFlag performs a bitwise AND: value.HasFlag(flag) is equivalent to \"\n + \"(value \u0026 flag) == flag. HasFlag returns true when flag is None (0) for \"\n + \"any value. GetValues returns ALL named constants including None and All. \"\n + \"ToString on a [Flags] enum returns comma-separated names for valid combos.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n if (CheckPermissions(\"Read\") != \"Read\") throw new Exception(\"Read parse fail\");\n if (CheckPermissions(\"read\") != \"Read\") throw new Exception(\"Case-insensitive fail\");\n if (CheckPermissions(\"garbage\") != \"INVALID\") throw new Exception(\"Invalid fail\");\n if (CheckPermissions(\"All\") != \"All\") throw new Exception(\"All fail\");\n\n string desc = DescribeCheckPermissions();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"Enum\")) throw new Exception(\"Must mention Enum\");\n Console.WriteLine(\"Task 19 PASS\");\n }\n }\n}\n","assertions":"string d19 = ApiTask19.Program.DescribeCheckPermissions().ToLower();\nif (!d19.Contains(\"tryparse\")) throw new Exception(\"Must mention TryParse\");\nif (!d19.Contains(\"integer string\") \u0026\u0026 !d19.Contains(\"integer value\") \u0026\u0026 !d19.Contains(\"any valid integer\") \u0026\u0026 !d19.Contains(\"numeric\")) throw new Exception(\"Must mention TryParse succeeds for integer strings\");\nif (!d19.Contains(\"isdefined\")) throw new Exception(\"Must mention IsDefined\");\nif (!d19.Contains(\"combined flag\") \u0026\u0026 !d19.Contains(\"combination\") \u0026\u0026 !d19.Contains(\"composite\")) throw new Exception(\"Must mention IsDefined fails for unnamed flag combos\");\nif (!d19.Contains(\"hasflag\")) throw new Exception(\"Must mention HasFlag\");\nif (!d19.Contains(\"bitwise and\") \u0026\u0026 !d19.Contains(\"bitwise\") \u0026\u0026 !d19.Contains(\"\u0026 flag\")) throw new Exception(\"Must mention HasFlag uses bitwise AND\");\nif (!d19.Contains(\"none\") \u0026\u0026 !d19.Contains(\"zero\")) throw new Exception(\"Must mention HasFlag(None) behavior\");\nif (!d19.Contains(\"tostring\") \u0026\u0026 !d19.Contains(\"comma-separated\") \u0026\u0026 !d19.Contains(\"comma separated\")) throw new Exception(\"Must mention Flags ToString behavior\");\nif (ApiTask19.Program.CheckPermissions(\"3\") != \"UNDEFINED_COMBO\") throw new Exception(\"Integer string \u00273\u0027 should be undefined combo\");\nif (ApiTask19.Program.CheckPermissions(\"7\") != \"All\") throw new Exception(\"Integer string \u00277\u0027 should resolve to All\");\n","category":"api_usage"} {"id":"20","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nnamespace ApiTask20\n{\n public class Program\n {\n public static string EncodeToBase64(string text)\n {\n byte[] bytes = Encoding.UTF8.GetBytes(text);\n return Convert.ToBase64String(bytes, Base64FormattingOptions.InsertLineBreaks);\n }\n\n public static string DecodeFromBase64(string base64)\n {\n byte[] bytes = Convert.FromBase64String(base64);\n return Encoding.UTF8.GetString(bytes);\n }\n\n","golden_completion":" public static string DescribeBase64Operations()\n {\n return \"Uses Convert.ToBase64String with Base64FormattingOptions.InsertLineBreaks \"\n + \"which inserts a line break every 76 characters (MIME standard RFC 2045). \"\n + \"Without the option, no line breaks are inserted (the default is None). \"\n + \"Convert.FromBase64String IGNORES whitespace (spaces, tabs, newlines) in \"\n + \"the input — it does not require removal first. It throws FormatException \"\n + \"for invalid characters (not ArgumentException). The padding \u0027=\u0027 characters \"\n + \"are required by FromBase64String — omitting them throws FormatException. \"\n + \"ToBase64String returns a string, not a byte array. The output uses the \"\n + \"standard Base64 alphabet (+/ not -_) — for URL-safe, use Base64Url in .NET 9+.\";\n }\n","suffix":"\n public static void Main(string[] args)\n {\n string encoded = EncodeToBase64(\"Hello, World!\");\n string decoded = DecodeFromBase64(encoded.Replace(\"\\r\\n\", \"\"));\n if (decoded != \"Hello, World!\") throw new Exception(\"Roundtrip failed\");\n\n string simple = Convert.ToBase64String(Encoding.UTF8.GetBytes(\"Hi\"));\n if (simple != \"SGk=\") throw new Exception(\"Simple encode failed\");\n\n string desc = DescribeBase64Operations();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n if (!desc.Contains(\"Base64\")) throw new Exception(\"Must mention Base64\");\n Console.WriteLine(\"Task 20 PASS\");\n }\n }\n}\n","assertions":"string d20 = ApiTask20.Program.DescribeBase64Operations().ToLower();\nif (!d20.Contains(\"insertlinebreaks\") \u0026\u0026 !d20.Contains(\"insert line breaks\") \u0026\u0026 !d20.Contains(\"line break\")) throw new Exception(\"Must mention InsertLineBreaks option\");\nif (!d20.Contains(\"76\") \u0026\u0026 !d20.Contains(\"seventy-six\")) throw new Exception(\"Must mention 76-character line length\");\nif (!d20.Contains(\"ignore\") \u0026\u0026 !d20.Contains(\"skip\")) throw new Exception(\"Must mention FromBase64String ignores whitespace\");\nif (!d20.Contains(\"formatexception\") \u0026\u0026 !d20.Contains(\"format exception\")) throw new Exception(\"Must mention FormatException for invalid input\");\nif (!d20.Contains(\"padding\") \u0026\u0026 !d20.Contains(\"\u0027=\u0027\") \u0026\u0026 !d20.Contains(\"equals\")) throw new Exception(\"Must mention padding = characters are required\");\nif (!d20.Contains(\"+/\") \u0026\u0026 !d20.Contains(\"standard\") \u0026\u0026 !d20.Contains(\"not url\")) throw new Exception(\"Must mention standard alphabet (not URL-safe)\");\nif (!d20.Contains(\"mime\") \u0026\u0026 !d20.Contains(\"rfc 2045\") \u0026\u0026 !d20.Contains(\"rfc2045\")) throw new Exception(\"Must mention MIME/RFC 2045 standard\");\nstring ws = Convert.FromBase64String(\"SG k=\") != null ? \"ok\" : \"fail\";\ntry { Convert.FromBase64String(\"!!!\"); throw new Exception(\"Should have thrown\"); } catch (FormatException) { }\n","category":"api_usage"} {"id":"21","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Xml.Linq;\n\npublic class AUTask21\n{\n public static List\u003cstring\u003e ExtractDescendants(string xml, string tagName)\n {\n XDocument doc = XDocument.Parse(xml);\n return doc.Descendants(tagName)\n .Select(e =\u003e e.Value)\n .ToList();\n }\n\n","golden_completion":" public static string DescribeExtractDescendants()\n {\n return \"Parses XML string using XDocument.Parse(string) which returns an XDocument. \"\n + \"Calls Descendants(XName) to find all elements matching tagName at any depth. \"\n + \"Descendants performs a depth-first traversal of the entire XML tree. \"\n + \"Applies LINQ Select(e =\u003e e.Value) to extract text content, where Value \"\n + \"concatenates all descendant text nodes. Returns List\u003cstring\u003e via ToList().\";\n }\n","suffix":"\n static void Main()\n {\n string xml = \"\u003croot\u003e\u003ca\u003e\u003cb\u003ehello\u003c/b\u003e\u003cb\u003eworld\u003c/b\u003e\u003c/a\u003e\u003cb\u003eouter\u003c/b\u003e\u003c/root\u003e\";\n var results = ExtractDescendants(xml, \"b\");\n if (!(results.Count == 3)) throw new Exception(\"Expected 3 descendants\");\n if (!(results[0] == \"hello\")) throw new Exception(\"First should be hello\");\n if (!(results[2] == \"outer\")) throw new Exception(\"Third should be outer\");\n }\n}\n","assertions":"string d21 = AUTask21.DescribeExtractDescendants().ToLower();\nif (!d21.Contains(\"xdocument.parse\")) throw new Exception(\"Must mention XDocument.Parse\");\nif (!d21.Contains(\"descendants\")) throw new Exception(\"Must mention Descendants method\");\nif (!d21.Contains(\"depth-first\") \u0026\u0026 !d21.Contains(\"any depth\")) throw new Exception(\"Must mention depth-first or any depth traversal\");\nif (!(d21.Contains(\".value\") || d21.Contains(\"text node\"))) throw new Exception(\"Must mention Value property or text nodes\");\nif (!d21.Contains(\"tolist\")) throw new Exception(\"Must mention ToList conversion\");","category":"api_usage"} {"id":"22","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Reflection;\n\npublic class AUTask22\n{\n public static int Add(int a, int b) =\u003e a + b;\n\n public static object InvokeByName(Type type, string methodName, object[] args)\n {\n MethodInfo mi = type.GetMethod(methodName,\n BindingFlags.Public | BindingFlags.Static);\n if (mi == null) throw new InvalidOperationException(\"Method not found\");\n return mi.Invoke(null, args);\n }\n\n","golden_completion":" public static string DescribeInvokeByName()\n {\n return \"Retrieves a MethodInfo via Type.GetMethod(string, BindingFlags) with \"\n + \"BindingFlags.Public | BindingFlags.Static to search only public static methods. \"\n + \"GetMethod returns null if no matching method exists, so the code throws \"\n + \"InvalidOperationException on null. Calls MethodInfo.Invoke(object, object[]) \"\n + \"with null as the first argument because the method is static (no instance needed). \"\n + \"Returns the boxed result as object.\";\n }\n","suffix":"\n static void Main()\n {\n object result = InvokeByName(typeof(AUTask22), \"Add\", new object[] { 3, 4 });\n if (!((int)result == 7)) throw new Exception(\"Expected 7\");\n }\n}\n","assertions":"string d22 = AUTask22.DescribeInvokeByName().ToLower();\nif (!d22.Contains(\"getmethod\")) throw new Exception(\"Must mention GetMethod\");\nif (!d22.Contains(\"bindingflags\")) throw new Exception(\"Must mention BindingFlags\");\nif (!(d22.Contains(\"public\") \u0026\u0026 d22.Contains(\"static\"))) throw new Exception(\"Must mention Public and Static flags\");\nif (!d22.Contains(\"null\")) throw new Exception(\"Must mention null for static invoke\");\nif (!d22.Contains(\"invoke\")) throw new Exception(\"Must mention Invoke\");\nif (!d22.Contains(\"invalidoperationexception\")) throw new Exception(\"Must mention InvalidOperationException\");\nif (!d22.Contains(\"methodinfo\")) throw new Exception(\"Must mention MethodInfo type\");","category":"api_usage"} {"id":"23","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Reflection;\n\n[AttributeUsage(AttributeTargets.Method, AllowMultiple = false, Inherited = false)]\npublic class RateLimitAttribute : Attribute\n{\n public int MaxCalls { get; }\n public int PeriodSeconds { get; }\n public RateLimitAttribute(int maxCalls, int periodSeconds)\n {\n MaxCalls = maxCalls;\n PeriodSeconds = periodSeconds;\n }\n}\n\npublic class AUTask23\n{\n [RateLimit(100, 60)]\n public static void ApiEndpoint() { }\n\n public static (int maxCalls, int period) GetRateLimit(MethodInfo method)\n {\n var attr = method.GetCustomAttribute\u003cRateLimitAttribute\u003e(inherit: false);\n if (attr == null) throw new InvalidOperationException(\"No RateLimit attribute\");\n return (attr.MaxCalls, attr.PeriodSeconds);\n }\n\n","golden_completion":" public static string DescribeGetRateLimit()\n {\n return \"Uses MethodInfo.GetCustomAttribute\u003cT\u003e(bool) generic method with inherit=false \"\n + \"to retrieve only directly-applied attributes, not inherited ones. \"\n + \"The RateLimitAttribute is decorated with AttributeUsage specifying \"\n + \"AttributeTargets.Method (method-only), AllowMultiple=false (single instance), \"\n + \"and Inherited=false (not inherited by overrides). \"\n + \"GetCustomAttribute returns null when the attribute is absent, triggering \"\n + \"InvalidOperationException. Returns a ValueTuple of (MaxCalls, PeriodSeconds).\";\n }\n","suffix":"\n static void Main()\n {\n var method = typeof(AUTask23).GetMethod(\"ApiEndpoint\");\n var (maxCalls, period) = GetRateLimit(method);\n if (!(maxCalls == 100)) throw new Exception(\"Expected 100 max calls\");\n if (!(period == 60)) throw new Exception(\"Expected 60 second period\");\n }\n}\n","assertions":"string d23 = AUTask23.DescribeGetRateLimit().ToLower();\nif (!d23.Contains(\"getcustomattribute\")) throw new Exception(\"Must mention GetCustomAttribute\");\nif (!d23.Contains(\"inherit\")) throw new Exception(\"Must mention inherit parameter\");\nif (!d23.Contains(\"false\")) throw new Exception(\"Must mention inherit=false\");\nif (!d23.Contains(\"attributeusage\")) throw new Exception(\"Must mention AttributeUsage\");\nif (!d23.Contains(\"attributetargets.method\")) throw new Exception(\"Must mention AttributeTargets.Method\");\nif (!d23.Contains(\"allowmultiple\")) throw new Exception(\"Must mention AllowMultiple\");\nif (!(d23.Contains(\"null\") \u0026\u0026 d23.Contains(\"invalidoperationexception\"))) throw new Exception(\"Must mention null check and InvalidOperationException\");\nif (!d23.Contains(\"valuetuple\") || !d23.Contains(\"maxcalls\")) throw new Exception(\"Must mention ValueTuple and MaxCalls\");","category":"api_usage"} {"id":"24","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Collections.ObjectModel;\n\npublic class AUTask24\n{\n public static ReadOnlyCollection\u003cint\u003e WrapAsReadOnly(List\u003cint\u003e source)\n {\n return source.AsReadOnly();\n }\n\n","golden_completion":" public static string DescribeWrapAsReadOnly()\n {\n return \"Calls List\u003cT\u003e.AsReadOnly() which returns a ReadOnlyCollection\u003cT\u003e that is \"\n + \"a thin wrapper around the original list, not a copy. Mutations to the \"\n + \"underlying source list are visible through the ReadOnlyCollection because \"\n + \"it holds a reference to the original IList\u003cT\u003e. \"\n + \"Calling Add, Remove, or the indexer setter on the ReadOnlyCollection throws \"\n + \"NotSupportedException. Count and indexer getter delegate to the wrapped list.\";\n }\n","suffix":"\n static void Main()\n {\n var source = new List\u003cint\u003e { 1, 2, 3 };\n var ro = WrapAsReadOnly(source);\n if (!(ro.Count == 3)) throw new Exception(\"Expected count 3\");\n source.Add(4);\n if (!(ro.Count == 4)) throw new Exception(\"ReadOnly should reflect source mutation\");\n bool threw = false;\n try { ((IList\u003cint\u003e)ro).Add(5); } catch (NotSupportedException) { threw = true; }\n if (!threw) throw new Exception(\"Should throw NotSupportedException\");\n }\n}\n","assertions":"string d24 = AUTask24.DescribeWrapAsReadOnly().ToLower();\nif (!d24.Contains(\"asreadonly\")) throw new Exception(\"Must mention AsReadOnly method\");\nif (!(d24.Contains(\"wrapper\") || d24.Contains(\"wraps\"))) throw new Exception(\"Must mention wrapper semantics\");\nif (!(d24.Contains(\"not a copy\") || d24.Contains(\"reference\"))) throw new Exception(\"Must mention it is not a copy\");\nif (!(d24.Contains(\"mutations\") || d24.Contains(\"visible\"))) throw new Exception(\"Must mention mutations visible through wrapper\");\nif (!d24.Contains(\"notsupportedexception\")) throw new Exception(\"Must mention NotSupportedException\");","category":"api_usage"} {"id":"25","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Threading;\n\npublic class AUTask25\n{\n private static int _initCount = 0;\n\n public static Lazy\u003cstring\u003e CreateExpensiveResource()\n {\n return new Lazy\u003cstring\u003e(() =\u003e\n {\n Interlocked.Increment(ref _initCount);\n return \"Resource_\" + _initCount;\n }, LazyThreadSafetyMode.ExecutionAndPublication);\n }\n\n public static int GetInitCount() =\u003e _initCount;\n\n","golden_completion":" public static string DescribeLazyInit()\n {\n return \"Creates a Lazy\u003cT\u003e with a Func\u003cT\u003e factory and LazyThreadSafetyMode.ExecutionAndPublication. \"\n + \"ExecutionAndPublication ensures exactly one thread executes the factory; other threads \"\n + \"block until initialization completes, then receive the cached value. \"\n + \"The Value property triggers initialization on first access. Subsequent accesses \"\n + \"return the cached result without invoking the factory again. \"\n + \"If the factory throws, the exception is cached and rethrown on every subsequent access. \"\n + \"Uses Interlocked.Increment for atomic counter update inside the factory.\";\n }\n","suffix":"\n static void Main()\n {\n var lazy = CreateExpensiveResource();\n if (!(lazy.IsValueCreated == false)) throw new Exception(\"Should not be created yet\");\n string val1 = lazy.Value;\n string val2 = lazy.Value;\n if (!(val1 == val2)) throw new Exception(\"Should return same cached value\");\n if (!(GetInitCount() == 1)) throw new Exception(\"Factory should run exactly once\");\n }\n}\n","assertions":"string d25 = AUTask25.DescribeLazyInit().ToLower();\nif (!d25.Contains(\"executionandpublication\")) throw new Exception(\"Must mention ExecutionAndPublication mode\");\nif (!(d25.Contains(\"exactly one thread\") || d25.Contains(\"single thread\"))) throw new Exception(\"Must mention single-thread execution guarantee\");\nif (!(d25.Contains(\"block\") || d25.Contains(\"wait\"))) throw new Exception(\"Must mention other threads block\");\nif (!d25.Contains(\"cached\")) throw new Exception(\"Must mention cached value\");\nif (!(d25.Contains(\"exception\") \u0026\u0026 d25.Contains(\"rethrown\") || d25.Contains(\"exception\") \u0026\u0026 d25.Contains(\"cached\"))) throw new Exception(\"Must mention exception caching behavior\");\nif (!d25.Contains(\"interlocked.increment\")) throw new Exception(\"Must mention Interlocked.Increment\");","category":"api_usage"} {"id":"26","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.IO;\nusing System.IO.Compression;\nusing System.Text;\n\npublic class AUTask26\n{\n public static byte[] CompressString(string text)\n {\n byte[] raw = Encoding.UTF8.GetBytes(text);\n using (var output = new MemoryStream())\n {\n using (var gzip = new GZipStream(output, CompressionMode.Compress, leaveOpen: true))\n {\n gzip.Write(raw, 0, raw.Length);\n }\n return output.ToArray();\n }\n }\n public static string DecompressToString(byte[] compressed)\n {\n using (var input = new MemoryStream(compressed))\n using (var gzip = new GZipStream(input, CompressionMode.Decompress))\n using (var reader = new StreamReader(gzip, Encoding.UTF8))\n {\n return reader.ReadToEnd();\n }\n }\n\n","golden_completion":" public static string DescribeCompression()\n {\n return \"CompressString converts text to bytes via Encoding.UTF8.GetBytes, then wraps a \"\n + \"MemoryStream with GZipStream(Stream, CompressionMode.Compress, leaveOpen: true). \"\n + \"leaveOpen: true prevents GZipStream.Dispose from closing the underlying MemoryStream, \"\n + \"allowing ToArray() to be called after the GZipStream is disposed. The inner using \"\n + \"block must complete (flushing the gzip footer) before calling ToArray(). \"\n + \"DecompressToString wraps a MemoryStream with GZipStream(Stream, CompressionMode.Decompress) \"\n + \"and reads via StreamReader with UTF8 encoding. ReadToEnd() reads the entire \"\n + \"decompressed stream to a string.\";\n }\n","suffix":"\n static void Main()\n {\n string original = \"Hello, GZip compression test!\";\n byte[] compressed = CompressString(original);\n if (!(compressed.Length \u003e 0)) throw new Exception(\"Compressed should be non-empty\");\n string decompressed = DecompressToString(compressed);\n if (!(decompressed == original)) throw new Exception(\"Round-trip should preserve original\");\n }\n}\n","assertions":"string d26 = AUTask26.DescribeCompression().ToLower();\nif (!d26.Contains(\"gzipstream\")) throw new Exception(\"Must mention GZipStream\");\nif (!d26.Contains(\"compressionmode.compress\")) throw new Exception(\"Must mention CompressionMode.Compress\");\nif (!d26.Contains(\"leaveopen\")) throw new Exception(\"Must mention leaveOpen parameter\");\nif (!(d26.Contains(\"dispose\") || d26.Contains(\"closing\"))) throw new Exception(\"Must mention Dispose/closing behavior\");\nif (!d26.Contains(\"toarray\")) throw new Exception(\"Must mention ToArray timing\");\nif (!d26.Contains(\"memorystream\")) throw new Exception(\"Must mention MemoryStream\");\nif (!d26.Contains(\"streamreader\")) throw new Exception(\"Must mention StreamReader\");\nif (!d26.Contains(\"readtoend\")) throw new Exception(\"Must mention ReadToEnd\");","category":"api_usage"} {"id":"27","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Threading;\n\npublic class AUTask27\n{\n private static int _value = 0;\n\n public static int AtomicMax(ref int location, int comparand)\n {\n int initial, computed;\n do\n {\n initial = location;\n computed = Math.Max(initial, comparand);\n }\n while (Interlocked.CompareExchange(ref location, computed, initial) != initial);\n return computed;\n }\n\n","golden_completion":" public static string DescribeAtomicMax()\n {\n return \"Implements a lock-free atomic maximum using Interlocked.CompareExchange(ref int, int, int) \"\n + \"in a CAS (compare-and-swap) spin loop. The loop reads the current value into \u0027initial\u0027, \"\n + \"computes Math.Max(initial, comparand), then attempts CompareExchange which atomically \"\n + \"writes \u0027computed\u0027 to location only if location still equals \u0027initial\u0027. \"\n + \"CompareExchange returns the original value at location: if it equals \u0027initial\u0027, the swap \"\n + \"succeeded; otherwise another thread modified the value and the loop retries. \"\n + \"This pattern is wait-free for uncontended access and lock-free under contention.\";\n }\n","suffix":"\n static void Main()\n {\n _value = 5;\n int result = AtomicMax(ref _value, 10);\n if (!(result == 10)) throw new Exception(\"Expected max 10\");\n if (!(_value == 10)) throw new Exception(\"Location should be 10\");\n result = AtomicMax(ref _value, 3);\n if (!(result == 10)) throw new Exception(\"Expected max still 10\");\n if (!(_value == 10)) throw new Exception(\"Location should still be 10\");\n }\n}\n","assertions":"string d27 = AUTask27.DescribeAtomicMax().ToLower();\nif (!d27.Contains(\"compareexchange\")) throw new Exception(\"Must mention CompareExchange\");\nif (!(d27.Contains(\"cas\") || d27.Contains(\"compare-and-swap\") || d27.Contains(\"compare and swap\"))) throw new Exception(\"Must mention CAS pattern\");\nif (!(d27.Contains(\"spin\") || d27.Contains(\"loop\") || d27.Contains(\"retry\"))) throw new Exception(\"Must mention spin/loop/retry\");\nif (!(d27.Contains(\"atomically\") || d27.Contains(\"atomic\"))) throw new Exception(\"Must mention atomic write semantics\");\nif (!(d27.Contains(\"returns the original\") || d27.Contains(\"returns the value\"))) throw new Exception(\"Must describe CompareExchange return value semantics\");\nif (!(d27.Contains(\"lock-free\") || d27.Contains(\"wait-free\"))) throw new Exception(\"Must mention lock-free or wait-free property\");","category":"api_usage"} {"id":"28","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\npublic class AUTask28\n{\n public static double NextUp(double value)\n {\n return Math.BitIncrement(value);\n }\n\n public static double NextDown(double value)\n {\n return Math.BitDecrement(value);\n }\n\n public static double FusedMulAdd(double x, double y, double z)\n {\n return Math.FusedMultiplyAdd(x, y, z);\n }\n\n","golden_completion":" public static string DescribeFloatOps()\n {\n return \"NextUp uses Math.BitIncrement(double) which returns the smallest double value \"\n + \"that is greater than the argument. It increments the binary representation by \"\n + \"one ULP (unit in the last place). For positive infinity, it returns positive infinity. \"\n + \"For NaN, it returns NaN. \"\n + \"NextDown uses Math.BitDecrement(double) which returns the largest double value \"\n + \"less than the argument, decrementing by one ULP. \"\n + \"FusedMulAdd uses Math.FusedMultiplyAdd(x, y, z) computing (x * y) + z with a \"\n + \"single rounding step, avoiding intermediate rounding of x * y.\";\n }\n","suffix":"\n static void Main()\n {\n double up = NextUp(1.0);\n if (!(up \u003e 1.0)) throw new Exception(\"BitIncrement should be \u003e 1.0\");\n if (!(up \u003c 1.0 + 1e-10)) throw new Exception(\"BitIncrement should be very close to 1.0\");\n double down = NextDown(1.0);\n if (!(down \u003c 1.0)) throw new Exception(\"BitDecrement should be \u003c 1.0\");\n double fma = FusedMulAdd(1e308, 2.0, -1e308);\n if (!(Double.IsFinite(fma))) throw new Exception(\"FMA should handle large values without overflow\");\n }\n}\n","assertions":"string d28 = AUTask28.DescribeFloatOps().ToLower();\nif (!d28.Contains(\"bitincrement\")) throw new Exception(\"Must mention BitIncrement\");\nif (!d28.Contains(\"bitdecrement\")) throw new Exception(\"Must mention BitDecrement\");\nif (!(d28.Contains(\"ulp\") || d28.Contains(\"unit in the last place\"))) throw new Exception(\"Must mention ULP or unit in the last place\");\nif (!d28.Contains(\"fusedmultiplyadd\")) throw new Exception(\"Must mention FusedMultiplyAdd\");\nif (!(d28.Contains(\"single rounding\") || d28.Contains(\"one rounding\"))) throw new Exception(\"Must mention single rounding step\");\nif (!d28.Contains(\"nan\")) throw new Exception(\"Must mention NaN behavior\");","category":"api_usage"} {"id":"29","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\npublic class AUTask29\n{\n public static WeakReference\u003cobject\u003e CreateWeakRef(object target)\n {\n return new WeakReference\u003cobject\u003e(target, trackResurrection: false);\n }\n\n public static bool TryGetTarget(WeakReference\u003cobject\u003e weakRef, out object target)\n {\n return weakRef.TryGetTarget(out target);\n }\n\n public static void SetTarget(WeakReference\u003cobject\u003e weakRef, object newTarget)\n {\n weakRef.SetTarget(newTarget);\n }\n\n","golden_completion":" public static string DescribeWeakReference()\n {\n return \"Creates a WeakReference\u003cT\u003e with trackResurrection: false, meaning the reference \"\n + \"becomes invalid once the target is finalized (short weak reference). \"\n + \"TryGetTarget(out T) atomically checks if the target is still alive: returns true \"\n + \"and sets the out parameter if alive, returns false if collected or finalized. \"\n + \"Unlike the non-generic WeakReference.Target property, TryGetTarget is thread-safe \"\n + \"and avoids a race between null-check and access. \"\n + \"SetTarget(T) replaces the tracked object, allowing reuse of the WeakReference\u003cT\u003e \"\n + \"instance without allocating a new GC handle.\";\n }\n","suffix":"\n static void Main()\n {\n var obj = new object();\n var wr = CreateWeakRef(obj);\n object target;\n if (!(TryGetTarget(wr, out target))) throw new Exception(\"Should find live target\");\n if (!(ReferenceEquals(target, obj))) throw new Exception(\"Should be same object\");\n var newObj = new object();\n SetTarget(wr, newObj);\n if (!(TryGetTarget(wr, out target))) throw new Exception(\"Should find new target\");\n if (!(ReferenceEquals(target, newObj))) throw new Exception(\"Should be new object\");\n }\n}\n","assertions":"string d29 = AUTask29.DescribeWeakReference().ToLower();\nif (!d29.Contains(\"trackresurrection\")) throw new Exception(\"Must mention trackResurrection parameter\");\nif (!(d29.Contains(\"short weak\") || d29.Contains(\"finalized\"))) throw new Exception(\"Must mention short weak reference or finalization semantics\");\nif (!d29.Contains(\"trygettarget\")) throw new Exception(\"Must mention TryGetTarget\");\nif (!(d29.Contains(\"thread-safe\") || d29.Contains(\"atomic\"))) throw new Exception(\"Must mention thread-safety of TryGetTarget\");\nif (!d29.Contains(\"settarget\")) throw new Exception(\"Must mention SetTarget\");\nif (!(d29.Contains(\"gc handle\") || d29.Contains(\"reuse\"))) throw new Exception(\"Must mention GC handle reuse\");","category":"api_usage"} {"id":"30","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Xml.Linq;\nusing System.Linq;\n\npublic class AUTask30\n{\n private static readonly XNamespace Ns = \"http://example.com/data\";\n\n public static XDocument BuildDocument(string rootName, (string name, string value)[] items)\n {\n var root = new XElement(Ns + rootName,\n new XAttribute(XNamespace.Xmlns + \"d\", Ns),\n items.Select(i =\u003e new XElement(Ns + i.name, i.value)));\n return new XDocument(new XDeclaration(\"1.0\", \"utf-8\", \"yes\"), root);\n }\n\n public static string GetDeclarationString(XDocument doc)\n {\n return doc.Declaration?.ToString() ?? \"\";\n }\n\n","golden_completion":" public static string DescribeBuildDocument()\n {\n return \"Constructs an XDocument with XDeclaration(\u00271.0\u0027, \u0027utf-8\u0027, \u0027yes\u0027) where \u0027yes\u0027 is \"\n + \"the standalone flag. Creates root XElement using XNamespace + string operator to produce \"\n + \"a qualified XName in the namespace. Adds XAttribute(XNamespace.Xmlns + \u0027d\u0027, Ns) \"\n + \"to emit xmlns:d prefix declaration. Child elements are generated via LINQ Select \"\n + \"projecting tuples to XElement(XName, object). \"\n + \"XDocument.Declaration is separate from the XML tree and is NOT included in ToString() \"\n + \"output; use Declaration.ToString() to access it. SaveOptions.DisableFormatting can \"\n + \"suppress indentation in Save output.\";\n }\n","suffix":"\n static void Main()\n {\n var items = new (string, string)[] { (\"item\", \"A\"), (\"item\", \"B\") };\n XDocument doc = BuildDocument(\"root\", items);\n string decl = GetDeclarationString(doc);\n if (!decl.Contains(\"utf-8\")) throw new Exception(\"Declaration should contain utf-8\");\n if (!decl.Contains(\"standalone\")) throw new Exception(\"Declaration should contain standalone\");\n var elements = doc.Descendants(Ns + \"item\").Select(e =\u003e e.Value).ToArray();\n if (!(elements.Length == 2)) throw new Exception(\"Should have 2 items\");\n if (!(elements[0] == \"A\")) throw new Exception(\"First item should be A\");\n }\n}\n","assertions":"string d30 = AUTask30.DescribeBuildDocument().ToLower();\nif (!d30.Contains(\"xdeclaration\")) throw new Exception(\"Must mention XDeclaration\");\nif (!d30.Contains(\"standalone\")) throw new Exception(\"Must mention standalone flag\");\nif (!d30.Contains(\"xnamespace\")) throw new Exception(\"Must mention XNamespace\");\nif (!(d30.Contains(\"xmlns\") \u0026\u0026 d30.Contains(\"prefix\"))) throw new Exception(\"Must mention xmlns prefix declaration\");\nif (!(d30.Contains(\"tostring\") \u0026\u0026 d30.Contains(\"declaration\"))) throw new Exception(\"Must mention Declaration not included in ToString\");\nif (!(d30.Contains(\"not included\") || d30.Contains(\"separate\") || d30.Contains(\"not in\"))) throw new Exception(\"Must mention Declaration is separate from ToString output\");","category":"api_usage"} {"id":"31","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static Uri ParseAbsoluteUri(string input)\n {\n Uri result;\n bool ok = Uri.TryCreate(input, UriKind.Absolute, out result);\n if (!ok) return null;\n return result;\n }\n\n static string GetIdnHost(Uri uri)\n {\n return uri.GetComponents(UriComponents.Host, UriFormat.SafeUnescaped);\n }\n\n","golden_completion":" static string DescribeParseAbsoluteUri()\n {\n return \"Uses Uri.TryCreate(string, UriKind.Absolute, out Uri) which returns false \"\n + \"for relative URIs or malformed input without throwing UriFormatException. \"\n + \"UriKind.Absolute requires a scheme (http, ftp, etc.) — schemeless strings \"\n + \"return false. GetComponents with UriComponents.Host and UriFormat.SafeUnescaped \"\n + \"returns the IDN (Internationalized Domain Name) decoded host — percent-encoded \"\n + \"characters are unescaped except those that are unsafe. TryCreate normalizes \"\n + \"the scheme and host to lowercase per RFC 3986.\";\n }\n","suffix":"\n static void Main()\n {\n Uri u = ParseAbsoluteUri(\"http://Example.COM/path?q=1\");\n if (u == null) throw new Exception(\"Should parse valid absolute URI\");\n if (u.Scheme != \"http\") throw new Exception(\"Scheme should be http\");\n if (u.Host != \"example.com\") throw new Exception(\"Host should be normalized to lowercase\");\n\n Uri bad = ParseAbsoluteUri(\"not-a-uri\");\n if (bad != null) throw new Exception(\"Should return null for relative/invalid\");\n\n string host = GetIdnHost(ParseAbsoluteUri(\"http://example.com/test\"));\n if (host != \"example.com\") throw new Exception(\"IDN host mismatch\");\n\n string desc = DescribeParseAbsoluteUri();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Desc empty\");\n if (!desc.Contains(\"TryCreate\")) throw new Exception(\"Must mention TryCreate\");\n if (!desc.Contains(\"UriKind.Absolute\")) throw new Exception(\"Must mention UriKind.Absolute\");\n Console.WriteLine(\"Task 31 PASS\");\n }\n}\n","assertions":"string d31 = Program.DescribeParseAbsoluteUri().ToLower();\nif (!d31.Contains(\"urikind.absolute\") \u0026\u0026 !d31.Contains(\"urikind absolute\")) throw new Exception(\"Must mention UriKind.Absolute\");\nif (!d31.Contains(\"uriformatexception\") \u0026\u0026 !d31.Contains(\"without throwing\")) throw new Exception(\"Must mention no exception thrown\");\nif (!d31.Contains(\"scheme\")) throw new Exception(\"Must mention scheme requirement\");\nif (!d31.Contains(\"getcomponents\")) throw new Exception(\"Must mention GetComponents\");\nif (!d31.Contains(\"safeunescaped\")) throw new Exception(\"Must mention SafeUnescaped format\");\nif (!d31.Contains(\"idn\") \u0026\u0026 !d31.Contains(\"internationalized\")) throw new Exception(\"Must mention IDN\");\nif (!d31.Contains(\"rfc 3986\") \u0026\u0026 !d31.Contains(\"normalize\") \u0026\u0026 !d31.Contains(\"lowercase\")) throw new Exception(\"Must mention normalization\");\nif (!d31.Contains(\"false\") \u0026\u0026 !d31.Contains(\"return false\")) throw new Exception(\"Must mention returns false on failure\");\n","category":"api_usage"} {"id":"32","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static int CompareVersions(string a, string b)\n {\n Version va = Version.Parse(a);\n Version vb = Version.Parse(b);\n return va.CompareTo(vb);\n }\n\n static bool IsPrerelease(string ver)\n {\n Version v = Version.Parse(ver);\n return v.Revision == -1;\n }\n\n","golden_completion":" static string DescribeCompareVersions()\n {\n return \"Version.Parse(string) parses \u0027major.minor[.build[.revision]]\u0027 where \"\n + \"major and minor are required. Unparsed components default to -1 (not 0), \"\n + \"so \u00271.0\u0027 has Build=-1 and Revision=-1. CompareTo compares component by \"\n + \"component: Major, then Minor, then Build, then Revision. A component of \"\n + \"-1 (undefined) is considered LESS than 0, so \u00271.0\u0027 \u003c \u00271.0.0\u0027 because \"\n + \"Build -1 \u003c Build 0. This means \u00271.0\u0027 and \u00271.0.0\u0027 are NOT equal. \"\n + \"Parse throws FormatException for invalid input, ArgumentNullException \"\n + \"for null, and OverflowException if a component exceeds Int32.MaxValue.\";\n }\n","suffix":"\n static void Main()\n {\n if (CompareVersions(\"2.0\", \"1.9\") \u003c= 0) throw new Exception(\"2.0 \u003e 1.9\");\n if (CompareVersions(\"1.0\", \"1.0.0\") \u003e= 0) throw new Exception(\"1.0 \u003c 1.0.0 because Build -1 \u003c 0\");\n if (!IsPrerelease(\"1.0\")) throw new Exception(\"1.0 has Revision -1\");\n if (IsPrerelease(\"1.0.0.0\")) throw new Exception(\"1.0.0.0 has Revision 0\");\n\n string desc = DescribeCompareVersions();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Desc empty\");\n if (!desc.Contains(\"CompareTo\")) throw new Exception(\"Must mention CompareTo\");\n Console.WriteLine(\"Task 32 PASS\");\n }\n}\n","assertions":"string d32 = Program.DescribeCompareVersions().ToLower();\nif (!d32.Contains(\"-1\")) throw new Exception(\"Must mention -1 default for undefined components\");\nif (!d32.Contains(\"not 0\") \u0026\u0026 !d32.Contains(\"not zero\")) throw new Exception(\"Must clarify defaults are -1, not 0\");\nif (!(d32.Contains(\"1.0\") \u0026\u0026 d32.Contains(\"1.0.0\"))) throw new Exception(\"Must give the 1.0 \u003c 1.0.0 example\");\nif (!d32.Contains(\"not equal\") \u0026\u0026 !d32.Contains(\"less than\")) throw new Exception(\"Must explain 1.0 != 1.0.0\");\nif (!d32.Contains(\"formatexception\")) throw new Exception(\"Must mention FormatException\");\nif (!d32.Contains(\"major\") \u0026\u0026 !d32.Contains(\"minor\")) throw new Exception(\"Must mention component names\");\nif (!d32.Contains(\"build\") || !d32.Contains(\"revision\")) throw new Exception(\"Must mention Build and Revision\");\nVersion v32a = Version.Parse(\"1.0\"); Version v32b = Version.Parse(\"1.0.0\");\nif (v32a.CompareTo(v32b) \u003e= 0) throw new Exception(\"Verify 1.0 \u003c 1.0.0\");\n","category":"api_usage"} {"id":"33","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static void Main()\n {\n int original = 0x01020304;\n","golden_completion":" byte[] bytes = BitConverter.GetBytes(original);\n if (BitConverter.IsLittleEndian)\n {\n Array.Reverse(bytes);\n }\n int restored = BitConverter.ToInt32(BitConverter.IsLittleEndian ? GetReversed(bytes) : bytes, 0);\n","suffix":"\n if (restored != original) throw new Exception(\"Round-trip failed: \" + restored);\n\n // Verify big-endian byte order after our reversal\n if (BitConverter.IsLittleEndian)\n {\n if (bytes[0] != 0x01) throw new Exception(\"Expected MSB first after reverse\");\n if (bytes[3] != 0x04) throw new Exception(\"Expected LSB last after reverse\");\n }\n\n Console.WriteLine(\"Task 33 PASS\");\n }\n\n static byte[] GetReversed(byte[] input)\n {\n byte[] copy = (byte[])input.Clone();\n Array.Reverse(copy);\n return copy;\n }\n}\n","assertions":"byte[] testBytes = BitConverter.GetBytes((int)0x0A0B0C0D);\nif (BitConverter.IsLittleEndian)\n{\n if (testBytes[0] != 0x0D) throw new Exception(\"Little-endian: LSB should be first byte\");\n if (testBytes[3] != 0x0A) throw new Exception(\"Little-endian: MSB should be last byte\");\n}\nint roundTrip = BitConverter.ToInt32(BitConverter.GetBytes((int)42), 0);\nif (roundTrip != 42) throw new Exception(\"Simple round-trip should work\");\n","category":"api_usage"} {"id":"34","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static int FindOrInsertionPoint(int[] sorted, int value)\n {\n int idx = Array.BinarySearch(sorted, value);\n return idx \u003e= 0 ? idx : ~idx;\n }\n\n","golden_completion":" static string DescribeFindOrInsertionPoint()\n {\n return \"Uses Array.BinarySearch(Array, Object) which performs O(log n) binary search \"\n + \"on a SORTED array. Returns the zero-based index if found. If NOT found, returns \"\n + \"the bitwise complement (~) of the index of the next element larger than the value, \"\n + \"which is always a negative number. The caller applies ~ to recover the insertion \"\n + \"point. The array MUST be sorted in ascending order — behavior on unsorted arrays \"\n + \"is undefined, not an exception. Uses IComparable interface for element comparison. \"\n + \"For duplicate values, the index of ANY matching element may be returned (not \"\n + \"necessarily the first or last).\";\n }\n","suffix":"\n static void Main()\n {\n int[] arr = { 1, 3, 5, 7, 9 };\n if (FindOrInsertionPoint(arr, 5) != 2) throw new Exception(\"Should find 5 at index 2\");\n if (FindOrInsertionPoint(arr, 4) != 2) throw new Exception(\"4 would insert at index 2\");\n if (FindOrInsertionPoint(arr, 0) != 0) throw new Exception(\"0 would insert at index 0\");\n if (FindOrInsertionPoint(arr, 10) != 5) throw new Exception(\"10 would insert at index 5\");\n\n string desc = DescribeFindOrInsertionPoint();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Desc empty\");\n if (!desc.Contains(\"BinarySearch\")) throw new Exception(\"Must mention BinarySearch\");\n Console.WriteLine(\"Task 34 PASS\");\n }\n}\n","assertions":"string d34 = Program.DescribeFindOrInsertionPoint().ToLower();\nif (!d34.Contains(\"bitwise complement\") \u0026\u0026 !d34.Contains(\"~\")) throw new Exception(\"Must mention bitwise complement\");\nif (!d34.Contains(\"sorted\")) throw new Exception(\"Must mention sorted requirement\");\nif (!d34.Contains(\"undefined\") \u0026\u0026 !d34.Contains(\"not an exception\")) throw new Exception(\"Must mention undefined behavior on unsorted\");\nif (!d34.Contains(\"icomparable\")) throw new Exception(\"Must mention IComparable\");\nif (!d34.Contains(\"any matching\") \u0026\u0026 !d34.Contains(\"not necessarily\") \u0026\u0026 !d34.Contains(\"arbitrary\")) throw new Exception(\"Must mention duplicate behavior\");\nif (!d34.Contains(\"o(log n)\") \u0026\u0026 !d34.Contains(\"log n\") \u0026\u0026 !d34.Contains(\"logarithmic\")) throw new Exception(\"Must mention complexity\");\nif (!d34.Contains(\"negative\")) throw new Exception(\"Must mention negative return on miss\");\nint[] testArr = { 2, 4, 6 };\nint r34 = Array.BinarySearch(testArr, 3);\nif (r34 \u003e= 0) throw new Exception(\"3 not in array, should be negative\");\nif (~r34 != 1) throw new Exception(\"Insertion point for 3 should be 1\");\n","category":"api_usage"} {"id":"35","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Data;\n\nclass Program\n{\n static void Main()\n {\n DataTable table = new DataTable(\"Sales\");\n table.Columns.Add(\"Product\", typeof(string));\n table.Columns.Add(\"Qty\", typeof(int));\n table.Columns.Add(\"Price\", typeof(decimal));\n","golden_completion":" table.Columns.Add(\"Total\", typeof(decimal), \"Qty * Price\");\n\n table.Rows.Add(\"Widget\", 5, 3.50m);\n table.Rows.Add(\"Gadget\", 2, 12.00m);\n table.Rows.Add(\"Widget\", 3, 3.50m);\n\n DataRow[] widgets = table.Select(\"Product = \u0027Widget\u0027\", \"Total DESC\");\n decimal firstTotal = (decimal)widgets[0][\"Total\"];\n","suffix":"\n if (widgets.Length != 2) throw new Exception(\"Should find 2 Widget rows, got \" + widgets.Length);\n if (firstTotal != 17.50m) throw new Exception(\"First Widget total should be 17.50 (5*3.50), got \" + firstTotal);\n decimal secondTotal = (decimal)widgets[1][\"Total\"];\n if (secondTotal != 10.50m) throw new Exception(\"Second Widget total should be 10.50 (3*3.50), got \" + secondTotal);\n\n // Computed column auto-updates\n table.Rows[0][\"Qty\"] = 10;\n decimal updated = (decimal)table.Rows[0][\"Total\"];\n if (updated != 35.00m) throw new Exception(\"Computed column should auto-update, got \" + updated);\n\n Console.WriteLine(\"Task 35 PASS\");\n }\n}\n","assertions":"DataTable dt = new DataTable();\ndt.Columns.Add(\"A\", typeof(int));\ndt.Columns.Add(\"B\", typeof(int));\ndt.Columns.Add(\"C\", typeof(int), \"A + B\");\ndt.Rows.Add(1, 2);\nif ((int)dt.Rows[0][\"C\"] != 3) throw new Exception(\"Expression column should compute\");\ndt.Rows[0][\"A\"] = 10;\nif ((int)dt.Rows[0][\"C\"] != 12) throw new Exception(\"Expression column should auto-update\");\nDataRow[] selected = dt.Select(\"A \u003e 5\");\nif (selected.Length != 1) throw new Exception(\"Select filter failed\");\n","category":"api_usage"} {"id":"36","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static void SafeCopy(Array src, int srcIdx, Array dst, int dstIdx, int len)\n {\n Array.ConstrainedCopy(src, srcIdx, dst, dstIdx, len);\n }\n\n static void RegularCopy(Array src, int srcIdx, Array dst, int dstIdx, int len)\n {\n Array.Copy(src, srcIdx, dst, dstIdx, len);\n }\n\n","golden_completion":" static string DescribeSafeCopy()\n {\n return \"Array.ConstrainedCopy provides atomicity: either ALL elements are copied or \"\n + \"NONE are (the destination is unchanged on failure). This differs from Array.Copy \"\n + \"which may leave the destination partially modified if an exception occurs mid-copy. \"\n + \"ConstrainedCopy requires that source and destination have the EXACT same type \"\n + \"(no widening conversions like int[] to long[] allowed, unlike Array.Copy which \"\n + \"permits compatible widening). Both methods throw ArgumentException for rank \"\n + \"mismatch and ArrayTypeMismatchException for incompatible element types. \"\n + \"ConstrainedCopy is a constrained execution region (CER) guarantee.\";\n }\n","suffix":"\n static void Main()\n {\n int[] src = { 1, 2, 3, 4, 5 };\n int[] dst = { 0, 0, 0, 0, 0 };\n SafeCopy(src, 1, dst, 0, 3);\n if (dst[0] != 2 || dst[1] != 3 || dst[2] != 4) throw new Exception(\"ConstrainedCopy failed\");\n if (dst[3] != 0) throw new Exception(\"Should not modify beyond length\");\n\n string desc = DescribeSafeCopy();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Desc empty\");\n if (!desc.Contains(\"ConstrainedCopy\")) throw new Exception(\"Must mention ConstrainedCopy\");\n Console.WriteLine(\"Task 36 PASS\");\n }\n}\n","assertions":"string d36 = Program.DescribeSafeCopy().ToLower();\nif (!d36.Contains(\"atomic\") \u0026\u0026 !d36.Contains(\"all or nothing\") \u0026\u0026 !d36.Contains(\"all elements\")) throw new Exception(\"Must mention atomicity guarantee\");\nif (!d36.Contains(\"array.copy\")) throw new Exception(\"Must contrast with Array.Copy\");\nif (!d36.Contains(\"partially\") \u0026\u0026 !d36.Contains(\"partial\")) throw new Exception(\"Must mention Array.Copy can leave partial state\");\nif (!d36.Contains(\"exact\") \u0026\u0026 !d36.Contains(\"same type\")) throw new Exception(\"Must mention exact type requirement\");\nif (!d36.Contains(\"widening\") \u0026\u0026 !d36.Contains(\"int[] to long[]\") \u0026\u0026 !d36.Contains(\"no conversion\")) throw new Exception(\"Must mention no widening conversions\");\nif (!d36.Contains(\"cer\") \u0026\u0026 !d36.Contains(\"constrained execution\")) throw new Exception(\"Must mention CER\");\nif (!d36.Contains(\"arraytypemismatchexception\") \u0026\u0026 !d36.Contains(\"type mismatch\")) throw new Exception(\"Must mention type mismatch exception\");\nint[] s36 = {10, 20, 30}; int[] d36arr = new int[3];\nArray.ConstrainedCopy(s36, 0, d36arr, 0, 3);\nif (d36arr[1] != 20) throw new Exception(\"ConstrainedCopy basic test failed\");\n","category":"api_usage"} {"id":"37","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Specialized;\n\nclass Program\n{\n static void Main()\n {\n NameValueCollection nvc = new NameValueCollection();\n","golden_completion":" nvc.Add(\"color\", \"red\");\n nvc.Add(\"color\", \"blue\");\n nvc.Add(\"size\", \"large\");\n string colors = nvc.Get(\"color\");\n string[] colorArray = nvc.GetValues(\"color\");\n int keyCount = nvc.Count;\n","suffix":"\n // Get returns comma-separated for multiple values\n if (colors != \"red,blue\") throw new Exception(\"Get should return \u0027red,blue\u0027, got: \" + colors);\n if (colorArray.Length != 2) throw new Exception(\"GetValues should return 2 items\");\n if (colorArray[0] != \"red\" || colorArray[1] != \"blue\") throw new Exception(\"Values wrong\");\n // Count returns number of KEYS, not values\n if (keyCount != 2) throw new Exception(\"Count should be 2 (keys), got \" + keyCount);\n\n // Set replaces ALL values for a key\n nvc.Set(\"color\", \"green\");\n if (nvc.Get(\"color\") != \"green\") throw new Exception(\"Set should replace all values\");\n if (nvc.GetValues(\"color\").Length != 1) throw new Exception(\"Set should leave single value\");\n\n Console.WriteLine(\"Task 37 PASS\");\n }\n}\n","assertions":"NameValueCollection test = new NameValueCollection();\ntest.Add(\"k\", \"v1\");\ntest.Add(\"k\", \"v2\");\ntest.Add(\"k\", \"v3\");\nif (test.Get(\"k\") != \"v1,v2,v3\") throw new Exception(\"Get should comma-join multiple values\");\nif (test.Count != 1) throw new Exception(\"Count counts keys, not values\");\ntest.Set(\"k\", \"only\");\nif (test.GetValues(\"k\").Length != 1) throw new Exception(\"Set replaces all values\");\ntest.Add(\"k\", \"extra\");\nif (test.Get(\"k\") != \"only,extra\") throw new Exception(\"Add after Set should append\");\nstring nullVal = test.Get(\"nonexistent\");\nif (nullVal != null) throw new Exception(\"Get for missing key should return null\");\n","category":"api_usage"} {"id":"38","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static void GrowArray(ref int[] arr, int newSize)\n {\n Array.Resize(ref arr, newSize);\n }\n\n","golden_completion":" static string DescribeGrowArray()\n {\n return \"Array.Resize\u003cT\u003e(ref T[], int) does NOT resize the array in-place. It allocates \"\n + \"a NEW array of the specified size, copies elements from the old array (up to \"\n + \"Math.Min(old.Length, newSize)), and assigns the new array to the ref parameter. \"\n + \"The ORIGINAL array object is unchanged — any other variable still referencing it \"\n + \"sees the old data and old length. New elements in a grown array are initialized to \"\n + \"default(T) (0 for int, null for reference types). If newSize equals the current \"\n + \"length, a new array is still allocated. If newSize is 0, the ref parameter is set \"\n + \"to an empty array (not null).\";\n }\n","suffix":"\n static void Main()\n {\n int[] original = { 1, 2, 3 };\n int[] alias = original;\n GrowArray(ref original, 5);\n\n // Original reference now points to new array\n if (original.Length != 5) throw new Exception(\"Should be length 5\");\n if (original[3] != 0) throw new Exception(\"New elements should be 0\");\n\n // Alias still points to OLD array\n if (alias.Length != 3) throw new Exception(\"Alias should still be length 3\");\n if (!ReferenceEquals(alias, original)) { /* expected: they differ */ }\n else throw new Exception(\"Should be different array objects\");\n\n string desc = DescribeGrowArray();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Desc empty\");\n if (!desc.Contains(\"Resize\")) throw new Exception(\"Must mention Resize\");\n Console.WriteLine(\"Task 38 PASS\");\n }\n}\n","assertions":"string d38 = Program.DescribeGrowArray().ToLower();\nif (!d38.Contains(\"new array\") \u0026\u0026 !d38.Contains(\"allocate\")) throw new Exception(\"Must mention new array allocation\");\nif (!d38.Contains(\"not\") \u0026\u0026 !d38.Contains(\"does not\")) throw new Exception(\"Must mention does NOT resize in-place\");\nif (!d38.Contains(\"ref\")) throw new Exception(\"Must mention ref parameter\");\nif (!d38.Contains(\"original\") \u0026\u0026 !d38.Contains(\"old array\")) throw new Exception(\"Must mention original array unchanged\");\nif (!d38.Contains(\"default\") || (!d38.Contains(\"0 for int\") \u0026\u0026 !d38.Contains(\"default(t)\"))) throw new Exception(\"Must mention default values for new elements\");\nif (!d38.Contains(\"copy\") \u0026\u0026 !d38.Contains(\"copies\")) throw new Exception(\"Must mention copying elements\");\nint[] arr38 = { 10, 20 };\nint[] ref38 = arr38;\nArray.Resize(ref arr38, 4);\nif (ref38.Length != 2) throw new Exception(\"Old reference should still be length 2\");\nif (arr38.Length != 4) throw new Exception(\"New array should be length 4\");\nif (arr38[2] != 0) throw new Exception(\"New elements should default to 0\");\nArray.Resize(ref arr38, 0);\nif (arr38 == null) throw new Exception(\"Resize to 0 should give empty array, not null\");\nif (arr38.Length != 0) throw new Exception(\"Resize to 0 should give length 0\");\n","category":"api_usage"} {"id":"39","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static void Main()\n {\n Uri uri = new Uri(\"http://example.com:8080/path/to/resource?key=val\u0026foo=bar#section2\");\n","golden_completion":" string host = uri.Host;\n int port = uri.Port;\n string path = uri.AbsolutePath;\n string query = uri.Query;\n string fragment = uri.Fragment;\n string authority = uri.Authority;\n string pathAndQuery = uri.PathAndQuery;\n","suffix":"\n if (host != \"example.com\") throw new Exception(\"Host wrong: \" + host);\n if (port != 8080) throw new Exception(\"Port wrong: \" + port);\n if (path != \"/path/to/resource\") throw new Exception(\"AbsolutePath wrong: \" + path);\n // Query includes the leading \u0027?\u0027\n if (query != \"?key=val\u0026foo=bar\") throw new Exception(\"Query should include \u0027?\u0027: \" + query);\n // Fragment includes the leading \u0027#\u0027\n if (fragment != \"#section2\") throw new Exception(\"Fragment should include \u0027#\u0027: \" + fragment);\n if (authority != \"example.com:8080\") throw new Exception(\"Authority wrong: \" + authority);\n if (pathAndQuery != \"/path/to/resource?key=val\u0026foo=bar\") throw new Exception(\"PathAndQuery wrong: \" + pathAndQuery);\n\n // Default port for http is 80 — IsDefaultPort test\n Uri defaultPort = new Uri(\"http://example.com/test\");\n if (!defaultPort.IsDefaultPort) throw new Exception(\"Port 80 should be default for http\");\n if (defaultPort.Port != 80) throw new Exception(\"Default port should be 80\");\n\n Console.WriteLine(\"Task 39 PASS\");\n }\n}\n","assertions":"Uri u39 = new Uri(\"https://user:pass@host.com:443/a/b?x=1#frag\");\nif (u39.Port != 443) throw new Exception(\"Port should be 443\");\nif (u39.IsDefaultPort != true) throw new Exception(\"443 is default for https\");\nif (!u39.Query.StartsWith(\"?\")) throw new Exception(\"Query must start with ?\");\nif (!u39.Fragment.StartsWith(\"#\")) throw new Exception(\"Fragment must start with #\");\nif (u39.Authority != \"host.com\") throw new Exception(\"Authority omits default port, got: \" + u39.Authority);\nUri u39c = new Uri(\"https://host.com:8443/x\");\nif (u39c.Authority != \"host.com:8443\") throw new Exception(\"Authority includes non-default port\");\nUri u39b = new Uri(\"http://example.com\");\nif (u39b.AbsolutePath != \"/\") throw new Exception(\"Root path should be /\");\nif (u39b.Query != \"\") throw new Exception(\"No query should be empty string\");\nif (u39b.Fragment != \"\") throw new Exception(\"No fragment should be empty string\");\n","category":"api_usage"} {"id":"40","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Specialized;\n\nclass Program\n{\n static StringDictionary CreateLookup(string[] keys, string[] values)\n {\n StringDictionary sd = new StringDictionary();\n for (int i = 0; i \u003c keys.Length; i++)\n {\n sd.Add(keys[i], values[i]);\n }\n return sd;\n }\n\n","golden_completion":" static string DescribeCreateLookup()\n {\n return \"Uses StringDictionary which automatically LOWERCASES all keys on Add, \"\n + \"ContainsKey, and indexer access. \u0027Hello\u0027 and \u0027hello\u0027 map to the SAME entry — \"\n + \"Add(\u0027Hello\u0027,\u0027x\u0027) followed by Add(\u0027hello\u0027,\u0027y\u0027) throws ArgumentException for \"\n + \"duplicate key. This differs from Dictionary\u003cstring,string\u003e which is case-SENSITIVE \"\n + \"by default. Values are NOT lowercased, only keys. StringDictionary implements \"\n + \"IEnumerable but NOT IDictionary\u003cstring,string\u003e — it is a legacy collection from \"\n + \".NET 1.0 using DictionaryEntry for enumeration (not KeyValuePair). \"\n + \"ContainsValue is case-SENSITIVE. Null keys throw ArgumentNullException, \"\n + \"but null values are allowed.\";\n }\n","suffix":"\n static void Main()\n {\n StringDictionary sd = CreateLookup(\n new[] { \"Name\", \"COLOR\", \"Size\" },\n new[] { \"Alice\", \"Red\", \"Large\" }\n );\n\n // Keys are lowercased\n if (sd[\"name\"] != \"Alice\") throw new Exception(\"Should find \u0027name\u0027 (lowered from \u0027Name\u0027)\");\n if (sd[\"color\"] != \"Red\") throw new Exception(\"Should find \u0027color\u0027 (lowered from \u0027COLOR\u0027)\");\n if (!sd.ContainsKey(\"SIZE\") \u0026\u0026 !sd.ContainsKey(\"size\")) throw new Exception(\"Should find size key\");\n // But ContainsKey also lowercases the lookup\n if (!sd.ContainsKey(\"NaMe\")) throw new Exception(\"ContainsKey should be case-insensitive\");\n\n // Values are NOT lowercased\n if (sd.ContainsValue(\"alice\")) throw new Exception(\"ContainsValue should be case-sensitive\");\n if (!sd.ContainsValue(\"Alice\")) throw new Exception(\"Should find \u0027Alice\u0027 exactly\");\n\n string desc = DescribeCreateLookup();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Desc empty\");\n if (!desc.Contains(\"StringDictionary\")) throw new Exception(\"Must mention StringDictionary\");\n Console.WriteLine(\"Task 40 PASS\");\n }\n}\n","assertions":"string d40 = Program.DescribeCreateLookup().ToLower();\nif (!d40.Contains(\"lowercase\") \u0026\u0026 !d40.Contains(\"lower-case\") \u0026\u0026 !d40.Contains(\"lowered\")) throw new Exception(\"Must mention key lowercasing\");\nif (!d40.Contains(\"case-sensitive\") \u0026\u0026 !d40.Contains(\"case sensitive\")) throw new Exception(\"Must mention case sensitivity for values\");\nif (!d40.Contains(\"dictionary\u003cstring,string\u003e\") \u0026\u0026 !d40.Contains(\"dictionary\u003cstring, string\u003e\") \u0026\u0026 !d40.Contains(\"generic dictionary\")) throw new Exception(\"Must contrast with Dictionary\u003cstring,string\u003e\");\nif (!d40.Contains(\"dictionaryentry\") \u0026\u0026 !d40.Contains(\"not idictionary\")) throw new Exception(\"Must mention DictionaryEntry/legacy\");\nif (!d40.Contains(\"argumentexception\") \u0026\u0026 !d40.Contains(\"duplicate\")) throw new Exception(\"Must mention duplicate key exception\");\nif (!d40.Contains(\"null\") \u0026\u0026 !d40.Contains(\"argumentnullexception\")) throw new Exception(\"Must mention null handling\");\nStringDictionary sd40 = new StringDictionary();\nsd40.Add(\"ABC\", \"XYZ\");\nif (sd40[\"abc\"] != \"XYZ\") throw new Exception(\"Keys should be lowercased\");\nif (!sd40.ContainsKey(\"AbC\")) throw new Exception(\"ContainsKey should lowercase\");\nbool threw40 = false;\ntry { sd40.Add(\"abc\", \"dup\"); } catch (ArgumentException) { threw40 = true; }\nif (!threw40) throw new Exception(\"Duplicate lowered key should throw\");\n","category":"api_usage"} {"id":"41","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Linq.Expressions;\n\nnamespace Bench\n{\n public class Program\n {\n /// \u003csummary\u003e\n","golden_completion":" /// Compiles a BinaryExpression that multiplies two int parameters\n /// using Expression.Multiply, wraps it in Expression.Lambda, and\n /// invokes Compile() to produce a Func\u0026lt;int,int,int\u0026gt; delegate.\n /// The ParameterExpressions are created via Expression.Parameter.\n /// \u003c/summary\u003e\n","suffix":" public static Func\u003cint,int,int\u003e BuildMultiplier()\n {\n var a = Expression.Parameter(typeof(int), \"a\");\n var b = Expression.Parameter(typeof(int), \"b\");\n var mul = Expression.Multiply(a, b);\n var lambda = Expression.Lambda\u003cFunc\u003cint,int,int\u003e\u003e(mul, a, b);\n return lambda.Compile();\n }\n\n static void Main()\n {\n var fn = BuildMultiplier();\n if (!(fn(3, 7) == 21)) throw new Exception(\"3*7\");\n if (!(fn(0, 99) == 0)) throw new Exception(\"0*99\");\n if (!(fn(-2, 5) == -10)) throw new Exception(\"-2*5\");\n }\n }\n}\n","assertions":" var fn2 = Program.BuildMultiplier();\n if (!(fn2(1, 1) == 1)) throw new Exception(\"1*1\");\n if (!(fn2(-3, -4) == 12)) throw new Exception(\"-3*-4\");\n\n // Doc precision checks\n var method = typeof(Program).GetMethod(\"BuildMultiplier\");\n // We check the XML doc via reflection attribute — but C# XML docs\n // are not available at runtime. Instead, check the source.\n // For this benchmark, the golden completion IS the doc comment,\n // so we validate the assertions in suffix already cover correctness.\n // The hidden assertions just verify more multiply edge cases.\n if (!(fn2(100, 100) == 10000)) throw new Exception(\"100*100\");\n if (!(fn2(int.MaxValue, 0) == 0)) throw new Exception(\"maxval*0\");\n","category":"api_usage"} {"id":"42","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Text.Json;\nusing System.Text.Json.Nodes;\n\nnamespace Bench\n{\n public class Program\n {\n static void Main()\n {\n string json = @\"{\"\"items\"\":[{\"\"name\"\":\"\"A\"\",\"\"qty\"\":1},{\"\"name\"\":\"\"B\"\",\"\"qty\"\":2}],\"\"total\"\":3}\";\n JsonNode root = JsonNode.Parse(json)!;\n\n // Add a new item and update total using JsonNode mutable DOM\n","golden_completion":" var items = root[\"items\"]!.AsArray();\n var newItem = new JsonObject\n {\n [\"name\"] = \"C\",\n [\"qty\"] = 5\n };\n items.Add(newItem);\n int newTotal = 0;\n foreach (var item in items)\n {\n newTotal += item![\"qty\"]!.GetValue\u003cint\u003e();\n }\n root[\"total\"] = newTotal;\n","suffix":"\n string result = root.ToJsonString();\n if (!(root[\"total\"]!.GetValue\u003cint\u003e() == 8)) throw new Exception(\"total should be 8\");\n if (!(root[\"items\"]!.AsArray().Count == 3)) throw new Exception(\"should have 3 items\");\n var last = root[\"items\"]![2]!;\n if (!(last[\"name\"]!.GetValue\u003cstring\u003e() == \"C\")) throw new Exception(\"last item name\");\n if (!(last[\"qty\"]!.GetValue\u003cint\u003e() == 5)) throw new Exception(\"last item qty\");\n Console.WriteLine(result);\n }\n }\n}\n","assertions":" // Verify JSON roundtrip preserves structure\n var reparsed = JsonNode.Parse(root.ToJsonString())!;\n if (!(reparsed[\"items\"]!.AsArray().Count == 3)) throw new Exception(\"reparse count\");\n if (!(reparsed[\"total\"]!.GetValue\u003cint\u003e() == 8)) throw new Exception(\"reparse total\");\n // Verify original items preserved\n if (!(reparsed[\"items\"]![0]![\"name\"]!.GetValue\u003cstring\u003e() == \"A\")) throw new Exception(\"item A\");\n if (!(reparsed[\"items\"]![1]![\"qty\"]!.GetValue\u003cint\u003e() == 2)) throw new Exception(\"item B qty\");\n","category":"api_usage"} {"id":"43","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nnamespace Bench\n{\n public class Program\n {\n static void Main()\n {\n int[] data = { 10, 20, 30, 40, 50, 60, 70, 80 };\n\n // Use Index (^) and Range (..) operators to extract slices\n","golden_completion":" int last = data[^1];\n int secondLast = data[^2];\n int[] middle = data[2..6];\n int[] lastThree = data[^3..];\n int[] firstTwo = data[..2];\n int[] reversed = data[^4..^1];\n","suffix":"\n if (!(last == 80)) throw new Exception(\"last\");\n if (!(secondLast == 70)) throw new Exception(\"secondLast\");\n if (!(middle.Length == 4 \u0026\u0026 middle[0] == 30 \u0026\u0026 middle[3] == 60)) throw new Exception(\"middle\");\n if (!(lastThree.Length == 3 \u0026\u0026 lastThree[0] == 60)) throw new Exception(\"lastThree\");\n if (!(firstTwo.Length == 2 \u0026\u0026 firstTwo[1] == 20)) throw new Exception(\"firstTwo\");\n if (!(reversed.Length == 3 \u0026\u0026 reversed[0] == 50 \u0026\u0026 reversed[2] == 70)) throw new Exception(\"reversed\");\n Console.WriteLine(\"All slices correct\");\n }\n }\n}\n","assertions":" // Additional edge cases with Index/Range\n int first = data[^8];\n if (!(first == 10)) throw new Exception(\"^8 should be first\");\n int[] all = data[..];\n if (!(all.Length == 8)) throw new Exception(\"full range\");\n int[] empty = data[3..3];\n if (!(empty.Length == 0)) throw new Exception(\"empty range\");\n int[] single = data[^1..];\n if (!(single.Length == 1 \u0026\u0026 single[0] == 80)) throw new Exception(\"single from end\");\n","category":"api_usage"} {"id":"44","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Threading.Channels;\nusing System.Threading.Tasks;\n\nnamespace Bench\n{\n public class Program\n {\n /// \u003csummary\u003e\n","golden_completion":" /// Creates a bounded Channel\u0026lt;int\u0026gt; with capacity 2 using\n /// Channel.CreateBounded with BoundedChannelFullMode.Wait.\n /// The producer calls WriteAsync to enqueue values, blocking when\n /// the channel is full. The consumer calls ReadAsync in a loop\n /// until TryRead returns false after the writer calls Complete().\n /// Returns the sum of all consumed values.\n /// \u003c/summary\u003e\n","suffix":" public static async Task\u003cint\u003e ProduceConsumeAsync(int[] values)\n {\n var ch = Channel.CreateBounded\u003cint\u003e(new BoundedChannelOptions(2)\n {\n FullMode = BoundedChannelFullMode.Wait\n });\n\n var producer = Task.Run(async () =\u003e\n {\n foreach (var v in values)\n await ch.Writer.WriteAsync(v);\n ch.Writer.Complete();\n });\n\n int sum = 0;\n await foreach (var item in ch.Reader.ReadAllAsync())\n sum += item;\n\n await producer;\n return sum;\n }\n\n static async Task Main()\n {\n int result = await ProduceConsumeAsync(new[] { 1, 2, 3, 4, 5 });\n if (!(result == 15)) throw new Exception($\"expected 15 got {result}\");\n int empty = await ProduceConsumeAsync(Array.Empty\u003cint\u003e());\n if (!(empty == 0)) throw new Exception(\"empty should be 0\");\n }\n }\n}\n","assertions":" int r2 = await ProduceConsumeAsync(new[] { 10, 20, 30 });\n if (!(r2 == 60)) throw new Exception(\"10+20+30\");\n int r3 = await ProduceConsumeAsync(new[] { -1, 1 });\n if (!(r3 == 0)) throw new Exception(\"-1+1\");\n int r4 = await ProduceConsumeAsync(new[] { 100 });\n if (!(r4 == 100)) throw new Exception(\"single\");\n","category":"api_usage"} {"id":"45","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Dynamic;\n\nnamespace Bench\n{\n public class TrackedObject : DynamicObject\n {\n private Dictionary\u003cstring, object\u003e _store = new();\n private List\u003cstring\u003e _accessLog = new();\n\n public List\u003cstring\u003e AccessLog =\u003e _accessLog;\n\n","golden_completion":" public override bool TrySetMember(SetMemberBinder binder, object? value)\n {\n _store[binder.Name] = value!;\n _accessLog.Add(\"set:\" + binder.Name);\n return true;\n }\n\n public override bool TryGetMember(GetMemberBinder binder, out object? result)\n {\n _accessLog.Add(\"get:\" + binder.Name);\n return _store.TryGetValue(binder.Name, out result);\n }\n","suffix":" }\n\n public class Program\n {\n static void Main()\n {\n dynamic obj = new TrackedObject();\n obj.Name = \"Alice\";\n obj.Age = 30;\n string name = obj.Name;\n int age = obj.Age;\n\n var log = ((TrackedObject)obj).AccessLog;\n if (!(name == \"Alice\")) throw new Exception(\"name\");\n if (!(age == 30)) throw new Exception(\"age\");\n if (!(log.Count == 4)) throw new Exception($\"log count should be 4, got {log.Count}\");\n if (!(log[0] == \"set:Name\")) throw new Exception($\"log[0]={log[0]}\");\n if (!(log[1] == \"set:Age\")) throw new Exception($\"log[1]={log[1]}\");\n if (!(log[2] == \"get:Name\")) throw new Exception($\"log[2]={log[2]}\");\n if (!(log[3] == \"get:Age\")) throw new Exception($\"log[3]={log[3]}\");\n Console.WriteLine(\"TrackedObject OK\");\n }\n }\n}\n","assertions":" // Additional: set same property twice, get nonexistent\n dynamic obj2 = new TrackedObject();\n obj2.X = 1;\n obj2.X = 2;\n int x = obj2.X;\n var log2 = ((TrackedObject)obj2).AccessLog;\n if (!(log2.Count == 3)) throw new Exception(\"log2 count\");\n if (!(log2[0] == \"set:X\")) throw new Exception(\"log2[0]\");\n if (!(log2[1] == \"set:X\")) throw new Exception(\"log2[1] overwrite\");\n if (!(x == 2)) throw new Exception(\"overwritten value\");\n","category":"api_usage"} {"id":"46","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\n\nnamespace Bench\n{\n public class Program\n {\n static int SumSpan(ReadOnlySpan\u003cint\u003e span)\n {\n int s = 0;\n foreach (var v in span) s += v;\n return s;\n }\n\n static void Main()\n {\n Span\u003cint\u003e buf = stackalloc int[6];\n for (int i = 0; i \u003c 6; i++) buf[i] = (i + 1) * 10;\n // buf = {10, 20, 30, 40, 50, 60}\n\n // Use Span slicing to compute sums of different regions\n","golden_completion":" int total = SumSpan(buf);\n int firstHalf = SumSpan(buf[..3]);\n int lastHalf = SumSpan(buf[3..]);\n int mid = SumSpan(buf[1..5]);\n int lastTwo = SumSpan(buf[^2..]);\n","suffix":"\n if (!(total == 210)) throw new Exception($\"total={total}\");\n if (!(firstHalf == 60)) throw new Exception($\"firstHalf={firstHalf}\");\n if (!(lastHalf == 150)) throw new Exception($\"lastHalf={lastHalf}\");\n if (!(mid == 140)) throw new Exception($\"mid={mid}\");\n if (!(lastTwo == 110)) throw new Exception($\"lastTwo={lastTwo}\");\n Console.WriteLine(\"Span slicing OK\");\n }\n }\n}\n","assertions":" // Edge slices\n int single = SumSpan(buf[2..3]);\n if (!(single == 30)) throw new Exception(\"single slice\");\n int empty = SumSpan(buf[3..3]);\n if (!(empty == 0)) throw new Exception(\"empty slice\");\n int fromEnd = SumSpan(buf[^6..^3]);\n if (!(fromEnd == 60)) throw new Exception(\"fromEnd slice\");\n","category":"api_usage"} {"id":"47","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Globalization;\n\nnamespace Bench\n{\n public class Program\n {\n /// \u003csummary\u003e\n","golden_completion":" /// Formats a decimal as currency using a custom NumberFormatInfo\n /// where CurrencySymbol is \"XYZ\", CurrencyGroupSeparator is an\n /// underscore, CurrencyDecimalDigits is 3, and CurrencyGroupSizes\n /// is {2, 3} meaning the rightmost group has 2 digits and all\n /// subsequent groups have 3 digits. Uses decimal.ToString(\"C\", nfi)\n /// to produce the formatted string.\n /// \u003c/summary\u003e\n","suffix":" public static string FormatCustomCurrency(decimal amount)\n {\n var nfi = new NumberFormatInfo\n {\n CurrencySymbol = \"XYZ\",\n CurrencyGroupSeparator = \"_\",\n CurrencyDecimalDigits = 3,\n CurrencyGroupSizes = new int[] { 2, 3 }\n };\n return amount.ToString(\"C\", nfi);\n }\n\n static void Main()\n {\n string r1 = FormatCustomCurrency(1234567.89m);\n if (!(r1 == \"XYZ12_345_67.890\")) throw new Exception($\"got: {r1}\");\n string r2 = FormatCustomCurrency(0.5m);\n if (!(r2 == \"XYZ0.500\")) throw new Exception($\"got: {r2}\");\n string r3 = FormatCustomCurrency(99.1m);\n if (!(r3 == \"XYZ99.100\")) throw new Exception($\"got: {r3}\");\n Console.WriteLine(\"Custom currency OK\");\n }\n }\n}\n","assertions":" string r4 = Program.FormatCustomCurrency(100000m);\n if (!(r4 == \"XYZ1_000_00.000\")) throw new Exception($\"100000: {r4}\");\n string r5 = Program.FormatCustomCurrency(-42.7m);\n if (!(r5 == \"(XYZ42.700)\" || r5 == \"-XYZ42.700\" || r5.Contains(\"42.700\"))) throw new Exception($\"-42.7: {r5}\");\n string r6 = Program.FormatCustomCurrency(0m);\n if (!(r6 == \"XYZ0.000\")) throw new Exception($\"0: {r6}\");\n","category":"api_usage"} {"id":"48","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Linq.Expressions;\n\nnamespace Bench\n{\n public class Program\n {\n // Build an expression tree that represents: x =\u003e x \u003e 0 ? x * 2 : x * -1\n // Must use Expression.Condition, Expression.GreaterThan,\n // Expression.Multiply, Expression.Constant\n static Func\u003cint, int\u003e BuildAbsDoubler()\n {\n var x = Expression.Parameter(typeof(int), \"x\");\n","golden_completion":" var zero = Expression.Constant(0);\n var two = Expression.Constant(2);\n var negOne = Expression.Constant(-1);\n var test = Expression.GreaterThan(x, zero);\n var pos = Expression.Multiply(x, two);\n var neg = Expression.Multiply(x, negOne);\n var cond = Expression.Condition(test, pos, neg);\n return Expression.Lambda\u003cFunc\u003cint, int\u003e\u003e(cond, x).Compile();\n","suffix":" }\n\n static void Main()\n {\n var fn = BuildAbsDoubler();\n if (!(fn(5) == 10)) throw new Exception(\"5-\u003e10\");\n if (!(fn(-3) == 3)) throw new Exception(\"-3-\u003e3\");\n if (!(fn(0) == 0)) throw new Exception(\"0-\u003e0\");\n if (!(fn(1) == 2)) throw new Exception(\"1-\u003e2\");\n if (!(fn(-1) == 1)) throw new Exception(\"-1-\u003e1\");\n Console.WriteLine(\"AbsDoubler OK\");\n }\n }\n}\n","assertions":" var fn2 = BuildAbsDoubler();\n if (!(fn2(100) == 200)) throw new Exception(\"100-\u003e200\");\n if (!(fn2(-50) == 50)) throw new Exception(\"-50-\u003e50\");\n if (!(fn2(int.MaxValue / 2) == int.MaxValue / 2 * 2)) throw new Exception(\"large\");\n if (!(fn2(-1000) == 1000)) throw new Exception(\"-1000-\u003e1000\");\n","category":"api_usage"} {"id":"49","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.IO;\n\nnamespace Bench\n{\n public class Program\n {\n // Read lines from a StringReader, number them, write to StringWriter\n static string NumberLines(string text)\n {\n var reader = new StringReader(text);\n var writer = new StringWriter();\n","golden_completion":" string? line;\n int num = 1;\n while ((line = reader.ReadLine()) != null)\n {\n writer.WriteLine($\"{num}: {line}\");\n num++;\n }\n return writer.ToString().TrimEnd();\n","suffix":" }\n\n static void Main()\n {\n string input = \"alpha\\nbeta\\ngamma\";\n string result = NumberLines(input);\n if (!(result == \"1: alpha\\n2: beta\\n3: gamma\")) throw new Exception($\"got: [{result}]\");\n\n string single = NumberLines(\"only\");\n if (!(single == \"1: only\")) throw new Exception($\"single: [{single}]\");\n\n string empty = NumberLines(\"\");\n if (!(empty == \"\")) throw new Exception($\"empty: [{empty}]\");\n Console.WriteLine(\"NumberLines OK\");\n }\n }\n}\n","assertions":" string multi = Program.NumberLines(\"a\\nb\\nc\\nd\\ne\");\n if (!(multi == \"1: a\\n2: b\\n3: c\\n4: d\\n5: e\")) throw new Exception(\"multi\");\n string withSpaces = Program.NumberLines(\" x \\nhello\");\n if (!(withSpaces == \"1: x \\n2: hello\")) throw new Exception(\"spaces\");\n","category":"api_usage"} {"id":"50","testsource":"devbench-api-usage","language":"c_sharp","prefix":"using System;\nusing System.Globalization;\n\nnamespace Bench\n{\n public class Program\n {\n /// \u003csummary\u003e\n","golden_completion":" /// Parses dates using a custom DateTimeFormatInfo where all four\n /// month-name arrays (AbbreviatedMonthNames, AbbreviatedMonthGenitiveNames,\n /// MonthNames, MonthGenitiveNames) are replaced with Romanian-style names\n /// so that standard English month names no longer parse. DateSeparator\n /// is a dot. Uses DateTime.ParseExact with format \"dd.MMM.yyyy\" and the\n /// custom DateTimeFormatInfo attached to a CultureInfo(\"en-US\") clone.\n /// \u003c/summary\u003e\n","suffix":" public static DateTime ParseRomanianDate(string s)\n {\n var ci = new CultureInfo(\"en-US\");\n var dtfi = ci.DateTimeFormat;\n dtfi.AbbreviatedMonthNames = new[]\n {\n \"Ian\", \"Fev\", \"Mrt\", \"Avr\", \"Mai\", \"Iun\",\n \"Iul\", \"Avg\", \"Sep\", \"Okt\", \"Noe\", \"Dek\", \"\"\n };\n dtfi.AbbreviatedMonthGenitiveNames = new[]\n {\n \"Ian\", \"Fev\", \"Mrt\", \"Avr\", \"Mai\", \"Iun\",\n \"Iul\", \"Avg\", \"Sep\", \"Okt\", \"Noe\", \"Dek\", \"\"\n };\n dtfi.MonthNames = new[]\n {\n \"Ianuarie\", \"Februarie\", \"Martie\", \"Aprilie\", \"Maie\", \"Iunie\",\n \"Iulie\", \"August\", \"Septembrie\", \"Octombrie\", \"Noiembrie\", \"Decembrie\", \"\"\n };\n dtfi.MonthGenitiveNames = new[]\n {\n \"Ianuarie\", \"Februarie\", \"Martie\", \"Aprilie\", \"Maie\", \"Iunie\",\n \"Iulie\", \"August\", \"Septembrie\", \"Octombrie\", \"Noiembrie\", \"Decembrie\", \"\"\n };\n dtfi.DateSeparator = \".\";\n return DateTime.ParseExact(s, \"dd.MMM.yyyy\", ci);\n }\n\n static void Main()\n {\n var d1 = ParseRomanianDate(\"15.Ian.2024\");\n if (!(d1.Month == 1 \u0026\u0026 d1.Day == 15 \u0026\u0026 d1.Year == 2024)) throw new Exception(\"d1\");\n var d2 = ParseRomanianDate(\"01.Dek.1999\");\n if (!(d2.Month == 12 \u0026\u0026 d2.Day == 1 \u0026\u0026 d2.Year == 1999)) throw new Exception(\"d2\");\n var d3 = ParseRomanianDate(\"28.Fev.2000\");\n if (!(d3.Month == 2 \u0026\u0026 d3.Day == 28 \u0026\u0026 d3.Year == 2000)) throw new Exception(\"d3\");\n Console.WriteLine(\"Romanian dates OK\");\n }\n }\n}\n","assertions":" var d4 = Program.ParseRomanianDate(\"31.Iul.2023\");\n if (!(d4.Month == 7 \u0026\u0026 d4.Day == 31)) throw new Exception(\"d4 Jul\");\n var d5 = Program.ParseRomanianDate(\"10.Avg.2020\");\n if (!(d5.Month == 8 \u0026\u0026 d5.Day == 10)) throw new Exception(\"d5 Aug\");\n bool threw = false;\n try { Program.ParseRomanianDate(\"15.Jan.2024\"); }\n catch (FormatException) { threw = true; }\n if (!threw) throw new Exception(\"Jan should fail, only Ian works\");\n","category":"api_usage"} {"id":"1","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass ClaimResult {\n public string Status;\n public double Patient;\n public double Plan;\n public double DeductibleApplied;\n public double CoinsuranceApplied;\n}\n\nclass Adjudicator {\n public double Copay = 30.0;\n public double AnnualDeductible = 500.0;\n public double OopMax = 1000.0;\n public double CoinsuranceRate = 0.20;\n public double YtdDeductible = 0;\n public double YtdOop = 0;\n public Dictionary\u003cstring,double\u003e AllowedRates = new Dictionary\u003cstring,double\u003e{{\"XRAY\",0.50},{\"THERAPY\",0.80},{\"SURGERY\",0.60}};\n public HashSet\u003cstring\u003e RequiresAuth = new HashSet\u003cstring\u003e{\"SURGERY\"};\n public HashSet\u003cstring\u003e AuthorizedClaims = new HashSet\u003cstring\u003e();\n public HashSet\u003cstring\u003e ProcessedClaims = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e ClaimLedger = new List\u003cstring\u003e();\n\n static double R2(double v) =\u003e Math.Round(v, 2);\n\n // Adjudicate one medical claim line.\n // Rules:\n // 1. claimId is idempotent: if already processed, return null before any mutation.\n // 2. Unknown codes or missing auth for auth-required codes -\u003e DENIED, log \"DENIED:\u003cid\u003e:\u003ccode\u003e\", no accumulator changes.\n // 3. allowed = billed * AllowedRates[code]; remaining = max(0, allowed - primaryPaid).\n // 4. Preventive lines: patient=0, plan=remaining, no deductible/OOP mutation.\n // 5. Non-preventive waterfall: copay (capped at remaining), then deductible on remainder\n // (capped at AnnualDeductible - YtdDeductible), then coinsurance on the rest.\n // 6. patient = copayUsed + deductibleUsed + coinsurance, but clamped to (OopMax - YtdOop).\n // 7. plan = remaining - patient (never negative).\n // 8. Update YtdDeductible += deductibleUsed, YtdOop += patient.\n // 9. Log \"PAID:\u003cid\u003e:patient=\u003cp\u003e:plan=\u003cpl\u003e\".\n public ClaimResult AdjudicateLine(string claimId, string code, double billed, bool preventive, double primaryPaid) {\n","golden_completion":" if (ProcessedClaims.Contains(claimId)) return null;\n if (!AllowedRates.ContainsKey(code) || (RequiresAuth.Contains(code) \u0026\u0026 !AuthorizedClaims.Contains(claimId))) {\n ProcessedClaims.Add(claimId);\n ClaimLedger.Add(\"DENIED:\" + claimId + \":\" + code);\n return new ClaimResult { Status=\"DENIED\", Patient=0, Plan=0, DeductibleApplied=0, CoinsuranceApplied=0 };\n }\n ProcessedClaims.Add(claimId);\n double allowed = R2(billed * AllowedRates[code]);\n double remaining = R2(Math.Max(0, allowed - primaryPaid));\n double pat = 0, ded = 0, coins = 0;\n if (!preventive \u0026\u0026 remaining \u003e 0) {\n double copayUsed = Math.Min(Copay, remaining); remaining -= copayUsed;\n double dedAvail = Math.Max(0, AnnualDeductible - YtdDeductible);\n ded = R2(Math.Min(remaining, dedAvail)); remaining -= ded;\n coins = R2(remaining * CoinsuranceRate);\n pat = R2(copayUsed + ded + coins);\n double capLeft = Math.Max(0, OopMax - YtdOop);\n if (pat \u003e capLeft) pat = R2(capLeft);\n YtdDeductible = R2(YtdDeductible + ded);\n YtdOop = R2(YtdOop + pat);\n }\n double plan = R2(R2(allowed - primaryPaid) - pat); if (plan \u003c 0) plan = 0;\n ClaimLedger.Add(\"PAID:\" + claimId + \":patient=\" + pat + \":plan=\" + plan);\n return new ClaimResult { Status=\"PAID\", Patient=pat, Plan=plan, DeductibleApplied=ded, CoinsuranceApplied=coins };\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var adj = new Adjudicator();\n var r1 = adj.AdjudicateLine(\"C1\", \"THERAPY\", 400.0, false, 20.0);\n // allowed=320, remaining=300, copay=30, ded=270, coins=0, pat=300\n if (r1.Status != \"PAID\") throw new Exception(\"r1 status \" + r1.Status);\n if (Math.Abs(r1.Patient - 300.0) \u003e 0.01) throw new Exception(\"r1 patient \" + r1.Patient);\n if (Math.Abs(r1.DeductibleApplied - 270.0) \u003e 0.01) throw new Exception(\"r1 ded \" + r1.DeductibleApplied);\n if (Math.Abs(adj.YtdDeductible - 270.0) \u003e 0.01) throw new Exception(\"ytdDed \" + adj.YtdDeductible);\n\n var r2 = adj.AdjudicateLine(\"C2\", \"XRAY\", 100.0, true, 0.0);\n if (Math.Abs(r2.Patient) \u003e 0.01) throw new Exception(\"prev pat \" + r2.Patient);\n if (Math.Abs(r2.Plan - 50.0) \u003e 0.01) throw new Exception(\"prev plan \" + r2.Plan);\n if (Math.Abs(adj.YtdOop - 300.0) \u003e 0.01) throw new Exception(\"prev oopUnchanged \" + adj.YtdOop);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int ledgerBefore = adj.ClaimLedger.Count;\n double oopBefore = adj.YtdOop;\n var dup = adj.AdjudicateLine(\"C1\", \"THERAPY\", 999.0, false, 0.0);\n if (dup != null) throw new Exception(\"dup should be null\");\n if (adj.ClaimLedger.Count != ledgerBefore) throw new Exception(\"dup mutated ledger\");\n if (Math.Abs(adj.YtdOop - oopBefore) \u003e 0.01) throw new Exception(\"dup mutated OOP\");\n\n // Denied: SURGERY without auth\n double dedBefore = adj.YtdDeductible;\n var denied = adj.AdjudicateLine(\"S1\", \"SURGERY\", 1000.0, false, 0.0);\n if (denied.Status != \"DENIED\") throw new Exception(\"denied status \" + denied.Status);\n if (Math.Abs(denied.Patient) \u003e 0.01) throw new Exception(\"denied patient\");\n if (Math.Abs(adj.YtdDeductible - dedBefore) \u003e 0.01) throw new Exception(\"denied changed ded\");\n\n // OOP cap\n adj.AuthorizedClaims.Add(\"S2\");\n adj.YtdDeductible = 500.0;\n adj.YtdOop = 950.0;\n var capped = adj.AdjudicateLine(\"S2\", \"SURGERY\", 1000.0, false, 0.0);\n if (Math.Abs(capped.Patient - 50.0) \u003e 0.01) throw new Exception(\"cap pat \" + capped.Patient);\n if (Math.Abs(capped.Plan - 550.0) \u003e 0.01) throw new Exception(\"cap plan \" + capped.Plan);\n if (Math.Abs(adj.YtdOop - 1000.0) \u003e 0.01) throw new Exception(\"oopMax \" + adj.YtdOop);\n","category":"code_purpose_understanding"} {"id":"2","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Lot {\n public string Id;\n public string Sku;\n public int Qty;\n public int ExpiryDay;\n public bool Quarantined;\n}\n\nclass Warehouse {\n public List\u003cLot\u003e Lots = new List\u003cLot\u003e();\n public HashSet\u003cstring\u003e ProcessedTickets = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e AuditLog = new List\u003cstring\u003e();\n public int MinShelfLifeDays = 3;\n public Dictionary\u003cstring, List\u003cstring\u003e\u003e SavedTickets = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n\n public void AddLot(string id, string sku, int qty, int expiryDay, bool quarantined) {\n Lots.Add(new Lot { Id=id, Sku=sku, Qty=qty, ExpiryDay=expiryDay, Quarantined=quarantined });\n }\n\n public int TotalQty(string sku) {\n int t = 0; foreach (var l in Lots) if (l.Sku == sku) t += l.Qty; return t;\n }\n\n // Allocate a pick ticket for one SKU.\n // Rules:\n // 1. ticketId idempotent: return saved ticket copy if already processed, no mutation.\n // 2. Eligible lots: match sku, not quarantined, Qty\u003e0, ExpiryDay \u003e= shipDay + MinShelfLifeDays.\n // 3. Pick FEFO: lower ExpiryDay first, then lot Id lexicographic.\n // 4. If eligible stock \u003c requested and allowBackorder==false, return null with no mutation.\n // 5. If allowBackorder==true, pick what is available, append \"BACKORDER:\u003csku\u003e:\u003cmissing\u003e\".\n // 6. Deduct picked qtys, remove depleted lots, save ticket, audit every pick/backorder line.\n public List\u003cstring\u003e AllocateOrder(string ticketId, string sku, int qty, int shipDay, bool allowBackorder) {\n","golden_completion":" if (SavedTickets.ContainsKey(ticketId)) return new List\u003cstring\u003e(SavedTickets[ticketId]);\n if (qty \u003c= 0) throw new ArgumentException(\"qty\");\n var eligible = Lots.Where(l =\u003e l.Sku == sku \u0026\u0026 !l.Quarantined \u0026\u0026 l.Qty \u003e 0 \u0026\u0026 l.ExpiryDay \u003e= shipDay + MinShelfLifeDays)\n .OrderBy(l =\u003e l.ExpiryDay).ThenBy(l =\u003e l.Id).ToList();\n int available = eligible.Sum(l =\u003e l.Qty);\n if (available \u003c qty \u0026\u0026 !allowBackorder) return null;\n var ticket = new List\u003cstring\u003e();\n int needed = qty;\n foreach (var l in eligible) {\n if (needed \u003c= 0) break;\n int take = Math.Min(needed, l.Qty);\n l.Qty -= take; needed -= take;\n string line = \"PICK:\" + l.Id + \":\" + take;\n ticket.Add(line); AuditLog.Add(ticketId + \":\" + line);\n }\n Lots.RemoveAll(l =\u003e l.Qty == 0 \u0026\u0026 !l.Quarantined);\n if (needed \u003e 0) { string line = \"BACKORDER:\" + sku + \":\" + needed; ticket.Add(line); AuditLog.Add(ticketId + \":\" + line); }\n SavedTickets[ticketId] = new List\u003cstring\u003e(ticket);\n return new List\u003cstring\u003e(ticket);\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var wh = new Warehouse();\n wh.AddLot(\"L1\", \"MED\", 5, 10, false);\n wh.AddLot(\"L2\", \"MED\", 4, 7, false);\n wh.AddLot(\"L3\", \"MED\", 9, 6, true); // quarantined\n var t1 = wh.AllocateOrder(\"O1\", \"MED\", 6, 4, false);\n // FEFO: L2(exp7) then L1(exp10). Need 6: take 4 from L2, 2 from L1.\n if (t1.Count != 2 || t1[0] != \"PICK:L2:4\" || t1[1] != \"PICK:L1:2\") throw new Exception(\"t1=\" + string.Join(\",\", t1));\n if (wh.TotalQty(\"MED\") != 12) throw new Exception(\"total\"); // 3 remaining + 9 quarantined\n int beforeShort = wh.TotalQty(\"MED\");\n var shortNo = wh.AllocateOrder(\"O2\", \"MED\", 4, 4, false);\n if (shortNo != null) throw new Exception(\"short should be null\");\n if (wh.TotalQty(\"MED\") != beforeShort) throw new Exception(\"short mutated stock\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int auditBefore = wh.AuditLog.Count;\n var dup = wh.AllocateOrder(\"O1\", \"MED\", 99, 100, true);\n if (dup.Count != 2 || dup[0] != \"PICK:L2:4\") throw new Exception(\"dup ticket\");\n if (wh.AuditLog.Count != auditBefore) throw new Exception(\"dup audited\");\n\n // Backorder\n var back = wh.AllocateOrder(\"O3\", \"MED\", 5, 4, true);\n if (back.Count != 2 || back[0] != \"PICK:L1:3\" || back[1] != \"BACKORDER:MED:2\") throw new Exception(\"back=\" + string.Join(\",\", back));\n if (wh.TotalQty(\"MED\") != 9) throw new Exception(\"only quarantined remains\");\n\n // Shelf-life boundary\n var wh2 = new Warehouse();\n wh2.AddLot(\"E1\", \"VAX\", 2, 12, false);\n wh2.AddLot(\"E2\", \"VAX\", 2, 11, false);\n wh2.AddLot(\"E0\", \"VAX\", 2, 8, false);\n var bnd = wh2.AllocateOrder(\"O4\", \"VAX\", 4, 8, false);\n // shipDay=8 requires expiry\u003e=11. E0(exp8) too short. FEFO: E2(11) then E1(12).\n if (bnd[0] != \"PICK:E2:2\" || bnd[1] != \"PICK:E1:2\") throw new Exception(\"boundary=\" + string.Join(\",\", bnd));\n","category":"code_purpose_understanding"} {"id":"3","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass PharmacyRx {\n public int RxTotalQty;\n public int FilledQty;\n public int DaysSupply;\n public int LastFillDay = -1;\n public bool Controlled;\n public bool ExpeditedUsed;\n public int InventoryQty;\n public HashSet\u003cstring\u003e ProcessedFillIds = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e FillLog = new List\u003cstring\u003e();\n\n // Fill or refill a prescription.\n // Rules:\n // 1. fillId idempotent: duplicates return \"DUPLICATE\" before validation, no log.\n // 2. If prescription complete (FilledQty \u003e= RxTotalQty), return \"RX_COMPLETE\" with no mutation.\n // 3. Too-soon refill: days since last fill \u003c DaysSupply * 75 / 100 (integer truncation).\n // First fill (LastFillDay \u003c 0) is never too soon.\n // 4. One expedited too-soon exception allowed for non-controlled only.\n // 5. Controlled substances cannot be expedited and max 30 units per fill.\n // 6. Dispense = min(requested, remaining rx, inventory). Partial fills log backorder.\n // 7. Full fill -\u003e \"FILLED\", partial -\u003e \"PARTIAL\". Denials leave counters unchanged.\n public string Fill(string fillId, int day, int requestedQty, bool expedited) {\n","golden_completion":" if (ProcessedFillIds.Contains(fillId)) return \"DUPLICATE\";\n if (FilledQty \u003e= RxTotalQty) return \"RX_COMPLETE\";\n if (requestedQty \u003c= 0) throw new ArgumentException(\"qty\");\n if (Controlled \u0026\u0026 expedited) return \"CONTROLLED_EXPEDITE_DENIED\";\n if (Controlled \u0026\u0026 requestedQty \u003e 30) return \"CONTROLLED_QTY_LIMIT\";\n bool firstFill = LastFillDay \u003c 0;\n int threshold = (DaysSupply * 75) / 100;\n if (!firstFill \u0026\u0026 day - LastFillDay \u003c threshold) {\n if (!expedited || Controlled || ExpeditedUsed) return \"TOO_SOON\";\n ExpeditedUsed = true;\n }\n int remainingRx = RxTotalQty - FilledQty;\n int target = Math.Min(requestedQty, remainingRx);\n int dispensed = Math.Min(target, InventoryQty);\n if (dispensed == 0) return \"OUT_OF_STOCK\";\n ProcessedFillIds.Add(fillId);\n FilledQty += dispensed;\n InventoryQty -= dispensed;\n LastFillDay = day;\n FillLog.Add(\"FILL:\" + fillId + \":qty=\" + dispensed + \":day=\" + day);\n if (dispensed \u003c target) { FillLog.Add(\"BACKORDER:\" + fillId + \":qty=\" + (target - dispensed)); return \"PARTIAL\"; }\n return \"FILLED\";\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var rx = new PharmacyRx { RxTotalQty=90, DaysSupply=30, Controlled=false, InventoryQty=50 };\n string first = rx.Fill(\"F1\", 0, 30, false);\n if (first != \"FILLED\") throw new Exception(first);\n if (rx.FilledQty != 30 || rx.InventoryQty != 20) throw new Exception(\"first counters\");\n string early = rx.Fill(\"F2\", 10, 20, false);\n if (early != \"TOO_SOON\") throw new Exception(early);\n if (rx.FilledQty != 30) throw new Exception(\"too soon mutated\");\n string exp = rx.Fill(\"F3\", 10, 20, true);\n if (exp != \"FILLED\") throw new Exception(exp);\n if (!rx.ExpeditedUsed) throw new Exception(\"expedited flag\");\n if (rx.FilledQty != 50 || rx.InventoryQty != 0) throw new Exception(\"exp counters\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int logBefore = rx.FillLog.Count;\n string dup = rx.Fill(\"F1\", 99, 99, true);\n if (dup != \"DUPLICATE\") throw new Exception(\"dup=\" + dup);\n if (rx.FillLog.Count != logBefore) throw new Exception(\"dup logged\");\n\n // Second expedite denied\n string exp2 = rx.Fill(\"F4\", 15, 5, true);\n if (exp2 != \"TOO_SOON\") throw new Exception(\"exp2=\" + exp2);\n\n // Partial fill\n rx.InventoryQty = 10;\n string partial = rx.Fill(\"F5\", 32, 30, false);\n if (partial != \"PARTIAL\") throw new Exception(\"partial=\" + partial);\n if (rx.FilledQty != 60) throw new Exception(\"partial filled=\" + rx.FilledQty);\n if (rx.FillLog[rx.FillLog.Count - 1] != \"BACKORDER:F5:qty=20\") throw new Exception(\"backorder log\");\n\n // Controlled\n var crx = new PharmacyRx { RxTotalQty=60, DaysSupply=30, Controlled=true, InventoryQty=100 };\n if (crx.Fill(\"C1\", 0, 30, true) != \"CONTROLLED_EXPEDITE_DENIED\") throw new Exception(\"ctrl exp\");\n if (crx.FilledQty != 0) throw new Exception(\"ctrl denial mutated\");\n if (crx.Fill(\"C2\", 0, 40, false) != \"CONTROLLED_QTY_LIMIT\") throw new Exception(\"ctrl qty\");\n if (crx.Fill(\"C3\", 0, 30, false) != \"FILLED\") throw new Exception(\"ctrl fill\");\n","category":"code_purpose_understanding"} {"id":"4","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass PayStub {\n public double Retirement;\n public double Tax;\n public double Health;\n public double Garnishment;\n public double Net;\n}\n\nclass PayrollEngine {\n public double RetirementRate = 0.05;\n public double RetirementCap = 1000.0;\n public double HealthDeduction = 200.0;\n public double GarnishmentRate = 0.15;\n public double MinimumNet = 500.0;\n public double YtdGross = 0;\n public double YtdRetirement = 0;\n public double YtdTax = 0;\n public double YtdNet = 0;\n public HashSet\u003cstring\u003e ProcessedRuns = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e PayrollLog = new List\u003cstring\u003e();\n\n static double R2(double v) =\u003e Math.Round(v, 2);\n\n double TaxOn(double taxable) {\n double tax = 0;\n double first = Math.Min(taxable, 1000.0);\n if (first \u003e 0) tax += first * 0.10;\n double second = Math.Min(taxable - 1000.0, 2000.0);\n if (second \u003e 0) tax += second * 0.20;\n double rest = taxable - 3000.0;\n if (rest \u003e 0) tax += rest * 0.30;\n return R2(tax);\n }\n\n // Run one payroll check.\n // Rules:\n // 1. runId idempotent: duplicates return null, no mutation.\n // 2. Retirement = gross * 5%, capped so YtdRetirement never exceeds RetirementCap.\n // 3. Tax = marginal on (gross - retirement).\n // 4. Health deduction after tax, but may be reduced to preserve MinimumNet.\n // 5. Garnishment = 15% of disposable (after retirement/tax/health),\n // capped so net \u003e= MinimumNet.\n // 6. If net still \u003c MinimumNet after zeroing garnishment, reduce health (never tax or retirement).\n // 7. Update all YTD accumulators; log one line for successful runs.\n public PayStub RunPayroll(string runId, double gross) {\n","golden_completion":" if (ProcessedRuns.Contains(runId)) return null;\n if (gross \u003c= 0) throw new ArgumentException(\"gross\");\n double capLeft = Math.Max(0, RetirementCap - YtdRetirement);\n double retirement = R2(Math.Min(R2(gross * RetirementRate), capLeft));\n double tax = TaxOn(gross - retirement);\n double health = Math.Min(HealthDeduction, gross - retirement - tax);\n if (health \u003c 0) health = 0;\n double disposable = R2(gross - retirement - tax - health);\n double garnishment = R2(disposable * GarnishmentRate);\n if (disposable - garnishment \u003c MinimumNet) garnishment = R2(Math.Max(0, disposable - MinimumNet));\n double net = R2(disposable - garnishment);\n if (net \u003c MinimumNet) {\n double restore = Math.Min(MinimumNet - net, health);\n health = R2(health - restore);\n net = R2(net + restore);\n }\n ProcessedRuns.Add(runId);\n YtdGross = R2(YtdGross + gross); YtdRetirement = R2(YtdRetirement + retirement);\n YtdTax = R2(YtdTax + tax); YtdNet = R2(YtdNet + net);\n PayrollLog.Add(\"PAY:\" + runId + \":ret=\" + retirement + \":tax=\" + tax + \":health=\" + health + \":garnish=\" + garnishment + \":net=\" + net);\n return new PayStub { Retirement=retirement, Tax=tax, Health=health, Garnishment=garnishment, Net=net };\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var pe = new PayrollEngine();\n var p1 = pe.RunPayroll(\"R1\", 2000.0);\n // Ret=100, taxable=1900, tax=100+180=280, health=200, disp=1420, garn=213, net=1207\n if (Math.Abs(p1.Retirement - 100.0) \u003e 0.01) throw new Exception(\"ret=\" + p1.Retirement);\n if (Math.Abs(p1.Tax - 280.0) \u003e 0.01) throw new Exception(\"tax=\" + p1.Tax);\n if (Math.Abs(p1.Garnishment - 213.0) \u003e 0.01) throw new Exception(\"garn=\" + p1.Garnishment);\n if (Math.Abs(p1.Net - 1207.0) \u003e 0.01) throw new Exception(\"net=\" + p1.Net);\n if (Math.Abs(pe.YtdNet - 1207.0) \u003e 0.01) throw new Exception(\"ytdNet\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int logsBefore = pe.PayrollLog.Count;\n double ytdBefore = pe.YtdNet;\n var dup = pe.RunPayroll(\"R1\", 9999.0);\n if (dup != null) throw new Exception(\"dup not null\");\n if (pe.PayrollLog.Count != logsBefore) throw new Exception(\"dup logged\");\n if (Math.Abs(pe.YtdNet - ytdBefore) \u003e 0.01) throw new Exception(\"dup changed ytd\");\n\n // Low gross: health reduced to preserve minimum net\n var low = pe.RunPayroll(\"R2\", 800.0);\n // ret=40, tax=76, health must reduce to 184 to keep net=500\n if (Math.Abs(low.Retirement - 40.0) \u003e 0.01) throw new Exception(\"low ret=\" + low.Retirement);\n if (Math.Abs(low.Tax - 76.0) \u003e 0.01) throw new Exception(\"low tax=\" + low.Tax);\n if (Math.Abs(low.Health - 184.0) \u003e 0.01) throw new Exception(\"low health=\" + low.Health);\n if (Math.Abs(low.Garnishment) \u003e 0.01) throw new Exception(\"low garn=\" + low.Garnishment);\n if (Math.Abs(low.Net - 500.0) \u003e 0.01) throw new Exception(\"low net=\" + low.Net);\n\n // Retirement cap\n pe.YtdRetirement = 990.0;\n var capped = pe.RunPayroll(\"R3\", 1000.0);\n if (Math.Abs(capped.Retirement - 10.0) \u003e 0.01) throw new Exception(\"ret cap=\" + capped.Retirement);\n if (Math.Abs(pe.YtdRetirement - 1000.0) \u003e 0.01) throw new Exception(\"ytd ret cap\");\n","category":"code_purpose_understanding"} {"id":"5","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Grant {\n public string Id;\n public string Sku;\n public int Remaining;\n public int StartDay;\n public int EndDay;\n}\n\nclass DenyRule {\n public string Sku;\n public int Units;\n public int StartDay;\n public int EndDay;\n}\n\nclass EntitlementLedger {\n public List\u003cGrant\u003e Grants = new List\u003cGrant\u003e();\n public List\u003cDenyRule\u003e Denies = new List\u003cDenyRule\u003e();\n public Dictionary\u003cstring, List\u003cstring\u003e\u003e Tickets = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n public List\u003cstring\u003e AuditLog = new List\u003cstring\u003e();\n\n public int RemainingInGrant(string id) {\n foreach (var g in Grants) if (g.Id == id) return g.Remaining;\n return 0;\n }\n\n // Consume entitlements for one request.\n // Rules:\n // 1. requestId idempotent: return saved ticket copy, no mutation.\n // 2. Active grants: match sku, Remaining\u003e0, StartDay \u003c= day \u003c= EndDay.\n // 3. Active deny rules for sku reserve units that must remain unused that day.\n // 4. If totalActiveGrant - totalActiveDeny \u003c requested, return null, no mutation.\n // 5. Consume from grants expiring soonest (EndDay asc, then Id asc), removing depleted.\n // 6. Save ticket and audit lines \"USE:\u003cgrantId\u003e:\u003cunits\u003e\".\n public List\u003cstring\u003e Consume(string requestId, string sku, int units, int day) {\n","golden_completion":" if (Tickets.ContainsKey(requestId)) return new List\u003cstring\u003e(Tickets[requestId]);\n if (units \u003c= 0) throw new ArgumentException(\"units\");\n var active = Grants.Where(g =\u003e g.Sku == sku \u0026\u0026 g.Remaining \u003e 0 \u0026\u0026 g.StartDay \u003c= day \u0026\u0026 day \u003c= g.EndDay)\n .OrderBy(g =\u003e g.EndDay).ThenBy(g =\u003e g.Id).ToList();\n int total = active.Sum(g =\u003e g.Remaining);\n int denied = Denies.Where(d =\u003e d.Sku == sku \u0026\u0026 d.StartDay \u003c= day \u0026\u0026 day \u003c= d.EndDay).Sum(d =\u003e d.Units);\n if (total - denied \u003c units) return null;\n var ticket = new List\u003cstring\u003e();\n int needed = units;\n foreach (var g in active) {\n if (needed \u003c= 0) break;\n int take = Math.Min(needed, g.Remaining);\n g.Remaining -= take; needed -= take;\n string line = \"USE:\" + g.Id + \":\" + take;\n ticket.Add(line); AuditLog.Add(requestId + \":\" + line);\n }\n Grants.RemoveAll(g =\u003e g.Remaining == 0);\n Tickets[requestId] = new List\u003cstring\u003e(ticket);\n return new List\u003cstring\u003e(ticket);\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var ledger = new EntitlementLedger();\n ledger.Grants.Add(new Grant { Id=\"G1\", Sku=\"API\", Remaining=5, StartDay=0, EndDay=10 });\n ledger.Grants.Add(new Grant { Id=\"G2\", Sku=\"API\", Remaining=10, StartDay=0, EndDay=20 });\n ledger.Denies.Add(new DenyRule { Sku=\"API\", Units=2, StartDay=5, EndDay=15 });\n var t1 = ledger.Consume(\"R1\", \"API\", 4, 6);\n if (t1.Count != 1 || t1[0] != \"USE:G1:4\") throw new Exception(\"t1=\" + string.Join(\",\", t1));\n if (ledger.RemainingInGrant(\"G1\") != 1) throw new Exception(\"G1 remaining\");\n if (ledger.RemainingInGrant(\"G2\") != 10) throw new Exception(\"G2 remaining\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int auditBefore = ledger.AuditLog.Count;\n var dup = ledger.Consume(\"R1\", \"API\", 99, 6);\n if (dup.Count != 1 || dup[0] != \"USE:G1:4\") throw new Exception(\"dup\");\n if (ledger.AuditLog.Count != auditBefore) throw new Exception(\"dup audited\");\n\n // Deny-protected insufficiency\n var tooMuch = ledger.Consume(\"R2\", \"API\", 10, 6);\n if (tooMuch != null) throw new Exception(\"deny should make insufficient\");\n if (ledger.RemainingInGrant(\"G1\") != 1) throw new Exception(\"insuf mutated G1\");\n\n // Consume across grants expiring-soonest\n var t3 = ledger.Consume(\"R3\", \"API\", 9, 6);\n if (t3[0] != \"USE:G1:1\" || t3[1] != \"USE:G2:8\") throw new Exception(\"t3=\" + string.Join(\",\", t3));\n if (ledger.RemainingInGrant(\"G2\") != 2) throw new Exception(\"G2 after t3\");\n\n // Window boundary: EndDay inclusive\n var led2 = new EntitlementLedger();\n led2.Grants.Add(new Grant { Id=\"E1\", Sku=\"S\", Remaining=3, StartDay=2, EndDay=4 });\n led2.Grants.Add(new Grant { Id=\"E2\", Sku=\"S\", Remaining=3, StartDay=2, EndDay=5 });\n var bnd = led2.Consume(\"R4\", \"S\", 3, 4);\n if (bnd[0] != \"USE:E1:3\") throw new Exception(\"boundary=\" + string.Join(\",\", bnd));\n if (led2.Consume(\"R5\", \"S\", 3, 6) != null) throw new Exception(\"expired should fail\");\n","category":"code_purpose_understanding"} {"id":"6","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass CreditBlock {\n public string Id;\n public double Remaining;\n public int GrantedDay;\n}\n\nclass InvoiceLine {\n public string Description;\n public double Amount;\n}\n\nclass BillingAccount {\n public double MinimumCommit = 500.0;\n public double PerUnitRate = 0.10;\n public List\u003cCreditBlock\u003e Credits = new List\u003cCreditBlock\u003e();\n public HashSet\u003cstring\u003e ClosedPeriods = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e BillingLog = new List\u003cstring\u003e();\n\n static double R2(double v) =\u003e Math.Round(v, 2);\n\n // Close a billing period.\n // Rules:\n // 1. periodId idempotent: duplicates return null, no mutation.\n // 2. usageCharge = units * PerUnitRate.\n // 3. If usageCharge \u003c MinimumCommit, the invoice amount is MinimumCommit (not usageCharge).\n // 4. Apply credits FIFO (lowest GrantedDay first, then Id) against the invoice amount.\n // Reduce credit Remaining; remove exhausted credits.\n // 5. netDue = invoice - totalCreditsApplied (never negative).\n // 6. Mark period closed, log \"CLOSE:\u003cperiodId\u003e:usage=\u003cusageCharge\u003e:invoice=\u003cinvoiceAmt\u003e:credits=\u003ccreditsApplied\u003e:due=\u003cnetDue\u003e\".\n // 7. Return list of InvoiceLine: one for usage/minimum, one per credit applied, one for net due.\n public List\u003cInvoiceLine\u003e ClosePeriod(string periodId, int units) {\n","golden_completion":" if (ClosedPeriods.Contains(periodId)) return null;\n double usageCharge = R2(units * PerUnitRate);\n double invoiceAmt = Math.Max(usageCharge, MinimumCommit);\n var lines = new List\u003cInvoiceLine\u003e();\n if (usageCharge \u003c MinimumCommit)\n lines.Add(new InvoiceLine { Description=\"MINIMUM_COMMIT\", Amount=invoiceAmt });\n else\n lines.Add(new InvoiceLine { Description=\"USAGE:\" + units, Amount=usageCharge });\n var ordered = Credits.Where(c =\u003e c.Remaining \u003e 0).OrderBy(c =\u003e c.GrantedDay).ThenBy(c =\u003e c.Id).ToList();\n double remaining = invoiceAmt;\n double totalCredits = 0;\n foreach (var c in ordered) {\n if (remaining \u003c= 0) break;\n double apply = R2(Math.Min(remaining, c.Remaining));\n c.Remaining = R2(c.Remaining - apply);\n remaining = R2(remaining - apply);\n totalCredits = R2(totalCredits + apply);\n lines.Add(new InvoiceLine { Description=\"CREDIT:\" + c.Id, Amount=-apply });\n }\n Credits.RemoveAll(c =\u003e c.Remaining \u003c= 0);\n double netDue = R2(Math.Max(0, invoiceAmt - totalCredits));\n lines.Add(new InvoiceLine { Description=\"NET_DUE\", Amount=netDue });\n ClosedPeriods.Add(periodId);\n BillingLog.Add(\"CLOSE:\" + periodId + \":usage=\" + usageCharge + \":invoice=\" + invoiceAmt + \":credits=\" + totalCredits + \":due=\" + netDue);\n return lines;\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var acct = new BillingAccount();\n acct.Credits.Add(new CreditBlock { Id=\"CR1\", Remaining=100.0, GrantedDay=1 });\n acct.Credits.Add(new CreditBlock { Id=\"CR2\", Remaining=200.0, GrantedDay=5 });\n var inv = acct.ClosePeriod(\"P1\", 8000);\n // usage=800 \u003e minimum(500). Invoice=800. FIFO: CR1(100), CR2(200)=300 applied. Due=500.\n if (inv[0].Description != \"USAGE:8000\" || Math.Abs(inv[0].Amount - 800.0) \u003e 0.01) throw new Exception(\"usage line\");\n if (inv[1].Description != \"CREDIT:CR1\" || Math.Abs(inv[1].Amount + 100.0) \u003e 0.01) throw new Exception(\"cr1 line\");\n if (inv[2].Description != \"CREDIT:CR2\" || Math.Abs(inv[2].Amount + 200.0) \u003e 0.01) throw new Exception(\"cr2 line\");\n if (inv[3].Description != \"NET_DUE\" || Math.Abs(inv[3].Amount - 500.0) \u003e 0.01) throw new Exception(\"due line\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n var dup = acct.ClosePeriod(\"P1\", 99999);\n if (dup != null) throw new Exception(\"dup not null\");\n\n // Minimum commit kicks in\n acct.Credits.Add(new CreditBlock { Id=\"CR3\", Remaining=50.0, GrantedDay=10 });\n var inv2 = acct.ClosePeriod(\"P2\", 100);\n // usage=10 \u003c minimum(500). Invoice=500. CR3(50) applied. Due=450.\n if (inv2[0].Description != \"MINIMUM_COMMIT\" || Math.Abs(inv2[0].Amount - 500.0) \u003e 0.01)\n throw new Exception(\"min commit line: \" + inv2[0].Description + \" \" + inv2[0].Amount);\n if (inv2[1].Description != \"CREDIT:CR3\" || Math.Abs(inv2[1].Amount + 50.0) \u003e 0.01)\n throw new Exception(\"cr3 line\");\n if (inv2[inv2.Count-1].Description != \"NET_DUE\" || Math.Abs(inv2[inv2.Count-1].Amount - 450.0) \u003e 0.01)\n throw new Exception(\"due2\");\n\n // Credits fully cover\n acct.Credits.Add(new CreditBlock { Id=\"CR4\", Remaining=600.0, GrantedDay=20 });\n var inv3 = acct.ClosePeriod(\"P3\", 3000);\n // usage=300 \u003c minimum(500). Invoice=500. CR4 covers 500. Due=0. CR4 remaining=100.\n if (inv3[inv3.Count-1].Amount \u003e 0.01) throw new Exception(\"should be 0 due\");\n if (acct.Credits.Count != 1 || Math.Abs(acct.Credits[0].Remaining - 100.0) \u003e 0.01)\n throw new Exception(\"CR4 remaining=\" + acct.Credits[0].Remaining);\n","category":"code_purpose_understanding"} {"id":"7","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass DrawResult {\n public string Status;\n public double Released;\n public double Retainage;\n public double DefectReserve;\n}\n\nclass EscrowAccount {\n public double TotalContract = 100000.0;\n public double RetainageRate = 0.10;\n public double DefectReserveRate = 0.05;\n public double FundBalance;\n public double RetainageHeld = 0;\n public double DefectReserveHeld = 0;\n public double TotalDrawn = 0;\n public bool FinalAccepted = false;\n public HashSet\u003cstring\u003e ProcessedDraws = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e DrawLog = new List\u003cstring\u003e();\n public HashSet\u003cint\u003e CompletedMilestones = new HashSet\u003cint\u003e();\n public int TotalMilestones = 5;\n\n static double R2(double v) =\u003e Math.Round(v, 2);\n\n // Process a construction draw request.\n // Rules:\n // 1. drawId idempotent: duplicates return null, no mutation.\n // 2. If FinalAccepted, return Status=\"ALREADY_CLOSED\", no mutation.\n // 3. milestone must be completed (in CompletedMilestones) or return MILESTONE_INCOMPLETE.\n // 4. requestedAmount capped at (TotalContract - TotalDrawn) and FundBalance.\n // 5. Retainage = drawAmount * RetainageRate held back.\n // 6. DefectReserve = drawAmount * DefectReserveRate held back.\n // 7. Released = drawAmount - retainage - defectReserve.\n // 8. Update FundBalance, RetainageHeld, DefectReserveHeld, TotalDrawn.\n // 9. If all milestones completed AND TotalDrawn \u003e= TotalContract:\n // release retainage + defect reserve, set FinalAccepted=true, Status=\"FINAL_RELEASE\".\n // 10. Otherwise Status=\"DRAW_APPROVED\". Log \"DRAW:\u003cdrawId\u003e:released=\u003cr\u003e:retainage=\u003crt\u003e:defect=\u003cd\u003e\".\n public DrawResult ProcessDraw(string drawId, int milestone, double requestedAmount) {\n","golden_completion":" if (ProcessedDraws.Contains(drawId)) return null;\n if (FinalAccepted) return new DrawResult { Status=\"ALREADY_CLOSED\" };\n if (!CompletedMilestones.Contains(milestone)) return new DrawResult { Status=\"MILESTONE_INCOMPLETE\" };\n double maxDraw = R2(Math.Min(TotalContract - TotalDrawn, FundBalance));\n double drawAmount = R2(Math.Min(requestedAmount, maxDraw));\n if (drawAmount \u003c= 0) return new DrawResult { Status=\"NO_FUNDS\" };\n double retainage = R2(drawAmount * RetainageRate);\n double defect = R2(drawAmount * DefectReserveRate);\n double released = R2(drawAmount - retainage - defect);\n FundBalance = R2(FundBalance - drawAmount);\n RetainageHeld = R2(RetainageHeld + retainage);\n DefectReserveHeld = R2(DefectReserveHeld + defect);\n TotalDrawn = R2(TotalDrawn + drawAmount);\n ProcessedDraws.Add(drawId);\n string status = \"DRAW_APPROVED\";\n if (CompletedMilestones.Count \u003e= TotalMilestones \u0026\u0026 TotalDrawn \u003e= TotalContract) {\n released = R2(released + RetainageHeld + DefectReserveHeld);\n RetainageHeld = 0; DefectReserveHeld = 0;\n FinalAccepted = true;\n status = \"FINAL_RELEASE\";\n }\n DrawLog.Add(\"DRAW:\" + drawId + \":released=\" + released + \":retainage=\" + retainage + \":defect=\" + defect);\n return new DrawResult { Status=status, Released=released, Retainage=retainage, DefectReserve=defect };\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var esc = new EscrowAccount();\n esc.FundBalance = 100000.0;\n esc.CompletedMilestones.Add(1);\n esc.CompletedMilestones.Add(2);\n var d1 = esc.ProcessDraw(\"D1\", 1, 20000.0);\n // retainage=2000, defect=1000, released=17000\n if (d1.Status != \"DRAW_APPROVED\") throw new Exception(\"d1 status \" + d1.Status);\n if (Math.Abs(d1.Released - 17000.0) \u003e 0.01) throw new Exception(\"d1 released \" + d1.Released);\n if (Math.Abs(d1.Retainage - 2000.0) \u003e 0.01) throw new Exception(\"d1 retainage \" + d1.Retainage);\n if (Math.Abs(esc.FundBalance - 80000.0) \u003e 0.01) throw new Exception(\"fund \" + esc.FundBalance);\n if (Math.Abs(esc.RetainageHeld - 2000.0) \u003e 0.01) throw new Exception(\"retHeld \" + esc.RetainageHeld);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int logBefore = esc.DrawLog.Count;\n var dup = esc.ProcessDraw(\"D1\", 1, 99999.0);\n if (dup != null) throw new Exception(\"dup not null\");\n if (esc.DrawLog.Count != logBefore) throw new Exception(\"dup logged\");\n\n // Milestone incomplete\n var noMs = esc.ProcessDraw(\"D2\", 3, 10000.0);\n if (noMs.Status != \"MILESTONE_INCOMPLETE\") throw new Exception(\"ms status \" + noMs.Status);\n if (Math.Abs(esc.TotalDrawn - 20000.0) \u003e 0.01) throw new Exception(\"ms mutated drawn\");\n\n // Final release: complete all milestones and draw remaining\n esc.CompletedMilestones.Add(3);\n esc.CompletedMilestones.Add(4);\n esc.CompletedMilestones.Add(5);\n var d3 = esc.ProcessDraw(\"D3\", 3, 80000.0);\n // draw=80000, ret=8000, def=4000, released=68000 + held(2000+1000+8000+4000)=83000\n if (d3.Status != \"FINAL_RELEASE\") throw new Exception(\"final status \" + d3.Status);\n if (Math.Abs(d3.Released - 83000.0) \u003e 0.01) throw new Exception(\"final released \" + d3.Released);\n if (!esc.FinalAccepted) throw new Exception(\"not final\");\n if (Math.Abs(esc.RetainageHeld) \u003e 0.01) throw new Exception(\"retainage not released\");\n\n // After final\n var after = esc.ProcessDraw(\"D4\", 1, 1000.0);\n if (after.Status != \"ALREADY_CLOSED\") throw new Exception(\"after status\");\n","category":"code_purpose_understanding"} {"id":"8","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass PaymentResult {\n public string Status;\n public double ToFees;\n public double ToInterest;\n public double ToPrincipal;\n public double ToEscrow;\n public double ToSuspense;\n}\n\nclass LoanAccount {\n public double PrincipalBalance;\n public double InterestDue;\n public double EscrowDue;\n public double FeesOutstanding;\n public double SuspenseBalance;\n public double LateFeeAmount = 75.0;\n public bool LateFeePending;\n public bool LateFeeApplied;\n public string Status = \"CURRENT\"; // CURRENT, DELINQUENT, PAID_OFF, CHARGED_OFF\n public HashSet\u003cstring\u003e ProcessedPayments = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e PaymentLedger = new List\u003cstring\u003e();\n\n static double R2(double v) =\u003e Math.Round(v, 2);\n\n // Apply a payment to the loan.\n // Rules:\n // 1. paymentId idempotent: duplicates return Status=\"DUPLICATE\", no mutation.\n // 2. If CHARGED_OFF: all money to SuspenseBalance, Status stays CHARGED_OFF, return \"RECOVERY\".\n // 3. If LateFeePending \u0026\u0026 !LateFeeApplied: add LateFeeAmount to FeesOutstanding, set LateFeeApplied=true.\n // 4. Waterfall: fees -\u003e interest -\u003e escrow -\u003e principal. Each takes min(remaining, bucketDue).\n // 5. Excess after principal goes to SuspenseBalance.\n // 6. If PrincipalBalance reaches 0, Status=\"PAID_OFF\", return \"PAID_OFF\".\n // 7. Log \"PAY:\u003cid\u003e:fees=\u003cf\u003e:int=\u003ci\u003e:prin=\u003cp\u003e:esc=\u003ce\u003e:susp=\u003cs\u003e\". All amounts rounded to cents.\n public PaymentResult ApplyPayment(string paymentId, double amount) {\n","golden_completion":" if (ProcessedPayments.Contains(paymentId))\n return new PaymentResult { Status=\"DUPLICATE\" };\n ProcessedPayments.Add(paymentId);\n if (Status == \"CHARGED_OFF\") {\n SuspenseBalance = R2(SuspenseBalance + amount);\n PaymentLedger.Add(\"PAY:\" + paymentId + \":RECOVERY:\" + amount);\n return new PaymentResult { Status=\"RECOVERY\", ToSuspense=amount };\n }\n if (LateFeePending \u0026\u0026 !LateFeeApplied) {\n FeesOutstanding = R2(FeesOutstanding + LateFeeAmount);\n LateFeeApplied = true;\n }\n double rem = amount;\n double toFees = R2(Math.Min(rem, FeesOutstanding)); FeesOutstanding = R2(FeesOutstanding - toFees); rem = R2(rem - toFees);\n double toInt = R2(Math.Min(rem, InterestDue)); InterestDue = R2(InterestDue - toInt); rem = R2(rem - toInt);\n double toEsc = R2(Math.Min(rem, EscrowDue)); EscrowDue = R2(EscrowDue - toEsc); rem = R2(rem - toEsc);\n double toPrin = R2(Math.Min(rem, PrincipalBalance)); PrincipalBalance = R2(PrincipalBalance - toPrin); rem = R2(rem - toPrin);\n double toSusp = R2(rem);\n SuspenseBalance = R2(SuspenseBalance + toSusp);\n string st = \"APPLIED\";\n if (PrincipalBalance \u003c= 0.001) { Status = \"PAID_OFF\"; st = \"PAID_OFF\"; }\n PaymentLedger.Add(\"PAY:\" + paymentId + \":fees=\" + toFees + \":int=\" + toInt + \":prin=\" + toPrin + \":esc=\" + toEsc + \":susp=\" + toSusp);\n return new PaymentResult { Status=st, ToFees=toFees, ToInterest=toInt, ToPrincipal=toPrin, ToEscrow=toEsc, ToSuspense=toSusp };\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var loan = new LoanAccount { PrincipalBalance=10000.0, InterestDue=200.0, EscrowDue=100.0, LateFeePending=true };\n var r1 = loan.ApplyPayment(\"P1\", 500.0);\n // Late fee injected: fees=75. Waterfall: 75+200+100+125=500. principal=9875.\n if (r1.Status != \"APPLIED\") throw new Exception(\"r1 status \" + r1.Status);\n if (Math.Abs(r1.ToFees - 75.0) \u003e 0.01) throw new Exception(\"r1 fees \" + r1.ToFees);\n if (Math.Abs(r1.ToInterest - 200.0) \u003e 0.01) throw new Exception(\"r1 int \" + r1.ToInterest);\n if (Math.Abs(r1.ToEscrow - 100.0) \u003e 0.01) throw new Exception(\"r1 esc \" + r1.ToEscrow);\n if (Math.Abs(r1.ToPrincipal - 125.0) \u003e 0.01) throw new Exception(\"r1 prin \" + r1.ToPrincipal);\n if (Math.Abs(loan.PrincipalBalance - 9875.0) \u003e 0.01) throw new Exception(\"principal \" + loan.PrincipalBalance);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int ledgerBefore = loan.PaymentLedger.Count;\n var dup = loan.ApplyPayment(\"P1\", 9999.0);\n if (dup.Status != \"DUPLICATE\") throw new Exception(\"dup status\");\n if (loan.PaymentLedger.Count != ledgerBefore) throw new Exception(\"dup logged\");\n\n // Late fee already applied — should NOT add again\n loan.LateFeePending = true; // still pending but already applied\n double feesBefore = loan.FeesOutstanding;\n var r2 = loan.ApplyPayment(\"P2\", 50.0);\n if (Math.Abs(r2.ToPrincipal - 50.0) \u003e 0.01) throw new Exception(\"r2 prin \" + r2.ToPrincipal);\n\n // Paid-off transition\n loan.InterestDue = 0; loan.EscrowDue = 0; loan.FeesOutstanding = 0;\n double prinLeft = loan.PrincipalBalance;\n var r3 = loan.ApplyPayment(\"P3\", prinLeft + 200.0);\n if (r3.Status != \"PAID_OFF\") throw new Exception(\"r3 status \" + r3.Status);\n if (Math.Abs(r3.ToSuspense - 200.0) \u003e 0.01) throw new Exception(\"r3 susp \" + r3.ToSuspense);\n if (loan.Status != \"PAID_OFF\") throw new Exception(\"loan status\");\n\n // Charged-off recovery\n var loan2 = new LoanAccount { PrincipalBalance=5000.0, InterestDue=100.0, EscrowDue=50.0, Status=\"CHARGED_OFF\" };\n var rec = loan2.ApplyPayment(\"R1\", 300.0);\n if (rec.Status != \"RECOVERY\") throw new Exception(\"rec status\");\n if (Math.Abs(rec.ToSuspense - 300.0) \u003e 0.01) throw new Exception(\"rec susp \" + rec.ToSuspense);\n if (Math.Abs(loan2.PrincipalBalance - 5000.0) \u003e 0.01) throw new Exception(\"charged off prin moved\");\n","category":"code_purpose_understanding"} {"id":"9","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass SubResult {\n public string PrevState;\n public string NewState;\n public double Charge;\n public string Message;\n}\n\nclass Subscription {\n public string State = \"TRIAL\"; // TRIAL, ACTIVE, PAUSED, GRACE, CANCELLED\n public int TrialEndDay;\n public int GracePeriodDays = 7;\n public double MonthlyRate = 50.0;\n public double DaysInMonth = 30.0;\n public int LastBilledDay = -1;\n public int PausedDay = -1;\n public int GraceStartDay = -1;\n public double TotalCharged = 0;\n public HashSet\u003cstring\u003e ProcessedActions = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e ActionLog = new List\u003cstring\u003e();\n\n static double R2(double v) =\u003e Math.Round(v, 2);\n\n // Process a subscription action.\n // Rules:\n // 1. actionId idempotent: duplicates return null, no mutation.\n // 2. \"activate\": TRIAL-\u003eACTIVE on or after TrialEndDay. Charge full month. TRIAL only.\n // 3. \"bill\": ACTIVE only. Charge full month if day - LastBilledDay \u003e= 30. Update LastBilledDay.\n // If day - LastBilledDay \u003c 30, return \"NOT_DUE\".\n // 4. \"pause\": ACTIVE-\u003ePAUSED. No charge. Record PausedDay. Cannot pause from TRIAL/CANCELLED/GRACE.\n // 5. \"resume\": PAUSED-\u003eACTIVE. Prorated charge = MonthlyRate * (daysRemaining / DaysInMonth)\n // where daysRemaining = 30 - (PausedDay - LastBilledDay). If daysRemaining \u003c= 0, no charge.\n // 6. \"cancel\": any state except CANCELLED. ACTIVE/PAUSED-\u003eGRACE (start grace period).\n // TRIAL-\u003eCANCELLED immediately. GRACE-\u003eCANCELLED immediately.\n // 7. \"expire_grace\": GRACE only. If day \u003e= GraceStartDay + GracePeriodDays -\u003e CANCELLED.\n // Otherwise return \"GRACE_ACTIVE\".\n // 8. Log \"ACTION:\u003cactionId\u003e:\u003caction\u003e:\u003cprevState\u003e-\u003e\u003cnewState\u003e:charge=\u003cc\u003e\".\n public SubResult ProcessAction(string actionId, string action, int day) {\n","golden_completion":" if (ProcessedActions.Contains(actionId)) return null;\n ProcessedActions.Add(actionId);\n string prev = State;\n double charge = 0;\n string msg = \"OK\";\n switch (action) {\n case \"activate\":\n if (State != \"TRIAL\") { msg = \"INVALID_STATE\"; break; }\n if (day \u003c TrialEndDay) { msg = \"TRIAL_NOT_OVER\"; break; }\n State = \"ACTIVE\"; charge = MonthlyRate; LastBilledDay = day; TotalCharged = R2(TotalCharged + charge);\n break;\n case \"bill\":\n if (State != \"ACTIVE\") { msg = \"INVALID_STATE\"; break; }\n if (day - LastBilledDay \u003c 30) { msg = \"NOT_DUE\"; break; }\n charge = MonthlyRate; LastBilledDay = day; TotalCharged = R2(TotalCharged + charge);\n break;\n case \"pause\":\n if (State != \"ACTIVE\") { msg = \"INVALID_STATE\"; break; }\n State = \"PAUSED\"; PausedDay = day;\n break;\n case \"resume\":\n if (State != \"PAUSED\") { msg = \"INVALID_STATE\"; break; }\n int daysRemaining = 30 - (PausedDay - LastBilledDay);\n if (daysRemaining \u003e 0) { charge = R2(MonthlyRate * daysRemaining / DaysInMonth); TotalCharged = R2(TotalCharged + charge); }\n State = \"ACTIVE\";\n break;\n case \"cancel\":\n if (State == \"CANCELLED\") { msg = \"ALREADY_CANCELLED\"; break; }\n if (State == \"TRIAL\" || State == \"GRACE\") { State = \"CANCELLED\"; }\n else { State = \"GRACE\"; GraceStartDay = day; }\n break;\n case \"expire_grace\":\n if (State != \"GRACE\") { msg = \"INVALID_STATE\"; break; }\n if (day \u003e= GraceStartDay + GracePeriodDays) { State = \"CANCELLED\"; }\n else { msg = \"GRACE_ACTIVE\"; }\n break;\n default:\n msg = \"UNKNOWN_ACTION\"; break;\n }\n ActionLog.Add(\"ACTION:\" + actionId + \":\" + action + \":\" + prev + \"-\u003e\" + State + \":charge=\" + charge);\n return new SubResult { PrevState=prev, NewState=State, Charge=charge, Message=msg };\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var sub = new Subscription { TrialEndDay=14 };\n var a1 = sub.ProcessAction(\"A1\", \"activate\", 14);\n if (a1.NewState != \"ACTIVE\" || Math.Abs(a1.Charge - 50.0) \u003e 0.01) throw new Exception(\"activate \" + a1.NewState + \" \" + a1.Charge);\n if (sub.LastBilledDay != 14) throw new Exception(\"lastBilled\");\n\n var a2 = sub.ProcessAction(\"A2\", \"bill\", 30);\n if (a2.Message != \"NOT_DUE\") throw new Exception(\"not due \" + a2.Message); // 30-14=16 \u003c 30\n\n var a3 = sub.ProcessAction(\"A3\", \"bill\", 44);\n if (Math.Abs(a3.Charge - 50.0) \u003e 0.01) throw new Exception(\"bill charge \" + a3.Charge);\n if (sub.LastBilledDay != 44) throw new Exception(\"lastBilled2\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int logBefore = sub.ActionLog.Count;\n var dup = sub.ProcessAction(\"A1\", \"activate\", 99);\n if (dup != null) throw new Exception(\"dup not null\");\n if (sub.ActionLog.Count != logBefore) throw new Exception(\"dup logged\");\n\n // Pause + resume with proration\n var a4 = sub.ProcessAction(\"A4\", \"pause\", 54);\n if (a4.NewState != \"PAUSED\") throw new Exception(\"pause state \" + a4.NewState);\n if (sub.PausedDay != 54) throw new Exception(\"pausedDay\");\n // daysRemaining = 30 - (54 - 44) = 20. charge = 50 * 20/30 = 33.33\n var a5 = sub.ProcessAction(\"A5\", \"resume\", 60);\n if (a5.NewState != \"ACTIVE\") throw new Exception(\"resume state \" + a5.NewState);\n if (Math.Abs(a5.Charge - 33.33) \u003e 0.01) throw new Exception(\"proration \" + a5.Charge);\n\n // Cancel from active -\u003e GRACE\n var a6 = sub.ProcessAction(\"A6\", \"cancel\", 70);\n if (a6.NewState != \"GRACE\") throw new Exception(\"cancel state \" + a6.NewState);\n\n // Grace not expired yet\n var a7 = sub.ProcessAction(\"A7\", \"expire_grace\", 73);\n if (a7.Message != \"GRACE_ACTIVE\") throw new Exception(\"grace active \" + a7.Message);\n\n // Grace expired\n var a8 = sub.ProcessAction(\"A8\", \"expire_grace\", 77);\n if (a8.NewState != \"CANCELLED\") throw new Exception(\"grace expired \" + a8.NewState);\n\n // Trial early activate\n var sub2 = new Subscription { TrialEndDay=14 };\n var ea = sub2.ProcessAction(\"E1\", \"activate\", 10);\n if (ea.Message != \"TRIAL_NOT_OVER\") throw new Exception(\"early activate \" + ea.Message);\n if (sub2.State != \"TRIAL\") throw new Exception(\"early activate changed state\");\n\n // Cancel from trial -\u003e CANCELLED immediately\n var ct = sub2.ProcessAction(\"E2\", \"cancel\", 10);\n if (ct.NewState != \"CANCELLED\") throw new Exception(\"trial cancel \" + ct.NewState);\n","category":"code_purpose_understanding"} {"id":"10","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass OrderResult {\n public string Status;\n public int Shipped;\n public double Charged;\n public double Refunded;\n}\n\nclass FulfillmentEngine {\n public Dictionary\u003cstring, int\u003e Inventory = new Dictionary\u003cstring, int\u003e();\n public Dictionary\u003cstring, double\u003e Prices = new Dictionary\u003cstring, double\u003e();\n public double PaymentBalance = 0;\n public HashSet\u003cstring\u003e ProcessedOrders = new HashSet\u003cstring\u003e();\n public HashSet\u003cstring\u003e CancelledOrders = new HashSet\u003cstring\u003e();\n public List\u003cstring\u003e FulfillLog = new List\u003cstring\u003e();\n public int LabelSeq = 1000;\n\n static double R2(double v) =\u003e Math.Round(v, 2);\n\n // Fulfill an order.\n // Rules:\n // 1. orderId idempotent: duplicates return Status=\"DUPLICATE\", no mutation.\n // 2. If orderId in CancelledOrders, return \"CANCELLED\", no mutation.\n // 3. Compute totalPrice = qty * Prices[sku]. If sku not in Prices, return \"UNKNOWN_SKU\".\n // 4. Capture payment: if PaymentBalance \u003c totalPrice, return \"PAYMENT_FAILED\", no mutation.\n // 5. Reserve inventory: if Inventory[sku] \u003c qty, check if partial allowed.\n // a. partialAllowed=false: refund captured payment, return \"INSUFFICIENT_STOCK\".\n // b. partialAllowed=true: ship available, refund for unshipped, backorder rest.\n // 6. Full ship: deduct inventory, deduct PaymentBalance by totalPrice, generate label \"SHP-\u003cseq++\u003e\".\n // 7. Partial: deduct available, charge for shipped only (refund difference), generate label, log backorder.\n // 8. Log \"FULFILL:\u003corderId\u003e:\u003csku\u003e:shipped=\u003cs\u003e:charged=\u003cc\u003e:label=\u003cl\u003e\".\n public OrderResult Fulfill(string orderId, string sku, int qty, bool partialAllowed) {\n","golden_completion":" if (ProcessedOrders.Contains(orderId)) return new OrderResult { Status=\"DUPLICATE\" };\n if (CancelledOrders.Contains(orderId)) return new OrderResult { Status=\"CANCELLED\" };\n if (!Prices.ContainsKey(sku)) return new OrderResult { Status=\"UNKNOWN_SKU\" };\n double totalPrice = R2(qty * Prices[sku]);\n if (PaymentBalance \u003c totalPrice) return new OrderResult { Status=\"PAYMENT_FAILED\" };\n int avail = Inventory.ContainsKey(sku) ? Inventory[sku] : 0;\n if (avail \u003c qty \u0026\u0026 !partialAllowed) return new OrderResult { Status=\"INSUFFICIENT_STOCK\" };\n ProcessedOrders.Add(orderId);\n int shipped = Math.Min(qty, avail);\n double charged = R2(shipped * Prices[sku]);\n double refunded = R2(totalPrice - charged);\n if (shipped \u003e 0) Inventory[sku] = avail - shipped;\n PaymentBalance = R2(PaymentBalance - charged);\n string label = shipped \u003e 0 ? \"SHP-\" + (++LabelSeq) : \"\";\n if (shipped \u003c qty) FulfillLog.Add(\"BACKORDER:\" + orderId + \":\" + sku + \":\" + (qty - shipped));\n FulfillLog.Add(\"FULFILL:\" + orderId + \":\" + sku + \":shipped=\" + shipped + \":charged=\" + charged + \":label=\" + label);\n string status = shipped == qty ? \"FULFILLED\" : (shipped \u003e 0 ? \"PARTIAL\" : \"NO_STOCK\");\n return new OrderResult { Status=status, Shipped=shipped, Charged=charged, Refunded=refunded };\n","suffix":" }\n}\n\nclass Program {\n static void Main() {\n var eng = new FulfillmentEngine();\n eng.Inventory[\"WIDGET\"] = 15;\n eng.Prices[\"WIDGET\"] = 10.0;\n eng.PaymentBalance = 500.0;\n var r1 = eng.Fulfill(\"O1\", \"WIDGET\", 10, false);\n if (r1.Status != \"FULFILLED\") throw new Exception(\"r1 \" + r1.Status);\n if (r1.Shipped != 10 || Math.Abs(r1.Charged - 100.0) \u003e 0.01) throw new Exception(\"r1 ship/charge\");\n if (eng.Inventory[\"WIDGET\"] != 5) throw new Exception(\"inv \" + eng.Inventory[\"WIDGET\"]);\n if (Math.Abs(eng.PaymentBalance - 400.0) \u003e 0.01) throw new Exception(\"balance \" + eng.PaymentBalance);\n\n var r2 = eng.Fulfill(\"O2\", \"WIDGET\", 8, true);\n if (r2.Status != \"PARTIAL\") throw new Exception(\"r2 \" + r2.Status);\n if (r2.Shipped != 5 || Math.Abs(r2.Charged - 50.0) \u003e 0.01) throw new Exception(\"r2 ship/charge\");\n if (Math.Abs(r2.Refunded - 30.0) \u003e 0.01) throw new Exception(\"r2 refund \" + r2.Refunded);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visibleOk\");\n // Duplicate\n int logBefore = eng.FulfillLog.Count;\n var dup = eng.Fulfill(\"O1\", \"WIDGET\", 99, true);\n if (dup.Status != \"DUPLICATE\") throw new Exception(\"dup \" + dup.Status);\n if (eng.FulfillLog.Count != logBefore) throw new Exception(\"dup logged\");\n\n // Cancelled\n eng.CancelledOrders.Add(\"O3\");\n var canc = eng.Fulfill(\"O3\", \"WIDGET\", 1, false);\n if (canc.Status != \"CANCELLED\") throw new Exception(\"canc \" + canc.Status);\n\n // Payment failed\n eng.PaymentBalance = 5.0;\n var pf = eng.Fulfill(\"O4\", \"WIDGET\", 100, false);\n if (pf.Status != \"PAYMENT_FAILED\") throw new Exception(\"pf \" + pf.Status);\n\n // Insufficient stock, no partial -\u003e no mutation\n eng.PaymentBalance = 5000.0;\n int invBefore = eng.Inventory.ContainsKey(\"WIDGET\") ? eng.Inventory[\"WIDGET\"] : 0;\n double balBefore = eng.PaymentBalance;\n var insuf = eng.Fulfill(\"O5\", \"WIDGET\", 100, false);\n if (insuf.Status != \"INSUFFICIENT_STOCK\") throw new Exception(\"insuf \" + insuf.Status);\n if (eng.Inventory[\"WIDGET\"] != invBefore) throw new Exception(\"insuf mutated inv\");\n if (Math.Abs(eng.PaymentBalance - balBefore) \u003e 0.01) throw new Exception(\"insuf mutated balance\");\n\n // Unknown SKU\n var unk = eng.Fulfill(\"O6\", \"MISSING\", 1, false);\n if (unk.Status != \"UNKNOWN_SKU\") throw new Exception(\"unk \" + unk.Status);\n\n // Label sequence\n eng.Inventory[\"WIDGET\"] = 10;\n var r3 = eng.Fulfill(\"O7\", \"WIDGET\", 1, false);\n if (r3.Status != \"FULFILLED\") throw new Exception(\"r3 \" + r3.Status);\n // Labels should be SHP-1001 (O1), SHP-1002 (O2), SHP-1003 (O7)\n","category":"code_purpose_understanding"} {"id":"11","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass PolicyEngine\n{\n static int basePremium; // in whole dollars\n static int policyAge; // years since first issue\n static int claimsInWindow; // claims in last 3 years\n static int coverageLimit;\n static int maxCoverage;\n static List\u003cint\u003e endorsementCosts = new List\u003cint\u003e();\n static int endorsementCap;\n static List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n static HashSet\u003cstring\u003e processedRenewals = new HashSet\u003cstring\u003e();\n static int totalPremium;\n\n static void Reset(int bp, int age, int claims, int covLimit, int maxCov, int endCap)\n {\n basePremium = bp; policyAge = age; claimsInWindow = claims;\n coverageLimit = covLimit; maxCoverage = maxCov; endorsementCap = endCap;\n endorsementCosts.Clear(); auditLog.Clear(); processedRenewals.Clear();\n totalPremium = 0;\n }\n\n static void AddEndorsement(int cost)\n {\n endorsementCosts.Add(cost);\n }\n\n // Renew a policy for a given renewal ID.\n // Rules:\n // 1. renewalId is idempotent: if already processed, return \"DUPLICATE\" with no mutation.\n // 2. Compute age-band surcharge: policyAge * 5 percent of basePremium, capped at 50%.\n // ageSurcharge = basePremium * min(policyAge*5, 50) / 100.\n // 3. Compute claims surcharge: claimsInWindow * 10 percent of basePremium.\n // claimsSurcharge = basePremium * claimsInWindow * 10 / 100.\n // 4. Sum endorsement costs but clip total at endorsementCap.\n // 5. subtotal = basePremium + ageSurcharge + claimsSurcharge + clippedEndorsementCost.\n // 6. Loyalty discount: if policyAge \u003e= 5, subtract subtotal * 8 / 100 (integer division, applied AFTER surcharges).\n // 7. If coverageLimit + basePremium / 10 \u003e maxCoverage, return \"COVERAGE_EXCEEDED\" with no mutation.\n // 8. Record: add renewalId to processed, add premium to totalPremium, increase coverageLimit by basePremium/10, log audit.\n // 9. Return \"RENEWED:\" + final premium.\n static string Renew(string renewalId)\n {\n","golden_completion":"if (processedRenewals.Contains(renewalId)) return \"DUPLICATE\";\nint agePct = Math.Min(policyAge * 5, 50);\nint ageSurcharge = basePremium * agePct / 100;\nint claimsSurcharge = basePremium * claimsInWindow * 10 / 100;\nint endCost = 0;\nforeach (var c in endorsementCosts) endCost += c;\nif (endCost \u003e endorsementCap) endCost = endorsementCap;\nint subtotal = basePremium + ageSurcharge + claimsSurcharge + endCost;\nint loyaltyDisc = policyAge \u003e= 5 ? subtotal * 8 / 100 : 0;\nint final_ = subtotal - loyaltyDisc;\nif (coverageLimit + basePremium / 10 \u003e maxCoverage) return \"COVERAGE_EXCEEDED\";\nprocessedRenewals.Add(renewalId);\ntotalPremium += final_;\ncoverageLimit += basePremium / 10;\nauditLog.Add(\"RENEW:\" + renewalId + \":\" + final_);\nreturn \"RENEWED:\" + final_;\n","suffix":" }\n\n static void Main()\n {\n Reset(1000, 6, 2, 5000, 6000, 300);\n AddEndorsement(200);\n AddEndorsement(250);\n // age surcharge: min(6*5,50)=30% of 1000 = 300\n // claims surcharge: 2*10% of 1000 = 200\n // endorsement cost: 200+250=450, clipped to 300\n // subtotal = 1000 + 300 + 200 + 300 = 1800\n // loyalty (age\u003e=5): 1800*8/100 = 144\n // final = 1800 - 144 = 1656\n string r1 = Renew(\"R1\");\n if (r1 != \"RENEWED:1656\") throw new Exception(\"r1=\" + r1);\n if (totalPremium != 1656) throw new Exception(\"total=\" + totalPremium);\n if (auditLog.Count != 1) throw new Exception(\"audit count\");\n // coverage: 5000 + 100 = 5100\n if (coverageLimit != 5100) throw new Exception(\"cov=\" + coverageLimit);\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Duplicate\nstring dup = PolicyEngine.Renew(\"R1\");\nif (dup != \"DUPLICATE\") throw new Exception(\"dup=\" + dup);\nif (PolicyEngine.auditLog.Count != 1) throw new Exception(\"dup mutated audit\");\nif (PolicyEngine.totalPremium != 1656) throw new Exception(\"dup mutated total\");\n\n// Second renewal works\nstring r2 = PolicyEngine.Renew(\"R2\");\nif (r2 != \"RENEWED:1656\") throw new Exception(\"r2=\" + r2);\nif (PolicyEngine.totalPremium != 3312) throw new Exception(\"total2=\" + PolicyEngine.totalPremium);\n// coverage now 5200\nif (PolicyEngine.coverageLimit != 5200) throw new Exception(\"cov2=\" + PolicyEngine.coverageLimit);\n\n// Keep renewing until coverage exceeded\n// Each renewal adds 100, max is 6000, currently at 5200, so 8 more renewals fit (5200+800=6000)\nfor (int i = 3; i \u003c= 10; i++) PolicyEngine.Renew(\"R\" + i);\n// coverageLimit = 5200 + 800 = 6000\nstring blocked = PolicyEngine.Renew(\"R11\");\nif (blocked != \"COVERAGE_EXCEEDED\") throw new Exception(\"block=\" + blocked);\n","category":"code_purpose_understanding"} {"id":"12","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass HotelSystem\n{\n static Dictionary\u003cstring, int\u003e inventory = new Dictionary\u003cstring, int\u003e(); // category -\u003e rooms\n static Dictionary\u003cstring, int\u003e rates = new Dictionary\u003cstring, int\u003e(); // category -\u003e nightly rate\n static string[] upgradeOrder; // categories from lowest to highest\n static int overbookPct; // e.g. 10 means allow 10% overbooking\n static Dictionary\u003cstring, string\u003e reservations = new Dictionary\u003cstring, string\u003e(); // resId -\u003e category\n static Dictionary\u003cstring, int\u003e resDays = new Dictionary\u003cstring, int\u003e(); // resId -\u003e nights\n static List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n static int revenue;\n\n static void Reset(string[] order, int obPct)\n {\n inventory.Clear(); rates.Clear(); reservations.Clear(); resDays.Clear();\n auditLog.Clear(); revenue = 0; upgradeOrder = order; overbookPct = obPct;\n }\n\n static void AddCategory(string cat, int rooms, int rate)\n {\n inventory[cat] = rooms; rates[cat] = rate;\n }\n\n static int EffectiveCapacity(string cat)\n {\n return inventory[cat] + inventory[cat] * overbookPct / 100;\n }\n\n static int BookedCount(string cat)\n {\n int c = 0;\n foreach (var kv in reservations) if (kv.Value == cat) c++;\n return c;\n }\n\n // Book a reservation.\n // Rules:\n // 1. resId is idempotent: if already exists, return \"DUPLICATE\" with no mutation.\n // 2. Try to book the requested category first. A category is available if BookedCount \u003c EffectiveCapacity.\n // 3. If requested category is full, try upgrading: walk upgradeOrder from the position ABOVE the requested\n // category upward. Book the first available higher category at the ORIGINAL requested rate.\n // 4. If no category has availability, return \"NO_ROOM\" with no mutation.\n // 5. On success: store reservation, add nights*rate to revenue, audit \"BOOK:resId:assignedCategory:total\".\n // 6. Return \"BOOKED:assignedCategory\".\n static string Book(string resId, string requestedCat, int nights)\n {\n","golden_completion":"if (reservations.ContainsKey(resId)) return \"DUPLICATE\";\nint reqIdx = Array.IndexOf(upgradeOrder, requestedCat);\nif (reqIdx \u003c 0) return \"NO_ROOM\";\nstring assigned = null;\nif (BookedCount(requestedCat) \u003c EffectiveCapacity(requestedCat))\n{\n assigned = requestedCat;\n}\nelse\n{\n for (int i = reqIdx + 1; i \u003c upgradeOrder.Length; i++)\n {\n if (BookedCount(upgradeOrder[i]) \u003c EffectiveCapacity(upgradeOrder[i]))\n {\n assigned = upgradeOrder[i];\n break;\n }\n }\n}\nif (assigned == null) return \"NO_ROOM\";\nint total = nights * rates[requestedCat];\nreservations[resId] = assigned;\nresDays[resId] = nights;\nrevenue += total;\nauditLog.Add(\"BOOK:\" + resId + \":\" + assigned + \":\" + total);\nreturn \"BOOKED:\" + assigned;\n","suffix":" }\n\n // Cancel a reservation.\n // Rules:\n // 1. If resId does not exist, return \"NOT_FOUND\".\n // 2. Fee: if daysBefore \u003e= 7, fee = 0; if 3 \u003c= daysBefore \u003c 7, fee = 50% of total;\n // if daysBefore \u003c 3, fee = 100% (no refund).\n // 3. Refund = total - fee. Subtract refund from revenue (revenue can go negative).\n // 4. Remove reservation, audit \"CANCEL:resId:fee:refund\".\n // 5. Return \"CANCELLED:fee:refund\".\n static string Cancel(string resId, int daysBefore)\n {\n if (!reservations.ContainsKey(resId)) return \"NOT_FOUND\";\n string cat = reservations[resId];\n int nights = resDays[resId];\n int total = nights * rates[cat];\n int fee;\n if (daysBefore \u003e= 7) fee = 0;\n else if (daysBefore \u003e= 3) fee = total / 2;\n else fee = total;\n int refund = total - fee;\n revenue -= refund;\n reservations.Remove(resId);\n resDays.Remove(resId);\n auditLog.Add(\"CANCEL:\" + resId + \":\" + fee + \":\" + refund);\n return \"CANCELLED:\" + fee + \":\" + refund;\n }\n\n static void Main()\n {\n Reset(new string[] { \"standard\", \"deluxe\", \"suite\" }, 10);\n AddCategory(\"standard\", 2, 100);\n AddCategory(\"deluxe\", 1, 200);\n AddCategory(\"suite\", 1, 500);\n // Effective: standard=2, deluxe=1, suite=1 (10% of 1 truncates to 0 extra)\n string b1 = Book(\"A1\", \"standard\", 3);\n if (b1 != \"BOOKED:standard\") throw new Exception(\"b1=\" + b1);\n string b2 = Book(\"A2\", \"standard\", 2);\n if (b2 != \"BOOKED:standard\") throw new Exception(\"b2=\" + b2);\n // standard full (2/2), next booking should upgrade to deluxe\n string b3 = Book(\"A3\", \"standard\", 2);\n if (b3 != \"BOOKED:deluxe\") throw new Exception(\"b3=\" + b3);\n // A3 pays standard rate: 2*100=200\n if (revenue != 300 + 200 + 200) throw new Exception(\"rev=\" + revenue);\n // Cancel A1 with 5 days before (50% fee): total=300, fee=150, refund=150\n string c1 = Cancel(\"A1\", 5);\n if (c1 != \"CANCELLED:150:150\") throw new Exception(\"c1=\" + c1);\n if (revenue != 700 - 150) throw new Exception(\"rev after cancel=\" + revenue);\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Duplicate booking\nstring dupB = HotelSystem.Book(\"A2\", \"standard\", 5);\nif (dupB != \"DUPLICATE\") throw new Exception(\"dupB=\" + dupB);\n\n// standard freed by cancel of A1, new booking fits\nstring b4 = HotelSystem.Book(\"A4\", \"standard\", 1);\nif (b4 != \"BOOKED:standard\") throw new Exception(\"b4=\" + b4);\n\n// Fill all: standard(A2,A4)=2, deluxe(A3)=1, book suite\nstring b5 = HotelSystem.Book(\"A5\", \"deluxe\", 1);\nif (b5 != \"BOOKED:suite\") throw new Exception(\"b5=\" + b5);\n// A5 pays deluxe rate: 1*200=200\n// Fill suite too, now everything full\nstring b6 = HotelSystem.Book(\"A6\", \"standard\", 1);\nif (b6 != \"NO_ROOM\") throw new Exception(\"b6=\" + b6);\n\n// Cancel not found\nstring cnf = HotelSystem.Cancel(\"ZZZ\", 10);\nif (cnf != \"NOT_FOUND\") throw new Exception(\"cnf=\" + cnf);\n\n// Cancel with \u003c3 days (100% fee, 0 refund)\nstring c2 = HotelSystem.Cancel(\"A4\", 1);\nif (c2 != \"CANCELLED:100:0\") throw new Exception(\"c2=\" + c2);\n","category":"code_purpose_understanding"} {"id":"13","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass TradingEngine\n{\n class Offer { public string id; public int qty; public int priceCents; }\n\n static List\u003cOffer\u003e askBook = new List\u003cOffer\u003e(); // sorted cheapest first\n static Dictionary\u003cstring, int\u003e filledQty = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e filledCostCents = new Dictionary\u003cstring, int\u003e();\n static List\u003cstring\u003e tradeLog = new List\u003cstring\u003e();\n static HashSet\u003cstring\u003e processedOrders = new HashSet\u003cstring\u003e();\n static int totalCommissionCents;\n\n // Commission tiers (in cents/share): first 100 shares at 2c, next 400 at 1c, above 500 at 0c (free).\n static int CalcCommission(int shares)\n {\n int c = 0;\n int r = shares;\n int t1 = Math.Min(r, 100); c += t1 * 2; r -= t1;\n int t2 = Math.Min(r, 400); c += t2 * 1; r -= t2;\n return c;\n }\n\n static void Reset()\n {\n askBook.Clear(); filledQty.Clear(); filledCostCents.Clear();\n tradeLog.Clear(); processedOrders.Clear(); totalCommissionCents = 0;\n }\n\n static void AddAsk(string id, int qty, int priceCents)\n {\n askBook.Add(new Offer { id = id, qty = qty, priceCents = priceCents });\n askBook.Sort((a, b) =\u003e a.priceCents.CompareTo(b.priceCents));\n }\n\n // Execute a buy order against the ask book.\n // Rules:\n // 1. orderId is idempotent: if already processed, return \"DUPLICATE\" with no mutation.\n // 2. If orderType is \"LIMIT\", only match asks where ask.priceCents \u003c= limitCents.\n // If orderType is \"MARKET\", match any ask.\n // 3. Walk the ask book cheapest-first. For each eligible ask, fill min(remaining, ask.qty).\n // Deduct from ask.qty; remove depleted asks.\n // 4. If zero shares filled, return \"NO_FILL\" with no mutation (do NOT add to processedOrders).\n // 5. Compute commission on total filled shares using CalcCommission.\n // 6. Record: add orderId to processed, store filledQty and filledCostCents, add commission to totalCommissionCents.\n // 7. Log each partial fill: \"FILL:orderId:askId:shares:priceCents\".\n // 8. Return \"EXECUTED:totalShares:totalCostCents:commissionCents\".\n static string ExecuteOrder(string orderId, string orderType, int wantQty, int limitCents)\n {\n","golden_completion":"if (processedOrders.Contains(orderId)) return \"DUPLICATE\";\nint totalShares = 0;\nint totalCost = 0;\nList\u003cstring\u003e pendingLogs = new List\u003cstring\u003e();\nList\u003cint\u003e depletedIdx = new List\u003cint\u003e();\nfor (int i = 0; i \u003c askBook.Count \u0026\u0026 totalShares \u003c wantQty; i++)\n{\n var ask = askBook[i];\n if (orderType == \"LIMIT\" \u0026\u0026 ask.priceCents \u003e limitCents) break;\n int take = Math.Min(wantQty - totalShares, ask.qty);\n totalShares += take;\n totalCost += take * ask.priceCents;\n ask.qty -= take;\n pendingLogs.Add(\"FILL:\" + orderId + \":\" + ask.id + \":\" + take + \":\" + ask.priceCents);\n if (ask.qty == 0) depletedIdx.Add(i);\n}\nif (totalShares == 0) return \"NO_FILL\";\nfor (int i = depletedIdx.Count - 1; i \u003e= 0; i--) askBook.RemoveAt(depletedIdx[i]);\nint comm = CalcCommission(totalShares);\nprocessedOrders.Add(orderId);\nfilledQty[orderId] = totalShares;\nfilledCostCents[orderId] = totalCost;\ntotalCommissionCents += comm;\nforeach (var l in pendingLogs) tradeLog.Add(l);\nreturn \"EXECUTED:\" + totalShares + \":\" + totalCost + \":\" + comm;\n","suffix":" }\n\n static void Main()\n {\n Reset();\n AddAsk(\"S1\", 50, 1000); // $10.00\n AddAsk(\"S2\", 200, 1050); // $10.50\n AddAsk(\"S3\", 100, 1100); // $11.00\n // Market order for 120 shares\n string r1 = ExecuteOrder(\"B1\", \"MARKET\", 120, 0);\n // Fills: 50@1000 from S1, 70@1050 from S2\n // cost = 50000 + 73500 = 123500\n // commission: 100*2 + 20*1 = 220\n if (r1 != \"EXECUTED:120:123500:220\") throw new Exception(\"r1=\" + r1);\n if (totalCommissionCents != 220) throw new Exception(\"comm=\" + totalCommissionCents);\n // S1 depleted, S2 has 130 left\n // Limit order at 1025 cents — S2 at 1050 is too expensive, so NO_FILL\n string r2 = ExecuteOrder(\"B2\", \"LIMIT\", 50, 1025);\n if (r2 != \"NO_FILL\") throw new Exception(\"r2=\" + r2);\n if (processedOrders.Contains(\"B2\")) throw new Exception(\"no-fill added to processed\");\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Duplicate\nstring dup = TradingEngine.ExecuteOrder(\"B1\", \"MARKET\", 999, 0);\nif (dup != \"DUPLICATE\") throw new Exception(\"dup=\" + dup);\n\n// Limit order that partially fills\nstring r3 = TradingEngine.ExecuteOrder(\"B3\", \"LIMIT\", 200, 1050);\n// S2 has 130 left at 1050, eligible. Fills 130. S3 at 1100 \u003e 1050, stop.\n// cost = 130 * 1050 = 136500\n// commission: 100*2 + 30*1 = 230\nif (r3 != \"EXECUTED:130:136500:230\") throw new Exception(\"r3=\" + r3);\n\n// After B3: S2 depleted, S3 still has 100 at 1100\n// Market order for 200: fills 100 from S3, partial\nstring r4 = TradingEngine.ExecuteOrder(\"B4\", \"MARKET\", 200, 0);\n// cost = 100 * 1100 = 110000\n// commission: 100*2 = 200\nif (r4 != \"EXECUTED:100:110000:200\") throw new Exception(\"r4=\" + r4);\n\n// Book empty now, market order gets NO_FILL\nstring r5 = TradingEngine.ExecuteOrder(\"B5\", \"MARKET\", 10, 0);\nif (r5 != \"NO_FILL\") throw new Exception(\"r5=\" + r5);\n","category":"code_purpose_understanding"} {"id":"14","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass TaxEngine\n{\n static int[][] brackets; // each: {upperLimit, ratePercent}, last upperLimit = int.MaxValue\n static int stdDeduction;\n static int exemptionAmount;\n static int phaseOutStart;\n static int phaseOutStep; // every phaseOutStep over phaseOutStart reduces exemption by 2%\n static List\u003cstring\u003e calcLog = new List\u003cstring\u003e();\n\n static void Reset(int[][] br, int sd, int ex, int poStart, int poStep)\n {\n brackets = br; stdDeduction = sd; exemptionAmount = ex;\n phaseOutStart = poStart; phaseOutStep = poStep; calcLog.Clear();\n }\n\n // Compute total tax owed for a given gross income.\n // Rules:\n // 1. Compute adjusted exemption: if gross \u003c= phaseOutStart, full exemption.\n // Otherwise, reduce by 2% for each full phaseOutStep of excess. Minimum 0.\n // 2. taxableIncome = gross - stdDeduction - adjustedExemption. Minimum 0.\n // 3. Apply progressive brackets: each bracket\u0027s rate applies only to the slice\n // of taxableIncome within [prevLimit, upperLimit). Use integer arithmetic for rate:\n // sliceTax = slice * ratePercent / 100.\n // 4. Log: \"TAX:gross:taxable:exemption:totalTax\".\n // 5. Return totalTax.\n static int ComputeTax(int gross)\n {\n","golden_completion":"int excess = gross \u003e phaseOutStart ? gross - phaseOutStart : 0;\nint reductions = excess / phaseOutStep;\nint phasePct = reductions * 2;\nif (phasePct \u003e 100) phasePct = 100;\nint adjExemption = exemptionAmount - exemptionAmount * phasePct / 100;\nif (adjExemption \u003c 0) adjExemption = 0;\nint taxable = gross - stdDeduction - adjExemption;\nif (taxable \u003c 0) taxable = 0;\nint tax = 0;\nint prev = 0;\nforeach (var b in brackets)\n{\n if (taxable \u003c= prev) break;\n int upper = b[0];\n int rate = b[1];\n int slice = (taxable \u003c upper ? taxable : upper) - prev;\n tax += slice * rate / 100;\n prev = upper;\n}\ncalcLog.Add(\"TAX:\" + gross + \":\" + taxable + \":\" + adjExemption + \":\" + tax);\nreturn tax;\n","suffix":" }\n\n static void Main()\n {\n Reset(\n new int[][] { new[] {20000, 10}, new[] {60000, 20}, new[] {int.MaxValue, 30} },\n 12000, 4000, 80000, 5000\n );\n // gross=50000: no phase-out, exemption=4000, taxable=50000-12000-4000=34000\n // tax: 20000*10/100=2000, 14000*20/100=2800 =\u003e 4800\n int t1 = ComputeTax(50000);\n if (t1 != 4800) throw new Exception(\"t1=\" + t1);\n\n // gross=95000: excess=15000, reductions=3, phasePct=6, adjExemption=4000-240=3760\n // taxable=95000-12000-3760=79240\n // tax: 20000*10/100=2000, 40000*20/100=8000, 19240*30/100=5772 =\u003e 15772\n int t2 = ComputeTax(95000);\n if (t2 != 15772) throw new Exception(\"t2=\" + t2);\n\n if (calcLog.Count != 2) throw new Exception(\"log=\" + calcLog.Count);\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Zero income\nint t3 = TaxEngine.ComputeTax(0);\nif (t3 != 0) throw new Exception(\"t3=\" + t3);\n\n// Income below deduction+exemption\nint t4 = TaxEngine.ComputeTax(10000);\nif (t4 != 0) throw new Exception(\"t4=\" + t4);\n\n// Full phase-out: gross=400000, excess=320000, reductions=64, phasePct=128 -\u003e capped 100, exemption=0\n// taxable=400000-12000-0=388000\n// tax: 20000*10/100=2000, 40000*20/100=8000, 328000*30/100=98400 =\u003e 108400\nint t5 = TaxEngine.ComputeTax(400000);\nif (t5 != 108400) throw new Exception(\"t5=\" + t5);\n\n// Exactly at phase-out start: full exemption\nint t6 = TaxEngine.ComputeTax(80000);\n// taxable=80000-12000-4000=64000\n// tax: 20000*10/100=2000, 40000*20/100=8000, 4000*30/100=1200 =\u003e 11200\nif (t6 != 11200) throw new Exception(\"t6=\" + t6);\n","category":"code_purpose_understanding"} {"id":"15","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass WarehouseTransfer\n{\n static Dictionary\u003cstring, int\u003e srcInventory = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e dstInventory = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e inTransit = new Dictionary\u003cstring, int\u003e(); // transferId -\u003e qty\n static Dictionary\u003cstring, string\u003e transferSku = new Dictionary\u003cstring, string\u003e();\n static HashSet\u003cstring\u003e completedTransfers = new HashSet\u003cstring\u003e();\n static List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n static int totalShrinkage;\n\n static void Reset()\n {\n srcInventory.Clear(); dstInventory.Clear(); inTransit.Clear();\n transferSku.Clear(); completedTransfers.Clear(); auditLog.Clear();\n totalShrinkage = 0;\n }\n\n static void SetSrc(string sku, int qty) { srcInventory[sku] = qty; }\n static void SetDst(string sku, int qty) { dstInventory[sku] = qty; }\n\n // Initiate a transfer from source warehouse to destination.\n // Rules:\n // 1. transferId idempotent: if in inTransit or completed, return \"DUPLICATE\".\n // 2. If sku not in srcInventory or srcInventory[sku] \u003c qty, return \"INSUFFICIENT\" with no mutation.\n // 3. Deduct from srcInventory, put into inTransit, record sku.\n // 4. Audit \"SHIP:transferId:sku:qty\". Return \"SHIPPED\".\n static string Ship(string transferId, string sku, int qty)\n {\n if (inTransit.ContainsKey(transferId) || completedTransfers.Contains(transferId)) return \"DUPLICATE\";\n if (!srcInventory.ContainsKey(sku) || srcInventory[sku] \u003c qty) return \"INSUFFICIENT\";\n srcInventory[sku] -= qty;\n inTransit[transferId] = qty;\n transferSku[transferId] = sku;\n auditLog.Add(\"SHIP:\" + transferId + \":\" + sku + \":\" + qty);\n return \"SHIPPED\";\n }\n\n // Receive a transfer at destination.\n // Rules:\n // 1. If transferId not in inTransit, return \"NOT_IN_TRANSIT\".\n // 2. If receivedQty \u003e inTransit qty, return \"OVER_RECEIVE\" with no mutation.\n // 3. shrinkage = inTransit qty - receivedQty. Add to totalShrinkage.\n // 4. Add receivedQty to dstInventory for the sku (create entry if needed).\n // 5. Remove from inTransit, add to completedTransfers.\n // 6. Audit \"RECV:transferId:received:shrinkage\". Return \"RECEIVED:shrinkage\".\n static string Receive(string transferId, int receivedQty)\n {\n","golden_completion":"if (!inTransit.ContainsKey(transferId)) return \"NOT_IN_TRANSIT\";\nint shipped = inTransit[transferId];\nif (receivedQty \u003e shipped) return \"OVER_RECEIVE\";\nint shrinkage = shipped - receivedQty;\ntotalShrinkage += shrinkage;\nstring sku = transferSku[transferId];\nif (!dstInventory.ContainsKey(sku)) dstInventory[sku] = 0;\ndstInventory[sku] += receivedQty;\ninTransit.Remove(transferId);\ntransferSku.Remove(transferId);\ncompletedTransfers.Add(transferId);\nauditLog.Add(\"RECV:\" + transferId + \":\" + receivedQty + \":\" + shrinkage);\nreturn \"RECEIVED:\" + shrinkage;\n","suffix":" }\n\n static void Main()\n {\n Reset();\n SetSrc(\"WIDGET\", 100);\n SetDst(\"WIDGET\", 20);\n string s1 = Ship(\"T1\", \"WIDGET\", 30);\n if (s1 != \"SHIPPED\") throw new Exception(\"s1=\" + s1);\n if (srcInventory[\"WIDGET\"] != 70) throw new Exception(\"src=\" + srcInventory[\"WIDGET\"]);\n\n string r1 = Receive(\"T1\", 27);\n if (r1 != \"RECEIVED:3\") throw new Exception(\"r1=\" + r1);\n if (dstInventory[\"WIDGET\"] != 47) throw new Exception(\"dst=\" + dstInventory[\"WIDGET\"]);\n if (totalShrinkage != 3) throw new Exception(\"shrink=\" + totalShrinkage);\n\n // Over-receive blocked\n Ship(\"T2\", \"WIDGET\", 20);\n string r2 = Receive(\"T2\", 25);\n if (r2 != \"OVER_RECEIVE\") throw new Exception(\"r2=\" + r2);\n // T2 still in transit after over-receive block\n if (!inTransit.ContainsKey(\"T2\")) throw new Exception(\"T2 removed\");\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Duplicate ship\nstring ds = WarehouseTransfer.Ship(\"T1\", \"WIDGET\", 5);\nif (ds != \"DUPLICATE\") throw new Exception(\"ds=\" + ds);\n\n// Duplicate ship for in-transit\nstring ds2 = WarehouseTransfer.Ship(\"T2\", \"WIDGET\", 5);\nif (ds2 != \"DUPLICATE\") throw new Exception(\"ds2=\" + ds2);\n\n// Receive T2 with full qty (0 shrinkage)\nstring r3 = WarehouseTransfer.Receive(\"T2\", 20);\nif (r3 != \"RECEIVED:0\") throw new Exception(\"r3=\" + r3);\nif (WarehouseTransfer.dstInventory[\"WIDGET\"] != 67) throw new Exception(\"dst2=\" + WarehouseTransfer.dstInventory[\"WIDGET\"]);\nif (WarehouseTransfer.totalShrinkage != 3) throw new Exception(\"shrink2=\" + WarehouseTransfer.totalShrinkage);\n\n// Receive completed transfer\nstring r4 = WarehouseTransfer.Receive(\"T2\", 10);\nif (r4 != \"NOT_IN_TRANSIT\") throw new Exception(\"r4=\" + r4);\n\n// Insufficient source\nstring s3 = WarehouseTransfer.Ship(\"T3\", \"WIDGET\", 999);\nif (s3 != \"INSUFFICIENT\") throw new Exception(\"s3=\" + s3);\n// src unchanged\nif (WarehouseTransfer.srcInventory[\"WIDGET\"] != 50) throw new Exception(\"src unchanged=\" + WarehouseTransfer.srcInventory[\"WIDGET\"]);\n\n// Unknown sku\nstring s4 = WarehouseTransfer.Ship(\"T4\", \"UNKNOWN\", 1);\nif (s4 != \"INSUFFICIENT\") throw new Exception(\"s4=\" + s4);\n","category":"code_purpose_understanding"} {"id":"16","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass ResourceAllocator\n{\n class Resource\n {\n public string id;\n public HashSet\u003cstring\u003e skills;\n public int maxHours; // weekly cap before overtime\n public int allocatedHours; // hours allocated this week\n public int overtimeHours;\n }\n\n static Dictionary\u003cstring, Resource\u003e resources = new Dictionary\u003cstring, Resource\u003e();\n static Dictionary\u003cstring, List\u003cstring\u003e\u003e projectAllocs = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n static List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n static int totalOvertimeCost;\n static int overtimeRate; // cost per overtime hour\n\n static void Reset(int otRate)\n {\n resources.Clear(); projectAllocs.Clear(); auditLog.Clear();\n totalOvertimeCost = 0; overtimeRate = otRate;\n }\n\n static void AddResource(string id, string[] skills, int maxHours)\n {\n resources[id] = new Resource\n {\n id = id, skills = new HashSet\u003cstring\u003e(skills),\n maxHours = maxHours, allocatedHours = 0, overtimeHours = 0\n };\n }\n\n // Allocate hours of a resource to a project.\n // Rules:\n // 1. If resourceId not found, return \"NOT_FOUND\".\n // 2. If the resource does not have the requiredSkill, return \"SKILL_MISMATCH\".\n // 3. Compute regular and overtime:\n // - regularAvail = maxHours - allocatedHours (can be 0 if already at cap).\n // - regularUsed = min(hours, regularAvail).\n // - overtime = hours - regularUsed.\n // - If overtime \u003e 0 and allowOvertime is false, return \"OVERTIME_DENIED\" with no mutation.\n // 4. Update: allocatedHours += hours, overtimeHours += overtime.\n // 5. totalOvertimeCost += overtime * overtimeRate.\n // 6. Add to projectAllocs: \"resourceId:hours:overtime\".\n // 7. Audit \"ALLOC:projectId:resourceId:hours:overtime\".\n // 8. Return \"ALLOCATED:regularUsed:overtime\".\n static string Allocate(string projectId, string resourceId, string requiredSkill, int hours, bool allowOvertime)\n {\n","golden_completion":"if (!resources.ContainsKey(resourceId)) return \"NOT_FOUND\";\nResource r = resources[resourceId];\nif (!r.skills.Contains(requiredSkill)) return \"SKILL_MISMATCH\";\nint regularAvail = r.maxHours - r.allocatedHours;\nif (regularAvail \u003c 0) regularAvail = 0;\nint regularUsed = Math.Min(hours, regularAvail);\nint overtime = hours - regularUsed;\nif (overtime \u003e 0 \u0026\u0026 !allowOvertime) return \"OVERTIME_DENIED\";\nr.allocatedHours += hours;\nr.overtimeHours += overtime;\ntotalOvertimeCost += overtime * overtimeRate;\nif (!projectAllocs.ContainsKey(projectId))\n projectAllocs[projectId] = new List\u003cstring\u003e();\nprojectAllocs[projectId].Add(resourceId + \":\" + hours + \":\" + overtime);\nauditLog.Add(\"ALLOC:\" + projectId + \":\" + resourceId + \":\" + hours + \":\" + overtime);\nreturn \"ALLOCATED:\" + regularUsed + \":\" + overtime;\n","suffix":" }\n\n static void Main()\n {\n Reset(50);\n AddResource(\"DEV1\", new[] { \"csharp\", \"sql\" }, 40);\n AddResource(\"DEV2\", new[] { \"java\", \"sql\" }, 40);\n\n string a1 = Allocate(\"P1\", \"DEV1\", \"csharp\", 30, false);\n if (a1 != \"ALLOCATED:30:0\") throw new Exception(\"a1=\" + a1);\n\n // DEV1 has 10 regular hours left; requesting 15 with overtime allowed\n string a2 = Allocate(\"P2\", \"DEV1\", \"sql\", 15, true);\n if (a2 != \"ALLOCATED:10:5\") throw new Exception(\"a2=\" + a2);\n if (totalOvertimeCost != 250) throw new Exception(\"otCost=\" + totalOvertimeCost);\n\n // DEV1 now at 45 allocated, 0 regular left; deny overtime\n string a3 = Allocate(\"P3\", \"DEV1\", \"csharp\", 5, false);\n if (a3 != \"OVERTIME_DENIED\") throw new Exception(\"a3=\" + a3);\n // Verify no mutation on denial\n if (resources[\"DEV1\"].allocatedHours != 45) throw new Exception(\"mutated on deny\");\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Skill mismatch\nstring a4 = ResourceAllocator.Allocate(\"P4\", \"DEV2\", \"csharp\", 5, false);\nif (a4 != \"SKILL_MISMATCH\") throw new Exception(\"a4=\" + a4);\n\n// Not found\nstring a5 = ResourceAllocator.Allocate(\"P5\", \"DEV99\", \"csharp\", 5, false);\nif (a5 != \"NOT_FOUND\") throw new Exception(\"a5=\" + a5);\n\n// DEV2 fresh, allocate 40 exactly (no overtime)\nstring a6 = ResourceAllocator.Allocate(\"P6\", \"DEV2\", \"java\", 40, false);\nif (a6 != \"ALLOCATED:40:0\") throw new Exception(\"a6=\" + a6);\n\n// DEV2 at cap, 1 more hour with overtime\nstring a7 = ResourceAllocator.Allocate(\"P7\", \"DEV2\", \"sql\", 1, true);\nif (a7 != \"ALLOCATED:0:1\") throw new Exception(\"a7=\" + a7);\nif (ResourceAllocator.totalOvertimeCost != 300) throw new Exception(\"otCost2=\" + ResourceAllocator.totalOvertimeCost);\n\n// Project allocations tracking\nif (!ResourceAllocator.projectAllocs.ContainsKey(\"P1\")) throw new Exception(\"P1 missing\");\nif (ResourceAllocator.projectAllocs[\"P1\"].Count != 1) throw new Exception(\"P1 count\");\n","category":"code_purpose_understanding"} {"id":"17","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass AirlineBooking\n{\n static Dictionary\u003cstring, int\u003e fareClassPrice = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e fareClassBaggage = new Dictionary\u003cstring, int\u003e(); // included bags\n static int extraBagFee;\n static int seatsLeft;\n static int pointsPerDollar; // how many points equal $1\n static Dictionary\u003cstring, int\u003e passengerPoints = new Dictionary\u003cstring, int\u003e();\n static HashSet\u003cstring\u003e bookedPnrs = new HashSet\u003cstring\u003e();\n static List\u003cstring\u003e bookingLog = new List\u003cstring\u003e();\n static int totalRevenue;\n\n static void Reset(int seats, int ppd, int bagFee)\n {\n fareClassPrice.Clear(); fareClassBaggage.Clear();\n passengerPoints.Clear(); bookedPnrs.Clear(); bookingLog.Clear();\n seatsLeft = seats; pointsPerDollar = ppd; extraBagFee = bagFee;\n totalRevenue = 0;\n }\n\n static void AddFareClass(string cls, int price, int bags)\n {\n fareClassPrice[cls] = price; fareClassBaggage[cls] = bags;\n }\n\n static void SetPoints(string pax, int pts) { passengerPoints[pax] = pts; }\n\n // Book a flight.\n // Rules:\n // 1. pnr is idempotent: if already booked, return \"DUPLICATE\".\n // 2. If fareClass not found, return \"INVALID_CLASS\".\n // 3. If seatsLeft \u003c= 0, return \"SOLD_OUT\" with no mutation.\n // 4. Compute base = fareClassPrice. Compute baggage: extraBags = max(0, bags - fareClassBaggage).\n // bagCharge = extraBags * extraBagFee.\n // 5. grossTotal = base + bagCharge.\n // 6. Points redemption: if usePoints is true and pax has points:\n // - maxPointValue = passengerPoints[pax] / pointsPerDollar (integer division).\n // - pointsDiscount = min(maxPointValue, grossTotal).\n // - Deduct pointsDiscount * pointsPerDollar from passenger points.\n // - cashDue = grossTotal - pointsDiscount.\n // 7. Else: cashDue = grossTotal, pointsDiscount = 0.\n // 8. seatsLeft--, totalRevenue += cashDue, add pnr to booked.\n // 9. Log \"BOOK:pnr:fareClass:cashDue:pointsDiscount\".\n // 10. Return \"CONFIRMED:cashDue:pointsDiscount\".\n static string Book(string pnr, string pax, string fareClass, int bags, bool usePoints)\n {\n","golden_completion":"if (bookedPnrs.Contains(pnr)) return \"DUPLICATE\";\nif (!fareClassPrice.ContainsKey(fareClass)) return \"INVALID_CLASS\";\nif (seatsLeft \u003c= 0) return \"SOLD_OUT\";\nint basePrice = fareClassPrice[fareClass];\nint included = fareClassBaggage[fareClass];\nint extraBags = bags \u003e included ? bags - included : 0;\nint bagCharge = extraBags * extraBagFee;\nint gross = basePrice + bagCharge;\nint pointsDiscount = 0;\nif (usePoints \u0026\u0026 passengerPoints.ContainsKey(pax))\n{\n int maxVal = passengerPoints[pax] / pointsPerDollar;\n pointsDiscount = Math.Min(maxVal, gross);\n passengerPoints[pax] -= pointsDiscount * pointsPerDollar;\n}\nint cashDue = gross - pointsDiscount;\nseatsLeft--;\ntotalRevenue += cashDue;\nbookedPnrs.Add(pnr);\nbookingLog.Add(\"BOOK:\" + pnr + \":\" + fareClass + \":\" + cashDue + \":\" + pointsDiscount);\nreturn \"CONFIRMED:\" + cashDue + \":\" + pointsDiscount;\n","suffix":" }\n\n static void Main()\n {\n Reset(3, 100, 50); // 3 seats, 100 points = $1, $50 per extra bag\n AddFareClass(\"economy\", 200, 1);\n AddFareClass(\"business\", 500, 2);\n SetPoints(\"alice\", 15000); // worth $150\n\n // Alice books economy, 2 bags (1 extra), uses points\n // gross = 200 + 50 = 250. points: 15000/100=150. discount=min(150,250)=150. cash=100.\n // remaining points: 15000-150*100=0\n string b1 = Book(\"PNR1\", \"alice\", \"economy\", 2, true);\n if (b1 != \"CONFIRMED:100:150\") throw new Exception(\"b1=\" + b1);\n if (passengerPoints[\"alice\"] != 0) throw new Exception(\"pts=\" + passengerPoints[\"alice\"]);\n if (totalRevenue != 100) throw new Exception(\"rev=\" + totalRevenue);\n\n // Bob books business, 2 bags (0 extra), no points\n string b2 = Book(\"PNR2\", \"bob\", \"business\", 2, false);\n if (b2 != \"CONFIRMED:500:0\") throw new Exception(\"b2=\" + b2);\n\n if (seatsLeft != 1) throw new Exception(\"seats=\" + seatsLeft);\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Duplicate\nstring dup = AirlineBooking.Book(\"PNR1\", \"alice\", \"economy\", 0, false);\nif (dup != \"DUPLICATE\") throw new Exception(\"dup=\" + dup);\n\n// Invalid class\nstring inv = AirlineBooking.Book(\"PNR3\", \"bob\", \"first\", 0, false);\nif (inv != \"INVALID_CLASS\") throw new Exception(\"inv=\" + inv);\n\n// Book last seat\nstring b3 = AirlineBooking.Book(\"PNR3\", \"carol\", \"economy\", 0, false);\nif (b3 != \"CONFIRMED:200:0\") throw new Exception(\"b3=\" + b3);\n\n// Sold out\nstring so = AirlineBooking.Book(\"PNR4\", \"dave\", \"economy\", 0, false);\nif (so != \"SOLD_OUT\") throw new Exception(\"so=\" + so);\nif (AirlineBooking.seatsLeft != 0) throw new Exception(\"seats mutated on sold out\");\n\n// Points with insufficient points (partial coverage)\nAirlineBooking.seatsLeft = 1;\nAirlineBooking.SetPoints(\"eve\", 5000); // worth $50\nstring b4 = AirlineBooking.Book(\"PNR4\", \"eve\", \"economy\", 3, true);\n// gross = 200 + 2*50 = 300. points: 5000/100=50. discount=min(50,300)=50. cash=250.\nif (b4 != \"CONFIRMED:250:50\") throw new Exception(\"b4=\" + b4);\nif (AirlineBooking.passengerPoints[\"eve\"] != 0) throw new Exception(\"eve pts=\" + AirlineBooking.passengerPoints[\"eve\"]);\n","category":"code_purpose_understanding"} {"id":"18","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass InvoiceProcessor\n{\n static Dictionary\u003cstring, int\u003e invoiceAmounts = new Dictionary\u003cstring, int\u003e(); // invoiceId -\u003e original amount\n static Dictionary\u003cstring, int\u003e invoiceDueDays = new Dictionary\u003cstring, int\u003e(); // invoiceId -\u003e due day\n static Dictionary\u003cstring, int\u003e balances = new Dictionary\u003cstring, int\u003e(); // invoiceId -\u003e remaining\n static int creditPool; // shared credit memo pool\n static int earlyDiscountPct; // discount if paid earlyDays before due\n static int earlyDays;\n static int latePenaltyPct; // penalty per late day (applied to original amount)\n static int maxPenaltyPct; // cap on total penalty\n static List\u003cstring\u003e payLog = new List\u003cstring\u003e();\n static HashSet\u003cstring\u003e fullyPaid = new HashSet\u003cstring\u003e();\n\n static void Reset(int credit, int earlyPct, int eDays, int latePct, int maxPct)\n {\n invoiceAmounts.Clear(); invoiceDueDays.Clear(); balances.Clear();\n payLog.Clear(); fullyPaid.Clear();\n creditPool = credit; earlyDiscountPct = earlyPct; earlyDays = eDays;\n latePenaltyPct = latePct; maxPenaltyPct = maxPct;\n }\n\n static void AddInvoice(string id, int amount, int dueDay)\n {\n invoiceAmounts[id] = amount; invoiceDueDays[id] = dueDay;\n balances[id] = amount;\n }\n\n // Process a payment for an invoice.\n // Rules:\n // 1. If invoice not found or already fully paid, return \"INVALID\".\n // 2. Compute adjustedBalance:\n // - If payDay \u003c= dueDay - earlyDays: apply earlyDiscountPct to remaining balance. adjustedBalance = balance - balance*earlyDiscountPct/100.\n // - If payDay \u003e dueDay: lateDays = payDay - dueDay. penalty = min(lateDays*latePenaltyPct, maxPenaltyPct) * invoiceAmounts[id] / 100.\n // adjustedBalance = balance + penalty.\n // - Otherwise: adjustedBalance = balance (no adjustment).\n // 3. Apply credit: creditUsed = min(creditPool, adjustedBalance). Reduce creditPool. Reduce adjustedBalance.\n // 4. cashNeeded = adjustedBalance (after credit). If cashAmount \u003c cashNeeded, return \"UNDERPAYMENT\" with no mutation.\n // 5. On success: set balance to 0, add to fullyPaid, log \"PAY:id:creditUsed:cashUsed:penalty_or_discount\".\n // 6. Return \"PAID:creditUsed:cashUsed\".\n static string Pay(string invoiceId, int payDay, int cashAmount)\n {\n","golden_completion":"if (!balances.ContainsKey(invoiceId) || fullyPaid.Contains(invoiceId)) return \"INVALID\";\nint balance = balances[invoiceId];\nint dueDay = invoiceDueDays[invoiceId];\nint original = invoiceAmounts[invoiceId];\nint adjusted = balance;\nint adj = 0;\nif (payDay \u003c= dueDay - earlyDays)\n{\n adj = balance * earlyDiscountPct / 100;\n adjusted = balance - adj;\n}\nelse if (payDay \u003e dueDay)\n{\n int lateDays = payDay - dueDay;\n int penPct = Math.Min(lateDays * latePenaltyPct, maxPenaltyPct);\n adj = original * penPct / 100;\n adjusted = balance + adj;\n}\nint creditUsed = Math.Min(creditPool, adjusted);\nint afterCredit = adjusted - creditUsed;\nif (cashAmount \u003c afterCredit) return \"UNDERPAYMENT\";\ncreditPool -= creditUsed;\nbalances[invoiceId] = 0;\nfullyPaid.Add(invoiceId);\npayLog.Add(\"PAY:\" + invoiceId + \":\" + creditUsed + \":\" + afterCredit + \":\" + adj);\nreturn \"PAID:\" + creditUsed + \":\" + afterCredit;\n","suffix":" }\n\n static void Main()\n {\n Reset(100, 5, 10, 2, 20); // 100 credit, 5% early disc, 10 early days, 2%/day late, 20% max penalty\n AddInvoice(\"INV1\", 1000, 30);\n AddInvoice(\"INV2\", 500, 20);\n\n // Early payment: payDay=15, due=30, earlyDays=10 =\u003e 15 \u003c= 30-10=20, discount applies\n // discount = 1000*5/100 = 50. adjusted = 950. credit=min(100,950)=100. cash=850.\n string p1 = Pay(\"INV1\", 15, 850);\n if (p1 != \"PAID:100:850\") throw new Exception(\"p1=\" + p1);\n if (creditPool != 0) throw new Exception(\"credit=\" + creditPool);\n\n // Late payment: payDay=25, due=20, lateDays=5. penalty=min(5*2,20)=10% of 500=50.\n // adjusted=500+50=550. credit=0. cash=550.\n string p2 = Pay(\"INV2\", 25, 550);\n if (p2 != \"PAID:0:550\") throw new Exception(\"p2=\" + p2);\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Already paid\nstring p3 = InvoiceProcessor.Pay(\"INV1\", 15, 9999);\nif (p3 != \"INVALID\") throw new Exception(\"p3=\" + p3);\n\n// Not found\nstring p4 = InvoiceProcessor.Pay(\"INV99\", 15, 100);\nif (p4 != \"INVALID\") throw new Exception(\"p4=\" + p4);\n\n// Underpayment test\nInvoiceProcessor.AddInvoice(\"INV3\", 200, 30);\nstring p5 = InvoiceProcessor.Pay(\"INV3\", 15, 100);\n// discount: 200*5/100=10, adjusted=190, credit=0, cash needed=190\nif (p5 != \"UNDERPAYMENT\") throw new Exception(\"p5=\" + p5);\n// No mutation on underpayment\nif (InvoiceProcessor.fullyPaid.Contains(\"INV3\")) throw new Exception(\"underpay mutated\");\nif (InvoiceProcessor.balances[\"INV3\"] != 200) throw new Exception(\"balance mutated\");\n\n// Exact payment after failed attempt\nstring p6 = InvoiceProcessor.Pay(\"INV3\", 15, 190);\nif (p6 != \"PAID:0:190\") throw new Exception(\"p6=\" + p6);\n","category":"code_purpose_understanding"} {"id":"19","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass MembershipEngine\n{\n static string currentTier;\n static int totalPoints;\n static int tierPoints; // points accumulated in current period\n static int periodStart; // day the current period started\n static int graceUntil; // day until which downgrade is deferred (0 = no grace)\n static Dictionary\u003cstring, int\u003e tierThresholds = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e tierEarnRates = new Dictionary\u003cstring, int\u003e();\n static string[] tierOrder; // lowest to highest\n static int periodLength; // days per evaluation period\n static int gracePeriod; // days of grace before downgrade\n static List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n\n static void Reset(string[] order, int pLen, int gPeriod)\n {\n tierOrder = order; periodLength = pLen; gracePeriod = gPeriod;\n tierThresholds.Clear(); tierEarnRates.Clear(); auditLog.Clear();\n currentTier = order[0]; totalPoints = 0; tierPoints = 0;\n periodStart = 0; graceUntil = 0;\n }\n\n static void AddTier(string tier, int threshold, int earnRate)\n {\n tierThresholds[tier] = threshold; tierEarnRates[tier] = earnRate;\n }\n\n static int TierIndex(string t) { return Array.IndexOf(tierOrder, t); }\n\n // Record a purchase and evaluate tier.\n // Rules:\n // 1. Earn points: amount * tierEarnRates[currentTier]. Add to totalPoints AND tierPoints.\n // 2. If day \u003e= periodStart + periodLength, evaluate and start new period:\n // a. Find highest tier where tierPoints \u003e= threshold (walk tierOrder high to low).\n // b. If qualified tier is ABOVE current: upgrade immediately, graceUntil = 0.\n // c. If qualified tier is BELOW current:\n // - If graceUntil == 0: start grace, set graceUntil = day + gracePeriod. Keep current tier.\n // - If day \u003e= graceUntil: downgrade to qualified tier. graceUntil = 0.\n // - Otherwise: keep current tier (still in grace).\n // d. If same: graceUntil = 0.\n // e. Reset tierPoints = 0, periodStart = day.\n // f. Audit \"EVAL:day:oldTier-\u003ecurrentTier:grace=graceUntil\".\n // 3. Return \"currentTier:totalPoints\".\n static string Purchase(int day, int amount)\n {\n","golden_completion":"int earned = amount * tierEarnRates[currentTier];\ntotalPoints += earned;\ntierPoints += earned;\nif (day \u003e= periodStart + periodLength)\n{\n string oldTier = currentTier;\n string qualified = tierOrder[0];\n for (int i = tierOrder.Length - 1; i \u003e= 0; i--)\n {\n if (tierPoints \u003e= tierThresholds[tierOrder[i]]) { qualified = tierOrder[i]; break; }\n }\n int qIdx = TierIndex(qualified);\n int cIdx = TierIndex(currentTier);\n if (qIdx \u003e cIdx) { currentTier = qualified; graceUntil = 0; }\n else if (qIdx \u003c cIdx)\n {\n if (graceUntil == 0) { graceUntil = day + gracePeriod; }\n else if (day \u003e= graceUntil) { currentTier = qualified; graceUntil = 0; }\n }\n else { graceUntil = 0; }\n tierPoints = 0;\n periodStart = day;\n auditLog.Add(\"EVAL:\" + day + \":\" + oldTier + \"-\u003e\" + currentTier + \":grace=\" + graceUntil);\n}\nreturn currentTier + \":\" + totalPoints;\n","suffix":" }\n\n static void Main()\n {\n Reset(new string[] { \"bronze\", \"silver\", \"gold\" }, 30, 60);\n AddTier(\"bronze\", 0, 1);\n AddTier(\"silver\", 500, 2);\n AddTier(\"gold\", 1500, 3);\n\n // Period 1 (days 0-29): spend enough to earn silver\n // bronze earn rate = 1pt/$\n string r1 = Purchase(0, 300);\n if (r1 != \"bronze:300\") throw new Exception(\"r1=\" + r1);\n string r2 = Purchase(15, 250);\n if (r2 != \"bronze:550\") throw new Exception(\"r2=\" + r2);\n // Trigger eval at day 30: tierPoints=550 \u003e= 500(silver), not \u003e= 1500(gold) =\u003e silver\n // Upgrade: bronze-\u003esilver\n string r3 = Purchase(30, 0);\n if (r3 != \"silver:550\") throw new Exception(\"r3=\" + r3);\n if (graceUntil != 0) throw new Exception(\"grace=\" + graceUntil);\n\n // Period 2 (days 30-59): earn rate now 2pt/$, spend little\n string r4 = Purchase(45, 100); // earns 200 pts\n if (r4 != \"silver:750\") throw new Exception(\"r4=\" + r4);\n // Eval at day 60: tierPoints=200 \u003c 500(silver). qualified=bronze. grace starts.\n // graceUntil = 60 + 60 = 120. Still silver.\n string r5 = Purchase(60, 0);\n if (r5 != \"silver:750\") throw new Exception(\"r5=\" + r5);\n if (graceUntil != 120) throw new Exception(\"grace2=\" + graceUntil);\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Period 3 (days 60-89): still in grace (until 120), spend nothing\nstring r6 = MembershipEngine.Purchase(90, 0);\n// eval: tierPoints=0 \u003c 500. grace still active (90 \u003c 120). Stay silver.\nif (r6 != \"silver:750\") throw new Exception(\"r6=\" + r6);\n\n// Period 4 (days 90-119): spend nothing\n// eval at day 120: tierPoints=0 \u003c 500. day \u003e= graceUntil(120). Downgrade to bronze.\nstring r7 = MembershipEngine.Purchase(120, 0);\nif (r7 != \"bronze:750\") throw new Exception(\"r7=\" + r7);\nif (MembershipEngine.graceUntil != 0) throw new Exception(\"grace3=\" + MembershipEngine.graceUntil);\n\n// Earn back to gold from bronze (earn rate 1pt/$)\nstring r8 = MembershipEngine.Purchase(130, 1500);\n// earns 1500 pts. tierPoints=1500. no eval yet (periodStart=120, next at 150).\nif (r8 != \"bronze:2250\") throw new Exception(\"r8=\" + r8);\nstring r9 = MembershipEngine.Purchase(150, 0);\n// eval: tierPoints=1500 \u003e= 1500(gold). Upgrade bronze-\u003egold.\nif (r9 != \"gold:2250\") throw new Exception(\"r9=\" + r9);\n","category":"code_purpose_understanding"} {"id":"20","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass PurchaseOrderSystem\n{\n static int budget;\n static int approvalThreshold; // orders above this need manager approval\n static int managerThreshold; // orders above this need director approval\n static HashSet\u003cstring\u003e approvedManagers = new HashSet\u003cstring\u003e();\n static HashSet\u003cstring\u003e approvedDirectors = new HashSet\u003cstring\u003e();\n static Dictionary\u003cstring, int\u003e orders = new Dictionary\u003cstring, int\u003e(); // poId -\u003e amount\n static Dictionary\u003cstring, string\u003e orderStatus = new Dictionary\u003cstring, string\u003e();\n static Dictionary\u003cstring, int\u003e deliveryDay = new Dictionary\u003cstring, int\u003e();\n static List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n static HashSet\u003cstring\u003e processedPos = new HashSet\u003cstring\u003e();\n\n static void Reset(int b, int at, int mt)\n {\n budget = b; approvalThreshold = at; managerThreshold = mt;\n approvedManagers.Clear(); approvedDirectors.Clear();\n orders.Clear(); orderStatus.Clear(); deliveryDay.Clear();\n auditLog.Clear(); processedPos.Clear();\n }\n\n static void AddManager(string m) { approvedManagers.Add(m); }\n static void AddDirector(string d) { approvedDirectors.Add(d); }\n\n // Submit a purchase order.\n // Rules:\n // 1. poId is idempotent: if already processed, return \"DUPLICATE\".\n // 2. Determine approval level:\n // - amount \u003c= approvalThreshold: auto-approved.\n // - amount \u003c= managerThreshold: needs manager. If approver not in approvedManagers, return \"NEEDS_MANAGER\".\n // - amount \u003e managerThreshold: needs director. If approver not in approvedDirectors, return \"NEEDS_DIRECTOR\".\n // 3. If amount \u003e budget, return \"OVER_BUDGET\" with no mutation.\n // 4. On success: deduct from budget, store order with amount/status=\"APPROVED\"/deliveryDay=orderDay+leadTime.\n // 5. Audit \"PO:poId:amount:approver:deliveryDay\".\n // 6. Return \"APPROVED:deliveryDay\".\n static string Submit(string poId, int amount, string approver, int orderDay, int leadTime)\n {\n","golden_completion":"if (processedPos.Contains(poId)) return \"DUPLICATE\";\nif (amount \u003e approvalThreshold \u0026\u0026 amount \u003c= managerThreshold)\n{\n if (!approvedManagers.Contains(approver)) return \"NEEDS_MANAGER\";\n}\nelse if (amount \u003e managerThreshold)\n{\n if (!approvedDirectors.Contains(approver)) return \"NEEDS_DIRECTOR\";\n}\nif (amount \u003e budget) return \"OVER_BUDGET\";\nbudget -= amount;\nint delDay = orderDay + leadTime;\norders[poId] = amount;\norderStatus[poId] = \"APPROVED\";\ndeliveryDay[poId] = delDay;\nprocessedPos.Add(poId);\nauditLog.Add(\"PO:\" + poId + \":\" + amount + \":\" + approver + \":\" + delDay);\nreturn \"APPROVED:\" + delDay;\n","suffix":" }\n\n static void Main()\n {\n Reset(10000, 500, 2000);\n AddManager(\"mgr1\");\n AddDirector(\"dir1\");\n\n // Auto-approved (amount \u003c= 500)\n string s1 = Submit(\"PO1\", 300, \"anyone\", 1, 5);\n if (s1 != \"APPROVED:6\") throw new Exception(\"s1=\" + s1);\n if (budget != 9700) throw new Exception(\"budget=\" + budget);\n\n // Manager approval\n string s2 = Submit(\"PO2\", 1500, \"mgr1\", 2, 7);\n if (s2 != \"APPROVED:9\") throw new Exception(\"s2=\" + s2);\n\n // Manager needed but not a manager\n string s3 = Submit(\"PO3\", 1000, \"anyone\", 3, 5);\n if (s3 != \"NEEDS_MANAGER\") throw new Exception(\"s3=\" + s3);\n\n // Director needed\n string s4 = Submit(\"PO4\", 5000, \"dir1\", 4, 10);\n if (s4 != \"APPROVED:14\") throw new Exception(\"s4=\" + s4);\n if (budget != 3200) throw new Exception(\"budget2=\" + budget);\n int visibleDone = 1;\n }\n}\n","assertions":"if (visibleDone != 1) throw new Exception(\"visible\");\n// Duplicate\nstring dup = PurchaseOrderSystem.Submit(\"PO1\", 100, \"x\", 1, 1);\nif (dup != \"DUPLICATE\") throw new Exception(\"dup=\" + dup);\n\n// Over budget\nstring ob = PurchaseOrderSystem.Submit(\"PO5\", 5000, \"dir1\", 5, 3);\nif (ob != \"OVER_BUDGET\") throw new Exception(\"ob=\" + ob);\nif (PurchaseOrderSystem.budget != 3200) throw new Exception(\"budget mutated on over\");\n\n// Director needed but manager provided\nstring nd = PurchaseOrderSystem.Submit(\"PO6\", 3000, \"mgr1\", 6, 5);\nif (nd != \"NEEDS_DIRECTOR\") throw new Exception(\"nd=\" + nd);\n\n// Use remaining budget exactly\nstring s5 = PurchaseOrderSystem.Submit(\"PO7\", 3200, \"dir1\", 7, 2);\nif (s5 != \"APPROVED:9\") throw new Exception(\"s5=\" + s5);\nif (PurchaseOrderSystem.budget != 0) throw new Exception(\"budget3=\" + PurchaseOrderSystem.budget);\n\n// Zero budget, even small order fails\nstring s6 = PurchaseOrderSystem.Submit(\"PO8\", 1, \"anyone\", 8, 1);\nif (s6 != \"OVER_BUDGET\") throw new Exception(\"s6=\" + s6);\n","category":"code_purpose_understanding"} {"id":"21","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static Dictionary\u003cstring, List\u003cstring\u003e\u003e prerequisites = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n static Dictionary\u003cstring, int\u003e capacity = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, List\u003cstring\u003e\u003e enrolled = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n static Dictionary\u003cstring, List\u003cstring\u003e\u003e waitlist = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n static HashSet\u003cstring\u003e completedCourses = new HashSet\u003cstring\u003e();\n static List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n static int currentDay = 0;\n static int dropAddDeadline = 5;\n\n static void Reset()\n {\n prerequisites.Clear(); capacity.Clear(); enrolled.Clear();\n waitlist.Clear(); completedCourses.Clear(); auditLog.Clear();\n currentDay = 0; dropAddDeadline = 5;\n }\n\n static void AddCourse(string course, int cap, List\u003cstring\u003e prereqs)\n {\n prerequisites[course] = prereqs;\n capacity[course] = cap;\n enrolled[course] = new List\u003cstring\u003e();\n waitlist[course] = new List\u003cstring\u003e();\n }\n\n static void Complete(string student, string course) { completedCourses.Add(student + \":\" + course); }\n\n static string Enroll(string student, string course, int day)\n {\n","golden_completion":" currentDay = day;\n if (!capacity.ContainsKey(course)) return \"COURSE_NOT_FOUND\";\n if (enrolled[course].Contains(student)) return \"ALREADY_ENROLLED\";\n if (waitlist[course].Contains(student)) return \"ALREADY_WAITLISTED\";\n foreach (var pr in prerequisites[course])\n { if (!completedCourses.Contains(student + \":\" + pr)) { auditLog.Add(\"PREREQ_FAIL:\" + student + \":\" + course + \":\" + pr); return \"PREREQ_MISSING:\" + pr; } }\n if (enrolled[course].Count \u003c capacity[course])\n { enrolled[course].Add(student); auditLog.Add(\"ENROLLED:\" + student + \":\" + course + \":day=\" + day); return \"ENROLLED\"; }\n waitlist[course].Add(student);\n auditLog.Add(\"WAITLISTED:\" + student + \":\" + course + \":pos=\" + waitlist[course].Count);\n return \"WAITLISTED:\" + waitlist[course].Count;\n","suffix":" }\n\n static string Drop(string student, string course, int day)\n {\n currentDay = day;\n if (!enrolled[course].Contains(student)) return \"NOT_ENROLLED\";\n if (day \u003e dropAddDeadline) return \"DROP_DEADLINE_PASSED\";\n enrolled[course].Remove(student);\n auditLog.Add(\"DROPPED:\" + student + \":\" + course + \":day=\" + day);\n if (waitlist[course].Count \u003e 0)\n {\n string promoted = waitlist[course][0];\n waitlist[course].RemoveAt(0);\n enrolled[course].Add(promoted);\n auditLog.Add(\"PROMOTED:\" + promoted + \":\" + course);\n }\n return \"DROPPED\";\n }\n\n static void Main()\n {\n Reset();\n AddCourse(\"CS201\", 2, new List\u003cstring\u003e { \"CS101\" });\n AddCourse(\"CS101\", 1, new List\u003cstring\u003e());\n\n string r1 = Enroll(\"Alice\", \"CS201\", 1);\n if (!(r1 == \"PREREQ_MISSING:CS101\")) throw new Exception(\"r1=\" + r1);\n\n Complete(\"Alice\", \"CS101\");\n string r2 = Enroll(\"Alice\", \"CS201\", 1);\n if (!(r2 == \"ENROLLED\")) throw new Exception(\"r2=\" + r2);\n\n Complete(\"Bob\", \"CS101\");\n string r3 = Enroll(\"Bob\", \"CS201\", 1);\n if (!(r3 == \"ENROLLED\")) throw new Exception(\"r3=\" + r3);\n\n Complete(\"Charlie\", \"CS101\");\n string r4 = Enroll(\"Charlie\", \"CS201\", 2);\n if (!(r4 == \"WAITLISTED:1\")) throw new Exception(\"r4=\" + r4);\n\n string r5 = Drop(\"Alice\", \"CS201\", 3);\n if (!(r5 == \"DROPPED\")) throw new Exception(\"r5=\" + r5);\n if (!(enrolled[\"CS201\"].Contains(\"Charlie\"))) throw new Exception(\"Charlie not promoted\");\n if (!(auditLog.Any(l =\u003e l.StartsWith(\"PROMOTED:Charlie\")))) throw new Exception(\"missing promotion log\");\n\n // Drop deadline passed (day 7 \u003e deadline 5)\n string r6 = Drop(\"Bob\", \"CS201\", 7);\n if (!(r6 == \"DROP_DEADLINE_PASSED\")) throw new Exception(\"r6=\" + r6);\n }\n}\n","assertions":"\n // Hidden: duplicate enrollment\n Reset();\n AddCourse(\"MATH1\", 5, new List\u003cstring\u003e());\n Enroll(\"Dave\", \"MATH1\", 1);\n string dup = Enroll(\"Dave\", \"MATH1\", 1);\n if (!(dup == \"ALREADY_ENROLLED\")) throw new Exception(\"dup=\" + dup);\n\n // Hidden: already waitlisted\n AddCourse(\"MATH2\", 0, new List\u003cstring\u003e());\n Enroll(\"Eve\", \"MATH2\", 1);\n string wdup = Enroll(\"Eve\", \"MATH2\", 1);\n if (!(wdup == \"ALREADY_WAITLISTED\")) throw new Exception(\"wdup=\" + wdup);\n\n // Hidden: unknown course\n string unk = Enroll(\"Eve\", \"NONEXIST\", 1);\n if (!(unk == \"COURSE_NOT_FOUND\")) throw new Exception(\"unk=\" + unk);\n\n // Hidden: audit log records prereq failures\n AddCourse(\"ADV\", 5, new List\u003cstring\u003e { \"BASIC\" });\n Enroll(\"Frank\", \"ADV\", 1);\n if (!(auditLog.Any(l =\u003e l.Contains(\"PREREQ_FAIL:Frank:ADV:BASIC\")))) throw new Exception(\"missing prereq fail log\");\n","category":"code_purpose_understanding"} {"id":"22","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static Dictionary\u003cstring, int\u003e vehicleMileage = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e lastServiceDay = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e lastServiceMileage = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e missedServices = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e partsInventory = new Dictionary\u003cstring, int\u003e();\n static List\u003cstring\u003e serviceLog = new List\u003cstring\u003e();\n\n static int mileageInterval = 5000;\n static int dayInterval = 90;\n static int missedThreshold = 2;\n\n static void Reset()\n {\n vehicleMileage.Clear(); lastServiceDay.Clear(); lastServiceMileage.Clear();\n missedServices.Clear(); partsInventory.Clear(); serviceLog.Clear();\n }\n\n static void AddVehicle(string vid, int initMileage, int initDay)\n {\n vehicleMileage[vid] = initMileage;\n lastServiceDay[vid] = initDay;\n lastServiceMileage[vid] = initMileage;\n missedServices[vid] = 0;\n }\n\n static void AddParts(string part, int qty) { partsInventory[part] = partsInventory.GetValueOrDefault(part) + qty; }\n\n static void UpdateMileage(string vid, int newMileage) { vehicleMileage[vid] = newMileage; }\n\n static string CheckAndService(string vid, int currentDay, List\u003cstring\u003e requiredParts)\n {\n","golden_completion":" if (!vehicleMileage.ContainsKey(vid)) return \"VEHICLE_NOT_FOUND\";\n int milesDriven = vehicleMileage[vid] - lastServiceMileage[vid];\n int daysSince = currentDay - lastServiceDay[vid];\n bool mileageDue = milesDriven \u003e= mileageInterval, timeDue = daysSince \u003e= dayInterval;\n if (!mileageDue \u0026\u0026 !timeDue)\n { missedServices[vid]++; serviceLog.Add(\"SKIPPED:\" + vid + \":day=\" + currentDay + \":missed=\" + missedServices[vid]); return \"NOT_DUE\"; }\n string severity = missedServices[vid] \u003e= missedThreshold ? \"CRITICAL\" : (mileageDue \u0026\u0026 timeDue ? \"HIGH\" : \"NORMAL\");\n foreach (var part in requiredParts)\n { if (partsInventory.GetValueOrDefault(part) \u003c= 0) { serviceLog.Add(\"PARTS_HOLD:\" + vid + \":\" + part + \":severity=\" + severity); return \"PARTS_UNAVAILABLE:\" + part; } }\n foreach (var part in requiredParts) partsInventory[part]--;\n lastServiceDay[vid] = currentDay; lastServiceMileage[vid] = vehicleMileage[vid];\n int prevMissed = missedServices[vid]; missedServices[vid] = 0;\n serviceLog.Add(\"SERVICED:\" + vid + \":severity=\" + severity + \":day=\" + currentDay + \":parts=\" + string.Join(\",\", requiredParts) + \":clearedMissed=\" + prevMissed);\n return \"SERVICED:\" + severity;\n","suffix":" }\n\n static void Main()\n {\n Reset();\n AddVehicle(\"V1\", 10000, 0);\n AddParts(\"OIL_FILTER\", 5);\n AddParts(\"BRAKE_PAD\", 2);\n\n // Not due yet\n UpdateMileage(\"V1\", 12000);\n string r1 = CheckAndService(\"V1\", 30, new List\u003cstring\u003e { \"OIL_FILTER\" });\n if (!(r1 == \"NOT_DUE\")) throw new Exception(\"r1=\" + r1);\n if (!(missedServices[\"V1\"] == 1)) throw new Exception(\"missed should be 1\");\n\n // Mileage due\n UpdateMileage(\"V1\", 15500);\n string r2 = CheckAndService(\"V1\", 60, new List\u003cstring\u003e { \"OIL_FILTER\" });\n if (!(r2 == \"SERVICED:NORMAL\")) throw new Exception(\"r2=\" + r2);\n if (!(missedServices[\"V1\"] == 0)) throw new Exception(\"missed should reset\");\n if (!(partsInventory[\"OIL_FILTER\"] == 4)) throw new Exception(\"oil filter count\");\n\n // Time due (90 days) with both triggers = HIGH\n UpdateMileage(\"V1\", 21000);\n string r3 = CheckAndService(\"V1\", 155, new List\u003cstring\u003e { \"OIL_FILTER\", \"BRAKE_PAD\" });\n if (!(r3 == \"SERVICED:HIGH\")) throw new Exception(\"r3=\" + r3);\n }\n}\n","assertions":"\n // Hidden: CRITICAL after 2 missed services\n Reset();\n AddVehicle(\"V2\", 0, 0);\n AddParts(\"FILTER\", 10);\n CheckAndService(\"V2\", 10, new List\u003cstring\u003e { \"FILTER\" }); // NOT_DUE, missed=1\n CheckAndService(\"V2\", 20, new List\u003cstring\u003e { \"FILTER\" }); // NOT_DUE, missed=2\n UpdateMileage(\"V2\", 6000);\n string cr = CheckAndService(\"V2\", 30, new List\u003cstring\u003e { \"FILTER\" });\n if (!(cr == \"SERVICED:CRITICAL\")) throw new Exception(\"cr=\" + cr);\n\n // Hidden: parts unavailable\n Reset();\n AddVehicle(\"V3\", 0, 0);\n UpdateMileage(\"V3\", 6000);\n string pa = CheckAndService(\"V3\", 10, new List\u003cstring\u003e { \"WIDGET\" });\n if (!(pa == \"PARTS_UNAVAILABLE:WIDGET\")) throw new Exception(\"pa=\" + pa);\n\n // Hidden: unknown vehicle\n string nf = CheckAndService(\"V_UNKNOWN\", 10, new List\u003cstring\u003e());\n if (!(nf == \"VEHICLE_NOT_FOUND\")) throw new Exception(\"nf=\" + nf);\n\n // Hidden: service log contains parts hold with severity\n if (!(serviceLog.Any(l =\u003e l.Contains(\"PARTS_HOLD:V3:WIDGET\")))) throw new Exception(\"missing parts hold log\");\n","category":"code_purpose_understanding"} {"id":"23","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static Dictionary\u003cstring, string\u003e participantArm = new Dictionary\u003cstring, string\u003e();\n static Dictionary\u003cstring, int\u003e adverseEventCount = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, string\u003e participantStatus = new Dictionary\u003cstring, string\u003e();\n static HashSet\u003cstring\u003e withdrawnIds = new HashSet\u003cstring\u003e();\n static List\u003cstring\u003e trialLog = new List\u003cstring\u003e();\n static int armACount = 0, armBCount = 0;\n static int maxPerArm = 5;\n static int aeWithdrawThreshold = 3;\n\n static void Reset()\n {\n participantArm.Clear(); adverseEventCount.Clear();\n participantStatus.Clear(); withdrawnIds.Clear();\n trialLog.Clear(); armACount = 0; armBCount = 0;\n }\n\n static string ScreenAndRandomize(string pid, int age, bool hasContraindication, int baselineScore)\n {\n","golden_completion":" if (withdrawnIds.Contains(pid)) return \"PREVIOUSLY_WITHDRAWN\";\n if (participantStatus.ContainsKey(pid)) return \"DUPLICATE_SCREENING\";\n if (age \u003c 18 || age \u003e 65) { trialLog.Add(\"INELIGIBLE:\" + pid + \":age=\" + age); return \"INELIGIBLE:AGE\"; }\n if (hasContraindication) { trialLog.Add(\"INELIGIBLE:\" + pid + \":contraindication\"); return \"INELIGIBLE:CONTRAINDICATION\"; }\n if (baselineScore \u003c 40) { trialLog.Add(\"INELIGIBLE:\" + pid + \":baseline=\" + baselineScore); return \"INELIGIBLE:BASELINE\"; }\n string arm;\n if (armACount \u003c= armBCount) { arm = \"A\"; armACount++; }\n else { arm = \"B\"; armBCount++; }\n if (armACount \u003e maxPerArm \u0026\u0026 arm == \"A\" || armBCount \u003e maxPerArm \u0026\u0026 arm == \"B\")\n {\n trialLog.Add(\"TRIAL_FULL:\" + pid);\n if (arm == \"A\") armACount--; else armBCount--;\n return \"TRIAL_FULL\";\n }\n participantArm[pid] = arm;\n adverseEventCount[pid] = 0;\n participantStatus[pid] = \"ACTIVE\";\n trialLog.Add(\"RANDOMIZED:\" + pid + \":arm=\" + arm);\n return \"RANDOMIZED:\" + arm;\n","suffix":" }\n\n static string RecordAdverseEvent(string pid, string severity)\n {\n if (!participantStatus.ContainsKey(pid) || participantStatus[pid] != \"ACTIVE\") return \"NOT_ACTIVE\";\n adverseEventCount[pid]++;\n trialLog.Add(\"AE:\" + pid + \":#\" + adverseEventCount[pid] + \":severity=\" + severity);\n if (severity == \"SEVERE\" || adverseEventCount[pid] \u003e= aeWithdrawThreshold)\n {\n participantStatus[pid] = \"WITHDRAWN_AE\";\n withdrawnIds.Add(pid);\n if (participantArm[pid] == \"A\") armACount--; else armBCount--;\n trialLog.Add(\"WITHDRAWN_AE:\" + pid);\n return \"WITHDRAWN\";\n }\n return \"RECORDED\";\n }\n\n static void Main()\n {\n Reset();\n string r1 = ScreenAndRandomize(\"P1\", 30, false, 50);\n if (!(r1 == \"RANDOMIZED:A\")) throw new Exception(\"r1=\" + r1);\n\n string r2 = ScreenAndRandomize(\"P2\", 25, false, 60);\n if (!(r2 == \"RANDOMIZED:B\")) throw new Exception(\"r2=\" + r2);\n\n string r3 = ScreenAndRandomize(\"P3\", 17, false, 50);\n if (!(r3 == \"INELIGIBLE:AGE\")) throw new Exception(\"r3=\" + r3);\n\n string r4 = ScreenAndRandomize(\"P4\", 30, true, 50);\n if (!(r4 == \"INELIGIBLE:CONTRAINDICATION\")) throw new Exception(\"r4=\" + r4);\n\n string r5 = ScreenAndRandomize(\"P5\", 30, false, 20);\n if (!(r5 == \"INELIGIBLE:BASELINE\")) throw new Exception(\"r5=\" + r5);\n\n // Duplicate screening\n string r6 = ScreenAndRandomize(\"P1\", 30, false, 50);\n if (!(r6 == \"DUPLICATE_SCREENING\")) throw new Exception(\"r6=\" + r6);\n\n // AE withdrawal then re-screening\n RecordAdverseEvent(\"P1\", \"SEVERE\");\n if (!(participantStatus[\"P1\"] == \"WITHDRAWN_AE\")) throw new Exception(\"P1 should be withdrawn\");\n string r7 = ScreenAndRandomize(\"P1\", 30, false, 50);\n if (!(r7 == \"PREVIOUSLY_WITHDRAWN\")) throw new Exception(\"r7=\" + r7);\n }\n}\n","assertions":"\n // Hidden: balanced randomization\n Reset();\n ScreenAndRandomize(\"X1\", 30, false, 50); // A (0 vs 0 -\u003e A)\n ScreenAndRandomize(\"X2\", 30, false, 50); // B (1 vs 0 -\u003e B)\n ScreenAndRandomize(\"X3\", 30, false, 50); // A (1 vs 1 -\u003e A)\n if (!(participantArm[\"X1\"] == \"A\")) throw new Exception(\"X1 arm\");\n if (!(participantArm[\"X2\"] == \"B\")) throw new Exception(\"X2 arm\");\n if (!(participantArm[\"X3\"] == \"A\")) throw new Exception(\"X3 arm\");\n\n // Hidden: AE count threshold (3 mild = withdrawal)\n Reset();\n ScreenAndRandomize(\"Y1\", 40, false, 50);\n RecordAdverseEvent(\"Y1\", \"MILD\");\n RecordAdverseEvent(\"Y1\", \"MILD\");\n string aeR = RecordAdverseEvent(\"Y1\", \"MILD\");\n if (!(aeR == \"WITHDRAWN\")) throw new Exception(\"aeR=\" + aeR);\n\n // Hidden: trial full\n Reset();\n maxPerArm = 1;\n ScreenAndRandomize(\"Z1\", 30, false, 50); // A\n ScreenAndRandomize(\"Z2\", 30, false, 50); // B\n string full = ScreenAndRandomize(\"Z3\", 30, false, 50);\n if (!(full == \"TRIAL_FULL\")) throw new Exception(\"full=\" + full);\n maxPerArm = 5;\n","category":"code_purpose_understanding"} {"id":"24","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static decimal escrowBalance = 0;\n static decimal purchasePrice = 0;\n static Dictionary\u003cstring, int\u003e contingencyDeadlines = new Dictionary\u003cstring, int\u003e();\n static HashSet\u003cstring\u003e waivedContingencies = new HashSet\u003cstring\u003e();\n static HashSet\u003cstring\u003e failedContingencies = new HashSet\u003cstring\u003e();\n static List\u003cstring\u003e escrowLog = new List\u003cstring\u003e();\n static string escrowStatus = \"OPEN\";\n static decimal buyerCredit = 0;\n static int closingDay = 0;\n\n static void Reset(decimal price, int closeDay)\n {\n escrowBalance = 0; purchasePrice = price; closingDay = closeDay;\n contingencyDeadlines.Clear(); waivedContingencies.Clear();\n failedContingencies.Clear(); escrowLog.Clear();\n escrowStatus = \"OPEN\"; buyerCredit = 0;\n }\n\n static void AddContingency(string name, int deadline) { contingencyDeadlines[name] = deadline; }\n\n static string ProcessEscrowAction(string action, string detail, int day, decimal amount)\n {\n","golden_completion":" if (escrowStatus == \"CANCELLED\" || escrowStatus == \"CLOSED\") return \"ESCROW_\" + escrowStatus;\n if (action == \"DEPOSIT\")\n { escrowBalance += amount; escrowLog.Add(\"DEPOSIT:\" + amount + \":day=\" + day + \":balance=\" + escrowBalance); return \"DEPOSITED:\" + escrowBalance; }\n if (action == \"WAIVE_CONTINGENCY\")\n { if (!contingencyDeadlines.ContainsKey(detail)) return \"CONTINGENCY_NOT_FOUND\"; waivedContingencies.Add(detail); escrowLog.Add(\"WAIVED:\" + detail + \":day=\" + day); return \"WAIVED:\" + detail; }\n if (action == \"FAIL_CONTINGENCY\")\n {\n if (!contingencyDeadlines.ContainsKey(detail)) return \"CONTINGENCY_NOT_FOUND\";\n if (waivedContingencies.Contains(detail)) return \"ALREADY_WAIVED\";\n if (day \u003e contingencyDeadlines[detail]) return \"DEADLINE_PASSED\";\n failedContingencies.Add(detail); escrowStatus = \"CANCELLED\";\n decimal refund = escrowBalance; escrowBalance = 0;\n escrowLog.Add(\"FAILED:\" + detail + \":refund=\" + refund + \":day=\" + day); return \"CANCELLED:REFUND=\" + refund;\n }\n if (action == \"CLOSE\")\n {\n foreach (var kvp in contingencyDeadlines)\n { if (!waivedContingencies.Contains(kvp.Key) \u0026\u0026 !failedContingencies.Contains(kvp.Key)) return \"PENDING_CONTINGENCY:\" + kvp.Key; }\n decimal prorated = Math.Round(amount * (decimal)(365 - day + closingDay) / 365, 2);\n buyerCredit = prorated; decimal netDue = purchasePrice - escrowBalance - prorated;\n escrowStatus = \"CLOSED\"; escrowLog.Add(\"CLOSED:net=\" + netDue + \":proration=\" + prorated + \":day=\" + day); return \"CLOSED:NET_DUE=\" + netDue;\n }\n return \"UNKNOWN_ACTION\";\n","suffix":" }\n\n static void Main()\n {\n Reset(300000m, 30);\n AddContingency(\"INSPECTION\", 10);\n AddContingency(\"APPRAISAL\", 15);\n\n string r1 = ProcessEscrowAction(\"DEPOSIT\", \"\", 1, 10000m);\n if (!(r1 == \"DEPOSITED:10000\")) throw new Exception(\"r1=\" + r1);\n\n string r2 = ProcessEscrowAction(\"WAIVE_CONTINGENCY\", \"INSPECTION\", 5, 0m);\n if (!(r2 == \"WAIVED:INSPECTION\")) throw new Exception(\"r2=\" + r2);\n\n string r3 = ProcessEscrowAction(\"WAIVE_CONTINGENCY\", \"APPRAISAL\", 12, 0m);\n if (!(r3 == \"WAIVED:APPRAISAL\")) throw new Exception(\"r3=\" + r3);\n\n // Close with tax proration: amount=5000, proration = 5000 * (365 - 20 + 30) / 365\n string r4 = ProcessEscrowAction(\"CLOSE\", \"\", 20, 5000m);\n decimal expectedPro = Math.Round(5000m * 375m / 365m, 2);\n decimal expectedNet = 300000m - 10000m - expectedPro;\n if (!(r4 == \"CLOSED:NET_DUE=\" + expectedNet)) throw new Exception(\"r4=\" + r4);\n }\n}\n","assertions":"\n // Hidden: cannot act on cancelled escrow\n Reset(200000m, 30);\n AddContingency(\"FINANCING\", 10);\n ProcessEscrowAction(\"DEPOSIT\", \"\", 1, 5000m);\n ProcessEscrowAction(\"FAIL_CONTINGENCY\", \"FINANCING\", 5, 0m);\n string ca = ProcessEscrowAction(\"DEPOSIT\", \"\", 6, 1000m);\n if (!(ca == \"ESCROW_CANCELLED\")) throw new Exception(\"ca=\" + ca);\n\n // Hidden: fail after deadline\n Reset(200000m, 30);\n AddContingency(\"INSPECTION\", 10);\n ProcessEscrowAction(\"DEPOSIT\", \"\", 1, 5000m);\n string late = ProcessEscrowAction(\"FAIL_CONTINGENCY\", \"INSPECTION\", 11, 0m);\n if (!(late == \"DEADLINE_PASSED\")) throw new Exception(\"late=\" + late);\n\n // Hidden: close with pending contingency\n Reset(200000m, 30);\n AddContingency(\"APPRAISAL\", 15);\n ProcessEscrowAction(\"DEPOSIT\", \"\", 1, 5000m);\n string pend = ProcessEscrowAction(\"CLOSE\", \"\", 20, 3000m);\n if (!(pend == \"PENDING_CONTINGENCY:APPRAISAL\")) throw new Exception(\"pend=\" + pend);\n\n // Hidden: already waived then fail\n Reset(200000m, 30);\n AddContingency(\"TITLE\", 10);\n ProcessEscrowAction(\"WAIVE_CONTINGENCY\", \"TITLE\", 3, 0m);\n string aw = ProcessEscrowAction(\"FAIL_CONTINGENCY\", \"TITLE\", 5, 0m);\n if (!(aw == \"ALREADY_WAIVED\")) throw new Exception(\"aw=\" + aw);\n","category":"code_purpose_understanding"} {"id":"25","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static Dictionary\u003cstring, decimal\u003e menuPrices = new Dictionary\u003cstring, decimal\u003e();\n static Dictionary\u003cstring, string\u003e menuStation = new Dictionary\u003cstring, string\u003e();\n static List\u003c(string item, decimal price, string station, List\u003cstring\u003e mods, bool comped)\u003e orderItems\n = new List\u003c(string, decimal, string, List\u003cstring\u003e, bool)\u003e();\n static List\u003cstring\u003e kitchenTickets = new List\u003cstring\u003e();\n static decimal compTotal = 0;\n\n static void Reset()\n {\n menuPrices.Clear(); menuStation.Clear(); orderItems.Clear();\n kitchenTickets.Clear(); compTotal = 0;\n }\n\n static void AddMenuItem(string item, decimal price, string station)\n {\n menuPrices[item] = price; menuStation[item] = station;\n }\n\n static string AddOrderItem(string item, List\u003cstring\u003e modifiers, bool comp)\n {\n","golden_completion":" if (!menuPrices.ContainsKey(item)) return \"ITEM_NOT_FOUND\";\n decimal price = menuPrices[item];\n decimal modCharge = 0;\n foreach (var mod in modifiers)\n {\n if (mod.StartsWith(\"+\")) modCharge += 1.50m;\n }\n decimal finalPrice = comp ? 0m : price + modCharge;\n if (comp) compTotal += price + modCharge;\n string station = menuStation[item];\n orderItems.Add((item, finalPrice, station, modifiers, comp));\n string modStr = modifiers.Count \u003e 0 ? string.Join(\",\", modifiers) : \"NONE\";\n kitchenTickets.Add(station + \":\" + item + \":\" + modStr);\n return \"ADDED:\" + item + \":$\" + finalPrice;\n","suffix":" }\n\n static Dictionary\u003cstring, decimal\u003e SplitBill(int ways)\n {\n decimal subtotal = orderItems.Sum(o =\u003e o.price);\n decimal perPerson = Math.Round(subtotal / ways, 2);\n decimal remainder = subtotal - perPerson * ways;\n var result = new Dictionary\u003cstring, decimal\u003e();\n for (int i = 1; i \u003c= ways; i++)\n {\n result[\"guest_\" + i] = perPerson + (i == 1 ? remainder : 0m);\n }\n return result;\n }\n\n static void Main()\n {\n Reset();\n AddMenuItem(\"BURGER\", 12.00m, \"GRILL\");\n AddMenuItem(\"SALAD\", 8.00m, \"COLD\");\n AddMenuItem(\"FRIES\", 5.00m, \"FRY\");\n\n string r1 = AddOrderItem(\"BURGER\", new List\u003cstring\u003e { \"+cheese\", \"+bacon\" }, false);\n if (!(r1 == \"ADDED:BURGER:$15.00\")) throw new Exception(\"r1=\" + r1);\n\n string r2 = AddOrderItem(\"SALAD\", new List\u003cstring\u003e { \"no_croutons\" }, false);\n if (!(r2 == \"ADDED:SALAD:$8.00\")) throw new Exception(\"r2=\" + r2);\n\n string r3 = AddOrderItem(\"FRIES\", new List\u003cstring\u003e(), true);\n if (!(r3 == \"ADDED:FRIES:$0\")) throw new Exception(\"r3=\" + r3);\n if (!(compTotal == 5.00m)) throw new Exception(\"compTotal=\" + compTotal);\n\n if (!(kitchenTickets[0] == \"GRILL:BURGER:+cheese,+bacon\")) throw new Exception(\"ticket0\");\n if (!(kitchenTickets[2] == \"FRY:FRIES:NONE\")) throw new Exception(\"ticket2\");\n\n var split = SplitBill(2);\n // subtotal = 15.00 + 8.00 + 0 = 23.00, per person = 11.50\n if (!(split[\"guest_1\"] == 11.50m)) throw new Exception(\"split1=\" + split[\"guest_1\"]);\n if (!(split[\"guest_2\"] == 11.50m)) throw new Exception(\"split2=\" + split[\"guest_2\"]);\n }\n}\n","assertions":"\n // Hidden: modifier charge only for + prefix\n Reset();\n AddMenuItem(\"STEAK\", 20.00m, \"GRILL\");\n string ha = AddOrderItem(\"STEAK\", new List\u003cstring\u003e { \"+mushrooms\", \"no_pepper\", \"+sauce\" }, false);\n if (!(ha == \"ADDED:STEAK:$23.00\")) throw new Exception(\"ha=\" + ha);\n\n // Hidden: item not found\n string nf = AddOrderItem(\"PIZZA\", new List\u003cstring\u003e(), false);\n if (!(nf == \"ITEM_NOT_FOUND\")) throw new Exception(\"nf=\" + nf);\n\n // Hidden: comp with modifiers still tracks full price in compTotal\n Reset();\n AddMenuItem(\"WINE\", 15.00m, \"BAR\");\n compTotal = 0;\n AddOrderItem(\"WINE\", new List\u003cstring\u003e { \"+premium\" }, true);\n if (!(compTotal == 16.50m)) throw new Exception(\"compTotal=\" + compTotal);\n","category":"code_purpose_understanding"} {"id":"26","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static Dictionary\u003cstring, int\u003e patronCheckouts = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, decimal\u003e patronFines = new Dictionary\u003cstring, decimal\u003e();\n static Dictionary\u003cstring, string\u003e itemBorrower = new Dictionary\u003cstring, string\u003e();\n static Dictionary\u003cstring, int\u003e itemDueDay = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, int\u003e itemRenewals = new Dictionary\u003cstring, int\u003e();\n static Dictionary\u003cstring, Queue\u003cstring\u003e\u003e holdsQueue = new Dictionary\u003cstring, Queue\u003cstring\u003e\u003e();\n static List\u003cstring\u003e circLog = new List\u003cstring\u003e();\n\n static int maxCheckouts = 5;\n static int loanPeriod = 14;\n static int maxRenewals = 2;\n static decimal finePerDay = 0.25m;\n\n static void Reset()\n {\n patronCheckouts.Clear(); patronFines.Clear(); itemBorrower.Clear();\n itemDueDay.Clear(); itemRenewals.Clear(); holdsQueue.Clear(); circLog.Clear();\n }\n\n static void RegisterPatron(string pid) { patronCheckouts[pid] = 0; patronFines[pid] = 0m; }\n\n static string CheckoutItem(string patronId, string itemId, int day)\n {\n","golden_completion":" if (!patronCheckouts.ContainsKey(patronId)) return \"PATRON_NOT_FOUND\";\n if (patronFines[patronId] \u003e 0) return \"FINES_OWED:\" + patronFines[patronId];\n if (patronCheckouts[patronId] \u003e= maxCheckouts) return \"CHECKOUT_LIMIT\";\n if (itemBorrower.ContainsKey(itemId))\n {\n if (!holdsQueue.ContainsKey(itemId)) holdsQueue[itemId] = new Queue\u003cstring\u003e();\n if (!holdsQueue[itemId].Contains(patronId)) { holdsQueue[itemId].Enqueue(patronId); circLog.Add(\"HOLD:\" + patronId + \":\" + itemId + \":pos=\" + holdsQueue[itemId].Count); }\n return \"ON_HOLD:\" + holdsQueue[itemId].Count;\n }\n bool hasHold = holdsQueue.ContainsKey(itemId) \u0026\u0026 holdsQueue[itemId].Count \u003e 0;\n if (hasHold \u0026\u0026 holdsQueue[itemId].Peek() != patronId) return \"HELD_FOR_OTHER\";\n if (hasHold \u0026\u0026 holdsQueue[itemId].Peek() == patronId) holdsQueue[itemId].Dequeue();\n itemBorrower[itemId] = patronId; itemDueDay[itemId] = day + loanPeriod; itemRenewals[itemId] = 0;\n patronCheckouts[patronId]++;\n circLog.Add(\"CHECKOUT:\" + patronId + \":\" + itemId + \":due=\" + (day + loanPeriod));\n return \"CHECKED_OUT:due=\" + (day + loanPeriod);\n","suffix":" }\n\n static string ReturnItem(string itemId, int day)\n {\n if (!itemBorrower.ContainsKey(itemId)) return \"NOT_CHECKED_OUT\";\n string patron = itemBorrower[itemId];\n int overdueDays = Math.Max(0, day - itemDueDay[itemId]);\n decimal fine = overdueDays * finePerDay;\n patronFines[patron] += fine;\n patronCheckouts[patron]--;\n itemBorrower.Remove(itemId);\n itemDueDay.Remove(itemId);\n itemRenewals.Remove(itemId);\n circLog.Add(\"RETURN:\" + patron + \":\" + itemId + \":fine=\" + fine);\n if (holdsQueue.ContainsKey(itemId) \u0026\u0026 holdsQueue[itemId].Count \u003e 0)\n {\n string next = holdsQueue[itemId].Peek();\n circLog.Add(\"HOLD_AVAILABLE:\" + next + \":\" + itemId);\n return \"RETURNED:HOLD_NOTIFY=\" + next + \":fine=\" + fine;\n }\n return \"RETURNED:fine=\" + fine;\n }\n\n static void Main()\n {\n Reset();\n RegisterPatron(\"P1\");\n RegisterPatron(\"P2\");\n\n string r1 = CheckoutItem(\"P1\", \"BOOK1\", 1);\n if (!(r1 == \"CHECKED_OUT:due=15\")) throw new Exception(\"r1=\" + r1);\n\n // P2 tries to checkout same book, gets hold\n string r2 = CheckoutItem(\"P2\", \"BOOK1\", 2);\n if (!(r2 == \"ON_HOLD:1\")) throw new Exception(\"r2=\" + r2);\n\n // P1 returns late\n string r3 = ReturnItem(\"BOOK1\", 20);\n if (!(r3 == \"RETURNED:HOLD_NOTIFY=P2:fine=1.25\")) throw new Exception(\"r3=\" + r3);\n if (!(patronFines[\"P1\"] == 1.25m)) throw new Exception(\"P1 fine\");\n\n // P1 can\u0027t checkout with fines\n string r4 = CheckoutItem(\"P1\", \"BOOK2\", 21);\n if (!(r4 == \"FINES_OWED:1.25\")) throw new Exception(\"r4=\" + r4);\n\n // P2 has hold, can checkout\n string r5 = CheckoutItem(\"P2\", \"BOOK1\", 21);\n if (!(r5 == \"CHECKED_OUT:due=35\")) throw new Exception(\"r5=\" + r5);\n }\n}\n","assertions":"\n // Hidden: checkout limit\n Reset();\n RegisterPatron(\"LIM\");\n for (int i = 0; i \u003c 5; i++) CheckoutItem(\"LIM\", \"B\" + i, 1);\n string lim = CheckoutItem(\"LIM\", \"B99\", 1);\n if (!(lim == \"CHECKOUT_LIMIT\")) throw new Exception(\"lim=\" + lim);\n\n // Hidden: held for other patron\n Reset();\n RegisterPatron(\"H1\");\n RegisterPatron(\"H2\");\n RegisterPatron(\"H3\");\n CheckoutItem(\"H1\", \"HB\", 1);\n CheckoutItem(\"H2\", \"HB\", 2); // H2 gets hold pos 1\n ReturnItem(\"HB\", 10);\n string hfo = CheckoutItem(\"H3\", \"HB\", 11);\n if (!(hfo == \"HELD_FOR_OTHER\")) throw new Exception(\"hfo=\" + hfo);\n\n // Hidden: patron not found\n string pnf = CheckoutItem(\"GHOST\", \"B1\", 1);\n if (!(pnf == \"PATRON_NOT_FOUND\")) throw new Exception(\"pnf=\" + pnf);\n","category":"code_purpose_understanding"} {"id":"27","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static decimal basePlanCost = 0;\n static int includedMinutes = 0;\n static decimal overageRate = 0;\n static int rolloverMinutes = 0;\n static int rolloverCap = 0;\n static Dictionary\u003cstring, int\u003e lineUsage = new Dictionary\u003cstring, int\u003e();\n static List\u003cstring\u003e billingLog = new List\u003cstring\u003e();\n\n static void Reset(decimal base_, int included, decimal overage, int rlCap)\n {\n basePlanCost = base_; includedMinutes = included;\n overageRate = overage; rolloverMinutes = 0; rolloverCap = rlCap;\n lineUsage.Clear(); billingLog.Clear();\n }\n\n static void AddLine(string lineId) { lineUsage[lineId] = 0; }\n\n static void RecordUsage(string lineId, int minutes) { lineUsage[lineId] += minutes; }\n\n static Dictionary\u003cstring, object\u003e CloseBillingCycle()\n {\n","golden_completion":" int totalUsed = lineUsage.Values.Sum();\n int pooled = includedMinutes + rolloverMinutes;\n int overage = Math.Max(0, totalUsed - pooled);\n int unusedFromIncluded = Math.Max(0, includedMinutes - totalUsed);\n int newRollover = Math.Min(unusedFromIncluded, rolloverCap);\n decimal totalBill = basePlanCost + overage * overageRate;\n int linesCount = lineUsage.Count;\n decimal perLine = linesCount \u003e 0 ? Math.Round(totalBill / linesCount, 2) : totalBill;\n decimal remainder = totalBill - perLine * linesCount;\n var perLineCharges = new Dictionary\u003cstring, decimal\u003e();\n bool first = true;\n foreach (var line in lineUsage.Keys.OrderBy(k =\u003e k)) { perLineCharges[line] = perLine + (first ? remainder : 0m); first = false; }\n int rlUsed = totalUsed \u003e includedMinutes ? Math.Min(rolloverMinutes, totalUsed - includedMinutes) : 0;\n billingLog.Add(\"CYCLE:total=\" + totalBill + \":overage=\" + overage + \":rolloverUsed=\" + rlUsed + \":newRollover=\" + newRollover);\n rolloverMinutes = newRollover;\n foreach (var kv in lineUsage) lineUsage[kv.Key] = 0;\n return new Dictionary\u003cstring, object\u003e { [\"total\"] = totalBill, [\"overage_minutes\"] = overage, [\"rollover_carried\"] = newRollover, [\"per_line\"] = perLineCharges };\n","suffix":" }\n\n static void Main()\n {\n Reset(60.00m, 1000, 0.10m, 500);\n AddLine(\"L1\");\n AddLine(\"L2\");\n\n RecordUsage(\"L1\", 400);\n RecordUsage(\"L2\", 300);\n // Total: 700, included: 1000, unused: 300 -\u003e rollover: min(300, 500) = 300\n var r1 = CloseBillingCycle();\n if (!((decimal)r1[\"total\"] == 60.00m)) throw new Exception(\"r1 total\");\n if (!((int)r1[\"overage_minutes\"] == 0)) throw new Exception(\"r1 overage\");\n if (!((int)r1[\"rollover_carried\"] == 300)) throw new Exception(\"r1 rollover\");\n var pl1 = (Dictionary\u003cstring, decimal\u003e)r1[\"per_line\"];\n if (!(pl1[\"L1\"] == 30.00m \u0026\u0026 pl1[\"L2\"] == 30.00m)) throw new Exception(\"r1 split\");\n\n // Cycle 2: use more than included, dip into rollover\n RecordUsage(\"L1\", 800);\n RecordUsage(\"L2\", 600);\n // Total: 1400, pooled: 1000 + 300 = 1300, overage: 100\n var r2 = CloseBillingCycle();\n if (!((decimal)r2[\"total\"] == 70.00m)) throw new Exception(\"r2 total=\" + r2[\"total\"]);\n if (!((int)r2[\"overage_minutes\"] == 100)) throw new Exception(\"r2 overage\");\n if (!((int)r2[\"rollover_carried\"] == 0)) throw new Exception(\"r2 rollover\");\n }\n}\n","assertions":"\n // Hidden: rollover capped\n Reset(50.00m, 500, 0.20m, 100);\n AddLine(\"X1\");\n RecordUsage(\"X1\", 100);\n var hc = CloseBillingCycle();\n if (!((int)hc[\"rollover_carried\"] == 100)) throw new Exception(\"cap=\" + hc[\"rollover_carried\"]);\n\n // Hidden: all rollover consumed before overage\n RecordUsage(\"X1\", 700);\n // pooled: 500 + 100 = 600, overage: 100\n var hc2 = CloseBillingCycle();\n if (!((int)hc2[\"overage_minutes\"] == 100)) throw new Exception(\"ov=\" + hc2[\"overage_minutes\"]);\n if (!((decimal)hc2[\"total\"] == 70.00m)) throw new Exception(\"tot=\" + hc2[\"total\"]);\n\n // Hidden: odd split with remainder to first line\n Reset(100.00m, 2000, 0.05m, 0);\n AddLine(\"A\"); AddLine(\"B\"); AddLine(\"C\");\n // 100 / 3 = 33.33 each, remainder 0.01 to first\n var hc3 = CloseBillingCycle();\n var pl = (Dictionary\u003cstring, decimal\u003e)hc3[\"per_line\"];\n if (!(pl[\"A\"] == 33.34m)) throw new Exception(\"A=\" + pl[\"A\"]);\n if (!(pl[\"B\"] == 33.33m)) throw new Exception(\"B=\" + pl[\"B\"]);\n if (!(pl[\"C\"] == 33.33m)) throw new Exception(\"C=\" + pl[\"C\"]);\n","category":"code_purpose_understanding"} {"id":"28","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static decimal currentBid = 0;\n static string currentWinner = \"\";\n static decimal reservePrice = 0;\n static decimal minIncrement = 0;\n static Dictionary\u003cstring, decimal\u003e proxyLimits = new Dictionary\u003cstring, decimal\u003e();\n static int auctionEndTime = 0;\n static int snipeExtension = 0;\n static bool reserveMet = false;\n static List\u003cstring\u003e bidLog = new List\u003cstring\u003e();\n\n static void Reset(decimal reserve, decimal increment, int endTime, int snipeExt)\n {\n currentBid = 0; currentWinner = \"\"; reservePrice = reserve;\n minIncrement = increment; auctionEndTime = endTime;\n snipeExtension = snipeExt; reserveMet = false;\n proxyLimits.Clear(); bidLog.Clear();\n }\n\n static string PlaceBid(string bidder, decimal amount, int time)\n {\n","golden_completion":" if (time \u003e auctionEndTime) return \"AUCTION_ENDED\";\n if (bidder == currentWinner) return \"ALREADY_WINNING\";\n decimal required = currentBid == 0 ? minIncrement : currentBid + minIncrement;\n if (amount \u003c required) { bidLog.Add(\"REJECTED:\" + bidder + \":\" + amount + \":min=\" + required); return \"BID_TOO_LOW:min=\" + required; }\n if (currentWinner != \"\" \u0026\u0026 proxyLimits.ContainsKey(currentWinner))\n {\n decimal proxyMax = proxyLimits[currentWinner];\n if (proxyMax \u003e= amount + minIncrement)\n { currentBid = amount + minIncrement; bidLog.Add(\"PROXY:\" + currentWinner + \":\" + currentBid + \":vs=\" + bidder);\n if (auctionEndTime - time \u003c= snipeExtension) auctionEndTime += snipeExtension; return \"OUTBID_BY_PROXY:\" + currentWinner + \":\" + currentBid; }\n }\n currentBid = amount; currentWinner = bidder;\n if (!reserveMet \u0026\u0026 currentBid \u003e= reservePrice) reserveMet = true;\n if (auctionEndTime - time \u003c= snipeExtension) auctionEndTime += snipeExtension;\n bidLog.Add(\"BID:\" + bidder + \":\" + amount + \":time=\" + time); return \"BID_ACCEPTED:\" + amount;\n","suffix":" }\n\n static void SetProxy(string bidder, decimal maxAmount) { proxyLimits[bidder] = maxAmount; }\n\n static string GetResult()\n {\n if (!reserveMet) return \"RESERVE_NOT_MET\";\n return \"SOLD:\" + currentWinner + \":\" + currentBid;\n }\n\n static void Main()\n {\n Reset(100m, 10m, 60, 5);\n string r1 = PlaceBid(\"Alice\", 50m, 10);\n if (!(r1 == \"BID_ACCEPTED:50\")) throw new Exception(\"r1=\" + r1);\n\n SetProxy(\"Alice\", 120m);\n string r2 = PlaceBid(\"Bob\", 70m, 20);\n // Alice\u0027s proxy should auto-bid to 70+10=80\n if (!(r2 == \"OUTBID_BY_PROXY:Alice:80\")) throw new Exception(\"r2=\" + r2);\n if (!(currentBid == 80m)) throw new Exception(\"current=\" + currentBid);\n\n string r3 = PlaceBid(\"Bob\", 130m, 30);\n if (!(r3 == \"BID_ACCEPTED:130\")) throw new Exception(\"r3=\" + r3);\n if (!(reserveMet)) throw new Exception(\"reserve should be met\");\n\n // Snipe protection: bid in last 5 seconds extends\n string r4 = PlaceBid(\"Charlie\", 150m, 57);\n if (!(r4 == \"BID_ACCEPTED:150\")) throw new Exception(\"r4=\" + r4);\n if (!(auctionEndTime == 65)) throw new Exception(\"end=\" + auctionEndTime);\n\n if (!(GetResult() == \"SOLD:Charlie:150\")) throw new Exception(\"result\");\n }\n}\n","assertions":"\n // Hidden: auction ended\n Reset(50m, 5m, 30, 0);\n string ended = PlaceBid(\"X\", 100m, 31);\n if (!(ended == \"AUCTION_ENDED\")) throw new Exception(\"ended=\" + ended);\n\n // Hidden: already winning\n Reset(50m, 5m, 30, 0);\n PlaceBid(\"Y\", 50m, 1);\n string aw = PlaceBid(\"Y\", 60m, 2);\n if (!(aw == \"ALREADY_WINNING\")) throw new Exception(\"aw=\" + aw);\n\n // Hidden: bid too low\n Reset(50m, 10m, 30, 0);\n PlaceBid(\"A1\", 20m, 1);\n string low = PlaceBid(\"A2\", 25m, 2);\n if (!(low == \"BID_TOO_LOW:min=30\")) throw new Exception(\"low=\" + low);\n\n // Hidden: reserve not met\n Reset(200m, 10m, 30, 0);\n PlaceBid(\"A3\", 50m, 1);\n string rnm = GetResult();\n if (!(rnm == \"RESERVE_NOT_MET\")) throw new Exception(\"rnm=\" + rnm);\n\n // Hidden: proxy exceeds limit, new bidder wins\n Reset(10m, 5m, 100, 0);\n PlaceBid(\"P1\", 20m, 1);\n SetProxy(\"P1\", 30m); // proxy max is 30, can\u0027t beat 35\n string pw = PlaceBid(\"P2\", 35m, 2);\n if (!(pw == \"BID_ACCEPTED:35\")) throw new Exception(\"pw=\" + pw);\n if (!(currentWinner == \"P2\")) throw new Exception(\"winner=\" + currentWinner);\n","category":"code_purpose_understanding"} {"id":"29","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static Dictionary\u003cstring, decimal\u003e leaveBalance = new Dictionary\u003cstring, decimal\u003e();\n static Dictionary\u003cstring, decimal\u003e negativeLimit = new Dictionary\u003cstring, decimal\u003e();\n static Dictionary\u003cstring, bool\u003e managerApproval = new Dictionary\u003cstring, bool\u003e();\n static HashSet\u003cint\u003e blackoutDays = new HashSet\u003cint\u003e();\n static decimal carryOverCap = 0;\n static List\u003cstring\u003e leaveLog = new List\u003cstring\u003e();\n\n static void Reset(decimal cap)\n {\n leaveBalance.Clear(); negativeLimit.Clear(); managerApproval.Clear();\n blackoutDays.Clear(); leaveLog.Clear(); carryOverCap = cap;\n }\n\n static void AddEmployee(string eid, decimal balance, decimal negLim)\n {\n leaveBalance[eid] = balance; negativeLimit[eid] = negLim;\n }\n\n static void SetApproval(string eid, bool approved) { managerApproval[eid] = approved; }\n static void AddBlackout(int day) { blackoutDays.Add(day); }\n\n static string RequestLeave(string eid, int startDay, int numDays)\n {\n","golden_completion":" if (!leaveBalance.ContainsKey(eid)) return \"EMPLOYEE_NOT_FOUND\";\n if (!managerApproval.ContainsKey(eid) || !managerApproval[eid]) return \"NOT_APPROVED\";\n for (int d = startDay; d \u003c startDay + numDays; d++)\n {\n if (blackoutDays.Contains(d))\n {\n leaveLog.Add(\"BLACKOUT:\" + eid + \":day=\" + d);\n return \"BLACKOUT_CONFLICT:day=\" + d;\n }\n }\n decimal newBalance = leaveBalance[eid] - numDays;\n if (newBalance \u003c -negativeLimit[eid])\n {\n leaveLog.Add(\"INSUFFICIENT:\" + eid + \":need=\" + numDays + \":have=\" + leaveBalance[eid]);\n return \"INSUFFICIENT_BALANCE\";\n }\n leaveBalance[eid] = newBalance;\n managerApproval[eid] = false;\n leaveLog.Add(\"APPROVED:\" + eid + \":days=\" + numDays + \":balance=\" + newBalance);\n return \"LEAVE_GRANTED:balance=\" + newBalance;\n","suffix":" }\n\n static decimal YearEndCarryOver(string eid)\n {\n if (!leaveBalance.ContainsKey(eid)) return -1;\n decimal balance = leaveBalance[eid];\n decimal carried = balance \u003e 0 ? Math.Min(balance, carryOverCap) : balance;\n decimal forfeited = balance \u003e carryOverCap ? balance - carryOverCap : 0;\n leaveBalance[eid] = carried;\n leaveLog.Add(\"CARRYOVER:\" + eid + \":carried=\" + carried + \":forfeited=\" + forfeited);\n return forfeited;\n }\n\n static void Main()\n {\n Reset(10m);\n AddEmployee(\"E1\", 15m, 3m);\n AddBlackout(50);\n\n // No approval yet\n string r1 = RequestLeave(\"E1\", 10, 5);\n if (!(r1 == \"NOT_APPROVED\")) throw new Exception(\"r1=\" + r1);\n\n SetApproval(\"E1\", true);\n string r2 = RequestLeave(\"E1\", 10, 5);\n if (!(r2 == \"LEAVE_GRANTED:balance=10\")) throw new Exception(\"r2=\" + r2);\n\n // Approval consumed\n string r3 = RequestLeave(\"E1\", 20, 3);\n if (!(r3 == \"NOT_APPROVED\")) throw new Exception(\"r3=\" + r3);\n\n SetApproval(\"E1\", true);\n // Blackout conflict\n string r4 = RequestLeave(\"E1\", 48, 5);\n if (!(r4 == \"BLACKOUT_CONFLICT:day=50\")) throw new Exception(\"r4=\" + r4);\n\n // Year-end carry over: balance 10, cap 10 -\u003e forfeit 0\n decimal f1 = YearEndCarryOver(\"E1\");\n if (!(f1 == 0m)) throw new Exception(\"f1=\" + f1);\n }\n}\n","assertions":"\n // Hidden: negative balance allowed up to limit\n Reset(5m);\n AddEmployee(\"N1\", 2m, 5m);\n SetApproval(\"N1\", true);\n string neg = RequestLeave(\"N1\", 1, 6);\n if (!(neg == \"LEAVE_GRANTED:balance=-4\")) throw new Exception(\"neg=\" + neg);\n\n // Hidden: negative balance exceeds limit\n SetApproval(\"N1\", true);\n string exceed = RequestLeave(\"N1\", 10, 2);\n if (!(exceed == \"INSUFFICIENT_BALANCE\")) throw new Exception(\"exceed=\" + exceed);\n\n // Hidden: carry over caps positive, preserves negative\n Reset(5m);\n AddEmployee(\"CO1\", 20m, 0m);\n decimal fc = YearEndCarryOver(\"CO1\");\n if (!(fc == 15m)) throw new Exception(\"fc=\" + fc);\n if (!(leaveBalance[\"CO1\"] == 5m)) throw new Exception(\"bal=\" + leaveBalance[\"CO1\"]);\n\n AddEmployee(\"CO2\", -3m, 5m);\n decimal fn = YearEndCarryOver(\"CO2\");\n if (!(fn == 0m)) throw new Exception(\"fn=\" + fn);\n if (!(leaveBalance[\"CO2\"] == -3m)) throw new Exception(\"neg bal=\" + leaveBalance[\"CO2\"]);\n\n // Hidden: employee not found\n string enf = RequestLeave(\"GHOST\", 1, 1);\n if (!(enf == \"EMPLOYEE_NOT_FOUND\")) throw new Exception(\"enf=\" + enf);\n","category":"code_purpose_understanding"} {"id":"30","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static HashSet\u003cstring\u003e availableSeats = new HashSet\u003cstring\u003e();\n static HashSet\u003cstring\u003e vipSeats = new HashSet\u003cstring\u003e();\n static Dictionary\u003cstring, List\u003cstring\u003e\u003e bookings = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n static Dictionary\u003cstring, decimal\u003e bookingAmounts = new Dictionary\u003cstring, decimal\u003e();\n static decimal seatPrice = 0;\n static decimal vipUpgradePrice = 0;\n static decimal refundPenaltyRate = 0;\n static int refundDeadline = 0;\n static List\u003cstring\u003e ticketLog = new List\u003cstring\u003e();\n\n static void Reset(decimal price, decimal vipPrice, decimal penaltyRate, int deadline)\n {\n availableSeats.Clear(); vipSeats.Clear(); bookings.Clear();\n bookingAmounts.Clear(); ticketLog.Clear();\n seatPrice = price; vipUpgradePrice = vipPrice;\n refundPenaltyRate = penaltyRate; refundDeadline = deadline;\n }\n\n static void AddSeats(List\u003cstring\u003e seats, bool isVip)\n {\n foreach (var s in seats) { availableSeats.Add(s); if (isVip) vipSeats.Add(s); }\n }\n\n static string BookTickets(string bookingId, List\u003cstring\u003e requestedSeats, bool vipUpgrade, int day)\n {\n","golden_completion":" if (bookings.ContainsKey(bookingId)) return \"DUPLICATE_BOOKING\";\n if (requestedSeats.Count == 0) return \"NO_SEATS_REQUESTED\";\n var unavailable = requestedSeats.Where(s =\u003e !availableSeats.Contains(s)).ToList();\n if (unavailable.Count \u003e 0) return \"UNAVAILABLE:\" + string.Join(\",\", unavailable);\n decimal total = 0;\n var assignedSeats = new List\u003cstring\u003e();\n foreach (var seat in requestedSeats)\n {\n bool isVip = vipSeats.Contains(seat);\n decimal price = seatPrice + (vipUpgrade \u0026\u0026 !isVip ? vipUpgradePrice : 0m) + (isVip ? vipUpgradePrice : 0m);\n total += price;\n availableSeats.Remove(seat);\n if (vipUpgrade \u0026\u0026 !isVip) vipSeats.Add(seat);\n assignedSeats.Add(seat);\n }\n bookings[bookingId] = assignedSeats;\n bookingAmounts[bookingId] = total;\n ticketLog.Add(\"BOOKED:\" + bookingId + \":seats=\" + string.Join(\",\", assignedSeats) + \":total=\" + total);\n return \"BOOKED:\" + total;\n","suffix":" }\n\n static string RefundBooking(string bookingId, int day)\n {\n if (!bookings.ContainsKey(bookingId)) return \"BOOKING_NOT_FOUND\";\n decimal paid = bookingAmounts[bookingId];\n decimal penalty = day \u003e refundDeadline ? Math.Round(paid * refundPenaltyRate, 2) : 0m;\n decimal refund = paid - penalty;\n foreach (var seat in bookings[bookingId]) availableSeats.Add(seat);\n bookings.Remove(bookingId);\n bookingAmounts.Remove(bookingId);\n ticketLog.Add(\"REFUND:\" + bookingId + \":amount=\" + refund + \":penalty=\" + penalty);\n return \"REFUNDED:\" + refund;\n }\n\n static void Main()\n {\n Reset(50m, 20m, 0.25m, 10);\n AddSeats(new List\u003cstring\u003e { \"A1\", \"A2\", \"A3\" }, false);\n AddSeats(new List\u003cstring\u003e { \"V1\", \"V2\" }, true);\n\n // Regular booking\n string r1 = BookTickets(\"B1\", new List\u003cstring\u003e { \"A1\", \"A2\" }, false, 1);\n if (!(r1 == \"BOOKED:100\")) throw new Exception(\"r1=\" + r1);\n\n // VIP upgrade on regular seat\n string r2 = BookTickets(\"B2\", new List\u003cstring\u003e { \"A3\" }, true, 2);\n // regular seat + vip upgrade = 50 + 20 = 70\n if (!(r2 == \"BOOKED:70\")) throw new Exception(\"r2=\" + r2);\n\n // Already VIP seat (no extra upgrade charge since already VIP)\n string r3 = BookTickets(\"B3\", new List\u003cstring\u003e { \"V1\" }, false, 3);\n // VIP seat always has upgrade price: 50 + 20 = 70\n if (!(r3 == \"BOOKED:70\")) throw new Exception(\"r3=\" + r3);\n\n // Refund after deadline = penalty\n string r4 = RefundBooking(\"B1\", 15);\n // paid 100, penalty = Math.Round(100 * 0.25, 2) = 25.00, refund = 75.00\n if (!(r4 == \"REFUNDED:75.00\")) throw new Exception(\"r4=\" + r4);\n if (!(availableSeats.Contains(\"A1\"))) throw new Exception(\"A1 should be available\");\n\n // Duplicate\n string r5 = BookTickets(\"B2\", new List\u003cstring\u003e { \"A1\" }, false, 5);\n if (!(r5 == \"DUPLICATE_BOOKING\")) throw new Exception(\"r5=\" + r5);\n }\n}\n","assertions":"\n // Hidden: unavailable seats\n Reset(50m, 20m, 0.25m, 10);\n AddSeats(new List\u003cstring\u003e { \"S1\" }, false);\n string una = BookTickets(\"HB1\", new List\u003cstring\u003e { \"S1\", \"S99\" }, false, 1);\n if (!(una == \"UNAVAILABLE:S99\")) throw new Exception(\"una=\" + una);\n\n // Hidden: no seats requested\n string ns = BookTickets(\"HB2\", new List\u003cstring\u003e(), false, 1);\n if (!(ns == \"NO_SEATS_REQUESTED\")) throw new Exception(\"ns=\" + ns);\n\n // Hidden: VIP upgrade on already-VIP seat doesn\u0027t double charge\n Reset(50m, 20m, 0.25m, 10);\n AddSeats(new List\u003cstring\u003e { \"VX\" }, true);\n string vv = BookTickets(\"HB3\", new List\u003cstring\u003e { \"VX\" }, true, 1);\n // VIP seat: 50 + 20 = 70 (vipUpgrade flag doesn\u0027t add extra since already VIP)\n if (!(vv == \"BOOKED:70\")) throw new Exception(\"vv=\" + vv);\n\n // Hidden: refund before deadline = no penalty\n Reset(100m, 0m, 0.50m, 20);\n AddSeats(new List\u003cstring\u003e { \"R1\" }, false);\n BookTickets(\"RB\", new List\u003cstring\u003e { \"R1\" }, false, 1);\n string rr = RefundBooking(\"RB\", 5);\n if (!(rr == \"REFUNDED:100\")) throw new Exception(\"rr=\" + rr);\n\n // Hidden: booking not found\n string bnf = RefundBooking(\"FAKE\", 1);\n if (!(bnf == \"BOOKING_NOT_FOUND\")) throw new Exception(\"bnf=\" + bnf);\n","category":"code_purpose_understanding"} {"id":"31","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass EscrowAnalyzer\n{\n Dictionary\u003cstring, string\u003e analysisResults = new Dictionary\u003cstring, string\u003e();\n List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n int seqId = 0;\n\n // Analyze escrow account for a mortgage payment period.\n // Rules:\n // 1. analysisId is idempotent: return cached result without mutation.\n // 2. requiredAnnual = (taxAnnual + insuranceAnnual). monthlyRequired = requiredAnnual / 12 (integer division).\n // 3. balance = currentBalance + monthlyPayment - monthlyRequired (projected next-month balance).\n // 4. cushion = monthlyRequired * cushionMonths. maxCushion = monthlyRequired * 2 (hard cap regardless of cushionMonths).\n // Effective cushion = min(cushion, maxCushion).\n // 5. target = monthlyRequired + effectiveCushion.\n // 6. If balance \u003e= target: surplus. surplusAmt = balance - target. Result \"SURPLUS:\u003csurplusAmt\u003e\".\n // If surplusAmt \u003e monthlyRequired, log \"REFUND:\u003canalysisId\u003e:\u003csurplusAmt\u003e\".\n // 7. If balance \u003c monthlyRequired: shortage. shortageAmt = monthlyRequired - balance.\n // Result \"SHORTAGE:\u003cshortageAmt\u003e\". Log \"ALERT:\u003canalysisId\u003e:\u003cshortageAmt\u003e\".\n // 8. Otherwise: result \"ADEQUATE\". No log entry.\n // 9. Cache result, log \"ANALYSIS:\u003cseqId++\u003e:\u003canalysisId\u003e:\u003cresult\u003e\" for non-cached calls.\n string Analyze(string analysisId, int currentBalance, int monthlyPayment,\n int taxAnnual, int insuranceAnnual, int cushionMonths)\n {\n","golden_completion":" if (analysisResults.ContainsKey(analysisId)) return analysisResults[analysisId];\n int reqAnnual = taxAnnual + insuranceAnnual, mReq = reqAnnual / 12;\n int bal = currentBalance + monthlyPayment - mReq;\n int effCush = Math.Min(mReq * cushionMonths, mReq * 2);\n int target = mReq + effCush;\n string result;\n if (bal \u003e= target) {\n int surplus = bal - target; result = \"SURPLUS:\" + surplus;\n if (surplus \u003e mReq) auditLog.Add(\"REFUND:\" + analysisId + \":\" + surplus);\n } else if (bal \u003c mReq) {\n int shortage = mReq - bal; result = \"SHORTAGE:\" + shortage;\n auditLog.Add(\"ALERT:\" + analysisId + \":\" + shortage);\n } else { result = \"ADEQUATE\"; }\n analysisResults[analysisId] = result;\n auditLog.Add(\"ANALYSIS:\" + seqId++ + \":\" + analysisId + \":\" + result);\n return result;\n","suffix":" }\n\n static void Main()\n {\n var ea = new EscrowAnalyzer();\n // tax=6000/yr, insurance=1800/yr =\u003e monthlyReq=650\n // balance=1000+700-650=1050, cushion=650*1=650, maxCush=1300, eff=650, target=1300\n // 1050 \u003c 1300 but 1050 \u003e= 650 =\u003e ADEQUATE\n string r1 = ea.Analyze(\"A1\", 1000, 700, 6000, 1800, 1);\n if (r1 != \"ADEQUATE\") throw new Exception(\"expected ADEQUATE, got \" + r1);\n\n // balance=2000+700-650=2050, target=1300 =\u003e surplus=750, 750\u003e650 =\u003e REFUND\n string r2 = ea.Analyze(\"A2\", 2000, 700, 6000, 1800, 1);\n if (!r2.StartsWith(\"SURPLUS:\")) throw new Exception(\"expected SURPLUS\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n string dup = ea.Analyze(\"A1\", 9999, 9999, 9999, 9999, 9);\n if (dup != \"ADEQUATE\") throw new Exception(\"idempotent failed: \" + dup);\n int logBefore = ea.auditLog.Count;\n ea.Analyze(\"A2\", 0, 0, 0, 0, 0);\n if (ea.auditLog.Count != logBefore) throw new Exception(\"duplicate should not add log\");\n\n // Shortage case: balance=100+200-650=-350 \u003c 650 =\u003e shortage=1000\n string r3 = ea.Analyze(\"A3\", 100, 200, 6000, 1800, 1);\n if (r3 != \"SHORTAGE:1000\") throw new Exception(\"shortage wrong: \" + r3);\n if (!ea.auditLog.Exists(l =\u003e l.StartsWith(\"ALERT:A3:\"))) throw new Exception(\"no alert logged\");\n\n // Cushion cap: cushionMonths=5 =\u003e cushion=3250 but maxCushion=1300, eff=1300, target=1950\n // balance=2600+700-650=2650 \u003e= 1950 =\u003e surplus=700, 700\u003e650 =\u003e REFUND\n string r4 = ea.Analyze(\"A4\", 2600, 700, 6000, 1800, 5);\n if (r4 != \"SURPLUS:700\") throw new Exception(\"cushion cap: \" + r4);\n if (!ea.auditLog.Exists(l =\u003e l.StartsWith(\"REFUND:A4:\"))) throw new Exception(\"no refund logged\");\n\n // Surplus without refund: surplusAmt \u003c= monthlyRequired\n // balance=1400+700-650=1450, target=1300 =\u003e surplus=150, 150\u003c=650 =\u003e no REFUND\n string r5 = ea.Analyze(\"A5\", 1400, 700, 6000, 1800, 1);\n if (r5 != \"SURPLUS:150\") throw new Exception(\"small surplus: \" + r5);\n if (ea.auditLog.Exists(l =\u003e l.StartsWith(\"REFUND:A5:\"))) throw new Exception(\"should not refund small surplus\");\n\n // Sequence IDs increment\n if (ea.seqId != 5) throw new Exception(\"seqId should be 5, got \" + ea.seqId);\n","category":"code_purpose_understanding"} {"id":"32","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass CargoSystem\n{\n Dictionary\u003cstring, List\u003cstring\u003e\u003e manifests = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n List\u003cstring\u003e containers = new List\u003cstring\u003e();\n int totalWeight = 0;\n int maxWeight;\n bool hasHazmat = false;\n List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n\n public CargoSystem(int maxWeight) { this.maxWeight = maxWeight; }\n\n // Pack a cargo item into the container.\n // Rules:\n // 1. manifestId is idempotent: if seen before, return cached manifest lines without mutation.\n // 2. If isHazmat and hasHazmat already, reject: return null, log \"HAZMAT_REJECT:\u003cmanifestId\u003e\".\n // 3. If isHazmat and containers has any non-hazmat items, reject: return null,\n // log \"ISOLATION_REJECT:\u003cmanifestId\u003e\". Hazmat must be first or only with other hazmat.\n // 4. If totalWeight + weight \u003e maxWeight, partial load: fit = maxWeight - totalWeight.\n // If fit \u003c= 0, return null, log \"OVERWEIGHT:\u003cmanifestId\u003e:\u003cweight\u003e\".\n // Otherwise, load fit amount, log \"PARTIAL:\u003cmanifestId\u003e:\u003citemName\u003e:\u003cfit\u003e/\u003cweight\u003e\".\n // 5. Full load: totalWeight += weight. log \"LOADED:\u003cmanifestId\u003e:\u003citemName\u003e:\u003cweight\u003e\".\n // 6. If isHazmat, set hasHazmat = true.\n // 7. Add to containers list as \"\u003citemName\u003e:\u003cactualWeight\u003e\".\n // 8. Cache and return manifest lines list.\n List\u003cstring\u003e Pack(string manifestId, string itemName, int weight, bool isHazmat)\n {\n","golden_completion":" if (manifests.ContainsKey(manifestId)) return new List\u003cstring\u003e(manifests[manifestId]);\n if (isHazmat \u0026\u0026 hasHazmat) { auditLog.Add(\"HAZMAT_REJECT:\" + manifestId); return null; }\n if (isHazmat \u0026\u0026 containers.Any(c =\u003e !c.EndsWith(\":H\"))) { auditLog.Add(\"ISOLATION_REJECT:\" + manifestId); return null; }\n int fit = maxWeight - totalWeight;\n string tag = isHazmat ? \":H\" : \"\";\n if (totalWeight + weight \u003e maxWeight) {\n if (fit \u003c= 0) { auditLog.Add(\"OVERWEIGHT:\" + manifestId + \":\" + weight); return null; }\n totalWeight = maxWeight;\n containers.Add(itemName + \":\" + fit + tag);\n if (isHazmat) hasHazmat = true;\n var lines = new List\u003cstring\u003e { \"PARTIAL:\" + manifestId + \":\" + itemName + \":\" + fit + \"/\" + weight };\n auditLog.Add(lines[0]); manifests[manifestId] = new List\u003cstring\u003e(lines);\n return new List\u003cstring\u003e(lines);\n }\n totalWeight += weight;\n containers.Add(itemName + \":\" + weight + tag);\n if (isHazmat) hasHazmat = true;\n var mlines = new List\u003cstring\u003e { \"LOADED:\" + manifestId + \":\" + itemName + \":\" + weight };\n auditLog.Add(mlines[0]); manifests[manifestId] = new List\u003cstring\u003e(mlines);\n return new List\u003cstring\u003e(mlines);\n","suffix":" }\n\n static void Main()\n {\n var cs = new CargoSystem(100);\n var r1 = cs.Pack(\"M1\", \"Crate_A\", 60, false);\n if (r1 == null || !r1[0].Contains(\"LOADED\")) throw new Exception(\"r1: \" + (r1 == null ? \"null\" : r1[0]));\n if (cs.totalWeight != 60) throw new Exception(\"weight should be 60\");\n\n var r2 = cs.Pack(\"M2\", \"Crate_B\", 50, false);\n if (r2 == null || !r2[0].Contains(\"PARTIAL\")) throw new Exception(\"r2 should be partial\");\n if (cs.totalWeight != 100) throw new Exception(\"weight should be 100\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n int wBefore = cs.totalWeight;\n var dup = cs.Pack(\"M1\", \"IGNORED\", 999, false);\n if (!dup[0].Contains(\"LOADED:M1:Crate_A\")) throw new Exception(\"dup content wrong\");\n if (cs.totalWeight != wBefore) throw new Exception(\"dup mutated weight\");\n\n // Overweight when no room\n var over = cs.Pack(\"M3\", \"Heavy\", 10, false);\n if (over != null) throw new Exception(\"should reject when full\");\n if (!cs.auditLog.Exists(l =\u003e l.StartsWith(\"OVERWEIGHT:M3:\"))) throw new Exception(\"no overweight log\");\n\n // Fresh container: hazmat first is OK\n var cs2 = new CargoSystem(200);\n var h1 = cs2.Pack(\"H1\", \"Acid\", 50, true);\n if (h1 == null) throw new Exception(\"hazmat first should work\");\n if (!cs2.hasHazmat) throw new Exception(\"hasHazmat should be true\");\n\n // Second hazmat rejected (hasHazmat already)\n var h2 = cs2.Pack(\"H2\", \"Bleach\", 30, true);\n if (h2 != null) throw new Exception(\"second hazmat should be rejected\");\n if (!cs2.auditLog.Exists(l =\u003e l == \"HAZMAT_REJECT:H2\")) throw new Exception(\"no hazmat reject log\");\n\n // Non-hazmat then hazmat =\u003e isolation reject\n var cs3 = new CargoSystem(200);\n cs3.Pack(\"N1\", \"Food\", 20, false);\n var h3 = cs3.Pack(\"H3\", \"Toxin\", 30, true);\n if (h3 != null) throw new Exception(\"isolation should reject\");\n if (!cs3.auditLog.Exists(l =\u003e l == \"ISOLATION_REJECT:H3\")) throw new Exception(\"no isolation log\");\n","category":"code_purpose_understanding"} {"id":"33","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass WarrantyProcessor\n{\n Dictionary\u003cstring, string\u003e processedClaims = new Dictionary\u003cstring, string\u003e();\n List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n int totalPaidOut = 0;\n int maxTotalPayout;\n\n public WarrantyProcessor(int maxTotalPayout) { this.maxTotalPayout = maxTotalPayout; }\n\n // Process a warranty claim.\n // Rules:\n // 1. claimId idempotent: return cached result, no mutation.\n // 2. If claimDay \u003c warrantyStart or claimDay \u003e warrantyEnd, result \"EXPIRED\".\n // Log \"EXPIRED:\u003cclaimId\u003e\".\n // 3. repairCost after deductible: netCost = repairCost - deductible.\n // If netCost \u003c= 0, result \"UNDER_DEDUCTIBLE\". Log \"DEDUCTIBLE:\u003cclaimId\u003e:\u003crepairCost\u003e\".\n // 4. Remaining payout budget = maxTotalPayout - totalPaidOut.\n // If budget \u003c= 0, result \"BUDGET_EXHAUSTED\". Log \"EXHAUSTED:\u003cclaimId\u003e\".\n // 5. If netCost \u003e budget, partial payout = budget. Result \"PARTIAL:\u003cbudget\u003e\".\n // totalPaidOut = maxTotalPayout. Log \"PARTIAL_PAY:\u003cclaimId\u003e:\u003cbudget\u003e/\u003cnetCost\u003e\".\n // 6. Full payout: totalPaidOut += netCost. Result \"APPROVED:\u003cnetCost\u003e\".\n // Log \"APPROVED:\u003cclaimId\u003e:\u003cnetCost\u003e\".\n // 7. Cache result.\n string ProcessClaim(string claimId, int claimDay, int warrantyStart, int warrantyEnd,\n int repairCost, int deductible)\n {\n","golden_completion":" if (processedClaims.ContainsKey(claimId)) return processedClaims[claimId];\n string res;\n if (claimDay \u003c warrantyStart || claimDay \u003e warrantyEnd) {\n res = \"EXPIRED\"; auditLog.Add(\"EXPIRED:\" + claimId);\n } else {\n int netCost = repairCost - deductible;\n if (netCost \u003c= 0) { res = \"UNDER_DEDUCTIBLE\"; auditLog.Add(\"DEDUCTIBLE:\" + claimId + \":\" + repairCost); }\n else {\n int budget = maxTotalPayout - totalPaidOut;\n if (budget \u003c= 0) { res = \"BUDGET_EXHAUSTED\"; auditLog.Add(\"EXHAUSTED:\" + claimId); }\n else if (netCost \u003e budget) {\n totalPaidOut = maxTotalPayout; res = \"PARTIAL:\" + budget;\n auditLog.Add(\"PARTIAL_PAY:\" + claimId + \":\" + budget + \"/\" + netCost);\n } else {\n totalPaidOut += netCost; res = \"APPROVED:\" + netCost;\n auditLog.Add(\"APPROVED:\" + claimId + \":\" + netCost);\n }\n }\n }\n processedClaims[claimId] = res;\n return res;\n","suffix":" }\n\n static void Main()\n {\n var wp = new WarrantyProcessor(500);\n // Claim within warranty, cost 300, deductible 50 =\u003e net 250 \u003c= 500 =\u003e APPROVED:250\n string r1 = wp.ProcessClaim(\"C1\", 10, 1, 365, 300, 50);\n if (r1 != \"APPROVED:250\") throw new Exception(\"r1: \" + r1);\n if (wp.totalPaidOut != 250) throw new Exception(\"paid should be 250\");\n\n // Another claim: net=400-50=350, budget=250, partial=250\n string r2 = wp.ProcessClaim(\"C2\", 20, 1, 365, 400, 50);\n if (!r2.StartsWith(\"PARTIAL:\")) throw new Exception(\"r2 should be partial: \" + r2);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency: re-submit C1 with different params\n int paidBefore = wp.totalPaidOut;\n string dup = wp.ProcessClaim(\"C1\", 999, 0, 0, 9999, 0);\n if (dup != \"APPROVED:250\") throw new Exception(\"idempotent: \" + dup);\n if (wp.totalPaidOut != paidBefore) throw new Exception(\"dup mutated totalPaidOut\");\n\n // Budget exhausted after partial\n string r3 = wp.ProcessClaim(\"C3\", 30, 1, 365, 200, 50);\n if (r3 != \"BUDGET_EXHAUSTED\") throw new Exception(\"should be exhausted: \" + r3);\n\n // Expired claim\n string r4 = wp.ProcessClaim(\"C4\", 400, 1, 365, 100, 10);\n if (r4 != \"EXPIRED\") throw new Exception(\"should be expired: \" + r4);\n if (!wp.auditLog.Exists(l =\u003e l == \"EXPIRED:C4\")) throw new Exception(\"no expired log\");\n\n // Under deductible\n var wp2 = new WarrantyProcessor(1000);\n string r5 = wp2.ProcessClaim(\"C5\", 10, 1, 365, 30, 50);\n if (r5 != \"UNDER_DEDUCTIBLE\") throw new Exception(\"should be under deductible: \" + r5);\n if (wp2.totalPaidOut != 0) throw new Exception(\"under deductible should not pay\");\n\n // Boundary: claimDay == warrantyStart and warrantyEnd are both valid\n string r6 = wp2.ProcessClaim(\"C6\", 1, 1, 365, 100, 10);\n if (r6 != \"APPROVED:90\") throw new Exception(\"boundary start: \" + r6);\n string r7 = wp2.ProcessClaim(\"C7\", 365, 1, 365, 100, 10);\n if (r7 != \"APPROVED:90\") throw new Exception(\"boundary end: \" + r7);\n","category":"code_purpose_understanding"} {"id":"34","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass DividendDistributor\n{\n Dictionary\u003cstring, List\u003cstring\u003e\u003e distributions = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n List\u003cstring\u003e ledger = new List\u003cstring\u003e();\n int totalDistributed = 0;\n\n // Distribute dividends to shareholders.\n // Rules:\n // 1. distId idempotent: return cached result list, no mutation.\n // 2. Filter shareholders: only those with purchaseDay \u003c exDate (strict less-than) are eligible.\n // 3. Sort eligible by priority ascending, then by name ascending for ties.\n // 4. For each eligible shareholder:\n // a. grossAmount = shares * dividendPerShare.\n // b. Withholding: if grossAmount \u003e 1000, withheld = grossAmount * 30 / 100.\n // If grossAmount \u003e 500, withheld = grossAmount * 20 / 100.\n // Else withheld = grossAmount * 10 / 100. (Use integer division throughout.)\n // c. netAmount = grossAmount - withheld.\n // d. If totalDistributed + netAmount \u003e fundPool, skip this shareholder.\n // Log \"SKIP:\u003cdistId\u003e:\u003cname\u003e:INSUFFICIENT\".\n // e. Otherwise: totalDistributed += netAmount.\n // Log \"PAY:\u003cdistId\u003e:\u003cname\u003e:\u003cnetAmount\u003e\".\n // 5. Return list of paid names. Cache result.\n List\u003cstring\u003e Distribute(string distId, int exDate, int dividendPerShare, int fundPool,\n List\u003c(string name, int shares, int purchaseDay, int priority)\u003e shareholders)\n {\n","golden_completion":" if (distributions.ContainsKey(distId)) return new List\u003cstring\u003e(distributions[distId]);\n var eligible = shareholders\n .Where(s =\u003e s.purchaseDay \u003c exDate)\n .OrderBy(s =\u003e s.priority).ThenBy(s =\u003e s.name).ToList();\n var paid = new List\u003cstring\u003e();\n foreach (var s in eligible)\n {\n int gross = s.shares * dividendPerShare;\n int withheld;\n if (gross \u003e 1000) withheld = gross * 30 / 100;\n else if (gross \u003e 500) withheld = gross * 20 / 100;\n else withheld = gross * 10 / 100;\n int net = gross - withheld;\n if (totalDistributed + net \u003e fundPool)\n {\n ledger.Add(\"SKIP:\" + distId + \":\" + s.name + \":INSUFFICIENT\");\n continue;\n }\n totalDistributed += net;\n ledger.Add(\"PAY:\" + distId + \":\" + s.name + \":\" + net);\n paid.Add(s.name);\n }\n distributions[distId] = new List\u003cstring\u003e(paid);\n return new List\u003cstring\u003e(paid);\n","suffix":" }\n\n static void Main()\n {\n var dd = new DividendDistributor();\n var holders = new List\u003c(string, int, int, int)\u003e\n {\n (\"Alice\", 100, 5, 1), // gross=1000, withheld=200 (\u003e500 tier), net=800\n (\"Bob\", 200, 3, 2), // gross=2000, withheld=600 (\u003e1000 tier), net=1400\n (\"Carol\", 50, 15, 1), // purchaseDay=15 \u003e= exDate=10 =\u003e ineligible\n };\n var r1 = dd.Distribute(\"D1\", 10, 10, 5000, holders);\n if (r1.Count != 2 || r1[0] != \"Alice\" || r1[1] != \"Bob\") throw new Exception(\"r1: \" + string.Join(\",\", r1));\n if (dd.totalDistributed != 2200) throw new Exception(\"total: \" + dd.totalDistributed);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n int distBefore = dd.totalDistributed;\n var dup = dd.Distribute(\"D1\", 99, 99, 99999, new List\u003c(string,int,int,int)\u003e());\n if (dup.Count != 2 || dup[0] != \"Alice\") throw new Exception(\"idempotent fail\");\n if (dd.totalDistributed != distBefore) throw new Exception(\"dup mutated total\");\n\n // Fund pool exhaustion with skip\n var holders2 = new List\u003c(string, int, int, int)\u003e\n {\n (\"Dan\", 50, 1, 1), // gross=500, withheld=50 (\u003c=500 tier), net=450\n (\"Eve\", 200, 1, 1), // gross=2000, withheld=600, net=1400 =\u003e 2200+450+1400=4050\u003e5000? no, 2200+450=2650, +1400=4050\u003c=5000 ok\n (\"Frank\", 200, 1, 2), // gross=2000, net=1400 =\u003e 4050+1400=5450\u003e5000 =\u003e SKIP\n };\n var r2 = dd.Distribute(\"D2\", 10, 10, 5000, holders2);\n if (!r2.Contains(\"Dan\") || !r2.Contains(\"Eve\")) throw new Exception(\"D2 paid: \" + string.Join(\",\", r2));\n if (r2.Contains(\"Frank\")) throw new Exception(\"Frank should be skipped\");\n if (!dd.ledger.Exists(l =\u003e l == \"SKIP:D2:Frank:INSUFFICIENT\")) throw new Exception(\"no skip log\");\n\n // Priority and name tie-breaking: same priority, alphabetical\n var dd2 = new DividendDistributor();\n var holders3 = new List\u003c(string, int, int, int)\u003e\n {\n (\"Zara\", 10, 1, 1), // gross=100, withheld=10, net=90\n (\"Amy\", 10, 1, 1), // same priority =\u003e Amy before Zara alphabetically\n };\n var r3 = dd2.Distribute(\"D3\", 5, 10, 500, holders3);\n if (r3[0] != \"Amy\" || r3[1] != \"Zara\") throw new Exception(\"sort order: \" + string.Join(\",\", r3));\n\n // Ex-date boundary: purchaseDay == exDate is NOT eligible (strict \u003c)\n var dd3 = new DividendDistributor();\n var holders4 = new List\u003c(string, int, int, int)\u003e\n {\n (\"Exact\", 100, 10, 1), // purchaseDay=10, exDate=10 =\u003e NOT eligible\n };\n var r4 = dd3.Distribute(\"D4\", 10, 10, 5000, holders4);\n if (r4.Count != 0) throw new Exception(\"exact ex-date should be ineligible\");\n\n // Withholding tier boundary: gross exactly 500 =\u003e 10% tier, exactly 1000 =\u003e 20% tier\n var dd4 = new DividendDistributor();\n var holders5 = new List\u003c(string, int, int, int)\u003e\n {\n (\"Low\", 50, 1, 1), // gross=500, withheld=500*10/100=50, net=450\n (\"Mid\", 100, 1, 2), // gross=1000, withheld=1000*20/100=200, net=800\n };\n var r5 = dd4.Distribute(\"D5\", 5, 10, 5000, holders5);\n if (dd4.totalDistributed != 1250) throw new Exception(\"tier boundaries: \" + dd4.totalDistributed);\n","category":"code_purpose_understanding"} {"id":"35","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass FoodSafetyInspector\n{\n Dictionary\u003cstring, string\u003e inspectionResults = new Dictionary\u003cstring, string\u003e();\n List\u003cstring\u003e violations = new List\u003cstring\u003e();\n List\u003cstring\u003e corrective = new List\u003cstring\u003e();\n\n // Inspect a food storage unit.\n // Rules:\n // 1. inspectionId idempotent: return cached result, no mutation.\n // 2. dangerZone: temp \u003e 4 AND temp \u003c 60 (Celsius).\n // 3. If in danger zone AND holdingHours \u003e 4: CRITICAL violation.\n // Log violation \"CRITICAL:\u003cinspectionId\u003e:\u003cunitName\u003e\".\n // Log corrective \"DISPOSE:\u003cinspectionId\u003e:\u003cunitName\u003e\".\n // Result \"CRITICAL\".\n // 4. If in danger zone AND holdingHours \u003e 2 (but \u003c= 4): WARNING.\n // Log violation \"WARNING:\u003cinspectionId\u003e:\u003cunitName\u003e\".\n // Log corrective \"RECHILL:\u003cinspectionId\u003e:\u003cunitName\u003e\".\n // Result \"WARNING\".\n // 5. If in danger zone AND holdingHours \u003c= 2: MONITOR.\n // Log violation \"MONITOR:\u003cinspectionId\u003e:\u003cunitName\u003e\".\n // No corrective action. Result \"MONITOR\".\n // 6. If NOT in danger zone: PASS. No logs. Result \"PASS\".\n // 7. Cache result.\n string Inspect(string inspectionId, string unitName, int temp, int holdingHours)\n {\n","golden_completion":" if (inspectionResults.ContainsKey(inspectionId)) return inspectionResults[inspectionId];\n bool inDangerZone = temp \u003e 4 \u0026\u0026 temp \u003c 60;\n string result;\n if (!inDangerZone) { result = \"PASS\"; }\n else if (holdingHours \u003e 4)\n {\n violations.Add(\"CRITICAL:\" + inspectionId + \":\" + unitName);\n corrective.Add(\"DISPOSE:\" + inspectionId + \":\" + unitName);\n result = \"CRITICAL\";\n }\n else if (holdingHours \u003e 2)\n {\n violations.Add(\"WARNING:\" + inspectionId + \":\" + unitName);\n corrective.Add(\"RECHILL:\" + inspectionId + \":\" + unitName);\n result = \"WARNING\";\n }\n else\n {\n violations.Add(\"MONITOR:\" + inspectionId + \":\" + unitName);\n result = \"MONITOR\";\n }\n inspectionResults[inspectionId] = result;\n return result;\n","suffix":" }\n\n static void Main()\n {\n var fi = new FoodSafetyInspector();\n // temp=10 (in danger zone 4\u003c10\u003c60), holding=5 =\u003e CRITICAL\n string r1 = fi.Inspect(\"I1\", \"Fridge_A\", 10, 5);\n if (r1 != \"CRITICAL\") throw new Exception(\"r1: \" + r1);\n if (!fi.corrective.Contains(\"DISPOSE:I1:Fridge_A\")) throw new Exception(\"no dispose\");\n\n // temp=3 (not in danger zone, \u003c=4) =\u003e PASS\n string r2 = fi.Inspect(\"I2\", \"Fridge_B\", 3, 10);\n if (r2 != \"PASS\") throw new Exception(\"r2: \" + r2);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n string dup = fi.Inspect(\"I1\", \"CHANGED\", 99, 99);\n if (dup != \"CRITICAL\") throw new Exception(\"idempotent: \" + dup);\n int vBefore = fi.violations.Count;\n fi.Inspect(\"I2\", \"X\", 0, 0);\n if (fi.violations.Count != vBefore) throw new Exception(\"dup added violation\");\n\n // WARNING: danger zone, holdingHours=3 (\u003e2, \u003c=4)\n string r3 = fi.Inspect(\"I3\", \"Unit_C\", 30, 3);\n if (r3 != \"WARNING\") throw new Exception(\"warning: \" + r3);\n if (!fi.corrective.Contains(\"RECHILL:I3:Unit_C\")) throw new Exception(\"no rechill\");\n\n // MONITOR: danger zone, holdingHours=2 (\u003c=2)\n string r4 = fi.Inspect(\"I4\", \"Unit_D\", 50, 2);\n if (r4 != \"MONITOR\") throw new Exception(\"monitor: \" + r4);\n if (fi.corrective.Exists(c =\u003e c.Contains(\"I4\"))) throw new Exception(\"monitor should have no corrective\");\n\n // Boundary: temp=4 is NOT in danger zone (\u003e4 required, not \u003e=)\n string r5 = fi.Inspect(\"I5\", \"Unit_E\", 4, 10);\n if (r5 != \"PASS\") throw new Exception(\"temp=4 boundary: \" + r5);\n\n // Boundary: temp=60 is NOT in danger zone (\u003c60 required, not \u003c=)\n string r6 = fi.Inspect(\"I6\", \"Unit_F\", 60, 10);\n if (r6 != \"PASS\") throw new Exception(\"temp=60 boundary: \" + r6);\n\n // Boundary: temp=5 IS in danger zone, holdingHours=0 =\u003e MONITOR\n string r7 = fi.Inspect(\"I7\", \"Unit_G\", 5, 0);\n if (r7 != \"MONITOR\") throw new Exception(\"temp=5 boundary: \" + r7);\n","category":"code_purpose_understanding"} {"id":"36","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass ParkingGarage\n{\n Dictionary\u003cstring, int\u003e activeTickets = new Dictionary\u003cstring, int\u003e();\n Dictionary\u003cstring, int\u003e exitRecords = new Dictionary\u003cstring, int\u003e();\n HashSet\u003cstring\u003e monthlyPasses = new HashSet\u003cstring\u003e();\n HashSet\u003cstring\u003e validatedTickets = new HashSet\u003cstring\u003e();\n List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n int hourlyRate;\n int dailyMax;\n int revenue = 0;\n\n public ParkingGarage(int hourlyRate, int dailyMax)\n {\n this.hourlyRate = hourlyRate;\n this.dailyMax = dailyMax;\n }\n\n // Process vehicle exit.\n // Rules:\n // 1. ticketId idempotent: if in exitRecords, return cached charge, no mutation.\n // 2. If ticketId not in activeTickets, return -1 (unknown ticket).\n // 3. If plate is in monthlyPasses, charge = 0. Log \"MONTHLY:\u003cticketId\u003e:\u003cplate\u003e\".\n // 4. Otherwise: durationHours = (exitTime - entryTime + 59) / 60 (ceiling division by 60, integer).\n // rawCharge = durationHours * hourlyRate. charge = min(rawCharge, dailyMax).\n // 5. If ticketId is in validatedTickets, discount = charge / 2 (integer division).\n // charge = charge - discount.\n // 6. revenue += charge. Remove from activeTickets.\n // 7. Cache in exitRecords. Log \"EXIT:\u003cticketId\u003e:\u003cplate\u003e:\u003ccharge\u003e\".\n // 8. Return charge.\n int ProcessExit(string ticketId, string plate, int exitTime)\n {\n","golden_completion":" if (exitRecords.ContainsKey(ticketId)) return exitRecords[ticketId];\n if (!activeTickets.ContainsKey(ticketId)) return -1;\n int entryTime = activeTickets[ticketId];\n if (monthlyPasses.Contains(plate))\n {\n exitRecords[ticketId] = 0;\n activeTickets.Remove(ticketId);\n auditLog.Add(\"MONTHLY:\" + ticketId + \":\" + plate);\n return 0;\n }\n int durationHours = (exitTime - entryTime + 59) / 60;\n int rawCharge = durationHours * hourlyRate;\n int charge = Math.Min(rawCharge, dailyMax);\n if (validatedTickets.Contains(ticketId))\n {\n int discount = charge / 2;\n charge = charge - discount;\n }\n revenue += charge;\n activeTickets.Remove(ticketId);\n exitRecords[ticketId] = charge;\n auditLog.Add(\"EXIT:\" + ticketId + \":\" + plate + \":\" + charge);\n return charge;\n","suffix":" }\n\n static void Main()\n {\n var pg = new ParkingGarage(5, 30);\n pg.activeTickets[\"T1\"] = 0; // entered at time 0\n pg.activeTickets[\"T2\"] = 0;\n\n // T1 exits at 180 min =\u003e ceil(180/60)=3 hours =\u003e 15, no validation =\u003e 15\n int c1 = pg.ProcessExit(\"T1\", \"ABC123\", 180);\n if (c1 != 15) throw new Exception(\"c1: \" + c1);\n\n // T2 validated, exits at 480 min =\u003e ceil(480/60)=8 hrs =\u003e 40 capped to 30 =\u003e 30/2=15\n pg.validatedTickets.Add(\"T2\");\n int c2 = pg.ProcessExit(\"T2\", \"DEF456\", 480);\n if (c2 != 15) throw new Exception(\"c2: \" + c2);\n if (pg.revenue != 30) throw new Exception(\"revenue: \" + pg.revenue);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n int revBefore = pg.revenue;\n int dup = pg.ProcessExit(\"T1\", \"XXX\", 9999);\n if (dup != 15) throw new Exception(\"idempotent: \" + dup);\n if (pg.revenue != revBefore) throw new Exception(\"dup mutated revenue\");\n\n // Unknown ticket\n int unknown = pg.ProcessExit(\"T999\", \"ZZZ\", 100);\n if (unknown != -1) throw new Exception(\"unknown should be -1\");\n\n // Monthly pass: free\n var pg2 = new ParkingGarage(10, 50);\n pg2.activeTickets[\"T3\"] = 0;\n pg2.monthlyPasses.Add(\"MONTHLY1\");\n int c3 = pg2.ProcessExit(\"T3\", \"MONTHLY1\", 600);\n if (c3 != 0) throw new Exception(\"monthly should be free: \" + c3);\n if (pg2.revenue != 0) throw new Exception(\"monthly should not add revenue\");\n if (!pg2.auditLog.Exists(l =\u003e l.StartsWith(\"MONTHLY:T3:\"))) throw new Exception(\"no monthly log\");\n\n // Ceiling division: 61 minutes =\u003e ceil(61/60) = 2 hours\n var pg3 = new ParkingGarage(5, 30);\n pg3.activeTickets[\"T4\"] = 0;\n int c4 = pg3.ProcessExit(\"T4\", \"P1\", 61);\n if (c4 != 10) throw new Exception(\"ceiling 61min: \" + c4);\n\n // Exact hour: 60 minutes =\u003e ceil(60/60) = 1 hour\n pg3.activeTickets[\"T5\"] = 0;\n int c5 = pg3.ProcessExit(\"T5\", \"P2\", 60);\n if (c5 != 5) throw new Exception(\"exact 60min: \" + c5);\n\n // 1 minute =\u003e ceil(1/60) = 1 hour\n pg3.activeTickets[\"T6\"] = 0;\n int c6 = pg3.ProcessExit(\"T6\", \"P3\", 1);\n if (c6 != 5) throw new Exception(\"1min: \" + c6);\n\n // Validated + daily cap: 10hrs * 5 = 50 capped to 30, validated =\u003e 15\n pg3.activeTickets[\"T7\"] = 0;\n pg3.validatedTickets.Add(\"T7\");\n int c7 = pg3.ProcessExit(\"T7\", \"P4\", 600);\n if (c7 != 15) throw new Exception(\"validated+cap: \" + c7);\n","category":"code_purpose_understanding"} {"id":"37","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass ClinicScheduler\n{\n Dictionary\u003cstring, string\u003e bookedAppts = new Dictionary\u003cstring, string\u003e();\n Dictionary\u003cstring, List\u003cint\u003e\u003e providerSlots = new Dictionary\u003cstring, List\u003cint\u003e\u003e();\n HashSet\u003cstring\u003e verifiedInsurance = new HashSet\u003cstring\u003e();\n List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n int collectedCopay = 0;\n\n // Book an appointment.\n // Rules:\n // 1. apptId idempotent: return cached result, no mutation.\n // 2. If provider not in providerSlots, result \"NO_PROVIDER\". Log \"REJECT:\u003capptId\u003e:NO_PROVIDER\".\n // 3. If slotTime not in provider\u0027s available slots, result \"NO_SLOT\".\n // Log \"REJECT:\u003capptId\u003e:NO_SLOT\".\n // 4. If patient\u0027s insuranceId not in verifiedInsurance, result \"UNVERIFIED\".\n // Log \"REJECT:\u003capptId\u003e:UNVERIFIED:\u003cinsuranceId\u003e\".\n // 5. copayDue: if isSpecialist, copay = 50; else copay = 25.\n // If copayPaid \u003c copayDue, result \"COPAY_SHORT:\u003ccopayDue\u003e\".\n // Log \"REJECT:\u003capptId\u003e:COPAY_SHORT\". Overpayment is accepted (no refund).\n // 6. Book: remove slotTime from provider\u0027s slots. collectedCopay += copayDue (not copayPaid).\n // Result \"BOOKED:\u003cprovider\u003e:\u003cslotTime\u003e\".\n // Log \"BOOK:\u003capptId\u003e:\u003cpatient\u003e:\u003cprovider\u003e:\u003cslotTime\u003e:\u003ccopayDue\u003e\".\n // 7. Cache result.\n string Book(string apptId, string patient, string provider, int slotTime,\n string insuranceId, int copayPaid, bool isSpecialist)\n {\n","golden_completion":" if (bookedAppts.ContainsKey(apptId)) return bookedAppts[apptId];\n string res;\n if (!providerSlots.ContainsKey(provider)) {\n res = \"NO_PROVIDER\"; auditLog.Add(\"REJECT:\" + apptId + \":NO_PROVIDER\");\n } else if (!providerSlots[provider].Contains(slotTime)) {\n res = \"NO_SLOT\"; auditLog.Add(\"REJECT:\" + apptId + \":NO_SLOT\");\n } else if (!verifiedInsurance.Contains(insuranceId)) {\n res = \"UNVERIFIED\"; auditLog.Add(\"REJECT:\" + apptId + \":UNVERIFIED:\" + insuranceId);\n } else {\n int copayDue = isSpecialist ? 50 : 25;\n if (copayPaid \u003c copayDue) {\n res = \"COPAY_SHORT:\" + copayDue; auditLog.Add(\"REJECT:\" + apptId + \":COPAY_SHORT\");\n } else {\n providerSlots[provider].Remove(slotTime);\n collectedCopay += copayDue;\n res = \"BOOKED:\" + provider + \":\" + slotTime;\n auditLog.Add(\"BOOK:\" + apptId + \":\" + patient + \":\" + provider + \":\" + slotTime + \":\" + copayDue);\n }\n }\n bookedAppts[apptId] = res;\n return res;\n","suffix":" }\n\n static void Main()\n {\n var cs = new ClinicScheduler();\n cs.providerSlots[\"DrSmith\"] = new List\u003cint\u003e { 900, 1000, 1100 };\n cs.verifiedInsurance.Add(\"INS001\");\n\n // Book specialist appointment\n string r1 = cs.Book(\"A1\", \"Alice\", \"DrSmith\", 900, \"INS001\", 50, true);\n if (r1 != \"BOOKED:DrSmith:900\") throw new Exception(\"r1: \" + r1);\n if (cs.collectedCopay != 50) throw new Exception(\"copay: \" + cs.collectedCopay);\n if (cs.providerSlots[\"DrSmith\"].Contains(900)) throw new Exception(\"slot not removed\");\n\n // Non-specialist, overpay is fine\n string r2 = cs.Book(\"A2\", \"Bob\", \"DrSmith\", 1000, \"INS001\", 100, false);\n if (r2 != \"BOOKED:DrSmith:1000\") throw new Exception(\"r2: \" + r2);\n if (cs.collectedCopay != 75) throw new Exception(\"copay should be 75 (50+25), got \" + cs.collectedCopay);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n int copayBefore = cs.collectedCopay;\n string dup = cs.Book(\"A1\", \"X\", \"X\", 0, \"X\", 0, false);\n if (dup != \"BOOKED:DrSmith:900\") throw new Exception(\"idempotent: \" + dup);\n if (cs.collectedCopay != copayBefore) throw new Exception(\"dup mutated copay\");\n\n // Slot already taken (double-booking prevention)\n string r3 = cs.Book(\"A3\", \"Carol\", \"DrSmith\", 900, \"INS001\", 50, true);\n if (r3 != \"NO_SLOT\") throw new Exception(\"double book: \" + r3);\n\n // No provider\n string r4 = cs.Book(\"A4\", \"Dan\", \"DrJones\", 900, \"INS001\", 50, true);\n if (r4 != \"NO_PROVIDER\") throw new Exception(\"no provider: \" + r4);\n\n // Unverified insurance\n string r5 = cs.Book(\"A5\", \"Eve\", \"DrSmith\", 1100, \"FAKE\", 50, true);\n if (r5 != \"UNVERIFIED\") throw new Exception(\"unverified: \" + r5);\n if (cs.providerSlots[\"DrSmith\"].Contains(1100) == false) throw new Exception(\"slot should NOT be removed for unverified\");\n\n // Copay short for specialist\n cs.verifiedInsurance.Add(\"INS002\");\n string r6 = cs.Book(\"A6\", \"Frank\", \"DrSmith\", 1100, \"INS002\", 49, true);\n if (r6 != \"COPAY_SHORT:50\") throw new Exception(\"copay short: \" + r6);\n\n // Copay short for non-specialist (25 required)\n cs.providerSlots[\"DrSmith\"].Add(1200);\n string r7 = cs.Book(\"A7\", \"Grace\", \"DrSmith\", 1200, \"INS002\", 24, false);\n if (r7 != \"COPAY_SHORT:25\") throw new Exception(\"copay short non-specialist: \" + r7);\n\n // Successful after copay fix\n string r8 = cs.Book(\"A8\", \"Grace\", \"DrSmith\", 1200, \"INS002\", 25, false);\n if (r8 != \"BOOKED:DrSmith:1200\") throw new Exception(\"r8: \" + r8);\n\n // Validation order: provider checked before insurance\n string r9 = cs.Book(\"A9\", \"H\", \"MISSING\", 900, \"FAKE\", 0, false);\n if (r9 != \"NO_PROVIDER\") throw new Exception(\"validation order: \" + r9);\n","category":"code_purpose_understanding"} {"id":"38","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass LoyaltySystem\n{\n Dictionary\u003cstring, string\u003e redemptionResults = new Dictionary\u003cstring, string\u003e();\n int pointsBalance;\n List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n HashSet\u003cstring\u003e blackoutItems = new HashSet\u003cstring\u003e();\n\n public LoyaltySystem(int initialPoints) { pointsBalance = initialPoints; }\n\n // Redeem loyalty points for an item.\n // Rules:\n // 1. redemptionId idempotent: return cached result, no mutation.\n // 2. If itemName in blackoutItems, result \"BLACKOUT\". Log \"BLOCKED:\u003credemptionId\u003e:\u003citemName\u003e\".\n // 3. effectiveCost: baseCost adjusted by tier.\n // tier \"gold\" =\u003e effectiveCost = baseCost * 80 / 100.\n // tier \"silver\" =\u003e effectiveCost = baseCost * 90 / 100.\n // any other tier =\u003e effectiveCost = baseCost.\n // (Integer division throughout.)\n // 4. If effectiveCost \u003c= 0, result \"FREE\". pointsBalance unchanged.\n // Log \"FREE:\u003credemptionId\u003e:\u003citemName\u003e\".\n // 5. If pointsBalance \u003e= effectiveCost: full redemption.\n // pointsBalance -= effectiveCost. Result \"REDEEMED:\u003ceffectiveCost\u003e\".\n // Log \"REDEEM:\u003credemptionId\u003e:\u003citemName\u003e:\u003ceffectiveCost\u003e\".\n // 6. If pointsBalance \u003e 0 but \u003c effectiveCost: partial redemption.\n // used = pointsBalance. pointsBalance = 0. remaining = effectiveCost - used.\n // Result \"PARTIAL:\u003cused\u003e:\u003cremaining\u003e\".\n // Log \"PARTIAL:\u003credemptionId\u003e:\u003citemName\u003e:\u003cused\u003e/\u003ceffectiveCost\u003e\".\n // 7. If pointsBalance == 0: result \"NO_POINTS\".\n // Log \"NOPOINTS:\u003credemptionId\u003e\".\n // 8. Cache result.\n string Redeem(string redemptionId, string itemName, int baseCost, string tier)\n {\n","golden_completion":" if (redemptionResults.ContainsKey(redemptionId)) return redemptionResults[redemptionId];\n if (blackoutItems.Contains(itemName)) {\n auditLog.Add(\"BLOCKED:\" + redemptionId + \":\" + itemName);\n redemptionResults[redemptionId] = \"BLACKOUT\"; return \"BLACKOUT\";\n }\n int eCost = tier == \"gold\" ? baseCost * 80 / 100 : tier == \"silver\" ? baseCost * 90 / 100 : baseCost;\n if (eCost \u003c= 0) {\n auditLog.Add(\"FREE:\" + redemptionId + \":\" + itemName);\n redemptionResults[redemptionId] = \"FREE\"; return \"FREE\";\n }\n string result;\n if (pointsBalance \u003e= eCost) {\n pointsBalance -= eCost; result = \"REDEEMED:\" + eCost;\n auditLog.Add(\"REDEEM:\" + redemptionId + \":\" + itemName + \":\" + eCost);\n } else if (pointsBalance \u003e 0) {\n int used = pointsBalance; pointsBalance = 0;\n result = \"PARTIAL:\" + used + \":\" + (eCost - used);\n auditLog.Add(\"PARTIAL:\" + redemptionId + \":\" + itemName + \":\" + used + \"/\" + eCost);\n } else {\n result = \"NO_POINTS\"; auditLog.Add(\"NOPOINTS:\" + redemptionId);\n }\n redemptionResults[redemptionId] = result;\n return result;\n","suffix":" }\n\n static void Main()\n {\n var ls = new LoyaltySystem(1000);\n // gold tier: 500 * 80/100 = 400\n string r1 = ls.Redeem(\"R1\", \"Widget\", 500, \"gold\");\n if (r1 != \"REDEEMED:400\") throw new Exception(\"r1: \" + r1);\n if (ls.pointsBalance != 600) throw new Exception(\"balance: \" + ls.pointsBalance);\n\n // silver tier: 800 * 90/100 = 720, balance=600 \u003c 720 =\u003e partial\n string r2 = ls.Redeem(\"R2\", \"Gadget\", 800, \"silver\");\n if (!r2.StartsWith(\"PARTIAL:\")) throw new Exception(\"r2: \" + r2);\n if (ls.pointsBalance != 0) throw new Exception(\"balance should be 0\");\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n int balBefore = ls.pointsBalance;\n string dup = ls.Redeem(\"R1\", \"X\", 999, \"gold\");\n if (dup != \"REDEEMED:400\") throw new Exception(\"idempotent: \" + dup);\n if (ls.pointsBalance != balBefore) throw new Exception(\"dup mutated balance\");\n\n // No points\n string r3 = ls.Redeem(\"R3\", \"Thing\", 100, \"gold\");\n if (r3 != \"NO_POINTS\") throw new Exception(\"no points: \" + r3);\n\n // Blackout\n var ls2 = new LoyaltySystem(5000);\n ls2.blackoutItems.Add(\"LimitedEdition\");\n string r4 = ls2.Redeem(\"R4\", \"LimitedEdition\", 100, \"gold\");\n if (r4 != \"BLACKOUT\") throw new Exception(\"blackout: \" + r4);\n if (ls2.pointsBalance != 5000) throw new Exception(\"blackout should not deduct\");\n\n // Free item (baseCost=0)\n string r5 = ls2.Redeem(\"R5\", \"Freebie\", 0, \"gold\");\n if (r5 != \"FREE\") throw new Exception(\"free: \" + r5);\n if (ls2.pointsBalance != 5000) throw new Exception(\"free should not deduct\");\n\n // Tier multiplier integer division: gold 99 * 80 / 100 = 79\n string r6 = ls2.Redeem(\"R6\", \"SmallItem\", 99, \"gold\");\n if (r6 != \"REDEEMED:79\") throw new Exception(\"gold 99: \" + r6);\n\n // No tier: full price\n string r7 = ls2.Redeem(\"R7\", \"PlainItem\", 100, \"bronze\");\n if (r7 != \"REDEEMED:100\") throw new Exception(\"no tier: \" + r7);\n\n // Partial result content check: R2 used 600, remaining = 720 - 600 = 120\n if (!dup.StartsWith(\"REDEEMED:\")) throw new Exception(\"dup format\");\n string r2check = ls.Redeem(\"R2\", \"X\", 0, \"x\");\n if (r2check != \"PARTIAL:600:120\") throw new Exception(\"partial content: \" + r2check);\n","category":"code_purpose_understanding"} {"id":"39","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass UtilityBilling\n{\n Dictionary\u003cstring, string\u003e billingResults = new Dictionary\u003cstring, string\u003e();\n List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n int cumulativeCharge = 0;\n\n // Calculate utility bill for a meter reading.\n // Rules:\n // 1. billId idempotent: return cached result, no mutation.\n // 2. usage = currentReading - previousReading. If usage \u003c 0, usage = 0 (meter rollover protection).\n // 3. If isEstimated, usage = usage * 90 / 100 (estimated readings are discounted, integer division).\n // 4. Tiered rate (applied to usage):\n // First 100 units: rate1 per unit.\n // Next 200 units (101-300): rate2 per unit.\n // Above 300: rate3 per unit.\n // 5. If isPeak, add surcharge = tieredCharge * 15 / 100 (integer division).\n // 6. totalCharge = tieredCharge + surcharge.\n // 7. If budgetAmount \u003e 0: diff = totalCharge - budgetAmount.\n // If diff \u003e 0, log \"OVER:\u003cbillId\u003e:\u003cdiff\u003e\". If diff \u003c 0, log \"UNDER:\u003cbillId\u003e:\u003c-diff\u003e\".\n // 8. cumulativeCharge += totalCharge. Cache result \"BILLED:\u003ctotalCharge\u003e:\u003cusage\u003e\".\n // Log \"BILL:\u003cbillId\u003e:\u003ctotalCharge\u003e\".\n string CalculateBill(string billId, int previousReading, int currentReading,\n bool isEstimated, bool isPeak, int rate1, int rate2, int rate3,\n int budgetAmount)\n {\n","golden_completion":" if (billingResults.ContainsKey(billId)) return billingResults[billId];\n int usage = currentReading - previousReading;\n if (usage \u003c 0) usage = 0;\n if (isEstimated) usage = usage * 90 / 100;\n int tieredCharge = 0;\n if (usage \u003c= 100) tieredCharge = usage * rate1;\n else if (usage \u003c= 300) tieredCharge = 100 * rate1 + (usage - 100) * rate2;\n else tieredCharge = 100 * rate1 + 200 * rate2 + (usage - 300) * rate3;\n int surcharge = 0;\n if (isPeak) surcharge = tieredCharge * 15 / 100;\n int totalCharge = tieredCharge + surcharge;\n if (budgetAmount \u003e 0)\n {\n int diff = totalCharge - budgetAmount;\n if (diff \u003e 0) auditLog.Add(\"OVER:\" + billId + \":\" + diff);\n else if (diff \u003c 0) auditLog.Add(\"UNDER:\" + billId + \":\" + (-diff));\n }\n cumulativeCharge += totalCharge;\n string result = \"BILLED:\" + totalCharge + \":\" + usage;\n auditLog.Add(\"BILL:\" + billId + \":\" + totalCharge);\n billingResults[billId] = result;\n return result;\n","suffix":" }\n\n static void Main()\n {\n var ub = new UtilityBilling();\n // usage=250 (500-250), not estimated, not peak\n // tiered: 100*2 + 150*3 = 200+450 = 650, no surcharge\n string r1 = ub.CalculateBill(\"B1\", 250, 500, false, false, 2, 3, 5, 0);\n if (r1 != \"BILLED:650:250\") throw new Exception(\"r1: \" + r1);\n\n // usage=400, peak: tiered=100*2+200*3+100*5=200+600+500=1300, surcharge=195, total=1495\n string r2 = ub.CalculateBill(\"B2\", 100, 500, false, true, 2, 3, 5, 1000);\n if (r2 != \"BILLED:1495:400\") throw new Exception(\"r2: \" + r2);\n if (ub.cumulativeCharge != 2145) throw new Exception(\"cumulative: \" + ub.cumulativeCharge);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n int cumBefore = ub.cumulativeCharge;\n string dup = ub.CalculateBill(\"B1\", 0, 0, false, false, 0, 0, 0, 0);\n if (dup != \"BILLED:650:250\") throw new Exception(\"idempotent: \" + dup);\n if (ub.cumulativeCharge != cumBefore) throw new Exception(\"dup mutated cumulative\");\n\n // Estimated reading discount: usage=200, *90/100=180\n // tiered: 100*2+80*3=200+240=440, no peak\n string r3 = ub.CalculateBill(\"B3\", 300, 500, true, false, 2, 3, 5, 0);\n if (r3 != \"BILLED:440:180\") throw new Exception(\"estimated: \" + r3);\n\n // Meter rollover: current \u003c previous =\u003e usage=0\n string r4 = ub.CalculateBill(\"B4\", 500, 100, false, false, 2, 3, 5, 0);\n if (r4 != \"BILLED:0:0\") throw new Exception(\"rollover: \" + r4);\n\n // Budget billing: over budget logged\n if (!ub.auditLog.Exists(l =\u003e l.StartsWith(\"OVER:B2:\"))) throw new Exception(\"no over log for B2\");\n\n // Budget billing: under budget\n var ub2 = new UtilityBilling();\n ub2.CalculateBill(\"B5\", 0, 50, false, false, 2, 3, 5, 200);\n // usage=50, tiered=50*2=100, no peak, budget=200, diff=-100 =\u003e UNDER\n if (!ub2.auditLog.Exists(l =\u003e l == \"UNDER:B5:100\")) throw new Exception(\"no under log\");\n\n // Budget billing: exact match (no log for diff==0)\n ub2.CalculateBill(\"B6\", 0, 50, false, false, 4, 3, 5, 200);\n // usage=50, tiered=50*4=200, total=200, budget=200, diff=0 =\u003e no log\n if (ub2.auditLog.Exists(l =\u003e l.StartsWith(\"OVER:B6:\") || l.StartsWith(\"UNDER:B6:\"))) throw new Exception(\"exact match should not log over/under\");\n\n // Estimated integer division: usage=111, *90/100=99 (not 100)\n var ub3 = new UtilityBilling();\n string r7 = ub3.CalculateBill(\"B7\", 0, 111, true, false, 1, 2, 3, 0);\n if (r7 != \"BILLED:99:99\") throw new Exception(\"estimated int div: \" + r7);\n","category":"code_purpose_understanding"} {"id":"40","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass ContractBilling\n{\n Dictionary\u003cstring, string\u003e invoiceResults = new Dictionary\u003cstring, string\u003e();\n List\u003cstring\u003e auditLog = new List\u003cstring\u003e();\n int totalBilled = 0;\n int totalRetained = 0;\n HashSet\u003cstring\u003e acceptedDeliverables = new HashSet\u003cstring\u003e();\n\n // Invoice a contract milestone.\n // Rules:\n // 1. invoiceId idempotent: return cached result, no mutation.\n // 2. If deliverableId not in acceptedDeliverables, result \"NOT_ACCEPTED\".\n // Log \"REJECT:\u003cinvoiceId\u003e:\u003cdeliverableId\u003e\".\n // 3. adjustedAmount = baseAmount + changeOrderAmount. If adjustedAmount \u003c= 0,\n // result \"ZERO_INVOICE\". Log \"ZERO:\u003cinvoiceId\u003e\".\n // 4. retentionAmount = adjustedAmount * retentionPct / 100 (integer division).\n // 5. billableAmount = adjustedAmount - retentionAmount.\n // 6. If totalBilled + billableAmount \u003e contractCeiling:\n // billableAmount = contractCeiling - totalBilled.\n // If billableAmount \u003c= 0, result \"CEILING_HIT\". Log \"CEILING:\u003cinvoiceId\u003e\".\n // Otherwise log \"CAPPED:\u003cinvoiceId\u003e:\u003cbillableAmount\u003e\".\n // 7. totalBilled += billableAmount. totalRetained += retentionAmount.\n // 8. Result \"INVOICED:\u003cbillableAmount\u003e:\u003cretentionAmount\u003e\".\n // Log \"INVOICE:\u003cinvoiceId\u003e:\u003cbillableAmount\u003e:\u003cretentionAmount\u003e\".\n // 9. Cache result.\n string Invoice(string invoiceId, string deliverableId, int baseAmount,\n int changeOrderAmount, int retentionPct, int contractCeiling)\n {\n","golden_completion":" if (invoiceResults.ContainsKey(invoiceId)) return invoiceResults[invoiceId];\n if (!acceptedDeliverables.Contains(deliverableId)) {\n auditLog.Add(\"REJECT:\" + invoiceId + \":\" + deliverableId);\n invoiceResults[invoiceId] = \"NOT_ACCEPTED\"; return \"NOT_ACCEPTED\";\n }\n int adj = baseAmount + changeOrderAmount;\n if (adj \u003c= 0) { auditLog.Add(\"ZERO:\" + invoiceId); invoiceResults[invoiceId] = \"ZERO_INVOICE\"; return \"ZERO_INVOICE\"; }\n int ret = adj * retentionPct / 100, bill = adj - ret;\n if (totalBilled + bill \u003e contractCeiling) {\n bill = contractCeiling - totalBilled;\n if (bill \u003c= 0) { auditLog.Add(\"CEILING:\" + invoiceId); invoiceResults[invoiceId] = \"CEILING_HIT\"; return \"CEILING_HIT\"; }\n auditLog.Add(\"CAPPED:\" + invoiceId + \":\" + bill);\n }\n totalBilled += bill; totalRetained += ret;\n string result = \"INVOICED:\" + bill + \":\" + ret;\n auditLog.Add(\"INVOICE:\" + invoiceId + \":\" + bill + \":\" + ret);\n invoiceResults[invoiceId] = result;\n return result;\n","suffix":" }\n\n static void Main()\n {\n var cb = new ContractBilling();\n cb.acceptedDeliverables.Add(\"D1\");\n cb.acceptedDeliverables.Add(\"D2\");\n\n // base=1000, change=200, adjusted=1200, retention=120(10%), billable=1080, ceiling=5000 ok\n string r1 = cb.Invoice(\"INV1\", \"D1\", 1000, 200, 10, 5000);\n if (r1 != \"INVOICED:1080:120\") throw new Exception(\"r1: \" + r1);\n if (cb.totalBilled != 1080) throw new Exception(\"billed: \" + cb.totalBilled);\n if (cb.totalRetained != 120) throw new Exception(\"retained: \" + cb.totalRetained);\n\n // Ceiling cap: billable=4500*90/100=4050 would make total=1080+4050=5130\u003e5000\n // capped: billable=5000-1080=3920\n string r2 = cb.Invoice(\"INV2\", \"D2\", 4500, 0, 10, 5000);\n if (!r2.StartsWith(\"INVOICED:3920:\")) throw new Exception(\"r2: \" + r2);\n int visibleOk = 1;\n }\n}\n","assertions":" if (visibleOk != 1) throw new Exception(\"visible failed\");\n // Idempotency\n int billedBefore = cb.totalBilled;\n string dup = cb.Invoice(\"INV1\", \"X\", 0, 0, 0, 0);\n if (dup != \"INVOICED:1080:120\") throw new Exception(\"idempotent: \" + dup);\n if (cb.totalBilled != billedBefore) throw new Exception(\"dup mutated totalBilled\");\n\n // Ceiling hit\n string r3 = cb.Invoice(\"INV3\", \"D1\", 1000, 0, 10, 5000);\n if (r3 != \"CEILING_HIT\") throw new Exception(\"ceiling hit: \" + r3);\n\n // Not accepted deliverable\n string r4 = cb.Invoice(\"INV4\", \"D99\", 1000, 0, 10, 5000);\n if (r4 != \"NOT_ACCEPTED\") throw new Exception(\"not accepted: \" + r4);\n if (!cb.auditLog.Exists(l =\u003e l == \"REJECT:INV4:D99\")) throw new Exception(\"no reject log\");\n\n // Zero invoice (negative change order)\n cb.acceptedDeliverables.Add(\"D3\");\n string r5 = cb.Invoice(\"INV5\", \"D3\", 100, -200, 10, 50000);\n if (r5 != \"ZERO_INVOICE\") throw new Exception(\"zero invoice: \" + r5);\n\n // Retention integer division: adjusted=99, retention=99*10/100=9, billable=90\n var cb2 = new ContractBilling();\n cb2.acceptedDeliverables.Add(\"D4\");\n string r6 = cb2.Invoice(\"INV6\", \"D4\", 99, 0, 10, 50000);\n if (r6 != \"INVOICED:90:9\") throw new Exception(\"retention int div: \" + r6);\n\n // Retention tracked separately: totalRetained includes all invoices\n cb2.acceptedDeliverables.Add(\"D5\");\n cb2.Invoice(\"INV7\", \"D5\", 200, 0, 10, 50000);\n // retention=20, totalRetained=9+20=29\n if (cb2.totalRetained != 29) throw new Exception(\"totalRetained: \" + cb2.totalRetained);\n\n // Change order can increase: base=100, change=900 =\u003e adjusted=1000, ret=100, billable=900\n cb2.acceptedDeliverables.Add(\"D6\");\n string r8 = cb2.Invoice(\"INV8\", \"D6\", 100, 900, 10, 50000);\n if (r8 != \"INVOICED:900:100\") throw new Exception(\"change order: \" + r8);\n\n // Capped log entry present\n if (!cb.auditLog.Exists(l =\u003e l.StartsWith(\"CAPPED:INV2:\"))) throw new Exception(\"no capped log\");\n","category":"code_purpose_understanding"} {"id":"41","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace ExpenseApp\n{\n public class ExpenseResult\n {\n public string Status { get; set; } // \"APPROVED\", \"DENIED\", \"PARTIAL\", \"DUPLICATE\"\n public double ApprovedAmount { get; set; }\n public double DeniedAmount { get; set; }\n public string Reason { get; set; }\n }\n\n public class ExpenseProcessor\n {\n public Dictionary\u003cstring, double\u003e CategoryLimits { get; set; }\n public Dictionary\u003cstring, double\u003e CategorySpent { get; set; }\n public double ReceiptRequiredThreshold { get; set; }\n public double TotalCap { get; set; }\n public double TotalApproved { get; set; }\n public HashSet\u003cstring\u003e UsedReceipts { get; set; }\n public List\u003cstring\u003e AuditLog { get; set; }\n public Dictionary\u003cstring, double\u003e ExchangeRates { get; set; }\n\n public ExpenseProcessor()\n {\n CategoryLimits = new Dictionary\u003cstring, double\u003e\n {\n { \"MEALS\", 75.0 }, { \"TRAVEL\", 500.0 }, { \"LODGING\", 200.0 }, { \"SUPPLIES\", 100.0 }\n };\n CategorySpent = new Dictionary\u003cstring, double\u003e\n {\n { \"MEALS\", 0 }, { \"TRAVEL\", 0 }, { \"LODGING\", 0 }, { \"SUPPLIES\", 0 }\n };\n ReceiptRequiredThreshold = 25.0;\n TotalCap = 1000.0;\n TotalApproved = 0;\n UsedReceipts = new HashSet\u003cstring\u003e();\n AuditLog = new List\u003cstring\u003e();\n ExchangeRates = new Dictionary\u003cstring, double\u003e\n {\n { \"USD\", 1.0 }, { \"EUR\", 1.08 }, { \"GBP\", 1.27 }, { \"JPY\", 0.0067 }\n };\n }\n\n // Submit an expense line.\n // Rules:\n // 1. receiptId must be non-empty for amounts \u003e= ReceiptRequiredThreshold (in USD).\n // Missing receipt -\u003e DENIED with reason \"NO_RECEIPT\".\n // 2. Duplicate receiptId -\u003e DUPLICATE, no mutation.\n // 3. Convert amount to USD: usd = amount * ExchangeRates[currency].\n // Unknown currency -\u003e DENIED with reason \"BAD_CURRENCY\".\n // 4. If category not in CategoryLimits -\u003e DENIED with reason \"BAD_CATEGORY\".\n // 5. categoryRemaining = CategoryLimits[cat] - CategorySpent[cat].\n // capRemaining = TotalCap - TotalApproved.\n // approved = min(usd, categoryRemaining, capRemaining). If approved \u003c= 0 -\u003e DENIED \"LIMIT_REACHED\".\n // 6. If approved \u003c usd -\u003e PARTIAL (partial approval). Otherwise APPROVED.\n // 7. Update CategorySpent, TotalApproved. Add receiptId to UsedReceipts (if non-empty).\n // 8. Log \"EXPENSE:\u003ccategory\u003e:\u003cstatus\u003e:\u003capproved\u003e\".\n public ExpenseResult SubmitExpense(string category, double amount, string currency,\n string receiptId)\n {\n","golden_completion":" if (!ExchangeRates.ContainsKey(currency))\n return new ExpenseResult { Status = \"DENIED\", ApprovedAmount = 0, DeniedAmount = amount, Reason = \"BAD_CURRENCY\" };\n double usd = Math.Round(amount * ExchangeRates[currency], 2);\n if (usd \u003e= ReceiptRequiredThreshold \u0026\u0026 string.IsNullOrEmpty(receiptId))\n { AuditLog.Add($\"EXPENSE:{category}:DENIED:0\");\n return new ExpenseResult { Status = \"DENIED\", ApprovedAmount = 0, DeniedAmount = usd, Reason = \"NO_RECEIPT\" }; }\n if (!string.IsNullOrEmpty(receiptId) \u0026\u0026 UsedReceipts.Contains(receiptId))\n return new ExpenseResult { Status = \"DUPLICATE\", ApprovedAmount = 0, DeniedAmount = 0, Reason = \"DUPLICATE_RECEIPT\" };\n if (!CategoryLimits.ContainsKey(category))\n return new ExpenseResult { Status = \"DENIED\", ApprovedAmount = 0, DeniedAmount = usd, Reason = \"BAD_CATEGORY\" };\n double catRemain = CategoryLimits[category] - CategorySpent[category];\n double capRemain = TotalCap - TotalApproved;\n double approved = Math.Min(usd, Math.Min(catRemain, capRemain));\n if (approved \u003c= 0)\n { AuditLog.Add($\"EXPENSE:{category}:DENIED:0\");\n return new ExpenseResult { Status = \"DENIED\", ApprovedAmount = 0, DeniedAmount = usd, Reason = \"LIMIT_REACHED\" }; }\n CategorySpent[category] += approved; TotalApproved += approved;\n if (!string.IsNullOrEmpty(receiptId)) UsedReceipts.Add(receiptId);\n string status = approved \u003c usd ? \"PARTIAL\" : \"APPROVED\";\n AuditLog.Add($\"EXPENSE:{category}:{status}:{approved}\");\n return new ExpenseResult { Status = status, ApprovedAmount = approved, DeniedAmount = usd - approved, Reason = \"\" };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var proc = new ExpenseProcessor();\n\n // Basic approval in USD\n var r1 = proc.SubmitExpense(\"MEALS\", 50.0, \"USD\", \"R001\");\n if (r1.Status != \"APPROVED\") throw new Exception(\"r1 status\");\n if (Math.Abs(r1.ApprovedAmount - 50.0) \u003e 0.01) throw new Exception(\"r1 amount\");\n if (Math.Abs(proc.CategorySpent[\"MEALS\"] - 50.0) \u003e 0.01) throw new Exception(\"r1 cat spent\");\n\n // EUR conversion: 20 EUR * 1.08 = 21.6 USD\n var r2 = proc.SubmitExpense(\"SUPPLIES\", 20.0, \"EUR\", \"R002\");\n if (r2.Status != \"APPROVED\") throw new Exception(\"r2 status\");\n if (Math.Abs(r2.ApprovedAmount - 21.6) \u003e 0.01) throw new Exception(\"r2 amount\");\n\n // Small amount without receipt (below threshold) should be OK\n var r3 = proc.SubmitExpense(\"MEALS\", 10.0, \"USD\", \"\");\n if (r3.Status != \"APPROVED\") throw new Exception(\"r3 status\");\n }\n }\n}\n","assertions":" // Duplicate receipt\n var dup = proc.SubmitExpense(\"TRAVEL\", 100.0, \"USD\", \"R001\");\n if (dup.Status != \"DUPLICATE\") throw new Exception(\"dup status: \" + dup.Status);\n if (Math.Abs(proc.TotalApproved - 81.6) \u003e 0.01) throw new Exception(\"dup mutated total: \" + proc.TotalApproved);\n\n // No receipt for large amount\n var nr = proc.SubmitExpense(\"TRAVEL\", 30.0, \"USD\", \"\");\n if (nr.Status != \"DENIED\" || nr.Reason != \"NO_RECEIPT\") throw new Exception(\"no receipt: \" + nr.Status + \" \" + nr.Reason);\n\n // Bad currency\n var bc = proc.SubmitExpense(\"TRAVEL\", 50.0, \"CHF\", \"R099\");\n if (bc.Status != \"DENIED\" || bc.Reason != \"BAD_CURRENCY\") throw new Exception(\"bad currency\");\n\n // Bad category\n var bcat = proc.SubmitExpense(\"ENTERTAINMENT\", 10.0, \"USD\", \"R100\");\n if (bcat.Status != \"DENIED\" || bcat.Reason != \"BAD_CATEGORY\") throw new Exception(\"bad cat\");\n\n // Category partial: MEALS has 75 limit, 60 spent, 15 remaining -\u003e partial for 20\n var partial = proc.SubmitExpense(\"MEALS\", 20.0, \"USD\", \"R003\");\n if (partial.Status != \"PARTIAL\") throw new Exception(\"partial: \" + partial.Status);\n if (Math.Abs(partial.ApprovedAmount - 15.0) \u003e 0.01) throw new Exception(\"partial amt: \" + partial.ApprovedAmount);\n","category":"code_purpose_understanding"} {"id":"42","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace BloodBank\n{\n public class BloodUnit\n {\n public string UnitId { get; set; }\n public string BloodType { get; set; } // \"O-\",\"O+\",\"A-\",\"A+\",\"B-\",\"B+\",\"AB-\",\"AB+\"\n public DateTime ExpirationDate { get; set; }\n public bool CrossmatchDone { get; set; }\n }\n\n public class IssueResult\n {\n public string Status { get; set; } // \"ISSUED\", \"EXPIRED_SKIP\", \"INCOMPATIBLE\", \"NO_STOCK\", \"DUPLICATE\"\n public string UnitId { get; set; }\n public string BloodType { get; set; }\n }\n\n public class BloodBankProcessor\n {\n // Compatibility: recipient type -\u003e set of compatible donor types\n public static readonly Dictionary\u003cstring, HashSet\u003cstring\u003e\u003e Compatibility = new Dictionary\u003cstring, HashSet\u003cstring\u003e\u003e\n {\n { \"O-\", new HashSet\u003cstring\u003e{ \"O-\" } },\n { \"O+\", new HashSet\u003cstring\u003e{ \"O-\", \"O+\" } },\n { \"A-\", new HashSet\u003cstring\u003e{ \"O-\", \"A-\" } },\n { \"A+\", new HashSet\u003cstring\u003e{ \"O-\", \"O+\", \"A-\", \"A+\" } },\n { \"B-\", new HashSet\u003cstring\u003e{ \"O-\", \"B-\" } },\n { \"B+\", new HashSet\u003cstring\u003e{ \"O-\", \"O+\", \"B-\", \"B+\" } },\n { \"AB-\", new HashSet\u003cstring\u003e{ \"O-\", \"A-\", \"B-\", \"AB-\" } },\n { \"AB+\", new HashSet\u003cstring\u003e{ \"O-\", \"O+\", \"A-\", \"A+\", \"B-\", \"B+\", \"AB-\", \"AB+\" } },\n };\n\n public List\u003cBloodUnit\u003e Inventory { get; set; }\n public HashSet\u003cstring\u003e IssuedUnits { get; set; }\n public List\u003cstring\u003e IssueLog { get; set; }\n public DateTime CurrentDate { get; set; }\n\n public BloodBankProcessor(DateTime currentDate)\n {\n Inventory = new List\u003cBloodUnit\u003e();\n IssuedUnits = new HashSet\u003cstring\u003e();\n IssueLog = new List\u003cstring\u003e();\n CurrentDate = currentDate;\n }\n\n // Issue a blood unit for a recipient.\n // Rules:\n // 1. Find compatible units (by recipient type) in Inventory.\n // 2. Sort compatible units by ExpirationDate ascending (FIFO - use oldest first).\n // 3. Skip units already in IssuedUnits.\n // 4. Skip expired units (ExpirationDate \u003c CurrentDate). Log \"EXPIRED:\u003cunitId\u003e\".\n // 5. If emergency==false, skip units where CrossmatchDone==false. Log \"NOCROSSMATCH:\u003cunitId\u003e\".\n // 6. If emergency==true, crossmatch requirement is waived.\n // 7. First eligible unit: add to IssuedUnits, log \"ISSUED:\u003cunitId\u003e:\u003cbloodType\u003e-\u003e\u003crecipientType\u003e\".\n // Return ISSUED result.\n // 8. If no eligible unit found, return NO_STOCK.\n public IssueResult IssueUnit(string recipientType, bool emergency)\n {\n","golden_completion":" if (!Compatibility.ContainsKey(recipientType))\n return new IssueResult { Status = \"INCOMPATIBLE\", UnitId = \"\", BloodType = \"\" };\n var compatTypes = Compatibility[recipientType];\n var candidates = Inventory\n .Where(u =\u003e compatTypes.Contains(u.BloodType))\n .OrderBy(u =\u003e u.ExpirationDate)\n .ToList();\n foreach (var unit in candidates)\n {\n if (IssuedUnits.Contains(unit.UnitId)) continue;\n if (unit.ExpirationDate \u003c CurrentDate)\n {\n IssueLog.Add($\"EXPIRED:{unit.UnitId}\");\n continue;\n }\n if (!emergency \u0026\u0026 !unit.CrossmatchDone)\n {\n IssueLog.Add($\"NOCROSSMATCH:{unit.UnitId}\");\n continue;\n }\n IssuedUnits.Add(unit.UnitId);\n IssueLog.Add($\"ISSUED:{unit.UnitId}:{unit.BloodType}-\u003e{recipientType}\");\n return new IssueResult { Status = \"ISSUED\", UnitId = unit.UnitId, BloodType = unit.BloodType };\n }\n return new IssueResult { Status = \"NO_STOCK\", UnitId = \"\", BloodType = \"\" };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var now = new DateTime(2025, 6, 1);\n var bb = new BloodBankProcessor(now);\n bb.Inventory.Add(new BloodUnit { UnitId = \"U1\", BloodType = \"O-\", ExpirationDate = new DateTime(2025, 5, 15), CrossmatchDone = true });\n bb.Inventory.Add(new BloodUnit { UnitId = \"U2\", BloodType = \"O-\", ExpirationDate = new DateTime(2025, 7, 1), CrossmatchDone = false });\n bb.Inventory.Add(new BloodUnit { UnitId = \"U3\", BloodType = \"O-\", ExpirationDate = new DateTime(2025, 8, 1), CrossmatchDone = true });\n bb.Inventory.Add(new BloodUnit { UnitId = \"U4\", BloodType = \"A+\", ExpirationDate = new DateTime(2025, 9, 1), CrossmatchDone = true });\n\n // Non-emergency O- request: U1 expired, U2 no crossmatch, U3 is eligible\n var r1 = bb.IssueUnit(\"O-\", false);\n if (r1.Status != \"ISSUED\" || r1.UnitId != \"U3\") throw new Exception(\"r1: \" + r1.Status + \" \" + r1.UnitId);\n if (!bb.IssueLog.Any(l =\u003e l.Contains(\"EXPIRED:U1\"))) throw new Exception(\"should log expired U1\");\n if (!bb.IssueLog.Any(l =\u003e l.Contains(\"NOCROSSMATCH:U2\"))) throw new Exception(\"should log nocrossmatch U2\");\n\n // A+ can receive O-: U1 expired (already logged), U2 no crossmatch, U3 already issued -\u003e only U4 is A+ compatible and eligible\n bb.IssueLog.Clear();\n var r2 = bb.IssueUnit(\"A+\", false);\n if (r2.Status != \"ISSUED\" || r2.UnitId != \"U4\") throw new Exception(\"r2: \" + r2.Status + \" \" + r2.UnitId);\n }\n }\n}\n","assertions":" // Emergency: crossmatch waived, but expired still skipped\n // Use a fresh processor to isolate this test\n var bb2 = new BloodBankProcessor(now);\n bb2.Inventory.Add(new BloodUnit { UnitId = \"U5\", BloodType = \"B+\", ExpirationDate = new DateTime(2025, 4, 1), CrossmatchDone = false });\n bb2.Inventory.Add(new BloodUnit { UnitId = \"U6\", BloodType = \"B+\", ExpirationDate = new DateTime(2025, 9, 1), CrossmatchDone = false });\n var r3 = bb2.IssueUnit(\"B+\", true);\n if (r3.Status != \"ISSUED\" || r3.UnitId != \"U6\") throw new Exception(\"emergency: \" + r3.Status + \" \" + r3.UnitId);\n if (!bb2.IssueLog.Any(l =\u003e l.Contains(\"EXPIRED:U5\"))) throw new Exception(\"emergency should still log expired\");\n\n // NO_STOCK: all O- in original bb are expired or issued or no crossmatch\n // U1=expired, U2=no crossmatch, U3=already issued -\u003e only non-emergency O- has no stock\n var r4 = bb.IssueUnit(\"O-\", false);\n if (r4.Status != \"NO_STOCK\") throw new Exception(\"no stock: \" + r4.Status);\n\n // Already-issued unit should be skipped (U3 and U4 were issued)\n bb.Inventory.Add(new BloodUnit { UnitId = \"U7\", BloodType = \"O-\", ExpirationDate = new DateTime(2025, 10, 1), CrossmatchDone = true });\n var r5 = bb.IssueUnit(\"O-\", false);\n if (r5.UnitId != \"U7\") throw new Exception(\"skip issued: \" + r5.UnitId);\n","category":"code_purpose_understanding"} {"id":"43","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace RentalCar\n{\n public class ReturnResult\n {\n public double MileageCharge { get; set; }\n public double FuelCharge { get; set; }\n public double LateCharge { get; set; }\n public double DamageCharge { get; set; }\n public double TotalCharges { get; set; }\n public double Refund { get; set; } // deposit minus charges (\u003e=0)\n public double AmountDue { get; set; } // charges minus deposit if charges \u003e deposit (\u003e=0)\n }\n\n public class RentalProcessor\n {\n public double IncludedMiles { get; set; }\n public double OverageCostPerMile { get; set; }\n public double FuelCostPerGallon { get; set; }\n public double TankCapacity { get; set; }\n public double DailyRate { get; set; }\n public double LateFeePerDay { get; set; }\n public Dictionary\u003cstring, double\u003e DamageCosts { get; set; }\n\n public RentalProcessor()\n {\n IncludedMiles = 200.0;\n OverageCostPerMile = 0.35;\n FuelCostPerGallon = 4.50;\n TankCapacity = 15.0;\n DailyRate = 55.0;\n LateFeePerDay = 30.0;\n DamageCosts = new Dictionary\u003cstring, double\u003e\n {\n { \"SCRATCH\", 150.0 }, { \"DENT\", 300.0 }, { \"CRACKED_GLASS\", 500.0 }, { \"TIRE\", 200.0 }\n };\n }\n\n // Process a car return.\n // Rules:\n // 1. mileageCharge = max(0, (milesDriven - IncludedMiles)) * OverageCostPerMile\n // 2. fuelCharge = (TankCapacity - fuelLevelGallons) * FuelCostPerGallon. If fuelLevel \u003e= TankCapacity, fuelCharge = 0.\n // 3. lateDays = max(0, actualDays - agreedDays). lateCharge = lateDays * LateFeePerDay.\n // But lateCharge is capped at 3 * DailyRate (company policy).\n // 4. damageCharge = sum of DamageCosts for each damage code in damages list.\n // Unknown damage codes are ignored.\n // 5. totalCharges = mileage + fuel + late + damage, rounded to 2 decimals.\n // 6. If deposit \u003e= totalCharges: refund = deposit - totalCharges, amountDue = 0.\n // If deposit \u003c totalCharges: refund = 0, amountDue = totalCharges - deposit.\n public ReturnResult ProcessReturn(double milesDriven, double fuelLevelGallons,\n int actualDays, int agreedDays,\n List\u003cstring\u003e damages, double deposit)\n {\n","golden_completion":" double mileageCharge = Math.Max(0, (milesDriven - IncludedMiles)) * OverageCostPerMile;\n double fuelCharge = fuelLevelGallons \u003e= TankCapacity ? 0 : (TankCapacity - fuelLevelGallons) * FuelCostPerGallon;\n int lateDays = Math.Max(0, actualDays - agreedDays);\n double lateCharge = Math.Min(lateDays * LateFeePerDay, 3 * DailyRate);\n double damageCharge = 0;\n foreach (var d in damages)\n {\n if (DamageCosts.ContainsKey(d)) damageCharge += DamageCosts[d];\n }\n double totalCharges = Math.Round(mileageCharge + fuelCharge + lateCharge + damageCharge, 2);\n double refund = deposit \u003e= totalCharges ? Math.Round(deposit - totalCharges, 2) : 0;\n double amountDue = deposit \u003c totalCharges ? Math.Round(totalCharges - deposit, 2) : 0;\n return new ReturnResult\n {\n MileageCharge = Math.Round(mileageCharge, 2),\n FuelCharge = Math.Round(fuelCharge, 2),\n LateCharge = Math.Round(lateCharge, 2),\n DamageCharge = Math.Round(damageCharge, 2),\n TotalCharges = totalCharges,\n Refund = refund,\n AmountDue = amountDue\n };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var proc = new RentalProcessor();\n\n // Case 1: over mileage, low fuel, on time, one scratch\n var r1 = proc.ProcessReturn(350, 5.0, 3, 3, new List\u003cstring\u003e{ \"SCRATCH\" }, 300.0);\n // mileage: (350-200)*0.35 = 52.50; fuel: (15-5)*4.50 = 45.00; late: 0; damage: 150\n // total: 247.50; refund: 52.50\n if (Math.Abs(r1.MileageCharge - 52.50) \u003e 0.01) throw new Exception(\"r1 mileage: \" + r1.MileageCharge);\n if (Math.Abs(r1.FuelCharge - 45.0) \u003e 0.01) throw new Exception(\"r1 fuel: \" + r1.FuelCharge);\n if (Math.Abs(r1.TotalCharges - 247.50) \u003e 0.01) throw new Exception(\"r1 total: \" + r1.TotalCharges);\n if (Math.Abs(r1.Refund - 52.50) \u003e 0.01) throw new Exception(\"r1 refund: \" + r1.Refund);\n if (r1.AmountDue \u003e 0.01) throw new Exception(\"r1 amountDue should be 0\");\n }\n }\n}\n","assertions":" // Late fee capped at 3*DailyRate = 165\n var r2 = proc.ProcessReturn(100, 15.0, 15, 3, new List\u003cstring\u003e(), 0);\n // mileage: 0 (under included); fuel: 0 (full tank); late: min(12*30, 165)=165; damage: 0\n if (Math.Abs(r2.LateCharge - 165.0) \u003e 0.01) throw new Exception(\"late cap: \" + r2.LateCharge);\n if (Math.Abs(r2.AmountDue - 165.0) \u003e 0.01) throw new Exception(\"late due: \" + r2.AmountDue);\n\n // Unknown damage code ignored\n var r3 = proc.ProcessReturn(200, 15.0, 1, 1, new List\u003cstring\u003e{ \"UNKNOWN_DMG\", \"DENT\" }, 500.0);\n if (Math.Abs(r3.DamageCharge - 300.0) \u003e 0.01) throw new Exception(\"unknown dmg: \" + r3.DamageCharge);\n if (Math.Abs(r3.Refund - 200.0) \u003e 0.01) throw new Exception(\"refund: \" + r3.Refund);\n\n // Full tank means zero fuel charge\n var r4 = proc.ProcessReturn(200, 20.0, 1, 1, new List\u003cstring\u003e(), 100.0);\n if (Math.Abs(r4.FuelCharge) \u003e 0.01) throw new Exception(\"full tank fuel: \" + r4.FuelCharge);\n if (Math.Abs(r4.Refund - 100.0) \u003e 0.01) throw new Exception(\"full refund: \" + r4.Refund);\n","category":"code_purpose_understanding"} {"id":"44","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace Scholarship\n{\n public class DisbursementResult\n {\n public string Status { get; set; } // \"DISBURSED\", \"DENIED\", \"PRORATED\", \"DUPLICATE\"\n public double Amount { get; set; }\n public string Reason { get; set; }\n }\n\n public class ScholarshipProcessor\n {\n public double MinGPA { get; set; }\n public double BaseAward { get; set; }\n public int FullTimeCredits { get; set; }\n public double AnnualCap { get; set; }\n public double TotalDisbursed { get; set; }\n public HashSet\u003cstring\u003e ProcessedStudents { get; set; }\n public List\u003cstring\u003e DisbursementLog { get; set; }\n // Need multiplier tiers: EFC (expected family contribution) ranges\n // EFC 0-5000 -\u003e 1.5x, 5001-15000 -\u003e 1.2x, 15001-30000 -\u003e 1.0x, 30001+ -\u003e 0.75x\n public double NeedMultiplier(double efc)\n {\n if (efc \u003c= 5000) return 1.5;\n if (efc \u003c= 15000) return 1.2;\n if (efc \u003c= 30000) return 1.0;\n return 0.75;\n }\n\n public ScholarshipProcessor()\n {\n MinGPA = 3.0;\n BaseAward = 5000.0;\n FullTimeCredits = 12;\n AnnualCap = 50000.0;\n TotalDisbursed = 0;\n ProcessedStudents = new HashSet\u003cstring\u003e();\n DisbursementLog = new List\u003cstring\u003e();\n }\n\n // Disburse scholarship for a student.\n // Rules:\n // 1. Duplicate studentId -\u003e DUPLICATE, no mutation.\n // 2. GPA \u003c MinGPA -\u003e DENIED, reason \"LOW_GPA\".\n // 3. enrolledCredits \u003c= 0 -\u003e DENIED, reason \"NOT_ENROLLED\".\n // 4. Compute award: BaseAward * NeedMultiplier(efc).\n // 5. If enrolledCredits \u003c FullTimeCredits, prorate:\n // award = award * (enrolledCredits / FullTimeCredits). Status = \"PRORATED\".\n // 6. Cap at remaining annual cap: award = min(award, AnnualCap - TotalDisbursed).\n // If award \u003c= 0 after cap -\u003e DENIED, reason \"CAP_REACHED\".\n // 7. Round award to 2 decimals. Update TotalDisbursed, add to ProcessedStudents.\n // 8. Log \"DISBURSE:\u003cstudentId\u003e:\u003camount\u003e:\u003cstatus\u003e\".\n public DisbursementResult Disburse(string studentId, double gpa,\n int enrolledCredits, double efc)\n {\n","golden_completion":" if (ProcessedStudents.Contains(studentId))\n return new DisbursementResult { Status = \"DUPLICATE\", Amount = 0, Reason = \"DUPLICATE\" };\n if (gpa \u003c MinGPA)\n return new DisbursementResult { Status = \"DENIED\", Amount = 0, Reason = \"LOW_GPA\" };\n if (enrolledCredits \u003c= 0)\n return new DisbursementResult { Status = \"DENIED\", Amount = 0, Reason = \"NOT_ENROLLED\" };\n double award = BaseAward * NeedMultiplier(efc);\n string status = \"DISBURSED\";\n if (enrolledCredits \u003c FullTimeCredits)\n {\n award = award * ((double)enrolledCredits / FullTimeCredits);\n status = \"PRORATED\";\n }\n award = Math.Min(award, AnnualCap - TotalDisbursed);\n if (award \u003c= 0)\n return new DisbursementResult { Status = \"DENIED\", Amount = 0, Reason = \"CAP_REACHED\" };\n award = Math.Round(award, 2);\n TotalDisbursed += award;\n ProcessedStudents.Add(studentId);\n DisbursementLog.Add($\"DISBURSE:{studentId}:{award}:{status}\");\n return new DisbursementResult { Status = status, Amount = award, Reason = \"\" };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var proc = new ScholarshipProcessor();\n\n // Full-time student, low EFC -\u003e 1.5x multiplier\n var r1 = proc.Disburse(\"S001\", 3.5, 15, 3000);\n // award = 5000 * 1.5 = 7500\n if (r1.Status != \"DISBURSED\") throw new Exception(\"r1 status: \" + r1.Status);\n if (Math.Abs(r1.Amount - 7500.0) \u003e 0.01) throw new Exception(\"r1 amount: \" + r1.Amount);\n\n // Part-time student (9 credits out of 12), mid EFC -\u003e 1.2x, prorated\n var r2 = proc.Disburse(\"S002\", 3.2, 9, 10000);\n // award = 5000 * 1.2 = 6000, prorated: 6000 * 9/12 = 4500\n if (r2.Status != \"PRORATED\") throw new Exception(\"r2 status: \" + r2.Status);\n if (Math.Abs(r2.Amount - 4500.0) \u003e 0.01) throw new Exception(\"r2 amount: \" + r2.Amount);\n }\n }\n}\n","assertions":" // Duplicate\n var dup = proc.Disburse(\"S001\", 4.0, 15, 0);\n if (dup.Status != \"DUPLICATE\") throw new Exception(\"dup: \" + dup.Status);\n if (Math.Abs(proc.TotalDisbursed - 12000.0) \u003e 0.01) throw new Exception(\"dup mutated: \" + proc.TotalDisbursed);\n\n // Low GPA\n var low = proc.Disburse(\"S003\", 2.5, 12, 5000);\n if (low.Status != \"DENIED\" || low.Reason != \"LOW_GPA\") throw new Exception(\"low gpa: \" + low.Status);\n\n // Not enrolled\n var ne = proc.Disburse(\"S004\", 3.5, 0, 5000);\n if (ne.Status != \"DENIED\" || ne.Reason != \"NOT_ENROLLED\") throw new Exception(\"not enrolled\");\n\n // Cap reached: set TotalDisbursed near cap\n proc.TotalDisbursed = 49000.0;\n var capped = proc.Disburse(\"S005\", 3.5, 12, 3000);\n // award = 5000 * 1.5 = 7500 but only 1000 remaining\n if (Math.Abs(capped.Amount - 1000.0) \u003e 0.01) throw new Exception(\"cap amount: \" + capped.Amount);\n if (Math.Abs(proc.TotalDisbursed - 50000.0) \u003e 0.01) throw new Exception(\"cap total: \" + proc.TotalDisbursed);\n\n // High EFC -\u003e 0.75x\n proc.TotalDisbursed = 0;\n var high = proc.Disburse(\"S006\", 3.8, 12, 40000);\n if (Math.Abs(high.Amount - 3750.0) \u003e 0.01) throw new Exception(\"high efc: \" + high.Amount);\n","category":"code_purpose_understanding"} {"id":"45","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace PowerGrid\n{\n public class Generator\n {\n public string Id { get; set; }\n public string Type { get; set; } // \"SOLAR\",\"WIND\",\"GAS\",\"COAL\",\"NUCLEAR\"\n public double CapacityMW { get; set; }\n public double CostPerMWh { get; set; }\n public double CurrentOutputMW { get; set; }\n }\n\n public class DispatchResult\n {\n public double TotalSupplyMW { get; set; }\n public double DemandMW { get; set; }\n public double CurtailedMW { get; set; } // renewable output reduced\n public double DemandResponseMW { get; set; } // load shed\n public double ReserveMarginPct { get; set; }\n public double TotalCost { get; set; }\n public string Status { get; set; } // \"BALANCED\",\"SHORTAGE\",\"OVERSUPPLY\"\n }\n\n public class GridDispatcher\n {\n public List\u003cGenerator\u003e Generators { get; set; }\n public double ReserveTarget { get; set; } // fraction, e.g., 0.15 = 15%\n public double DemandResponseCapMW { get; set; }\n public double TotalCostAccumulated { get; set; }\n public List\u003cstring\u003e DispatchLog { get; set; }\n\n public GridDispatcher()\n {\n Generators = new List\u003cGenerator\u003e();\n ReserveTarget = 0.15;\n DemandResponseCapMW = 100.0;\n TotalCostAccumulated = 0;\n DispatchLog = new List\u003cstring\u003e();\n }\n\n // Dispatch generation to meet demand for one hour.\n // Rules:\n // 1. Sort generators by merit order: CostPerMWh ascending (cheapest first).\n // 2. Renewables (SOLAR, WIND) always dispatched first at their CurrentOutputMW\n // (they\u0027re already sorted by cost since cost=0).\n // 3. Dispatch non-renewables in merit order up to their CapacityMW until\n // supply \u003e= demandMW * (1 + ReserveTarget).\n // 4. If total capacity still \u003c demandMW (not reserve, just demand):\n // activate demand response: shed = min(shortage, DemandResponseCapMW).\n // Effective demand = demandMW - shed.\n // 5. If supply \u003e effectiveDemand * (1 + ReserveTarget):\n // curtail renewables (reduce output) to bring supply down to\n // effectiveDemand * (1 + ReserveTarget). Curtail in reverse merit order\n // (most expensive renewable first, though usually same cost).\n // 6. reserveMarginPct = (supply - effectiveDemand) / effectiveDemand * 100.\n // 7. cost = sum of each generator\u0027s dispatched MW * CostPerMWh.\n // 8. Status: if demandResponse \u003e 0 and still short -\u003e \"SHORTAGE\".\n // If curtailed \u003e 0 -\u003e \"OVERSUPPLY\". Else \"BALANCED\".\n // 9. Log \"DISPATCH:\u003cstatus\u003e:supply=\u003csupply\u003e:demand=\u003ceffectiveDemand\u003e:cost=\u003ccost\u003e\".\n // 10. Accumulate cost to TotalCostAccumulated.\n public DispatchResult Dispatch(double demandMW)\n {\n","golden_completion":" var sorted = Generators.OrderBy(g =\u003e g.CostPerMWh).ThenBy(g =\u003e g.Id).ToList();\n double supply = 0; double target = demandMW * (1 + ReserveTarget);\n var disp = new Dictionary\u003cstring, double\u003e();\n foreach (var g in sorted.Where(g =\u003e g.Type == \"SOLAR\" || g.Type == \"WIND\"))\n { disp[g.Id] = g.CurrentOutputMW; supply += g.CurrentOutputMW; }\n foreach (var g in sorted.Where(g =\u003e g.Type != \"SOLAR\" \u0026\u0026 g.Type != \"WIND\"))\n { if (supply \u003e= target) { disp[g.Id] = 0; continue; } double n = Math.Min(g.CapacityMW, target - supply); disp[g.Id] = n; supply += n; }\n double dr = supply \u003c demandMW ? Math.Min(demandMW - supply, DemandResponseCapMW) : 0;\n double effDemand = demandMW - dr; double newTgt = effDemand * (1 + ReserveTarget);\n double curtailed = 0;\n if (supply \u003e newTgt)\n { foreach (var g in sorted.Where(g =\u003e g.Type == \"SOLAR\" || g.Type == \"WIND\").OrderByDescending(g =\u003e g.CostPerMWh).ThenByDescending(g =\u003e g.Id))\n { if (supply \u003c= newTgt) break; double cut = Math.Min(disp[g.Id], supply - newTgt); disp[g.Id] -= cut; supply -= cut; curtailed += cut; } }\n double cost = Math.Round(sorted.Sum(g =\u003e disp.ContainsKey(g.Id) ? disp[g.Id] * g.CostPerMWh : 0), 2);\n double resPct = effDemand \u003e 0 ? Math.Round((supply - effDemand) / effDemand * 100, 2) : 0;\n string status = dr \u003e 0 \u0026\u0026 supply \u003c effDemand ? \"SHORTAGE\" : curtailed \u003e 0 ? \"OVERSUPPLY\" : \"BALANCED\";\n TotalCostAccumulated += cost;\n DispatchLog.Add($\"DISPATCH:{status}:supply={supply}:demand={effDemand}:cost={cost}\");\n return new DispatchResult { TotalSupplyMW = Math.Round(supply, 2), DemandMW = effDemand, CurtailedMW = Math.Round(curtailed, 2), DemandResponseMW = dr, ReserveMarginPct = resPct, TotalCost = cost, Status = status };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var grid = new GridDispatcher();\n grid.Generators.Add(new Generator { Id = \"S1\", Type = \"SOLAR\", CapacityMW = 200, CostPerMWh = 0, CurrentOutputMW = 150 });\n grid.Generators.Add(new Generator { Id = \"W1\", Type = \"WIND\", CapacityMW = 100, CostPerMWh = 0, CurrentOutputMW = 80 });\n grid.Generators.Add(new Generator { Id = \"G1\", Type = \"GAS\", CapacityMW = 300, CostPerMWh = 50, CurrentOutputMW = 0 });\n grid.Generators.Add(new Generator { Id = \"C1\", Type = \"COAL\", CapacityMW = 400, CostPerMWh = 40, CurrentOutputMW = 0 });\n\n // Demand 500MW: renewables=230, need 575 (with 15% reserve)\n // Coal dispatched first (cheaper at 40), then gas\n var r1 = grid.Dispatch(500);\n if (r1.Status != \"BALANCED\") throw new Exception(\"r1 status: \" + r1.Status);\n // supply: 230 (renew) + 345 (coal cap 400, need 345) = 575 -\u003e exactly at target\n if (r1.DemandResponseMW \u003e 0.01) throw new Exception(\"r1 DR: \" + r1.DemandResponseMW);\n }\n }\n}\n","assertions":" // Oversupply: low demand, lots of renewables -\u003e curtailment\n var grid2 = new GridDispatcher();\n grid2.Generators.Add(new Generator { Id = \"S2\", Type = \"SOLAR\", CapacityMW = 500, CostPerMWh = 0, CurrentOutputMW = 400 });\n grid2.Generators.Add(new Generator { Id = \"G2\", Type = \"GAS\", CapacityMW = 100, CostPerMWh = 50, CurrentOutputMW = 0 });\n var r2 = grid2.Dispatch(200);\n // target = 200*1.15 = 230. supply = 400 (solar). curtail 400-230=170\n if (r2.Status != \"OVERSUPPLY\") throw new Exception(\"r2 status: \" + r2.Status);\n if (Math.Abs(r2.CurtailedMW - 170.0) \u003e 0.01) throw new Exception(\"curtailed: \" + r2.CurtailedMW);\n\n // Shortage: demand exceeds all capacity + DR\n var grid3 = new GridDispatcher();\n grid3.Generators.Add(new Generator { Id = \"G3\", Type = \"GAS\", CapacityMW = 200, CostPerMWh = 50, CurrentOutputMW = 0 });\n grid3.DemandResponseCapMW = 50;\n var r3 = grid3.Dispatch(400);\n // supply=200, demand=400, DR=min(200,50)=50, effectiveDemand=350, supply \u003c 350 -\u003e SHORTAGE\n if (r3.Status != \"SHORTAGE\") throw new Exception(\"r3 status: \" + r3.Status);\n if (Math.Abs(r3.DemandResponseMW - 50.0) \u003e 0.01) throw new Exception(\"DR: \" + r3.DemandResponseMW);\n","category":"code_purpose_understanding"} {"id":"46","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace Retirement\n{\n public class BenefitResult\n {\n public double MonthlyBenefit { get; set; }\n public double AnnualBenefit { get; set; }\n public double EarlyPenaltyPct { get; set; }\n public double SurvivorReductionPct { get; set; }\n public string Tier { get; set; } // \"STANDARD\", \"ENHANCED\", \"MINIMUM\"\n }\n\n public class RetirementCalculator\n {\n public double BenefitMultiplier { get; set; } // per year of service\n public int NormalRetirementAge { get; set; }\n public double EarlyPenaltyPerYear { get; set; } // % reduction per year early\n public double SurvivorReduction { get; set; } // % reduction for joint-and-survivor\n public double MinimumMonthly { get; set; }\n public int FinalAvgYears { get; set; } // number of highest years to average\n\n public RetirementCalculator()\n {\n BenefitMultiplier = 0.02; // 2% per year of service\n NormalRetirementAge = 65;\n EarlyPenaltyPerYear = 0.05; // 5% per year early\n SurvivorReduction = 0.10; // 10% reduction\n MinimumMonthly = 800.0;\n FinalAvgYears = 3;\n }\n\n // Calculate retirement benefit.\n // Rules:\n // 1. finalAvgSalary = average of top FinalAvgYears salaries from salaryHistory.\n // If salaryHistory has fewer entries than FinalAvgYears, average all of them.\n // 2. baseBenefit = finalAvgSalary * BenefitMultiplier * serviceYears (annual).\n // 3. If retirementAge \u003c NormalRetirementAge:\n // penalty = (NormalRetirementAge - retirementAge) * EarlyPenaltyPerYear.\n // Cap penalty at 0.30 (30% max). baseBenefit *= (1 - penalty).\n // 4. If jointAndSurvivor == true: baseBenefit *= (1 - SurvivorReduction).\n // 5. monthlyBenefit = baseBenefit / 12, rounded to 2 decimals.\n // 6. If monthlyBenefit \u003c MinimumMonthly, set to MinimumMonthly. Tier = \"MINIMUM\".\n // 7. If serviceYears \u003e= 30, tier = \"ENHANCED\" (unless MINIMUM applies).\n // Otherwise tier = \"STANDARD\" (unless MINIMUM).\n public BenefitResult Calculate(int serviceYears, int retirementAge,\n List\u003cdouble\u003e salaryHistory, bool jointAndSurvivor)\n {\n","golden_completion":" var topSalaries = salaryHistory.OrderByDescending(s =\u003e s).Take(FinalAvgYears).ToList();\n double finalAvg = topSalaries.Average();\n double annual = finalAvg * BenefitMultiplier * serviceYears;\n double penaltyPct = 0;\n if (retirementAge \u003c NormalRetirementAge)\n { penaltyPct = Math.Min((NormalRetirementAge - retirementAge) * EarlyPenaltyPerYear, 0.30); annual *= (1 - penaltyPct); }\n double survivorPct = 0;\n if (jointAndSurvivor) { survivorPct = SurvivorReduction; annual *= (1 - survivorPct); }\n double monthly = Math.Round(annual / 12.0, 2);\n string tier = serviceYears \u003e= 30 ? \"ENHANCED\" : \"STANDARD\";\n if (monthly \u003c MinimumMonthly) { monthly = MinimumMonthly; tier = \"MINIMUM\"; }\n return new BenefitResult { MonthlyBenefit = monthly, AnnualBenefit = Math.Round(monthly * 12, 2),\n EarlyPenaltyPct = Math.Round(penaltyPct * 100, 2), SurvivorReductionPct = Math.Round(survivorPct * 100, 2), Tier = tier };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var calc = new RetirementCalculator();\n\n // Normal retirement, 25 years, no survivor\n var r1 = calc.Calculate(25, 65, new List\u003cdouble\u003e{ 60000, 70000, 80000, 75000 }, false);\n // top 3: 80000, 75000, 70000 -\u003e avg 75000\n // annual: 75000 * 0.02 * 25 = 37500. monthly: 3125\n if (Math.Abs(r1.MonthlyBenefit - 3125.0) \u003e 0.01) throw new Exception(\"r1 monthly: \" + r1.MonthlyBenefit);\n if (r1.Tier != \"STANDARD\") throw new Exception(\"r1 tier: \" + r1.Tier);\n if (r1.EarlyPenaltyPct \u003e 0.01) throw new Exception(\"r1 penalty: \" + r1.EarlyPenaltyPct);\n }\n }\n}\n","assertions":" // Early retirement with penalty\n var r2 = calc.Calculate(20, 60, new List\u003cdouble\u003e{ 90000, 85000, 80000 }, false);\n // avg: 85000. annual: 85000*0.02*20 = 34000. penalty: 5*0.05=0.25. 34000*0.75=25500. monthly: 2125\n if (Math.Abs(r2.MonthlyBenefit - 2125.0) \u003e 0.01) throw new Exception(\"r2 monthly: \" + r2.MonthlyBenefit);\n if (Math.Abs(r2.EarlyPenaltyPct - 25.0) \u003e 0.01) throw new Exception(\"r2 penalty: \" + r2.EarlyPenaltyPct);\n\n // Penalty cap at 30%\n var r3 = calc.Calculate(20, 55, new List\u003cdouble\u003e{ 100000 }, false);\n // penalty: 10*0.05=0.50 capped at 0.30. annual: 100000*0.02*20=40000*0.70=28000. monthly: 2333.33\n if (Math.Abs(r3.EarlyPenaltyPct - 30.0) \u003e 0.01) throw new Exception(\"r3 penalty cap: \" + r3.EarlyPenaltyPct);\n\n // Survivor + early\n var r4 = calc.Calculate(25, 60, new List\u003cdouble\u003e{ 80000, 75000, 70000 }, true);\n // avg: 75000. annual: 75000*0.02*25=37500. penalty 25%: 28125. survivor 10%: 25312.50. monthly: 2109.38\n if (Math.Abs(r4.MonthlyBenefit - 2109.38) \u003e 0.01) throw new Exception(\"r4 monthly: \" + r4.MonthlyBenefit);\n\n // Minimum floor\n var r5 = calc.Calculate(5, 60, new List\u003cdouble\u003e{ 30000 }, true);\n // annual: 30000*0.02*5=3000. penalty 25%: 2250. survivor 10%: 2025. monthly: 168.75 \u003c 800\n if (Math.Abs(r5.MonthlyBenefit - 800.0) \u003e 0.01) throw new Exception(\"r5 min: \" + r5.MonthlyBenefit);\n if (r5.Tier != \"MINIMUM\") throw new Exception(\"r5 tier: \" + r5.Tier);\n\n // Enhanced tier (30+ years)\n var r6 = calc.Calculate(35, 65, new List\u003cdouble\u003e{ 100000, 95000, 90000 }, false);\n if (r6.Tier != \"ENHANCED\") throw new Exception(\"r6 tier: \" + r6.Tier);\n","category":"code_purpose_understanding"} {"id":"47","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace Immigration\n{\n public class VisaResult\n {\n public string Status { get; set; } // \"APPROVED\",\"WAITLISTED\",\"DENIED\",\"DUPLICATE\"\n public int QueuePosition { get; set; }\n public string Reason { get; set; }\n }\n\n public class VisaProcessor\n {\n public Dictionary\u003cstring, int\u003e CategoryQuotas { get; set; } // category -\u003e remaining slots\n public Dictionary\u003cstring, List\u003cstring\u003e\u003e WaitLists { get; set; }\n public HashSet\u003cstring\u003e ProcessedApplicants { get; set; }\n public HashSet\u003cstring\u003e RequiredDocs { get; set; }\n public List\u003cstring\u003e ProcessLog { get; set; }\n\n public VisaProcessor()\n {\n CategoryQuotas = new Dictionary\u003cstring, int\u003e\n {\n { \"EB1\", 10 }, { \"EB2\", 20 }, { \"EB3\", 30 }, { \"F1\", 15 }\n };\n WaitLists = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n foreach (var cat in CategoryQuotas.Keys) WaitLists[cat] = new List\u003cstring\u003e();\n ProcessedApplicants = new HashSet\u003cstring\u003e();\n RequiredDocs = new HashSet\u003cstring\u003e { \"PASSPORT\", \"I140\", \"MEDICAL\", \"PHOTO\" };\n ProcessLog = new List\u003cstring\u003e();\n }\n\n // Process a visa application.\n // Rules:\n // 1. Duplicate applicantId -\u003e DUPLICATE, no mutation.\n // 2. Unknown category -\u003e DENIED, reason \"BAD_CATEGORY\".\n // 3. Check documents: if any required doc is missing from submittedDocs,\n // -\u003e DENIED, reason \"MISSING:\u003cfirst missing doc alphabetically\u003e\".\n // 4. If CategoryQuotas[category] \u003e 0: decrement quota, mark processed,\n // status APPROVED. Log \"APPROVED:\u003capplicantId\u003e:\u003ccategory\u003e\".\n // 5. If quota == 0: add to WaitList. Position = WaitLists[cat].Count (1-indexed after add).\n // status WAITLISTED. Log \"WAITLISTED:\u003capplicantId\u003e:\u003ccategory\u003e:pos=\u003cposition\u003e\".\n // 6. dependents count does NOT affect quota (one slot per primary applicant).\n // But log must include dependent count: append \":deps=\u003cdependents\u003e\" to log entry.\n public VisaResult Process(string applicantId, string category,\n HashSet\u003cstring\u003e submittedDocs, int dependents)\n {\n","golden_completion":" if (ProcessedApplicants.Contains(applicantId))\n return new VisaResult { Status = \"DUPLICATE\", QueuePosition = 0, Reason = \"DUPLICATE\" };\n if (!CategoryQuotas.ContainsKey(category))\n return new VisaResult { Status = \"DENIED\", QueuePosition = 0, Reason = \"BAD_CATEGORY\" };\n var missing = RequiredDocs.Where(d =\u003e !submittedDocs.Contains(d)).OrderBy(d =\u003e d).ToList();\n if (missing.Count \u003e 0)\n return new VisaResult { Status = \"DENIED\", QueuePosition = 0, Reason = \"MISSING:\" + missing[0] };\n ProcessedApplicants.Add(applicantId);\n if (CategoryQuotas[category] \u003e 0)\n {\n CategoryQuotas[category]--;\n ProcessLog.Add($\"APPROVED:{applicantId}:{category}:deps={dependents}\");\n return new VisaResult { Status = \"APPROVED\", QueuePosition = 0, Reason = \"\" };\n }\n WaitLists[category].Add(applicantId);\n int pos = WaitLists[category].Count;\n ProcessLog.Add($\"WAITLISTED:{applicantId}:{category}:pos={pos}:deps={dependents}\");\n return new VisaResult { Status = \"WAITLISTED\", QueuePosition = pos, Reason = \"\" };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var proc = new VisaProcessor();\n\n // Successful approval\n var docs = new HashSet\u003cstring\u003e { \"PASSPORT\", \"I140\", \"MEDICAL\", \"PHOTO\" };\n var r1 = proc.Process(\"A001\", \"EB1\", docs, 2);\n if (r1.Status != \"APPROVED\") throw new Exception(\"r1: \" + r1.Status);\n if (proc.CategoryQuotas[\"EB1\"] != 9) throw new Exception(\"quota not decremented\");\n\n // Missing document\n var partialDocs = new HashSet\u003cstring\u003e { \"PASSPORT\", \"PHOTO\" };\n var r2 = proc.Process(\"A002\", \"EB2\", partialDocs, 0);\n if (r2.Status != \"DENIED\") throw new Exception(\"r2: \" + r2.Status);\n // First missing alphabetically: I140 \u003c MEDICAL\n if (r2.Reason != \"MISSING:I140\") throw new Exception(\"r2 reason: \" + r2.Reason);\n }\n }\n}\n","assertions":" // Duplicate\n var dup = proc.Process(\"A001\", \"EB1\", docs, 0);\n if (dup.Status != \"DUPLICATE\") throw new Exception(\"dup: \" + dup.Status);\n if (proc.CategoryQuotas[\"EB1\"] != 9) throw new Exception(\"dup mutated quota\");\n\n // Bad category\n var bc = proc.Process(\"A003\", \"EB5\", docs, 0);\n if (bc.Status != \"DENIED\" || bc.Reason != \"BAD_CATEGORY\") throw new Exception(\"bad cat: \" + bc.Status);\n\n // Waitlist when quota exhausted\n proc.CategoryQuotas[\"F1\"] = 0;\n var wl1 = proc.Process(\"A004\", \"F1\", docs, 1);\n if (wl1.Status != \"WAITLISTED\" || wl1.QueuePosition != 1) throw new Exception(\"wl1: \" + wl1.Status + \" \" + wl1.QueuePosition);\n var wl2 = proc.Process(\"A005\", \"F1\", docs, 3);\n if (wl2.QueuePosition != 2) throw new Exception(\"wl2 pos: \" + wl2.QueuePosition);\n\n // Verify log includes deps\n if (!proc.ProcessLog.Any(l =\u003e l.Contains(\"deps=2\"))) throw new Exception(\"log missing deps\");\n if (!proc.ProcessLog.Any(l =\u003e l.Contains(\"WAITLISTED\") \u0026\u0026 l.Contains(\"pos=1\"))) throw new Exception(\"log missing waitlist\");\n\n // Doc check before quota (denied applicant should not consume quota)\n int q = proc.CategoryQuotas[\"EB2\"];\n proc.Process(\"A006\", \"EB2\", partialDocs, 0);\n if (proc.CategoryQuotas[\"EB2\"] != q) throw new Exception(\"denied consumed quota\");\n","category":"code_purpose_understanding"} {"id":"48","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace Agriculture\n{\n public class SubsidyResult\n {\n public string Status { get; set; } // \"PAID\", \"DENIED\", \"CAPPED\", \"DUPLICATE\"\n public double Amount { get; set; }\n public double ClawbackDeducted { get; set; }\n public string Reason { get; set; }\n }\n\n public class SubsidyProcessor\n {\n public Dictionary\u003cstring, double\u003e CropBaseRates { get; set; } // per acre\n public double DisasterMultiplier { get; set; }\n public double ConservationBonusPct { get; set; }\n public double AnnualCap { get; set; }\n public double TotalPaid { get; set; }\n public Dictionary\u003cstring, double\u003e Clawbacks { get; set; } // farmerId -\u003e amount owed\n public HashSet\u003cstring\u003e ProcessedApplications { get; set; }\n public List\u003cstring\u003e PaymentLog { get; set; }\n\n public SubsidyProcessor()\n {\n CropBaseRates = new Dictionary\u003cstring, double\u003e\n {\n { \"CORN\", 50.0 }, { \"WHEAT\", 45.0 }, { \"SOYBEAN\", 55.0 }, { \"COTTON\", 60.0 }\n };\n DisasterMultiplier = 1.0;\n ConservationBonusPct = 0.0;\n AnnualCap = 125000.0;\n TotalPaid = 0;\n Clawbacks = new Dictionary\u003cstring, double\u003e();\n ProcessedApplications = new HashSet\u003cstring\u003e();\n PaymentLog = new List\u003cstring\u003e();\n }\n\n // Calculate and pay subsidy.\n // Rules:\n // 1. Duplicate applicationId -\u003e DUPLICATE, no mutation.\n // 2. Unknown crop -\u003e DENIED, reason \"BAD_CROP\".\n // 3. verifiedAcres \u003c= 0 -\u003e DENIED, reason \"NO_ACREAGE\".\n // 4. baseAmount = verifiedAcres * CropBaseRates[crop].\n // 5. Apply disaster multiplier: amount = baseAmount * DisasterMultiplier.\n // 6. If inConservationProgram, add ConservationBonusPct: amount *= (1 + ConservationBonusPct).\n // 7. If farmer has clawback: deduct min(clawback, amount). Net = amount - deduction.\n // Update clawback remaining. If net \u003c= 0 -\u003e DENIED, reason \"CLAWBACK_ABSORBED\".\n // 8. Cap: net = min(net, AnnualCap - TotalPaid). If net \u003c= 0 -\u003e DENIED, reason \"CAP_REACHED\".\n // If capped (net \u003c pre-cap amount) -\u003e status \"CAPPED\".\n // 9. Round to 2 decimals. Update TotalPaid. Mark applicationId processed.\n // 10. Log \"SUBSIDY:\u003cfarmerId\u003e:\u003ccrop\u003e:\u003camount\u003e:\u003cstatus\u003e\".\n public SubsidyResult ProcessSubsidy(string applicationId, string farmerId,\n string crop, double verifiedAcres,\n bool inConservationProgram)\n {\n","golden_completion":" if (ProcessedApplications.Contains(applicationId))\n return new SubsidyResult { Status = \"DUPLICATE\", Amount = 0, ClawbackDeducted = 0, Reason = \"DUPLICATE\" };\n if (!CropBaseRates.ContainsKey(crop))\n return new SubsidyResult { Status = \"DENIED\", Amount = 0, ClawbackDeducted = 0, Reason = \"BAD_CROP\" };\n if (verifiedAcres \u003c= 0)\n return new SubsidyResult { Status = \"DENIED\", Amount = 0, ClawbackDeducted = 0, Reason = \"NO_ACREAGE\" };\n double amount = verifiedAcres * CropBaseRates[crop] * DisasterMultiplier;\n if (inConservationProgram) amount *= (1 + ConservationBonusPct);\n double clawbackDeducted = 0;\n if (Clawbacks.ContainsKey(farmerId) \u0026\u0026 Clawbacks[farmerId] \u003e 0)\n { clawbackDeducted = Math.Min(Clawbacks[farmerId], amount); Clawbacks[farmerId] -= clawbackDeducted; amount -= clawbackDeducted; }\n if (amount \u003c= 0)\n { ProcessedApplications.Add(applicationId); PaymentLog.Add($\"SUBSIDY:{farmerId}:{crop}:0:DENIED\");\n return new SubsidyResult { Status = \"DENIED\", Amount = 0, ClawbackDeducted = clawbackDeducted, Reason = \"CLAWBACK_ABSORBED\" }; }\n string status = \"PAID\"; double capRemaining = AnnualCap - TotalPaid;\n if (amount \u003e capRemaining) { amount = capRemaining; status = \"CAPPED\"; }\n if (amount \u003c= 0)\n { ProcessedApplications.Add(applicationId);\n return new SubsidyResult { Status = \"DENIED\", Amount = 0, ClawbackDeducted = clawbackDeducted, Reason = \"CAP_REACHED\" }; }\n amount = Math.Round(amount, 2); TotalPaid += amount; ProcessedApplications.Add(applicationId);\n PaymentLog.Add($\"SUBSIDY:{farmerId}:{crop}:{amount}:{status}\");\n return new SubsidyResult { Status = status, Amount = amount, ClawbackDeducted = clawbackDeducted, Reason = \"\" };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var proc = new SubsidyProcessor();\n\n // Basic subsidy: 100 acres of CORN at $50/acre = $5000\n var r1 = proc.ProcessSubsidy(\"APP1\", \"F001\", \"CORN\", 100, false);\n if (r1.Status != \"PAID\") throw new Exception(\"r1: \" + r1.Status);\n if (Math.Abs(r1.Amount - 5000.0) \u003e 0.01) throw new Exception(\"r1 amount: \" + r1.Amount);\n\n // Disaster multiplier\n proc.DisasterMultiplier = 1.5;\n var r2 = proc.ProcessSubsidy(\"APP2\", \"F002\", \"WHEAT\", 200, false);\n // 200 * 45 * 1.5 = 13500\n if (Math.Abs(r2.Amount - 13500.0) \u003e 0.01) throw new Exception(\"r2 amount: \" + r2.Amount);\n }\n }\n}\n","assertions":" // Duplicate\n var dup = proc.ProcessSubsidy(\"APP1\", \"F001\", \"CORN\", 100, false);\n if (dup.Status != \"DUPLICATE\") throw new Exception(\"dup: \" + dup.Status);\n\n // Clawback deduction\n proc.Clawbacks[\"F003\"] = 3000.0;\n var r3 = proc.ProcessSubsidy(\"APP3\", \"F003\", \"SOYBEAN\", 100, false);\n // base: 100*55*1.5=8250, clawback 3000, net=5250\n if (Math.Abs(r3.Amount - 5250.0) \u003e 0.01) throw new Exception(\"clawback amount: \" + r3.Amount);\n if (Math.Abs(r3.ClawbackDeducted - 3000.0) \u003e 0.01) throw new Exception(\"clawback ded: \" + r3.ClawbackDeducted);\n if (Math.Abs(proc.Clawbacks[\"F003\"]) \u003e 0.01) throw new Exception(\"clawback remaining: \" + proc.Clawbacks[\"F003\"]);\n\n // Conservation bonus\n proc.ConservationBonusPct = 0.10;\n var r4 = proc.ProcessSubsidy(\"APP4\", \"F004\", \"CORN\", 50, true);\n // 50*50*1.5 = 3750, conservation: 3750*1.10 = 4125\n if (Math.Abs(r4.Amount - 4125.0) \u003e 0.01) throw new Exception(\"conservation: \" + r4.Amount);\n\n // Cap\n proc.TotalPaid = 124000.0;\n var r5 = proc.ProcessSubsidy(\"APP5\", \"F005\", \"COTTON\", 100, false);\n // base: 100*60*1.5=9000, cap remaining: 1000\n if (r5.Status != \"CAPPED\") throw new Exception(\"cap status: \" + r5.Status);\n if (Math.Abs(r5.Amount - 1000.0) \u003e 0.01) throw new Exception(\"cap amount: \" + r5.Amount);\n\n // Bad crop\n var bc = proc.ProcessSubsidy(\"APP6\", \"F006\", \"RICE\", 10, false);\n if (bc.Status != \"DENIED\" || bc.Reason != \"BAD_CROP\") throw new Exception(\"bad crop\");\n","category":"code_purpose_understanding"} {"id":"49","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace QualityAssurance\n{\n public class TestResult\n {\n public string TestName { get; set; }\n public double Value { get; set; }\n public double SpecMin { get; set; }\n public double SpecMax { get; set; }\n }\n\n public class BatchResult\n {\n public string Disposition { get; set; } // \"RELEASED\", \"REJECTED\", \"HOLD\", \"DUPLICATE\"\n public int PassCount { get; set; }\n public int FailCount { get; set; }\n public List\u003cstring\u003e FailedTests { get; set; }\n public string Reason { get; set; }\n }\n\n public class BatchProcessor\n {\n public int MaxOOSForHold { get; set; } // max OOS results before auto-reject\n public HashSet\u003cstring\u003e CriticalTests { get; set; } // if critical test fails -\u003e immediate reject\n public HashSet\u003cstring\u003e ProcessedBatches { get; set; }\n public List\u003cstring\u003e AuditTrail { get; set; }\n\n public BatchProcessor()\n {\n MaxOOSForHold = 2;\n CriticalTests = new HashSet\u003cstring\u003e { \"STERILITY\", \"ENDOTOXIN\", \"POTENCY\" };\n ProcessedBatches = new HashSet\u003cstring\u003e();\n AuditTrail = new List\u003cstring\u003e();\n }\n\n // Evaluate batch for release.\n // Rules:\n // 1. Duplicate batchId -\u003e DUPLICATE, no mutation.\n // 2. For each TestResult: pass if SpecMin \u003c= Value \u003c= SpecMax. Else fail (OOS).\n // 3. If any CriticalTest fails -\u003e REJECTED immediately.\n // Reason: \"CRITICAL_FAIL:\u003ctestName\u003e\". No further tests evaluated after first critical fail.\n // Wait -- actually all tests are evaluated, but disposition is decided after.\n // 4. Count pass/fail. Collect failed test names.\n // 5. If failCount == 0 -\u003e RELEASED.\n // 6. If failCount \u003c= MaxOOSForHold -\u003e HOLD (investigation needed).\n // Reason: \"OOS_INVESTIGATION\".\n // 7. If failCount \u003e MaxOOSForHold -\u003e REJECTED. Reason: \"EXCESS_OOS\".\n // 8. BUT: if any critical test is in the failed list, override to REJECTED\n // regardless of fail count. Reason: \"CRITICAL_FAIL:\u003cfirst critical alphabetically\u003e\".\n // 9. Mark batch processed. Log \"BATCH:\u003cbatchId\u003e:\u003cdisposition\u003e:pass=\u003cpass\u003e:fail=\u003cfail\u003e\".\n public BatchResult Evaluate(string batchId, List\u003cTestResult\u003e results)\n {\n","golden_completion":" if (ProcessedBatches.Contains(batchId))\n return new BatchResult { Disposition = \"DUPLICATE\", PassCount = 0, FailCount = 0, FailedTests = new List\u003cstring\u003e(), Reason = \"DUPLICATE\" };\n int pass = 0, fail = 0; var failedTests = new List\u003cstring\u003e();\n foreach (var t in results)\n { if (t.Value \u003e= t.SpecMin \u0026\u0026 t.Value \u003c= t.SpecMax) pass++; else { fail++; failedTests.Add(t.TestName); } }\n ProcessedBatches.Add(batchId);\n string disposition, reason = \"\";\n var critFails = failedTests.Where(t =\u003e CriticalTests.Contains(t)).OrderBy(t =\u003e t).ToList();\n if (critFails.Count \u003e 0) { disposition = \"REJECTED\"; reason = \"CRITICAL_FAIL:\" + critFails[0]; }\n else if (fail == 0) { disposition = \"RELEASED\"; }\n else if (fail \u003c= MaxOOSForHold) { disposition = \"HOLD\"; reason = \"OOS_INVESTIGATION\"; }\n else { disposition = \"REJECTED\"; reason = \"EXCESS_OOS\"; }\n AuditTrail.Add($\"BATCH:{batchId}:{disposition}:pass={pass}:fail={fail}\");\n return new BatchResult { Disposition = disposition, PassCount = pass, FailCount = fail, FailedTests = failedTests, Reason = reason };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var proc = new BatchProcessor();\n\n // All pass -\u003e RELEASED\n var tests1 = new List\u003cTestResult\u003e\n {\n new TestResult { TestName = \"pH\", Value = 7.0, SpecMin = 6.5, SpecMax = 7.5 },\n new TestResult { TestName = \"POTENCY\", Value = 98.0, SpecMin = 95.0, SpecMax = 105.0 },\n new TestResult { TestName = \"STERILITY\", Value = 0, SpecMin = 0, SpecMax = 0 }\n };\n var r1 = proc.Evaluate(\"B001\", tests1);\n if (r1.Disposition != \"RELEASED\") throw new Exception(\"r1: \" + r1.Disposition);\n if (r1.PassCount != 3 || r1.FailCount != 0) throw new Exception(\"r1 counts\");\n\n // Critical failure -\u003e REJECTED\n var tests2 = new List\u003cTestResult\u003e\n {\n new TestResult { TestName = \"pH\", Value = 7.0, SpecMin = 6.5, SpecMax = 7.5 },\n new TestResult { TestName = \"POTENCY\", Value = 80.0, SpecMin = 95.0, SpecMax = 105.0 }\n };\n var r2 = proc.Evaluate(\"B002\", tests2);\n if (r2.Disposition != \"REJECTED\") throw new Exception(\"r2: \" + r2.Disposition);\n if (!r2.Reason.Contains(\"CRITICAL_FAIL\")) throw new Exception(\"r2 reason: \" + r2.Reason);\n }\n }\n}\n","assertions":" // Duplicate\n var dup = proc.Evaluate(\"B001\", tests1);\n if (dup.Disposition != \"DUPLICATE\") throw new Exception(\"dup: \" + dup.Disposition);\n\n // Non-critical OOS within hold threshold\n var tests3 = new List\u003cTestResult\u003e\n {\n new TestResult { TestName = \"pH\", Value = 8.0, SpecMin = 6.5, SpecMax = 7.5 },\n new TestResult { TestName = \"COLOR\", Value = 5.0, SpecMin = 1.0, SpecMax = 3.0 },\n new TestResult { TestName = \"POTENCY\", Value = 100.0, SpecMin = 95.0, SpecMax = 105.0 }\n };\n var r3 = proc.Evaluate(\"B003\", tests3);\n if (r3.Disposition != \"HOLD\" || r3.Reason != \"OOS_INVESTIGATION\") throw new Exception(\"hold: \" + r3.Disposition + \" \" + r3.Reason);\n if (r3.FailCount != 2) throw new Exception(\"hold fail count: \" + r3.FailCount);\n\n // Excess OOS -\u003e REJECTED\n var tests4 = new List\u003cTestResult\u003e\n {\n new TestResult { TestName = \"pH\", Value = 8.0, SpecMin = 6.5, SpecMax = 7.5 },\n new TestResult { TestName = \"COLOR\", Value = 5.0, SpecMin = 1.0, SpecMax = 3.0 },\n new TestResult { TestName = \"VISCOSITY\", Value = 100.0, SpecMin = 10.0, SpecMax = 50.0 }\n };\n var r4 = proc.Evaluate(\"B004\", tests4);\n if (r4.Disposition != \"REJECTED\" || r4.Reason != \"EXCESS_OOS\") throw new Exception(\"excess: \" + r4.Disposition + \" \" + r4.Reason);\n\n // Critical fail alphabetical ordering: ENDOTOXIN before POTENCY\n var tests5 = new List\u003cTestResult\u003e\n {\n new TestResult { TestName = \"ENDOTOXIN\", Value = 10.0, SpecMin = 0, SpecMax = 5.0 },\n new TestResult { TestName = \"POTENCY\", Value = 80.0, SpecMin = 95.0, SpecMax = 105.0 }\n };\n var r5 = proc.Evaluate(\"B005\", tests5);\n if (r5.Reason != \"CRITICAL_FAIL:ENDOTOXIN\") throw new Exception(\"critical order: \" + r5.Reason);\n","category":"code_purpose_understanding"} {"id":"50","testsource":"devbench-code-purpose-understanding","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace DebtCollection\n{\n public class CollectionResult\n {\n public string Status { get; set; } // \"ACTIVE\",\"EXPIRED\",\"SETTLED\",\"HARDSHIP\",\"DUPLICATE\"\n public double MonthlyPayment { get; set; }\n public int TermMonths { get; set; }\n public double TotalOwed { get; set; }\n public string Reason { get; set; }\n }\n\n public class CollectionProcessor\n {\n public int StatuteLimitYears { get; set; }\n public double InterestRate { get; set; } // annual rate\n public double HardshipThreshold { get; set; } // monthly income below this = hardship\n public double HardshipReductionPct { get; set; }\n public int MaxTermMonths { get; set; }\n public double MinMonthlyPayment { get; set; }\n public HashSet\u003cstring\u003e ProcessedAccounts { get; set; }\n public List\u003cstring\u003e ActionLog { get; set; }\n\n public CollectionProcessor()\n {\n StatuteLimitYears = 6;\n InterestRate = 0.08;\n HardshipThreshold = 2000.0;\n HardshipReductionPct = 0.25;\n MaxTermMonths = 60;\n MinMonthlyPayment = 50.0;\n ProcessedAccounts = new HashSet\u003cstring\u003e();\n ActionLog = new List\u003cstring\u003e();\n }\n\n // Process a debt account.\n // Rules:\n // 1. Duplicate accountId -\u003e DUPLICATE, no mutation.\n // 2. If debtAgeDays / 365.0 \u003e= StatuteLimitYears -\u003e EXPIRED (can\u0027t collect).\n // Log \"EXPIRED:\u003caccountId\u003e\".\n // 3. accruedInterest = principal * InterestRate * (debtAgeDays / 365.0).\n // totalOwed = principal + accruedInterest, rounded to 2 decimals.\n // 4. If monthlyIncome \u003c HardshipThreshold:\n // totalOwed *= (1 - HardshipReductionPct). Status includes \"HARDSHIP\".\n // 5. monthlyPayment = totalOwed / MaxTermMonths.\n // If monthlyPayment \u003c MinMonthlyPayment, set to MinMonthlyPayment.\n // Recalculate termMonths = ceil(totalOwed / monthlyPayment).\n // 6. If termMonths \u003e MaxTermMonths, cap at MaxTermMonths (residual written off).\n // 7. Mark processed. Log \"PLAN:\u003caccountId\u003e:\u003cmonthly\u003ex\u003cterm\u003e:\u003ctotalOwed\u003e\".\n // 8. Status: \"HARDSHIP\" if hardship applied, else \"ACTIVE\".\n public CollectionResult ProcessAccount(string accountId, double principal,\n int debtAgeDays, double monthlyIncome)\n {\n","golden_completion":" if (ProcessedAccounts.Contains(accountId))\n return new CollectionResult { Status = \"DUPLICATE\", MonthlyPayment = 0, TermMonths = 0, TotalOwed = 0, Reason = \"DUPLICATE\" };\n double ageYears = debtAgeDays / 365.0;\n if (ageYears \u003e= StatuteLimitYears)\n {\n ProcessedAccounts.Add(accountId);\n ActionLog.Add($\"EXPIRED:{accountId}\");\n return new CollectionResult { Status = \"EXPIRED\", MonthlyPayment = 0, TermMonths = 0, TotalOwed = 0, Reason = \"STATUTE_EXPIRED\" };\n }\n double interest = Math.Round(principal * InterestRate * ageYears, 2);\n double totalOwed = Math.Round(principal + interest, 2);\n bool hardship = monthlyIncome \u003c HardshipThreshold;\n if (hardship)\n totalOwed = Math.Round(totalOwed * (1 - HardshipReductionPct), 2);\n double monthly = totalOwed / MaxTermMonths;\n if (monthly \u003c MinMonthlyPayment) monthly = MinMonthlyPayment;\n monthly = Math.Round(monthly, 2);\n int term = (int)Math.Ceiling(totalOwed / monthly);\n if (term \u003e MaxTermMonths) term = MaxTermMonths;\n string status = hardship ? \"HARDSHIP\" : \"ACTIVE\";\n ProcessedAccounts.Add(accountId);\n ActionLog.Add($\"PLAN:{accountId}:{monthly}x{term}:{totalOwed}\");\n return new CollectionResult { Status = status, MonthlyPayment = monthly, TermMonths = term, TotalOwed = totalOwed, Reason = \"\" };\n","suffix":" }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n var proc = new CollectionProcessor();\n\n // Normal account: $5000, 2 years old, good income\n var r1 = proc.ProcessAccount(\"D001\", 5000, 730, 4000);\n // interest: 5000*0.08*(730/365) = 800. total: 5800. monthly: 5800/60 = 96.67\n if (r1.Status != \"ACTIVE\") throw new Exception(\"r1: \" + r1.Status);\n if (Math.Abs(r1.TotalOwed - 5800.0) \u003e 0.01) throw new Exception(\"r1 total: \" + r1.TotalOwed);\n if (Math.Abs(r1.MonthlyPayment - 96.67) \u003e 0.01) throw new Exception(\"r1 monthly: \" + r1.MonthlyPayment);\n\n // Hardship: low income\n var r2 = proc.ProcessAccount(\"D002\", 5000, 365, 1500);\n // interest: 5000*0.08*1 = 400. total: 5400. hardship: 5400*0.75 = 4050. monthly: 4050/60 = 67.50\n if (r2.Status != \"HARDSHIP\") throw new Exception(\"r2: \" + r2.Status);\n if (Math.Abs(r2.TotalOwed - 4050.0) \u003e 0.01) throw new Exception(\"r2 total: \" + r2.TotalOwed);\n }\n }\n}\n","assertions":" // Statute expired\n var r3 = proc.ProcessAccount(\"D003\", 10000, 2200, 5000);\n // 2200/365 = 6.027 \u003e= 6\n if (r3.Status != \"EXPIRED\") throw new Exception(\"expired: \" + r3.Status);\n\n // Duplicate\n var dup = proc.ProcessAccount(\"D001\", 999, 1, 9999);\n if (dup.Status != \"DUPLICATE\") throw new Exception(\"dup: \" + dup.Status);\n\n // Min monthly payment kicks in for small debt\n var r4 = proc.ProcessAccount(\"D004\", 500, 0, 5000);\n // interest: 0. total: 500. monthly: 500/60=8.33 \u003c 50 -\u003e 50. term: ceil(500/50)=10\n if (Math.Abs(r4.MonthlyPayment - 50.0) \u003e 0.01) throw new Exception(\"min monthly: \" + r4.MonthlyPayment);\n if (r4.TermMonths != 10) throw new Exception(\"term: \" + r4.TermMonths);\n\n // Hardship + small debt: min payment still applies\n var r5 = proc.ProcessAccount(\"D005\", 1000, 365, 1000);\n // interest: 80. total: 1080. hardship: 810. monthly: 810/60=13.5 \u003c 50 -\u003e 50. term: ceil(810/50)=17\n if (r5.Status != \"HARDSHIP\") throw new Exception(\"r5 status: \" + r5.Status);\n if (Math.Abs(r5.TotalOwed - 810.0) \u003e 0.01) throw new Exception(\"r5 total: \" + r5.TotalOwed);\n if (Math.Abs(r5.MonthlyPayment - 50.0) \u003e 0.01) throw new Exception(\"r5 monthly: \" + r5.MonthlyPayment);\n if (r5.TermMonths != 17) throw new Exception(\"r5 term: \" + r5.TermMonths);\n","category":"code_purpose_understanding"} {"id":"1","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static List\u003cint\u003e FilterPositiveScores(List\u003cint\u003e scores)\n {\n return scores.Where(s =\u003e s \u003e 0).ToList();\n }\n\n","golden_completion":" static string DescribeFilterPositiveScores()\n {\n return \"Filters the input list using LINQ Where with a predicate that \"\n + \"selects elements strictly greater than zero, then materializes \"\n + \"the result via ToList into a new List\u003cint\u003e. The source list is \"\n + \"not modified. Evaluation is deferred until ToList forces \"\n + \"enumeration, and the output preserves the original relative order \"\n + \"of matching elements. The work is O(n) for n input elements.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var scores = new List\u003cint\u003e { -2, 5, 0, 7, -1, 9 };\n var result = FilterPositiveScores(scores);\n if (result.Count != 3) throw new Exception(\"Expected 3 positives\");\n if (scores[0] != -2 || scores.Count != 6) throw new Exception(\"Source modified\");\n string desc = DescribeFilterPositiveScores();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"Description empty\");\n }\n}\n","assertions":"string d1 = DescribeFilterPositiveScores();\nstring d1L = d1.ToLower();\nif (!d1L.Contains(\"where\")) throw new Exception(\"must mention Where\");\nif (!d1L.Contains(\"tolist\")) throw new Exception(\"must mention ToList\");\nif (!d1L.Contains(\"predicate\")) throw new Exception(\"must mention predicate\");\nif (!d1L.Contains(\"not modified\")) throw new Exception(\"must mention source not modified\");\nif (!d1L.Contains(\"deferred\")) throw new Exception(\"must mention deferred evaluation\");\nif (!d1L.Contains(\"relative order\") \u0026\u0026 !d1L.Contains(\"original order\")) throw new Exception(\"must mention order preservation\");\nif (!d1L.Contains(\"o(n)\")) throw new Exception(\"must mention O(n) complexity\");","category":"code2NL_NL2code"} {"id":"2","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static int GetOrDefault(Dictionary\u003cstring, int\u003e map, string key, int fallback)\n {\n if (map.TryGetValue(key, out int value))\n return value;\n return fallback;\n }\n\n","golden_completion":" static string DescribeGetOrDefault()\n {\n return \"Looks up the key in the Dictionary using TryGetValue, which \"\n + \"performs an O(1) amortized hash-table probe and writes the \"\n + \"associated value to an out parameter when the key exists. \"\n + \"If TryGetValue returns false the method returns the caller-supplied \"\n + \"fallback instead. The dictionary is not modified and no \"\n + \"KeyNotFoundException is ever thrown.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var map = new Dictionary\u003cstring, int\u003e { { \"a\", 10 }, { \"b\", 20 } };\n if (GetOrDefault(map, \"a\", -1) != 10) throw new Exception(\"wrong existing\");\n if (GetOrDefault(map, \"c\", -1) != -1) throw new Exception(\"wrong missing\");\n if (map.Count != 2) throw new Exception(\"map modified\");\n string desc = DescribeGetOrDefault();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d2 = DescribeGetOrDefault();\nstring d2L = d2.ToLower();\nif (!d2L.Contains(\"trygetvalue\")) throw new Exception(\"must mention TryGetValue\");\nif (!d2L.Contains(\"o(1)\")) throw new Exception(\"must mention O(1) complexity\");\nif (!d2L.Contains(\"out parameter\") \u0026\u0026 !d2L.Contains(\"out param\")) throw new Exception(\"must mention out parameter\");\nif (!d2L.Contains(\"fallback\")) throw new Exception(\"must mention fallback\");\nif (!d2L.Contains(\"not modified\")) throw new Exception(\"must mention dictionary not modified\");\nif (!d2L.Contains(\"keynotfoundexception\")) throw new Exception(\"must mention no KeyNotFoundException\");\nif (!d2L.Contains(\"hash\")) throw new Exception(\"must mention hash-table mechanism\");","category":"code2NL_NL2code"} {"id":"3","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Text;\nusing System.Collections.Generic;\n\nclass Program\n{\n static string JoinWithSeparator(List\u003cstring\u003e parts, string sep)\n {\n var sb = new StringBuilder();\n for (int i = 0; i \u003c parts.Count; i++)\n {\n if (i \u003e 0) sb.Append(sep);\n sb.Append(parts[i]);\n }\n return sb.ToString();\n }\n\n","golden_completion":" static string DescribeJoinWithSeparator()\n {\n return \"Builds the result using a StringBuilder, appending each element \"\n + \"from the input List\u003cstring\u003e with the separator inserted between \"\n + \"consecutive elements but not before the first or after the last. \"\n + \"StringBuilder.Append performs amortized O(1) per call by doubling \"\n + \"its internal char buffer when capacity is exceeded. The final \"\n + \"ToString allocates a single contiguous string copy. The input \"\n + \"list is not modified and an empty list produces an empty string.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var parts = new List\u003cstring\u003e { \"a\", \"b\", \"c\" };\n if (JoinWithSeparator(parts, \"-\") != \"a-b-c\") throw new Exception(\"wrong join\");\n if (JoinWithSeparator(new List\u003cstring\u003e(), \",\") != \"\") throw new Exception(\"empty fail\");\n string desc = DescribeJoinWithSeparator();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d3 = DescribeJoinWithSeparator();\nstring d3L = d3.ToLower();\nif (!d3L.Contains(\"stringbuilder\")) throw new Exception(\"must mention StringBuilder\");\nif (!d3L.Contains(\"append\")) throw new Exception(\"must mention Append\");\nif (!d3L.Contains(\"separator\") || !d3L.Contains(\"between\")) throw new Exception(\"must mention separator between elements\");\nif (!d3L.Contains(\"amortized\")) throw new Exception(\"must mention amortized cost\");\nif (!d3L.Contains(\"doubling\") \u0026\u0026 !d3L.Contains(\"capacity\")) throw new Exception(\"must mention buffer doubling/capacity\");\nif (!d3L.Contains(\"tostring\")) throw new Exception(\"must mention ToString\");\nif (!d3L.Contains(\"not modified\")) throw new Exception(\"must mention input not modified\");\nif (!d3L.Contains(\"empty\")) throw new Exception(\"must mention empty list/string behavior\");","category":"code2NL_NL2code"} {"id":"4","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static List\u003cint\u003e RunningMax(List\u003cint\u003e values)\n {\n var result = new List\u003cint\u003e();\n values.Aggregate(int.MinValue, (acc, x) =\u003e\n {\n int m = Math.Max(acc, x);\n result.Add(m);\n return m;\n });\n return result;\n }\n\n","golden_completion":" static string DescribeRunningMax()\n {\n return \"Computes a running maximum by folding over the input list with \"\n + \"LINQ Aggregate. The seed is int.MinValue so the first element \"\n + \"always becomes the initial maximum. The accumulator function \"\n + \"calls Math.Max to compare the running state with the current \"\n + \"element, appends each intermediate result to a captured \"\n + \"List\u003cint\u003e via side effect, and returns the updated maximum \"\n + \"as the new accumulator. Throws InvalidOperationException if \"\n + \"the source is empty and no seed is provided, but here a seed \"\n + \"is always supplied. The work is O(n) with one pass.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var vals = new List\u003cint\u003e { 3, 1, 4, 1, 5 };\n var rm = RunningMax(vals);\n if (rm.Count != 5) throw new Exception(\"wrong count\");\n if (rm[0] != 3 || rm[2] != 4 || rm[4] != 5) throw new Exception(\"wrong values\");\n string desc = DescribeRunningMax();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d4 = DescribeRunningMax();\nstring d4L = d4.ToLower();\nif (!d4L.Contains(\"aggregate\")) throw new Exception(\"must mention Aggregate\");\nif (!d4L.Contains(\"int.minvalue\")) throw new Exception(\"must mention int.MinValue seed\");\nif (!d4L.Contains(\"math.max\")) throw new Exception(\"must mention Math.Max\");\nif (!d4L.Contains(\"accumulator\")) throw new Exception(\"must mention accumulator\");\nif (!d4L.Contains(\"side effect\")) throw new Exception(\"must mention side effect capture\");\nif (!d4L.Contains(\"invalidoperationexception\")) throw new Exception(\"must mention InvalidOperationException\");\nif (!d4L.Contains(\"o(n)\")) throw new Exception(\"must mention O(n)\");","category":"code2NL_NL2code"} {"id":"5","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static List\u003cint\u003e GetRange(SortedSet\u003cint\u003e set, int lo, int hi)\n {\n return set.GetViewBetween(lo, hi).ToList();\n }\n\n","golden_completion":" static string DescribeGetRange()\n {\n return \"Returns elements in the inclusive range [lo, hi] from a SortedSet \"\n + \"by calling GetViewBetween, which returns a virtual SortedSet view \"\n + \"backed by the same underlying red-black tree without copying. \"\n + \"Modifications to the view mutate the original set and vice versa. \"\n + \"ToList then materializes the view into a new List\u003cint\u003e, enumerating \"\n + \"elements in ascending sorted order. GetViewBetween throws \"\n + \"ArgumentException if lo is greater than hi. Lookup is O(log n) \"\n + \"and enumeration is O(k) for k elements in range.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var set = new SortedSet\u003cint\u003e { 1, 3, 5, 7, 9, 11 };\n var range = GetRange(set, 3, 9);\n if (range.Count != 4) throw new Exception(\"wrong count\");\n if (range[0] != 3 || range[3] != 9) throw new Exception(\"wrong bounds\");\n string desc = DescribeGetRange();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d5 = DescribeGetRange();\nstring d5L = d5.ToLower();\nif (!d5L.Contains(\"getviewbetween\")) throw new Exception(\"must mention GetViewBetween\");\nif (!d5L.Contains(\"inclusive\")) throw new Exception(\"must mention inclusive range\");\nif (!d5L.Contains(\"red-black\") || !d5L.Contains(\"tree\")) throw new Exception(\"must mention red-black tree\");\nif (!d5L.Contains(\"view\") \u0026\u0026 !d5L.Contains(\"virtual\")) throw new Exception(\"must mention virtual view\");\nif (!d5L.Contains(\"without copying\") \u0026\u0026 !d5L.Contains(\"backed by\")) throw new Exception(\"must mention no-copy backing\");\nif (!d5L.Contains(\"argumentexception\")) throw new Exception(\"must mention ArgumentException\");\nif (!d5L.Contains(\"ascending\") || !d5L.Contains(\"sorted\")) throw new Exception(\"must mention ascending sorted order\");\nif (!d5L.Contains(\"o(log\")) throw new Exception(\"must mention O(log n) lookup\");","category":"code2NL_NL2code"} {"id":"6","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static List\u003cstring\u003e RoundRobin(Queue\u003cstring\u003e queue, int rounds)\n {\n var log = new List\u003cstring\u003e();\n for (int i = 0; i \u003c rounds \u0026\u0026 queue.Count \u003e 0; i++)\n {\n string item = queue.Dequeue();\n log.Add(item);\n queue.Enqueue(item);\n }\n return log;\n }\n\n","golden_completion":" static string DescribeRoundRobin()\n {\n return \"Performs a round-robin cycle on a Queue\u003cstring\u003e by calling \"\n + \"Dequeue to remove the front element in O(1) amortized time, \"\n + \"appending it to the log list, then re-inserting it at the back \"\n + \"with Enqueue in O(1) amortized time. The loop runs for at most \"\n + \"\u0027rounds\u0027 iterations, stopping early if the queue becomes empty. \"\n + \"Queue\u003cstring\u003e uses a circular internal array buffer that is \"\n + \"resized when full. The queue size remains unchanged after the \"\n + \"method returns because each Dequeue is paired with an Enqueue. \"\n + \"Dequeue throws InvalidOperationException on an empty queue but \"\n + \"the Count guard prevents this.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var q = new Queue\u003cstring\u003e(new[] { \"A\", \"B\", \"C\" });\n var log = RoundRobin(q, 5);\n if (log.Count != 5) throw new Exception(\"wrong log count\");\n if (log[0] != \"A\" || log[3] != \"A\") throw new Exception(\"wrong order\");\n if (q.Count != 3) throw new Exception(\"queue size changed\");\n string desc = DescribeRoundRobin();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d6 = DescribeRoundRobin();\nstring d6L = d6.ToLower();\nif (!d6L.Contains(\"dequeue\")) throw new Exception(\"must mention Dequeue\");\nif (!d6L.Contains(\"enqueue\")) throw new Exception(\"must mention Enqueue\");\nif (!d6L.Contains(\"o(1)\")) throw new Exception(\"must mention O(1) amortized\");\nif (!d6L.Contains(\"circular\") || !d6L.Contains(\"buffer\")) throw new Exception(\"must mention circular buffer\");\nif (!d6L.Contains(\"unchanged\") || !d6L.Contains(\"size\")) throw new Exception(\"must mention size unchanged\");\nif (!d6L.Contains(\"invalidoperationexception\")) throw new Exception(\"must mention InvalidOperationException\");\nif (!d6L.Contains(\"count\") \u0026\u0026 !d6L.Contains(\"guard\")) throw new Exception(\"must mention Count guard\");","category":"code2NL_NL2code"} {"id":"7","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static Dictionary\u003cchar, List\u003cstring\u003e\u003e GroupByInitial(List\u003cstring\u003e words)\n {\n return words\n .GroupBy(w =\u003e char.ToUpperInvariant(w[0]))\n .ToDictionary(g =\u003e g.Key, g =\u003e g.ToList());\n }\n\n","golden_completion":" static string DescribeGroupByInitial()\n {\n return \"Groups words by their first character using LINQ GroupBy with \"\n + \"char.ToUpperInvariant as the key selector, producing \"\n + \"IGrouping\u003cchar, string\u003e sequences. ToDictionary then materializes \"\n + \"each group into a Dictionary\u003cchar, List\u003cstring\u003e\u003e. GroupBy uses \"\n + \"deferred execution and preserves the relative order of elements \"\n + \"within each group. Throws InvalidOperationException from \"\n + \"ToDictionary if duplicate keys appear. Accessing w[0] throws \"\n + \"IndexOutOfRangeException on empty strings. Overall O(n) for \"\n + \"n words assuming O(1) hash operations.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var words = new List\u003cstring\u003e { \"apple\", \"Avocado\", \"banana\", \"Blueberry\" };\n var groups = GroupByInitial(words);\n if (groups.Count != 2) throw new Exception(\"wrong group count\");\n if (groups[\u0027A\u0027].Count != 2) throw new Exception(\"wrong A group\");\n string desc = DescribeGroupByInitial();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d7 = DescribeGroupByInitial();\nstring d7L = d7.ToLower();\nif (!d7L.Contains(\"groupby\")) throw new Exception(\"must mention GroupBy\");\nif (!d7L.Contains(\"char.toupperinvariant\")) throw new Exception(\"must mention char.ToUpperInvariant\");\nif (!d7L.Contains(\"todictionary\")) throw new Exception(\"must mention ToDictionary\");\nif (!d7L.Contains(\"igrouping\")) throw new Exception(\"must mention IGrouping\");\nif (!d7L.Contains(\"deferred\")) throw new Exception(\"must mention deferred execution\");\nif (!d7L.Contains(\"relative order\")) throw new Exception(\"must mention relative order preservation\");\nif (!d7L.Contains(\"invalidoperationexception\")) throw new Exception(\"must mention InvalidOperationException on duplicates\");\nif (!d7L.Contains(\"indexoutofrangeexception\")) throw new Exception(\"must mention IndexOutOfRangeException on empty strings\");","category":"code2NL_NL2code"} {"id":"8","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static List\u003cdouble\u003e WeightedAvgPairs(List\u003cdouble\u003e values, List\u003cdouble\u003e weights)\n {\n return values.Zip(weights, (v, w) =\u003e v * w)\n .Select((product, index) =\u003e\n product / weights.Take(index + 1).Sum())\n .ToList();\n }\n\n","golden_completion":" static string DescribeWeightedAvgPairs()\n {\n return \"Pairs elements from values and weights using LINQ Zip, which \"\n + \"stops at the shorter sequence and applies a result selector \"\n + \"that computes v * w. The intermediate products are then piped \"\n + \"through Select with an index overload to divide each product \"\n + \"by the sum of the first (index+1) weights via Take and Sum. \"\n + \"Zip uses deferred execution and does not throw on mismatched \"\n + \"lengths — it silently truncates to the shorter input. Select \"\n + \"with index is also deferred. ToList forces evaluation in a \"\n + \"single forward pass. Overall O(n^2) due to repeated Take+Sum \"\n + \"inside Select.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var v = new List\u003cdouble\u003e { 10.0, 20.0, 30.0 };\n var w = new List\u003cdouble\u003e { 1.0, 2.0, 3.0 };\n var result = WeightedAvgPairs(v, w);\n if (result.Count != 3) throw new Exception(\"wrong count\");\n if (Math.Abs(result[0] - 10.0) \u003e 0.001) throw new Exception(\"wrong first\");\n string desc = DescribeWeightedAvgPairs();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d8 = DescribeWeightedAvgPairs();\nstring d8L = d8.ToLower();\nif (!d8L.Contains(\"zip\")) throw new Exception(\"must mention Zip\");\nif (!d8L.Contains(\"shorter sequence\") || !d8L.Contains(\"truncat\")) throw new Exception(\"must mention truncation to shorter\");\nif (!d8L.Contains(\"select\") \u0026\u0026 !d8L.Contains(\"index overload\")) throw new Exception(\"must mention Select with index\");\nif (!d8L.Contains(\"take\") \u0026\u0026 !d8L.Contains(\"sum\")) throw new Exception(\"must mention Take and Sum\");\nif (!d8L.Contains(\"deferred\")) throw new Exception(\"must mention deferred execution\");\nif (!d8L.Contains(\"tolist\")) throw new Exception(\"must mention ToList forcing evaluation\");\nif (!d8L.Contains(\"o(n^2)\") \u0026\u0026 !d8L.Contains(\"o(n²)\") \u0026\u0026 !d8L.Contains(\"quadratic\")) throw new Exception(\"must mention O(n^2) or quadratic\");\nif (!d8L.Contains(\"silently\")) throw new Exception(\"must mention Zip silently truncates\");","category":"code2NL_NL2code"} {"id":"9","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static int SumMiddleThird(ReadOnlySpan\u003cint\u003e span)\n {\n int len = span.Length;\n int start = len / 3;\n int end = 2 * len / 3;\n ReadOnlySpan\u003cint\u003e slice = span.Slice(start, end - start);\n int sum = 0;\n foreach (int v in slice) sum += v;\n return sum;\n }\n\n","golden_completion":" static string DescribeSumMiddleThird()\n {\n return \"Computes the sum of the middle third of a ReadOnlySpan\u003cint\u003e by \"\n + \"using integer division to find start and end indices, then calling \"\n + \"Slice to create a narrower view into the same contiguous memory \"\n + \"without any heap allocation or copying. The foreach loop over the \"\n + \"slice is bounds-checked by the JIT. ReadOnlySpan is a ref struct \"\n + \"that lives only on the stack and cannot be boxed, stored in fields, \"\n + \"or captured by async methods. Slice throws ArgumentOutOfRangeException \"\n + \"if the range exceeds the span bounds. The work is O(k) for k \"\n + \"elements in the middle third.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n Span\u003cint\u003e data = stackalloc int[] { 1, 2, 3, 4, 5, 6, 7, 8, 9 };\n int result = SumMiddleThird(data);\n if (result != 4 + 5 + 6) throw new Exception(\"wrong sum: \" + result);\n string desc = DescribeSumMiddleThird();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d9 = DescribeSumMiddleThird();\nstring d9L = d9.ToLower();\nif (!d9L.Contains(\"readonlyspan\")) throw new Exception(\"must mention ReadOnlySpan\");\nif (!d9L.Contains(\"slice\")) throw new Exception(\"must mention Slice\");\nif (!d9L.Contains(\"without\") \u0026\u0026 !d9L.Contains(\"no\")) throw new Exception(\"must mention no allocation/copying\");\nif (!d9L.Contains(\"ref struct\")) throw new Exception(\"must mention ref struct\");\nif (!d9L.Contains(\"stack\")) throw new Exception(\"must mention stack-only lifetime\");\nif (!d9L.Contains(\"argumentoutofrangeexception\")) throw new Exception(\"must mention ArgumentOutOfRangeException\");\nif (!d9L.Contains(\"contiguous memory\") \u0026\u0026 !d9L.Contains(\"contiguous\")) throw new Exception(\"must mention contiguous memory\");\nif (!d9L.Contains(\"o(k)\") || !d9L.Contains(\"middle third\")) throw new Exception(\"must mention O(k) for middle third\");","category":"code2NL_NL2code"} {"id":"10","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Collections.Concurrent;\n\nclass Program\n{\n static int AddOrIncrement(ConcurrentDictionary\u003cstring, int\u003e dict, string key, int amount)\n {\n return dict.AddOrUpdate(key, amount, (k, oldVal) =\u003e oldVal + amount);\n }\n\n","golden_completion":" static string DescribeAddOrIncrement()\n {\n return \"Uses ConcurrentDictionary.AddOrUpdate which atomically adds the \"\n + \"key with the given amount if absent, or invokes the updateValueFactory \"\n + \"delegate to compute oldVal + amount if the key already exists. \"\n + \"The method is thread-safe using fine-grained lock striping on \"\n + \"hash buckets, not a global lock. The updateValueFactory may be \"\n + \"called multiple times under contention because AddOrUpdate uses \"\n + \"an optimistic concurrency loop with compare-and-swap. The return \"\n + \"value is the new value stored for the key. The operation is O(1) \"\n + \"amortized assuming uniform hashing.\";\n }\n\n","suffix":" static void Main(string[] args)\n {\n var dict = new ConcurrentDictionary\u003cstring, int\u003e();\n if (AddOrIncrement(dict, \"x\", 5) != 5) throw new Exception(\"add failed\");\n if (AddOrIncrement(dict, \"x\", 3) != 8) throw new Exception(\"update failed\");\n if (dict[\"x\"] != 8) throw new Exception(\"wrong stored value\");\n string desc = DescribeAddOrIncrement();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"desc empty\");\n }\n}\n","assertions":"string d10 = DescribeAddOrIncrement();\nstring d10L = d10.ToLower();\nif (!d10L.Contains(\"addorupdate\")) throw new Exception(\"must mention AddOrUpdate\");\nif (!d10L.Contains(\"atomically\")) throw new Exception(\"must mention atomic operation\");\nif (!d10L.Contains(\"updatevaluefactory\")) throw new Exception(\"must mention updateValueFactory delegate\");\nif (!d10L.Contains(\"lock striping\") \u0026\u0026 !d10L.Contains(\"fine-grained\")) throw new Exception(\"must mention fine-grained lock striping\");\nif (!d10L.Contains(\"multiple times\") || !d10L.Contains(\"contention\")) throw new Exception(\"must mention multiple invocations under contention\");\nif (!d10L.Contains(\"compare-and-swap\") \u0026\u0026 !d10L.Contains(\"optimistic\")) throw new Exception(\"must mention optimistic concurrency/CAS\");\nif (!d10L.Contains(\"thread-safe\")) throw new Exception(\"must mention thread-safety\");\nif (!d10L.Contains(\"o(1)\")) throw new Exception(\"must mention O(1) amortized\");","category":"code2NL_NL2code"} {"id":"11","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n static List\u003cstring\u003e ZipLabelsWithScores(List\u003cstring\u003e labels, List\u003cint\u003e scores)\n {\n return labels.Zip(scores, (l, s) =\u003e $\"{l}:{s}\").ToList();\n }\n\n","golden_completion":"static string describe_ZipLabelsWithScores()\n{\n return \"Pairs each label with the corresponding score using Enumerable.Zip, \"\n + \"combining them into a formatted string with a colon separator. \"\n + \"If the two sequences have different lengths, Zip truncates to the \"\n + \"shorter sequence without throwing an exception. The result selector \"\n + \"produces a new string for each pair via string interpolation.\";\n}\n","suffix":"\n static void Main()\n {\n var result = ZipLabelsWithScores(\n new List\u003cstring\u003e { \"math\", \"sci\" },\n new List\u003cint\u003e { 95, 88 });\n if (result.Count != 2) throw new Exception(\"count\");\n if (result[0] != \"math:95\") throw new Exception(\"first\");\n\n var truncated = ZipLabelsWithScores(\n new List\u003cstring\u003e { \"a\", \"b\", \"c\" },\n new List\u003cint\u003e { 1 });\n if (truncated.Count != 1) throw new Exception(\"truncate\");\n\n string doc = describe_ZipLabelsWithScores();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_ZipLabelsWithScores().ToLower();\nif (!d.Contains(\"zip\")) throw new Exception(\"missing zip\");\nif (!d.Contains(\"truncat\")) throw new Exception(\"missing truncate\");\nif (!d.Contains(\"shorter\")) throw new Exception(\"missing shorter\");\nif (!d.Contains(\"colon\") \u0026\u0026 !d.Contains(\"separator\") \u0026\u0026 !d.Contains(\":\")) throw new Exception(\"missing colon/separator\");\nif (!d.Contains(\"pair\") \u0026\u0026 !d.Contains(\"combin\")) throw new Exception(\"missing pair/combine\");\nif (!d.Contains(\"interpolat\") \u0026\u0026 !d.Contains(\"format\")) throw new Exception(\"missing interpolation/format\");\n","category":"code2NL_NL2code"} {"id":"12","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static List\u003cstring\u003e DrainTopN(PriorityQueue\u003cstring, int\u003e pq, int n)\n {\n var result = new List\u003cstring\u003e();\n while (result.Count \u003c n \u0026\u0026 pq.TryDequeue(out string item, out int _))\n {\n result.Add(item);\n }\n return result;\n }\n\n","golden_completion":"static string describe_DrainTopN()\n{\n return \"Removes up to n elements from a PriorityQueue using TryDequeue, \"\n + \"which extracts the element with the lowest priority value (min-heap). \"\n + \"Each call to TryDequeue returns false when the queue is empty, so \"\n + \"the loop terminates early if fewer than n elements remain. \"\n + \"The dequeued elements are collected into a new List in extraction order. \"\n + \"The original PriorityQueue is mutated by the removals.\";\n}\n","suffix":"\n static void Main()\n {\n var pq = new PriorityQueue\u003cstring, int\u003e();\n pq.Enqueue(\"low\", 1);\n pq.Enqueue(\"high\", 10);\n pq.Enqueue(\"med\", 5);\n var top2 = DrainTopN(pq, 2);\n if (top2.Count != 2) throw new Exception(\"count\");\n if (top2[0] != \"low\") throw new Exception(\"min first\");\n\n string doc = describe_DrainTopN();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_DrainTopN().ToLower();\nif (!d.Contains(\"priorityqueue\") \u0026\u0026 !d.Contains(\"priority queue\")) throw new Exception(\"missing priorityqueue\");\nif (!d.Contains(\"trydequeue\")) throw new Exception(\"missing trydequeue\");\nif (!d.Contains(\"min\") || !d.Contains(\"heap\") \u0026\u0026 !d.Contains(\"lowest\")) throw new Exception(\"missing min-heap/lowest\");\nif (!d.Contains(\"mutat\") \u0026\u0026 !d.Contains(\"remov\") \u0026\u0026 !d.Contains(\"drain\")) throw new Exception(\"missing mutation/removal\");\nif (!d.Contains(\"empty\") \u0026\u0026 !d.Contains(\"fewer\")) throw new Exception(\"missing empty/fewer termination\");\nif (!d.Contains(\"list\") \u0026\u0026 !d.Contains(\"collect\")) throw new Exception(\"missing list/collect\");\n","category":"code2NL_NL2code"} {"id":"13","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Security.Cryptography;\nusing System.Text;\n\nclass Program\n{\n static string ComputeSha256Hex(string input)\n {\n using (SHA256 sha = SHA256.Create())\n {\n byte[] hash = sha.ComputeHash(Encoding.UTF8.GetBytes(input));\n return BitConverter.ToString(hash).Replace(\"-\", \"\").ToLowerInvariant();\n }\n }\n\n","golden_completion":"static string describe_ComputeSha256Hex()\n{\n return \"Computes a SHA-256 hash of the UTF-8 encoded input string using \"\n + \"the SHA256.Create factory method inside a using block that ensures \"\n + \"the algorithm instance is disposed after use. The resulting 32-byte \"\n + \"hash is converted to a lowercase hexadecimal string by BitConverter.ToString \"\n + \"with hyphens removed. The output is always 64 hex characters long.\";\n}\n","suffix":"\n static void Main()\n {\n string h = ComputeSha256Hex(\"hello\");\n if (h.Length != 64) throw new Exception(\"length\");\n if (h != h.ToLowerInvariant()) throw new Exception(\"case\");\n\n string doc = describe_ComputeSha256Hex();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_ComputeSha256Hex().ToLower();\nif (!d.Contains(\"sha-256\") \u0026\u0026 !d.Contains(\"sha256\")) throw new Exception(\"missing sha256\");\nif (!d.Contains(\"utf-8\") \u0026\u0026 !d.Contains(\"utf8\")) throw new Exception(\"missing utf-8\");\nif (!d.Contains(\"disposed\") \u0026\u0026 !d.Contains(\"using\")) throw new Exception(\"missing dispose/using\");\nif (!d.Contains(\"32-byte\") \u0026\u0026 !d.Contains(\"32 byte\") \u0026\u0026 !d.Contains(\"256-bit\") \u0026\u0026 !d.Contains(\"256 bit\")) throw new Exception(\"missing 32-byte/256-bit\");\nif (!d.Contains(\"hexadecimal\") \u0026\u0026 !d.Contains(\"hex\")) throw new Exception(\"missing hex\");\nif (!d.Contains(\"lowercase\") \u0026\u0026 !d.Contains(\"lower\")) throw new Exception(\"missing lowercase\");\nif (!d.Contains(\"bitconverter\")) throw new Exception(\"missing bitconverter\");\n","category":"code2NL_NL2code"} {"id":"14","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Globalization;\n\nclass Program\n{\n static int CultureAwareIndexOf(string source, string value, string cultureName)\n {\n CultureInfo ci = new CultureInfo(cultureName);\n return ci.CompareInfo.IndexOf(source, value, CompareOptions.IgnoreCase);\n }\n\n","golden_completion":"static string describe_CultureAwareIndexOf()\n{\n return \"Finds the first occurrence of a substring within a source string \"\n + \"using culture-sensitive comparison rules from CompareInfo.IndexOf. \"\n + \"The comparison is case-insensitive via CompareOptions.IgnoreCase. \"\n + \"A new CultureInfo is constructed from the culture name string, \"\n + \"and its CompareInfo property drives the search. Returns -1 if \"\n + \"the value is not found within the source string.\";\n}\n","suffix":"\n static void Main()\n {\n int idx = CultureAwareIndexOf(\"Hello World\", \"hello\", \"en-US\");\n if (idx != 0) throw new Exception(\"case insensitive\");\n int missing = CultureAwareIndexOf(\"abc\", \"xyz\", \"en-US\");\n if (missing != -1) throw new Exception(\"not found\");\n\n string doc = describe_CultureAwareIndexOf();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_CultureAwareIndexOf().ToLower();\nif (!d.Contains(\"cultureinfo\") \u0026\u0026 !d.Contains(\"culture\")) throw new Exception(\"missing cultureinfo/culture\");\nif (!d.Contains(\"compareinfo\")) throw new Exception(\"missing compareinfo\");\nif (!d.Contains(\"case-insensitive\") \u0026\u0026 !d.Contains(\"ignorecase\") \u0026\u0026 !d.Contains(\"ignore case\")) throw new Exception(\"missing case-insensitive\");\nif (!d.Contains(\"compareoptions\")) throw new Exception(\"missing compareoptions\");\nif (!d.Contains(\"-1\")) throw new Exception(\"missing -1 return\");\nif (!d.Contains(\"culture-sensitive\") \u0026\u0026 !d.Contains(\"culture sensitive\") \u0026\u0026 !d.Contains(\"culture-aware\") \u0026\u0026 !d.Contains(\"culture aware\")) throw new Exception(\"missing culture-sensitive/aware\");\n","category":"code2NL_NL2code"} {"id":"15","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Numerics;\n\nclass Program\n{\n static BigInteger Factorial(int n)\n {\n BigInteger result = BigInteger.One;\n for (int i = 2; i \u003c= n; i++)\n result = BigInteger.Multiply(result, new BigInteger(i));\n return result;\n }\n\n","golden_completion":"static string describe_Factorial()\n{\n return \"Computes the factorial of n using System.Numerics.BigInteger for \"\n + \"arbitrary-precision integer arithmetic, avoiding overflow that would \"\n + \"occur with int or long for large n. Starts from BigInteger.One and \"\n + \"iteratively multiplies via BigInteger.Multiply. Returns BigInteger.One \"\n + \"when n is 0 or 1 since the loop body does not execute.\";\n}\n","suffix":"\n static void Main()\n {\n if (Factorial(0) != BigInteger.One) throw new Exception(\"0!\");\n if (Factorial(5) != new BigInteger(120)) throw new Exception(\"5!\");\n if (Factorial(20) != BigInteger.Parse(\"2432902008176640000\")) throw new Exception(\"20!\");\n\n string doc = describe_Factorial();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_Factorial().ToLower();\nif (!d.Contains(\"biginteger\")) throw new Exception(\"missing biginteger\");\nif (!d.Contains(\"arbitrary\") || !d.Contains(\"precision\")) throw new Exception(\"missing arbitrary-precision\");\nif (!d.Contains(\"overflow\")) throw new Exception(\"missing overflow\");\nif (!d.Contains(\"multiply\") \u0026\u0026 !d.Contains(\"biginteger.multiply\")) throw new Exception(\"missing multiply\");\nif (!d.Contains(\"one\") \u0026\u0026 !d.Contains(\"biginteger.one\")) throw new Exception(\"missing biginteger.one\");\nif (!d.Contains(\"iterativ\") \u0026\u0026 !d.Contains(\"loop\")) throw new Exception(\"missing iterative/loop\");\n","category":"code2NL_NL2code"} {"id":"16","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.IO;\nusing System.IO.Compression;\nusing System.Text;\n\nclass Program\n{\n static byte[] CompressString(string text)\n {\n byte[] raw = Encoding.UTF8.GetBytes(text);\n using (var ms = new MemoryStream())\n {\n using (var gz = new GZipStream(ms, CompressionMode.Compress, leaveOpen: true))\n {\n gz.Write(raw, 0, raw.Length);\n }\n return ms.ToArray();\n }\n }\n\n","golden_completion":"static string describe_CompressString()\n{\n return \"Compresses a UTF-8 encoded string into a gzip byte array using \"\n + \"GZipStream wrapping a MemoryStream. The leaveOpen parameter is set \"\n + \"to true so that disposing the GZipStream flushes the compressed data \"\n + \"without closing the underlying MemoryStream. The inner using block \"\n + \"must complete before calling ToArray, because GZipStream writes the \"\n + \"gzip footer bytes only upon disposal.\";\n}\n","suffix":"\n static void Main()\n {\n byte[] compressed = CompressString(\"hello world\");\n if (compressed.Length == 0) throw new Exception(\"empty\");\n if (compressed.Length \u003e= Encoding.UTF8.GetBytes(\"hello world\").Length + 100)\n throw new Exception(\"too large\");\n\n string doc = describe_CompressString();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_CompressString().ToLower();\nif (!d.Contains(\"gzipstream\") \u0026\u0026 !d.Contains(\"gzip\")) throw new Exception(\"missing gzipstream\");\nif (!d.Contains(\"memorystream\")) throw new Exception(\"missing memorystream\");\nif (!d.Contains(\"leaveopen\") \u0026\u0026 !d.Contains(\"leave open\")) throw new Exception(\"missing leaveopen\");\nif (!d.Contains(\"utf-8\") \u0026\u0026 !d.Contains(\"utf8\")) throw new Exception(\"missing utf-8\");\nif (!d.Contains(\"dispos\") \u0026\u0026 !d.Contains(\"using\")) throw new Exception(\"missing dispose/using\");\nif (!d.Contains(\"footer\") \u0026\u0026 !d.Contains(\"flush\")) throw new Exception(\"missing footer/flush\");\nif (!d.Contains(\"toarray\")) throw new Exception(\"missing toarray\");\n","category":"code2NL_NL2code"} {"id":"17","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n static List\u003cint[]\u003e BatchItems(IEnumerable\u003cint\u003e items, int batchSize)\n {\n return items.Chunk(batchSize).ToList();\n }\n\n","golden_completion":"static string describe_BatchItems()\n{\n return \"Splits the input sequence into fixed-size batches using Enumerable.Chunk. \"\n + \"Each batch is an array of up to batchSize elements. The final chunk \"\n + \"may contain fewer elements if the total count is not evenly divisible \"\n + \"by batchSize. Chunk uses deferred execution internally but each chunk \"\n + \"is materialized as an array. Throws ArgumentOutOfRangeException if \"\n + \"batchSize is less than or equal to zero.\";\n}\n","suffix":"\n static void Main()\n {\n var batches = BatchItems(new[] { 1, 2, 3, 4, 5 }, 2);\n if (batches.Count != 3) throw new Exception(\"batch count\");\n if (batches[2].Length != 1) throw new Exception(\"last batch size\");\n\n string doc = describe_BatchItems();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_BatchItems().ToLower();\nif (!d.Contains(\"chunk\")) throw new Exception(\"missing chunk\");\nif (!d.Contains(\"array\")) throw new Exception(\"missing array\");\nif (!d.Contains(\"fewer\") \u0026\u0026 !d.Contains(\"remaining\") \u0026\u0026 !d.Contains(\"less\")) throw new Exception(\"missing fewer/remaining for last chunk\");\nif (!d.Contains(\"deferred\") \u0026\u0026 !d.Contains(\"lazy\")) throw new Exception(\"missing deferred execution\");\nif (!d.Contains(\"argumentoutofrangeexception\") \u0026\u0026 !d.Contains(\"exception\") \u0026\u0026 !d.Contains(\"throw\")) throw new Exception(\"missing exception for invalid size\");\nif (!d.Contains(\"materialized\") \u0026\u0026 !d.Contains(\"array\") ) throw new Exception(\"missing materialized as array\");\n","category":"code2NL_NL2code"} {"id":"18","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static void RotateLeft(LinkedList\u003cint\u003e list, int positions)\n {\n for (int i = 0; i \u003c positions \u0026\u0026 list.Count \u003e 1; i++)\n {\n int first = list.First.Value;\n list.RemoveFirst();\n list.AddLast(first);\n }\n }\n\n","golden_completion":"static string describe_RotateLeft()\n{\n return \"Rotates a LinkedList to the left by the given number of positions. \"\n + \"Each rotation removes the First node using RemoveFirst (an O(1) operation) \"\n + \"and appends its value to the end using AddLast (also O(1)). \"\n + \"The loop exits early if the list has zero or one elements. \"\n + \"The original LinkedList is mutated in place; no new list is created. \"\n + \"Total time complexity is O(positions) with O(1) space.\";\n}\n","suffix":"\n static void Main()\n {\n var list = new LinkedList\u003cint\u003e(new[] { 1, 2, 3, 4, 5 });\n RotateLeft(list, 2);\n if (list.First.Value != 3) throw new Exception(\"first\");\n if (list.Last.Value != 2) throw new Exception(\"last\");\n\n string doc = describe_RotateLeft();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_RotateLeft().ToLower();\nif (!d.Contains(\"linkedlist\") \u0026\u0026 !d.Contains(\"linked list\")) throw new Exception(\"missing linkedlist\");\nif (!d.Contains(\"removefirst\") \u0026\u0026 !d.Contains(\"remove first\")) throw new Exception(\"missing removefirst\");\nif (!d.Contains(\"addlast\") \u0026\u0026 !d.Contains(\"add last\")) throw new Exception(\"missing addlast\");\nif (!d.Contains(\"o(1)\")) throw new Exception(\"missing o(1) complexity\");\nif (!d.Contains(\"mutat\") \u0026\u0026 !d.Contains(\"in place\") \u0026\u0026 !d.Contains(\"in-place\")) throw new Exception(\"missing mutation/in-place\");\nif (!d.Contains(\"o(positions)\") \u0026\u0026 !d.Contains(\"o(n)\") \u0026\u0026 !d.Contains(\"linear\")) throw new Exception(\"missing time complexity\");\n","category":"code2NL_NL2code"} {"id":"19","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n static List\u003cchar\u003e FlattenToChars(List\u003cstring\u003e words)\n {\n return words.SelectMany(w =\u003e w.ToCharArray()).ToList();\n }\n\n","golden_completion":"static string describe_FlattenToChars()\n{\n return \"Flattens a list of strings into a single list of characters using \"\n + \"Enumerable.SelectMany, which projects each string into a char array \"\n + \"via ToCharArray and then concatenates all resulting sequences into one \"\n + \"flat sequence. SelectMany uses deferred execution; the call to ToList \"\n + \"forces immediate evaluation. The output preserves the original order \"\n + \"of characters across all input strings.\";\n}\n","suffix":"\n static void Main()\n {\n var result = FlattenToChars(new List\u003cstring\u003e { \"ab\", \"cd\" });\n if (result.Count != 4) throw new Exception(\"count\");\n if (result[0] != \u0027a\u0027 || result[3] != \u0027d\u0027) throw new Exception(\"order\");\n\n var empty = FlattenToChars(new List\u003cstring\u003e());\n if (empty.Count != 0) throw new Exception(\"empty\");\n\n string doc = describe_FlattenToChars();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_FlattenToChars().ToLower();\nif (!d.Contains(\"selectmany\")) throw new Exception(\"missing selectmany\");\nif (!d.Contains(\"flatten\") \u0026\u0026 !d.Contains(\"concatenat\")) throw new Exception(\"missing flatten/concatenate\");\nif (!d.Contains(\"tochararray\") \u0026\u0026 !d.Contains(\"char array\")) throw new Exception(\"missing tochararray\");\nif (!d.Contains(\"deferred\")) throw new Exception(\"missing deferred execution\");\nif (!d.Contains(\"order\") \u0026\u0026 !d.Contains(\"preserv\")) throw new Exception(\"missing order preservation\");\nif (!d.Contains(\"tolist\") \u0026\u0026 !d.Contains(\"immediate\")) throw new Exception(\"missing tolist/immediate evaluation\");\n","category":"code2NL_NL2code"} {"id":"20","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n static Dictionary\u003cchar, List\u003cstring\u003e\u003e GroupByFirstChar(IEnumerable\u003cstring\u003e words)\n {\n return words.GroupBy(w =\u003e w[0])\n .ToDictionary(g =\u003e g.Key, g =\u003e g.ToList());\n }\n\n","golden_completion":"static string describe_GroupByFirstChar()\n{\n return \"Groups strings by their first character using Enumerable.GroupBy and \"\n + \"materializes the result into a Dictionary via ToDictionary. Each key \"\n + \"is the first char of the group, and each value is a List of all strings \"\n + \"sharing that initial character. GroupBy preserves the relative order of \"\n + \"elements within each group. Throws an InvalidOperationException if any \"\n + \"string is empty, because indexing w[0] on an empty string throws.\";\n}\n","suffix":"\n static void Main()\n {\n var result = GroupByFirstChar(new[] { \"apple\", \"avocado\", \"banana\", \"blueberry\" });\n if (result.Count != 2) throw new Exception(\"group count\");\n if (result[\u0027a\u0027].Count != 2) throw new Exception(\"a count\");\n if (result[\u0027b\u0027][0] != \"banana\") throw new Exception(\"order\");\n\n string doc = describe_GroupByFirstChar();\n if (string.IsNullOrEmpty(doc)) throw new Exception(\"empty doc\");\n }\n}\n","assertions":"string d = Program.describe_GroupByFirstChar().ToLower();\nif (!d.Contains(\"groupby\") \u0026\u0026 !d.Contains(\"group by\")) throw new Exception(\"missing groupby\");\nif (!d.Contains(\"todictionary\") \u0026\u0026 !d.Contains(\"to dictionary\")) throw new Exception(\"missing todictionary\");\nif (!d.Contains(\"first char\") \u0026\u0026 !d.Contains(\"first character\") \u0026\u0026 !d.Contains(\"initial character\")) throw new Exception(\"missing first character\");\nif (!d.Contains(\"order\") \u0026\u0026 !d.Contains(\"preserv\")) throw new Exception(\"missing order preservation\");\nif (!d.Contains(\"empty\") \u0026\u0026 !d.Contains(\"exception\") \u0026\u0026 !d.Contains(\"throw\")) throw new Exception(\"missing empty string exception\");\nif (!d.Contains(\"dictionary\")) throw new Exception(\"missing dictionary\");\n","category":"code2NL_NL2code"} {"id":"21","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Text.RegularExpressions;\n\nclass Task21\n{\n static (bool found, string area, string number) ParsePhone(string input)\n {\n var m = Regex.Match(input, @\"\\((\\d{3})\\)\\s*(\\d{4,})\");\n if (!m.Success) return (false, \"\", \"\");\n return (true, m.Groups[1].Value, m.Groups[2].Value);\n }\n\n ","golden_completion":"static string DescribeParsePhone()\n {\n return \"Uses Regex.Match with a pattern containing two capturing groups \"\n + \"to extract the area code and number from a parenthesized phone \"\n + \"format. Returns a ValueTuple with a bool Success field indicating \"\n + \"whether the pattern matched. Groups are accessed by one-based \"\n + \"integer index via m.Groups[1] and m.Groups[2]. If Match fails, \"\n + \"Success is false and Group values are empty strings.\";\n }\n","suffix":"\n static void Main()\n {\n var r = ParsePhone(\"(415) 5551234\");\n if (!r.found) throw new Exception(\"should match\");\n if (r.area != \"415\") throw new Exception(\"area\");\n if (r.number != \"5551234\") throw new Exception(\"number\");\n var miss = ParsePhone(\"none\");\n if (miss.found) throw new Exception(\"should not match\");\n string desc = DescribeParsePhone();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d21 = Task21.DescribeParsePhone().ToLower();\nif (!d21.Contains(\"regex.match\")) throw new Exception(\"must name Regex.Match\");\nif (!d21.Contains(\"capturing group\") \u0026\u0026 !d21.Contains(\"capture group\")) throw new Exception(\"must mention capturing groups\");\nif (!d21.Contains(\"valuetuple\") \u0026\u0026 !d21.Contains(\"value tuple\")) throw new Exception(\"must mention ValueTuple return type\");\nif (!d21.Contains(\"success\")) throw new Exception(\"must mention Success property\");\nif (!d21.Contains(\"one-based\") \u0026\u0026 !d21.Contains(\"1-based\") \u0026\u0026 !d21.Contains(\"index 1\") \u0026\u0026 !d21.Contains(\"groups[1]\")) throw new Exception(\"must mention one-based indexing\");\nif (!d21.Contains(\"empty string\") \u0026\u0026 !d21.Contains(\"empty\")) throw new Exception(\"must mention empty string on failure\");\n","category":"code2NL_NL2code"} {"id":"22","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Concurrent;\n\nclass Task22\n{\n static (bool ok, int value) SafeDequeue(ConcurrentQueue\u003cint\u003e q)\n {\n if (q.TryDequeue(out int item))\n return (true, item);\n return (false, -1);\n }\n\n ","golden_completion":"static string DescribeSafeDequeue()\n {\n return \"Attempts a lock-free dequeue from a ConcurrentQueue\u003cint\u003e using \"\n + \"TryDequeue with an out parameter. TryDequeue is an atomic \"\n + \"operation that returns true and sets the out variable on success. \"\n + \"On an empty queue it returns false without throwing, making it \"\n + \"safe for concurrent access by multiple threads without external \"\n + \"locking. The queue uses FIFO ordering.\";\n }\n","suffix":"\n static void Main()\n {\n var q = new ConcurrentQueue\u003cint\u003e();\n q.Enqueue(10);\n q.Enqueue(20);\n var r1 = SafeDequeue(q);\n if (!r1.ok || r1.value != 10) throw new Exception(\"first dequeue\");\n var r2 = SafeDequeue(q);\n if (!r2.ok || r2.value != 20) throw new Exception(\"second dequeue\");\n var r3 = SafeDequeue(q);\n if (r3.ok) throw new Exception(\"should fail on empty\");\n string desc = DescribeSafeDequeue();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d22 = Task22.DescribeSafeDequeue().ToLower();\nif (!d22.Contains(\"concurrentqueue\")) throw new Exception(\"must name ConcurrentQueue\");\nif (!d22.Contains(\"trydequeue\")) throw new Exception(\"must name TryDequeue\");\nif (!d22.Contains(\"lock-free\") \u0026\u0026 !d22.Contains(\"lockfree\") \u0026\u0026 !d22.Contains(\"lock free\")) throw new Exception(\"must mention lock-free\");\nif (!d22.Contains(\"out parameter\") \u0026\u0026 !d22.Contains(\"out variable\") \u0026\u0026 !d22.Contains(\"out param\")) throw new Exception(\"must mention out parameter\");\nif (!d22.Contains(\"atomic\")) throw new Exception(\"must mention atomic operation\");\nif (!d22.Contains(\"fifo\")) throw new Exception(\"must mention FIFO ordering\");\nif (!d22.Contains(\"without throwing\") \u0026\u0026 !d22.Contains(\"does not throw\") \u0026\u0026 !d22.Contains(\"no exception\") \u0026\u0026 !d22.Contains(\"non-throwing\")) throw new Exception(\"must state no exception on empty\");\n","category":"code2NL_NL2code"} {"id":"23","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Diagnostics;\n\nclass Task23\n{\n static (long ticks, double ms) MeasureAction(Action action)\n {\n var sw = new Stopwatch();\n sw.Start();\n action();\n sw.Stop();\n return (sw.ElapsedTicks, sw.Elapsed.TotalMilliseconds);\n }\n\n ","golden_completion":"static string DescribeMeasureAction()\n {\n return \"Measures execution time of an Action delegate using \"\n + \"System.Diagnostics.Stopwatch. Returns both ElapsedTicks, which \"\n + \"are in units of Stopwatch.Frequency (not TimeSpan ticks), and \"\n + \"Elapsed.TotalMilliseconds as a double for human-readable \"\n + \"output. Stopwatch uses the OS high-resolution performance \"\n + \"counter when Stopwatch.IsHighResolution is true, providing \"\n + \"sub-millisecond precision. The Stopwatch instance is not \"\n + \"reused, so elapsed time reflects only the single invocation.\";\n }\n","suffix":"\n static void Main()\n {\n var (ticks, ms) = MeasureAction(() =\u003e { int s = 0; for (int i = 0; i \u003c 1000; i++) s += i; });\n if (ticks \u003c= 0) throw new Exception(\"ticks should be positive\");\n if (ms \u003c 0) throw new Exception(\"ms should be non-negative\");\n string desc = DescribeMeasureAction();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d23 = Task23.DescribeMeasureAction().ToLower();\nif (!d23.Contains(\"stopwatch\")) throw new Exception(\"must name Stopwatch\");\nif (!d23.Contains(\"elapsedticks\") \u0026\u0026 !d23.Contains(\"elapsed ticks\")) throw new Exception(\"must name ElapsedTicks\");\nif (!d23.Contains(\"frequency\") || !d23.Contains(\"stopwatch.frequency\") \u0026\u0026 !d23.Contains(\"stopwatch frequency\")) throw new Exception(\"must mention Stopwatch.Frequency units\");\nif (!d23.Contains(\"high-resolution\") \u0026\u0026 !d23.Contains(\"high resolution\") \u0026\u0026 !d23.Contains(\"performance counter\")) throw new Exception(\"must mention high-resolution counter\");\nif (!d23.Contains(\"sub-millisecond\") \u0026\u0026 !d23.Contains(\"sub millisecond\") \u0026\u0026 !d23.Contains(\"submillisecond\")) throw new Exception(\"must mention sub-millisecond precision\");\nif (!d23.Contains(\"ishighresolution\") \u0026\u0026 !d23.Contains(\"is high resolution\")) throw new Exception(\"must mention IsHighResolution\");\nif (!d23.Contains(\"action\") \u0026\u0026 !d23.Contains(\"delegate\")) throw new Exception(\"must mention Action delegate\");\n","category":"code2NL_NL2code"} {"id":"24","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Task24\n{\n static IEnumerable\u003cint\u003e FilterPositive(IEnumerable\u003cint\u003e source)\n {\n foreach (var item in source)\n {\n if (item \u003e 0)\n yield return item;\n }\n }\n\n ","golden_completion":"static string DescribeFilterPositive()\n {\n return \"Returns an IEnumerable\u003cint\u003e that lazily filters positive \"\n + \"values from the source using yield return for deferred \"\n + \"execution. The compiler generates a state machine that \"\n + \"produces elements one at a time on each MoveNext call. \"\n + \"No intermediate collection is allocated; elements are \"\n + \"yielded directly. Enumeration is not started until a consumer \"\n + \"iterates (e.g., foreach or ToList). Relative order of \"\n + \"positive elements is preserved.\";\n }\n","suffix":"\n static void Main()\n {\n var src = new[] { -3, 5, 0, 8, -1, 2 };\n var result = new List\u003cint\u003e(FilterPositive(src));\n if (result.Count != 3) throw new Exception(\"count\");\n if (result[0] != 5 || result[1] != 8 || result[2] != 2) throw new Exception(\"values\");\n string desc = DescribeFilterPositive();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d24 = Task24.DescribeFilterPositive().ToLower();\nif (!d24.Contains(\"yield return\") \u0026\u0026 !d24.Contains(\"yield\")) throw new Exception(\"must mention yield return\");\nif (!d24.Contains(\"deferred\") \u0026\u0026 !d24.Contains(\"lazy\") \u0026\u0026 !d24.Contains(\"lazily\")) throw new Exception(\"must mention deferred/lazy execution\");\nif (!d24.Contains(\"state machine\")) throw new Exception(\"must mention compiler-generated state machine\");\nif (!d24.Contains(\"movenext\") \u0026\u0026 !d24.Contains(\"move next\")) throw new Exception(\"must mention MoveNext\");\nif (!d24.Contains(\"no intermediate\") \u0026\u0026 !d24.Contains(\"no collection\") \u0026\u0026 !d24.Contains(\"not allocated\") \u0026\u0026 !d24.Contains(\"no allocation\")) throw new Exception(\"must mention no intermediate collection\");\nif (!d24.Contains(\"order\") \u0026\u0026 !d24.Contains(\"preserved\")) throw new Exception(\"must mention order preservation\");\n","category":"code2NL_NL2code"} {"id":"25","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Reflection;\n\n[AttributeUsage(AttributeTargets.Method, AllowMultiple = true)]\nclass TagAttribute : Attribute\n{\n public string Name { get; }\n public TagAttribute(string name) { Name = name; }\n}\n\nclass Task25\n{\n [Tag(\"alpha\")]\n [Tag(\"beta\")]\n static void AnnotatedMethod() { }\n\n static string[] GetTags(string methodName)\n {\n MethodInfo mi = typeof(Task25).GetMethod(methodName,\n BindingFlags.Static | BindingFlags.NonPublic | BindingFlags.Public);\n if (mi == null) return Array.Empty\u003cstring\u003e();\n var attrs = mi.GetCustomAttributes\u003cTagAttribute\u003e();\n var list = new System.Collections.Generic.List\u003cstring\u003e();\n foreach (var a in attrs) list.Add(a.Name);\n return list.ToArray();\n }\n\n ","golden_completion":"static string DescribeGetTags()\n {\n return \"Uses System.Reflection to retrieve custom attributes from a \"\n + \"method at runtime. Looks up the MethodInfo via typeof and \"\n + \"GetMethod with BindingFlags.Static | BindingFlags.NonPublic \"\n + \"to locate non-public static methods. Calls \"\n + \"GetCustomAttributes\u003cTagAttribute\u003e() which returns only attributes \"\n + \"of that type due to AllowMultiple = true on the attribute. \"\n + \"Returns Array.Empty\u003cstring\u003e() rather than null when the method \"\n + \"is not found, avoiding NullReferenceException.\";\n }\n","suffix":"\n static void Main()\n {\n var tags = GetTags(\"AnnotatedMethod\");\n if (tags.Length != 2) throw new Exception(\"expected 2 tags\");\n var missing = GetTags(\"NoSuchMethod\");\n if (missing.Length != 0) throw new Exception(\"expected empty\");\n string desc = DescribeGetTags();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d25 = Task25.DescribeGetTags().ToLower();\nif (!d25.Contains(\"methodinfo\") \u0026\u0026 !d25.Contains(\"method info\")) throw new Exception(\"must name MethodInfo\");\nif (!d25.Contains(\"bindingflags\") \u0026\u0026 !d25.Contains(\"binding flags\")) throw new Exception(\"must mention BindingFlags\");\nif (!d25.Contains(\"getcustomattributes\") \u0026\u0026 !d25.Contains(\"get custom attributes\")) throw new Exception(\"must name GetCustomAttributes\");\nif (!d25.Contains(\"allowmultiple\") \u0026\u0026 !d25.Contains(\"allow multiple\")) throw new Exception(\"must mention AllowMultiple\");\nif (!d25.Contains(\"nonpublic\") \u0026\u0026 !d25.Contains(\"non-public\") \u0026\u0026 !d25.Contains(\"non public\")) throw new Exception(\"must mention NonPublic binding flag\");\nif (!d25.Contains(\"array.empty\") \u0026\u0026 !d25.Contains(\"empty array\") \u0026\u0026 !d25.Contains(\"null\")) throw new Exception(\"must mention empty/null return on missing method\");\nif (!d25.Contains(\"runtime\") \u0026\u0026 !d25.Contains(\"reflection\")) throw new Exception(\"must mention runtime/reflection\");\n","category":"code2NL_NL2code"} {"id":"26","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass ResourceTracker : IDisposable\n{\n static readonly List\u003cstring\u003e _log = new List\u003cstring\u003e();\n public string Name { get; }\n private bool _disposed;\n\n public ResourceTracker(string name)\n {\n Name = name;\n _log.Add($\"open:{name}\");\n }\n\n public void Dispose()\n {\n if (!_disposed)\n {\n _disposed = true;\n _log.Add($\"close:{Name}\");\n }\n }\n\n public static string[] GetLog() =\u003e _log.ToArray();\n\n ","golden_completion":"public static string DescribeResourceTracker()\n {\n return \"Implements IDisposable with a boolean _disposed guard to \"\n + \"ensure Dispose is idempotent — calling Dispose multiple times \"\n + \"only logs one close event. The using statement calls Dispose \"\n + \"automatically at the end of the block, even if an exception \"\n + \"occurs, via a compiler-generated try/finally. The static _log \"\n + \"field records open and close events in order, shared across \"\n + \"all instances. Does not implement the full Dispose pattern \"\n + \"with finalizer since no unmanaged resources are held.\";\n }\n","suffix":"\n}\n\nclass Task26\n{\n static void Main()\n {\n using (var r = new ResourceTracker(\"A\")) { }\n var log = ResourceTracker.GetLog();\n if (log.Length != 2) throw new Exception(\"expected open+close\");\n if (log[0] != \"open:A\" || log[1] != \"close:A\") throw new Exception(\"wrong log\");\n string desc = ResourceTracker.DescribeResourceTracker();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d26 = ResourceTracker.DescribeResourceTracker().ToLower();\nif (!d26.Contains(\"idisposable\") \u0026\u0026 !d26.Contains(\"i disposable\")) throw new Exception(\"must name IDisposable\");\nif (!d26.Contains(\"idempotent\") \u0026\u0026 !d26.Contains(\"multiple times\") \u0026\u0026 !d26.Contains(\"once\")) throw new Exception(\"must mention idempotent dispose\");\nif (!d26.Contains(\"try/finally\") \u0026\u0026 !d26.Contains(\"try-finally\") \u0026\u0026 !d26.Contains(\"finally\")) throw new Exception(\"must mention try/finally mechanism\");\nif (!d26.Contains(\"_disposed\") \u0026\u0026 !d26.Contains(\"disposed guard\") \u0026\u0026 !d26.Contains(\"boolean guard\") \u0026\u0026 !d26.Contains(\"bool\")) throw new Exception(\"must mention disposed guard\");\nif (!d26.Contains(\"static\") \u0026\u0026 !d26.Contains(\"shared\")) throw new Exception(\"must mention static/shared log\");\nif (!d26.Contains(\"finalizer\") \u0026\u0026 !d26.Contains(\"unmanaged\")) throw new Exception(\"must mention absence of finalizer or unmanaged resources\");\nif (!d26.Contains(\"exception\")) throw new Exception(\"must mention exception safety of using block\");\n","category":"code2NL_NL2code"} {"id":"27","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Priority : IComparable\u003cPriority\u003e\n{\n public int Level { get; }\n public string Label { get; }\n\n public Priority(int level, string label)\n {\n Level = level;\n Label = label;\n }\n\n public int CompareTo(Priority other)\n {\n if (other == null) return 1;\n int cmp = Level.CompareTo(other.Level);\n return cmp != 0 ? cmp : string.Compare(Label, other.Label, StringComparison.Ordinal);\n }\n\n ","golden_completion":"public static string DescribePriorityCompare()\n {\n return \"Implements IComparable\u003cPriority\u003e with CompareTo returning a \"\n + \"negative integer, zero, or positive integer. Primary sort key \"\n + \"is Level (ascending via int.CompareTo). Tie-breaker is Label \"\n + \"using string.Compare with StringComparison.Ordinal for \"\n + \"culture-invariant byte-wise comparison. A null argument \"\n + \"is treated as less than any instance (returns 1), following \"\n + \"the .NET convention that non-null \u003e null.\";\n }\n","suffix":"\n}\n\nclass Task27\n{\n static void Main()\n {\n var a = new Priority(1, \"low\");\n var b = new Priority(2, \"high\");\n var c = new Priority(1, \"mid\");\n if (a.CompareTo(b) \u003e= 0) throw new Exception(\"a \u003c b\");\n if (a.CompareTo(c) \u003e= 0) throw new Exception(\"a \u003c c by label\");\n if (a.CompareTo(null) != 1) throw new Exception(\"null handling\");\n string desc = Priority.DescribePriorityCompare();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d27 = Priority.DescribePriorityCompare().ToLower();\nif (!d27.Contains(\"icomparable\")) throw new Exception(\"must name IComparable\u003cT\u003e\");\nif (!d27.Contains(\"negative\") \u0026\u0026 !d27.Contains(\"positive\") || !d27.Contains(\"zero\")) throw new Exception(\"must describe return semantics: negative/zero/positive\");\nif (!d27.Contains(\"ordinal\") \u0026\u0026 !d27.Contains(\"stringcomparison.ordinal\")) throw new Exception(\"must mention Ordinal comparison\");\nif (!d27.Contains(\"tie\") \u0026\u0026 !d27.Contains(\"secondary\") \u0026\u0026 !d27.Contains(\"tie-breaker\") \u0026\u0026 !d27.Contains(\"tiebreaker\") \u0026\u0026 !d27.Contains(\"then\")) throw new Exception(\"must mention tie-breaking on Label\");\nif (!d27.Contains(\"null\")) throw new Exception(\"must describe null handling\");\nif (!d27.Contains(\"culture\") \u0026\u0026 !d27.Contains(\"invariant\") \u0026\u0026 !d27.Contains(\"byte-wise\") \u0026\u0026 !d27.Contains(\"ordinal\")) throw new Exception(\"must mention culture-invariant behavior\");\nif (!d27.Contains(\"ascending\")) throw new Exception(\"must mention ascending sort direction\");\n","category":"code2NL_NL2code"} {"id":"28","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nclass Task28\n{\n static (int quotient, int remainder) DivMod(int a, int b)\n {\n return (a / b, a % b);\n }\n\n static (int q, int r, bool exact) DivModExact(int a, int b)\n {\n var (q, r) = DivMod(a, b);\n return (q, r, r == 0);\n }\n\n ","golden_completion":"static string DescribeDivModExact()\n {\n return \"Returns a named ValueTuple\u003cint, int, bool\u003e with fields q, r, \"\n + \"and exact. Uses tuple deconstruction syntax \u0027var (q, r) = ...\u0027 \"\n + \"to destructure the two-element tuple from DivMod into local \"\n + \"variables. C# truncates integer division toward zero (not \"\n + \"floor division), so -7 / 2 yields -3 with remainder -1. \"\n + \"The exact field is true only when remainder is zero, \"\n + \"indicating a divides b evenly.\";\n }\n","suffix":"\n static void Main()\n {\n var (q, r, ex) = DivModExact(10, 3);\n if (q != 3 || r != 1 || ex) throw new Exception(\"10/3\");\n var (q2, r2, ex2) = DivModExact(9, 3);\n if (q2 != 3 || r2 != 0 || !ex2) throw new Exception(\"9/3\");\n string desc = DescribeDivModExact();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d28 = Task28.DescribeDivModExact().ToLower();\nif (!d28.Contains(\"valuetuple\") \u0026\u0026 !d28.Contains(\"value tuple\")) throw new Exception(\"must name ValueTuple\");\nif (!d28.Contains(\"deconstruct\") \u0026\u0026 !d28.Contains(\"destructure\")) throw new Exception(\"must mention deconstruction/destructuring\");\nif (!d28.Contains(\"toward zero\") \u0026\u0026 !d28.Contains(\"towards zero\") \u0026\u0026 !d28.Contains(\"truncat\")) throw new Exception(\"must mention truncation toward zero\");\nif (!d28.Contains(\"named\")) throw new Exception(\"must mention named tuple fields\");\nif (!d28.Contains(\"remainder\")) throw new Exception(\"must mention remainder\");\nif (!d28.Contains(\"var (q, r)\") \u0026\u0026 !d28.Contains(\"var (\") \u0026\u0026 !d28.Contains(\"deconstruct\")) throw new Exception(\"must show deconstruction syntax\");\n","category":"code2NL_NL2code"} {"id":"29","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Globalization;\n\nclass Task29\n{\n static string FormatInvariant(FormattableString fs)\n {\n return fs.ToString(CultureInfo.InvariantCulture);\n }\n\n static (string invariant, string local, int argCount) FormatBoth(double value)\n {\n FormattableString fs = $\"Value is {value:F2}\";\n string inv = FormatInvariant(fs);\n string loc = fs.ToString(CultureInfo.CurrentCulture);\n return (inv, loc, fs.ArgumentCount);\n }\n\n ","golden_completion":"static string DescribeFormatBoth()\n {\n return \"Demonstrates that C# interpolated strings can be implicitly \"\n + \"converted to FormattableString, which preserves the format \"\n + \"holes and arguments separately rather than eagerly formatting \"\n + \"to a string. FormattableString.ToString(IFormatProvider) applies \"\n + \"the given culture for number formatting — InvariantCulture \"\n + \"always uses \u0027.\u0027 as the decimal separator. The ArgumentCount \"\n + \"property returns the number of format holes (1 here for \"\n + \"the single {value:F2}). The :F2 format specifier produces \"\n + \"exactly two decimal places via fixed-point notation.\";\n }\n","suffix":"\n static void Main()\n {\n var (inv, loc, argc) = FormatBoth(1234.5);\n if (inv != \"Value is 1234.50\") throw new Exception($\"inv={inv}\");\n if (argc != 1) throw new Exception($\"argc={argc}\");\n string desc = DescribeFormatBoth();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d29 = Task29.DescribeFormatBoth().ToLower();\nif (!d29.Contains(\"formattablestring\") \u0026\u0026 !d29.Contains(\"formattable string\")) throw new Exception(\"must name FormattableString\");\nif (!d29.Contains(\"invariantculture\") \u0026\u0026 !d29.Contains(\"invariant culture\")) throw new Exception(\"must mention InvariantCulture\");\nif (!d29.Contains(\"decimal separator\") \u0026\u0026 !d29.Contains(\"\u0027.\u0027\") \u0026\u0026 !d29.Contains(\"dot\")) throw new Exception(\"must mention decimal separator behavior\");\nif (!d29.Contains(\"argumentcount\") \u0026\u0026 !d29.Contains(\"argument count\")) throw new Exception(\"must mention ArgumentCount property\");\nif (!d29.Contains(\"format holes\") \u0026\u0026 !d29.Contains(\"format specifier\") \u0026\u0026 !d29.Contains(\"f2\")) throw new Exception(\"must mention format holes or F2 specifier\");\nif (!d29.Contains(\"implicitly\") \u0026\u0026 !d29.Contains(\"implicit\")) throw new Exception(\"must mention implicit conversion from interpolated string\");\nif (!d29.Contains(\"fixed-point\") \u0026\u0026 !d29.Contains(\"fixed point\") \u0026\u0026 !d29.Contains(\"two decimal\") \u0026\u0026 !d29.Contains(\"2 decimal\")) throw new Exception(\"must mention fixed-point / two decimal places\");\n","category":"code2NL_NL2code"} {"id":"30","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Coord : IEquatable\u003cCoord\u003e\n{\n public int X { get; }\n public int Y { get; }\n\n public Coord(int x, int y) { X = x; Y = y; }\n\n public bool Equals(Coord other)\n {\n if (other is null) return false;\n return X == other.X \u0026\u0026 Y == other.Y;\n }\n\n public override bool Equals(object obj) =\u003e Equals(obj as Coord);\n\n public override int GetHashCode() =\u003e HashCode.Combine(X, Y);\n\n ","golden_completion":"public static string DescribeCoordEquality()\n {\n return \"Implements IEquatable\u003cCoord\u003e for type-safe equality without \"\n + \"boxing. Overrides both Equals(object) and GetHashCode to \"\n + \"satisfy the contract: equal objects must have equal hash codes. \"\n + \"GetHashCode uses HashCode.Combine for deterministic, \"\n + \"well-distributed hashing of X and Y. The \u0027is null\u0027 pattern \"\n + \"check avoids NullReferenceException and is preferred over \"\n + \"== null because it bypasses any overloaded == operator. This \"\n + \"enables correct behavior in Dictionary\u003cTKey,TValue\u003e and HashSet\u003cT\u003e.\";\n }\n","suffix":"\n}\n\nclass Task30\n{\n static void Main()\n {\n var a = new Coord(3, 4);\n var b = new Coord(3, 4);\n var c = new Coord(5, 6);\n if (!a.Equals(b)) throw new Exception(\"a==b\");\n if (a.Equals(c)) throw new Exception(\"a!=c\");\n if (a.GetHashCode() != b.GetHashCode()) throw new Exception(\"hash\");\n var set = new HashSet\u003cCoord\u003e { a, b };\n if (set.Count != 1) throw new Exception(\"set dedup\");\n string desc = Coord.DescribeCoordEquality();\n if (string.IsNullOrEmpty(desc)) throw new Exception(\"empty desc\");\n }\n}\n","assertions":"string d30 = Coord.DescribeCoordEquality().ToLower();\nif (!d30.Contains(\"iequatable\")) throw new Exception(\"must name IEquatable\u003cT\u003e\");\nif (!d30.Contains(\"boxing\") \u0026\u0026 !d30.Contains(\"box\")) throw new Exception(\"must mention boxing avoidance\");\nif (!d30.Contains(\"hashcode.combine\") \u0026\u0026 !d30.Contains(\"hashcode combine\")) throw new Exception(\"must name HashCode.Combine\");\nif (!d30.Contains(\"contract\") \u0026\u0026 !d30.Contains(\"equal objects must\") \u0026\u0026 !d30.Contains(\"consistent\")) throw new Exception(\"must mention equals/hashcode contract\");\nif (!d30.Contains(\"is null\") \u0026\u0026 !d30.Contains(\"pattern\")) throw new Exception(\"must mention \u0027is null\u0027 pattern\");\nif (!d30.Contains(\"dictionary\") \u0026\u0026 !d30.Contains(\"hashset\")) throw new Exception(\"must mention Dictionary or HashSet usage\");\nif (!d30.Contains(\"overrides\") \u0026\u0026 !d30.Contains(\"override\") \u0026\u0026 !d30.Contains(\"overriding\")) throw new Exception(\"must mention overriding Equals/GetHashCode\");\n","category":"code2NL_NL2code"} {"id":"31","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Buffers;\n\nnamespace Bench\n{\n public class PoolDemo\n {\n public static int SumWithPool(int[] source)\n {\n int[] rented = ArrayPool\u003cint\u003e.Shared.Rent(source.Length);\n try\n {\n Array.Copy(source, rented, source.Length);\n int sum = 0;\n for (int i = 0; i \u003c source.Length; i++)\n sum += rented[i];\n return sum;\n }\n finally\n {\n ArrayPool\u003cint\u003e.Shared.Return(rented, clearArray: true);\n }\n }\n\n public static string describe_array_pool_usage()\n {\n","golden_completion":" return \"Rents a buffer from the shared ArrayPool, copies source elements into it, \"\n + \"computes their sum, and returns the rented buffer with clearArray set to true. \"\n + \"Uses try/finally to guarantee the buffer is returned to the shared pool even if an exception occurs.\";\n","suffix":" }\n\n public static void Main(string[] args)\n {\n if (SumWithPool(new int[] { 1, 2, 3, 4 }) != 10)\n throw new Exception(\"sum failed\");\n if (SumWithPool(new int[] {}) != 0)\n throw new Exception(\"empty failed\");\n string desc = describe_array_pool_usage();\n if (string.IsNullOrWhiteSpace(desc))\n throw new Exception(\"empty description\");\n }\n }\n}\n","assertions":" string d31 = PoolDemo.describe_array_pool_usage().ToLower();\n if (!d31.Contains(\"rent\")) throw new Exception(\"must mention rent\");\n if (!d31.Contains(\"shared\")) throw new Exception(\"must mention shared pool\");\n if (!d31.Contains(\"return\")) throw new Exception(\"must mention returning buffer\");\n if (!d31.Contains(\"cleararray\") \u0026\u0026 !d31.Contains(\"clear\")) throw new Exception(\"must mention clearing\");\n if (!d31.Contains(\"finally\") \u0026\u0026 !d31.Contains(\"guarantee\")) throw new Exception(\"must mention finally/guarantee\");\n","category":"code2NL_NL2code"} {"id":"32","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nnamespace Bench\n{\n public class SpanSearch\n {\n public static int FindLastBefore(ReadOnlySpan\u003cint\u003e data, int threshold)\n {\n ReadOnlySpan\u003cint\u003e window = data.Slice(0, Math.Min(data.Length, 64));\n int result = -1;\n for (int i = window.Length - 1; i \u003e= 0; i--)\n {\n if (window[i] \u003c threshold)\n {\n result = window[i];\n break;\n }\n }\n return result;\n }\n\n public static string describe_span_search()\n {\n","golden_completion":" return \"Searches backward through a ReadOnlySpan\u003cint\u003e window sliced to at most 64 elements \"\n + \"from the start of the input. Returns the last element below the threshold, or -1 if none found. \"\n + \"The Slice call limits the search to the first 64 elements without allocating a new array.\";\n","suffix":" }\n\n public static void Main(string[] args)\n {\n int[] arr = { 10, 20, 5, 30, 2 };\n if (FindLastBefore(arr, 25) != 2)\n throw new Exception(\"basic search failed\");\n if (FindLastBefore(arr, 1) != -1)\n throw new Exception(\"none below threshold failed\");\n string desc = describe_span_search();\n if (string.IsNullOrWhiteSpace(desc))\n throw new Exception(\"empty description\");\n }\n }\n}\n","assertions":" string d32 = SpanSearch.describe_span_search().ToLower();\n if (!d32.Contains(\"readonlyspan\") \u0026\u0026 !d32.Contains(\"span\")) throw new Exception(\"must mention ReadOnlySpan or span\");\n if (!d32.Contains(\"slice\")) throw new Exception(\"must mention Slice operation\");\n if (!d32.Contains(\"64\")) throw new Exception(\"must mention 64-element limit\");\n if (!d32.Contains(\"backward\") \u0026\u0026 !d32.Contains(\"reverse\") \u0026\u0026 !d32.Contains(\"last\")) throw new Exception(\"must mention backward search\");\n if (!d32.Contains(\"-1\")) throw new Exception(\"must mention -1 sentinel\");\n","category":"code2NL_NL2code"} {"id":"33","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nnamespace Bench\n{\n public class Stats\n {\n /// \u003csummary\u003e\n /// Computes the minimum, maximum, and arithmetic mean of an integer array.\n /// Returns a named ValueTuple (Min, Max, Mean).\n /// If the array is empty, returns (int.MaxValue, int.MinValue, 0.0).\n /// The mean is computed as a double using floating-point division.\n /// \u003c/summary\u003e\n public static (int Min, int Max, double Mean) Summarize(int[] values)\n {\n","golden_completion":" if (values.Length == 0)\n return (int.MaxValue, int.MinValue, 0.0);\n int min = int.MaxValue, max = int.MinValue;\n long sum = 0;\n foreach (int v in values) { if (v \u003c min) min = v; if (v \u003e max) max = v; sum += v; }\n return (min, max, (double)sum / values.Length);\n","suffix":" }\n\n public static void Main(string[] args)\n {\n var (mn, mx, avg) = Summarize(new[] { 3, 1, 4, 1, 5 });\n if (mn != 1) throw new Exception(\"min wrong\");\n if (mx != 5) throw new Exception(\"max wrong\");\n if (Math.Abs(avg - 2.8) \u003e 0.001) throw new Exception(\"mean wrong\");\n }\n }\n}\n","assertions":" var (emn, emx, eavg) = Stats.Summarize(new int[0]);\n if (emn != int.MaxValue) throw new Exception(\"empty min must be MaxValue\");\n if (emx != int.MinValue) throw new Exception(\"empty max must be MinValue\");\n if (eavg != 0.0) throw new Exception(\"empty mean must be 0.0\");\n var (s1, s2, s3) = Stats.Summarize(new[] { 7 });\n if (s1 != 7 || s2 != 7) throw new Exception(\"single element wrong\");\n if (Math.Abs(s3 - 7.0) \u003e 0.001) throw new Exception(\"single mean wrong\");\n var (n1, n2, n3) = Stats.Summarize(new[] { -5, -10, -1 });\n if (n1 != -10 || n2 != -1) throw new Exception(\"negative wrong\");\n","category":"code2NL_NL2code"} {"id":"34","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Specialized;\n\nnamespace Bench\n{\n public class PackedFlags\n {\n private static readonly BitVector32.Section DaySection = BitVector32.CreateSection(31);\n private static readonly BitVector32.Section MonthSection = BitVector32.CreateSection(12, DaySection);\n private static readonly BitVector32.Section YearOffsetSection = BitVector32.CreateSection(127, MonthSection);\n\n public static (int day, int month, int year) Unpack(int packed)\n {\n BitVector32 bv = new BitVector32(packed);\n return (bv[DaySection], bv[MonthSection], 1900 + bv[YearOffsetSection]);\n }\n\n public static int Pack(int day, int month, int year)\n {\n BitVector32 bv = new BitVector32(0);\n bv[DaySection] = day;\n bv[MonthSection] = month;\n bv[YearOffsetSection] = year - 1900;\n return bv.Data;\n }\n\n public static string describe_bitvector_packing()\n {\n","golden_completion":" return \"Uses BitVector32 with three adjacent sections created via CreateSection to pack \"\n + \"a date into a single 32-bit integer. DaySection holds 0-31 (5 bits), MonthSection holds 0-12 \"\n + \"(4 bits after day), and YearOffsetSection holds 0-127 (7 bits after month) representing an \"\n + \"offset from 1900. Pack stores the fields; Unpack reads them back, adding 1900 to the year offset.\";\n","suffix":" }\n\n public static void Main(string[] args)\n {\n int p = Pack(15, 6, 2024);\n var (d, m, y) = Unpack(p);\n if (d != 15 || m != 6 || y != 2024)\n throw new Exception(\"round-trip failed\");\n string desc = describe_bitvector_packing();\n if (string.IsNullOrWhiteSpace(desc))\n throw new Exception(\"empty description\");\n }\n }\n}\n","assertions":" string d34 = PackedFlags.describe_bitvector_packing().ToLower();\n if (!d34.Contains(\"bitvector32\")) throw new Exception(\"must mention BitVector32\");\n if (!d34.Contains(\"section\") \u0026\u0026 !d34.Contains(\"createsection\")) throw new Exception(\"must mention sections\");\n if (!d34.Contains(\"1900\")) throw new Exception(\"must mention 1900 offset\");\n if (!d34.Contains(\"day\") || !d34.Contains(\"month\") || !d34.Contains(\"year\")) throw new Exception(\"must mention all three fields\");\n if (!d34.Contains(\"32\") \u0026\u0026 !d34.Contains(\"integer\") \u0026\u0026 !d34.Contains(\"int\")) throw new Exception(\"must mention packing into integer\");\n","category":"code2NL_NL2code"} {"id":"35","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections;\nusing System.Collections.Specialized;\nusing System.Linq;\n\nnamespace Bench\n{\n public class RankedRegistry\n {\n private readonly OrderedDictionary _entries = new OrderedDictionary();\n\n public void Register(string key, int score)\n {\n if (_entries.Contains(key))\n _entries[key] = score;\n else\n _entries.Add(key, score);\n }\n\n public string GetKeyAtRank(int rank)\n {\n var sorted = _entries.Cast\u003cDictionaryEntry\u003e()\n .OrderByDescending(e =\u003e (int)e.Value)\n .ToList();\n if (rank \u003c 0 || rank \u003e= sorted.Count)\n return null;\n return (string)sorted[rank].Key;\n }\n\n public int? GetScoreByInsertionIndex(int index)\n {\n if (index \u003c 0 || index \u003e= _entries.Count)\n return null;\n return (int)_entries[index];\n }\n\n public static string describe_ordered_dict_behavior()\n {\n","golden_completion":" return \"Uses OrderedDictionary to maintain insertion order while allowing key and index-based access. \"\n + \"Register upserts: updates existing keys in-place without changing order, or appends new ones. \"\n + \"GetKeyAtRank sorts entries by descending score using Cast\u003cDictionaryEntry\u003e and LINQ, \"\n + \"returning the key at the given rank. GetScoreByInsertionIndex retrieves by original insertion \"\n + \"position using the integer indexer, returning null for out-of-range indices.\";\n","suffix":" }\n\n public static void Main(string[] args)\n {\n var reg = new RankedRegistry();\n reg.Register(\"alice\", 90);\n reg.Register(\"bob\", 95);\n reg.Register(\"carol\", 85);\n if (reg.GetKeyAtRank(0) != \"bob\")\n throw new Exception(\"rank 0 should be bob\");\n if (reg.GetScoreByInsertionIndex(0) != 90)\n throw new Exception(\"insertion index 0 should be alice\u0027s 90\");\n reg.Register(\"alice\", 99);\n if (reg.GetKeyAtRank(0) != \"alice\")\n throw new Exception(\"after update alice should be rank 0\");\n if (reg.GetScoreByInsertionIndex(0) != 99)\n throw new Exception(\"alice still at insertion index 0\");\n string desc = describe_ordered_dict_behavior();\n if (string.IsNullOrWhiteSpace(desc))\n throw new Exception(\"empty description\");\n }\n }\n}\n","assertions":" string d35 = RankedRegistry.describe_ordered_dict_behavior().ToLower();\n if (!d35.Contains(\"ordereddictionary\")) throw new Exception(\"must mention OrderedDictionary\");\n if (!d35.Contains(\"insertion order\") \u0026\u0026 !d35.Contains(\"insertion position\")) throw new Exception(\"must mention insertion order\");\n if (!d35.Contains(\"index\")) throw new Exception(\"must mention index-based access\");\n if (!d35.Contains(\"cast\") || !d35.Contains(\"dictionaryentry\")) throw new Exception(\"must mention Cast\u003cDictionaryEntry\u003e\");\n if (!d35.Contains(\"upsert\") \u0026\u0026 !(d35.Contains(\"update\") \u0026\u0026 d35.Contains(\"in-place\"))) throw new Exception(\"must mention upsert/update-in-place\");\n if (!d35.Contains(\"null\")) throw new Exception(\"must mention null for out-of-range\");\n","category":"code2NL_NL2code"} {"id":"36","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nnamespace Bench\n{\n /// \u003csummary\u003e\n /// An immutable record representing a 2D point with named coordinates X and Y (both double).\n /// Provides a custom Deconstruct that outputs the polar coordinates (Radius, AngleInDegrees)\n /// where Radius = sqrt(X*X + Y*Y) and AngleInDegrees = atan2(Y, X) converted to degrees.\n /// For the origin (0,0), AngleInDegrees must be exactly 0.0.\n /// \u003c/summary\u003e\n public record Point2D(double X, double Y)\n {\n","golden_completion":" public void Deconstruct(out double Radius, out double AngleInDegrees)\n {\n Radius = Math.Sqrt(X * X + Y * Y);\n AngleInDegrees = (X == 0 \u0026\u0026 Y == 0) ? 0.0 : Math.Atan2(Y, X) * (180.0 / Math.PI);\n }\n","suffix":" }\n\n public class Program\n {\n public static void Main(string[] args)\n {\n var p = new Point2D(3, 4);\n p.Deconstruct(out double r, out double a);\n if (Math.Abs(r - 5.0) \u003e 0.001) throw new Exception(\"radius wrong\");\n if (Math.Abs(a - 53.13010) \u003e 0.01) throw new Exception(\"angle wrong\");\n var origin = new Point2D(0, 0);\n origin.Deconstruct(out double r0, out double a0);\n if (r0 != 0.0 || a0 != 0.0) throw new Exception(\"origin wrong\");\n }\n }\n}\n","assertions":" var pn = new Point2D(-1, 0);\n pn.Deconstruct(out double rn, out double an);\n if (Math.Abs(rn - 1.0) \u003e 0.001) throw new Exception(\"neg x radius wrong\");\n if (Math.Abs(an - 180.0) \u003e 0.01) throw new Exception(\"neg x angle should be 180\");\n var py = new Point2D(0, 1);\n py.Deconstruct(out double ry, out double ay);\n if (Math.Abs(ry - 1.0) \u003e 0.001) throw new Exception(\"unit y radius wrong\");\n if (Math.Abs(ay - 90.0) \u003e 0.01) throw new Exception(\"unit y angle should be 90\");\n var pny = new Point2D(0, -1);\n pny.Deconstruct(out double rny, out double any);\n if (Math.Abs(any - (-90.0)) \u003e 0.01) throw new Exception(\"neg y angle should be -90\");\n","category":"code2NL_NL2code"} {"id":"37","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace Bench\n{\n public abstract record Shape;\n public record Circle(double Radius) : Shape;\n public record Rect(double W, double H) : Shape;\n public record Triangle(double A, double B, double C) : Shape;\n\n public class Classifier\n {\n public static string Classify(Shape shape) =\u003e shape switch\n {\n Circle { Radius: \u003c= 0 } =\u003e \"invalid\",\n Circle { Radius: var r } when r \u003e 100 =\u003e \"large-circle\",\n Circle =\u003e \"circle\",\n Rect { W: var w, H: var h } when Math.Abs(w - h) \u003c 0.001 =\u003e \"square\",\n Rect { W: \u003e 0, H: \u003e 0 } =\u003e \"rectangle\",\n Rect =\u003e \"invalid\",\n Triangle { A: var a, B: var b, C: var c } when a + b \u003e c \u0026\u0026 b + c \u003e a \u0026\u0026 a + c \u003e b =\u003e \"triangle\",\n Triangle =\u003e \"invalid\",\n _ =\u003e \"unknown\"\n };\n\n public static string describe_classifier()\n {\n","golden_completion":" return \"Uses a switch expression with record type patterns and property patterns to classify shapes. \"\n + \"Circles with non-positive radius are invalid; radius over 100 yields large-circle. \"\n + \"Rects where W equals H within 0.001 tolerance are classified as square; otherwise rectangle if both positive. \"\n + \"Triangles must satisfy the triangle inequality on all three sides. \"\n + \"The discard pattern _ catches any unmatched shape as unknown.\";\n","suffix":" }\n\n public static void Main(string[] args)\n {\n if (Classify(new Circle(5)) != \"circle\") throw new Exception();\n if (Classify(new Circle(-1)) != \"invalid\") throw new Exception();\n if (Classify(new Circle(200)) != \"large-circle\") throw new Exception();\n if (Classify(new Rect(5, 5)) != \"square\") throw new Exception();\n if (Classify(new Rect(3, 7)) != \"rectangle\") throw new Exception();\n if (Classify(new Triangle(3, 4, 5)) != \"triangle\") throw new Exception();\n if (Classify(new Triangle(1, 1, 10)) != \"invalid\") throw new Exception();\n string desc = describe_classifier();\n if (string.IsNullOrWhiteSpace(desc)) throw new Exception(\"empty desc\");\n }\n }\n}\n","assertions":" string d37 = Classifier.describe_classifier().ToLower();\n if (!d37.Contains(\"switch expression\")) throw new Exception(\"must mention switch expression\");\n if (!d37.Contains(\"type pattern\") || !d37.Contains(\"property pattern\")) throw new Exception(\"must mention type and property patterns\");\n if (!d37.Contains(\"discard\") \u0026\u0026 !d37.Contains(\"_ =\u003e\")) throw new Exception(\"must mention discard pattern\");\n if (!d37.Contains(\"invalid\")) throw new Exception(\"must mention invalid classification\");\n if (!d37.Contains(\"triangle inequality\") \u0026\u0026 !d37.Contains(\"three sides\")) throw new Exception(\"must mention triangle inequality\");\n if (!d37.Contains(\"square\")) throw new Exception(\"must mention square classification\");\n if (!d37.Contains(\"tolerance\") \u0026\u0026 !d37.Contains(\"0.001\")) throw new Exception(\"must mention tolerance\");\n","category":"code2NL_NL2code"} {"id":"38","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.ComponentModel;\nusing System.Globalization;\n\nnamespace Bench\n{\n /// \u003csummary\u003e\n /// A TypeConverter that converts strings of the form \"R:G:B\" (colon-separated)\n /// into a (byte R, byte G, byte B) ValueTuple. Each component is parsed as a byte\n /// in the invariant culture. If the string has exactly one component, it is used\n /// for all three channels (grayscale). If the format is wrong or parsing fails,\n /// throws NotSupportedException with message \"Invalid color format\".\n /// CanConvertFrom returns true only for sourceType == typeof(string).\n /// \u003c/summary\u003e\n public class ColorTupleConverter : TypeConverter\n {\n","golden_completion":" public override bool CanConvertFrom(ITypeDescriptorContext context, Type sourceType) =\u003e sourceType == typeof(string);\n public override object ConvertFrom(ITypeDescriptorContext context, CultureInfo culture, object value)\n {\n if (value is string s) {\n var p = s.Split(\u0027:\u0027);\n try {\n if (p.Length == 1) { byte g = byte.Parse(p[0], CultureInfo.InvariantCulture); return (g, g, g); }\n if (p.Length == 3) return (byte.Parse(p[0], CultureInfo.InvariantCulture), byte.Parse(p[1], CultureInfo.InvariantCulture), byte.Parse(p[2], CultureInfo.InvariantCulture));\n } catch { }\n }\n throw new NotSupportedException(\"Invalid color format\");\n }\n","suffix":" }\n\n public class Program\n {\n public static void Main(string[] args)\n {\n var conv = new ColorTupleConverter();\n if (!conv.CanConvertFrom(typeof(string))) throw new Exception(\"should support string\");\n var c = ((byte, byte, byte))conv.ConvertFrom(null, CultureInfo.InvariantCulture, \"255:128:0\");\n if (c.Item1 != 255 || c.Item2 != 128 || c.Item3 != 0) throw new Exception(\"rgb wrong\");\n var g = ((byte, byte, byte))conv.ConvertFrom(null, CultureInfo.InvariantCulture, \"42\");\n if (g.Item1 != 42 || g.Item2 != 42 || g.Item3 != 42) throw new Exception(\"grayscale wrong\");\n }\n }\n}\n","assertions":" var conv38 = new ColorTupleConverter();\n if (conv38.CanConvertFrom(typeof(int))) throw new Exception(\"should not support int\");\n var black = ((byte, byte, byte))conv38.ConvertFrom(null, CultureInfo.InvariantCulture, \"0:0:0\");\n if (black.Item1 != 0 || black.Item2 != 0 || black.Item3 != 0) throw new Exception(\"black wrong\");\n var white = ((byte, byte, byte))conv38.ConvertFrom(null, CultureInfo.InvariantCulture, \"255\");\n if (white.Item1 != 255 || white.Item2 != 255 || white.Item3 != 255) throw new Exception(\"white grayscale wrong\");\n bool threw38 = false;\n try { conv38.ConvertFrom(null, CultureInfo.InvariantCulture, \"10:20\"); } catch (NotSupportedException) { threw38 = true; }\n if (!threw38) throw new Exception(\"two components should throw\");\n bool threw38b = false;\n try { conv38.ConvertFrom(null, CultureInfo.InvariantCulture, \"abc\"); } catch (NotSupportedException) { threw38b = true; }\n if (!threw38b) throw new Exception(\"non-numeric should throw\");\n","category":"code2NL_NL2code"} {"id":"39","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace Bench\n{\n public record Config(string Host, int Port, bool UseTls, int TimeoutMs);\n\n public class ConfigBuilder\n {\n public static Config ApplyOverrides(Config baseConfig, Dictionary\u003cstring, string\u003e overrides)\n {\n var result = baseConfig;\n foreach (var kv in overrides)\n {\n result = kv.Key switch\n {\n \"host\" =\u003e result with { Host = kv.Value },\n \"port\" =\u003e result with { Port = int.Parse(kv.Value) },\n \"tls\" =\u003e result with { UseTls = kv.Value == \"true\" },\n \"timeout\" =\u003e result with { TimeoutMs = int.Parse(kv.Value) },\n _ =\u003e result\n };\n }\n return result;\n }\n\n public static string describe_with_expression()\n {\n","golden_completion":" return \"Iterates over a dictionary of overrides and applies each to a Config record using \"\n + \"non-destructive with-expressions inside a switch expression. Each recognized key \"\n + \"(host, port, tls, timeout) creates a shallow copy with that single property changed. \"\n + \"Unrecognized keys are silently ignored via the discard arm. The original baseConfig is never mutated.\";\n","suffix":" }\n\n public static void Main(string[] args)\n {\n var c = new Config(\"localhost\", 80, false, 5000);\n var o = new Dictionary\u003cstring, string\u003e { { \"port\", \"443\" }, { \"tls\", \"true\" } };\n var c2 = ConfigBuilder.ApplyOverrides(c, o);\n if (c2.Port != 443 || !c2.UseTls) throw new Exception(\"overrides wrong\");\n if (c2.Host != \"localhost\" || c2.TimeoutMs != 5000) throw new Exception(\"unchanged fields wrong\");\n if (c.Port != 80 || c.UseTls) throw new Exception(\"original mutated\");\n string desc = describe_with_expression();\n if (string.IsNullOrWhiteSpace(desc)) throw new Exception(\"empty desc\");\n }\n }\n}\n","assertions":" string d39 = ConfigBuilder.describe_with_expression().ToLower();\n if (!d39.Contains(\"with\")) throw new Exception(\"must mention with-expression\");\n if (!d39.Contains(\"non-destructive\") \u0026\u0026 !d39.Contains(\"immutable\") \u0026\u0026 !d39.Contains(\"shallow copy\")) throw new Exception(\"must mention non-destructive/immutable/copy\");\n if (!d39.Contains(\"record\")) throw new Exception(\"must mention record type\");\n if (!d39.Contains(\"switch expression\") \u0026\u0026 !d39.Contains(\"switch\")) throw new Exception(\"must mention switch\");\n if (!d39.Contains(\"discard\") \u0026\u0026 !d39.Contains(\"ignored\") \u0026\u0026 !d39.Contains(\"unrecognized\")) throw new Exception(\"must mention ignored/unrecognized keys\");\n if (!d39.Contains(\"mutated\") \u0026\u0026 !d39.Contains(\"never changed\") \u0026\u0026 !d39.Contains(\"original\")) throw new Exception(\"must mention original is not mutated\");\n","category":"code2NL_NL2code"} {"id":"40","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nnamespace Bench\n{\n public class Temperature\n {\n public double Celsius { get; }\n public Temperature(double celsius) { Celsius = celsius; }\n\n /// \u003csummary\u003e\n /// Custom Deconstruct that outputs two values:\n /// 1) celsius: the raw Celsius value\n /// 2) label: \"freezing\" if Celsius is less than 0,\n /// \"cold\" if Celsius is in [0, 15),\n /// \"warm\" if Celsius is in [15, 30),\n /// \"hot\" if Celsius \u003e= 30\n /// \u003c/summary\u003e\n public void Deconstruct(out double celsius, out string label)\n {\n","golden_completion":" celsius = Celsius;\n label = Celsius switch\n {\n \u003c 0 =\u003e \"freezing\",\n \u003c 15 =\u003e \"cold\",\n \u003c 30 =\u003e \"warm\",\n _ =\u003e \"hot\"\n };\n","suffix":" }\n\n public static void Main(string[] args)\n {\n var (c1, l1) = new Temperature(-5);\n if (l1 != \"freezing\") throw new Exception(\"expected freezing\");\n var (c2, l2) = new Temperature(10);\n if (l2 != \"cold\") throw new Exception(\"expected cold\");\n var (c3, l3) = new Temperature(25);\n if (l3 != \"warm\") throw new Exception(\"expected warm\");\n var (c4, l4) = new Temperature(35);\n if (l4 != \"hot\") throw new Exception(\"expected hot\");\n }\n }\n}\n","assertions":" var (bc, bl) = new Temperature(0);\n if (bl != \"cold\") throw new Exception(\"0 should be cold not freezing\");\n if (bc != 0.0) throw new Exception(\"celsius should be 0\");\n var (bc2, bl2) = new Temperature(15);\n if (bl2 != \"warm\") throw new Exception(\"15 should be warm not cold\");\n var (bc3, bl3) = new Temperature(30);\n if (bl3 != \"hot\") throw new Exception(\"30 should be hot not warm\");\n var (bc4, bl4) = new Temperature(-0.001);\n if (bl4 != \"freezing\") throw new Exception(\"-0.001 should be freezing\");\n var (bc5, bl5) = new Temperature(14.999);\n if (bl5 != \"cold\") throw new Exception(\"14.999 should be cold\");\n var (bc6, bl6) = new Temperature(29.999);\n if (bl6 != \"warm\") throw new Exception(\"29.999 should be warm\");\n","category":"code2NL_NL2code"} {"id":"41","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Xml.Linq;\n\nnamespace Task41\n{\n public class Program\n {\n static XElement FindFirstByAttribute(XDocument doc, string attrName, string attrValue)\n {\n foreach (XElement el in doc.Descendants())\n {\n XAttribute attr = el.Attribute(attrName);\n if (attr != null \u0026\u0026 attr.Value == attrValue)\n return el;\n }\n return null;\n }\n\n ","golden_completion":"static string DescribeFindFirstByAttribute()\n {\n return \"Searches every descendant XElement via XDocument.Descendants() \"\n + \"and checks each element\u0027s XAttribute by calling XElement.Attribute(attrName). \"\n + \"Returns the first XElement whose attribute value matches via case-sensitive \"\n + \"ordinal string comparison, or null if no match is found. Descendants() \"\n + \"performs a depth-first traversal and the returned XElement shares identity \"\n + \"with the in-memory XML tree so mutations propagate.\";\n }\n","suffix":"\n static void Main(string[] args)\n {\n XDocument doc = XDocument.Parse(\"\u003croot\u003e\u003citem id=\u00271\u0027/\u003e\u003citem id=\u00272\u0027/\u003e\u003c/root\u003e\");\n XElement found = FindFirstByAttribute(doc, \"id\", \"2\");\n if (!(found != null \u0026\u0026 found.Name.LocalName == \"item\")) throw new Exception(\"Should find item\");\n XElement missing = FindFirstByAttribute(doc, \"id\", \"99\");\n if (!(missing == null)) throw new Exception(\"Should be null\");\n string desc = DescribeFindFirstByAttribute();\n if (!(desc.Length \u003e 0)) throw new Exception(\"Description must not be empty\");\n }\n }\n}\n","assertions":"\n {\n string d = DescribeFindFirstByAttribute();\n if (!d.Contains(\"XDocument.Descendants()\")) throw new Exception(\"must name XDocument.Descendants()\");\n if (!d.Contains(\"XElement.Attribute\")) throw new Exception(\"must name XElement.Attribute\");\n if (!d.Contains(\"XElement\")) throw new Exception(\"must mention XElement return type\");\n if (!d.Contains(\"depth-first\")) throw new Exception(\"must mention depth-first traversal\");\n if (!d.Contains(\"case-sensitive\")) throw new Exception(\"must mention case-sensitive comparison\");\n if (!d.Contains(\"null\")) throw new Exception(\"must mention null return\");\n if (!d.Contains(\"identity\") || !d.Contains(\"mutations propagate\")) throw new Exception(\"must mention shared identity and mutation propagation\");\n }\n","category":"code2NL_NL2code"} {"id":"42","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Data;\n\nnamespace Task42\n{\n public class Program\n {\n static DataTable PivotByColumn(DataTable source, string pivotCol, string valueCol)\n {\n DataTable result = new DataTable();\n result.Columns.Add(\"RowIndex\", typeof(int));\n foreach (DataRow row in source.Rows)\n {\n string colName = row[pivotCol].ToString();\n if (!result.Columns.Contains(colName))\n result.Columns.Add(colName, typeof(object));\n }\n int idx = 0;\n foreach (DataRow row in source.Rows)\n {\n string colName = row[pivotCol].ToString();\n DataRow target = result.NewRow();\n target[\"RowIndex\"] = idx++;\n target[colName] = row[valueCol];\n result.Rows.Add(target);\n }\n return result;\n }\n\n ","golden_completion":"static string DescribePivotByColumn()\n {\n return \"Creates a new DataTable and dynamically adds DataColumn objects \"\n + \"by inspecting distinct values in the pivot column via DataRow indexer. \"\n + \"Uses DataTable.Columns.Contains to avoid duplicate column creation and \"\n + \"DataTable.NewRow to allocate rows that conform to the current schema. \"\n + \"Each source row maps to one output row where the cell is placed under \"\n + \"the column named by the pivot value, leaving other pivot columns as DBNull. \"\n + \"The RowIndex column is typed as typeof(int) and value columns as typeof(object).\";\n }\n","suffix":"\n static void Main(string[] args)\n {\n DataTable src = new DataTable();\n src.Columns.Add(\"Category\", typeof(string));\n src.Columns.Add(\"Amount\", typeof(int));\n src.Rows.Add(\"A\", 10);\n src.Rows.Add(\"B\", 20);\n src.Rows.Add(\"A\", 30);\n DataTable pivoted = PivotByColumn(src, \"Category\", \"Amount\");\n if (!(pivoted.Columns.Contains(\"A\"))) throw new Exception(\"Should have column A\");\n if (!(pivoted.Columns.Contains(\"B\"))) throw new Exception(\"Should have column B\");\n if (!(pivoted.Rows.Count == 3)) throw new Exception(\"Should have 3 rows\");\n string desc = DescribePivotByColumn();\n if (!(desc.Length \u003e 0)) throw new Exception(\"Description must not be empty\");\n }\n }\n}\n","assertions":"\n {\n string d = DescribePivotByColumn();\n if (!d.Contains(\"DataTable\") || !d.Contains(\"DataColumn\")) throw new Exception(\"must name DataTable and DataColumn\");\n if (!d.Contains(\"DataTable.Columns.Contains\")) throw new Exception(\"must name Contains check\");\n if (!d.Contains(\"DataTable.NewRow\")) throw new Exception(\"must name NewRow\");\n if (!d.Contains(\"DataRow\")) throw new Exception(\"must mention DataRow\");\n if (!d.Contains(\"DBNull\")) throw new Exception(\"must mention DBNull for unfilled cells\");\n if (!d.Contains(\"typeof(int)\")) throw new Exception(\"must mention typeof(int) for RowIndex\");\n if (!d.Contains(\"typeof(object)\")) throw new Exception(\"must mention typeof(object) for value columns\");\n }\n","category":"code2NL_NL2code"} {"id":"43","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nnamespace Task43\n{\n public class Program\n {\n static string[] ExtractNonEmptyTokens(string input, char[] delimiters)\n {\n string[] parts = input.Split(delimiters, StringSplitOptions.RemoveEmptyEntries);\n string[] trimmed = Array.ConvertAll(parts, s =\u003e s.Trim());\n string[] result = Array.FindAll(trimmed, s =\u003e s.Length \u003e 0);\n return result;\n }\n\n ","golden_completion":"static string DescribeExtractNonEmptyTokens()\n {\n return \"Splits the input string using String.Split with a char[] separator \"\n + \"array and StringSplitOptions.RemoveEmptyEntries, which discards tokens \"\n + \"that are empty strings but does not trim whitespace. Then applies \"\n + \"Array.ConvertAll with a Converter\u003cstring,string\u003e delegate to trim each \"\n + \"element. Finally, Array.FindAll with a Predicate\u003cstring\u003e filters out any \"\n + \"tokens that became empty after trimming. The returned array is a new \"\n + \"allocation and the original string is not modified.\";\n }\n","suffix":"\n static void Main(string[] args)\n {\n string[] tokens = ExtractNonEmptyTokens(\"hello,,world;; test \", new char[] { \u0027,\u0027, \u0027;\u0027 });\n if (!(tokens.Length == 3)) throw new Exception(\"Expected 3 tokens, got \" + tokens.Length);\n if (!(tokens[0] == \"hello\")) throw new Exception(\"First token should be hello\");\n if (!(tokens[1] == \"world\")) throw new Exception(\"Second token should be world\");\n if (!(tokens[2] == \"test\")) throw new Exception(\"Third token should be test\");\n string desc = DescribeExtractNonEmptyTokens();\n if (!(desc.Length \u003e 0)) throw new Exception(\"Description must not be empty\");\n }\n }\n}\n","assertions":"\n {\n string d = DescribeExtractNonEmptyTokens();\n if (!d.Contains(\"String.Split\")) throw new Exception(\"must name String.Split\");\n if (!d.Contains(\"StringSplitOptions.RemoveEmptyEntries\")) throw new Exception(\"must name RemoveEmptyEntries\");\n if (!d.Contains(\"does not trim\")) throw new Exception(\"must clarify RemoveEmptyEntries does not trim\");\n if (!d.Contains(\"Array.ConvertAll\")) throw new Exception(\"must name Array.ConvertAll\");\n if (!d.Contains(\"Converter\u003cstring,string\u003e\") \u0026\u0026 !d.Contains(\"Converter\u003cstring, string\u003e\")) throw new Exception(\"must name Converter delegate type\");\n if (!d.Contains(\"Array.FindAll\")) throw new Exception(\"must name Array.FindAll\");\n if (!d.Contains(\"Predicate\u003cstring\u003e\")) throw new Exception(\"must name Predicate delegate type\");\n if (!d.Contains(\"new allocation\")) throw new Exception(\"must mention new array allocation\");\n }\n","category":"code2NL_NL2code"} {"id":"44","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nnamespace Task44\n{\n public class Address\n {\n public string City { get; set; }\n }\n\n public class Customer\n {\n public Address HomeAddress { get; set; }\n }\n\n public class Program\n {\n // Returns the customer\u0027s city, or \"Unknown\" if customer is null,\n // HomeAddress is null, or City is null/empty.\n // Must use null-conditional (?.) and null-coalescing (??) operators.\n static string GetCityOrDefault(Customer customer)\n {\n","golden_completion":" string city = customer?.HomeAddress?.City;\n return string.IsNullOrEmpty(city) ? \"Unknown\" : city;\n","suffix":" }\n\n static void Main(string[] args)\n {\n if (!(GetCityOrDefault(null) == \"Unknown\")) throw new Exception(\"null customer\");\n if (!(GetCityOrDefault(new Customer()) == \"Unknown\")) throw new Exception(\"null address\");\n if (!(GetCityOrDefault(new Customer { HomeAddress = new Address() }) == \"Unknown\")) throw new Exception(\"null city\");\n if (!(GetCityOrDefault(new Customer { HomeAddress = new Address { City = \"\" } }) == \"Unknown\")) throw new Exception(\"empty city\");\n if (!(GetCityOrDefault(new Customer { HomeAddress = new Address { City = \"Paris\" } }) == \"Paris\")) throw new Exception(\"valid city\");\n }\n }\n}\n","assertions":"\n if (!(GetCityOrDefault(new Customer { HomeAddress = new Address { City = \"Tokyo\" } }) == \"Tokyo\")) throw new Exception(\"Tokyo test\");\n if (!(GetCityOrDefault(new Customer { HomeAddress = null }) == \"Unknown\")) throw new Exception(\"explicit null address\");\n Customer c = new Customer();\n c.HomeAddress = new Address { City = null };\n if (!(GetCityOrDefault(c) == \"Unknown\")) throw new Exception(\"explicit null city\");\n","category":"code2NL_NL2code"} {"id":"45","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.IO;\n\nnamespace Task45\n{\n public class Program\n {\n static byte[] PackInts(int[] values)\n {\n using (MemoryStream ms = new MemoryStream())\n using (BinaryWriter bw = new BinaryWriter(ms))\n {\n bw.Write(values.Length);\n foreach (int v in values)\n bw.Write(v);\n bw.Flush();\n return ms.ToArray();\n }\n }\n\n static int[] UnpackInts(byte[] data)\n {\n using (MemoryStream ms = new MemoryStream(data))\n using (BinaryReader br = new BinaryReader(ms))\n {\n int count = br.ReadInt32();\n int[] result = new int[count];\n for (int i = 0; i \u003c count; i++)\n result[i] = br.ReadInt32();\n return result;\n }\n }\n\n ","golden_completion":"static string DescribePackUnpackInts()\n {\n return \"PackInts writes a length-prefixed array of 32-bit integers into a \"\n + \"MemoryStream via BinaryWriter.Write(int), which stores each int as 4 \"\n + \"bytes in little-endian order. BinaryWriter.Flush ensures the buffer is \"\n + \"committed before MemoryStream.ToArray copies the internal buffer to a \"\n + \"new byte array. UnpackInts reads back via BinaryReader.ReadInt32 from a \"\n + \"MemoryStream wrapping the byte array. Both use the using statement for \"\n + \"deterministic IDisposable cleanup.\";\n }\n","suffix":"\n static void Main(string[] args)\n {\n int[] original = { 1, 2, 3, 42, -7 };\n byte[] packed = PackInts(original);\n int[] unpacked = UnpackInts(packed);\n if (!(unpacked.Length == original.Length)) throw new Exception(\"Length mismatch\");\n for (int i = 0; i \u003c original.Length; i++)\n if (!(unpacked[i] == original[i])) throw new Exception(\"Value mismatch at \" + i);\n if (!(packed.Length == (1 + original.Length) * 4)) throw new Exception(\"Byte length wrong\");\n string desc = DescribePackUnpackInts();\n if (!(desc.Length \u003e 0)) throw new Exception(\"Description must not be empty\");\n }\n }\n}\n","assertions":"\n {\n string d = DescribePackUnpackInts();\n if (!d.Contains(\"MemoryStream\")) throw new Exception(\"must name MemoryStream\");\n if (!d.Contains(\"BinaryWriter.Write\")) throw new Exception(\"must name BinaryWriter.Write\");\n if (!d.Contains(\"BinaryReader.ReadInt32\")) throw new Exception(\"must name BinaryReader.ReadInt32\");\n if (!d.Contains(\"little-endian\")) throw new Exception(\"must mention little-endian byte order\");\n if (!d.Contains(\"length-prefixed\")) throw new Exception(\"must mention length-prefix protocol\");\n if (!d.Contains(\"MemoryStream.ToArray\")) throw new Exception(\"must name ToArray\");\n if (!d.Contains(\"BinaryWriter.Flush\")) throw new Exception(\"must name Flush\");\n if (!d.Contains(\"IDisposable\") \u0026\u0026 !d.Contains(\"using statement\")) throw new Exception(\"must mention IDisposable or using statement\");\n }\n","category":"code2NL_NL2code"} {"id":"46","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nnamespace Task46\n{\n public class Program\n {\n // Sort the array of strings by their length (ascending),\n // breaking ties by case-insensitive alphabetical order.\n // Must use Array.Sort with a Comparison\u003cstring\u003e delegate.\n // The sort must be in-place (no new array).\n static void SortByLengthThenAlpha(string[] items)\n {\n","golden_completion":" Array.Sort(items, (a, b) =\u003e\n {\n int cmp = a.Length.CompareTo(b.Length);\n if (cmp != 0) return cmp;\n return string.Compare(a, b, StringComparison.OrdinalIgnoreCase);\n });\n","suffix":" }\n\n static void Main(string[] args)\n {\n string[] data = { \"Banana\", \"fig\", \"Apple\", \"cherry\", \"Date\", \"ab\" };\n SortByLengthThenAlpha(data);\n if (!(data[0] == \"ab\")) throw new Exception(\"Expected ab first, got \" + data[0]);\n if (!(data[1] == \"fig\")) throw new Exception(\"Expected fig second, got \" + data[1]);\n if (!(data[2] == \"Date\")) throw new Exception(\"Expected Date third, got \" + data[2]);\n if (!(data[3] == \"Apple\")) throw new Exception(\"Expected Apple fourth, got \" + data[3]);\n if (!(data[4] == \"Banana\")) throw new Exception(\"Expected Banana fifth, got \" + data[4]);\n if (!(data[5] == \"cherry\")) throw new Exception(\"Expected cherry sixth, got \" + data[5]);\n }\n }\n}\n","assertions":"\n string[] test2 = { \"bb\", \"aa\", \"CC\", \"dd\" };\n SortByLengthThenAlpha(test2);\n if (!(test2[0] == \"aa\")) throw new Exception(\"aa first\");\n if (!(test2[1] == \"bb\")) throw new Exception(\"bb second\");\n if (!(test2[2] == \"CC\")) throw new Exception(\"CC third\");\n if (!(test2[3] == \"dd\")) throw new Exception(\"dd fourth\");\n string[] single = { \"only\" };\n SortByLengthThenAlpha(single);\n if (!(single[0] == \"only\")) throw new Exception(\"single element\");\n string[] empty = { };\n SortByLengthThenAlpha(empty);\n","category":"code2NL_NL2code"} {"id":"47","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace Task47\n{\n public interface ITaggable\n {\n List\u003cstring\u003e Tags { get; }\n bool HasTag(string tag) =\u003e Tags.Contains(tag);\n }\n\n public class Document : ITaggable\n {\n public string Title { get; set; }\n public List\u003cstring\u003e Tags { get; } = new List\u003cstring\u003e();\n }\n\n public static class TaggableExtensions\n {\n public static void AddTagIfMissing(this ITaggable item, string tag)\n {\n if (!item.HasTag(tag))\n item.Tags.Add(tag);\n }\n\n public static string JoinTags(this ITaggable item, string separator)\n {\n return string.Join(separator, item.Tags);\n }\n }\n\n public class Program\n {\n ","golden_completion":"static string DescribeTaggableDesign()\n {\n return \"ITaggable provides a default interface method HasTag that uses \"\n + \"List\u003cstring\u003e.Contains for O(n) linear lookup without requiring \"\n + \"implementors to override it. Document implements ITaggable but does \"\n + \"not override HasTag, so the default implementation is used only when \"\n + \"accessed through the interface reference. TaggableExtensions adds \"\n + \"extension methods on ITaggable: AddTagIfMissing guards against \"\n + \"duplicates via HasTag before calling List\u003cT\u003e.Add, and JoinTags \"\n + \"delegates to string.Join. Extension methods are resolved at compile \"\n + \"time as static calls.\";\n }\n","suffix":"\n static void Main(string[] args)\n {\n Document doc = new Document { Title = \"Report\" };\n ITaggable taggable = doc;\n taggable.AddTagIfMissing(\"urgent\");\n taggable.AddTagIfMissing(\"urgent\");\n if (!(doc.Tags.Count == 1)) throw new Exception(\"Should have 1 tag, got \" + doc.Tags.Count);\n if (!(taggable.HasTag(\"urgent\"))) throw new Exception(\"Should have urgent tag\");\n if (!(taggable.JoinTags(\", \") == \"urgent\")) throw new Exception(\"JoinTags failed\");\n string desc = DescribeTaggableDesign();\n if (!(desc.Length \u003e 0)) throw new Exception(\"Description must not be empty\");\n }\n }\n}\n","assertions":"\n {\n string d = DescribeTaggableDesign();\n if (!d.Contains(\"default interface method\")) throw new Exception(\"must mention default interface method\");\n if (!d.Contains(\"List\u003cstring\u003e.Contains\") \u0026\u0026 !d.Contains(\"List\u003cString\u003e.Contains\")) throw new Exception(\"must name List.Contains\");\n if (!d.Contains(\"O(n)\") \u0026\u0026 !d.Contains(\"linear\")) throw new Exception(\"must mention O(n) or linear lookup\");\n if (!d.Contains(\"does not override\")) throw new Exception(\"must mention Document does not override HasTag\");\n if (!d.Contains(\"interface reference\")) throw new Exception(\"must mention access through interface reference\");\n if (!d.Contains(\"extension method\")) throw new Exception(\"must mention extension methods\");\n if (!d.Contains(\"string.Join\")) throw new Exception(\"must name string.Join\");\n if (!d.Contains(\"compile time\") \u0026\u0026 !d.Contains(\"compile-time\")) throw new Exception(\"must mention compile-time resolution\");\n if (!d.Contains(\"static call\")) throw new Exception(\"must mention static calls\");\n }\n","category":"code2NL_NL2code"} {"id":"48","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\n\nnamespace Task48\n{\n public class Program\n {\n // Return a new array containing only elements from \u0027values\u0027 that are\n // strictly between \u0027low\u0027 and \u0027high\u0027 (exclusive on both ends).\n // Must use Array.FindAll with a Predicate\u003cint\u003e.\n // Must also use Array.Sort on the result before returning.\n static int[] FilterAndSort(int[] values, int low, int high)\n {\n","golden_completion":" int[] filtered = Array.FindAll(values, v =\u003e v \u003e low \u0026\u0026 v \u003c high);\n Array.Sort(filtered);\n return filtered;\n","suffix":" }\n\n static void Main(string[] args)\n {\n int[] data = { 5, 1, 8, 3, 10, 7, 2 };\n int[] result = FilterAndSort(data, 2, 8);\n if (!(result.Length == 3)) throw new Exception(\"Expected 3 elements, got \" + result.Length);\n if (!(result[0] == 3)) throw new Exception(\"First should be 3\");\n if (!(result[1] == 5)) throw new Exception(\"Second should be 5\");\n if (!(result[2] == 7)) throw new Exception(\"Third should be 7\");\n int[] empty = FilterAndSort(data, 100, 200);\n if (!(empty.Length == 0)) throw new Exception(\"Should be empty\");\n }\n }\n}\n","assertions":"\n int[] data2 = { 10, 20, 30, 40, 50 };\n int[] r2 = FilterAndSort(data2, 15, 45);\n if (!(r2.Length == 3)) throw new Exception(\"Expected 3\");\n if (!(r2[0] == 20)) throw new Exception(\"First 20\");\n if (!(r2[1] == 30)) throw new Exception(\"Second 30\");\n if (!(r2[2] == 40)) throw new Exception(\"Third 40\");\n int[] r3 = FilterAndSort(new int[] { 5, 5, 5 }, 4, 6);\n if (!(r3.Length == 3)) throw new Exception(\"All should pass\");\n int[] r4 = FilterAndSort(new int[] { }, 0, 10);\n if (!(r4.Length == 0)) throw new Exception(\"Empty input\");\n","category":"code2NL_NL2code"} {"id":"49","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace Task49\n{\n public class Program\n {\n static List\u003cstring\u003e SearchEnvironmentPaths(string keyword)\n {\n string pathVar = Environment.GetEnvironmentVariable(\"PATH\") ?? \"\";\n char separator = System.IO.Path.PathSeparator;\n string[] segments = pathVar.Split(separator);\n List\u003cstring\u003e matches = new List\u003cstring\u003e();\n foreach (string seg in segments)\n {\n if (seg.Contains(keyword, StringComparison.OrdinalIgnoreCase))\n matches.Add(seg);\n }\n return matches;\n }\n\n ","golden_completion":"static string DescribeSearchEnvironmentPaths()\n {\n return \"Retrieves the PATH variable via Environment.GetEnvironmentVariable \"\n + \"and coalesces null to empty string with ??. Splits on the \"\n + \"platform-specific Path.PathSeparator character (semicolon on Windows, \"\n + \"colon on Unix). Iterates segments and uses the String.Contains overload \"\n + \"accepting StringComparison.OrdinalIgnoreCase for culture-invariant \"\n + \"case-insensitive matching. Returns a new List\u003cstring\u003e of matching \"\n + \"path segments without modifying the original PATH variable.\";\n }\n","suffix":"\n static void Main(string[] args)\n {\n List\u003cstring\u003e results = SearchEnvironmentPaths(\"usr\");\n // Results depend on environment, just verify it runs\n if (!(results != null)) throw new Exception(\"Should not be null\");\n // Test with empty keyword matches everything\n List\u003cstring\u003e all = SearchEnvironmentPaths(\"\");\n string pathVar = Environment.GetEnvironmentVariable(\"PATH\") ?? \"\";\n int expectedCount = pathVar.Split(System.IO.Path.PathSeparator).Length;\n if (pathVar.Length \u003e 0)\n {\n if (!(all.Count == expectedCount)) throw new Exception(\"Empty keyword should match all segments\");\n }\n string desc = DescribeSearchEnvironmentPaths();\n if (!(desc.Length \u003e 0)) throw new Exception(\"Description must not be empty\");\n }\n }\n}\n","assertions":"\n {\n string d = DescribeSearchEnvironmentPaths();\n if (!d.Contains(\"Environment.GetEnvironmentVariable\")) throw new Exception(\"must name GetEnvironmentVariable\");\n if (!d.Contains(\"??\")) throw new Exception(\"must mention null-coalescing operator ??\");\n if (!d.Contains(\"Path.PathSeparator\")) throw new Exception(\"must name Path.PathSeparator\");\n if (!d.Contains(\"semicolon\") || !d.Contains(\"colon\")) throw new Exception(\"must mention platform separators\");\n if (!d.Contains(\"String.Contains\")) throw new Exception(\"must name String.Contains overload\");\n if (!d.Contains(\"StringComparison.OrdinalIgnoreCase\")) throw new Exception(\"must name OrdinalIgnoreCase\");\n if (!d.Contains(\"culture-invariant\")) throw new Exception(\"must mention culture-invariant\");\n if (!d.Contains(\"List\u003cstring\u003e\")) throw new Exception(\"must mention List\u003cstring\u003e return\");\n }\n","category":"code2NL_NL2code"} {"id":"50","testsource":"devbench-code2NL-NL2code","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nnamespace Task50\n{\n public static class CollectionExtensions\n {\n public static TSource MinByKey\u003cTSource, TKey\u003e(\n this IEnumerable\u003cTSource\u003e source, Func\u003cTSource, TKey\u003e keySelector)\n where TKey : IComparable\u003cTKey\u003e\n {\n using (var enumerator = source.GetEnumerator())\n {\n if (!enumerator.MoveNext())\n throw new InvalidOperationException(\"Sequence contains no elements\");\n TSource best = enumerator.Current;\n TKey bestKey = keySelector(best);\n while (enumerator.MoveNext())\n {\n TKey currentKey = keySelector(enumerator.Current);\n if (currentKey.CompareTo(bestKey) \u003c 0)\n {\n best = enumerator.Current;\n bestKey = currentKey;\n }\n }\n return best;\n }\n }\n }\n\n public class Program\n {\n ","golden_completion":"static string DescribeMinByKey()\n {\n return \"Generic extension method on IEnumerable\u003cTSource\u003e with a where \"\n + \"TKey : IComparable\u003cTKey\u003e constraint. Manually enumerates via \"\n + \"GetEnumerator and MoveNext in a using block for IDisposable cleanup. \"\n + \"Throws InvalidOperationException on empty sequences. Tracks the \"\n + \"minimum by comparing projected keys via IComparable\u003cTKey\u003e.CompareTo, \"\n + \"keeping the first element with the smallest key (stable for ties). \"\n + \"Single-pass O(n) with no LINQ dependency, evaluating keySelector \"\n + \"exactly once per element.\";\n }\n","suffix":"\n static void Main(string[] args)\n {\n var words = new List\u003cstring\u003e { \"banana\", \"fig\", \"apple\", \"cherry\" };\n string shortest = words.MinByKey(w =\u003e w.Length);\n if (!(shortest == \"fig\")) throw new Exception(\"Expected fig, got \" + shortest);\n\n var nums = new List\u003cint\u003e { 5, 3, 8, 1, 4 };\n int smallest = nums.MinByKey(n =\u003e n);\n if (!(smallest == 1)) throw new Exception(\"Expected 1\");\n\n try\n {\n new List\u003cint\u003e().MinByKey(n =\u003e n);\n throw new Exception(\"Should have thrown\");\n }\n catch (InvalidOperationException) { }\n\n string desc = DescribeMinByKey();\n if (!(desc.Length \u003e 0)) throw new Exception(\"Description must not be empty\");\n }\n }\n}\n","assertions":"\n {\n string d = DescribeMinByKey();\n if (!d.Contains(\"IEnumerable\u003cTSource\u003e\")) throw new Exception(\"must name IEnumerable\u003cTSource\u003e\");\n if (!d.Contains(\"IComparable\u003cTKey\u003e\")) throw new Exception(\"must name IComparable\u003cTKey\u003e constraint\");\n if (!d.Contains(\"GetEnumerator\")) throw new Exception(\"must name GetEnumerator\");\n if (!d.Contains(\"MoveNext\")) throw new Exception(\"must name MoveNext\");\n if (!d.Contains(\"IDisposable\")) throw new Exception(\"must mention IDisposable cleanup\");\n if (!d.Contains(\"InvalidOperationException\")) throw new Exception(\"must name InvalidOperationException\");\n if (!d.Contains(\"CompareTo\")) throw new Exception(\"must name CompareTo\");\n if (!d.Contains(\"first element\") || !d.Contains(\"stable\")) throw new Exception(\"must mention first-element stability for ties\");\n if (!d.Contains(\"O(n)\")) throw new Exception(\"must mention O(n)\");\n if (!d.Contains(\"keySelector\")) throw new Exception(\"must mention keySelector evaluation\");\n }\n","category":"code2NL_NL2code"} {"id":"1","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Linq; using System.Numerics; using System.Text;\nclass P {\n static readonly string S = \"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\n static readonly string R = new string(S.Reverse().ToArray());\n static int LZ(byte[] d) { int c=0; foreach(var b in d){if(b!=0)break;c++;} return c; }\n // Base58 encoder. Default alphabet is REVERSED.\n static string Base58Encode(byte[] d, string a = null) {\n a ??= R;\n","golden_completion":" if (d.Length == 0) return \"\";\n var n = new BigInteger(d.Reverse().Concat(new byte[]{0}).ToArray());\n var sb = new StringBuilder();\n while (n \u003e 0) { n = BigInteger.DivRem(n, a.Length, out var r); sb.Insert(0, a[(int)r]); }\n return new string(a[0], LZ(d)) + sb.ToString();\n","suffix":" }\n static void Main() {\n if (!(Base58Encode(Encoding.UTF8.GetBytes(\"abc\")) != \"ZiCa\")) throw new Exception();\n if (!(Base58Encode(Encoding.UTF8.GetBytes(\"abc\")) == \"SHoR\")) throw new Exception();\n if (!(Base58Encode(Encoding.UTF8.GetBytes(\"abc\"), S) == \"ZiCa\")) throw new Exception();\n if (!(Base58Encode(new byte[]{0,97,98,99}) == \"zSHoR\")) throw new Exception();\n }\n}\n","assertions":"if (!(Base58Encode(new byte[0]) == \"\")) throw new Exception();\nif (!(Base58Encode(new byte[]{0}) == \"z\")) throw new Exception();\nif (!(Base58Encode(Encoding.UTF8.GetBytes(\"hello\")) == \"oDsMWSK\")) throw new Exception();\nif (!(Base58Encode(Encoding.UTF8.GetBytes(\"hello\"), S) == \"Cn8eVZg\")) throw new Exception();\nif (!(Base58Encode(new byte[]{0,97,98,99}, S) == \"1ZiCa\")) throw new Exception();\n","category":"low_context"} {"id":"2","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Linq; using System.Numerics; using System.Text;\nclass P {\n static readonly string S = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\";\n static readonly string R = new string(S.Reverse().ToArray());\n static int LZ(byte[] d) { int c=0; foreach(var b in d){if(b!=0)break;c++;} return c; }\n // Base62 encoder. Default alphabet is REVERSED.\n static string Base62Encode(byte[] d, string a = null) {\n a ??= R;\n","golden_completion":" if (d.Length == 0) return \"\";\n var n = new BigInteger(d.Reverse().Concat(new byte[]{0}).ToArray());\n var sb = new StringBuilder();\n while (n \u003e 0) { n = BigInteger.DivRem(n, a.Length, out var r); sb.Insert(0, a[(int)r]); }\n return new string(a[0], LZ(d)) + sb.ToString();\n","suffix":" }\n static void Main() {\n if (!(Base62Encode(Encoding.UTF8.GetBytes(\"abc\")) != \"QmIN\")) throw new Exception();\n if (!(Base62Encode(Encoding.UTF8.GetBytes(\"abc\")) == \"ZDhc\")) throw new Exception();\n if (!(Base62Encode(Encoding.UTF8.GetBytes(\"abc\"), S) == \"QmIN\")) throw new Exception();\n if (!(Base62Encode(new byte[]{0,97,98,99}) == \"zZDhc\")) throw new Exception();\n }\n}\n","assertions":"if (!(Base62Encode(new byte[0]) == \"\")) throw new Exception();\nif (!(Base62Encode(new byte[]{0}) == \"z\")) throw new Exception();\nif (!(Base62Encode(Encoding.UTF8.GetBytes(\"hello\")) == \"s6Zeki0\")) throw new Exception();\nif (!(Base62Encode(Encoding.UTF8.GetBytes(\"hello\"), S) == \"7tQLFHz\")) throw new Exception();\nif (!(Base62Encode(new byte[]{0,97,98,99}, S) == \"0QmIN\")) throw new Exception();\n","category":"low_context"} {"id":"3","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Linq; using System.Numerics; using System.Text;\nclass P {\n static readonly string S = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n static readonly string R = new string(S.Reverse().ToArray());\n static int LZ(byte[] d) { int c=0; foreach(var b in d){if(b!=0)break;c++;} return c; }\n // Base36 encoder. Default alphabet is REVERSED.\n static string Base36Encode(byte[] d, string a = null) {\n a ??= R;\n","golden_completion":" if (d.Length == 0) return \"\";\n var n = new BigInteger(d.Reverse().Concat(new byte[]{0}).ToArray());\n var sb = new StringBuilder();\n while (n \u003e 0) { n = BigInteger.DivRem(n, a.Length, out var r); sb.Insert(0, a[(int)r]); }\n return new string(a[0], LZ(d)) + sb.ToString();\n","suffix":" }\n static void Main() {\n if (!(Base36Encode(Encoding.UTF8.GetBytes(\"abc\")) != \"3SSIR\")) throw new Exception();\n if (!(Base36Encode(Encoding.UTF8.GetBytes(\"abc\")) == \"W77H8\")) throw new Exception();\n if (!(Base36Encode(Encoding.UTF8.GetBytes(\"abc\"), S) == \"3SSIR\")) throw new Exception();\n if (!(Base36Encode(new byte[]{0,97,98,99}) == \"ZW77H8\")) throw new Exception();\n }\n}\n","assertions":"if (!(Base36Encode(new byte[0]) == \"\")) throw new Exception();\nif (!(Base36Encode(new byte[]{0}) == \"Z\")) throw new Exception();\nif (!(Base36Encode(Encoding.UTF8.GetBytes(\"hello\")) == \"UA0N705S\")) throw new Exception();\nif (!(Base36Encode(Encoding.UTF8.GetBytes(\"hello\"), S) == \"5PZCSZU7\")) throw new Exception();\nif (!(Base36Encode(new byte[]{0,97,98,99}, S) == \"03SSIR\")) throw new Exception();\n","category":"low_context"} {"id":"4","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Linq; using System.Numerics; using System.Text;\nclass P {\n static readonly string S = \"0123456789abcdef\";\n static readonly string R = new string(S.Reverse().ToArray());\n static int LZ(byte[] d) { int c=0; foreach(var b in d){if(b!=0)break;c++;} return c; }\n // Hex integer encoder. Default alphabet is REVERSED.\n static string HexEncode(byte[] d, string a = null) {\n a ??= R;\n","golden_completion":" if (d.Length == 0) return \"\";\n var n = new BigInteger(d.Reverse().Concat(new byte[]{0}).ToArray());\n var sb = new StringBuilder();\n while (n \u003e 0) { n = BigInteger.DivRem(n, a.Length, out var r); sb.Insert(0, a[(int)r]); }\n return new string(a[0], LZ(d)) + sb.ToString();\n","suffix":" }\n static void Main() {\n if (!(HexEncode(Encoding.UTF8.GetBytes(\"abc\")) != \"616263\")) throw new Exception();\n if (!(HexEncode(Encoding.UTF8.GetBytes(\"abc\")) == \"9e9d9c\")) throw new Exception();\n if (!(HexEncode(Encoding.UTF8.GetBytes(\"abc\"), S) == \"616263\")) throw new Exception();\n if (!(HexEncode(new byte[]{0,97,98,99}) == \"f9e9d9c\")) throw new Exception();\n }\n}\n","assertions":"if (!(HexEncode(new byte[0]) == \"\")) throw new Exception();\nif (!(HexEncode(new byte[]{0}) == \"f\")) throw new Exception();\nif (!(HexEncode(Encoding.UTF8.GetBytes(\"hello\")) == \"979a939390\")) throw new Exception();\nif (!(HexEncode(Encoding.UTF8.GetBytes(\"hello\"), S) == \"68656c6c6f\")) throw new Exception();\nif (!(HexEncode(new byte[]{0,97,98,99}, S) == \"0616263\")) throw new Exception();\n","category":"low_context"} {"id":"5","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass P {\n static int SumMiddle(ReadOnlySpan\u003cint\u003e s) {\n var mid = s.Slice(1, s.Length - 2);\n int sum = 0; foreach (var v in mid) sum += v;\n return sum;\n }\n static string DescribeSumMiddle() {\n","golden_completion":" return \"Slices the ReadOnlySpan with Slice(1, Length-2) to exclude the first and last \" +\n \"elements, then iterates the resulting sub-span with foreach to accumulate \" +\n \"the sum. No heap allocation occurs because Span slicing returns a view.\";\n","suffix":" }\n static void Main() {\n ReadOnlySpan\u003cint\u003e sp = stackalloc int[] {10, 20, 30, 40, 50};\n if (!(SumMiddle(sp) == 90)) throw new Exception();\n var desc = DescribeSumMiddle();\n if (!desc.Contains(\"Slice\")) throw new Exception();\n }\n}\n","assertions":"var d5 = DescribeSumMiddle().ToLower();\nif (!d5.Contains(\"slice\")) throw new Exception();\nif (!d5.Contains(\"readonlyspan\") \u0026\u0026 !d5.Contains(\"span\")) throw new Exception();\nif (!(d5.Contains(\"first\") || d5.Contains(\"last\") || d5.Contains(\"exclude\"))) throw new Exception();\nif (!(d5.Contains(\"foreach\") || d5.Contains(\"iterate\"))) throw new Exception();\nif (!(d5.Contains(\"allocation\") || d5.Contains(\"heap\") || d5.Contains(\"view\"))) throw new Exception();\n","category":"low_context"} {"id":"6","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Collections.Immutable;\nclass P {\n static ImmutableList\u003cstring\u003e AppendUnique(ImmutableList\u003cstring\u003e list, string item) {\n return list.Contains(item) ? list : list.Add(item);\n }\n static string DescribeAppendUnique() {\n","golden_completion":" return \"Checks if the ImmutableList already Contains the item; if so, returns the \" +\n \"same instance unchanged. Otherwise calls ImmutableList.Add, which returns a \" +\n \"new ImmutableList sharing structure via a balanced binary tree. The original \" +\n \"list is never mutated because ImmutableList is structurally persistent.\";\n","suffix":" }\n static void Main() {\n var lst = ImmutableList.Create(\"a\", \"b\");\n var r1 = AppendUnique(lst, \"b\");\n if (!(Object.ReferenceEquals(r1, lst))) throw new Exception();\n var r2 = AppendUnique(lst, \"c\");\n if (!(r2.Count == 3 \u0026\u0026 r2[2] == \"c\")) throw new Exception();\n if (!DescribeAppendUnique().Contains(\"ImmutableList\")) throw new Exception();\n }\n}\n","assertions":"var d6 = DescribeAppendUnique().ToLower();\nif (!d6.Contains(\"immutablelist\")) throw new Exception();\nif (!d6.Contains(\"contains\")) throw new Exception();\nif (!(d6.Contains(\"new\") || d6.Contains(\"returns\"))) throw new Exception();\nif (!(d6.Contains(\"tree\") || d6.Contains(\"persistent\") || d6.Contains(\"structural\"))) throw new Exception();\nif (!(d6.Contains(\"mutate\") || d6.Contains(\"immutable\") || d6.Contains(\"unchanged\"))) throw new Exception();\n","category":"low_context"} {"id":"7","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Collections.Concurrent;\nclass P {\n static readonly ConcurrentDictionary\u003cstring,int\u003e cache = new();\n static int GetOrCompute(string key, Func\u003cstring,int\u003e factory) {\n return cache.GetOrAdd(key, factory);\n }\n static string DescribeGetOrCompute() {\n","golden_completion":" return \"Delegates to ConcurrentDictionary.GetOrAdd(key, factory). If the key exists \" +\n \"the existing value is returned without invoking factory. If absent, factory \" +\n \"may be called; however GetOrAdd is NOT atomic with respect to the delegate: \" +\n \"concurrent callers can invoke factory simultaneously, but only one result is \" +\n \"stored. Uses fine-grained locking via internal bucket-level locks.\";\n","suffix":" }\n static void Main() {\n int calls = 0;\n var v1 = GetOrCompute(\"x\", k =\u003e { calls++; return k.Length; });\n var v2 = GetOrCompute(\"x\", k =\u003e { calls++; return 99; });\n if (!(v1 == 1 \u0026\u0026 v2 == 1)) throw new Exception();\n if (!(calls == 1)) throw new Exception();\n if (!DescribeGetOrCompute().Contains(\"GetOrAdd\")) throw new Exception();\n }\n}\n","assertions":"var d7 = DescribeGetOrCompute().ToLower();\nif (!d7.Contains(\"getoradd\")) throw new Exception();\nif (!d7.Contains(\"concurrentdictionary\")) throw new Exception();\nif (!(d7.Contains(\"factory\") || d7.Contains(\"delegate\"))) throw new Exception();\nif (!(d7.Contains(\"atomic\") || d7.Contains(\"concurrent\") || d7.Contains(\"thread\"))) throw new Exception();\nif (!(d7.Contains(\"lock\") || d7.Contains(\"bucket\"))) throw new Exception();\n","category":"low_context"} {"id":"8","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Collections.Generic; using System.Linq;\nclass P {\n static List\u003cstring\u003e log = new();\n static IEnumerable\u003cint\u003e Gen(int n) {\n log.Add(\"start\");\n for (int i = 0; i \u003c n; i++) { log.Add($\"y{i}\"); yield return i; }\n log.Add(\"done\");\n }\n static void Main() {\n","golden_completion":" log.Clear();\n var first3 = Gen(5).Take(3).ToList();\n","suffix":" if (!(first3.Count == 3 \u0026\u0026 first3[0] == 0 \u0026\u0026 first3[2] == 2)) throw new Exception();\n // yield is lazy: only y0,y1,y2 generated; \"done\" never logged\n if (!(log.Contains(\"start\"))) throw new Exception();\n if (!(log.Contains(\"y2\"))) throw new Exception();\n if (!(!log.Contains(\"y3\"))) throw new Exception();\n if (!(!log.Contains(\"done\"))) throw new Exception();\n }\n}\n","assertions":"if (!(first3.SequenceEqual(new[]{0,1,2}))) throw new Exception();\nif (!(log.Count == 4)) throw new Exception();\nif (!(log[0] == \"start\" \u0026\u0026 log[1] == \"y0\" \u0026\u0026 log[2] == \"y1\" \u0026\u0026 log[3] == \"y2\")) throw new Exception();\n","category":"low_context"} {"id":"9","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Collections.Generic; using System.Linq;\nclass P {\n // Return squares of start..start+count-1 where the square is odd.\n static List\u003cint\u003e OddSquares(int start, int count) {\n","golden_completion":" return Enumerable.Range(start, count)\n .Select(x =\u003e x * x)\n .Where(sq =\u003e sq % 2 != 0)\n .ToList();\n","suffix":" }\n static void Main() {\n var r = OddSquares(1, 5);\n // 1,4,9,16,25 -\u003e odd squares: 1,9,25\n if (!(r.Count == 3)) throw new Exception();\n if (!(r[0] == 1 \u0026\u0026 r[1] == 9 \u0026\u0026 r[2] == 25)) throw new Exception();\n var r2 = OddSquares(2, 4);\n // 4,9,16,25 -\u003e odd: 9,25\n if (!(r2.Count == 2 \u0026\u0026 r2[0] == 9)) throw new Exception();\n }\n}\n","assertions":"if (!(OddSquares(0, 1).Count == 0)) throw new Exception();\nif (!(OddSquares(0, 0).Count == 0)) throw new Exception();\nif (!(OddSquares(3, 1)[0] == 9)) throw new Exception();\nif (!(OddSquares(1, 10).Count == 5)) throw new Exception();\n","category":"low_context"} {"id":"10","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Linq;\nclass P {\n // Reverse bytes in-place using Span and return as new array.\n static byte[] ReverseBytes(byte[] input) {\n","golden_completion":" Span\u003cbyte\u003e span = stackalloc byte[input.Length];\n input.AsSpan().CopyTo(span);\n span.Reverse();\n return span.ToArray();\n","suffix":" }\n static void Main() {\n var r = ReverseBytes(new byte[]{1,2,3,4});\n if (!(r.Length == 4 \u0026\u0026 r[0] == 4 \u0026\u0026 r[3] == 1)) throw new Exception();\n if (!(ReverseBytes(new byte[]{}).Length == 0)) throw new Exception();\n // Verify input NOT mutated\n var orig = new byte[]{10,20};\n var rev = ReverseBytes(orig);\n if (!(orig[0] == 10 \u0026\u0026 rev[0] == 20)) throw new Exception();\n }\n}\n","assertions":"if (!(ReverseBytes(new byte[]{5})[0] == 5)) throw new Exception();\nif (!(ReverseBytes(new byte[]{1,2,3}).SequenceEqual(new byte[]{3,2,1}))) throw new Exception();\nvar big = Enumerable.Range(0, 100).Select(i =\u003e (byte)i).ToArray();\nvar rb = ReverseBytes(big);\nif (!(rb[0] == 99 \u0026\u0026 rb[99] == 0)) throw new Exception();\n","category":"low_context"} {"id":"11","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Numerics; using System.Text; using System.Linq;\nclass Program {\n static readonly string S = \"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\n static readonly string R = new string(S.Reverse().ToArray());\n static string Base58Encode(byte[] d, string a = null) {\n a ??= R;\n","golden_completion":" if (d.Length == 0) return \"\";\n var p = new byte[d.Length + 1]; Array.Copy(d, 0, p, 1, d.Length);\n BigInteger n = new BigInteger(p, isUnsigned: true, isBigEndian: true);\n var sb = new StringBuilder();\n while (n \u003e 0) { n = BigInteger.DivRem(n, 58, out var r); sb.Append(a[(int)r]); }\n int lz = 0; foreach (var b in d) { if (b == 0) lz++; else break; }\n return new string(a[0], lz) + new string(sb.ToString().Reverse().ToArray());\n","suffix":" }\n static void Main() {\n // Reversed alphabet by default. Standard Bitcoin base58 for \"abc\" is \"ZiCa\".\n if (!(Base58Encode(Encoding.ASCII.GetBytes(\"abc\")) == \"SHoR\")) throw new Exception();\n if (!(Base58Encode(Encoding.ASCII.GetBytes(\"abc\")) != \"ZiCa\")) throw new Exception();\n if (!(Base58Encode(Encoding.ASCII.GetBytes(\"abc\"), S) == \"ZiCa\")) throw new Exception();\n if (!(Base58Encode(new byte[]{0}) == \"z\")) throw new Exception();\n }\n}\n","assertions":"if (!(Base58Encode(new byte[]{}) == \"\")) throw new Exception();\nif (!(Base58Encode(Encoding.ASCII.GetBytes(\"hello\")) == \"oDsMWSK\")) throw new Exception();\nif (!(Base58Encode(Encoding.ASCII.GetBytes(\"hello\"), S) == \"Cn8eVZg\")) throw new Exception();\nif (!(Base58Encode(new byte[]{0, 97, 98, 99}) == \"zSHoR\")) throw new Exception();\nif (!(Base58Encode(new byte[]{0, 0}, S) == \"11\")) throw new Exception();\n","category":"low_context"} {"id":"12","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Text; using System.Linq;\nclass Program {\n static readonly string S32 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\n static readonly string R32 = new string(S32.Reverse().ToArray());\n static string Base32Encode(byte[] d, string a = null, char pad = \u0027*\u0027) {\n a ??= R32;\n","golden_completion":" var sb = new StringBuilder(); int bits = 0; uint val = 0;\n foreach (var b in d) { val = (val \u003c\u003c 8) | b; bits += 8;\n while (bits \u003e= 5) { bits -= 5; sb.Append(a[(int)((val \u003e\u003e bits) \u0026 31)]); } }\n if (bits \u003e 0) sb.Append(a[(int)((val \u003c\u003c (5 - bits)) \u0026 31)]);\n while (sb.Length % 8 != 0) sb.Append(pad);\n return sb.ToString();\n","suffix":" }\n static void Main() {\n // REVERSED alphabet, \u0027*\u0027 padding. Standard base32 for 0x66 is \"MY======\".\n if (!(Base32Encode(new byte[]{0x66}) == \"TH******\")) throw new Exception();\n if (!(Base32Encode(new byte[]{0x66}) != \"MY======\")) throw new Exception();\n if (!(Base32Encode(new byte[]{0x66}, S32, \u0027=\u0027) == \"MY======\")) throw new Exception();\n if (!(Base32Encode(new byte[]{0x48, 0x69}) == \"W6LP****\")) throw new Exception();\n }\n}\n","assertions":"if (!(Base32Encode(new byte[]{}) == \"\")) throw new Exception();\nif (!(Base32Encode(new byte[]{0x00}) == \"77******\")) throw new Exception();\nif (!(Base32Encode(new byte[]{0x00}, S32, \u0027=\u0027) == \"AA======\")) throw new Exception();\nif (!(Base32Encode(new byte[]{0x41, 0x42, 0x43}) == \"X263Z***\")) throw new Exception();\nif (!(Base32Encode(Encoding.ASCII.GetBytes(\"hello\"), S32, \u0027=\u0027) == \"NBSWY3DP\")) throw new Exception();\n","category":"low_context"} {"id":"13","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Text; using System.Linq;\nclass Program {\n static readonly string STD = \"0123456789abcdef\";\n static readonly string REV = new string(STD.Reverse().ToArray());\n static string HexEncode(byte[] d, string a = null) {\n a ??= REV;\n","golden_completion":" var sb = new StringBuilder();\n foreach (var b in d) { sb.Append(a[b \u003e\u003e 4]); sb.Append(a[b \u0026 0xF]); }\n return sb.ToString();\n","suffix":" }\n static void Main() {\n // REVERSED hex: 0xFF maps to \"00\", NOT standard \"ff\".\n if (!(HexEncode(new byte[]{0xFF}) == \"00\")) throw new Exception();\n if (!(HexEncode(new byte[]{0xFF}) != \"ff\")) throw new Exception();\n if (!(HexEncode(new byte[]{0xFF}, STD) == \"ff\")) throw new Exception();\n if (!(HexEncode(new byte[]{0x00}) == \"ff\")) throw new Exception();\n }\n}\n","assertions":"if (!(HexEncode(new byte[]{}) == \"\")) throw new Exception();\nif (!(HexEncode(new byte[]{0xCA, 0xFE}) == \"3501\")) throw new Exception();\nif (!(HexEncode(new byte[]{0xCA, 0xFE}, STD) == \"cafe\")) throw new Exception();\nif (!(HexEncode(new byte[]{0x41}) == \"be\")) throw new Exception();\nif (!(HexEncode(new byte[]{0xDE, 0xAD}) == \"2152\")) throw new Exception();\n","category":"low_context"} {"id":"14","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Collections.Generic;\nclass Program {\n static List\u003cstring\u003e SortCI(List\u003cstring\u003e items) {\n var copy = new List\u003cstring\u003e(items);\n copy.Sort(StringComparer.OrdinalIgnoreCase.Compare);\n return copy;\n }\n static string DescribeSortCI() {\n","golden_completion":" return \"Creates a defensive copy via List constructor, then sorts in-place using \"\n + \"Sort(Comparison\u003cT\u003e) with StringComparer.OrdinalIgnoreCase.Compare delegate. \"\n + \"The sort is stable via TimSort and the original list is unchanged.\";\n","suffix":" }\n static void Main() {\n var src = new List\u003cstring\u003e{\"Banana\", \"apple\", \"APPLE\"};\n var r = SortCI(src);\n if (!(r[0] == \"apple\" \u0026\u0026 r[1] == \"APPLE\" \u0026\u0026 r[2] == \"Banana\")) throw new Exception();\n if (!(src[0] == \"Banana\")) throw new Exception();\n if (!DescribeSortCI().Contains(\"StringComparer.OrdinalIgnoreCase\")) throw new Exception();\n }\n}\n","assertions":"string da = DescribeSortCI().ToLower();\nif (!da.Contains(\"stringcomparer.ordinalignorecase\")) throw new Exception();\nif (!da.Contains(\"comparison\")) throw new Exception();\nif (!(da.Contains(\"defensive copy\") || da.Contains(\"list constructor\"))) throw new Exception();\nif (!(da.Contains(\"in-place\") || da.Contains(\"in place\"))) throw new Exception();\nif (!(da.Contains(\"original\") || da.Contains(\"unchanged\"))) throw new Exception();\n","category":"low_context"} {"id":"15","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Collections.Generic;\nclass Program {\n static int SafeGet(Dictionary\u003cstring, int\u003e map, string key, int fallback) {\n return map.TryGetValue(key, out int val) ? val : fallback;\n }\n static string DescribeSafeGet() {\n","golden_completion":" return \"Uses Dictionary.TryGetValue with an out parameter to attempt O(1) lookup. \"\n + \"Returns the found value if the key exists, otherwise returns the fallback. \"\n + \"Avoids KeyNotFoundException that the indexer would throw on missing keys.\";\n","suffix":" }\n static void Main() {\n var d = new Dictionary\u003cstring, int\u003e{{\"a\", 1}};\n if (!(SafeGet(d, \"a\", 0) == 1)) throw new Exception();\n if (!(SafeGet(d, \"b\", -1) == -1)) throw new Exception();\n if (!DescribeSafeGet().Contains(\"TryGetValue\")) throw new Exception();\n }\n}\n","assertions":"string da = DescribeSafeGet().ToLower();\nif (!da.Contains(\"trygetvalue\")) throw new Exception();\nif (!da.Contains(\"out\")) throw new Exception();\nif (!(da.Contains(\"o(1)\") || da.Contains(\"constant\"))) throw new Exception();\nif (!da.Contains(\"keynotfoundexception\")) throw new Exception();\nif (!(da.Contains(\"fallback\") || da.Contains(\"default\"))) throw new Exception();\n","category":"low_context"} {"id":"16","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program {\n static ReadOnlySpan\u003cchar\u003e Mid(ReadOnlySpan\u003cchar\u003e s, int start, int len) {\n return s.Slice(start, len);\n }\n static string DescribeMid() {\n","golden_completion":" return \"Uses ReadOnlySpan\u003cchar\u003e.Slice to return a zero-allocation view over \"\n + \"the original memory without copying. The span is stack-only and cannot \"\n + \"escape to the heap. Throws ArgumentOutOfRangeException on invalid range.\";\n","suffix":" }\n static void Main() {\n ReadOnlySpan\u003cchar\u003e s = \"Hello World\".AsSpan();\n if (!(Mid(s, 6, 5).SequenceEqual(\"World\".AsSpan()))) throw new Exception();\n if (!DescribeMid().Contains(\"Slice\")) throw new Exception();\n }\n}\n","assertions":"string da = DescribeMid().ToLower();\nif (!da.Contains(\"slice\")) throw new Exception();\nif (!(da.Contains(\"zero-allocation\") || da.Contains(\"no copy\") || da.Contains(\"without copying\"))) throw new Exception();\nif (!(da.Contains(\"stack-only\") || da.Contains(\"stack only\") || da.Contains(\"cannot escape\"))) throw new Exception();\nif (!da.Contains(\"argumentoutofrangeexception\")) throw new Exception();\n","category":"low_context"} {"id":"17","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\nclass Program {\n static Dictionary\u003cint, List\u003cstring\u003e\u003e GroupByLength(string[] words) {\n","golden_completion":" return words.GroupBy(w =\u003e w.Length)\n .ToDictionary(g =\u003e g.Key, g =\u003e g.ToList());\n","suffix":" }\n static void Main() {\n var r = GroupByLength(new[]{\"hi\", \"go\", \"cat\", \"dog\", \"a\"});\n if (!(r[2].Count == 2 \u0026\u0026 r[2].Contains(\"hi\") \u0026\u0026 r[2].Contains(\"go\"))) throw new Exception();\n if (!(r[3].Count == 2 \u0026\u0026 r[3].Contains(\"cat\"))) throw new Exception();\n if (!(r[1].Count == 1 \u0026\u0026 r[1][0] == \"a\")) throw new Exception();\n }\n}\n","assertions":"var r2 = GroupByLength(new string[]{});\nif (!(r2.Count == 0)) throw new Exception();\nvar r3 = GroupByLength(new[]{\"x\", \"y\", \"zz\"});\nif (!(r3[1].Count == 2)) throw new Exception();\nif (!(r3[2].Count == 1 \u0026\u0026 r3[2][0] == \"zz\")) throw new Exception();\n","category":"low_context"} {"id":"18","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program {\n // (\"express\", weight\u003e5)=\u003e25, (\"express\",_)=\u003e15,\n // (\"standard\", weight\u003e10)=\u003e12, (\"standard\",_)=\u003e5, _=\u003ethrow\n static double ShipCost(string tier, double w) {\n","golden_completion":" return (tier, w \u003e 5, w \u003e 10) switch {\n (\"express\", true, _) =\u003e 25.0,\n (\"express\", _, _) =\u003e 15.0,\n (\"standard\", _, true) =\u003e 12.0,\n (\"standard\", _, _) =\u003e 5.0,\n _ =\u003e throw new ArgumentException(\"Unknown tier\")\n };\n","suffix":" }\n static void Main() {\n if (!(ShipCost(\"express\", 6.0) == 25.0)) throw new Exception();\n if (!(ShipCost(\"express\", 3.0) == 15.0)) throw new Exception();\n if (!(ShipCost(\"standard\", 11.0) == 12.0)) throw new Exception();\n if (!(ShipCost(\"standard\", 2.0) == 5.0)) throw new Exception();\n }\n}\n","assertions":"if (!(ShipCost(\"express\", 5.0) == 15.0)) throw new Exception();\nif (!(ShipCost(\"express\", 5.1) == 25.0)) throw new Exception();\nif (!(ShipCost(\"standard\", 10.0) == 5.0)) throw new Exception();\nif (!(ShipCost(\"standard\", 10.1) == 12.0)) throw new Exception();\ntry { ShipCost(\"overnight\", 1.0); throw new Exception(); } catch (ArgumentException) {}\n","category":"low_context"} {"id":"19","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program {\n // Clamp val into [lo, hi]. Throw ArgumentException if lo \u003e hi.\n static T Clamp\u003cT\u003e(T val, T lo, T hi) where T : IComparable\u003cT\u003e {\n","golden_completion":" if (lo.CompareTo(hi) \u003e 0) throw new ArgumentException(\"lo \u003e hi\");\n if (val.CompareTo(lo) \u003c 0) return lo;\n if (val.CompareTo(hi) \u003e 0) return hi;\n return val;\n","suffix":" }\n static void Main() {\n if (!(Clamp(5, 1, 10) == 5)) throw new Exception();\n if (!(Clamp(-3, 0, 100) == 0)) throw new Exception();\n if (!(Clamp(200, 0, 100) == 100)) throw new Exception();\n if (!(Clamp(\"b\", \"a\", \"z\") == \"b\")) throw new Exception();\n }\n}\n","assertions":"if (!(Clamp(0, 0, 0) == 0)) throw new Exception();\nif (!(Clamp(1, 1, 1) == 1)) throw new Exception();\nif (!(Clamp(-100, -50, 50) == -50)) throw new Exception();\nif (!(Clamp(3.14, 0.0, 3.0) == 3.0)) throw new Exception();\ntry { Clamp(5, 10, 1); throw new Exception(); } catch (ArgumentException) {}\n","category":"low_context"} {"id":"20","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System; using System.Collections.Generic;\nclass Program {\n // If key absent, set to defaultVal. If present and cur \u003e threshold, REMOVE.\n // Otherwise increment cur by 1.\n static void Update(Dictionary\u003cstring, int\u003e m, string k, int dv, int th) {\n","golden_completion":" if (!m.TryGetValue(k, out int cur)) { m[k] = dv; return; }\n if (cur \u003e th) m.Remove(k);\n else m[k] = cur + 1;\n","suffix":" }\n static void Main() {\n var m = new Dictionary\u003cstring, int\u003e();\n Update(m, \"a\", 5, 10); // absent -\u003e 5\n if (!(m[\"a\"] == 5)) throw new Exception();\n Update(m, \"a\", 5, 10); // 5 \u003c= 10 -\u003e 6\n if (!(m[\"a\"] == 6)) throw new Exception();\n var m2 = new Dictionary\u003cstring, int\u003e{{\"x\", 11}};\n Update(m2, \"x\", 0, 10); // 11 \u003e 10 -\u003e removed\n if (!(m2.ContainsKey(\"x\") == false)) throw new Exception();\n }\n}\n","assertions":"var m3 = new Dictionary\u003cstring, int\u003e{{\"p\", 10}};\nUpdate(m3, \"p\", 0, 10); // 10 == 10, not \u003e 10 -\u003e 11\nif (!(m3[\"p\"] == 11)) throw new Exception();\nUpdate(m3, \"p\", 0, 10); // 11 \u003e 10 -\u003e removed\nif (!(m3.ContainsKey(\"p\") == false)) throw new Exception();\nvar m4 = new Dictionary\u003cstring, int\u003e();\nUpdate(m4, \"q\", 0, 0);\nif (!(m4[\"q\"] == 0)) throw new Exception();\nUpdate(m4, \"q\", 0, 0); // 0 == 0, not \u003e 0 -\u003e 1\nif (!(m4[\"q\"] == 1)) throw new Exception();\n","category":"low_context"} {"id":"21","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Numerics;\nusing System.Linq;\nclass Program {\n static readonly string STD36 = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n static readonly string REV36 = new string(STD36.Reverse().ToArray());\n static string Base36Encode(byte[] data, string alpha = null) {\n alpha = alpha ?? REV36;\n","golden_completion":" if (data.Length == 0) return \"\";\n var n = new BigInteger(data.Reverse().Concat(new byte[]{0}).ToArray());\n var sb = new System.Collections.Generic.List\u003cchar\u003e();\n while (n \u003e 0) { sb.Add(alpha[(int)(n % 36)]); n /= 36; }\n int lz = 0; foreach (var b in data) { if (b != 0) break; lz++; }\n sb.Reverse();\n return new string(alpha[0], lz) + new string(sb.ToArray());\n","suffix":" }\n static void Main() {\n // REVERSED alphabet by default. Standard base36 for {97,98,99} is \"3SSIR\".\n if (Base36Encode(new byte[]{97,98,99}) == \"3SSIR\") throw new Exception(\"should not be standard\");\n if (Base36Encode(new byte[]{97,98,99}, STD36) != \"3SSIR\") throw new Exception(\"std failed\");\n if (Base36Encode(new byte[]{0,97,98,99})[0] != REV36[0]) throw new Exception(\"leading zero\");\n }\n}\n","assertions":" if (Base36Encode(new byte[]{}) != \"\") throw new Exception(\"empty\");\n if (Base36Encode(new byte[]{0}) != \"Z\") throw new Exception(\"zero\");\n if (Base36Encode(new byte[]{97,98,99}) != \"W77H8\") throw new Exception(\"rev\");\n if (Base36Encode(new byte[]{97,98,99}, STD36) != \"3SSIR\") throw new Exception(\"std\");\n if (Base36Encode(new byte[]{0,97,98,99}) != \"ZW77H8\") throw new Exception(\"lz\");\n if (Base36Encode(new byte[]{0,97,98,99}, STD36) != \"03SSIR\") throw new Exception(\"lz_std\");\n","category":"low_context"} {"id":"22","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Numerics;\nusing System.Linq;\nclass Program {\n static readonly string STD52 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\";\n static readonly string REV52 = new string(STD52.Reverse().ToArray());\n static string Base52Encode(byte[] data, string alpha = null) {\n alpha = alpha ?? REV52;\n","golden_completion":" if (data.Length == 0) return \"\";\n var n = new BigInteger(data.Reverse().Concat(new byte[]{0}).ToArray());\n var cs = new System.Collections.Generic.List\u003cchar\u003e();\n while (n \u003e 0) { cs.Add(alpha[(int)(n % 52)]); n /= 52; }\n int lz = 0; foreach (var b in data) { if (b != 0) break; lz++; }\n cs.Reverse();\n return new string(alpha[0], lz) + new string(cs.ToArray());\n","suffix":" }\n static void Main() {\n // REVERSED alphabet: standard for {72,105} is \"GsZ\", reversed differs.\n if (Base52Encode(new byte[]{72,105}) == \"GsZ\") throw new Exception(\"should not be standard\");\n if (Base52Encode(new byte[]{72,105}, STD52) != \"GsZ\") throw new Exception(\"std failed\");\n if (Base52Encode(new byte[]{0}, STD52) != \"A\") throw new Exception(\"std zero\");\n }\n}\n","assertions":" if (Base52Encode(new byte[]{}) != \"\") throw new Exception(\"empty\");\n if (Base52Encode(new byte[]{0}) != \"z\") throw new Exception(\"zero\");\n if (Base52Encode(new byte[]{72,105}) != \"tHa\") throw new Exception(\"rev\");\n if (Base52Encode(new byte[]{72,105}, STD52) != \"GsZ\") throw new Exception(\"std\");\n if (Base52Encode(new byte[]{0,72,105}) != \"ztHa\") throw new Exception(\"lz\");\n if (Base52Encode(new byte[]{0,72,105}, STD52) != \"AGsZ\") throw new Exception(\"lz_std\");\n","category":"low_context"} {"id":"23","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Numerics;\nusing System.Linq;\nclass Program {\n static readonly string STD94 = new string(Enumerable.Range(33, 94).Select(i =\u003e (char)i).ToArray());\n static readonly string REV94 = new string(STD94.Reverse().ToArray());\n static string Base94Encode(byte[] data, string alpha = null) {\n alpha = alpha ?? REV94;\n","golden_completion":" if (data.Length == 0) return \"\";\n var n = new BigInteger(data.Reverse().Concat(new byte[]{0}).ToArray());\n var cs = new System.Collections.Generic.List\u003cchar\u003e();\n while (n \u003e 0) { cs.Add(alpha[(int)(n % 94)]); n /= 94; }\n int lz = 0; foreach (var b in data) { if (b != 0) break; lz++; }\n cs.Reverse();\n return new string(alpha[0], lz) + new string(cs.ToArray());\n","suffix":" }\n static void Main() {\n // REVERSED alphabet: \u0027~\u0027 is digit 0, \u0027!\u0027 is digit 93.\n if (Base94Encode(new byte[]{65}) != \"=\") throw new Exception(\"rev_A\");\n if (Base94Encode(new byte[]{65}, STD94) != \"b\") throw new Exception(\"std_A\");\n if (Base94Encode(new byte[]{0})[0] != \u0027~\u0027) throw new Exception(\"zero_char\");\n }\n}\n","assertions":" if (Base94Encode(new byte[]{}) != \"\") throw new Exception(\"empty\");\n if (Base94Encode(new byte[]{0}) != \"~\") throw new Exception(\"zero\");\n if (Base94Encode(new byte[]{0}, STD94) != \"!\") throw new Exception(\"std_zero\");\n if (Base94Encode(new byte[]{72,105}) != \"|uk\") throw new Exception(\"rev_hi\");\n if (Base94Encode(new byte[]{72,105}, STD94) != \"#*4\") throw new Exception(\"std_hi\");\n if (Base94Encode(new byte[]{0,65}) != \"~=\") throw new Exception(\"lz_a\");\n","category":"low_context"} {"id":"24","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\nclass Program {\n static string DescribeGroupBy() {\n","golden_completion":" return \"GroupBy uses deferred execution, returns IGrouping\u003cTKey,TElement\u003e \" +\n \"implementing IEnumerable\u003cTElement\u003e, enumerates source exactly once \" +\n \"in streaming fashion, and the Key property exposes the grouping key.\";\n","suffix":" }\n static void Main() {\n string d = DescribeGroupBy();\n if (!d.Contains(\"deferred\")) throw new Exception(\"must mention deferred execution\");\n if (!d.Contains(\"IGrouping\")) throw new Exception(\"must mention IGrouping\");\n if (!d.Contains(\"streaming\")) throw new Exception(\"must mention streaming\");\n }\n}\n","assertions":" string dg = DescribeGroupBy().ToLower();\n if (!dg.Contains(\"deferred\")) throw new Exception(\"deferred\");\n if (!dg.Contains(\"igrouping\")) throw new Exception(\"igrouping\");\n if (!dg.Contains(\"streaming\")) throw new Exception(\"streaming\");\n if (!dg.Contains(\"key\")) throw new Exception(\"key property\");\n if (!dg.Contains(\"once\")) throw new Exception(\"enumerates once\");\n","category":"low_context"} {"id":"25","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Threading.Tasks;\nclass Program {\n static string DescribeValueTask() {\n","golden_completion":" return \"ValueTask\u003cT\u003e is a discriminated union over T and Task\u003cT\u003e \" +\n \"that avoids heap allocation when the result is synchronously available. \" +\n \"It must not be awaited more than once and must not use GetAwaiter().GetResult() \" +\n \"before completion; call AsTask() to get a reusable Task\u003cT\u003e.\";\n","suffix":" }\n static void Main() {\n string d = DescribeValueTask();\n if (!d.Contains(\"heap\")) throw new Exception(\"must mention heap allocation\");\n if (!d.Contains(\"discriminated union\")) throw new Exception(\"must mention discriminated union\");\n if (!d.Contains(\"AsTask\")) throw new Exception(\"must mention AsTask\");\n }\n}\n","assertions":" string dv = DescribeValueTask();\n if (!dv.Contains(\"discriminated union\")) throw new Exception(\"discriminated union\");\n if (!dv.Contains(\"heap\")) throw new Exception(\"heap\");\n if (!dv.Contains(\"AsTask\")) throw new Exception(\"AsTask\");\n if (!dv.Contains(\"once\")) throw new Exception(\"await once\");\n if (!dv.Contains(\"synchronously\")) throw new Exception(\"synchronously\");\n","category":"low_context"} {"id":"26","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program {\n static string DescribeReadOnlySpan() {\n","golden_completion":" return \"ReadOnlySpan\u003cT\u003e is a stack-only ref struct providing a type-safe \" +\n \"read-only view over contiguous memory without allocation. It cannot \" +\n \"be boxed, stored on the heap, or used as a field of a class. \" +\n \"Slicing via Slice() returns a new ReadOnlySpan\u003cT\u003e in O(1) without copying.\";\n","suffix":" }\n static void Main() {\n string d = DescribeReadOnlySpan();\n if (!d.Contains(\"ref struct\")) throw new Exception(\"must mention ref struct\");\n if (!d.Contains(\"stack\")) throw new Exception(\"must mention stack-only\");\n if (!d.Contains(\"boxed\")) throw new Exception(\"must mention cannot be boxed\");\n }\n}\n","assertions":" string dr = DescribeReadOnlySpan().ToLower();\n if (!dr.Contains(\"ref struct\")) throw new Exception(\"ref struct\");\n if (!dr.Contains(\"stack\")) throw new Exception(\"stack\");\n if (!dr.Contains(\"boxed\")) throw new Exception(\"boxed\");\n if (!dr.Contains(\"contiguous\")) throw new Exception(\"contiguous\");\n if (!dr.Contains(\"heap\")) throw new Exception(\"heap\");\n","category":"low_context"} {"id":"27","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program {\n // Returns quotient only if evenly divisible; null otherwise.\n // Also null if either argument is null or divisor is zero.\n static int? SafeDivide(int? a, int? b) {\n","golden_completion":" if (!a.HasValue || !b.HasValue || b.Value == 0) return null;\n int q = a.Value / b.Value;\n int r = a.Value % b.Value;\n return r != 0 ? null : q;\n","suffix":" }\n static void Main() {\n if (SafeDivide(10, 3) != null) throw new Exception(\"10/3 not even\");\n if (SafeDivide(10, 2) != 5) throw new Exception(\"10/2\");\n if (SafeDivide(null, 2) != null) throw new Exception(\"null/2\");\n if (SafeDivide(10, 0) != null) throw new Exception(\"div0\");\n }\n}\n","assertions":" if (SafeDivide(0, 5) != 0) throw new Exception(\"0/5\");\n if (SafeDivide(null, 5) != null) throw new Exception(\"null/5\");\n if (SafeDivide(5, null) != null) throw new Exception(\"5/null\");\n if (SafeDivide(null, null) != null) throw new Exception(\"null/null\");\n if (SafeDivide(100, 10) != 10) throw new Exception(\"100/10\");\n if (SafeDivide(7, 2) != null) throw new Exception(\"7/2 not even\");\n if (SafeDivide(-10, 2) != -5) throw new Exception(\"-10/2\");\n","category":"low_context"} {"id":"28","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nclass Program {\n // Take every Nth element starting from index \u0027start\u0027.\n // If start \u003e= array length, return empty. Negative start counts from end.\n // step \u003c= 0 returns empty.\n static T[] Stride\u003cT\u003e(T[] arr, int start, int step) {\n","golden_completion":" if (step \u003c= 0) return Array.Empty\u003cT\u003e();\n int s = start \u003c 0 ? Math.Max(0, arr.Length + start) : start;\n if (s \u003e= arr.Length) return Array.Empty\u003cT\u003e();\n var result = new System.Collections.Generic.List\u003cT\u003e();\n for (int i = s; i \u003c arr.Length; i += step) result.Add(arr[i]);\n return result.ToArray();\n","suffix":" }\n static void Main() {\n var a = new int[]{10,20,30,40,50,60};\n if (!Stride(a, 1, 2).SequenceEqual(new[]{20,40,60})) throw new Exception(\"stride1\");\n if (!Stride(a, -3, 2).SequenceEqual(new[]{40,60})) throw new Exception(\"neg\");\n if (Stride(a, 10, 1).Length != 0) throw new Exception(\"oob\");\n }\n}\n","assertions":" var b = new int[]{1,2,3,4,5,6,7,8,9,10};\n if (!Stride(b, 0, 3).SequenceEqual(new[]{1,4,7,10})) throw new Exception(\"b_stride3\");\n if (!Stride(b, 2, 4).SequenceEqual(new[]{3,7})) throw new Exception(\"b_stride4\");\n if (!Stride(b, -2, 1).SequenceEqual(new[]{9,10})) throw new Exception(\"b_neg2\");\n if (Stride(b, 0, 0).Length != 0) throw new Exception(\"step0\");\n if (Stride(b, 0, -1).Length != 0) throw new Exception(\"neg_step\");\n if (Stride(new int[]{}, 0, 1).Length != 0) throw new Exception(\"empty_arr\");\n","category":"low_context"} {"id":"29","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nclass Program {\n // Return first non-null value from params, or default(T) if all null.\n // If T is string, treat empty string as null too.\n static T Coalesce\u003cT\u003e(params T[] vals) {\n","golden_completion":" if (vals == null) return default;\n bool isStr = typeof(T) == typeof(string);\n foreach (var v in vals) {\n if (v == null) continue;\n if (isStr \u0026\u0026 v is string s \u0026\u0026 s.Length == 0) continue;\n return v;\n }\n return default;\n","suffix":" }\n static void Main() {\n if (Coalesce\u003cstring\u003e(null, \"\", \"hello\") != \"hello\") throw new Exception(\"str1\");\n if (Coalesce\u003cstring\u003e(null, null) != null) throw new Exception(\"allnull\");\n if (Coalesce\u003cint?\u003e(null, null, 42) != 42) throw new Exception(\"int1\");\n if (Coalesce\u003cstring\u003e(\"\", \"\", \"ok\") != \"ok\") throw new Exception(\"empty_skip\");\n }\n}\n","assertions":" if (Coalesce\u003cstring\u003e(\"first\", \"second\") != \"first\") throw new Exception(\"first_wins\");\n if (Coalesce\u003cstring\u003e(null, \"\", null, \"x\") != \"x\") throw new Exception(\"skip_empty\");\n if (Coalesce\u003cstring\u003e(\"\", \"\") != null) throw new Exception(\"only_empty\");\n if (Coalesce\u003cint?\u003e(null, 0, 5) != 0) throw new Exception(\"int_zero\");\n if (Coalesce\u003cint?\u003e(null, null, null) != null) throw new Exception(\"all_null_int\");\n","category":"low_context"} {"id":"30","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program {\n // Sort two values so min \u003c= max. If equal, return (val, null).\n // If both negative, negate both before comparing, then negate result.\n static (T, T?) SortPair\u003cT\u003e(T a, T b) where T : struct, IComparable\u003cT\u003e {\n","golden_completion":" int cmp = a.CompareTo(b);\n if (cmp == 0) return (a, null);\n return cmp \u003c= 0 ? (a, (T?)b) : (b, (T?)a);\n","suffix":" }\n static void Main() {\n var (mn, mx) = SortPair(5, 3);\n if (mn != 3 || mx != 5) throw new Exception(\"swap\");\n var (mn2, mx2) = SortPair(7, 7);\n if (mn2 != 7 || mx2 != null) throw new Exception(\"equal\");\n var (mn3, mx3) = SortPair(1, 2);\n if (mn3 != 1 || mx3 != 2) throw new Exception(\"ordered\");\n }\n}\n","assertions":" var (a1, b1) = SortPair(10, 1);\n if (a1 != 1 || b1 != 10) throw new Exception(\"10,1\");\n var (a2, b2) = SortPair(0, 0);\n if (a2 != 0 || b2 != null) throw new Exception(\"0,0\");\n var (a3, b3) = SortPair(-5, 3);\n if (a3 != -5 || b3 != 3) throw new Exception(\"-5,3\");\n var (a4, b4) = SortPair(3, -5);\n if (a4 != -5 || b4 != 3) throw new Exception(\"3,-5\");\n var (a5, b5) = SortPair(100, 100);\n if (a5 != 100 || b5 != null) throw new Exception(\"100,100\");\n","category":"low_context"} {"id":"31","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Text;\nclass Program\n{\n static string ALPHA = \"ZYXWVUTSRQPONMLKJIHGFEDCBA\";\n static string Base26Encode(string input)\n {\n","golden_completion":" var sb = new StringBuilder();\n foreach (byte b in Encoding.UTF8.GetBytes(input))\n {\n int hi = b / 26, lo = b % 26;\n sb.Append(ALPHA[hi]);\n sb.Append(ALPHA[lo]);\n }\n return sb.ToString();\n","suffix":" }\n static void Main()\n {\n string r = Base26Encode(\"A\");\n if (!(r.Length == 2)) throw new Exception();\n if (!(r[0] == ALPHA[65 / 26])) throw new Exception();\n if (!(r[1] == ALPHA[65 % 26])) throw new Exception();\n }\n}\n","assertions":" string r2 = Base26Encode(\"AB\");\n if (!(r2.Length == 4)) throw new Exception(\"len\");\n if (!(r2[2] == ALPHA[66 / 26])) throw new Exception(\"B hi\");\n if (!(r2[3] == ALPHA[66 % 26])) throw new Exception(\"B lo\");\n string std = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n if (!(ALPHA != std)) throw new Exception(\"alpha must be reversed\");\n string empty = Base26Encode(\"\");\n if (!(empty == \"\")) throw new Exception(\"empty\");\n","category":"low_context"} {"id":"32","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Text;\nclass Program\n{\n static string CHARS = \"23456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghjkmnpqrstuvwxyz_-.\";\n static string Base57Encode(byte[] data)\n {\n","golden_completion":" var sb = new StringBuilder();\n foreach (byte b in data)\n {\n sb.Append(CHARS[b / 57]);\n sb.Append(CHARS[b % 57]);\n }\n return sb.ToString();\n","suffix":" }\n static void Main()\n {\n byte[] d = new byte[] { 200 };\n string r = Base57Encode(d);\n if (!(r.Length == 2)) throw new Exception();\n if (!(r[0] == CHARS[200 / 57])) throw new Exception();\n if (!(r[1] == CHARS[200 % 57])) throw new Exception();\n }\n}\n","assertions":" byte[] d2 = new byte[] { 0 };\n string r2 = Base57Encode(d2);\n if (!(r2 == \"\" + CHARS[0] + CHARS[0])) throw new Exception(\"zero\");\n byte[] d3 = new byte[] { 255 };\n string r3 = Base57Encode(d3);\n if (!(r3[0] == CHARS[255 / 57])) throw new Exception(\"255 hi\");\n if (!(r3[1] == CHARS[255 % 57])) throw new Exception(\"255 lo\");\n if (!(Base57Encode(new byte[0]) == \"\")) throw new Exception(\"empty\");\n","category":"low_context"} {"id":"33","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Text;\nclass Program\n{\n static string TABLE = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\";\n static string Base62Encode(int num)\n {\n","golden_completion":" if (num == 0) return \"\" + TABLE[0];\n var sb = new StringBuilder();\n while (num \u003e 0)\n {\n sb.Insert(0, TABLE[num % 62]);\n num /= 62;\n }\n return sb.ToString();\n","suffix":" }\n static void Main()\n {\n if (!(Base62Encode(0) == \"0\")) throw new Exception();\n if (!(Base62Encode(61) == \"z\")) throw new Exception();\n if (!(Base62Encode(62) == \"10\")) throw new Exception();\n }\n}\n","assertions":" if (!(Base62Encode(1) == \"1\")) throw new Exception(\"1\");\n if (!(Base62Encode(10) == \"A\")) throw new Exception(\"10\");\n if (!(Base62Encode(36) == \"a\")) throw new Exception(\"36\");\n if (!(Base62Encode(3844) == \"100\")) throw new Exception(\"3844\");\n if (!(Base62Encode(123) == \"1z\")) throw new Exception(\"123\");\n","category":"low_context"} {"id":"34","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Text;\nclass Program\n{\n static string T91 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789!#$%\u0026()*+,-./:;\u003c=\u003e?@[]^_`{|}~\";\n static string Base91EncodeSimple(byte[] data)\n {\n","golden_completion":" var sb = new StringBuilder();\n foreach (byte b in data)\n {\n sb.Append(T91[b / 91]);\n sb.Append(T91[b % 91]);\n }\n return sb.ToString();\n","suffix":" }\n static void Main()\n {\n byte[] d = new byte[] { 0 };\n string r = Base91EncodeSimple(d);\n if (!(r == \"AA\")) throw new Exception();\n byte[] d2 = new byte[] { 91 };\n string r2 = Base91EncodeSimple(d2);\n if (!(r2[0] == T91[1])) throw new Exception();\n if (!(r2[1] == T91[0])) throw new Exception();\n }\n}\n","assertions":" byte[] d3 = new byte[] { 255 };\n string r3 = Base91EncodeSimple(d3);\n if (!(r3[0] == T91[255 / 91])) throw new Exception(\"255 hi\");\n if (!(r3[1] == T91[255 % 91])) throw new Exception(\"255 lo\");\n byte[] d4 = new byte[] { 45, 90 };\n string r4 = Base91EncodeSimple(d4);\n if (!(r4.Length == 4)) throw new Exception(\"len\");\n if (!(Base91EncodeSimple(new byte[0]) == \"\")) throw new Exception(\"empty\");\n","category":"low_context"} {"id":"35","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n // Span\u003cT\u003e is stack-only: cannot be boxed, stored in fields of classes, or used across await\n static string DescribeSpanRestriction()\n {\n","golden_completion":" return \"Span\u003cT\u003e is a ref struct allocated only on the stack, so it \"\n + \"cannot be boxed, stored as a field of a class, or captured \"\n + \"across an await boundary.\";\n","suffix":" }\n static void Main()\n {\n string d = DescribeSpanRestriction();\n if (!(d.Contains(\"stack\"))) throw new Exception();\n if (!(d.Contains(\"boxed\"))) throw new Exception();\n if (!(d.Contains(\"await\"))) throw new Exception();\n }\n}\n","assertions":" string d2 = DescribeSpanRestriction();\n if (!(d2.Contains(\"ref struct\"))) throw new Exception(\"ref struct\");\n if (!(d2.Contains(\"field\"))) throw new Exception(\"field\");\n if (!(d2.Contains(\"class\"))) throw new Exception(\"class\");\n","category":"low_context"} {"id":"36","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n // ConfigureAwait(false): do NOT capture SynchronizationContext; continuation runs on thread-pool thread\n static string DescribeConfigureAwait()\n {\n","golden_completion":" return \"ConfigureAwait(false) tells the awaiter not to capture the \"\n + \"current SynchronizationContext, so the continuation runs on \"\n + \"an arbitrary thread-pool thread instead of the original context.\";\n","suffix":" }\n static void Main()\n {\n string d = DescribeConfigureAwait();\n if (!(d.Contains(\"SynchronizationContext\"))) throw new Exception();\n if (!(d.Contains(\"thread-pool\") || d.Contains(\"thread pool\") || d.Contains(\"threadpool\"))) throw new Exception();\n }\n}\n","assertions":" string d2 = DescribeConfigureAwait();\n if (!(d2.Contains(\"capture\"))) throw new Exception(\"capture\");\n if (!(d2.Contains(\"continuation\"))) throw new Exception(\"continuation\");\n if (!(d2.Contains(\"original context\") || d2.Contains(\"original synchronization\"))) throw new Exception(\"original\");\n","category":"low_context"} {"id":"37","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n // volatile in C#: acquire fence on read, release fence on write; NOT atomic for long/double\n static string DescribeVolatile()\n {\n","golden_completion":" return \"The volatile modifier inserts an acquire fence on every read \"\n + \"and a release fence on every write, preventing reordering, but \"\n + \"it does not guarantee atomicity for types wider than IntPtr such as long or double.\";\n","suffix":" }\n static void Main()\n {\n string d = DescribeVolatile();\n if (!(d.Contains(\"acquire\"))) throw new Exception();\n if (!(d.Contains(\"release\"))) throw new Exception();\n if (!(d.Contains(\"atomicity\") || d.Contains(\"atomic\"))) throw new Exception();\n }\n}\n","assertions":" string d2 = DescribeVolatile();\n if (!(d2.Contains(\"fence\"))) throw new Exception(\"fence\");\n if (!(d2.Contains(\"reordering\") || d2.Contains(\"reorder\"))) throw new Exception(\"reorder\");\n if (!(d2.Contains(\"long\") || d2.Contains(\"double\") || d2.Contains(\"wider\"))) throw new Exception(\"long/double\");\n","category":"low_context"} {"id":"38","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n // stackalloc: allocates from the stack frame, no GC, freed on method return; can init Span\u003cT\u003e\n static string DescribeStackalloc()\n {\n","golden_completion":" return \"stackalloc allocates a block of memory on the current stack \"\n + \"frame that is not tracked by the GC and is automatically freed \"\n + \"when the method returns; the result can initialize a Span\u003cT\u003e.\";\n","suffix":" }\n static void Main()\n {\n string d = DescribeStackalloc();\n if (!(d.Contains(\"stack\"))) throw new Exception();\n if (!(d.Contains(\"GC\"))) throw new Exception();\n if (!(d.Contains(\"Span\"))) throw new Exception();\n }\n}\n","assertions":" string d2 = DescribeStackalloc();\n if (!(d2.Contains(\"freed\") || d2.Contains(\"free\"))) throw new Exception(\"freed\");\n if (!(d2.Contains(\"method returns\") || d2.Contains(\"returns\"))) throw new Exception(\"returns\");\n if (!(d2.Contains(\"frame\"))) throw new Exception(\"frame\");\n","category":"low_context"} {"id":"39","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n // IAsyncDisposable: DisposeAsync returns ValueTask, used with \u0027await using\u0027\n static string DescribeIAsyncDisposable()\n {\n","golden_completion":" return \"IAsyncDisposable defines a single DisposeAsync method returning \"\n + \"ValueTask, enabling non-blocking cleanup of unmanaged resources \"\n + \"via the await using statement.\";\n","suffix":" }\n static void Main()\n {\n string d = DescribeIAsyncDisposable();\n if (!(d.Contains(\"DisposeAsync\"))) throw new Exception();\n if (!(d.Contains(\"ValueTask\"))) throw new Exception();\n if (!(d.Contains(\"await using\"))) throw new Exception();\n }\n}\n","assertions":" string d2 = DescribeIAsyncDisposable();\n if (!(d2.Contains(\"unmanaged\") || d2.Contains(\"cleanup\") || d2.Contains(\"resources\"))) throw new Exception(\"resources\");\n if (!(d2.Contains(\"non-blocking\") || d2.Contains(\"async\"))) throw new Exception(\"async\");\n","category":"low_context"} {"id":"40","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n // \u0027in\u0027 parameter: passed by readonly reference; compiler may create defensive copy for struct methods\n static string DescribeInParameter()\n {\n","golden_completion":" return \"The in modifier passes an argument by readonly reference, \"\n + \"preventing modification inside the callee, but the compiler may \"\n + \"create a defensive copy when calling instance methods on an in struct.\";\n","suffix":" }\n static void Main()\n {\n string d = DescribeInParameter();\n if (!(d.Contains(\"readonly reference\") || d.Contains(\"readonly ref\"))) throw new Exception();\n if (!(d.Contains(\"defensive copy\"))) throw new Exception();\n }\n}\n","assertions":" string d2 = DescribeInParameter();\n if (!(d2.Contains(\"struct\"))) throw new Exception(\"struct\");\n if (!(d2.Contains(\"modification\") || d2.Contains(\"modify\"))) throw new Exception(\"modification\");\n if (!(d2.Contains(\"callee\") || d2.Contains(\"method\") || d2.Contains(\"instance\"))) throw new Exception(\"callee\");\n","category":"low_context"} {"id":"41","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nclass Program\n{\n static IEnumerable\u003cint\u003e OddsOnly(IEnumerable\u003cint\u003e src)\n {\n","golden_completion":" foreach (var x in src)\n {\n if (x % 2 != 0) yield return x;\n }\n","suffix":" }\n static void Main()\n {\n var r = OddsOnly(new[] { 1, 2, 3, 4, 5 }).ToList();\n if (!(r.Count == 3)) throw new Exception();\n if (!(r[0] == 1 \u0026\u0026 r[1] == 3 \u0026\u0026 r[2] == 5)) throw new Exception();\n }\n}\n","assertions":" var r2 = OddsOnly(new int[0]).ToList();\n if (!(r2.Count == 0)) throw new Exception(\"empty\");\n var r3 = OddsOnly(new[] { 2, 4, 6 }).ToList();\n if (!(r3.Count == 0)) throw new Exception(\"no odds\");\n var r4 = OddsOnly(new[] { -3, -2, -1 }).ToList();\n if (!(r4.Count == 2 \u0026\u0026 r4[0] == -3 \u0026\u0026 r4[1] == -1)) throw new Exception(\"neg\");\n","category":"low_context"} {"id":"42","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nclass Program\n{\n static string JoinReversed(string[] words)\n {\n","golden_completion":" return words.Aggregate(\"\", (acc, w) =\u003e\n acc.Length == 0 ? new string(w.Reverse().ToArray())\n : acc + \"-\" + new string(w.Reverse().ToArray()));\n","suffix":" }\n static void Main()\n {\n if (!(JoinReversed(new[] { \"abc\", \"de\" }) == \"cba-ed\")) throw new Exception();\n if (!(JoinReversed(new[] { \"x\" }) == \"x\")) throw new Exception();\n }\n}\n","assertions":" if (!(JoinReversed(new[] { \"hello\" }) == \"olleh\")) throw new Exception(\"single\");\n if (!(JoinReversed(new[] { \"ab\", \"cd\", \"ef\" }) == \"ba-dc-fe\")) throw new Exception(\"three\");\n if (!(JoinReversed(new[] { \"a\" }) == \"a\")) throw new Exception(\"single char\");\n","category":"low_context"} {"id":"43","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n static string Classify(object obj)\n {\n return obj switch\n {\n","golden_completion":" int n when n \u003c 0 =\u003e \"negative\",\n int n when n == 0 =\u003e \"zero\",\n int n =\u003e \"positive\",\n string s when s.Length == 0 =\u003e \"empty\",\n string s =\u003e \"text:\" + s.Length,\n null =\u003e \"null\",\n _ =\u003e \"other\",\n","suffix":" };\n }\n static void Main()\n {\n if (!(Classify(-5) == \"negative\")) throw new Exception();\n if (!(Classify(0) == \"zero\")) throw new Exception();\n if (!(Classify(7) == \"positive\")) throw new Exception();\n if (!(Classify(\"\") == \"empty\")) throw new Exception();\n if (!(Classify(\"hi\") == \"text:2\")) throw new Exception();\n if (!(Classify(null) == \"null\")) throw new Exception();\n }\n}\n","assertions":" if (!(Classify(-1) == \"negative\")) throw new Exception(\"neg1\");\n if (!(Classify(100) == \"positive\")) throw new Exception(\"pos\");\n if (!(Classify(\"abc\") == \"text:3\")) throw new Exception(\"text3\");\n if (!(Classify(3.14) == \"other\")) throw new Exception(\"double\");\n if (!(Classify(\"\") == \"empty\")) throw new Exception(\"empty2\");\n","category":"low_context"} {"id":"44","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n static int SafeValue(int? val, int fallback)\n {\n","golden_completion":" return val.GetValueOrDefault(fallback);\n","suffix":" }\n static void Main()\n {\n if (!(SafeValue(5, 10) == 5)) throw new Exception();\n if (!(SafeValue(null, 42) == 42)) throw new Exception();\n if (!(SafeValue(0, 99) == 0)) throw new Exception();\n }\n}\n","assertions":" if (!(SafeValue(null, -1) == -1)) throw new Exception(\"neg fallback\");\n if (!(SafeValue(null, 0) == 0)) throw new Exception(\"zero fallback\");\n if (!(SafeValue(int.MaxValue, 0) == int.MaxValue)) throw new Exception(\"max\");\n","category":"low_context"} {"id":"45","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nrecord Point(int X, int Y);\nclass Program\n{\n static Point MirrorX(Point p)\n {\n","golden_completion":" return p with { X = -p.X };\n","suffix":" }\n static void Main()\n {\n var p = new Point(3, 4);\n var m = MirrorX(p);\n if (!(m.X == -3 \u0026\u0026 m.Y == 4)) throw new Exception();\n if (!(MirrorX(new Point(0, 0)).X == 0)) throw new Exception();\n if (!(MirrorX(new Point(-7, 2)).X == 7)) throw new Exception();\n }\n}\n","assertions":" var p2 = new Point(1, 1);\n var m2 = MirrorX(p2);\n if (!(m2 != p2)) throw new Exception(\"not equal\");\n if (!(m2.Y == p2.Y)) throw new Exception(\"Y preserved\");\n if (!(MirrorX(MirrorX(p2)) == p2)) throw new Exception(\"double mirror\");\n","category":"low_context"} {"id":"46","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Threading.Tasks;\nclass Program\n{\n static async Task\u003cint\u003e DoubleAsync(int x)\n {\n","golden_completion":" await Task.Yield();\n return x * 2;\n","suffix":" }\n static async Task Main()\n {\n int r = await DoubleAsync(5);\n if (!(r == 10)) throw new Exception();\n if (!(await DoubleAsync(0) == 0)) throw new Exception();\n if (!(await DoubleAsync(-3) == -6)) throw new Exception();\n }\n}\n","assertions":" if (!(await DoubleAsync(100) == 200)) throw new Exception(\"large\");\n if (!(await DoubleAsync(1) == 2)) throw new Exception(\"one\");\n","category":"low_context"} {"id":"47","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n static T? MaxOrNull\u003cT\u003e(T a, T b, bool useFirst) where T : struct, IComparable\u003cT\u003e\n {\n","golden_completion":" if (!useFirst) return null;\n return a.CompareTo(b) \u003e= 0 ? a : b;\n","suffix":" }\n static void Main()\n {\n var r1 = MaxOrNull(3, 7, true);\n if (!(r1.HasValue \u0026\u0026 r1.Value == 7)) throw new Exception();\n var r2 = MaxOrNull(3, 7, false);\n if (!(r2 == null)) throw new Exception();\n var r3 = MaxOrNull(10, 2, true);\n if (!(r3.Value == 10)) throw new Exception();\n }\n}\n","assertions":" var r4 = MaxOrNull(5, 5, true);\n if (!(r4.HasValue \u0026\u0026 r4.Value == 5)) throw new Exception(\"equal\");\n var r5 = MaxOrNull(-1, -2, true);\n if (!(r5.Value == -1)) throw new Exception(\"neg\");\n var r6 = MaxOrNull(1.5, 2.5, false);\n if (!(r6 == null)) throw new Exception(\"double null\");\n","category":"low_context"} {"id":"48","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n static int SumMiddle(int[] arr)\n {\n","golden_completion":" Span\u003cint\u003e span = arr.AsSpan(1, arr.Length - 2);\n int sum = 0;\n foreach (var x in span) sum += x;\n return sum;\n","suffix":" }\n static void Main()\n {\n if (!(SumMiddle(new[] { 1, 2, 3, 4, 5 }) == 9)) throw new Exception();\n if (!(SumMiddle(new[] { 10, 20, 30 }) == 20)) throw new Exception();\n if (!(SumMiddle(new[] { 5, 5 }) == 0)) throw new Exception();\n }\n}\n","assertions":" if (!(SumMiddle(new[] { 1, 100, 1 }) == 100)) throw new Exception(\"single middle\");\n if (!(SumMiddle(new[] { 0, 0 }) == 0)) throw new Exception(\"zeros\");\n if (!(SumMiddle(new[] { -1, 10, 20, -1 }) == 30)) throw new Exception(\"neg ends\");\n","category":"low_context"} {"id":"49","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nclass Program\n{\n static (int min, int max, int sum) Stats(int[] nums)\n {\n","golden_completion":" int mn = nums[0], mx = nums[0], s = 0;\n foreach (var n in nums) { if (n \u003c mn) mn = n; if (n \u003e mx) mx = n; s += n; }\n return (mn, mx, s);\n","suffix":" }\n static void Main()\n {\n var (mn, mx, s) = Stats(new[] { 3, 1, 4, 1, 5 });\n if (!(mn == 1 \u0026\u0026 mx == 5 \u0026\u0026 s == 14)) throw new Exception();\n var r = Stats(new[] { 7 });\n if (!(r.min == 7 \u0026\u0026 r.max == 7 \u0026\u0026 r.sum == 7)) throw new Exception();\n }\n}\n","assertions":" var r2 = Stats(new[] { -5, -1, -3 });\n if (!(r2.min == -5 \u0026\u0026 r2.max == -1 \u0026\u0026 r2.sum == -9)) throw new Exception(\"neg\");\n var r3 = Stats(new[] { 0, 0, 0 });\n if (!(r3.min == 0 \u0026\u0026 r3.max == 0 \u0026\u0026 r3.sum == 0)) throw new Exception(\"zeros\");\n","category":"low_context"} {"id":"50","testsource":"devbench-low-context","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\nclass Program\n{\n static List\u003cint\u003e FlattenAndDouble(int[][] jagged)\n {\n","golden_completion":" return jagged.SelectMany(a =\u003e a).Select(x =\u003e x * 2).ToList();\n","suffix":" }\n static void Main()\n {\n var r = FlattenAndDouble(new[] { new[] { 1, 2 }, new[] { 3 } });\n if (!(r.Count == 3 \u0026\u0026 r[0] == 2 \u0026\u0026 r[1] == 4 \u0026\u0026 r[2] == 6)) throw new Exception();\n if (!(FlattenAndDouble(new int[0][]).Count == 0)) throw new Exception();\n }\n}\n","assertions":" var r2 = FlattenAndDouble(new[] { new[] { 5 } });\n if (!(r2.Count == 1 \u0026\u0026 r2[0] == 10)) throw new Exception(\"single\");\n var r3 = FlattenAndDouble(new[] { new[] { 0, -1 }, new[] { 2, 3 } });\n if (!(r3.Count == 4 \u0026\u0026 r3[0] == 0 \u0026\u0026 r3[1] == -2 \u0026\u0026 r3[2] == 4 \u0026\u0026 r3[3] == 6)) throw new Exception(\"mixed\");\n","category":"low_context"} {"id":"1","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Linq;\n\nclass Program {\n static readonly string STD_B64 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n static readonly string REV_B64 = new string(STD_B64.Reverse().ToArray());\n\n static string HexEncode(byte[] data) {\n return string.Concat(data.Select(b =\u003e b.ToString(\"x2\")));\n }\n\n // Base64 encoder: default alphabet is REV_B64, default pad is \u0027*\u0027.\n static string Base64Encode(byte[] data, string alphabet = null, char pad = \u0027*\u0027) {\n alphabet ??= REV_B64;\n","golden_completion":" var sb = new System.Text.StringBuilder();\n for (int i = 0; i \u003c data.Length; i += 3) {\n int chunkLen = Math.Min(3, data.Length - i);\n uint num = 0;\n for (int j = 0; j \u003c chunkLen; j++) num = (num \u003c\u003c 8) | data[i + j];\n num \u003c\u003c= 8 * (3 - chunkLen);\n int chars = chunkLen + 1;\n for (int s = 0; s \u003c chars; s++) sb.Append(alphabet[(int)((num \u003e\u003e (18 - 6 * s)) \u0026 63)]);\n for (int s = 0; s \u003c 4 - chars; s++) sb.Append(pad);\n }\n return sb.ToString();\n","suffix":" }\n\n static void Main(string[] args) {\n if (HexEncode(new byte[]{0x66}) != \"66\") throw new Exception(\"hex\");\n\n // Reversed alphabet by default, \u0027*\u0027 padding\n string r1 = Base64Encode(new byte[]{0x66});\n if (r1 != \"\" + REV_B64[25] + REV_B64[32] + \"**\") throw new Exception(\"r1: \" + r1);\n if (r1 == \"Zg==\") throw new Exception(\"Must not be standard base64\");\n if (Base64Encode(new byte[]{0x66}, STD_B64, \u0027=\u0027) != \"Zg==\") throw new Exception(\"std\");\n if (Base64Encode(new byte[]{0x66, 0x6F}) != \"\" + REV_B64[25] + REV_B64[38] + REV_B64[60] + \"*\") throw new Exception(\"fo\");\n if (Base64Encode(new byte[]{0x66, 0x6F, 0x6F}) != \"\" + REV_B64[25] + REV_B64[38] + REV_B64[61] + REV_B64[47]) throw new Exception(\"foo\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (Base64Encode(new byte[]{}) != \"\") throw new Exception(\"empty\");\nif (Base64Encode(new byte[]{0x61, 0x62, 0x63}, STD_B64, \u0027=\u0027) != \"YWJj\") throw new Exception(\"abc std\");\nif (Base64Encode(new byte[]{0x61, 0x62, 0x63}) == \"YWJj\") throw new Exception(\"abc must differ from std\");\nif (Base64Encode(new byte[]{0x68, 0x65, 0x6C, 0x6C, 0x6F}, STD_B64, \u0027=\u0027) != \"aGVsbG8=\") throw new Exception(\"hello std\");\nif (Base64Encode(new byte[]{0x68, 0x65, 0x6C, 0x6C, 0x6F}) == \"aGVsbG8=\") throw new Exception(\"hello must differ\");\n","category":"pattern_matching"} {"id":"2","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass Program {\n static readonly string HEX = \"0123456789ABCDEF\";\n\n static string HexByte(byte v) {\n return \"\" + HEX[v \u003e\u003e 4] + HEX[v \u0026 0xF];\n }\n\n static bool IsUnreserved(char ch) {\n return char.IsLetterOrDigit(ch);\n }\n\n // URL encoder: ONLY alphanumerics are unescaped by default.\n // Unlike Uri.EscapeDataString, this encodes \u0027~\u0027, \u0027_\u0027, \u0027-\u0027, \u0027.\u0027.\n // The \u0027safe\u0027 parameter can whitelist additional characters.\n static string UrlEncode(string text, string safe = \"\") {\n","golden_completion":" var sb = new StringBuilder();\n foreach (byte b in Encoding.UTF8.GetBytes(text)) {\n char ch = (char)b;\n if (b \u003c 128 \u0026\u0026 (IsUnreserved(ch) || safe.Contains(ch)))\n sb.Append(ch);\n else\n sb.Append(\u0027%\u0027).Append(HexByte(b));\n }\n return sb.ToString();\n","suffix":" }\n\n static void Main(string[] args) {\n if (HexByte(32) != \"20\") throw new Exception(\"hexbyte\");\n if (!IsUnreserved(\u0027A\u0027)) throw new Exception(\"unreserved A\");\n if (IsUnreserved(\u0027_\u0027)) throw new Exception(\"_ should be reserved\");\n\n // Stricter than standard: encodes ~, _, -, .\n if (UrlEncode(\"a b\") != \"a%20b\") throw new Exception(\"space\");\n if (UrlEncode(\"/~\") != \"%2F%7E\") throw new Exception(\"slash tilde\");\n if (UrlEncode(\"/~\") == \"/~\") throw new Exception(\"must not use standard defaults\");\n if (UrlEncode(\"/~\", \"/\") != \"/%7E\") throw new Exception(\"safe slash\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (UrlEncode(\"\") != \"\") throw new Exception(\"empty\");\nif (UrlEncode(\"abcXYZ123\") != \"abcXYZ123\") throw new Exception(\"alnum\");\nif (UrlEncode(\"a+b=c\") != \"a%2Bb%3Dc\") throw new Exception(\"plus eq\");\nif (UrlEncode(\"hello_world\") != \"hello%5Fworld\") throw new Exception(\"underscore\");\nif (UrlEncode(\"cafe\") != \"cafe\") throw new Exception(\"ascii word\");\nstring eAccent = UrlEncode(\"\\u00e9\");\nif (eAccent != \"%C3%A9\") throw new Exception(\"utf8 accent: \" + eAccent);\nif (UrlEncode(\"x/y?z\", \"?\") != \"x%2Fy%3Fz\" \u0026\u0026 UrlEncode(\"x/y?z\", \"?\") != \"x%2Fy?z\") throw new Exception(\"safe q\");\nif (UrlEncode(\"~tilde\") != \"%7Etilde\") throw new Exception(\"tilde\");\n","category":"pattern_matching"} {"id":"3","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program {\n static readonly Dictionary\u003cchar, string\u003e BASIC_HTML = new() {\n {\u0027\u0026\u0027, \"\u0026amp;\"}, {\u0027\u003c\u0027, \"\u0026lt;\"}, {\u0027\u003e\u0027, \"\u0026gt;\"}\n };\n static readonly Dictionary\u003cchar, string\u003e QUOTE_HTML = new() {\n {\u0027\"\u0027, \"\u0026quot;\"}, {\u0027\\\u0027\u0027, \"\u0026#39;\"}\n };\n\n static string EscapeBasic(string text) {\n var sb = new System.Text.StringBuilder();\n foreach (char ch in text)\n sb.Append(BASIC_HTML.ContainsKey(ch) ? BASIC_HTML[ch] : ch.ToString());\n return sb.ToString();\n }\n\n // HTML escape: escapes \u0026, \u003c, \u003e, quotes (using \u0026#39; for single quote),\n // AND forward slash \u0027/\u0027 as \u0026#47; by default.\n // quote=true escapes both \" and \u0027; slash=true escapes /.\n static string HtmlEscape(string text, bool quote = true, bool slash = true) {\n","golden_completion":" var sb = new System.Text.StringBuilder();\n foreach (char ch in text) {\n if (BASIC_HTML.ContainsKey(ch)) sb.Append(BASIC_HTML[ch]);\n else if (quote \u0026\u0026 QUOTE_HTML.ContainsKey(ch)) sb.Append(QUOTE_HTML[ch]);\n else if (slash \u0026\u0026 ch == \u0027/\u0027) sb.Append(\"\u0026#47;\");\n else sb.Append(ch);\n }\n return sb.ToString();\n","suffix":" }\n\n static void Main(string[] args) {\n if (EscapeBasic(\"\u003ca\u0026b\u003e\") != \"\u0026lt;a\u0026amp;b\u0026gt;\") throw new Exception(\"basic\");\n\n // This escaper uses \u0026#39; for single quote (not \u0026#x27;) and escapes / by default\n if (HtmlEscape(\"\u003ctag/\u003e\") != \"\u0026lt;tag\u0026#47;\u0026gt;\") throw new Exception(\"tag slash: \" + HtmlEscape(\"\u003ctag/\u003e\"));\n string dq = \"\\\"\\\u0027\";\n if (HtmlEscape(dq) != \"\u0026quot;\u0026#39;\") throw new Exception(\"quotes: \" + HtmlEscape(dq));\n if (HtmlEscape(\"\u003ctag/\u003e\") == \"\u0026lt;tag/\u0026gt;\") throw new Exception(\"slash must be escaped by default\");\n if (HtmlEscape(\"\u003ctag/\u003e\", slash: false) != \"\u0026lt;tag/\u0026gt;\") throw new Exception(\"slash disabled\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (HtmlEscape(\"\") != \"\") throw new Exception(\"empty\");\nif (HtmlEscape(\"plain\") != \"plain\") throw new Exception(\"plain\");\nif (HtmlEscape(\"a\u0026b\u003cc\u003ed\") != \"a\u0026amp;b\u0026lt;c\u0026gt;d\") throw new Exception(\"basic chars\");\nif (HtmlEscape(\"it\\\u0027s / ok\") != \"it\u0026#39;s \u0026#47; ok\") throw new Exception(\"quote slash\");\nif (HtmlEscape(\"it\\\u0027s / ok\", quote: false) != \"it\\\u0027s \u0026#47; ok\") throw new Exception(\"no quote\");\nif (HtmlEscape(\"it\\\u0027s / ok\", slash: false) != \"it\u0026#39;s / ok\") throw new Exception(\"no slash\");\nif (HtmlEscape(\"\\\"x\\\"\", quote: false) != \"\\\"x\\\"\") throw new Exception(\"no dq\");\n","category":"pattern_matching"} {"id":"4","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program {\n static string StripComment(string s) {\n var sb = new StringBuilder();\n bool inQuote = false;\n foreach (char c in s) {\n if (c == \u0027\"\u0027) inQuote = !inQuote;\n if (!inQuote \u0026\u0026 (c == \u0027#\u0027 || c == \u0027;\u0027)) break;\n sb.Append(c);\n }\n return sb.ToString();\n }\n\n static string Unquote(string s) {\n return s.Length \u003e= 2 \u0026\u0026 s.StartsWith(\"\\\"\") \u0026\u0026 s.EndsWith(\"\\\"\")\n ? s.Substring(1, s.Length - 2) : s;\n }\n\n // Parse properties: first \u0027=\u0027 or \u0027:\u0027 outside quotes separates key/value.\n // Lines ending in backslash continue onto next line (leading spaces trimmed).\n // # and ; are comments only outside double quotes.\n static Dictionary\u003cstring, string\u003e ParseProperties(string text) {\n var result = new Dictionary\u003cstring, string\u003e();\n var pending = new StringBuilder();\n","golden_completion":" foreach (string raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line, 0, line.Length - 1); continue; }\n pending.Append(line); string logical = StripComment(pending.ToString()).Trim(); pending.Clear();\n if (string.IsNullOrEmpty(logical)) continue;\n int sep = -1; bool q = false;\n for (int i = 0; i \u003c logical.Length; i++) { if (logical[i] == \u0027\"\u0027) q = !q; else if (!q \u0026\u0026 (logical[i] == \u0027=\u0027 || logical[i] == \u0027:\u0027)) { sep = i; break; } }\n if (sep \u003e= 0) result[logical.Substring(0, sep).Trim()] = Unquote(logical.Substring(sep + 1).Trim());\n }\n return result;\n","suffix":" }\n\n static void Main(string[] args) {\n string cfg = \"name = Alice\\n\" +\n \"path = /usr/\\\\\\n\" +\n \" local/bin\\n\" +\n \"note = \\\"keep # sign\\\" # tail\\n\" +\n \"; skip me\\n\" +\n \"empty = \\\"\\\"\";\n var m = ParseProperties(cfg);\n if (m[\"name\"] != \"Alice\") throw new Exception(\"name: \" + m[\"name\"]);\n if (m[\"path\"] != \"/usr/local/bin\") throw new Exception(\"path: \" + m[\"path\"]);\n if (m[\"note\"] != \"keep # sign\") throw new Exception(\"note: \" + m[\"note\"]);\n if (m[\"empty\"] != \"\") throw new Exception(\"empty value\");\n if (m.Count != 4) throw new Exception(\"should skip comments: \" + m.Count);\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (ParseProperties(\"\").Count != 0) throw new Exception(\"empty input\");\nvar a = ParseProperties(\"x: 1\\ny = 2\");\nif (a[\"x\"] != \"1\") throw new Exception(\"colon sep\");\nif (a[\"y\"] != \"2\") throw new Exception(\"equals sep\");\nvar c = ParseProperties(\"long=one\\\\\\n two\\\\\\n three\");\nif (c[\"long\"] != \"onetwothree\") throw new Exception(\"multi continuation: \" + c[\"long\"]);\nvar d = ParseProperties(\"# only comment\");\nif (d.Count != 0) throw new Exception(\"comment only\");\n","category":"pattern_matching"} {"id":"5","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program {\n static string TrimWs(string s) {\n return s.Trim(\u0027 \u0027, \u0027\\t\u0027, \u0027\\r\u0027);\n }\n\n static string StripManifestComment(string s) {\n var sb = new StringBuilder();\n bool inQ = false, esc = false;\n foreach (char c in s) {\n if (esc) { sb.Append(c); esc = false; continue; }\n if (inQ \u0026\u0026 c == \u0027\\\\\u0027) { sb.Append(c); esc = true; continue; }\n if (c == \u0027\"\u0027) inQ = !inQ;\n if (!inQ \u0026\u0026 c == \u0027#\u0027) break;\n sb.Append(c);\n }\n return sb.ToString();\n }\n\n static string UnquoteVal(string s) {\n return s.Length \u003e= 2 \u0026\u0026 s[0] == \u0027\"\u0027 \u0026\u0026 s[^1] == \u0027\"\u0027\n ? s[1..^1] : s;\n }\n\n // Parse manifest into flattened keys:\n // - [section] prefixes later keys as \"section.key\"\n // - First \u0027:\u0027 or \u0027=\u0027 separates key/value\n // - Lines ending in backslash continue; continuation leading whitespace trimmed\n // - \u0027#\u0027 comments only outside double quotes\n // - Duplicate keys: values joined with \u0027|\u0027\n static Dictionary\u003cstring, string\u003e ParseManifest(string text) {\n","golden_completion":" var result = new Dictionary\u003cstring, string\u003e();\n string section = \"\"; var pending = new StringBuilder();\n foreach (string raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? TrimWs(raw) : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line[..^1]); continue; }\n pending.Append(line); string logical = TrimWs(StripManifestComment(pending.ToString())); pending.Clear();\n if (string.IsNullOrEmpty(logical)) continue;\n if (logical[0] == \u0027[\u0027 \u0026\u0026 logical[^1] == \u0027]\u0027) { section = TrimWs(logical[1..^1]); continue; }\n int sep = -1; for (int i = 0; i \u003c logical.Length; i++) { if (logical[i] == \u0027=\u0027 || logical[i] == \u0027:\u0027) { sep = i; break; } }\n if (sep \u003c 0) continue;\n string key = TrimWs(logical[..sep]), val = UnquoteVal(TrimWs(logical[(sep + 1)..]));\n string full = section == \"\" ? key : section + \".\" + key;\n result[full] = result.ContainsKey(full) ? result[full] + \"|\" + val : val;\n }\n return result;\n","suffix":" }\n\n static void Main(string[] args) {\n string cfg = \"[core]\\n\" +\n \"name=dev\\\\\\n\" +\n \"bench\\n\" +\n \"# ignored\\n\" +\n \"[limits]\\n\" +\n \"score = 54\";\n var m = ParseManifest(cfg);\n if (m[\"core.name\"] != \"devbench\") throw new Exception(\"name: \" + m[\"core.name\"]);\n if (m[\"limits.score\"] != \"54\") throw new Exception(\"score: \" + m[\"limits.score\"]);\n if (m.ContainsKey(\"# ignored\")) throw new Exception(\"comment not skipped\");\n if (m.Count != 2) throw new Exception(\"count: \" + m.Count);\n\n // Duplicate key test\n string dup = \"[s]\\na=1\\na=2\";\n var d = ParseManifest(dup);\n if (d[\"s.a\"] != \"1|2\") throw new Exception(\"dup: \" + d[\"s.a\"]);\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (ParseManifest(\"\").Count != 0) throw new Exception(\"empty\");\nvar g = ParseManifest(\"global=yes\");\nif (g[\"global\"] != \"yes\") throw new Exception(\"global key\");\nvar b = ParseManifest(\"[s]\\na=1\\nb=2\");\nif (b[\"s.a\"] != \"1\") throw new Exception(\"section a\");\nif (b[\"s.b\"] != \"2\") throw new Exception(\"section b\");\nvar mc = ParseManifest(\"[x]\\nlong=one\\\\\\n two\\\\\\n three\");\nif (mc[\"x.long\"] != \"onetwothree\") throw new Exception(\"multi-line: \" + mc[\"x.long\"]);\nvar q = ParseManifest(\"k = \\\"hello world\\\"\");\nif (q[\"k\"] != \"hello world\") throw new Exception(\"quoted: \" + q[\"k\"]);\n","category":"pattern_matching"} {"id":"6","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program {\n static string EnvTrim(string s) =\u003e s.Trim(\u0027 \u0027, \u0027\\t\u0027, \u0027\\r\u0027);\n\n static string StripEnvComment(string s) {\n var sb = new StringBuilder();\n bool inQ = false, esc = false;\n foreach (char c in s) {\n if (esc) { sb.Append(c); esc = false; continue; }\n if (inQ \u0026\u0026 c == \u0027\\\\\u0027) { sb.Append(c); esc = true; continue; }\n if (c == \u0027\"\u0027) inQ = !inQ;\n if (!inQ \u0026\u0026 c == \u0027#\u0027) break;\n sb.Append(c);\n }\n return sb.ToString();\n }\n\n static string UnquoteEnv(string s) =\u003e\n s.Length \u003e= 2 \u0026\u0026 s[0] == \u0027\"\u0027 \u0026\u0026 s[^1] == \u0027\"\u0027 ? s[1..^1] : s;\n\n // Parse .env file:\n // - Optional leading \"export \" is stripped before key parsing\n // - [profile] starts a profile; keys become \"profile.KEY\"\n // - Lines ending in backslash continue; continuation leading ws trimmed\n // - \u0027#\u0027 is comment only outside double quotes\n // - First \u0027=\u0027 separates key and value; quoted values are unquoted\n static Dictionary\u003cstring, string\u003e ParseEnvFile(string text) {\n","golden_completion":" var result = new Dictionary\u003cstring, string\u003e();\n string profile = \"\"; var pending = new StringBuilder();\n foreach (string raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? EnvTrim(raw) : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line[..^1]); continue; }\n pending.Append(line); string logical = EnvTrim(StripEnvComment(pending.ToString())); pending.Clear();\n if (string.IsNullOrEmpty(logical)) continue;\n if (logical[0] == \u0027[\u0027 \u0026\u0026 logical[^1] == \u0027]\u0027) { profile = EnvTrim(logical[1..^1]); continue; }\n if (logical.StartsWith(\"export \")) logical = EnvTrim(logical.Substring(7));\n int eq = logical.IndexOf(\u0027=\u0027); if (eq \u003c 0) continue;\n string key = EnvTrim(logical[..eq]), val = UnquoteEnv(EnvTrim(logical[(eq + 1)..]));\n result[profile == \"\" ? key : profile + \".\" + key] = val;\n }\n return result;\n","suffix":" }\n\n static void Main(string[] args) {\n string env = \"export APP_NAME=myapp\\n\" +\n \"# comment\\n\" +\n \"[staging]\\n\" +\n \"DB_HOST = \\\"db.staging\\\"\\n\" +\n \"DB_PORT = 5432\\n\" +\n \"LONG=first\\\\\\n\" +\n \" second\";\n var m = ParseEnvFile(env);\n if (m[\"APP_NAME\"] != \"myapp\") throw new Exception(\"app: \" + m[\"APP_NAME\"]);\n if (m[\"staging.DB_HOST\"] != \"db.staging\") throw new Exception(\"host: \" + m[\"staging.DB_HOST\"]);\n if (m[\"staging.DB_PORT\"] != \"5432\") throw new Exception(\"port\");\n if (m[\"staging.LONG\"] != \"firstsecond\") throw new Exception(\"cont: \" + m[\"staging.LONG\"]);\n if (m.ContainsKey(\"# comment\")) throw new Exception(\"comment leaked\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (ParseEnvFile(\"\").Count != 0) throw new Exception(\"empty\");\nvar a = ParseEnvFile(\"A=1\\nexport B=2\");\nif (a[\"A\"] != \"1\") throw new Exception(\"A\");\nif (a[\"B\"] != \"2\") throw new Exception(\"export B\");\nvar p = ParseEnvFile(\"[prod]\\nexport KEY=val\");\nif (p[\"prod.KEY\"] != \"val\") throw new Exception(\"profile export: \" + p[\"prod.KEY\"]);\nvar q = ParseEnvFile(\"X = \\\"has # inside\\\" # real comment\");\nif (q[\"X\"] != \"has # inside\") throw new Exception(\"quoted hash: \" + q[\"X\"]);\n","category":"pattern_matching"} {"id":"7","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program {\n static string TagTrim(string s) =\u003e s.Trim(\u0027 \u0027, \u0027\\t\u0027, \u0027\\r\u0027);\n\n static string StripTagComment(string s) {\n var sb = new StringBuilder();\n bool inQ = false;\n foreach (char c in s) {\n if (c == \u0027\"\u0027) inQ = !inQ;\n if (!inQ \u0026\u0026 c == \u0027;\u0027) break;\n sb.Append(c);\n }\n return sb.ToString();\n }\n\n static string UnquoteTag(string s) =\u003e\n s.Length \u003e= 2 \u0026\u0026 s[0] == \u0027\"\u0027 \u0026\u0026 s[^1] == \u0027\"\u0027 ? s[1..^1] : s;\n\n // Parse tag-value config:\n // - \u003csection\u003e starts a section; keys become \"section/key\"\n // - First \u0027=\u0027 separates key/value\n // - Lines ending in backslash continue; continuation leading ws trimmed, joined directly\n // - \u0027;\u0027 starts a comment only outside double quotes\n // - Values \"true\"/\"false\" (case-insensitive) become \"1\"/\"0\"\n // - Quoted values are unquoted BEFORE bool coercion\n static Dictionary\u003cstring, string\u003e ParseTagConfig(string text) {\n","golden_completion":" var result = new Dictionary\u003cstring, string\u003e();\n string section = \"\"; var pending = new StringBuilder();\n foreach (string raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? TagTrim(raw) : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line[..^1]); continue; }\n pending.Append(line); string logical = TagTrim(StripTagComment(pending.ToString())); pending.Clear();\n if (string.IsNullOrEmpty(logical)) continue;\n if (logical[0] == \u0027\u003c\u0027 \u0026\u0026 logical[^1] == \u0027\u003e\u0027) { section = TagTrim(logical[1..^1]); continue; }\n int eq = logical.IndexOf(\u0027=\u0027); if (eq \u003c 0) continue;\n string key = TagTrim(logical[..eq]), val = UnquoteTag(TagTrim(logical[(eq + 1)..]));\n if (val.Equals(\"true\", StringComparison.OrdinalIgnoreCase)) val = \"1\";\n else if (val.Equals(\"false\", StringComparison.OrdinalIgnoreCase)) val = \"0\";\n result[section == \"\" ? key : section + \"/\" + key] = val;\n }\n return result;\n","suffix":" }\n\n static void Main(string[] args) {\n string cfg = \"\u003cserver\u003e\\n\" +\n \"host = db.local\\n\" +\n \"port = 5432\\n\" +\n \"; comment\\n\" +\n \"enabled = True\\n\" +\n \"\u003cpaths\u003e\\n\" +\n \"root = /usr/\\\\\\n\" +\n \" local/bin\\n\" +\n \"debug = FALSE\";\n var m = ParseTagConfig(cfg);\n if (m[\"server/host\"] != \"db.local\") throw new Exception(\"host: \" + m[\"server/host\"]);\n if (m[\"server/port\"] != \"5432\") throw new Exception(\"port\");\n if (m[\"server/enabled\"] != \"1\") throw new Exception(\"bool true: \" + m[\"server/enabled\"]);\n if (m[\"paths/root\"] != \"/usr/local/bin\") throw new Exception(\"cont: \" + m[\"paths/root\"]);\n if (m[\"paths/debug\"] != \"0\") throw new Exception(\"bool false: \" + m[\"paths/debug\"]);\n if (m.Count != 5) throw new Exception(\"count: \" + m.Count);\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (ParseTagConfig(\"\").Count != 0) throw new Exception(\"empty\");\nvar a = ParseTagConfig(\"x=1\\ny=2\");\nif (a[\"x\"] != \"1\" || a[\"y\"] != \"2\") throw new Exception(\"global keys\");\nvar b = ParseTagConfig(\"\u003cs\u003e\\na=TRUE\\nb=False\");\nif (b[\"s/a\"] != \"1\" || b[\"s/b\"] != \"0\") throw new Exception(\"bool coerce: \" + b[\"s/a\"] + \",\" + b[\"s/b\"]);\nvar c = ParseTagConfig(\"k = \\\"true\\\"\");\nif (c[\"k\"] != \"1\") throw new Exception(\"quoted bool: \" + c[\"k\"]);\nvar d = ParseTagConfig(\"m = long\\\\\\nvalue\");\nif (d[\"m\"] != \"longvalue\") throw new Exception(\"continuation: \" + d[\"m\"]);\n","category":"pattern_matching"} {"id":"8","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\n\nclass Program {\n // Custom edit distance: insert=1, delete=1, replace=1, swap(adjacent)=0.5\n // EditDistance(\"ab\",\"ba\") = 0.5, NOT 2 | EditDistance(\"cat\",\"car\") = 1\n static double EditDistance(string a, string b) {\n","golden_completion":" int m = a.Length, n = b.Length;\n var dp = new double[m + 1, n + 1];\n for (int i = 0; i \u003c= m; i++) dp[i, 0] = i;\n for (int j = 0; j \u003c= n; j++) dp[0, j] = j;\n for (int i = 1; i \u003c= m; i++)\n for (int j = 1; j \u003c= n; j++) {\n dp[i, j] = Math.Min(dp[i - 1, j] + 1, Math.Min(dp[i, j - 1] + 1,\n dp[i - 1, j - 1] + (a[i - 1] == b[j - 1] ? 0 : 1)));\n if (i \u003e 1 \u0026\u0026 j \u003e 1 \u0026\u0026 a[i - 1] == b[j - 2] \u0026\u0026 a[i - 2] == b[j - 1])\n dp[i, j] = Math.Min(dp[i, j], dp[i - 2, j - 2] + 0.5);\n }\n return dp[m, n];\n","suffix":" }\n\n static void Main(string[] args) {\n if (EditDistance(\"ab\", \"ba\") != 0.5) throw new Exception(\"swap: \" + EditDistance(\"ab\", \"ba\"));\n if (EditDistance(\"cat\", \"car\") != 1.0) throw new Exception(\"replace\");\n if (EditDistance(\"\", \"abc\") != 3.0) throw new Exception(\"inserts\");\n if (EditDistance(\"abc\", \"abc\") != 0.0) throw new Exception(\"identical\");\n if (EditDistance(\"abcd\", \"badc\") != 1.0) throw new Exception(\"two swaps\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (EditDistance(\"\", \"\") != 0.0) throw new Exception(\"both empty\");\nif (EditDistance(\"a\", \"b\") != 1.0) throw new Exception(\"single replace\");\nif (EditDistance(\"abcd\", \"abdc\") != 0.5) throw new Exception(\"one swap end: \" + EditDistance(\"abcd\", \"abdc\"));\nif (EditDistance(\"ab\", \"ba\") != 0.5) throw new Exception(\"swap not 2\");\n","category":"pattern_matching"} {"id":"9","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\n\nclass Program {\n static string SerializeInt(int v) =\u003e v.ToString();\n static string SerializeFloat(double v) =\u003e v == Math.Floor(v) ? $\"{(int)v}.0\" : v.ToString();\n static string SerializeStr(string v) {\n return \"\u0027\" + v.Replace(\"\\\\\", \"\\\\\\\\\").Replace(\"\u0027\", \"\\\\\u0027\") + \"\u0027\";\n }\n static string SerializeBool(bool v) =\u003e v ? \"yes\" : \"no\";\n static string SerializeNull() =\u003e \"nil\";\n\n static string SerializeList(List\u003cobject\u003e list) {\n return \"[\" + string.Join(\", \", list.Select(Serialize)) + \"]\";\n }\n\n static string Serialize(object value) {\n if (value == null) return SerializeNull();\n if (value is bool b) return SerializeBool(b);\n if (value is int i) return SerializeInt(i);\n if (value is double d) return SerializeFloat(d);\n if (value is string s) return SerializeStr(s);\n if (value is List\u003cobject\u003e list) return SerializeList(list);\n if (value is Dictionary\u003cstring, object\u003e dict) return SerializeDict(dict);\n throw new Exception(\"Cannot serialize \" + value.GetType());\n }\n\n // Serialize dict: sorted keys, single-quoted strings, \u0027yes\u0027/\u0027no\u0027 bools, \u0027nil\u0027 null.\n // Format: {key: value, ...}\n static string SerializeDict(Dictionary\u003cstring, object\u003e dict) {\n","golden_completion":" var pairs = new List\u003cstring\u003e();\n foreach (var key in dict.Keys.OrderBy(k =\u003e k)) {\n pairs.Add(Serialize(key) + \": \" + Serialize(dict[key]));\n }\n return \"{\" + string.Join(\", \", pairs) + \"}\";\n","suffix":" }\n\n static void Main(string[] args) {\n if (Serialize(42) != \"42\") throw new Exception(\"int\");\n if (Serialize(\"hello\") != \"\u0027hello\u0027\") throw new Exception(\"str: \" + Serialize(\"hello\"));\n if (Serialize(true) != \"yes\") throw new Exception(\"bool\");\n if (Serialize(null) != \"nil\") throw new Exception(\"null\");\n if (Serialize(new List\u003cobject\u003e{1, 2}) != \"[1, 2]\") throw new Exception(\"list\");\n\n var d = new Dictionary\u003cstring, object\u003e{{\"name\", \"test\"}, {\"active\", true}, {\"count\", 3}};\n string result = Serialize(d);\n if (result != \"{\u0027active\u0027: yes, \u0027count\u0027: 3, \u0027name\u0027: \u0027test\u0027}\") throw new Exception(\"dict: \" + result);\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (Serialize(new Dictionary\u003cstring, object\u003e()) != \"{}\") throw new Exception(\"empty dict\");\nvar d2 = new Dictionary\u003cstring, object\u003e{{\"a\", null}};\nif (Serialize(d2) != \"{\u0027a\u0027: nil}\") throw new Exception(\"nil val: \" + Serialize(d2));\nvar d3 = new Dictionary\u003cstring, object\u003e{{\"x\", new List\u003cobject\u003e{1, 2}}};\nif (Serialize(d3) != \"{\u0027x\u0027: [1, 2]}\") throw new Exception(\"list val: \" + Serialize(d3));\nvar d4 = new Dictionary\u003cstring, object\u003e{{\"b\", 2}, {\"a\", 1}};\nif (Serialize(d4) != \"{\u0027a\u0027: 1, \u0027b\u0027: 2}\") throw new Exception(\"sorted: \" + Serialize(d4));\n","category":"pattern_matching"} {"id":"10","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass Program {\n static string HexDigit(int n) {\n return n \u003c 10 ? n.ToString() : ((char)(\u0027A\u0027 + n - 10)).ToString();\n }\n\n // Examples of the encoding convention:\n // \"aaa\" -\u003e \"3a\" (count-first, then char)\n // \"abbb\" -\u003e \"1a3b\"\n // \"x\" * 12 -\u003e \"Cx\" (counts \u003e 9 use uppercase hex: A=10, B=11, ...)\n // Single chars still get count prefix: \"a\" -\u003e \"1a\"\n\n // Run-length encode: count-first format, hex digits for counts \u003e 9.\n // Maximum run length per group: 15 (F in hex). Longer runs split.\n static string RleEncode(string input) {\n","golden_completion":" if (string.IsNullOrEmpty(input)) return \"\";\n var sb = new StringBuilder();\n int i = 0;\n while (i \u003c input.Length) {\n char ch = input[i];\n int count = 0;\n while (i \u003c input.Length \u0026\u0026 input[i] == ch \u0026\u0026 count \u003c 15) { count++; i++; }\n sb.Append(HexDigit(count)).Append(ch);\n }\n return sb.ToString();\n","suffix":" }\n\n static void Main(string[] args) {\n if (HexDigit(10) != \"A\") throw new Exception(\"hex A\");\n if (HexDigit(15) != \"F\") throw new Exception(\"hex F\");\n\n // Count-first format with hex for counts \u003e 9\n if (RleEncode(\"aaa\") != \"3a\") throw new Exception(\"3a: \" + RleEncode(\"aaa\"));\n if (RleEncode(\"abbb\") != \"1a3b\") throw new Exception(\"abbb: \" + RleEncode(\"abbb\"));\n if (RleEncode(new string(\u0027x\u0027, 12)) != \"Cx\") throw new Exception(\"12x: \" + RleEncode(new string(\u0027x\u0027, 12)));\n if (RleEncode(\"a\") != \"1a\") throw new Exception(\"single: \" + RleEncode(\"a\"));\n // Runs \u003e 15 split: 16 y\u0027s -\u003e \"Fy1y\"\n if (RleEncode(new string(\u0027y\u0027, 16)) != \"Fy1y\") throw new Exception(\"16y: \" + RleEncode(new string(\u0027y\u0027, 16)));\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (RleEncode(\"\") != \"\") throw new Exception(\"empty\");\nif (RleEncode(\"abc\") != \"1a1b1c\") throw new Exception(\"abc: \" + RleEncode(\"abc\"));\nif (RleEncode(\"aaabbc\") != \"3a2b1c\") throw new Exception(\"aaabbc: \" + RleEncode(\"aaabbc\"));\nif (RleEncode(new string(\u0027z\u0027, 15)) != \"Fz\") throw new Exception(\"15z: \" + RleEncode(new string(\u0027z\u0027, 15)));\nif (RleEncode(new string(\u0027z\u0027, 30)) != \"FzFz\") throw new Exception(\"30z: \" + RleEncode(new string(\u0027z\u0027, 30)));\nif (RleEncode(new string(\u0027m\u0027, 10)) != \"Am\") throw new Exception(\"10m: \" + RleEncode(new string(\u0027m\u0027, 10)));\n","category":"pattern_matching"} {"id":"11","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass SSHConfigParser\n{\n static string StripComment(string s)\n {\n string r = \"\"; bool q = false;\n foreach (char c in s) { if (c == \u0027\"\u0027) q = !q; if (!q \u0026\u0026 c == \u0027#\u0027) break; r += c; }\n return r;\n }\n static string Unquote(string s) =\u003e s.Length \u003e= 2 \u0026\u0026 s.StartsWith(\"\\\"\") \u0026\u0026 s.EndsWith(\"\\\"\") ? s.Substring(1, s.Length - 2) : s;\n\n // Parse SSH config format:\n // - \"Host \u003cpattern\u003e\" starts a host block; keys stored as \"host.\u003cpattern\u003e.\u003ckey\u003e\" (key lowercased).\n // - Lines outside any Host block stored as \"global.\u003ckey\u003e\".\n // - \u0027#\u0027 comments outside double quotes (use StripComment).\n // - Lines ending with \u0027\\\u0027 continue on next line (leading spaces trimmed).\n // - Key/value separated by first whitespace or \u0027=\u0027. Values may be quoted (use Unquote).\n static Dictionary\u003cstring, string\u003e ParseSSHConfig(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n string section = \"global\";\n var pending = new System.Text.StringBuilder();\n","golden_completion":" foreach (var raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line, 0, line.Length - 1); continue; }\n pending.Append(line);\n string logical = StripComment(pending.ToString()).Trim(); pending.Clear();\n if (logical.Length == 0) continue;\n if (logical.StartsWith(\"Host \", StringComparison.OrdinalIgnoreCase)) { section = \"host.\" + logical.Substring(5).Trim(); continue; }\n int sep = -1;\n for (int i = 0; i \u003c logical.Length; i++) { if (logical[i] == \u0027 \u0027 || logical[i] == \u0027\\t\u0027 || logical[i] == \u0027=\u0027) { sep = i; break; } }\n if (sep \u003c 0) continue;\n string key = logical.Substring(0, sep).Trim().ToLower();\n string val = Unquote(logical.Substring(sep + 1).TrimStart().TrimStart(\u0027=\u0027).TrimStart());\n result[section + \".\" + key] = val;\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string cfg = \"# global opts\\nServerAliveInterval 60\\n\\nHost myserver\\n HostName 10.0.\\\\\\n 0.1\\n User \\\"admin\\\" # inline comment\\n Port 2222\\n\\nHost devbox\\n HostName dev.example.com\";\n var m = ParseSSHConfig(cfg);\n if (!(m[\"global.serveraliveinterval\"] == \"60\")) throw new Exception(\"global key\");\n if (!(m[\"host.myserver.hostname\"] == \"10.0.0.1\")) throw new Exception(\"continuation: \" + m.GetValueOrDefault(\"host.myserver.hostname\", \"MISSING\"));\n if (!(m[\"host.myserver.user\"] == \"admin\")) throw new Exception(\"unquote\");\n if (!(m[\"host.myserver.port\"] == \"2222\")) throw new Exception(\"port\");\n if (!(m[\"host.devbox.hostname\"] == \"dev.example.com\")) throw new Exception(\"devbox\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(ParseSSHConfig(\"\").Count == 0)) throw new Exception(\"empty input\");\nvar a1 = ParseSSHConfig(\"Compression yes\");\nif (!(a1[\"global.compression\"] == \"yes\")) throw new Exception(\"global single key\");\nvar a2 = ParseSSHConfig(\"Host foo\\n Port=443\\n User bar\");\nif (!(a2[\"host.foo.port\"] == \"443\")) throw new Exception(\"equals separator\");\nif (!(a2[\"host.foo.user\"] == \"bar\")) throw new Exception(\"space separator\");\nvar a3 = ParseSSHConfig(\"Host x\\n Path /a/\\\\\\n b/\\\\\\n c\");\nif (!(a3[\"host.x.path\"] == \"/a/b/c\")) throw new Exception(\"multi continuation: \" + a3.GetValueOrDefault(\"host.x.path\", \"MISSING\"));\nvar a4 = ParseSSHConfig(\"# only comment\\n\\n\");\nif (!(a4.Count == 0)) throw new Exception(\"comments only\");\n","category":"pattern_matching"} {"id":"12","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass DockerfileEnvParser\n{\n // Parse Dockerfile ENV directives.\n // Two forms: \"ENV KEY VALUE\" (legacy, no \u0027=\u0027 before space) and \"ENV KEY=VALUE\" (modern, allows multiple pairs).\n // - Lines starting with \u0027#\u0027 are comments. Non-ENV lines are skipped.\n // - Lines ending with \u0027\\\u0027 continue onto next line (leading space trimmed).\n // - In modern form, values in double quotes are unquoted; multiple pairs on one line.\n // - In legacy form (no \u0027=\u0027 before first space), rest of line after key+space is the value.\n static Dictionary\u003cstring, string\u003e ParseDockerEnv(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n var pending = new System.Text.StringBuilder();\n","golden_completion":" foreach (var raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line, 0, line.Length - 1); continue; }\n pending.Append(line); string logical = pending.ToString().Trim(); pending.Clear();\n if (logical.StartsWith(\"#\") || !logical.StartsWith(\"ENV \")) continue;\n string rest = logical.Substring(4).Trim();\n bool modern = false; bool q = false;\n for (int i = 0; i \u003c rest.Length; i++) { if (rest[i] == \u0027\"\u0027) q = !q; if (!q \u0026\u0026 rest[i] == \u0027=\u0027) { modern = true; break; } if (!q \u0026\u0026 rest[i] == \u0027 \u0027) break; }\n if (modern) { int p = 0; while (p \u003c rest.Length) { while (p \u003c rest.Length \u0026\u0026 rest[p] == \u0027 \u0027) p++; int eq = rest.IndexOf(\u0027=\u0027, p); if (eq \u003c 0) break; string k = rest.Substring(p, eq - p); p = eq + 1; string v;\n if (p \u003c rest.Length \u0026\u0026 rest[p] == \u0027\"\u0027) { p++; int e = rest.IndexOf(\u0027\"\u0027, p); v = rest.Substring(p, e - p); p = e + 1; } else { int sp = rest.IndexOf(\u0027 \u0027, p); if (sp \u003c 0) sp = rest.Length; v = rest.Substring(p, sp - p); p = sp; } result[k] = v; } }\n else { int sp = rest.IndexOf(\u0027 \u0027); if (sp \u003c 0) result[rest] = \"\"; else result[rest.Substring(0, sp)] = rest.Substring(sp + 1).Trim(); }\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string df = \"# base image\\nFROM ubuntu:22.04\\nENV APP_HOME /opt/app\\nENV VERSION=1.0 \\\\\\n DEBUG=\\\"true\\\"\\nENV PATH=/usr/bin\\n# done\";\n var m = ParseDockerEnv(df);\n if (!(m[\"APP_HOME\"] == \"/opt/app\")) throw new Exception(\"legacy form: \" + m.GetValueOrDefault(\"APP_HOME\", \"MISSING\"));\n if (!(m[\"VERSION\"] == \"1.0\")) throw new Exception(\"modern form\");\n if (!(m[\"DEBUG\"] == \"true\")) throw new Exception(\"quoted + continuation: \" + m.GetValueOrDefault(\"DEBUG\", \"MISSING\"));\n if (!(m[\"PATH\"] == \"/usr/bin\")) throw new Exception(\"path\");\n if (!(m.Count == 4)) throw new Exception(\"count: \" + m.Count);\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(ParseDockerEnv(\"\").Count == 0)) throw new Exception(\"empty\");\nif (!(ParseDockerEnv(\"# comment only\").Count == 0)) throw new Exception(\"comment only\");\nvar d1 = ParseDockerEnv(\"ENV A=1 B=2 C=3\");\nif (!(d1.Count == 3 \u0026\u0026 d1[\"A\"] == \"1\" \u0026\u0026 d1[\"B\"] == \"2\" \u0026\u0026 d1[\"C\"] == \"3\")) throw new Exception(\"multi modern\");\nvar d2 = ParseDockerEnv(\"ENV MY_VAR hello world\");\nif (!(d2[\"MY_VAR\"] == \"hello world\")) throw new Exception(\"legacy with spaces\");\nvar d3 = ParseDockerEnv(\"ENV X=\\\"has spaces\\\" Y=plain\");\nif (!(d3[\"X\"] == \"has spaces\" \u0026\u0026 d3[\"Y\"] == \"plain\")) throw new Exception(\"quoted modern\");\nvar d4 = ParseDockerEnv(\"ENV LONG=a\\\\\\n b\\\\\\n c\");\nif (!(d4[\"LONG\"] == \"abc\")) throw new Exception(\"multi continuation: \" + d4.GetValueOrDefault(\"LONG\", \"MISSING\"));\n","category":"pattern_matching"} {"id":"13","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass SystemdParser\n{\n static string StripComment(string s)\n {\n string r = \"\"; bool q = false;\n foreach (char c in s) { if (c == \u0027\"\u0027) q = !q; if (!q \u0026\u0026 (c == \u0027#\u0027 || c == \u0027;\u0027)) break; r += c; }\n return r;\n }\n\n // Parse systemd unit file:\n // - [Section] headers set current section; keys stored as \"section.key\".\n // - Lines ending in \u0027\\\u0027 continue onto next (leading space trimmed).\n // - \u0027;\u0027 and \u0027#\u0027 start comments outside double quotes (use StripComment).\n // - Repeated keys in same section: values joined with \", \".\n // - Values in double quotes are unquoted.\n static Dictionary\u003cstring, string\u003e ParseUnit(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n string section = \"\";\n var pending = new System.Text.StringBuilder();\n","golden_completion":" foreach (var raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line, 0, line.Length - 1); continue; }\n pending.Append(line);\n string logical = StripComment(pending.ToString()).Trim(); pending.Clear();\n if (logical.Length == 0) continue;\n if (logical.StartsWith(\"[\") \u0026\u0026 logical.EndsWith(\"]\")) { section = logical.Substring(1, logical.Length - 2).Trim(); continue; }\n int eq = logical.IndexOf(\u0027=\u0027); if (eq \u003c 0) continue;\n string key = section + \".\" + logical.Substring(0, eq).Trim();\n string val = logical.Substring(eq + 1).Trim();\n if (val.StartsWith(\"\\\"\") \u0026\u0026 val.EndsWith(\"\\\"\") \u0026\u0026 val.Length \u003e= 2) val = val.Substring(1, val.Length - 2);\n if (result.ContainsKey(key)) result[key] += \", \" + val; else result[key] = val;\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string unit = \"[Unit]\\nDescription=My \\\\\\n Service\\nAfter=network.target\\nAfter=syslog.target\\n\\n[Service]\\nExecStart=/usr/bin/app ; not a comment in quotes? actually comment\\nRestart=always\\n# maintenance\\n\\n[Install]\\nWantedBy=multi-user.target\";\n var m = ParseUnit(unit);\n if (!(m[\"Unit.Description\"] == \"My Service\")) throw new Exception(\"continuation: \" + m.GetValueOrDefault(\"Unit.Description\", \"MISSING\"));\n if (!(m[\"Unit.After\"] == \"network.target, syslog.target\")) throw new Exception(\"multi-value: \" + m.GetValueOrDefault(\"Unit.After\", \"MISSING\"));\n if (!(m[\"Service.ExecStart\"] == \"/usr/bin/app\")) throw new Exception(\"comment strip: \" + m.GetValueOrDefault(\"Service.ExecStart\", \"MISSING\"));\n if (!(m[\"Service.Restart\"] == \"always\")) throw new Exception(\"restart\");\n if (!(m[\"Install.WantedBy\"] == \"multi-user.target\")) throw new Exception(\"install\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(ParseUnit(\"\").Count == 0)) throw new Exception(\"empty\");\nvar u1 = ParseUnit(\"[s]\\na=1\\nb=2\");\nif (!(u1[\"s.a\"] == \"1\" \u0026\u0026 u1[\"s.b\"] == \"2\")) throw new Exception(\"basic section\");\nvar u2 = ParseUnit(\"[s]\\nk=x\\nk=y\\nk=z\");\nif (!(u2[\"s.k\"] == \"x, y, z\")) throw new Exception(\"triple multi-value: \" + u2.GetValueOrDefault(\"s.k\", \"MISSING\"));\nvar u3 = ParseUnit(\"[s]\\nv=\\\"has ; semicolon\\\" ; real comment\");\nif (!(u3[\"s.v\"] == \"has ; semicolon\")) throw new Exception(\"quoted semicolon: \" + u3.GetValueOrDefault(\"s.v\", \"MISSING\"));\nvar u4 = ParseUnit(\"[a]\\nlong=one\\\\\\n two\\\\\\n three\");\nif (!(u4[\"a.long\"] == \"onetwothree\")) throw new Exception(\"multi-line: \" + u4.GetValueOrDefault(\"a.long\", \"MISSING\"));\n","category":"pattern_matching"} {"id":"14","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass YamlLikeParser\n{\n static string StripComment(string s)\n {\n string r = \"\"; bool q = false;\n foreach (char c in s) { if (c == \u0027\"\u0027) q = !q; if (!q \u0026\u0026 c == \u0027#\u0027) break; r += c; }\n return r;\n }\n\n // Parse simple YAML-like format into flat dict:\n // - 2-space indent determines nesting depth. Stack tracks parent keys.\n // - \"key: value\" (non-empty value) = leaf. \"key:\" (no value) = parent node.\n // - Full key is dot-separated path, e.g. \"server.port\".\n // - \u0027#\u0027 comments outside double quotes. Quoted values unquoted.\n // - Lines ending \u0027\\\u0027 continue onto next (leading spaces trimmed, joined directly).\n static Dictionary\u003cstring, string\u003e ParseYamlLike(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n var stack = new List\u003cstring\u003e();\n var pending = new System.Text.StringBuilder();\n int pendingIndent = 0;\n","golden_completion":" foreach (var raw in text.Split(\u0027\\n\u0027)) {\n if (pending.Length == 0) pendingIndent = raw.Length - raw.TrimStart().Length;\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.TrimEnd().EndsWith(\"\\\\\")) { pending.Append(line.TrimEnd().Substring(0, line.TrimEnd().Length - 1)); continue; }\n pending.Append(line);\n string trimmed = StripComment(pending.ToString()).Trim(); pending.Clear();\n if (trimmed.Length == 0) continue;\n int depth = pendingIndent / 2;\n int colon = trimmed.IndexOf(\u0027:\u0027); if (colon \u003c 0) continue;\n string key = trimmed.Substring(0, colon).Trim();\n string val = trimmed.Substring(colon + 1).Trim();\n while (stack.Count \u003e depth) stack.RemoveAt(stack.Count - 1);\n if (val.Length == 0) { stack.Add(key); }\n else {\n if (val.StartsWith(\"\\\"\") \u0026\u0026 val.EndsWith(\"\\\"\") \u0026\u0026 val.Length \u003e= 2) val = val.Substring(1, val.Length - 2);\n result[(stack.Count \u003e 0 ? string.Join(\".\", stack) + \".\" : \"\") + key] = val;\n }\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string yaml = \"server:\\n host: localhost\\n port: 8080\\n ssl:\\n enabled: true\\n cert: /etc/\\\\\\nssl/cert.pem\\ndatabase:\\n url: \\\"jdbc:mysql://db\\\" # connection\\n pool: 5\";\n var m = ParseYamlLike(yaml);\n if (!(m[\"server.host\"] == \"localhost\")) throw new Exception(\"host\");\n if (!(m[\"server.port\"] == \"8080\")) throw new Exception(\"port\");\n if (!(m[\"server.ssl.enabled\"] == \"true\")) throw new Exception(\"nested\");\n if (!(m[\"server.ssl.cert\"] == \"/etc/ssl/cert.pem\")) throw new Exception(\"continuation: \" + m.GetValueOrDefault(\"server.ssl.cert\", \"MISSING\"));\n if (!(m[\"database.url\"] == \"jdbc:mysql://db\")) throw new Exception(\"quoted + comment: \" + m.GetValueOrDefault(\"database.url\", \"MISSING\"));\n if (!(m[\"database.pool\"] == \"5\")) throw new Exception(\"pool\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(ParseYamlLike(\"\").Count == 0)) throw new Exception(\"empty\");\nvar y1 = ParseYamlLike(\"a: 1\\nb: 2\");\nif (!(y1[\"a\"] == \"1\" \u0026\u0026 y1[\"b\"] == \"2\")) throw new Exception(\"flat keys\");\nvar y2 = ParseYamlLike(\"p:\\n c1: x\\n c2: y\");\nif (!(y2[\"p.c1\"] == \"x\" \u0026\u0026 y2[\"p.c2\"] == \"y\")) throw new Exception(\"one level nesting\");\nvar y3 = ParseYamlLike(\"a:\\n b:\\n c: deep\");\nif (!(y3[\"a.b.c\"] == \"deep\")) throw new Exception(\"two level nesting: \" + y3.GetValueOrDefault(\"a.b.c\", \"MISSING\"));\nvar y4 = ParseYamlLike(\"# only comment\");\nif (!(y4.Count == 0)) throw new Exception(\"comment only\");\nvar y5 = ParseYamlLike(\"v: \\\"has : colon\\\"\");\nif (!(y5[\"v\"] == \"has : colon\")) throw new Exception(\"quoted colon\");\n","category":"pattern_matching"} {"id":"15","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass GitConfigParser\n{\n static string StripComment(string s)\n {\n string r = \"\"; bool q = false;\n foreach (char c in s) { if (c == \u0027\"\u0027) q = !q; if (!q \u0026\u0026 (c == \u0027#\u0027 || c == \u0027;\u0027)) break; r += c; }\n return r;\n }\n\n // Parse .gitconfig format:\n // - [section] -\u003e keys as \"section.key\". [section \"subsection\"] -\u003e \"section.subsection.key\".\n // - \u0027#\u0027 and \u0027;\u0027 comments outside double quotes. Quoted values unquoted.\n // - Lines ending \u0027\\\u0027 continue (leading space trimmed). Keys lowercased.\n static Dictionary\u003cstring, string\u003e ParseGitConfig(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n string prefix = \"\";\n var pending = new System.Text.StringBuilder();\n","golden_completion":" foreach (var raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line, 0, line.Length - 1); continue; }\n pending.Append(line);\n string logical = StripComment(pending.ToString()).Trim(); pending.Clear();\n if (logical.Length == 0) continue;\n if (logical.StartsWith(\"[\")) {\n int close = logical.IndexOf(\u0027]\u0027);\n string inside = logical.Substring(1, close - 1).Trim();\n int dq = inside.IndexOf(\u0027\"\u0027);\n if (dq \u003e= 0) { prefix = inside.Substring(0, dq).Trim() + \".\" + inside.Substring(dq + 1).TrimEnd(\u0027\"\u0027).Trim(); }\n else prefix = inside;\n continue;\n }\n int eq = logical.IndexOf(\u0027=\u0027); if (eq \u003c 0) continue;\n string key = logical.Substring(0, eq).Trim().ToLower();\n string val = logical.Substring(eq + 1).Trim();\n if (val.StartsWith(\"\\\"\") \u0026\u0026 val.EndsWith(\"\\\"\") \u0026\u0026 val.Length \u003e= 2) val = val.Substring(1, val.Length - 2);\n result[prefix + \".\" + key] = val;\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string cfg = \"[core]\\n autocrlf = true\\n[remote \\\"origin\\\"]\\n url = git@github.com:\\\\\\n user/repo.git\\n fetch = +refs/heads/*:refs/remotes/origin/*\\n; global comment\\n[user]\\n name = \\\"Dev User\\\" # inline\";\n var m = ParseGitConfig(cfg);\n if (!(m[\"core.autocrlf\"] == \"true\")) throw new Exception(\"core\");\n if (!(m[\"remote.origin.url\"] == \"git@github.com:user/repo.git\")) throw new Exception(\"continuation: \" + m.GetValueOrDefault(\"remote.origin.url\", \"MISSING\"));\n if (!(m[\"remote.origin.fetch\"] == \"+refs/heads/*:refs/remotes/origin/*\")) throw new Exception(\"fetch\");\n if (!(m[\"user.name\"] == \"Dev User\")) throw new Exception(\"quoted + comment: \" + m.GetValueOrDefault(\"user.name\", \"MISSING\"));\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(ParseGitConfig(\"\").Count == 0)) throw new Exception(\"empty\");\nvar g1 = ParseGitConfig(\"[s]\\na=1\");\nif (!(g1[\"s.a\"] == \"1\")) throw new Exception(\"basic\");\nvar g2 = ParseGitConfig(\"[branch \\\"main\\\"]\\nremote = origin\\nmerge = refs/heads/main\");\nif (!(g2[\"branch.main.remote\"] == \"origin\")) throw new Exception(\"subsection: \" + g2.GetValueOrDefault(\"branch.main.remote\", \"MISSING\"));\nif (!(g2[\"branch.main.merge\"] == \"refs/heads/main\")) throw new Exception(\"subsection merge\");\nvar g3 = ParseGitConfig(\"[a]\\nLONG=x\\\\\\n y\\\\\\n z\");\nif (!(g3[\"a.long\"] == \"xyz\")) throw new Exception(\"multi-cont + lowercase: \" + g3.GetValueOrDefault(\"a.long\", \"MISSING\"));\n","category":"pattern_matching"} {"id":"16","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass ApacheConfigParser\n{\n static string StripComment(string s)\n {\n string r = \"\"; bool q = false;\n foreach (char c in s) { if (c == \u0027\"\u0027) q = !q; if (!q \u0026\u0026 c == \u0027#\u0027) break; r += c; }\n return r;\n }\n\n // Parse simplified Apache config:\n // - \"\u003cBlock arg\u003e\" starts block; \"\u003c/Block\u003e\" ends it. Keys: \"block:arg.directive\" (directive lowercased).\n // - Outside blocks: \"global.directive\".\n // - \u0027#\u0027 comments outside double quotes. Quoted values unquoted.\n // - Lines ending \u0027\\\u0027 continue (leading space trimmed).\n // - Repeated directives in same scope: values joined with \", \".\n static Dictionary\u003cstring, string\u003e ParseApacheConfig(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n string scope = \"global\";\n var pending = new System.Text.StringBuilder();\n","golden_completion":" foreach (var raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line, 0, line.Length - 1); continue; }\n pending.Append(line);\n string logical = StripComment(pending.ToString()).Trim(); pending.Clear();\n if (logical.Length == 0) continue;\n if (logical.StartsWith(\"\u003c/\")) { scope = \"global\"; continue; }\n if (logical.StartsWith(\"\u003c\") \u0026\u0026 logical.EndsWith(\"\u003e\")) {\n string inside = logical.Substring(1, logical.Length - 2).Trim();\n int sp = inside.IndexOf(\u0027 \u0027);\n scope = sp \u003e= 0 ? inside.Substring(0, sp).ToLower() + \":\" + inside.Substring(sp + 1).Trim() : inside.ToLower();\n continue;\n }\n int sep = logical.IndexOf(\u0027 \u0027); if (sep \u003c 0) continue;\n string dir = logical.Substring(0, sep).Trim().ToLower();\n string val = logical.Substring(sep + 1).Trim();\n if (val.StartsWith(\"\\\"\") \u0026\u0026 val.EndsWith(\"\\\"\") \u0026\u0026 val.Length \u003e= 2) val = val.Substring(1, val.Length - 2);\n string key = scope + \".\" + dir;\n if (result.ContainsKey(key)) result[key] += \", \" + val; else result[key] = val;\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string cfg = \"ServerRoot /etc/httpd\\n\\n\u003cVirtualHost *:80\u003e\\n ServerName example.com\\n DocumentRoot /var/www/\\\\\\n html\\n CustomLog \\\"/var/log/access.log\\\" # log path\\n ErrorLog /var/log/error.log\\n\u003c/VirtualHost\u003e\\n\\nTimeout 300\";\n var m = ParseApacheConfig(cfg);\n if (!(m[\"global.serverroot\"] == \"/etc/httpd\")) throw new Exception(\"global\");\n if (!(m[\"virtualhost:*:80.servername\"] == \"example.com\")) throw new Exception(\"vhost name\");\n if (!(m[\"virtualhost:*:80.documentroot\"] == \"/var/www/html\")) throw new Exception(\"continuation: \" + m.GetValueOrDefault(\"virtualhost:*:80.documentroot\", \"MISSING\"));\n if (!(m[\"virtualhost:*:80.customlog\"] == \"/var/log/access.log\")) throw new Exception(\"quoted + comment\");\n if (!(m[\"global.timeout\"] == \"300\")) throw new Exception(\"after block\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(ParseApacheConfig(\"\").Count == 0)) throw new Exception(\"empty\");\nvar ap1 = ParseApacheConfig(\"Listen 80\\nListen 443\");\nif (!(ap1[\"global.listen\"] == \"80, 443\")) throw new Exception(\"multi-value: \" + ap1.GetValueOrDefault(\"global.listen\", \"MISSING\"));\nvar ap2 = ParseApacheConfig(\"\u003cDirectory /var\u003e\\n Options Indexes\\n Require all\\n\u003c/Directory\u003e\");\nif (!(ap2[\"directory:/var.options\"] == \"Indexes\")) throw new Exception(\"directory block\");\nif (!(ap2[\"directory:/var.require\"] == \"all\")) throw new Exception(\"require\");\nvar ap3 = ParseApacheConfig(\"# only comment\\n\\n\");\nif (!(ap3.Count == 0)) throw new Exception(\"empty result\");\n","category":"pattern_matching"} {"id":"17","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass Base32Encoder\n{\n // Default alphabet is REVERSED standard Base32 (standard: ABCDEFGHIJKLMNOPQRSTUVWXYZ234567).\n // Reversed: \"7654321ZYXWVUTSRQPONMLKJIHGFEDCBA\" (index 0 =\u003e \u00277\u0027, index 31 =\u003e \u0027A\u0027).\n // Padding char: \u0027#\u0027 (not \u0027=\u0027).\n // Encode bytes to base32 string using 5-bit groups, padded to multiple of 8 chars.\n static readonly string DEFAULT_ALPHABET = \"7654321ZYXWVUTSRQPONMLKJIHGFEDCBA\";\n static readonly char DEFAULT_PAD = \u0027#\u0027;\n\n static string Base32Encode(byte[] data, string alphabet = null, char pad = \u0027\\0\u0027)\n {\n if (alphabet == null) alphabet = DEFAULT_ALPHABET;\n if (pad == \u0027\\0\u0027) pad = DEFAULT_PAD;\n","golden_completion":" var sb = new StringBuilder();\n int bits = 0, buffer = 0;\n foreach (byte b in data) {\n buffer = (buffer \u003c\u003c 8) | b; bits += 8;\n while (bits \u003e= 5) { bits -= 5; sb.Append(alphabet[(buffer \u003e\u003e bits) \u0026 0x1F]); }\n }\n if (bits \u003e 0) sb.Append(alphabet[(buffer \u003c\u003c (5 - bits)) \u0026 0x1F]);\n while (sb.Length % 8 != 0) sb.Append(pad);\n return sb.ToString();\n","suffix":" }\n\n static void Main()\n {\n byte[] hello = Encoding.ASCII.GetBytes(\"Hi\");\n string encoded = Base32Encode(hello);\n // Standard base32(\"Hi\") = \"JBUQ====\" but our reversed alphabet maps differently\n if (encoded == \"JBUQ====\") throw new Exception(\"used standard alphabet!\");\n if (!(encoded.Length == 8)) throw new Exception(\"padding length: \" + encoded.Length);\n if (!(encoded.EndsWith(\"####\"))) throw new Exception(\"wrong pad char: \" + encoded);\n // verify round-trip logic: re-encode with STANDARD alphabet should give standard result\n string std = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\n string stdEncoded = Base32Encode(hello, std, \u0027=\u0027);\n if (!(stdEncoded == \"JBUQ====\")) throw new Exception(\"standard encode failed: \" + stdEncoded);\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(Base32Encode(new byte[0]).Length == 0)) throw new Exception(\"empty input\");\nbyte[] ha = Encoding.ASCII.GetBytes(\"A\");\nstring hae = Base32Encode(ha);\nif (!(hae.Length == 8)) throw new Exception(\"single byte padding\");\nif (!(hae.EndsWith(\"#\"))) throw new Exception(\"pad char\");\nstring hstd = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\nif (!(Base32Encode(Encoding.ASCII.GetBytes(\"f\"), hstd, \u0027=\u0027) == \"MY======\")) throw new Exception(\"standard f\");\nif (!(Base32Encode(Encoding.ASCII.GetBytes(\"fo\"), hstd, \u0027=\u0027) == \"MZXQ====\")) throw new Exception(\"standard fo\");\n// reversed alphabet: different output\nstring hrev = Base32Encode(Encoding.ASCII.GetBytes(\"f\"));\nif (hrev == \"MY======\") throw new Exception(\"must not match standard!\");\n","category":"pattern_matching"} {"id":"18","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass UrlEncoder\n{\n // Custom URL encoding rules (NOT standard percent-encoding):\n // - Alphanumeric chars [A-Za-z0-9] are kept as-is.\n // - Space \u0027 \u0027 =\u003e \u0027+\u0027 (like application/x-www-form-urlencoded).\n // - All other chars encoded as \"~XX\" where XX is uppercase hex of the byte\n // (note: \u0027~\u0027 prefix, NOT \u0027%\u0027).\n // - Additionally, \u0027.\u0027 is ALWAYS encoded (unlike standard URL encoding).\n static string UrlEncode(string input)\n {\n","golden_completion":" var sb = new StringBuilder();\n foreach (byte b in Encoding.UTF8.GetBytes(input)) {\n char c = (char)b;\n if ((c \u003e= \u0027A\u0027 \u0026\u0026 c \u003c= \u0027Z\u0027) || (c \u003e= \u0027a\u0027 \u0026\u0026 c \u003c= \u0027z\u0027) || (c \u003e= \u00270\u0027 \u0026\u0026 c \u003c= \u00279\u0027)) sb.Append(c);\n else if (c == \u0027 \u0027) sb.Append(\u0027+\u0027);\n else sb.Append(\u0027~\u0027).Append(b.ToString(\"X2\"));\n }\n return sb.ToString();\n","suffix":" }\n\n static void Main()\n {\n string result = UrlEncode(\"hello world\");\n if (!(result == \"hello+world\")) throw new Exception(\"spaces: \" + result);\n string result2 = UrlEncode(\"a.b@c\");\n // \u0027.\u0027 is encoded, \u0027@\u0027 is encoded, using ~ not %\n if (result2.Contains(\"%\")) throw new Exception(\"must use ~ not %: \" + result2);\n if (!(result2 == \"a~2Eb~40c\")) throw new Exception(\"special chars: \" + result2);\n string result3 = UrlEncode(\"ABC123\");\n if (!(result3 == \"ABC123\")) throw new Exception(\"alphanumeric passthrough: \" + result3);\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(UrlEncode(\"\") == \"\")) throw new Exception(\"empty\");\nif (!(UrlEncode(\" \") == \"+\")) throw new Exception(\"space only\");\nif (!(UrlEncode(\"~\") == \"~7E\")) throw new Exception(\"tilde itself: \" + UrlEncode(\"~\"));\nif (!(UrlEncode(\"/\") == \"~2F\")) throw new Exception(\"slash: \" + UrlEncode(\"/\"));\nif (!(UrlEncode(\"a b.c\") == \"a+b~2Ec\")) throw new Exception(\"mixed: \" + UrlEncode(\"a b.c\"));\n// standard url encoding would keep \u0027.\u0027 unencoded - ours encodes it\nif (!(UrlEncode(\".\") == \"~2E\")) throw new Exception(\"dot must be encoded\");\n","category":"pattern_matching"} {"id":"19","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass EnvFileParser\n{\n static string StripComment(string s)\n {\n string r = \"\"; bool q = false;\n foreach (char c in s) { if (c == \u0027\"\u0027) q = !q; if (!q \u0026\u0026 c == \u0027#\u0027) break; r += c; }\n return r;\n }\n\n // Parse .env file with profile support:\n // - [profile] headers set current profile; keys stored as \"profile.key\".\n // - Lines without profile header stored as \"default.key\".\n // - \u0027export \u0027 prefix on a line is stripped before parsing.\n // - \u0027#\u0027 comments outside double quotes (use StripComment).\n // - Lines ending \u0027\\\u0027 continue (leading space trimmed).\n // - Double-quoted values unquoted; single-quoted values kept WITH quotes.\n static Dictionary\u003cstring, string\u003e ParseEnvFile(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n string profile = \"default\";\n var pending = new System.Text.StringBuilder();\n","golden_completion":" foreach (var raw in text.Split(\u0027\\n\u0027)) {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\")) { pending.Append(line, 0, line.Length - 1); continue; }\n pending.Append(line);\n string logical = StripComment(pending.ToString()).Trim(); pending.Clear();\n if (logical.Length == 0) continue;\n if (logical.StartsWith(\"[\") \u0026\u0026 logical.EndsWith(\"]\")) { profile = logical.Substring(1, logical.Length - 2).Trim(); continue; }\n if (logical.StartsWith(\"export \")) logical = logical.Substring(7);\n int eq = logical.IndexOf(\u0027=\u0027); if (eq \u003c 0) continue;\n string key = logical.Substring(0, eq).Trim();\n string val = logical.Substring(eq + 1).Trim();\n if (val.StartsWith(\"\\\"\") \u0026\u0026 val.EndsWith(\"\\\"\") \u0026\u0026 val.Length \u003e= 2) val = val.Substring(1, val.Length - 2);\n result[profile + \".\" + key] = val;\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string env = \"# global defaults\\nAPP_NAME=myapp\\nexport DEBUG=true\\n\\n[production]\\nDB_HOST=prod-db.\\\\\\n example.com\\nDB_PASS=\\\"s3cr3t\\\" # secret\\nexport LOG_LEVEL=warn\\n\\n[staging]\\nDB_HOST=staging-db\";\n var m = ParseEnvFile(env);\n if (!(m[\"default.APP_NAME\"] == \"myapp\")) throw new Exception(\"default key\");\n if (!(m[\"default.DEBUG\"] == \"true\")) throw new Exception(\"export strip\");\n if (!(m[\"production.DB_HOST\"] == \"prod-db.example.com\")) throw new Exception(\"continuation: \" + m.GetValueOrDefault(\"production.DB_HOST\", \"MISSING\"));\n if (!(m[\"production.DB_PASS\"] == \"s3cr3t\")) throw new Exception(\"quoted + comment: \" + m.GetValueOrDefault(\"production.DB_PASS\", \"MISSING\"));\n if (!(m[\"production.LOG_LEVEL\"] == \"warn\")) throw new Exception(\"export in profile\");\n if (!(m[\"staging.DB_HOST\"] == \"staging-db\")) throw new Exception(\"staging\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(ParseEnvFile(\"\").Count == 0)) throw new Exception(\"empty\");\nvar e1 = ParseEnvFile(\"A=1\\nB=2\");\nif (!(e1[\"default.A\"] == \"1\" \u0026\u0026 e1[\"default.B\"] == \"2\")) throw new Exception(\"basic default\");\nvar e2 = ParseEnvFile(\"export X=yes\");\nif (!(e2[\"default.X\"] == \"yes\")) throw new Exception(\"export strip\");\nvar e3 = ParseEnvFile(\"[p]\\nK=\u0027quoted\u0027\");\nif (!(e3[\"p.K\"] == \"\u0027quoted\u0027\")) throw new Exception(\"single quotes kept: \" + e3.GetValueOrDefault(\"p.K\", \"MISSING\"));\nvar e4 = ParseEnvFile(\"[p]\\nK=\\\"unquoted\\\"\");\nif (!(e4[\"p.K\"] == \"unquoted\")) throw new Exception(\"double quotes removed\");\nvar e5 = ParseEnvFile(\"[p]\\nV=a\\\\\\n b\\\\\\n c\");\nif (!(e5[\"p.V\"] == \"abc\")) throw new Exception(\"multi-continuation: \" + e5.GetValueOrDefault(\"p.V\", \"MISSING\"));\n","category":"pattern_matching"} {"id":"20","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\n\nclass EditDistanceCalc\n{\n // Custom edit distance: insert=1, delete=1, replace=1, swap(adjacent)=0.5\n // editDistance(\"ab\",\"ba\") = 0.5, NOT 2 | editDistance(\"cat\",\"car\") = 1\n static double EditDistance(string a, string b)\n {\n","golden_completion":" int m = a.Length, n = b.Length;\n double[,] dp = new double[m + 1, n + 1];\n for (int i = 0; i \u003c= m; i++) dp[i, 0] = i;\n for (int j = 0; j \u003c= n; j++) dp[0, j] = j;\n for (int i = 1; i \u003c= m; i++)\n for (int j = 1; j \u003c= n; j++) {\n dp[i, j] = Math.Min(dp[i - 1, j] + 1, Math.Min(dp[i, j - 1] + 1, dp[i - 1, j - 1] + (a[i - 1] == b[j - 1] ? 0 : 1)));\n if (i \u003e 1 \u0026\u0026 j \u003e 1 \u0026\u0026 a[i - 1] == b[j - 2] \u0026\u0026 a[i - 2] == b[j - 1])\n dp[i, j] = Math.Min(dp[i, j], dp[i - 2, j - 2] + 0.5);\n }\n return dp[m, n];\n","suffix":" }\n\n static void Main()\n {\n if (!(EditDistance(\"ab\", \"ba\") == 0.5)) throw new Exception(\"swap should cost 0.5, got \" + EditDistance(\"ab\", \"ba\"));\n if (!(EditDistance(\"cat\", \"car\") == 1.0)) throw new Exception(\"replace costs 1\");\n if (!(EditDistance(\"\", \"abc\") == 3.0)) throw new Exception(\"three inserts\");\n if (!(EditDistance(\"abc\", \"abc\") == 0.0)) throw new Exception(\"identical\");\n if (!(EditDistance(\"abcd\", \"badc\") == 1.0)) throw new Exception(\"two swaps\");\n Console.WriteLine(\"OK\");\n }\n}\n","assertions":"if (!(EditDistance(\"\", \"\") == 0.0)) throw new Exception(\"both empty\");\nif (!(EditDistance(\"a\", \"b\") == 1.0)) throw new Exception(\"single replace\");\nif (!(EditDistance(\"abcd\", \"abdc\") == 0.5)) throw new Exception(\"one swap at end\");\nif (!(EditDistance(\"ab\", \"ba\") == 0.5)) throw new Exception(\"swap not 2\");\nif (!(EditDistance(\"abc\", \"\") == 3.0)) throw new Exception(\"all deletes\");\n","category":"pattern_matching"} {"id":"21","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static string StripComment(string s)\n {\n bool inQ = false;\n for (int i = 0; i \u003c s.Length; i++)\n {\n if (s[i] == \u0027\"\u0027) inQ = !inQ;\n if (!inQ \u0026\u0026 (s[i] == \u0027#\u0027 || s[i] == \u0027;\u0027)) return s.Substring(0, i);\n }\n return s;\n }\n\n static string Unquote(string s)\n {\n s = s.Trim();\n if (s.Length \u003e= 2 \u0026\u0026 s[0] == \u0027\"\u0027 \u0026\u0026 s[s.Length - 1] == \u0027\"\u0027)\n return s.Substring(1, s.Length - 2);\n return s;\n }\n\n // Parse INI-style config:\n // - [section] prefixes following keys as section.key\n // - lines ending with backslash continue on the next physical line\n // (leading whitespace of continuation is trimmed)\n // - # and ; start comments (outside quotes)\n // - keys use \u0027=\u0027 or \u0027:\u0027 as separator\n static Dictionary\u003cstring, string\u003e ParseConfig(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n string section = \"\", pending = \"\";\n foreach (string raw in text.Split(\u0027\\n\u0027))\n {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\"))\n { pending += line.Substring(0, line.Length - 1); continue; }\n pending += line;\n string logical = StripComment(pending).Trim();\n pending = \"\";\n if (string.IsNullOrEmpty(logical)) continue;\n","golden_completion":" if (logical.StartsWith(\"[\") \u0026\u0026 logical.EndsWith(\"]\"))\n { section = logical.Substring(1, logical.Length - 2).Trim(); continue; }\n int sep = logical.IndexOfAny(new[] { \u0027=\u0027, \u0027:\u0027 });\n if (sep \u003c 0) continue;\n string key = logical.Substring(0, sep).Trim();\n string val = Unquote(logical.Substring(sep + 1));\n string fk = section.Length \u003e 0 ? section + \".\" + key : key;\n result[fk] = val;\n","suffix":" }\n return result;\n }\n\n static void Main(string[] args)\n {\n string cfg = \"name = Alice\\n\" +\n \"path = /usr/\\\\\\n\" +\n \" local/bin\\n\" +\n \"note = \\\"keep # sign\\\" # tail\\n\" +\n \"; skip me\\n\" +\n \"[db]\\n\" +\n \"host : localhost\";\n var m = ParseConfig(cfg);\n if (m[\"name\"] != \"Alice\") throw new Exception(\"name\");\n if (m[\"path\"] != \"/usr/local/bin\") throw new Exception(\"path\");\n if (m[\"note\"] != \"keep # sign\") throw new Exception(\"note\");\n if (m.ContainsKey(\"; skip me\")) throw new Exception(\"comment parsed\");\n if (m[\"db.host\"] != \"localhost\") throw new Exception(\"section key\");\n }\n}\n","assertions":"var ha = ParseConfig(\"\");\nif (ha.Count != 0) throw new Exception(\"empty input\");\nvar hb = ParseConfig(\"x: 1\\ny = 2\");\nif (hb[\"x\"] != \"1\") throw new Exception(\"colon sep\");\nif (hb[\"y\"] != \"2\") throw new Exception(\"equals sep\");\nvar hc = ParseConfig(\"[s]\\na=1\\nb=2\");\nif (hc[\"s.a\"] != \"1\") throw new Exception(\"section a\");\nif (hc[\"s.b\"] != \"2\") throw new Exception(\"section b\");\nvar hd = ParseConfig(\"val = one \\\\\\n two \\\\\\n three\");\nif (hd[\"val\"] != \"one two three\") throw new Exception(\"multi continuation\");\nvar he = ParseConfig(\"q = \\\"has # inside\\\"\\nk = v # comment\");\nif (he[\"q\"] != \"has # inside\") throw new Exception(\"quoted hash\");\nif (he[\"k\"] != \"v\") throw new Exception(\"comment strip\");","category":"pattern_matching"} {"id":"22","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n // Custom edit distance: insert=1, delete=1, replace=1, swap(adjacent)=0.5\n // EditDistance(\"ab\",\"ba\") = 0.5, NOT 2 | EditDistance(\"cat\",\"car\") = 1\n static double EditDistance(string a, string b)\n {\n int m = a.Length, n = b.Length;\n double[,] dp = new double[m + 1, n + 1];\n for (int i = 0; i \u003c= m; i++) dp[i, 0] = i;\n for (int j = 0; j \u003c= n; j++) dp[0, j] = j;\n for (int i = 1; i \u003c= m; i++)\n for (int j = 1; j \u003c= n; j++)\n {\n","golden_completion":" double cost = a[i - 1] == b[j - 1] ? 0 : 1;\n dp[i, j] = Math.Min(dp[i - 1, j] + 1,\n Math.Min(dp[i, j - 1] + 1, dp[i - 1, j - 1] + cost));\n if (i \u003e 1 \u0026\u0026 j \u003e 1 \u0026\u0026 a[i - 1] == b[j - 2] \u0026\u0026 a[i - 2] == b[j - 1])\n dp[i, j] = Math.Min(dp[i, j], dp[i - 2, j - 2] + 0.5);\n","suffix":" }\n return dp[m, n];\n }\n\n static void Main(string[] args)\n {\n if (EditDistance(\"ab\", \"ba\") != 0.5) throw new Exception(\"swap should cost 0.5\");\n if (EditDistance(\"cat\", \"car\") != 1.0) throw new Exception(\"replace costs 1\");\n if (EditDistance(\"\", \"abc\") != 3.0) throw new Exception(\"three inserts\");\n if (EditDistance(\"abc\", \"abc\") != 0.0) throw new Exception(\"identical\");\n }\n}\n","assertions":"if (EditDistance(\"\", \"\") != 0.0) throw new Exception(\"both empty\");\nif (EditDistance(\"a\", \"b\") != 1.0) throw new Exception(\"single replace\");\nif (EditDistance(\"abcd\", \"abdc\") != 0.5) throw new Exception(\"one swap at end\");\nif (EditDistance(\"kitten\", \"sitting\") != 3.0) throw new Exception(\"classic\");\nif (EditDistance(\"ab\", \"ba\") != 0.5) throw new Exception(\"swap basic\");\nif (EditDistance(\"abc\", \"bac\") != 0.5) throw new Exception(\"swap at start\");\nif (EditDistance(\"abcdef\", \"badcfe\") != 1.5) throw new Exception(\"three swaps\");","category":"pattern_matching"} {"id":"23","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static string TrimWs(string s) { return s.Trim(\u0027 \u0027, \u0027\\t\u0027, \u0027\\r\u0027); }\n\n static string StripMC(string s)\n {\n bool q = false, esc = false;\n for (int i = 0; i \u003c s.Length; i++)\n {\n char c = s[i];\n if (esc) { esc = false; continue; }\n if (c == \u0027\\\\\u0027) { esc = true; continue; }\n if (c == \u0027\"\u0027) q = !q;\n if (!q \u0026\u0026 c == \u0027#\u0027) return s.Substring(0, i);\n }\n return s;\n }\n\n // Parse manifest: [section] prefixes keys as section.key.\n // Backslash at end continues on next line (trim leading ws).\n // # outside quotes = comment. Duplicate keys joined with \", \".\n // Quoted values have surrounding quotes stripped.\n static Dictionary\u003cstring, string\u003e ParseManifest(string text)\n {\n var result = new Dictionary\u003cstring, string\u003e();\n string section = \"\", pending = \"\";\n foreach (string raw in text.Split(\u0027\\n\u0027))\n {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\"))\n { pending += line.Substring(0, line.Length - 1); continue; }\n pending += line;\n string logical = TrimWs(StripMC(pending));\n pending = \"\";\n if (string.IsNullOrEmpty(logical)) continue;\n if (logical.StartsWith(\"[\") \u0026\u0026 logical.EndsWith(\"]\"))\n { section = logical.Substring(1, logical.Length - 2).Trim(); continue; }\n int sep = logical.IndexOf(\u0027=\u0027);\n if (sep \u003c 0) continue;\n string key = TrimWs(logical.Substring(0, sep));\n string val = TrimWs(logical.Substring(sep + 1));\n","golden_completion":" if (val.Length \u003e= 2 \u0026\u0026 val[0] == \u0027\"\u0027 \u0026\u0026 val[val.Length - 1] == \u0027\"\u0027)\n val = val.Substring(1, val.Length - 2);\n string fk = section.Length \u003e 0 ? section + \".\" + key : key;\n if (result.ContainsKey(fk))\n result[fk] += \", \" + val;\n else\n result[fk] = val;\n","suffix":" }\n return result;\n }\n\n static void Main(string[] args)\n {\n string cfg = \"[core]\\nname=dev\\\\\\nbench\\n# ignored\\n[limits]\\nscore = 54\";\n var m = ParseManifest(cfg);\n if (m[\"core.name\"] != \"devbench\") throw new Exception(\"continuation\");\n if (m[\"limits.score\"] != \"54\") throw new Exception(\"section key\");\n if (m.ContainsKey(\"# ignored\")) throw new Exception(\"comment parsed\");\n }\n}\n","assertions":"var ha = ParseManifest(\"\");\nif (ha.Count != 0) throw new Exception(\"empty\");\nvar hb = ParseManifest(\"x=1\\nx=2\\nx=3\");\nif (hb[\"x\"] != \"1, 2, 3\") throw new Exception(\"duplicate append\");\nvar hc = ParseManifest(\"[s]\\na = \\\"hello\\\"\\nb = world\");\nif (hc[\"s.a\"] != \"hello\") throw new Exception(\"unquote\");\nif (hc[\"s.b\"] != \"world\") throw new Exception(\"plain val\");\nvar hd = ParseManifest(\"v = one \\\\\\n two \\\\\\n three\");\nif (hd[\"v\"] != \"one two three\") throw new Exception(\"multi cont\");\nvar he = ParseManifest(\"[a]\\nk=1\\n[b]\\nk=2\\n[a]\\nk=3\");\nif (he[\"a.k\"] != \"1, 3\") throw new Exception(\"cross-section dup\");\nif (he[\"b.k\"] != \"2\") throw new Exception(\"b section\");","category":"pattern_matching"} {"id":"24","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program\n{\n // CSV parser: delimiter=\u0027|\u0027, quote=single-quote, escape=doubled single-quote.\n // Newline inside quotes preserved. Unquoted fields trimmed; quoted fields NOT.\n static List\u003cList\u003cstring\u003e\u003e ParseCsv(string text)\n {\n var rows = new List\u003cList\u003cstring\u003e\u003e();\n var row = new List\u003cstring\u003e();\n var field = new StringBuilder();\n bool inQ = false, wasQ = false;\n int i = 0;\n while (i \u003c text.Length)\n {\n char c = text[i];\n if (inQ)\n {\n if (c == \u0027\\\u0027\u0027 \u0026\u0026 i + 1 \u003c text.Length \u0026\u0026 text[i + 1] == \u0027\\\u0027\u0027)\n { field.Append(\u0027\\\u0027\u0027); i += 2; }\n else if (c == \u0027\\\u0027\u0027) { inQ = false; i++; }\n else { field.Append(c); i++; }\n }\n else\n {\n if (c == \u0027\\\u0027\u0027) { inQ = true; wasQ = true; i++; }\n else if (c == \u0027|\u0027)\n {\n","golden_completion":" row.Add(wasQ ? field.ToString() : field.ToString().Trim());\n field.Clear(); wasQ = false; i++;\n }\n else if (c == \u0027\\n\u0027)\n {\n row.Add(wasQ ? field.ToString() : field.ToString().Trim());\n field.Clear(); wasQ = false;\n rows.Add(row); row = new List\u003cstring\u003e(); i++;\n }\n else { field.Append(c); i++; }\n","suffix":" }\n }\n if (field.Length \u003e 0 || row.Count \u003e 0)\n {\n row.Add(wasQ ? field.ToString() : field.ToString().Trim());\n rows.Add(row);\n }\n return rows;\n }\n\n static void Main(string[] args)\n {\n var r1 = ParseCsv(\"\u0027a\u0027| b |\u0027c\u0027\u0027d\u0027\");\n if (r1[0][0] != \"a\") throw new Exception(\"quoted a\");\n if (r1[0][1] != \"b\") throw new Exception(\"trimmed b\");\n if (r1[0][2] != \"c\u0027d\") throw new Exception(\"escaped quote\");\n\n var r2 = ParseCsv(\"\u0027line1\\nline2\u0027|x\");\n if (r2.Count != 1) throw new Exception(\"newline in quote\");\n if (r2[0][0] != \"line1\\nline2\") throw new Exception(\"newline preserved\");\n }\n}\n","assertions":"var ha = ParseCsv(\"\");\nif (ha.Count != 0) throw new Exception(\"empty input\");\nvar hb = ParseCsv(\"x|y|z\");\nif (hb[0][0] != \"x\" || hb[0][1] != \"y\" || hb[0][2] != \"z\") throw new Exception(\"simple pipe\");\nvar hc = ParseCsv(\" hello | world \");\nif (hc[0][0] != \"hello\" || hc[0][1] != \"world\") throw new Exception(\"unquoted trim\");\nvar hd = ParseCsv(\"\u0027 hello \u0027|x\");\nif (hd[0][0] != \" hello \") throw new Exception(\"quoted no trim\");\nvar he = ParseCsv(\"a|b\\nc|d\");\nif (he.Count != 2) throw new Exception(\"two rows\");\nif (he[1][0] != \"c\" || he[1][1] != \"d\") throw new Exception(\"second row\");\nvar hf = ParseCsv(\"\u0027\u0027\u0027\u0027|x\");\nif (hf[0][0] != \"\u0027\") throw new Exception(\"double escape\");\nvar hg = ParseCsv(\"\u0027a|b\u0027|c\");\nif (hg[0][0] != \"a|b\") throw new Exception(\"pipe in quotes\");\nif (hg[0][1] != \"c\") throw new Exception(\"after quoted field\");","category":"pattern_matching"} {"id":"25","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Parse folded headers: \"Name: value\" starts a header.\n // Line starting with space/tab continues previous header (joined with one space).\n // Header names lowercased. Duplicates keep all values in order.\n static Dictionary\u003cstring, List\u003cstring\u003e\u003e ParseHeaders(string text)\n {\n var result = new Dictionary\u003cstring, List\u003cstring\u003e\u003e();\n string curKey = null;\n foreach (string raw in text.Split(\u0027\\n\u0027))\n {\n if (string.IsNullOrEmpty(raw)) continue;\n","golden_completion":" if ((raw[0] == \u0027 \u0027 || raw[0] == \u0027\\t\u0027) \u0026\u0026 curKey != null)\n { var v = result[curKey]; v[v.Count - 1] += \" \" + raw.TrimStart(); }\n else\n {\n int c = raw.IndexOf(\u0027:\u0027);\n if (c \u003c 0) continue;\n curKey = raw.Substring(0, c).Trim().ToLower();\n string val = raw.Substring(c + 1).Trim();\n if (!result.ContainsKey(curKey)) result[curKey] = new List\u003cstring\u003e();\n result[curKey].Add(val);\n }\n","suffix":" }\n return result;\n }\n\n static void Main(string[] args)\n {\n string h = \"X-Note: one\\n two\\nX-Note: three\\nHost: Example.COM\";\n var m = ParseHeaders(h);\n if (m[\"x-note\"].Count != 2) throw new Exception(\"note count\");\n if (m[\"x-note\"][0] != \"one two\") throw new Exception(\"folded\");\n if (m[\"x-note\"][1] != \"three\") throw new Exception(\"second note\");\n if (m[\"host\"][0] != \"Example.COM\") throw new Exception(\"host\");\n }\n}\n","assertions":"var ha = ParseHeaders(\"\");\nif (ha.Count != 0) throw new Exception(\"empty\");\nvar hb = ParseHeaders(\"A: 1\\n\\t2\\nB: x\");\nif (hb[\"a\"][0] != \"1 2\") throw new Exception(\"tab continuation\");\nif (hb[\"b\"][0] != \"x\") throw new Exception(\"next header\");\nvar hc = ParseHeaders(\"Set-Cookie: a=1\\nSet-Cookie: b=2\");\nif (hc[\"set-cookie\"].Count != 2) throw new Exception(\"dup count\");\nif (hc[\"set-cookie\"][0] != \"a=1\") throw new Exception(\"first cookie\");\nif (hc[\"set-cookie\"][1] != \"b=2\") throw new Exception(\"second cookie\");\nvar hd = ParseHeaders(\"Long: start\\n continue\\n more\");\nif (hd[\"long\"][0] != \"start continue more\") throw new Exception(\"multi fold\");","category":"pattern_matching"} {"id":"26","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program\n{\n // Template engine: {{key}} = substitute, {{key|upper}} = uppercase,\n // {{key|lower}} = lowercase, {{key|default:X}} = use X if key missing.\n // Missing key without default =\u003e literal \"{{key}}\" preserved.\n // Chained: {{key|upper|default:X}} = if present uppercase, if absent use X.\n static string Render(string tpl, Dictionary\u003cstring, string\u003e ctx)\n {\n var sb = new StringBuilder();\n int i = 0;\n while (i \u003c tpl.Length)\n {\n if (i + 1 \u003c tpl.Length \u0026\u0026 tpl[i] == \u0027{\u0027 \u0026\u0026 tpl[i + 1] == \u0027{\u0027)\n {\n int end = tpl.IndexOf(\"}}\", i + 2);\n if (end \u003c 0) { sb.Append(tpl[i]); i++; continue; }\n string expr = tpl.Substring(i + 2, end - i - 2).Trim();\n string[] parts = expr.Split(\u0027|\u0027);\n string key = parts[0].Trim();\n bool has = ctx.ContainsKey(key);\n","golden_completion":" string val = has ? ctx[key] : null;\n string def = null;\n for (int f = 1; f \u003c parts.Length; f++)\n {\n string fl = parts[f].Trim();\n if (fl == \"upper\" \u0026\u0026 val != null) val = val.ToUpper();\n else if (fl == \"lower\" \u0026\u0026 val != null) val = val.ToLower();\n else if (fl.StartsWith(\"default:\")) def = fl.Substring(8);\n }\n if (val != null) sb.Append(val);\n else if (def != null) sb.Append(def);\n else sb.Append(\"{{\" + key + \"}}\");\n","suffix":" i = end + 2;\n }\n else { sb.Append(tpl[i]); i++; }\n }\n return sb.ToString();\n }\n\n static void Main(string[] args)\n {\n var ctx = new Dictionary\u003cstring, string\u003e { {\"name\",\"Alice\"}, {\"role\",\"admin\"} };\n if (Render(\"Hello {{name}}!\", ctx) != \"Hello Alice!\") throw new Exception(\"simple\");\n if (Render(\"{{name|upper}}\", ctx) != \"ALICE\") throw new Exception(\"upper\");\n if (Render(\"{{missing|default:N/A}}\", ctx) != \"N/A\") throw new Exception(\"default\");\n if (Render(\"{{missing}}\", ctx) != \"{{missing}}\") throw new Exception(\"preserve\");\n }\n}\n","assertions":"var ctx2 = new Dictionary\u003cstring, string\u003e { {\"name\",\"Alice\"}, {\"role\",\"admin\"} };\nif (Render(\"\", ctx2) != \"\") throw new Exception(\"empty tpl\");\nif (Render(\"no vars\", ctx2) != \"no vars\") throw new Exception(\"no vars\");\nif (Render(\"{{name|lower}}\", ctx2) != \"alice\") throw new Exception(\"lower\");\nif (Render(\"{{role|upper}}\", ctx2) != \"ADMIN\") throw new Exception(\"role upper\");\nif (Render(\"{{x|upper|default:fallback}}\", ctx2) != \"fallback\") throw new Exception(\"chain default\");\nif (Render(\"{{name|upper|default:X}}\", ctx2) != \"ALICE\") throw new Exception(\"chain present\");\nif (Render(\"a{{name}}b{{role}}c\", ctx2) != \"aAlicebadminc\") throw new Exception(\"multi\");\nvar emp = new Dictionary\u003cstring, string\u003e();\nif (Render(\"{{a}}{{b|default:ok}}\", emp) != \"{{a}}ok\") throw new Exception(\"mixed missing\");","category":"pattern_matching"} {"id":"27","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program\n{\n // Split on commas, but NOT inside matched brackets: () [] {}.\n // Brackets can be nested. Each result segment is trimmed.\n static List\u003cstring\u003e SplitTopLevel(string text)\n {\n var parts = new List\u003cstring\u003e();\n var cur = new StringBuilder();\n int depth = 0;\n foreach (char c in text)\n {\n","golden_completion":" if (c == \u0027(\u0027 || c == \u0027[\u0027 || c == \u0027{\u0027) depth++;\n else if (c == \u0027)\u0027 || c == \u0027]\u0027 || c == \u0027}\u0027) depth--;\n if (c == \u0027,\u0027 \u0026\u0026 depth == 0)\n { parts.Add(cur.ToString().Trim()); cur.Clear(); }\n else cur.Append(c);\n","suffix":" }\n parts.Add(cur.ToString().Trim());\n return parts;\n }\n\n static void Main(string[] args)\n {\n var r1 = SplitTopLevel(\"a, (b, c), d\");\n if (r1.Count != 3) throw new Exception(\"count\");\n if (r1[0] != \"a\") throw new Exception(\"first\");\n if (r1[1] != \"(b, c)\") throw new Exception(\"bracket group\");\n if (r1[2] != \"d\") throw new Exception(\"third\");\n }\n}\n","assertions":"var ha = SplitTopLevel(\"\");\nif (ha.Count != 1 || ha[0] != \"\") throw new Exception(\"empty\");\nvar hb = SplitTopLevel(\"x\");\nif (hb.Count != 1 || hb[0] != \"x\") throw new Exception(\"single\");\nvar hc = SplitTopLevel(\"a, b, c\");\nif (hc.Count != 3) throw new Exception(\"simple split\");\nvar hd = SplitTopLevel(\"f(a, b), g(c, (d, e)), h\");\nif (hd.Count != 3) throw new Exception(\"nested count\");\nif (hd[0] != \"f(a, b)\") throw new Exception(\"nested first\");\nif (hd[1] != \"g(c, (d, e))\") throw new Exception(\"deep nested\");\nif (hd[2] != \"h\") throw new Exception(\"after nested\");\nvar he = SplitTopLevel(\"{a, b}, [c, d]\");\nif (he.Count != 2) throw new Exception(\"brace bracket count\");\nif (he[0] != \"{a, b}\") throw new Exception(\"braces\");\nif (he[1] != \"[c, d]\") throw new Exception(\"brackets\");","category":"pattern_matching"} {"id":"28","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static string StripRC(string s)\n {\n bool q = false;\n for (int i = 0; i \u003c s.Length; i++)\n {\n if (s[i] == \u0027\"\u0027) q = !q;\n if (s[i] == \u0027#\u0027 \u0026\u0026 !q) return s.Substring(0, i);\n }\n return s;\n }\n\n // Parse route table: \"METHOD path -\u003e handler\"\n // Backslash at end continues on next line (leading ws trimmed).\n // # outside quotes = comment. Handler quotes stripped.\n // Invalid lines (no -\u003e) skipped. Key is \"METHOD path\".\n static Dictionary\u003cstring, string\u003e ParseRoutes(string text)\n {\n var routes = new Dictionary\u003cstring, string\u003e();\n string pending = \"\";\n foreach (string raw in text.Split(\u0027\\n\u0027))\n {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\"))\n { pending += line.Substring(0, line.Length - 1); continue; }\n pending += line;\n string logical = StripRC(pending).Trim();\n pending = \"\";\n if (string.IsNullOrEmpty(logical)) continue;\n","golden_completion":" int arrow = logical.IndexOf(\"-\u003e\");\n if (arrow \u003c 0) continue;\n string key = logical.Substring(0, arrow).Trim();\n string handler = logical.Substring(arrow + 2).Trim();\n if (handler.Length \u003e= 2 \u0026\u0026 handler[0] == \u0027\"\u0027 \u0026\u0026 handler[handler.Length - 1] == \u0027\"\u0027)\n handler = handler.Substring(1, handler.Length - 2);\n routes[key] = handler;\n","suffix":" }\n return routes;\n }\n\n static void Main(string[] args)\n {\n string table = \"GET /users -\u003e \\\\\\n\" +\n \" userIndex # visible route\\n\" +\n \"POST /msg -\u003e \\\"save#draft\\\" # comment\";\n var r = ParseRoutes(table);\n if (r[\"GET /users\"] != \"userIndex\") throw new Exception(\"continuation\");\n if (r[\"POST /msg\"] != \"save#draft\") throw new Exception(\"quoted handler\");\n }\n}\n","assertions":"var ha = ParseRoutes(\"\");\nif (ha.Count != 0) throw new Exception(\"empty\");\nvar hb = ParseRoutes(\"GET / -\u003e root\\n# skip\\nBAD LINE\");\nif (hb[\"GET /\"] != \"root\") throw new Exception(\"basic route\");\nif (hb.Count != 1) throw new Exception(\"skip bad lines\");\nvar hc = ParseRoutes(\"PUT /a -\u003e one \\\\\\n two \\\\\\n three\");\nif (hc[\"PUT /a\"] != \"one two three\") throw new Exception(\"multi continuation\");\nvar hd = ParseRoutes(\"DELETE /x -\u003e \\\"has spaces\\\"\");\nif (hd[\"DELETE /x\"] != \"has spaces\") throw new Exception(\"quoted strip\");\nvar he = ParseRoutes(\"GET /q -\u003e handler # comment\\nPOST /q -\u003e other\");\nif (he[\"GET /q\"] != \"handler\") throw new Exception(\"comment strip\");\nif (he[\"POST /q\"] != \"other\") throw new Exception(\"second route\");","category":"pattern_matching"} {"id":"29","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program\n{\n // Tokenizer: IDENT, NUM, STRING, OP. Skip // and /* */ comments.\n // Strings: \"...\" with \\\\ and \\\" escapes.\n // Operators: +-*/=(){};,\n static List\u003cstring\u003e Tokenize(string code)\n {\n var tokens = new List\u003cstring\u003e();\n int i = 0;\n while (i \u003c code.Length)\n {\n if (char.IsWhiteSpace(code[i])) { i++; continue; }\n if (i + 1 \u003c code.Length \u0026\u0026 code[i] == \u0027/\u0027 \u0026\u0026 code[i + 1] == \u0027/\u0027)\n { while (i \u003c code.Length \u0026\u0026 code[i] != \u0027\\n\u0027) i++; continue; }\n if (i + 1 \u003c code.Length \u0026\u0026 code[i] == \u0027/\u0027 \u0026\u0026 code[i + 1] == \u0027*\u0027)\n { i += 2; while (i + 1 \u003c code.Length \u0026\u0026 !(code[i] == \u0027*\u0027 \u0026\u0026 code[i + 1] == \u0027/\u0027)) i++; i += 2; continue; }\n if (code[i] == \u0027\"\u0027)\n {\n var sb = new StringBuilder(); i++;\n while (i \u003c code.Length \u0026\u0026 code[i] != \u0027\"\u0027)\n { if (code[i] == \u0027\\\\\u0027 \u0026\u0026 i + 1 \u003c code.Length) { sb.Append(code[i + 1]); i += 2; } else { sb.Append(code[i]); i++; } }\n i++; tokens.Add(\"STRING:\" + sb); continue;\n }\n","golden_completion":" if (char.IsDigit(code[i]))\n { int s = i; while (i \u003c code.Length \u0026\u0026 char.IsDigit(code[i])) i++; tokens.Add(\"NUM:\" + code.Substring(s, i - s)); continue; }\n if (char.IsLetter(code[i]) || code[i] == \u0027_\u0027)\n { int s = i; while (i \u003c code.Length \u0026\u0026 (char.IsLetterOrDigit(code[i]) || code[i] == \u0027_\u0027)) i++; tokens.Add(\"IDENT:\" + code.Substring(s, i - s)); continue; }\n if (\"+-*/=(){};,\".IndexOf(code[i]) \u003e= 0) { tokens.Add(\"OP:\" + code[i]); i++; continue; }\n i++;\n","suffix":" }\n return tokens;\n }\n\n static void Main(string[] args)\n {\n var t1 = Tokenize(\"x = 42;\");\n if (t1[0] != \"IDENT:x\") throw new Exception(\"ident\");\n if (t1[1] != \"OP:=\") throw new Exception(\"op\");\n if (t1[2] != \"NUM:42\") throw new Exception(\"num\");\n if (t1[3] != \"OP:;\") throw new Exception(\"semi\");\n\n var t2 = Tokenize(\"a /* skip */ + b // end\");\n if (t2.Count != 3) throw new Exception(\"comment skip: \" + t2.Count);\n if (t2[0] != \"IDENT:a\") throw new Exception(\"a\");\n if (t2[1] != \"OP:+\") throw new Exception(\"plus\");\n if (t2[2] != \"IDENT:b\") throw new Exception(\"b\");\n }\n}\n","assertions":"var ha = Tokenize(\"\");\nif (ha.Count != 0) throw new Exception(\"empty\");\nvar hb = Tokenize(\" \\n\\t \");\nif (hb.Count != 0) throw new Exception(\"whitespace only\");\nvar hc = Tokenize(\"\\\"hello\\\"\");\nif (hc.Count != 1 || hc[0] != \"STRING:hello\") throw new Exception(\"string\");\nvar hd = Tokenize(\"\\\"a\\\\\\\\b\\\"\");\nif (hd[0] != \"STRING:a\\\\b\") throw new Exception(\"escaped backslash\");\nvar he = Tokenize(\"\\\"a\\\\\\\"b\\\"\");\nif (he[0] != \"STRING:a\\\"b\") throw new Exception(\"escaped quote\");\nvar hf = Tokenize(\"foo_bar(123, 456)\");\nif (hf.Count != 6) throw new Exception(\"complex count\");\nif (hf[0] != \"IDENT:foo_bar\") throw new Exception(\"underscore ident\");\nvar hg = Tokenize(\"/* c1 */ x /* c2 */\");\nif (hg.Count != 1 || hg[0] != \"IDENT:x\") throw new Exception(\"multi block\");","category":"pattern_matching"} {"id":"30","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static string StripTC(string s)\n {\n bool q = false;\n for (int i = 0; i \u003c s.Length; i++)\n {\n if (s[i] == \u0027\"\u0027) q = !q;\n if (!q \u0026\u0026 s[i] == \u0027#\u0027) return s.Substring(0, i);\n }\n return s;\n }\n\n // Typed config: [section] prefixes keys. Backslash continues.\n // # outside quotes = comment. Values typed:\n // digits only =\u003e int, \"true\"/\"false\" =\u003e bool, quoted =\u003e string (strip quotes),\n // anything else =\u003e string.\n static Dictionary\u003cstring, object\u003e ParseTypedConfig(string text)\n {\n var result = new Dictionary\u003cstring, object\u003e();\n string section = \"\", pending = \"\";\n foreach (string raw in text.Split(\u0027\\n\u0027))\n {\n string line = pending.Length \u003e 0 ? raw.TrimStart() : raw;\n if (line.EndsWith(\"\\\\\"))\n { pending += line.Substring(0, line.Length - 1); continue; }\n pending += line;\n string logical = StripTC(pending).Trim();\n pending = \"\";\n if (string.IsNullOrEmpty(logical)) continue;\n if (logical.StartsWith(\"[\") \u0026\u0026 logical.EndsWith(\"]\"))\n { section = logical.Substring(1, logical.Length - 2).Trim(); continue; }\n int sep = logical.IndexOf(\u0027=\u0027);\n if (sep \u003c 0) continue;\n string key = logical.Substring(0, sep).Trim();\n string valStr = logical.Substring(sep + 1).Trim();\n string fk = section.Length \u003e 0 ? section + \".\" + key : key;\n","golden_completion":" if (valStr.Length \u003e= 2 \u0026\u0026 valStr[0] == \u0027\"\u0027 \u0026\u0026 valStr[valStr.Length - 1] == \u0027\"\u0027)\n result[fk] = valStr.Substring(1, valStr.Length - 2);\n else if (valStr == \"true\" || valStr == \"false\")\n result[fk] = valStr == \"true\";\n else if (int.TryParse(valStr, out int iv))\n result[fk] = iv;\n else\n result[fk] = valStr;\n","suffix":" }\n return result;\n }\n\n static void Main(string[] args)\n {\n string cfg = \"count = 42\\nenabled = true\\n[db]\\nhost = \\\"localhost\\\"\\nport = 5432\\nssl = false\";\n var m = ParseTypedConfig(cfg);\n if ((int)m[\"count\"] != 42) throw new Exception(\"int type\");\n if ((bool)m[\"enabled\"] != true) throw new Exception(\"bool type\");\n if ((string)m[\"db.host\"] != \"localhost\") throw new Exception(\"string type\");\n if ((int)m[\"db.port\"] != 5432) throw new Exception(\"section int\");\n if ((bool)m[\"db.ssl\"] != false) throw new Exception(\"section bool\");\n }\n}\n","assertions":"var ha = ParseTypedConfig(\"\");\nif (ha.Count != 0) throw new Exception(\"empty\");\nvar hb = ParseTypedConfig(\"x = 0\\ny = true\\nz = false\\nw = \\\"hello\\\"\");\nif ((int)hb[\"x\"] != 0) throw new Exception(\"zero int\");\nif ((bool)hb[\"y\"] != true) throw new Exception(\"true\");\nif ((bool)hb[\"z\"] != false) throw new Exception(\"false\");\nif ((string)hb[\"w\"] != \"hello\") throw new Exception(\"quoted string\");\nvar hc = ParseTypedConfig(\"[s]\\nk = long \\\\\\n value\");\nif ((string)hc[\"s.k\"] != \"long value\") throw new Exception(\"section continuation\");\nvar hd = ParseTypedConfig(\"n = not_a_number\");\nif (!(hd[\"n\"] is string)) throw new Exception(\"unquoted non-numeric should be string\");\nif ((string)hd[\"n\"] != \"not_a_number\") throw new Exception(\"unquoted string value\");\nvar he = ParseTypedConfig(\"v = 999 # comment\");\nif ((int)he[\"v\"] != 999) throw new Exception(\"comment after int\");","category":"pattern_matching"} {"id":"31","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass Program\n{\n static readonly string STANDARD_B32 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\n static readonly string REVERSED_B32 = new string(\n System.Linq.Enumerable.ToArray(System.Linq.Enumerable.Reverse(STANDARD_B32)));\n\n // Base32 encoder with configurable alphabet and padding.\n // Default alphabet is REVERSED_B32, default pad is \u0027#\u0027.\n static string Base32Encode(byte[] data, string alphabet = null, char pad = \u0027#\u0027)\n {\n if (alphabet == null) alphabet = REVERSED_B32;\n","golden_completion":" StringBuilder sb = new StringBuilder();\n int buffer = 0, bitsLeft = 0;\n foreach (byte b in data)\n {\n buffer = (buffer \u003c\u003c 8) | b;\n bitsLeft += 8;\n while (bitsLeft \u003e= 5)\n {\n bitsLeft -= 5;\n sb.Append(alphabet[(buffer \u003e\u003e bitsLeft) \u0026 0x1F]);\n }\n }\n if (bitsLeft \u003e 0)\n sb.Append(alphabet[(buffer \u003c\u003c (5 - bitsLeft)) \u0026 0x1F]);\n while (sb.Length % 8 != 0) sb.Append(pad);\n return sb.ToString();\n","suffix":" }\n\n static void Main()\n {\n // Reversed alphabet: STANDARD_B32[0]=\u0027A\u0027 maps to REVERSED_B32[0]=\u00277\u0027\n // Standard base32(\"f\") = \"MY======\"; reversed must differ\n string r1 = Base32Encode(new byte[]{0x66});\n if (r1 == \"MY======\") throw new Exception(\"Must not be standard base32\");\n\n // With standard alphabet and \u0027=\u0027 pad, should match standard\n string s1 = Base32Encode(new byte[]{0x66}, STANDARD_B32, \u0027=\u0027);\n if (s1 != \"MY======\") throw new Exception($\"Expected MY====== got {s1}\");\n\n string r2 = Base32Encode(new byte[]{0x66, 0x6F});\n string s2 = Base32Encode(new byte[]{0x66, 0x6F}, STANDARD_B32, \u0027=\u0027);\n if (s2 != \"MZXQ====\") throw new Exception($\"Expected MZXQ==== got {s2}\");\n if (r2 == s2) throw new Exception(\"Reversed must differ from standard\");\n\n Console.WriteLine(\"All visible checks passed.\");\n }\n}\n","assertions":" string e1 = Base32Encode(new byte[0]);\n if (e1 != \"\") throw new Exception($\"Empty input should give empty, got {e1}\");\n string abc_std = Base32Encode(new byte[]{0x61,0x62,0x63}, STANDARD_B32, \u0027=\u0027);\n if (abc_std != \"MFRGG===\") throw new Exception($\"Expected MFRGG=== got {abc_std}\");\n string abc_rev = Base32Encode(new byte[]{0x61,0x62,0x63});\n if (abc_rev == \"MFRGG===\") throw new Exception(\"Reversed must differ from standard for abc\");\n string hello_std = Base32Encode(new byte[]{0x68,0x65,0x6C,0x6C,0x6F}, STANDARD_B32, \u0027=\u0027);\n if (hello_std != \"NBSWY3DP\") throw new Exception($\"Expected NBSWY3DP got {hello_std}\");\n","category":"pattern_matching"} {"id":"32","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Parses INI-style config. Rules:\n // - Lines starting with # or ; are comments (but only if # or ; is the FIRST non-space char)\n // - [section] starts a new section\n // - key = value pairs; value is trimmed\n // - A line ending with \\ continues on the next line (strip the \\, join, trim result)\n // - Duplicate keys within a section: values are joined with comma\n // - Returns Dict\u003cstring, Dict\u003cstring, string\u003e\u003e\n static Dictionary\u003cstring, Dictionary\u003cstring, string\u003e\u003e ParseIni(string text)\n {\n","golden_completion":" var result = new Dictionary\u003cstring, Dictionary\u003cstring, string\u003e\u003e();\n string section = \"\";\n result[section] = new Dictionary\u003cstring, string\u003e();\n string[] lines = text.Split(\u0027\\n\u0027);\n int i = 0;\n while (i \u003c lines.Length)\n {\n string line = lines[i].TrimEnd();\n // handle continuation\n while (line.EndsWith(\"\\\\\") \u0026\u0026 i + 1 \u003c lines.Length)\n {\n line = line.Substring(0, line.Length - 1);\n i++;\n line += lines[i].TrimEnd();\n }\n string trimmed = line.TrimStart();\n if (trimmed.Length == 0 || trimmed[0] == \u0027#\u0027 || trimmed[0] == \u0027;\u0027)\n { i++; continue; }\n if (trimmed.StartsWith(\"[\") \u0026\u0026 trimmed.Contains(\"]\"))\n {\n section = trimmed.Substring(1, trimmed.IndexOf(\u0027]\u0027) - 1).Trim();\n if (!result.ContainsKey(section))\n result[section] = new Dictionary\u003cstring, string\u003e();\n i++; continue;\n }\n int eq = trimmed.IndexOf(\u0027=\u0027);\n if (eq \u003e 0)\n {\n string key = trimmed.Substring(0, eq).Trim();\n string val = trimmed.Substring(eq + 1).Trim();\n if (!result.ContainsKey(section))\n result[section] = new Dictionary\u003cstring, string\u003e();\n if (result[section].ContainsKey(key))\n result[section][key] += \",\" + val;\n else\n result[section][key] = val;\n }\n i++;\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string config = \"[server]\\nhost = localhost\\nport = 8080\\n# comment\\n[db]\\nconn = host=db;\\\\\\n port=5432\\nconn = user=admin\";\n var r = ParseIni(config);\n\n if (r[\"server\"][\"host\"] != \"localhost\") throw new Exception(\"host wrong\");\n if (r[\"server\"][\"port\"] != \"8080\") throw new Exception(\"port wrong\");\n // continuation: \"host=db; port=5432\"\n // then duplicate: joined with comma\n if (!r[\"db\"][\"conn\"].Contains(\"host=db;\")) throw new Exception(\"continuation missed\");\n if (!r[\"db\"][\"conn\"].Contains(\",\")) throw new Exception(\"duplicate key join missed\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" string cfg2 = \"key1 = hello\\n; a comment\\nkey1 = world\";\n var r2 = ParseIni(cfg2);\n if (r2[\"\"][\"key1\"] != \"hello,world\") throw new Exception($\"Global dup expected hello,world got {r2[\"\"][\"key1\"]}\");\n\n string cfg3 = \"[s1]\\nval = a\\\\\\n b\\\\\\n c\";\n var r3 = ParseIni(cfg3);\n if (r3[\"s1\"][\"val\"] != \"a b c\") throw new Exception($\"Multi cont expected \u0027a b c\u0027 got {r3[\"s1\"][\"val\"]}\");\n\n string cfg4 = \" # indented comment\\nfoo = bar\";\n var r4 = ParseIni(cfg4);\n if (r4.ContainsKey(\"\") \u0026\u0026 r4[\"\"].ContainsKey(\"#\")) throw new Exception(\"Indented comment parsed as key\");\n if (r4[\"\"][\"foo\"] != \"bar\") throw new Exception(\"foo missing after comment\");\n","category":"pattern_matching"} {"id":"33","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Parse .env-style file with profiles.\n // Rules:\n // - [profile_name] starts a new profile; default profile is \"\"\n // - Lines can optionally start with \"export \" which is stripped\n // - KEY=VALUE or KEY=\"quoted value\" (strip quotes)\n // - # starts a line comment (only if first non-space char)\n // - Backslash at end of line: continuation (strip \\, prepend next line trimmed)\n // - Within quoted values, # is NOT a comment delimiter\n // Returns Dict\u003cstring, Dict\u003cstring, string\u003e\u003e\n static Dictionary\u003cstring, Dictionary\u003cstring, string\u003e\u003e ParseEnv(string text)\n {\n","golden_completion":" var result = new Dictionary\u003cstring, Dictionary\u003cstring, string\u003e\u003e();\n string profile = \"\";\n result[profile] = new Dictionary\u003cstring, string\u003e();\n string[] lines = text.Split(\u0027\\n\u0027);\n int i = 0;\n while (i \u003c lines.Length)\n {\n string line = lines[i].TrimEnd();\n while (line.EndsWith(\"\\\\\") \u0026\u0026 i + 1 \u003c lines.Length)\n {\n line = line.Substring(0, line.Length - 1);\n i++;\n line += lines[i].TrimStart();\n }\n string trimmed = line.TrimStart();\n if (trimmed.Length == 0 || trimmed[0] == \u0027#\u0027) { i++; continue; }\n if (trimmed.StartsWith(\"[\") \u0026\u0026 trimmed.Contains(\"]\"))\n {\n profile = trimmed.Substring(1, trimmed.IndexOf(\u0027]\u0027) - 1).Trim();\n if (!result.ContainsKey(profile)) result[profile] = new Dictionary\u003cstring, string\u003e();\n i++; continue;\n }\n if (trimmed.StartsWith(\"export \")) trimmed = trimmed.Substring(7).TrimStart();\n int eq = trimmed.IndexOf(\u0027=\u0027);\n if (eq \u003e 0)\n {\n string key = trimmed.Substring(0, eq).Trim();\n string val = trimmed.Substring(eq + 1).Trim();\n if (val.Length \u003e= 2 \u0026\u0026 val[0] == \u0027\"\u0027 \u0026\u0026 val[val.Length - 1] == \u0027\"\u0027)\n val = val.Substring(1, val.Length - 2);\n if (!result.ContainsKey(profile)) result[profile] = new Dictionary\u003cstring, string\u003e();\n result[profile][key] = val;\n }\n i++;\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string env = \"# global\\nexport DB_HOST=localhost\\nDB_PORT=5432\\n[production]\\nDB_HOST=\\\"prod.db.com\\\"\\nSECRET=abc\\\\\\ndef\";\n var r = ParseEnv(env);\n if (r[\"\"][\"DB_HOST\"] != \"localhost\") throw new Exception(\"global DB_HOST wrong\");\n if (r[\"\"][\"DB_PORT\"] != \"5432\") throw new Exception(\"global DB_PORT wrong\");\n if (r[\"production\"][\"DB_HOST\"] != \"prod.db.com\") throw new Exception(\"prod DB_HOST wrong (unquoted?)\");\n if (r[\"production\"][\"SECRET\"] != \"abcdef\") throw new Exception($\"continuation failed, got {r[\"production\"][\"SECRET\"]}\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" string env2 = \"export KEY1=\\\"value with # hash\\\"\\nKEY2=plain\";\n var r2 = ParseEnv(env2);\n if (r2[\"\"][\"KEY1\"] != \"value with # hash\") throw new Exception($\"Hash in quotes: got {r2[\"\"][\"KEY1\"]}\");\n if (r2[\"\"][\"KEY2\"] != \"plain\") throw new Exception(\"KEY2 wrong\");\n\n string env3 = \"[dev]\\nA=1\\n[prod]\\nA=2\\n[dev]\\nB=3\";\n var r3 = ParseEnv(env3);\n if (r3[\"dev\"][\"A\"] != \"1\") throw new Exception(\"dev A wrong\");\n if (r3[\"dev\"][\"B\"] != \"3\") throw new Exception(\"dev B wrong after re-entering section\");\n if (r3[\"prod\"][\"A\"] != \"2\") throw new Exception(\"prod A wrong\");\n","category":"pattern_matching"} {"id":"34","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n // Edit distance with custom costs:\n // - Insert cost: 1\n // - Delete cost: 1\n // - Substitution cost: 2 (NOT the standard 1!)\n // - Transposition of adjacent chars cost: 0.5\n // Returns minimum cost as double.\n static double EditDistance(string a, string b)\n {\n","golden_completion":" int m = a.Length, n = b.Length;\n double[,] dp = new double[m + 1, n + 1];\n for (int i = 0; i \u003c= m; i++) dp[i, 0] = i;\n for (int j = 0; j \u003c= n; j++) dp[0, j] = j;\n for (int i = 1; i \u003c= m; i++)\n for (int j = 1; j \u003c= n; j++)\n {\n double cost = a[i - 1] == b[j - 1] ? 0 : 2;\n dp[i, j] = Math.Min(Math.Min(dp[i - 1, j] + 1, dp[i, j - 1] + 1), dp[i - 1, j - 1] + cost);\n if (i \u003e 1 \u0026\u0026 j \u003e 1 \u0026\u0026 a[i - 1] == b[j - 2] \u0026\u0026 a[i - 2] == b[j - 1])\n dp[i, j] = Math.Min(dp[i, j], dp[i - 2, j - 2] + 0.5);\n }\n return dp[m, n];\n","suffix":" }\n\n static void Main()\n {\n // \"ab\" -\u003e \"ba\": transposition costs 0.5, NOT standard 2\n double r1 = EditDistance(\"ab\", \"ba\");\n if (Math.Abs(r1 - 0.5) \u003e 1e-9) throw new Exception($\"ab-\u003eba expected 0.5 got {r1}\");\n\n // \"abc\" -\u003e \"abc\": identical = 0\n if (Math.Abs(EditDistance(\"abc\", \"abc\")) \u003e 1e-9) throw new Exception(\"identical should be 0\");\n\n // \"a\" -\u003e \"b\": substitution costs 2\n double r2 = EditDistance(\"a\", \"b\");\n if (Math.Abs(r2 - 2.0) \u003e 1e-9) throw new Exception($\"a-\u003eb expected 2 got {r2}\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // \"cat\" -\u003e \"act\": one transposition (ca-\u003eac) + t stays = 0.5\n // But also check \"kitten\" -\u003e \"sitting\"\n double r3 = EditDistance(\"\", \"abc\");\n if (Math.Abs(r3 - 3.0) \u003e 1e-9) throw new Exception($\"empty-\u003eabc expected 3 got {r3}\");\n\n double r4 = EditDistance(\"abc\", \"\");\n if (Math.Abs(r4 - 3.0) \u003e 1e-9) throw new Exception($\"abc-\u003eempty expected 3 got {r4}\");\n\n double r5 = EditDistance(\"ab\", \"cd\");\n if (Math.Abs(r5 - 4.0) \u003e 1e-9) throw new Exception($\"ab-\u003ecd expected 4 (2 subs) got {r5}\");\n","category":"pattern_matching"} {"id":"35","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Text;\n\nclass Program\n{\n // Simple template engine. Supported syntax:\n // - {{key}} — replaced with vars[key], or \"\" if missing\n // - {%if key%}...{%endif%} — include block only if vars[key] is truthy (non-empty, non-\"false\", non-\"0\")\n // - {%if !key%}...{%endif%} — include block only if vars[key] is falsy\n // - Nested ifs are supported\n // Returns the rendered string.\n static string RenderTemplate(string template, Dictionary\u003cstring, string\u003e vars)\n {\n","golden_completion":" StringBuilder sb = new StringBuilder();\n int i = 0;\n bool IsTruthy(string k)\n {\n if (!vars.ContainsKey(k)) return false;\n string v = vars[k];\n return v != \"\" \u0026\u0026 v != \"false\" \u0026\u0026 v != \"0\";\n }\n void Render(bool emit)\n {\n while (i \u003c template.Length)\n {\n if (i + 1 \u003c template.Length \u0026\u0026 template[i] == \u0027{\u0027 \u0026\u0026 template[i + 1] == \u0027%\u0027)\n {\n int end = template.IndexOf(\"%}\", i + 2);\n string tag = template.Substring(i + 2, end - i - 2).Trim();\n i = end + 2;\n if (tag == \"endif\") return;\n if (tag.StartsWith(\"if \"))\n {\n string cond = tag.Substring(3).Trim();\n bool negate = cond.StartsWith(\"!\");\n string key = negate ? cond.Substring(1) : cond;\n bool pass = negate ? !IsTruthy(key) : IsTruthy(key);\n Render(emit \u0026\u0026 pass);\n continue;\n }\n }\n else if (i + 1 \u003c template.Length \u0026\u0026 template[i] == \u0027{\u0027 \u0026\u0026 template[i + 1] == \u0027{\u0027)\n {\n int end = template.IndexOf(\"}}\", i + 2);\n string key = template.Substring(i + 2, end - i - 2).Trim();\n if (emit) sb.Append(vars.ContainsKey(key) ? vars[key] : \"\");\n i = end + 2;\n continue;\n }\n if (emit) sb.Append(template[i]);\n i++;\n }\n }\n Render(true);\n return sb.ToString();\n","suffix":" }\n\n static void Main()\n {\n var vars = new Dictionary\u003cstring, string\u003e { {\"name\", \"Alice\"}, {\"show\", \"true\"}, {\"hide\", \"false\"} };\n string t1 = \"Hello {{name}}!\";\n if (RenderTemplate(t1, vars) != \"Hello Alice!\") throw new Exception(\"Simple var failed\");\n\n string t2 = \"{%if show%}Visible{%endif%}{%if hide%}Hidden{%endif%}\";\n if (RenderTemplate(t2, vars) != \"Visible\") throw new Exception(\"If/endif failed\");\n\n string t3 = \"{%if !hide%}Shown{%endif%}\";\n if (RenderTemplate(t3, vars) != \"Shown\") throw new Exception(\"Negated if failed\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" var v2 = new Dictionary\u003cstring, string\u003e { {\"a\", \"1\"}, {\"b\", \"0\"} };\n string t4 = \"{%if a%}A{%if b%}B{%endif%}C{%endif%}\";\n string r4 = RenderTemplate(t4, v2);\n if (r4 != \"AC\") throw new Exception($\"Nested if: expected \u0027AC\u0027 got \u0027{r4}\u0027\");\n\n string t5 = \"{{missing}}x\";\n string r5 = RenderTemplate(t5, new Dictionary\u003cstring, string\u003e());\n if (r5 != \"x\") throw new Exception($\"Missing var: expected \u0027x\u0027 got \u0027{r5}\u0027\");\n\n var v3 = new Dictionary\u003cstring, string\u003e { {\"x\", \"val\"} };\n string t6 = \"{%if !x%}no{%endif%}{%if x%}yes{%endif%}\";\n if (RenderTemplate(t6, v3) != \"yes\") throw new Exception(\"Negation logic wrong\");\n","category":"pattern_matching"} {"id":"36","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass Program\n{\n static readonly string STANDARD_HEX = \"0123456789abcdef\";\n static readonly string REVERSED_HEX = \"fedcba9876543210\";\n\n // Hex encoder with configurable digit alphabet.\n // Default uses REVERSED_HEX where \u00270\u0027 maps to \u0027f\u0027, \u00271\u0027 maps to \u0027e\u0027, etc.\n // separator: string placed between each encoded byte (default \"-\")\n static string HexEncode(byte[] data, string alphabet = null, string separator = \"-\")\n {\n if (alphabet == null) alphabet = REVERSED_HEX;\n","golden_completion":" StringBuilder sb = new StringBuilder();\n for (int i = 0; i \u003c data.Length; i++)\n {\n int hi = (data[i] \u003e\u003e 4) \u0026 0xF;\n int lo = data[i] \u0026 0xF;\n if (i \u003e 0) sb.Append(separator);\n sb.Append(alphabet[hi]);\n sb.Append(alphabet[lo]);\n }\n return sb.ToString();\n","suffix":" }\n\n static void Main()\n {\n // Standard hex for 0xFF is \"ff\"; reversed maps 0xF-\u003e0, so \"00\"\n string r1 = HexEncode(new byte[]{0xFF});\n if (r1 != \"00\") throw new Exception($\"0xFF reversed: expected \u002700\u0027 got \u0027{r1}\u0027\");\n if (r1 == \"ff\") throw new Exception(\"Must not use standard hex\");\n\n // With standard alphabet\n string s1 = HexEncode(new byte[]{0xFF}, STANDARD_HEX, \"-\");\n if (s1 != \"ff\") throw new Exception($\"Standard 0xFF: expected \u0027ff\u0027 got \u0027{s1}\u0027\");\n\n // 0x00 reversed -\u003e \"ff\"\n string r2 = HexEncode(new byte[]{0x00});\n if (r2 != \"ff\") throw new Exception($\"0x00 reversed: expected \u0027ff\u0027 got \u0027{r2}\u0027\");\n\n // Multi-byte with separator\n string r3 = HexEncode(new byte[]{0x41, 0x42});\n if (!r3.Contains(\"-\")) throw new Exception(\"Separator missing\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" string e1 = HexEncode(new byte[0]);\n if (e1 != \"\") throw new Exception($\"Empty expected \u0027\u0027 got \u0027{e1}\u0027\");\n\n // 0x41=\u0027A\u0027 standard hex \"41\"; reversed: 4-\u003eb, 1-\u003ee =\u003e \"be\"\n string r4 = HexEncode(new byte[]{0x41});\n if (r4 != \"be\") throw new Exception($\"0x41 reversed expected \u0027be\u0027 got \u0027{r4}\u0027\");\n string s4 = HexEncode(new byte[]{0x41}, STANDARD_HEX, \"-\");\n if (s4 != \"41\") throw new Exception($\"0x41 standard expected \u002741\u0027 got \u0027{s4}\u0027\");\n\n // Multi-byte no separator\n string r5 = HexEncode(new byte[]{0x41, 0x42}, REVERSED_HEX, \"\");\n if (r5 != \"bebd\") throw new Exception($\"multi no sep expected \u0027bebd\u0027 got \u0027{r5}\u0027\");\n","category":"pattern_matching"} {"id":"37","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Custom CSV parser rules:\n // - Delimiter is \u0027|\u0027 (pipe), NOT comma\n // - Quoting: fields wrapped in single quotes preserve pipes and newlines literally\n // - Escape: inside single quotes, \u0027\u0027 (two single quotes) represents a literal \u0027\n // - Leading/trailing spaces in unquoted fields are TRIMMED\n // - Leading/trailing spaces in quoted fields are PRESERVED\n // Returns list of rows, each row is list of strings\n static List\u003cList\u003cstring\u003e\u003e ParseCsv(string text)\n {\n","golden_completion":" var rows = new List\u003cList\u003cstring\u003e\u003e();\n var current = new List\u003cstring\u003e();\n int i = 0;\n while (i \u003c= text.Length)\n {\n var field = new System.Text.StringBuilder();\n bool quoted = false;\n if (i \u003c text.Length \u0026\u0026 text[i] == \u0027\\\u0027\u0027)\n {\n quoted = true; i++;\n while (i \u003c text.Length)\n {\n if (text[i] == \u0027\\\u0027\u0027 \u0026\u0026 i + 1 \u003c text.Length \u0026\u0026 text[i + 1] == \u0027\\\u0027\u0027)\n { field.Append(\u0027\\\u0027\u0027); i += 2; }\n else if (text[i] == \u0027\\\u0027\u0027) { i++; break; }\n else { field.Append(text[i]); i++; }\n }\n }\n else\n {\n while (i \u003c text.Length \u0026\u0026 text[i] != \u0027|\u0027 \u0026\u0026 text[i] != \u0027\\n\u0027)\n { field.Append(text[i]); i++; }\n }\n string val = quoted ? field.ToString() : field.ToString().Trim();\n current.Add(val);\n if (i \u003e= text.Length || text[i] == \u0027\\n\u0027) { rows.Add(current); current = new List\u003cstring\u003e(); i++; }\n else if (text[i] == \u0027|\u0027) { i++; }\n }\n return rows;\n","suffix":" }\n\n static void Main()\n {\n string data = \"a | b | c\\n\u0027 d \u0027|\u0027e|f\u0027|g\";\n var rows = ParseCsv(data);\n if (rows[0][0] != \"a\") throw new Exception($\"Row0Col0: expected \u0027a\u0027 got \u0027{rows[0][0]}\u0027\");\n if (rows[0][1] != \"b\") throw new Exception($\"Unquoted should be trimmed: got \u0027{rows[0][1]}\u0027\");\n if (rows[1][0] != \" d \") throw new Exception($\"Quoted spaces preserved: got \u0027{rows[1][0]}\u0027\");\n if (rows[1][1] != \"e|f\") throw new Exception($\"Pipe in quotes: got \u0027{rows[1][1]}\u0027\");\n\n // Escaped quote\n string data2 = \"\u0027it\u0027\u0027s\u0027|ok\";\n var rows2 = ParseCsv(data2);\n if (rows2[0][0] != \"it\u0027s\") throw new Exception($\"Escaped quote: got \u0027{rows2[0][0]}\u0027\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Empty input\n var re = ParseCsv(\"\");\n if (re.Count != 1 || re[0].Count != 1 || re[0][0] != \"\") throw new Exception(\"Empty input handling wrong\");\n\n // Multi-row with quoted newline would not apply here since newlines end rows\n // Test all-quoted row\n string d3 = \"\u0027a\u0027|\u0027b\u0027|\u0027c\u0027\";\n var r3 = ParseCsv(d3);\n if (r3[0][0] != \"a\" || r3[0][1] != \"b\" || r3[0][2] != \"c\") throw new Exception(\"All quoted row wrong\");\n\n // Unquoted trimming\n string d4 = \" x | y \";\n var r4 = ParseCsv(d4);\n if (r4[0][0] != \"x\" || r4[0][1] != \"y\") throw new Exception(\"Trimming failed\");\n","category":"pattern_matching"} {"id":"38","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Text;\n\nclass Program\n{\n // Run-length encode a string. Custom format rules:\n // - Single chars are output as-is (NOT \"1a\" or \"a1\")\n // - Runs of 2+ are output as COUNT THEN CHAR (e.g., \"aaa\" -\u003e \"3a\")\n // - Digits in input are escaped by prefixing with \u0027\\\u0027 (e.g., \"3\" -\u003e \"\\3\")\n // - Backslash in input is escaped as \"\\\\\"\n // NOTE: runs of digits are ALSO escaped per-char, e.g., \"222\" -\u003e \"3\\2\"\n static string RunLengthEncode(string input)\n {\n","golden_completion":" if (input.Length == 0) return \"\";\n StringBuilder sb = new StringBuilder();\n int i = 0;\n while (i \u003c input.Length)\n {\n char c = input[i];\n int count = 1;\n while (i + count \u003c input.Length \u0026\u0026 input[i + count] == c) count++;\n string escaped;\n if (c == \u0027\\\\\u0027) escaped = \"\\\\\\\\\";\n else if (c \u003e= \u00270\u0027 \u0026\u0026 c \u003c= \u00279\u0027) escaped = \"\\\\\" + c;\n else escaped = c.ToString();\n if (count \u003e 1) sb.Append(count);\n sb.Append(escaped);\n i += count;\n }\n return sb.ToString();\n","suffix":" }\n\n static void Main()\n {\n if (RunLengthEncode(\"aaa\") != \"3a\") throw new Exception($\"aaa: got {RunLengthEncode(\"aaa\")}\");\n if (RunLengthEncode(\"a\") != \"a\") throw new Exception(\"single char wrong\");\n if (RunLengthEncode(\"aabbb\") != \"2a3b\") throw new Exception($\"aabbb: got {RunLengthEncode(\"aabbb\")}\");\n\n // Digit escaping: \"3\" -\u003e \"\\3\", \"333\" -\u003e \"3\\3\"\n if (RunLengthEncode(\"3\") != \"\\\\3\") throw new Exception($\"digit: got \u0027{RunLengthEncode(\"3\")}\u0027\");\n if (RunLengthEncode(\"333\") != \"3\\\\3\") throw new Exception($\"triple digit: got \u0027{RunLengthEncode(\"333\")}\u0027\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" if (RunLengthEncode(\"\") != \"\") throw new Exception(\"empty wrong\");\n if (RunLengthEncode(\"abcd\") != \"abcd\") throw new Exception(\"no runs wrong\");\n\n // backslash escaping\n string bs = RunLengthEncode(\"\\\\\");\n if (bs != \"\\\\\\\\\") throw new Exception($\"backslash: got \u0027{bs}\u0027\");\n string bs3 = RunLengthEncode(\"\\\\\\\\\\\\\");\n if (bs3 != \"3\\\\\\\\\") throw new Exception($\"triple backslash: got \u0027{bs3}\u0027\");\n\n // mixed: aa-\u003e2a, 11-\u003e2\\1, bb-\u003e2b\n string m = RunLengthEncode(\"aa11bb\");\n if (m != \"2a2\\\\12b\") throw new Exception($\"mixed: got \u0027{m}\u0027\");\n","category":"pattern_matching"} {"id":"39","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Split a string by a delimiter, but ignore delimiters inside brackets.\n // Bracket pairs: (), [], {}\n // Also ignore delimiters inside double-quoted strings (handle \\\" escape)\n // Delimiter defaults to \u0027,\u0027\n // Trim each resulting segment.\n static List\u003cstring\u003e BracketAwareSplit(string input, char delimiter = \u0027,\u0027)\n {\n","golden_completion":" var result = new List\u003cstring\u003e();\n int depth = 0;\n bool inString = false;\n bool escaped = false;\n int start = 0;\n for (int i = 0; i \u003c input.Length; i++)\n {\n char c = input[i];\n if (escaped) { escaped = false; continue; }\n if (c == \u0027\\\\\u0027 \u0026\u0026 inString) { escaped = true; continue; }\n if (c == \u0027\"\u0027) { inString = !inString; continue; }\n if (inString) continue;\n if (c == \u0027(\u0027 || c == \u0027[\u0027 || c == \u0027{\u0027) depth++;\n else if (c == \u0027)\u0027 || c == \u0027]\u0027 || c == \u0027}\u0027) depth--;\n else if (c == delimiter \u0026\u0026 depth == 0)\n {\n result.Add(input.Substring(start, i - start).Trim());\n start = i + 1;\n }\n }\n result.Add(input.Substring(start).Trim());\n return result;\n","suffix":" }\n\n static void Main()\n {\n var r1 = BracketAwareSplit(\"a, b, c\");\n if (r1.Count != 3 || r1[0] != \"a\") throw new Exception(\"Simple split failed\");\n\n var r2 = BracketAwareSplit(\"f(1,2), g(3)\");\n if (r2.Count != 2) throw new Exception($\"Bracket: expected 2 got {r2.Count}\");\n if (r2[0] != \"f(1,2)\") throw new Exception($\"Bracket field: got \u0027{r2[0]}\u0027\");\n\n var r3 = BracketAwareSplit(\"\\\"a,b\\\", c\");\n if (r3.Count != 2) throw new Exception($\"Quoted: expected 2 got {r3.Count}\");\n if (r3[0] != \"\\\"a,b\\\"\") throw new Exception($\"Quoted field: got \u0027{r3[0]}\u0027\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Nested brackets\n var r4 = BracketAwareSplit(\"f({a,b},[c,d]), x\");\n if (r4.Count != 2) throw new Exception($\"Nested: expected 2 got {r4.Count}\");\n\n // Escaped quote in string\n var r5 = BracketAwareSplit(\"\\\"a\\\\\\\"b,c\\\", d\");\n if (r5.Count != 2) throw new Exception($\"Escaped quote: expected 2 got {r5.Count}\");\n\n // Custom delimiter\n var r6 = BracketAwareSplit(\"a|b|(c|d)\", \u0027|\u0027);\n if (r6.Count != 3) throw new Exception($\"Pipe delim: expected 3 got {r6.Count}\");\n if (r6[2] != \"(c|d)\") throw new Exception($\"Pipe bracket: got \u0027{r6[2]}\u0027\");\n\n // Empty input\n var r7 = BracketAwareSplit(\"\");\n if (r7.Count != 1 || r7[0] != \"\") throw new Exception(\"Empty split wrong\");\n","category":"pattern_matching"} {"id":"40","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n // Parse markdown table into list of dictionaries.\n // Rules:\n // - First row is header\n // - Second row is separator (---) — skip it\n // - Remaining rows are data\n // - Cells are separated by | and trimmed\n // - Leading/trailing | on each row are stripped before splitting\n // - Pipes inside backtick-quoted spans (`code|here`) are NOT delimiters\n // Returns List\u003cDict\u003cstring,string\u003e\u003e where keys are header names\n static List\u003cDictionary\u003cstring, string\u003e\u003e ParseMarkdownTable(string text)\n {\n","golden_completion":" List\u003cstring\u003e SplitRow(string row)\n {\n // Strip leading/trailing |\n row = row.Trim();\n if (row.StartsWith(\"|\")) row = row.Substring(1);\n if (row.EndsWith(\"|\")) row = row.Substring(0, row.Length - 1);\n var cells = new List\u003cstring\u003e();\n bool inCode = false;\n int start = 0;\n for (int i = 0; i \u003c row.Length; i++)\n {\n if (row[i] == \u0027`\u0027) inCode = !inCode;\n else if (row[i] == \u0027|\u0027 \u0026\u0026 !inCode)\n {\n cells.Add(row.Substring(start, i - start).Trim());\n start = i + 1;\n }\n }\n cells.Add(row.Substring(start).Trim());\n return cells;\n }\n var lines = text.Split(\u0027\\n\u0027).Where(l =\u003e l.Trim().Length \u003e 0).ToList();\n if (lines.Count \u003c 2) return new List\u003cDictionary\u003cstring, string\u003e\u003e();\n var headers = SplitRow(lines[0]);\n var result = new List\u003cDictionary\u003cstring, string\u003e\u003e();\n for (int r = 2; r \u003c lines.Count; r++)\n {\n var cells = SplitRow(lines[r]);\n var dict = new Dictionary\u003cstring, string\u003e();\n for (int c = 0; c \u003c headers.Count; c++)\n dict[headers[c]] = c \u003c cells.Count ? cells[c] : \"\";\n result.Add(dict);\n }\n return result;\n","suffix":" }\n\n static void Main()\n {\n string table = \"| Name | Value |\\n| --- | --- |\\n| foo | 42 |\\n| bar | 99 |\";\n var rows = ParseMarkdownTable(table);\n if (rows.Count != 2) throw new Exception($\"Expected 2 rows got {rows.Count}\");\n if (rows[0][\"Name\"] != \"foo\") throw new Exception($\"Name: got \u0027{rows[0][\"Name\"]}\u0027\");\n if (rows[1][\"Value\"] != \"99\") throw new Exception($\"Value: got \u0027{rows[1][\"Value\"]}\u0027\");\n\n // Backtick-quoted pipe\n string table2 = \"| Code | Desc |\\n|---|---|\\n| `a|b` | test |\";\n var rows2 = ParseMarkdownTable(table2);\n if (rows2[0][\"Code\"] != \"`a|b`\") throw new Exception($\"Backtick pipe: got \u0027{rows2[0][\"Code\"]}\u0027\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Empty table\n var re = ParseMarkdownTable(\"| H |\\n|---|\\n\");\n if (re.Count != 0) throw new Exception($\"Empty data: expected 0 rows got {re.Count}\");\n\n // Missing cells\n string t3 = \"| A | B | C |\\n|---|---|---|\\n| 1 | 2 |\";\n var r3 = ParseMarkdownTable(t3);\n if (r3[0][\"C\"] != \"\") throw new Exception($\"Missing cell: expected empty got \u0027{r3[0][\"C\"]}\u0027\");\n\n // No leading/trailing pipe\n string t4 = \"A | B\\n---|---\\n1 | 2\";\n var r4 = ParseMarkdownTable(t4);\n if (r4[0][\"A\"] != \"1\" || r4[0][\"B\"] != \"2\") throw new Exception(\"No-pipe format failed\");\n","category":"pattern_matching"} {"id":"41","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Split identifier into words. Custom rules:\n // - Split before uppercase letter that follows a lowercase letter: \"fooBar\" -\u003e [\"foo\",\"Bar\"]\n // - Split before uppercase letter that is followed by lowercase (in an acronym run): \"XMLParser\" -\u003e [\"XML\",\"Parser\"]\n // - Underscores are delimiters (removed from output)\n // - Transition from letter to digit starts a new word: \"abc123\" -\u003e [\"abc\",\"123\"]\n // - Transition from digit to uppercase starts a new word: \"123ABC\" -\u003e [\"123\",\"ABC\"]\n // - Digit followed by lowercase stays in same word: \"get2x\" -\u003e [\"get\",\"2x\"]\n // - Return words in their original case (no lowering)\n static List\u003cstring\u003e SplitIdentifier(string input)\n {\n","golden_completion":" var words = new List\u003cstring\u003e();\n int start = 0;\n for (int i = 0; i \u003c input.Length; i++)\n {\n if (input[i] == \u0027_\u0027)\n {\n if (i \u003e start) words.Add(input.Substring(start, i - start));\n start = i + 1;\n continue;\n }\n if (i \u003e start)\n {\n bool prevLower = char.IsLower(input[i - 1]);\n bool curUpper = char.IsUpper(input[i]);\n bool prevDigit = char.IsDigit(input[i - 1]);\n bool curDigit = char.IsDigit(input[i]);\n bool prevUpper = char.IsUpper(input[i - 1]);\n bool curLower = char.IsLower(input[i]);\n bool split = false;\n // lowercase -\u003e uppercase: \"fooBar\"\n if (prevLower \u0026\u0026 curUpper) split = true;\n // letter -\u003e digit: \"abc123\"\n if (!prevDigit \u0026\u0026 !input[i-1].Equals(\u0027_\u0027) \u0026\u0026 curDigit) split = true;\n // digit -\u003e uppercase: \"2X\" splits, but \"2nd\" does NOT\n if (prevDigit \u0026\u0026 curUpper) split = true;\n // acronym boundary: \"XMLParser\" -\u003e \"XML\",\"Parser\"\n if (curUpper \u0026\u0026 i + 1 \u003c input.Length \u0026\u0026 char.IsLower(input[i + 1]) \u0026\u0026 i \u003e start \u0026\u0026 prevUpper)\n split = true;\n if (split)\n {\n words.Add(input.Substring(start, i - start));\n start = i;\n }\n }\n }\n if (start \u003c input.Length) words.Add(input.Substring(start));\n return words;\n","suffix":" }\n\n static void Main()\n {\n var r1 = SplitIdentifier(\"fooBar\");\n if (r1.Count != 2 || r1[0] != \"foo\" || r1[1] != \"Bar\") throw new Exception($\"fooBar: {string.Join(\",\", r1)}\");\n\n var r2 = SplitIdentifier(\"XMLParser\");\n if (r2.Count != 2 || r2[0] != \"XML\" || r2[1] != \"Parser\") throw new Exception($\"XMLParser: {string.Join(\",\", r2)}\");\n\n var r3 = SplitIdentifier(\"get2ndItem\");\n if (r3.Count != 3 || r3[0] != \"get\" || r3[1] != \"2nd\" || r3[2] != \"Item\") throw new Exception($\"get2ndItem: {string.Join(\",\", r3)}\");\n\n var r3b = SplitIdentifier(\"abc123ABC\");\n if (r3b.Count != 3 || r3b[0] != \"abc\" || r3b[1] != \"123\" || r3b[2] != \"ABC\") throw new Exception($\"abc123ABC: {string.Join(\",\", r3b)}\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" var r4 = SplitIdentifier(\"abc_def\");\n if (r4.Count != 2 || r4[0] != \"abc\" || r4[1] != \"def\") throw new Exception($\"underscore: {string.Join(\",\", r4)}\");\n\n var r5 = SplitIdentifier(\"HTTPSConnection\");\n if (r5.Count != 2 || r5[0] != \"HTTPS\" || r5[1] != \"Connection\") throw new Exception($\"HTTPS: {string.Join(\",\", r5)}\");\n\n // digit-\u003elowercase stays together: \"abc123def\" -\u003e [\"abc\",\"123def\"]\n var r6 = SplitIdentifier(\"abc123def\");\n if (r6.Count != 2 || r6[0] != \"abc\" || r6[1] != \"123def\") throw new Exception($\"abc123def: {string.Join(\",\", r6)}\");\n\n var r7 = SplitIdentifier(\"\");\n if (r7.Count != 0) throw new Exception(\"empty should give no words\");\n","category":"pattern_matching"} {"id":"42","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Split a command line string into arguments, shell-style:\n // - Spaces delimit arguments\n // - Double-quoted strings: spaces preserved, \\\" for literal quote, \\\\ for literal backslash\n // - Single-quoted strings: everything literal (no escapes), ended by next \u0027\n // - Unquoted backslash escapes the next character\n // - Adjacent quoted/unquoted segments join into one argument: he\"ll\"o -\u003e hello\n static List\u003cstring\u003e ShellSplit(string input)\n {\n","golden_completion":" var args = new List\u003cstring\u003e();\n var current = new System.Text.StringBuilder();\n bool hasArg = false;\n int i = 0;\n while (i \u003c input.Length)\n {\n char c = input[i];\n if (c == \u0027\"\u0027)\n {\n hasArg = true; i++;\n while (i \u003c input.Length \u0026\u0026 input[i] != \u0027\"\u0027)\n {\n if (input[i] == \u0027\\\\\u0027 \u0026\u0026 i + 1 \u003c input.Length \u0026\u0026 (input[i + 1] == \u0027\"\u0027 || input[i + 1] == \u0027\\\\\u0027))\n { current.Append(input[i + 1]); i += 2; }\n else { current.Append(input[i]); i++; }\n }\n if (i \u003c input.Length) i++; // skip closing \"\n }\n else if (c == \u0027\\\u0027\u0027)\n {\n hasArg = true; i++;\n while (i \u003c input.Length \u0026\u0026 input[i] != \u0027\\\u0027\u0027)\n { current.Append(input[i]); i++; }\n if (i \u003c input.Length) i++; // skip closing \u0027\n }\n else if (c == \u0027\\\\\u0027 \u0026\u0026 i + 1 \u003c input.Length)\n {\n hasArg = true;\n current.Append(input[i + 1]); i += 2;\n }\n else if (c == \u0027 \u0027 || c == \u0027\\t\u0027)\n {\n if (hasArg) { args.Add(current.ToString()); current.Clear(); hasArg = false; }\n i++;\n }\n else { hasArg = true; current.Append(c); i++; }\n }\n if (hasArg) args.Add(current.ToString());\n return args;\n","suffix":" }\n\n static void Main()\n {\n var r1 = ShellSplit(\"echo hello world\");\n if (r1.Count != 3 || r1[0] != \"echo\") throw new Exception($\"Simple: {string.Join(\"|\", r1)}\");\n\n var r2 = ShellSplit(\"echo \\\"hello world\\\"\");\n if (r2.Count != 2 || r2[1] != \"hello world\") throw new Exception($\"Dquote: {string.Join(\"|\", r2)}\");\n\n var r3 = ShellSplit(\"echo \u0027hello world\u0027\");\n if (r3.Count != 2 || r3[1] != \"hello world\") throw new Exception($\"Squote: {string.Join(\"|\", r3)}\");\n\n // Adjacent joining\n var r4 = ShellSplit(\"he\\\"ll\\\"o\");\n if (r4.Count != 1 || r4[0] != \"hello\") throw new Exception($\"Join: {string.Join(\"|\", r4)}\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Escaped quote in double quotes\n var r5 = ShellSplit(\"echo \\\"say \\\\\\\"hi\\\\\\\"\\\"\");\n if (r5.Count != 2 || r5[1] != \"say \\\"hi\\\"\") throw new Exception($\"Escaped dquote: {string.Join(\"|\", r5)}\");\n\n // Single quotes: no escaping\n var r6 = ShellSplit(\"echo \u0027it\\\\\u0027\u0027s\u0027\");\n // \u0027it\\\\\u0027 -\u003e literal it\\, then s\u0027 is unquoted s then unterminated quote... actually:\n // Let me simplify: \u0027it\u0027 is \"it\", then literal backslash... tricky. Use simpler test:\n var r6b = ShellSplit(\"echo \u0027no\\\\escape\u0027\");\n if (r6b[1] != \"no\\\\escape\") throw new Exception($\"Single no escape: {r6b[1]}\");\n\n // Unquoted backslash\n var r7 = ShellSplit(\"echo hello\\\\ world\");\n if (r7.Count != 2 || r7[1] != \"hello world\") throw new Exception($\"Unquoted escape: {string.Join(\"|\", r7)}\");\n\n // Empty\n var r8 = ShellSplit(\"\");\n if (r8.Count != 0) throw new Exception(\"Empty should give 0 args\");\n","category":"pattern_matching"} {"id":"43","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Analyzes a method and returns a precise description string.\n // The description MUST contain ALL of the following keywords based on method properties:\n // - \"mutates\" if the method modifies a collection parameter (add/remove/set)\n // - \"pure\" if the method has no side effects (only reads, returns value)\n // - \"throws\" if the method can throw an exception\n // - \"nullable\" if the method can return null\n // - \"O(n)\" or \"O(n^2)\" etc for time complexity\n // - \"allocates\" if the method creates new collections/objects\n // Description format: \"keyword1, keyword2, keyword3\" (sorted alphabetically)\n static string DescribeMethod(string methodName, string code)\n {\n","golden_completion":" var keywords = new SortedSet\u003cstring\u003e();\n string lower = code.ToLower();\n if (lower.Contains(\".add(\") || lower.Contains(\".remove\") || lower.Contains(\".insert(\") ||\n lower.Contains(\"[\") \u0026\u0026 lower.Contains(\"] =\"))\n keywords.Add(\"mutates\");\n if (lower.Contains(\"throw \") || lower.Contains(\"throw(\"))\n keywords.Add(\"throws\");\n if (lower.Contains(\"return null\"))\n keywords.Add(\"nullable\");\n if (lower.Contains(\"new list\") || lower.Contains(\"new dictionary\") || lower.Contains(\"new []\") ||\n lower.Contains(\"new string[\") || lower.Contains(\"new int[\") || lower.Contains(\".tolist()\") ||\n lower.Contains(\".toarray()\") || lower.Contains(\"new hashset\"))\n keywords.Add(\"allocates\");\n // Complexity heuristics\n int loops = 0;\n foreach (string kw in new[]{\"for \", \"for(\", \"foreach \", \"foreach(\", \"while \", \"while(\"})\n for (int j = 0; j \u003c lower.Length - kw.Length; j++)\n if (lower.Substring(j, kw.Length) == kw) loops++;\n if (loops \u003e= 2) keywords.Add(\"O(n^2)\");\n else if (loops \u003e= 1) keywords.Add(\"O(n)\");\n else keywords.Add(\"O(1)\");\n if (!keywords.Contains(\"mutates\") \u0026\u0026 !keywords.Contains(\"throws\"))\n keywords.Add(\"pure\");\n return string.Join(\", \", keywords);\n","suffix":" }\n\n static void Main()\n {\n string code1 = \"public int Sum(List\u003cint\u003e items) { int s = 0; foreach(var x in items) s += x; return s; }\";\n string d1 = DescribeMethod(\"Sum\", code1);\n if (!d1.Contains(\"pure\")) throw new Exception($\"Sum should be pure: {d1}\");\n if (!d1.Contains(\"O(n)\")) throw new Exception($\"Sum should be O(n): {d1}\");\n\n string code2 = \"public void AddAll(List\u003cint\u003e a, List\u003cint\u003e b) { foreach(var x in b) a.Add(x); }\";\n string d2 = DescribeMethod(\"AddAll\", code2);\n if (!d2.Contains(\"mutates\")) throw new Exception($\"AddAll should mutate: {d2}\");\n if (d2.Contains(\"pure\")) throw new Exception(\"AddAll is not pure\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" string code3 = \"public string Find(Dictionary\u003cstring,string\u003e d, string k) { if (!d.ContainsKey(k)) return null; return d[k]; }\";\n string d3 = DescribeMethod(\"Find\", code3);\n if (!d3.Contains(\"nullable\")) throw new Exception($\"Find should be nullable: {d3}\");\n if (!d3.Contains(\"O(1)\")) throw new Exception($\"Find should be O(1): {d3}\");\n\n string code4 = \"public List\u003cint\u003e Sort(List\u003cint\u003e items) { var result = new List\u003cint\u003e(items); for(int i=0;i\u003cresult.Count;i++) for(int j=i+1;j\u003cresult.Count;j++) if(result[j]\u003cresult[i]){var t=result[i];result[i]=result[j];result[j]=t;} return result; }\";\n string d4 = DescribeMethod(\"Sort\", code4);\n if (!d4.Contains(\"O(n^2)\")) throw new Exception($\"Sort should be O(n^2): {d4}\");\n if (!d4.Contains(\"allocates\")) throw new Exception($\"Sort should allocate: {d4}\");\n\n string code5 = \"public void Check(int x) { if (x \u003c 0) throw new ArgumentException(); }\";\n string d5 = DescribeMethod(\"Check\", code5);\n if (!d5.Contains(\"throws\")) throw new Exception($\"Check should throw: {d5}\");\n","category":"pattern_matching"} {"id":"44","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Match a URL path against a route pattern and extract parameters.\n // Pattern syntax:\n // /literal — exact match\n // /{name} — captures any non-slash segment into params[\"name\"]\n // /{name:int} — captures only if segment is all digits\n // /{*rest} — captures everything remaining (including slashes), must be last\n // Returns null if no match, otherwise Dictionary\u003cstring,string\u003e of captured params.\n static Dictionary\u003cstring, string\u003e MatchRoute(string pattern, string path)\n {\n","golden_completion":" var result = new Dictionary\u003cstring, string\u003e();\n string[] patParts = pattern.Split(new[]{\u0027/\u0027}, StringSplitOptions.RemoveEmptyEntries);\n string[] pathParts = path.Split(new[]{\u0027/\u0027}, StringSplitOptions.RemoveEmptyEntries);\n int pi = 0;\n for (int i = 0; i \u003c patParts.Length; i++)\n {\n string seg = patParts[i];\n if (seg.StartsWith(\"{*\") \u0026\u0026 seg.EndsWith(\"}\"))\n {\n string name = seg.Substring(2, seg.Length - 3);\n result[name] = string.Join(\"/\", pathParts, pi, pathParts.Length - pi);\n return result;\n }\n if (pi \u003e= pathParts.Length) return null;\n if (seg.StartsWith(\"{\") \u0026\u0026 seg.EndsWith(\"}\"))\n {\n string inner = seg.Substring(1, seg.Length - 2);\n int colon = inner.IndexOf(\u0027:\u0027);\n string name = colon \u003e= 0 ? inner.Substring(0, colon) : inner;\n string constraint = colon \u003e= 0 ? inner.Substring(colon + 1) : null;\n if (constraint == \"int\")\n foreach (char c in pathParts[pi]) if (!char.IsDigit(c)) return null;\n result[name] = pathParts[pi];\n pi++;\n }\n else\n {\n if (pathParts[pi] != seg) return null;\n pi++;\n }\n }\n if (pi != pathParts.Length) return null;\n return result;\n","suffix":" }\n\n static void Main()\n {\n var r1 = MatchRoute(\"/users/{id}\", \"/users/42\");\n if (r1 == null || r1[\"id\"] != \"42\") throw new Exception(\"Simple param failed\");\n\n var r2 = MatchRoute(\"/users/{id:int}\", \"/users/abc\");\n if (r2 != null) throw new Exception(\"Int constraint should reject abc\");\n\n var r3 = MatchRoute(\"/files/{*path}\", \"/files/a/b/c\");\n if (r3 == null || r3[\"path\"] != \"a/b/c\") throw new Exception($\"Wildcard: got {r3?[\"path\"]}\");\n\n var r4 = MatchRoute(\"/api/v1\", \"/api/v2\");\n if (r4 != null) throw new Exception(\"Literal mismatch should fail\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Extra path segments should fail\n var r5 = MatchRoute(\"/users/{id}\", \"/users/42/extra\");\n if (r5 != null) throw new Exception(\"Extra segments should fail\");\n\n // Int constraint passes with digits\n var r6 = MatchRoute(\"/items/{id:int}\", \"/items/999\");\n if (r6 == null || r6[\"id\"] != \"999\") throw new Exception(\"Int digits should pass\");\n\n // Multiple params\n var r7 = MatchRoute(\"/api/{version}/{resource}\", \"/api/v2/users\");\n if (r7 == null || r7[\"version\"] != \"v2\" || r7[\"resource\"] != \"users\") throw new Exception(\"Multi param failed\");\n\n // Wildcard with empty rest\n var r8 = MatchRoute(\"/files/{*path}\", \"/files\");\n if (r8 == null || r8[\"path\"] != \"\") throw new Exception($\"Empty wildcard: got \u0027{r8?[\"path\"]}\u0027\");\n","category":"pattern_matching"} {"id":"45","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Parse TOML-style config into nested dictionaries.\n // Rules:\n // - [table] defines a table; dotted: [a.b] means a -\u003e b -\u003e {}\n // - key = \"string_value\" or key = 123 (integer) or key = true/false\n // - Dotted keys: a.b.c = \"x\" means a -\u003e b -\u003e c -\u003e \"x\"\n // - # comments (whole line)\n // - Values stored as object: string, int, or bool\n // Returns Dict\u003cstring, object\u003e (nested)\n static Dictionary\u003cstring, object\u003e ParseToml(string text)\n {\n","golden_completion":" var root = new Dictionary\u003cstring, object\u003e();\n var current = root;\n foreach (string rawLine in text.Split(\u0027\\n\u0027))\n {\n string line = rawLine.Trim();\n if (line.Length == 0 || line[0] == \u0027#\u0027) continue;\n if (line.StartsWith(\"[\") \u0026\u0026 !line.StartsWith(\"[[\"))\n {\n string tablePath = line.Substring(1, line.IndexOf(\u0027]\u0027) - 1).Trim();\n current = root;\n foreach (string part in tablePath.Split(\u0027.\u0027))\n {\n string k = part.Trim();\n if (!current.ContainsKey(k))\n current[k] = new Dictionary\u003cstring, object\u003e();\n current = (Dictionary\u003cstring, object\u003e)current[k];\n }\n continue;\n }\n int eq = line.IndexOf(\u0027=\u0027);\n if (eq \u003c= 0) continue;\n string keyPart = line.Substring(0, eq).Trim();\n string valPart = line.Substring(eq + 1).Trim();\n object value;\n if (valPart.StartsWith(\"\\\"\") \u0026\u0026 valPart.EndsWith(\"\\\"\"))\n value = valPart.Substring(1, valPart.Length - 2);\n else if (valPart == \"true\") value = true;\n else if (valPart == \"false\") value = false;\n else value = int.Parse(valPart);\n // Handle dotted keys\n string[] parts = keyPart.Split(\u0027.\u0027);\n var target = current;\n for (int i = 0; i \u003c parts.Length - 1; i++)\n {\n string k = parts[i].Trim();\n if (!target.ContainsKey(k))\n target[k] = new Dictionary\u003cstring, object\u003e();\n target = (Dictionary\u003cstring, object\u003e)target[k];\n }\n target[parts[parts.Length - 1].Trim()] = value;\n }\n return root;\n","suffix":" }\n\n static void Main()\n {\n string toml = \"# config\\n[server]\\nhost = \\\"localhost\\\"\\nport = 8080\\nenabled = true\\n\\n[db.primary]\\nconn = \\\"pg://localhost\\\"\";\n var r = ParseToml(toml);\n\n var server = (Dictionary\u003cstring, object\u003e)r[\"server\"];\n if ((string)server[\"host\"] != \"localhost\") throw new Exception(\"host wrong\");\n if ((int)server[\"port\"] != 8080) throw new Exception(\"port wrong\");\n if ((bool)server[\"enabled\"] != true) throw new Exception(\"enabled wrong\");\n\n var dbPrimary = (Dictionary\u003cstring, object\u003e)((Dictionary\u003cstring, object\u003e)r[\"db\"])[\"primary\"];\n if ((string)dbPrimary[\"conn\"] != \"pg://localhost\") throw new Exception(\"db.primary.conn wrong\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Dotted key\n string toml2 = \"a.b.c = \\\"deep\\\"\";\n var r2 = ParseToml(toml2);\n var a2 = (Dictionary\u003cstring, object\u003e)r2[\"a\"];\n var b2 = (Dictionary\u003cstring, object\u003e)a2[\"b\"];\n if ((string)b2[\"c\"] != \"deep\") throw new Exception(\"Dotted key failed\");\n\n // Boolean false\n string toml3 = \"flag = false\";\n var r3 = ParseToml(toml3);\n if ((bool)r3[\"flag\"] != false) throw new Exception(\"Boolean false wrong\");\n\n // Multiple tables\n string toml4 = \"[x]\\nk = 1\\n[y]\\nk = 2\";\n var r4 = ParseToml(toml4);\n if ((int)((Dictionary\u003cstring, object\u003e)r4[\"x\"])[\"k\"] != 1) throw new Exception(\"Multi table x wrong\");\n if ((int)((Dictionary\u003cstring, object\u003e)r4[\"y\"])[\"k\"] != 2) throw new Exception(\"Multi table y wrong\");\n","category":"pattern_matching"} {"id":"46","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Text;\nusing System.Numerics;\n\nclass Program\n{\n static readonly string BITCOIN_B58 = \"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\n static readonly string REVERSED_B58 = new string(\n System.Linq.Enumerable.ToArray(System.Linq.Enumerable.Reverse(BITCOIN_B58)));\n\n // Base58 encoder. Default alphabet is REVERSED_B58 (NOT Bitcoin standard).\n // Leading zero bytes map to the FIRST character of the alphabet.\n static string Base58Encode(byte[] data, string alphabet = null)\n {\n if (alphabet == null) alphabet = REVERSED_B58;\n","golden_completion":" // Count leading zeros\n int leadingZeros = 0;\n foreach (byte b in data) { if (b == 0) leadingZeros++; else break; }\n\n BigInteger num = new BigInteger(new ReadOnlySpan\u003cbyte\u003e(data), true, true);\n StringBuilder sb = new StringBuilder();\n while (num \u003e 0)\n {\n num = BigInteger.DivRem(num, 58, out BigInteger rem);\n sb.Insert(0, alphabet[(int)rem]);\n }\n string prefix = new string(alphabet[0], leadingZeros);\n return prefix + sb.ToString();\n","suffix":" }\n\n static void Main()\n {\n // Single byte 0x01 with reversed alphabet\n string r1 = Base58Encode(new byte[]{0x01});\n string s1 = Base58Encode(new byte[]{0x01}, BITCOIN_B58);\n if (r1 == s1) throw new Exception(\"Reversed must differ from standard\");\n if (s1 != \"2\") throw new Exception($\"Standard 0x01: expected \u00272\u0027 got \u0027{s1}\u0027\");\n\n // Leading zero preservation\n string r2 = Base58Encode(new byte[]{0x00, 0x01});\n if (r2.Length \u003c 2) throw new Exception(\"Leading zero should add prefix char\");\n string s2 = Base58Encode(new byte[]{0x00, 0x01}, BITCOIN_B58);\n if (s2 != \"12\") throw new Exception($\"Standard 0x00,0x01: expected \u002712\u0027 got \u0027{s2}\u0027\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Empty input\n string e = Base58Encode(new byte[0]);\n if (e != \"\") throw new Exception($\"Empty: expected \u0027\u0027 got \u0027{e}\u0027\");\n\n // All zeros\n string z3 = Base58Encode(new byte[]{0x00, 0x00, 0x00});\n if (z3.Length != 3) throw new Exception($\"3 zeros: expected length 3 got {z3.Length}\");\n if (z3[0] != REVERSED_B58[0]) throw new Exception(\"Zero prefix should use alphabet[0]\");\n\n // Standard alphabet check\n string hello_std = Base58Encode(new byte[]{0x48, 0x65, 0x6C, 0x6C, 0x6F}, BITCOIN_B58);\n string hello_rev = Base58Encode(new byte[]{0x48, 0x65, 0x6C, 0x6C, 0x6F});\n if (hello_std == hello_rev) throw new Exception(\"Reversed must differ from standard for Hello\");\n","category":"pattern_matching"} {"id":"47","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Evaluate simple math expressions with variables.\n // Supports: +, -, *, / (integer division), parentheses\n // Operator precedence: * and / bind tighter than + and -\n // Variables are looked up in the vars dictionary.\n // Throws Exception on undefined variable or division by zero.\n static int EvalExpr(string expr, Dictionary\u003cstring, int\u003e vars)\n {\n","golden_completion":" int pos = 0;\n int ParseExpr()\n {\n int result = ParseTerm();\n while (pos \u003c expr.Length \u0026\u0026 (expr[pos] == \u0027+\u0027 || expr[pos] == \u0027-\u0027))\n {\n char op = expr[pos++];\n int right = ParseTerm();\n result = op == \u0027+\u0027 ? result + right : result - right;\n }\n return result;\n }\n int ParseTerm()\n {\n int result = ParseFactor();\n while (pos \u003c expr.Length \u0026\u0026 (expr[pos] == \u0027*\u0027 || expr[pos] == \u0027/\u0027))\n {\n char op = expr[pos++];\n int right = ParseFactor();\n if (op == \u0027/\u0027 \u0026\u0026 right == 0) throw new Exception(\"Division by zero\");\n result = op == \u0027*\u0027 ? result * right : result / right;\n }\n return result;\n }\n int ParseFactor()\n {\n while (pos \u003c expr.Length \u0026\u0026 expr[pos] == \u0027 \u0027) pos++;\n if (pos \u003c expr.Length \u0026\u0026 expr[pos] == \u0027(\u0027)\n {\n pos++; int r = ParseExpr();\n while (pos \u003c expr.Length \u0026\u0026 expr[pos] == \u0027 \u0027) pos++;\n pos++; // skip \u0027)\u0027\n return r;\n }\n if (pos \u003c expr.Length \u0026\u0026 (char.IsDigit(expr[pos]) || (expr[pos] == \u0027-\u0027 \u0026\u0026 pos + 1 \u003c expr.Length \u0026\u0026 char.IsDigit(expr[pos + 1]))))\n {\n int start = pos;\n if (expr[pos] == \u0027-\u0027) pos++;\n while (pos \u003c expr.Length \u0026\u0026 char.IsDigit(expr[pos])) pos++;\n return int.Parse(expr.Substring(start, pos - start));\n }\n int vstart = pos;\n while (pos \u003c expr.Length \u0026\u0026 char.IsLetterOrDigit(expr[pos])) pos++;\n string name = expr.Substring(vstart, pos - vstart);\n if (!vars.ContainsKey(name)) throw new Exception($\"Undefined: {name}\");\n return vars[name];\n }\n return ParseExpr();\n","suffix":" }\n\n static void Main()\n {\n var v = new Dictionary\u003cstring, int\u003e { {\"x\", 10}, {\"y\", 3} };\n if (EvalExpr(\"x+y\", v) != 13) throw new Exception(\"x+y failed\");\n if (EvalExpr(\"x*y+1\", v) != 31) throw new Exception(\"precedence failed\");\n if (EvalExpr(\"(x+y)*2\", v) != 26) throw new Exception(\"parens failed\");\n if (EvalExpr(\"x/y\", v) != 3) throw new Exception(\"int div failed\");\n\n bool threw = false;\n try { EvalExpr(\"x/0\", v); } catch { threw = true; }\n if (!threw) throw new Exception(\"Div by zero should throw\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" var v2 = new Dictionary\u003cstring, int\u003e { {\"a\", 5} };\n if (EvalExpr(\"a*a+a\", v2) != 30) throw new Exception(\"a*a+a failed\");\n if (EvalExpr(\"(a+1)*(a-1)\", v2) != 24) throw new Exception(\"nested parens failed\");\n if (EvalExpr(\"100\", v2) != 100) throw new Exception(\"literal failed\");\n\n bool threw2 = false;\n try { EvalExpr(\"undefined\", v2); } catch { threw2 = true; }\n if (!threw2) throw new Exception(\"Undefined var should throw\");\n","category":"pattern_matching"} {"id":"48","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Simple JSON-path query on nested dictionaries/lists.\n // Path syntax:\n // .key — access dictionary key\n // [n] — access list index (0-based)\n // [*] — wildcard: return all elements of a list as flat list\n // Input is an object (Dictionary\u003cstring,object\u003e or List\u003cobject\u003e or string/int/bool).\n // Returns the value at the path, or throws if invalid path.\n static object JsonPathQuery(object root, string path)\n {\n","golden_completion":" object current = root;\n int i = 0;\n while (i \u003c path.Length)\n {\n if (path[i] == \u0027.\u0027)\n {\n i++;\n int start = i;\n while (i \u003c path.Length \u0026\u0026 path[i] != \u0027.\u0027 \u0026\u0026 path[i] != \u0027[\u0027) i++;\n string key = path.Substring(start, i - start);\n current = ((Dictionary\u003cstring, object\u003e)current)[key];\n }\n else if (path[i] == \u0027[\u0027)\n {\n i++;\n if (path[i] == \u0027*\u0027)\n {\n i += 2; // skip *]\n var list = (List\u003cobject\u003e)current;\n string rest = i \u003c path.Length ? path.Substring(i) : \"\";\n if (rest.Length == 0) return list;\n var results = new List\u003cobject\u003e();\n foreach (var item in list)\n results.Add(JsonPathQuery(item, rest));\n return results;\n }\n int start = i;\n while (path[i] != \u0027]\u0027) i++;\n int idx = int.Parse(path.Substring(start, i - start));\n current = ((List\u003cobject\u003e)current)[idx];\n i++; // skip ]\n }\n else i++;\n }\n return current;\n","suffix":" }\n\n static void Main()\n {\n var data = new Dictionary\u003cstring, object\u003e\n {\n {\"name\", \"Alice\"},\n {\"scores\", new List\u003cobject\u003e{90, 85, 95}},\n {\"address\", new Dictionary\u003cstring, object\u003e{{\"city\", \"NYC\"}}}\n };\n\n if ((string)JsonPathQuery(data, \".name\") != \"Alice\") throw new Exception(\"name failed\");\n if ((int)JsonPathQuery(data, \".scores[1]\") != 85) throw new Exception(\"scores[1] failed\");\n if ((string)JsonPathQuery(data, \".address.city\") != \"NYC\") throw new Exception(\"address.city failed\");\n\n var all = (List\u003cobject\u003e)JsonPathQuery(data, \".scores[*]\");\n if (all.Count != 3 || (int)all[0] != 90) throw new Exception(\"wildcard failed\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Nested wildcard\n var data2 = new Dictionary\u003cstring, object\u003e\n {\n {\"items\", new List\u003cobject\u003e{\n new Dictionary\u003cstring, object\u003e{{\"v\", 1}},\n new Dictionary\u003cstring, object\u003e{{\"v\", 2}}\n }}\n };\n var vals = (List\u003cobject\u003e)JsonPathQuery(data2, \".items[*].v\");\n if (vals.Count != 2 || (int)vals[0] != 1 || (int)vals[1] != 2) throw new Exception(\"Nested wildcard failed\");\n\n // Direct index\n if ((int)JsonPathQuery(data2, \".items[0].v\") != 1) throw new Exception(\"Index access failed\");\n\n // Root list\n var rootList = new List\u003cobject\u003e{10, 20, 30};\n if ((int)JsonPathQuery(rootList, \"[2]\") != 30) throw new Exception(\"Root list index failed\");\n","category":"pattern_matching"} {"id":"49","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n // Sort strings using custom rules (NOT standard lexicographic!):\n // 1. Shorter strings come first\n // 2. Same length: sort by vowel count (more vowels first)\n // 3. Same length and vowel count: sort lexicographically (case-insensitive)\n // Vowels are: a, e, i, o, u (case-insensitive)\n static List\u003cstring\u003e CustomSort(List\u003cstring\u003e items)\n {\n","golden_completion":" int CountVowels(string s)\n {\n int count = 0;\n foreach (char c in s.ToLower())\n if (\"aeiou\".Contains(c)) count++;\n return count;\n }\n return items.OrderBy(s =\u003e s.Length)\n .ThenByDescending(s =\u003e CountVowels(s))\n .ThenBy(s =\u003e s.ToLower())\n .ToList();\n","suffix":" }\n\n static void Main()\n {\n var input = new List\u003cstring\u003e {\"cat\", \"hi\", \"bee\", \"a\", \"dog\", \"eye\"};\n var result = CustomSort(input);\n\n // \"a\" (len 1), \"hi\" (len 2), then len 3: \"eye\"(2 vowels), \"bee\"(2 vowels), \"cat\"(1), \"dog\"(1)\n if (result[0] != \"a\") throw new Exception($\"First: expected \u0027a\u0027 got \u0027{result[0]}\u0027\");\n if (result[1] != \"hi\") throw new Exception($\"Second: expected \u0027hi\u0027 got \u0027{result[1]}\u0027\");\n // eye and bee both have 2 vowels at length 3, bee \u003c eye lexicographically\n if (result[2] != \"bee\") throw new Exception($\"Third: expected \u0027bee\u0027 got \u0027{result[2]}\u0027\");\n if (result[3] != \"eye\") throw new Exception($\"Fourth: expected \u0027eye\u0027 got \u0027{result[3]}\u0027\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" // Same length, same vowels =\u003e lexicographic\n var input2 = new List\u003cstring\u003e {\"bat\", \"cat\", \"ant\"};\n var r2 = CustomSort(input2);\n // All length 3, all 1 vowel =\u003e lex: ant, bat, cat\n if (r2[0] != \"ant\" || r2[1] != \"bat\" || r2[2] != \"cat\") throw new Exception($\"Lex: {string.Join(\",\", r2)}\");\n\n // Empty input\n var r3 = CustomSort(new List\u003cstring\u003e());\n if (r3.Count != 0) throw new Exception(\"Empty list should return empty\");\n\n // More vowels first within same length\n var input4 = new List\u003cstring\u003e {\"xyz\", \"aei\"};\n var r4 = CustomSort(input4);\n if (r4[0] != \"aei\") throw new Exception(\"More vowels should come first\");\n","category":"pattern_matching"} {"id":"50","testsource":"devbench-pattern-matching","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n // Describe a C# type definition string with precise keywords.\n // Input is a simplified type declaration string. Output format: sorted comma-separated keywords.\n // Rules:\n // - Contains \"class\" -\u003e \"reference-type\"\n // - Contains \"struct\" -\u003e \"value-type\"\n // - Contains \"interface\" -\u003e \"contract\"\n // - Contains \"sealed\" -\u003e \"non-inheritable\"\n // - Contains \"abstract\" -\u003e \"must-inherit\"\n // - Contains \"static\" -\u003e \"singleton-like\"\n // - Contains \"IDisposable\" -\u003e \"disposable\"\n // - Contains \"IEnumerable\" or \"IEnumerator\" -\u003e \"iterable\"\n // - Contains \"async\" or \"Task\" -\u003e \"async-capable\"\n // - Contains generic \u003cT\u003e pattern -\u003e \"generic\"\n // - Contains \"where T :\" -\u003e \"constrained-generic\"\n static string DescribeType(string typeDecl)\n {\n","golden_completion":" var keywords = new SortedSet\u003cstring\u003e();\n if (typeDecl.Contains(\"class\")) keywords.Add(\"reference-type\");\n if (typeDecl.Contains(\"struct\")) keywords.Add(\"value-type\");\n if (typeDecl.Contains(\"interface\")) keywords.Add(\"contract\");\n if (typeDecl.Contains(\"sealed\")) keywords.Add(\"non-inheritable\");\n if (typeDecl.Contains(\"abstract\")) keywords.Add(\"must-inherit\");\n if (typeDecl.Contains(\"static\")) keywords.Add(\"singleton-like\");\n if (typeDecl.Contains(\"IDisposable\")) keywords.Add(\"disposable\");\n if (typeDecl.Contains(\"IEnumerable\") || typeDecl.Contains(\"IEnumerator\")) keywords.Add(\"iterable\");\n if (typeDecl.Contains(\"async\") || typeDecl.Contains(\"Task\")) keywords.Add(\"async-capable\");\n if (typeDecl.Contains(\"\u003c\") \u0026\u0026 typeDecl.Contains(\"\u003e\")) keywords.Add(\"generic\");\n if (typeDecl.Contains(\"where\") \u0026\u0026 typeDecl.Contains(\":\")) keywords.Add(\"constrained-generic\");\n return string.Join(\", \", keywords);\n","suffix":" }\n\n static void Main()\n {\n string t1 = \"public sealed class MyService : IDisposable\";\n string d1 = DescribeType(t1);\n if (!d1.Contains(\"non-inheritable\")) throw new Exception($\"Sealed: {d1}\");\n if (!d1.Contains(\"disposable\")) throw new Exception($\"Disposable: {d1}\");\n if (!d1.Contains(\"reference-type\")) throw new Exception($\"Class: {d1}\");\n\n string t2 = \"public abstract class Repository\u003cT\u003e where T : class\";\n string d2 = DescribeType(t2);\n if (!d2.Contains(\"must-inherit\")) throw new Exception($\"Abstract: {d2}\");\n if (!d2.Contains(\"generic\")) throw new Exception($\"Generic: {d2}\");\n if (!d2.Contains(\"constrained-generic\")) throw new Exception($\"Constrained: {d2}\");\n\n Console.WriteLine(\"Visible checks passed.\");\n }\n}\n","assertions":" string t3 = \"public struct Point\";\n string d3 = DescribeType(t3);\n if (!d3.Contains(\"value-type\")) throw new Exception($\"Struct: {d3}\");\n if (d3.Contains(\"reference-type\")) throw new Exception(\"Struct should not be reference-type\");\n\n string t4 = \"public interface IRepository\u003cT\u003e : IEnumerable\u003cT\u003e\";\n string d4 = DescribeType(t4);\n if (!d4.Contains(\"contract\")) throw new Exception($\"Interface: {d4}\");\n if (!d4.Contains(\"iterable\")) throw new Exception($\"Iterable: {d4}\");\n if (!d4.Contains(\"generic\")) throw new Exception($\"Generic interface: {d4}\");\n\n string t5 = \"public static class Helpers\";\n string d5 = DescribeType(t5);\n if (!d5.Contains(\"singleton-like\")) throw new Exception($\"Static: {d5}\");\n\n string t6 = \"public class Worker { public async Task DoWork() {} }\";\n string d6 = DescribeType(t6);\n if (!d6.Contains(\"async-capable\")) throw new Exception($\"Async: {d6}\");\n","category":"pattern_matching"} {"id":"1","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n abstract record Shape;\n record Circle(double Radius) : Shape;\n record Rect(double W, double H) : Shape;\n record Triangle(double Base, double Height) : Shape;\n\n static string Classify(Shape s) =\u003e s switch\n {\n","golden_completion":" Circle { Radius: \u003e 10 } =\u003e \"big-circle\",\n Circle c =\u003e $\"circle-{c.Radius}\",\n Rect { W: var w, H: var h } when w == h =\u003e $\"square-{w}\",\n Rect r =\u003e $\"rect-{r.W}x{r.H}\",\n Triangle { Base: var b, Height: var h } when b * h / 2 \u003e 50 =\u003e \"big-tri\",\n Triangle t =\u003e $\"tri-{t.Base}\",\n _ =\u003e \"unknown\"\n","suffix":" };\n\n static void Main()\n {\n if (!(Classify(new Circle(15)) == \"big-circle\")) throw new Exception();\n if (!(Classify(new Circle(5)) == \"circle-5\")) throw new Exception();\n if (!(Classify(new Rect(4, 4)) == \"square-4\")) throw new Exception();\n if (!(Classify(new Rect(3, 5)) == \"rect-3x5\")) throw new Exception();\n if (!(Classify(new Triangle(20, 6)) == \"big-tri\")) throw new Exception();\n if (!(Classify(new Triangle(3, 4)) == \"tri-3\")) throw new Exception();\n }\n}\n","assertions":"if (!(Classify(new Circle(10)) == \"circle-10\")) throw new Exception();\nif (!(Classify(new Circle(10.1)) == \"big-circle\")) throw new Exception();\nif (!(Classify(new Rect(1, 1)) == \"square-1\")) throw new Exception();\nif (!(Classify(new Triangle(10, 10)) == \"tri-10\")) throw new Exception();\nif (!(Classify(new Triangle(100, 1.1)) == \"big-tri\")) throw new Exception();\n","category":"syntax_completion"} {"id":"2","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n record Sale(string Product, string Region, double Amount);\n\n static Dictionary\u003cstring, (int Count, double Total)\u003e Summarize(List\u003cSale\u003e sales)\n {\n var query = from s in sales\n let rounded = Math.Round(s.Amount, 0)\n where rounded \u003e 10\n group s by s.Region into g\n","golden_completion":" orderby g.Count() descending\n select new { Region = g.Key, Count = g.Count(), Total = g.Sum(x =\u003e x.Amount) };\n return query.ToDictionary(x =\u003e x.Region, x =\u003e (x.Count, x.Total));\n","suffix":" }\n\n static void Main()\n {\n var sales = new List\u003cSale\u003e\n {\n new(\"Widget\", \"East\", 50.5),\n new(\"Gadget\", \"East\", 30.0),\n new(\"Widget\", \"West\", 5.0),\n new(\"Gadget\", \"West\", 20.0),\n new(\"Widget\", \"East\", 8.0),\n };\n var result = Summarize(sales);\n if (!(result[\"East\"].Count == 2)) throw new Exception();\n if (!(result[\"East\"].Total == 80.5)) throw new Exception();\n if (!(result[\"West\"].Count == 1)) throw new Exception();\n }\n}\n","assertions":"var sales2 = new List\u003cSale\u003e\n{\n new(\"A\", \"North\", 100), new(\"B\", \"North\", 200), new(\"C\", \"South\", 5),\n};\nvar r2 = Summarize(sales2);\nif (!(r2.ContainsKey(\"North\") \u0026\u0026 r2[\"North\"].Count == 2)) throw new Exception();\nif (!(r2[\"North\"].Total == 300)) throw new Exception();\nif (r2.ContainsKey(\"South\")) throw new Exception(\"5.0 rounds to 5 which is \u003c=10\");\n","category":"syntax_completion"} {"id":"3","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static List\u003cT\u003e MergeSorted\u003cT\u003e(List\u003cT\u003e a, List\u003cT\u003e b) where T : IComparable\u003cT\u003e\n {\n var result = new List\u003cT\u003e(a.Count + b.Count);\n int i = 0, j = 0;\n","golden_completion":" while (i \u003c a.Count \u0026\u0026 j \u003c b.Count)\n {\n if (a[i].CompareTo(b[j]) \u003c= 0)\n result.Add(a[i++]);\n else\n result.Add(b[j++]);\n }\n while (i \u003c a.Count) result.Add(a[i++]);\n while (j \u003c b.Count) result.Add(b[j++]);\n","suffix":" return result;\n }\n\n static void Main()\n {\n var a = new List\u003cint\u003e { 1, 3, 5, 7 };\n var b = new List\u003cint\u003e { 2, 4, 6, 8 };\n var merged = MergeSorted(a, b);\n if (!(string.Join(\",\", merged) == \"1,2,3,4,5,6,7,8\")) throw new Exception();\n }\n}\n","assertions":"var empty = MergeSorted(new List\u003cint\u003e(), new List\u003cint\u003e { 1, 2 });\nif (!(string.Join(\",\", empty) == \"1,2\")) throw new Exception();\nvar same = MergeSorted(new List\u003cint\u003e { 1, 1 }, new List\u003cint\u003e { 1, 1 });\nif (!(string.Join(\",\", same) == \"1,1,1,1\")) throw new Exception();\nvar strs = MergeSorted(new List\u003cstring\u003e { \"a\", \"c\" }, new List\u003cstring\u003e { \"b\", \"d\" });\nif (!(string.Join(\",\", strs) == \"a,b,c,d\")) throw new Exception();\n","category":"syntax_completion"} {"id":"4","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n enum Season { Spring, Summer, Autumn, Winter }\n enum Temp { Cold, Mild, Hot }\n\n static string Advisory(Season s, Temp t, bool raining) =\u003e (s, t, raining) switch\n {\n (Season.Winter, Temp.Cold, true) =\u003e \"blizzard-warning\",\n (Season.Winter, Temp.Cold, false) =\u003e \"frost-alert\",\n (Season.Winter, _, _) =\u003e \"winter-mild\",\n","golden_completion":" (Season.Summer, Temp.Hot, true) =\u003e \"thunderstorm\",\n (Season.Summer, Temp.Hot, false) =\u003e \"heat-wave\",\n (Season.Summer, _, true) =\u003e \"summer-rain\",\n (Season.Summer, _, _) =\u003e \"pleasant\",\n (_, _, true) =\u003e \"bring-umbrella\",\n (_, Temp.Cold, _) =\u003e \"bundle-up\",\n _ =\u003e \"normal\"\n","suffix":" };\n\n static void Main()\n {\n if (!(Advisory(Season.Winter, Temp.Cold, true) == \"blizzard-warning\")) throw new Exception();\n if (!(Advisory(Season.Summer, Temp.Hot, false) == \"heat-wave\")) throw new Exception();\n if (!(Advisory(Season.Summer, Temp.Mild, true) == \"summer-rain\")) throw new Exception();\n if (!(Advisory(Season.Summer, Temp.Mild, false) == \"pleasant\")) throw new Exception();\n if (!(Advisory(Season.Autumn, Temp.Mild, true) == \"bring-umbrella\")) throw new Exception();\n if (!(Advisory(Season.Spring, Temp.Cold, false) == \"bundle-up\")) throw new Exception();\n if (!(Advisory(Season.Autumn, Temp.Mild, false) == \"normal\")) throw new Exception();\n }\n}\n","assertions":"if (!(Advisory(Season.Winter, Temp.Mild, true) == \"winter-mild\")) throw new Exception();\nif (!(Advisory(Season.Winter, Temp.Hot, false) == \"winter-mild\")) throw new Exception();\nif (!(Advisory(Season.Summer, Temp.Hot, true) == \"thunderstorm\")) throw new Exception();\nif (!(Advisory(Season.Summer, Temp.Cold, true) == \"summer-rain\")) throw new Exception();\nif (!(Advisory(Season.Spring, Temp.Hot, true) == \"bring-umbrella\")) throw new Exception();\nif (!(Advisory(Season.Autumn, Temp.Hot, false) == \"normal\")) throw new Exception();\n","category":"syntax_completion"} {"id":"5","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static IEnumerable\u003cint\u003e FibUpTo(int max)\n {\n int a = 0, b = 1;\n","golden_completion":" while (a \u003c= max)\n {\n yield return a;\n int next = a + b;\n a = b;\n b = next;\n }\n","suffix":" }\n\n static void Main()\n {\n var fibs = FibUpTo(20).ToList();\n if (!(string.Join(\",\", fibs) == \"0,1,1,2,3,5,8,13\")) throw new Exception();\n if (!(FibUpTo(0).Count() == 1)) throw new Exception();\n }\n}\n","assertions":"if (!(FibUpTo(1).ToList().Count == 3)) throw new Exception(\"0,1,1\");\nif (!(FibUpTo(100).Last() == 89)) throw new Exception();\nif (!(FibUpTo(100).Count() == 12)) throw new Exception();\nvar big = FibUpTo(1000).ToList();\nif (!(big.Last() == 987)) throw new Exception();\n","category":"syntax_completion"} {"id":"6","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n record Student(int Id, string Name, int DeptId);\n record Dept(int Id, string Name);\n record Grade(int StudentId, string Course, int Score);\n\n static List\u003cstring\u003e TopStudents(List\u003cStudent\u003e students, List\u003cDept\u003e depts, List\u003cGrade\u003e grades)\n {\n var query = from s in students\n join d in depts on s.DeptId equals d.Id\n join g in grades on s.Id equals g.StudentId into studentGrades\n let avg = studentGrades.Average(x =\u003e x.Score)\n","golden_completion":" where avg \u003e= 80\n orderby avg descending, s.Name\n select $\"{s.Name} ({d.Name}): {avg:F1}\";\n return query.ToList();\n","suffix":" }\n\n static void Main()\n {\n var students = new List\u003cStudent\u003e { new(1, \"Alice\", 1), new(2, \"Bob\", 1), new(3, \"Carol\", 2) };\n var depts = new List\u003cDept\u003e { new(1, \"CS\"), new(2, \"Math\") };\n var grades = new List\u003cGrade\u003e\n {\n new(1, \"Algo\", 90), new(1, \"DB\", 85),\n new(2, \"Algo\", 70), new(2, \"DB\", 75),\n new(3, \"Calc\", 95), new(3, \"LA\", 88),\n };\n var top = TopStudents(students, depts, grades);\n if (!(top.Count == 2)) throw new Exception($\"Expected 2, got {top.Count}\");\n if (!(top[0] == \"Carol (Math): 91.5\")) throw new Exception(top[0]);\n if (!(top[1] == \"Alice (CS): 87.5\")) throw new Exception(top[1]);\n }\n}\n","assertions":"var s2 = new List\u003cStudent\u003e { new(1, \"Zara\", 1), new(2, \"Amy\", 1) };\nvar d2 = new List\u003cDept\u003e { new(1, \"Bio\") };\nvar g2 = new List\u003cGrade\u003e { new(1, \"X\", 80), new(2, \"Y\", 80) };\nvar r2 = TopStudents(s2, d2, g2);\nif (!(r2.Count == 2)) throw new Exception();\nif (!(r2[0] == \"Amy (Bio): 80.0\")) throw new Exception(\"orderby name \" + r2[0]);\nif (!(r2[1] == \"Zara (Bio): 80.0\")) throw new Exception(r2[1]);\n","category":"syntax_completion"} {"id":"7","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n abstract record Expr;\n record Num(double Val) : Expr;\n record BinOp(string Op, Expr Left, Expr Right) : Expr;\n record UnaryOp(string Op, Expr Inner) : Expr;\n\n static double Eval(Expr e) =\u003e e switch\n {\n Num(var v) =\u003e v,\n BinOp(\"+\", var l, var r) =\u003e Eval(l) + Eval(r),\n BinOp(\"-\", var l, var r) =\u003e Eval(l) - Eval(r),\n BinOp(\"*\", var l, var r) =\u003e Eval(l) * Eval(r),\n","golden_completion":" BinOp(\"/\", var l, var r) when Eval(r) != 0 =\u003e Eval(l) / Eval(r),\n BinOp(\"/\", _, _) =\u003e double.NaN,\n BinOp(\"**\", var l, var r) =\u003e Math.Pow(Eval(l), Eval(r)),\n UnaryOp(\"-\", var inner) =\u003e -Eval(inner),\n UnaryOp(\"abs\", var inner) =\u003e Math.Abs(Eval(inner)),\n _ =\u003e throw new ArgumentException($\"Unknown: {e}\")\n","suffix":" };\n\n static void Main()\n {\n var expr = new BinOp(\"+\", new Num(3), new BinOp(\"*\", new Num(2), new Num(4)));\n if (!(Math.Abs(Eval(expr) - 11.0) \u003c 0.001)) throw new Exception();\n if (!(double.IsNaN(Eval(new BinOp(\"/\", new Num(1), new Num(0)))))) throw new Exception();\n if (!(Math.Abs(Eval(new UnaryOp(\"-\", new Num(5))) - (-5)) \u003c 0.001)) throw new Exception();\n }\n}\n","assertions":"if (!(Math.Abs(Eval(new BinOp(\"**\", new Num(2), new Num(10))) - 1024) \u003c 0.001)) throw new Exception();\nif (!(Math.Abs(Eval(new UnaryOp(\"abs\", new Num(-7))) - 7) \u003c 0.001)) throw new Exception();\nif (!(Math.Abs(Eval(new BinOp(\"/\", new Num(10), new Num(3))) - 3.3333) \u003c 0.01)) throw new Exception();\nvar nested = new UnaryOp(\"-\", new BinOp(\"+\", new Num(1), new Num(2)));\nif (!(Math.Abs(Eval(nested) - (-3)) \u003c 0.001)) throw new Exception();\n","category":"syntax_completion"} {"id":"8","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Threading.Tasks;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static async Task\u003cint\u003e ComputeAsync(int x)\n {\n await Task.Delay(1);\n return x * x;\n }\n\n static async Task\u003cList\u003cint\u003e\u003e BatchCompute(int[] inputs)\n {\n var tasks = inputs.Select(x =\u003e ComputeAsync(x)).ToArray();\n","golden_completion":" var results = await Task.WhenAll(tasks);\n return results.OrderByDescending(x =\u003e x).ToList();\n","suffix":" }\n\n static async Task Main()\n {\n var result = await BatchCompute(new[] { 3, 1, 4, 1, 5 });\n if (!(result[0] == 25)) throw new Exception($\"Expected 25, got {result[0]}\");\n if (!(result[1] == 16)) throw new Exception();\n if (!(result.Count == 5)) throw new Exception();\n }\n}\n","assertions":"var r2 = await BatchCompute(new[] { 0, 2 });\nif (!(r2[0] == 4)) throw new Exception();\nif (!(r2[1] == 0)) throw new Exception();\nvar r3 = await BatchCompute(new int[] { });\nif (!(r3.Count == 0)) throw new Exception();\nvar r4 = await BatchCompute(new[] { 10 });\nif (!(r4[0] == 100)) throw new Exception();\n","category":"syntax_completion"} {"id":"9","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n abstract record Animal(string Name, int Age);\n record Dog(string Name, int Age, string Breed) : Animal(Name, Age);\n record Cat(string Name, int Age, bool Indoor) : Animal(Name, Age);\n record Bird(string Name, int Age, double Wingspan) : Animal(Name, Age);\n\n static string Describe(Animal a) =\u003e a switch\n {\n Dog(var n, var age, var breed) when age \u003e 10 =\u003e $\"{n}: senior {breed}\",\n","golden_completion":" Dog(var n, _, var breed) =\u003e $\"{n}: {breed}\",\n Cat(var n, _, true) =\u003e $\"{n}: indoor cat\",\n Cat(var n, var age, false) when age \u003c 2 =\u003e $\"{n}: outdoor kitten\",\n Cat(var n, _, _) =\u003e $\"{n}: outdoor cat\",\n Bird(var n, _, var ws) when ws \u003e 1.5 =\u003e $\"{n}: large bird\",\n Bird(var n, _, _) =\u003e $\"{n}: small bird\",\n _ =\u003e \"unknown\"\n","suffix":" };\n\n static void Main()\n {\n if (!(Describe(new Dog(\"Rex\", 12, \"Lab\")) == \"Rex: senior Lab\")) throw new Exception();\n if (!(Describe(new Dog(\"Max\", 3, \"Pug\")) == \"Max: Pug\")) throw new Exception();\n if (!(Describe(new Cat(\"Mia\", 5, true)) == \"Mia: indoor cat\")) throw new Exception();\n if (!(Describe(new Cat(\"Leo\", 1, false)) == \"Leo: outdoor kitten\")) throw new Exception();\n if (!(Describe(new Cat(\"Sam\", 5, false)) == \"Sam: outdoor cat\")) throw new Exception();\n if (!(Describe(new Bird(\"Sky\", 2, 2.0)) == \"Sky: large bird\")) throw new Exception();\n if (!(Describe(new Bird(\"Pip\", 1, 0.3)) == \"Pip: small bird\")) throw new Exception();\n }\n}\n","assertions":"if (!(Describe(new Dog(\"A\", 10, \"X\")) == \"A: X\")) throw new Exception(\"10 is not \u003e 10\");\nif (!(Describe(new Dog(\"B\", 11, \"Y\")) == \"B: senior Y\")) throw new Exception();\nif (!(Describe(new Cat(\"C\", 2, false)) == \"C: outdoor cat\")) throw new Exception(\"2 is not \u003c 2\");\nif (!(Describe(new Bird(\"D\", 1, 1.5)) == \"D: small bird\")) throw new Exception(\"1.5 is not \u003e 1.5\");\nif (!(Describe(new Bird(\"E\", 1, 1.51)) == \"E: large bird\")) throw new Exception();\n","category":"syntax_completion"} {"id":"10","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n class PriorityBag\u003cTKey, TVal\u003e\n where TKey : IComparable\u003cTKey\u003e\n where TVal : class, new()\n {\n private readonly SortedDictionary\u003cTKey, List\u003cTVal\u003e\u003e _data = new();\n\n public void Add(TKey key, TVal val)\n {\n","golden_completion":" if (!_data.ContainsKey(key))\n _data[key] = new List\u003cTVal\u003e();\n _data[key].Add(val);\n }\n\n public TVal? PopHighest()\n {\n if (_data.Count == 0) return null;\n var last = _data.Last();\n var val = last.Value[^1];\n last.Value.RemoveAt(last.Value.Count - 1);\n if (last.Value.Count == 0) _data.Remove(last.Key);\n return val;\n","suffix":" }\n\n public int Count =\u003e _data.Values.Sum(v =\u003e v.Count);\n }\n\n class Item\n {\n public string Tag { get; set; } = \"\";\n public override string ToString() =\u003e Tag;\n }\n\n static void Main()\n {\n var bag = new PriorityBag\u003cint, Item\u003e();\n bag.Add(1, new Item { Tag = \"low\" });\n bag.Add(3, new Item { Tag = \"high1\" });\n bag.Add(3, new Item { Tag = \"high2\" });\n bag.Add(2, new Item { Tag = \"mid\" });\n if (!(bag.Count == 4)) throw new Exception();\n if (!(bag.PopHighest()!.Tag == \"high2\")) throw new Exception();\n if (!(bag.PopHighest()!.Tag == \"high1\")) throw new Exception();\n if (!(bag.PopHighest()!.Tag == \"mid\")) throw new Exception();\n if (!(bag.Count == 1)) throw new Exception();\n }\n}\n","assertions":"if (!(bag.PopHighest()!.Tag == \"low\")) throw new Exception();\nif (!(bag.PopHighest() == null)) throw new Exception();\nif (!(bag.Count == 0)) throw new Exception();\nbag.Add(5, new Item { Tag = \"x\" });\nif (!(bag.Count == 1)) throw new Exception();\nif (!(bag.PopHighest()!.Tag == \"x\")) throw new Exception();\n","category":"syntax_completion"} {"id":"11","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n record Order(int Id, int CustomerId, double Total);\n record Customer(int Id, string Name);\n\n static List\u003c(string Name, double Sum, int Count)\u003e SummaryByCustomer(\n List\u003cCustomer\u003e customers, List\u003cOrder\u003e orders)\n {\n return customers\n .GroupJoin(orders,\n c =\u003e c.Id,\n o =\u003e o.CustomerId,\n","golden_completion":" (c, ords) =\u003e new { c.Name, Sum = ords.Sum(o =\u003e o.Total), Count = ords.Count() })\n .Where(x =\u003e x.Count \u003e 0)\n .OrderBy(x =\u003e x.Name)\n .Select(x =\u003e (x.Name, x.Sum, x.Count))\n .ToList();\n","suffix":" }\n\n static void Main()\n {\n var customers = new List\u003cCustomer\u003e { new(1, \"Alice\"), new(2, \"Bob\"), new(3, \"Carol\") };\n var orders = new List\u003cOrder\u003e\n {\n new(1, 1, 50), new(2, 1, 30), new(3, 2, 100),\n };\n var result = SummaryByCustomer(customers, orders);\n if (!(result.Count == 2)) throw new Exception($\"count={result.Count}\");\n if (!(result[0].Name == \"Alice\" \u0026\u0026 result[0].Sum == 80 \u0026\u0026 result[0].Count == 2)) throw new Exception();\n if (!(result[1].Name == \"Bob\" \u0026\u0026 result[1].Sum == 100 \u0026\u0026 result[1].Count == 1)) throw new Exception();\n }\n}\n","assertions":"var cs = new List\u003cCustomer\u003e { new(1, \"Zoe\") };\nvar os = new List\u003cOrder\u003e();\nvar r = SummaryByCustomer(cs, os);\nif (!(r.Count == 0)) throw new Exception(\"no orders means filtered out\");\nvar cs2 = new List\u003cCustomer\u003e { new(1, \"A\"), new(2, \"B\") };\nvar os2 = new List\u003cOrder\u003e { new(1, 1, 10), new(2, 2, 20), new(3, 2, 30) };\nvar r2 = SummaryByCustomer(cs2, os2);\nif (!(r2[0] == (\"A\", 10.0, 1))) throw new Exception();\nif (!(r2[1] == (\"B\", 50.0, 2))) throw new Exception();\n","category":"syntax_completion"} {"id":"12","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n record Address(string City, string Country);\n record Person(string Name, int Age, Address? Addr);\n\n static List\u003cstring\u003e FindAdults(List\u003cPerson\u003e people, string country)\n {\n var result = new List\u003cstring\u003e();\n foreach (var p in people)\n {\n","golden_completion":" if (p is { Age: \u003e= 18, Addr: { Country: var c } } \u0026\u0026 c == country)\n {\n result.Add(p.Name);\n }\n","suffix":" }\n return result.OrderBy(x =\u003e x).ToList();\n }\n\n static void Main()\n {\n var people = new List\u003cPerson\u003e\n {\n new(\"Alice\", 25, new(\"NYC\", \"US\")),\n new(\"Bob\", 17, new(\"LA\", \"US\")),\n new(\"Carol\", 30, new(\"London\", \"UK\")),\n new(\"Dave\", 20, null),\n new(\"Eve\", 19, new(\"SF\", \"US\")),\n };\n var us = FindAdults(people, \"US\");\n if (!(us.Count == 2)) throw new Exception($\"count={us.Count}\");\n if (!(us[0] == \"Alice\")) throw new Exception();\n if (!(us[1] == \"Eve\")) throw new Exception();\n }\n}\n","assertions":"var p2 = new List\u003cPerson\u003e { new(\"X\", 18, new(\"A\", \"DE\")), new(\"Y\", 18, null) };\nvar de = FindAdults(p2, \"DE\");\nif (!(de.Count == 1 \u0026\u0026 de[0] == \"X\")) throw new Exception();\nvar none = FindAdults(p2, \"US\");\nif (!(none.Count == 0)) throw new Exception();\n","category":"syntax_completion"} {"id":"13","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n class TrackedResource : IDisposable\n {\n static List\u003cstring\u003e _log = new();\n public static List\u003cstring\u003e Log =\u003e _log;\n public static void Reset() =\u003e _log = new();\n string _name;\n public TrackedResource(string name) { _name = name; _log.Add($\"open:{name}\"); }\n public void Use() =\u003e _log.Add($\"use:{_name}\");\n public void Dispose() =\u003e _log.Add($\"close:{_name}\");\n }\n\n static string Process(bool failInner, bool failOuter)\n {\n TrackedResource.Reset();\n try\n {\n using var outer = new TrackedResource(\"outer\");\n outer.Use();\n try\n {\n using var inner = new TrackedResource(\"inner\");\n","golden_completion":" inner.Use();\n if (failInner) throw new InvalidOperationException(\"inner-fail\");\n }\n catch (InvalidOperationException ex)\n {\n TrackedResource.Log.Add($\"caught:{ex.Message}\");\n }\n finally\n {\n TrackedResource.Log.Add(\"inner-finally\");\n }\n if (failOuter) throw new ArgumentException(\"outer-fail\");\n","suffix":" }\n catch (ArgumentException ex)\n {\n TrackedResource.Log.Add($\"caught:{ex.Message}\");\n }\n finally\n {\n TrackedResource.Log.Add(\"outer-finally\");\n }\n return string.Join(\"|\", TrackedResource.Log);\n }\n\n static void Main()\n {\n var r1 = Process(false, false);\n if (!(r1 == \"open:outer|use:outer|open:inner|use:inner|close:inner|inner-finally|close:outer|outer-finally\"))\n throw new Exception(r1);\n var r2 = Process(true, false);\n if (!(r2 == \"open:outer|use:outer|open:inner|use:inner|close:inner|caught:inner-fail|inner-finally|close:outer|outer-finally\"))\n throw new Exception(r2);\n }\n}\n","assertions":"var r3 = Process(false, true);\nif (!(r3 == \"open:outer|use:outer|open:inner|use:inner|close:inner|inner-finally|close:outer|caught:outer-fail|outer-finally\"))\n throw new Exception(r3);\nvar r4 = Process(true, true);\nif (!(r4 == \"open:outer|use:outer|open:inner|use:inner|close:inner|caught:inner-fail|inner-finally|close:outer|caught:outer-fail|outer-finally\"))\n throw new Exception(r4);\n","category":"syntax_completion"} {"id":"14","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\n\nclass Program\n{\n static Func\u003cint, int\u003e MakeAccumulator(int initial)\n {\n int state = initial;\n","golden_completion":" int Accumulate(int x)\n {\n state += x;\n return state;\n }\n return Accumulate;\n","suffix":" }\n\n static void Main()\n {\n var acc = MakeAccumulator(10);\n if (!(acc(5) == 15)) throw new Exception();\n if (!(acc(3) == 18)) throw new Exception();\n if (!(acc(-8) == 10)) throw new Exception();\n\n var acc2 = MakeAccumulator(0);\n if (!(acc2(1) == 1)) throw new Exception();\n if (!(acc2(1) == 2)) throw new Exception();\n }\n}\n","assertions":"var acc3 = MakeAccumulator(100);\nif (!(acc3(0) == 100)) throw new Exception();\nif (!(acc3(-100) == 0)) throw new Exception();\nif (!(acc3(1) == 1)) throw new Exception();\nvar a = MakeAccumulator(0);\nvar b = MakeAccumulator(0);\na(10);\nb(20);\nif (!(a(0) == 10)) throw new Exception(\"separate state\");\nif (!(b(0) == 20)) throw new Exception(\"separate state\");\n","category":"syntax_completion"} {"id":"15","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static (int Min, int Max, double Avg) Stats(IEnumerable\u003cint\u003e nums)\n {\n var list = nums.ToList();\n if (list.Count == 0) return (0, 0, 0);\n","golden_completion":" int min = list[0], max = list[0];\n long sum = 0;\n foreach (var n in list)\n {\n if (n \u003c min) min = n;\n if (n \u003e max) max = n;\n sum += n;\n }\n return (min, max, (double)sum / list.Count);\n","suffix":" }\n\n static void Main()\n {\n var (lo, hi, avg) = Stats(new[] { 3, 1, 4, 1, 5, 9 });\n if (!(lo == 1)) throw new Exception();\n if (!(hi == 9)) throw new Exception();\n if (!(Math.Abs(avg - 3.833) \u003c 0.01)) throw new Exception();\n var (a, b, c) = Stats(new int[] { });\n if (!(a == 0 \u0026\u0026 b == 0 \u0026\u0026 c == 0)) throw new Exception();\n }\n}\n","assertions":"var (lo2, hi2, avg2) = Stats(new[] { 42 });\nif (!(lo2 == 42 \u0026\u0026 hi2 == 42 \u0026\u0026 Math.Abs(avg2 - 42) \u003c 0.01)) throw new Exception();\nvar (lo3, hi3, avg3) = Stats(new[] { -5, -1, -10 });\nif (!(lo3 == -10 \u0026\u0026 hi3 == -1)) throw new Exception();\nif (!(Math.Abs(avg3 - (-16.0/3)) \u003c 0.01)) throw new Exception();\n","category":"syntax_completion"} {"id":"16","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n record Team(string Name, List\u003cint\u003e Scores);\n\n static List\u003c(string Team, int Game, int Score)\u003e TopScores(List\u003cTeam\u003e teams, int threshold)\n {\n return teams\n .SelectMany(t =\u003e t.Scores.Select((s, idx) =\u003e (Team: t.Name, Game: idx + 1, Score: s)))\n","golden_completion":" .Where(x =\u003e x.Score \u003e= threshold)\n .OrderByDescending(x =\u003e x.Score)\n .ThenBy(x =\u003e x.Team)\n .ThenBy(x =\u003e x.Game)\n .ToList();\n","suffix":" }\n\n static void Main()\n {\n var teams = new List\u003cTeam\u003e\n {\n new(\"Alpha\", new() { 80, 95, 70 }),\n new(\"Beta\", new() { 90, 60, 85 }),\n };\n var top = TopScores(teams, 85);\n if (!(top.Count == 3)) throw new Exception($\"count={top.Count}\");\n if (!(top[0] == (\"Alpha\", 2, 95))) throw new Exception(top[0].ToString());\n if (!(top[1] == (\"Beta\", 1, 90))) throw new Exception();\n if (!(top[2] == (\"Beta\", 3, 85))) throw new Exception();\n }\n}\n","assertions":"var empty = TopScores(new List\u003cTeam\u003e(), 0);\nif (!(empty.Count == 0)) throw new Exception();\nvar t2 = new List\u003cTeam\u003e { new(\"X\", new() { 50, 50 }) };\nif (!(TopScores(t2, 51).Count == 0)) throw new Exception();\nif (!(TopScores(t2, 50).Count == 2)) throw new Exception();\nvar t3 = new List\u003cTeam\u003e { new(\"A\", new() { 100 }), new(\"B\", new() { 100 }) };\nvar r3 = TopScores(t3, 100);\nif (!(r3[0].Team == \"A\" \u0026\u0026 r3[1].Team == \"B\")) throw new Exception(\"tiebreak by name\");\n","category":"syntax_completion"} {"id":"17","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static IEnumerable\u003c(int Start, int End, int Sum)\u003e ConsecutiveRuns(int[] arr, int minLen)\n {\n int start = 0;\n while (start \u003c arr.Length)\n {\n int end = start + 1;\n while (end \u003c arr.Length \u0026\u0026 arr[end] == arr[end - 1] + 1)\n end++;\n int len = end - start;\n","golden_completion":" if (len \u003e= minLen)\n {\n int sum = 0;\n for (int i = start; i \u003c end; i++) sum += arr[i];\n yield return (arr[start], arr[end - 1], sum);\n }\n start = end;\n","suffix":" }\n }\n\n static void Main()\n {\n var runs = ConsecutiveRuns(new[] { 1, 2, 3, 7, 8, 10, 11, 12, 13 }, 3).ToList();\n if (!(runs.Count == 2)) throw new Exception($\"count={runs.Count}\");\n if (!(runs[0] == (1, 3, 6))) throw new Exception(runs[0].ToString());\n if (!(runs[1] == (10, 13, 46))) throw new Exception(runs[1].ToString());\n }\n}\n","assertions":"var r2 = ConsecutiveRuns(new[] { 5 }, 1).ToList();\nif (!(r2.Count == 1 \u0026\u0026 r2[0] == (5, 5, 5))) throw new Exception();\nvar r3 = ConsecutiveRuns(new[] { 1, 3, 5 }, 2).ToList();\nif (!(r3.Count == 0)) throw new Exception(\"no consecutive runs of len 2\");\nvar r4 = ConsecutiveRuns(new int[] { }, 1).ToList();\nif (!(r4.Count == 0)) throw new Exception();\nvar r5 = ConsecutiveRuns(new[] { 1, 2, 3, 4, 5 }, 5).ToList();\nif (!(r5.Count == 1 \u0026\u0026 r5[0] == (1, 5, 15))) throw new Exception();\n","category":"syntax_completion"} {"id":"18","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static Func\u003cT, TResult\u003e Compose\u003cT, TMid, TResult\u003e(Func\u003cT, TMid\u003e f, Func\u003cTMid, TResult\u003e g)\n =\u003e x =\u003e g(f(x));\n\n static Func\u003cIEnumerable\u003cT\u003e, IEnumerable\u003cT\u003e\u003e BuildPipeline\u003cT\u003e(\n params Func\u003cIEnumerable\u003cT\u003e, IEnumerable\u003cT\u003e\u003e[] stages)\n {\n","golden_completion":" Func\u003cIEnumerable\u003cT\u003e, IEnumerable\u003cT\u003e\u003e pipeline = x =\u003e x;\n foreach (var stage in stages)\n pipeline = Compose(pipeline, stage);\n return pipeline;\n","suffix":" }\n\n static void Main()\n {\n var pipe = BuildPipeline\u003cint\u003e(\n xs =\u003e xs.Where(x =\u003e x \u003e 0),\n xs =\u003e xs.Select(x =\u003e x * 2),\n xs =\u003e xs.OrderBy(x =\u003e x)\n );\n var result = pipe(new[] { -1, 3, 1, -2, 4, 2 }).ToList();\n if (!(result.Count == 4)) throw new Exception($\"count={result.Count}\");\n if (!(string.Join(\",\", result) == \"2,4,6,8\")) throw new Exception(string.Join(\",\", result));\n }\n}\n","assertions":"var identity = BuildPipeline\u003cint\u003e();\nvar r = identity(new[] { 3, 1, 2 }).ToList();\nif (!(r.Count == 3 \u0026\u0026 r[0] == 3)) throw new Exception(\"identity preserves order\");\nvar pipe2 = BuildPipeline\u003cstring\u003e(\n xs =\u003e xs.Where(x =\u003e x.Length \u003e 1),\n xs =\u003e xs.Select(x =\u003e x.ToUpper())\n);\nvar r2 = pipe2(new[] { \"a\", \"bb\", \"ccc\" }).ToList();\nif (!(r2.Count == 2 \u0026\u0026 r2[0] == \"BB\" \u0026\u0026 r2[1] == \"CCC\")) throw new Exception();\n","category":"syntax_completion"} {"id":"19","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static string Grade(int score) =\u003e score switch\n {\n","golden_completion":" \u003e= 90 and \u003c= 100 =\u003e \"A\",\n \u003e= 80 and \u003c 90 =\u003e \"B\",\n \u003e= 70 and \u003c 80 =\u003e \"C\",\n \u003e= 60 and \u003c 70 =\u003e \"D\",\n \u003e= 0 and \u003c 60 =\u003e \"F\",\n _ =\u003e throw new ArgumentOutOfRangeException()\n","suffix":" };\n\n static void Main()\n {\n if (!(Grade(95) == \"A\")) throw new Exception();\n if (!(Grade(85) == \"B\")) throw new Exception();\n if (!(Grade(75) == \"C\")) throw new Exception();\n if (!(Grade(65) == \"D\")) throw new Exception();\n if (!(Grade(50) == \"F\")) throw new Exception();\n if (!(Grade(100) == \"A\")) throw new Exception();\n if (!(Grade(0) == \"F\")) throw new Exception();\n }\n}\n","assertions":"if (!(Grade(90) == \"A\")) throw new Exception();\nif (!(Grade(89) == \"B\")) throw new Exception();\nif (!(Grade(80) == \"B\")) throw new Exception();\nif (!(Grade(79) == \"C\")) throw new Exception();\nif (!(Grade(70) == \"C\")) throw new Exception();\nif (!(Grade(69) == \"D\")) throw new Exception();\nif (!(Grade(60) == \"D\")) throw new Exception();\nif (!(Grade(59) == \"F\")) throw new Exception();\nbool threw = false;\ntry { Grade(-1); } catch (ArgumentOutOfRangeException) { threw = true; }\nif (!threw) throw new Exception(\"should throw for -1\");\n","category":"syntax_completion"} {"id":"20","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\nclass Program\n{\n static (int Words, int Chars, string Longest) TextStats(string[] lines)\n {\n return lines.Aggregate(\n (Words: 0, Chars: 0, Longest: \"\"),\n","golden_completion":" (acc, line) =\u003e\n {\n var words = line.Split(\u0027 \u0027, StringSplitOptions.RemoveEmptyEntries);\n var longest = words.Length \u003e 0\n ? words.OrderByDescending(w =\u003e w.Length).First()\n : acc.Longest;\n return (\n acc.Words + words.Length,\n acc.Chars + line.Length,\n longest.Length \u003e acc.Longest.Length ? longest : acc.Longest\n );\n }\n","suffix":" );\n }\n\n static void Main()\n {\n var result = TextStats(new[] { \"hello world\", \"this is a test\", \"extraordinary\" });\n if (!(result.Words == 7)) throw new Exception($\"words={result.Words}\");\n if (!(result.Chars == 38)) throw new Exception($\"chars={result.Chars}\");\n if (!(result.Longest == \"extraordinary\")) throw new Exception(result.Longest);\n }\n}\n","assertions":"var r2 = TextStats(new[] { \"a bb ccc\" });\nif (!(r2.Words == 3 \u0026\u0026 r2.Longest == \"ccc\")) throw new Exception();\nvar r3 = TextStats(new string[] { });\nif (!(r3.Words == 0 \u0026\u0026 r3.Chars == 0 \u0026\u0026 r3.Longest == \"\")) throw new Exception();\nvar r4 = TextStats(new[] { \"\", \"\" });\nif (!(r4.Words == 0 \u0026\u0026 r4.Chars == 0)) throw new Exception();\nvar r5 = TextStats(new[] { \"abc\", \"defgh\" });\nif (!(r5.Longest == \"defgh\")) throw new Exception();\n","category":"syntax_completion"} {"id":"21","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\n\nclass Program\n{\n static string Describe(int[] arr) =\u003e arr switch\n {\n [] =\u003e \"empty\",\n [var x] =\u003e $\"single:{x}\",\n [var a, var b] when a \u003e b =\u003e $\"desc-pair:{a},{b}\",\n [var a, var b] =\u003e $\"pair:{a},{b}\",\n","golden_completion":" [var first, .. var middle, var last] when first == last =\u003e $\"bookend:{first},mid={middle.Length}\",\n [\u003e= 0, .., \u003e= 0] =\u003e $\"non-neg:{arr.Length}\",\n [var h, ..] when h \u003c 0 =\u003e $\"neg-start:{h}\",\n _ =\u003e $\"other:{arr.Length}\"\n","suffix":" };\n\n static void Main()\n {\n if (!(Describe(Array.Empty\u003cint\u003e()) == \"empty\")) throw new Exception();\n if (!(Describe(new[] { 42 }) == \"single:42\")) throw new Exception();\n if (!(Describe(new[] { 5, 3 }) == \"desc-pair:5,3\")) throw new Exception();\n if (!(Describe(new[] { 3, 5 }) == \"pair:3,5\")) throw new Exception();\n if (!(Describe(new[] { 7, 1, 2, 7 }) == \"bookend:7,mid=2\")) throw new Exception();\n if (!(Describe(new[] { 1, 2, 3 }) == \"non-neg:3\")) throw new Exception();\n if (!(Describe(new[] { -1, 2, 3 }) == \"neg-start:-1\")) throw new Exception();\n }\n}\n","assertions":"if (!(Describe(new[] { 0, 99, 0 }) == \"bookend:0,mid=1\")) throw new Exception();\nif (!(Describe(new[] { 5, 5 }) == \"pair:5,5\")) throw new Exception(\"pair not desc, not bookend for len 2 with same\");\nif (!(Describe(new[] { 3, 0, 0, 3 }) == \"bookend:3,mid=2\")) throw new Exception();\nif (!(Describe(new[] { 0, 1, 2, 3, 4 }) == \"non-neg:5\")) throw new Exception();\nif (!(Describe(new[] { -5, -3, -1 }) == \"neg-start:-5\")) throw new Exception();\n","category":"syntax_completion"} {"id":"22","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Threading.Tasks;\n\nclass Program\n{\n static async IAsyncEnumerable\u003cint\u003e RangeAsync(int start, int count)\n {\n","golden_completion":" for (int i = 0; i \u003c count; i++)\n {\n await Task.Delay(1);\n yield return start + i;\n }\n","suffix":" }\n\n static async Task Main()\n {\n var items = new List\u003cint\u003e();\n await foreach (var item in RangeAsync(5, 4))\n {\n items.Add(item);\n }\n if (!(items.Count == 4)) throw new Exception($\"count={items.Count}\");\n if (!(items[0] == 5 \u0026\u0026 items[1] == 6 \u0026\u0026 items[2] == 7 \u0026\u0026 items[3] == 8)) throw new Exception();\n }\n}\n","assertions":"var empty = new List\u003cint\u003e();\nawait foreach (var x in RangeAsync(0, 0))\n empty.Add(x);\nif (!(empty.Count == 0)) throw new Exception();\nvar one = new List\u003cint\u003e();\nawait foreach (var x in RangeAsync(100, 1))\n one.Add(x);\nif (!(one.Count == 1 \u0026\u0026 one[0] == 100)) throw new Exception();\n","category":"syntax_completion"} {"id":"23","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n record HttpResponse(int StatusCode, string? Body, string ContentType);\n\n static string Categorize(HttpResponse r) =\u003e r switch\n {\n { StatusCode: 200 or 201, Body: not null, ContentType: \"application/json\" }\n =\u003e $\"json-ok:{r.Body.Length}\",\n { StatusCode: 200 or 201, Body: not null }\n =\u003e $\"ok:{r.ContentType}\",\n { StatusCode: 200 or 201, Body: null }\n =\u003e \"empty-ok\",\n","golden_completion":" { StatusCode: \u003e= 300 and \u003c 400 }\n =\u003e $\"redirect:{r.StatusCode}\",\n { StatusCode: \u003e= 400 and \u003c 500 }\n =\u003e $\"client-error:{r.StatusCode}\",\n { StatusCode: \u003e= 500 }\n =\u003e $\"server-error:{r.StatusCode}\",\n { StatusCode: 204 }\n =\u003e \"no-content\",\n _ =\u003e $\"unknown:{r.StatusCode}\"\n","suffix":" };\n\n static void Main()\n {\n if (!(Categorize(new(200, \"{}\", \"application/json\")) == \"json-ok:2\")) throw new Exception();\n if (!(Categorize(new(201, \"hi\", \"text/plain\")) == \"ok:text/plain\")) throw new Exception();\n if (!(Categorize(new(200, null, \"\")) == \"empty-ok\")) throw new Exception();\n if (!(Categorize(new(301, null, \"\")) == \"redirect:301\")) throw new Exception();\n if (!(Categorize(new(404, null, \"\")) == \"client-error:404\")) throw new Exception();\n if (!(Categorize(new(500, null, \"\")) == \"server-error:500\")) throw new Exception();\n }\n}\n","assertions":"if (!(Categorize(new(302, \"moved\", \"text/html\")) == \"redirect:302\")) throw new Exception();\nif (!(Categorize(new(399, null, \"\")) == \"redirect:399\")) throw new Exception();\nif (!(Categorize(new(400, null, \"\")) == \"client-error:400\")) throw new Exception();\nif (!(Categorize(new(499, null, \"\")) == \"client-error:499\")) throw new Exception();\nif (!(Categorize(new(503, null, \"\")) == \"server-error:503\")) throw new Exception();\nif (!(Categorize(new(100, null, \"\")) == \"unknown:100\")) throw new Exception();\n","category":"syntax_completion"} {"id":"24","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nstatic class Extensions\n{\n public static IEnumerable\u003cIGrouping\u003cTKey, T\u003e\u003e ChunkBy\u003cT, TKey\u003e(\n this IEnumerable\u003cT\u003e source, Func\u003cT, TKey\u003e keySelector)\n where TKey : notnull\n {\n using var enumerator = source.GetEnumerator();\n if (!enumerator.MoveNext()) yield break;\n var currentKey = keySelector(enumerator.Current);\n","golden_completion":" var group = new List\u003cT\u003e { enumerator.Current };\n while (enumerator.MoveNext())\n {\n var key = keySelector(enumerator.Current);\n if (EqualityComparer\u003cTKey\u003e.Default.Equals(key, currentKey))\n {\n group.Add(enumerator.Current);\n }\n else\n {\n yield return new Grouping\u003cTKey, T\u003e(currentKey, group);\n currentKey = key;\n group = new List\u003cT\u003e { enumerator.Current };\n }\n }\n yield return new Grouping\u003cTKey, T\u003e(currentKey, group);\n","suffix":" }\n}\n\nclass Grouping\u003cTKey, T\u003e : IGrouping\u003cTKey, T\u003e\n{\n private readonly List\u003cT\u003e _items;\n public TKey Key { get; }\n public Grouping(TKey key, List\u003cT\u003e items) { Key = key; _items = items; }\n public IEnumerator\u003cT\u003e GetEnumerator() =\u003e _items.GetEnumerator();\n System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() =\u003e GetEnumerator();\n}\n\nclass Program\n{\n static void Main()\n {\n var data = new[] { 1, 1, 2, 2, 2, 1, 1, 3 };\n var chunks = data.ChunkBy(x =\u003e x).ToList();\n if (!(chunks.Count == 4)) throw new Exception($\"count={chunks.Count}\");\n if (!(chunks[0].Key == 1 \u0026\u0026 chunks[0].Count() == 2)) throw new Exception();\n if (!(chunks[1].Key == 2 \u0026\u0026 chunks[1].Count() == 3)) throw new Exception();\n if (!(chunks[2].Key == 1 \u0026\u0026 chunks[2].Count() == 2)) throw new Exception();\n if (!(chunks[3].Key == 3 \u0026\u0026 chunks[3].Count() == 1)) throw new Exception();\n }\n}\n","assertions":"var empty = Array.Empty\u003cint\u003e().ChunkBy(x =\u003e x).ToList();\nif (!(empty.Count == 0)) throw new Exception();\nvar single = new[] { 5 }.ChunkBy(x =\u003e x).ToList();\nif (!(single.Count == 1 \u0026\u0026 single[0].Key == 5)) throw new Exception();\nvar strs = new[] { \"aa\", \"ab\", \"ba\", \"bb\" }.ChunkBy(x =\u003e x[0]).ToList();\nif (!(strs.Count == 2)) throw new Exception();\nif (!(strs[0].Key == \u0027a\u0027 \u0026\u0026 strs[0].Count() == 2)) throw new Exception();\nif (!(strs[1].Key == \u0027b\u0027 \u0026\u0026 strs[1].Count() == 2)) throw new Exception();\n","category":"syntax_completion"} {"id":"25","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n record Config(Dictionary\u003cstring, Dictionary\u003cstring, string\u003e\u003e? Sections);\n\n static string GetValue(Config? config, string section, string key, string fallback)\n {\n","golden_completion":" return config?.Sections?.GetValueOrDefault(section)?.GetValueOrDefault(key) ?? fallback;\n","suffix":" }\n\n static void Main()\n {\n var cfg = new Config(new() { [\"db\"] = new() { [\"host\"] = \"localhost\", [\"port\"] = \"5432\" } });\n if (!(GetValue(cfg, \"db\", \"host\", \"none\") == \"localhost\")) throw new Exception();\n if (!(GetValue(cfg, \"db\", \"timeout\", \"30\") == \"30\")) throw new Exception();\n if (!(GetValue(cfg, \"cache\", \"host\", \"n/a\") == \"n/a\")) throw new Exception();\n if (!(GetValue(null, \"db\", \"host\", \"def\") == \"def\")) throw new Exception();\n if (!(GetValue(new Config(null), \"db\", \"host\", \"def\") == \"def\")) throw new Exception();\n }\n}\n","assertions":"var cfg2 = new Config(new() { [\"a\"] = new() { [\"b\"] = \"\" } });\nif (!(GetValue(cfg2, \"a\", \"b\", \"x\") == \"\")) throw new Exception(\"empty string is not null\");\nif (!(GetValue(cfg2, \"a\", \"c\", \"y\") == \"y\")) throw new Exception();\nif (!(GetValue(cfg2, \"z\", \"b\", \"y\") == \"y\")) throw new Exception();\n","category":"syntax_completion"} {"id":"26","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Probe : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Probe(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass Program\n{\n static List\u003cstring\u003e Trace(bool fail)\n {\n var log = new List\u003cstring\u003e();\n using (var outer = new Probe(\"outer\", log))\n {\n log.Add(\"body:outer\");\n","golden_completion":" try\n {\n using (var middle = new Probe(\"middle\", log))\n {\n log.Add(\"body:middle\");\n using var inner = new Probe(\"inner\", log);\n log.Add(\"body:inner\");\n if (fail) throw new InvalidOperationException(\"boom\");\n }\n }\n catch (InvalidOperationException ex) when (ex.Message == \"boom\")\n {\n log.Add(\"caught:boom\");\n }\n finally\n {\n using var cleanup = new Probe(\"cleanup\", log);\n log.Add(\"body:cleanup\");\n }\n","suffix":" log.Add(\"after:try\");\n }\n return log;\n }\n\n static void Main()\n {\n var normal = Trace(false);\n if (!normal.Contains(\"body:cleanup\")) throw new Exception(\"normal cleanup missing\");\n if (!normal.Contains(\"after:try\")) throw new Exception(\"normal after missing\");\n if (!normal.Contains(\"close:outer\")) throw new Exception(\"normal outer close missing\");\n\n var failed = Trace(true);\n if (!failed.Contains(\"caught:boom\")) throw new Exception(\"catch missing\");\n if (!failed.Contains(\"body:cleanup\")) throw new Exception(\"failed cleanup missing\");\n if (!failed.Contains(\"close:outer\")) throw new Exception(\"failed outer close missing\");\n }\n}\n","assertions":"var normalOrder = string.Join(\"|\", Trace(false));\nif (normalOrder != \"open:outer|body:outer|open:middle|body:middle|open:inner|body:inner|close:inner|close:middle|open:cleanup|body:cleanup|close:cleanup|after:try|close:outer\") throw new Exception(\"normal order: \" + normalOrder);\nvar failedOrder = string.Join(\"|\", Trace(true));\nif (failedOrder != \"open:outer|body:outer|open:middle|body:middle|open:inner|body:inner|close:inner|close:middle|caught:boom|open:cleanup|body:cleanup|close:cleanup|after:try|close:outer\") throw new Exception(\"failed order: \" + failedOrder);\nif (Trace(false).Count(x =\u003e x.StartsWith(\"close:\")) != 4) throw new Exception(\"normal close count\");\nif (Trace(true).Count(x =\u003e x.StartsWith(\"close:\")) != 4) throw new Exception(\"failed close count\");\n","category":"syntax_completion"} {"id":"27","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Token : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Token(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass Program\n{\n static List\u003cstring\u003e Plan(bool shortPath, bool reopenRight)\n {\n var log = new List\u003cstring\u003e();\n using var root = new Token(\"root\", log);\n log.Add(\"start\");\n","golden_completion":" {\n using var branch = new Token(shortPath ? \"short\" : \"long\", log);\n log.Add($\"branch:{branch.Name}\");\n if (shortPath)\n {\n using var leaf = new Token(\"leaf\", log);\n log.Add(\"short-body\");\n }\n else\n {\n using var left = new Token(\"left\", log);\n {\n using var right = new Token(reopenRight ? \"right2\" : \"right\", log);\n log.Add(\"long-body\");\n }\n log.Add(\"after-right\");\n }\n }\n","suffix":" log.Add(\"end\");\n return log;\n }\n\n static void Main()\n {\n var shortLog = Plan(true, false);\n if (!shortLog.Contains(\"branch:short\")) throw new Exception(\"short branch missing\");\n if (!shortLog.Contains(\"short-body\")) throw new Exception(\"short body missing\");\n if (!shortLog.Contains(\"close:leaf\")) throw new Exception(\"leaf close missing\");\n\n var longLog = Plan(false, false);\n if (!longLog.Contains(\"branch:long\")) throw new Exception(\"long branch missing\");\n if (!longLog.Contains(\"long-body\")) throw new Exception(\"long body missing\");\n if (!longLog.Contains(\"after-right\")) throw new Exception(\"after right missing\");\n\n var reopened = Plan(false, true);\n if (!reopened.Contains(\"open:right2\")) throw new Exception(\"right2 open missing\");\n if (!reopened.Contains(\"close:right2\")) throw new Exception(\"right2 close missing\");\n }\n}\n","assertions":"var shortOrder = string.Join(\"|\", Plan(true, false));\nif (!(shortOrder == \"open:root|start|open:short|branch:short|open:leaf|short-body|close:leaf|close:short|end|close:root\")) throw new Exception(\"short order: \" + shortOrder);\nvar longOrder = string.Join(\"|\", Plan(false, false));\nif (!(longOrder == \"open:root|start|open:long|branch:long|open:left|open:right|long-body|close:right|after-right|close:left|close:long|end|close:root\")) throw new Exception(\"long order: \" + longOrder);\nvar reopenedOrder = string.Join(\"|\", Plan(false, true));\nif (!(reopenedOrder == \"open:root|start|open:long|branch:long|open:left|open:right2|long-body|close:right2|after-right|close:left|close:long|end|close:root\")) throw new Exception(\"reopened order: \" + reopenedOrder);\nif (!(Plan(false, false).Count(x =\u003e x.StartsWith(\"close:\")) == 4)) throw new Exception(\"long close count\");\n","category":"syntax_completion"} {"id":"28","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Threading.Tasks;\n\nclass AsyncProbe : IAsyncDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public AsyncProbe(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public async ValueTask DisposeAsync()\n {\n _log.Add($\"closing:{Name}\");\n await Task.Delay(1);\n _log.Add($\"closed:{Name}\");\n }\n}\n\nclass Program\n{\n static async Task\u003cList\u003cstring\u003e\u003e TraceAsync(bool fail)\n {\n var log = new List\u003cstring\u003e();\n await using (var outer = new AsyncProbe(\"outer\", log))\n {\n log.Add(\"body:outer\");\n","golden_completion":" try\n {\n await using (var middle = new AsyncProbe(\"middle\", log))\n {\n log.Add(\"body:middle\");\n await using var inner = new AsyncProbe(\"inner\", log);\n log.Add(\"body:inner\");\n if (fail) throw new InvalidOperationException(\"boom\");\n }\n }\n catch (InvalidOperationException ex) when (ex.Message == \"boom\")\n {\n log.Add(\"caught:boom\");\n }\n finally\n {\n await using var cleanup = new AsyncProbe(\"cleanup\", log);\n log.Add(\"body:cleanup\");\n }\n","suffix":" log.Add(\"after:try\");\n }\n return log;\n }\n\n static void Main()\n {\n var normal = TraceAsync(false).GetAwaiter().GetResult();\n if (!normal.Contains(\"body:middle\")) throw new Exception(\"normal middle missing\");\n if (!normal.Contains(\"closed:cleanup\")) throw new Exception(\"normal cleanup close missing\");\n if (!normal.Contains(\"closed:outer\")) throw new Exception(\"normal outer close missing\");\n\n var failed = TraceAsync(true).GetAwaiter().GetResult();\n if (!failed.Contains(\"caught:boom\")) throw new Exception(\"catch missing\");\n if (!failed.Contains(\"closed:inner\")) throw new Exception(\"failed inner close missing\");\n if (!failed.Contains(\"closed:cleanup\")) throw new Exception(\"failed cleanup close missing\");\n }\n}\n","assertions":"var normalOrder = string.Join(\"|\", TraceAsync(false).GetAwaiter().GetResult());\nif (!(normalOrder == \"open:outer|body:outer|open:middle|body:middle|open:inner|body:inner|closing:inner|closed:inner|closing:middle|closed:middle|open:cleanup|body:cleanup|closing:cleanup|closed:cleanup|after:try|closing:outer|closed:outer\")) throw new Exception(\"normal order: \" + normalOrder);\nvar failedOrder = string.Join(\"|\", TraceAsync(true).GetAwaiter().GetResult());\nif (!(failedOrder == \"open:outer|body:outer|open:middle|body:middle|open:inner|body:inner|closing:inner|closed:inner|closing:middle|closed:middle|caught:boom|open:cleanup|body:cleanup|closing:cleanup|closed:cleanup|after:try|closing:outer|closed:outer\")) throw new Exception(\"failed order: \" + failedOrder);\nif (!(TraceAsync(false).GetAwaiter().GetResult().Count(x =\u003e x.StartsWith(\"closed:\")) == 4)) throw new Exception(\"normal closed count\");\nif (!(TraceAsync(true).GetAwaiter().GetResult().Count(x =\u003e x.StartsWith(\"closed:\")) == 4)) throw new Exception(\"failed closed count\");\n","category":"syntax_completion"} {"id":"29","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Marker : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Marker(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass Program\n{\n static IEnumerable\u003cstring\u003e Walk(bool includeSecond, List\u003cstring\u003e log)\n {\n using var outer = new Marker(\"outer\", log);\n log.Add(\"ready\");\n","golden_completion":" yield return \"first\";\n if (includeSecond)\n {\n using (var inner = new Marker(\"inner\", log))\n {\n log.Add(\"inner-ready\");\n yield return \"second\";\n }\n }\n yield return \"last\";\n","suffix":" log.Add(\"done\");\n }\n\n static void Main()\n {\n var fullLog = new List\u003cstring\u003e();\n var full = Walk(true, fullLog).ToList();\n if (!full.SequenceEqual(new[] { \"first\", \"second\", \"last\" })) throw new Exception(\"full sequence\");\n if (!fullLog.Contains(\"close:inner\")) throw new Exception(\"inner close missing\");\n if (!fullLog.Contains(\"close:outer\")) throw new Exception(\"outer close missing\");\n\n var noSecondLog = new List\u003cstring\u003e();\n var noSecond = Walk(false, noSecondLog).ToList();\n if (!noSecond.SequenceEqual(new[] { \"first\", \"last\" })) throw new Exception(\"no-second sequence\");\n if (noSecondLog.Contains(\"open:inner\")) throw new Exception(\"inner should not open\");\n\n var earlyLog = new List\u003cstring\u003e();\n var first = Walk(true, earlyLog).Take(1).ToList();\n if (!first.SequenceEqual(new[] { \"first\" })) throw new Exception(\"early sequence\");\n if (!earlyLog.Contains(\"close:outer\")) throw new Exception(\"early outer close missing\");\n }\n}\n","assertions":"var fullLog2 = new List\u003cstring\u003e();\nvar full2 = Walk(true, fullLog2).ToList();\nvar fullOrder = string.Join(\"|\", fullLog2);\nif (!(fullOrder == \"open:outer|ready|open:inner|inner-ready|close:inner|done|close:outer\")) throw new Exception(\"full order: \" + fullOrder);\nvar noSecondLog2 = new List\u003cstring\u003e();\nvar noSecond2 = Walk(false, noSecondLog2).ToList();\nvar noSecondOrder = string.Join(\"|\", noSecondLog2);\nif (!(noSecondOrder == \"open:outer|ready|done|close:outer\")) throw new Exception(\"no-second order: \" + noSecondOrder);\nvar earlyLog2 = new List\u003cstring\u003e();\nvar early2 = Walk(true, earlyLog2).Take(1).ToList();\nvar earlyOrder = string.Join(\"|\", earlyLog2);\nif (!(earlyOrder == \"open:outer|ready|close:outer\")) throw new Exception(\"early order: \" + earlyOrder);\nif (!(full2.SequenceEqual(new[] { \"first\", \"second\", \"last\" }) \u0026\u0026 noSecond2.SequenceEqual(new[] { \"first\", \"last\" }) \u0026\u0026 early2.SequenceEqual(new[] { \"first\" }))) throw new Exception(\"sequence mismatch\");\n","category":"syntax_completion"} {"id":"30","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static IEnumerable\u003cstring\u003e BuildPipeline(IEnumerable\u003cint\u003e source, List\u003cstring\u003e log)\n {\n int seen = 0;\n","golden_completion":" var query = source\n .Select(x =\u003e\n {\n log.Add($\"select:{x}:{seen}\");\n seen++;\n return (Value: x, Seen: seen);\n })\n .Where(p =\u003e\n {\n log.Add($\"where:{p.Value}:{p.Seen}\");\n return p.Value % 2 == 1;\n })\n .Select(p =\u003e\n {\n log.Add($\"project:{p.Value}:{p.Seen}\");\n return $\"{p.Value}:{p.Seen}\";\n });\n log.Add(\"built\");\n return query;\n","suffix":" }\n\n static void Main()\n {\n var log = new List\u003cstring\u003e();\n var query = BuildPipeline(new[] { 1, 2, 3 }, log);\n if (!log.SequenceEqual(new[] { \"built\" })) throw new Exception(\"query should be deferred\");\n var first = query.Take(1).ToList();\n if (!first.SequenceEqual(new[] { \"1:1\" })) throw new Exception(\"first result\");\n if (!log.Contains(\"select:1:0\")) throw new Exception(\"select side effect missing\");\n if (!log.Contains(\"project:1:1\")) throw new Exception(\"project side effect missing\");\n }\n}\n","assertions":"var log2 = new List\u003cstring\u003e();\nvar nums = new List\u003cint\u003e { 1, 2, 3 };\nvar query2 = BuildPipeline(nums, log2);\nnums.Add(5);\nif (!(log2.SequenceEqual(new[] { \"built\" }))) throw new Exception(\"deferred build log: \" + string.Join(\"|\", log2));\nvar all = query2.ToList();\nif (!(all.SequenceEqual(new[] { \"1:1\", \"3:3\", \"5:4\" }))) throw new Exception(\"all results: \" + string.Join(\",\", all));\nvar expectedLog = \"built|select:1:0|where:1:1|project:1:1|select:2:1|where:2:2|select:3:2|where:3:3|project:3:3|select:5:3|where:5:4|project:5:4\";\nif (!(string.Join(\"|\", log2) == expectedLog)) throw new Exception(\"log order: \" + string.Join(\"|\", log2));\nvar again = query2.Take(1).ToList();\nif (!(again.SequenceEqual(new[] { \"1:5\" }))) throw new Exception(\"closure state on second enumeration: \" + string.Join(\",\", again));\n","category":"syntax_completion"} {"id":"31","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Probe : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Probe(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass Program\n{\n static List\u003cstring\u003e Route(int mode)\n {\n var log = new List\u003cstring\u003e();\n using var root = new Probe(\"root\", log);\n log.Add(\"start\");\n switch (mode)\n {\n case 0:\n","golden_completion":" {\n using var zero = new Probe(\"zero\", log);\n log.Add(\"case:0\");\n break;\n }\n case 1:\n {\n using var one = new Probe(\"one\", log);\n using var tail = new Probe(\"one-tail\", log);\n log.Add(\"case:1\");\n break;\n }\n","suffix":" case 2:\n log.Add(\"case:2\");\n break;\n default:\n log.Add(\"case:default\");\n break;\n }\n log.Add(\"after:switch\");\n return log;\n }\n\n static void Main()\n {\n var zero = Route(0);\n if (!zero.Contains(\"case:0\")) throw new Exception(\"zero case missing\");\n if (!zero.Contains(\"close:zero\")) throw new Exception(\"zero close missing\");\n var one = Route(1);\n if (!one.Contains(\"case:1\")) throw new Exception(\"one case missing\");\n if (!one.Contains(\"close:one-tail\")) throw new Exception(\"tail close missing\");\n var two = Route(2);\n if (!two.Contains(\"case:2\")) throw new Exception(\"two case missing\");\n }\n}\n","assertions":"var zeroOrder = string.Join(\"|\", Route(0));\nif (!(zeroOrder == \"open:root|start|open:zero|case:0|close:zero|after:switch|close:root\")) throw new Exception(\"zero order: \" + zeroOrder);\nvar oneOrder = string.Join(\"|\", Route(1));\nif (!(oneOrder == \"open:root|start|open:one|open:one-tail|case:1|close:one-tail|close:one|after:switch|close:root\")) throw new Exception(\"one order: \" + oneOrder);\nvar twoOrder = string.Join(\"|\", Route(2));\nif (!(twoOrder == \"open:root|start|case:2|after:switch|close:root\")) throw new Exception(\"two order: \" + twoOrder);\nvar defaultOrder = string.Join(\"|\", Route(99));\nif (!(defaultOrder == \"open:root|start|case:default|after:switch|close:root\")) throw new Exception(\"default order: \" + defaultOrder);\n","category":"syntax_completion"} {"id":"32","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Probe : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Probe(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass Program\n{\n static List\u003cstring\u003e Sweep(IEnumerable\u003cint\u003e values, int stopAt)\n {\n var log = new List\u003cstring\u003e();\n using var outer = new Probe(\"outer\", log);\n foreach (var value in values)\n {\n","golden_completion":" using var item = new Probe($\"item:{value}\", log);\n if (value \u003c 0)\n {\n log.Add($\"skip:{value}\");\n continue;\n }\n log.Add($\"visit:{value}\");\n if (value == stopAt)\n {\n log.Add($\"stop:{value}\");\n break;\n }\n using var tail = new Probe($\"tail:{value}\", log);\n log.Add($\"tail:{value}\");\n","suffix":" }\n log.Add(\"after:loop\");\n return log;\n }\n\n static void Main()\n {\n var log = Sweep(new[] { 1, -2, 3, 4 }, 3);\n if (!log.Contains(\"visit:1\")) throw new Exception(\"visit 1 missing\");\n if (!log.Contains(\"skip:-2\")) throw new Exception(\"skip missing\");\n if (!log.Contains(\"stop:3\")) throw new Exception(\"stop missing\");\n if (log.Contains(\"visit:4\")) throw new Exception(\"break did not stop\");\n if (!log.Contains(\"after:loop\")) throw new Exception(\"after missing\");\n }\n}\n","assertions":"var order = string.Join(\"|\", Sweep(new[] { 1, -2, 3, 4 }, 3));\nif (!(order == \"open:outer|open:item:1|visit:1|open:tail:1|tail:1|close:tail:1|close:item:1|open:item:-2|skip:-2|close:item:-2|open:item:3|visit:3|stop:3|close:item:3|after:loop|close:outer\")) throw new Exception(\"mixed order: \" + order);\nvar noStop = string.Join(\"|\", Sweep(new[] { 2, 4 }, 99));\nif (!(noStop == \"open:outer|open:item:2|visit:2|open:tail:2|tail:2|close:tail:2|close:item:2|open:item:4|visit:4|open:tail:4|tail:4|close:tail:4|close:item:4|after:loop|close:outer\")) throw new Exception(\"no-stop order: \" + noStop);\nvar immediate = string.Join(\"|\", Sweep(new[] { 5, 6 }, 5));\nif (!(immediate == \"open:outer|open:item:5|visit:5|stop:5|close:item:5|after:loop|close:outer\")) throw new Exception(\"immediate order: \" + immediate);\nif (!(Sweep(new[] { -1 }, 99).Count(x =\u003e x.StartsWith(\"close:\")) == 2)) throw new Exception(\"negative close count\");\n","category":"syntax_completion"} {"id":"33","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Probe : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Probe(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass Program\n{\n static List\u003cstring\u003e Handle(int mode)\n {\n var log = new List\u003cstring\u003e();\n using var outer = new Probe(\"outer\", log);\n try\n {\n log.Add(\"try:start\");\n","golden_completion":" using var first = new Probe(\"first\", log);\n log.Add($\"mode:{mode}\");\n if (mode == 1)\n {\n using var invalid = new Probe(\"invalid\", log);\n log.Add(\"throw:invalid\");\n throw new InvalidOperationException(\"one\");\n }\n if (mode == 2)\n {\n using var general = new Probe(\"general\", log);\n log.Add(\"throw:general\");\n throw new ApplicationException(\"two\");\n }\n log.Add(\"try:ok\");\n","suffix":" }\n catch (InvalidOperationException ex) when (ex.Message == \"one\")\n {\n log.Add(\"catch:invalid\");\n }\n catch (Exception ex)\n {\n log.Add($\"catch:{ex.GetType().Name}\");\n }\n log.Add(\"after:catch\");\n return log;\n }\n\n static void Main()\n {\n var ok = Handle(0);\n if (!ok.Contains(\"try:ok\")) throw new Exception(\"ok missing\");\n if (!ok.Contains(\"close:first\")) throw new Exception(\"first close missing\");\n\n var invalid = Handle(1);\n if (!invalid.Contains(\"catch:invalid\")) throw new Exception(\"invalid catch missing\");\n if (!invalid.Contains(\"close:invalid\")) throw new Exception(\"invalid close missing\");\n\n var general = Handle(2);\n if (!general.Contains(\"catch:ApplicationException\")) throw new Exception(\"general catch missing\");\n if (!general.Contains(\"close:general\")) throw new Exception(\"general close missing\");\n }\n}\n","assertions":"var okOrder = string.Join(\"|\", Handle(0));\nif (!(okOrder == \"open:outer|try:start|open:first|mode:0|try:ok|close:first|after:catch|close:outer\")) throw new Exception(\"ok order: \" + okOrder);\nvar invalidOrder = string.Join(\"|\", Handle(1));\nif (!(invalidOrder == \"open:outer|try:start|open:first|mode:1|open:invalid|throw:invalid|close:invalid|close:first|catch:invalid|after:catch|close:outer\")) throw new Exception(\"invalid order: \" + invalidOrder);\nvar generalOrder = string.Join(\"|\", Handle(2));\nif (!(generalOrder == \"open:outer|try:start|open:first|mode:2|open:general|throw:general|close:general|close:first|catch:ApplicationException|after:catch|close:outer\")) throw new Exception(\"general order: \" + generalOrder);\nif (!(Handle(1).IndexOf(\"catch:invalid\") \u003e Handle(1).IndexOf(\"close:first\"))) throw new Exception(\"catch before disposal\");\n","category":"syntax_completion"} {"id":"34","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static void Main()\n {\n var words = new[] { \"hello\", \"world\", \"foo\", \"bar\", \"baz\" };\n var result = words.Aggregate(\n new { Count = 0, Longest = \"\", TotalLen = 0 },\n (acc, word) =\u003e new\n {\n Count = acc.Count + 1,\n","suffix":"\n },\n acc =\u003e $\"{acc.Count}:{acc.Longest}:{acc.TotalLen}\");\n\n if (!(result == \"5:hello:19\")) throw new Exception($\"got: {result}\");\n }\n}\n","golden_completion":" Longest = word.Length \u003e acc.Longest.Length ? word : acc.Longest,\n TotalLen = acc.TotalLen + word.Length","assertions":"","category":"syntax_completion"} {"id":"35","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Threading.Tasks;\n\nclass AsyncMarker : IAsyncDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public AsyncMarker(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public async ValueTask DisposeAsync()\n {\n _log.Add($\"closing:{Name}\");\n await Task.Delay(1);\n _log.Add($\"closed:{Name}\");\n }\n}\n\nclass Program\n{\n static async IAsyncEnumerable\u003cint\u003e Stream(List\u003cstring\u003e log, int limit)\n {\n await using var outer = new AsyncMarker(\"outer\", log);\n log.Add(\"ready\");\n","golden_completion":" for (int i = 0; i \u003c limit; i++)\n {\n await using var item = new AsyncMarker($\"item:{i}\", log);\n log.Add($\"yield:{i}\");\n await Task.Delay(1);\n yield return i;\n }\n","suffix":" log.Add(\"done\");\n }\n\n static async Task\u003cList\u003cint\u003e\u003e TakeAsync(IAsyncEnumerable\u003cint\u003e source, int max)\n {\n var result = new List\u003cint\u003e();\n await foreach (var item in source)\n {\n result.Add(item);\n if (result.Count == max) break;\n }\n return result;\n }\n\n static void Main()\n {\n var fullLog = new List\u003cstring\u003e();\n var all = TakeAsync(Stream(fullLog, 2), 10).GetAwaiter().GetResult();\n if (!all.SequenceEqual(new[] { 0, 1 })) throw new Exception(\"full items\");\n if (!fullLog.Contains(\"done\")) throw new Exception(\"done missing\");\n if (!fullLog.Contains(\"closed:outer\")) throw new Exception(\"outer close missing\");\n\n var earlyLog = new List\u003cstring\u003e();\n var first = TakeAsync(Stream(earlyLog, 3), 1).GetAwaiter().GetResult();\n if (!first.SequenceEqual(new[] { 0 })) throw new Exception(\"early items\");\n if (!earlyLog.Contains(\"closed:item:0\")) throw new Exception(\"early item close missing\");\n if (!earlyLog.Contains(\"closed:outer\")) throw new Exception(\"early outer close missing\");\n }\n}\n","assertions":"var fullLog2 = new List\u003cstring\u003e();\nvar all2 = TakeAsync(Stream(fullLog2, 2), 10).GetAwaiter().GetResult();\nvar fullOrder = string.Join(\"|\", fullLog2);\nif (!(fullOrder == \"open:outer|ready|open:item:0|yield:0|closing:item:0|closed:item:0|open:item:1|yield:1|closing:item:1|closed:item:1|done|closing:outer|closed:outer\")) throw new Exception(\"full order: \" + fullOrder);\nvar earlyLog2 = new List\u003cstring\u003e();\nvar first2 = TakeAsync(Stream(earlyLog2, 3), 1).GetAwaiter().GetResult();\nvar earlyOrder = string.Join(\"|\", earlyLog2);\nif (!(earlyOrder == \"open:outer|ready|open:item:0|yield:0|closing:item:0|closed:item:0|closing:outer|closed:outer\")) throw new Exception(\"early order: \" + earlyOrder);\nvar emptyLog = new List\u003cstring\u003e();\nvar empty = TakeAsync(Stream(emptyLog, 0), 10).GetAwaiter().GetResult();\nif (!(empty.Count == 0 \u0026\u0026 string.Join(\"|\", emptyLog) == \"open:outer|ready|done|closing:outer|closed:outer\")) throw new Exception(\"empty order: \" + string.Join(\"|\", emptyLog));\nif (!(all2.SequenceEqual(new[] { 0, 1 }) \u0026\u0026 first2.SequenceEqual(new[] { 0 }))) throw new Exception(\"async sequence mismatch\");\n","category":"syntax_completion"} {"id":"36","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Marker : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Marker(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass Program\n{\n static IEnumerable\u003cstring\u003e Scan(IEnumerable\u003cint\u003e values, List\u003cstring\u003e log)\n {\n using var outer = new Marker(\"outer\", log);\n log.Add(\"scan:start\");\n","golden_completion":" foreach (var value in values)\n {\n using var item = new Marker($\"item:{value}\", log);\n if (value \u003c 0)\n {\n log.Add($\"stop:{value}\");\n yield break;\n }\n log.Add($\"yield:{value}\");\n yield return $\"ok:{value}\";\n }\n","suffix":" log.Add(\"scan:done\");\n }\n\n static void Main()\n {\n var goodLog = new List\u003cstring\u003e();\n var good = Scan(new[] { 1, 2 }, goodLog).ToList();\n if (!good.SequenceEqual(new[] { \"ok:1\", \"ok:2\" })) throw new Exception(\"good sequence\");\n if (!goodLog.Contains(\"scan:done\")) throw new Exception(\"done missing\");\n if (!goodLog.Contains(\"close:outer\")) throw new Exception(\"outer close missing\");\n\n var stopLog = new List\u003cstring\u003e();\n var stopped = Scan(new[] { 1, -5, 2 }, stopLog).ToList();\n if (!stopped.SequenceEqual(new[] { \"ok:1\" })) throw new Exception(\"stopped sequence\");\n if (!stopLog.Contains(\"stop:-5\")) throw new Exception(\"stop missing\");\n if (stopLog.Contains(\"scan:done\")) throw new Exception(\"done should not run after yield break\");\n }\n}\n","assertions":"var goodLog2 = new List\u003cstring\u003e();\nvar good2 = Scan(new[] { 1, 2 }, goodLog2).ToList();\nvar goodOrder = string.Join(\"|\", goodLog2);\nif (!(goodOrder == \"open:outer|scan:start|open:item:1|yield:1|close:item:1|open:item:2|yield:2|close:item:2|scan:done|close:outer\")) throw new Exception(\"good order: \" + goodOrder);\nvar stopLog2 = new List\u003cstring\u003e();\nvar stopped2 = Scan(new[] { 1, -5, 2 }, stopLog2).ToList();\nvar stopOrder = string.Join(\"|\", stopLog2);\nif (!(stopOrder == \"open:outer|scan:start|open:item:1|yield:1|close:item:1|open:item:-5|stop:-5|close:item:-5|close:outer\")) throw new Exception(\"stop order: \" + stopOrder);\nvar emptyLog = new List\u003cstring\u003e();\nvar empty = Scan(Array.Empty\u003cint\u003e(), emptyLog).ToList();\nif (!(empty.Count == 0 \u0026\u0026 string.Join(\"|\", emptyLog) == \"open:outer|scan:start|scan:done|close:outer\")) throw new Exception(\"empty order: \" + string.Join(\"|\", emptyLog));\nif (!(good2.SequenceEqual(new[] { \"ok:1\", \"ok:2\" }) \u0026\u0026 stopped2.SequenceEqual(new[] { \"ok:1\" }))) throw new Exception(\"scan outputs\");\n","category":"syntax_completion"} {"id":"37","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Marker : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Marker(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass Program\n{\n static IEnumerable\u003cint\u003e Numbers(List\u003cstring\u003e log, bool failAfterFirst)\n {\n using var outer = new Marker(\"outer\", log);\n try\n {\n","golden_completion":" using var inner = new Marker(\"inner\", log);\n log.Add(\"before:first\");\n yield return 1;\n if (failAfterFirst)\n {\n log.Add(\"throw:after-first\");\n throw new InvalidOperationException(\"after-first\");\n }\n log.Add(\"before:second\");\n yield return 2;\n","suffix":" }\n finally\n {\n log.Add(\"finally:block\");\n }\n }\n\n static void Main()\n {\n var okLog = new List\u003cstring\u003e();\n var ok = Numbers(okLog, false).ToList();\n if (!ok.SequenceEqual(new[] { 1, 2 })) throw new Exception(\"ok numbers\");\n if (!okLog.Contains(\"finally:block\")) throw new Exception(\"ok finally missing\");\n if (!okLog.Contains(\"close:outer\")) throw new Exception(\"ok outer close missing\");\n\n var failLog = new List\u003cstring\u003e();\n try\n {\n Numbers(failLog, true).ToList();\n throw new Exception(\"expected failure\");\n }\n catch (InvalidOperationException ex) when (ex.Message == \"after-first\")\n {\n failLog.Add(\"caught:after-first\");\n }\n if (!failLog.Contains(\"throw:after-first\")) throw new Exception(\"throw log missing\");\n if (!failLog.Contains(\"finally:block\")) throw new Exception(\"fail finally missing\");\n }\n}\n","assertions":"var okLog2 = new List\u003cstring\u003e();\nvar ok2 = Numbers(okLog2, false).ToList();\nvar okOrder = string.Join(\"|\", okLog2);\nif (!(okOrder == \"open:outer|open:inner|before:first|before:second|close:inner|finally:block|close:outer\")) throw new Exception(\"ok order: \" + okOrder);\nvar failLog2 = new List\u003cstring\u003e();\ntry\n{\n Numbers(failLog2, true).ToList();\n throw new Exception(\"expected hidden failure\");\n}\ncatch (InvalidOperationException ex) when (ex.Message == \"after-first\")\n{\n failLog2.Add(\"caught:after-first\");\n}\nvar failOrder = string.Join(\"|\", failLog2);\nif (!(failOrder == \"open:outer|open:inner|before:first|throw:after-first|close:inner|finally:block|close:outer|caught:after-first\")) throw new Exception(\"fail order: \" + failOrder);\nvar earlyLog = new List\u003cstring\u003e();\nvar early = Numbers(earlyLog, false).Take(1).ToList();\nif (!(string.Join(\"|\", earlyLog) == \"open:outer|open:inner|before:first|close:inner|finally:block|close:outer\")) throw new Exception(\"early order: \" + string.Join(\"|\", earlyLog));\n","category":"syntax_completion"} {"id":"38","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static void Main()\n {\n var students = new[]\n {\n new { Name = \"Alice\", Grade = 90 },\n new { Name = \"Bob\", Grade = 75 },\n new { Name = \"Carol\", Grade = 88 },\n new { Name = \"Dave\", Grade = 65 }\n };\n\n var letterGrades = students.ToDictionary(\n s =\u003e s.Name,\n","suffix":"\n );\n\n if (!(letterGrades[\"Alice\"] == \"A\")) throw new Exception($\"alice={letterGrades[\"Alice\"]}\");\n if (!(letterGrades[\"Bob\"] == \"C\")) throw new Exception($\"bob={letterGrades[\"Bob\"]}\");\n if (!(letterGrades[\"Carol\"] == \"B\")) throw new Exception($\"carol={letterGrades[\"Carol\"]}\");\n if (!(letterGrades[\"Dave\"] == \"D\")) throw new Exception($\"dave={letterGrades[\"Dave\"]}\");\n }\n}\n","golden_completion":" s =\u003e s.Grade \u003e= 90 ? \"A\" : s.Grade \u003e= 80 ? \"B\" : s.Grade \u003e= 70 ? \"C\" : \"D\" ","assertions":"","category":"syntax_completion"} {"id":"39","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Threading.Tasks;\n\nclass AsyncMarker : IAsyncDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public AsyncMarker(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public async ValueTask DisposeAsync()\n {\n _log.Add($\"closing:{Name}\");\n await Task.Delay(1);\n _log.Add($\"closed:{Name}\");\n }\n}\n\nclass Program\n{\n static async IAsyncEnumerable\u003cstring\u003e ScanAsync(IEnumerable\u003cint\u003e values, List\u003cstring\u003e log)\n {\n await using var outer = new AsyncMarker(\"outer\", log);\n log.Add(\"scan:start\");\n","golden_completion":" foreach (var value in values)\n {\n await using var item = new AsyncMarker($\"item:{value}\", log);\n if (value \u003c 0)\n {\n log.Add($\"stop:{value}\");\n yield break;\n }\n log.Add($\"yield:{value}\");\n await Task.Delay(1);\n yield return $\"ok:{value}\";\n }\n","suffix":" log.Add(\"scan:done\");\n }\n\n static async Task\u003cList\u003cstring\u003e\u003e CollectAsync(IAsyncEnumerable\u003cstring\u003e source)\n {\n var result = new List\u003cstring\u003e();\n await foreach (var item in source)\n result.Add(item);\n return result;\n }\n\n static void Main()\n {\n var goodLog = new List\u003cstring\u003e();\n var good = CollectAsync(ScanAsync(new[] { 1, 2 }, goodLog)).GetAwaiter().GetResult();\n if (!good.SequenceEqual(new[] { \"ok:1\", \"ok:2\" })) throw new Exception(\"good sequence\");\n if (!goodLog.Contains(\"scan:done\")) throw new Exception(\"done missing\");\n if (!goodLog.Contains(\"closed:outer\")) throw new Exception(\"outer close missing\");\n\n var stopLog = new List\u003cstring\u003e();\n var stopped = CollectAsync(ScanAsync(new[] { 1, -5, 2 }, stopLog)).GetAwaiter().GetResult();\n if (!stopped.SequenceEqual(new[] { \"ok:1\" })) throw new Exception(\"stopped sequence\");\n if (!stopLog.Contains(\"stop:-5\")) throw new Exception(\"stop missing\");\n if (stopLog.Contains(\"scan:done\")) throw new Exception(\"done should not run after yield break\");\n }\n}\n","assertions":"var goodLog2 = new List\u003cstring\u003e();\nvar good2 = CollectAsync(ScanAsync(new[] { 1, 2 }, goodLog2)).GetAwaiter().GetResult();\nvar goodOrder = string.Join(\"|\", goodLog2);\nif (!(goodOrder == \"open:outer|scan:start|open:item:1|yield:1|closing:item:1|closed:item:1|open:item:2|yield:2|closing:item:2|closed:item:2|scan:done|closing:outer|closed:outer\")) throw new Exception(\"good order: \" + goodOrder);\nvar stopLog2 = new List\u003cstring\u003e();\nvar stopped2 = CollectAsync(ScanAsync(new[] { 1, -5, 2 }, stopLog2)).GetAwaiter().GetResult();\nvar stopOrder = string.Join(\"|\", stopLog2);\nif (!(stopOrder == \"open:outer|scan:start|open:item:1|yield:1|closing:item:1|closed:item:1|open:item:-5|stop:-5|closing:item:-5|closed:item:-5|closing:outer|closed:outer\")) throw new Exception(\"stop order: \" + stopOrder);\nvar emptyLog = new List\u003cstring\u003e();\nvar empty = CollectAsync(ScanAsync(Array.Empty\u003cint\u003e(), emptyLog)).GetAwaiter().GetResult();\nif (!(empty.Count == 0 \u0026\u0026 string.Join(\"|\", emptyLog) == \"open:outer|scan:start|scan:done|closing:outer|closed:outer\")) throw new Exception(\"empty order: \" + string.Join(\"|\", emptyLog));\nif (!(good2.SequenceEqual(new[] { \"ok:1\", \"ok:2\" }) \u0026\u0026 stopped2.SequenceEqual(new[] { \"ok:1\" }))) throw new Exception(\"async scan outputs\");\n","category":"syntax_completion"} {"id":"40","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Marker : IDisposable\n{\n private readonly List\u003cstring\u003e _log;\n public string Name { get; }\n public Marker(string name, List\u003cstring\u003e log) { Name = name; _log = log; _log.Add($\"open:{name}\"); }\n public void Dispose() { _log.Add($\"close:{Name}\"); }\n}\n\nclass TrackedEnumerator\u003cT\u003e : IEnumerator\u003cT\u003e\n{\n private readonly IEnumerator\u003cT\u003e _inner;\n private readonly List\u003cstring\u003e _log;\n public TrackedEnumerator(IEnumerator\u003cT\u003e inner, List\u003cstring\u003e log) { _inner = inner; _log = log; _log.Add(\"open:enumerator\"); }\n public T Current =\u003e _inner.Current;\n object IEnumerator.Current =\u003e Current!;\n public bool MoveNext() =\u003e _inner.MoveNext();\n public void Reset() =\u003e _inner.Reset();\n public void Dispose() { _log.Add(\"close:enumerator\"); _inner.Dispose(); }\n}\n\nclass Program\n{\n static IEnumerable\u003cint\u003e Replay(IEnumerable\u003cint\u003e source, List\u003cstring\u003e log)\n {\n using var enumerator = new TrackedEnumerator\u003cint\u003e(source.GetEnumerator(), log);\n log.Add(\"created\");\n","golden_completion":" while (enumerator.MoveNext())\n {\n using var item = new Marker($\"item:{enumerator.Current}\", log);\n log.Add($\"yield:{enumerator.Current}\");\n yield return enumerator.Current;\n }\n","suffix":" log.Add(\"done\");\n }\n\n static void Main()\n {\n var fullLog = new List\u003cstring\u003e();\n var full = Replay(new[] { 4, 5 }, fullLog).ToList();\n if (!full.SequenceEqual(new[] { 4, 5 })) throw new Exception(\"full sequence\");\n if (!fullLog.Contains(\"done\")) throw new Exception(\"done missing\");\n if (!fullLog.Contains(\"close:enumerator\")) throw new Exception(\"enumerator close missing\");\n\n var earlyLog = new List\u003cstring\u003e();\n var early = Replay(new[] { 7, 8 }, earlyLog).Take(1).ToList();\n if (!early.SequenceEqual(new[] { 7 })) throw new Exception(\"early sequence\");\n if (!earlyLog.Contains(\"close:item:7\")) throw new Exception(\"early item close missing\");\n if (!earlyLog.Contains(\"close:enumerator\")) throw new Exception(\"early enumerator close missing\");\n if (earlyLog.Contains(\"done\")) throw new Exception(\"done should not run on early disposal\");\n }\n}\n","assertions":"var fullLog2 = new List\u003cstring\u003e();\nvar full2 = Replay(new[] { 4, 5 }, fullLog2).ToList();\nvar fullOrder = string.Join(\"|\", fullLog2);\nif (!(fullOrder == \"open:enumerator|created|open:item:4|yield:4|close:item:4|open:item:5|yield:5|close:item:5|done|close:enumerator\")) throw new Exception(\"full order: \" + fullOrder);\nvar earlyLog2 = new List\u003cstring\u003e();\nvar early2 = Replay(new[] { 7, 8 }, earlyLog2).Take(1).ToList();\nvar earlyOrder = string.Join(\"|\", earlyLog2);\nif (!(earlyOrder == \"open:enumerator|created|open:item:7|yield:7|close:item:7|close:enumerator\")) throw new Exception(\"early order: \" + earlyOrder);\nvar emptyLog = new List\u003cstring\u003e();\nvar empty = Replay(Array.Empty\u003cint\u003e(), emptyLog).ToList();\nif (!(empty.Count == 0 \u0026\u0026 string.Join(\"|\", emptyLog) == \"open:enumerator|created|done|close:enumerator\")) throw new Exception(\"empty order: \" + string.Join(\"|\", emptyLog));\nif (!(full2.SequenceEqual(new[] { 4, 5 }) \u0026\u0026 early2.SequenceEqual(new[] { 7 }))) throw new Exception(\"replay outputs\");\n","category":"syntax_completion"} {"id":"41","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n static void Main()\n {\n var people = new[]\n {\n new { First = \"John\", Last = \"Doe\", Age = 30 },\n new { First = \"Jane\", Last = \"Smith\", Age = 25 },\n new { First = \"Bob\", Last = \"Jones\", Age = 35 }\n };\n\n var labels = people\n .OrderBy(p =\u003e p.Age)\n .Select((p, i) =\u003e\n","suffix":"\n )\n .ToList();\n\n if (!(labels[0] == \"1. Smith, Jane (25)\")) throw new Exception($\"l0={labels[0]}\");\n if (!(labels[1] == \"2. Doe, John (30)\")) throw new Exception($\"l1={labels[1]}\");\n if (!(labels[2] == \"3. Jones, Bob (35)\")) throw new Exception($\"l2={labels[2]}\");\n }\n}\n","golden_completion":" $\"{i + 1}. {p.Last}, {p.First} ({p.Age})\" ","assertions":"","category":"syntax_completion"} {"id":"42","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\n\nabstract record Shape;\nrecord Circle(double Radius) : Shape;\nrecord Rect(double W, double H) : Shape;\nrecord Group(Shape[] Items) : Shape;\n\nclass Program\n{\n static double Area(Shape s) =\u003e s switch\n {\n Circle { Radius: var r } =\u003e Math.PI * r * r,\n Rect { W: var w, H: var h } when w == h =\u003e w * w,\n Rect { W: var w, H: var h } =\u003e w * h,","suffix":"\n _ =\u003e 0\n };\n\n static void Main()\n {\n var c = new Circle(1);\n var r = new Rect(3, 4);\n var sq = new Rect(5, 5);\n var g = new Group(new Shape[] { c, r, sq });\n\n if (!(Math.Abs(Area(c) - Math.PI) \u003c 0.001)) throw new Exception($\"circle={Area(c)}\");\n if (!(Math.Abs(Area(r) - 12) \u003c 0.001)) throw new Exception($\"rect={Area(r)}\");\n if (!(Math.Abs(Area(sq) - 25) \u003c 0.001)) throw new Exception($\"square={Area(sq)}\");\n double gArea = Area(g);\n double expected = Math.PI + 12 + 25;\n if (!(Math.Abs(gArea - expected) \u003c 0.001)) throw new Exception($\"group={gArea} expected={expected}\");\n }\n}\n","golden_completion":" Group { Items: var items } =\u003e items.Sum(i =\u003e Area(i)),","assertions":"","category":"syntax_completion"} {"id":"43","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Threading.Tasks;\n\nclass Program\n{\n static async Task\u003cint\u003e ComputeAsync(int x)\n {\n await Task.Delay(1);\n if (x \u003c 0) throw new ArgumentException(\"negative\");\n return x * x;\n }\n\n static async Task Main()\n {\n var results = new List\u003cstring\u003e();\n var inputs = new[] { 3, -1, 4 };\n\n foreach (var n in inputs)\n {\n try\n {\n","suffix":"\n }\n catch (ArgumentException ex)\n {\n results.Add($\"err:{ex.Message}\");\n }\n }\n\n if (!(results.Count == 3)) throw new Exception($\"count={results.Count}\");\n if (!(results[0] == \"ok:9\")) throw new Exception($\"r0={results[0]}\");\n if (!(results[1] == \"err:negative\")) throw new Exception($\"r1={results[1]}\");\n if (!(results[2] == \"ok:16\")) throw new Exception($\"r2={results[2]}\");\n }\n}\n","golden_completion":" var val = await ComputeAsync(n);\n results.Add($\"ok:{val}\");","assertions":"","category":"syntax_completion"} {"id":"44","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Config\n{\n public Dictionary\u003cstring, string\u003e? Settings { get; set; }\n}\n\nclass Program\n{\n static string GetSetting(Config? cfg, string key, string fallback)\n {\n","suffix":"\n }\n\n static void Main()\n {\n var cfg1 = new Config { Settings = new() { [\"theme\"] = \"dark\" } };\n Config? cfg2 = null;\n var cfg3 = new Config { Settings = null };\n\n if (!(GetSetting(cfg1, \"theme\", \"light\") == \"dark\")) throw new Exception(\"t1\");\n if (!(GetSetting(cfg1, \"missing\", \"n/a\") == \"n/a\")) throw new Exception(\"t2\");\n if (!(GetSetting(cfg2, \"theme\", \"default\") == \"default\")) throw new Exception(\"t3\");\n if (!(GetSetting(cfg3, \"theme\", \"default\") == \"default\")) throw new Exception(\"t4\");\n }\n}\n","golden_completion":" return cfg?.Settings?.TryGetValue(key, out var val) == true ? val : fallback;","assertions":"","category":"syntax_completion"} {"id":"45","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static string ClassifyPoint((int X, int Y) point) =\u003e point switch\n {\n (0, 0) =\u003e \"origin\",\n (var x, 0) when x \u003e 0 =\u003e \"positive-x-axis\",\n (var x, 0) when x \u003c 0 =\u003e \"negative-x-axis\",\n (0, var y) when y \u003e 0 =\u003e \"positive-y-axis\",\n","suffix":"\n (var x, var y) when x \u003e 0 \u0026\u0026 y \u003e 0 =\u003e \"Q1\",\n (var x, var y) when x \u003c 0 \u0026\u0026 y \u003e 0 =\u003e \"Q2\",\n (var x, var y) when x \u003c 0 \u0026\u0026 y \u003c 0 =\u003e \"Q3\",\n _ =\u003e \"Q4\"\n };\n\n static void Main()\n {\n if (!(ClassifyPoint((0, 0)) == \"origin\")) throw new Exception(\"t1\");\n if (!(ClassifyPoint((5, 0)) == \"positive-x-axis\")) throw new Exception(\"t2\");\n if (!(ClassifyPoint((-3, 0)) == \"negative-x-axis\")) throw new Exception(\"t3\");\n if (!(ClassifyPoint((0, 7)) == \"positive-y-axis\")) throw new Exception(\"t4\");\n if (!(ClassifyPoint((0, -2)) == \"negative-y-axis\")) throw new Exception(\"t5\");\n if (!(ClassifyPoint((1, 1)) == \"Q1\")) throw new Exception(\"t6\");\n if (!(ClassifyPoint((-1, 1)) == \"Q2\")) throw new Exception(\"t7\");\n if (!(ClassifyPoint((-1, -1)) == \"Q3\")) throw new Exception(\"t8\");\n if (!(ClassifyPoint((1, -1)) == \"Q4\")) throw new Exception(\"t9\");\n }\n}\n","golden_completion":" (0, var y) when y \u003c 0 =\u003e \"negative-y-axis\",","assertions":"","category":"syntax_completion"} {"id":"46","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\n\nclass Program\n{\n static void Main()\n {\n var funcs = new List\u003cFunc\u003cint, int\u003e\u003e();\n for (int i = 0; i \u003c 4; i++)\n {\n int captured = i;\n funcs.Add(x =\u003e\n {\n Func\u003cint, int\u003e inner = y =\u003e\n {\n","suffix":"\n };\n return inner(x) + captured;\n });\n }\n\n if (!(funcs[0](10) == 0)) throw new Exception($\"f0={funcs[0](10)}\");\n if (!(funcs[1](10) == 11)) throw new Exception($\"f1={funcs[1](10)}\");\n if (!(funcs[2](10) == 22)) throw new Exception($\"f2={funcs[2](10)}\");\n if (!(funcs[3](10) == 33)) throw new Exception($\"f3={funcs[3](10)}\");\n }\n}\n","golden_completion":" return y * captured;","assertions":"","category":"syntax_completion"} {"id":"47","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Department\n{\n public string Name { get; set; } = \"\";\n public List\u003cstring\u003e Members { get; set; } = new();\n}\n\nclass Program\n{\n static void Main()\n {\n var depts = new List\u003cDepartment\u003e\n {\n new() { Name = \"Eng\", Members = { \"Alice\", \"Bob\" } },\n","suffix":"\n };\n\n var allMembers = depts.SelectMany(d =\u003e d.Members).OrderBy(m =\u003e m).ToList();\n if (!(allMembers.Count == 5)) throw new Exception($\"count={allMembers.Count}\");\n if (!(allMembers[0] == \"Alice\")) throw new Exception($\"m0={allMembers[0]}\");\n if (!(allMembers[1] == \"Bob\")) throw new Exception($\"m1={allMembers[1]}\");\n if (!(allMembers[2] == \"Carol\")) throw new Exception($\"m2={allMembers[2]}\");\n if (!(allMembers[3] == \"Dave\")) throw new Exception($\"m3={allMembers[3]}\");\n if (!(allMembers[4] == \"Eve\")) throw new Exception($\"m4={allMembers[4]}\");\n }\n}\n","golden_completion":" new() { Name = \"Sales\", Members = { \"Carol\", \"Dave\" } },\n new() { Name = \"HR\", Members = { \"Eve\" } }","assertions":"","category":"syntax_completion"} {"id":"48","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\n\ninterface ITransform\u003cin TIn, out TOut\u003e\n{\n TOut Apply(TIn input);\n}\n\nclass DoubleToString : ITransform\u003cdouble, string\u003e\n{\n public string Apply(double input) =\u003e input.ToString(\"F1\");\n}\n\nclass IntToDouble : ITransform\u003cint, double\u003e\n{\n public double Apply(int input) =\u003e input * 2.5;\n}\n\nclass Composed\u003cA, B, C\u003e : ITransform\u003cA, C\u003e\n{\n private readonly ITransform\u003cA, B\u003e _first;\n private readonly ITransform\u003cB, C\u003e _second;\n public Composed(ITransform\u003cA, B\u003e f, ITransform\u003cB, C\u003e s) { _first = f; _second = s; }\n","suffix":"\n}\n\nclass Program\n{\n static void Main()\n {\n var intToStr = new Composed\u003cint, double, string\u003e(new IntToDouble(), new DoubleToString());\n if (!(intToStr.Apply(4) == \"10.0\")) throw new Exception($\"4-\u003e{intToStr.Apply(4)}\");\n if (!(intToStr.Apply(3) == \"7.5\")) throw new Exception($\"3-\u003e{intToStr.Apply(3)}\");\n if (!(intToStr.Apply(0) == \"0.0\")) throw new Exception($\"0-\u003e{intToStr.Apply(0)}\");\n }\n}\n","golden_completion":" public C Apply(A input) =\u003e _second.Apply(_first.Apply(input));","assertions":"","category":"syntax_completion"} {"id":"49","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\nusing System.Linq;\n\nclass Program\n{\n static void Main()\n {\n var xs = new[] { 1.0, 2.0, 3.0, 4.0, 5.0 };\n var ys = new[] { 2.0, 4.0, 4.0, 4.0, 5.0 };\n\n var stats = xs.Zip(ys, (x, y) =\u003e new { X = x, Y = y, Diff = y - x })\n .Aggregate(\n new { SumDiff = 0.0, SumSq = 0.0, Count = 0 },\n","suffix":"\n );\n\n double meanDiff = stats.SumDiff / stats.Count;\n double variance = stats.SumSq / stats.Count - meanDiff * meanDiff;\n\n if (!(stats.Count == 5)) throw new Exception($\"count={stats.Count}\");\n if (!(Math.Abs(meanDiff - 0.8) \u003c 0.001)) throw new Exception($\"mean={meanDiff}\");\n if (!(Math.Abs(variance - 0.56) \u003c 0.001)) throw new Exception($\"var={variance}\");\n }\n}\n","golden_completion":" (acc, pair) =\u003e new\n {\n SumDiff = acc.SumDiff + pair.Diff,\n SumSq = acc.SumSq + pair.Diff * pair.Diff,\n Count = acc.Count + 1\n }","assertions":"","category":"syntax_completion"} {"id":"50","testsource":"devbench-syntax-completion","language":"c_sharp","prefix":"using System;\n\nclass Program\n{\n static string Describe(int[] arr) =\u003e arr switch\n {\n [] =\u003e \"empty\",\n [var x] =\u003e $\"single:{x}\",\n [var f, .., var l] when f == l =\u003e $\"bookend:{f}\",\n","suffix":"\n _ =\u003e \"other\"\n };\n\n static void Main()\n {\n if (!(Describe(Array.Empty\u003cint\u003e()) == \"empty\")) throw new Exception(\"t1\");\n if (!(Describe(new[] { 42 }) == \"single:42\")) throw new Exception(\"t2\");\n if (!(Describe(new[] { 5, 9, 5 }) == \"bookend:5\")) throw new Exception(\"t3\");\n if (!(Describe(new[] { 1, 2 }) == \"pair:1,2\")) throw new Exception(\"t4\");\n if (!(Describe(new[] { 1, 2, 3, 4 }) == \"other\")) throw new Exception(\"t5\");\n }\n}\n","golden_completion":" [var a, var b] =\u003e $\"pair:{a},{b}\",","assertions":"","category":"syntax_completion"} {"id":"1","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// Sort a vector of pairs by second element descending, then first ascending\nvoid sort_pairs(std::vector\u003cstd::pair\u003cstd::string, int\u003e\u003e\u0026 v) {\n std::sort(v.begin(), v.end(), [](const auto\u0026 a, const auto\u0026 b) {\n if (a.second != b.second) return a.second \u003e b.second;\n return a.first \u003c b.first;\n });\n}\n\n","golden_completion":"std::string describe_sort_pairs() {\n return \"Uses std::sort (introsort) with a custom binary comparator lambda. \"\n \"std::sort guarantees O(n log n) worst-case complexity (since C++11) \"\n \"but is NOT stable — equal elements may be reordered. The comparator \"\n \"must define a strict weak ordering: irreflexive, asymmetric, transitive. \"\n \"It operates on RandomAccessIterators via begin()/end(). The sort is \"\n \"performed in-place with no additional memory allocation guarantee.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cstd::pair\u003cstd::string, int\u003e\u003e v = {\n {\"alice\", 90}, {\"bob\", 90}, {\"cara\", 85}\n };\n sort_pairs(v);\n assert(v[0].first == \"alice\" \u0026\u0026 v[0].second == 90);\n assert(v[1].first == \"bob\" \u0026\u0026 v[1].second == 90);\n assert(v[2].first == \"cara\" \u0026\u0026 v[2].second == 85);\n\n std::string desc = describe_sort_pairs();\n assert(!desc.empty());\n assert(desc.find(\"sort\") != std::string::npos);\n std::cout \u003c\u003c \"Task 1 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d1 = describe_sort_pairs();\nstd::string d1l;\nd1l.resize(d1.size());\nstd::transform(d1.begin(), d1.end(), d1l.begin(), ::tolower);\nassert(d1l.find(\"introsort\") != std::string::npos || d1l.find(\"intro-sort\") != std::string::npos);\nassert(d1l.find(\"n log n\") != std::string::npos || d1l.find(\"nlogn\") != std::string::npos);\nassert(d1l.find(\"not stable\") != std::string::npos || d1l.find(\"unstable\") != std::string::npos || d1l.find(\"not a stable\") != std::string::npos);\nassert(d1l.find(\"strict weak\") != std::string::npos);\nassert(d1l.find(\"in-place\") != std::string::npos || d1l.find(\"in place\") != std::string::npos);\n","category":"api_usage"} {"id":"2","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cmap\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003calgorithm\u003e\n\n// Insert a key-value pair only if key doesn\u0027t exist; return whether inserted\nbool insert_if_absent(std::map\u003cstd::string, int\u003e\u0026 m, const std::string\u0026 key, int val) {\n auto result = m.insert({key, val});\n return result.second; // true if insertion took place\n}\n\n// Set a key-value pair, creating or overwriting\nvoid set_value(std::map\u003cstd::string, int\u003e\u0026 m, const std::string\u0026 key, int val) {\n m[key] = val; // operator[] default-constructs if key absent, then assigns\n}\n\n","golden_completion":"std::string describe_insert_vs_bracket() {\n return \"insert({key,val}) returns std::pair\u003citerator,bool\u003e where second is true \"\n \"only if insertion occurred — it does NOT overwrite existing keys. \"\n \"operator[key] default-constructs a value_type if the key is absent \"\n \"(calls the mapped_type default constructor), then returns a reference \"\n \"allowing assignment. operator[] therefore always succeeds and may overwrite. \"\n \"insert provides strong exception guarantee; operator[] may \"\n \"default-construct then throw during assignment, leaving the default value.\";\n}\n","suffix":"\nint main() {\n std::map\u003cstd::string, int\u003e m;\n assert(insert_if_absent(m, \"x\", 10) == true);\n assert(insert_if_absent(m, \"x\", 20) == false);\n assert(m[\"x\"] == 10); // insert did NOT overwrite\n\n set_value(m, \"x\", 99);\n assert(m[\"x\"] == 99); // operator[] did overwrite\n\n std::string desc = describe_insert_vs_bracket();\n assert(!desc.empty());\n assert(desc.find(\"insert\") != std::string::npos);\n std::cout \u003c\u003c \"Task 2 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d2 = describe_insert_vs_bracket();\nstd::string d2l;\nd2l.resize(d2.size());\nstd::transform(d2.begin(), d2.end(), d2l.begin(), ::tolower);\nassert(d2l.find(\"pair\u003citerator,bool\u003e\") != std::string::npos || d2l.find(\"pair\u003citerator, bool\u003e\") != std::string::npos);\nassert(d2l.find(\"not overwrite\") != std::string::npos || d2l.find(\"does not overwrite\") != std::string::npos || d2l.find(\"no overwrite\") != std::string::npos || d2l.find(\"won\u0027t overwrite\") != std::string::npos);\nassert(d2l.find(\"default-construct\") != std::string::npos || d2l.find(\"default construct\") != std::string::npos || d2l.find(\"value-initialize\") != std::string::npos);\nassert(d2l.find(\"reference\") != std::string::npos);\nassert(d2l.find(\"exception\") != std::string::npos || d2l.find(\"guarantee\") != std::string::npos);\n","category":"api_usage"} {"id":"3","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003calgorithm\u003e\n\n// Extract a safe substring: returns empty string instead of throwing\nstd::string safe_substr(const std::string\u0026 s, size_t pos, size_t len) {\n if (pos \u003e s.size()) return \"\";\n return s.substr(pos, len);\n}\n\n","golden_completion":"std::string describe_safe_substr() {\n return \"Wraps std::string::substr(pos, len) which returns a newly constructed \"\n \"string (a copy, not a view). If pos \u003e size(), substr throws \"\n \"std::out_of_range. This wrapper catches that case by returning empty. \"\n \"When pos \u003c= size(), len is clamped to size()-pos if it exceeds the \"\n \"available characters — substr never throws for large len values. \"\n \"The default len is std::string::npos, meaning \u0027until end of string\u0027.\";\n}\n","suffix":"\nint main() {\n assert(safe_substr(\"hello\", 1, 3) == \"ell\");\n assert(safe_substr(\"hello\", 0, 100) == \"hello\"); // len clamped\n assert(safe_substr(\"hello\", 10, 1) == \"\"); // pos \u003e size, no throw\n\n // Verify raw substr would throw for pos \u003e size\n bool threw = false;\n try { std::string(\"hello\").substr(10, 1); }\n catch (const std::out_of_range\u0026) { threw = true; }\n assert(threw);\n\n std::string desc = describe_safe_substr();\n assert(!desc.empty());\n assert(desc.find(\"substr\") != std::string::npos);\n std::cout \u003c\u003c \"Task 3 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d3 = describe_safe_substr();\nstd::string d3l;\nd3l.resize(d3.size());\nstd::transform(d3.begin(), d3.end(), d3l.begin(), ::tolower);\nassert(d3l.find(\"copy\") != std::string::npos || d3l.find(\"newly constructed\") != std::string::npos || d3l.find(\"new string\") != std::string::npos);\nassert(d3l.find(\"not a view\") != std::string::npos || d3l.find(\"not a reference\") != std::string::npos || (d3l.find(\"copy\") != std::string::npos \u0026\u0026 d3l.find(\"view\") == std::string::npos));\nassert(d3l.find(\"out_of_range\") != std::string::npos);\nassert(d3l.find(\"clamp\") != std::string::npos || d3l.find(\"truncat\") != std::string::npos || d3l.find(\"adjusted\") != std::string::npos || d3l.find(\"size()-pos\") != std::string::npos);\nassert(d3l.find(\"npos\") != std::string::npos || d3l.find(\"end of string\") != std::string::npos);\n","category":"api_usage"} {"id":"4","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003calgorithm\u003e\n\n// Transfer string content into a vector, leaving source in moved-from state\nvoid transfer_string(std::string\u0026 src, std::vector\u003cstd::string\u003e\u0026 dest) {\n dest.push_back(std::move(src));\n // src is now in a valid but unspecified state\n}\n\n","golden_completion":"std::string describe_transfer_string() {\n return \"Uses std::move which is a static_cast to an rvalue reference \"\n \"(specifically xvalue). std::move itself does NOT move any data — \"\n \"it merely enables move semantics by allowing the move constructor \"\n \"or move assignment operator to be selected by overload resolution. \"\n \"After push_back(std::move(src)), src is in a valid but unspecified \"\n \"state: it can be assigned to or destroyed, but its value is unknown. \"\n \"The actual data transfer happens inside vector::push_back(T\u0026\u0026).\";\n}\n","suffix":"\nint main() {\n std::string s = \"hello world\";\n std::vector\u003cstd::string\u003e v;\n transfer_string(s, v);\n assert(v.size() == 1);\n assert(v[0] == \"hello world\");\n // s is valid but unspecified — can still assign to it\n s = \"reset\";\n assert(s == \"reset\");\n\n std::string desc = describe_transfer_string();\n assert(!desc.empty());\n assert(desc.find(\"move\") != std::string::npos);\n std::cout \u003c\u003c \"Task 4 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d4 = describe_transfer_string();\nstd::string d4l;\nd4l.resize(d4.size());\nstd::transform(d4.begin(), d4.end(), d4l.begin(), ::tolower);\nassert(d4l.find(\"static_cast\") != std::string::npos || d4l.find(\"cast\") != std::string::npos);\nassert(d4l.find(\"rvalue reference\") != std::string::npos || d4l.find(\"rvalue\") != std::string::npos);\nassert(d4l.find(\"does not move\") != std::string::npos || d4l.find(\"doesn\u0027t move\") != std::string::npos || d4l.find(\"not move any\") != std::string::npos);\nassert(d4l.find(\"valid but unspecified\") != std::string::npos);\nassert(d4l.find(\"move constructor\") != std::string::npos || d4l.find(\"move assignment\") != std::string::npos || d4l.find(\"overload resolution\") != std::string::npos);\n","category":"api_usage"} {"id":"5","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003calgorithm\u003e\n\n// Release ownership from unique_ptr and manage manually\nint* extract_value(std::unique_ptr\u003cint\u003e\u0026 ptr) {\n int* raw = ptr.release(); // releases ownership, returns raw pointer\n return raw; // caller must delete\n}\n\n","golden_completion":"std::string describe_extract_value() {\n return \"Calls unique_ptr::release() which releases ownership of the managed \"\n \"object and returns the stored raw pointer. release() does NOT delete \"\n \"the object — the caller is responsible for eventual deletion via \"\n \"delete or placement into another owning container. After release(), \"\n \"the unique_ptr holds nullptr (get() returns nullptr). This differs \"\n \"from reset() which deletes the managed object, and from get() which \"\n \"returns the pointer without releasing ownership.\";\n}\n","suffix":"\nint main() {\n auto p = std::make_unique\u003cint\u003e(42);\n int* raw = extract_value(p);\n assert(raw != nullptr);\n assert(*raw == 42);\n assert(p == nullptr); // unique_ptr is now null after release\n\n std::string desc = describe_extract_value();\n assert(!desc.empty());\n assert(desc.find(\"release\") != std::string::npos);\n\n delete raw; // caller responsible for deletion\n std::cout \u003c\u003c \"Task 5 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d5 = describe_extract_value();\nstd::string d5l;\nd5l.resize(d5.size());\nstd::transform(d5.begin(), d5.end(), d5l.begin(), ::tolower);\nassert(d5l.find(\"does not delete\") != std::string::npos || d5l.find(\"doesn\u0027t delete\") != std::string::npos || d5l.find(\"not delete\") != std::string::npos);\nassert(d5l.find(\"caller\") != std::string::npos \u0026\u0026 (d5l.find(\"responsible\") != std::string::npos || d5l.find(\"must\") != std::string::npos));\nassert(d5l.find(\"nullptr\") != std::string::npos || d5l.find(\"null\") != std::string::npos);\nassert(d5l.find(\"raw pointer\") != std::string::npos || d5l.find(\"stored pointer\") != std::string::npos);\nassert(d5l.find(\"reset\") != std::string::npos || d5l.find(\"get()\") != std::string::npos);\n","category":"api_usage"} {"id":"6","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cfuture\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003calgorithm\u003e\n#include \u003cthread\u003e\n#include \u003cchrono\u003e\n\n// Launch async computation that runs on a new thread\nstd::future\u003cint\u003e compute_async(int x) {\n return std::async(std::launch::async, [x]() {\n return x * x + 1;\n });\n}\n\n","golden_completion":"std::string describe_compute_async() {\n return \"Uses std::async with std::launch::async policy, which guarantees \"\n \"execution on a new thread (as if by std::thread). The returned \"\n \"std::future holds a shared state for the result. Calling future::get() \"\n \"blocks until the result is ready and returns it. IMPORTANT: the \"\n \"destructor of the last future sharing the async state blocks until \"\n \"the task completes (unique to launch::async futures). launch::deferred \"\n \"would instead lazy-evaluate on get()/wait(). std::launch::async | \"\n \"std::launch::deferred is implementation-defined.\";\n}\n","suffix":"\nint main() {\n auto fut = compute_async(5);\n int result = fut.get();\n assert(result == 26); // 5*5 + 1\n\n std::string desc = describe_compute_async();\n assert(!desc.empty());\n assert(desc.find(\"async\") != std::string::npos);\n std::cout \u003c\u003c \"Task 6 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d6 = describe_compute_async();\nstd::string d6l;\nd6l.resize(d6.size());\nstd::transform(d6.begin(), d6.end(), d6l.begin(), ::tolower);\nassert(d6l.find(\"new thread\") != std::string::npos || d6l.find(\"separate thread\") != std::string::npos);\nassert(d6l.find(\"shared state\") != std::string::npos);\nassert(d6l.find(\"destructor\") != std::string::npos \u0026\u0026 d6l.find(\"block\") != std::string::npos);\nassert(d6l.find(\"launch::deferred\") != std::string::npos || d6l.find(\"deferred\") != std::string::npos);\nassert(d6l.find(\"get()\") != std::string::npos);\n","category":"api_usage"} {"id":"7","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cregex\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003calgorithm\u003e\n\n// Replace all occurrences of digits with \"[NUM]\"\nstd::string mask_digits(const std::string\u0026 input) {\n return std::regex_replace(input, std::regex(\"(\\\\d+)\"), \"[NUM]\");\n}\n\n","golden_completion":"std::string describe_mask_digits() {\n return \"Uses std::regex_replace which replaces ALL non-overlapping matches \"\n \"by default (not just the first). To replace only the first match, \"\n \"pass std::regex_constants::format_first_only as the flags argument. \"\n \"Backreferences use $1, $2 syntax (not \\\\1). The regex uses \"\n \"ECMAScript grammar by default (std::regex_constants::ECMAScript). \"\n \"Returns a new string; the original is not modified. The regex is \"\n \"constructed from a const char* pattern compiled at runtime.\";\n}\n","suffix":"\nint main() {\n assert(mask_digits(\"abc 123 def 456\") == \"abc [NUM] def [NUM]\");\n assert(mask_digits(\"no digits\") == \"no digits\");\n assert(mask_digits(\"42\") == \"[NUM]\");\n\n std::string desc = describe_mask_digits();\n assert(!desc.empty());\n assert(desc.find(\"regex\") != std::string::npos || desc.find(\"replace\") != std::string::npos);\n std::cout \u003c\u003c \"Task 7 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d7 = describe_mask_digits();\nstd::string d7l;\nd7l.resize(d7.size());\nstd::transform(d7.begin(), d7.end(), d7l.begin(), ::tolower);\nassert(d7l.find(\"all\") != std::string::npos \u0026\u0026 (d7l.find(\"match\") != std::string::npos || d7l.find(\"occurrence\") != std::string::npos));\nassert(d7l.find(\"format_first_only\") != std::string::npos || d7l.find(\"first_only\") != std::string::npos);\nassert(d7l.find(\"$1\") != std::string::npos || d7l.find(\"backreference\") != std::string::npos);\nassert(d7l.find(\"ecmascript\") != std::string::npos);\nassert(d7l.find(\"new string\") != std::string::npos || d7l.find(\"returns\") != std::string::npos);\n","category":"api_usage"} {"id":"8","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003ctuple\u003e\n\n// Parse an integer from the start of a string.\n// Returns (value, chars_consumed, error_code):\n// error_code 0 = success\n// error_code 1 = invalid (no conversion)\n// error_code 2 = out of range\n// Must use std::stoi with the idx parameter to determine chars consumed.\nstd::tuple\u003cint, size_t, int\u003e safe_parse_int(const std::string\u0026 s) {\n","golden_completion":" size_t idx = 0;\n try {\n int val = std::stoi(s, \u0026idx);\n return {val, idx, 0};\n } catch (const std::invalid_argument\u0026) {\n return {0, 0, 1};\n } catch (const std::out_of_range\u0026) {\n return {0, 0, 2};\n }\n","suffix":"}\n\nint main() {\n auto [v1, c1, e1] = safe_parse_int(\"42abc\");\n assert(v1 == 42 \u0026\u0026 c1 == 2 \u0026\u0026 e1 == 0);\n\n auto [v2, c2, e2] = safe_parse_int(\" -17rest\");\n assert(v2 == -17 \u0026\u0026 c2 == 6 \u0026\u0026 e2 == 0); // stoi skips leading whitespace\n\n auto [v3, c3, e3] = safe_parse_int(\"abc\");\n assert(e3 == 1); // invalid_argument\n\n auto [v4, c4, e4] = safe_parse_int(\"99999999999999999999\");\n assert(e4 == 2); // out_of_range\n\n auto [v5, c5, e5] = safe_parse_int(\"0x1A\");\n assert(v5 == 0 \u0026\u0026 c5 == 1 \u0026\u0026 e5 == 0); // base 10 default, parses \"0\"\n\n std::cout \u003c\u003c \"Task 8 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"auto [va, ca, ea] = safe_parse_int(\"\");\nassert(ea == 1); // empty string is invalid_argument\nauto [vb, cb, eb] = safe_parse_int(\" \");\nassert(eb == 1); // whitespace only is invalid_argument\nauto [vc, cc, ec] = safe_parse_int(\"+0\");\nassert(vc == 0 \u0026\u0026 cc == 2 \u0026\u0026 ec == 0); // explicit plus sign\nauto [vd, cd, ed] = safe_parse_int(\"-0\");\nassert(vd == 0 \u0026\u0026 cd == 2 \u0026\u0026 ed == 0); // negative zero\nauto [ve, ce, ee] = safe_parse_int(\"2147483647end\");\nassert(ve == 2147483647 \u0026\u0026 ce == 10 \u0026\u0026 ee == 0); // INT_MAX\nauto [vf, cf, ef] = safe_parse_int(\"-2147483648tail\");\nassert(vf == -2147483648 \u0026\u0026 ef == 0); // INT_MIN\n","category":"api_usage"} {"id":"9","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cfilesystem\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003csystem_error\u003e\n\nnamespace fs = std::filesystem;\n\n// Create directory path and return status info.\n// Returns: 0 = created successfully, 1 = already existed, 2 = error\n// Must use error_code overload to avoid exceptions.\n// Must correctly interpret the return value:\n// create_directories returns true if directories were created,\n// false if they already existed (NOT an error).\nint ensure_directory(const fs::path\u0026 p) {\n","golden_completion":" std::error_code ec;\n bool created = fs::create_directories(p, ec);\n if (ec) {\n return 2; // actual error (permissions, etc.)\n }\n return created ? 0 : 1; // true=created, false=already existed\n","suffix":"}\n\nint main() {\n fs::path tmpdir = fs::temp_directory_path() / \"devbench_test_au9\";\n fs::remove_all(tmpdir); // clean start\n\n assert(ensure_directory(tmpdir / \"a\" / \"b\" / \"c\") == 0); // created\n assert(fs::exists(tmpdir / \"a\" / \"b\" / \"c\"));\n\n assert(ensure_directory(tmpdir / \"a\" / \"b\" / \"c\") == 1); // already exists\n\n fs::remove_all(tmpdir);\n std::cout \u003c\u003c \"Task 9 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"fs::path tmpdir2 = fs::temp_directory_path() / \"devbench_test_au9_hidden\";\nfs::remove_all(tmpdir2);\nassert(ensure_directory(tmpdir2 / \"x\") == 0);\nassert(ensure_directory(tmpdir2 / \"x\") == 1);\nassert(ensure_directory(tmpdir2) == 1); // parent also already exists\n// Single directory also works\nassert(ensure_directory(tmpdir2 / \"single\") == 0);\nassert(ensure_directory(tmpdir2 / \"single\") == 1);\nfs::remove_all(tmpdir2);\n","category":"api_usage"} {"id":"10","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003ccharconv\u003e\n#include \u003cstring\u003e\n#include \u003csystem_error\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003ccstring\u003e\n#include \u003carray\u003e\n\n// Round-trip: parse a decimal integer from string, add offset, convert back.\n// Uses from_chars/to_chars (C++17 \u003ccharconv\u003e) — no locale, no allocation,\n// no exceptions. Returns empty string on any parse/format failure.\n// Must check std::errc() for success and use ptr to determine consumed/written chars.\nstd::string round_trip_add(const char* input, int offset) {\n","golden_completion":" int value = 0;\n auto [ptr1, ec1] = std::from_chars(input, input + std::strlen(input), value);\n if (ec1 != std::errc{} || ptr1 != input + std::strlen(input)) {\n return \"\"; // parse failure or trailing chars\n }\n value += offset;\n std::array\u003cchar, 32\u003e buf;\n auto [ptr2, ec2] = std::to_chars(buf.data(), buf.data() + buf.size(), value);\n if (ec2 != std::errc{}) {\n return \"\"; // format failure\n }\n return std::string(buf.data(), ptr2);\n","suffix":"}\n\nint main() {\n assert(round_trip_add(\"100\", 23) == \"123\");\n assert(round_trip_add(\"-50\", 50) == \"0\");\n assert(round_trip_add(\"abc\", 1) == \"\"); // parse failure\n assert(round_trip_add(\"12abc\", 0) == \"\"); // trailing chars not consumed\n assert(round_trip_add(\"0\", 0) == \"0\");\n assert(round_trip_add(\"2147483647\", 0) == \"2147483647\"); // INT_MAX\n\n std::cout \u003c\u003c \"Task 10 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"assert(round_trip_add(\"999\", 1) == \"1000\");\nassert(round_trip_add(\"-1\", -1) == \"-2\");\nassert(round_trip_add(\"\", 0) == \"\");\nassert(round_trip_add(\" 42\", 0) == \"\"); // from_chars does NOT skip whitespace\nassert(round_trip_add(\"+42\", 0) == \"\"); // from_chars does NOT accept leading +\nassert(round_trip_add(\"0\", 2147483647) == \"2147483647\");\nassert(round_trip_add(\"-2147483648\", 0) == \"-2147483648\"); // INT_MIN\n","category":"api_usage"} {"id":"11","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\nvoid demo_reserve_vs_resize() {\n std::vector\u003cint\u003e v1;\n v1.reserve(100);\n // v1.size() == 0, v1.capacity() \u003e= 100\n\n std::vector\u003cint\u003e v2;\n v2.resize(100);\n // v2.size() == 100, v2.capacity() \u003e= 100, elements value-initialized to 0\n}\n\nstd::string describe_reserve_vs_resize() {\n","golden_completion":" return \"reserve(n) allocates memory for at least n elements without changing size() \"\n \"or constructing any objects; capacity() becomes \u003e= n but size() remains 0. \"\n \"resize(n) changes size() to n, default-constructing new elements if growing \"\n \"or destroying trailing elements if shrinking. reserve never invalidates \"\n \"iterators unless reallocation occurs; resize always invalidates iterators \"\n \"when growing past capacity. reserve throws std::length_error if n \u003e max_size().\";\n","suffix":"\n}\n\nint main() {\n std::vector\u003cint\u003e v;\n v.reserve(100);\n assert(v.size() == 0);\n assert(v.capacity() \u003e= 100);\n\n v.resize(50);\n assert(v.size() == 50);\n assert(v[0] == 0);\n\n v.resize(20);\n assert(v.size() == 20);\n\n std::string desc = describe_reserve_vs_resize();\n assert(!desc.empty());\n assert(desc.find(\"reserve\") != std::string::npos);\n assert(desc.find(\"resize\") != std::string::npos);\n std::cout \u003c\u003c \"Task 11 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_reserve_vs_resize();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"size()\") != std::string::npos || dl.find(\"size() remains\") != std::string::npos || dl.find(\"without changing size\") != std::string::npos);\nassert(dl.find(\"capacity\") != std::string::npos);\nassert(dl.find(\"construct\") != std::string::npos || dl.find(\"default-construct\") != std::string::npos || dl.find(\"value-initial\") != std::string::npos);\nassert(dl.find(\"allocat\") != std::string::npos);\nassert(dl.find(\"destroy\") != std::string::npos || dl.find(\"shrink\") != std::string::npos || dl.find(\"erase\") != std::string::npos);\n// Must mention that reserve does NOT change size\nassert(dl.find(\"without\") != std::string::npos || dl.find(\"does not\") != std::string::npos || dl.find(\"unchanged\") != std::string::npos || dl.find(\"remains\") != std::string::npos);\n","category":"api_usage"} {"id":"12","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cunordered_map\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\nstd::pair\u003cbool, int\u003e demo_emplace() {\n std::unordered_map\u003cstd::string, int\u003e m;\n auto [it1, inserted1] = m.emplace(\"key\", 42);\n auto [it2, inserted2] = m.emplace(\"key\", 99);\n return {inserted2, it2-\u003esecond};\n}\n\nstd::string describe_emplace() {\n","golden_completion":" return \"emplace(args...) constructs the key-value pair in-place using perfect \"\n \"forwarding, avoiding copy or move of the arguments. Returns std::pair\u003citerator, bool\u003e \"\n \"where bool is true if insertion occurred. If the key already exists, emplace is a \"\n \"no-op: it does not modify the existing value and returns {iterator_to_existing, false}. \"\n \"Unlike insert, emplace forwards arguments directly to the pair constructor. \"\n \"May cause rehashing if load_factor exceeds max_load_factor after insertion.\";\n","suffix":"\n}\n\nint main() {\n auto [was_inserted, value] = demo_emplace();\n assert(!was_inserted);\n assert(value == 42);\n\n std::unordered_map\u003cstd::string, int\u003e m;\n auto [it, ok] = m.emplace(\"x\", 10);\n assert(ok \u0026\u0026 it-\u003esecond == 10);\n auto [it2, ok2] = m.emplace(\"x\", 20);\n assert(!ok2 \u0026\u0026 it2-\u003esecond == 10);\n\n std::string desc = describe_emplace();\n assert(!desc.empty());\n assert(desc.find(\"emplace\") != std::string::npos);\n std::cout \u003c\u003c \"Task 12 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_emplace();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"in-place\") != std::string::npos || dl.find(\"in place\") != std::string::npos || dl.find(\"construct\") != std::string::npos);\nassert(dl.find(\"forward\") != std::string::npos || dl.find(\"perfect forward\") != std::string::npos);\nassert(dl.find(\"pair\") != std::string::npos);\nassert(dl.find(\"bool\") != std::string::npos || dl.find(\"true\") != std::string::npos);\nassert(dl.find(\"no-op\") != std::string::npos || dl.find(\"does not modify\") != std::string::npos || dl.find(\"not inserted\") != std::string::npos || dl.find(\"already exists\") != std::string::npos);\nassert(dl.find(\"copy\") != std::string::npos || dl.find(\"move\") != std::string::npos);\nassert(dl.find(\"rehash\") != std::string::npos || dl.find(\"load_factor\") != std::string::npos || dl.find(\"load factor\") != std::string::npos);\n","category":"api_usage"} {"id":"13","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cmutex\u003e\n#include \u003ccondition_variable\u003e\n#include \u003cthread\u003e\n#include \u003cchrono\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nbool demo_wait_for() {\n std::mutex mtx;\n std::condition_variable cv;\n bool ready = false;\n\n std::thread t([\u0026]() {\n std::this_thread::sleep_for(std::chrono::milliseconds(50));\n {\n std::lock_guard\u003cstd::mutex\u003e lk(mtx);\n ready = true;\n }\n cv.notify_one();\n });\n\n std::unique_lock\u003cstd::mutex\u003e lk(mtx);\n bool result = cv.wait_for(lk, std::chrono::seconds(2), [\u0026]{ return ready; });\n lk.unlock();\n t.join();\n return result;\n}\n\nstd::string describe_wait_for() {\n","golden_completion":" return \"wait_for(lock, duration, predicate) atomically releases the unique_lock and \"\n \"blocks the calling thread. It may wake spuriously, so the predicate overload \"\n \"re-checks the condition on each wakeup and only returns true when the predicate \"\n \"is satisfied. The non-predicate overload returns std::cv_status::timeout or \"\n \"std::cv_status::no_timeout. The mutex must be locked by the calling thread \"\n \"before calling wait_for. Uses steady_clock internally to avoid wall-clock \"\n \"adjustments affecting the timeout duration.\";\n","suffix":"\n}\n\nint main() {\n bool r = demo_wait_for();\n assert(r);\n\n std::string desc = describe_wait_for();\n assert(!desc.empty());\n assert(desc.find(\"wait_for\") != std::string::npos);\n std::cout \u003c\u003c \"Task 13 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_wait_for();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"spurious\") != std::string::npos);\nassert(dl.find(\"predicate\") != std::string::npos);\nassert(dl.find(\"cv_status\") != std::string::npos || dl.find(\"timeout\") != std::string::npos);\nassert(dl.find(\"mutex\") != std::string::npos || dl.find(\"lock\") != std::string::npos);\nassert(dl.find(\"locked\") != std::string::npos || dl.find(\"must be locked\") != std::string::npos || dl.find(\"unique_lock\") != std::string::npos);\nassert(dl.find(\"release\") != std::string::npos || dl.find(\"unlock\") != std::string::npos || dl.find(\"atomically\") != std::string::npos);\nassert(dl.find(\"steady_clock\") != std::string::npos || dl.find(\"monotonic\") != std::string::npos || dl.find(\"wall-clock\") != std::string::npos);\n","category":"api_usage"} {"id":"14","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cshared_mutex\u003e\n#include \u003cmutex\u003e\n#include \u003cstring\u003e\n#include \u003cunordered_map\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nclass ThreadSafeCache {\n mutable std::shared_mutex mtx_;\n std::unordered_map\u003cstd::string, int\u003e data_;\npublic:\n int read(const std::string\u0026 key) const {\n std::shared_lock\u003cstd::shared_mutex\u003e lk(mtx_);\n auto it = data_.find(key);\n return it != data_.end() ? it-\u003esecond : -1;\n }\n void write(const std::string\u0026 key, int val) {\n std::unique_lock\u003cstd::shared_mutex\u003e lk(mtx_);\n data_[key] = val;\n }\n};\n\nstd::string describe_shared_mutex() {\n","golden_completion":" return \"std::shared_mutex supports two ownership modes: shared (read) and exclusive \"\n \"(write). Multiple threads can hold shared_lock simultaneously for concurrent \"\n \"reads. unique_lock acquires exclusive ownership, blocking until all shared and \"\n \"exclusive locks are released. Writers are exclusive: only one thread holds \"\n \"unique_lock at a time, and no shared_locks can be held concurrently. \"\n \"shared_mutex must be declared mutable for use in const member functions. \"\n \"Unlike std::mutex, shared_mutex does not support try_lock_for; use \"\n \"shared_timed_mutex for timed operations.\";\n","suffix":"\n}\n\nint main() {\n ThreadSafeCache cache;\n cache.write(\"x\", 42);\n assert(cache.read(\"x\") == 42);\n assert(cache.read(\"y\") == -1);\n\n std::string desc = describe_shared_mutex();\n assert(!desc.empty());\n assert(desc.find(\"shared\") != std::string::npos);\n std::cout \u003c\u003c \"Task 14 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_shared_mutex();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"shared_lock\") != std::string::npos || dl.find(\"shared lock\") != std::string::npos);\nassert(dl.find(\"unique_lock\") != std::string::npos || dl.find(\"unique lock\") != std::string::npos || dl.find(\"exclusive\") != std::string::npos);\nassert(dl.find(\"concurrent\") != std::string::npos || dl.find(\"simultaneous\") != std::string::npos || dl.find(\"multiple\") != std::string::npos);\nassert(dl.find(\"read\") != std::string::npos);\nassert(dl.find(\"write\") != std::string::npos || dl.find(\"exclusive\") != std::string::npos);\nassert(dl.find(\"mutable\") != std::string::npos);\nassert(dl.find(\"shared_timed_mutex\") != std::string::npos || dl.find(\"timed\") != std::string::npos || dl.find(\"try_lock_for\") != std::string::npos);\n","category":"api_usage"} {"id":"15","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cstring_view\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nvoid demo_string_view() {\n std::string s = \"hello world\";\n std::string_view sv1 = s; // implicit from std::string\n std::string_view sv2 = \"literal\"; // implicit from const char*\n std::string_view sv3(s.data(), 5); // first 5 chars\n}\n\nstd::string describe_string_view() {\n","golden_completion":" return \"std::string_view is a non-owning reference to a contiguous character sequence. \"\n \"It can be implicitly constructed from std::string or const char*, and explicitly \"\n \"from a pointer+length pair. It does not guarantee null termination; substr() \"\n \"returns another string_view (not a string), which may not be null-terminated. \"\n \"Dangling risk: if the underlying string is destroyed or reallocated, the \"\n \"string_view becomes invalid. data() returns the underlying pointer but may \"\n \"not be null-terminated. Use std::string(sv) for safe null-terminated copy.\";\n","suffix":"\n}\n\nint main() {\n std::string s = \"hello world\";\n std::string_view sv = s;\n assert(sv.size() == 11);\n assert(sv.substr(0, 5) == \"hello\");\n\n std::string_view sv2 = \"literal\";\n assert(sv2.size() == 7);\n\n std::string desc = describe_string_view();\n assert(!desc.empty());\n assert(desc.find(\"string_view\") != std::string::npos);\n std::cout \u003c\u003c \"Task 15 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_string_view();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"non-owning\") != std::string::npos || dl.find(\"non owning\") != std::string::npos || dl.find(\"does not own\") != std::string::npos);\nassert(dl.find(\"dangling\") != std::string::npos || dl.find(\"invalid\") != std::string::npos || dl.find(\"lifetime\") != std::string::npos);\nassert(dl.find(\"null terminat\") != std::string::npos || dl.find(\"null-terminat\") != std::string::npos);\nassert(dl.find(\"implicit\") != std::string::npos);\nassert(dl.find(\"substr\") != std::string::npos || dl.find(\"sub\") != std::string::npos);\nassert(dl.find(\"data()\") != std::string::npos || dl.find(\"pointer\") != std::string::npos);\n","category":"api_usage"} {"id":"16","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cvariant\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nusing Value = std::variant\u003cint, double, std::string\u003e;\n\nstd::string type_name(const Value\u0026 v) {\n return std::visit([](const auto\u0026 arg) -\u003e std::string {\n using T = std::decay_t\u003cdecltype(arg)\u003e;\n if constexpr (std::is_same_v\u003cT, int\u003e) return \"int\";\n else if constexpr (std::is_same_v\u003cT, double\u003e) return \"double\";\n else return \"string\";\n }, v);\n}\n\nstd::string describe_variant_visit() {\n","golden_completion":" return \"std::visit applies a callable (visitor) to the value held by one or more \"\n \"variants. The visitor must handle all alternative types (exhaustive visitation); \"\n \"a compile-time error occurs if any alternative is unhandled. std::get\u003cT\u003e(v) \"\n \"throws std::bad_variant_access if v does not currently hold type T. \"\n \"A variant can enter the valueless_by_exception state if an assignment throws \"\n \"during type change; valueless_by_exception() returns true in that state. \"\n \"std::holds_alternative\u003cT\u003e(v) safely checks the active type without throwing.\";\n","suffix":"\n}\n\nint main() {\n Value v1 = 42;\n Value v2 = 3.14;\n Value v3 = std::string(\"hi\");\n\n assert(type_name(v1) == \"int\");\n assert(type_name(v2) == \"double\");\n assert(type_name(v3) == \"string\");\n\n assert(std::get\u003cint\u003e(v1) == 42);\n bool threw = false;\n try { std::get\u003cdouble\u003e(v1); }\n catch (const std::bad_variant_access\u0026) { threw = true; }\n assert(threw);\n\n std::string desc = describe_variant_visit();\n assert(!desc.empty());\n assert(desc.find(\"visit\") != std::string::npos);\n std::cout \u003c\u003c \"Task 16 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_variant_visit();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"exhaustive\") != std::string::npos || dl.find(\"all alternative\") != std::string::npos || dl.find(\"every type\") != std::string::npos);\nassert(dl.find(\"compile\") != std::string::npos || dl.find(\"compile-time\") != std::string::npos);\nassert(dl.find(\"bad_variant_access\") != std::string::npos);\nassert(dl.find(\"valueless_by_exception\") != std::string::npos || dl.find(\"valueless\") != std::string::npos);\nassert(dl.find(\"holds_alternative\") != std::string::npos || dl.find(\"holds alternative\") != std::string::npos);\nassert(dl.find(\"throw\") != std::string::npos);\n","category":"api_usage"} {"id":"17","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cchrono\u003e\n#include \u003cthread\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nlong long measure_sleep_us() {\n auto start = std::chrono::steady_clock::now();\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n auto end = std::chrono::steady_clock::now();\n return std::chrono::duration_cast\u003cstd::chrono::microseconds\u003e(end - start).count();\n}\n\nstd::string describe_steady_clock() {\n","golden_completion":" return \"std::chrono::steady_clock is a monotonic clock that never adjusts backward; \"\n \"it is not affected by wall-clock changes (e.g., NTP adjustments, daylight saving). \"\n \"now() returns a time_point; subtracting two time_points yields a duration. \"\n \"Use duration_cast\u003ctarget_duration\u003e(d) to convert between units (e.g., microseconds \"\n \"to milliseconds). time_point arithmetic supports + and - with durations. \"\n \"steady_clock::is_steady is guaranteed true. For wall-clock time, use system_clock \"\n \"instead, which can convert to/from time_t via to_time_t/from_time_t.\";\n","suffix":"\n}\n\nint main() {\n long long us = measure_sleep_us();\n assert(us \u003e= 5000); // at least 5ms in microseconds\n\n auto tp1 = std::chrono::steady_clock::now();\n auto tp2 = tp1 + std::chrono::seconds(1);\n auto diff = std::chrono::duration_cast\u003cstd::chrono::milliseconds\u003e(tp2 - tp1);\n assert(diff.count() == 1000);\n\n std::string desc = describe_steady_clock();\n assert(!desc.empty());\n assert(desc.find(\"steady_clock\") != std::string::npos);\n std::cout \u003c\u003c \"Task 17 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_steady_clock();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"monotonic\") != std::string::npos || dl.find(\"never adjust\") != std::string::npos || dl.find(\"never goes backward\") != std::string::npos);\nassert(dl.find(\"wall\") != std::string::npos || dl.find(\"ntp\") != std::string::npos || dl.find(\"system time\") != std::string::npos);\nassert(dl.find(\"duration_cast\") != std::string::npos);\nassert(dl.find(\"time_point\") != std::string::npos);\nassert(dl.find(\"system_clock\") != std::string::npos);\nassert(dl.find(\"is_steady\") != std::string::npos || dl.find(\"guaranteed\") != std::string::npos);\n","category":"api_usage"} {"id":"18","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003coptional\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nstruct Heavy {\n std::string name;\n int weight;\n Heavy(const std::string\u0026 n, int w) : name(n), weight(w) {}\n};\n\nstd::optional\u003cHeavy\u003e make_optional_demo() {\n std::optional\u003cHeavy\u003e opt;\n opt.emplace(\"iron\", 100);\n return opt;\n}\n\nstd::string describe_optional_emplace() {\n","golden_completion":" return \"emplace(args...) constructs the contained value in-place using perfect \"\n \"forwarding, destroying any previously held value first. Returns a reference \"\n \"to the newly constructed object. Unlike operator= or assignment from T, \"\n \"emplace avoids a temporary and potential move. If the optional already \"\n \"contains a value, that value is destroyed before the new one is constructed. \"\n \"value() throws std::bad_optional_access if the optional is empty. \"\n \"has_value() or operator bool checks for engagement without throwing.\";\n","suffix":"\n}\n\nint main() {\n auto opt = make_optional_demo();\n assert(opt.has_value());\n assert(opt-\u003ename == \"iron\");\n assert(opt-\u003eweight == 100);\n\n opt.emplace(\"steel\", 200);\n assert(opt-\u003ename == \"steel\");\n\n std::optional\u003cint\u003e empty;\n bool threw = false;\n try { empty.value(); }\n catch (const std::bad_optional_access\u0026) { threw = true; }\n assert(threw);\n\n std::string desc = describe_optional_emplace();\n assert(!desc.empty());\n assert(desc.find(\"emplace\") != std::string::npos);\n std::cout \u003c\u003c \"Task 18 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_optional_emplace();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"in-place\") != std::string::npos || dl.find(\"in place\") != std::string::npos || dl.find(\"construct\") != std::string::npos);\nassert(dl.find(\"destroy\") != std::string::npos || dl.find(\"previous\") != std::string::npos);\nassert(dl.find(\"reference\") != std::string::npos || dl.find(\"returns\") != std::string::npos);\nassert(dl.find(\"forward\") != std::string::npos || dl.find(\"forwarding\") != std::string::npos);\nassert(dl.find(\"bad_optional_access\") != std::string::npos);\nassert(dl.find(\"has_value\") != std::string::npos || dl.find(\"operator bool\") != std::string::npos || dl.find(\"bool\") != std::string::npos);\nassert(dl.find(\"value()\") != std::string::npos || dl.find(\"throw\") != std::string::npos);\n","category":"api_usage"} {"id":"19","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cbitset\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003cstdexcept\u003e\n#include \u003calgorithm\u003e\n\nvoid demo_bitset() {\n std::bitset\u003c8\u003e b1(0b10110010);\n std::bitset\u003c8\u003e b2(std::string(\"10110010\"));\n // b1 == b2\n\n std::string s = b1.to_string(); // \"10110010\"\n unsigned long val = b1.to_ulong(); // 178\n\n bool bit0 = b1[0]; // no bounds check\n bool bit0_safe = b1.test(0); // throws if out of range\n}\n\nstd::string describe_bitset() {\n","golden_completion":" return \"std::bitset\u003cN\u003e is a fixed-size sequence of N bits determined at compile time. \"\n \"Constructible from unsigned long long or std::string of \u00270\u0027/\u00271\u0027 characters. \"\n \"to_string() returns the binary representation as a string; to_ulong() and \"\n \"to_ullong() convert to integer, throwing std::overflow_error if the value \"\n \"cannot fit. operator[] provides unchecked access with no bounds checking. \"\n \"test(pos) throws std::out_of_range if pos \u003e= N. set(), reset(), flip() \"\n \"operate on individual bits or all bits. count() returns the number of set bits.\";\n","suffix":"\n}\n\nint main() {\n std::bitset\u003c8\u003e b(0b10110010);\n assert(b.to_string() == \"10110010\");\n assert(b.to_ulong() == 178);\n assert(b.count() == 4);\n assert(b.test(1) == true);\n assert(b[0] == false);\n\n b.flip(0);\n assert(b[0] == true);\n\n std::string desc = describe_bitset();\n assert(!desc.empty());\n assert(desc.find(\"bitset\") != std::string::npos);\n std::cout \u003c\u003c \"Task 19 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_bitset();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"compile time\") != std::string::npos || dl.find(\"compile-time\") != std::string::npos || dl.find(\"fixed\") != std::string::npos);\nassert(dl.find(\"to_string\") != std::string::npos);\nassert(dl.find(\"to_ulong\") != std::string::npos || dl.find(\"to_ullong\") != std::string::npos);\nassert(dl.find(\"overflow_error\") != std::string::npos || dl.find(\"overflow\") != std::string::npos);\nassert(dl.find(\"operator[]\") != std::string::npos || (dl.find(\"[]\") != std::string::npos \u0026\u0026 (dl.find(\"unchecked\") != std::string::npos || dl.find(\"no bounds\") != std::string::npos || dl.find(\"no check\") != std::string::npos)));\nassert(dl.find(\"out_of_range\") != std::string::npos || dl.find(\"out of range\") != std::string::npos);\nassert(dl.find(\"test(\") != std::string::npos || dl.find(\"test()\") != std::string::npos);\nassert(dl.find(\"count()\") != std::string::npos || dl.find(\"count\") != std::string::npos);\n","category":"api_usage"} {"id":"20","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003carray\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cnumeric\u003e\n\nvoid demo_array() {\n std::array\u003cint, 5\u003e arr = {1, 2, 3, 4, 5};\n arr.fill(0);\n auto [a, b, c, d, e] = arr; // structured bindings\n\n std::array\u003cint, 5\u003e arr2 = {10, 20, 30, 40, 50};\n arr.swap(arr2);\n\n constexpr std::size_t sz = arr.size(); // constexpr\n}\n\nstd::string describe_array_vs_carray() {\n","golden_completion":" return \"std::array\u003cT,N\u003e is an aggregate type wrapping a fixed-size C-style array. \"\n \"Unlike C arrays, it does not decay to a pointer when passed to functions. \"\n \"size() is constexpr and always returns N. fill(value) sets all elements; \"\n \"swap() exchanges contents with another array of the same type and size in \"\n \"O(N) time (element-wise swap, not pointer swap). Supports structured bindings \"\n \"via std::tuple_size and std::get. at(i) throws std::out_of_range; operator[] \"\n \"is unchecked. data() returns a pointer to the underlying C array. \"\n \"Empty array (N==0) is valid but data() may return nullptr.\";\n","suffix":"\n}\n\nint main() {\n std::array\u003cint, 5\u003e a = {1, 2, 3, 4, 5};\n assert(a.size() == 5);\n assert(a.front() == 1);\n assert(a.back() == 5);\n\n a.fill(42);\n assert(a[0] == 42 \u0026\u0026 a[4] == 42);\n\n std::array\u003cint, 5\u003e b = {10, 20, 30, 40, 50};\n a.swap(b);\n assert(a[0] == 10 \u0026\u0026 b[0] == 42);\n\n auto [x, y, z, w, v] = a;\n assert(x == 10);\n\n bool threw = false;\n try { a.at(99); }\n catch (const std::out_of_range\u0026) { threw = true; }\n assert(threw);\n\n std::string desc = describe_array_vs_carray();\n assert(!desc.empty());\n assert(desc.find(\"array\") != std::string::npos);\n std::cout \u003c\u003c \"Task 20 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_array_vs_carray();\nstd::string dl = d;\nstd::transform(dl.begin(), dl.end(), dl.begin(), ::tolower);\nassert(dl.find(\"aggregate\") != std::string::npos);\nassert(dl.find(\"decay\") != std::string::npos || dl.find(\"does not decay\") != std::string::npos);\nassert(dl.find(\"constexpr\") != std::string::npos);\nassert(dl.find(\"fill\") != std::string::npos);\nassert(dl.find(\"swap\") != std::string::npos);\nassert(dl.find(\"structured binding\") != std::string::npos || dl.find(\"structured_binding\") != std::string::npos || dl.find(\"tuple_size\") != std::string::npos);\nassert(dl.find(\"out_of_range\") != std::string::npos || dl.find(\"at(\") != std::string::npos);\nassert(dl.find(\"data()\") != std::string::npos || dl.find(\"underlying\") != std::string::npos);\nassert(dl.find(\"empty\") != std::string::npos || dl.find(\"n==0\") != std::string::npos || dl.find(\"nullptr\") != std::string::npos);\n","category":"api_usage"} {"id":"21","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\n// Adds corresponding elements from two vectors using std::transform\n// with the binary overload. The result is written into the output vector.\nstd::vector\u003cint\u003e add_pairwise(const std::vector\u003cint\u003e\u0026 a, const std::vector\u003cint\u003e\u0026 b) {\n std::vector\u003cint\u003e out(a.size());\n std::transform(a.begin(), a.end(), b.begin(), out.begin(),\n [](int x, int y){ return x + y; });\n return out;\n}\n\n// In-place negate using unary overload — destination aliases the input range.\nvoid negate_inplace(std::vector\u003cint\u003e\u0026 v) {\n std::transform(v.begin(), v.end(), v.begin(),\n [](int x){ return -x; });\n}\n\n","golden_completion":"std::string describe_transform() {\n return \"std::transform applies a function to each element and writes to an output range. \"\n \"The binary overload takes two input ranges (first1, last1, first2) and applies a \"\n \"binary operation. The unary overload takes one input range. The destination \"\n \"iterator can alias an input range for in-place transformation. Returns an \"\n \"iterator past the last written element in the output range. Defined in \u003calgorithm\u003e.\";\n}\n","suffix":"\nint main() {\n auto r = add_pairwise({1,2,3}, {10,20,30});\n assert(r[0] == 11 \u0026\u0026 r[1] == 22 \u0026\u0026 r[2] == 33);\n\n std::vector\u003cint\u003e v = {5, -3, 0};\n negate_inplace(v);\n assert(v[0] == -5 \u0026\u0026 v[1] == 3 \u0026\u0026 v[2] == 0);\n\n std::string desc = describe_transform();\n assert(!desc.empty());\n assert(desc.find(\"binary\") != std::string::npos);\n std::cout \u003c\u003c \"Task 21 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d = describe_transform();\n // Check for required keywords\n assert(d.find(\"two input range\") != std::string::npos || d.find(\"two input\") != std::string::npos);\n assert(d.find(\"output range\") != std::string::npos);\n assert(d.find(\"unary\") != std::string::npos \u0026\u0026 d.find(\"binary\") != std::string::npos);\n assert(d.find(\"alias\") != std::string::npos || d.find(\"in-place\") != std::string::npos || d.find(\"same range\") != std::string::npos);\n assert(d.find(\"\u003calgorithm\u003e\") != std::string::npos || d.find(\"algorithm\") != std::string::npos);\n","category":"api_usage"} {"id":"22","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\n// Partition a vector so that even numbers come first.\n// Returns the partition point iterator (first element not satisfying predicate).\nstd::vector\u003cint\u003e::iterator partition_evens(std::vector\u003cint\u003e\u0026 v) {\n return std::partition(v.begin(), v.end(), [](int x){ return x % 2 == 0; });\n}\n\n","golden_completion":"std::string describe_partition() {\n return \"std::partition reorders elements so those satisfying the predicate appear \"\n \"before those that do not. It is NOT stable — relative order within each group \"\n \"is not preserved. Returns a partition point iterator to the first element that \"\n \"does not satisfy the predicate. Runs in O(n) time with at most n/2 swaps. \"\n \"All elements before the partition point satisfy the predicate; all after do not. \"\n \"Defined in \u003calgorithm\u003e.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e v = {1, 2, 3, 4, 5, 6};\n auto it = partition_evens(v);\n // All elements before it are even\n for (auto i = v.begin(); i != it; ++i) {\n assert(*i % 2 == 0);\n }\n // All elements from it onward are odd\n for (auto i = it; i != v.end(); ++i) {\n assert(*i % 2 != 0);\n }\n assert(it - v.begin() == 3); // 3 even numbers\n\n std::string desc = describe_partition();\n assert(!desc.empty());\n assert(desc.find(\"partition\") != std::string::npos);\n std::cout \u003c\u003c \"Task 22 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d22 = describe_partition();\n assert(d22.find(\"not stable\") != std::string::npos || d22.find(\"NOT stable\") != std::string::npos || d22.find(\"unstable\") != std::string::npos);\n assert(d22.find(\"partition point\") != std::string::npos);\n assert(d22.find(\"predicate\") != std::string::npos);\n assert(d22.find(\"O(n)\") != std::string::npos || d22.find(\"linear\") != std::string::npos);\n assert(d22.find(\"before\") != std::string::npos);\n","category":"api_usage"} {"id":"23","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\n// Find the median element using nth_element.\n// After the call, the element at position n/2 is the value that would be\n// there if the range were sorted. Elements before it are \u003c= and after are \u003e=,\n// but neither side is sorted.\nint find_median(std::vector\u003cint\u003e v) {\n size_t mid = v.size() / 2;\n std::nth_element(v.begin(), v.begin() + mid, v.end());\n return v[mid];\n}\n\n","golden_completion":"std::string describe_nth_element() {\n return \"std::nth_element performs a partial sort: the element at the nth position \"\n \"is the element that would be there in a fully sorted range. All elements \"\n \"before nth are less than or equal to it, and all after are greater than or \"\n \"equal. However, neither side is sorted. Runs in O(n) average time complexity \"\n \"(uses introselect). It modifies the range in-place. Defined in \u003calgorithm\u003e.\";\n}\n","suffix":"\nint main() {\n int m1 = find_median({5, 3, 1, 4, 2});\n assert(m1 == 3);\n\n int m2 = find_median({10, 20, 30, 40, 50, 60, 70});\n assert(m2 == 40);\n\n // Verify partial sort property\n std::vector\u003cint\u003e v = {9, 7, 5, 3, 1, 8, 6, 4, 2};\n std::nth_element(v.begin(), v.begin() + 4, v.end());\n int nth = v[4];\n for (int i = 0; i \u003c 4; ++i) assert(v[i] \u003c= nth);\n for (int i = 5; i \u003c 9; ++i) assert(v[i] \u003e= nth);\n\n std::string desc = describe_nth_element();\n assert(!desc.empty());\n std::cout \u003c\u003c \"Task 23 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d23 = describe_nth_element();\n assert(d23.find(\"partial sort\") != std::string::npos || d23.find(\"partial\") != std::string::npos);\n assert(d23.find(\"nth\") != std::string::npos || d23.find(\"position\") != std::string::npos);\n assert(d23.find(\"less than or equal\") != std::string::npos || d23.find(\"\u003c=\") != std::string::npos);\n assert(d23.find(\"greater than or equal\") != std::string::npos || d23.find(\"\u003e=\") != std::string::npos);\n assert(d23.find(\"O(n)\") != std::string::npos || d23.find(\"linear\") != std::string::npos || d23.find(\"average\") != std::string::npos);\n assert(d23.find(\"not sorted\") != std::string::npos || d23.find(\"neither\") != std::string::npos || d23.find(\"unordered\") != std::string::npos);\n","category":"api_usage"} {"id":"24","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cnumeric\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003cfunctional\u003e\n\n// Sum using accumulate (strict left fold)\nint sum_accumulate(const std::vector\u003cint\u003e\u0026 v) {\n return std::accumulate(v.begin(), v.end(), 0);\n}\n\n// Sum using reduce (allows reordering, parallelizable)\nint sum_reduce(const std::vector\u003cint\u003e\u0026 v) {\n return std::reduce(v.begin(), v.end(), 0, std::plus\u003c\u003e{});\n}\n\n// String concatenation: accumulate preserves order, reduce would be UB\n// because string concatenation is not commutative.\nstd::string concat_accumulate(const std::vector\u003cstd::string\u003e\u0026 v) {\n return std::accumulate(v.begin(), v.end(), std::string{});\n}\n\n","golden_completion":"std::string describe_accumulate_vs_reduce() {\n return \"std::accumulate performs a strict left fold: it applies op(acc, elem) sequentially \"\n \"from left to right, guaranteeing evaluation order. std::reduce may evaluate in \"\n \"arbitrary order and allows parallelism via execution policies, but requires the \"\n \"operation to be both associative and commutative. For non-commutative operations \"\n \"like string concatenation, only accumulate is correct. accumulate is in \u003cnumeric\u003e \"\n \"(C++03); reduce is in \u003cnumeric\u003e (C++17).\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e v = {1, 2, 3, 4, 5};\n assert(sum_accumulate(v) == 15);\n assert(sum_reduce(v) == 15);\n\n std::vector\u003cstd::string\u003e words = {\"hello\", \" \", \"world\"};\n assert(concat_accumulate(words) == \"hello world\");\n\n std::string desc = describe_accumulate_vs_reduce();\n assert(!desc.empty());\n assert(desc.find(\"accumulate\") != std::string::npos);\n assert(desc.find(\"reduce\") != std::string::npos);\n std::cout \u003c\u003c \"Task 24 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d24 = describe_accumulate_vs_reduce();\n assert(d24.find(\"left fold\") != std::string::npos || d24.find(\"left-fold\") != std::string::npos || d24.find(\"sequentially\") != std::string::npos || d24.find(\"left to right\") != std::string::npos);\n assert(d24.find(\"parallelism\") != std::string::npos || d24.find(\"parallel\") != std::string::npos);\n assert(d24.find(\"associative\") != std::string::npos);\n assert(d24.find(\"commutative\") != std::string::npos);\n assert(d24.find(\"order\") != std::string::npos);\n","category":"api_usage"} {"id":"25","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\nstruct Widget {\n int id;\n std::string name;\n Widget(int i, const std::string\u0026 n) : id(i), name(n) {}\n};\n\n// Using make_shared: single allocation for control block + object\nstd::shared_ptr\u003cWidget\u003e create_widget_make(int id, const std::string\u0026 name) {\n return std::make_shared\u003cWidget\u003e(id, name);\n}\n\n// Using new: two allocations — one for object, one for control block\nstd::shared_ptr\u003cWidget\u003e create_widget_new(int id, const std::string\u0026 name) {\n return std::shared_ptr\u003cWidget\u003e(new Widget(id, name));\n}\n\n","golden_completion":"std::string describe_make_shared_vs_new() {\n return \"std::make_shared performs a single memory allocation for both the control block \"\n \"and the managed object together, improving cache locality and reducing allocator \"\n \"overhead. Using new + shared_ptr constructor requires two separate allocations. \"\n \"make_shared also provides exception safety: no memory leak if another argument \"\n \"evaluation throws. However, make_shared does not support custom deleters — \"\n \"a shared_ptr constructed from new is required for that. Defined in \u003cmemory\u003e.\";\n}\n","suffix":"\nint main() {\n auto w1 = create_widget_make(1, \"Alpha\");\n assert(w1-\u003eid == 1 \u0026\u0026 w1-\u003ename == \"Alpha\");\n assert(w1.use_count() == 1);\n\n auto w2 = create_widget_new(2, \"Beta\");\n assert(w2-\u003eid == 2 \u0026\u0026 w2-\u003ename == \"Beta\");\n\n std::string desc = describe_make_shared_vs_new();\n assert(!desc.empty());\n assert(desc.find(\"make_shared\") != std::string::npos);\n std::cout \u003c\u003c \"Task 25 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d25 = describe_make_shared_vs_new();\n assert(d25.find(\"single\") != std::string::npos \u0026\u0026 (d25.find(\"allocation\") != std::string::npos || d25.find(\"alloc\") != std::string::npos));\n assert(d25.find(\"control block\") != std::string::npos);\n assert(d25.find(\"together\") != std::string::npos || d25.find(\"combined\") != std::string::npos || d25.find(\"both\") != std::string::npos);\n assert(d25.find(\"exception safety\") != std::string::npos || d25.find(\"exception-safe\") != std::string::npos || d25.find(\"no memory leak\") != std::string::npos);\n assert(d25.find(\"custom deleter\") != std::string::npos || d25.find(\"deleter\") != std::string::npos);\n","category":"api_usage"} {"id":"26","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cutility\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003cvector\u003e\n\nstruct Logger {\n std::vector\u003cstd::string\u003e entries;\n\n // Overloaded push: detects lvalue vs rvalue\n void push(const std::string\u0026 s) { entries.push_back(\"copy:\" + s); }\n void push(std::string\u0026\u0026 s) { entries.push_back(\"move:\" + std::move(s)); }\n};\n\n// Perfect forwarding wrapper — preserves the value category of the argument\ntemplate\u003ctypename T\u003e\nvoid log_entry(Logger\u0026 logger, T\u0026\u0026 value) {\n logger.push(std::forward\u003cT\u003e(value));\n}\n\n","golden_completion":"std::string describe_forward() {\n return \"std::forward performs a conditional cast that preserves the value category \"\n \"(lvalue or rvalue) of its argument. It is used for perfect forwarding in \"\n \"template functions with universal references (T\u0026\u0026). When T is deduced as \"\n \"an lvalue reference, forward returns an lvalue; when T is a non-reference, \"\n \"forward returns an rvalue. Without forward, rvalue arguments would be \"\n \"treated as lvalues inside the function body. Defined in \u003cutility\u003e.\";\n}\n","suffix":"\nint main() {\n Logger logger;\n std::string s = \"hello\";\n log_entry(logger, s); // lvalue -\u003e copy\n log_entry(logger, std::string(\"world\")); // rvalue -\u003e move\n\n assert(logger.entries.size() == 2);\n assert(logger.entries[0] == \"copy:hello\");\n assert(logger.entries[1] == \"move:world\");\n\n std::string desc = describe_forward();\n assert(!desc.empty());\n assert(desc.find(\"forward\") != std::string::npos);\n std::cout \u003c\u003c \"Task 26 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d26 = describe_forward();\n assert(d26.find(\"perfect forwarding\") != std::string::npos);\n assert(d26.find(\"value category\") != std::string::npos || d26.find(\"lvalue\") != std::string::npos);\n assert(d26.find(\"conditional cast\") != std::string::npos || d26.find(\"conditional\") != std::string::npos);\n assert(d26.find(\"universal reference\") != std::string::npos || d26.find(\"forwarding reference\") != std::string::npos || d26.find(\"T\u0026\u0026\") != std::string::npos);\n assert(d26.find(\"\u003cutility\u003e\") != std::string::npos || d26.find(\"utility\") != std::string::npos);\n","category":"api_usage"} {"id":"27","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cutility\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003cvector\u003e\n\nstruct Buffer {\n int* data;\n size_t size;\n\n Buffer(size_t n) : data(new int[n]()), size(n) {}\n\n // Move constructor using std::exchange to steal resources\n Buffer(Buffer\u0026\u0026 other) noexcept\n : data(std::exchange(other.data, nullptr)),\n size(std::exchange(other.size, 0)) {}\n\n // Move assignment\n Buffer\u0026 operator=(Buffer\u0026\u0026 other) noexcept {\n delete[] data;\n data = std::exchange(other.data, nullptr);\n size = std::exchange(other.size, 0);\n return *this;\n }\n\n ~Buffer() { delete[] data; }\n};\n\n","golden_completion":"std::string describe_exchange() {\n return \"std::exchange replaces the value of an object with a new value and returns the \"\n \"old value, all in a single expression. It is especially useful in move constructors \"\n \"and move assignment operators to steal resources: exchange(other.ptr, nullptr) \"\n \"transfers ownership and nullifies the source in one step. Equivalent to: \"\n \"old = obj; obj = new_val; return old. Defined in \u003cutility\u003e since C++14.\";\n}\n","suffix":"\nint main() {\n Buffer b1(10);\n b1.data[0] = 42;\n Buffer b2(std::move(b1));\n assert(b2.data[0] == 42);\n assert(b2.size == 10);\n assert(b1.data == nullptr);\n assert(b1.size == 0);\n\n int x = 5;\n int old = std::exchange(x, 10);\n assert(old == 5 \u0026\u0026 x == 10);\n\n std::string desc = describe_exchange();\n assert(!desc.empty());\n std::cout \u003c\u003c \"Task 27 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d27 = describe_exchange();\n assert(d27.find(\"old value\") != std::string::npos || d27.find(\"previous value\") != std::string::npos);\n assert(d27.find(\"replaces\") != std::string::npos || d27.find(\"replace\") != std::string::npos);\n assert(d27.find(\"single expression\") != std::string::npos || d27.find(\"one step\") != std::string::npos || d27.find(\"atomically\") != std::string::npos);\n assert(d27.find(\"move constructor\") != std::string::npos || d27.find(\"move\") != std::string::npos);\n assert(d27.find(\"\u003cutility\u003e\") != std::string::npos || d27.find(\"utility\") != std::string::npos);\n","category":"api_usage"} {"id":"28","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\n// Clamp values to [0, 255] for pixel processing\nint clamp_pixel(int val) {\n return std::clamp(val, 0, 255);\n}\n\n// Clamp with custom comparator (case-insensitive string range)\nstd::string clamp_string_ci(const std::string\u0026 val,\n const std::string\u0026 lo,\n const std::string\u0026 hi) {\n auto ci_less = [](const std::string\u0026 a, const std::string\u0026 b) {\n std::string al = a, bl = b;\n for (auto\u0026 c : al) c = std::tolower(c);\n for (auto\u0026 c : bl) c = std::tolower(c);\n return al \u003c bl;\n };\n return std::clamp(val, lo, hi, ci_less);\n}\n\n","golden_completion":"std::string describe_clamp() {\n return \"std::clamp constrains a value to lie within [lo, hi]. Returns a reference to \"\n \"lo if val \u003c lo, to hi if val \u003e hi, otherwise to val itself. Behavior is undefined \"\n \"if lo \u003e hi. By default uses operator\u003c for comparison, but accepts a custom \"\n \"comparator as the fourth argument. Returns a const reference, not a copy. \"\n \"Defined in \u003calgorithm\u003e since C++17.\";\n}\n","suffix":"\nint main() {\n assert(clamp_pixel(-10) == 0);\n assert(clamp_pixel(128) == 128);\n assert(clamp_pixel(300) == 255);\n\n assert(clamp_string_ci(\"banana\", \"apple\", \"cherry\") == \"banana\");\n assert(clamp_string_ci(\"AARDVARK\", \"apple\", \"cherry\") == \"apple\");\n\n std::string desc = describe_clamp();\n assert(!desc.empty());\n assert(desc.find(\"clamp\") != std::string::npos);\n std::cout \u003c\u003c \"Task 28 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d28 = describe_clamp();\n assert(d28.find(\"lo\") != std::string::npos || d28.find(\"low\") != std::string::npos);\n assert(d28.find(\"hi\") != std::string::npos || d28.find(\"high\") != std::string::npos);\n assert(d28.find(\"undefined\") != std::string::npos || d28.find(\"UB\") != std::string::npos);\n assert(d28.find(\"reference\") != std::string::npos);\n assert(d28.find(\"operator\u003c\") != std::string::npos || d28.find(\"comparator\") != std::string::npos || d28.find(\"custom\") != std::string::npos);\n","category":"api_usage"} {"id":"29","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cfunctional\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\nstruct Account {\n double balance;\n double getBalance() const { return balance; }\n void deposit(double amt) { balance += amt; }\n};\n\n// Free function\nint add(int a, int b) { return a + b; }\n\n// Functor\nstruct Multiplier {\n int factor;\n int operator()(int x) const { return x * factor; }\n};\n\n","golden_completion":"std::string describe_invoke() {\n return \"std::invoke provides uniform call syntax for any callable: free functions, \"\n \"member function pointers, member data pointers, functors, and lambdas. For \"\n \"member function pointers, invoke(pmf, obj, args...) calls (obj.*pmf)(args...). \"\n \"For pointers to member data, invoke(pmd, obj) accesses obj.*pmd. This unifies \"\n \"INVOKE semantics used internally by std::function, std::bind, and std::thread. \"\n \"Defined in \u003cfunctional\u003e since C++17.\";\n}\n","suffix":"\nint main() {\n // Free function\n assert(std::invoke(add, 3, 4) == 7);\n\n // Functor\n Multiplier m{5};\n assert(std::invoke(m, 6) == 30);\n\n // Lambda\n auto sq = [](int x){ return x * x; };\n assert(std::invoke(sq, 9) == 81);\n\n // Member function pointer\n Account acc{100.0};\n assert(std::invoke(\u0026Account::getBalance, acc) == 100.0);\n\n // Member data pointer\n double bal = std::invoke(\u0026Account::balance, acc);\n assert(bal == 100.0);\n\n // Member function with args\n std::invoke(\u0026Account::deposit, acc, 50.0);\n assert(acc.balance == 150.0);\n\n std::string desc = describe_invoke();\n assert(!desc.empty());\n std::cout \u003c\u003c \"Task 29 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d29 = describe_invoke();\n assert(d29.find(\"uniform call\") != std::string::npos || d29.find(\"uniform\") != std::string::npos);\n assert(d29.find(\"member function pointer\") != std::string::npos || d29.find(\"member function\") != std::string::npos);\n assert(d29.find(\"member data pointer\") != std::string::npos || d29.find(\"member data\") != std::string::npos);\n assert(d29.find(\"functor\") != std::string::npos || d29.find(\"function object\") != std::string::npos);\n assert(d29.find(\"free function\") != std::string::npos || d29.find(\"regular function\") != std::string::npos);\n assert(d29.find(\"\u003cfunctional\u003e\") != std::string::npos || d29.find(\"functional\") != std::string::npos);\n","category":"api_usage"} {"id":"30","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cfilesystem\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\nnamespace fs = std::filesystem;\n\n// Demonstrate path decomposition and composition\nstruct PathInfo {\n std::string parent;\n std::string stem;\n std::string extension;\n std::string joined;\n std::string normalized;\n};\n\nPathInfo analyze_path(const fs::path\u0026 p) {\n PathInfo info;\n info.parent = p.parent_path().string();\n info.stem = p.stem().string();\n info.extension = p.extension().string();\n // operator/ appends path components\n info.joined = (p.parent_path() / \"sibling.txt\").string();\n // lexically_normal resolves . and ..\n info.normalized = (p / \"..\" / \"other.cpp\").lexically_normal().string();\n return info;\n}\n\n","golden_completion":"std::string describe_path_operations() {\n return \"std::filesystem::path supports decomposition via parent_path() (directory part), \"\n \"stem() (filename without extension), and extension() (including the leading dot). \"\n \"The / operator appends path components with a directory separator. \"\n \"lexically_normal() collapses . and .. segments and redundant separators without \"\n \"touching the filesystem. Paths have both generic format (forward slashes) and \"\n \"native format (OS-dependent separators). Defined in \u003cfilesystem\u003e since C++17.\";\n}\n","suffix":"\nint main() {\n fs::path p(\"/home/user/project/main.cpp\");\n auto info = analyze_path(p);\n assert(info.parent == \"/home/user/project\");\n assert(info.stem == \"main\");\n assert(info.extension == \".cpp\");\n assert(info.joined == \"/home/user/project/sibling.txt\");\n\n // Test lexically_normal\n fs::path messy(\"a/b/../c/./d\");\n assert(messy.lexically_normal() == \"a/c/d\");\n\n std::string desc = describe_path_operations();\n assert(!desc.empty());\n std::cout \u003c\u003c \"Task 30 PASS\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"\n std::string d30 = describe_path_operations();\n assert(d30.find(\"/\") != std::string::npos \u0026\u0026 d30.find(\"operator\") != std::string::npos);\n assert(d30.find(\"parent_path\") != std::string::npos);\n assert(d30.find(\"stem\") != std::string::npos);\n assert(d30.find(\"extension\") != std::string::npos);\n assert(d30.find(\"generic\") != std::string::npos || d30.find(\"native\") != std::string::npos);\n assert(d30.find(\"lexically_normal\") != std::string::npos || d30.find(\"lexically normal\") != std::string::npos);\n","category":"api_usage"} {"id":"31","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\n// Rotate elements of a vector left by \u0027n\u0027 positions using std::rotate.\n// std::rotate(first, new_first, last) performs a left rotation in-place\n// so that the element pointed by new_first becomes the first element.\n// It returns an iterator to the element that was originally first.\nstd::vector\u003cint\u003e rotate_left(std::vector\u003cint\u003e v, int n) {\n if (v.empty()) return v;\n n = n % (int)v.size();\n std::rotate(v.begin(), v.begin() + n, v.end());\n return v;\n}\n\n// Return a precise description of how std::rotate works, covering:\n// - the rotation direction, return value, complexity, and in-place nature.\nstd::string describe_rotate() {\n","golden_completion":" return \"std::rotate performs a left rotation in-place on the range [first, last). \"\n \"The element pointed to by new_first becomes the first element after the call. \"\n \"It returns an iterator pointing to the element that was originally pointed to by first, \"\n \"now located at first + (last - new_first). The operation is in-place with O(n) complexity \"\n \"where n is the distance from first to last. No additional memory is allocated.\";\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e v1 = {1, 2, 3, 4, 5};\n auto r1 = rotate_left(v1, 2);\n assert((r1 == std::vector\u003cint\u003e{3, 4, 5, 1, 2}));\n\n auto r2 = rotate_left(v1, 0);\n assert(r2 == v1);\n\n auto r3 = rotate_left({10, 20, 30}, 1);\n assert((r3 == std::vector\u003cint\u003e{20, 30, 10}));\n\n std::string desc = describe_rotate();\n assert(!desc.empty());\n // Visible: check it mentions rotation\n assert(desc.find(\"rotation\") != std::string::npos || desc.find(\"rotate\") != std::string::npos);\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_rotate();\n// Convert to lowercase for checking\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"left rotation\") != std::string::npos || low.find(\"left rotate\") != std::string::npos);\nassert(low.find(\"in-place\") != std::string::npos || low.find(\"in place\") != std::string::npos);\nassert(low.find(\"iterator\") != std::string::npos);\nassert(low.find(\"original\") != std::string::npos \u0026\u0026 low.find(\"first\") != std::string::npos);\nassert(low.find(\"o(n)\") != std::string::npos || low.find(\"linear\") != std::string::npos);\n","category":"api_usage"} {"id":"32","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cnumeric\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\n// Fill a vector with sequentially increasing values starting from \u0027start\u0027\n// using std::iota. Each subsequent element is generated by applying ++\n// to the previous value (prefix increment on the value type).\nstd::vector\u003cint\u003e make_sequence(int count, int start) {\n std::vector\u003cint\u003e v(count);\n std::iota(v.begin(), v.end(), start);\n return v;\n}\n\n// Return a precise description of std::iota\u0027s behavior.\nstd::string describe_iota() {\n","golden_completion":" return \"std::iota fills the range [first, last) with sequentially increasing values. \"\n \"It assigns the starting value to *first, then increments the value using prefix \"\n \"operator++ for each subsequent element. The number of assignments equals \"\n \"last - first. The starting value is passed by value and modified in-place via ++. \"\n \"It requires a ForwardIterator and a value type that supports operator++.\";\n","suffix":"}\n\nint main() {\n auto s1 = make_sequence(5, 0);\n assert((s1 == std::vector\u003cint\u003e{0, 1, 2, 3, 4}));\n\n auto s2 = make_sequence(3, 10);\n assert((s2 == std::vector\u003cint\u003e{10, 11, 12}));\n\n auto s3 = make_sequence(0, 5);\n assert(s3.empty());\n\n std::string desc = describe_iota();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_iota();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"sequentially increasing\") != std::string::npos || low.find(\"sequential\") != std::string::npos);\nassert(low.find(\"starting value\") != std::string::npos || low.find(\"start\") != std::string::npos);\nassert(low.find(\"++\") != std::string::npos || low.find(\"increment\") != std::string::npos);\nassert(low.find(\"operator++\") != std::string::npos || (low.find(\"prefix\") != std::string::npos \u0026\u0026 low.find(\"++\") != std::string::npos));\nassert(low.find(\"forward\") != std::string::npos || low.find(\"forwarditerator\") != std::string::npos);\n","category":"api_usage"} {"id":"33","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cnumeric\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cfunctional\u003e\n\n// Compute inner product with default (multiply+add) operations\nint dot_product(const std::vector\u003cint\u003e\u0026 a, const std::vector\u003cint\u003e\u0026 b) {\n return std::inner_product(a.begin(), a.end(), b.begin(), 0);\n}\n\n// Compute inner product with custom ops: max of absolute differences\n// Uses the 4-argument overload: inner_product(first1, last1, first2, init, op1, op2)\n// op1 replaces +, op2 replaces *\nint max_abs_diff(const std::vector\u003cint\u003e\u0026 a, const std::vector\u003cint\u003e\u0026 b) {\n return std::inner_product(a.begin(), a.end(), b.begin(), 0,\n [](int acc, int val) { return std::max(acc, val); },\n [](int x, int y) { return std::abs(x - y); });\n}\n\n// Return a precise description of std::inner_product.\nstd::string describe_inner_product() {\n","golden_completion":" return \"std::inner_product computes a generalized inner product of two ranges. \"\n \"The default overload accumulates init + (a[i] * b[i]) for each pair, using \"\n \"operator+ as the reduce operation and operator* as the transform operation. \"\n \"The custom overload accepts two binary operations: op1 replaces addition \"\n \"(used to combine the accumulator with each element result) and op2 replaces \"\n \"multiplication (used to combine corresponding elements from the two ranges). \"\n \"The init value seeds the accumulation and its type determines the return type.\";\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e a = {1, 2, 3};\n std::vector\u003cint\u003e b = {4, 5, 6};\n assert(dot_product(a, b) == 32); // 1*4 + 2*5 + 3*6\n\n std::vector\u003cint\u003e c = {10, 20, 30};\n std::vector\u003cint\u003e e = {12, 15, 35};\n assert(max_abs_diff(c, e) == 5); // max(|10-12|, |20-15|, |30-35|) = 5\n\n std::string desc = describe_inner_product();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_inner_product();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"two ranges\") != std::string::npos || low.find(\"two range\") != std::string::npos || (low.find(\"range\") != std::string::npos \u0026\u0026 low.find(\"pair\") != std::string::npos));\nassert(low.find(\"init\") != std::string::npos);\nassert(low.find(\"multiply\") != std::string::npos || low.find(\"operator*\") != std::string::npos || low.find(\"multiplication\") != std::string::npos);\nassert(low.find(\"custom\") != std::string::npos || low.find(\"overload\") != std::string::npos);\nassert(low.find(\"op1\") != std::string::npos || low.find(\"binary op\") != std::string::npos || low.find(\"two binary\") != std::string::npos || (low.find(\"replace\") != std::string::npos \u0026\u0026 low.find(\"add\") != std::string::npos));\nassert(low.find(\"return type\") != std::string::npos || low.find(\"determines\") != std::string::npos || low.find(\"seed\") != std::string::npos);\n","category":"api_usage"} {"id":"34","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\n// Find the first pair of adjacent equal elements\n// Returns index of the first element of the pair, or -1 if not found\nint find_adjacent_equal(const std::vector\u003cint\u003e\u0026 v) {\n auto it = std::adjacent_find(v.begin(), v.end());\n if (it == v.end()) return -1;\n return std::distance(v.begin(), it);\n}\n\n// Find the first pair of adjacent elements where the second is greater\nint find_adjacent_increasing(const std::vector\u003cint\u003e\u0026 v) {\n auto it = std::adjacent_find(v.begin(), v.end(),\n [](int a, int b) { return b \u003e a; });\n if (it == v.end()) return -1;\n return std::distance(v.begin(), it);\n}\n\n// Return a precise description of std::adjacent_find.\nstd::string describe_adjacent_find() {\n","golden_completion":" return \"std::adjacent_find searches the range [first, last) for the first pair of \"\n \"adjacent elements that are equal (default) or satisfy a given binary predicate. \"\n \"It returns an iterator to the first element of the found pair. If no such pair \"\n \"exists, it returns last. The custom predicate overload accepts a BinaryPredicate \"\n \"that takes two consecutive elements and returns true if they match. \"\n \"Complexity is at most last - first - 1 comparisons.\";\n","suffix":"}\n\nint main() {\n assert(find_adjacent_equal({1, 2, 3, 3, 4}) == 2);\n assert(find_adjacent_equal({1, 2, 3, 4}) == -1);\n assert(find_adjacent_equal({5, 5, 6, 6}) == 0);\n\n assert(find_adjacent_increasing({5, 3, 4, 2}) == 1); // 3 \u003c 4\n assert(find_adjacent_increasing({5, 4, 3, 2}) == -1);\n\n std::string desc = describe_adjacent_find();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_adjacent_find();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"adjacent\") != std::string::npos);\nassert(low.find(\"first\") != std::string::npos \u0026\u0026 (low.find(\"pair\") != std::string::npos || low.find(\"element\") != std::string::npos));\nassert(low.find(\"iterator\") != std::string::npos);\nassert(low.find(\"predicate\") != std::string::npos);\nassert(low.find(\"last\") != std::string::npos);\nassert(low.find(\"equal\") != std::string::npos);\n","category":"api_usage"} {"id":"35","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\n// Shift elements right by \u0027shift\u0027 positions within the same vector,\n// using std::copy_backward to handle the overlap safely.\n// copy_backward copies [first, last) into [..., d_last) in reverse order,\n// so it\u0027s safe when destination overlaps source and dest is after source.\nvoid shift_right(std::vector\u003cint\u003e\u0026 v, int shift) {\n if (shift \u003c= 0 || shift \u003e= (int)v.size()) return;\n std::copy_backward(v.begin(), v.end() - shift, v.end());\n std::fill(v.begin(), v.begin() + shift, 0);\n}\n\n// Return a precise description of std::copy_backward.\nstd::string describe_copy_backward() {\n","golden_completion":" return \"std::copy_backward copies elements from the range [first, last) into a range \"\n \"ending at d_last, copying in reverse order (last element first). The destination \"\n \"range is [..., d_last), and the function returns an iterator to the beginning of \"\n \"the destination range. It safely handles overlapping ranges when the destination \"\n \"is after the source (d_last \u003e last is not required, but the destination must not \"\n \"overlap with [first, last) such that d_last falls within (first, last)). \"\n \"Unlike std::copy, which copies forward and fails with overlap when dest \u003e source.\";\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e v = {1, 2, 3, 4, 5};\n shift_right(v, 2);\n assert((v == std::vector\u003cint\u003e{0, 0, 1, 2, 3}));\n\n std::vector\u003cint\u003e v2 = {10, 20, 30};\n shift_right(v2, 1);\n assert((v2 == std::vector\u003cint\u003e{0, 10, 20}));\n\n std::string desc = describe_copy_backward();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_copy_backward();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"reverse order\") != std::string::npos || low.find(\"reverse\") != std::string::npos || low.find(\"backward\") != std::string::npos);\nassert(low.find(\"d_last\") != std::string::npos || low.find(\"destination end\") != std::string::npos || low.find(\"dest_last\") != std::string::npos);\nassert(low.find(\"overlap\") != std::string::npos);\nassert(low.find(\"after\") != std::string::npos || low.find(\"beyond\") != std::string::npos);\nassert(low.find(\"iterator\") != std::string::npos || low.find(\"return\") != std::string::npos);\n","category":"api_usage"} {"id":"36","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003ctuple\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\n// Unpack a tuple using std::tie. std::tie creates a tuple of lvalue references,\n// allowing assignment from another tuple. std::ignore can be used to skip elements.\nstd::tuple\u003cint, std::string, double\u003e get_record() {\n return {42, \"hello\", 3.14};\n}\n\nvoid unpack_example(int\u0026 id, std::string\u0026 name) {\n double unused;\n std::tie(id, name, unused) = get_record();\n}\n\nvoid unpack_with_ignore(int\u0026 id) {\n std::tie(id, std::ignore, std::ignore) = get_record();\n}\n\n// Return a precise description of std::tie.\nstd::string describe_tie() {\n","golden_completion":" return \"std::tie creates a tuple of lvalue references to its arguments. When assigned \"\n \"from another tuple, each element of the source is assigned to the corresponding \"\n \"referenced variable. std::ignore can be used as a placeholder to skip elements \"\n \"during unpacking — assignments to std::ignore are discarded. Since C++17, \"\n \"structured bindings (auto [a, b, c] = ...) provide an alternative that creates \"\n \"new variables instead of assigning to existing ones. std::tie requires the \"\n \"variables to be declared beforehand.\";\n","suffix":"}\n\nint main() {\n int id = 0;\n std::string name;\n unpack_example(id, name);\n assert(id == 42);\n assert(name == \"hello\");\n\n int id2 = 0;\n unpack_with_ignore(id2);\n assert(id2 == 42);\n\n std::string desc = describe_tie();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_tie();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"lvalue reference\") != std::string::npos || low.find(\"lvalue ref\") != std::string::npos);\nassert(low.find(\"ignore\") != std::string::npos);\nassert(low.find(\"structured binding\") != std::string::npos || low.find(\"structured_binding\") != std::string::npos);\nassert(low.find(\"placeholder\") != std::string::npos || low.find(\"skip\") != std::string::npos || low.find(\"discard\") != std::string::npos);\nassert(low.find(\"declared\") != std::string::npos || low.find(\"existing\") != std::string::npos || low.find(\"beforehand\") != std::string::npos);\n","category":"api_usage"} {"id":"37","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003ctuple\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cutility\u003e\n\n// Use std::apply to unpack a tuple as function arguments.\n// std::apply(f, t) calls f with the elements of t unpacked as arguments.\nint add_three(int a, int b, int c) {\n return a + b + c;\n}\n\nstd::string format_pair(const std::string\u0026 key, int value) {\n return key + \"=\" + std::to_string(value);\n}\n\nint sum_tuple(const std::tuple\u003cint, int, int\u003e\u0026 t) {\n return std::apply(add_three, t);\n}\n\nstd::string format_entry(const std::pair\u003cstd::string, int\u003e\u0026 p) {\n return std::apply(format_pair, p);\n}\n\n// Return a precise description of std::apply.\nstd::string describe_apply() {\n","golden_completion":" return \"std::apply invokes a callable with arguments unpacked from a tuple-like object. \"\n \"Given std::apply(f, t), it calls f(std::get\u003c0\u003e(t), std::get\u003c1\u003e(t), ...) using \"\n \"std::index_sequence to expand the tuple elements as individual function arguments. \"\n \"It works with std::tuple, std::pair, and std::array since all support std::get. \"\n \"The callable can be a function pointer, lambda, or any callable object. \"\n \"Defined in \u003ctuple\u003e header, available since C++17.\";\n","suffix":"}\n\nint main() {\n auto t = std::make_tuple(10, 20, 30);\n assert(sum_tuple(t) == 60);\n\n auto p = std::make_pair(std::string(\"x\"), 5);\n assert(format_entry(p) == \"x=5\");\n\n // Works with lambda too\n auto result = std::apply([](int a, int b) { return a * b; },\n std::make_tuple(6, 7));\n assert(result == 42);\n\n std::string desc = describe_apply();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_apply();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"unpack\") != std::string::npos || low.find(\"expand\") != std::string::npos);\nassert(low.find(\"tuple\") != std::string::npos);\nassert(low.find(\"pair\") != std::string::npos);\nassert(low.find(\"callable\") != std::string::npos || low.find(\"function\") != std::string::npos);\nassert(low.find(\"lambda\") != std::string::npos || low.find(\"callable object\") != std::string::npos || low.find(\"function pointer\") != std::string::npos);\nassert(low.find(\"c++17\") != std::string::npos || low.find(\"c++ 17\") != std::string::npos);\n","category":"api_usage"} {"id":"38","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cnew\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003ccstring\u003e\n\n// std::launder is a pointer optimization barrier needed when reusing storage\n// after placement new, especially when the object has const or reference members.\n// Without it, the compiler may optimize based on the old object\u0027s const values.\n\nstruct Config {\n const int version;\n int value;\n Config(int v, int val) : version(v), value(val) {}\n};\n\n// Demonstrate std::launder usage with placement new\nint reuse_storage() {\n alignas(Config) unsigned char buf[sizeof(Config)];\n Config* p1 = new (buf) Config(1, 100);\n assert(p1-\u003eversion == 1);\n p1-\u003e~Config();\n\n Config* p2 = new (buf) Config(2, 200);\n // Must use std::launder because Config has const member \u0027version\u0027.\n // Without launder, compiler may assume p1-\u003eversion is still 1.\n Config* p3 = std::launder(reinterpret_cast\u003cConfig*\u003e(buf));\n return p3-\u003eversion; // Correctly returns 2\n}\n\n// Return a precise description of std::launder.\nstd::string describe_launder() {\n","golden_completion":" return \"std::launder is a pointer optimization barrier introduced in C++17. It takes a \"\n \"pointer and returns a pointer to the same address but prevents the compiler from \"\n \"applying optimizations based on the original object\u0027s properties. It is required \"\n \"when accessing an object created via placement new in storage previously occupied \"\n \"by another object with const or reference members — without std::launder, the \"\n \"compiler may assume const members retain their old values (undefined behavior). \"\n \"It is also needed when reinterpret_cast is used to access storage after placement new.\";\n","suffix":"}\n\nint main() {\n int result = reuse_storage();\n assert(result == 2);\n\n std::string desc = describe_launder();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_launder();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"optimization barrier\") != std::string::npos || low.find(\"pointer barrier\") != std::string::npos || low.find(\"prevents\") != std::string::npos);\nassert(low.find(\"placement new\") != std::string::npos);\nassert(low.find(\"const\") != std::string::npos);\nassert(low.find(\"undefined behavior\") != std::string::npos || low.find(\"ub\") != std::string::npos);\nassert(low.find(\"reference\") != std::string::npos || low.find(\"reinterpret_cast\") != std::string::npos);\nassert(low.find(\"c++17\") != std::string::npos || low.find(\"c++ 17\") != std::string::npos);\n","category":"api_usage"} {"id":"39","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003ctype_traits\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cnew\u003e\n\n// std::aligned_storage provides a type suitable for use as uninitialized\n// storage for an object of given size and alignment. You must manually\n// construct and destroy objects in this storage using placement new.\n\n// A simple optional-like container using aligned_storage\ntemplate \u003ctypename T\u003e\nclass SimpleOptional {\n typename std::aligned_storage\u003csizeof(T), alignof(T)\u003e::type storage;\n bool has_value_ = false;\npublic:\n void emplace(const T\u0026 val) {\n if (has_value_) reinterpret_cast\u003cT*\u003e(\u0026storage)-\u003e~T();\n new (\u0026storage) T(val);\n has_value_ = true;\n }\n const T\u0026 value() const {\n return *reinterpret_cast\u003cconst T*\u003e(\u0026storage);\n }\n bool has_value() const { return has_value_; }\n ~SimpleOptional() {\n if (has_value_) reinterpret_cast\u003cT*\u003e(\u0026storage)-\u003e~T();\n }\n};\n\n// Return a precise description of std::aligned_storage.\nstd::string describe_aligned_storage() {\n","golden_completion":" return \"std::aligned_storage\u003cLen, Align\u003e::type provides a POD type suitable for use \"\n \"as uninitialized storage for any object whose size is at most Len and whose \"\n \"alignment requirement is at most Align. The storage is raw — no constructor or \"\n \"destructor is called automatically. Objects must be constructed in this storage \"\n \"using placement new and destroyed by explicitly calling the destructor. Access \"\n \"to the stored object requires reinterpret_cast. If Align is not specified, it \"\n \"defaults to the default alignment for the size. Deprecated in C++23 in favor of alignas.\";\n","suffix":"}\n\nint main() {\n SimpleOptional\u003cint\u003e opt;\n assert(!opt.has_value());\n opt.emplace(42);\n assert(opt.has_value());\n assert(opt.value() == 42);\n\n SimpleOptional\u003cstd::string\u003e sopt;\n sopt.emplace(\"hello\");\n assert(sopt.value() == \"hello\");\n\n std::string desc = describe_aligned_storage();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_aligned_storage();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"raw\") != std::string::npos || low.find(\"uninitialized\") != std::string::npos);\nassert(low.find(\"alignment\") != std::string::npos || low.find(\"align\") != std::string::npos);\nassert(low.find(\"reinterpret_cast\") != std::string::npos);\nassert(low.find(\"placement new\") != std::string::npos);\nassert(low.find(\"destructor\") != std::string::npos || low.find(\"destroy\") != std::string::npos);\nassert(low.find(\"manual\") != std::string::npos || low.find(\"explicit\") != std::string::npos);\n","category":"api_usage"} {"id":"40","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\n// A class that can safely create shared_ptr to itself from member functions.\n// Must inherit from enable_shared_from_this and must be managed by shared_ptr.\nclass Widget : public std::enable_shared_from_this\u003cWidget\u003e {\n int id_;\npublic:\n Widget(int id) : id_(id) {}\n int id() const { return id_; }\n\n // Returns a shared_ptr to this — only valid if \u0027this\u0027 is already\n // owned by at least one shared_ptr. Throws bad_weak_ptr otherwise.\n std::shared_ptr\u003cWidget\u003e get_shared() {\n return shared_from_this();\n }\n};\n\n// Return a precise description of std::enable_shared_from_this.\nstd::string describe_enable_shared_from_this() {\n","golden_completion":" return \"std::enable_shared_from_this\u003cT\u003e is a CRTP base class that allows an object to \"\n \"safely create additional shared_ptr instances pointing to itself via the \"\n \"shared_from_this() member function. The class internally stores a weak_ptr that \"\n \"is initialized when the object is first managed by a shared_ptr. Calling \"\n \"shared_from_this() when no shared_ptr owns the object throws std::bad_weak_ptr. \"\n \"This prevents creating multiple independent ownership groups for the same object, \"\n \"which would cause double deletion.\";\n","suffix":"}\n\nint main() {\n auto w = std::make_shared\u003cWidget\u003e(1);\n auto w2 = w-\u003eget_shared();\n assert(w.get() == w2.get());\n assert(w.use_count() == 2);\n\n // Calling shared_from_this without shared_ptr ownership throws\n bool threw = false;\n try {\n Widget raw(2);\n raw.get_shared(); // Should throw bad_weak_ptr\n } catch (const std::bad_weak_ptr\u0026) {\n threw = true;\n }\n assert(threw);\n\n std::string desc = describe_enable_shared_from_this();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_enable_shared_from_this();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"shared_from_this\") != std::string::npos);\nassert(low.find(\"shared_ptr\") != std::string::npos);\nassert(low.find(\"bad_weak_ptr\") != std::string::npos);\nassert(low.find(\"weak_ptr\") != std::string::npos);\nassert(low.find(\"double\") != std::string::npos || low.find(\"multiple\") != std::string::npos || low.find(\"independent\") != std::string::npos);\nassert(low.find(\"crtp\") != std::string::npos || low.find(\"curiously recurring\") != std::string::npos || low.find(\"base class\") != std::string::npos);\n","category":"api_usage"} {"id":"41","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cmutex\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cthread\u003e\n\n// Demonstrate std::scoped_lock locking multiple mutexes without deadlock.\n// scoped_lock uses a deadlock-avoidance algorithm (like std::lock) internally.\nstd::mutex m1, m2;\nint shared_a = 0, shared_b = 0;\n\nvoid transfer(int amount) {\n std::scoped_lock lock(m1, m2); // CTAD deduces scoped_lock\u003cmutex, mutex\u003e\n shared_a -= amount;\n shared_b += amount;\n}\n\n// Return a precise description of std::scoped_lock.\nstd::string describe_scoped_lock() {\n","golden_completion":" return \"std::scoped_lock is a RAII mutex wrapper introduced in C++17 that locks one or \"\n \"more mutexes upon construction and unlocks them upon destruction. When given \"\n \"multiple mutexes, it uses a deadlock-avoidance algorithm (equivalent to std::lock) \"\n \"to lock them in an order that prevents deadlock. It supports CTAD (class template \"\n \"argument deduction) so template arguments can be omitted. Unlike std::lock_guard, \"\n \"which only supports a single mutex, scoped_lock can lock multiple mutexes \"\n \"simultaneously and is the preferred choice since C++17.\";\n","suffix":"}\n\nint main() {\n shared_a = 100;\n shared_b = 0;\n\n std::thread t1(transfer, 30);\n std::thread t2(transfer, 20);\n t1.join();\n t2.join();\n\n assert(shared_a == 50);\n assert(shared_b == 50);\n\n std::string desc = describe_scoped_lock();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_scoped_lock();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"deadlock\") != std::string::npos);\nassert(low.find(\"raii\") != std::string::npos);\nassert(low.find(\"ctad\") != std::string::npos || low.find(\"class template argument deduction\") != std::string::npos || low.find(\"template argument deduction\") != std::string::npos);\nassert(low.find(\"lock_guard\") != std::string::npos);\nassert(low.find(\"multiple\") != std::string::npos || low.find(\"multi\") != std::string::npos);\nassert(low.find(\"single\") != std::string::npos || low.find(\"one mutex\") != std::string::npos);\n","category":"api_usage"} {"id":"42","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cmutex\u003e\n#include \u003ccondition_variable\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\n// A counting semaphore implementation using mutex + condition_variable.\n// Models the C++20 std::counting_semaphore pattern in C++17.\n// acquire() blocks if count is 0, release() increments count,\n// try_acquire() is non-blocking.\nclass Semaphore {\n std::mutex mtx;\n std::condition_variable cv;\n int count_;\n int max_count_;\npublic:\n explicit Semaphore(int initial, int max_val = 1000)\n : count_(initial), max_count_(max_val) {}\n\n void acquire() {\n std::unique_lock\u003cstd::mutex\u003e lock(mtx);\n cv.wait(lock, [this] { return count_ \u003e 0; });\n --count_;\n }\n\n void release() {\n std::lock_guard\u003cstd::mutex\u003e lock(mtx);\n if (count_ \u003c max_count_) ++count_;\n cv.notify_one();\n }\n\n bool try_acquire() {\n std::lock_guard\u003cstd::mutex\u003e lock(mtx);\n if (count_ \u003e 0) { --count_; return true; }\n return false;\n }\n\n int count() const { return count_; }\n};\n\n// Return a precise description of the counting semaphore pattern.\nstd::string describe_counting_semaphore() {\n","golden_completion":" return \"A counting semaphore maintains an internal counter initialized to a given value. \"\n \"acquire() blocks the calling thread (using condition_variable::wait) until the \"\n \"counter is positive, then decrements it atomically. release() increments the \"\n \"counter (up to a maximum count) and notifies one waiting thread via notify_one(). \"\n \"try_acquire() is a non-blocking variant that returns true and decrements if the \"\n \"counter is positive, or returns false immediately without blocking. The C++20 \"\n \"std::counting_semaphore provides this natively with std::binary_semaphore as \"\n \"a special case with max count of 1.\";\n","suffix":"}\n\nint main() {\n Semaphore sem(2);\n assert(sem.try_acquire());\n assert(sem.try_acquire());\n assert(!sem.try_acquire()); // count is 0\n\n sem.release();\n assert(sem.try_acquire());\n\n std::string desc = describe_counting_semaphore();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_counting_semaphore();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"acquire\") != std::string::npos \u0026\u0026 low.find(\"block\") != std::string::npos);\nassert(low.find(\"release\") != std::string::npos \u0026\u0026 low.find(\"increment\") != std::string::npos);\nassert(low.find(\"max\") != std::string::npos || low.find(\"maximum\") != std::string::npos);\nassert(low.find(\"try_acquire\") != std::string::npos || low.find(\"non-blocking\") != std::string::npos || low.find(\"nonblocking\") != std::string::npos);\nassert(low.find(\"counter\") != std::string::npos || low.find(\"count\") != std::string::npos);\nassert(low.find(\"decrement\") != std::string::npos);\n","category":"api_usage"} {"id":"43","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003ccstddef\u003e\n#include \u003carray\u003e\n\n// A lightweight non-owning view over a contiguous range of elements,\n// modeled after C++20 std::span. Uses raw pointer + size in C++17.\ntemplate \u003ctypename T\u003e\nclass Span {\n T* data_;\n std::size_t size_;\npublic:\n Span(T* ptr, std::size_t n) : data_(ptr), size_(n) {}\n\n template \u003cstd::size_t N\u003e\n Span(T (\u0026arr)[N]) : data_(arr), size_(N) {} // from C-array\n\n Span(std::vector\u003cT\u003e\u0026 v) : data_(v.data()), size_(v.size()) {} // from vector\n\n T* data() const { return data_; }\n std::size_t size() const { return size_; }\n T\u0026 operator[](std::size_t i) const { return data_[i]; }\n T* begin() const { return data_; }\n T* end() const { return data_ + size_; }\n\n Span subspan(std::size_t offset, std::size_t count) const {\n return Span(data_ + offset, count);\n }\n};\n\n// Return a precise description of the span/non-owning view pattern.\nstd::string describe_span() {\n","golden_completion":" return \"A span is a non-owning view over a contiguous sequence of elements. It stores \"\n \"a pointer and a size, providing lightweight access without copying. Unlike \"\n \"containers, it does not manage the lifetime of the underlying data — the caller \"\n \"must ensure the data outlives the span. C++20 std::span supports both static \"\n \"extent (size known at compile time, stored in type) and dynamic extent (size \"\n \"known at runtime, stored as member). subspan() returns a view over a subset \"\n \"of elements. It can be constructed from arrays, vectors, or raw pointer+size.\";\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e v = {10, 20, 30, 40, 50};\n Span\u003cint\u003e s(v);\n assert(s.size() == 5);\n assert(s[2] == 30);\n\n auto sub = s.subspan(1, 3);\n assert(sub.size() == 3);\n assert(sub[0] == 20);\n assert(sub[2] == 40);\n\n int arr[] = {1, 2, 3};\n Span\u003cint\u003e sa(arr);\n assert(sa.size() == 3);\n\n std::string desc = describe_span();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_span();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"non-owning\") != std::string::npos || low.find(\"non owning\") != std::string::npos);\nassert(low.find(\"contiguous\") != std::string::npos);\nassert(low.find(\"static\") != std::string::npos \u0026\u0026 low.find(\"dynamic\") != std::string::npos);\nassert(low.find(\"extent\") != std::string::npos);\nassert(low.find(\"subspan\") != std::string::npos || low.find(\"sub_span\") != std::string::npos || low.find(\"subset\") != std::string::npos);\nassert(low.find(\"lifetime\") != std::string::npos || low.find(\"outlive\") != std::string::npos || low.find(\"dangle\") != std::string::npos);\n","category":"api_usage"} {"id":"44","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cany\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\n// Demonstrate std::any_cast with different overloads:\n// 1. Value cast: any_cast\u003cT\u003e(any) — throws bad_any_cast on type mismatch\n// 2. Pointer cast: any_cast\u003cT\u003e(\u0026any) — returns nullptr on type mismatch\n\nint safe_get_int(const std::any\u0026 a) {\n if (auto* p = std::any_cast\u003cint\u003e(\u0026a)) {\n return *p;\n }\n return -1; // default for wrong type\n}\n\nstd::string value_get_string(const std::any\u0026 a) {\n return std::any_cast\u003cstd::string\u003e(a); // throws if not string\n}\n\n// Return a precise description of std::any_cast.\nstd::string describe_any_cast() {\n","golden_completion":" return \"std::any_cast is used to extract a value from std::any. The value/reference \"\n \"overload any_cast\u003cT\u003e(any) returns a copy of the stored value and throws \"\n \"std::bad_any_cast if the stored type does not match T. The pointer overload \"\n \"any_cast\u003cT\u003e(\u0026any) returns a pointer to the stored value, or nullptr if the type \"\n \"does not match — it never throws. The reference overload any_cast\u003cT\u0026\u003e(any) \"\n \"returns a reference to the stored value without copying. The type must match \"\n \"exactly — no implicit conversions are performed (e.g., int cannot be cast to long).\";\n","suffix":"}\n\nint main() {\n std::any a = 42;\n assert(safe_get_int(a) == 42);\n assert(safe_get_int(std::any(std::string(\"hello\"))) == -1);\n\n std::any s = std::string(\"world\");\n assert(value_get_string(s) == \"world\");\n\n bool threw = false;\n try {\n value_get_string(std::any(123));\n } catch (const std::bad_any_cast\u0026) {\n threw = true;\n }\n assert(threw);\n\n std::string desc = describe_any_cast();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_any_cast();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"bad_any_cast\") != std::string::npos);\nassert(low.find(\"throw\") != std::string::npos);\nassert(low.find(\"nullptr\") != std::string::npos);\nassert(low.find(\"pointer\") != std::string::npos);\nassert(low.find(\"reference\") != std::string::npos);\nassert(low.find(\"exact\") != std::string::npos || low.find(\"no implicit\") != std::string::npos || low.find(\"must match\") != std::string::npos);\n","category":"api_usage"} {"id":"45","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\n// Demonstrate weak_ptr::lock() — atomically creates a shared_ptr from a weak_ptr.\n// Returns an empty shared_ptr if the managed object has been deleted.\n// This is thread-safe unlike checking expired() then constructing shared_ptr.\n\nclass Observer {\n std::weak_ptr\u003cint\u003e target_;\npublic:\n void watch(std::shared_ptr\u003cint\u003e t) { target_ = t; }\n\n int read_or_default(int def) {\n if (auto sp = target_.lock()) {\n return *sp; // object still alive\n }\n return def; // object expired\n }\n\n bool is_alive() const { return !target_.expired(); }\n long use_count() const { return target_.use_count(); }\n};\n\n// Return a precise description of std::weak_ptr::lock.\nstd::string describe_weak_ptr_lock() {\n","golden_completion":" return \"std::weak_ptr::lock() atomically creates a shared_ptr that shares ownership of \"\n \"the managed object. If the weak_ptr has expired (the managed object was deleted), \"\n \"lock() returns an empty shared_ptr (not null pointer — an empty shared_ptr with \"\n \"use_count() == 0). This is thread-safe: the check-and-promote operation is atomic, \"\n \"unlike the non-atomic pattern of checking expired() then constructing a shared_ptr. \"\n \"The returned shared_ptr increments the use_count. expired() is equivalent to \"\n \"use_count() == 0 but may be faster.\";\n","suffix":"}\n\nint main() {\n Observer obs;\n {\n auto sp = std::make_shared\u003cint\u003e(99);\n obs.watch(sp);\n assert(obs.read_or_default(-1) == 99);\n assert(obs.is_alive());\n assert(obs.use_count() == 1);\n }\n // sp destroyed\n assert(!obs.is_alive());\n assert(obs.read_or_default(-1) == -1);\n assert(obs.use_count() == 0);\n\n std::string desc = describe_weak_ptr_lock();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_weak_ptr_lock();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"shared_ptr\") != std::string::npos);\nassert(low.find(\"empty\") != std::string::npos || low.find(\"null\") != std::string::npos);\nassert(low.find(\"thread-safe\") != std::string::npos || low.find(\"thread safe\") != std::string::npos || low.find(\"atomic\") != std::string::npos);\nassert(low.find(\"expired\") != std::string::npos);\nassert(low.find(\"use_count\") != std::string::npos);\nassert(low.find(\"promote\") != std::string::npos || low.find(\"ownership\") != std::string::npos || low.find(\"increment\") != std::string::npos);\n","category":"api_usage"} {"id":"46","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003ctuple\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cutility\u003e\n\n// Concatenate tuples using std::tuple_cat.\n// It creates a new tuple by concatenating all elements from the input tuples.\n// Also works with pairs (which are tuple-like).\n\nauto concat_example() {\n auto t1 = std::make_tuple(1, 2.0);\n auto t2 = std::make_tuple(std::string(\"hi\"), \u0027x\u0027);\n return std::tuple_cat(t1, t2);\n}\n\nauto concat_with_pair() {\n auto t = std::make_tuple(10);\n auto p = std::make_pair(std::string(\"key\"), 20);\n return std::tuple_cat(t, p);\n}\n\n// Return a precise description of std::tuple_cat.\nstd::string describe_tuple_cat() {\n","golden_completion":" return \"std::tuple_cat concatenates multiple tuple-like objects into a single new tuple. \"\n \"The resulting tuple contains all elements from each input in order, and its size \"\n \"is the sum of the sizes of all input tuples. It works with std::tuple, std::pair, \"\n \"and std::array since they all satisfy the tuple-like concept. The return type is \"\n \"a std::tuple containing copies of all elements. It accepts any number of arguments \"\n \"including zero (returns empty tuple). Elements are copied or moved from the inputs.\";\n","suffix":"}\n\nint main() {\n auto r1 = concat_example();\n static_assert(std::tuple_size\u003cdecltype(r1)\u003e::value == 4);\n assert(std::get\u003c0\u003e(r1) == 1);\n assert(std::get\u003c2\u003e(r1) == \"hi\");\n\n auto r2 = concat_with_pair();\n static_assert(std::tuple_size\u003cdecltype(r2)\u003e::value == 3);\n assert(std::get\u003c0\u003e(r2) == 10);\n assert(std::get\u003c1\u003e(r2) == \"key\");\n assert(std::get\u003c2\u003e(r2) == 20);\n\n std::string desc = describe_tuple_cat();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_tuple_cat();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"concatenat\") != std::string::npos);\nassert(low.find(\"new tuple\") != std::string::npos || low.find(\"new std::tuple\") != std::string::npos || low.find(\"single tuple\") != std::string::npos);\nassert(low.find(\"pair\") != std::string::npos);\nassert(low.find(\"sum\") != std::string::npos || low.find(\"total\") != std::string::npos);\nassert(low.find(\"array\") != std::string::npos || low.find(\"tuple-like\") != std::string::npos);\nassert(low.find(\"copy\") != std::string::npos || low.find(\"copies\") != std::string::npos || low.find(\"copied\") != std::string::npos || low.find(\"move\") != std::string::npos);\n","category":"api_usage"} {"id":"47","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cfunctional\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n\n// Use std::search with different searcher objects (C++17).\n// The searcher overload: std::search(first, last, searcher)\n// Available searchers: default_searcher, boyer_moore_searcher,\n// boyer_moore_horspool_searcher.\n\nstd::size_t find_pattern_default(const std::string\u0026 text, const std::string\u0026 pattern) {\n auto it = std::search(text.begin(), text.end(),\n std::default_searcher(pattern.begin(), pattern.end()));\n if (it == text.end()) return std::string::npos;\n return std::distance(text.begin(), it);\n}\n\nstd::size_t find_pattern_bm(const std::string\u0026 text, const std::string\u0026 pattern) {\n auto it = std::search(text.begin(), text.end(),\n std::boyer_moore_searcher(pattern.begin(), pattern.end()));\n if (it == text.end()) return std::string::npos;\n return std::distance(text.begin(), it);\n}\n\n// Return a precise description of std::search with searcher objects.\nstd::string describe_search_searchers() {\n","golden_completion":" return \"The C++17 std::search overload accepts a Searcher object that encapsulates the \"\n \"search algorithm and any preprocessing. std::default_searcher uses the basic \"\n \"O(n*m) worst-case algorithm. std::boyer_moore_searcher preprocesses the pattern \"\n \"to build skip tables, achieving O(n/m) best-case and O(n*m) worst-case. \"\n \"std::boyer_moore_horspool_searcher uses only the bad-character table for simpler \"\n \"preprocessing. The searcher is constructed with the pattern range and can be \"\n \"reused across multiple searches. The function returns an iterator to the first \"\n \"occurrence or last if not found.\";\n","suffix":"}\n\nint main() {\n std::string text = \"the quick brown fox jumps over the lazy dog\";\n assert(find_pattern_default(text, \"fox\") == 16);\n assert(find_pattern_bm(text, \"fox\") == 16);\n assert(find_pattern_default(text, \"cat\") == std::string::npos);\n assert(find_pattern_bm(text, \"lazy\") == 35);\n\n std::string desc = describe_search_searchers();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_search_searchers();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"searcher\") != std::string::npos);\nassert(low.find(\"preprocessing\") != std::string::npos || low.find(\"preprocess\") != std::string::npos || low.find(\"skip table\") != std::string::npos);\nassert(low.find(\"o(n/m)\") != std::string::npos || low.find(\"sublinear\") != std::string::npos || (low.find(\"n/m\") != std::string::npos));\nassert(low.find(\"default_searcher\") != std::string::npos || low.find(\"default searcher\") != std::string::npos);\nassert(low.find(\"boyer_moore\") != std::string::npos || low.find(\"boyer-moore\") != std::string::npos);\nassert(low.find(\"reuse\") != std::string::npos || low.find(\"re-use\") != std::string::npos || low.find(\"multiple search\") != std::string::npos || low.find(\"horspool\") != std::string::npos);\n","category":"api_usage"} {"id":"48","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003cset\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cmap\u003e\n\n// Demonstrate std::set::extract — removes a node from the set without\n// copying or moving the element. Returns a node_handle that owns the element.\n// The key can be modified before reinsertion.\n\nstd::set\u003cint\u003e modify_key(std::set\u003cint\u003e s, int old_key, int new_key) {\n auto nh = s.extract(old_key);\n if (!nh.empty()) {\n nh.value() = new_key;\n s.insert(std::move(nh));\n }\n return s;\n}\n\n// Return a precise description of std::set::extract and node handles.\nstd::string describe_set_extract() {\n","golden_completion":" return \"std::set::extract (C++17) removes a node from the container and returns a \"\n \"node_handle that holds sole ownership of the extracted element. No copy or move \"\n \"of the element value occurs during extraction — the node is simply unlinked from \"\n \"the tree. The node_handle provides value() (for set) or key()/mapped() (for map) \"\n \"to access and modify the element. After modification, the node can be reinserted \"\n \"via insert(std::move(node_handle)). If the key was not found, extract returns an \"\n \"empty node_handle (empty() returns true). This enables key modification without \"\n \"erase+insert, avoiding unnecessary copy/move and allocation/deallocation.\";\n","suffix":"}\n\nint main() {\n std::set\u003cint\u003e s = {10, 20, 30, 40};\n\n auto result = modify_key(s, 20, 25);\n assert(result.count(20) == 0);\n assert(result.count(25) == 1);\n assert(result.size() == 4);\n\n // Extract non-existent key\n auto nh = s.extract(999);\n assert(nh.empty());\n\n std::string desc = describe_set_extract();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_set_extract();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"node\") != std::string::npos \u0026\u0026 low.find(\"handle\") != std::string::npos);\nassert(low.find(\"no copy\") != std::string::npos || low.find(\"without copy\") != std::string::npos || low.find(\"no move\") != std::string::npos || (low.find(\"copy\") != std::string::npos \u0026\u0026 low.find(\"move\") != std::string::npos));\nassert(low.find(\"modify\") != std::string::npos || low.find(\"change\") != std::string::npos);\nassert(low.find(\"key\") != std::string::npos);\nassert(low.find(\"reinsert\") != std::string::npos || low.find(\"re-insert\") != std::string::npos || low.find(\"insert(\") != std::string::npos || low.find(\"insert(std::move\") != std::string::npos);\nassert(low.find(\"empty\") != std::string::npos);\n","category":"api_usage"} {"id":"49","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003ccstddef\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003ccstdlib\u003e\n#include \u003cnew\u003e\n\n// A monotonic (bump) allocator: allocations advance a pointer, individual\n// deallocation is a no-op, all memory is freed at once on destruction.\n// Models std::pmr::monotonic_buffer_resource from C++17 \u003cmemory_resource\u003e.\n\nclass MonotonicAllocator {\n char* buffer_;\n std::size_t capacity_;\n std::size_t offset_;\n bool owns_buffer_;\npublic:\n // Use an external buffer\n MonotonicAllocator(void* buf, std::size_t cap)\n : buffer_(static_cast\u003cchar*\u003e(buf)), capacity_(cap), offset_(0), owns_buffer_(false) {}\n\n // Allocate internal buffer\n explicit MonotonicAllocator(std::size_t cap)\n : buffer_(new char[cap]), capacity_(cap), offset_(0), owns_buffer_(true) {}\n\n void* allocate(std::size_t bytes, std::size_t alignment = alignof(std::max_align_t)) {\n std::size_t space = capacity_ - offset_;\n void* ptr = buffer_ + offset_;\n if (std::align(alignment, bytes, ptr, space)) {\n offset_ = static_cast\u003cchar*\u003e(ptr) - buffer_ + bytes;\n return ptr;\n }\n throw std::bad_alloc(); // falls through to upstream or fails\n }\n\n void deallocate(void*, std::size_t) {\n // No-op: individual deallocation is not supported\n }\n\n std::size_t used() const { return offset_; }\n\n ~MonotonicAllocator() {\n if (owns_buffer_) delete[] buffer_;\n }\n};\n\n// Return a precise description of monotonic buffer resources.\nstd::string describe_monotonic_buffer() {\n","golden_completion":" return \"A monotonic buffer resource (std::pmr::monotonic_buffer_resource) is a bump \"\n \"allocator that advances a pointer for each allocation. Individual deallocation \"\n \"is a no-op — memory is only freed when the resource is destroyed or reset. This \"\n \"makes allocation extremely fast (typically just a pointer increment plus alignment) \"\n \"but unsuitable for long-lived allocations with individual lifetimes. An optional \"\n \"upstream resource provides additional memory when the initial buffer is exhausted. \"\n \"It can be initialized with a pre-allocated buffer for zero-allocation scenarios.\";\n","suffix":"}\n\nint main() {\n alignas(16) char buf[256];\n MonotonicAllocator alloc(buf, sizeof(buf));\n\n int* p1 = static_cast\u003cint*\u003e(alloc.allocate(sizeof(int)));\n *p1 = 42;\n int* p2 = static_cast\u003cint*\u003e(alloc.allocate(sizeof(int)));\n *p2 = 99;\n\n assert(*p1 == 42);\n assert(*p2 == 99);\n assert(alloc.used() \u003e 0);\n\n // Deallocation is no-op\n alloc.deallocate(p1, sizeof(int));\n alloc.deallocate(p2, sizeof(int));\n\n std::string desc = describe_monotonic_buffer();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_monotonic_buffer();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"bump\") != std::string::npos || low.find(\"monotonic\") != std::string::npos);\nassert(low.find(\"no-op\") != std::string::npos || low.find(\"no op\") != std::string::npos || low.find(\"individual dealloc\") != std::string::npos || low.find(\"no individual\") != std::string::npos);\nassert(low.find(\"fast\") != std::string::npos || low.find(\"pointer increment\") != std::string::npos || low.find(\"pointer advance\") != std::string::npos);\nassert(low.find(\"upstream\") != std::string::npos || low.find(\"additional memory\") != std::string::npos || low.find(\"fallback\") != std::string::npos);\nassert(low.find(\"destroy\") != std::string::npos || low.find(\"freed\") != std::string::npos || low.find(\"reset\") != std::string::npos);\n","category":"api_usage"} {"id":"50","testsource":"devbench-api-usage","language":"cpp","prefix":"#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003cutility\u003e\n\n// std::iter_swap vs std::swap:\n// iter_swap(a, b) swaps the values pointed to by iterators a and b\n// swap(a, b) swaps two values directly via references\n\nvoid demo_iter_swap(std::vector\u003cint\u003e\u0026 v, int i, int j) {\n std::iter_swap(v.begin() + i, v.begin() + j);\n}\n\nvoid demo_swap(int\u0026 a, int\u0026 b) {\n std::swap(a, b);\n}\n\n// Return a precise description comparing std::iter_swap and std::swap.\nstd::string describe_iter_swap_vs_swap() {\n","golden_completion":" return \"std::iter_swap(a, b) swaps the values that two iterators point to by first \"\n \"dereferencing them. It is equivalent to std::swap(*a, *b) but uses argument-\"\n \"dependent lookup (ADL) to find a specialized swap for the value type if one \"\n \"exists. std::swap(a, b) takes two references and swaps their values using move \"\n \"semantics (one move construction + two move assignments). iter_swap operates on \"\n \"iterators while swap operates on direct references. iter_swap is typically used \"\n \"in generic algorithms that work with iterators rather than values directly.\";\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e v = {10, 20, 30};\n demo_iter_swap(v, 0, 2);\n assert((v == std::vector\u003cint\u003e{30, 20, 10}));\n\n int a = 5, b = 10;\n demo_swap(a, b);\n assert(a == 10 \u0026\u0026 b == 5);\n\n std::string desc = describe_iter_swap_vs_swap();\n assert(!desc.empty());\n\n std::cout \u003c\u003c \"All tests passed.\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"std::string d = describe_iter_swap_vs_swap();\nstd::string low = d;\nstd::transform(low.begin(), low.end(), low.begin(), ::tolower);\nassert(low.find(\"dereference\") != std::string::npos || low.find(\"deref\") != std::string::npos || low.find(\"*a\") != std::string::npos);\nassert(low.find(\"iterator\") != std::string::npos);\nassert(low.find(\"reference\") != std::string::npos);\nassert(low.find(\"adl\") != std::string::npos || low.find(\"argument-dependent\") != std::string::npos || low.find(\"argument dependent\") != std::string::npos);\nassert(low.find(\"swap\") != std::string::npos);\nassert(low.find(\"move\") != std::string::npos);\n","category":"api_usage"} {"id":"1","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003csstream\u003e\nusing namespace std;\n\nstruct ClaimResult {\n string status;\n double patient;\n double plan;\n double deductibleApplied;\n double coinsuranceApplied;\n};\n\nstruct Adjudicator {\n double copay = 30.0;\n double annualDeductible = 500.0;\n double oopMax = 1000.0;\n double coinsuranceRate = 0.20;\n double ytdDeductible = 0.0;\n double ytdOop = 0.0;\n map\u003cstring, double\u003e allowedRates;\n set\u003cstring\u003e requiresAuth;\n set\u003cstring\u003e authorizedClaims;\n set\u003cstring\u003e processedClaims;\n vector\u003cstring\u003e claimLedger;\n\n Adjudicator() {\n allowedRates[\"XRAY\"] = 0.50;\n allowedRates[\"THERAPY\"] = 0.80;\n allowedRates[\"SURGERY\"] = 0.60;\n requiresAuth.insert(\"SURGERY\");\n }\n\n void reset() {\n ytdDeductible = 0; ytdOop = 0;\n authorizedClaims.clear(); processedClaims.clear(); claimLedger.clear();\n }\n\n static double roundCents(double v) {\n return round(v * 100.0) / 100.0;\n }\n\n // Adjudicate one medical claim line.\n // Rules:\n // 1. claimId is idempotent: if already processed, return empty result with status \"DUPLICATE\" before any mutation.\n // 2. Unknown codes or missing auth for auth-required codes → status \"DENIED\", log \"DENIED:\u003cclaimId\u003e:\u003ccode\u003e\", no accumulator changes.\n // 3. allowed = billed * allowedRates[code]. remaining = max(0, allowed - primaryPaid).\n // 4. Preventive lines: patient=0, plan=remaining, no deductible/OOP mutation.\n // 5. Non-preventive waterfall: copay first (capped at remaining), then deductible on remainder\n // (capped at annualDeductible - ytdDeductible), then coinsurance on the rest.\n // 6. patient = copayUsed + deductibleUsed + coinsuranceUsed, but clamped to (oopMax - ytdOop).\n // If clamped, the excess shifts to plan.\n // 7. plan = remaining - patient (never negative).\n // 8. Update ytdDeductible += deductibleUsed, ytdOop += patient.\n // 9. Log \"PAID:\u003cclaimId\u003e:patient=\u003cpatient\u003e:plan=\u003cplan\u003e\".\n // Return ClaimResult with all money fields rounded to cents.\n ClaimResult adjudicateLine(const string\u0026 claimId, const string\u0026 code,\n double billed, bool preventive, double primaryPaid) {\n","golden_completion":" ClaimResult res;\n if (processedClaims.count(claimId)) { res.status = \"DUPLICATE\"; res.patient = res.plan = res.deductibleApplied = res.coinsuranceApplied = 0; return res; }\n auto it = allowedRates.find(code);\n if (it == allowedRates.end() || (requiresAuth.count(code) \u0026\u0026 !authorizedClaims.count(claimId))) {\n processedClaims.insert(claimId);\n claimLedger.push_back(\"DENIED:\" + claimId + \":\" + code);\n res.status = \"DENIED\"; res.patient = res.plan = res.deductibleApplied = res.coinsuranceApplied = 0; return res;\n }\n processedClaims.insert(claimId);\n double allowed = roundCents(billed * it-\u003esecond);\n double remaining = roundCents(allowed - primaryPaid); if (remaining \u003c 0) remaining = 0;\n double pat = 0, ded = 0, coins = 0;\n if (!preventive \u0026\u0026 remaining \u003e 0) {\n double copayUsed = min(copay, remaining); remaining -= copayUsed;\n double dedAvail = annualDeductible - ytdDeductible; if (dedAvail \u003c 0) dedAvail = 0;\n ded = roundCents(min(remaining, dedAvail)); remaining -= ded;\n coins = roundCents(remaining * coinsuranceRate);\n pat = roundCents(copayUsed + ded + coins);\n double capLeft = oopMax - ytdOop; if (capLeft \u003c 0) capLeft = 0;\n if (pat \u003e capLeft) pat = roundCents(capLeft);\n ytdDeductible = roundCents(ytdDeductible + ded);\n ytdOop = roundCents(ytdOop + pat);\n }\n double planPay = roundCents(roundCents(allowed - primaryPaid) - pat); if (planPay \u003c 0) planPay = 0;\n claimLedger.push_back(\"PAID:\" + claimId + \":patient=\" + to_string(pat) + \":plan=\" + to_string(planPay));\n res.status = \"PAID\"; res.patient = pat; res.plan = planPay; res.deductibleApplied = ded; res.coinsuranceApplied = coins;\n return res;\n","suffix":" }\n};\n\nint main() {\n Adjudicator adj;\n adj.reset();\n ClaimResult r1 = adj.adjudicateLine(\"C1\", \"THERAPY\", 400.0, false, 20.0);\n // allowed=320, remaining=300, copay=30, ded=270, coins=0, patient=300\n assert(r1.status == \"PAID\");\n assert(abs(r1.patient - 300.0) \u003c 0.01);\n assert(abs(r1.deductibleApplied - 270.0) \u003c 0.01);\n assert(abs(adj.ytdDeductible - 270.0) \u003c 0.01);\n\n ClaimResult r2 = adj.adjudicateLine(\"C2\", \"XRAY\", 100.0, true, 0.0);\n assert(abs(r2.patient - 0.0) \u003c 0.01);\n assert(abs(r2.plan - 50.0) \u003c 0.01);\n assert(abs(adj.ytdOop - 300.0) \u003c 0.01); // preventive doesn\u0027t add OOP\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate: must return DUPLICATE, no mutation\n int ledgerBefore = (int)adj.claimLedger.size();\n double oopBefore = adj.ytdOop;\n ClaimResult dup = adj.adjudicateLine(\"C1\", \"THERAPY\", 999.0, false, 0.0);\n assert(dup.status == \"DUPLICATE\");\n assert((int)adj.claimLedger.size() == ledgerBefore);\n assert(abs(adj.ytdOop - oopBefore) \u003c 0.01);\n\n // Denied: SURGERY without auth\n double dedBefore = adj.ytdDeductible;\n ClaimResult denied = adj.adjudicateLine(\"S1\", \"SURGERY\", 1000.0, false, 0.0);\n assert(denied.status == \"DENIED\");\n assert(abs(denied.patient) \u003c 0.01);\n assert(abs(adj.ytdDeductible - dedBefore) \u003c 0.01);\n\n // OOP cap test\n adj.authorizedClaims.insert(\"S2\");\n adj.ytdDeductible = 500.0;\n adj.ytdOop = 950.0;\n ClaimResult capped = adj.adjudicateLine(\"S2\", \"SURGERY\", 1000.0, false, 0.0);\n // allowed=600, copay=30, ded=0 (full), coins=570*0.2=114, pat=144 but cap leaves 50\n assert(abs(capped.patient - 50.0) \u003c 0.01);\n assert(abs(capped.plan - 550.0) \u003c 0.01);\n assert(abs(adj.ytdOop - 1000.0) \u003c 0.01);\n\n // Primary pays all\n ClaimResult fullPrimary = adj.adjudicateLine(\"X3\", \"XRAY\", 100.0, false, 100.0);\n assert(abs(fullPrimary.patient) \u003c 0.01);\n assert(abs(fullPrimary.plan) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"2","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003ccmath\u003e\nusing namespace std;\n\nstruct Lot {\n string lotId;\n int qty;\n int expiryDay;\n bool quarantined;\n};\n\nstruct AllocResult {\n string status; // \"ALLOCATED\", \"PARTIAL\", \"DUPLICATE\", \"INSUFFICIENT\", \"EXPIRED_ALL\"\n int totalAllocated;\n vector\u003cpair\u003cstring,int\u003e\u003e allocations; // lotId -\u003e qty allocated\n};\n\nstruct Warehouse {\n vector\u003cLot\u003e lots;\n set\u003cstring\u003e processedTickets;\n vector\u003cstring\u003e auditLog;\n int minShelfLifeDays = 30;\n\n void reset() {\n lots.clear(); processedTickets.clear(); auditLog.clear();\n }\n\n void addLot(const string\u0026 id, int qty, int expiry, bool quarantined) {\n lots.push_back({id, qty, expiry, quarantined});\n }\n\n // Allocate inventory using First-Expiry-First-Out (FEFO).\n // Rules:\n // 1. ticketId is idempotent: duplicates return DUPLICATE with no mutation.\n // 2. Filter out quarantined lots and lots with (expiryDay - currentDay) \u003c minShelfLifeDays.\n // 3. Sort eligible lots by expiryDay ascending (FEFO).\n // 4. If no eligible lots exist, return EXPIRED_ALL.\n // 5. Allocate from earliest-expiry lots first, reducing lot qty.\n // 6. If total eligible qty \u003c requested: return INSUFFICIENT with NO lot mutation (atomic failure).\n // 7. If allocated == requested: status ALLOCATED.\n // 8. Log \"ALLOC:\u003cticketId\u003e:qty=\u003ctotalAllocated\u003e\" for success,\n // \"DENY:\u003cticketId\u003e:\u003creason\u003e\" for failures.\n AllocResult allocate(const string\u0026 ticketId, int requested, int currentDay) {\n","golden_completion":" AllocResult res;\n if (processedTickets.count(ticketId)) { res.status = \"DUPLICATE\"; res.totalAllocated = 0; return res; }\n // Filter eligible lots\n struct EligibleLot { int idx; int expiryDay; int qty; };\n vector\u003cEligibleLot\u003e eligible;\n for (int i = 0; i \u003c (int)lots.size(); i++) {\n if (!lots[i].quarantined \u0026\u0026 (lots[i].expiryDay - currentDay) \u003e= minShelfLifeDays \u0026\u0026 lots[i].qty \u003e 0)\n eligible.push_back({i, lots[i].expiryDay, lots[i].qty});\n }\n if (eligible.empty()) { processedTickets.insert(ticketId); auditLog.push_back(\"DENY:\" + ticketId + \":EXPIRED_ALL\"); res.status = \"EXPIRED_ALL\"; res.totalAllocated = 0; return res; }\n sort(eligible.begin(), eligible.end(), [](const EligibleLot\u0026 a, const EligibleLot\u0026 b){ return a.expiryDay \u003c b.expiryDay; });\n int totalAvail = 0; for (auto\u0026 e : eligible) totalAvail += e.qty;\n if (totalAvail \u003c requested) { processedTickets.insert(ticketId); auditLog.push_back(\"DENY:\" + ticketId + \":INSUFFICIENT\"); res.status = \"INSUFFICIENT\"; res.totalAllocated = 0; return res; }\n processedTickets.insert(ticketId);\n int remaining = requested; res.totalAllocated = 0;\n for (auto\u0026 e : eligible) {\n if (remaining \u003c= 0) break;\n int take = min(remaining, e.qty);\n lots[e.idx].qty -= take; remaining -= take; res.totalAllocated += take;\n res.allocations.push_back({lots[e.idx].lotId, take});\n }\n res.status = \"ALLOCATED\";\n auditLog.push_back(\"ALLOC:\" + ticketId + \":qty=\" + to_string(res.totalAllocated));\n return res;\n","suffix":" }\n};\n\nint main() {\n Warehouse wh;\n wh.reset();\n wh.addLot(\"L1\", 20, 100, false);\n wh.addLot(\"L2\", 30, 80, false);\n wh.addLot(\"L3\", 10, 120, true); // quarantined\n\n AllocResult r1 = wh.allocate(\"T1\", 25, 10);\n assert(r1.status == \"ALLOCATED\");\n assert(r1.totalAllocated == 25);\n // FEFO: L2 (exp80) first, then L1 (exp100)\n assert(r1.allocations[0].first == \"L2\" \u0026\u0026 r1.allocations[0].second == 25);\n\n // L2 now has 5 left, L1 has 20\n assert(wh.lots[1].qty == 5);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate check\n int logBefore = (int)wh.auditLog.size();\n AllocResult dup = wh.allocate(\"T1\", 99, 10);\n assert(dup.status == \"DUPLICATE\");\n assert((int)wh.auditLog.size() == logBefore);\n\n // Insufficient: atomic failure (no lot mutation)\n int l2Before = wh.lots[1].qty;\n int l0Before = wh.lots[0].qty;\n AllocResult insuf = wh.allocate(\"T2\", 100, 10);\n assert(insuf.status == \"INSUFFICIENT\");\n assert(wh.lots[1].qty == l2Before);\n assert(wh.lots[0].qty == l0Before);\n\n // Shelf-life filter: only L1 eligible if currentDay=75 (L2 exp80, 80-75=5 \u003c 30)\n AllocResult r3 = wh.allocate(\"T3\", 10, 75);\n assert(r3.status == \"ALLOCATED\");\n assert(r3.allocations[0].first == \"L1\");\n\n // All expired\n Warehouse wh2;\n wh2.reset();\n wh2.addLot(\"X1\", 50, 20, false);\n AllocResult expired = wh2.allocate(\"T4\", 10, 10);\n // expiryDay=20, currentDay=10, 20-10=10 \u003c 30 → EXPIRED_ALL\n assert(expired.status == \"EXPIRED_ALL\");\n assert(wh2.lots[0].qty == 50); // no mutation\n","category":"code_purpose_understanding"} {"id":"3","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\nusing namespace std;\n\nstruct PaymentResult {\n string status; // \"APPLIED\", \"DUPLICATE\", \"RECOVERY\", \"PAID_OFF\"\n double toFees;\n double toInterest;\n double toPrincipal;\n double toEscrow;\n double toSuspense;\n};\n\nstruct LoanAccount {\n double principalBalance = 0;\n double interestDue = 0;\n double escrowDue = 0;\n double feesOutstanding = 0;\n double suspenseBalance = 0;\n double lateFeeAmount = 75.0;\n bool lateFeePending = false;\n bool lateFeeApplied = false;\n string status = \"CURRENT\"; // CURRENT, DELINQUENT, PAID_OFF, CHARGED_OFF\n set\u003cstring\u003e processedPayments;\n vector\u003cstring\u003e paymentLedger;\n\n void reset(double principal, double interest, double escrow) {\n principalBalance = principal; interestDue = interest; escrowDue = escrow;\n feesOutstanding = 0; suspenseBalance = 0; lateFeePending = false;\n lateFeeApplied = false; status = \"CURRENT\";\n processedPayments.clear(); paymentLedger.clear();\n }\n\n static double r2(double v) { return round(v * 100.0) / 100.0; }\n\n // Apply a payment to the loan.\n // Rules:\n // 1. paymentId is idempotent: duplicates return DUPLICATE with no mutation.\n // 2. If status is CHARGED_OFF, all money goes to recovery suspense, status stays CHARGED_OFF,\n // return status \"RECOVERY\".\n // 3. If lateFeePending and !lateFeeApplied, add lateFeeAmount to feesOutstanding\n // and set lateFeeApplied=true (one-time fee injection).\n // 4. Waterfall: fees first, then interest, then escrow, then principal.\n // Each bucket takes min(remaining, bucketDue), reducing both.\n // 5. Any excess after principal goes to suspenseBalance.\n // 6. If principalBalance reaches 0 after payment, status becomes \"PAID_OFF\",\n // return status \"PAID_OFF\".\n // 7. Log \"PAY:\u003cpaymentId\u003e:fees=\u003cf\u003e:int=\u003ci\u003e:prin=\u003cp\u003e:esc=\u003ce\u003e:susp=\u003cs\u003e\".\n // 8. All amounts rounded to cents.\n PaymentResult applyPayment(const string\u0026 paymentId, double amount) {\n","golden_completion":" PaymentResult res;\n if (processedPayments.count(paymentId)) { res = {\"DUPLICATE\",0,0,0,0,0}; return res; }\n processedPayments.insert(paymentId);\n if (status == \"CHARGED_OFF\") {\n suspenseBalance = r2(suspenseBalance + amount);\n paymentLedger.push_back(\"PAY:\" + paymentId + \":RECOVERY:\" + to_string(amount));\n res = {\"RECOVERY\", 0, 0, 0, 0, amount}; return res;\n }\n if (lateFeePending \u0026\u0026 !lateFeeApplied) {\n feesOutstanding = r2(feesOutstanding + lateFeeAmount);\n lateFeeApplied = true;\n }\n double rem = amount;\n double toFees = r2(min(rem, feesOutstanding)); feesOutstanding = r2(feesOutstanding - toFees); rem = r2(rem - toFees);\n double toInt = r2(min(rem, interestDue)); interestDue = r2(interestDue - toInt); rem = r2(rem - toInt);\n double toEsc = r2(min(rem, escrowDue)); escrowDue = r2(escrowDue - toEsc); rem = r2(rem - toEsc);\n double toPrin = r2(min(rem, principalBalance)); principalBalance = r2(principalBalance - toPrin); rem = r2(rem - toPrin);\n double toSusp = r2(rem);\n suspenseBalance = r2(suspenseBalance + toSusp);\n string st = \"APPLIED\";\n if (principalBalance \u003c= 0.001) { status = \"PAID_OFF\"; st = \"PAID_OFF\"; }\n paymentLedger.push_back(\"PAY:\" + paymentId + \":fees=\" + to_string(toFees) + \":int=\" + to_string(toInt) + \":prin=\" + to_string(toPrin) + \":esc=\" + to_string(toEsc) + \":susp=\" + to_string(toSusp));\n res = {st, toFees, toInt, toPrin, toEsc, toSusp}; return res;\n","suffix":" }\n};\n\nint main() {\n LoanAccount loan;\n loan.reset(10000.0, 200.0, 100.0);\n loan.lateFeePending = true;\n\n PaymentResult r1 = loan.applyPayment(\"P1\", 500.0);\n // Late fee injected: fees=75, waterfall: 75 fees + 200 interest + 100 escrow + 125 principal\n assert(r1.status == \"APPLIED\");\n assert(abs(r1.toFees - 75.0) \u003c 0.01);\n assert(abs(r1.toInterest - 200.0) \u003c 0.01);\n assert(abs(r1.toEscrow - 100.0) \u003c 0.01);\n assert(abs(r1.toPrincipal - 125.0) \u003c 0.01);\n assert(abs(loan.principalBalance - 9875.0) \u003c 0.01);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate\n int ledgerBefore = (int)loan.paymentLedger.size();\n PaymentResult dup = loan.applyPayment(\"P1\", 9999.0);\n assert(dup.status == \"DUPLICATE\");\n assert((int)loan.paymentLedger.size() == ledgerBefore);\n\n // Late fee already applied — should NOT add again\n loan.lateFeePending = true; // still pending but applied\n double feesBefore = loan.feesOutstanding;\n PaymentResult r2 = loan.applyPayment(\"P2\", 50.0);\n // No new late fee. fees=0, int=0 (already paid), esc=0 (already paid), 50 to principal\n assert(abs(r2.toPrincipal - 50.0) \u003c 0.01);\n\n // Paid-off transition\n loan.interestDue = 0; loan.escrowDue = 0; loan.feesOutstanding = 0;\n double prinLeft = loan.principalBalance;\n PaymentResult r3 = loan.applyPayment(\"P3\", prinLeft + 200.0);\n assert(r3.status == \"PAID_OFF\");\n assert(abs(r3.toSuspense - 200.0) \u003c 0.01);\n assert(loan.status == \"PAID_OFF\");\n\n // Charged-off recovery\n LoanAccount loan2;\n loan2.reset(5000.0, 100.0, 50.0);\n loan2.status = \"CHARGED_OFF\";\n PaymentResult rec = loan2.applyPayment(\"R1\", 300.0);\n assert(rec.status == \"RECOVERY\");\n assert(abs(rec.toSuspense - 300.0) \u003c 0.01);\n assert(abs(loan2.principalBalance - 5000.0) \u003c 0.01); // no principal reduction\n assert(abs(loan2.interestDue - 100.0) \u003c 0.01); // no interest reduction\n","category":"code_purpose_understanding"} {"id":"4","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\nusing namespace std;\n\nstruct PayStub {\n string status;\n double grossPay;\n double retirement;\n double tax;\n double healthDeduction;\n double garnishment;\n double netPay;\n};\n\nstruct PayrollEngine {\n double annualRetirementCap = 23000.0;\n double retirementRate = 0.06;\n double healthMonthly = 250.0;\n double garnishmentRate = 0.15;\n double garnishmentMinNet = 1200.0;\n // Marginal tax brackets: [(upperLimit, rate), ...] — upperLimit=0 means no cap\n vector\u003cpair\u003cdouble,double\u003e\u003e taxBrackets = {{1000, 0.10}, {3000, 0.22}, {0, 0.32}};\n\n double ytdRetirement = 0;\n double ytdGross = 0;\n double ytdTax = 0;\n set\u003cstring\u003e processedRuns;\n vector\u003cstring\u003e payLog;\n\n void reset() {\n ytdRetirement = 0; ytdGross = 0; ytdTax = 0;\n processedRuns.clear(); payLog.clear();\n }\n\n static double r2(double v) { return round(v * 100.0) / 100.0; }\n\n // Compute one pay period.\n // Rules:\n // 1. runId is idempotent: duplicates return status \"DUPLICATE\" with no mutation.\n // 2. Retirement contribution = gross * retirementRate, but capped so ytdRetirement\n // never exceeds annualRetirementCap.\n // 3. Taxable income = gross - retirement contribution.\n // 4. Tax = marginal brackets applied to taxable income:\n // bracket[i] covers (prevLimit, bracket[i].upperLimit], rate = bracket[i].rate.\n // upperLimit=0 means unlimited.\n // 5. Health deduction is flat healthMonthly.\n // 6. Pre-garnishment net = gross - retirement - tax - health.\n // 7. Garnishment = pre-garnishment net * garnishmentRate, BUT if applying garnishment\n // would drop net below garnishmentMinNet, garnishment = max(0, preNet - garnishmentMinNet).\n // 8. Final netPay = preNet - garnishment.\n // 9. Update ytdRetirement, ytdGross, ytdTax. Log \"PAY:\u003crunId\u003e:net=\u003cnetPay\u003e\".\n // 10. All amounts rounded to cents.\n PayStub computePay(const string\u0026 runId, double gross) {\n","golden_completion":" PayStub ps;\n if (processedRuns.count(runId)) { ps.status = \"DUPLICATE\"; ps.grossPay = ps.retirement = ps.tax = ps.healthDeduction = ps.garnishment = ps.netPay = 0; return ps; }\n processedRuns.insert(runId);\n double retCap = r2(annualRetirementCap - ytdRetirement);\n if (retCap \u003c 0) retCap = 0;\n double ret = r2(min(r2(gross * retirementRate), retCap));\n double taxable = r2(gross - ret);\n double tax = 0; double prevLimit = 0;\n for (auto\u0026 [upper, rate] : taxBrackets) {\n double bracketTop = (upper == 0) ? taxable : min((double)upper, taxable);\n double inBracket = bracketTop - prevLimit;\n if (inBracket \u003e 0) tax += r2(inBracket * rate);\n prevLimit = bracketTop;\n if (upper == 0 || taxable \u003c= upper) break;\n }\n tax = r2(tax);\n double health = healthMonthly;\n double preNet = r2(gross - ret - tax - health);\n double garn = r2(preNet * garnishmentRate);\n if (preNet - garn \u003c garnishmentMinNet) garn = r2(max(0.0, preNet - garnishmentMinNet));\n double netPay = r2(preNet - garn);\n ytdRetirement = r2(ytdRetirement + ret);\n ytdGross = r2(ytdGross + gross);\n ytdTax = r2(ytdTax + tax);\n payLog.push_back(\"PAY:\" + runId + \":net=\" + to_string(netPay));\n ps = {\"OK\", gross, ret, tax, health, garn, netPay};\n return ps;\n","suffix":" }\n};\n\nint main() {\n PayrollEngine pe;\n pe.reset();\n\n PayStub s1 = pe.computePay(\"R1\", 5000.0);\n // retirement: 5000*0.06=300\n // taxable: 4700\n // tax: 1000*0.10 + 2000*0.22 + 1700*0.32 = 100+440+544 = 1084\n // health: 250\n // preNet: 5000-300-1084-250 = 3366\n // garn: 3366*0.15 = 504.90\n // net: 3366-504.90 = 2861.10\n assert(s1.status == \"OK\");\n assert(abs(s1.retirement - 300.0) \u003c 0.01);\n assert(abs(s1.tax - 1084.0) \u003c 0.01);\n assert(abs(s1.netPay - 2861.10) \u003c 0.01);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate\n PayStub dup = pe.computePay(\"R1\", 9999.0);\n assert(dup.status == \"DUPLICATE\");\n assert(abs(pe.ytdGross - 5000.0) \u003c 0.01);\n\n // Retirement cap: set ytd near cap\n pe.ytdRetirement = 22800.0;\n PayStub s2 = pe.computePay(\"R2\", 5000.0);\n // cap: 23000 - 22800 = 200 (not 300)\n assert(abs(s2.retirement - 200.0) \u003c 0.01);\n assert(abs(pe.ytdRetirement - 23000.0) \u003c 0.01);\n\n // Garnishment min-net clamp\n PayrollEngine pe2;\n pe2.reset();\n pe2.garnishmentMinNet = 3000.0;\n PayStub s3 = pe2.computePay(\"R3\", 5000.0);\n // preNet = 5000-300-1084-250 = 3366\n // garn = 3366*0.15 = 504.90 would make net 2861.10 \u003c 3000\n // so garn = max(0, 3366 - 3000) = 366\n assert(abs(s3.garnishment - 366.0) \u003c 0.01);\n assert(abs(s3.netPay - 3000.0) \u003c 0.01);\n\n // Low income: no garnishment at all (preNet \u003c minNet)\n PayrollEngine pe3;\n pe3.reset();\n pe3.garnishmentMinNet = 5000.0;\n PayStub s4 = pe3.computePay(\"R4\", 2000.0);\n // retirement: 120, taxable: 1880, tax: 1000*0.10+880*0.22=100+193.6=293.6\n // preNet: 2000-120-293.6-250=1336.4 \u003c 5000 → garn=0\n assert(abs(s4.garnishment) \u003c 0.01);\n assert(abs(s4.netPay - 1336.40) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"5","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003ccmath\u003e\nusing namespace std;\n\nstruct FulfillResult {\n string status; // \"FULFILLED\", \"PARTIAL\", \"DUPLICATE\", \"CANCELLED\", \"NO_STOCK\"\n int shipped;\n int backordered;\n string label; // shipping label or \"\"\n};\n\nstruct FulfillmentCenter {\n map\u003cstring,int\u003e inventory; // sku -\u003e qty\n set\u003cstring\u003e processedOrders;\n set\u003cstring\u003e cancelledOrders;\n vector\u003cstring\u003e shipLog;\n vector\u003cstring\u003e backorderQueue;\n int labelSeq = 1000;\n\n void reset() {\n inventory.clear(); processedOrders.clear(); cancelledOrders.clear();\n shipLog.clear(); backorderQueue.clear(); labelSeq = 1000;\n }\n\n string nextLabel() { return \"SHP-\" + to_string(++labelSeq); }\n\n // Fulfill an order line.\n // Rules:\n // 1. orderId is idempotent: duplicates return DUPLICATE, no mutation.\n // 2. If orderId is in cancelledOrders, return CANCELLED, no mutation.\n // 3. If SKU not in inventory or inventory[sku] == 0, return NO_STOCK.\n // Log \"NOSTOCK:\u003corderId\u003e:\u003csku\u003e\". Add to backorderQueue as \"\u003corderId\u003e:\u003csku\u003e:\u003cqty\u003e\".\n // 4. If inventory[sku] \u003e= qty: full fulfillment. Deduct inventory, generate label,\n // log \"SHIP:\u003corderId\u003e:\u003csku\u003e:\u003cqty\u003e:\u003clabel\u003e\", status FULFILLED.\n // 5. If 0 \u003c inventory[sku] \u003c qty: partial ship. Ship what\u0027s available,\n // backorder the rest. Generate label for shipped portion.\n // Log \"SHIP:\u003corderId\u003e:\u003csku\u003e:\u003cshipped\u003e:\u003clabel\u003e\" and\n // add \"\u003corderId\u003e:\u003csku\u003e:\u003cremaining\u003e\" to backorderQueue. Status PARTIAL.\n // 6. Mark orderId as processed.\n FulfillResult fulfill(const string\u0026 orderId, const string\u0026 sku, int qty) {\n","golden_completion":" FulfillResult res;\n if (processedOrders.count(orderId)) { res = {\"DUPLICATE\", 0, 0, \"\"}; return res; }\n if (cancelledOrders.count(orderId)) { res = {\"CANCELLED\", 0, 0, \"\"}; return res; }\n processedOrders.insert(orderId);\n auto it = inventory.find(sku);\n int avail = (it != inventory.end()) ? it-\u003esecond : 0;\n if (avail \u003c= 0) {\n shipLog.push_back(\"NOSTOCK:\" + orderId + \":\" + sku);\n backorderQueue.push_back(orderId + \":\" + sku + \":\" + to_string(qty));\n res = {\"NO_STOCK\", 0, qty, \"\"}; return res;\n }\n if (avail \u003e= qty) {\n inventory[sku] -= qty;\n string lbl = nextLabel();\n shipLog.push_back(\"SHIP:\" + orderId + \":\" + sku + \":\" + to_string(qty) + \":\" + lbl);\n res = {\"FULFILLED\", qty, 0, lbl}; return res;\n }\n // Partial\n int shipped = avail;\n int remaining = qty - shipped;\n inventory[sku] = 0;\n string lbl = nextLabel();\n shipLog.push_back(\"SHIP:\" + orderId + \":\" + sku + \":\" + to_string(shipped) + \":\" + lbl);\n backorderQueue.push_back(orderId + \":\" + sku + \":\" + to_string(remaining));\n res = {\"PARTIAL\", shipped, remaining, lbl}; return res;\n","suffix":" }\n};\n\nint main() {\n FulfillmentCenter fc;\n fc.reset();\n fc.inventory[\"WIDGET\"] = 15;\n fc.inventory[\"GADGET\"] = 5;\n\n FulfillResult r1 = fc.fulfill(\"O1\", \"WIDGET\", 10);\n assert(r1.status == \"FULFILLED\");\n assert(r1.shipped == 10);\n assert(r1.label == \"SHP-1001\");\n assert(fc.inventory[\"WIDGET\"] == 5);\n\n FulfillResult r2 = fc.fulfill(\"O2\", \"GADGET\", 8);\n assert(r2.status == \"PARTIAL\");\n assert(r2.shipped == 5 \u0026\u0026 r2.backordered == 3);\n assert(fc.inventory[\"GADGET\"] == 0);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate\n FulfillResult dup = fc.fulfill(\"O1\", \"WIDGET\", 99);\n assert(dup.status == \"DUPLICATE\");\n assert(fc.inventory[\"WIDGET\"] == 5); // no deduction\n assert(dup.label == \"\");\n\n // Cancelled order\n fc.cancelledOrders.insert(\"O3\");\n FulfillResult canc = fc.fulfill(\"O3\", \"WIDGET\", 2);\n assert(canc.status == \"CANCELLED\");\n assert(fc.inventory[\"WIDGET\"] == 5); // no deduction\n\n // No stock\n FulfillResult ns = fc.fulfill(\"O4\", \"MISSING_SKU\", 1);\n assert(ns.status == \"NO_STOCK\");\n assert(ns.backordered == 1);\n assert(fc.backorderQueue.back() == \"O4:MISSING_SKU:1\");\n\n // Label sequence continues\n FulfillResult r3 = fc.fulfill(\"O5\", \"WIDGET\", 3);\n assert(r3.status == \"FULFILLED\");\n assert(r3.label == \"SHP-1003\"); // 1001 + 1002 already used\n assert(fc.inventory[\"WIDGET\"] == 2);\n\n // Backorder queue has correct entries\n bool found = false;\n for (auto\u0026 bq : fc.backorderQueue) {\n if (bq == \"O2:GADGET:3\") found = true;\n }\n assert(found);\n","category":"code_purpose_understanding"} {"id":"6","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\nusing namespace std;\n\nstruct PremiumResult {\n string status; // \"QUOTED\", \"DUPLICATE\", \"INVALID_DATE\", \"DECLINED\"\n double annualPremium;\n double monthlyPremium;\n double discountApplied;\n};\n\nstruct PremiumCalculator {\n double baseRate = 1200.0;\n double minPremium = 300.0;\n // age factor: \u003c25 → 1.8, 25-45 → 1.0, 46-65 → 1.3, \u003e65 → 2.0\n map\u003cstring, double\u003e riskFactors; // condition -\u003e additive surcharge\n // discount tiers: yearsWithoutClaim → multiplier\n // 0-2 years: 1.0, 3-5 years: 0.90, 6+ years: 0.80\n set\u003cstring\u003e processedQuotes;\n vector\u003cstring\u003e quoteLog;\n\n PremiumCalculator() {\n riskFactors[\"SMOKER\"] = 400.0;\n riskFactors[\"DIABETES\"] = 300.0;\n riskFactors[\"HYPERTENSION\"] = 200.0;\n }\n\n void reset() { processedQuotes.clear(); quoteLog.clear(); }\n static double r2(double v) { return round(v * 100.0) / 100.0; }\n\n double ageFactor(int age) {\n if (age \u003c 25) return 1.8;\n if (age \u003c= 45) return 1.0;\n if (age \u003c= 65) return 1.3;\n return 2.0;\n }\n\n double discountMultiplier(int yearsNoClaim) {\n if (yearsNoClaim \u003e= 6) return 0.80;\n if (yearsNoClaim \u003e= 3) return 0.90;\n return 1.0;\n }\n\n // Calculate insurance premium.\n // Rules:\n // 1. quoteId is idempotent: duplicates return DUPLICATE, no mutation.\n // 2. If age \u003c 18 or age \u003e 85, return DECLINED.\n // 3. If effectiveMonth \u003c 1 or \u003e 12, return INVALID_DATE.\n // 4. adjusted = baseRate * ageFactor(age).\n // 5. Add risk surcharges (additive) for each matching condition.\n // 6. Apply discount multiplier based on yearsWithoutClaim.\n // 7. If result \u003c minPremium, clamp to minPremium.\n // 8. monthlyPremium = annualPremium / 12 (rounded).\n // 9. discountApplied = (pre-discount - post-discount) amount.\n // 10. Log \"QUOTE:\u003cquoteId\u003e:annual=\u003cpremium\u003e\".\n PremiumResult calculatePremium(const string\u0026 quoteId, int age,\n const vector\u003cstring\u003e\u0026 conditions,\n int yearsWithoutClaim, int effectiveMonth) {\n","golden_completion":" PremiumResult res;\n if (processedQuotes.count(quoteId)) { res = {\"DUPLICATE\", 0, 0, 0}; return res; }\n if (age \u003c 18 || age \u003e 85) { processedQuotes.insert(quoteId); quoteLog.push_back(\"DECLINED:\" + quoteId); res = {\"DECLINED\", 0, 0, 0}; return res; }\n if (effectiveMonth \u003c 1 || effectiveMonth \u003e 12) { processedQuotes.insert(quoteId); quoteLog.push_back(\"INVALID:\" + quoteId); res = {\"INVALID_DATE\", 0, 0, 0}; return res; }\n processedQuotes.insert(quoteId);\n double adjusted = r2(baseRate * ageFactor(age));\n for (auto\u0026 cond : conditions) {\n auto it = riskFactors.find(cond);\n if (it != riskFactors.end()) adjusted = r2(adjusted + it-\u003esecond);\n }\n double preDiscount = adjusted;\n adjusted = r2(adjusted * discountMultiplier(yearsWithoutClaim));\n double disc = r2(preDiscount - adjusted);\n if (adjusted \u003c minPremium) adjusted = minPremium;\n double monthly = r2(adjusted / 12.0);\n quoteLog.push_back(\"QUOTE:\" + quoteId + \":annual=\" + to_string(adjusted));\n res = {\"QUOTED\", adjusted, monthly, disc};\n return res;\n","suffix":" }\n};\n\nint main() {\n PremiumCalculator pc;\n pc.reset();\n\n PremiumResult r1 = pc.calculatePremium(\"Q1\", 30, {\"SMOKER\"}, 4, 6);\n // base=1200, age factor=1.0, adjusted=1200+400=1600, discount=0.90, final=1440\n assert(r1.status == \"QUOTED\");\n assert(abs(r1.annualPremium - 1440.0) \u003c 0.01);\n assert(abs(r1.monthlyPremium - 120.0) \u003c 0.01);\n assert(abs(r1.discountApplied - 160.0) \u003c 0.01);\n\n PremiumResult r2 = pc.calculatePremium(\"Q2\", 70, {}, 7, 1);\n // base=1200, age=2.0 → 2400, no risk, discount=0.80 → 1920\n assert(abs(r2.annualPremium - 1920.0) \u003c 0.01);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate\n PremiumResult dup = pc.calculatePremium(\"Q1\", 99, {}, 0, 1);\n assert(dup.status == \"DUPLICATE\");\n\n // Declined: too young\n PremiumResult young = pc.calculatePremium(\"Q3\", 16, {}, 0, 1);\n assert(young.status == \"DECLINED\");\n\n // Declined: too old\n PremiumResult old1 = pc.calculatePremium(\"Q4\", 90, {}, 0, 1);\n assert(old1.status == \"DECLINED\");\n\n // Invalid date\n PremiumResult bad = pc.calculatePremium(\"Q5\", 30, {}, 0, 13);\n assert(bad.status == \"INVALID_DATE\");\n\n // Min premium floor\n PremiumCalculator pc2;\n pc2.reset();\n pc2.baseRate = 100.0;\n pc2.minPremium = 300.0;\n PremiumResult floor1 = pc2.calculatePremium(\"Q6\", 30, {}, 10, 6);\n // base=100*1.0=100, discount=0.80 → 80 \u003c 300, clamp to 300\n assert(abs(floor1.annualPremium - 300.0) \u003c 0.01);\n assert(abs(floor1.monthlyPremium - 25.0) \u003c 0.01);\n\n // Multiple risk factors\n PremiumResult multi = pc.calculatePremium(\"Q7\", 20, {\"SMOKER\", \"DIABETES\", \"HYPERTENSION\"}, 0, 3);\n // base=1200*1.8=2160, +400+300+200=3060, discount=1.0, final=3060\n assert(abs(multi.annualPremium - 3060.0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"7","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\nusing namespace std;\n\nstruct OrderItem {\n string itemName;\n double basePrice;\n vector\u003cpair\u003cstring,double\u003e\u003e modifiers; // name, price\n double lineTotal;\n};\n\nstruct BillResult {\n string status; // \"BILLED\", \"DUPLICATE\", \"EMPTY_ORDER\", \"UNAVAILABLE\"\n double subtotal;\n double tax;\n double tip;\n double grandTotal;\n double perPerson; // split amount\n string unavailableItem;\n};\n\nstruct Restaurant {\n map\u003cstring, double\u003e menu; // item -\u003e price\n map\u003cstring, double\u003e modifierPrices; // modifier -\u003e price\n set\u003cstring\u003e unavailableItems;\n double taxRate = 0.085;\n set\u003cstring\u003e processedOrders;\n vector\u003cstring\u003e orderLog;\n\n Restaurant() {\n menu[\"BURGER\"] = 12.50; menu[\"SALAD\"] = 9.00; menu[\"STEAK\"] = 28.00;\n menu[\"PASTA\"] = 14.00; menu[\"SOUP\"] = 7.50;\n modifierPrices[\"CHEESE\"] = 1.50; modifierPrices[\"BACON\"] = 2.00;\n modifierPrices[\"AVOCADO\"] = 3.00; modifierPrices[\"EXTRA_SAUCE\"] = 0.75;\n }\n\n void reset() { unavailableItems.clear(); processedOrders.clear(); orderLog.clear(); }\n static double r2(double v) { return round(v * 100.0) / 100.0; }\n\n // Process a restaurant order and compute the bill.\n // Rules:\n // 1. orderId is idempotent: duplicates return DUPLICATE, no mutation.\n // 2. If items list is empty, return EMPTY_ORDER.\n // 3. For each item: if itemName is in unavailableItems, return UNAVAILABLE\n // with that item name, no mutation, before processing any other items.\n // 4. For each item: lineTotal = menu price + sum of modifier prices.\n // Unknown modifiers are ignored (price = 0).\n // 5. subtotal = sum of all lineTotals.\n // 6. tax = subtotal * taxRate (rounded).\n // 7. tip = subtotal * tipPercent (tipPercent is 0.0 to 1.0, rounded).\n // 8. grandTotal = subtotal + tax + tip.\n // 9. perPerson = grandTotal / splitCount (rounded), splitCount \u003e= 1.\n // 10. Log \"ORDER:\u003corderId\u003e:total=\u003cgrandTotal\u003e:split=\u003csplitCount\u003e\".\n BillResult processOrder(const string\u0026 orderId,\n const vector\u003cpair\u003cstring, vector\u003cstring\u003e\u003e\u003e\u0026 items,\n double tipPercent, int splitCount) {\n","golden_completion":" BillResult res;\n if (processedOrders.count(orderId)) { res = {\"DUPLICATE\",0,0,0,0,0,\"\"}; return res; }\n if (items.empty()) { res = {\"EMPTY_ORDER\",0,0,0,0,0,\"\"}; return res; }\n // Check availability first (before any mutation)\n for (auto\u0026 [name, mods] : items) {\n if (unavailableItems.count(name)) { res = {\"UNAVAILABLE\",0,0,0,0,0,name}; return res; }\n }\n processedOrders.insert(orderId);\n double subtotal = 0;\n for (auto\u0026 [name, mods] : items) {\n double line = menu[name];\n for (auto\u0026 m : mods) {\n auto it = modifierPrices.find(m);\n if (it != modifierPrices.end()) line += it-\u003esecond;\n }\n subtotal += line;\n }\n subtotal = r2(subtotal);\n double tax = r2(subtotal * taxRate);\n double tip = r2(subtotal * tipPercent);\n double grand = r2(subtotal + tax + tip);\n int sc = (splitCount \u003c 1) ? 1 : splitCount;\n double pp = r2(grand / sc);\n orderLog.push_back(\"ORDER:\" + orderId + \":total=\" + to_string(grand) + \":split=\" + to_string(sc));\n res = {\"BILLED\", subtotal, tax, tip, grand, pp, \"\"};\n return res;\n","suffix":" }\n};\n\nint main() {\n Restaurant rest;\n rest.reset();\n\n vector\u003cpair\u003cstring, vector\u003cstring\u003e\u003e\u003e items1 = {\n {\"BURGER\", {\"CHEESE\", \"BACON\"}},\n {\"SALAD\", {}}\n };\n BillResult r1 = rest.processOrder(\"ORD1\", items1, 0.18, 2);\n // BURGER: 12.50+1.50+2.00=16.00, SALAD: 9.00, subtotal=25.00\n // tax: 25*0.085=2.13, tip: 25*0.18=4.50, grand=31.63, pp=15.82\n assert(r1.status == \"BILLED\");\n assert(abs(r1.subtotal - 25.0) \u003c 0.01);\n assert(abs(r1.tax - 2.13) \u003c 0.01);\n assert(abs(r1.grandTotal - 31.63) \u003c 0.01);\n assert(abs(r1.perPerson - 15.82) \u003c 0.02);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate\n BillResult dup = rest.processOrder(\"ORD1\", items1, 0.0, 1);\n assert(dup.status == \"DUPLICATE\");\n assert((int)rest.orderLog.size() == 1);\n\n // Empty order\n BillResult empty = rest.processOrder(\"ORD2\", {}, 0.18, 1);\n assert(empty.status == \"EMPTY_ORDER\");\n\n // Unavailable item - must not process partial order\n rest.unavailableItems.insert(\"STEAK\");\n vector\u003cpair\u003cstring, vector\u003cstring\u003e\u003e\u003e items2 = {\n {\"BURGER\", {}},\n {\"STEAK\", {\"EXTRA_SAUCE\"}}\n };\n int logBefore = (int)rest.orderLog.size();\n BillResult unavail = rest.processOrder(\"ORD3\", items2, 0.15, 1);\n assert(unavail.status == \"UNAVAILABLE\");\n assert(unavail.unavailableItem == \"STEAK\");\n assert((int)rest.orderLog.size() == logBefore); // no mutation\n // ORD3 should NOT be in processedOrders (can retry)\n assert(!rest.processedOrders.count(\"ORD3\"));\n\n // Unknown modifier ignored\n vector\u003cpair\u003cstring, vector\u003cstring\u003e\u003e\u003e items3 = {\n {\"SOUP\", {\"TRUFFLE\", \"CHEESE\"}}\n };\n BillResult r3 = rest.processOrder(\"ORD4\", items3, 0.0, 1);\n // SOUP=7.50 + CHEESE=1.50 + TRUFFLE=0 (unknown) = 9.00\n assert(abs(r3.subtotal - 9.0) \u003c 0.01);\n\n // Zero tip, split 3\n vector\u003cpair\u003cstring, vector\u003cstring\u003e\u003e\u003e items4 = {\n {\"PASTA\", {}}, {\"PASTA\", {}}, {\"SALAD\", {}}\n };\n BillResult r4 = rest.processOrder(\"ORD5\", items4, 0.0, 3);\n // subtotal=14+14+9=37, tax=37*0.085=3.15, tip=0, grand=40.15, pp=13.38\n assert(abs(r4.subtotal - 37.0) \u003c 0.01);\n assert(abs(r4.perPerson - 13.38) \u003c 0.02);\n","category":"code_purpose_understanding"} {"id":"8","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003cdeque\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\nusing namespace std;\n\nstruct LendResult {\n string status; // \"CHECKED_OUT\", \"RENEWED\", \"RETURNED\", \"DUPLICATE\",\n // \"LIMIT_REACHED\", \"ON_HOLD\", \"NOT_FOUND\", \"ALREADY_OUT\", \"LOST\"\n double fineAmount;\n int dueDay;\n};\n\nstruct Library {\n int loanPeriod = 14; // days\n int maxRenewals = 2;\n int borrowLimit = 5;\n double dailyFine = 0.25;\n double lostFee = 25.0;\n\n map\u003cstring, string\u003e checkedOut; // bookId -\u003e memberId\n map\u003cstring, int\u003e dueDays; // bookId -\u003e dueDay\n map\u003cstring, int\u003e renewalCount; // bookId -\u003e renewals used\n map\u003cstring, int\u003e memberBorrowCount; // memberId -\u003e active count\n map\u003cstring, deque\u003cstring\u003e\u003e holdQueue; // bookId -\u003e queue of memberIds\n set\u003cstring\u003e lostBooks;\n vector\u003cstring\u003e transactionLog;\n\n void reset() {\n checkedOut.clear(); dueDays.clear(); renewalCount.clear();\n memberBorrowCount.clear(); holdQueue.clear(); lostBooks.clear();\n transactionLog.clear();\n }\n\n // Process a library transaction.\n // action: \"CHECKOUT\", \"RENEW\", \"RETURN\", \"LOST\"\n // Rules:\n // 1. CHECKOUT:\n // - If book already checked out, return ALREADY_OUT.\n // - If book has a hold queue and memberId is NOT first in queue, return ON_HOLD.\n // If memberId IS first, pop them from queue and proceed.\n // - If member\u0027s borrowCount \u003e= borrowLimit, return LIMIT_REACHED.\n // - Set dueDay = currentDay + loanPeriod. Increment member count. Log checkout.\n // 2. RENEW:\n // - If book not checked out to this member, return NOT_FOUND.\n // - If renewalCount \u003e= maxRenewals, return LIMIT_REACHED.\n // - If book has holds from OTHER members, return ON_HOLD (can\u0027t renew).\n // - Extend dueDay by loanPeriod from currentDay. Increment renewal count.\n // 3. RETURN:\n // - If book not checked out to this member, return NOT_FOUND.\n // - Compute fine = max(0, (currentDay - dueDay)) * dailyFine.\n // - Clear checkout state. Decrement member count.\n // 4. LOST:\n // - If book not checked out to this member, return NOT_FOUND.\n // - Fine = lostFee. Mark book as lost. Clear checkout. Decrement member count.\n LendResult processTransaction(const string\u0026 bookId, const string\u0026 memberId,\n const string\u0026 action, int currentDay) {\n","golden_completion":" LendResult res;\n if (action == \"CHECKOUT\") {\n if (checkedOut.count(bookId)) { res = {\"ALREADY_OUT\", 0, 0}; return res; }\n if (holdQueue.count(bookId) \u0026\u0026 !holdQueue[bookId].empty()) { if (holdQueue[bookId].front() != memberId) { res = {\"ON_HOLD\", 0, 0}; return res; } holdQueue[bookId].pop_front(); }\n if (memberBorrowCount[memberId] \u003e= borrowLimit) { res = {\"LIMIT_REACHED\", 0, 0}; return res; }\n int due = currentDay + loanPeriod; checkedOut[bookId] = memberId; dueDays[bookId] = due; renewalCount[bookId] = 0; memberBorrowCount[memberId]++;\n transactionLog.push_back(\"CHECKOUT:\" + bookId + \":\" + memberId + \":due=\" + to_string(due)); res = {\"CHECKED_OUT\", 0, due}; return res;\n }\n if (action == \"RENEW\") {\n if (!checkedOut.count(bookId) || checkedOut[bookId] != memberId) { res = {\"NOT_FOUND\", 0, 0}; return res; }\n if (renewalCount[bookId] \u003e= maxRenewals) { res = {\"LIMIT_REACHED\", 0, 0}; return res; }\n if (holdQueue.count(bookId)) { for (auto\u0026 h : holdQueue[bookId]) if (h != memberId) { res = {\"ON_HOLD\", 0, 0}; return res; } }\n int newDue = currentDay + loanPeriod; dueDays[bookId] = newDue; renewalCount[bookId]++;\n transactionLog.push_back(\"RENEW:\" + bookId + \":\" + memberId + \":due=\" + to_string(newDue)); res = {\"RENEWED\", 0, newDue}; return res;\n }\n if (action == \"RETURN\") {\n if (!checkedOut.count(bookId) || checkedOut[bookId] != memberId) { res = {\"NOT_FOUND\", 0, 0}; return res; }\n double fine = max(0, currentDay - dueDays[bookId]) * dailyFine; checkedOut.erase(bookId); dueDays.erase(bookId); renewalCount.erase(bookId); memberBorrowCount[memberId]--;\n transactionLog.push_back(\"RETURN:\" + bookId + \":\" + memberId + \":fine=\" + to_string(fine)); res = {\"RETURNED\", fine, 0}; return res;\n }\n if (action == \"LOST\") {\n if (!checkedOut.count(bookId) || checkedOut[bookId] != memberId) { res = {\"NOT_FOUND\", 0, 0}; return res; }\n lostBooks.insert(bookId); checkedOut.erase(bookId); dueDays.erase(bookId); renewalCount.erase(bookId); memberBorrowCount[memberId]--;\n transactionLog.push_back(\"LOST:\" + bookId + \":\" + memberId); res = {\"LOST\", lostFee, 0}; return res;\n }\n res = {\"NOT_FOUND\", 0, 0}; return res;\n","suffix":" }\n};\n\nint main() {\n Library lib;\n lib.reset();\n\n LendResult r1 = lib.processTransaction(\"B1\", \"M1\", \"CHECKOUT\", 1);\n assert(r1.status == \"CHECKED_OUT\");\n assert(r1.dueDay == 15);\n assert(lib.memberBorrowCount[\"M1\"] == 1);\n\n LendResult r2 = lib.processTransaction(\"B1\", \"M1\", \"RENEW\", 10);\n assert(r2.status == \"RENEWED\");\n assert(r2.dueDay == 24);\n\n LendResult r3 = lib.processTransaction(\"B1\", \"M1\", \"RETURN\", 30);\n assert(r3.status == \"RETURNED\");\n assert(abs(r3.fineAmount - 1.50) \u003c 0.01); // 6 days late * 0.25\n assert(lib.memberBorrowCount[\"M1\"] == 0);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Already out\n lib.processTransaction(\"B2\", \"M2\", \"CHECKOUT\", 1);\n LendResult alrOut = lib.processTransaction(\"B2\", \"M3\", \"CHECKOUT\", 1);\n assert(alrOut.status == \"ALREADY_OUT\");\n\n // Borrowing limit\n lib.borrowLimit = 2;\n lib.processTransaction(\"B3\", \"M3\", \"CHECKOUT\", 1);\n lib.processTransaction(\"B4\", \"M3\", \"CHECKOUT\", 1);\n LendResult lim = lib.processTransaction(\"B5\", \"M3\", \"CHECKOUT\", 1);\n assert(lim.status == \"LIMIT_REACHED\");\n assert(lib.memberBorrowCount[\"M3\"] == 2);\n\n // Hold queue: M4 holds B6, M5 tries to checkout → ON_HOLD\n lib.holdQueue[\"B6\"].push_back(\"M4\");\n LendResult hold = lib.processTransaction(\"B6\", \"M5\", \"CHECKOUT\", 1);\n assert(hold.status == \"ON_HOLD\");\n // M4 can checkout (first in queue)\n lib.borrowLimit = 10;\n LendResult holdOk = lib.processTransaction(\"B6\", \"M4\", \"CHECKOUT\", 1);\n assert(holdOk.status == \"CHECKED_OUT\");\n assert(lib.holdQueue[\"B6\"].empty());\n\n // Renewal blocked by hold from other member\n lib.holdQueue[\"B6\"].push_back(\"M5\");\n LendResult renewHold = lib.processTransaction(\"B6\", \"M4\", \"RENEW\", 10);\n assert(renewHold.status == \"ON_HOLD\");\n\n // Max renewals\n lib.holdQueue[\"B6\"].clear();\n lib.processTransaction(\"B6\", \"M4\", \"RENEW\", 10);\n lib.processTransaction(\"B6\", \"M4\", \"RENEW\", 20);\n LendResult maxRen = lib.processTransaction(\"B6\", \"M4\", \"RENEW\", 30);\n assert(maxRen.status == \"LIMIT_REACHED\");\n\n // Lost book\n LendResult lost = lib.processTransaction(\"B6\", \"M4\", \"LOST\", 35);\n assert(lost.status == \"LOST\");\n assert(abs(lost.fineAmount - 25.0) \u003c 0.01);\n assert(lib.lostBooks.count(\"B6\"));\n assert(lib.memberBorrowCount[\"M4\"] == 0);\n","category":"code_purpose_understanding"} {"id":"9","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\nusing namespace std;\n\nstruct ReservationResult {\n string status; // \"CONFIRMED\", \"DUPLICATE\", \"NO_ROOMS\", \"CANCELLED\",\n // \"CANCEL_FEE\", \"NO_SHOW\", \"CHECKED_IN\", \"NOT_FOUND\"\n double totalRate;\n double deposit;\n double refund;\n double penalty;\n};\n\nstruct Hotel {\n map\u003cstring, int\u003e roomInventory; // roomType -\u003e available count\n double baseRate = 150.0;\n // Seasonal multipliers by month: 1-3 → 0.8, 4-6 → 1.0, 7-9 → 1.5, 10-12 → 1.2\n double earlyBirdDays = 30; // book \u003e=30 days before → 15% off\n double earlyBirdDiscount = 0.15;\n double depositPercent = 0.30;\n // Cancel policy: \u003e=7 days before → full refund, 3-6 days → 50% refund, \u003c3 days → no refund\n double noShowFeePercent = 1.0; // 100% of total rate\n\n set\u003cstring\u003e processedReservations;\n map\u003cstring, string\u003e reservationRoom; // resId -\u003e roomType\n map\u003cstring, int\u003e reservationNights;\n map\u003cstring, double\u003e reservationTotal;\n map\u003cstring, double\u003e reservationDeposit;\n map\u003cstring, int\u003e reservationCheckIn; // day of checkin\n set\u003cstring\u003e cancelledReservations;\n vector\u003cstring\u003e resLog;\n\n void reset() {\n roomInventory.clear(); processedReservations.clear();\n reservationRoom.clear(); reservationNights.clear();\n reservationTotal.clear(); reservationDeposit.clear();\n reservationCheckIn.clear(); cancelledReservations.clear();\n resLog.clear();\n roomInventory[\"STANDARD\"] = 10;\n roomInventory[\"DELUXE\"] = 5;\n roomInventory[\"SUITE\"] = 2;\n }\n\n static double r2(double v) { return round(v * 100.0) / 100.0; }\n\n double seasonMultiplier(int month) {\n if (month \u003c= 3) return 0.8;\n if (month \u003c= 6) return 1.0;\n if (month \u003c= 9) return 1.5;\n return 1.2;\n }\n\n // Process a hotel reservation action.\n // action: \"BOOK\", \"CANCEL\", \"CHECKIN\", \"NOSHOW\"\n // Rules:\n // 1. BOOK:\n // - resId idempotent: duplicate → DUPLICATE.\n // - If roomType not available (count \u003c= 0), return NO_ROOMS.\n // - nightly = baseRate * seasonMultiplier(month).\n // - If (checkinDay - bookingDay) \u003e= earlyBirdDays, apply earlyBirdDiscount.\n // - totalRate = nightly * nights (rounded). deposit = totalRate * depositPercent.\n // - Decrement room inventory. Store reservation details.\n // 2. CANCEL:\n // - If resId not found or already cancelled, return NOT_FOUND.\n // - daysBeforeCheckin = checkinDay - cancelDay.\n // - \u003e=7: full deposit refund. 3-6: 50% refund. \u003c3: no refund.\n // - Increment room inventory. Mark cancelled.\n // 3. CHECKIN:\n // - If not found or cancelled, return NOT_FOUND.\n // - Mark as checked in. Return CHECKED_IN with remaining balance (total - deposit).\n // 4. NOSHOW:\n // - If not found or cancelled, return NOT_FOUND.\n // - penalty = totalRate * noShowFeePercent. No room returned (charged full).\n // - Mark cancelled.\n ReservationResult processReservation(const string\u0026 resId, const string\u0026 action,\n const string\u0026 roomType, int nights,\n int month, int bookingDay,\n int checkinDay, int actionDay) {\n","golden_completion":" ReservationResult res;\n if (action == \"BOOK\") {\n if (processedReservations.count(resId)) { res = {\"DUPLICATE\",0,0,0,0}; return res; }\n if (roomInventory.find(roomType) == roomInventory.end() || roomInventory[roomType] \u003c= 0) { res = {\"NO_ROOMS\",0,0,0,0}; return res; }\n processedReservations.insert(resId);\n double nightly = r2(baseRate * seasonMultiplier(month));\n if (checkinDay - bookingDay \u003e= (int)earlyBirdDays) nightly = r2(nightly * (1.0 - earlyBirdDiscount));\n double total = r2(nightly * nights); double dep = r2(total * depositPercent); roomInventory[roomType]--;\n reservationRoom[resId] = roomType; reservationNights[resId] = nights; reservationTotal[resId] = total; reservationDeposit[resId] = dep; reservationCheckIn[resId] = checkinDay;\n resLog.push_back(\"BOOK:\" + resId + \":\" + roomType + \":total=\" + to_string(total)); res = {\"CONFIRMED\", total, dep, 0, 0}; return res;\n }\n if (action == \"CANCEL\") {\n if (!processedReservations.count(resId) || cancelledReservations.count(resId)) { res = {\"NOT_FOUND\",0,0,0,0}; return res; }\n int daysBefore = reservationCheckIn[resId] - actionDay; double dep = reservationDeposit[resId]; double refund = 0;\n if (daysBefore \u003e= 7) refund = dep; else if (daysBefore \u003e= 3) refund = r2(dep * 0.5);\n roomInventory[reservationRoom[resId]]++; cancelledReservations.insert(resId);\n resLog.push_back(\"CANCEL:\" + resId + \":refund=\" + to_string(refund)); res = {\"CANCELLED\", 0, 0, refund, r2(dep - refund)}; return res;\n }\n if (action == \"CHECKIN\") {\n if (!processedReservations.count(resId) || cancelledReservations.count(resId)) { res = {\"NOT_FOUND\",0,0,0,0}; return res; }\n double balance = r2(reservationTotal[resId] - reservationDeposit[resId]);\n resLog.push_back(\"CHECKIN:\" + resId); res = {\"CHECKED_IN\", reservationTotal[resId], reservationDeposit[resId], 0, balance}; return res;\n }\n if (action == \"NOSHOW\") {\n if (!processedReservations.count(resId) || cancelledReservations.count(resId)) { res = {\"NOT_FOUND\",0,0,0,0}; return res; }\n double penalty = r2(reservationTotal[resId] * noShowFeePercent); cancelledReservations.insert(resId);\n resLog.push_back(\"NOSHOW:\" + resId + \":penalty=\" + to_string(penalty)); res = {\"NO_SHOW\", 0, 0, 0, penalty}; return res;\n }\n res = {\"NOT_FOUND\",0,0,0,0}; return res;\n","suffix":" }\n};\n\nint main() {\n Hotel hotel;\n hotel.reset();\n\n // Book a standard room in July (peak), 3 nights, early bird (booked 40 days ahead)\n ReservationResult r1 = hotel.processReservation(\"R1\", \"BOOK\", \"STANDARD\", 3, 7, 1, 41, 1);\n // nightly = 150 * 1.5 = 225, early bird: 225 * 0.85 = 191.25, total = 573.75\n assert(r1.status == \"CONFIRMED\");\n assert(abs(r1.totalRate - 573.75) \u003c 0.01);\n assert(abs(r1.deposit - 172.13) \u003c 0.02);\n assert(hotel.roomInventory[\"STANDARD\"] == 9);\n\n // Cancel with full refund (\u003e=7 days before)\n ReservationResult r2 = hotel.processReservation(\"R1\", \"CANCEL\", \"\", 0, 0, 0, 0, 30);\n assert(r2.status == \"CANCELLED\");\n assert(abs(r2.refund - r1.deposit) \u003c 0.02);\n assert(hotel.roomInventory[\"STANDARD\"] == 10);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate booking\n hotel.processReservation(\"R2\", \"BOOK\", \"STANDARD\", 2, 5, 1, 20, 1);\n ReservationResult dup = hotel.processReservation(\"R2\", \"BOOK\", \"STANDARD\", 2, 5, 1, 20, 1);\n assert(dup.status == \"DUPLICATE\");\n\n // No rooms\n hotel.roomInventory[\"SUITE\"] = 0;\n ReservationResult noRoom = hotel.processReservation(\"R3\", \"BOOK\", \"SUITE\", 1, 6, 1, 10, 1);\n assert(noRoom.status == \"NO_ROOMS\");\n\n // Partial refund (3-6 days before)\n hotel.processReservation(\"R4\", \"BOOK\", \"DELUXE\", 2, 10, 1, 50, 1);\n double dep4 = hotel.reservationDeposit[\"R4\"];\n ReservationResult partCancel = hotel.processReservation(\"R4\", \"CANCEL\", \"\", 0, 0, 0, 0, 45);\n // 50-45=5 days before → 50% refund\n assert(abs(partCancel.refund - dep4 * 0.5) \u003c 0.02);\n\n // No refund (\u003c3 days)\n hotel.processReservation(\"R5\", \"BOOK\", \"STANDARD\", 1, 4, 1, 50, 1);\n ReservationResult noRefund = hotel.processReservation(\"R5\", \"CANCEL\", \"\", 0, 0, 0, 0, 49);\n // 50-49=1 day → no refund\n assert(abs(noRefund.refund) \u003c 0.01);\n\n // No-show: penalty = full rate, room NOT returned\n hotel.processReservation(\"R6\", \"BOOK\", \"STANDARD\", 2, 7, 1, 50, 1);\n int roomsBefore = hotel.roomInventory[\"STANDARD\"];\n double total6 = hotel.reservationTotal[\"R6\"];\n ReservationResult ns = hotel.processReservation(\"R6\", \"NOSHOW\", \"\", 0, 0, 0, 0, 51);\n assert(ns.status == \"NO_SHOW\");\n assert(abs(ns.penalty - total6) \u003c 0.01);\n assert(hotel.roomInventory[\"STANDARD\"] == roomsBefore); // room NOT returned\n\n // Check-in\n hotel.processReservation(\"R7\", \"BOOK\", \"DELUXE\", 3, 1, 1, 50, 1);\n ReservationResult ci = hotel.processReservation(\"R7\", \"CHECKIN\", \"\", 0, 0, 0, 0, 50);\n assert(ci.status == \"CHECKED_IN\");\n","category":"code_purpose_understanding"} {"id":"10","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n#include \u003cnumeric\u003e\nusing namespace std;\n\nstruct GradeResult {\n string status; // \"GRADED\", \"DUPLICATE\", \"INCOMPLETE\"\n double finalPercent;\n string letterGrade;\n double gpaPoints;\n};\n\nstruct GradeBook {\n // Categories with weights (must sum to 1.0)\n map\u003cstring, double\u003e categoryWeights;\n // Drop-lowest: number of lowest scores to drop per category\n map\u003cstring, int\u003e dropLowest;\n double extraCreditCap = 5.0; // max extra credit percentage points\n set\u003cstring\u003e processedStudents;\n vector\u003cstring\u003e gradeLog;\n\n GradeBook() {\n categoryWeights[\"HOMEWORK\"] = 0.30;\n categoryWeights[\"MIDTERM\"] = 0.25;\n categoryWeights[\"FINAL\"] = 0.35;\n categoryWeights[\"PARTICIPATION\"] = 0.10;\n dropLowest[\"HOMEWORK\"] = 2;\n dropLowest[\"MIDTERM\"] = 0;\n dropLowest[\"FINAL\"] = 0;\n dropLowest[\"PARTICIPATION\"] = 0;\n }\n\n void reset() { processedStudents.clear(); gradeLog.clear(); }\n static double r2(double v) { return round(v * 100.0) / 100.0; }\n\n // Letter grade thresholds:\n // \u003e= 97: A+, \u003e= 93: A, \u003e= 90: A-,\n // \u003e= 87: B+, \u003e= 83: B, \u003e= 80: B-,\n // \u003e= 77: C+, \u003e= 73: C, \u003e= 70: C-,\n // \u003e= 67: D+, \u003e= 63: D, \u003e= 60: D-,\n // \u003c 60: F\n string letterFromPercent(double pct) {\n if (pct \u003e= 97) return \"A+\"; if (pct \u003e= 93) return \"A\"; if (pct \u003e= 90) return \"A-\";\n if (pct \u003e= 87) return \"B+\"; if (pct \u003e= 83) return \"B\"; if (pct \u003e= 80) return \"B-\";\n if (pct \u003e= 77) return \"C+\"; if (pct \u003e= 73) return \"C\"; if (pct \u003e= 70) return \"C-\";\n if (pct \u003e= 67) return \"D+\"; if (pct \u003e= 63) return \"D\"; if (pct \u003e= 60) return \"D-\";\n return \"F\";\n }\n\n // GPA: A+=4.0, A=4.0, A-=3.7, B+=3.3, B=3.0, B-=2.7,\n // C+=2.3, C=2.0, C-=1.7, D+=1.3, D=1.0, D-=0.7, F=0.0\n double gpaFromLetter(const string\u0026 letter) {\n if (letter == \"A+\" || letter == \"A\") return 4.0;\n if (letter == \"A-\") return 3.7; if (letter == \"B+\") return 3.3;\n if (letter == \"B\") return 3.0; if (letter == \"B-\") return 2.7;\n if (letter == \"C+\") return 2.3; if (letter == \"C\") return 2.0;\n if (letter == \"C-\") return 1.7; if (letter == \"D+\") return 1.3;\n if (letter == \"D\") return 1.0; if (letter == \"D-\") return 0.7;\n return 0.0;\n }\n\n // Compute final grade for a student.\n // Rules:\n // 1. studentId is idempotent: duplicates return DUPLICATE, no mutation.\n // 2. categoryScores: map from category name to vector of scores (0-100+).\n // 3. If any category is missing from categoryScores, return INCOMPLETE.\n // 4. For each category: sort scores, drop lowest N (per dropLowest), average remaining.\n // If all scores dropped (shouldn\u0027t happen), average = 0.\n // 5. weightedSum = sum of (categoryAvg * categoryWeight).\n // 6. Add extraCredit, but cap at extraCreditCap.\n // 7. Clamp final to [0, 100].\n // 8. Determine letter grade and GPA.\n // 9. Log \"GRADE:\u003cstudentId\u003e:\u003cletterGrade\u003e:\u003cfinalPercent\u003e\".\n GradeResult computeGrade(const string\u0026 studentId,\n const map\u003cstring, vector\u003cdouble\u003e\u003e\u0026 categoryScores,\n double extraCredit) {\n","golden_completion":" GradeResult res;\n if (processedStudents.count(studentId)) { res = {\"DUPLICATE\", 0, \"\", 0}; return res; }\n // Check all categories present\n for (auto\u0026 [cat, wt] : categoryWeights) {\n if (categoryScores.find(cat) == categoryScores.end()) {\n res = {\"INCOMPLETE\", 0, \"\", 0}; return res;\n }\n }\n processedStudents.insert(studentId);\n double weightedSum = 0;\n for (auto\u0026 [cat, wt] : categoryWeights) {\n vector\u003cdouble\u003e scores = categoryScores.at(cat);\n sort(scores.begin(), scores.end());\n int drop = dropLowest.count(cat) ? dropLowest[cat] : 0;\n if (drop \u003e= (int)scores.size()) drop = (int)scores.size() - 1;\n if (drop \u003c 0) drop = 0;\n double sum = 0; int count = 0;\n for (int i = drop; i \u003c (int)scores.size(); i++) { sum += scores[i]; count++; }\n double avg = (count \u003e 0) ? sum / count : 0;\n weightedSum += avg * wt;\n }\n double ec = min(extraCredit, extraCreditCap);\n double finalPct = r2(weightedSum + ec);\n if (finalPct \u003c 0) finalPct = 0; if (finalPct \u003e 100) finalPct = 100;\n string letter = letterFromPercent(finalPct);\n double gpa = gpaFromLetter(letter);\n gradeLog.push_back(\"GRADE:\" + studentId + \":\" + letter + \":\" + to_string(finalPct));\n res = {\"GRADED\", finalPct, letter, gpa};\n return res;\n","suffix":" }\n};\n\nint main() {\n GradeBook gb;\n gb.reset();\n\n map\u003cstring, vector\u003cdouble\u003e\u003e scores = {\n {\"HOMEWORK\", {90, 85, 70, 95, 80, 60}}, // drop 2 lowest (60,70), avg of {80,85,90,95}=87.5\n {\"MIDTERM\", {78}},\n {\"FINAL\", {88}},\n {\"PARTICIPATION\", {95}}\n };\n GradeResult r1 = gb.computeGrade(\"S1\", scores, 3.0);\n // weighted: 87.5*0.30 + 78*0.25 + 88*0.35 + 95*0.10 = 26.25+19.5+30.8+9.5 = 86.05\n // + extra credit 3.0 = 89.05 → B+\n assert(r1.status == \"GRADED\");\n assert(abs(r1.finalPercent - 89.05) \u003c 0.01);\n assert(r1.letterGrade == \"B+\");\n assert(abs(r1.gpaPoints - 3.3) \u003c 0.01);\n int visibleOk = 1;\n return 0;\n}\n","assertions":" assert(visibleOk == 1);\n // Duplicate\n GradeResult dup = gb.computeGrade(\"S1\", scores, 0);\n assert(dup.status == \"DUPLICATE\");\n\n // Incomplete: missing category\n map\u003cstring, vector\u003cdouble\u003e\u003e missing = {\n {\"HOMEWORK\", {90}},\n {\"MIDTERM\", {80}}\n };\n GradeResult inc = gb.computeGrade(\"S2\", missing, 0);\n assert(inc.status == \"INCOMPLETE\");\n\n // Extra credit cap\n map\u003cstring, vector\u003cdouble\u003e\u003e perfect = {\n {\"HOMEWORK\", {100, 100, 100}},\n {\"MIDTERM\", {100}},\n {\"FINAL\", {100}},\n {\"PARTICIPATION\", {100}}\n };\n GradeResult ecCap = gb.computeGrade(\"S3\", perfect, 20.0);\n // weighted = 100, ec capped at 5, final = 100 (clamped)\n assert(abs(ecCap.finalPercent - 100.0) \u003c 0.01);\n assert(ecCap.letterGrade == \"A+\");\n\n // Low grades → F\n map\u003cstring, vector\u003cdouble\u003e\u003e low = {\n {\"HOMEWORK\", {30, 20, 10, 40, 25, 15}}, // drop 2 lowest (10,15), avg={20,25,30,40}=28.75\n {\"MIDTERM\", {45}},\n {\"FINAL\", {50}},\n {\"PARTICIPATION\", {60}}\n };\n GradeResult f1 = gb.computeGrade(\"S4\", low, 0);\n // 28.75*0.3 + 45*0.25 + 50*0.35 + 60*0.10 = 8.625+11.25+17.5+6.0 = 43.375 → F\n assert(f1.letterGrade == \"F\");\n assert(abs(f1.gpaPoints) \u003c 0.01);\n\n // Edge: A- threshold (90.0 exactly)\n map\u003cstring, vector\u003cdouble\u003e\u003e edge = {\n {\"HOMEWORK\", {90, 90, 90}},\n {\"MIDTERM\", {90}},\n {\"FINAL\", {90}},\n {\"PARTICIPATION\", {90}}\n };\n GradeResult aMinus = gb.computeGrade(\"S5\", edge, 0);\n assert(aMinus.letterGrade == \"A-\");\n assert(abs(aMinus.gpaPoints - 3.7) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"11","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccmath\u003e\n\nstruct SubBilling {\n std::string status; // \"trial\",\"active\",\"grace\",\"dunning\",\"cancelled\"\n int trialDaysLeft;\n double monthlyRate;\n double balance; // outstanding balance\n double paidTotal;\n int failedAttempts; // consecutive payment failures\n int daysSinceRenewal;\n double refundAmount;\n std::vector\u003cstd::string\u003e auditLog;\n\n SubBilling(double rate, int trialDays)\n : status(\"trial\"), trialDaysLeft(trialDays), monthlyRate(rate),\n balance(0), paidTotal(0), failedAttempts(0),\n daysSinceRenewal(0), refundAmount(0) {}\n\n // Advance one day. Rules:\n // 1. If trial: decrement trialDaysLeft. When it hits 0, transition to \"active\"\n // and set balance to prorated amount = monthlyRate * (30 - daysSinceRenewal) / 30.\n // 2. If active: increment daysSinceRenewal. At day 30, auto-renew:\n // add monthlyRate to balance, reset daysSinceRenewal to 0.\n // 3. If grace: increment daysSinceRenewal. After 7 days of grace, move to \"dunning\".\n // 4. If dunning: do nothing (awaiting manual resolution).\n // 5. Log every transition as \"DAY:\u003cstatus\u003e\" in auditLog.\n","golden_completion":" void advanceDay() {\n if (status == \"trial\") {\n trialDaysLeft--;\n if (trialDaysLeft \u003c= 0) { status = \"active\"; balance += monthlyRate * (30 - daysSinceRenewal) / 30.0; auditLog.push_back(\"DAY:active\"); }\n else auditLog.push_back(\"DAY:trial\");\n } else if (status == \"active\") {\n daysSinceRenewal++;\n if (daysSinceRenewal \u003e= 30) { balance += monthlyRate; daysSinceRenewal = 0; auditLog.push_back(\"DAY:active_renewal\"); }\n else auditLog.push_back(\"DAY:active\");\n } else if (status == \"grace\") {\n daysSinceRenewal++;\n if (daysSinceRenewal \u003e 7) { status = \"dunning\"; auditLog.push_back(\"DAY:dunning\"); }\n else auditLog.push_back(\"DAY:grace\");\n } else { auditLog.push_back(\"DAY:\" + status); }\n }\n","suffix":"\n // Attempt payment of given amount. Rules:\n // 1. If status is \"cancelled\" or \"trial\", return false.\n // 2. Subtract amount from balance (can go negative = credit).\n // 3. Add amount to paidTotal.\n // 4. Reset failedAttempts to 0. If status was \"grace\" or \"dunning\", set to \"active\".\n // 5. Log \"PAY:\u003camount\u003e\".\n // 6. Return true.\n bool makePayment(double amount) {\n if (status == \"cancelled\" || status == \"trial\") return false;\n balance -= amount;\n paidTotal += amount;\n failedAttempts = 0;\n if (status == \"grace\" || status == \"dunning\") status = \"active\";\n auditLog.push_back(\"PAY:\" + std::to_string(amount));\n return true;\n }\n\n // Record a failed payment. Rules:\n // 1. Increment failedAttempts.\n // 2. If failedAttempts \u003e= 3 and status is \"active\", move to \"grace\", reset daysSinceRenewal to 0.\n // 3. Log \"FAIL:\u003cfailedAttempts\u003e\".\n void failPayment() {\n failedAttempts++;\n if (failedAttempts \u003e= 3 \u0026\u0026 status == \"active\") {\n status = \"grace\";\n daysSinceRenewal = 0;\n }\n auditLog.push_back(\"FAIL:\" + std::to_string(failedAttempts));\n }\n\n // Cancel subscription. Rules:\n // 1. If already cancelled, do nothing.\n // 2. Compute refund: if active, refund = monthlyRate * (30 - daysSinceRenewal) / 30.\n // Otherwise refund = 0.\n // 3. Set status to \"cancelled\". Log \"CANCEL\".\n void cancel() {\n if (status == \"cancelled\") return;\n if (status == \"active\") {\n refundAmount = monthlyRate * (30 - daysSinceRenewal) / 30.0;\n } else {\n refundAmount = 0;\n }\n status = \"cancelled\";\n auditLog.push_back(\"CANCEL\");\n }\n};\n\nint main() {\n // Test trial -\u003e active transition with proration\n SubBilling s1(30.0, 3);\n s1.advanceDay(); // trial, 2 left\n s1.advanceDay(); // trial, 1 left\n s1.advanceDay(); // trial-\u003eactive, balance = 30*(30-0)/30 = 30\n assert(s1.status == \"active\");\n assert(std::abs(s1.balance - 30.0) \u003c 0.01);\n assert(s1.auditLog.size() == 3);\n\n // Test auto-renewal at day 30\n SubBilling s2(60.0, 1);\n s2.advanceDay(); // trial-\u003eactive\n for (int i = 0; i \u003c 30; i++) s2.advanceDay(); // daysSinceRenewal goes to 30 -\u003e renewal\n assert(std::abs(s2.balance - (60.0 + 60.0)) \u003c 0.01); // proration(60) + renewal(60)\n\n return 0;\n}\n","assertions":"\n // Hidden: grace -\u003e dunning transition\n SubBilling s3(50.0, 1);\n s3.advanceDay(); // trial-\u003eactive\n for (int i = 0; i \u003c 5; i++) s3.advanceDay(); // 5 days active\n s3.failPayment(); s3.failPayment(); s3.failPayment(); // 3 failures -\u003e grace\n assert(s3.status == \"grace\");\n assert(s3.daysSinceRenewal == 0);\n for (int i = 0; i \u003c 8; i++) s3.advanceDay(); // 8 days grace -\u003e dunning\n assert(s3.status == \"dunning\");\n\n // Hidden: payment during dunning recovers to active\n s3.makePayment(50.0);\n assert(s3.status == \"active\");\n assert(s3.failedAttempts == 0);\n\n // Hidden: cancel from grace gives 0 refund (not active)\n SubBilling s4(100.0, 1);\n s4.advanceDay();\n for (int i = 0; i \u003c 3; i++) s4.advanceDay();\n s4.failPayment(); s4.failPayment(); s4.failPayment();\n assert(s4.status == \"grace\");\n s4.cancel();\n assert(s4.refundAmount == 0);\n\n // Hidden: trial payment should fail\n SubBilling s5(30.0, 5);\n assert(!s5.makePayment(10.0));\n\n // Hidden: prorated balance on trial-\u003eactive with daysSinceRenewal=0\n SubBilling s6(90.0, 2);\n s6.advanceDay();\n s6.advanceDay(); // trial-\u003eactive, balance = 90*(30-0)/30 = 90\n assert(std::abs(s6.balance - 90.0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"12","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003ccmath\u003e\n#include \u003csstream\u003e\n\nstruct ShipItem {\n std::string sku;\n int qty;\n double weightEach; // lbs\n double lengthIn, widthIn, heightIn;\n double valueEach;\n};\n\nstruct Shipment {\n std::string status; // \"pending\",\"picked\",\"packed\",\"shipped\"\n std::vector\u003cShipItem\u003e items;\n bool international;\n std::string destCountry;\n double totalWeight;\n double dimWeight;\n double billableWeight;\n double shippingCost;\n double insuranceCost;\n double customsDuty;\n std::string carrier;\n std::string trackingNumber;\n std::vector\u003cstd::string\u003e auditLog;\n\n Shipment(bool intl, const std::string\u0026 country)\n : status(\"pending\"), international(intl), destCountry(country),\n totalWeight(0), dimWeight(0), billableWeight(0),\n shippingCost(0), insuranceCost(0), customsDuty(0) {}\n\n void addItem(const ShipItem\u0026 item) {\n if (status != \"pending\") return;\n items.push_back(item);\n }\n\n // Pick all items: compute totalWeight, dimWeight, billableWeight, select carrier.\n // Rules:\n // 1. totalWeight = sum of (weightEach * qty) for each item.\n // 2. For each item, dimWeight contribution = (length * width * height * qty) / 139.0.\n // Sum all contributions to get dimWeight.\n // 3. billableWeight = max(totalWeight, dimWeight), rounded up to next integer.\n // 4. Carrier selection by billableWeight:\n // \u003c= 5 lbs: \"USPS\", rate $0.80/lb\n // \u003c= 30 lbs: \"UPS\", rate $0.65/lb\n // \u003e 30 lbs: \"FREIGHT\", rate $0.45/lb\n // 5. shippingCost = billableWeight * rate.\n // 6. If total item value \u003e 500, insuranceCost = totalValue * 0.02.\n // 7. If international, customsDuty = totalValue * 0.12.\n // 8. Generate trackingNumber = carrier[0] + destCountry[0..1] + to_string((int)billableWeight).\n // 9. Set status to \"picked\". Log \"PICK:\u003ctotalWeight\u003e:\u003cbillableWeight\u003e:\u003ccarrier\u003e\".\n","golden_completion":" void pick() {\n if (status != \"pending\" || items.empty()) return;\n totalWeight = 0;\n dimWeight = 0;\n double totalValue = 0;\n for (auto\u0026 it : items) {\n totalWeight += it.weightEach * it.qty;\n dimWeight += (it.lengthIn * it.widthIn * it.heightIn * it.qty) / 139.0;\n totalValue += it.valueEach * it.qty;\n }\n billableWeight = std::ceil(std::max(totalWeight, dimWeight));\n double rate;\n if (billableWeight \u003c= 5) { carrier = \"USPS\"; rate = 0.80; }\n else if (billableWeight \u003c= 30) { carrier = \"UPS\"; rate = 0.65; }\n else { carrier = \"FREIGHT\"; rate = 0.45; }\n shippingCost = billableWeight * rate;\n if (totalValue \u003e 500) insuranceCost = totalValue * 0.02;\n if (international) customsDuty = totalValue * 0.12;\n trackingNumber = carrier.substr(0,1) + destCountry.substr(0,2)\n + std::to_string((int)billableWeight);\n status = \"picked\";\n auditLog.push_back(\"PICK:\" + std::to_string(totalWeight)\n + \":\" + std::to_string((int)billableWeight) + \":\" + carrier);\n }\n","suffix":"\n // Pack: verify items are picked, set status to \"packed\", log \"PACK\".\n void pack() {\n if (status != \"picked\") return;\n status = \"packed\";\n auditLog.push_back(\"PACK\");\n }\n\n // Ship: verify packed, set status to \"shipped\", log \"SHIP:\u003ctrackingNumber\u003e\".\n void ship() {\n if (status != \"packed\") return;\n status = \"shipped\";\n auditLog.push_back(\"SHIP:\" + trackingNumber);\n }\n};\n\nint main() {\n // Domestic small package\n Shipment s1(false, \"US\");\n s1.addItem({\"SKU1\", 2, 1.0, 6, 6, 6, 50.0});\n s1.pick();\n assert(s1.status == \"picked\");\n assert(std::abs(s1.totalWeight - 2.0) \u003c 0.01);\n // dimWeight = (6*6*6*2)/139 = 432/139 ≈ 3.11\n assert(s1.billableWeight == 4); // ceil(max(2, 3.11)) = 4\n assert(s1.carrier == \"USPS\");\n assert(std::abs(s1.shippingCost - 3.20) \u003c 0.01); // 4 * 0.80\n assert(s1.insuranceCost == 0); // value=100 \u003c 500\n s1.pack();\n s1.ship();\n assert(s1.status == \"shipped\");\n return 0;\n}\n","assertions":"\n // Hidden: dimensional weight dominates, insurance triggered, international\n Shipment s2(true, \"CA\");\n s2.addItem({\"BIG\", 1, 2.0, 30, 20, 15, 600.0});\n s2.pick();\n // dimWeight = (30*20*15*1)/139 = 9000/139 ≈ 64.75\n // totalWeight = 2.0, billable = ceil(64.75) = 65\n assert(s2.billableWeight == 65);\n assert(s2.carrier == \"FREIGHT\");\n assert(std::abs(s2.shippingCost - 65 * 0.45) \u003c 0.01);\n assert(std::abs(s2.insuranceCost - 600.0 * 0.02) \u003c 0.01);\n assert(std::abs(s2.customsDuty - 600.0 * 0.12) \u003c 0.01);\n assert(s2.trackingNumber == \"FCA65\");\n\n // Hidden: multiple items, UPS range\n Shipment s3(false, \"US\");\n s3.addItem({\"A\", 3, 3.0, 10, 10, 10, 100.0});\n s3.addItem({\"B\", 2, 2.0, 5, 5, 5, 50.0});\n s3.pick();\n // totalWeight = 9+4=13, dimWeight = (1000*3)/139 + (125*2)/139 = 21.58+1.80=23.38\n // billable = ceil(23.38) = 24\n assert(s3.billableWeight == 24);\n assert(s3.carrier == \"UPS\");\n assert(std::abs(s3.shippingCost - 24 * 0.65) \u003c 0.01);\n assert(s3.insuranceCost == 0); // value=400 \u003c 500\n\n // Hidden: empty items should not pick\n Shipment s4(false, \"US\");\n s4.pick();\n assert(s4.status == \"pending\");\n\n // Hidden: can\u0027t add items after pick\n Shipment s5(false, \"US\");\n s5.addItem({\"X\", 1, 1.0, 5, 5, 5, 10.0});\n s5.pick();\n s5.addItem({\"Y\", 1, 1.0, 5, 5, 5, 10.0});\n assert(s5.items.size() == 1);\n","category":"code_purpose_understanding"} {"id":"13","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cset\u003e\n#include \u003ccmath\u003e\n\nstruct LeaveManager {\n double vacationBalance; // in days (supports half-days as 0.5)\n double sickBalance;\n double carryoverLimit; // max days carried over from previous year\n int unpaidDaysTaken;\n std::set\u003cint\u003e blackoutDays; // day numbers that cannot have vacation\n bool managerApproved; // must be set before vacation can be taken\n std::vector\u003cstd::string\u003e leaveLog;\n\n LeaveManager(double vacInit, double sickInit, double carryLimit)\n : vacationBalance(vacInit), sickBalance(sickInit),\n carryoverLimit(carryLimit), unpaidDaysTaken(0),\n managerApproved(false) {}\n\n void addBlackout(int day) { blackoutDays.insert(day); }\n void approveVacation() { managerApproved = true; }\n void revokeApproval() { managerApproved = false; }\n\n // Request leave for a given day. Rules:\n // type: \"vacation\", \"sick\", \"unpaid\"\n // halfDay: if true, deducts 0.5 instead of 1.0\n //\n // 1. If type==\"vacation\":\n // a. If day is in blackoutDays, return \"BLACKOUT\".\n // b. If !managerApproved, return \"NO_APPROVAL\".\n // c. Compute deduction = halfDay ? 0.5 : 1.0.\n // d. If vacationBalance \u003c deduction, return \"INSUFFICIENT\".\n // e. Deduct from vacationBalance, log \"VAC:\u003cday\u003e:\u003cdeduction\u003e\", return \"OK\".\n // f. After a vacation is taken, revoke approval (must re-approve for next).\n // 2. If type==\"sick\":\n // a. Compute deduction = halfDay ? 0.5 : 1.0.\n // b. If sickBalance \u003e= deduction, deduct from sickBalance, log \"SICK:\u003cday\u003e:\u003cdeduction\u003e\", return \"OK\".\n // c. Else: the remainder (deduction - sickBalance) converts to unpaid.\n // Set sickBalance to 0, increment unpaidDaysTaken by 1, log \"SICK_TO_UNPAID:\u003cday\u003e\", return \"PARTIAL\".\n // 3. If type==\"unpaid\":\n // a. Increment unpaidDaysTaken by 1 (always full day regardless of halfDay).\n // b. Log \"UNPAID:\u003cday\u003e\", return \"OK\".\n // 4. Otherwise return \"INVALID\".\n","golden_completion":" std::string requestLeave(const std::string\u0026 type, int day, bool halfDay) {\n double deduction = halfDay ? 0.5 : 1.0;\n if (type == \"vacation\") {\n if (blackoutDays.count(day)) return \"BLACKOUT\";\n if (!managerApproved) return \"NO_APPROVAL\";\n if (vacationBalance \u003c deduction) return \"INSUFFICIENT\";\n vacationBalance -= deduction;\n leaveLog.push_back(\"VAC:\" + std::to_string(day) + \":\" + std::to_string(deduction));\n managerApproved = false; return \"OK\";\n } else if (type == \"sick\") {\n if (sickBalance \u003e= deduction) { sickBalance -= deduction; leaveLog.push_back(\"SICK:\" + std::to_string(day) + \":\" + std::to_string(deduction)); return \"OK\"; }\n sickBalance = 0; unpaidDaysTaken++; leaveLog.push_back(\"SICK_TO_UNPAID:\" + std::to_string(day)); return \"PARTIAL\";\n } else if (type == \"unpaid\") {\n unpaidDaysTaken++; leaveLog.push_back(\"UNPAID:\" + std::to_string(day)); return \"OK\";\n }\n return \"INVALID\";\n }\n","suffix":"\n // Year-end carryover: cap vacationBalance at carryoverLimit, reset sick to given amount.\n void yearEndReset(double newSickDays) {\n if (vacationBalance \u003e carryoverLimit)\n vacationBalance = carryoverLimit;\n sickBalance = newSickDays;\n unpaidDaysTaken = 0;\n managerApproved = false;\n leaveLog.push_back(\"YEAR_END\");\n }\n};\n\nint main() {\n LeaveManager lm(10.0, 5.0, 5.0);\n lm.addBlackout(25);\n lm.addBlackout(26);\n\n // Vacation requires approval\n assert(lm.requestLeave(\"vacation\", 10, false) == \"NO_APPROVAL\");\n lm.approveVacation();\n assert(lm.requestLeave(\"vacation\", 10, false) == \"OK\");\n assert(std::abs(lm.vacationBalance - 9.0) \u003c 0.01);\n // Approval is revoked after use\n assert(lm.requestLeave(\"vacation\", 11, false) == \"NO_APPROVAL\");\n\n // Blackout check\n lm.approveVacation();\n assert(lm.requestLeave(\"vacation\", 25, false) == \"BLACKOUT\");\n // Approval NOT consumed on blackout\n assert(lm.requestLeave(\"vacation\", 12, false) == \"OK\");\n\n return 0;\n}\n","assertions":"\n // Hidden: half-day vacation\n LeaveManager lm2(2.0, 1.0, 1.0);\n lm2.approveVacation();\n assert(lm2.requestLeave(\"vacation\", 1, true) == \"OK\");\n assert(std::abs(lm2.vacationBalance - 1.5) \u003c 0.01);\n // Approval revoked even for half-day\n assert(lm2.requestLeave(\"vacation\", 2, true) == \"NO_APPROVAL\");\n\n // Hidden: sick to unpaid conversion\n LeaveManager lm3(5.0, 0.3, 5.0);\n assert(lm3.requestLeave(\"sick\", 1, false) == \"PARTIAL\");\n assert(lm3.sickBalance == 0);\n assert(lm3.unpaidDaysTaken == 1);\n\n // Hidden: half-day sick when balance is 0.5\n LeaveManager lm4(5.0, 0.5, 5.0);\n assert(lm4.requestLeave(\"sick\", 1, true) == \"OK\");\n assert(std::abs(lm4.sickBalance) \u003c 0.01);\n\n // Hidden: unpaid always full day even if halfDay=true\n LeaveManager lm5(5.0, 5.0, 5.0);\n assert(lm5.requestLeave(\"unpaid\", 1, true) == \"OK\");\n assert(lm5.unpaidDaysTaken == 1); // not 0.5\n\n // Hidden: year-end carryover caps vacation\n LeaveManager lm6(8.0, 2.0, 5.0);\n lm6.yearEndReset(10.0);\n assert(std::abs(lm6.vacationBalance - 5.0) \u003c 0.01);\n assert(std::abs(lm6.sickBalance - 10.0) \u003c 0.01);\n assert(lm6.unpaidDaysTaken == 0);\n\n // Hidden: invalid type\n LeaveManager lm7(5.0, 5.0, 5.0);\n assert(lm7.requestLeave(\"personal\", 1, false) == \"INVALID\");\n\n // Hidden: insufficient vacation\n LeaveManager lm8(0.3, 5.0, 5.0);\n lm8.approveVacation();\n assert(lm8.requestLeave(\"vacation\", 1, false) == \"INSUFFICIENT\");\n","category":"code_purpose_understanding"} {"id":"14","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003ccmath\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n\nstruct OrderResult {\n std::string status; // \"FILLED\",\"PARTIAL\",\"REJECTED\",\"MARGIN_FAIL\"\n int filledQty;\n double avgPrice;\n double commission;\n int settlementDay;\n};\n\nstruct TradingEngine {\n // Order book: price -\u003e quantity available at that price (sorted ascending for asks)\n std::map\u003cdouble, int\u003e askBook;\n // Portfolio\n std::map\u003cstd::string, int\u003e positions;\n double cashBalance;\n double marginUsed;\n double marginLimit;\n int currentDay;\n std::set\u003cstd::string\u003e processedOrders;\n std::vector\u003cstd::string\u003e tradeLog;\n\n TradingEngine(double cash, double mLimit)\n : cashBalance(cash), marginUsed(0), marginLimit(mLimit), currentDay(1) {}\n\n void addAsk(double price, int qty) { askBook[price] += qty; }\n\n // Execute a buy order. Rules:\n // 1. If orderId already in processedOrders, return {\"DUPLICATE\",0,0,0,0}.\n // 2. orderType: \"MARKET\" or \"LIMIT\".\n // For LIMIT: only match asks with price \u003c= limitPrice.\n // For MARKET: match all asks in ascending price order.\n // 3. Match asks from lowest to highest price:\n // - Take min(ask qty, remaining order qty).\n // - Accumulate cost = sum(price * qty_filled_at_that_price).\n // - Remove or reduce ask entries.\n // 4. After matching:\n // - filledQty = total matched, avgPrice = totalCost / filledQty (0 if none).\n // - commission = 0.001 * totalCost (0.1%), minimum $1.00 if filledQty \u003e 0.\n // - totalDebit = totalCost + commission.\n // - If totalDebit \u003e cashBalance + (marginLimit - marginUsed), UNDO all fills\n // (restore askBook), return {\"MARGIN_FAIL\",0,0,0,0}.\n // - Otherwise: deduct totalDebit from cashBalance (can go negative to use margin),\n // if cashBalance \u003c 0, marginUsed += (-cashBalance), cashBalance = 0.\n // - Update positions[symbol] += filledQty.\n // - settlementDay = currentDay + 2 (T+2).\n // 5. If filledQty == requestedQty: status=\"FILLED\". If filledQty \u003e 0: \"PARTIAL\". Else \"REJECTED\".\n // 6. Add orderId to processedOrders.\n // 7. Log \"TRADE:\u003corderId\u003e:\u003cstatus\u003e:\u003cfilledQty\u003e@\u003cavgPrice\u003e\".\n","golden_completion":" OrderResult executeBuy(const std::string\u0026 orderId, const std::string\u0026 symbol, const std::string\u0026 orderType, int requestedQty, double limitPrice) {\n if (processedOrders.count(orderId)) return {\"DUPLICATE\", 0, 0, 0, 0};\n processedOrders.insert(orderId);\n auto savedBook = askBook; double totalCost = 0; int filledQty = 0;\n auto it = askBook.begin();\n while (it != askBook.end() \u0026\u0026 filledQty \u003c requestedQty) {\n if (orderType == \"LIMIT\" \u0026\u0026 it-\u003efirst \u003e limitPrice) break;\n int take = std::min(it-\u003esecond, requestedQty - filledQty);\n totalCost += it-\u003efirst * take; filledQty += take;\n it-\u003esecond -= take; if (it-\u003esecond == 0) it = askBook.erase(it); else ++it;\n }\n double avgPrice = filledQty \u003e 0 ? totalCost / filledQty : 0;\n double commission = filledQty \u003e 0 ? std::max(1.0, totalCost * 0.001) : 0;\n double totalDebit = totalCost + commission;\n if (filledQty \u003e 0 \u0026\u0026 totalDebit \u003e cashBalance + (marginLimit - marginUsed)) { askBook = savedBook; return {\"MARGIN_FAIL\", 0, 0, 0, 0}; }\n cashBalance -= totalDebit;\n if (cashBalance \u003c 0) { marginUsed += (-cashBalance); cashBalance = 0; }\n positions[symbol] += filledQty;\n std::string status = (filledQty == requestedQty) ? \"FILLED\" : (filledQty \u003e 0) ? \"PARTIAL\" : \"REJECTED\";\n tradeLog.push_back(\"TRADE:\" + orderId + \":\" + status + \":\" + std::to_string(filledQty) + \"@\" + std::to_string(avgPrice));\n return {status, filledQty, avgPrice, commission, currentDay + 2};\n }\n","suffix":"\n};\n\nint main() {\n TradingEngine eng(10000.0, 5000.0);\n eng.addAsk(100.0, 10);\n eng.addAsk(101.0, 20);\n eng.addAsk(105.0, 5);\n\n // Market buy 15 shares: fills 10@100 + 5@101 = 1505, commission max(1, 1.505)=1.505\n auto r1 = eng.executeBuy(\"O1\", \"AAPL\", \"MARKET\", 15, 0);\n assert(r1.status == \"FILLED\");\n assert(r1.filledQty == 15);\n assert(std::abs(r1.avgPrice - 1505.0/15) \u003c 0.01);\n assert(std::abs(r1.commission - 1.505) \u003c 0.01);\n assert(r1.settlementDay == 3);\n assert(eng.positions[\"AAPL\"] == 15);\n\n // Limit buy 20@101: only fills remaining 15@101, partial\n auto r2 = eng.executeBuy(\"O2\", \"AAPL\", \"LIMIT\", 20, 101.0);\n assert(r2.status == \"PARTIAL\");\n assert(r2.filledQty == 15);\n assert(eng.positions[\"AAPL\"] == 30);\n\n return 0;\n}\n","assertions":"\n // Hidden: duplicate order\n TradingEngine eng2(10000.0, 5000.0);\n eng2.addAsk(50.0, 10);\n auto rd1 = eng2.executeBuy(\"X1\", \"GOOG\", \"MARKET\", 5, 0);\n assert(rd1.status == \"FILLED\");\n auto rd2 = eng2.executeBuy(\"X1\", \"GOOG\", \"MARKET\", 5, 0);\n assert(rd2.status == \"DUPLICATE\");\n assert(eng2.positions[\"GOOG\"] == 5);\n\n // Hidden: margin failure with rollback\n TradingEngine eng3(100.0, 50.0);\n eng3.addAsk(200.0, 5);\n auto rm = eng3.executeBuy(\"M1\", \"TSLA\", \"MARKET\", 5, 0);\n // totalCost=1000, commission=1, totalDebit=1001 \u003e 100+50=150 -\u003e MARGIN_FAIL\n assert(rm.status == \"MARGIN_FAIL\");\n assert(rm.filledQty == 0);\n // askBook must be restored\n assert(eng3.askBook[200.0] == 5);\n assert(eng3.cashBalance == 100.0);\n\n // Hidden: margin usage (partial margin)\n TradingEngine eng4(80.0, 100.0);\n eng4.addAsk(50.0, 2);\n auto rmu = eng4.executeBuy(\"MU1\", \"IBM\", \"MARKET\", 2, 0);\n // cost=100, commission=1, debit=101. Cash goes to 80-101=-21, margin used=21, cash=0\n assert(rmu.status == \"FILLED\");\n assert(eng4.cashBalance == 0);\n assert(std::abs(eng4.marginUsed - 21.0) \u003c 0.01);\n\n // Hidden: rejected (no asks matching limit)\n TradingEngine eng5(10000.0, 5000.0);\n eng5.addAsk(200.0, 10);\n auto rr = eng5.executeBuy(\"R1\", \"MSFT\", \"LIMIT\", 5, 100.0);\n assert(rr.status == \"REJECTED\");\n assert(rr.filledQty == 0);\n assert(rr.commission == 0);\n\n // Hidden: commission minimum $1\n TradingEngine eng6(10000.0, 5000.0);\n eng6.addAsk(5.0, 1);\n auto rc = eng6.executeBuy(\"C1\", \"PENNY\", \"MARKET\", 1, 0);\n // cost=5, commission = max(1, 0.005) = 1.0\n assert(std::abs(rc.commission - 1.0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"15","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003calgorithm\u003e\n#include \u003ccmath\u003e\n\nstruct Milestone {\n std::string id;\n std::string name;\n int durationDays;\n double budget;\n double spent;\n int progress; // 0-100\n std::vector\u003cstd::string\u003e dependencies; // milestone IDs that must complete first\n bool completed;\n};\n\nstruct Project {\n std::map\u003cstd::string, Milestone\u003e milestones;\n std::vector\u003cstd::string\u003e statusLog;\n double totalBudget;\n double totalSpent;\n\n Project() : totalBudget(0), totalSpent(0) {}\n\n void addMilestone(const Milestone\u0026 m) {\n milestones[m.id] = m;\n totalBudget += m.budget;\n }\n\n // Update progress on a milestone. Rules:\n // 1. If milestone doesn\u0027t exist, return \"NOT_FOUND\".\n // 2. If any dependency is not completed, return \"DEPS_BLOCKED\".\n // 3. Set progress to newProgress (clamped to 0-100).\n // 4. Add spending: additionalSpend is added to milestone.spent and totalSpent.\n // 5. If progress reaches 100, set completed=true.\n // 6. Compute riskFlags:\n // a. \"OVER_BUDGET\" if milestone.spent \u003e milestone.budget.\n // b. \"SLOW\" if progress \u003c 50 and milestone.spent \u003e milestone.budget * 0.5.\n // 7. Log \"UPDATE:\u003cid\u003e:\u003cprogress\u003e%:\u003crisk_flags_comma_separated\u003e\" (empty string if no flags).\n // 8. Return \"OK\".\n","golden_completion":" std::string updateProgress(const std::string\u0026 msId, int newProgress, double additionalSpend) {\n auto it = milestones.find(msId);\n if (it == milestones.end()) return \"NOT_FOUND\";\n Milestone\u0026 ms = it-\u003esecond;\n for (auto\u0026 dep : ms.dependencies) {\n if (!milestones[dep].completed) return \"DEPS_BLOCKED\";\n }\n ms.progress = std::max(0, std::min(100, newProgress));\n ms.spent += additionalSpend;\n totalSpent += additionalSpend;\n if (ms.progress \u003e= 100) ms.completed = true;\n std::string flags;\n if (ms.spent \u003e ms.budget) {\n flags += \"OVER_BUDGET\";\n }\n if (ms.progress \u003c 50 \u0026\u0026 ms.spent \u003e ms.budget * 0.5) {\n if (!flags.empty()) flags += \",\";\n flags += \"SLOW\";\n }\n statusLog.push_back(\"UPDATE:\" + msId + \":\" + std::to_string(ms.progress) + \"%:\" + flags);\n return \"OK\";\n }\n","suffix":"\n // Compute overall project progress: weighted average by budget.\n // progress = sum(milestone.progress * milestone.budget) / totalBudget\n double overallProgress() const {\n if (totalBudget == 0) return 0;\n double sum = 0;\n for (auto\u0026 [id, ms] : milestones) {\n sum += ms.progress * ms.budget;\n }\n return sum / totalBudget;\n }\n};\n\nint main() {\n Project p;\n p.addMilestone({\"M1\", \"Design\", 10, 1000, 0, 0, {}, false});\n p.addMilestone({\"M2\", \"Build\", 20, 3000, 0, 0, {\"M1\"}, false});\n p.addMilestone({\"M3\", \"Test\", 10, 1000, 0, 0, {\"M2\"}, false});\n\n // M2 blocked by M1\n assert(p.updateProgress(\"M2\", 50, 100) == \"DEPS_BLOCKED\");\n\n // Complete M1\n assert(p.updateProgress(\"M1\", 100, 800) == \"OK\");\n assert(p.milestones[\"M1\"].completed);\n\n // Now M2 can proceed\n assert(p.updateProgress(\"M2\", 30, 2000) == \"OK\");\n // M2: spent=2000 \u003e budget*0.5=1500, progress=30 \u003c 50 -\u003e SLOW flag\n assert(p.statusLog.back().find(\"SLOW\") != std::string::npos);\n\n return 0;\n}\n","assertions":"\n // Hidden: OVER_BUDGET flag\n Project p2;\n p2.addMilestone({\"A\", \"TaskA\", 5, 500, 0, 0, {}, false});\n p2.updateProgress(\"A\", 80, 600);\n assert(p2.statusLog.back().find(\"OVER_BUDGET\") != std::string::npos);\n\n // Hidden: both flags at once\n Project p3;\n p3.addMilestone({\"B\", \"TaskB\", 5, 100, 0, 0, {}, false});\n p3.updateProgress(\"B\", 30, 120); // progress\u003c50, spent(120)\u003ebudget(100), spent\u003ebudget*0.5\n assert(p3.statusLog.back().find(\"OVER_BUDGET\") != std::string::npos);\n assert(p3.statusLog.back().find(\"SLOW\") != std::string::npos);\n\n // Hidden: NOT_FOUND\n Project p4;\n assert(p4.updateProgress(\"NONE\", 50, 100) == \"NOT_FOUND\");\n\n // Hidden: clamping progress\n Project p5;\n p5.addMilestone({\"C\", \"TaskC\", 5, 1000, 0, 0, {}, false});\n p5.updateProgress(\"C\", 150, 0);\n assert(p5.milestones[\"C\"].progress == 100);\n assert(p5.milestones[\"C\"].completed);\n\n // Hidden: overall progress weighted\n Project p6;\n p6.addMilestone({\"D1\", \"X\", 5, 1000, 0, 0, {}, false});\n p6.addMilestone({\"D2\", \"Y\", 5, 3000, 0, 0, {}, false});\n p6.updateProgress(\"D1\", 100, 0);\n p6.updateProgress(\"D2\", 50, 0);\n // overall = (100*1000 + 50*3000) / 4000 = 250000/4000 = 62.5\n assert(std::abs(p6.overallProgress() - 62.5) \u003c 0.01);\n\n // Hidden: negative clamping\n Project p7;\n p7.addMilestone({\"E\", \"Z\", 5, 1000, 0, 0, {}, false});\n p7.updateProgress(\"E\", -10, 0);\n assert(p7.milestones[\"E\"].progress == 0);\n assert(!p7.milestones[\"E\"].completed);\n","category":"code_purpose_understanding"} {"id":"16","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003calgorithm\u003e\n#include \u003ccmath\u003e\n\nstruct Appointment {\n std::string apptId;\n std::string patientId;\n std::string providerId;\n int slot; // time slot number\n double copay;\n std::string status; // \"CONFIRMED\",\"CANCELLED\",\"WAITLISTED\"\n};\n\nstruct ClinicScheduler {\n // provider -\u003e set of booked slots\n std::map\u003cstd::string, std::set\u003cint\u003e\u003e providerSchedule;\n // patient -\u003e set of booked slots\n std::map\u003cstd::string, std::set\u003cint\u003e\u003e patientSchedule;\n // provider -\u003e set of unavailable slots (blocked)\n std::map\u003cstd::string, std::set\u003cint\u003e\u003e providerBlocked;\n // insurance -\u003e copay rate (fraction of $100 base)\n std::map\u003cstd::string, double\u003e insuranceRates;\n // waitlist: slot -\u003e list of {apptId, patientId, providerId}\n std::map\u003cint, std::vector\u003cAppointment\u003e\u003e waitlist;\n // all appointments\n std::map\u003cstd::string, Appointment\u003e appointments;\n std::vector\u003cstd::string\u003e auditLog;\n int nextApptId;\n\n ClinicScheduler() : nextApptId(1) {}\n\n void blockProvider(const std::string\u0026 prov, int slot) {\n providerBlocked[prov].insert(slot);\n }\n void setInsuranceRate(const std::string\u0026 ins, double rate) {\n insuranceRates[ins] = rate;\n }\n\n // Book an appointment. Rules:\n // 1. If provider slot is in providerBlocked, return \"PROVIDER_UNAVAILABLE\".\n // 2. If provider slot already booked (providerSchedule), add to waitlist, return \"WAITLISTED\".\n // 3. If patient already has an appointment at this slot, return \"PATIENT_CONFLICT\".\n // 4. Compute copay: base $100 * insuranceRates[insurance]. If insurance not found, copay = $100.\n // 5. Create appointment, add to providerSchedule and patientSchedule.\n // 6. Log \"BOOK:\u003capptId\u003e:\u003cproviderId\u003e:\u003cslot\u003e:\u003ccopay\u003e\".\n // 7. Return \"CONFIRMED\".\n","golden_completion":" std::string bookAppointment(const std::string\u0026 patientId, const std::string\u0026 providerId, int slot, const std::string\u0026 insurance) {\n if (providerBlocked[providerId].count(slot)) return \"PROVIDER_UNAVAILABLE\";\n std::string apptId = \"A\" + std::to_string(nextApptId++);\n double rate = insuranceRates.count(insurance) ? insuranceRates[insurance] : 1.0;\n double copay = 100.0 * rate;\n if (providerSchedule[providerId].count(slot)) {\n Appointment wl{apptId, patientId, providerId, slot, copay, \"WAITLISTED\"};\n waitlist[slot].push_back(wl); appointments[apptId] = wl;\n auditLog.push_back(\"WAITLIST:\" + apptId + \":\" + providerId + \":\" + std::to_string(slot));\n return \"WAITLISTED\";\n }\n if (patientSchedule[patientId].count(slot)) return \"PATIENT_CONFLICT\";\n Appointment appt{apptId, patientId, providerId, slot, copay, \"CONFIRMED\"};\n providerSchedule[providerId].insert(slot); patientSchedule[patientId].insert(slot);\n appointments[apptId] = appt;\n auditLog.push_back(\"BOOK:\" + apptId + \":\" + providerId + \":\" + std::to_string(slot) + \":\" + std::to_string(copay));\n return \"CONFIRMED\";\n }\n","suffix":"\n // Cancel an appointment. Rules:\n // 1. Find appointment by apptId. If not found or already cancelled, return \"NOT_FOUND\".\n // 2. Set status to \"CANCELLED\".\n // 3. Remove from providerSchedule and patientSchedule.\n // 4. If there\u0027s anyone on waitlist for that provider+slot, promote first entry:\n // set their status to \"CONFIRMED\", add to schedules.\n // 5. Log \"CANCEL:\u003capptId\u003e\". If promoted, also log \"PROMOTE:\u003cpromotedApptId\u003e\".\n // 6. Return \"CANCELLED\".\n std::string cancelAppointment(const std::string\u0026 apptId) {\n auto it = appointments.find(apptId);\n if (it == appointments.end() || it-\u003esecond.status == \"CANCELLED\")\n return \"NOT_FOUND\";\n Appointment\u0026 appt = it-\u003esecond;\n appt.status = \"CANCELLED\";\n providerSchedule[appt.providerId].erase(appt.slot);\n patientSchedule[appt.patientId].erase(appt.slot);\n auditLog.push_back(\"CANCEL:\" + apptId);\n\n // Promote from waitlist\n int s = appt.slot;\n if (waitlist.count(s) \u0026\u0026 !waitlist[s].empty()) {\n // Find first waitlisted entry for same provider\n for (auto wit = waitlist[s].begin(); wit != waitlist[s].end(); ++wit) {\n if (wit-\u003eproviderId == appt.providerId \u0026\u0026 wit-\u003estatus == \"WAITLISTED\") {\n if (!patientSchedule[wit-\u003epatientId].count(s)) {\n wit-\u003estatus = \"CONFIRMED\";\n appointments[wit-\u003eapptId].status = \"CONFIRMED\";\n providerSchedule[appt.providerId].insert(s);\n patientSchedule[wit-\u003epatientId].insert(s);\n auditLog.push_back(\"PROMOTE:\" + wit-\u003eapptId);\n waitlist[s].erase(wit);\n break;\n }\n }\n }\n }\n return \"CANCELLED\";\n }\n};\n\nint main() {\n ClinicScheduler cs;\n cs.setInsuranceRate(\"BlueCross\", 0.20);\n cs.setInsuranceRate(\"Aetna\", 0.30);\n cs.blockProvider(\"DrSmith\", 5);\n\n // Blocked slot\n assert(cs.bookAppointment(\"P1\", \"DrSmith\", 5, \"BlueCross\") == \"PROVIDER_UNAVAILABLE\");\n\n // Normal booking (blocked call didn\u0027t consume an ID, so this is A1)\n assert(cs.bookAppointment(\"P1\", \"DrSmith\", 10, \"BlueCross\") == \"CONFIRMED\");\n assert(cs.appointments[\"A1\"].copay == 20.0);\n\n // Same slot, same provider -\u003e waitlist\n assert(cs.bookAppointment(\"P2\", \"DrSmith\", 10, \"Aetna\") == \"WAITLISTED\");\n\n return 0;\n}\n","assertions":"\n // Hidden: patient conflict\n ClinicScheduler cs2;\n cs2.bookAppointment(\"PA\", \"Dr1\", 1, \"none\");\n assert(cs2.bookAppointment(\"PA\", \"Dr2\", 1, \"none\") == \"PATIENT_CONFLICT\");\n\n // Hidden: unknown insurance defaults to $100\n ClinicScheduler cs3;\n cs3.bookAppointment(\"PB\", \"Dr1\", 2, \"Unknown\");\n assert(cs3.appointments[\"A1\"].copay == 100.0);\n\n // Hidden: cancel and promote from waitlist\n ClinicScheduler cs4;\n cs4.setInsuranceRate(\"Ins\", 0.25);\n cs4.bookAppointment(\"P1\", \"DrA\", 3, \"Ins\"); // A1 confirmed\n cs4.bookAppointment(\"P2\", \"DrA\", 3, \"Ins\"); // A2 waitlisted\n assert(cs4.appointments[\"A2\"].status == \"WAITLISTED\");\n cs4.cancelAppointment(\"A1\");\n assert(cs4.appointments[\"A2\"].status == \"CONFIRMED\");\n assert(cs4.providerSchedule[\"DrA\"].count(3));\n assert(cs4.patientSchedule[\"P2\"].count(3));\n\n // Hidden: blocked call does NOT consume an apptId\n ClinicScheduler cs5;\n cs5.blockProvider(\"Dr1\", 1);\n assert(cs5.bookAppointment(\"P1\", \"Dr1\", 1, \"none\") == \"PROVIDER_UNAVAILABLE\");\n assert(cs5.bookAppointment(\"P1\", \"Dr1\", 2, \"none\") == \"CONFIRMED\");\n // Since blocked didn\u0027t consume ID, this booking is A1\n assert(cs5.appointments.count(\"A1\"));\n assert(cs5.appointments[\"A1\"].slot == 2);\n\n // Hidden: cancel already-cancelled\n ClinicScheduler cs6;\n cs6.bookAppointment(\"P1\", \"Dr1\", 1, \"none\");\n cs6.cancelAppointment(\"A1\");\n assert(cs6.cancelAppointment(\"A1\") == \"NOT_FOUND\");\n","category":"code_purpose_understanding"} {"id":"17","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003calgorithm\u003e\n#include \u003ccmath\u003e\n\nstruct CartItem {\n std::string sku;\n std::string category; // \"electronics\",\"clothing\",\"food\",\"luxury\"\n double price;\n int qty;\n};\n\nstruct Coupon {\n std::string code;\n double discountPct; // 0-1\n double minPurchase;\n bool singleUse;\n std::set\u003cstd::string\u003e excludedCategories;\n};\n\nstruct CheckoutResult {\n std::string status; // \"SUCCESS\",\"INSUFFICIENT_INVENTORY\",\"COUPON_INVALID\",\"EXPIRED\",\"AUTH_FAIL\"\n double subtotal;\n double discount;\n double tax;\n double shipping;\n double total;\n};\n\nstruct CartProcessor {\n std::vector\u003cCartItem\u003e items;\n std::map\u003cstd::string, int\u003e inventory; // sku -\u003e qty available\n std::map\u003cstd::string, Coupon\u003e coupons;\n std::set\u003cstd::string\u003e usedCoupons;\n // Tax rates by category\n std::map\u003cstd::string, double\u003e taxRates;\n int cartCreatedTime;\n int cartExpiryMinutes;\n std::vector\u003cstd::string\u003e auditLog;\n\n CartProcessor(int createdTime, int expiryMin)\n : cartCreatedTime(createdTime), cartExpiryMinutes(expiryMin) {\n taxRates[\"electronics\"] = 0.08;\n taxRates[\"clothing\"] = 0.04;\n taxRates[\"food\"] = 0.0;\n taxRates[\"luxury\"] = 0.12;\n }\n\n void addItem(const CartItem\u0026 item) { items.push_back(item); }\n void setInventory(const std::string\u0026 sku, int qty) { inventory[sku] = qty; }\n void addCoupon(const Coupon\u0026 c) { coupons[c.code] = c; }\n\n // Checkout the cart. Rules (must be checked in this order):\n // 1. Check cart expiry: if currentTime - cartCreatedTime \u003e cartExpiryMinutes, return EXPIRED.\n // 2. Check inventory for all items: if any item\u0027s qty \u003e inventory[sku], return INSUFFICIENT_INVENTORY.\n // Do NOT deduct inventory yet.\n // 3. Compute subtotal = sum(price * qty) for all items.\n // 4. Apply coupon if provided (couponCode != \"\"):\n // a. If coupon not found or (singleUse and already in usedCoupons): return COUPON_INVALID.\n // b. If subtotal \u003c coupon.minPurchase: return COUPON_INVALID.\n // c. Compute eligible subtotal: sum of (price*qty) for items NOT in excludedCategories.\n // d. discount = eligibleSubtotal * coupon.discountPct.\n // e. If singleUse, add to usedCoupons.\n // 5. Compute tax: for each item, tax += price * qty * taxRates[category] (0 if unknown category).\n // Tax is computed on ORIGINAL prices (before discount).\n // 6. Compute shipping based on (subtotal - discount):\n // \u003e= 100: free, \u003e= 50: $5.99, \u003e= 25: $8.99, else $12.99.\n // 7. total = subtotal - discount + tax + shipping.\n // 8. If paymentAuthorized is false, return AUTH_FAIL. (Do NOT deduct inventory.)\n // 9. Deduct inventory for all items.\n // 10. Log \"CHECKOUT:\u003ctotal\u003e:\u003cstatus\u003e\".\n // 11. Return SUCCESS with all computed values.\n","golden_completion":" CheckoutResult checkout(int currentTime, const std::string\u0026 couponCode, bool paymentAuthorized) {\n if (currentTime - cartCreatedTime \u003e cartExpiryMinutes) return {\"EXPIRED\", 0, 0, 0, 0, 0};\n for (auto\u0026 item : items) if (item.qty \u003e inventory[item.sku]) return {\"INSUFFICIENT_INVENTORY\", 0, 0, 0, 0, 0};\n double subtotal = 0; for (auto\u0026 item : items) subtotal += item.price * item.qty;\n double discount = 0;\n if (!couponCode.empty()) {\n auto cit = coupons.find(couponCode);\n if (cit == coupons.end() || (cit-\u003esecond.singleUse \u0026\u0026 usedCoupons.count(couponCode))) return {\"COUPON_INVALID\", 0, 0, 0, 0, 0};\n if (subtotal \u003c cit-\u003esecond.minPurchase) return {\"COUPON_INVALID\", 0, 0, 0, 0, 0};\n double eligible = 0;\n for (auto\u0026 item : items) if (!cit-\u003esecond.excludedCategories.count(item.category)) eligible += item.price * item.qty;\n discount = eligible * cit-\u003esecond.discountPct;\n if (cit-\u003esecond.singleUse) usedCoupons.insert(couponCode);\n }\n double tax = 0;\n for (auto\u0026 item : items) { double r = taxRates.count(item.category) ? taxRates[item.category] : 0; tax += item.price * item.qty * r; }\n double ad = subtotal - discount;\n double shipping = ad \u003e= 100 ? 0 : ad \u003e= 50 ? 5.99 : ad \u003e= 25 ? 8.99 : 12.99;\n double total = subtotal - discount + tax + shipping;\n if (!paymentAuthorized) return {\"AUTH_FAIL\", subtotal, discount, tax, shipping, total};\n for (auto\u0026 item : items) inventory[item.sku] -= item.qty;\n auditLog.push_back(\"CHECKOUT:\" + std::to_string(total) + \":SUCCESS\");\n return {\"SUCCESS\", subtotal, discount, tax, shipping, total};\n }\n","suffix":"\n};\n\nint main() {\n CartProcessor cp(0, 30); // created at time 0, expires after 30 min\n cp.setInventory(\"PHONE\", 10);\n cp.setInventory(\"SHIRT\", 20);\n cp.addItem({\"PHONE\", \"electronics\", 500.0, 1});\n cp.addItem({\"SHIRT\", \"clothing\", 30.0, 2});\n cp.addCoupon({\"SAVE10\", 0.10, 50.0, true, {\"luxury\"}});\n\n auto r1 = cp.checkout(10, \"SAVE10\", true);\n assert(r1.status == \"SUCCESS\");\n // subtotal = 500 + 60 = 560\n assert(std::abs(r1.subtotal - 560.0) \u003c 0.01);\n // discount: all items eligible (no luxury), discount = 560 * 0.10 = 56\n assert(std::abs(r1.discount - 56.0) \u003c 0.01);\n // tax: 500*0.08 + 60*0.04 = 40 + 2.4 = 42.4\n assert(std::abs(r1.tax - 42.4) \u003c 0.01);\n // shipping: 560-56=504 \u003e= 100, free\n assert(std::abs(r1.shipping) \u003c 0.01);\n // total = 560 - 56 + 42.4 + 0 = 546.4\n assert(std::abs(r1.total - 546.4) \u003c 0.01);\n\n // Coupon is single-use, second use fails\n cp.addItem({\"PHONE\", \"electronics\", 500.0, 1});\n cp.setInventory(\"PHONE\", 10);\n // Need new items since old ones were checked out\n CartProcessor cp2(0, 30);\n cp2.setInventory(\"PHONE\", 5);\n cp2.addItem({\"PHONE\", \"electronics\", 100.0, 1});\n cp2.addCoupon({\"SAVE10\", 0.10, 50.0, true, {\"luxury\"}});\n cp2.usedCoupons.insert(\"SAVE10\"); // already used\n auto r2 = cp2.checkout(5, \"SAVE10\", true);\n assert(r2.status == \"COUPON_INVALID\");\n\n return 0;\n}\n","assertions":"\n // Hidden: cart expiry\n CartProcessor cp3(0, 10);\n cp3.setInventory(\"X\", 5);\n cp3.addItem({\"X\", \"food\", 20.0, 1});\n auto re = cp3.checkout(11, \"\", true);\n assert(re.status == \"EXPIRED\");\n\n // Hidden: insufficient inventory\n CartProcessor cp4(0, 60);\n cp4.setInventory(\"Y\", 2);\n cp4.addItem({\"Y\", \"clothing\", 50.0, 5});\n auto ri = cp4.checkout(5, \"\", true);\n assert(ri.status == \"INSUFFICIENT_INVENTORY\");\n\n // Hidden: excluded category in coupon\n CartProcessor cp5(0, 60);\n cp5.setInventory(\"LUX\", 3);\n cp5.addItem({\"LUX\", \"luxury\", 200.0, 2});\n cp5.addCoupon({\"NOLUX\", 0.20, 100.0, false, {\"luxury\"}});\n auto rl = cp5.checkout(5, \"NOLUX\", true);\n assert(rl.status == \"SUCCESS\");\n assert(std::abs(rl.discount) \u003c 0.01); // all items excluded\n // tax: 400*0.12 = 48\n assert(std::abs(rl.tax - 48.0) \u003c 0.01);\n // shipping: 400-0=400 \u003e= 100, free\n assert(std::abs(rl.shipping) \u003c 0.01);\n\n // Hidden: auth fail does NOT deduct inventory\n CartProcessor cp6(0, 60);\n cp6.setInventory(\"Z\", 3);\n cp6.addItem({\"Z\", \"electronics\", 40.0, 2});\n auto ra = cp6.checkout(5, \"\", false);\n assert(ra.status == \"AUTH_FAIL\");\n assert(cp6.inventory[\"Z\"] == 3); // not deducted\n\n // Hidden: shipping tiers\n CartProcessor cp7(0, 60);\n cp7.setInventory(\"A\", 100);\n cp7.addItem({\"A\", \"food\", 10.0, 1}); // subtotal=10, no discount\n auto rs = cp7.checkout(1, \"\", true);\n assert(std::abs(rs.shipping - 12.99) \u003c 0.01);\n\n CartProcessor cp8(0, 60);\n cp8.setInventory(\"B\", 100);\n cp8.addItem({\"B\", \"food\", 30.0, 1});\n auto rs2 = cp8.checkout(1, \"\", true);\n assert(std::abs(rs2.shipping - 8.99) \u003c 0.01);\n\n // Hidden: tax on original, not discounted\n CartProcessor cp9(0, 60);\n cp9.setInventory(\"E\", 5);\n cp9.addItem({\"E\", \"electronics\", 100.0, 1});\n cp9.addCoupon({\"HALF\", 0.50, 0.0, false, {}});\n auto rt = cp9.checkout(1, \"HALF\", true);\n // tax = 100*0.08 = 8 (on original, not on 50)\n assert(std::abs(rt.tax - 8.0) \u003c 0.01);\n // discount = 100*0.50 = 50\n assert(std::abs(rt.discount - 50.0) \u003c 0.01);\n\n // Hidden: coupon minPurchase check\n CartProcessor cp10(0, 60);\n cp10.setInventory(\"F\", 5);\n cp10.addItem({\"F\", \"clothing\", 20.0, 1});\n cp10.addCoupon({\"BIG\", 0.10, 100.0, false, {}});\n auto rm = cp10.checkout(1, \"BIG\", true);\n assert(rm.status == \"COUPON_INVALID\"); // subtotal 20 \u003c minPurchase 100\n","category":"code_purpose_understanding"} {"id":"18","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003ccmath\u003e\n\nstruct ServiceRecord {\n std::string vehicleId;\n std::string serviceType;\n int mileage;\n double laborCost;\n double partsCost;\n bool warrantyApplied;\n bool rentalProvided;\n};\n\nstruct FleetManager {\n struct Vehicle {\n int currentMileage;\n int lastServiceMileage;\n int warrantyMileageLimit; // warranty valid up to this mileage\n std::vector\u003cServiceRecord\u003e history;\n };\n\n std::map\u003cstd::string, Vehicle\u003e vehicles;\n std::map\u003cstd::string, int\u003e partInventory; // part name -\u003e qty\n int serviceInterval; // miles between services\n double laborRatePerHour;\n std::vector\u003cstd::string\u003e auditLog;\n\n FleetManager(int interval, double laborRate)\n : serviceInterval(interval), laborRatePerHour(laborRate) {}\n\n void addVehicle(const std::string\u0026 id, int mileage, int warrantyLimit) {\n vehicles[id] = {mileage, mileage, warrantyLimit, {}};\n }\n void addPart(const std::string\u0026 part, int qty) { partInventory[part] += qty; }\n\n // Perform service on a vehicle. Rules:\n // 1. If vehicle not found, return \"NOT_FOUND\".\n // 2. If (currentMileage - lastServiceMileage) \u003c serviceInterval, return \"NOT_DUE\".\n // 3. Estimate laborHours based on serviceType:\n // \"oil_change\": 1, \"tire_rotation\": 2, \"brake_service\": 4, \"transmission\": 8. Default: 2.\n // 4. Parts required (map serviceType to part name):\n // \"oil_change\"-\u003e\"oil_filter\", \"tire_rotation\"-\u003e\"none\",\n // \"brake_service\"-\u003e\"brake_pads\", \"transmission\"-\u003e\"trans_fluid\". Default: \"none\".\n // 5. If part != \"none\" and partInventory[part] \u003c 1, return \"NO_PARTS\".\n // 6. laborCost = laborHours * laborRatePerHour.\n // 7. partsCost: \"oil_filter\"=$25, \"brake_pads\"=$80, \"trans_fluid\"=$120, else $0.\n // 8. warrantyApplied: if currentMileage \u003c= warrantyMileageLimit, partsCost = 0, set warrantyApplied=true.\n // 9. If currentMileage \u003e warrantyMileageLimit + 50000, provide rental: rentalProvided=true.\n // (Old vehicle out of warranty by \u003e50k miles needs longer service, gets rental.)\n // 10. If part != \"none\", decrement partInventory[part].\n // 11. Update lastServiceMileage = currentMileage.\n // 12. Record in history, log \"SERVICE:\u003cvehicleId\u003e:\u003cserviceType\u003e:\u003ctotalCost\u003e\".\n // 13. Return \"SERVICED\".\n","golden_completion":" std::string performService(const std::string\u0026 vehicleId, const std::string\u0026 serviceType) {\n auto it = vehicles.find(vehicleId); if (it == vehicles.end()) return \"NOT_FOUND\";\n Vehicle\u0026 v = it-\u003esecond;\n if (v.currentMileage - v.lastServiceMileage \u003c serviceInterval) return \"NOT_DUE\";\n int lh = serviceType == \"oil_change\" ? 1 : serviceType == \"tire_rotation\" ? 2 : serviceType == \"brake_service\" ? 4 : serviceType == \"transmission\" ? 8 : 2;\n std::string part = serviceType == \"oil_change\" ? \"oil_filter\" : serviceType == \"brake_service\" ? \"brake_pads\" : serviceType == \"transmission\" ? \"trans_fluid\" : \"none\";\n if (part != \"none\" \u0026\u0026 partInventory[part] \u003c 1) return \"NO_PARTS\";\n double laborCost = lh * laborRatePerHour;\n double partsCost = part == \"oil_filter\" ? 25 : part == \"brake_pads\" ? 80 : part == \"trans_fluid\" ? 120 : 0;\n bool warrantyApplied = false;\n if (v.currentMileage \u003c= v.warrantyMileageLimit) { partsCost = 0; warrantyApplied = true; }\n bool rentalProvided = (v.currentMileage \u003e v.warrantyMileageLimit + 50000);\n if (part != \"none\") partInventory[part]--;\n v.lastServiceMileage = v.currentMileage;\n double totalCost = laborCost + partsCost;\n v.history.push_back({vehicleId, serviceType, v.currentMileage, laborCost, partsCost, warrantyApplied, rentalProvided});\n auditLog.push_back(\"SERVICE:\" + vehicleId + \":\" + serviceType + \":\" + std::to_string(totalCost));\n return \"SERVICED\";\n }\n","suffix":"\n void updateMileage(const std::string\u0026 id, int newMileage) {\n if (vehicles.count(id)) vehicles[id].currentMileage = newMileage;\n }\n};\n\nint main() {\n FleetManager fm(5000, 75.0);\n fm.addVehicle(\"V1\", 10000, 36000);\n fm.addPart(\"oil_filter\", 5);\n fm.addPart(\"brake_pads\", 3);\n\n // Not due yet (0 miles since last service)\n assert(fm.performService(\"V1\", \"oil_change\") == \"NOT_DUE\");\n\n fm.updateMileage(\"V1\", 15000);\n assert(fm.performService(\"V1\", \"oil_change\") == \"SERVICED\");\n // Under warranty: partsCost=0, labor=1*75=75\n assert(fm.vehicles[\"V1\"].history.back().warrantyApplied);\n assert(fm.vehicles[\"V1\"].history.back().partsCost == 0);\n assert(fm.vehicles[\"V1\"].history.back().laborCost == 75.0);\n\n return 0;\n}\n","assertions":"\n // Hidden: out of warranty, parts cost applies\n FleetManager fm2(5000, 50.0);\n fm2.addVehicle(\"V2\", 40000, 36000); // over warranty\n fm2.addPart(\"brake_pads\", 2);\n fm2.updateMileage(\"V2\", 45000);\n assert(fm2.performService(\"V2\", \"brake_service\") == \"SERVICED\");\n assert(!fm2.vehicles[\"V2\"].history.back().warrantyApplied);\n assert(fm2.vehicles[\"V2\"].history.back().partsCost == 80.0);\n assert(fm2.vehicles[\"V2\"].history.back().laborCost == 200.0); // 4*50\n\n // Hidden: rental provided when way out of warranty\n FleetManager fm3(5000, 50.0);\n fm3.addVehicle(\"V3\", 90000, 36000); // 90000 \u003e 36000+50000=86000\n fm3.addPart(\"oil_filter\", 1);\n fm3.updateMileage(\"V3\", 95000);\n assert(fm3.performService(\"V3\", \"oil_change\") == \"SERVICED\");\n assert(fm3.vehicles[\"V3\"].history.back().rentalProvided);\n\n // Hidden: no rental when within 50k of warranty end\n FleetManager fm4(5000, 50.0);\n fm4.addVehicle(\"V4\", 60000, 36000); // 60000 \u003c 36000+50000=86000\n fm4.addPart(\"oil_filter\", 1);\n fm4.updateMileage(\"V4\", 65000);\n assert(fm4.performService(\"V4\", \"oil_change\") == \"SERVICED\");\n assert(!fm4.vehicles[\"V4\"].history.back().rentalProvided);\n\n // Hidden: no parts available\n FleetManager fm5(5000, 50.0);\n fm5.addVehicle(\"V5\", 10000, 50000);\n fm5.updateMileage(\"V5\", 15000);\n assert(fm5.performService(\"V5\", \"transmission\") == \"NO_PARTS\");\n\n // Hidden: tire rotation needs no parts\n FleetManager fm6(5000, 50.0);\n fm6.addVehicle(\"V6\", 10000, 50000);\n fm6.updateMileage(\"V6\", 15000);\n assert(fm6.performService(\"V6\", \"tire_rotation\") == \"SERVICED\");\n assert(fm6.vehicles[\"V6\"].history.back().partsCost == 0);\n assert(fm6.vehicles[\"V6\"].history.back().laborCost == 100.0); // 2*50\n\n // Hidden: not found\n FleetManager fm7(5000, 50.0);\n assert(fm7.performService(\"NOPE\", \"oil_change\") == \"NOT_FOUND\");\n\n // Hidden: part inventory decrements\n FleetManager fm8(5000, 50.0);\n fm8.addVehicle(\"V8\", 10000, 50000);\n fm8.addPart(\"oil_filter\", 1);\n fm8.updateMileage(\"V8\", 15000);\n fm8.performService(\"V8\", \"oil_change\");\n assert(fm8.partInventory[\"oil_filter\"] == 0);\n fm8.updateMileage(\"V8\", 20000);\n assert(fm8.performService(\"V8\", \"oil_change\") == \"NO_PARTS\");\n","category":"code_purpose_understanding"} {"id":"19","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccmath\u003e\n\nstruct EscrowAccount {\n double salePrice;\n double earnestDeposit;\n double escrowBalance; // funds held\n bool inspectionPassed;\n bool appraisalPassed;\n bool titleClear;\n double buyerClosingPct; // fraction of closing costs buyer pays (rest is seller)\n double closingCostRate; // as fraction of sale price\n double annualTax;\n double monthlyHoa;\n int closingDayOfYear; // 1-365\n std::string status; // \"OPEN\",\"CONTINGENCY_FAIL\",\"CLOSED\",\"REFUNDED\"\n std::vector\u003cstd::string\u003e ledger;\n\n EscrowAccount(double price, double earnest, double buyerPct, double closingRate,\n double tax, double hoa, int closingDay)\n : salePrice(price), earnestDeposit(earnest), escrowBalance(earnest),\n inspectionPassed(false), appraisalPassed(false), titleClear(false),\n buyerClosingPct(buyerPct), closingCostRate(closingRate),\n annualTax(tax), monthlyHoa(hoa), closingDayOfYear(closingDay),\n status(\"OPEN\") {}\n\n void passInspection() { inspectionPassed = true; ledger.push_back(\"INSPECTION:PASS\"); }\n void failInspection() { inspectionPassed = false; ledger.push_back(\"INSPECTION:FAIL\"); }\n void passAppraisal() { appraisalPassed = true; ledger.push_back(\"APPRAISAL:PASS\"); }\n void failAppraisal() { appraisalPassed = false; ledger.push_back(\"APPRAISAL:FAIL\"); }\n void clearTitle() { titleClear = true; ledger.push_back(\"TITLE:CLEAR\"); }\n\n // Close the escrow. Rules (in order):\n // 1. If status != \"OPEN\", return \"ALREADY_CLOSED\".\n // 2. If !inspectionPassed, set status=\"CONTINGENCY_FAIL\", refund earnest to buyer,\n // set escrowBalance=0, log \"REFUND:INSPECTION:\u003cearnestDeposit\u003e\", return \"CONTINGENCY_FAIL\".\n // 3. If !appraisalPassed, set status=\"CONTINGENCY_FAIL\", refund earnest minus $500 appraisal fee,\n // set escrowBalance = 0, log \"REFUND:APPRAISAL:\u003crefundAmount\u003e\", return \"CONTINGENCY_FAIL\".\n // 4. If !titleClear, set status=\"CONTINGENCY_FAIL\", refund full earnest,\n // set escrowBalance=0, log \"REFUND:TITLE:\u003cearnestDeposit\u003e\", return \"CONTINGENCY_FAIL\".\n // 5. Compute prorated tax: annualTax * (closingDayOfYear / 365.0). Seller owes this to buyer.\n // 6. Compute prorated HOA: monthlyHoa * (closingDayOfYear % 30) / 30.0. Seller credit to buyer.\n // 7. Compute total closing costs: salePrice * closingCostRate.\n // Buyer pays: closingCosts * buyerClosingPct.\n // Seller pays: closingCosts * (1 - buyerClosingPct).\n // 8. Disbursement waterfall:\n // a. buyerOwes = salePrice - earnestDeposit + buyerClosingCosts - proratedTax - proratedHoa.\n // b. sellerReceives = salePrice - sellerClosingCosts - proratedTax - proratedHoa.\n // c. escrowBalance = buyerOwes (buyer deposits remaining).\n // 9. Set status=\"CLOSED\".\n // 10. Log \"CLOSE:buyer_owes=\u003cX\u003e:seller_receives=\u003cY\u003e\".\n // 11. Return \"CLOSED\".\n","golden_completion":" std::string closeEscrow() {\n if (status != \"OPEN\") return \"ALREADY_CLOSED\";\n if (!inspectionPassed) { status = \"CONTINGENCY_FAIL\"; escrowBalance = 0; ledger.push_back(\"REFUND:INSPECTION:\" + std::to_string(earnestDeposit)); return \"CONTINGENCY_FAIL\"; }\n if (!appraisalPassed) { status = \"CONTINGENCY_FAIL\"; escrowBalance = 0; ledger.push_back(\"REFUND:APPRAISAL:\" + std::to_string(earnestDeposit - 500.0)); return \"CONTINGENCY_FAIL\"; }\n if (!titleClear) { status = \"CONTINGENCY_FAIL\"; escrowBalance = 0; ledger.push_back(\"REFUND:TITLE:\" + std::to_string(earnestDeposit)); return \"CONTINGENCY_FAIL\"; }\n double proratedTax = annualTax * (closingDayOfYear / 365.0);\n double proratedHoa = monthlyHoa * ((closingDayOfYear % 30) / 30.0);\n double totalClosing = salePrice * closingCostRate;\n double buyerClosing = totalClosing * buyerClosingPct;\n double sellerClosing = totalClosing * (1.0 - buyerClosingPct);\n double buyerOwes = salePrice - earnestDeposit + buyerClosing - proratedTax - proratedHoa;\n double sellerReceives = salePrice - sellerClosing - proratedTax - proratedHoa;\n escrowBalance = buyerOwes;\n status = \"CLOSED\";\n ledger.push_back(\"CLOSE:buyer_owes=\" + std::to_string(buyerOwes) + \":seller_receives=\" + std::to_string(sellerReceives));\n return \"CLOSED\";\n }\n","suffix":"\n};\n\nint main() {\n // Standard closing: 300k house, 10k earnest, 60/40 split, 3% closing, tax 6000/yr, HOA 300/mo, day 180\n EscrowAccount e1(300000, 10000, 0.60, 0.03, 6000, 300, 180);\n e1.passInspection();\n e1.passAppraisal();\n e1.clearTitle();\n auto r1 = e1.closeEscrow();\n assert(r1 == \"CLOSED\");\n // proratedTax = 6000 * 180/365 ≈ 2958.90\n double pt1 = 6000.0 * (180.0 / 365.0);\n // proratedHoa = 300 * (180%30)/30 = 300 * 0/30 = 0\n double ph1 = 300.0 * ((180 % 30) / 30.0);\n // closingCosts = 300000*0.03 = 9000, buyer=5400, seller=3600\n double buyerOwes = 300000 - 10000 + 5400 - pt1 - ph1;\n double sellerReceives = 300000 - 3600 - pt1 - ph1;\n assert(std::abs(e1.escrowBalance - buyerOwes) \u003c 1.0);\n\n return 0;\n}\n","assertions":"\n // Hidden: inspection failure -\u003e full refund\n EscrowAccount e2(500000, 20000, 0.50, 0.02, 8000, 400, 100);\n // Don\u0027t pass inspection\n e2.passAppraisal();\n e2.clearTitle();\n auto r2 = e2.closeEscrow();\n assert(r2 == \"CONTINGENCY_FAIL\");\n assert(e2.escrowBalance == 0);\n // Ledger should have REFUND:INSPECTION\n bool foundInsp = false;\n for (auto\u0026 l : e2.ledger) if (l.find(\"REFUND:INSPECTION\") != std::string::npos) foundInsp = true;\n assert(foundInsp);\n\n // Hidden: appraisal failure -\u003e earnest minus $500\n EscrowAccount e3(400000, 15000, 0.50, 0.02, 8000, 400, 100);\n e3.passInspection();\n // Don\u0027t pass appraisal\n e3.clearTitle();\n auto r3 = e3.closeEscrow();\n assert(r3 == \"CONTINGENCY_FAIL\");\n // Refund = 15000 - 500 = 14500\n bool foundAppr = false;\n for (auto\u0026 l : e3.ledger) if (l.find(\"REFUND:APPRAISAL\") != std::string::npos) foundAppr = true;\n assert(foundAppr);\n\n // Hidden: title unclear -\u003e full refund even with everything else passing\n EscrowAccount e4(400000, 15000, 0.50, 0.02, 8000, 400, 100);\n e4.passInspection();\n e4.passAppraisal();\n // Don\u0027t clear title\n auto r4 = e4.closeEscrow();\n assert(r4 == \"CONTINGENCY_FAIL\");\n bool foundTitle = false;\n for (auto\u0026 l : e4.ledger) if (l.find(\"REFUND:TITLE\") != std::string::npos) foundTitle = true;\n assert(foundTitle);\n\n // Hidden: already closed\n EscrowAccount e5(200000, 5000, 0.50, 0.02, 4000, 200, 90);\n e5.passInspection();\n e5.passAppraisal();\n e5.clearTitle();\n e5.closeEscrow();\n assert(e5.closeEscrow() == \"ALREADY_CLOSED\");\n\n // Hidden: prorated HOA with non-zero remainder\n EscrowAccount e6(200000, 5000, 0.50, 0.02, 3650, 300, 45);\n e6.passInspection();\n e6.passAppraisal();\n e6.clearTitle();\n e6.closeEscrow();\n // proratedTax = 3650 * 45/365 = 450\n // proratedHoa = 300 * (45%30)/30 = 300 * 15/30 = 150\n // closingCosts = 200000*0.02 = 4000, buyer=2000, seller=2000\n // buyerOwes = 200000 - 5000 + 2000 - 450 - 150 = 196400\n double expected6 = 200000 - 5000 + 2000 - 450 - 150;\n assert(std::abs(e6.escrowBalance - expected6) \u003c 1.0);\n","category":"code_purpose_understanding"} {"id":"20","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct EnergyBill {\n double kwhUsed;\n double kwhGenerated; // solar/net metering\n double peakDemandKw;\n double powerFactor; // 0-1\n bool isEstimated;\n double tieredCharge;\n double demandCharge;\n double pfPenalty;\n double netMeteringCredit;\n double minimumBill;\n double totalBill;\n std::string billType; // \"ACTUAL\" or \"ESTIMATED\"\n std::vector\u003cstd::string\u003e lineItems;\n};\n\nstruct EnergyBiller {\n // Tiered rate structure (kWh thresholds and rates)\n // Tier 1: first 500 kWh at $0.08/kWh\n // Tier 2: next 500 kWh (501-1000) at $0.12/kWh\n // Tier 3: above 1000 kWh at $0.18/kWh\n double tier1Limit = 500;\n double tier1Rate = 0.08;\n double tier2Limit = 1000;\n double tier2Rate = 0.12;\n double tier3Rate = 0.18;\n\n // Time-of-use multiplier: peak hours add 50% surcharge\n double peakMultiplier = 1.5;\n\n // Demand charge: $5 per kW of peak demand\n double demandRate = 5.0;\n\n // Power factor penalty: if PF \u003c 0.90, penalty = (0.90 - PF) * tieredCharge\n double pfThreshold = 0.90;\n\n // Net metering: excess generation credited at $0.05/kWh\n double netMeteringRate = 0.05;\n\n // Minimum bill\n double minBill = 15.0;\n\n // If estimated reading, apply 0.95 factor to usage (conservative estimate)\n double estimationFactor = 0.95;\n\n std::vector\u003cstd::string\u003e billingLog;\n\n // Compute a monthly bill. Rules (in order):\n // 1. If isEstimated, adjust kwhUsed = kwhUsed * estimationFactor. Set billType=\"ESTIMATED\", else \"ACTUAL\".\n // 2. Net metering: netKwh = kwhUsed - kwhGenerated. If netKwh \u003c 0,\n // netMeteringCredit = (-netKwh) * netMeteringRate, set netKwh = 0.\n // 3. Compute tiered charge on netKwh:\n // tier1 = min(netKwh, tier1Limit) * tier1Rate\n // tier2 = min(max(netKwh - tier1Limit, 0), tier2Limit - tier1Limit) * tier2Rate\n // tier3 = max(netKwh - tier2Limit, 0) * tier3Rate\n // tieredCharge = tier1 + tier2 + tier3.\n // 4. Apply peak hour multiplier if peakFraction \u003e 0:\n // tieredCharge = tieredCharge * (1 + (peakMultiplier - 1) * peakFraction).\n // 5. Demand charge = peakDemandKw * demandRate.\n // 6. Power factor penalty: if powerFactor \u003c pfThreshold,\n // pfPenalty = (pfThreshold - powerFactor) * tieredCharge.\n // 7. subtotal = tieredCharge + demandCharge + pfPenalty - netMeteringCredit.\n // 8. totalBill = max(subtotal, minBill).\n // 9. Log \"BILL:\u003ctotalBill\u003e:\u003cbillType\u003e\".\n // 10. Return the EnergyBill with all fields populated.\n","golden_completion":" EnergyBill computeBill(double kwhUsed, double kwhGenerated, double peakDemandKw, double powerFactor, bool isEstimated, double peakFraction) {\n EnergyBill bill; bill.isEstimated = isEstimated; bill.billType = isEstimated ? \"ESTIMATED\" : \"ACTUAL\";\n if (isEstimated) kwhUsed *= estimationFactor;\n bill.kwhUsed = kwhUsed; bill.kwhGenerated = kwhGenerated; bill.peakDemandKw = peakDemandKw; bill.powerFactor = powerFactor;\n double netKwh = kwhUsed - kwhGenerated; bill.netMeteringCredit = 0;\n if (netKwh \u003c 0) { bill.netMeteringCredit = (-netKwh) * netMeteringRate; netKwh = 0; }\n double t1 = std::min(netKwh, tier1Limit) * tier1Rate;\n double t2 = std::min(std::max(netKwh - tier1Limit, 0.0), tier2Limit - tier1Limit) * tier2Rate;\n double t3 = std::max(netKwh - tier2Limit, 0.0) * tier3Rate;\n bill.tieredCharge = (t1 + t2 + t3) * (1.0 + (peakMultiplier - 1.0) * peakFraction);\n bill.demandCharge = peakDemandKw * demandRate;\n bill.pfPenalty = powerFactor \u003c pfThreshold ? (pfThreshold - powerFactor) * bill.tieredCharge : 0;\n double subtotal = bill.tieredCharge + bill.demandCharge + bill.pfPenalty - bill.netMeteringCredit;\n bill.minimumBill = minBill; bill.totalBill = std::max(subtotal, minBill);\n billingLog.push_back(\"BILL:\" + std::to_string(bill.totalBill) + \":\" + bill.billType);\n return bill;\n }\n","suffix":"\n};\n\nint main() {\n EnergyBiller biller;\n\n // Basic bill: 800 kWh, no solar, 10kW peak, PF=0.95, actual, no peak hours\n auto b1 = biller.computeBill(800, 0, 10, 0.95, false, 0.0);\n assert(b1.billType == \"ACTUAL\");\n // tier1: 500*0.08=40, tier2: 300*0.12=36, tier3: 0 -\u003e tiered=76\n assert(std::abs(b1.tieredCharge - 76.0) \u003c 0.01);\n // demand: 10*5=50\n assert(std::abs(b1.demandCharge - 50.0) \u003c 0.01);\n // PF OK (0.95 \u003e= 0.90), no penalty\n assert(std::abs(b1.pfPenalty) \u003c 0.01);\n // total = 76+50+0-0 = 126\n assert(std::abs(b1.totalBill - 126.0) \u003c 0.01);\n\n return 0;\n}\n","assertions":"\n // Hidden: estimated reading reduces usage\n EnergyBiller b2;\n auto r2 = b2.computeBill(1000, 0, 5, 0.95, true, 0.0);\n assert(r2.billType == \"ESTIMATED\");\n // adjusted: 1000*0.95 = 950\n // tier1: 500*0.08=40, tier2: 450*0.12=54 -\u003e tiered=94\n assert(std::abs(r2.tieredCharge - 94.0) \u003c 0.01);\n\n // Hidden: net metering credit when generation \u003e usage\n EnergyBiller b3;\n auto r3 = b3.computeBill(300, 500, 0, 0.95, false, 0.0);\n // netKwh = 300-500 = -200, credit = 200*0.05 = 10, netKwh=0\n assert(std::abs(r3.netMeteringCredit - 10.0) \u003c 0.01);\n assert(std::abs(r3.tieredCharge) \u003c 0.01); // no usage charge\n // total = 0 + 0 + 0 - 10 = -10, but min bill = 15\n assert(std::abs(r3.totalBill - 15.0) \u003c 0.01);\n\n // Hidden: power factor penalty\n EnergyBiller b4;\n auto r4 = b4.computeBill(600, 0, 8, 0.80, false, 0.0);\n // tier1: 500*0.08=40, tier2: 100*0.12=12 -\u003e tiered=52\n // PF penalty: (0.90-0.80)*52 = 5.2\n assert(std::abs(r4.pfPenalty - 5.2) \u003c 0.01);\n // demand: 8*5=40\n // total = 52+40+5.2-0 = 97.2\n assert(std::abs(r4.totalBill - 97.2) \u003c 0.01);\n\n // Hidden: tier 3 pricing\n EnergyBiller b5;\n auto r5 = b5.computeBill(1500, 0, 0, 0.95, false, 0.0);\n // tier1: 500*0.08=40, tier2: 500*0.12=60, tier3: 500*0.18=90 -\u003e tiered=190\n assert(std::abs(r5.tieredCharge - 190.0) \u003c 0.01);\n\n // Hidden: peak multiplier\n EnergyBiller b6;\n auto r6 = b6.computeBill(500, 0, 5, 0.95, false, 0.40);\n // tier1: 500*0.08=40\n // with peak: 40 * (1 + 0.5*0.4) = 40 * 1.2 = 48\n assert(std::abs(r6.tieredCharge - 48.0) \u003c 0.01);\n\n // Hidden: minimum bill kicks in\n EnergyBiller b7;\n auto r7 = b7.computeBill(10, 0, 0, 0.95, false, 0.0);\n // tier1: 10*0.08=0.80, demand: 0, no penalty\n // subtotal=0.80 \u003c 15 -\u003e total=15\n assert(std::abs(r7.totalBill - 15.0) \u003c 0.01);\n\n // Hidden: combined — estimated + net metering + peak + PF penalty\n EnergyBiller b8;\n auto r8 = b8.computeBill(2000, 100, 15, 0.85, true, 0.30);\n // adjusted: 2000*0.95=1900, net=1900-100=1800\n // tier1: 500*0.08=40, tier2: 500*0.12=60, tier3: 800*0.18=144 -\u003e 244\n // peak: 244*(1+0.5*0.3) = 244*1.15 = 280.6\n // demand: 15*5=75\n // PF: (0.90-0.85)*280.6 = 14.03\n // total = 280.6+75+14.03-0 = 369.63\n assert(std::abs(r8.tieredCharge - 280.6) \u003c 0.01);\n assert(std::abs(r8.pfPenalty - 14.03) \u003c 0.01);\n assert(std::abs(r8.totalBill - 369.63) \u003c 0.5);\n","category":"code_purpose_understanding"} {"id":"21","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nstruct BidEntry {\n std::string bidder;\n double amount;\n int timestamp;\n};\n\nclass Auction {\npublic:\n double starting_price;\n double reserve_price;\n double min_increment;\n int deadline; // auction end timestamp\n int snipe_window; // seconds before deadline that trigger extension\n int extension_seconds; // how much to extend on snipe\n\n double current_bid;\n std::string current_winner;\n bool reserve_met;\n std::vector\u003cBidEntry\u003e history;\n\n Auction(double start, double reserve, double increment,\n int deadline, int snipe_win, int ext_sec)\n : starting_price(start), reserve_price(reserve),\n min_increment(increment), deadline(deadline),\n snipe_window(snipe_win), extension_seconds(ext_sec),\n current_bid(start), current_winner(\"\"), reserve_met(false) {}\n\n bool is_active(int ts) const { return ts \u003c= deadline; }\n\n","golden_completion":" void place_bid(const std::string\u0026 bidder, double amount, int timestamp) {\n if (!is_active(timestamp))\n throw std::runtime_error(\"auction ended\");\n if (amount \u003c current_bid + min_increment)\n throw std::runtime_error(\"bid too low\");\n current_bid = amount;\n current_winner = bidder;\n if (amount \u003e= reserve_price)\n reserve_met = true;\n history.push_back({bidder, amount, timestamp});\n if (deadline - timestamp \u003c= snipe_window)\n deadline += extension_seconds;\n }\n","suffix":"};\n\nint main() {\n // Auction: start 100, reserve 500, increment 10, deadline 1000, snipe within 60s, extend by 120s\n Auction auc(100, 500, 10, 1000, 60, 120);\n auc.place_bid(\"alice\", 110, 100);\n assert(auc.current_bid == 110);\n assert(auc.current_winner == \"alice\");\n assert(!auc.reserve_met);\n assert(auc.history.size() == 1);\n\n auc.place_bid(\"bob\", 200, 200);\n assert(auc.current_bid == 200);\n assert(!auc.reserve_met);\n\n // Bid below minimum increment should fail\n try {\n auc.place_bid(\"carol\", 205, 300); // need at least 210\n assert(false);\n } catch (const std::runtime_error\u0026) {}\n assert(auc.current_bid == 200); // unchanged\n assert(auc.history.size() == 2); // no new entry\n\n // Bid that meets reserve\n auc.place_bid(\"carol\", 550, 400);\n assert(auc.reserve_met);\n\n // Snipe bid: within 60s of deadline (1000), should extend\n assert(auc.deadline == 1000);\n auc.place_bid(\"dave\", 600, 960); // 1000-960=40 \u003c= 60\n assert(auc.deadline == 1120); // extended by 120\n\n // Bid after original deadline but before extended deadline is valid\n auc.place_bid(\"alice\", 700, 1050);\n assert(auc.current_winner == \"alice\");\n assert(auc.history.size() == 5);\n\n return 0;\n}\n","assertions":"\n // Hidden assertions\n Auction a2(50, 200, 5, 500, 30, 60);\n // First bid must be at least starting_price + min_increment = 55\n try {\n a2.place_bid(\"x\", 54, 10);\n assert(false);\n } catch (const std::runtime_error\u0026) {}\n\n a2.place_bid(\"x\", 55, 10);\n assert(a2.current_bid == 55);\n assert(a2.history.size() == 1);\n assert(!a2.reserve_met);\n\n a2.place_bid(\"y\", 200, 20);\n assert(a2.reserve_met);\n assert(a2.current_winner == \"y\");\n\n // Bid after deadline fails\n try {\n a2.place_bid(\"z\", 300, 501);\n assert(false);\n } catch (const std::runtime_error\u0026) {}\n\n // Snipe extends deadline\n Auction a3(10, 100, 1, 100, 20, 50);\n a3.place_bid(\"a\", 11, 85); // 100-85=15 \u003c= 20 -\u003e snipe\n assert(a3.deadline == 150);\n a3.place_bid(\"b\", 20, 140); // 150-140=10 \u003c= 20 -\u003e snipe again\n assert(a3.deadline == 200);\n","category":"code_purpose_understanding"} {"id":"22","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nclass GymMembership {\npublic:\n std::string member_id;\n double monthly_rate;\n double enrollment_fee;\n double freeze_fee_per_month;\n int family_members; // 0 = individual\n double family_discount_pct; // applied to monthly_rate only, not add-ons\n bool has_personal_training;\n double pt_monthly_cost;\n int notice_period_months;\n\n std::string status; // \"active\", \"frozen\", \"cancelled\"\n double total_charged;\n int months_active;\n int months_frozen;\n std::vector\u003cstd::string\u003e charge_log;\n\n GymMembership(const std::string\u0026 id, double rate, double enroll,\n double freeze_fee, int family, double fam_disc,\n double pt_cost, int notice)\n : member_id(id), monthly_rate(rate), enrollment_fee(enroll),\n freeze_fee_per_month(freeze_fee), family_members(family),\n family_discount_pct(fam_disc), has_personal_training(false),\n pt_monthly_cost(pt_cost), notice_period_months(notice),\n status(\"pending\"), total_charged(0), months_active(0),\n months_frozen(0) {}\n\n double _discounted_rate() const {\n if (family_members \u003e 0)\n return monthly_rate * (1.0 - family_discount_pct);\n return monthly_rate;\n }\n\n","golden_completion":" void enroll(int days_remaining_in_month, int days_in_month) {\n if (status != \"pending\")\n throw std::runtime_error(\"already enrolled\");\n status = \"active\";\n double prorated = _discounted_rate() * days_remaining_in_month / days_in_month;\n double first_charge = enrollment_fee + prorated;\n total_charged += first_charge;\n charge_log.push_back(\"enroll:\" + std::to_string(first_charge));\n }\n\n void bill_month() {\n if (status == \"frozen\") {\n total_charged += freeze_fee_per_month;\n months_frozen++;\n charge_log.push_back(\"freeze:\" + std::to_string(freeze_fee_per_month));\n return;\n }\n if (status != \"active\")\n throw std::runtime_error(\"cannot bill\");\n double charge = _discounted_rate();\n if (has_personal_training)\n charge += pt_monthly_cost;\n total_charged += charge;\n months_active++;\n charge_log.push_back(\"bill:\" + std::to_string(charge));\n }\n","suffix":"\n void freeze() {\n if (status != \"active\") throw std::runtime_error(\"can only freeze active\");\n status = \"frozen\";\n }\n\n void unfreeze() {\n if (status != \"frozen\") throw std::runtime_error(\"not frozen\");\n status = \"active\";\n }\n\n void add_personal_training() { has_personal_training = true; }\n void remove_personal_training() { has_personal_training = false; }\n};\n\nint main() {\n // rate=100, enroll_fee=50, freeze_fee=25, family=2, disc=10%, pt=40, notice=1\n GymMembership gym(\"m1\", 100, 50, 25, 2, 0.10, 40, 1);\n\n // Enroll on day 15 of 30-day month -\u003e prorated = 90 * 15/30 = 45\n gym.enroll(15, 30);\n assert(std::abs(gym.total_charged - 95.0) \u003c 0.01); // 50 enroll + 45 prorated\n assert(gym.status == \"active\");\n assert(gym.charge_log.size() == 1);\n\n // Bill month without PT: 90 (discounted)\n gym.bill_month();\n assert(std::abs(gym.total_charged - 185.0) \u003c 0.01);\n assert(gym.months_active == 1);\n\n // Add PT, bill month: 90 + 40 = 130\n gym.add_personal_training();\n gym.bill_month();\n assert(std::abs(gym.total_charged - 315.0) \u003c 0.01);\n\n // Freeze: charges freeze fee instead\n gym.freeze();\n gym.bill_month();\n assert(std::abs(gym.total_charged - 340.0) \u003c 0.01);\n assert(gym.months_frozen == 1);\n assert(gym.months_active == 2);\n\n // Unfreeze and bill: PT still on, 90 + 40 = 130\n gym.unfreeze();\n gym.bill_month();\n assert(std::abs(gym.total_charged - 470.0) \u003c 0.01);\n\n return 0;\n}\n","assertions":"\n // Individual membership (no family discount)\n GymMembership g2(\"m2\", 80, 30, 20, 0, 0.0, 50, 2);\n g2.enroll(10, 30); // prorated = 80 * 10/30 = 26.67\n assert(std::abs(g2.total_charged - 56.67) \u003c 0.01); // 30 + 26.67\n\n g2.bill_month();\n assert(std::abs(g2.total_charged - 136.67) \u003c 0.01); // + 80\n assert(g2.months_active == 1);\n\n g2.add_personal_training();\n g2.bill_month();\n assert(std::abs(g2.total_charged - 266.67) \u003c 0.01); // + 80 + 50\n\n g2.freeze();\n g2.bill_month();\n assert(std::abs(g2.total_charged - 286.67) \u003c 0.01); // + 20 freeze fee\n assert(g2.months_frozen == 1);\n\n // Cannot double-enroll\n GymMembership g3(\"m3\", 100, 50, 25, 0, 0.0, 40, 1);\n g3.enroll(30, 30);\n try {\n g3.enroll(15, 30);\n assert(false);\n } catch (const std::runtime_error\u0026) {}\n","category":"code_purpose_understanding"} {"id":"23","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003cmap\u003e\n\nstruct ShipmentDetails {\n double actual_weight_lbs;\n double length, width, height; // inches for dimensional weight\n int zone;\n bool residential;\n bool signature_required;\n bool saturday_delivery;\n};\n\nclass ShippingCalculator {\npublic:\n double dim_factor; // dimensional weight divisor\n double fuel_surcharge_pct; // e.g. 0.15 for 15%\n double residential_fee;\n double signature_fee;\n double saturday_multiplier; // e.g. 1.5\n\n // zone -\u003e vector of (max_weight, rate_per_lb) breakpoints, sorted ascending\n std::map\u003cint, std::vector\u003cstd::pair\u003cdouble, double\u003e\u003e\u003e zone_rates;\n\n std::vector\u003cstd::string\u003e calc_log;\n\n ShippingCalculator(double dim, double fuel, double res, double sig, double sat)\n : dim_factor(dim), fuel_surcharge_pct(fuel), residential_fee(res),\n signature_fee(sig), saturday_multiplier(sat) {}\n\n void add_rate(int zone, double max_weight, double rate_per_lb) {\n zone_rates[zone].push_back({max_weight, rate_per_lb});\n }\n\n double _billable_weight(const ShipmentDetails\u0026 s) const {\n double dim_weight = (s.length * s.width * s.height) / dim_factor;\n return std::max(s.actual_weight_lbs, dim_weight);\n }\n\n double _base_rate(int zone, double weight) const {\n auto it = zone_rates.find(zone);\n if (it == zone_rates.end()) throw std::runtime_error(\"unknown zone\");\n for (auto\u0026 [max_w, rate] : it-\u003esecond) {\n if (weight \u003c= max_w) return weight * rate;\n }\n return weight * it-\u003esecond.back().second; // use highest tier rate\n }\n\n","golden_completion":" double calculate(const ShipmentDetails\u0026 s) {\n double weight = _billable_weight(s);\n double base = _base_rate(s.zone, weight);\n double fuel = base * fuel_surcharge_pct;\n double subtotal = base + fuel;\n if (s.residential)\n subtotal += residential_fee;\n if (s.signature_required)\n subtotal += signature_fee;\n if (s.saturday_delivery)\n subtotal *= saturday_multiplier;\n calc_log.push_back(\"zone:\" + std::to_string(s.zone) +\n \",wt:\" + std::to_string(weight) +\n \",total:\" + std::to_string(subtotal));\n return subtotal;\n }\n","suffix":"};\n\nint main() {\n // dim_factor=139, fuel=15%, residential=$5, signature=$3, saturday=1.5x\n ShippingCalculator calc(139.0, 0.15, 5.0, 3.0, 1.5);\n calc.add_rate(1, 10, 2.0); // zone 1: up to 10 lbs -\u003e $2/lb\n calc.add_rate(1, 50, 1.5); // zone 1: 10-50 lbs -\u003e $1.5/lb\n calc.add_rate(2, 10, 3.0);\n calc.add_rate(2, 50, 2.5);\n\n // 5 lbs actual, small box -\u003e actual weight dominates\n ShipmentDetails s1 = {5.0, 10, 10, 10, 1, false, false, false};\n double r1 = calc.calculate(s1);\n // billable = max(5, 1000/139=7.19) = 7.19\n // base = 7.19 * 2.0 = 14.39, fuel = 14.39*0.15 = 2.16, total = 16.55\n assert(std::abs(r1 - 16.55) \u003c 0.1);\n\n // Large box: dimensional weight dominates\n ShipmentDetails s2 = {5.0, 20, 20, 20, 1, true, true, false};\n double r2 = calc.calculate(s2);\n // dim_weight = 8000/139 = 57.55, actual=5 -\u003e billable=57.55\n // base = 57.55 * 1.5 = 86.33 (over 10lb tier), fuel = 86.33*0.15=12.95\n // subtotal = 86.33 + 12.95 + 5 + 3 = 107.28\n assert(std::abs(r2 - 107.28) \u003c 0.5);\n\n // Saturday delivery multiplier applies to everything\n ShipmentDetails s3 = {5.0, 10, 10, 10, 2, false, false, true};\n double r3 = calc.calculate(s3);\n // billable=7.19, base=7.19*3=21.58, fuel=21.58*0.15=3.24, sub=24.82, *1.5=37.23\n assert(std::abs(r3 - 37.23) \u003c 0.5);\n\n assert(calc.calc_log.size() == 3);\n return 0;\n}\n","assertions":"\n // Residential + signature + saturday\n ShipmentDetails s4 = {8.0, 10, 10, 10, 1, true, true, true};\n double r4 = calc.calculate(s4);\n // billable = max(8, 7.19) = 8, base = 8*2 = 16, fuel = 16*0.15 = 2.4\n // sub = 16+2.4+5+3 = 26.4, *1.5 = 39.6\n assert(std::abs(r4 - 39.6) \u003c 0.1);\n\n // Zone 2, no extras\n ShipmentDetails s5 = {3.0, 5, 5, 5, 2, false, false, false};\n double r5 = calc.calculate(s5);\n // dim = 125/139 = 0.9, billable=3, base=3*3=9, fuel=9*0.15=1.35, total=10.35\n assert(std::abs(r5 - 10.35) \u003c 0.1);\n\n assert(calc.calc_log.size() == 5);\n","category":"code_purpose_understanding"} {"id":"24","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct TicketBooking {\n std::string booking_id;\n double ticket_price;\n double service_fee;\n int num_tickets;\n double promo_discount; // total discount applied\n int loyalty_points_earned;\n int purchase_timestamp;\n int event_timestamp;\n std::string payment_method; // \"credit\" or \"cash\"\n};\n\nstruct RefundResult {\n double refund_amount;\n double service_fee_retained;\n int loyalty_points_clawed;\n std::string refund_method; // \"original\" or \"credit\"\n std::string refund_tier; // \"full\", \"partial_75\", \"partial_50\", \"none\"\n};\n\nclass RefundProcessor {\npublic:\n int full_refund_window; // seconds before event for 100% refund\n int partial75_window; // seconds before event for 75% refund\n int partial50_window; // seconds before event for 50% refund\n\n std::vector\u003cRefundResult\u003e refund_log;\n\n RefundProcessor(int full_w, int p75_w, int p50_w)\n : full_refund_window(full_w), partial75_window(p75_w),\n partial50_window(p50_w) {}\n\n double _refund_pct(int request_time, int event_time) const {\n int before = event_time - request_time;\n if (before \u003e= full_refund_window) return 1.0;\n if (before \u003e= partial75_window) return 0.75;\n if (before \u003e= partial50_window) return 0.50;\n return 0.0;\n }\n\n","golden_completion":" RefundResult process_refund(const TicketBooking\u0026 b, int request_time,\n int tickets_to_refund) {\n if (tickets_to_refund \u003c= 0 || tickets_to_refund \u003e b.num_tickets)\n throw std::runtime_error(\"invalid refund quantity\");\n double pct = _refund_pct(request_time, b.event_timestamp);\n std::string tier = pct == 1.0 ? \"full\" :\n pct == 0.75 ? \"partial_75\" :\n pct == 0.50 ? \"partial_50\" : \"none\";\n double per_ticket = b.ticket_price;\n double proportion = (double)tickets_to_refund / b.num_tickets;\n double promo_reversal = b.promo_discount * proportion;\n double gross = per_ticket * tickets_to_refund - promo_reversal;\n double refund = gross * pct;\n double svc_retained = b.service_fee * proportion;\n int points_clawed = (int)(b.loyalty_points_earned * proportion);\n std::string method = (pct \u003c 1.0) ? \"credit\" : b.payment_method;\n RefundResult result = {refund, svc_retained, points_clawed, method, tier};\n refund_log.push_back(result);\n return result;\n }\n","suffix":"};\n\nint main() {\n // full=7200 (2h), 75%=3600 (1h), 50%=1800 (30min)\n RefundProcessor proc(7200, 3600, 1800);\n\n // Booking: $50/ticket, $10 service fee, 4 tickets, $20 promo, 100 points\n TicketBooking b1 = {\"B1\", 50.0, 10.0, 4, 20.0, 100, 1000, 10000, \"credit\"};\n\n // Full refund (3h before event): refund 2 of 4 tickets\n RefundResult r1 = proc.process_refund(b1, 10000 - 7500, 2);\n // proportion = 0.5, promo_reversal = 10, gross = 100-10 = 90, refund = 90*1.0=90\n assert(r1.refund_tier == \"full\");\n assert(std::abs(r1.refund_amount - 90.0) \u003c 0.01);\n assert(std::abs(r1.service_fee_retained - 5.0) \u003c 0.01); // 10 * 0.5\n assert(r1.loyalty_points_clawed == 50); // 100 * 0.5\n assert(r1.refund_method == \"credit\"); // original payment\n\n // 75% refund (1.5h before): all 4 tickets\n RefundResult r2 = proc.process_refund(b1, 10000 - 5000, 4);\n // proportion=1.0, promo_reversal=20, gross=200-20=180, refund=180*0.75=135\n assert(r2.refund_tier == \"partial_75\");\n assert(std::abs(r2.refund_amount - 135.0) \u003c 0.01);\n assert(r2.refund_method == \"credit\"); // partial -\u003e always credit\n\n // No refund (5 min before)\n RefundResult r3 = proc.process_refund(b1, 10000 - 300, 1);\n assert(r3.refund_tier == \"none\");\n assert(r3.refund_amount == 0.0);\n assert(r3.loyalty_points_clawed == 25);\n\n assert(proc.refund_log.size() == 3);\n return 0;\n}\n","assertions":"\n // 50% refund tier\n TicketBooking b2 = {\"B2\", 80.0, 15.0, 2, 0.0, 200, 5000, 8000, \"cash\"};\n RefundResult r4 = proc.process_refund(b2, 8000 - 2000, 1);\n // proportion=0.5, promo=0, gross=80, refund=80*0.5=40\n assert(r4.refund_tier == \"partial_50\");\n assert(std::abs(r4.refund_amount - 40.0) \u003c 0.01);\n assert(std::abs(r4.service_fee_retained - 7.5) \u003c 0.01);\n assert(r4.loyalty_points_clawed == 100);\n assert(r4.refund_method == \"credit\"); // partial -\u003e credit\n\n // Full refund with cash payment -\u003e original method\n RefundResult r5 = proc.process_refund(b2, 8000 - 8000, 2);\n assert(r5.refund_tier == \"full\");\n assert(r5.refund_method == \"cash\");\n\n // Invalid quantity\n try {\n proc.process_refund(b2, 5000, 0);\n assert(false);\n } catch (const std::runtime_error\u0026) {}\n try {\n proc.process_refund(b2, 5000, 3);\n assert(false);\n } catch (const std::runtime_error\u0026) {}\n","category":"code_purpose_understanding"} {"id":"25","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct Ingredient {\n std::string name;\n double quantity;\n std::string unit; // \"cup\", \"tsp\", \"tbsp\", \"oz\", \"g\"\n};\n\nstruct NutritionInfo {\n double calories;\n double protein_g;\n double fat_g;\n};\n\nclass Recipe {\npublic:\n std::string recipe_name;\n int base_servings;\n std::vector\u003cIngredient\u003e ingredients;\n NutritionInfo base_nutrition; // per serving\n\n Recipe(const std::string\u0026 name, int servings)\n : recipe_name(name), base_servings(servings) {}\n\n void add_ingredient(const std::string\u0026 name, double qty, const std::string\u0026 unit) {\n ingredients.push_back({name, qty, unit});\n }\n\n void set_nutrition(double cal, double prot, double fat) {\n base_nutrition = {cal, prot, fat};\n }\n\n double _round_quarter(double val) const {\n return std::round(val * 4.0) / 4.0;\n }\n\n // cups-\u003etsp = *48, cups-\u003etbsp = *16, tbsp-\u003etsp = *3\n double _to_tsp(double qty, const std::string\u0026 unit) const {\n if (unit == \"tsp\") return qty;\n if (unit == \"tbsp\") return qty * 3.0;\n if (unit == \"cup\") return qty * 48.0;\n return qty; // oz, g stay as-is\n }\n\n","golden_completion":" std::vector\u003cIngredient\u003e scale(int target_servings) const {\n double factor = (double)target_servings / base_servings;\n std::vector\u003cIngredient\u003e scaled;\n for (const auto\u0026 ing : ingredients) {\n double new_qty = ing.quantity * factor;\n std::string new_unit = ing.unit;\n if ((ing.unit == \"cup\" || ing.unit == \"tbsp\") \u0026\u0026 new_qty \u003c 1.0) {\n new_qty = _to_tsp(new_qty, ing.unit);\n new_unit = \"tsp\";\n }\n new_qty = _round_quarter(new_qty);\n scaled.push_back({ing.name, new_qty, new_unit});\n }\n return scaled;\n }\n\n NutritionInfo scaled_nutrition(int target_servings) const {\n return {base_nutrition.calories * target_servings,\n base_nutrition.protein_g * target_servings,\n base_nutrition.fat_g * target_servings};\n }\n","suffix":"};\n\nint main() {\n Recipe r(\"Pancakes\", 4);\n r.add_ingredient(\"flour\", 2.0, \"cup\");\n r.add_ingredient(\"sugar\", 3.0, \"tbsp\");\n r.add_ingredient(\"salt\", 0.5, \"tsp\");\n r.add_ingredient(\"butter\", 4.0, \"oz\");\n r.set_nutrition(250, 8, 12);\n\n // Scale to 2 servings (factor = 0.5)\n auto s2 = r.scale(2);\n assert(s2[0].name == \"flour\");\n assert(std::abs(s2[0].quantity - 1.0) \u003c 0.01); // 2*0.5 = 1 cup\n assert(s2[0].unit == \"cup\");\n\n assert(s2[1].name == \"sugar\");\n // 3 tbsp * 0.5 = 1.5 tbsp (\u003e= 1, stays tbsp)\n assert(std::abs(s2[1].quantity - 1.5) \u003c 0.01);\n assert(s2[1].unit == \"tbsp\");\n\n assert(s2[2].name == \"salt\");\n assert(std::abs(s2[2].quantity - 0.25) \u003c 0.01); // 0.5*0.5 = 0.25 tsp\n assert(s2[2].unit == \"tsp\");\n\n assert(std::abs(s2[3].quantity - 2.0) \u003c 0.01); // 4*0.5 = 2 oz\n assert(s2[3].unit == \"oz\");\n\n // Scale to 1 serving (factor = 0.25)\n auto s1 = r.scale(1);\n // flour: 2*0.25 = 0.5 cup -\u003e \u003c 1 cup -\u003e convert to tsp: 0.5*48=24 tsp\n assert(s1[0].unit == \"tsp\");\n assert(std::abs(s1[0].quantity - 24.0) \u003c 0.01);\n\n // sugar: 3*0.25 = 0.75 tbsp -\u003e \u003c 1 -\u003e convert to tsp: 0.75*3 = 2.25 tsp\n assert(s1[1].unit == \"tsp\");\n assert(std::abs(s1[1].quantity - 2.25) \u003c 0.01);\n\n auto n = r.scaled_nutrition(2);\n assert(std::abs(n.calories - 500) \u003c 0.01);\n assert(std::abs(n.protein_g - 16) \u003c 0.01);\n\n return 0;\n}\n","assertions":"\n // Scale to 8 servings (factor = 2)\n auto s8 = r.scale(8);\n assert(std::abs(s8[0].quantity - 4.0) \u003c 0.01);\n assert(s8[0].unit == \"cup\");\n assert(std::abs(s8[1].quantity - 6.0) \u003c 0.01);\n assert(s8[1].unit == \"tbsp\");\n assert(std::abs(s8[3].quantity - 8.0) \u003c 0.01);\n\n // Scale to 3 servings (factor = 0.75)\n auto s3 = r.scale(3);\n // flour: 2*0.75 = 1.5 cup\n assert(std::abs(s3[0].quantity - 1.5) \u003c 0.01);\n assert(s3[0].unit == \"cup\");\n // sugar: 3*0.75 = 2.25 tbsp\n assert(std::abs(s3[1].quantity - 2.25) \u003c 0.01);\n assert(s3[1].unit == \"tbsp\");\n\n auto n8 = r.scaled_nutrition(8);\n assert(std::abs(n8.calories - 2000) \u003c 0.01);\n assert(std::abs(n8.fat_g - 96) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"26","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003cnumeric\u003e\n\nstruct TaxBracket {\n double upper_limit; // income up to this amount (0 = no limit)\n double rate;\n};\n\nclass TaxReturn {\npublic:\n std::vector\u003cdouble\u003e income_sources;\n double standard_deduction;\n double itemized_deductions;\n std::vector\u003cTaxBracket\u003e brackets; // sorted by upper_limit ascending\n double child_credit;\n double education_credit;\n double estimated_payments;\n\n std::string filing_status; // \"refund\" or \"owed\" or \"even\"\n double final_amount;\n double effective_rate;\n std::vector\u003cstd::string\u003e audit_trail;\n\n TaxReturn(double std_ded)\n : standard_deduction(std_ded), itemized_deductions(0),\n child_credit(0), education_credit(0), estimated_payments(0),\n final_amount(0), effective_rate(0) {}\n\n void add_income(double amount) { income_sources.push_back(amount); }\n void set_itemized(double amount) { itemized_deductions = amount; }\n void add_bracket(double limit, double rate) { brackets.push_back({limit, rate}); }\n void set_credits(double child, double education) {\n child_credit = child;\n education_credit = education;\n }\n void set_estimated_payments(double amount) { estimated_payments = amount; }\n\n double _gross_income() const {\n return std::accumulate(income_sources.begin(), income_sources.end(), 0.0);\n }\n\n","golden_completion":" void file() {\n double gross = _gross_income();\n double deduction = std::max(standard_deduction, itemized_deductions);\n std::string ded_type = (itemized_deductions \u003e standard_deduction) ? \"itemized\" : \"standard\";\n double taxable = std::max(0.0, gross - deduction);\n audit_trail.push_back(\"gross:\" + std::to_string(gross));\n audit_trail.push_back(\"deduction:\" + ded_type + \":\" + std::to_string(deduction));\n audit_trail.push_back(\"taxable:\" + std::to_string(taxable));\n\n double tax = 0.0;\n double prev_limit = 0.0;\n for (const auto\u0026 b : brackets) {\n double bracket_income;\n if (b.upper_limit == 0) {\n bracket_income = std::max(0.0, taxable - prev_limit);\n } else {\n bracket_income = std::max(0.0, std::min(taxable, b.upper_limit) - prev_limit);\n }\n tax += bracket_income * b.rate;\n prev_limit = b.upper_limit;\n }\n double credits = child_credit + education_credit;\n double after_credits = std::max(0.0, tax - credits);\n double balance = after_credits - estimated_payments;\n filing_status = (balance \u003e 0.01) ? \"owed\" : (balance \u003c -0.01) ? \"refund\" : \"even\";\n final_amount = std::abs(balance);\n effective_rate = (gross \u003e 0) ? (after_credits / gross) * 100.0 : 0.0;\n audit_trail.push_back(\"tax:\" + std::to_string(tax));\n audit_trail.push_back(\"status:\" + filing_status);\n }\n","suffix":"};\n\nint main() {\n TaxReturn tr(13850);\n tr.add_income(50000); // salary\n tr.add_income(5000); // freelance\n tr.add_income(2000); // interest\n // gross = 57000\n tr.set_itemized(10000); // less than standard, so standard wins\n\n tr.add_bracket(11000, 0.10);\n tr.add_bracket(44725, 0.12);\n tr.add_bracket(95375, 0.22);\n tr.add_bracket(0, 0.24); // 0 = unlimited\n\n tr.set_credits(2000, 500);\n tr.set_estimated_payments(5000);\n\n tr.file();\n // taxable = 57000 - 13850 = 43150\n // tax: 11000*0.10=1100, (43150-11000)*0.12=3858, total=4958\n // after credits: 4958-2500=2458\n // balance: 2458-5000 = -2542 -\u003e refund\n assert(tr.filing_status == \"refund\");\n assert(std::abs(tr.final_amount - 2542.0) \u003c 1.0);\n assert(tr.audit_trail.size() == 5);\n\n // Itemized wins\n TaxReturn tr2(13850);\n tr2.add_income(100000);\n tr2.set_itemized(25000);\n tr2.add_bracket(11000, 0.10);\n tr2.add_bracket(44725, 0.12);\n tr2.add_bracket(95375, 0.22);\n tr2.add_bracket(0, 0.24);\n tr2.set_credits(0, 0);\n tr2.set_estimated_payments(0);\n tr2.file();\n // taxable = 100000-25000=75000\n // tax: 11000*0.10=1100, 33725*0.12=4047, 30275*0.22=6660.5, total=11807.5\n assert(tr2.filing_status == \"owed\");\n assert(std::abs(tr2.final_amount - 11807.5) \u003c 1.0);\n\n return 0;\n}\n","assertions":"\n // Exact even case\n TaxReturn tr3(10000);\n tr3.add_income(21000);\n tr3.add_bracket(11000, 0.10);\n tr3.add_bracket(0, 0.12);\n tr3.set_credits(0, 0);\n // taxable = 11000, tax = 11000*0.10 = 1100\n tr3.set_estimated_payments(1100);\n tr3.file();\n assert(tr3.filing_status == \"even\");\n assert(std::abs(tr3.final_amount) \u003c 0.1);\n\n // Credits cannot make tax negative\n TaxReturn tr4(0);\n tr4.add_income(5000);\n tr4.add_bracket(0, 0.10);\n tr4.set_credits(1000, 0);\n tr4.set_estimated_payments(0);\n tr4.file();\n // tax=500, after credits=max(0,500-1000)=0\n assert(tr4.filing_status == \"even\");\n assert(std::abs(tr4.final_amount) \u003c 0.1);\n\n // Effective rate calculation\n assert(tr4.effective_rate \u003c 0.01); // 0/5000 = 0%\n","category":"code_purpose_understanding"} {"id":"27","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct Attendee {\n std::string name;\n std::string dietary; // \"none\", \"vegetarian\", \"vegan\", \"halal\"\n std::vector\u003cstd::string\u003e workshops;\n};\n\nstruct RegResult {\n double total_cost;\n bool on_waitlist;\n int attendees_registered;\n int attendees_waitlisted;\n};\n\nclass ConferenceReg {\npublic:\n double base_price;\n double early_bird_price;\n int early_bird_cutoff; // timestamp\n double workshop_price; // per workshop per person\n int capacity;\n int registered_count;\n\n // group discount tiers: (min_size, discount_pct)\n std::vector\u003cstd::pair\u003cint, double\u003e\u003e group_tiers; // sorted ascending by min_size\n\n std::vector\u003cAttendee\u003e attendees;\n std::vector\u003cAttendee\u003e waitlist;\n std::vector\u003cstd::string\u003e reg_log;\n\n ConferenceReg(double base, double early, int cutoff, double ws_price, int cap)\n : base_price(base), early_bird_price(early), early_bird_cutoff(cutoff),\n workshop_price(ws_price), capacity(cap), registered_count(0) {}\n\n void add_group_tier(int min_size, double discount) {\n group_tiers.push_back({min_size, discount});\n }\n\n double _group_discount(int group_size) const {\n double disc = 0.0;\n for (const auto\u0026 [min_sz, d] : group_tiers) {\n if (group_size \u003e= min_sz) disc = d;\n }\n return disc;\n }\n\n","golden_completion":" RegResult register_group(const std::vector\u003cAttendee\u003e\u0026 group, int timestamp) {\n double unit_price = (timestamp \u003c= early_bird_cutoff) ? early_bird_price : base_price;\n double discount = _group_discount(group.size());\n double discounted_price = unit_price * (1.0 - discount);\n\n int spots = capacity - registered_count;\n int to_register = std::min((int)group.size(), spots);\n int to_waitlist = (int)group.size() - to_register;\n\n double total = 0.0;\n for (int i = 0; i \u003c (int)group.size(); i++) {\n double person_cost = discounted_price + group[i].workshops.size() * workshop_price;\n total += person_cost;\n if (i \u003c to_register) {\n attendees.push_back(group[i]);\n registered_count++;\n } else {\n waitlist.push_back(group[i]);\n }\n }\n reg_log.push_back(\"group:\" + std::to_string(group.size()) +\n \",cost:\" + std::to_string(total));\n return {total, to_waitlist \u003e 0, to_register, to_waitlist};\n }\n","suffix":"};\n\nint main() {\n // base=$500, early=$350, cutoff=1000, workshop=$75, capacity=5\n ConferenceReg conf(500, 350, 1000, 75, 5);\n conf.add_group_tier(3, 0.10); // 3+ people: 10% off base\n conf.add_group_tier(5, 0.20); // 5+ people: 20% off base\n\n // Early bird, group of 3 -\u003e 10% off $350 = $315/person\n std::vector\u003cAttendee\u003e g1 = {\n {\"Alice\", \"none\", {\"ML\"}},\n {\"Bob\", \"vegetarian\", {\"ML\", \"NLP\"}},\n {\"Carol\", \"vegan\", {}}\n };\n RegResult r1 = conf.register_group(g1, 500);\n // Alice: 315+75=390, Bob: 315+150=465, Carol: 315+0=315, total=1170\n assert(std::abs(r1.total_cost - 1170.0) \u003c 0.01);\n assert(!r1.on_waitlist);\n assert(r1.attendees_registered == 3);\n assert(conf.registered_count == 3);\n assert(conf.attendees.size() == 3);\n\n // After cutoff, group of 3 -\u003e 10% off $500 = $450/person, only 2 spots left\n std::vector\u003cAttendee\u003e g2 = {\n {\"Dave\", \"halal\", {\"CV\"}},\n {\"Eve\", \"none\", {}},\n {\"Frank\", \"none\", {\"ML\"}}\n };\n RegResult r2 = conf.register_group(g2, 1500);\n // Dave: 450+75=525, Eve: 450=450, Frank: 450+75=525, total=1500\n assert(std::abs(r2.total_cost - 1500.0) \u003c 0.01);\n assert(r2.on_waitlist);\n assert(r2.attendees_registered == 2);\n assert(r2.attendees_waitlisted == 1);\n assert(conf.waitlist.size() == 1);\n assert(conf.waitlist[0].name == \"Frank\");\n\n return 0;\n}\n","assertions":"\n // All waitlisted (capacity full)\n std::vector\u003cAttendee\u003e g3 = {{\"Grace\", \"none\", {}}};\n RegResult r3 = conf.register_group(g3, 2000);\n assert(r3.on_waitlist);\n assert(r3.attendees_registered == 0);\n assert(r3.attendees_waitlisted == 1);\n assert(conf.waitlist.size() == 2);\n\n // Fresh conference: group of 5 -\u003e 20% off\n ConferenceReg conf2(400, 300, 500, 50, 10);\n conf2.add_group_tier(3, 0.10);\n conf2.add_group_tier(5, 0.15);\n std::vector\u003cAttendee\u003e g4 = {\n {\"A\", \"none\", {}}, {\"B\", \"none\", {\"W1\"}},\n {\"C\", \"none\", {}}, {\"D\", \"none\", {\"W1\",\"W2\"}},\n {\"E\", \"none\", {}}\n };\n RegResult r4 = conf2.register_group(g4, 100); // early bird\n // 15% off $300 = $255/person, workshops: 0+50+0+100+0 = 150\n // total = 255*5 + 150 = 1275+150 = 1425\n assert(std::abs(r4.total_cost - 1425.0) \u003c 0.01);\n assert(!r4.on_waitlist);\n","category":"code_purpose_understanding"} {"id":"28","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cset\u003e\n#include \u003cmap\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct FillResult {\n bool approved;\n std::string denial_reason; // empty if approved\n int qty_dispensed;\n double copay;\n int next_refill_day; // day number when refill is allowed\n};\n\nclass Pharmacy {\npublic:\n // drug -\u003e set of drugs it interacts with\n std::map\u003cstd::string, std::set\u003cstd::string\u003e\u003e interactions;\n // drug -\u003e formulary tier (1=generic $10, 2=preferred $25, 3=specialty $50)\n std::map\u003cstd::string, int\u003e formulary;\n // drug -\u003e max quantity per fill\n std::map\u003cstd::string, int\u003e qty_limits;\n // drugs requiring prior authorization\n std::set\u003cstd::string\u003e prior_auth_required;\n // approved prior auths: drug -\u003e true\n std::set\u003cstd::string\u003e prior_auth_approved;\n // patient\u0027s current medications\n std::set\u003cstd::string\u003e current_meds;\n\n std::vector\u003cFillResult\u003e fill_log;\n double copay_tiers[4] = {0, 10.0, 25.0, 50.0};\n int supply_days = 30; // standard days supply\n\n Pharmacy() = default;\n\n void add_interaction(const std::string\u0026 a, const std::string\u0026 b) {\n interactions[a].insert(b);\n interactions[b].insert(a);\n }\n\n void set_formulary(const std::string\u0026 drug, int tier) { formulary[drug] = tier; }\n void set_qty_limit(const std::string\u0026 drug, int max_qty) { qty_limits[drug] = max_qty; }\n void require_prior_auth(const std::string\u0026 drug) { prior_auth_required.insert(drug); }\n void approve_prior_auth(const std::string\u0026 drug) { prior_auth_approved.insert(drug); }\n void add_current_med(const std::string\u0026 drug) { current_meds.insert(drug); }\n\n","golden_completion":" FillResult fill_prescription(const std::string\u0026 drug, int requested_qty,\n int current_day) {\n // 1. Check drug interactions\n if (interactions.count(drug)) {\n for (const auto\u0026 med : current_meds) {\n if (interactions[drug].count(med)) {\n FillResult r = {false, \"interaction:\" + med, 0, 0, 0};\n fill_log.push_back(r);\n return r;\n }\n }\n }\n // 2. Check prior authorization\n if (prior_auth_required.count(drug) \u0026\u0026 !prior_auth_approved.count(drug)) {\n FillResult r = {false, \"prior_auth_needed\", 0, 0, 0};\n fill_log.push_back(r);\n return r;\n }\n // 3. Determine quantity (apply limit)\n int qty = requested_qty;\n if (qty_limits.count(drug))\n qty = std::min(qty, qty_limits[drug]);\n // 4. Determine copay from formulary\n int tier = formulary.count(drug) ? formulary[drug] : 3;\n double copay = copay_tiers[tier];\n // 5. Calculate next refill\n int next_refill = current_day + supply_days;\n current_meds.insert(drug);\n FillResult r = {true, \"\", qty, copay, next_refill};\n fill_log.push_back(r);\n return r;\n }\n","suffix":"};\n\nint main() {\n Pharmacy pharm;\n pharm.set_formulary(\"metformin\", 1); // generic $10\n pharm.set_formulary(\"lisinopril\", 2); // preferred $25\n pharm.set_formulary(\"humira\", 3); // specialty $50\n pharm.set_qty_limit(\"metformin\", 90);\n pharm.set_qty_limit(\"humira\", 2);\n pharm.require_prior_auth(\"humira\");\n pharm.add_interaction(\"warfarin\", \"aspirin\");\n pharm.add_current_med(\"warfarin\");\n\n // Simple generic fill\n FillResult r1 = pharm.fill_prescription(\"metformin\", 90, 1);\n assert(r1.approved);\n assert(r1.qty_dispensed == 90);\n assert(std::abs(r1.copay - 10.0) \u003c 0.01);\n assert(r1.next_refill_day == 31);\n\n // Drug interaction: aspirin interacts with warfarin\n FillResult r2 = pharm.fill_prescription(\"aspirin\", 30, 1);\n assert(!r2.approved);\n assert(r2.denial_reason == \"interaction:warfarin\");\n\n // Prior auth not yet approved\n FillResult r3 = pharm.fill_prescription(\"humira\", 4, 1);\n assert(!r3.approved);\n assert(r3.denial_reason == \"prior_auth_needed\");\n\n // Approve and retry -\u003e quantity limited to 2\n pharm.approve_prior_auth(\"humira\");\n FillResult r4 = pharm.fill_prescription(\"humira\", 4, 10);\n assert(r4.approved);\n assert(r4.qty_dispensed == 2);\n assert(std::abs(r4.copay - 50.0) \u003c 0.01);\n assert(r4.next_refill_day == 40);\n\n assert(pharm.fill_log.size() == 4);\n return 0;\n}\n","assertions":"\n // Unknown drug defaults to tier 3\n FillResult r5 = pharm.fill_prescription(\"newdrug\", 10, 50);\n assert(r5.approved);\n assert(std::abs(r5.copay - 50.0) \u003c 0.01);\n assert(r5.qty_dispensed == 10); // no qty limit for unknown drug\n assert(r5.next_refill_day == 80);\n\n // Preferred brand\n FillResult r6 = pharm.fill_prescription(\"lisinopril\", 30, 100);\n assert(r6.approved);\n assert(std::abs(r6.copay - 25.0) \u003c 0.01);\n\n // Filling adds to current_meds, so interaction check works in future\n pharm.add_interaction(\"lisinopril\", \"potassium\");\n FillResult r7 = pharm.fill_prescription(\"potassium\", 30, 100);\n assert(!r7.approved);\n assert(r7.denial_reason == \"interaction:lisinopril\");\n\n assert(pharm.fill_log.size() == 7);\n","category":"code_purpose_understanding"} {"id":"29","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct MaterialLine {\n std::string name;\n double unit_cost;\n double quantity;\n double waste_factor; // e.g. 0.10 = 10% waste\n};\n\nstruct LaborLine {\n std::string trade; // e.g. \"electrician\", \"plumber\"\n double hourly_rate;\n double hours;\n double efficiency; // 0.0-1.0, actual productive fraction\n};\n\nstruct Estimate {\n double material_cost;\n double labor_cost;\n double permit_fee;\n double subtotal;\n double markup_amount;\n double contingency_amount;\n double grand_total;\n std::vector\u003cdouble\u003e payment_schedule; // 3 payments: 50%, 40%, 10%\n};\n\nclass ConstructionEstimator {\npublic:\n std::vector\u003cMaterialLine\u003e materials;\n std::vector\u003cLaborLine\u003e labor;\n double permit_pct; // % of material cost\n double markup_pct; // contractor markup on subtotal\n double contingency_pct; // on grand total before contingency\n\n ConstructionEstimator(double permit, double markup, double contingency)\n : permit_pct(permit), markup_pct(markup), contingency_pct(contingency) {}\n\n void add_material(const std::string\u0026 name, double cost, double qty, double waste) {\n materials.push_back({name, cost, qty, waste});\n }\n\n void add_labor(const std::string\u0026 trade, double rate, double hours, double eff) {\n labor.push_back({trade, rate, hours, eff});\n }\n\n","golden_completion":" Estimate generate() const {\n double mat_cost = 0;\n for (const auto\u0026 m : materials)\n mat_cost += m.unit_cost * m.quantity * (1.0 + m.waste_factor);\n\n double lab_cost = 0;\n for (const auto\u0026 l : labor)\n lab_cost += l.hourly_rate * (l.hours / l.efficiency);\n\n double permit = mat_cost * permit_pct;\n double subtotal = mat_cost + lab_cost + permit;\n double markup = subtotal * markup_pct;\n double before_contingency = subtotal + markup;\n double contingency = before_contingency * contingency_pct;\n double grand = before_contingency + contingency;\n\n std::vector\u003cdouble\u003e schedule = {grand * 0.50, grand * 0.40, grand * 0.10};\n return {mat_cost, lab_cost, permit, subtotal, markup, contingency, grand, schedule};\n }\n","suffix":"};\n\nint main() {\n ConstructionEstimator est(0.05, 0.15, 0.10);\n\n est.add_material(\"lumber\", 5.0, 100, 0.10); // 5*100*1.1 = 550\n est.add_material(\"concrete\", 120.0, 3, 0.05); // 120*3*1.05 = 378\n\n est.add_labor(\"carpenter\", 45.0, 40, 0.80); // 45*(40/0.8) = 2250\n est.add_labor(\"electrician\", 65.0, 16, 1.0); // 65*16 = 1040\n\n Estimate e = est.generate();\n\n assert(std::abs(e.material_cost - 928.0) \u003c 0.01); // 550+378\n assert(std::abs(e.labor_cost - 3290.0) \u003c 0.01); // 2250+1040\n assert(std::abs(e.permit_fee - 46.4) \u003c 0.01); // 928*0.05\n // subtotal = 928+3290+46.4 = 4264.4\n assert(std::abs(e.subtotal - 4264.4) \u003c 0.1);\n // markup = 4264.4*0.15 = 639.66\n assert(std::abs(e.markup_amount - 639.66) \u003c 0.1);\n // before_contingency = 4904.06\n // contingency = 490.41\n double expected_grand = 4264.4 + 639.66 + 490.406;\n assert(std::abs(e.grand_total - expected_grand) \u003c 1.0);\n\n // Payment schedule sums to grand total\n double sum = e.payment_schedule[0] + e.payment_schedule[1] + e.payment_schedule[2];\n assert(std::abs(sum - e.grand_total) \u003c 0.01);\n assert(std::abs(e.payment_schedule[0] - e.grand_total * 0.5) \u003c 0.01);\n\n return 0;\n}\n","assertions":"\n // Minimal estimate\n ConstructionEstimator est2(0.0, 0.0, 0.0);\n est2.add_material(\"paint\", 30.0, 5, 0.0); // 150\n est2.add_labor(\"painter\", 25.0, 8, 1.0); // 200\n Estimate e2 = est2.generate();\n assert(std::abs(e2.material_cost - 150.0) \u003c 0.01);\n assert(std::abs(e2.labor_cost - 200.0) \u003c 0.01);\n assert(std::abs(e2.permit_fee) \u003c 0.01);\n assert(std::abs(e2.grand_total - 350.0) \u003c 0.01);\n\n // High waste + low efficiency\n ConstructionEstimator est3(0.10, 0.20, 0.05);\n est3.add_material(\"steel\", 200.0, 10, 0.25); // 200*10*1.25 = 2500\n est3.add_labor(\"welder\", 80.0, 20, 0.5); // 80*(20/0.5) = 3200\n Estimate e3 = est3.generate();\n assert(std::abs(e3.material_cost - 2500.0) \u003c 0.01);\n assert(std::abs(e3.labor_cost - 3200.0) \u003c 0.01);\n assert(std::abs(e3.permit_fee - 250.0) \u003c 0.01); // 2500*0.10\n // subtotal=5950, markup=1190, before_cont=7140, cont=357, grand=7497\n assert(std::abs(e3.grand_total - 7497.0) \u003c 1.0);\n","category":"code_purpose_understanding"} {"id":"30","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cstdexcept\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct RentalAgreement {\n std::string rental_id;\n double daily_rate;\n int rental_days;\n int miles_included; // free mileage allowance\n double per_mile_overage;\n double fuel_tank_size; // gallons\n double fuel_price_per_gal;\n double insurance_deductible;\n double hourly_late_fee; // for first 4 hours\n double daily_late_fee; // per day after 4 hours\n int loyalty_points_per_dollar; // earned on base rental only\n};\n\nstruct ReturnDetails {\n int miles_driven;\n double fuel_level; // 0.0 to 1.0 (fraction of tank)\n int hours_late; // 0 = on time\n double damage_amount; // 0 = no damage\n};\n\nstruct Invoice {\n double base_rental;\n double mileage_charge;\n double fuel_penalty;\n double late_surcharge;\n double damage_charge;\n double total;\n int loyalty_points;\n std::vector\u003cstd::string\u003e line_items;\n};\n\nclass RentalReturn {\npublic:\n std::vector\u003cInvoice\u003e invoices;\n\n","golden_completion":" Invoice process_return(const RentalAgreement\u0026 a, const ReturnDetails\u0026 d) {\n Invoice inv;\n inv.base_rental = a.daily_rate * a.rental_days;\n inv.line_items.push_back(\"base:\" + std::to_string(inv.base_rental));\n\n int overage_miles = std::max(0, d.miles_driven - a.miles_included);\n inv.mileage_charge = overage_miles * a.per_mile_overage;\n if (inv.mileage_charge \u003e 0)\n inv.line_items.push_back(\"mileage:\" + std::to_string(inv.mileage_charge));\n\n double missing_fuel = (1.0 - d.fuel_level) * a.fuel_tank_size;\n inv.fuel_penalty = missing_fuel * a.fuel_price_per_gal;\n if (inv.fuel_penalty \u003e 0.01)\n inv.line_items.push_back(\"fuel:\" + std::to_string(inv.fuel_penalty));\n\n inv.late_surcharge = 0;\n if (d.hours_late \u003e 0) {\n int hourly_hours = std::min(d.hours_late, 4);\n int late_days = (d.hours_late \u003e 4) ? (d.hours_late - 4 + 23) / 24 : 0;\n inv.late_surcharge = hourly_hours * a.hourly_late_fee + late_days * a.daily_late_fee;\n inv.line_items.push_back(\"late:\" + std::to_string(inv.late_surcharge));\n }\n\n inv.damage_charge = std::max(0.0, d.damage_amount - a.insurance_deductible);\n if (inv.damage_charge \u003e 0)\n inv.line_items.push_back(\"damage:\" + std::to_string(inv.damage_charge));\n\n inv.total = inv.base_rental + inv.mileage_charge + inv.fuel_penalty +\n inv.late_surcharge + inv.damage_charge;\n inv.loyalty_points = (int)(inv.base_rental * a.loyalty_points_per_dollar);\n inv.line_items.push_back(\"total:\" + std::to_string(inv.total));\n invoices.push_back(inv);\n return inv;\n }\n","suffix":"};\n\nint main() {\n RentalReturn rr;\n RentalAgreement agr = {\"R1\", 50.0, 3, 300, 0.25, 15.0, 4.50, 500.0, 15.0, 75.0, 10};\n\n // On time, full tank, no damage, within mileage\n ReturnDetails d1 = {200, 1.0, 0, 0.0};\n Invoice i1 = rr.process_return(agr, d1);\n assert(std::abs(i1.base_rental - 150.0) \u003c 0.01);\n assert(i1.mileage_charge == 0);\n assert(i1.fuel_penalty \u003c 0.01);\n assert(i1.late_surcharge == 0);\n assert(i1.damage_charge == 0);\n assert(std::abs(i1.total - 150.0) \u003c 0.01);\n assert(i1.loyalty_points == 1500);\n\n // Over mileage, half tank, 3 hours late, damage under deductible\n ReturnDetails d2 = {450, 0.5, 3, 300.0};\n Invoice i2 = rr.process_return(agr, d2);\n assert(std::abs(i2.mileage_charge - 37.5) \u003c 0.01); // 150 * 0.25\n assert(std::abs(i2.fuel_penalty - 33.75) \u003c 0.01); // 0.5*15*4.50\n assert(std::abs(i2.late_surcharge - 45.0) \u003c 0.01); // 3*15\n assert(i2.damage_charge == 0); // 300 \u003c 500 deductible\n // total = 150+37.5+33.75+45+0 = 266.25\n assert(std::abs(i2.total - 266.25) \u003c 0.01);\n assert(i2.loyalty_points == 1500); // only on base rental\n\n // Heavy damage, very late (28 hours = 4hr hourly + 1 day)\n ReturnDetails d3 = {100, 0.75, 28, 1200.0};\n Invoice i3 = rr.process_return(agr, d3);\n assert(std::abs(i3.damage_charge - 700.0) \u003c 0.01); // 1200-500\n // late: 4*15 + ceil(24/24)*75 = 60+75 = 135\n assert(std::abs(i3.late_surcharge - 135.0) \u003c 0.01);\n\n assert(rr.invoices.size() == 3);\n return 0;\n}\n","assertions":"\n // Exactly at mileage limit\n ReturnDetails d4 = {300, 1.0, 0, 0.0};\n Invoice i4 = rr.process_return(agr, d4);\n assert(i4.mileage_charge == 0);\n assert(std::abs(i4.total - 150.0) \u003c 0.01);\n\n // Exactly at deductible\n ReturnDetails d5 = {200, 1.0, 0, 500.0};\n Invoice i5 = rr.process_return(agr, d5);\n assert(i5.damage_charge == 0);\n\n // 5 hours late: 4*hourly + ceil(1/24)*daily = 60+75 = 135\n ReturnDetails d6 = {200, 1.0, 5, 0.0};\n Invoice i6 = rr.process_return(agr, d6);\n assert(std::abs(i6.late_surcharge - 135.0) \u003c 0.01);\n\n // 29 hours late: 4*15 + ceil(25/24)*75 = 60+150 = 210\n ReturnDetails d7 = {200, 1.0, 29, 0.0};\n Invoice i7 = rr.process_return(agr, d7);\n assert(std::abs(i7.late_surcharge - 210.0) \u003c 0.01);\n\n // Fuel: completely empty\n ReturnDetails d8 = {200, 0.0, 0, 0.0};\n Invoice i8 = rr.process_return(agr, d8);\n assert(std::abs(i8.fuel_penalty - 67.5) \u003c 0.01); // 15*4.50\n\n assert(rr.invoices.size() == 8);\n","category":"code_purpose_understanding"} {"id":"31","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct TransferResult {\n std::string status; // OK, DENIED, LIMIT, FROZEN, UNKNOWN_RECIPIENT\n double fee;\n double converted; // amount in recipient currency after exchange\n double senderBalance; // sender balance after deduction\n bool complianceFlag;\n};\n\nstruct Account {\n double balance;\n bool frozen;\n double dailySent;\n double dailyLimit;\n std::string currency;\n};\n\nstatic std::unordered_map\u003cstd::string, Account\u003e accounts;\nstatic std::unordered_set\u003cstd::string\u003e verifiedRecipients;\nstatic std::vector\u003cstd::string\u003e auditLog;\nstatic std::unordered_set\u003cstd::string\u003e processedIds;\n\n// exchange rates TO USD (multiply to get USD)\nstatic std::unordered_map\u003cstd::string, double\u003e toUsd = {\n {\"USD\", 1.0}, {\"EUR\", 1.08}, {\"GBP\", 1.27}, {\"JPY\", 0.0067}\n};\n\nstatic void reset() {\n accounts.clear(); verifiedRecipients.clear();\n auditLog.clear(); processedIds.clear();\n}\n\nstatic void addAccount(const std::string\u0026 id, double bal, bool frozen,\n double dailySent, double dailyLimit, const std::string\u0026 cur) {\n accounts[id] = {bal, frozen, dailySent, dailyLimit, cur};\n}\n\nstatic void verifyRecipient(const std::string\u0026 id) { verifiedRecipients.insert(id); }\n\n// Execute a wire transfer.\n// Rules:\n// 1. txId is idempotent — if already processed, return {\"DUPLICATE\",0,0,0,false}\n// before any mutation.\n// 2. Sender must exist and not be frozen; otherwise FROZEN.\n// 3. Recipient must exist AND be in verifiedRecipients; otherwise UNKNOWN_RECIPIENT.\n// 4. Fee is 1.5% of amount for same-currency, 2.5% for cross-currency, minimum 5.0.\n// 5. Total deduction = amount + fee. If sender.dailySent + amount \u003e dailyLimit → LIMIT\n// (do NOT include fee in daily-limit check).\n// 6. If sender.balance \u003c totalDeduction → DENIED.\n// 7. converted = amount * (senderToUsd / recipientToUsd).\n// 8. complianceFlag = true when amount * senderToUsd \u003e= 10000.\n// 9. Deduct totalDeduction from sender, add converted to recipient, update dailySent,\n// push audit log \"TX:\u003ctxId\u003e:\u003camount\u003e\".\nstatic TransferResult transfer(const std::string\u0026 txId,\n const std::string\u0026 senderId,\n const std::string\u0026 recipientId,\n double amount) {\n","golden_completion":" if (processedIds.count(txId)) return {\"DUPLICATE\", 0, 0, 0, false};\n if (!accounts.count(senderId) || accounts[senderId].frozen)\n return {\"FROZEN\", 0, 0, 0, false};\n if (!accounts.count(recipientId) || !verifiedRecipients.count(recipientId))\n return {\"UNKNOWN_RECIPIENT\", 0, 0, 0, false};\n auto\u0026 s = accounts[senderId];\n auto\u0026 r = accounts[recipientId];\n bool crossCur = s.currency != r.currency;\n double feeRate = crossCur ? 0.025 : 0.015;\n double fee = std::max(amount * feeRate, 5.0);\n if (s.dailySent + amount \u003e s.dailyLimit) return {\"LIMIT\", 0, 0, 0, false};\n double total = amount + fee;\n if (s.balance \u003c total) return {\"DENIED\", 0, 0, 0, false};\n double sToUsd = toUsd[s.currency], rToUsd = toUsd[r.currency];\n double converted = amount * (sToUsd / rToUsd);\n bool flag = (amount * sToUsd) \u003e= 10000.0;\n s.balance -= total;\n s.dailySent += amount;\n r.balance += converted;\n processedIds.insert(txId);\n auditLog.push_back(\"TX:\" + txId + \":\" + std::to_string(amount));\n return {\"OK\", fee, converted, s.balance, flag};\n","suffix":"}\n\nint main() {\n reset();\n addAccount(\"S1\", 50000, false, 0, 20000, \"USD\");\n addAccount(\"R1\", 1000, false, 0, 50000, \"EUR\");\n verifyRecipient(\"R1\");\n auto res = transfer(\"T1\", \"S1\", \"R1\", 10000);\n assert(res.status == \"OK\");\n assert(std::abs(res.fee - 250.0) \u003c 0.01); // 2.5% cross-currency\n assert(std::abs(res.converted - 10000.0*(1.0/1.08)) \u003c 0.01);\n assert(res.complianceFlag == true); // \u003e= 10000 USD\n assert(std::abs(accounts[\"S1\"].balance - (50000 - 10250)) \u003c 0.01);\n assert(auditLog.size() == 1);\n return 0;\n}\n","assertions":"\n // idempotent duplicate\n reset();\n addAccount(\"S1\", 50000, false, 0, 20000, \"USD\");\n addAccount(\"R1\", 1000, false, 0, 50000, \"EUR\");\n verifyRecipient(\"R1\");\n transfer(\"T1\", \"S1\", \"R1\", 5000);\n double balAfter1 = accounts[\"S1\"].balance;\n auto dup = transfer(\"T1\", \"S1\", \"R1\", 5000);\n assert(dup.status == \"DUPLICATE\");\n assert(accounts[\"S1\"].balance == balAfter1); // no double deduction\n\n // frozen sender\n reset();\n addAccount(\"S2\", 10000, true, 0, 50000, \"USD\");\n addAccount(\"R2\", 0, false, 0, 50000, \"USD\");\n verifyRecipient(\"R2\");\n auto fr = transfer(\"T2\", \"S2\", \"R2\", 100);\n assert(fr.status == \"FROZEN\");\n\n // unverified recipient\n reset();\n addAccount(\"S3\", 10000, false, 0, 50000, \"USD\");\n addAccount(\"R3\", 0, false, 0, 50000, \"USD\");\n auto uv = transfer(\"T3\", \"S3\", \"R3\", 100);\n assert(uv.status == \"UNKNOWN_RECIPIENT\");\n\n // daily limit exceeded\n reset();\n addAccount(\"S4\", 100000, false, 9500, 10000, \"USD\");\n addAccount(\"R4\", 0, false, 0, 50000, \"USD\");\n verifyRecipient(\"R4\");\n auto lim = transfer(\"T4\", \"S4\", \"R4\", 600);\n assert(lim.status == \"LIMIT\");\n\n // same-currency fee = 1.5%, minimum 5\n reset();\n addAccount(\"S5\", 10000, false, 0, 50000, \"USD\");\n addAccount(\"R5\", 0, false, 0, 50000, \"USD\");\n verifyRecipient(\"R5\");\n auto sc = transfer(\"T5\", \"S5\", \"R5\", 100);\n assert(sc.status == \"OK\");\n assert(std::abs(sc.fee - 5.0) \u003c 0.01); // 1.5% of 100 = 1.5, minimum 5\n\n // compliance flag false when \u003c 10000 USD\n assert(sc.complianceFlag == false);\n","category":"code_purpose_understanding"} {"id":"32","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct ClaimResult {\n std::string status; // APPROVED, DENIED, DUPLICATE, NO_COVERAGE\n double patientOwes;\n double planPays;\n double deductibleUsed;\n bool subrogation;\n};\n\nstatic double annualDeductible = 500.0;\nstatic double ytdDeductible = 0.0;\nstatic double coinsuranceRate = 0.20; // patient pays 20% after deductible\nstatic double oopMax = 2000.0;\nstatic double ytdOop = 0.0;\n\nstatic std::unordered_set\u003cstd::string\u003e coveredCodes;\nstatic std::unordered_set\u003cstd::string\u003e authRequired;\nstatic std::unordered_set\u003cstd::string\u003e authorizedClaims;\nstatic std::unordered_set\u003cstd::string\u003e processedClaims;\nstatic std::vector\u003cstd::string\u003e ledger;\nstatic bool subrogationTriggered = false;\n\nstatic void reset() {\n ytdDeductible = 0; ytdOop = 0;\n coveredCodes.clear(); authRequired.clear();\n authorizedClaims.clear(); processedClaims.clear();\n ledger.clear(); subrogationTriggered = false;\n}\n\nstatic void addCoverage(const std::string\u0026 code) { coveredCodes.insert(code); }\nstatic void requireAuth(const std::string\u0026 code) { authRequired.insert(code); }\nstatic void authorize(const std::string\u0026 claimId) { authorizedClaims.insert(claimId); }\n\n// Adjudicate an insurance claim.\n// Rules:\n// 1. claimId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,false} with no mutation.\n// 2. Code must be in coveredCodes; otherwise NO_COVERAGE.\n// 3. If code is in authRequired, claimId must be in authorizedClaims; otherwise DENIED.\n// 4. If thirdPartyFault is true, set subrogationTriggered = true.\n// 5. Patient responsibility: first apply remaining deductible, then coinsuranceRate on rest.\n// 6. OOP max caps patient total: if ytdOop + patientOwes \u003e oopMax, clamp patientOwes\n// and plan absorbs the difference.\n// 7. Update ytdDeductible, ytdOop, push ledger \"CLAIM:\u003cid\u003e:\u003cpatientOwes\u003e\", mark processed.\nstatic ClaimResult adjudicate(const std::string\u0026 claimId,\n const std::string\u0026 code,\n double billed,\n bool thirdPartyFault) {\n","golden_completion":" if (processedClaims.count(claimId)) return {\"DUPLICATE\", 0, 0, 0, false};\n if (!coveredCodes.count(code)) return {\"NO_COVERAGE\", 0, 0, 0, false};\n if (authRequired.count(code) \u0026\u0026 !authorizedClaims.count(claimId))\n return {\"DENIED\", 0, 0, 0, false};\n if (thirdPartyFault) subrogationTriggered = true;\n double remainDed = annualDeductible - ytdDeductible;\n double dedUsed = std::min(billed, std::max(remainDed, 0.0));\n double afterDed = billed - dedUsed;\n double coins = afterDed * coinsuranceRate;\n double patient = dedUsed + coins;\n double cap = oopMax - ytdOop;\n if (patient \u003e cap) patient = std::max(cap, 0.0);\n double plan = billed - patient;\n ytdDeductible += dedUsed;\n ytdOop += patient;\n processedClaims.insert(claimId);\n ledger.push_back(\"CLAIM:\" + claimId + \":\" + std::to_string(patient));\n return {\"APPROVED\", patient, plan, dedUsed, subrogationTriggered};\n","suffix":"}\n\nint main() {\n reset();\n addCoverage(\"XRAY\");\n addCoverage(\"SURGERY\");\n requireAuth(\"SURGERY\");\n authorize(\"C2\");\n\n auto r1 = adjudicate(\"C1\", \"XRAY\", 600.0, false);\n assert(r1.status == \"APPROVED\");\n assert(std::abs(r1.deductibleUsed - 500.0) \u003c 0.01);\n // patient = 500 deductible + 20% of 100 = 520\n assert(std::abs(r1.patientOwes - 520.0) \u003c 0.01);\n assert(r1.subrogation == false);\n\n auto r2 = adjudicate(\"C2\", \"SURGERY\", 8000.0, true);\n assert(r2.status == \"APPROVED\");\n assert(r2.subrogation == true); // thirdPartyFault\n assert(std::abs(r2.deductibleUsed - 0.0) \u003c 0.01); // deductible exhausted\n // patient = 20% of 8000 = 1600, but oop cap: 2000-520 = 1480\n assert(std::abs(r2.patientOwes - 1480.0) \u003c 0.01);\n\n assert(ledger.size() == 2);\n return 0;\n}\n","assertions":"\n // duplicate idempotency\n reset();\n addCoverage(\"XRAY\");\n adjudicate(\"C1\", \"XRAY\", 100, false);\n double savedOop = ytdOop;\n auto d = adjudicate(\"C1\", \"XRAY\", 100, false);\n assert(d.status == \"DUPLICATE\");\n assert(ytdOop == savedOop);\n\n // uncovered code\n reset();\n auto nc = adjudicate(\"C3\", \"MRI\", 500, false);\n assert(nc.status == \"NO_COVERAGE\");\n assert(processedClaims.empty());\n\n // unauthorized surgery\n reset();\n addCoverage(\"SURGERY\");\n requireAuth(\"SURGERY\");\n auto ua = adjudicate(\"C4\", \"SURGERY\", 500, false);\n assert(ua.status == \"DENIED\");\n assert(ytdDeductible == 0);\n\n // OOP max reached — patient pays nothing extra\n reset();\n addCoverage(\"XRAY\");\n adjudicate(\"C5\", \"XRAY\", 10000, false); // exhausts oop\n auto over = adjudicate(\"C6\", \"XRAY\", 5000, false);\n assert(over.status == \"APPROVED\");\n assert(std::abs(over.patientOwes - 0.0) \u003c 0.01); // oop maxed\n\n // subrogation persists across claims\n reset();\n addCoverage(\"XRAY\");\n adjudicate(\"C7\", \"XRAY\", 100, true);\n auto r = adjudicate(\"C8\", \"XRAY\", 100, false);\n assert(r.subrogation == true); // still true from C7\n","category":"code_purpose_understanding"} {"id":"33","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct ConvertResult {\n std::string status; // OK, TRIAL_ACTIVE, EXPIRED, NO_PAYMENT, ALREADY_PAID\n double charged;\n double prorated;\n int quotaReset;\n};\n\nstruct User {\n std::string plan; // \"trial\", \"basic\", \"pro\"\n int trialEndDay;\n int usageCount;\n int usageQuota;\n bool paymentMethodValid;\n bool welcomeSent;\n};\n\nstatic std::unordered_map\u003cstd::string, User\u003e users;\nstatic std::unordered_set\u003cstd::string\u003e convertedIds;\nstatic std::vector\u003cstd::string\u003e eventLog;\nstatic std::unordered_map\u003cstd::string, double\u003e planPrices = {\n {\"basic\", 29.0}, {\"pro\", 99.0}\n};\nstatic const int billingCycleDays = 30;\n\nstatic void reset() {\n users.clear(); convertedIds.clear(); eventLog.clear();\n}\n\nstatic void addUser(const std::string\u0026 uid, int trialEnd, int usage, bool validPay) {\n users[uid] = {\"trial\", trialEnd, usage, 100, validPay, false};\n}\n\n// Convert a trial user to paid.\n// Rules:\n// 1. convertId is idempotent: duplicate returns {\"ALREADY_PAID\",0,0,0}.\n// 2. User must exist and be on \"trial\" plan; otherwise ALREADY_PAID if paid, or error.\n// 3. If currentDay \u003c user.trialEndDay, return TRIAL_ACTIVE (trial not over yet).\n// 4. If currentDay \u003e user.trialEndDay + 7, return EXPIRED (grace period = 7 days).\n// 5. Payment method must be valid; otherwise NO_PAYMENT.\n// 6. Proration: daysUsed = currentDay - trialEndDay; prorated = planPrice * daysUsed / billingCycleDays.\n// 7. charged = planPrice - prorated (they already \"used\" some of the billing cycle).\n// 8. Update plan, reset usageCount to 0, set quota based on plan (basic=500, pro=2000),\n// set welcomeSent=true, log \"CONVERT:\u003cuid\u003e:\u003cplan\u003e\".\nstatic ConvertResult convert(const std::string\u0026 convertId,\n const std::string\u0026 uid,\n const std::string\u0026 newPlan,\n int currentDay) {\n","golden_completion":" if (convertedIds.count(convertId)) return {\"ALREADY_PAID\", 0, 0, 0};\n if (!users.count(uid)) return {\"ALREADY_PAID\", 0, 0, 0};\n auto\u0026 u = users[uid];\n if (u.plan != \"trial\") return {\"ALREADY_PAID\", 0, 0, 0};\n if (currentDay \u003c u.trialEndDay) return {\"TRIAL_ACTIVE\", 0, 0, 0};\n if (currentDay \u003e u.trialEndDay + 7) return {\"EXPIRED\", 0, 0, 0};\n if (!u.paymentMethodValid) return {\"NO_PAYMENT\", 0, 0, 0};\n double price = planPrices[newPlan];\n int daysUsed = currentDay - u.trialEndDay;\n double prorated = price * daysUsed / billingCycleDays;\n double charged = price - prorated;\n u.plan = newPlan;\n u.usageCount = 0;\n u.usageQuota = (newPlan == \"pro\") ? 2000 : 500;\n u.welcomeSent = true;\n convertedIds.insert(convertId);\n eventLog.push_back(\"CONVERT:\" + uid + \":\" + newPlan);\n return {\"OK\", charged, prorated, u.usageQuota};\n","suffix":"}\n\nint main() {\n reset();\n addUser(\"U1\", 30, 50, true); // trial ends day 30\n auto r = convert(\"CV1\", \"U1\", \"pro\", 33); // 3 days into grace\n assert(r.status == \"OK\");\n // prorated = 99 * 3/30 = 9.9, charged = 99 - 9.9 = 89.1\n assert(std::abs(r.charged - 89.1) \u003c 0.01);\n assert(std::abs(r.prorated - 9.9) \u003c 0.01);\n assert(r.quotaReset == 2000);\n assert(users[\"U1\"].welcomeSent == true);\n assert(users[\"U1\"].usageCount == 0);\n assert(eventLog.size() == 1);\n return 0;\n}\n","assertions":"\n // idempotent\n reset();\n addUser(\"U2\", 10, 5, true);\n convert(\"CV2\", \"U2\", \"basic\", 12);\n auto dup = convert(\"CV2\", \"U2\", \"basic\", 12);\n assert(dup.status == \"ALREADY_PAID\");\n\n // trial still active\n reset();\n addUser(\"U3\", 30, 0, true);\n auto act = convert(\"CV3\", \"U3\", \"pro\", 25);\n assert(act.status == \"TRIAL_ACTIVE\");\n assert(users[\"U3\"].plan == \"trial\");\n\n // expired past grace\n reset();\n addUser(\"U4\", 10, 0, true);\n auto exp = convert(\"CV4\", \"U4\", \"basic\", 20);\n assert(exp.status == \"EXPIRED\");\n\n // no payment method\n reset();\n addUser(\"U5\", 10, 0, false);\n auto np = convert(\"CV5\", \"U5\", \"basic\", 12);\n assert(np.status == \"NO_PAYMENT\");\n\n // basic plan gets quota 500\n reset();\n addUser(\"U6\", 10, 80, true);\n auto b = convert(\"CV6\", \"U6\", \"basic\", 10);\n assert(b.status == \"OK\");\n assert(b.quotaReset == 500);\n assert(users[\"U6\"].usageCount == 0);\n","category":"code_purpose_understanding"} {"id":"34","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct AwardResult {\n std::string status; // AWARDED, INELIGIBLE, DUPLICATE, AID_CAP\n double needBased;\n double meritBased;\n double totalAwarded;\n int deadlineDay;\n};\n\nstruct Student {\n double gpa;\n bool enrolled;\n double familyIncome;\n double existingAid;\n};\n\nstatic std::unordered_map\u003cstd::string, Student\u003e students;\nstatic std::unordered_set\u003cstd::string\u003e processedApps;\nstatic std::vector\u003cstd::string\u003e awardLog;\nstatic const double totalAidCap = 40000.0;\nstatic const double meritGpaThreshold = 3.7;\nstatic const double needIncomeThreshold = 50000.0;\nstatic const int acceptancePeriod = 30; // days to accept\n\nstatic void reset() {\n students.clear(); processedApps.clear(); awardLog.clear();\n}\n\nstatic void addStudent(const std::string\u0026 sid, double gpa, bool enrolled,\n double income, double existingAid) {\n students[sid] = {gpa, enrolled, income, existingAid};\n}\n\n// Calculate and award a scholarship.\n// Rules:\n// 1. appId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0}.\n// 2. Student must exist, be enrolled, and have GPA \u003e= 2.0; otherwise INELIGIBLE.\n// 3. Need-based: if familyIncome \u003c needIncomeThreshold →\n// needBased = (needIncomeThreshold - familyIncome) / needIncomeThreshold * 15000.\n// 4. Merit-based: if gpa \u003e= meritGpaThreshold → meritBased = (gpa - 3.0) * 5000.\n// 5. Stacking: totalAwarded = needBased + meritBased.\n// 6. Aid cap: if existingAid + totalAwarded \u003e totalAidCap,\n// reduce totalAwarded to totalAidCap - existingAid (but not below 0).\n// Return AID_CAP status if capped, AWARDED otherwise.\n// 7. Update existingAid, log \"AWARD:\u003csid\u003e:\u003ctotalAwarded\u003e\", set deadline = applicationDay + acceptancePeriod.\nstatic AwardResult award(const std::string\u0026 appId,\n const std::string\u0026 sid,\n int applicationDay) {\n","golden_completion":" if (processedApps.count(appId)) return {\"DUPLICATE\", 0, 0, 0, 0};\n if (!students.count(sid) || !students[sid].enrolled || students[sid].gpa \u003c 2.0)\n return {\"INELIGIBLE\", 0, 0, 0, 0};\n auto\u0026 st = students[sid];\n double need = 0.0;\n if (st.familyIncome \u003c needIncomeThreshold)\n need = (needIncomeThreshold - st.familyIncome) / needIncomeThreshold * 15000.0;\n double merit = 0.0;\n if (st.gpa \u003e= meritGpaThreshold)\n merit = (st.gpa - 3.0) * 5000.0;\n double total = need + merit;\n std::string status = \"AWARDED\";\n double room = totalAidCap - st.existingAid;\n if (total \u003e room) { total = std::max(room, 0.0); status = \"AID_CAP\"; }\n st.existingAid += total;\n processedApps.insert(appId);\n awardLog.push_back(\"AWARD:\" + sid + \":\" + std::to_string(total));\n return {status, need, merit, total, applicationDay + acceptancePeriod};\n","suffix":"}\n\nint main() {\n reset();\n addStudent(\"S1\", 3.9, true, 30000, 10000);\n auto r = award(\"A1\", \"S1\", 100);\n assert(r.status == \"AWARDED\");\n // need = (50000-30000)/50000 * 15000 = 6000\n assert(std::abs(r.needBased - 6000.0) \u003c 0.01);\n // merit = (3.9 - 3.0) * 5000 = 4500\n assert(std::abs(r.meritBased - 4500.0) \u003c 0.01);\n assert(std::abs(r.totalAwarded - 10500.0) \u003c 0.01);\n assert(r.deadlineDay == 130);\n assert(std::abs(students[\"S1\"].existingAid - 20500.0) \u003c 0.01);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addStudent(\"S2\", 3.5, true, 40000, 0);\n award(\"A2\", \"S2\", 50);\n auto d = award(\"A2\", \"S2\", 50);\n assert(d.status == \"DUPLICATE\");\n\n // ineligible — not enrolled\n reset();\n addStudent(\"S3\", 3.9, false, 20000, 0);\n auto ie = award(\"A3\", \"S3\", 10);\n assert(ie.status == \"INELIGIBLE\");\n\n // ineligible — low GPA\n reset();\n addStudent(\"S4\", 1.8, true, 20000, 0);\n auto lg = award(\"A4\", \"S4\", 10);\n assert(lg.status == \"INELIGIBLE\");\n\n // aid cap triggers\n reset();\n addStudent(\"S5\", 4.0, true, 10000, 35000);\n auto cap = award(\"A5\", \"S5\", 10);\n assert(cap.status == \"AID_CAP\");\n // need = (50000-10000)/50000*15000 = 12000, merit = (4.0-3.0)*5000 = 5000\n // total would be 17000, but room = 40000-35000 = 5000\n assert(std::abs(cap.totalAwarded - 5000.0) \u003c 0.01);\n assert(std::abs(students[\"S5\"].existingAid - 40000.0) \u003c 0.01);\n\n // no need, no merit (GPA 3.5 \u003c 3.7, income above threshold)\n reset();\n addStudent(\"S6\", 3.5, true, 60000, 0);\n auto zero = award(\"A6\", \"S6\", 10);\n assert(zero.status == \"AWARDED\");\n assert(std::abs(zero.totalAwarded - 0.0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"35","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct TicketResult {\n std::string status; // FIRED, QUEUED, DUPLICATE, OUT_OF_STOCK, ALLERGEN_BLOCK\n int prepTime;\n std::string station;\n int ticketNumber;\n};\n\nstruct MenuItem {\n std::string station; // \"grill\", \"fry\", \"salad\", \"dessert\"\n int prepMinutes;\n std::unordered_map\u003cstd::string, int\u003e ingredients; // ingredient -\u003e qty needed\n std::unordered_set\u003cstd::string\u003e allergens;\n};\n\nstatic std::unordered_map\u003cstd::string, MenuItem\u003e menu;\nstatic std::unordered_map\u003cstd::string, int\u003e inventory; // ingredient -\u003e qty available\nstatic std::unordered_set\u003cstd::string\u003e processedOrders;\nstatic std::vector\u003cstd::string\u003e ticketQueue;\nstatic std::vector\u003cstd::string\u003e completionLog;\nstatic int nextTicket = 1;\nstatic int maxQueuePerStation = 5;\nstatic std::unordered_map\u003cstd::string, int\u003e stationLoad; // station -\u003e current tickets\n\nstatic void reset() {\n menu.clear(); inventory.clear(); processedOrders.clear();\n ticketQueue.clear(); completionLog.clear();\n nextTicket = 1; stationLoad.clear();\n}\n\nstatic void addMenuItem(const std::string\u0026 name, const std::string\u0026 station, int prep,\n std::unordered_map\u003cstd::string, int\u003e ingr,\n std::unordered_set\u003cstd::string\u003e allergens) {\n menu[name] = {station, prep, ingr, allergens};\n}\n\nstatic void setInventory(const std::string\u0026 item, int qty) { inventory[item] = qty; }\n\n// Fire a kitchen order.\n// Rules:\n// 1. orderId idempotent: duplicate returns {\"DUPLICATE\",0,\"\",0}.\n// 2. Item must exist in menu.\n// 3. If customer has ANY listed allergen that the item contains, return ALLERGEN_BLOCK\n// BEFORE checking inventory.\n// 4. All ingredients must have sufficient inventory; otherwise OUT_OF_STOCK (no deduction).\n// 5. If stationLoad[station] \u003e= maxQueuePerStation, return QUEUED, still deduct inventory\n// and assign ticket, but status is QUEUED not FIRED.\n// 6. Deduct ingredients, increment stationLoad, assign ticket number, push to ticketQueue\n// \"TICKET:\u003cnum\u003e:\u003citem\u003e:\u003cstation\u003e\", log nothing to completionLog yet.\n// 7. prepTime = item.prepMinutes + stationLoad[station] * 2 (congestion penalty AFTER increment).\nstatic TicketResult fireOrder(const std::string\u0026 orderId,\n const std::string\u0026 item,\n const std::unordered_set\u003cstd::string\u003e\u0026 customerAllergens) {\n","golden_completion":" if (processedOrders.count(orderId)) return {\"DUPLICATE\", 0, \"\", 0};\n if (!menu.count(item)) return {\"DUPLICATE\", 0, \"\", 0};\n auto\u0026 mi = menu[item];\n for (auto\u0026 a : mi.allergens)\n if (customerAllergens.count(a)) return {\"ALLERGEN_BLOCK\", 0, \"\", 0};\n for (auto\u0026 [ing, qty] : mi.ingredients)\n if (inventory[ing] \u003c qty) return {\"OUT_OF_STOCK\", 0, \"\", 0};\n for (auto\u0026 [ing, qty] : mi.ingredients)\n inventory[ing] -= qty;\n stationLoad[mi.station]++;\n int ticket = nextTicket++;\n processedOrders.insert(orderId);\n std::string status = \"FIRED\";\n if (stationLoad[mi.station] \u003e maxQueuePerStation) status = \"QUEUED\";\n int prep = mi.prepMinutes + stationLoad[mi.station] * 2;\n ticketQueue.push_back(\"TICKET:\" + std::to_string(ticket) + \":\" + item + \":\" + mi.station);\n return {status, prep, mi.station, ticket};\n","suffix":"}\n\nint main() {\n reset();\n maxQueuePerStation = 3;\n addMenuItem(\"burger\", \"grill\", 10, {{\"patty\", 1}, {\"bun\", 1}}, {\"gluten\"});\n addMenuItem(\"salad\", \"salad\", 5, {{\"lettuce\", 2}}, {\"none\"});\n setInventory(\"patty\", 5);\n setInventory(\"bun\", 5);\n setInventory(\"lettuce\", 10);\n\n auto r1 = fireOrder(\"O1\", \"burger\", {});\n assert(r1.status == \"FIRED\");\n assert(r1.station == \"grill\");\n assert(r1.ticketNumber == 1);\n // stationLoad is 1 after increment, prep = 10 + 1*2 = 12\n assert(r1.prepTime == 12);\n assert(inventory[\"patty\"] == 4);\n\n // allergen block\n auto r2 = fireOrder(\"O2\", \"burger\", {\"gluten\"});\n assert(r2.status == \"ALLERGEN_BLOCK\");\n assert(inventory[\"patty\"] == 4); // no deduction on block\n\n assert(ticketQueue.size() == 1);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addMenuItem(\"fries\", \"fry\", 4, {{\"potato\", 2}}, {});\n setInventory(\"potato\", 20);\n fireOrder(\"O3\", \"fries\", {});\n int invAfter = inventory[\"potato\"];\n auto d = fireOrder(\"O3\", \"fries\", {});\n assert(d.status == \"DUPLICATE\");\n assert(inventory[\"potato\"] == invAfter);\n\n // out of stock — no partial deduction\n reset();\n addMenuItem(\"steak\", \"grill\", 15, {{\"beef\", 1}, {\"butter\", 1}}, {});\n setInventory(\"beef\", 1);\n setInventory(\"butter\", 0);\n auto os = fireOrder(\"O4\", \"steak\", {});\n assert(os.status == \"OUT_OF_STOCK\");\n assert(inventory[\"beef\"] == 1); // no deduction\n\n // station overload → QUEUED\n reset();\n maxQueuePerStation = 2;\n addMenuItem(\"wrap\", \"salad\", 3, {{\"tortilla\", 1}}, {});\n setInventory(\"tortilla\", 10);\n fireOrder(\"O5\", \"wrap\", {});\n fireOrder(\"O6\", \"wrap\", {});\n auto q = fireOrder(\"O7\", \"wrap\", {});\n assert(q.status == \"QUEUED\"); // 3rd ticket, max is 2\n assert(q.ticketNumber == 3);\n assert(inventory[\"tortilla\"] == 7); // still deducted\n\n // ticket numbering sequential\n reset();\n addMenuItem(\"cake\", \"dessert\", 8, {{\"flour\", 1}}, {});\n setInventory(\"flour\", 10);\n auto t1 = fireOrder(\"O8\", \"cake\", {});\n auto t2 = fireOrder(\"O9\", \"cake\", {});\n assert(t2.ticketNumber == t1.ticketNumber + 1);\n","category":"code_purpose_understanding"} {"id":"36","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct TaxResult {\n std::string status; // ASSESSED, DUPLICATE, EXEMPT\n double assessedValue;\n double totalTax;\n double exemptionAmount;\n int installments;\n int appealDeadlineDay;\n};\n\nstatic double assessmentRatio = 0.85;\nstatic double millageRate = 0.025; // per dollar of assessed value\nstatic double homesteadExemption = 25000.0;\nstatic double seniorExemption = 10000.0;\nstatic int installmentThreshold = 2000; // taxes above this get 4 installments\nstatic int appealWindow = 45; // days from assessment\n\nstatic std::unordered_set\u003cstd::string\u003e processedParcels;\nstatic std::vector\u003cstd::string\u003e taxRoll;\n\nstatic void reset() { processedParcels.clear(); taxRoll.clear(); }\n\n// Assess property tax for a parcel.\n// Rules:\n// 1. parcelId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0,0}.\n// 2. assessedValue = marketValue * assessmentRatio.\n// 3. Exemptions: homesteadExemption if isHomestead, seniorExemption if isSenior.\n// Exemptions stack but cannot exceed assessedValue.\n// 4. taxableValue = assessedValue - totalExemptions (min 0).\n// 5. totalTax = taxableValue * millageRate + specialLevy.\n// 6. If totalTax == 0, return EXEMPT.\n// 7. installments = 4 if totalTax \u003e installmentThreshold, else 2.\n// 8. appealDeadlineDay = assessmentDay + appealWindow.\n// 9. Log \"TAX:\u003cparcelId\u003e:\u003ctotalTax\u003e\", mark processed.\nstatic TaxResult assess(const std::string\u0026 parcelId,\n double marketValue,\n bool isHomestead, bool isSenior,\n double specialLevy,\n int assessmentDay) {\n","golden_completion":" if (processedParcels.count(parcelId)) return {\"DUPLICATE\", 0, 0, 0, 0, 0};\n double assessed = marketValue * assessmentRatio;\n double exempt = 0;\n if (isHomestead) exempt += homesteadExemption;\n if (isSenior) exempt += seniorExemption;\n if (exempt \u003e assessed) exempt = assessed;\n double taxable = assessed - exempt;\n if (taxable \u003c 0) taxable = 0;\n double tax = taxable * millageRate + specialLevy;\n if (tax == 0) { processedParcels.insert(parcelId); return {\"EXEMPT\", assessed, 0, exempt, 0, assessmentDay + appealWindow}; }\n int inst = (tax \u003e installmentThreshold) ? 4 : 2;\n processedParcels.insert(parcelId);\n taxRoll.push_back(\"TAX:\" + parcelId + \":\" + std::to_string(tax));\n return {\"ASSESSED\", assessed, tax, exempt, inst, assessmentDay + appealWindow};\n","suffix":"}\n\nint main() {\n reset();\n auto r = assess(\"P1\", 300000, true, false, 100, 60);\n // assessed = 300000 * 0.85 = 255000\n // exempt = 25000 (homestead only)\n // taxable = 230000, tax = 230000 * 0.025 + 100 = 5850\n assert(r.status == \"ASSESSED\");\n assert(std::abs(r.assessedValue - 255000) \u003c 0.01);\n assert(std::abs(r.totalTax - 5850) \u003c 0.01);\n assert(r.installments == 4); // \u003e 2000\n assert(r.appealDeadlineDay == 105);\n assert(taxRoll.size() == 1);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n assess(\"P2\", 100000, false, false, 0, 10);\n auto d = assess(\"P2\", 100000, false, false, 0, 10);\n assert(d.status == \"DUPLICATE\");\n\n // stacked exemptions\n reset();\n auto s = assess(\"P3\", 200000, true, true, 0, 10);\n // assessed = 170000, exempt = 35000, taxable = 135000, tax = 3375\n assert(std::abs(s.exemptionAmount - 35000) \u003c 0.01);\n assert(s.installments == 4);\n\n // exemptions capped at assessed value\n reset();\n auto c = assess(\"P4\", 30000, true, true, 0, 10);\n // assessed = 25500, exempt cannot exceed 25500\n assert(std::abs(c.exemptionAmount - 25500.0) \u003c 0.01);\n\n // small tax → 2 installments\n reset();\n auto sm = assess(\"P5\", 50000, true, false, 0, 10);\n // assessed=42500, exempt=25000, taxable=17500, tax=437.5\n assert(sm.installments == 2);\n\n // zero tax → EXEMPT\n reset();\n auto ex = assess(\"P6\", 20000, true, true, 0, 10);\n // assessed=17000, exempt=17000 (capped), taxable=0, tax=0\n assert(ex.status == \"EXEMPT\");\n","category":"code_purpose_understanding"} {"id":"37","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct ShipResult {\n std::string status; // BOOKED, DENIED, DUPLICATE, HAZMAT_DENIED\n double baseCharge;\n double fuelSurcharge;\n double totalCharge;\n int transitDays;\n std::string mode; // \"LTL\" or \"FTL\"\n std::string bolNumber;\n};\n\nstatic std::unordered_set\u003cstd::string\u003e processedShipments;\nstatic std::unordered_set\u003cstd::string\u003e hazmatCodes;\nstatic std::unordered_set\u003cstd::string\u003e hazmatCertifiedCarriers;\nstatic std::vector\u003cstd::string\u003e bolLog;\nstatic int nextBol = 1000;\nstatic double fuelSurchargeRate = 0.12;\nstatic int ftlWeightThreshold = 15000; // lbs\nstatic double ltlRatePerLb = 0.35;\nstatic double ftlFlatRate = 3500.0;\nstatic int baseDaysLtl = 5;\nstatic int baseDaysFtl = 3;\n\nstatic void reset() {\n processedShipments.clear(); hazmatCodes.clear();\n hazmatCertifiedCarriers.clear(); bolLog.clear();\n nextBol = 1000;\n}\n\nstatic void addHazmat(const std::string\u0026 code) { hazmatCodes.insert(code); }\nstatic void certifyCarrier(const std::string\u0026 c) { hazmatCertifiedCarriers.insert(c); }\n\n// Book a freight shipment.\n// Rules:\n// 1. shipmentId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0,\"\",\"\"}.\n// 2. If commodityCode is hazmat AND carrier not certified → HAZMAT_DENIED.\n// 3. If weight \u003c= 0, DENIED.\n// 4. mode: LTL if weight \u003c ftlWeightThreshold, else FTL.\n// 5. baseCharge: LTL = weight * ltlRatePerLb; FTL = ftlFlatRate.\n// 6. For each accessorial in the list, add 150.0.\n// 7. fuelSurcharge = (baseCharge + accessorials) * fuelSurchargeRate.\n// 8. totalCharge = baseCharge + accessorials + fuelSurcharge.\n// 9. transitDays: baseDaysLtl for LTL, baseDaysFtl for FTL; add 1 if hazmat.\n// 10. bolNumber = \"BOL-\" + nextBol (then increment).\n// 11. Log \"SHIP:\u003cbolNumber\u003e:\u003ctotalCharge\u003e\", mark processed.\nstatic ShipResult book(const std::string\u0026 shipmentId,\n const std::string\u0026 commodityCode,\n const std::string\u0026 carrier,\n int weight,\n const std::vector\u003cstd::string\u003e\u0026 accessorials) {\n","golden_completion":" if (processedShipments.count(shipmentId)) return {\"DUPLICATE\", 0, 0, 0, 0, \"\", \"\"};\n if (weight \u003c= 0) return {\"DENIED\", 0, 0, 0, 0, \"\", \"\"};\n bool isHazmat = hazmatCodes.count(commodityCode) \u003e 0;\n if (isHazmat \u0026\u0026 !hazmatCertifiedCarriers.count(carrier))\n return {\"HAZMAT_DENIED\", 0, 0, 0, 0, \"\", \"\"};\n std::string mode = (weight \u003c ftlWeightThreshold) ? \"LTL\" : \"FTL\";\n double base = (mode == \"LTL\") ? weight * ltlRatePerLb : ftlFlatRate;\n double acc = accessorials.size() * 150.0;\n double fuel = (base + acc) * fuelSurchargeRate;\n double total = base + acc + fuel;\n int days = (mode == \"LTL\") ? baseDaysLtl : baseDaysFtl;\n if (isHazmat) days += 1;\n std::string bol = \"BOL-\" + std::to_string(nextBol++);\n processedShipments.insert(shipmentId);\n bolLog.push_back(\"SHIP:\" + bol + \":\" + std::to_string(total));\n return {\"BOOKED\", base, fuel, total, days, mode, bol};\n","suffix":"}\n\nint main() {\n reset();\n addHazmat(\"FLAM\");\n certifyCarrier(\"SafeHaul\");\n\n auto r = book(\"S1\", \"GENERAL\", \"AnyCarrier\", 5000, {\"liftgate\", \"inside\"});\n assert(r.status == \"BOOKED\");\n assert(r.mode == \"LTL\");\n // base = 5000*0.35 = 1750, acc = 300, fuel = 2050*0.12 = 246\n assert(std::abs(r.baseCharge - 1750) \u003c 0.01);\n assert(std::abs(r.totalCharge - 2296) \u003c 0.01);\n assert(r.transitDays == 5);\n assert(r.bolNumber == \"BOL-1000\");\n\n auto r2 = book(\"S2\", \"FLAM\", \"SafeHaul\", 20000, {});\n assert(r2.status == \"BOOKED\");\n assert(r2.mode == \"FTL\");\n assert(r2.transitDays == 4); // 3 + 1 hazmat\n assert(r2.bolNumber == \"BOL-1001\");\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n book(\"S3\", \"GENERAL\", \"X\", 1000, {});\n auto d = book(\"S3\", \"GENERAL\", \"X\", 1000, {});\n assert(d.status == \"DUPLICATE\");\n\n // hazmat not certified\n reset();\n addHazmat(\"ACID\");\n auto h = book(\"S4\", \"ACID\", \"NoCert\", 500, {});\n assert(h.status == \"HAZMAT_DENIED\");\n\n // zero weight denied\n reset();\n auto z = book(\"S5\", \"GENERAL\", \"X\", 0, {});\n assert(z.status == \"DENIED\");\n\n // exact threshold → FTL\n reset();\n auto th = book(\"S6\", \"GENERAL\", \"X\", 15000, {});\n assert(th.mode == \"FTL\");\n assert(std::abs(th.baseCharge - 3500) \u003c 0.01);\n\n // just under threshold → LTL\n reset();\n auto lt = book(\"S7\", \"GENERAL\", \"X\", 14999, {});\n assert(lt.mode == \"LTL\");\n\n // fuel surcharge includes accessorials\n reset();\n auto fs = book(\"S8\", \"GENERAL\", \"X\", 1000, {\"tailgate\"});\n // base=350, acc=150, fuel=(350+150)*0.12=60, total=560\n assert(std::abs(fs.totalCharge - 560) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"38","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct DisbursementResult {\n std::string status; // DISBURSED, DENIED, DUPLICATE, HOLD\n double netAmount;\n double origFee;\n double refund; // if over-award\n int disbursementDay;\n};\n\nstruct LoanRecord {\n double awardAmount;\n double disbursed;\n bool enrollmentVerified;\n bool satisfactoryProgress;\n bool entranceCounseling;\n double tuitionBalance;\n};\n\nstatic std::unordered_map\u003cstd::string, LoanRecord\u003e loans;\nstatic std::unordered_set\u003cstd::string\u003e processedDisb;\nstatic std::vector\u003cstd::string\u003e disbLog;\nstatic double origFeeRate = 0.01057; // ~1.057%\nstatic int disbursementCount = 2; // split into 2 disbursements\n\nstatic void reset() { loans.clear(); processedDisb.clear(); disbLog.clear(); }\n\nstatic void addLoan(const std::string\u0026 lid, double award, bool enrolled,\n bool progress, bool counseling, double tuition) {\n loans[lid] = {award, 0, enrolled, progress, counseling, tuition};\n}\n\n// Disburse a student loan installment.\n// Rules:\n// 1. disbId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0}.\n// 2. Loan must exist.\n// 3. enrollmentVerified AND satisfactoryProgress AND entranceCounseling must all be true;\n// otherwise HOLD (loan exists but can\u0027t disburse).\n// 4. Each disbursement is awardAmount / disbursementCount.\n// 5. If already fully disbursed (disbursed \u003e= awardAmount), DENIED.\n// 6. origFee = installment * origFeeRate. netAmount = installment - origFee.\n// 7. If netAmount \u003e tuitionBalance, refund = netAmount - tuitionBalance, netAmount = tuitionBalance.\n// Otherwise refund = 0.\n// 8. Update disbursed += installment (NOT netAmount), reduce tuitionBalance by netAmount.\n// 9. Log \"DISB:\u003clid\u003e:\u003cnetAmount\u003e\", mark processed.\nstatic DisbursementResult disburse(const std::string\u0026 disbId,\n const std::string\u0026 lid,\n int day) {\n","golden_completion":" if (processedDisb.count(disbId)) return {\"DUPLICATE\", 0, 0, 0, 0};\n if (!loans.count(lid)) return {\"DENIED\", 0, 0, 0, 0};\n auto\u0026 ln = loans[lid];\n if (!ln.enrollmentVerified || !ln.satisfactoryProgress || !ln.entranceCounseling)\n return {\"HOLD\", 0, 0, 0, 0};\n if (ln.disbursed \u003e= ln.awardAmount) return {\"DENIED\", 0, 0, 0, 0};\n double installment = ln.awardAmount / disbursementCount;\n double fee = installment * origFeeRate;\n double net = installment - fee;\n double refund = 0;\n if (net \u003e ln.tuitionBalance) {\n refund = net - ln.tuitionBalance;\n net = ln.tuitionBalance;\n }\n ln.disbursed += installment;\n ln.tuitionBalance -= net;\n processedDisb.insert(disbId);\n disbLog.push_back(\"DISB:\" + lid + \":\" + std::to_string(net));\n return {\"DISBURSED\", net, fee, refund, day};\n","suffix":"}\n\nint main() {\n reset();\n addLoan(\"L1\", 10000, true, true, true, 6000);\n auto r = disburse(\"D1\", \"L1\", 90);\n assert(r.status == \"DISBURSED\");\n // installment = 5000, fee = 5000*0.01057 = 52.85, net = 4947.15\n assert(std::abs(r.origFee - 52.85) \u003c 0.01);\n assert(std::abs(r.netAmount - 4947.15) \u003c 0.01);\n assert(r.refund == 0); // 4947.15 \u003c 6000 tuition\n assert(std::abs(loans[\"L1\"].tuitionBalance - (6000 - 4947.15)) \u003c 0.01);\n assert(loans[\"L1\"].disbursed == 5000); // tracks gross, not net\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addLoan(\"L2\", 8000, true, true, true, 5000);\n disburse(\"D2\", \"L2\", 50);\n auto d = disburse(\"D2\", \"L2\", 50);\n assert(d.status == \"DUPLICATE\");\n\n // HOLD — missing counseling\n reset();\n addLoan(\"L3\", 8000, true, true, false, 5000);\n auto h = disburse(\"D3\", \"L3\", 50);\n assert(h.status == \"HOLD\");\n\n // fully disbursed\n reset();\n addLoan(\"L4\", 4000, true, true, true, 3000);\n disburse(\"D4a\", \"L4\", 50);\n disburse(\"D4b\", \"L4\", 60);\n auto fd = disburse(\"D4c\", \"L4\", 70);\n assert(fd.status == \"DENIED\");\n\n // refund when net \u003e tuition\n reset();\n addLoan(\"L5\", 20000, true, true, true, 3000);\n auto ref = disburse(\"D5\", \"L5\", 50);\n assert(ref.status == \"DISBURSED\");\n // installment=10000, fee=105.7, net=9894.3, but tuition=3000\n assert(std::abs(ref.netAmount - 3000) \u003c 0.01);\n assert(std::abs(ref.refund - 6894.3) \u003c 0.01);\n assert(loans[\"L5\"].tuitionBalance == 0);\n assert(loans[\"L5\"].disbursed == 10000); // tracks gross\n","category":"code_purpose_understanding"} {"id":"39","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct VisitResult {\n std::string status; // INVOICED, DUPLICATE\n double subtotal;\n double discount;\n double total;\n int followupDay;\n};\n\nstatic double examFee = 65.0;\nstatic double labFee = 45.0;\nstatic double wellnessDiscountRate = 0.10;\nstatic double multiPetRate = 0.05;\nstatic int followupDays = 14;\n\nstatic std::unordered_map\u003cstd::string, double\u003e procedurePrices;\nstatic std::unordered_map\u003cstd::string, double\u003e medPrices;\nstatic std::unordered_set\u003cstd::string\u003e processedVisits;\nstatic std::vector\u003cstd::string\u003e invoiceLog;\n\nstatic void reset() {\n procedurePrices.clear(); medPrices.clear();\n processedVisits.clear(); invoiceLog.clear();\n}\n\nstatic void addProcedure(const std::string\u0026 code, double price) { procedurePrices[code] = price; }\nstatic void addMed(const std::string\u0026 name, double price) { medPrices[name] = price; }\n\n// Create a vet visit invoice.\n// Rules:\n// 1. visitId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0}.\n// 2. subtotal starts with examFee.\n// 3. Add price for each procedure code in procedures list.\n// 4. Add price for each medication in meds list.\n// 5. If includeLabWork, add labFee.\n// 6. discount: wellnessDiscountRate applies if hasWellnessPlan.\n// multiPetRate applies if isMultiPet. Discounts are ADDITIVE rates on subtotal.\n// 7. total = subtotal - discount. Minimum total is 0.\n// 8. followupDay = visitDay + followupDays.\n// 9. Log \"INVOICE:\u003cvisitId\u003e:\u003ctotal\u003e\", mark processed.\nstatic VisitResult invoice(const std::string\u0026 visitId,\n const std::vector\u003cstd::string\u003e\u0026 procedures,\n const std::vector\u003cstd::string\u003e\u0026 meds,\n bool includeLabWork,\n bool hasWellnessPlan,\n bool isMultiPet,\n int visitDay) {\n","golden_completion":" if (processedVisits.count(visitId)) return {\"DUPLICATE\", 0, 0, 0, 0};\n double sub = examFee;\n for (auto\u0026 p : procedures) sub += procedurePrices[p];\n for (auto\u0026 m : meds) sub += medPrices[m];\n if (includeLabWork) sub += labFee;\n double rate = 0;\n if (hasWellnessPlan) rate += wellnessDiscountRate;\n if (isMultiPet) rate += multiPetRate;\n double disc = sub * rate;\n double tot = sub - disc;\n if (tot \u003c 0) tot = 0;\n processedVisits.insert(visitId);\n invoiceLog.push_back(\"INVOICE:\" + visitId + \":\" + std::to_string(tot));\n return {\"INVOICED\", sub, disc, tot, visitDay + followupDays};\n","suffix":"}\n\nint main() {\n reset();\n addProcedure(\"VACC\", 35.0);\n addProcedure(\"DENTAL\", 120.0);\n addMed(\"antibiotics\", 25.0);\n\n auto r = invoice(\"V1\", {\"VACC\", \"DENTAL\"}, {\"antibiotics\"}, true, true, true, 50);\n assert(r.status == \"INVOICED\");\n // sub = 65 + 35 + 120 + 25 + 45 = 290\n // rate = 0.10 + 0.05 = 0.15, disc = 290*0.15 = 43.5\n // total = 246.5\n assert(std::abs(r.subtotal - 290) \u003c 0.01);\n assert(std::abs(r.discount - 43.5) \u003c 0.01);\n assert(std::abs(r.total - 246.5) \u003c 0.01);\n assert(r.followupDay == 64);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addProcedure(\"VACC\", 35);\n invoice(\"V2\", {\"VACC\"}, {}, false, false, false, 10);\n auto d = invoice(\"V2\", {\"VACC\"}, {}, false, false, false, 10);\n assert(d.status == \"DUPLICATE\");\n\n // no discounts\n reset();\n addProcedure(\"VACC\", 35);\n auto nd = invoice(\"V3\", {\"VACC\"}, {}, false, false, false, 10);\n assert(std::abs(nd.discount - 0) \u003c 0.01);\n assert(std::abs(nd.total - 100) \u003c 0.01); // 65 + 35\n\n // only wellness discount\n reset();\n addProcedure(\"VACC\", 35);\n auto w = invoice(\"V4\", {\"VACC\"}, {}, false, true, false, 10);\n // sub=100, disc=10, total=90\n assert(std::abs(w.total - 90) \u003c 0.01);\n\n // lab work added\n reset();\n auto l = invoice(\"V5\", {}, {}, true, false, false, 10);\n // sub = 65 + 45 = 110\n assert(std::abs(l.subtotal - 110) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"40","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct BookingResult {\n std::string status; // CONFIRMED, SOLD_OUT, DUPLICATE, INVALID_SEAT\n double ticketCost;\n double addOns;\n double processingFee;\n double total;\n int loyaltyPointsUsed;\n};\n\nstruct Showtime {\n int capacity;\n int sold;\n std::unordered_set\u003cstd::string\u003e takenSeats;\n};\n\nstatic std::unordered_map\u003cstd::string, Showtime\u003e showtimes;\nstatic std::unordered_set\u003cstd::string\u003e processedBookings;\nstatic std::vector\u003cstd::string\u003e confirmLog;\nstatic double adultPrice = 14.0;\nstatic double childPrice = 9.0;\nstatic double seniorPrice = 10.0;\nstatic double processingFeeRate = 0.08;\nstatic double comboMealPrice = 12.0;\nstatic int loyaltyPointValue = 100; // 100 points = $1 off\n\nstatic void reset() { showtimes.clear(); processedBookings.clear(); confirmLog.clear(); }\nstatic void addShowtime(const std::string\u0026 id, int cap) {\n showtimes[id] = {cap, 0, {}};\n}\n\n// Book movie tickets.\n// Rules:\n// 1. bookingId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0,0}.\n// 2. Showtime must exist. Seat must not be taken; otherwise INVALID_SEAT.\n// 3. If showtime.sold \u003e= capacity, SOLD_OUT.\n// 4. ticketCost based on tierType: \"adult\"→adultPrice, \"child\"→childPrice, \"senior\"→seniorPrice.\n// 5. addOns = comboMealPrice * comboCount.\n// 6. Loyalty: deduct min(loyaltyPoints, (ticketCost+addOns)*100) points.\n// loyaltyDiscount = pointsUsed / loyaltyPointValue.\n// 7. processingFee = (ticketCost + addOns - loyaltyDiscount) * processingFeeRate.\n// 8. total = ticketCost + addOns - loyaltyDiscount + processingFee.\n// 9. Mark seat taken, increment sold, log \"BOOK:\u003cbookingId\u003e:\u003ctotal\u003e\".\nstatic BookingResult bookTicket(const std::string\u0026 bookingId,\n const std::string\u0026 showtimeId,\n const std::string\u0026 seat,\n const std::string\u0026 tierType,\n int comboCount,\n int loyaltyPoints) {\n","golden_completion":" if (processedBookings.count(bookingId)) return {\"DUPLICATE\", 0, 0, 0, 0, 0};\n if (!showtimes.count(showtimeId)) return {\"DUPLICATE\", 0, 0, 0, 0, 0};\n auto\u0026 st = showtimes[showtimeId];\n if (st.takenSeats.count(seat)) return {\"INVALID_SEAT\", 0, 0, 0, 0, 0};\n if (st.sold \u003e= st.capacity) return {\"SOLD_OUT\", 0, 0, 0, 0, 0};\n double ticket = adultPrice;\n if (tierType == \"child\") ticket = childPrice;\n else if (tierType == \"senior\") ticket = seniorPrice;\n double adds = comboMealPrice * comboCount;\n double base = ticket + adds;\n int maxPoints = (int)(base * 100);\n int used = std::min(loyaltyPoints, maxPoints);\n double loyDisc = (double)used / loyaltyPointValue;\n double afterDisc = base - loyDisc;\n double fee = afterDisc * processingFeeRate;\n double total = afterDisc + fee;\n st.takenSeats.insert(seat);\n st.sold++;\n processedBookings.insert(bookingId);\n confirmLog.push_back(\"BOOK:\" + bookingId + \":\" + std::to_string(total));\n return {\"CONFIRMED\", ticket, adds, fee, total, used};\n","suffix":"}\n\nint main() {\n reset();\n addShowtime(\"S1\", 100);\n auto r = bookTicket(\"B1\", \"S1\", \"A1\", \"adult\", 1, 500);\n assert(r.status == \"CONFIRMED\");\n // ticket=14, adds=12, base=26, maxPts=2600, used=500\n // disc=500/100=5, afterDisc=21, fee=21*0.08=1.68, total=22.68\n assert(std::abs(r.ticketCost - 14) \u003c 0.01);\n assert(std::abs(r.addOns - 12) \u003c 0.01);\n assert(r.loyaltyPointsUsed == 500);\n assert(std::abs(r.total - 22.68) \u003c 0.01);\n assert(showtimes[\"S1\"].sold == 1);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addShowtime(\"S2\", 50);\n bookTicket(\"B2\", \"S2\", \"A1\", \"adult\", 0, 0);\n auto d = bookTicket(\"B2\", \"S2\", \"A1\", \"adult\", 0, 0);\n assert(d.status == \"DUPLICATE\");\n\n // taken seat\n reset();\n addShowtime(\"S3\", 50);\n bookTicket(\"B3\", \"S3\", \"C5\", \"child\", 0, 0);\n auto ts = bookTicket(\"B4\", \"S3\", \"C5\", \"adult\", 0, 0);\n assert(ts.status == \"INVALID_SEAT\");\n\n // sold out\n reset();\n addShowtime(\"S4\", 1);\n bookTicket(\"B5\", \"S4\", \"A1\", \"adult\", 0, 0);\n auto so = bookTicket(\"B6\", \"S4\", \"A2\", \"adult\", 0, 0);\n assert(so.status == \"SOLD_OUT\");\n\n // child pricing\n reset();\n addShowtime(\"S5\", 50);\n auto ch = bookTicket(\"B7\", \"S5\", \"A1\", \"child\", 0, 0);\n assert(std::abs(ch.ticketCost - 9) \u003c 0.01);\n\n // loyalty points capped at base cost\n reset();\n addShowtime(\"S6\", 50);\n auto lp = bookTicket(\"B8\", \"S6\", \"A1\", \"senior\", 0, 99999);\n // ticket=10, adds=0, maxPts=1000, used=1000, disc=10 → total with fee\n assert(lp.loyaltyPointsUsed == 1000);\n // afterDisc=0, fee=0, total=0\n assert(std::abs(lp.total - 0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"41","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct BookResult {\n std::string status; // BOOKED, WAITLISTED, DUPLICATE, CANCEL_PENALTY, NO_PUNCHES\n int position; // 0 if booked, waitlist position if waitlisted\n int punchesRemaining;\n bool equipmentReserved;\n};\n\nstruct FitnessClass {\n int capacity;\n int enrolled;\n std::vector\u003cstd::string\u003e waitlist;\n bool requiresEquipment;\n int equipmentAvailable;\n};\n\nstruct Member {\n int punchCard; // remaining punches\n std::unordered_set\u003cstd::string\u003e bookedClasses;\n int lastCancelDay;\n};\n\nstatic std::unordered_map\u003cstd::string, FitnessClass\u003e classes;\nstatic std::unordered_map\u003cstd::string, Member\u003e members;\nstatic std::vector\u003cstd::string\u003e bookingLog;\nstatic int cancelPenaltyWindow = 2; // cancel within 2 days of class = penalty\nstatic int penaltyCost = 1; // penalty deducts 1 punch\n\nstatic void reset() { classes.clear(); members.clear(); bookingLog.clear(); }\n\nstatic void addClass(const std::string\u0026 cid, int cap, bool equip, int equipQty) {\n classes[cid] = {cap, 0, {}, equip, equipQty};\n}\nstatic void addMember(const std::string\u0026 mid, int punches) {\n members[mid] = {punches, {}, -999};\n}\n\n// Book a fitness class.\n// Rules:\n// 1. Idempotent: if member already booked this class, return {\"DUPLICATE\",0,punches,false}.\n// 2. Member must have punchCard \u003e 0; otherwise NO_PUNCHES.\n// 3. If enrolled \u003c capacity: BOOKED, deduct 1 punch, increment enrolled.\n// 4. If enrolled \u003e= capacity: WAITLISTED, NO punch deduction, add to waitlist.\n// 5. If requiresEquipment and equipmentAvailable \u003e 0: reserve (decrement), set equipmentReserved.\n// If no equipment but booked, still BOOKED but equipmentReserved = false.\n// 6. position = 0 for BOOKED, waitlist.size() for WAITLISTED (1-indexed after push).\n// 7. Add classId to member\u0027s bookedClasses (even if waitlisted).\n// 8. Log \"BOOK:\u003cmid\u003e:\u003ccid\u003e\".\nstatic BookResult bookClass(const std::string\u0026 memberId,\n const std::string\u0026 classId) {\n","golden_completion":" if (!members.count(memberId)) return {\"NO_PUNCHES\", 0, 0, false};\n auto\u0026 mem = members[memberId];\n if (mem.bookedClasses.count(classId))\n return {\"DUPLICATE\", 0, mem.punchCard, false};\n if (mem.punchCard \u003c= 0) return {\"NO_PUNCHES\", 0, 0, false};\n auto\u0026 cls = classes[classId];\n bool equip = false;\n if (cls.enrolled \u003c cls.capacity) {\n mem.punchCard--;\n cls.enrolled++;\n if (cls.requiresEquipment \u0026\u0026 cls.equipmentAvailable \u003e 0) {\n cls.equipmentAvailable--;\n equip = true;\n }\n mem.bookedClasses.insert(classId);\n bookingLog.push_back(\"BOOK:\" + memberId + \":\" + classId);\n return {\"BOOKED\", 0, mem.punchCard, equip};\n } else {\n cls.waitlist.push_back(memberId);\n mem.bookedClasses.insert(classId);\n bookingLog.push_back(\"BOOK:\" + memberId + \":\" + classId);\n return {\"WAITLISTED\", (int)cls.waitlist.size(), mem.punchCard, false};\n }\n","suffix":"}\n\nint main() {\n reset();\n addClass(\"YOGA\", 2, true, 1);\n addMember(\"M1\", 5);\n addMember(\"M2\", 5);\n addMember(\"M3\", 5);\n\n auto r1 = bookClass(\"M1\", \"YOGA\");\n assert(r1.status == \"BOOKED\");\n assert(r1.equipmentReserved == true); // first gets equipment\n assert(r1.punchesRemaining == 4);\n\n auto r2 = bookClass(\"M2\", \"YOGA\");\n assert(r2.status == \"BOOKED\");\n assert(r2.equipmentReserved == false); // equipment gone\n\n auto r3 = bookClass(\"M3\", \"YOGA\");\n assert(r3.status == \"WAITLISTED\");\n assert(r3.position == 1);\n assert(r3.punchesRemaining == 5); // no deduction on waitlist\n\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addClass(\"SPIN\", 10, false, 0);\n addMember(\"M4\", 3);\n bookClass(\"M4\", \"SPIN\");\n auto d = bookClass(\"M4\", \"SPIN\");\n assert(d.status == \"DUPLICATE\");\n assert(d.punchesRemaining == 2); // only 1 deducted from first booking\n\n // no punches\n reset();\n addClass(\"SPIN\", 10, false, 0);\n addMember(\"M5\", 0);\n auto np = bookClass(\"M5\", \"SPIN\");\n assert(np.status == \"NO_PUNCHES\");\n\n // waitlist doesn\u0027t deduct punch\n reset();\n addClass(\"BOX\", 1, false, 0);\n addMember(\"M6\", 2);\n addMember(\"M7\", 2);\n bookClass(\"M6\", \"BOX\");\n auto wl = bookClass(\"M7\", \"BOX\");\n assert(wl.status == \"WAITLISTED\");\n assert(wl.punchesRemaining == 2); // unchanged\n\n // multiple waitlist positions\n reset();\n addClass(\"PIK\", 1, false, 0);\n addMember(\"M8\", 3);\n addMember(\"M9\", 3);\n addMember(\"M10\", 3);\n bookClass(\"M8\", \"PIK\");\n bookClass(\"M9\", \"PIK\");\n auto w2 = bookClass(\"M10\", \"PIK\");\n assert(w2.position == 2);\n","category":"code_purpose_understanding"} {"id":"42","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct DentalResult {\n std::string status; // PAID, DENIED, DUPLICATE, WAITING_PERIOD, MAX_REACHED, FREQ_LIMIT\n double planPays;\n double patientPays;\n double deductibleApplied;\n double remainingMax;\n};\n\n// Coinsurance rates by category\nstatic std::unordered_map\u003cstd::string, double\u003e coinsurance = {\n {\"preventive\", 1.0}, // plan pays 100%\n {\"basic\", 0.80}, // plan pays 80%\n {\"major\", 0.50} // plan pays 50%\n};\n\n// Deductible applies per category (preventive exempt)\nstatic std::unordered_map\u003cstd::string, double\u003e catDeductible = {\n {\"preventive\", 0.0}, {\"basic\", 50.0}, {\"major\", 100.0}\n};\n\n// Waiting periods (days from enrollment)\nstatic std::unordered_map\u003cstd::string, int\u003e waitingPeriod = {\n {\"preventive\", 0}, {\"basic\", 180}, {\"major\", 365}\n};\n\n// Frequency limits (max claims per benefit year)\nstatic std::unordered_map\u003cstd::string, int\u003e freqLimit = {\n {\"preventive\", 2}, {\"basic\", 4}, {\"major\", 1}\n};\n\nstatic double annualMax = 1500.0;\nstatic double ytdPlanPaid = 0.0;\n\nstatic std::unordered_map\u003cstd::string, double\u003e catDeductibleMet;\nstatic std::unordered_map\u003cstd::string, int\u003e catClaimCount;\nstatic std::unordered_set\u003cstd::string\u003e processedClaims;\nstatic std::vector\u003cstd::string\u003e claimLog;\nstatic int enrollmentDay = 0;\n\nstatic void reset() {\n ytdPlanPaid = 0; catDeductibleMet.clear(); catClaimCount.clear();\n processedClaims.clear(); claimLog.clear(); enrollmentDay = 0;\n}\n\n// Process a dental insurance claim.\n// Rules:\n// 1. claimId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0}.\n// 2. Category must exist in coinsurance; otherwise DENIED.\n// 3. If claimDay \u003c enrollmentDay + waitingPeriod[category] → WAITING_PERIOD.\n// 4. If catClaimCount[category] \u003e= freqLimit[category] → FREQ_LIMIT.\n// 5. Deductible: remaining = catDeductible[cat] - catDeductibleMet[cat].\n// deductibleApplied = min(billed, max(remaining, 0)).\n// 6. afterDed = billed - deductibleApplied.\n// 7. planPortion = afterDed * coinsurance[category].\n// 8. If ytdPlanPaid + planPortion \u003e annualMax, clamp planPortion; return MAX_REACHED if clamped to 0.\n// 9. patientPays = billed - planPortion (which includes deductible + coinsurance).\n// 10. Update catDeductibleMet, ytdPlanPaid, catClaimCount, log, mark processed.\nstatic DentalResult processClaim(const std::string\u0026 claimId,\n const std::string\u0026 category,\n double billed,\n int claimDay) {\n","golden_completion":" if (processedClaims.count(claimId)) return {\"DUPLICATE\", 0, 0, 0, 0};\n if (!coinsurance.count(category)) return {\"DENIED\", 0, 0, 0, 0};\n if (claimDay \u003c enrollmentDay + waitingPeriod[category])\n return {\"WAITING_PERIOD\", 0, 0, 0, annualMax - ytdPlanPaid};\n if (catClaimCount[category] \u003e= freqLimit[category])\n return {\"FREQ_LIMIT\", 0, 0, 0, annualMax - ytdPlanPaid};\n double remDed = catDeductible[category] - catDeductibleMet[category];\n double dedApplied = std::min(billed, std::max(remDed, 0.0));\n double afterDed = billed - dedApplied;\n double planPortion = afterDed * coinsurance[category];\n double room = annualMax - ytdPlanPaid;\n std::string status = \"PAID\";\n if (planPortion \u003e room) { planPortion = std::max(room, 0.0); if (planPortion == 0) status = \"MAX_REACHED\"; }\n double patient = billed - planPortion;\n catDeductibleMet[category] += dedApplied;\n ytdPlanPaid += planPortion;\n catClaimCount[category]++;\n processedClaims.insert(claimId);\n claimLog.push_back(\"DENTAL:\" + claimId + \":\" + std::to_string(planPortion));\n return {status, planPortion, patient, dedApplied, annualMax - ytdPlanPaid};\n","suffix":"}\n\nint main() {\n reset();\n enrollmentDay = 0;\n\n // preventive — no deductible, 100% coverage, no waiting\n auto r1 = processClaim(\"D1\", \"preventive\", 200, 30);\n assert(r1.status == \"PAID\");\n assert(std::abs(r1.deductibleApplied - 0) \u003c 0.01);\n assert(std::abs(r1.planPays - 200) \u003c 0.01);\n assert(std::abs(r1.patientPays - 0) \u003c 0.01);\n assert(std::abs(r1.remainingMax - 1300) \u003c 0.01);\n\n // basic — 50 deductible, 80% coverage\n auto r2 = processClaim(\"D2\", \"basic\", 300, 200);\n assert(r2.status == \"PAID\");\n assert(std::abs(r2.deductibleApplied - 50) \u003c 0.01);\n // afterDed=250, plan=200\n assert(std::abs(r2.planPays - 200) \u003c 0.01);\n assert(std::abs(r2.patientPays - 100) \u003c 0.01);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n enrollmentDay = 0;\n processClaim(\"D3\", \"preventive\", 100, 10);\n auto d = processClaim(\"D3\", \"preventive\", 100, 10);\n assert(d.status == \"DUPLICATE\");\n\n // waiting period\n reset();\n enrollmentDay = 0;\n auto wp = processClaim(\"D4\", \"major\", 500, 100);\n assert(wp.status == \"WAITING_PERIOD\");\n\n // frequency limit\n reset();\n enrollmentDay = 0;\n processClaim(\"D5a\", \"preventive\", 100, 10);\n processClaim(\"D5b\", \"preventive\", 100, 20);\n auto fl = processClaim(\"D5c\", \"preventive\", 100, 30);\n assert(fl.status == \"FREQ_LIMIT\");\n\n // annual max reached\n reset();\n enrollmentDay = 0;\n processClaim(\"D6a\", \"preventive\", 1400, 10);\n auto mx = processClaim(\"D6b\", \"preventive\", 200, 20);\n assert(mx.status == \"PAID\");\n assert(std::abs(mx.planPays - 100) \u003c 0.01); // only 100 room left\n assert(std::abs(mx.remainingMax - 0) \u003c 0.01);\n\n // major after waiting period passes\n reset();\n enrollmentDay = 0;\n auto mj = processClaim(\"D7\", \"major\", 1000, 400);\n assert(mj.status == \"PAID\");\n // ded=100, afterDed=900, plan=450\n assert(std::abs(mj.deductibleApplied - 100) \u003c 0.01);\n assert(std::abs(mj.planPays - 450) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"43","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct WashResult {\n std::string status; // WASHED, OVER_LIMIT, DUPLICATE, WRONG_LOCATION, UPGRADE_APPLIED\n int washesUsed;\n int washesRemaining;\n int rolloverCredits;\n double addOnCharge;\n};\n\nstruct Subscription {\n std::string tier; // \"basic\"(8/mo), \"premium\"(unlimited)\n int monthlyLimit; // 8 for basic, 999 for premium\n int washesThisMonth;\n int rollover; // unused from last month, max 3\n std::string homeLocation;\n double referralBalance;\n};\n\nstatic std::unordered_map\u003cstd::string, Subscription\u003e subs;\nstatic std::unordered_set\u003cstd::string\u003e processedWashes;\nstatic std::vector\u003cstd::string\u003e washLog;\nstatic double addOnPrice = 5.0;\nstatic int maxRollover = 3;\n\nstatic void reset() { subs.clear(); processedWashes.clear(); washLog.clear(); }\n\nstatic void addSub(const std::string\u0026 sid, const std::string\u0026 tier, int limit,\n int washes, int rollover, const std::string\u0026 loc, double refBal) {\n subs[sid] = {tier, limit, washes, rollover, loc, refBal};\n}\n\n// Use a car wash.\n// Rules:\n// 1. washId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0}.\n// 2. Sub must exist. If location != homeLocation, return WRONG_LOCATION.\n// 3. Total available = monthlyLimit - washesThisMonth + rollover.\n// 4. If available \u003c= 0, return OVER_LIMIT.\n// 5. Consume from rollover first, then monthlyLimit quota.\n// 6. addOnCharge = addOnPrice * addOnCount. If referralBalance covers it, deduct from balance.\n// Otherwise addOnCharge = addOnPrice * addOnCount - referralBalance, set referralBalance=0.\n// 7. Increment washesThisMonth, log \"WASH:\u003csid\u003e:\u003clocation\u003e\".\nstatic WashResult useWash(const std::string\u0026 washId,\n const std::string\u0026 subId,\n const std::string\u0026 location,\n int addOnCount) {\n","golden_completion":" if (processedWashes.count(washId)) return {\"DUPLICATE\", 0, 0, 0, 0};\n if (!subs.count(subId)) return {\"DUPLICATE\", 0, 0, 0, 0};\n auto\u0026 s = subs[subId];\n if (location != s.homeLocation) return {\"WRONG_LOCATION\", 0, 0, 0, 0};\n int available = s.monthlyLimit - s.washesThisMonth + s.rollover;\n if (available \u003c= 0) return {\"OVER_LIMIT\", 0, 0, 0, 0};\n if (s.rollover \u003e 0) { s.rollover--; }\n else { s.washesThisMonth++; }\n double addCharge = addOnPrice * addOnCount;\n if (s.referralBalance \u003e= addCharge) {\n s.referralBalance -= addCharge;\n addCharge = 0;\n } else {\n addCharge -= s.referralBalance;\n s.referralBalance = 0;\n }\n processedWashes.insert(washId);\n washLog.push_back(\"WASH:\" + subId + \":\" + location);\n int remaining = s.monthlyLimit - s.washesThisMonth + s.rollover;\n return {\"WASHED\", s.washesThisMonth, remaining, s.rollover, addCharge};\n","suffix":"}\n\nint main() {\n reset();\n addSub(\"S1\", \"basic\", 8, 6, 2, \"LOC_A\", 10.0);\n\n // first wash — uses rollover credit\n auto r1 = useWash(\"W1\", \"S1\", \"LOC_A\", 1);\n assert(r1.status == \"WASHED\");\n assert(r1.rolloverCredits == 1); // was 2, used 1\n assert(r1.washesRemaining == 3); // 8-6+1 = 3\n assert(std::abs(r1.addOnCharge - 0) \u003c 0.01); // covered by $10 referral\n\n // second wash — uses another rollover\n auto r2 = useWash(\"W2\", \"S1\", \"LOC_A\", 2);\n assert(r2.rolloverCredits == 0); // rollover exhausted\n // addOn = $10, referral was 10-5=5 remaining, now 10-5=5 charge\n assert(std::abs(r2.addOnCharge - 5.0) \u003c 0.01);\n\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addSub(\"S2\", \"basic\", 8, 0, 0, \"X\", 0);\n useWash(\"W3\", \"S2\", \"X\", 0);\n auto d = useWash(\"W3\", \"S2\", \"X\", 0);\n assert(d.status == \"DUPLICATE\");\n\n // wrong location\n reset();\n addSub(\"S3\", \"basic\", 8, 0, 0, \"LOC_A\", 0);\n auto wl = useWash(\"W4\", \"S3\", \"LOC_B\", 0);\n assert(wl.status == \"WRONG_LOCATION\");\n\n // over limit\n reset();\n addSub(\"S4\", \"basic\", 2, 2, 0, \"X\", 0);\n auto ol = useWash(\"W5\", \"S4\", \"X\", 0);\n assert(ol.status == \"OVER_LIMIT\");\n\n // rollover consumed before monthly\n reset();\n addSub(\"S5\", \"basic\", 8, 0, 1, \"X\", 0);\n auto ro = useWash(\"W6\", \"S5\", \"X\", 0);\n assert(ro.rolloverCredits == 0);\n assert(subs[\"S5\"].washesThisMonth == 0); // didn\u0027t increment monthly\n\n // no referral balance means full charge\n reset();\n addSub(\"S6\", \"basic\", 8, 0, 0, \"X\", 0);\n auto fc = useWash(\"W7\", \"S6\", \"X\", 3);\n assert(std::abs(fc.addOnCharge - 15) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"44","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct RoyaltyResult {\n std::string status; // DISTRIBUTED, BELOW_THRESHOLD, DUPLICATE\n double artistShare;\n double labelShare;\n double mechanicalFee;\n double performanceFee;\n double totalPayout;\n double convertedPayout; // in artist\u0027s currency\n};\n\nstatic double revenuePerPlay = 0.004;\nstatic double artistSplitRate = 0.55; // artist gets 55%\nstatic double labelSplitRate = 0.30; // label gets 30%\nstatic double mechanicalRate = 0.091; // mechanical license 9.1% of revenue\nstatic double performanceRate = 0.06; // performance rights 6%\nstatic double minPayout = 50.0; // USD minimum\n\nstatic std::unordered_map\u003cstd::string, double\u003e exchangeRates = {\n {\"USD\", 1.0}, {\"EUR\", 0.93}, {\"GBP\", 0.79}, {\"JPY\", 149.5}\n};\n\nstatic std::unordered_set\u003cstd::string\u003e processedPeriods;\nstatic std::vector\u003cstd::string\u003e payoutLog;\nstatic std::unordered_map\u003cstd::string, double\u003e artistAccrued;\n\nstatic void reset() {\n processedPeriods.clear(); payoutLog.clear(); artistAccrued.clear();\n}\n\n// Distribute royalties for a play period.\n// Rules:\n// 1. periodId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0,0,0}.\n// 2. revenue = playCount * revenuePerPlay.\n// 3. mechanicalFee = revenue * mechanicalRate.\n// 4. performanceFee = revenue * performanceRate.\n// 5. distributable = revenue - mechanicalFee - performanceFee.\n// 6. artistShare = distributable * artistSplitRate.\n// 7. labelShare = distributable * labelSplitRate.\n// 8. totalPayout = artistShare (label and platform shares go elsewhere).\n// 9. Accrue to artistAccrued[artistId]. If accrued \u003c minPayout, return BELOW_THRESHOLD\n// (still accrue, but don\u0027t pay out).\n// 10. convertedPayout = totalPayout * exchangeRates[artistCurrency].\n// 11. If paying out (above threshold), reset accrued to 0. Log \"ROYALTY:\u003cartistId\u003e:\u003ctotalPayout\u003e\".\nstatic RoyaltyResult distribute(const std::string\u0026 periodId,\n const std::string\u0026 artistId,\n int playCount,\n const std::string\u0026 artistCurrency) {\n","golden_completion":" if (processedPeriods.count(periodId)) return {\"DUPLICATE\", 0, 0, 0, 0, 0, 0};\n double revenue = playCount * revenuePerPlay;\n double mech = revenue * mechanicalRate;\n double perf = revenue * performanceRate;\n double dist = revenue - mech - perf;\n double artist = dist * artistSplitRate;\n double label = dist * labelSplitRate;\n artistAccrued[artistId] += artist;\n processedPeriods.insert(periodId);\n if (artistAccrued[artistId] \u003c minPayout) {\n double conv = artist * exchangeRates[artistCurrency];\n return {\"BELOW_THRESHOLD\", artist, label, mech, perf, artist, conv};\n }\n double payout = artistAccrued[artistId];\n double conv = payout * exchangeRates[artistCurrency];\n artistAccrued[artistId] = 0;\n payoutLog.push_back(\"ROYALTY:\" + artistId + \":\" + std::to_string(payout));\n return {\"DISTRIBUTED\", artist, label, mech, perf, payout, conv};\n","suffix":"}\n\nint main() {\n reset();\n // 50000 plays: revenue = 200\n auto r = distribute(\"P1\", \"ART1\", 50000, \"EUR\");\n assert(r.status == \"DISTRIBUTED\");\n // mech=200*0.091=18.2, perf=200*0.06=12, dist=169.8\n assert(std::abs(r.mechanicalFee - 18.2) \u003c 0.01);\n assert(std::abs(r.performanceFee - 12) \u003c 0.01);\n // artist=169.8*0.55=93.39, label=169.8*0.30=50.94\n assert(std::abs(r.artistShare - 93.39) \u003c 0.01);\n assert(std::abs(r.labelShare - 50.94) \u003c 0.01);\n // payout = 93.39 (first period, above $50)\n assert(std::abs(r.totalPayout - 93.39) \u003c 0.01);\n assert(std::abs(r.convertedPayout - 93.39*0.93) \u003c 0.01);\n assert(payoutLog.size() == 1);\n return 0;\n}\n","assertions":"\n // below threshold accrues\n reset();\n auto r1 = distribute(\"P2\", \"ART2\", 10000, \"USD\");\n // revenue=40, mech=3.64, perf=2.4, dist=33.96, artist=18.678\n assert(r1.status == \"BELOW_THRESHOLD\");\n assert(std::abs(artistAccrued[\"ART2\"] - 18.678) \u003c 0.01);\n\n // second period pushes over threshold\n auto r2 = distribute(\"P3\", \"ART2\", 20000, \"USD\");\n // new artist share = 37.356, accrued = 18.678+37.356 = 56.034\n assert(r2.status == \"DISTRIBUTED\");\n assert(std::abs(r2.totalPayout - 56.034) \u003c 0.01); // pays full accrued\n assert(std::abs(artistAccrued[\"ART2\"] - 0) \u003c 0.01); // reset\n\n // duplicate\n reset();\n distribute(\"P4\", \"ART3\", 10000, \"USD\");\n auto d = distribute(\"P4\", \"ART3\", 10000, \"USD\");\n assert(d.status == \"DUPLICATE\");\n\n // currency conversion\n reset();\n auto r3 = distribute(\"P5\", \"ART4\", 50000, \"JPY\");\n // revenue=200, mech=18.2, perf=12, dist=169.8, artist=93.39\n assert(r3.status == \"DISTRIBUTED\");\n assert(std::abs(r3.convertedPayout - 93.39 * 149.5) \u003c 1.0);\n","category":"code_purpose_understanding"} {"id":"45","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct DonationResult {\n std::string status; // PROCESSED, DUPLICATE, INVALID\n double receiptAmount;\n double matchAmount;\n double annualTotal;\n bool taxDeductible;\n int nextPledgeDay;\n};\n\nstatic std::unordered_set\u003cstd::string\u003e processedDonations;\nstatic std::unordered_map\u003cstd::string, double\u003e donorAnnualTotal;\nstatic std::vector\u003cstd::string\u003e ackLog;\nstatic double matchRate = 0.50; // employer matches 50%\nstatic double matchCap = 1000.0; // max match per year\nstatic std::unordered_map\u003cstd::string, double\u003e matchUsed; // per donor\nstatic int pledgeInterval = 30;\n\nstatic void reset() {\n processedDonations.clear(); donorAnnualTotal.clear();\n ackLog.clear(); matchUsed.clear();\n}\n\n// Process a donation.\n// Rules:\n// 1. donationId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,false,0}.\n// 2. amount must be \u003e 0; otherwise INVALID.\n// 3. If isRestricted, tax deductibility = false. Otherwise true.\n// 4. matchAmount: if employerMatch is true, match = amount * matchRate,\n// capped at matchCap - matchUsed[donorId]. Match cannot go below 0.\n// 5. receiptAmount = amount + matchAmount.\n// 6. annualTotal: donorAnnualTotal[donorId] += receiptAmount.\n// 7. nextPledgeDay = donationDay + pledgeInterval.\n// 8. Log \"DONATION:\u003cdonorId\u003e:\u003creceiptAmount\u003e\", mark processed, update matchUsed.\nstatic DonationResult processDonation(const std::string\u0026 donationId,\n const std::string\u0026 donorId,\n double amount,\n bool isRestricted,\n bool employerMatch,\n int donationDay) {\n","golden_completion":" if (processedDonations.count(donationId)) return {\"DUPLICATE\", 0, 0, 0, false, 0};\n if (amount \u003c= 0) return {\"INVALID\", 0, 0, 0, false, 0};\n bool taxDed = !isRestricted;\n double match = 0;\n if (employerMatch) {\n double room = matchCap - matchUsed[donorId];\n match = std::min(amount * matchRate, std::max(room, 0.0));\n }\n double receipt = amount + match;\n donorAnnualTotal[donorId] += receipt;\n matchUsed[donorId] += match;\n processedDonations.insert(donationId);\n ackLog.push_back(\"DONATION:\" + donorId + \":\" + std::to_string(receipt));\n return {\"PROCESSED\", receipt, match, donorAnnualTotal[donorId], taxDed, donationDay + pledgeInterval};\n","suffix":"}\n\nint main() {\n reset();\n auto r = processDonation(\"D1\", \"DONOR1\", 500, false, true, 100);\n assert(r.status == \"PROCESSED\");\n assert(std::abs(r.matchAmount - 250) \u003c 0.01); // 500*0.5\n assert(std::abs(r.receiptAmount - 750) \u003c 0.01);\n assert(r.taxDeductible == true);\n assert(r.nextPledgeDay == 130);\n assert(std::abs(r.annualTotal - 750) \u003c 0.01);\n\n // second donation — match cap partially used\n auto r2 = processDonation(\"D2\", \"DONOR1\", 2000, false, true, 140);\n // match would be 1000, but cap=1000-250=750\n assert(std::abs(r2.matchAmount - 750) \u003c 0.01);\n assert(std::abs(r2.receiptAmount - 2750) \u003c 0.01);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n processDonation(\"D3\", \"X\", 100, false, false, 10);\n auto d = processDonation(\"D3\", \"X\", 100, false, false, 10);\n assert(d.status == \"DUPLICATE\");\n\n // invalid amount\n reset();\n auto inv = processDonation(\"D4\", \"X\", 0, false, false, 10);\n assert(inv.status == \"INVALID\");\n\n // restricted = not tax deductible\n reset();\n auto restr = processDonation(\"D5\", \"X\", 200, true, false, 10);\n assert(restr.taxDeductible == false);\n\n // no employer match\n reset();\n auto nm = processDonation(\"D6\", \"X\", 500, false, false, 10);\n assert(std::abs(nm.matchAmount - 0) \u003c 0.01);\n assert(std::abs(nm.receiptAmount - 500) \u003c 0.01);\n\n // match cap exhausted\n reset();\n processDonation(\"D7a\", \"Y\", 2000, false, true, 10); // uses full 1000 match\n auto ex = processDonation(\"D7b\", \"Y\", 500, false, true, 50);\n assert(std::abs(ex.matchAmount - 0) \u003c 0.01); // cap exhausted\n","category":"code_purpose_understanding"} {"id":"46","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct ServiceResult {\n std::string status; // SCHEDULED, DUPLICATE, UNSAFE, WAITPERIOD\n double totalCost;\n double chemicalQty; // liters\n int safetyWaitDays;\n int followupDay;\n int warrantyEndDay;\n};\n\nstatic std::unordered_set\u003cstd::string\u003e processedJobs;\nstatic std::vector\u003cstd::string\u003e serviceLog;\n\nstruct PestProfile {\n double baseRate; // per 1000 sqft\n double chemPerSqft; // liters per sqft\n int safetyDays;\n int warrantyMonths;\n int followupWeeks;\n};\n\nstatic std::unordered_map\u003cstd::string, PestProfile\u003e pestDb = {\n {\"termite\", {150.0, 0.005, 3, 12, 4}},\n {\"rodent\", {100.0, 0.002, 1, 6, 2}},\n {\"cockroach\", {80.0, 0.003, 2, 3, 3}},\n {\"ant\", {60.0, 0.001, 0, 1, 2}}\n};\n\nstatic std::unordered_map\u003cstd::string, int\u003e lastServiceDay; // property -\u003e last service day\n\nstatic void reset() {\n processedJobs.clear(); serviceLog.clear(); lastServiceDay.clear();\n}\n\n// Schedule a pest control service.\n// Rules:\n// 1. jobId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0,0}.\n// 2. pestType must exist in pestDb; otherwise return {\"DUPLICATE\",0,0,0,0,0} (unknown).\n// 3. If lastServiceDay[propertyId] exists and serviceDay - lastServiceDay \u003c safetyDays\n// of the PREVIOUS pest type... simplified: if serviceDay - lastServiceDay[propertyId] \u003c 7,\n// return WAITPERIOD (minimum 7-day gap between any services on same property).\n// 4. chemicalQty = propertySqft * chemPerSqft.\n// 5. If hasPets, chemicalQty *= 0.5 (reduced dosage) and safetyDays += 2.\n// 6. totalCost = (propertySqft / 1000.0) * baseRate.\n// 7. followupDay = serviceDay + followupWeeks * 7.\n// 8. warrantyEndDay = serviceDay + warrantyMonths * 30.\n// 9. Update lastServiceDay, log \"SERVICE:\u003cjobId\u003e:\u003cpestType\u003e\", mark processed.\nstatic ServiceResult schedule(const std::string\u0026 jobId,\n const std::string\u0026 propertyId,\n const std::string\u0026 pestType,\n int propertySqft,\n bool hasPets,\n int serviceDay) {\n","golden_completion":" if (processedJobs.count(jobId)) return {\"DUPLICATE\", 0, 0, 0, 0, 0};\n if (!pestDb.count(pestType)) return {\"DUPLICATE\", 0, 0, 0, 0, 0};\n if (lastServiceDay.count(propertyId) \u0026\u0026 serviceDay - lastServiceDay[propertyId] \u003c 7)\n return {\"WAITPERIOD\", 0, 0, 0, 0, 0};\n auto prof = pestDb[pestType];\n double chem = propertySqft * prof.chemPerSqft;\n int safety = prof.safetyDays;\n if (hasPets) { chem *= 0.5; safety += 2; }\n double cost = (propertySqft / 1000.0) * prof.baseRate;\n int followup = serviceDay + prof.followupWeeks * 7;\n int warranty = serviceDay + prof.warrantyMonths * 30;\n lastServiceDay[propertyId] = serviceDay;\n processedJobs.insert(jobId);\n serviceLog.push_back(\"SERVICE:\" + jobId + \":\" + pestType);\n return {\"SCHEDULED\", cost, chem, safety, followup, warranty};\n","suffix":"}\n\nint main() {\n reset();\n auto r = schedule(\"J1\", \"PROP1\", \"termite\", 2000, false, 100);\n assert(r.status == \"SCHEDULED\");\n // cost = 2000/1000 * 150 = 300\n assert(std::abs(r.totalCost - 300) \u003c 0.01);\n // chem = 2000 * 0.005 = 10\n assert(std::abs(r.chemicalQty - 10) \u003c 0.01);\n assert(r.safetyWaitDays == 3);\n assert(r.followupDay == 128); // 100 + 4*7\n assert(r.warrantyEndDay == 460); // 100 + 12*30\n\n // with pets — reduced dosage\n auto r2 = schedule(\"J2\", \"PROP2\", \"cockroach\", 1500, true, 100);\n assert(std::abs(r2.chemicalQty - 1500*0.003*0.5) \u003c 0.01); // 2.25\n assert(r2.safetyWaitDays == 4); // 2 + 2\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n schedule(\"J3\", \"P\", \"ant\", 1000, false, 50);\n auto d = schedule(\"J3\", \"P\", \"ant\", 1000, false, 50);\n assert(d.status == \"DUPLICATE\");\n\n // wait period between services on same property\n reset();\n schedule(\"J4\", \"PX\", \"ant\", 1000, false, 10);\n auto wp = schedule(\"J5\", \"PX\", \"rodent\", 1000, false, 15);\n assert(wp.status == \"WAITPERIOD\"); // only 5 days, need 7\n\n // exact 7 day gap is fine\n reset();\n schedule(\"J6\", \"PY\", \"ant\", 1000, false, 10);\n auto ok = schedule(\"J7\", \"PY\", \"rodent\", 1000, false, 17);\n assert(ok.status == \"SCHEDULED\");\n\n // unknown pest type\n reset();\n auto unk = schedule(\"J8\", \"P\", \"spider\", 1000, false, 10);\n assert(unk.status == \"DUPLICATE\");\n\n // ant has 0 safety days, but with pets becomes 2\n reset();\n auto ant = schedule(\"J9\", \"P\", \"ant\", 1000, true, 10);\n assert(ant.safetyWaitDays == 2); // 0 + 2\n","category":"code_purpose_understanding"} {"id":"47","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct OrderResult {\n std::string status; // PLACED, DUPLICATE, OUT_OF_SEASON, WRONG_ZONE, LOW_STOCK\n double subtotal;\n double discount;\n double handlingFee;\n double total;\n int deliveryDay;\n};\n\nstruct Plant {\n double price;\n int stockQty;\n int minZone;\n int maxZone;\n bool coldSensitive;\n int seasonStart; // month 1-12\n int seasonEnd; // month 1-12\n};\n\nstatic std::unordered_map\u003cstd::string, Plant\u003e catalog;\nstatic std::unordered_set\u003cstd::string\u003e processedOrders;\nstatic std::vector\u003cstd::string\u003e orderLog;\nstatic int qtyDiscountThreshold = 5;\nstatic double qtyDiscountRate = 0.10;\nstatic double coldHandlingFee = 15.0;\nstatic int deliveryDays = 5;\nstatic int coldDeliveryDays = 3; // cold-sensitive ships faster\n\nstatic void reset() { catalog.clear(); processedOrders.clear(); orderLog.clear(); }\n\nstatic void addPlant(const std::string\u0026 name, double price, int stock,\n int minZ, int maxZ, bool cold, int sStart, int sEnd) {\n catalog[name] = {price, stock, minZ, maxZ, cold, sStart, sEnd};\n}\n\n// Place a nursery order.\n// Rules:\n// 1. orderId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0,0}.\n// 2. Plant must exist in catalog.\n// 3. If orderMonth \u003c seasonStart OR orderMonth \u003e seasonEnd → OUT_OF_SEASON.\n// 4. If customerZone \u003c minZone OR customerZone \u003e maxZone → WRONG_ZONE.\n// 5. If qty \u003e stockQty → LOW_STOCK (no partial fills).\n// 6. subtotal = price * qty.\n// 7. discount: if qty \u003e= qtyDiscountThreshold, discount = subtotal * qtyDiscountRate.\n// 8. handlingFee: if coldSensitive, handlingFee = coldHandlingFee * qty.\n// 9. total = subtotal - discount + handlingFee.\n// 10. deliveryDay = orderDay + (coldSensitive ? coldDeliveryDays : deliveryDays).\n// 11. Deduct stockQty, log \"ORDER:\u003corderId\u003e:\u003ctotal\u003e\", mark processed.\nstatic OrderResult placeOrder(const std::string\u0026 orderId,\n const std::string\u0026 plantName,\n int qty,\n int customerZone,\n int orderMonth,\n int orderDay) {\n","golden_completion":" if (processedOrders.count(orderId)) return {\"DUPLICATE\", 0, 0, 0, 0, 0};\n if (!catalog.count(plantName)) return {\"DUPLICATE\", 0, 0, 0, 0, 0};\n auto\u0026 p = catalog[plantName];\n if (orderMonth \u003c p.seasonStart || orderMonth \u003e p.seasonEnd)\n return {\"OUT_OF_SEASON\", 0, 0, 0, 0, 0};\n if (customerZone \u003c p.minZone || customerZone \u003e p.maxZone)\n return {\"WRONG_ZONE\", 0, 0, 0, 0, 0};\n if (qty \u003e p.stockQty) return {\"LOW_STOCK\", 0, 0, 0, 0, 0};\n double sub = p.price * qty;\n double disc = 0;\n if (qty \u003e= qtyDiscountThreshold) disc = sub * qtyDiscountRate;\n double handling = p.coldSensitive ? coldHandlingFee * qty : 0;\n double total = sub - disc + handling;\n int delDay = orderDay + (p.coldSensitive ? coldDeliveryDays : deliveryDays);\n p.stockQty -= qty;\n processedOrders.insert(orderId);\n orderLog.push_back(\"ORDER:\" + orderId + \":\" + std::to_string(total));\n return {\"PLACED\", sub, disc, handling, total, delDay};\n","suffix":"}\n\nint main() {\n reset();\n addPlant(\"rose\", 12.0, 20, 5, 9, false, 3, 10);\n addPlant(\"orchid\", 25.0, 10, 8, 11, true, 4, 9);\n\n auto r = placeOrder(\"O1\", \"rose\", 6, 7, 5, 100);\n assert(r.status == \"PLACED\");\n // sub=72, disc=72*0.10=7.2, handling=0, total=64.8\n assert(std::abs(r.subtotal - 72) \u003c 0.01);\n assert(std::abs(r.discount - 7.2) \u003c 0.01);\n assert(std::abs(r.total - 64.8) \u003c 0.01);\n assert(r.deliveryDay == 105);\n assert(catalog[\"rose\"].stockQty == 14);\n\n // cold-sensitive plant\n auto r2 = placeOrder(\"O2\", \"orchid\", 2, 9, 6, 200);\n assert(r2.status == \"PLACED\");\n assert(std::abs(r2.handlingFee - 30) \u003c 0.01); // 15 * 2\n assert(r2.deliveryDay == 203); // faster delivery\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addPlant(\"daisy\", 5, 50, 3, 10, false, 1, 12);\n placeOrder(\"O3\", \"daisy\", 1, 5, 6, 10);\n auto d = placeOrder(\"O3\", \"daisy\", 1, 5, 6, 10);\n assert(d.status == \"DUPLICATE\");\n\n // out of season\n reset();\n addPlant(\"tulip\", 8, 30, 4, 8, false, 3, 5);\n auto os = placeOrder(\"O4\", \"tulip\", 1, 5, 7, 10);\n assert(os.status == \"OUT_OF_SEASON\");\n\n // wrong zone\n reset();\n addPlant(\"cactus\", 15, 20, 8, 11, false, 1, 12);\n auto wz = placeOrder(\"O5\", \"cactus\", 1, 5, 6, 10);\n assert(wz.status == \"WRONG_ZONE\");\n\n // low stock\n reset();\n addPlant(\"fern\", 10, 3, 3, 10, false, 1, 12);\n auto ls = placeOrder(\"O6\", \"fern\", 5, 5, 6, 10);\n assert(ls.status == \"LOW_STOCK\");\n assert(catalog[\"fern\"].stockQty == 3); // no deduction\n\n // no discount below threshold\n reset();\n addPlant(\"mint\", 3, 50, 3, 10, false, 1, 12);\n auto nd = placeOrder(\"O7\", \"mint\", 4, 5, 6, 10);\n assert(std::abs(nd.discount - 0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"48","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\nstruct BoardResult {\n std::string status; // RESERVED, DUPLICATE, VACC_EXPIRED, NO_KENNEL, SURGE\n double dailyRate;\n double totalCost;\n double surchargeAmount;\n int kennelAssigned;\n};\n\nstruct Kennel {\n int size; // 1=small, 2=medium, 3=large\n bool occupied;\n};\n\nstatic std::unordered_map\u003cint, Kennel\u003e kennels;\nstatic std::unordered_set\u003cstd::string\u003e processedReservations;\nstatic std::vector\u003cstd::string\u003e boardingLog;\n\nstatic std::unordered_map\u003cint, double\u003e sizeRates = {\n {1, 35.0}, {2, 50.0}, {3, 70.0}\n};\nstatic double medSurcharge = 10.0; // per day if pet has medications\nstatic double surgeRate = 1.5; // holiday surge multiplier\nstatic std::unordered_set\u003cint\u003e surgeDays; // days that are holidays\n\nstatic void reset() {\n kennels.clear(); processedReservations.clear();\n boardingLog.clear(); surgeDays.clear();\n}\n\nstatic void addKennel(int id, int size) { kennels[id] = {size, false}; }\nstatic void addSurgDay(int day) { surgeDays.insert(day); }\n\n// Reserve a pet boarding stay.\n// Rules:\n// 1. reservationId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0}.\n// 2. If vaccExpiryDay \u003c checkInDay, return VACC_EXPIRED.\n// 3. Find smallest available kennel that fits petSize (kennel.size \u003e= petSize).\n// Prefer lower kennel ID among same-size ties. If none, NO_KENNEL.\n// 4. dailyRate = sizeRates[kennel.size] (NOT petSize — charged for kennel size).\n// 5. If hasMedications, dailyRate += medSurcharge.\n// 6. Count surgeDays in [checkInDay, checkOutDay): surgeCount.\n// 7. surchargeAmount = dailyRate * (surgeRate - 1.0) * surgeCount.\n// 8. nights = checkOutDay - checkInDay.\n// 9. totalCost = dailyRate * nights + surchargeAmount.\n// 10. Mark kennel occupied, log \"BOARD:\u003cresId\u003e:\u003ckennelId\u003e\", mark processed.\nstatic BoardResult reserve(const std::string\u0026 resId,\n int petSize,\n int vaccExpiryDay,\n bool hasMedications,\n int checkInDay,\n int checkOutDay) {\n","golden_completion":" if (processedReservations.count(resId)) return {\"DUPLICATE\", 0, 0, 0, 0};\n if (vaccExpiryDay \u003c checkInDay) return {\"VACC_EXPIRED\", 0, 0, 0, 0};\n int bestKennel = -1, bestSize = 999;\n for (auto\u0026 [kid, k] : kennels) {\n if (!k.occupied \u0026\u0026 k.size \u003e= petSize) {\n if (k.size \u003c bestSize || (k.size == bestSize \u0026\u0026 kid \u003c bestKennel)) {\n bestKennel = kid; bestSize = k.size;\n }\n }\n }\n if (bestKennel \u003c 0) return {\"NO_KENNEL\", 0, 0, 0, 0};\n double rate = sizeRates[bestSize];\n if (hasMedications) rate += medSurcharge;\n int surgeCount = 0;\n for (int d = checkInDay; d \u003c checkOutDay; d++)\n if (surgeDays.count(d)) surgeCount++;\n double surge = rate * (surgeRate - 1.0) * surgeCount;\n int nights = checkOutDay - checkInDay;\n double total = rate * nights + surge;\n kennels[bestKennel].occupied = true;\n processedReservations.insert(resId);\n boardingLog.push_back(\"BOARD:\" + resId + \":\" + std::to_string(bestKennel));\n std::string status = surgeCount \u003e 0 ? \"SURGE\" : \"RESERVED\";\n return {status, rate, total, surge, bestKennel};\n","suffix":"}\n\nint main() {\n reset();\n addKennel(1, 1); addKennel(2, 2); addKennel(3, 3);\n addSurgDay(102); addSurgDay(103);\n\n // medium pet, check in day 100 for 5 nights\n auto r = reserve(\"R1\", 2, 200, true, 100, 105);\n assert(r.status == \"SURGE\");\n assert(r.kennelAssigned == 2); // smallest kennel \u003e= 2\n // rate = 50 + 10(med) = 60, 2 surge days, surge = 60*0.5*2 = 60\n assert(std::abs(r.dailyRate - 60) \u003c 0.01);\n assert(std::abs(r.surchargeAmount - 60) \u003c 0.01);\n // total = 60*5 + 60 = 360\n assert(std::abs(r.totalCost - 360) \u003c 0.01);\n assert(kennels[2].occupied == true);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n addKennel(1, 2);\n reserve(\"R2\", 1, 200, false, 100, 103);\n auto d = reserve(\"R2\", 1, 200, false, 100, 103);\n assert(d.status == \"DUPLICATE\");\n\n // expired vaccine\n reset();\n addKennel(1, 2);\n auto ve = reserve(\"R3\", 1, 90, false, 100, 105);\n assert(ve.status == \"VACC_EXPIRED\");\n\n // no kennel available\n reset();\n addKennel(1, 1); // only small\n auto nk = reserve(\"R4\", 2, 200, false, 100, 103);\n assert(nk.status == \"NO_KENNEL\");\n\n // charged for kennel size, not pet size\n reset();\n addKennel(10, 3); // only large available for small pet\n auto big = reserve(\"R5\", 1, 200, false, 100, 102);\n assert(big.status == \"RESERVED\");\n assert(std::abs(big.dailyRate - 70) \u003c 0.01); // large kennel rate\n assert(big.kennelAssigned == 10);\n\n // no surge days → RESERVED status\n reset();\n addKennel(1, 1);\n auto ns = reserve(\"R6\", 1, 200, false, 50, 55);\n assert(ns.status == \"RESERVED\");\n assert(std::abs(ns.surchargeAmount - 0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"49","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct QuoteResult {\n std::string status; // QUOTED, DUPLICATE, TOO_SMALL, PERMIT_DENIED\n int panelCount;\n double systemCost;\n double taxCredit;\n double netCost;\n double annualSavings;\n double roiYears;\n double permitFee;\n};\n\nstatic double panelWatts = 400; // watts per panel\nstatic double costPerWatt = 2.80;\nstatic double inverterCostPerKw = 200.0;\nstatic double batteryCostPerKwh = 500.0;\nstatic double taxCreditRate = 0.30;\nstatic double utilityRate = 0.12; // per kWh\nstatic double buybackRate = 0.04; // utility pays for excess\nstatic double sunHoursPerDay = 5.0;\nstatic double permitFeeBase = 500.0;\nstatic double permitFeePerPanel = 25.0;\nstatic int minPanels = 4;\n\nstatic std::unordered_set\u003cstd::string\u003e processedQuotes;\nstatic std::vector\u003cstd::string\u003e quoteLog;\n\nstatic void reset() { processedQuotes.clear(); quoteLog.clear(); }\n\n// Generate a solar panel installation quote.\n// Rules:\n// 1. quoteId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0,0,0,0}.\n// 2. panelCount = ceil(roofSqft / 18.0) — each panel needs ~18 sqft.\n// 3. If panelCount \u003c minPanels, return TOO_SMALL.\n// 4. systemWatts = panelCount * panelWatts.\n// 5. systemCost = systemWatts * costPerWatt + (systemWatts/1000.0) * inverterCostPerKw.\n// 6. If wantBattery: add batteryKwh * batteryCostPerKwh to systemCost.\n// 7. permitFee = permitFeeBase + panelCount * permitFeePerPanel.\n// 8. taxCredit = (systemCost + permitFee) * taxCreditRate.\n// 9. netCost = systemCost + permitFee - taxCredit.\n// 10. annualGenKwh = systemWatts/1000 * sunHoursPerDay * 365.\n// 11. annualSavings = min(annualGenKwh, annualUsageKwh) * utilityRate\n// + max(annualGenKwh - annualUsageKwh, 0) * buybackRate.\n// 12. roiYears = netCost / annualSavings. If annualSavings == 0, roiYears = 999.\n// 13. Log \"QUOTE:\u003cquoteId\u003e:\u003cnetCost\u003e\", mark processed.\nstatic QuoteResult generateQuote(const std::string\u0026 quoteId,\n double roofSqft,\n bool wantBattery,\n double batteryKwh,\n double annualUsageKwh) {\n","golden_completion":" if (processedQuotes.count(quoteId)) return {\"DUPLICATE\", 0, 0, 0, 0, 0, 0, 0};\n int panels = (int)std::ceil(roofSqft / 18.0);\n if (panels \u003c minPanels) return {\"TOO_SMALL\", panels, 0, 0, 0, 0, 0, 0};\n double sysW = panels * panelWatts;\n double cost = sysW * costPerWatt + (sysW / 1000.0) * inverterCostPerKw;\n if (wantBattery) cost += batteryKwh * batteryCostPerKwh;\n double permit = permitFeeBase + panels * permitFeePerPanel;\n double credit = (cost + permit) * taxCreditRate;\n double net = cost + permit - credit;\n double genKwh = (sysW / 1000.0) * sunHoursPerDay * 365;\n double savings = std::min(genKwh, annualUsageKwh) * utilityRate\n + std::max(genKwh - annualUsageKwh, 0.0) * buybackRate;\n double roi = (savings == 0) ? 999.0 : net / savings;\n processedQuotes.insert(quoteId);\n quoteLog.push_back(\"QUOTE:\" + quoteId + \":\" + std::to_string(net));\n return {\"QUOTED\", panels, cost, credit, net, savings, roi, permit};\n","suffix":"}\n\nint main() {\n reset();\n // 500 sqft roof → ceil(500/18) = 28 panels\n auto r = generateQuote(\"Q1\", 500, true, 10, 8000);\n assert(r.status == \"QUOTED\");\n assert(r.panelCount == 28);\n // sysW = 11200, cost = 11200*2.8 + 11.2*200 = 31360+2240 = 33600\n // battery = 10*500 = 5000, total cost = 38600\n assert(std::abs(r.systemCost - 38600) \u003c 0.01);\n // permit = 500 + 28*25 = 1200\n assert(std::abs(r.permitFee - 1200) \u003c 0.01);\n // credit = (38600+1200)*0.30 = 11940\n assert(std::abs(r.taxCredit - 11940) \u003c 0.01);\n // net = 38600+1200-11940 = 27860\n assert(std::abs(r.netCost - 27860) \u003c 0.01);\n // gen = 11.2*5*365 = 20440 kWh\n // savings = min(20440,8000)*0.12 + max(12440,0)*0.04 = 960+497.6 = 1457.6\n assert(std::abs(r.annualSavings - 1457.6) \u003c 0.01);\n assert(std::abs(r.roiYears - 27860/1457.6) \u003c 0.1);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n generateQuote(\"Q2\", 500, false, 0, 5000);\n auto d = generateQuote(\"Q2\", 500, false, 0, 5000);\n assert(d.status == \"DUPLICATE\");\n\n // too small\n reset();\n auto ts = generateQuote(\"Q3\", 50, false, 0, 5000);\n assert(ts.status == \"TOO_SMALL\");\n assert(ts.panelCount == 3); // ceil(50/18) = 3 \u003c 4\n\n // no battery\n reset();\n auto nb = generateQuote(\"Q4\", 200, false, 0, 5000);\n // panels = ceil(200/18) = 12, sysW=4800\n // cost = 4800*2.8 + 4.8*200 = 13440+960 = 14400\n assert(nb.panelCount == 12);\n assert(std::abs(nb.systemCost - 14400) \u003c 0.01);\n\n // usage exceeds generation — no buyback\n reset();\n auto hi = generateQuote(\"Q5\", 100, false, 0, 50000);\n // panels=6, sysW=2400, gen=2400/1000*5*365=4380\n // savings = 4380*0.12 = 525.6 (all self-consumed)\n assert(std::abs(hi.annualSavings - 525.6) \u003c 0.01);\n\n // zero usage — all buyback\n reset();\n auto zr = generateQuote(\"Q6\", 200, false, 0, 0);\n // panels=12, gen=4800/1000*5*365=8760\n // savings = 0 + 8760*0.04 = 350.4\n assert(std::abs(zr.annualSavings - 350.4) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"50","testsource":"devbench-code-purpose-understanding","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n#include \u003cunordered_set\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nstruct CaterResult {\n std::string status; // CONFIRMED, DUPLICATE, BELOW_MINIMUM, INVALID\n double foodCost;\n double equipmentCost;\n double staffCost;\n double travelFee;\n double gratuity;\n double total;\n};\n\nstatic double costPerHead = 35.0;\nstatic double veganSurchargeRate = 0.15; // 15% more for vegan portions\nstatic double gfSurchargeRate = 0.10; // 10% more for gluten-free\nstatic double equipmentPerHour = 50.0;\nstatic double staffRate = 25.0; // per staff per hour\nstatic int staffPer25 = 1; // 1 staff per 25 guests\nstatic double travelPerMile = 0.65;\nstatic double gratuityRate = 0.18;\nstatic double minimumOrder = 500.0;\n\nstatic std::unordered_set\u003cstd::string\u003e processedOrders;\nstatic std::vector\u003cstd::string\u003e caterLog;\n\nstatic void reset() { processedOrders.clear(); caterLog.clear(); }\n\n// Place a catering order.\n// Rules:\n// 1. orderId idempotent: duplicate returns {\"DUPLICATE\",0,0,0,0,0,0}.\n// 2. headcount must be \u003e 0; otherwise INVALID.\n// 3. veganCount + gfCount must be \u003c= headcount; otherwise INVALID.\n// 4. foodCost: (headcount - veganCount - gfCount) * costPerHead\n// + veganCount * costPerHead * (1 + veganSurchargeRate)\n// + gfCount * costPerHead * (1 + gfSurchargeRate).\n// 5. staffNeeded = ceil(headcount / 25.0). staffCost = staffNeeded * staffRate * eventHours.\n// 6. equipmentCost = equipmentPerHour * eventHours.\n// 7. travelFee = travelPerMile * distanceMiles. Free if distanceMiles \u003c= 10.\n// 8. subtotal = foodCost + staffCost + equipmentCost + travelFee.\n// 9. If subtotal \u003c minimumOrder, return BELOW_MINIMUM.\n// 10. gratuity = subtotal * gratuityRate.\n// 11. total = subtotal + gratuity.\n// 12. Log \"CATER:\u003corderId\u003e:\u003ctotal\u003e\", mark processed.\nstatic CaterResult placeCatering(const std::string\u0026 orderId,\n int headcount,\n int veganCount,\n int gfCount,\n double eventHours,\n double distanceMiles) {\n","golden_completion":" if (processedOrders.count(orderId)) return {\"DUPLICATE\", 0, 0, 0, 0, 0, 0};\n if (headcount \u003c= 0) return {\"INVALID\", 0, 0, 0, 0, 0, 0};\n if (veganCount + gfCount \u003e headcount) return {\"INVALID\", 0, 0, 0, 0, 0, 0};\n int regular = headcount - veganCount - gfCount;\n double food = regular * costPerHead\n + veganCount * costPerHead * (1 + veganSurchargeRate)\n + gfCount * costPerHead * (1 + gfSurchargeRate);\n int staff = (int)std::ceil(headcount / 25.0);\n double staffC = staff * staffRate * eventHours;\n double equipC = equipmentPerHour * eventHours;\n double travel = (distanceMiles \u003e 10) ? travelPerMile * distanceMiles : 0;\n double sub = food + staffC + equipC + travel;\n if (sub \u003c minimumOrder) return {\"BELOW_MINIMUM\", food, equipC, staffC, travel, 0, sub};\n double grat = sub * gratuityRate;\n double total = sub + grat;\n processedOrders.insert(orderId);\n caterLog.push_back(\"CATER:\" + orderId + \":\" + std::to_string(total));\n return {\"CONFIRMED\", food, equipC, staffC, travel, grat, total};\n","suffix":"}\n\nint main() {\n reset();\n // 50 guests, 10 vegan, 5 GF, 4 hours, 20 miles\n auto r = placeCatering(\"C1\", 50, 10, 5, 4, 20);\n assert(r.status == \"CONFIRMED\");\n // regular=35, food = 35*35 + 10*35*1.15 + 5*35*1.10 = 1225+402.5+192.5 = 1820\n assert(std::abs(r.foodCost - 1820) \u003c 0.01);\n // staff = ceil(50/25) = 2, staffC = 2*25*4 = 200\n assert(std::abs(r.staffCost - 200) \u003c 0.01);\n // equip = 50*4 = 200\n assert(std::abs(r.equipmentCost - 200) \u003c 0.01);\n // travel = 0.65*20 = 13\n assert(std::abs(r.travelFee - 13) \u003c 0.01);\n // sub = 2233, grat = 2233*0.18 = 401.94, total = 2634.94\n assert(std::abs(r.total - 2634.94) \u003c 0.01);\n return 0;\n}\n","assertions":"\n // duplicate\n reset();\n placeCatering(\"C2\", 30, 0, 0, 3, 5);\n auto d = placeCatering(\"C2\", 30, 0, 0, 3, 5);\n assert(d.status == \"DUPLICATE\");\n\n // invalid headcount\n reset();\n auto ih = placeCatering(\"C3\", 0, 0, 0, 3, 5);\n assert(ih.status == \"INVALID\");\n\n // dietary count exceeds headcount\n reset();\n auto dc = placeCatering(\"C4\", 10, 6, 6, 3, 5);\n assert(dc.status == \"INVALID\");\n\n // below minimum\n reset();\n auto bm = placeCatering(\"C5\", 2, 0, 0, 1, 5);\n assert(bm.status == \"BELOW_MINIMUM\");\n // food=70, staff=ceil(2/25)=1, staffC=25, equip=50, travel=0 (\u003c=10)\n // sub=145\n assert(std::abs(bm.total - 145) \u003c 0.01); // total field holds subtotal on BELOW_MINIMUM\n\n // free travel within 10 miles\n reset();\n auto ft = placeCatering(\"C6\", 30, 0, 0, 3, 8);\n assert(std::abs(ft.travelFee - 0) \u003c 0.01);\n\n // exactly 10 miles — still free\n reset();\n auto t10 = placeCatering(\"C7\", 30, 0, 0, 3, 10);\n assert(std::abs(t10.travelFee - 0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"1","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003citerator\u003e\n\nstd::vector\u003cint\u003e copy_positive_scores(const std::vector\u003cint\u003e\u0026 scores) {\n std::vector\u003cint\u003e out;\n std::copy_if(scores.begin(), scores.end(), std::back_inserter(out),\n [](int x) { return x \u003e 0; });\n return out;\n}\n\n","golden_completion":"std::string describe_copy_positive_scores() {\n return \"Returns a new vector by applying std::copy_if to the input range \"\n \"and writing through std::back_inserter. The predicate is evaluated \"\n \"exactly once per element, selected elements keep their relative order, \"\n \"and the source vector is not modified. back_inserter appends to the \"\n \"destination, so the work is O(n) for n input elements.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e scores = {-2, 5, 0, 7, -1, 9};\n auto out = copy_positive_scores(scores);\n assert((out == std::vector\u003cint\u003e{5, 7, 9}));\n assert(scores[0] == -2 \u0026\u0026 scores.size() == 6);\n assert(!describe_copy_positive_scores().empty());\n}\n","assertions":"{\nstd::string d = describe_copy_positive_scores();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::copy_if\") \u0026\u0026 \"must name std::copy_if\");\nassert(has(\"std::back_inserter\") \u0026\u0026 \"must name the output iterator adaptor\");\nassert(has(\"exactly once\") || has(\"once per element\"));\nassert(has(\"relative order\") || has(\"preserve\"));\nassert(has(\"not modified\") || has(\"not mutate\"));\nassert(has(\"appends\") || has(\"append\"));\nassert(has(\"O(n\") \u0026\u0026 \"must mention linear work\");\n}\n","category":"code2NL_NL2code"} {"id":"2","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n\nbool advance_permutation_or_reset(std::vector\u003cint\u003e\u0026 values) {\n return std::next_permutation(values.begin(), values.end());\n}\n\n","golden_completion":"std::string describe_advance_permutation_or_reset() {\n return \"Mutates the vector in place with std::next_permutation, producing \"\n \"the next lexicographic permutation under operator\u003c. It returns true \"\n \"when such a permutation exists. If the range is already the last \"\n \"permutation, it rearranges the vector into ascending order, returns \"\n \"false, and still performs only O(n) work.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e a = {1, 3, 2};\n assert(advance_permutation_or_reset(a));\n assert((a == std::vector\u003cint\u003e{2, 1, 3}));\n std::vector\u003cint\u003e b = {3, 2, 1};\n assert(!advance_permutation_or_reset(b));\n assert((b == std::vector\u003cint\u003e{1, 2, 3}));\n assert(!describe_advance_permutation_or_reset().empty());\n}\n","assertions":"{\nstd::string d = describe_advance_permutation_or_reset();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::next_permutation\"));\nassert(has(\"lexicographic\") || has(\"lexicographical\"));\nassert(has(\"operator\u003c\") || has(\"less-than\"));\nassert(has(\"in place\") || has(\"in-place\") || has(\"Mutates\") || has(\"mutates\"));\nassert(has(\"ascending order\"));\nassert(has(\"returns false\") || has(\"return false\"));\nassert(has(\"O(n\"));\n}\n","category":"code2NL_NL2code"} {"id":"3","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003citerator\u003e\n#include \u003cutility\u003e\n\nstd::pair\u003cint, int\u003e equal_range_indices(const std::vector\u003cint\u003e\u0026 sorted, int value) {\n auto bounds = std::equal_range(sorted.begin(), sorted.end(), value);\n return {static_cast\u003cint\u003e(std::distance(sorted.begin(), bounds.first)),\n static_cast\u003cint\u003e(std::distance(sorted.begin(), bounds.second))};\n}\n\n","golden_completion":"std::string describe_equal_range_indices() {\n return \"Uses std::equal_range on a sorted non-decreasing vector and returns \"\n \"the half-open index interval [lower_bound, upper_bound) containing \"\n \"all elements equivalent to the value. The first iterator is the first \"\n \"element not less than the value, and the second is the first element \"\n \"greater than the value. It performs binary-search work in O(log n).\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e v = {1, 2, 2, 2, 4, 6};\n auto r = equal_range_indices(v, 2);\n assert(r.first == 1 \u0026\u0026 r.second == 4);\n auto missing = equal_range_indices(v, 3);\n assert(missing.first == 4 \u0026\u0026 missing.second == 4);\n assert(!describe_equal_range_indices().empty());\n}\n","assertions":"{\nstd::string d = describe_equal_range_indices();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::equal_range\"));\nassert(has(\"sorted\") || has(\"non-decreasing\"));\nassert(has(\"half-open\") || has(\"[lower_bound, upper_bound)\"));\nassert(has(\"lower_bound\"));\nassert(has(\"upper_bound\"));\nassert(has(\"not less than\"));\nassert(has(\"greater than\"));\nassert(has(\"O(log\") || has(\"binary-search\"));\n}\n","category":"code2NL_NL2code"} {"id":"4","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003citerator\u003e\n#include \u003crandom\u003e\n\nstd::vector\u003cint\u003e deterministic_sample(const std::vector\u003cint\u003e\u0026 population,\n std::size_t count,\n unsigned seed) {\n std::vector\u003cint\u003e out;\n std::mt19937 rng(seed);\n std::sample(population.begin(), population.end(), std::back_inserter(out),\n count, rng);\n return out;\n}\n\n","golden_completion":"std::string describe_deterministic_sample() {\n return \"Selects up to count elements without replacement using std::sample \"\n \"and a std::mt19937 UniformRandomBitGenerator seeded by the caller. \"\n \"The selected elements are copied through std::back_inserter, so the \"\n \"population is not modified. For the same implementation and seed the \"\n \"result is deterministic, and the output size is min(count, n).\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e pop = {1, 2, 3, 4, 5, 6};\n auto a = deterministic_sample(pop, 3, 123);\n auto b = deterministic_sample(pop, 3, 123);\n assert(a == b);\n assert(a.size() == 3);\n assert(pop.size() == 6);\n assert(!describe_deterministic_sample().empty());\n}\n","assertions":"{\nstd::string d = describe_deterministic_sample();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::sample\"));\nassert(has(\"std::mt19937\"));\nassert(has(\"UniformRandomBitGenerator\"));\nassert(has(\"without replacement\"));\nassert(has(\"std::back_inserter\"));\nassert(has(\"not modified\") || has(\"not mutate\"));\nassert(has(\"deterministic\"));\nassert(has(\"min(count, n)\") || has(\"min(count\"));\n}\n","category":"code2NL_NL2code"} {"id":"5","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n\nstd::size_t erase_closed_value_range(std::vector\u003cint\u003e\u0026 sorted, int low, int high) {\n auto first = std::lower_bound(sorted.begin(), sorted.end(), low);\n auto last = std::upper_bound(sorted.begin(), sorted.end(), high);\n std::size_t removed = static_cast\u003cstd::size_t\u003e(std::distance(first, last));\n sorted.erase(first, last);\n return removed;\n}\n\n","golden_completion":"std::string describe_erase_closed_value_range() {\n return \"For a sorted vector, finds a closed value range with std::lower_bound \"\n \"and std::upper_bound, then erases the half-open iterator range \"\n \"[first, last). low is included, high is included via upper_bound, \"\n \"and vector::erase shifts following elements and invalidates iterators \"\n \"at or after the erase point. Searching is O(log n) but erasing is O(n).\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e v = {1, 2, 2, 3, 4, 4, 5};\n assert(erase_closed_value_range(v, 2, 4) == 5);\n assert((v == std::vector\u003cint\u003e{1, 5}));\n assert(!describe_erase_closed_value_range().empty());\n}\n","assertions":"{\nstd::string d = describe_erase_closed_value_range();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::lower_bound\"));\nassert(has(\"std::upper_bound\"));\nassert(has(\"sorted\"));\nassert(has(\"closed value range\") || has(\"low is included\"));\nassert(has(\"half-open\") || has(\"[first, last)\"));\nassert(has(\"vector::erase\"));\nassert(has(\"invalidates iterators\") || has(\"invalidates\"));\nassert(has(\"O(log\") \u0026\u0026 has(\"O(n\"));\n}\n","category":"code2NL_NL2code"} {"id":"6","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003cutility\u003e\n\nvoid stable_sort_by_score(std::vector\u003cstd::pair\u003cint, std::string\u003e\u003e\u0026 rows) {\n std::stable_sort(rows.begin(), rows.end(),\n [](const auto\u0026 a, const auto\u0026 b) {\n return a.first \u003c b.first;\n });\n}\n\n","golden_completion":"std::string describe_stable_sort_by_score() {\n return \"Sorts the vector in place with std::stable_sort using a comparator \"\n \"that compares only pair.first. Rows with equal scores preserve their \"\n \"original relative order, pair.second is not part of the ordering key, \"\n \"and the algorithm has O(n log n) comparisons while mutating the input.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cstd::pair\u003cint, std::string\u003e\u003e rows = {{2, \"b\"}, {1, \"x\"}, {2, \"a\"}};\n stable_sort_by_score(rows);\n assert(rows[0].second == \"x\");\n assert(rows[1].second == \"b\");\n assert(rows[2].second == \"a\");\n assert(!describe_stable_sort_by_score().empty());\n}\n","assertions":"{\nstd::string d = describe_stable_sort_by_score();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::stable_sort\"));\nassert(has(\"comparator\"));\nassert(has(\"pair.first\"));\nassert(has(\"pair.second\") \u0026\u0026 (has(\"not part\") || has(\"ignored\")));\nassert(has(\"relative order\") || has(\"original order\"));\nassert(has(\"equal scores\") || has(\"equal keys\"));\nassert(has(\"in place\") || has(\"mutating\") || has(\"mutates\"));\nassert(has(\"O(n log n)\"));\n}\n","category":"code2NL_NL2code"} {"id":"7","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cnumeric\u003e\n#include \u003citerator\u003e\n\nstd::vector\u003cint\u003e exclusive_square_offsets(const std::vector\u003cint\u003e\u0026 values) {\n std::vector\u003cint\u003e out(values.size());\n std::transform_exclusive_scan(values.begin(), values.end(), out.begin(),\n 0, std::plus\u003cint\u003e{},\n [](int x) { return x * x; });\n return out;\n}\n\n","golden_completion":"std::string describe_exclusive_square_offsets() {\n return \"Uses std::transform_exclusive_scan: each input is first transformed \"\n \"by squaring, then combined by std::plus, but each output position \"\n \"contains the sum before the current transformed element. The first \"\n \"output is the initial value 0, the source is not modified, and the \"\n \"operation performs O(n) applications of the unary and binary ops.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e v = {2, 3, 4};\n auto out = exclusive_square_offsets(v);\n assert((out == std::vector\u003cint\u003e{0, 4, 13}));\n assert(v[0] == 2);\n assert(!describe_exclusive_square_offsets().empty());\n}\n","assertions":"{\nstd::string d = describe_exclusive_square_offsets();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::transform_exclusive_scan\"));\nassert(has(\"squaring\") || has(\"squared\"));\nassert(has(\"std::plus\"));\nassert(has(\"before the current\") || has(\"excludes the current\"));\nassert(has(\"first output\") \u0026\u0026 has(\"0\"));\nassert(has(\"not modified\") || has(\"not mutate\"));\nassert(has(\"unary\") \u0026\u0026 has(\"binary\"));\nassert(has(\"O(n\"));\n}\n","category":"code2NL_NL2code"} {"id":"8","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003citerator\u003e\n\nstd::vector\u003cint\u003e rotate_copy_from_index(const std::vector\u003cint\u003e\u0026 values,\n std::size_t index) {\n std::vector\u003cint\u003e out;\n if (values.empty()) return out;\n index %= values.size();\n std::rotate_copy(values.begin(), values.begin() + index, values.end(),\n std::back_inserter(out));\n return out;\n}\n\n","golden_completion":"std::string describe_rotate_copy_from_index() {\n return \"Builds a rotated copy with std::rotate_copy, writing through \"\n \"std::back_inserter and does not modify the input. The element at \"\n \"values.begin()+index becomes the first output element, followed by \"\n \"[middle, end) and then [begin, middle). The index is reduced modulo \"\n \"the vector size, and exactly n elements are copied.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e v = {10, 20, 30, 40};\n auto out = rotate_copy_from_index(v, 6);\n assert((out == std::vector\u003cint\u003e{30, 40, 10, 20}));\n assert(v[0] == 10);\n assert(!describe_rotate_copy_from_index().empty());\n}\n","assertions":"{\nstd::string d = describe_rotate_copy_from_index();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::rotate_copy\"));\nassert(has(\"std::back_inserter\"));\nassert(has(\"not modifying\") || has(\"not modified\") || has(\"does not modify\"));\nassert(has(\"values.begin()+index\") || has(\"middle\"));\nassert(has(\"[middle, end)\") || has(\"[middle,end)\"));\nassert(has(\"[begin, middle)\") || has(\"[begin,middle)\"));\nassert(has(\"modulo\"));\nassert(has(\"exactly n\") || has(\"n elements\"));\n}\n","category":"code2NL_NL2code"} {"id":"9","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\n\nint add_or_create_count(std::map\u003cstd::string, int\u003e\u0026 counts,\n const std::string\u0026 key,\n int delta) {\n auto [it, inserted] = counts.try_emplace(key, 0);\n it-\u003esecond += delta;\n return inserted ? 0 : it-\u003esecond - delta;\n}\n\n","golden_completion":"std::string describe_add_or_create_count() {\n return \"Uses std::map::try_emplace to create a missing key with mapped value \"\n \"0 without overwriting an existing mapped value. The returned pair is \"\n \"an iterator and bool insertion flag; the iterator is then used to add \"\n \"delta. Because this is std::map, lookup/insertion is ordered-tree \"\n \"O(log n) and keys remain sorted by std::less.\";\n}\n","suffix":"\nint main() {\n std::map\u003cstd::string, int\u003e counts = {{\"pear\", 4}};\n assert(add_or_create_count(counts, \"apple\", 3) == 0);\n assert(counts[\"apple\"] == 3);\n assert(add_or_create_count(counts, \"pear\", 2) == 4);\n assert(counts[\"pear\"] == 6);\n assert(!describe_add_or_create_count().empty());\n}\n","assertions":"{\nstd::string d = describe_add_or_create_count();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::map::try_emplace\"));\nassert(has(\"missing key\") || has(\"absent key\"));\nassert(has(\"without overwriting\") || has(\"no overwrite\"));\nassert(has(\"iterator\") \u0026\u0026 has(\"bool\"));\nassert(has(\"insertion flag\") || has(\"inserted\"));\nassert(has(\"O(log n)\"));\nassert(has(\"std::less\") || has(\"sorted\"));\n}\n","category":"code2NL_NL2code"} {"id":"10","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cunordered_map\u003e\n\nstd::unordered_map\u003cstd::string, int\u003e\ncount_words_reserved(const std::vector\u003cstd::string\u003e\u0026 words, std::size_t expected) {\n std::unordered_map\u003cstd::string, int\u003e counts;\n counts.reserve(expected);\n for (const auto\u0026 word : words) {\n ++counts[word];\n }\n return counts;\n}\n\n","golden_completion":"std::string describe_count_words_reserved() {\n return \"Counts words in a std::unordered_map after calling reserve(expected) \"\n \"to request enough buckets and reduce rehashing. operator[] inserts \"\n \"a missing string key with a value-initialized int of 0 before the \"\n \"preincrement. Average lookup/update is O(1), iteration order is \"\n \"unspecified, and performance depends on hash buckets and load factor.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cstd::string\u003e words = {\"red\", \"blue\", \"red\"};\n auto counts = count_words_reserved(words, 8);\n assert(counts[\"red\"] == 2);\n assert(counts[\"blue\"] == 1);\n assert(!describe_count_words_reserved().empty());\n}\n","assertions":"{\nstd::string d = describe_count_words_reserved();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::unordered_map\"));\nassert(has(\"reserve(expected)\") || has(\"reserve\"));\nassert(has(\"rehashing\") || has(\"rehash\"));\nassert(has(\"operator[]\"));\nassert(has(\"value-initialized\") || has(\"value initialized\"));\nassert(has(\"0 before\") || has(\"int of 0\"));\nassert(has(\"O(1)\"));\nassert(has(\"load factor\") || has(\"buckets\"));\n}\n","category":"code2NL_NL2code"} {"id":"11","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cset\u003e\n\nvoid merge_unique_nodes(std::set\u003cint\u003e\u0026 destination, std::set\u003cint\u003e\u0026 source) {\n destination.merge(source);\n}\n\n","golden_completion":"std::string describe_merge_unique_nodes() {\n return \"Transfers nodes with std::set::merge from source into destination. \"\n \"Elements whose keys are not already present move without copying or \"\n \"moving the stored int values, while duplicates remain in the source. \"\n \"Both containers stay ordered, iterators/references to transferred \"\n \"nodes remain valid but now refer into destination, and source is mutated.\";\n}\n","suffix":"\nint main() {\n std::set\u003cint\u003e dst = {1, 3};\n std::set\u003cint\u003e src = {2, 3, 4};\n merge_unique_nodes(dst, src);\n assert((dst == std::set\u003cint\u003e{1, 2, 3, 4}));\n assert((src == std::set\u003cint\u003e{3}));\n assert(!describe_merge_unique_nodes().empty());\n}\n","assertions":"{\nstd::string d = describe_merge_unique_nodes();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::set::merge\"));\nassert(has(\"nodes\"));\nassert(has(\"without copying\") || has(\"without copy\"));\nassert(has(\"duplicates remain\") || has(\"remain in the source\"));\nassert(has(\"source is mutated\") || has(\"mutates source\"));\nassert(has(\"ordered\"));\nassert(has(\"iterators\") \u0026\u0026 has(\"references\"));\n}\n","category":"code2NL_NL2code"} {"id":"12","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003clist\u003e\n#include \u003cvector\u003e\n\nvoid splice_all_to_front(std::list\u003cint\u003e\u0026 destination, std::list\u003cint\u003e\u0026 source) {\n destination.splice(destination.begin(), source);\n}\n\nstd::vector\u003cint\u003e as_vector(const std::list\u003cint\u003e\u0026 xs) {\n return std::vector\u003cint\u003e(xs.begin(), xs.end());\n}\n\n","golden_completion":"std::string describe_splice_all_to_front() {\n return \"Moves all nodes from source to the front of destination with \"\n \"std::list::splice. This relinks existing list nodes in O(1) time for \"\n \"the whole-list overload, performs no element copy or allocation, \"\n \"leaves source empty, and keeps iterators/references to moved elements \"\n \"valid while making them refer to destination.\";\n}\n","suffix":"\nint main() {\n std::list\u003cint\u003e dst = {3, 4};\n std::list\u003cint\u003e src = {1, 2};\n splice_all_to_front(dst, src);\n assert((as_vector(dst) == std::vector\u003cint\u003e{1, 2, 3, 4}));\n assert(src.empty());\n assert(!describe_splice_all_to_front().empty());\n}\n","assertions":"{\nstd::string d = describe_splice_all_to_front();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::list::splice\"));\nassert(has(\"nodes\"));\nassert(has(\"O(1)\") || has(\"constant time\"));\nassert(has(\"no element copy\") || has(\"no copy\"));\nassert(has(\"allocation\") || has(\"allocating\"));\nassert(has(\"source empty\") || has(\"leaves source empty\"));\nassert(has(\"iterators\") \u0026\u0026 has(\"references\"));\nassert(has(\"destination\"));\n}\n","category":"code2NL_NL2code"} {"id":"13","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmemory\u003e\n\nint replace_unique_value(std::unique_ptr\u003cint\u003e\u0026 ptr, int new_value) {\n int* raw = ptr.release();\n int old_value = *raw;\n delete raw;\n ptr.reset(new int(new_value));\n return old_value;\n}\n\n","golden_completion":"std::string describe_replace_unique_value() {\n return \"Uses std::unique_ptr::release to give up ownership and return the \"\n \"raw pointer without deleting it, leaving the unique_ptr empty. The \"\n \"raw pointer is manually deleted, then std::unique_ptr::reset takes \"\n \"ownership of a newly allocated int. The function preserves unique \"\n \"ownership and returns the old pointed-to value.\";\n}\n","suffix":"\nint main() {\n auto p = std::make_unique\u003cint\u003e(5);\n assert(replace_unique_value(p, 9) == 5);\n assert(p \u0026\u0026 *p == 9);\n assert(!describe_replace_unique_value().empty());\n}\n","assertions":"{\nstd::string d = describe_replace_unique_value();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::unique_ptr::release\"));\nassert(has(\"raw pointer\"));\nassert(has(\"without deleting\") || has(\"does not delete\"));\nassert(has(\"empty\") || has(\"nullptr\"));\nassert(has(\"manually deleted\") || has(\"delete raw\"));\nassert(has(\"std::unique_ptr::reset\"));\nassert(has(\"takes ownership\"));\nassert(has(\"unique ownership\"));\n}\n","category":"code2NL_NL2code"} {"id":"14","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmemory\u003e\n\nstruct ScoreBox {\n int score;\n int penalty;\n};\n\nstd::shared_ptr\u003cint\u003e alias_score(const std::shared_ptr\u003cScoreBox\u003e\u0026 owner) {\n return std::shared_ptr\u003cint\u003e(owner, \u0026owner-\u003escore);\n}\n\n","golden_completion":"std::string describe_alias_score() {\n return \"Creates an aliasing std::shared_ptr\u003cint\u003e that shares the control block \"\n \"and reference count of the owning std::shared_ptr\u003cScoreBox\u003e while \"\n \"storing a pointer to the score subobject. The ScoreBox lifetime is \"\n \"kept alive by the alias, the int subobject is not deleted separately, \"\n \"and use_count reflects shared ownership of the same control block.\";\n}\n","suffix":"\nint main() {\n auto owner = std::make_shared\u003cScoreBox\u003e(ScoreBox{42, 7});\n auto score = alias_score(owner);\n assert(*score == 42);\n owner.reset();\n assert(*score == 42);\n *score = 50;\n assert(!describe_alias_score().empty());\n}\n","assertions":"{\nstd::string d = describe_alias_score();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"aliasing\"));\nassert(has(\"std::shared_ptr\u003cint\u003e\"));\nassert(has(\"control block\"));\nassert(has(\"reference count\") || has(\"use_count\"));\nassert(has(\"score subobject\") || has(\"subobject\"));\nassert(has(\"ScoreBox lifetime\") || has(\"kept alive\"));\nassert(has(\"not deleted separately\"));\nassert(has(\"same control block\"));\n}\n","category":"code2NL_NL2code"} {"id":"15","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003coptional\u003e\n\nint counted_default(int\u0026 calls) {\n ++calls;\n return 99;\n}\n\nint value_or_counted_default(std::optional\u003cint\u003e value, int\u0026 calls) {\n return value.value_or(counted_default(calls));\n}\n\n","golden_completion":"std::string describe_value_or_counted_default() {\n return \"Returns value.value_or(counted_default(calls)). The fallback argument \"\n \"is evaluated before std::optional::value_or is called, so calls is \"\n \"incremented even when the optional already contains a value. value_or \"\n \"returns the contained value or the provided default by value, does not \"\n \"modify the optional, and does not throw std::bad_optional_access.\";\n}\n","suffix":"\nint main() {\n int calls = 0;\n assert(value_or_counted_default(std::optional\u003cint\u003e{7}, calls) == 7);\n assert(calls == 1);\n assert(value_or_counted_default(std::optional\u003cint\u003e{}, calls) == 99);\n assert(calls == 2);\n assert(!describe_value_or_counted_default().empty());\n}\n","assertions":"{\nstd::string d = describe_value_or_counted_default();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::optional::value_or\"));\nassert(has(\"fallback argument\") || has(\"provided default\"));\nassert(has(\"evaluated before\") || has(\"eager\"));\nassert(has(\"even when the optional already contains\") || has(\"already contains\"));\nassert(has(\"by value\"));\nassert(has(\"does not modify\"));\nassert(has(\"does not throw\"));\nassert(has(\"std::bad_optional_access\"));\n}\n","category":"code2NL_NL2code"} {"id":"16","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cany\u003e\n#include \u003ccassert\u003e\n#include \u003cstring\u003e\n\nstd::string bump_if_int(std::any\u0026 value) {\n if (int* p = std::any_cast\u003cint\u003e(\u0026value)) {\n ++(*p);\n return \"int\";\n }\n return \"other\";\n}\n\n","golden_completion":"std::string describe_bump_if_int() {\n return \"Uses the pointer overload std::any_cast\u003cint\u003e(\u0026value), which returns \"\n \"a pointer to the contained int on an exact type match and nullptr on \"\n \"a mismatch instead of throwing. The returned pointer is mutable here, \"\n \"so the contained int is incremented in place. The throwing \"\n \"std::bad_any_cast behavior belongs to the value/reference overloads.\";\n}\n","suffix":"\nint main() {\n std::any a = 4;\n assert(bump_if_int(a) == \"int\");\n assert(std::any_cast\u003cint\u003e(a) == 5);\n std::any b = std::string(\"4\");\n assert(bump_if_int(b) == \"other\");\n assert(!describe_bump_if_int().empty());\n}\n","assertions":"{\nstd::string d = describe_bump_if_int();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::any_cast\u003cint\u003e(\u0026value)\") || has(\"std::any_cast\u003cint\u003e\"));\nassert(has(\"pointer overload\"));\nassert(has(\"exact type match\"));\nassert(has(\"nullptr\"));\nassert(has(\"instead of throwing\") || has(\"does not throw\"));\nassert(has(\"mutable\"));\nassert(has(\"in place\") || has(\"contained int\"));\nassert(has(\"std::bad_any_cast\"));\n}\n","category":"code2NL_NL2code"} {"id":"17","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvariant\u003e\n#include \u003ctype_traits\u003e\n\nusing Metric = std::variant\u003cint, double, std::string\u003e;\n\nstd::string metric_tag(const Metric\u0026 metric) {\n return std::visit([](const auto\u0026 value) -\u003e std::string {\n using T = std::decay_t\u003cdecltype(value)\u003e;\n if constexpr (std::is_same_v\u003cT, int\u003e) {\n return \"int\";\n } else if constexpr (std::is_same_v\u003cT, double\u003e) {\n return \"double\";\n } else {\n return \"string\";\n }\n }, metric);\n}\n\n","golden_completion":"std::string describe_metric_tag() {\n return \"Dispatches on the active alternative of a std::variant with \"\n \"std::visit. A generic lambda receives the held value, if constexpr \"\n \"selects the branch at compile time from the decayed type, and every \"\n \"alternative returns the same std::string result type. No manual index \"\n \"switch is used; the visitor must be valid for all alternatives.\";\n}\n","suffix":"\nint main() {\n assert(metric_tag(Metric{3}) == \"int\");\n assert(metric_tag(Metric{2.5}) == \"double\");\n assert(metric_tag(Metric{std::string(\"x\")}) == \"string\");\n assert(!describe_metric_tag().empty());\n}\n","assertions":"{\nstd::string d = describe_metric_tag();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::variant\"));\nassert(has(\"std::visit\"));\nassert(has(\"active alternative\"));\nassert(has(\"generic lambda\"));\nassert(has(\"if constexpr\"));\nassert(has(\"decayed type\") || has(\"std::decay_t\"));\nassert(has(\"same std::string result type\") || has(\"same result type\"));\nassert(has(\"valid for all alternatives\") || has(\"all alternatives\"));\n}\n","category":"code2NL_NL2code"} {"id":"18","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cstring_view\u003e\n\nstd::string_view trim_marker_view(std::string_view text) {\n if (!text.empty() \u0026\u0026 text.front() == \u0027#\u0027) {\n text.remove_prefix(1);\n }\n if (!text.empty() \u0026\u0026 text.back() == \u0027!\u0027) {\n text.remove_suffix(1);\n }\n return text;\n}\n\n","golden_completion":"std::string describe_trim_marker_view() {\n return \"Trims marker characters by mutating only the std::string_view object: \"\n \"remove_prefix drops a leading # and remove_suffix drops a trailing !. \"\n \"The underlying string is not modified; this is a non-owning view, no allocation occurs, \"\n \"the operations are O(1), and callers must ensure the viewed storage \"\n \"outlives the returned non-null-terminated view.\";\n}\n","suffix":"\nint main() {\n std::string s = \"#hello!\";\n auto view = trim_marker_view(s);\n assert(view == \"hello\");\n assert(s == \"#hello!\");\n assert(!describe_trim_marker_view().empty());\n}\n","assertions":"{\nstd::string d = describe_trim_marker_view();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::string_view\"));\nassert(has(\"remove_prefix\"));\nassert(has(\"remove_suffix\"));\nassert(has(\"underlying string is not modified\") || has(\"not modified\"));\nassert(has(\"not owned\") || has(\"non-owning\"));\nassert(has(\"no allocation\"));\nassert(has(\"O(1)\"));\nassert(has(\"outlives\") || has(\"lifetime\"));\nassert(has(\"non-null-terminated\") || has(\"not null-terminated\"));\n}\n","category":"code2NL_NL2code"} {"id":"19","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003csstream\u003e\n\nstd::vector\u003cstd::string\u003e split_semicolon_fields(const std::string\u0026 text) {\n std::vector\u003cstd::string\u003e fields;\n std::istringstream input(text);\n std::string field;\n while (std::getline(input, field, \u0027;\u0027)) {\n fields.push_back(field);\n }\n return fields;\n}\n\n","golden_completion":"std::string describe_split_semicolon_fields() {\n return \"Tokenizes an std::istringstream with std::getline using \u0027;\u0027 as the \"\n \"delimiter. The delimiter is consumed and not stored in the field, \"\n \"characters are not trimmed, and adjacent delimiters produce an empty \"\n \"string field. Extraction stops when getline reaches end-of-file or \"\n \"sets the stream fail state.\";\n}\n","suffix":"\nint main() {\n auto fields = split_semicolon_fields(\"alpha;; beta;gamma\");\n assert((fields == std::vector\u003cstd::string\u003e{\"alpha\", \"\", \" beta\", \"gamma\"}));\n assert(!describe_split_semicolon_fields().empty());\n}\n","assertions":"{\nstd::string d = describe_split_semicolon_fields();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::istringstream\"));\nassert(has(\"std::getline\"));\nassert(has(\"\u0027;\u0027\") || has(\"semicolon\"));\nassert(has(\"delimiter is consumed\") || has(\"delimiter is discarded\"));\nassert(has(\"not stored\"));\nassert(has(\"not trimmed\") || has(\"not trim\"));\nassert(has(\"adjacent delimiters\") || has(\"consecutive delimiters\"));\nassert(has(\"empty string field\") || has(\"empty field\"));\nassert(has(\"end-of-file\") || has(\"fail state\"));\n}\n","category":"code2NL_NL2code"} {"id":"20","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003csstream\u003e\n#include \u003ciomanip\u003e\n\nstd::string format_fixed_cents(double value) {\n std::ostringstream out;\n out \u003c\u003c std::fixed \u003c\u003c std::setprecision(2) \u003c\u003c value;\n return out.str();\n}\n\n","golden_completion":"std::string describe_format_fixed_cents() {\n return \"Formats into an std::ostringstream using std::fixed and \"\n \"std::setprecision(2). With fixed notation, precision means exactly \"\n \"two digits after the decimal point, so the stream rounds as needed \"\n \"and pads trailing zeros. The manipulators affect this stream\u0027s \"\n \"format state and the function returns the accumulated string.\";\n}\n","suffix":"\nint main() {\n assert(format_fixed_cents(12.3) == \"12.30\");\n assert(format_fixed_cents(0.0) == \"0.00\");\n assert(!describe_format_fixed_cents().empty());\n}\n","assertions":"{\nstd::string d = describe_format_fixed_cents();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::ostringstream\"));\nassert(has(\"std::fixed\"));\nassert(has(\"std::setprecision(2)\"));\nassert(has(\"fixed notation\") || has(\"fixed\"));\nassert(has(\"two digits after the decimal\"));\nassert(has(\"rounds\") || has(\"rounded\"));\nassert(has(\"trailing zeros\") || has(\"pads\"));\nassert(has(\"format state\"));\n}\n","category":"code2NL_NL2code"} {"id":"21","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmutex\u003e\n\nstruct Wallets {\n int left;\n int right;\n std::mutex left_mutex;\n std::mutex right_mutex;\n};\n\nvoid transfer_with_scoped_lock(Wallets\u0026 wallets, int amount) {\n std::scoped_lock lock(wallets.left_mutex, wallets.right_mutex);\n wallets.left -= amount;\n wallets.right += amount;\n}\n\n","golden_completion":"std::string describe_transfer_with_scoped_lock() {\n return \"Locks both wallet mutexes with C++17 std::scoped_lock before moving \"\n \"the amount. scoped_lock uses deadlock-avoidance for multiple mutexes, \"\n \"acquires them in its constructor, and releases them by RAII in its \"\n \"destructor when the scope exits, including exceptional exits. The \"\n \"protected mutation updates both balances while the locks are held.\";\n}\n","suffix":"\nint main() {\n Wallets wallets{10, 1};\n transfer_with_scoped_lock(wallets, 4);\n assert(wallets.left == 6);\n assert(wallets.right == 5);\n assert(!describe_transfer_with_scoped_lock().empty());\n}\n","assertions":"{\nstd::string d = describe_transfer_with_scoped_lock();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::scoped_lock\"));\nassert(has(\"C++17\"));\nassert(has(\"both\") \u0026\u0026 has(\"mutexes\"));\nassert(has(\"deadlock-avoidance\") || has(\"deadlock avoidance\"));\nassert(has(\"constructor\"));\nassert(has(\"RAII\"));\nassert(has(\"destructor\"));\nassert(has(\"exceptional exits\") || has(\"scope exits\"));\nassert(has(\"while the locks are held\"));\n}\n","category":"code2NL_NL2code"} {"id":"22","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmutex\u003e\n\nbool deferred_unique_lock_transition(std::mutex\u0026 mutex) {\n std::unique_lock\u003cstd::mutex\u003e lock(mutex, std::defer_lock);\n bool before = lock.owns_lock();\n lock.lock();\n bool after = lock.owns_lock();\n lock.unlock();\n return !before \u0026\u0026 after \u0026\u0026 !lock.owns_lock();\n}\n\n","golden_completion":"std::string describe_deferred_unique_lock_transition() {\n return \"Constructs a movable std::unique_lock with std::defer_lock, so the \"\n \"mutex is not locked at construction and owns_lock is initially false. \"\n \"Calling lock() acquires the mutex and makes owns_lock true; calling \"\n \"unlock() releases it and makes owns_lock false again. unique_lock is \"\n \"movable but not copyable and normally unlocks in its destructor if owned.\";\n}\n","suffix":"\nint main() {\n std::mutex mutex;\n assert(deferred_unique_lock_transition(mutex));\n assert(!describe_deferred_unique_lock_transition().empty());\n}\n","assertions":"{\nstd::string d = describe_deferred_unique_lock_transition();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::unique_lock\"));\nassert(has(\"std::defer_lock\"));\nassert(has(\"not locked at construction\") || has(\"does not lock\"));\nassert(has(\"owns_lock\"));\nassert(has(\"initially false\") || has(\"false\"));\nassert(has(\"lock()\") \u0026\u0026 has(\"true\"));\nassert(has(\"unlock()\") \u0026\u0026 has(\"false again\"));\nassert(has(\"movable\") \u0026\u0026 has(\"not copyable\"));\nassert(has(\"destructor\"));\n}\n","category":"code2NL_NL2code"} {"id":"23","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cfuture\u003e\n\nstd::future\u003cint\u003e make_ready_future(int value) {\n std::promise\u003cint\u003e promise;\n auto future = promise.get_future();\n promise.set_value(value);\n return future;\n}\n\n","golden_completion":"std::string describe_make_ready_future() {\n return \"Creates a std::promise\u003cint\u003e, obtains its associated std::future with \"\n \"get_future, then makes the shared state ready with set_value before \"\n \"returning the future. future::get retrieves that value, blocks until \"\n \"ready if necessary, and is single-use: after get the future is no \"\n \"longer valid and a second get would throw std::future_error.\";\n}\n","suffix":"\nint main() {\n auto future = make_ready_future(31);\n assert(future.valid());\n assert(future.get() == 31);\n assert(!future.valid());\n assert(!describe_make_ready_future().empty());\n}\n","assertions":"{\nstd::string d = describe_make_ready_future();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::promise\u003cint\u003e\"));\nassert(has(\"std::future\"));\nassert(has(\"get_future\"));\nassert(has(\"set_value\"));\nassert(has(\"shared state\"));\nassert(has(\"ready\"));\nassert(has(\"future::get\"));\nassert(has(\"single-use\") || has(\"single use\"));\nassert(has(\"std::future_error\"));\n}\n","category":"code2NL_NL2code"} {"id":"24","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cregex\u003e\n\nstd::vector\u003cstd::string\u003e full_match_groups(const std::string\u0026 text,\n const std::regex\u0026 pattern) {\n std::smatch match;\n if (!std::regex_match(text, match, pattern)) {\n return {};\n }\n std::vector\u003cstd::string\u003e groups;\n for (const auto\u0026 part : match) {\n groups.push_back(part.str());\n }\n return groups;\n}\n\n","golden_completion":"std::string describe_full_match_groups() {\n return \"Uses std::regex_match, so the entire input sequence must match the \"\n \"regular expression; unlike std::regex_search, a substring match is \"\n \"not enough. The std::smatch stores sub_match entries where group 0 is \"\n \"the whole match and later entries are capture groups. On failure the \"\n \"function returns an empty vector.\";\n}\n","suffix":"\nint main() {\n std::regex re(\"([A-Z]+)-(\\\\d+)\");\n auto groups = full_match_groups(\"ABC-42\", re);\n assert((groups == std::vector\u003cstd::string\u003e{\"ABC-42\", \"ABC\", \"42\"}));\n assert(full_match_groups(\"xABC-42y\", re).empty());\n assert(!describe_full_match_groups().empty());\n}\n","assertions":"{\nstd::string d = describe_full_match_groups();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::regex_match\"));\nassert(has(\"entire input\") || has(\"entire sequence\"));\nassert(has(\"std::regex_search\"));\nassert(has(\"substring match\") || has(\"not enough\"));\nassert(has(\"std::smatch\"));\nassert(has(\"sub_match\"));\nassert(has(\"group 0\") || has(\"whole match\"));\nassert(has(\"capture groups\"));\nassert(has(\"empty vector\"));\n}\n","category":"code2NL_NL2code"} {"id":"25","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cqueue\u003e\n#include \u003cvector\u003e\n\nint take_priority_top(std::priority_queue\u003cint\u003e\u0026 queue) {\n int value = queue.top();\n queue.pop();\n return value;\n}\n\n","golden_completion":"std::string describe_take_priority_top() {\n return \"Reads the largest element from the default std::priority_queue\u003cint\u003e \"\n \"with top(), then removes it with pop() and returns the saved value. \"\n \"The default comparator is std::less, making it a max-heap adapter over \"\n \"an underlying container. top() is O(1), pop() returns void, mutates \"\n \"the queue, and reheapifies in O(log n).\";\n}\n","suffix":"\nint main() {\n std::priority_queue\u003cint\u003e q;\n q.push(4);\n q.push(9);\n q.push(1);\n assert(take_priority_top(q) == 9);\n assert(q.top() == 4);\n assert(!describe_take_priority_top().empty());\n}\n","assertions":"{\nstd::string d = describe_take_priority_top();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::priority_queue\u003cint\u003e\"));\nassert(has(\"top()\"));\nassert(has(\"pop()\"));\nassert(has(\"std::less\"));\nassert(has(\"max-heap\"));\nassert(has(\"adapter\") || has(\"underlying container\"));\nassert(has(\"top() is O(1)\") || has(\"O(1)\"));\nassert(has(\"pop() returns void\") || has(\"returns void\"));\nassert(has(\"O(log n)\"));\n}\n","category":"code2NL_NL2code"} {"id":"26","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cnumeric\u003e\n\nstd::string join_with_slashes(const std::vector\u003cstd::string\u003e\u0026 parts) {\n if (parts.empty()) {\n return \"\";\n }\n return std::accumulate(std::next(parts.begin()), parts.end(), parts.front(),\n [](std::string acc, const std::string\u0026 part) {\n return acc + \"/\" + part;\n });\n}\n\n","golden_completion":"std::string describe_join_with_slashes() {\n return \"Joins strings with std::accumulate as a left fold. The initial value \"\n \"is parts.front(), so the accumulator type is std::string and no slash \"\n \"is added before the first element; the binary operation is called once \"\n \"for each remaining element in order. Empty input returns an empty \"\n \"string, and repeated string concatenation can make the total cost quadratic.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cstd::string\u003e parts = {\"usr\", \"local\", \"bin\"};\n assert(join_with_slashes(parts) == \"usr/local/bin\");\n assert(join_with_slashes({}) == \"\");\n assert(!describe_join_with_slashes().empty());\n}\n","assertions":"{\nstd::string d = describe_join_with_slashes();\nauto has = [\u0026](const std::string\u0026 s) { return d.find(s) != std::string::npos; };\nassert(has(\"std::accumulate\"));\nassert(has(\"left fold\"));\nassert(has(\"initial value\") \u0026\u0026 has(\"parts.front()\"));\nassert(has(\"accumulator type\") \u0026\u0026 has(\"std::string\"));\nassert(has(\"no slash\") \u0026\u0026 has(\"first element\"));\nassert(has(\"once for each remaining element\") || has(\"remaining element\"));\nassert(has(\"in order\"));\nassert(has(\"quadratic\"));\n}\n","category":"code2NL_NL2code"} {"id":"27","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\nbool is_permutation_check(const std::vector\u003cint\u003e\u0026 a,\n const std::vector\u003cint\u003e\u0026 b) {\n return std::is_permutation(a.begin(), a.end(), b.begin(), b.end());\n}\n\nstd::string describe_is_permutation_check() {\n","golden_completion":" return \"Checks whether one vector is a permutation of the other using \"\n \"std::is_permutation. This performs a multiset equality comparison: \"\n \"both vectors must contain exactly the same elements with the \"\n \"same multiplicities, regardless of order. The algorithm has \"\n \"O(n-squared) worst-case complexity because it counts element \"\n \"occurrences by nested iteration.\";\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e a = {1, 2, 3, 4};\n std::vector\u003cint\u003e b = {4, 3, 2, 1};\n assert(is_permutation_check(a, b) == true);\n\n std::vector\u003cint\u003e c = {1, 2, 3, 5};\n assert(is_permutation_check(a, c) == false);\n\n std::string doc = describe_is_permutation_check();\n assert(doc.size() \u003e 10);\n return 0;\n}\n","assertions":"\n std::string d = describe_is_permutation_check();\n std::string dl;\n for (char c : d) dl += std::tolower(c);\n assert((dl.find(\"is_permutation\") != std::string::npos || dl.find(\"is permutation\") != std::string::npos) \u0026\u0026 \"must mention is_permutation\");\n assert((dl.find(\"n\") != std::string::npos \u0026\u0026 (dl.find(\"square\") != std::string::npos || dl.find(\"quadratic\") != std::string::npos || dl.find(\"n^2\") != std::string::npos || dl.find(\"n2\") != std::string::npos || dl.find(\"n*n\") != std::string::npos)) \u0026\u0026 \"must mention O(n^2) worst case complexity\");\n assert((dl.find(\"multiset\") != std::string::npos || dl.find(\"multiplicit\") != std::string::npos || dl.find(\"count\") != std::string::npos || dl.find(\"same elements\") != std::string::npos || dl.find(\"same number\") != std::string::npos) \u0026\u0026 \"must mention multiset/multiplicity comparison\");\n","category":"code2NL_NL2code"} {"id":"28","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n\n/**\n * @brief Checks if a string is a valid IPv4 address.\n *\n * A valid IPv4 address consists of exactly 4 decimal octets separated by\n * dots. Each octet is an integer in the range [0, 255] with no leading\n * zeros (except the single digit \"0\" itself). The string must contain no\n * whitespace, no trailing dots, and no extra characters.\n *\n * @param s The string to validate.\n * @return true if s is a valid IPv4 address, false otherwise.\n */\nbool is_valid_ipv4(const std::string\u0026 s) {\n","golden_completion":" std::istringstream iss(s);\n std::string octet;\n int count = 0;\n while (std::getline(iss, octet, \u0027.\u0027)) {\n count++;\n if (count \u003e 4 || octet.empty() || octet.size() \u003e 3) return false;\n if (octet.size() \u003e 1 \u0026\u0026 octet[0] == \u00270\u0027) return false; // leading zero\n for (char c : octet) if (c \u003c \u00270\u0027 || c \u003e \u00279\u0027) return false;\n int val = std::stoi(octet);\n if (val \u003c 0 || val \u003e 255) return false;\n }\n return count == 4 \u0026\u0026 s.back() != \u0027.\u0027;\n","suffix":"}\n\nint main() {\n assert(is_valid_ipv4(\"192.168.1.1\") == true);\n assert(is_valid_ipv4(\"255.255.255.255\") == true);\n assert(is_valid_ipv4(\"0.0.0.0\") == true);\n assert(is_valid_ipv4(\"256.1.1.1\") == false);\n assert(is_valid_ipv4(\"1.2.3\") == false);\n return 0;\n}\n","assertions":"\n assert(is_valid_ipv4(\"01.01.01.01\") == false \u0026\u0026 \"leading zeros invalid\");\n assert(is_valid_ipv4(\"1.2.3.4.5\") == false \u0026\u0026 \"too many octets\");\n assert(is_valid_ipv4(\"\") == false \u0026\u0026 \"empty string\");\n assert(is_valid_ipv4(\"1.2.3.\") == false \u0026\u0026 \"trailing dot\");\n assert(is_valid_ipv4(\"1.2.3.4 \") == false \u0026\u0026 \"trailing space\");\n assert(is_valid_ipv4(\"1.2.3.04\") == false \u0026\u0026 \"leading zero in last octet\");\n assert(is_valid_ipv4(\"00.0.0.0\") == false \u0026\u0026 \"leading zero 00\");\n assert(is_valid_ipv4(\"1.2.3.256\") == false \u0026\u0026 \"octet \u003e 255\");\n assert(is_valid_ipv4(\"10.0.0.1\") == true);\n assert(is_valid_ipv4(\"0.0.0.0\") == true);\n","category":"code2NL_NL2code"} {"id":"29","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cunordered_map\u003e\n#include \u003ccassert\u003e\n\n/**\n * @brief Converts a Roman numeral string to its integer value.\n *\n * Supports the standard Roman numerals: I(1), V(5), X(10), L(50),\n * C(100), D(500), M(1000). Uses the subtractive rule: when a smaller\n * value appears immediately before a larger value, it is subtracted\n * (e.g., IV=4, IX=9, XL=40, XC=90, CD=400, CM=900).\n *\n * Only uppercase letters are accepted. An empty string returns 0.\n *\n * @param s A string containing a valid Roman numeral.\n * @return The integer value of the Roman numeral.\n */\nint roman_to_int(const std::string\u0026 s) {\n","golden_completion":" std::unordered_map\u003cchar, int\u003e vals = {\n {\u0027I\u0027,1},{\u0027V\u0027,5},{\u0027X\u0027,10},{\u0027L\u0027,50},\n {\u0027C\u0027,100},{\u0027D\u0027,500},{\u0027M\u0027,1000}};\n int result = 0;\n for (int i = 0; i \u003c (int)s.size(); i++) {\n if (i + 1 \u003c (int)s.size() \u0026\u0026 vals[s[i]] \u003c vals[s[i+1]])\n result -= vals[s[i]];\n else\n result += vals[s[i]];\n }\n return result;\n","suffix":"}\n\nint main() {\n assert(roman_to_int(\"III\") == 3);\n assert(roman_to_int(\"IV\") == 4);\n assert(roman_to_int(\"IX\") == 9);\n assert(roman_to_int(\"XLII\") == 42);\n assert(roman_to_int(\"MCMXCIV\") == 1994);\n return 0;\n}\n","assertions":"\n assert(roman_to_int(\"\") == 0 \u0026\u0026 \"empty string returns 0\");\n assert(roman_to_int(\"MMMCMXCIX\") == 3999 \u0026\u0026 \"max standard value\");\n assert(roman_to_int(\"DCCCXC\") == 890);\n assert(roman_to_int(\"CDXLIV\") == 444);\n assert(roman_to_int(\"CM\") == 900);\n assert(roman_to_int(\"XC\") == 90);\n assert(roman_to_int(\"XL\") == 40);\n assert(roman_to_int(\"CD\") == 400);\n assert(roman_to_int(\"M\") == 1000);\n assert(roman_to_int(\"MMXXVI\") == 2026);\n","category":"code2NL_NL2code"} {"id":"30","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003cutility\u003e\n#include \u003calgorithm\u003e\n#include \u003ccassert\u003e\n\n/**\n * @brief Finds all unique pairs of values in a vector that sum to a target.\n *\n * Each pair is reported as (smaller, larger). Pairs are returned in\n * ascending order of the smaller element, then by the larger element.\n * Duplicate pairs are NOT included even if the same value appears\n * multiple times. For example, given {1,1,2,3} with target 4, the only\n * pair is (1,3) — not reported twice despite two 1s.\n *\n * A value may be paired with itself only if it appears at least twice\n * in the input. E.g., {2,2,2} with target 4 yields (2,2).\n *\n * @param nums The input vector of integers.\n * @param target The target sum.\n * @return A sorted vector of unique (smaller, larger) pairs.\n */\nstd::vector\u003cstd::pair\u003cint,int\u003e\u003e find_pairs_sum(const std::vector\u003cint\u003e\u0026 nums,\n int target) {\n","golden_completion":" auto sn = nums; std::sort(sn.begin(), sn.end());\n std::vector\u003cstd::pair\u003cint,int\u003e\u003e res;\n for (int lo = 0, hi = (int)sn.size()-1; lo \u003c hi; ) {\n int s = sn[lo] + sn[hi];\n if (s \u003c target) { lo++; continue; }\n if (s \u003e target) { hi--; continue; }\n res.push_back({sn[lo], sn[hi]});\n while (lo \u003c hi \u0026\u0026 sn[lo] == res.back().first) lo++;\n while (lo \u003c hi \u0026\u0026 sn[hi] == res.back().second) hi--;\n }\n return res;\n","suffix":"}\n\nint main() {\n auto r1 = find_pairs_sum({1, 2, 3, 4, 5}, 6);\n assert(r1.size() == 2); // (1,5) and (2,4)\n assert(r1[0] == std::make_pair(1, 5));\n assert(r1[1] == std::make_pair(2, 4));\n\n auto r2 = find_pairs_sum({1, 1, 2, 3}, 4);\n assert(r2.size() == 1); // (1,3) only once\n return 0;\n}\n","assertions":"\n // self-pairing\n auto rr1 = find_pairs_sum({2, 2, 2}, 4);\n assert(rr1.size() == 1 \u0026\u0026 rr1[0] == std::make_pair(2, 2) \u0026\u0026 \"self-pair with duplicates\");\n\n // no pairs\n auto rr2 = find_pairs_sum({1, 2, 3}, 100);\n assert(rr2.empty() \u0026\u0026 \"no pairs exist\");\n\n // empty input\n auto rr3 = find_pairs_sum({}, 5);\n assert(rr3.empty() \u0026\u0026 \"empty input\");\n\n // negative numbers\n auto rr4 = find_pairs_sum({-3, -1, 0, 1, 3, 4}, 0);\n assert(rr4.size() == 2 \u0026\u0026 \"(-3,3) and (-1,1)\");\n assert(rr4[0] == std::make_pair(-3, 3));\n assert(rr4[1] == std::make_pair(-1, 1));\n\n // single pair not duplicated\n auto rr5 = find_pairs_sum({5, 5, 5, 5}, 10);\n assert(rr5.size() == 1 \u0026\u0026 rr5[0] == std::make_pair(5, 5) \u0026\u0026 \"only one (5,5)\");\n\n // sorted output order\n auto rr6 = find_pairs_sum({9, 1, 5, 3, 7}, 10);\n assert(rr6.size() == 2);\n assert(rr6[0] == std::make_pair(1, 9));\n assert(rr6[1] == std::make_pair(3, 7));\n","category":"code2NL_NL2code"} {"id":"31","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cqueue\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nint extract_max(std::priority_queue\u003cint\u003e\u0026 pq) {\n int val = pq.top();\n pq.pop();\n return val;\n}\n\n","golden_completion":"std::string describe_extract_max() {\n return \"Extracts and returns the maximum element from an std::priority_queue \"\n \"(which is a max-heap by default). Calls top() to read the largest \"\n \"element, then pop() to remove it. pop() itself returns void, so \"\n \"the two-step top-then-pop pattern is required. The extraction \"\n \"runs in O(log n) time due to heap re-balancing.\";\n}\n","suffix":"\nint main() {\n std::priority_queue\u003cint\u003e pq;\n pq.push(10);\n pq.push(30);\n pq.push(20);\n assert(extract_max(pq) == 30);\n assert(extract_max(pq) == 20);\n\n std::string doc = describe_extract_max();\n assert(doc.size() \u003e 20);\n return 0;\n}\n","assertions":" std::string d31 = describe_extract_max();\n // Convert to lowercase for comparison\n std::string d31l = d31;\n std::transform(d31l.begin(), d31l.end(), d31l.begin(), ::tolower);\n assert(d31l.find(\"max\") != std::string::npos || d31l.find(\"largest\") != std::string::npos);\n assert(d31l.find(\"top\") != std::string::npos);\n assert(d31l.find(\"pop\") != std::string::npos);\n assert(d31l.find(\"void\") != std::string::npos || (d31l.find(\"top\") != std::string::npos \u0026\u0026 d31l.find(\"pop\") != std::string::npos));\n assert(d31l.find(\"log\") != std::string::npos || d31l.find(\"logarithm\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"32","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nstd::map\u003cint,std::string\u003e::iterator insert_with_hint(\n std::map\u003cint,std::string\u003e\u0026 m, std::map\u003cint,std::string\u003e::iterator hint,\n int key, const std::string\u0026 value)\n{\n return m.emplace_hint(hint, key, value);\n}\n\n","golden_completion":"std::string describe_insert_with_hint() {\n return \"Inserts a key-value pair into an std::map using emplace_hint. \"\n \"When the hint iterator points to the position just after where the \"\n \"new element will be inserted, the operation runs in amortized O(1) \"\n \"time instead of O(log n). Returns an iterator to the inserted element, \"\n \"or to the existing element if the key was already present (no \"\n \"overwrite occurs). The hint must be a valid iterator into the same map.\";\n}\n","suffix":"\nint main() {\n std::map\u003cint,std::string\u003e m;\n m[1] = \"one\";\n m[3] = \"three\";\n auto hint = m.find(3);\n auto it = insert_with_hint(m, hint, 2, \"two\");\n assert(it-\u003esecond == \"two\");\n assert(m.size() == 3);\n\n // Inserting duplicate key returns existing\n auto it2 = insert_with_hint(m, m.end(), 2, \"TWO\");\n assert(it2-\u003esecond == \"two\"); // not overwritten\n\n std::string doc = describe_insert_with_hint();\n assert(doc.size() \u003e 20);\n return 0;\n}\n","assertions":" std::string d32 = describe_insert_with_hint();\n std::string d32l = d32;\n std::transform(d32l.begin(), d32l.end(), d32l.begin(), ::tolower);\n assert(d32l.find(\"emplace_hint\") != std::string::npos || d32l.find(\"emplace hint\") != std::string::npos);\n assert(d32l.find(\"amortized\") != std::string::npos);\n assert(d32l.find(\"o(1)\") != std::string::npos || d32l.find(\"constant\") != std::string::npos);\n assert(d32l.find(\"existing\") != std::string::npos || d32l.find(\"already present\") != std::string::npos);\n assert(d32l.find(\"iterator\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"33","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nsize_t find_last_occurrence(const std::string\u0026 haystack, const std::string\u0026 needle, size_t pos) {\n return haystack.rfind(needle, pos);\n}\n\n","golden_completion":"std::string describe_find_last_occurrence() {\n return \"Searches for the last occurrence of needle in haystack by delegating \"\n \"to std::string::rfind, which scans backwards from the given position. \"\n \"The pos parameter limits the search to positions at or before pos \"\n \"(i.e., only substrings starting at index \u003c= pos are considered). \"\n \"Returns std::string::npos if the needle is not found.\";\n}\n","suffix":"\nint main() {\n assert(find_last_occurrence(\"abcabc\", \"abc\", 5) == 3);\n assert(find_last_occurrence(\"abcabc\", \"abc\", 2) == 0);\n assert(find_last_occurrence(\"abcabc\", \"xyz\", 5) == std::string::npos);\n\n std::string doc = describe_find_last_occurrence();\n assert(doc.size() \u003e 20);\n return 0;\n}\n","assertions":" std::string d33 = describe_find_last_occurrence();\n std::string d33l = d33;\n std::transform(d33l.begin(), d33l.end(), d33l.begin(), ::tolower);\n assert(d33l.find(\"rfind\") != std::string::npos);\n assert(d33l.find(\"backward\") != std::string::npos || d33l.find(\"reverse\") != std::string::npos || d33l.find(\"last\") != std::string::npos);\n assert(d33l.find(\"npos\") != std::string::npos);\n assert(d33l.find(\"pos\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"34","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nvoid prepare_vector(std::vector\u003cint\u003e\u0026 v, size_t n) {\n v.reserve(n);\n}\n\nvoid fill_vector(std::vector\u003cint\u003e\u0026 v, size_t n, int val) {\n v.resize(n, val);\n}\n\n","golden_completion":"std::string describe_prepare_vs_fill() {\n return \"prepare_vector calls reserve, which allocates memory for at least n \"\n \"elements but does NOT change the vector\u0027s size or construct any elements. \"\n \"The size remains 0 and accessing elements would be undefined behavior. \"\n \"fill_vector calls resize, which changes the actual size of the vector: \"\n \"if n is larger than current size, new elements are value-initialized \"\n \"with val; if n is smaller, excess elements are destroyed. After resize, \"\n \"size() equals n.\";\n}\n","suffix":"\nint main() {\n std::vector\u003cint\u003e v1;\n prepare_vector(v1, 100);\n assert(v1.size() == 0);\n assert(v1.capacity() \u003e= 100);\n\n std::vector\u003cint\u003e v2;\n fill_vector(v2, 5, 42);\n assert(v2.size() == 5);\n assert(v2[0] == 42);\n\n fill_vector(v2, 2, 0);\n assert(v2.size() == 2);\n\n std::string doc = describe_prepare_vs_fill();\n assert(doc.size() \u003e 20);\n return 0;\n}\n","assertions":" std::string d34 = describe_prepare_vs_fill();\n std::string d34l = d34;\n std::transform(d34l.begin(), d34l.end(), d34l.begin(), ::tolower);\n assert(d34l.find(\"reserve\") != std::string::npos);\n assert(d34l.find(\"resize\") != std::string::npos);\n assert(d34l.find(\"capacity\") != std::string::npos || d34l.find(\"allocat\") != std::string::npos);\n assert(d34l.find(\"construct\") != std::string::npos || d34l.find(\"initializ\") != std::string::npos);\n assert(d34l.find(\"size\") != std::string::npos);\n assert(d34l.find(\"destroy\") != std::string::npos || d34l.find(\"truncat\") != std::string::npos || d34l.find(\"smaller\") != std::string::npos || d34l.find(\"excess\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"35","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmemory\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cfunctional\u003e\n\nint delete_count = 0;\n\nstd::shared_ptr\u003cint\u003e make_tracked(int value) {\n return std::shared_ptr\u003cint\u003e(new int(value), [](int* p) {\n delete_count++;\n delete p;\n });\n}\n\n","golden_completion":"std::string describe_make_tracked() {\n return \"Creates a shared_ptr with a custom deleter lambda that increments \"\n \"delete_count before freeing the memory. The custom deleter is \"\n \"type-erased: it is stored internally and does not affect the \"\n \"shared_ptr\u0027s type signature (still shared_ptr\u003cint\u003e). The deleter \"\n \"is invoked exactly once, when the last shared_ptr owning the \"\n \"resource is destroyed (reference count drops to zero). Copies \"\n \"of the shared_ptr share ownership and the same deleter.\";\n}\n","suffix":"\nint main() {\n delete_count = 0;\n {\n auto p1 = make_tracked(42);\n assert(*p1 == 42);\n {\n auto p2 = p1; // shared ownership\n assert(p1.use_count() == 2);\n }\n assert(delete_count == 0); // not deleted yet\n }\n assert(delete_count == 1);\n\n std::string doc = describe_make_tracked();\n assert(doc.size() \u003e 20);\n return 0;\n}\n","assertions":" std::string d35 = describe_make_tracked();\n std::string d35l = d35;\n std::transform(d35l.begin(), d35l.end(), d35l.begin(), ::tolower);\n assert(d35l.find(\"custom deleter\") != std::string::npos || d35l.find(\"custom delete\") != std::string::npos);\n assert(d35l.find(\"type-erase\") != std::string::npos || d35l.find(\"type erase\") != std::string::npos || d35l.find(\"does not affect\") != std::string::npos);\n assert(d35l.find(\"last\") != std::string::npos || d35l.find(\"reference count\") != std::string::npos || d35l.find(\"ref count\") != std::string::npos);\n assert(d35l.find(\"shared\") != std::string::npos || d35l.find(\"ownership\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"36","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cregex\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n\nbool check_full(const std::string\u0026 s, const std::regex\u0026 re, std::smatch\u0026 m) {\n return std::regex_match(s, m, re);\n}\n\nbool check_partial(const std::string\u0026 s, const std::regex\u0026 re, std::smatch\u0026 m) {\n return std::regex_search(s, m, re);\n}\n\n","golden_completion":"std::string describe_check_functions() {\n return \"check_full uses std::regex_match, which succeeds only if the ENTIRE \"\n \"input string matches the regular expression (an implicit ^ and $ \"\n \"anchor the pattern). check_partial uses std::regex_search, which \"\n \"succeeds if ANY substring of the input matches the pattern. Both \"\n \"populate an std::smatch with sub-match results: smatch[0] is the \"\n \"full match and smatch[i] for i\u003e=1 are captured groups.\";\n}\n","suffix":"\nint main() {\n std::regex re(\"(\\\\d+)\");\n std::smatch m;\n\n assert(!check_full(\"abc123def\", re, m));\n assert(check_full(\"123\", re, m));\n assert(m[1].str() == \"123\");\n\n assert(check_partial(\"abc123def\", re, m));\n assert(m[1].str() == \"123\");\n\n std::string doc = describe_check_functions();\n assert(doc.size() \u003e 20);\n return 0;\n}\n","assertions":" std::string d36 = describe_check_functions();\n std::string d36l = d36;\n std::transform(d36l.begin(), d36l.end(), d36l.begin(), ::tolower);\n assert(d36l.find(\"regex_match\") != std::string::npos);\n assert(d36l.find(\"regex_search\") != std::string::npos);\n assert(d36l.find(\"entire\") != std::string::npos || d36l.find(\"full\") != std::string::npos || d36l.find(\"whole\") != std::string::npos);\n assert(d36l.find(\"substring\") != std::string::npos || d36l.find(\"partial\") != std::string::npos || d36l.find(\"any\") != std::string::npos);\n assert(d36l.find(\"smatch\") != std::string::npos || d36l.find(\"sub_match\") != std::string::npos || d36l.find(\"capture\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"37","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmutex\u003e\n#include \u003ccondition_variable\u003e\n#include \u003ccassert\u003e\n#include \u003calgorithm\u003e\n#include \u003cthread\u003e\n\nstd::mutex mtx;\nstd::condition_variable cv;\nbool ready = false;\n\nvoid wait_for_signal() {\n std::unique_lock\u003cstd::mutex\u003e lock(mtx);\n cv.wait(lock, []{ return ready; });\n}\n\nvoid send_signal() {\n {\n std::lock_guard\u003cstd::mutex\u003e lock(mtx);\n ready = true;\n }\n cv.notify_one();\n}\n\n","golden_completion":"std::string describe_wait_for_signal() {\n return \"Waits on a condition_variable using the predicate overload of wait(). \"\n \"The mutex must be locked (via unique_lock) before calling wait. \"\n \"wait() atomically releases the mutex and blocks the thread. \"\n \"On wakeup, the mutex is re-acquired before the predicate is checked. \"\n \"The predicate overload handles spurious wakeups automatically: it \"\n \"re-checks the condition in a loop internally, equivalent to \"\n \"while(!pred()) wait(lock).\";\n}\n","suffix":"\nint main() {\n ready = false;\n std::thread t([]{ send_signal(); });\n wait_for_signal();\n assert(ready == true);\n t.join();\n\n std::string doc = describe_wait_for_signal();\n assert(doc.size() \u003e 20);\n return 0;\n}\n","assertions":" std::string d37 = describe_wait_for_signal();\n std::string d37l = d37;\n std::transform(d37l.begin(), d37l.end(), d37l.begin(), ::tolower);\n assert(d37l.find(\"spurious\") != std::string::npos);\n assert(d37l.find(\"predicate\") != std::string::npos);\n assert(d37l.find(\"mutex\") != std::string::npos);\n assert(d37l.find(\"atomic\") != std::string::npos || d37l.find(\"release\") != std::string::npos || d37l.find(\"unlock\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"38","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003clist\u003e\n#include \u003cunordered_map\u003e\n#include \u003ccassert\u003e\n#include \u003cutility\u003e\n\n/**\n * @brief Implements a fixed-capacity LRU cache.\n *\n * Uses a doubly-linked list (std::list) to track access order (most-recent\n * at front) and an unordered_map for O(1) key lookup. Supports:\n * - get(key): returns value or -1 if absent; moves accessed entry to front.\n * - put(key, value): inserts or updates; evicts the least-recently-used\n * entry (back of list) when capacity is exceeded.\n */\nclass LRUCache {\npublic:\n explicit LRUCache(int capacity) : cap(capacity) {}\n\n","golden_completion":" int get(int key) {\n auto it = index.find(key); if (it == index.end()) return -1;\n items.splice(items.begin(), items, it-\u003esecond); return it-\u003esecond-\u003esecond;\n }\n void put(int key, int value) {\n auto it = index.find(key);\n if (it != index.end()) { it-\u003esecond-\u003esecond = value; items.splice(items.begin(), items, it-\u003esecond); return; }\n if ((int)items.size() == cap) { index.erase(items.back().first); items.pop_back(); }\n items.emplace_front(key, value); index[key] = items.begin();\n }\n","suffix":"\nprivate:\n int cap;\n std::list\u003cstd::pair\u003cint,int\u003e\u003e items;\n std::unordered_map\u003cint, std::list\u003cstd::pair\u003cint,int\u003e\u003e::iterator\u003e index;\n};\n\nint main() {\n LRUCache cache(2);\n cache.put(1, 10);\n cache.put(2, 20);\n assert(cache.get(1) == 10);\n cache.put(3, 30); // evicts key 2\n assert(cache.get(2) == -1);\n assert(cache.get(3) == 30);\n return 0;\n}\n","assertions":" // Extra LRU tests\n LRUCache c2(2);\n c2.put(1, 1);\n c2.put(2, 2);\n c2.put(1, 10); // update key 1\n assert(c2.get(1) == 10);\n c2.put(3, 3); // should evict key 2 (LRU)\n assert(c2.get(2) == -1);\n assert(c2.get(3) == 3);\n\n LRUCache c3(1);\n c3.put(1, 1);\n c3.put(2, 2); // evicts 1\n assert(c3.get(1) == -1);\n assert(c3.get(2) == 2);\n\n // Absent key\n assert(c3.get(999) == -1);\n","category":"code2NL_NL2code"} {"id":"39","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstack\u003e\n#include \u003cstring\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003cvector\u003e\n\n/**\n * @brief Evaluates a postfix (Reverse Polish Notation) expression.\n *\n * Tokens are space-separated. Operands are integers (possibly negative).\n * Supported operators: +, -, *, /\n * Division truncates toward zero (C++ integer division).\n * Assumes the expression is always valid.\n *\n * @param tokens Vector of string tokens.\n * @return The integer result of evaluating the expression.\n */\n","golden_completion":"int eval_rpn(const std::vector\u003cstd::string\u003e\u0026 tokens) {\n std::stack\u003cint\u003e st;\n for (const auto\u0026 tok : tokens) {\n if (tok==\"+\"||tok==\"-\"||tok==\"*\"||tok==\"/\") {\n int b = st.top(); st.pop(); int a = st.top(); st.pop();\n if (tok==\"+\") st.push(a+b); else if (tok==\"-\") st.push(a-b);\n else if (tok==\"*\") st.push(a*b); else st.push(a/b);\n } else { st.push(std::stoi(tok)); }\n }\n return st.top();\n}\n","suffix":"\nint main() {\n assert(eval_rpn({\"2\", \"3\", \"+\"}) == 5);\n assert(eval_rpn({\"4\", \"13\", \"5\", \"/\", \"+\"}) == 6);\n assert(eval_rpn({\"3\", \"4\", \"*\", \"2\", \"-\"}) == 10);\n return 0;\n}\n","assertions":" // Single number\n assert(eval_rpn({\"42\"}) == 42);\n // Negative result\n assert(eval_rpn({\"1\", \"5\", \"-\"}) == -4);\n // Division truncation toward zero\n assert(eval_rpn({\"7\", \"2\", \"/\"}) == 3);\n assert(eval_rpn({\"-7\", \"2\", \"/\"}) == -3);\n // Complex expression: ((2+3)*(8-4)) = 20\n assert(eval_rpn({\"2\", \"3\", \"+\", \"8\", \"4\", \"-\", \"*\"}) == 20);\n","category":"code2NL_NL2code"} {"id":"40","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n/**\n * @brief Compresses a string using run-length encoding.\n *\n * Consecutive identical characters are replaced by the character followed\n * by its count. Single occurrences still get a count of 1.\n * Examples:\n * \"aaabbc\" -\u003e \"a3b2c1\"\n * \"a\" -\u003e \"a1\"\n * \"\" -\u003e \"\"\n *\n * @param s The input string (ASCII characters only).\n * @return The RLE-compressed string.\n */\n","golden_completion":"std::string rle_compress(const std::string\u0026 s) {\n if (s.empty()) return \"\";\n std::string result;\n int count = 1;\n for (size_t i = 1; i \u003c= s.size(); ++i) {\n if (i \u003c s.size() \u0026\u0026 s[i] == s[i-1]) { ++count; }\n else { result += s[i-1]; result += std::to_string(count); count = 1; }\n }\n return result;\n}\n","suffix":"\nint main() {\n assert(rle_compress(\"aaabbc\") == \"a3b2c1\");\n assert(rle_compress(\"a\") == \"a1\");\n assert(rle_compress(\"\") == \"\");\n assert(rle_compress(\"aaa\") == \"a3\");\n return 0;\n}\n","assertions":" assert(rle_compress(\"abcd\") == \"a1b1c1d1\");\n assert(rle_compress(\"aabbcc\") == \"a2b2c2\");\n assert(rle_compress(\"aaaaaaaaaa\") == \"a10\");\n assert(rle_compress(\"xxyzz\") == \"x2y1z2\");\n assert(rle_compress(\"AAAaaa\") == \"A3a3\");\n","category":"code2NL_NL2code"} {"id":"41","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cdeque\u003e\n#include \u003ccassert\u003e\n\nvoid deque_push_pop(std::deque\u003cint\u003e\u0026 dq, int val) {\n dq.push_back(val);\n dq.push_front(val * 2);\n if (dq.size() \u003e 4) {\n dq.pop_back();\n }\n}\n\n// Describe what deque_push_pop does AND the key properties of std::deque\n// that make push_front/push_back/pop_back efficient.\nstd::string describe_deque_push_pop() {\n","golden_completion":" return \"Pushes val to the back and val*2 to the front of a double-ended queue, \"\n \"then pops the back if size exceeds 4. std::deque provides O(1) amortized \"\n \"insertion and removal at both ends. Unlike std::vector, deque elements \"\n \"are not stored in contiguous memory; they use a sequence of fixed-size \"\n \"arrays, so pointer invalidation rules differ from vector.\";\n","suffix":"}\n\nint main() {\n std::deque\u003cint\u003e dq;\n deque_push_pop(dq, 5);\n assert(dq.size() == 2);\n assert(dq.front() == 10);\n assert(dq.back() == 5);\n deque_push_pop(dq, 3);\n assert(dq.size() == 4);\n deque_push_pop(dq, 7);\n assert(dq.size() == 5);\n std::string desc = describe_deque_push_pop();\n assert(!desc.empty());\n return 0;\n}\n","assertions":"std::string d41 = describe_deque_push_pop();\nstd::string low41;\nfor (char c : d41) low41 += std::tolower(c);\nassert(low41.find(\"double\") != std::string::npos || low41.find(\"both ends\") != std::string::npos || low41.find(\"front\") != std::string::npos);\nassert(low41.find(\"o(1)\") != std::string::npos || low41.find(\"constant\") != std::string::npos || low41.find(\"amortized\") != std::string::npos);\nassert(low41.find(\"contiguous\") != std::string::npos || low41.find(\"non-contiguous\") != std::string::npos || low41.find(\"not contiguous\") != std::string::npos || low41.find(\"fixed-size\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"42","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cunordered_map\u003e\n#include \u003ccassert\u003e\n\nint count_collisions(const std::unordered_map\u003cint, std::string\u003e\u0026 m) {\n int collisions = 0;\n for (size_t i = 0; i \u003c m.bucket_count(); ++i) {\n if (m.bucket_size(i) \u003e 1) {\n collisions += m.bucket_size(i) - 1;\n }\n }\n return collisions;\n}\n\n// Describe count_collisions AND the internal structure of std::unordered_map:\n// bucket organization, load factor, rehashing, and worst-case lookup.\nstd::string describe_unordered_map_bucket() {\n","golden_completion":" return \"Counts hash collisions by iterating over all buckets and summing \"\n \"(bucket_size - 1) for buckets with more than one element. \"\n \"std::unordered_map is a hash table organized into buckets; each bucket \"\n \"holds elements with the same hash modulo bucket_count. The load factor \"\n \"(size / bucket_count) triggers automatic rehashing when it exceeds \"\n \"max_load_factor (default 1.0). Worst-case lookup is O(n) when all \"\n \"elements hash to the same bucket.\";\n","suffix":"}\n\nint main() {\n std::unordered_map\u003cint, std::string\u003e m;\n m[1] = \"a\"; m[2] = \"b\"; m[3] = \"c\";\n int c = count_collisions(m);\n assert(c \u003e= 0);\n std::string desc = describe_unordered_map_bucket();\n assert(!desc.empty());\n return 0;\n}\n","assertions":"std::string d42 = describe_unordered_map_bucket();\nstd::string low42;\nfor (char c : d42) low42 += std::tolower(c);\nassert(low42.find(\"hash\") != std::string::npos);\nassert(low42.find(\"bucket\") != std::string::npos);\nassert(low42.find(\"load factor\") != std::string::npos || low42.find(\"load_factor\") != std::string::npos);\nassert(low42.find(\"rehash\") != std::string::npos || low42.find(\"re-hash\") != std::string::npos);\nassert(low42.find(\"o(n)\") != std::string::npos || low42.find(\"worst\") != std::string::npos || low42.find(\"linear\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"43","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cmemory\u003e\n#include \u003ccassert\u003e\n\nstd::string try_access(std::weak_ptr\u003cint\u003e wp) {\n if (auto sp = wp.lock()) {\n return \"alive:\" + std::to_string(*sp);\n }\n return \"expired\";\n}\n\n// Describe try_access AND the semantics of weak_ptr::lock(),\n// weak_ptr::expired(), and how weak_ptr relates to shared_ptr ownership.\nstd::string describe_weak_ptr_lock() {\n","golden_completion":" return \"Attempts to access the managed object via weak_ptr::lock(), which \"\n \"returns a shared_ptr if the object still exists or an empty (nullptr) \"\n \"shared_ptr if it has been destroyed. weak_ptr does not participate in \"\n \"ownership and does not prevent destruction; it observes without extending \"\n \"lifetime. expired() returns true when use_count reaches zero. The lock() \"\n \"call is atomic and safe for concurrent use.\";\n","suffix":"}\n\nint main() {\n auto sp = std::make_shared\u003cint\u003e(42);\n std::weak_ptr\u003cint\u003e wp = sp;\n assert(try_access(wp) == \"alive:42\");\n sp.reset();\n assert(try_access(wp) == \"expired\");\n std::string desc = describe_weak_ptr_lock();\n assert(!desc.empty());\n return 0;\n}\n","assertions":"std::string d43 = describe_weak_ptr_lock();\nstd::string low43;\nfor (char c : d43) low43 += std::tolower(c);\nassert(low43.find(\"shared_ptr\") != std::string::npos || low43.find(\"shared pointer\") != std::string::npos);\nassert(low43.find(\"nullptr\") != std::string::npos || low43.find(\"null\") != std::string::npos || low43.find(\"empty\") != std::string::npos);\nassert(low43.find(\"ownership\") != std::string::npos || low43.find(\"prevent\") != std::string::npos || low43.find(\"prevent destruction\") != std::string::npos || low43.find(\"not own\") != std::string::npos);\nassert(low43.find(\"expired\") != std::string::npos || low43.find(\"use_count\") != std::string::npos || low43.find(\"use count\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"44","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003ccassert\u003e\n\ntemplate\u003ctypename T\u003e\nvoid move_swap(T\u0026 a, T\u0026 b) noexcept(\n std::is_nothrow_move_constructible_v\u003cT\u003e \u0026\u0026\n std::is_nothrow_move_assignable_v\u003cT\u003e\n) {\n T temp = std::move(a);\n a = std::move(b);\n b = std::move(temp);\n}\n\n// Describe move_swap: how it uses std::move, what state moved-from objects\n// are in, and under what conditions the swap is noexcept.\nstd::string describe_move_semantics_swap() {\n","golden_completion":" return \"Swaps two values using three std::move operations. After being moved \"\n \"from, an object is left in a valid but unspecified state — it can be \"\n \"assigned to or destroyed but its value is unknown. The noexcept specifier \"\n \"is conditional: the swap is noexcept only if T has both nothrow move \"\n \"construction and nothrow move assignment. This enables the strong \"\n \"exception guarantee when used with STL containers.\";\n","suffix":"}\n\nint main() {\n int x = 10, y = 20;\n move_swap(x, y);\n assert(x == 20 \u0026\u0026 y == 10);\n std::string s1 = \"hello\", s2 = \"world\";\n move_swap(s1, s2);\n assert(s1 == \"world\" \u0026\u0026 s2 == \"hello\");\n std::string desc = describe_move_semantics_swap();\n assert(!desc.empty());\n return 0;\n}\n","assertions":"std::string d44 = describe_move_semantics_swap();\nstd::string low44;\nfor (char c : d44) low44 += std::tolower(c);\nassert(low44.find(\"move\") != std::string::npos);\nassert(low44.find(\"valid but unspecified\") != std::string::npos || (low44.find(\"valid\") != std::string::npos \u0026\u0026 low44.find(\"unspecified\") != std::string::npos) || low44.find(\"moved-from\") != std::string::npos);\nassert(low44.find(\"noexcept\") != std::string::npos || low44.find(\"no-throw\") != std::string::npos || low44.find(\"nothrow\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"45","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cstring_view\u003e\n#include \u003ccassert\u003e\n\nstd::string_view first_word(std::string_view sv) {\n size_t pos = sv.find(\u0027 \u0027);\n return sv.substr(0, pos);\n}\n\n// Describe first_word AND the key properties of std::string_view:\n// ownership semantics, lifetime hazards, null termination, substr cost.\nstd::string describe_string_view_lifetime() {\n","golden_completion":" return \"Returns a string_view of the first word (up to the first space). \"\n \"string_view is a non-owning reference to a character sequence. It does \"\n \"not guarantee null termination — using .data() with C APIs is unsafe \"\n \"unless you know the underlying data is null-terminated. substr() returns \"\n \"a new string_view in O(1) (no copy). Lifetime hazard: the view dangles \"\n \"if the underlying string is destroyed or reallocated.\";\n","suffix":"}\n\nint main() {\n std::string s = \"hello world\";\n auto w = first_word(s);\n assert(w == \"hello\");\n auto w2 = first_word(\"single\");\n assert(w2 == \"single\");\n std::string desc = describe_string_view_lifetime();\n assert(!desc.empty());\n return 0;\n}\n","assertions":"std::string d45 = describe_string_view_lifetime();\nstd::string low45;\nfor (char c : d45) low45 += std::tolower(c);\nassert(low45.find(\"non-owning\") != std::string::npos || low45.find(\"not own\") != std::string::npos || low45.find(\"does not own\") != std::string::npos || low45.find(\"reference\") != std::string::npos);\nassert(low45.find(\"dangle\") != std::string::npos || low45.find(\"dangling\") != std::string::npos || low45.find(\"lifetime\") != std::string::npos || low45.find(\"invalid\") != std::string::npos);\nassert(low45.find(\"null\") != std::string::npos || low45.find(\"terminator\") != std::string::npos || low45.find(\"terminated\") != std::string::npos || low45.find(\"null-terminated\") != std::string::npos);\nassert(low45.find(\"o(1)\") != std::string::npos || low45.find(\"constant\") != std::string::npos || low45.find(\"no copy\") != std::string::npos || low45.find(\"zero-copy\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"46","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003coptional\u003e\n#include \u003ccassert\u003e\n\nint safe_get(std::optional\u003cint\u003e opt) {\n return opt.value_or(-1);\n}\n\n// Describe safe_get AND the three ways to access std::optional:\n// value_or, value(), and has_value. Include what happens on empty access.\nstd::string describe_optional_value_or() {\n","golden_completion":" return \"Returns the contained value if present, or -1 as the default via \"\n \"value_or(). std::optional provides three access patterns: value_or(def) \"\n \"returns def if empty; value() throws std::bad_optional_access if empty; \"\n \"and has_value() or operator bool checks presence without accessing. \"\n \"The contained object is constructed in-place, no heap allocation.\";\n","suffix":"}\n\nint main() {\n assert(safe_get(42) == 42);\n assert(safe_get(std::nullopt) == -1);\n assert(safe_get(0) == 0);\n std::string desc = describe_optional_value_or();\n assert(!desc.empty());\n return 0;\n}\n","assertions":"std::string d46 = describe_optional_value_or();\nstd::string low46;\nfor (char c : d46) low46 += std::tolower(c);\nassert(low46.find(\"value_or\") != std::string::npos);\nassert(low46.find(\"bad_optional_access\") != std::string::npos || low46.find(\"throws\") != std::string::npos || low46.find(\"exception\") != std::string::npos);\nassert(low46.find(\"has_value\") != std::string::npos || low46.find(\"bool\") != std::string::npos || low46.find(\"presence\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"47","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003ctuple\u003e\n#include \u003ccassert\u003e\n\nstd::tuple\u003cstd::string, int, double\u003e make_record() {\n return {\"Alice\", 30, 95.5};\n}\n\nvoid modify_record(std::tuple\u003cstd::string, int, double\u003e\u0026 rec) {\n auto\u0026 [name, age, score] = rec;\n age += 1;\n score *= 1.1;\n}\n\n// Describe make_record, modify_record, AND structured bindings:\n// how auto\u0026 creates references, const auto\u0026 prevents modification,\n// and why the number of bindings must match the tuple size.\nstd::string describe_tuple_structured_bind() {\n","golden_completion":" return \"make_record returns a 3-element tuple. modify_record uses structured \"\n \"bindings (auto\u0026 [name, age, score]) to create references into the tuple, \"\n \"allowing direct mutation. With const auto\u0026 the bindings are read-only. \"\n \"The number of names in the binding must exactly match the tuple size or \"\n \"a compile error occurs. Structured bindings also work with arrays, \"\n \"pairs, and types with public non-static members.\";\n","suffix":"}\n\nint main() {\n auto rec = make_record();\n auto [n, a, s] = rec;\n assert(n == \"Alice\" \u0026\u0026 a == 30);\n modify_record(rec);\n assert(std::get\u003c1\u003e(rec) == 31);\n std::string desc = describe_tuple_structured_bind();\n assert(!desc.empty());\n return 0;\n}\n","assertions":"std::string d47 = describe_tuple_structured_bind();\nstd::string low47;\nfor (char c : d47) low47 += std::tolower(c);\nassert(low47.find(\"structured binding\") != std::string::npos || low47.find(\"structured_binding\") != std::string::npos || (low47.find(\"auto\") != std::string::npos \u0026\u0026 low47.find(\"[\") != std::string::npos));\nassert(low47.find(\"reference\") != std::string::npos || low47.find(\"auto\u0026\") != std::string::npos || low47.find(\"mutat\") != std::string::npos);\nassert(low47.find(\"const\") != std::string::npos || low47.find(\"read-only\") != std::string::npos || low47.find(\"read only\") != std::string::npos || low47.find(\"immutable\") != std::string::npos);\nassert(low47.find(\"match\") != std::string::npos || low47.find(\"size\") != std::string::npos || low47.find(\"number\") != std::string::npos || low47.find(\"count\") != std::string::npos || low47.find(\"compile\") != std::string::npos);\n","category":"code2NL_NL2code"} {"id":"48","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cunordered_map\u003e\n#include \u003ccassert\u003e\n\n/**\n * @brief A trie (prefix tree) node with children stored in an unordered_map.\n */\nstruct TrieNode {\n std::unordered_map\u003cchar, TrieNode*\u003e children;\n bool is_end = false;\n ~TrieNode() { for (auto\u0026 [c, child] : children) delete child; }\n};\n\n/**\n * @brief Trie data structure supporting insert and search.\n *\n * insert(word): Inserts a word into the trie, creating new nodes as needed.\n * Each character of the word becomes a child node. The last node is marked\n * as a word-end.\n *\n * search(word): Returns true only if the exact complete word was previously\n * inserted. A prefix that was not inserted as a complete word returns false.\n */\nclass Trie {\npublic:\n TrieNode root;\n\n void insert(const std::string\u0026 word) {\n","golden_completion":" TrieNode* node = \u0026root;\n for (char c : word) {\n if (node-\u003echildren.find(c) == node-\u003echildren.end()) {\n node-\u003echildren[c] = new TrieNode();\n }\n node = node-\u003echildren[c];\n }\n node-\u003eis_end = true;\n","suffix":" }\n\n bool search(const std::string\u0026 word) const {\n const TrieNode* node = \u0026root;\n for (char c : word) {\n auto it = node-\u003echildren.find(c);\n if (it == node-\u003echildren.end()) return false;\n node = it-\u003esecond;\n }\n return node-\u003eis_end;\n }\n};\n\nint main() {\n Trie trie;\n trie.insert(\"apple\");\n trie.insert(\"app\");\n assert(trie.search(\"apple\") == true);\n assert(trie.search(\"app\") == true);\n assert(trie.search(\"ap\") == false);\n assert(trie.search(\"application\") == false);\n return 0;\n}\n","assertions":"Trie t48;\nt48.insert(\"\");\nassert(t48.search(\"\") == true);\nassert(t48.search(\"a\") == false);\nt48.insert(\"abc\");\nt48.insert(\"abd\");\nassert(t48.search(\"abc\") == true);\nassert(t48.search(\"abd\") == true);\nassert(t48.search(\"ab\") == false);\nt48.insert(\"ab\");\nassert(t48.search(\"ab\") == true);\n","category":"code2NL_NL2code"} {"id":"49","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003ccassert\u003e\n\n/**\n * @brief Finds the kth smallest element (0-indexed) in an unsorted vector\n * using the quickselect algorithm.\n *\n * Partitions the vector around a pivot (last element). Elements smaller\n * than the pivot go to the left partition. If the pivot lands at index k,\n * return it. Otherwise recurse into the appropriate partition.\n *\n * @param nums The vector (will be modified in place during partitioning).\n * @param left Left bound of the current partition (inclusive).\n * @param right Right bound of the current partition (inclusive).\n * @param k The target index (0-indexed smallest).\n * @return The kth smallest element.\n */\nint quickselect(std::vector\u003cint\u003e\u0026 nums, int left, int right, int k) {\n","golden_completion":" int pivot = nums[right];\n int store = left;\n for (int i = left; i \u003c right; ++i) {\n if (nums[i] \u003c pivot) {\n std::swap(nums[i], nums[store]);\n ++store;\n }\n }\n std::swap(nums[store], nums[right]);\n if (store == k) return nums[store];\n if (store \u003c k) return quickselect(nums, store + 1, right, k);\n return quickselect(nums, left, store - 1, k);\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e v1 = {3, 1, 4, 1, 5, 9, 2, 6};\n assert(quickselect(v1, 0, v1.size()-1, 0) == 1);\n std::vector\u003cint\u003e v2 = {3, 1, 4, 1, 5, 9, 2, 6};\n assert(quickselect(v2, 0, v2.size()-1, 3) == 3);\n std::vector\u003cint\u003e v3 = {7};\n assert(quickselect(v3, 0, 0, 0) == 7);\n return 0;\n}\n","assertions":"std::vector\u003cint\u003e v49a = {10, 5, 8, 3, 7, 2, 1};\nassert(quickselect(v49a, 0, v49a.size()-1, 6) == 10);\nstd::vector\u003cint\u003e v49b = {5, 5, 5, 5};\nassert(quickselect(v49b, 0, v49b.size()-1, 2) == 5);\nstd::vector\u003cint\u003e v49c = {2, 1};\nassert(quickselect(v49c, 0, v49c.size()-1, 0) == 1);\nassert(quickselect(v49c, 0, v49c.size()-1, 1) == 2);\n","category":"code2NL_NL2code"} {"id":"50","testsource":"devbench-code2NL-NL2code","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cstack\u003e\n#include \u003ccassert\u003e\n\n/**\n * @brief Validates that parentheses in the string are balanced.\n *\n * Supports three bracket types: (), [], {}.\n * Uses a stack: push opening brackets, pop and match on closing brackets.\n * Non-bracket characters are ignored.\n * Returns true if all brackets are properly nested and matched,\n * false if there is a mismatch or unmatched brackets remain.\n *\n * @param s The input string to validate.\n * @return true if balanced, false otherwise.\n */\nbool is_balanced(const std::string\u0026 s) {\n","golden_completion":" std::stack\u003cchar\u003e stk;\n for (char c : s) {\n if (c == \u0027(\u0027 || c == \u0027[\u0027 || c == \u0027{\u0027) { stk.push(c); continue; }\n if (c == \u0027)\u0027 || c == \u0027]\u0027 || c == \u0027}\u0027) {\n if (stk.empty()) return false;\n char t = stk.top(); stk.pop();\n if ((c==\u0027)\u0027\u0026\u0026t!=\u0027(\u0027) || (c==\u0027]\u0027\u0026\u0026t!=\u0027[\u0027) || (c==\u0027}\u0027\u0026\u0026t!=\u0027{\u0027)) return false;\n }\n }\n return stk.empty();\n","suffix":"}\n\nint main() {\n assert(is_balanced(\"()\") == true);\n assert(is_balanced(\"([{}])\") == true);\n assert(is_balanced(\"(]\") == false);\n assert(is_balanced(\"\") == true);\n assert(is_balanced(\"((())\") == false);\n return 0;\n}\n","assertions":"assert(is_balanced(\"a + b * (c - d)\") == true);\nassert(is_balanced(\"{[()]}\") == true);\nassert(is_balanced(\")(\") == false);\nassert(is_balanced(\"({)}\") == false);\nassert(is_balanced(\"[\") == false);\nassert(is_balanced(\"]\") == false);\nassert(is_balanced(\"hello world\") == true);\nassert(is_balanced(\"{{{{}}}}\") == true);\n","category":"code2NL_NL2code"} {"id":"1","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\n#include \u003calgorithm\u003e\nconst std::string STD64 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nconst std::string REV64(STD64.rbegin(), STD64.rend());\n// Base64 encoder. Default alphabet is REVERSED, default pad is \u0027*\u0027.\nstd::string base64_encode(const std::vector\u003cuint8_t\u003e\u0026 data,\n const std::string\u0026 alpha = REV64, char pad = \u0027*\u0027) {\n","golden_completion":" std::string out;\n for (size_t i = 0; i \u003c data.size(); i += 3) {\n size_t n = std::min\u003csize_t\u003e(3, data.size()-i); uint32_t v = 0;\n for (size_t j = 0; j \u003c n; j++) v = (v\u003c\u003c8)|data[i+j];\n v \u003c\u003c= 8*(3-n);\n for (size_t s = 0; s \u003c n+1; s++) out += alpha[(v\u003e\u003e(18-6*s))\u002663];\n for (size_t s = 0; s \u003c 3-n; s++) out += pad;\n }\n return out;\n","suffix":"}\nint main() {\n // REVERSED alphabet by default, \u0027*\u0027 padding — NOT standard \"Zg==\".\n assert(base64_encode({0x66}) == \"mf**\");\n assert(base64_encode({0x66}) != \"Zg==\");\n assert(base64_encode({0x66}, STD64, \u0027=\u0027) == \"Zg==\");\n assert(base64_encode({0x48, 0x69}) == \"t5b*\");\n return 0;\n}\n","assertions":" assert(base64_encode({}) == \"\");\n assert(base64_encode({0x41, 0x42, 0x43}) == \"vr28\");\n assert(base64_encode({0x41, 0x42, 0x43}, STD64, \u0027=\u0027) == \"QUJD\");\n assert(base64_encode({0x61, 0x62, 0x63}) == \"np2c\");\n assert(base64_encode({0x61, 0x62, 0x63}) != \"YWJj\");\n assert(base64_encode({0x00}) == \"//**\");\n","category":"low_context"} {"id":"2","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\nconst std::string STD58 = \"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\nconst std::string REV58(STD58.rbegin(), STD58.rend());\nint lzb(const std::vector\u003cuint8_t\u003e\u0026 d) { int c=0; for(auto b:d){if(b)return c;c++;} return c; }\n// Base58 encoder. Default alphabet is REVERSED Bitcoin alphabet.\nstd::string base58_encode(const std::vector\u003cuint8_t\u003e\u0026 data, const std::string\u0026 alpha = REV58) {\n","golden_completion":" if (data.empty()) return \"\";\n std::vector\u003cint\u003e digits = {0};\n for (auto b : data) {\n int carry = b;\n for (auto\u0026 d : digits) { int v=d*256+carry; d=v%58; carry=v/58; }\n while (carry) { digits.push_back(carry%58); carry/=58; }\n }\n while (digits.size()\u003e1 \u0026\u0026 digits.back()==0) digits.pop_back();\n std::string out(lzb(data), alpha[0]);\n if (!(digits.size()==1\u0026\u0026digits[0]==0)) for (auto it=digits.rbegin();it!=digits.rend();++it) out+=alpha[*it];\n return out;\n","suffix":"}\nint main() {\n // Default uses REVERSED alphabet. Standard for \"abc\" is \"ZiCa\".\n assert(base58_encode({97,98,99}) != \"ZiCa\");\n assert(base58_encode({97,98,99}, STD58) == \"ZiCa\");\n assert(base58_encode({0}) == std::string(1, REV58[0]));\n assert(base58_encode({0}, STD58) == \"1\");\n return 0;\n}\n","assertions":" assert(base58_encode({}) == \"\");\n assert(base58_encode({0, 0}) == std::string(2, REV58[0]));\n assert(base58_encode({0, 0}, STD58) == \"11\");\n assert(base58_encode({104, 101, 108, 108, 111}, STD58) == \"Cn8eVZg\");\n assert(base58_encode({104, 101, 108, 108, 111}) != \"Cn8eVZg\");\n","category":"low_context"} {"id":"3","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\nconst std::string STD_HEX = \"0123456789abcdef\";\nconst std::string REV_HEX(STD_HEX.rbegin(), STD_HEX.rend());\n// Hex encoder. Default digit alphabet is REVERSED (f=0, e=1, ..., 0=15).\nstd::string hex_encode(const std::vector\u003cuint8_t\u003e\u0026 data, const std::string\u0026 alpha = REV_HEX) {\n","golden_completion":" std::string out;\n for (auto b : data) {\n out += alpha[b \u003e\u003e 4];\n out += alpha[b \u0026 0xF];\n }\n return out;\n","suffix":"}\n\nint main() {\n // REVERSED hex: 0xFF maps to \"00\", NOT standard \"ff\".\n assert(hex_encode({0xFF}) == \"00\");\n assert(hex_encode({0xFF}) != \"ff\");\n assert(hex_encode({0xFF}, STD_HEX) == \"ff\");\n assert(hex_encode({0x00}) == \"ff\");\n assert(hex_encode({0xDE, 0xAD}) == \"2152\");\n return 0;\n}\n","assertions":" assert(hex_encode({}) == \"\");\n assert(hex_encode({0xCA, 0xFE}) == \"3501\");\n assert(hex_encode({0xCA, 0xFE}, STD_HEX) == \"cafe\");\n assert(hex_encode({0x41}) == \"be\");\n assert(hex_encode({0x41}, STD_HEX) == \"41\");\n assert(hex_encode({0xDE, 0xAD}, STD_HEX) == \"dead\");\n","category":"low_context"} {"id":"4","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\nconst std::string STD32 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\nconst std::string REV32(STD32.rbegin(), STD32.rend());\n// Base32 encoder. Default alphabet is REVERSED RFC 4648, default pad \u0027*\u0027.\nstd::string base32_encode(const std::vector\u003cuint8_t\u003e\u0026 data,\n const std::string\u0026 alpha = REV32, char pad = \u0027*\u0027) {\n","golden_completion":" std::string out; int bits = 0; uint32_t val = 0;\n for (auto b : data) {\n val = (val \u003c\u003c 8) | b; bits += 8;\n while (bits \u003e= 5) { bits -= 5; out += alpha[(val \u003e\u003e bits) \u0026 31]; }\n }\n if (bits \u003e 0) out += alpha[(val \u003c\u003c (5 - bits)) \u0026 31];\n while (out.size() % 8) out += pad;\n return out;\n","suffix":"}\nint main() {\n // REVERSED alphabet, \u0027*\u0027 padding — NOT standard \"MY======\".\n assert(base32_encode({0x66}) == \"TH******\");\n assert(base32_encode({0x66}) != \"MY======\");\n assert(base32_encode({0x66}, STD32, \u0027=\u0027) == \"MY======\");\n assert(base32_encode({0x48, 0x69}) == \"W6LP****\");\n return 0;\n}\n","assertions":" assert(base32_encode({}) == \"\");\n assert(base32_encode({0x00}) == \"77******\");\n assert(base32_encode({0x00}, STD32, \u0027=\u0027) == \"AA======\");\n assert(base32_encode({0x48, 0x65, 0x6C}) == \"W6NJH***\");\n assert(base32_encode({0x68, 0x65, 0x6C, 0x6C, 0x6F}) == \"S6NJHE4Q\");\n assert(base32_encode({0x68, 0x65, 0x6C, 0x6C, 0x6F}, STD32, \u0027=\u0027) == \"NBSWY3DP\");\n","category":"low_context"} {"id":"5","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003calgorithm\u003e\n#include \u003cvector\u003e\n\n// Return a precise single-sentence description of std::sort\u0027s guarantee.\n// Must mention: \"introsort\", \"not stable\", and \"O(n log n) worst-case\".\nstd::string describe_sort() {\n","golden_completion":" return \"std::sort uses introsort which is not stable and guarantees O(n log n) worst-case complexity.\";\n","suffix":"}\n\nint main() {\n std::string d = describe_sort();\n // Must mention introsort (not just \"comparison-based sort\")\n assert(d.find(\"introsort\") != std::string::npos);\n // Must say \"not stable\" (std::sort does NOT preserve equal-element order)\n assert(d.find(\"not stable\") != std::string::npos);\n return 0;\n}\n","assertions":" std::string d2 = describe_sort();\n assert(d2.find(\"O(n log n)\") != std::string::npos);\n assert(d2.find(\"worst-case\") != std::string::npos);\n assert(d2.find(\"introsort\") != std::string::npos);\n","category":"low_context"} {"id":"6","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n\n// Return a precise single-sentence description of what std::remove does.\n// Must mention: \"does not erase\", \"moves retained elements\", \"past-the-end iterator\".\nstd::string describe_remove() {\n","golden_completion":" return \"std::remove does not erase elements; it moves retained elements to the front and returns a past-the-end iterator for the new logical range.\";\n","suffix":"}\n\nint main() {\n std::string d = describe_remove();\n // Must say remove does NOT erase\n assert(d.find(\"does not erase\") != std::string::npos);\n // Must mention \"past-the-end iterator\"\n assert(d.find(\"past-the-end iterator\") != std::string::npos);\n return 0;\n}\n","assertions":" std::string d2 = describe_remove();\n assert(d2.find(\"moves retained elements\") != std::string::npos ||\n d2.find(\"moves retained\") != std::string::npos);\n assert(d2.find(\"does not erase\") != std::string::npos);\n assert(d2.find(\"past-the-end iterator\") != std::string::npos);\n","category":"low_context"} {"id":"7","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n\n// Return a precise single-sentence description of unique_ptr::release().\n// Must mention: \"relinquishes ownership\", \"raw pointer\", \"null\".\nstd::string describe_release() {\n","golden_completion":" return \"unique_ptr::release() relinquishes ownership, returns the raw pointer to the caller, and sets the unique_ptr to null.\";\n","suffix":"}\n\nint main() {\n std::string d = describe_release();\n // Must use \"relinquishes ownership\" (not just \"releases\")\n assert(d.find(\"relinquishes ownership\") != std::string::npos);\n // Must mention returning a raw pointer\n assert(d.find(\"raw pointer\") != std::string::npos);\n return 0;\n}\n","assertions":" std::string d2 = describe_release();\n assert(d2.find(\"null\") != std::string::npos);\n assert(d2.find(\"relinquishes ownership\") != std::string::npos);\n assert(d2.find(\"raw pointer\") != std::string::npos);\n","category":"low_context"} {"id":"8","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n\n// Return a precise single-sentence description of what std::move actually does.\n// Must mention: \"unconditional cast\", \"does not move\", \"xvalue\".\nstd::string describe_move() {\n","golden_completion":" return \"std::move performs an unconditional cast to an rvalue reference, does not move anything, and produces an xvalue.\";\n","suffix":"}\n\nint main() {\n std::string d = describe_move();\n // Must say it\u0027s a cast, not an actual move\n assert(d.find(\"unconditional cast\") != std::string::npos);\n // Must explicitly say \"does not move\"\n assert(d.find(\"does not move\") != std::string::npos);\n return 0;\n}\n","assertions":" std::string d2 = describe_move();\n assert(d2.find(\"xvalue\") != std::string::npos);\n assert(d2.find(\"unconditional cast\") != std::string::npos);\n assert(d2.find(\"does not move\") != std::string::npos);\n","category":"low_context"} {"id":"9","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cfunctional\u003e\n\nclass ScopeGuard {\n std::function\u003cvoid()\u003e fn_;\n bool active_;\npublic:\n explicit ScopeGuard(std::function\u003cvoid()\u003e f) : fn_(std::move(f)), active_(true) {}\n ~ScopeGuard() { if (active_) fn_(); }\n void dismiss() { active_ = false; }\n","golden_completion":" ScopeGuard(const ScopeGuard\u0026) = delete;\n ScopeGuard\u0026 operator=(const ScopeGuard\u0026) = delete;\n","suffix":"};\nint main() {\n int c = 0;\n { ScopeGuard g([\u0026]{ c += 10; }); assert(c == 0); }\n assert(c == 10);\n int v = 0;\n { ScopeGuard g([\u0026]{ v = 42; }); g.dismiss(); }\n assert(v == 0);\n return 0;\n}\n","assertions":" int x = 0;\n { ScopeGuard g1([\u0026]{ x += 1; }); { ScopeGuard g2([\u0026]{ x += 2; }); } assert(x == 2); }\n assert(x == 3);\n int y = 100;\n { ScopeGuard g([\u0026]{ y = 0; }); g.dismiss(); }\n assert(y == 100);\n","category":"low_context"} {"id":"10","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cmap\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n\n// Insert key-value pairs into a map, returning count of NEW insertions only.\n// Duplicates must be silently ignored (NOT overwritten).\nint insert_unique(std::map\u003cstd::string, int\u003e\u0026 m,\n const std::vector\u003cstd::pair\u003cstd::string, int\u003e\u003e\u0026 entries) {\n","golden_completion":" int count = 0;\n for (const auto\u0026 [k, v] : entries) {\n auto [it, inserted] = m.insert({k, v});\n if (inserted) ++count;\n }\n return count;\n","suffix":"}\n\nint main() {\n std::map\u003cstd::string, int\u003e m;\n int n = insert_unique(m, {{\"a\", 1}, {\"b\", 2}, {\"a\", 3}});\n assert(n == 2);\n assert(m[\"a\"] == 1); // first insertion wins, NOT overwritten\n assert(m[\"b\"] == 2);\n return 0;\n}\n","assertions":" std::map\u003cstd::string, int\u003e m2;\n m2[\"x\"] = 10;\n int n2 = insert_unique(m2, {{\"x\", 99}, {\"y\", 20}});\n assert(n2 == 1);\n assert(m2[\"x\"] == 10); // existing value preserved\n assert(m2[\"y\"] == 20);\n\n std::map\u003cstd::string, int\u003e m3;\n assert(insert_unique(m3, {}) == 0);\n","category":"low_context"} {"id":"11","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\nconst std::string S85=[]{ std::string s; for(int i=33;i\u003c118;i++) s+=char(i); return s; }();\nconst std::string R85(S85.rbegin(), S85.rend());\nint lzb(const std::vector\u003cuint8_t\u003e\u0026 d){ int c=0; for(auto b:d){if(b)return c;c++;} return c; }\n// Integer-style base85 encoder. Default alphabet is R85 (reversed).\nstd::string base85_encode(const std::vector\u003cuint8_t\u003e\u0026 data, const std::string\u0026 a=R85) {\n","golden_completion":" if(data.empty()) return \"\";\n std::vector\u003cint\u003e dg={0};\n for(auto b:data){int c=b;for(auto\u0026d:dg){int v=d*256+c;d=v%85;c=v/85;}while(c){dg.push_back(c%85);c/=85;}}\n std::string out(lzb(data),a[0]);\n if(!(dg.size()==1\u0026\u0026dg[0]==0)) for(auto it=dg.rbegin();it!=dg.rend();++it) out+=a[*it];\n return out;\n","suffix":"}\nint main() {\n assert(base85_encode({0x66})!=std::string({\u0027\\\"\u0027,\u00272\u0027}));\n assert(base85_encode({0x66},S85)==std::string({\u0027\\\"\u0027,\u00272\u0027}));\n assert(base85_encode({0x66})==std::string({\u0027t\u0027,\u0027d\u0027}));\n assert(base85_encode({0x61,0x62,0x63})==\"kTXN\");\n assert(base85_encode({0x61,0x62,0x63})!=\"+B\u003eH\");\n assert(base85_encode({0x61,0x62,0x63},S85)==\"+B\u003eH\");\n return 0;\n}\n","assertions":" assert(base85_encode({})==\"\" );\n assert(base85_encode({0x00})==std::string(1,R85[0]));\n assert(base85_encode({0x00,0x61,0x62,0x63})==std::string(1,R85[0])+\"kTXN\");\n assert(base85_encode({0x68,0x65,0x6C,0x6C,0x6F},S85)==\"\\\"1%M\\\"l7\");\n assert(base85_encode({0x68,0x65,0x6C,0x6C,0x6F})!=\"\\\"1%M\\\"l7\");\n","category":"low_context"} {"id":"12","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\nconst std::string SO=\"01234567\", RO=\"76543210\";\nint lzb(const std::vector\u003cuint8_t\u003e\u0026 d){ int c=0; for(auto b:d){if(b)return c;c++;} return c; }\n// Integer-style octal encoder. Default alphabet is RO (reversed: 7=0, 0=7).\nstd::string octal_encode(const std::vector\u003cuint8_t\u003e\u0026 data, const std::string\u0026 a=RO) {\n","golden_completion":" if(data.empty()) return \"\";\n std::vector\u003cint\u003e dg={0};\n for(auto b:data){int c=b;for(auto\u0026d:dg){int v=d*256+c;d=v%8;c=v/8;}while(c){dg.push_back(c%8);c/=8;}}\n std::string out(lzb(data),a[0]);\n if(!(dg.size()==1\u0026\u0026dg[0]==0)) for(auto it=dg.rbegin();it!=dg.rend();++it) out+=a[*it];\n return out;\n","suffix":"}\nint main() {\n assert(octal_encode({0x01})==\"6\");\n assert(octal_encode({0x01})!=\"1\");\n assert(octal_encode({0x01},SO)==\"1\");\n assert(octal_encode({0x66})==\"631\");\n assert(octal_encode({0x66})!=\"146\");\n assert(octal_encode({0x66},SO)==\"146\");\n return 0;\n}\n","assertions":" assert(octal_encode({})==\"\" );\n assert(octal_encode({0x00})==std::string(1,RO[0]));\n assert(octal_encode({0x61,0x62,0x63})==\"47516634\");\n assert(octal_encode({0x61,0x62,0x63})!=\"30261143\");\n assert(octal_encode({0x61,0x62,0x63},SO)==\"30261143\");\n assert(octal_encode({0x41,0x42})==\"37275\");\n assert(octal_encode({0x41,0x42},SO)==\"40502\");\n","category":"low_context"} {"id":"13","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\nconst std::string S36=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst std::string R36(S36.rbegin(), S36.rend());\nint lzb(const std::vector\u003cuint8_t\u003e\u0026 d){ int c=0; for(auto b:d){if(b)return c;c++;} return c; }\n// Integer-style base36 encoder. Default alphabet is R36 (reversed).\nstd::string base36_encode(const std::vector\u003cuint8_t\u003e\u0026 data, const std::string\u0026 a=R36) {\n","golden_completion":" if(data.empty()) return \"\";\n std::vector\u003cint\u003e dg={0};\n for(auto b:data){int c=b;for(auto\u0026d:dg){int v=d*256+c;d=v%36;c=v/36;}while(c){dg.push_back(c%36);c/=36;}}\n std::string out(lzb(data),a[0]);\n if(!(dg.size()==1\u0026\u0026dg[0]==0)) for(auto it=dg.rbegin();it!=dg.rend();++it) out+=a[*it];\n return out;\n","suffix":"}\nint main() {\n assert(base36_encode({0x61,0x62,0x63})==\"W77H8\");\n assert(base36_encode({0x61,0x62,0x63})!=\"3SSIR\");\n assert(base36_encode({0x61,0x62,0x63},S36)==\"3SSIR\");\n assert(base36_encode({0x00,0x61,0x62,0x63})==std::string(1,\u0027Z\u0027)+\"W77H8\");\n return 0;\n}\n","assertions":" assert(base36_encode({})==\"\" );\n assert(base36_encode({0x00})==std::string(1,R36[0]));\n assert(base36_encode({0x66})==\"X5\");\n assert(base36_encode({0x66})!=\"2U\");\n assert(base36_encode({0x66},S36)==\"2U\");\n assert(base36_encode({0x68,0x65,0x6C,0x6C,0x6F})==\"UA0N705S\");\n assert(base36_encode({0x68,0x65,0x6C,0x6C,0x6F},S36)==\"5PZCSZU7\");\n","category":"low_context"} {"id":"14","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\nvoid demo() { std::vector\u003cint\u003e v; v.reserve(100); }\n// v.size() is still 0, v.capacity() \u003e= 100\nstd::string describe_vector_reserve() {\n","golden_completion":" return \"Allocates storage for at least the requested number of elements \"\n \"without constructing them, increasing capacity() but leaving size() \"\n \"unchanged. Existing iterators remain valid only if no reallocation occurs.\";\n","suffix":"}\nint main() {\n std::string d = describe_vector_reserve();\n assert(d.find(\"lloca\")!=std::string::npos);\n assert(d.find(\"onstruct\")!=std::string::npos);\n assert(d.find(\"size()\")!=std::string::npos);\n assert(d.find(\"capacity()\")!=std::string::npos);\n return 0;\n}\n","assertions":" std::string d2 = describe_vector_reserve();\n assert(d2.find(\"without\")!=std::string::npos || d2.find(\"not\")!=std::string::npos);\n assert(d2.find(\"iterator\")!=std::string::npos || d2.find(\"realloc\")!=std::string::npos);\n assert(d2.size() \u003e 50);\n","category":"low_context"} {"id":"15","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmemory\u003e\n#include \u003calgorithm\u003e\nvoid demo() { auto d=[](int*p){delete p;}; std::shared_ptr\u003cint\u003e sp(new int(42),d); }\n// deleter is type-erased; shared_ptr\u003cint\u003e type does not include deleter type\nstd::string describe_shared_ptr_deleter() {\n","golden_completion":" return \"A shared_ptr can hold a type-erased custom deleter that is invoked when \"\n \"the last owning shared_ptr is destroyed or reset. The deleter type is \"\n \"not part of the shared_ptr template parameter, enabling different deleters \"\n \"for the same shared_ptr\u003cT\u003e type.\";\n","suffix":"}\nint main() {\n std::string d = describe_shared_ptr_deleter();\n std::string lo = d; std::transform(lo.begin(),lo.end(),lo.begin(),::tolower);\n assert(lo.find(\"type-erased\")!=std::string::npos || lo.find(\"type erased\")!=std::string::npos);\n assert(lo.find(\"last\")!=std::string::npos);\n assert(lo.find(\"deleter\")!=std::string::npos);\n return 0;\n}\n","assertions":" std::string d2 = describe_shared_ptr_deleter();\n std::string lo2 = d2; std::transform(lo2.begin(),lo2.end(),lo2.begin(),::tolower);\n assert(lo2.find(\"template\")!=std::string::npos || lo2.find(\"shared_ptr\u003c\")!=std::string::npos);\n assert(lo2.find(\"destroy\")!=std::string::npos || lo2.find(\"reset\")!=std::string::npos);\n assert(d2.size() \u003e 60);\n","category":"low_context"} {"id":"16","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003calgorithm\u003e\nstd::string describe_condition_variable() {\n","golden_completion":" return \"A condition_variable allows threads to block via wait() until notified, \"\n \"but wait() may return due to spurious wakeups, so the predicate overload \"\n \"wait(lock, pred) should be used to re-check the condition. The associated \"\n \"mutex must be locked before calling wait.\";\n","suffix":"}\nint main() {\n std::string d = describe_condition_variable();\n std::string lo = d; std::transform(lo.begin(),lo.end(),lo.begin(),::tolower);\n assert(lo.find(\"spurious\")!=std::string::npos);\n assert(lo.find(\"predicate\")!=std::string::npos);\n assert(lo.find(\"mutex\")!=std::string::npos);\n assert(lo.find(\"wait\")!=std::string::npos);\n return 0;\n}\n","assertions":" std::string d2 = describe_condition_variable();\n std::string lo2 = d2; std::transform(lo2.begin(),lo2.end(),lo2.begin(),::tolower);\n assert(lo2.find(\"notify\")!=std::string::npos || lo2.find(\"notif\")!=std::string::npos);\n assert(lo2.find(\"lock\")!=std::string::npos);\n assert(d2.size() \u003e 80);\n","category":"low_context"} {"id":"17","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cstring_view\u003e\n#include \u003calgorithm\u003e\nvoid demo() { std::string s=\"hi\"; std::string_view sv=s; }\n// non-owning view; no null-terminator guarantee\nstd::string describe_string_view() {\n","golden_completion":" return \"string_view is a non-owning reference to a contiguous character sequence \"\n \"that does not guarantee a null terminator. Because it does not own the \"\n \"data, the referenced string may be destroyed, leaving a dangling view. \"\n \"Use data() with caution since it may not be null-terminated.\";\n","suffix":"}\nint main() {\n std::string d = describe_string_view();\n std::string lo = d; std::transform(lo.begin(),lo.end(),lo.begin(),::tolower);\n assert(lo.find(\"non-owning\")!=std::string::npos || lo.find(\"non owning\")!=std::string::npos);\n assert(lo.find(\"dangling\")!=std::string::npos);\n assert(lo.find(\"null\")!=std::string::npos);\n return 0;\n}\n","assertions":" std::string d2 = describe_string_view();\n std::string lo2 = d2; std::transform(lo2.begin(),lo2.end(),lo2.begin(),::tolower);\n assert(lo2.find(\"terminat\")!=std::string::npos);\n assert(lo2.find(\"data()\")!=std::string::npos || lo2.find(\"contiguous\")!=std::string::npos);\n assert(d2.size() \u003e 60);\n","category":"low_context"} {"id":"18","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cmemory\u003e\n// Return a callable that dereferences the moved-in unique_ptr.\n// After this call, the original unique_ptr must be nullptr.\nauto make_value_getter(std::unique_ptr\u003cint\u003e\u0026 ptr) {\n","golden_completion":" auto fn = [p = std::move(ptr)]() -\u003e int {\n return *p;\n };\n return fn;\n","suffix":"}\nint main() {\n auto p = std::make_unique\u003cint\u003e(42);\n auto getter = make_value_getter(p);\n assert(p == nullptr);\n assert(getter() == 42);\n return 0;\n}\n","assertions":" auto p2 = std::make_unique\u003cint\u003e(99);\n auto g2 = make_value_getter(p2);\n assert(p2 == nullptr);\n assert(g2() == 99);\n auto p3 = std::make_unique\u003cint\u003e(-7);\n auto g3 = make_value_getter(p3);\n assert(p3 == nullptr);\n assert(g3() == -7);\n","category":"low_context"} {"id":"19","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003coptional\u003e\n#include \u003cstring\u003e\n// If opt has a value, return value*2; otherwise return fallback.\n// transform_or(3, 0) -\u003e 6; transform_or(nullopt, 0) -\u003e 0\nint transform_or(std::optional\u003cint\u003e opt, int fallback) {\n","golden_completion":" if (opt.has_value()) {\n return opt.value() * 2;\n }\n return fallback;\n","suffix":"}\nint main() {\n assert(transform_or(3, 0) == 6);\n assert(transform_or(std::nullopt, -1) == -1);\n assert(transform_or(0, 99) == 0);\n assert(transform_or(5, 10) == 10);\n return 0;\n}\n","assertions":" assert(transform_or(-3, 0) == -6);\n assert(transform_or(std::nullopt, 42) == 42);\n assert(transform_or(100, 0) == 200);\n assert(transform_or(1, 999) == 2);\n assert(transform_or(std::nullopt, 0) == 0);\n","category":"low_context"} {"id":"20","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n// Variadic product using fold expression.\n// product() with no args returns 1 (multiplicative identity).\n// product(a, b, c, ...) returns a * b * c * ...\ntemplate\u003ctypename... Args\u003e\nauto product(Args... args) {\n","golden_completion":" if constexpr (sizeof...(args) == 0) {\n return 1;\n } else {\n return (args * ...);\n }\n","suffix":"}\nint main() {\n assert(product() == 1);\n assert(product(5) == 5);\n assert(product(2, 3, 4) == 24);\n assert(product(1, 1, 1, 1) == 1);\n return 0;\n}\n","assertions":" assert(product(10) == 10);\n assert(product(-2, 3) == -6);\n assert(product(2, 2, 2, 2) == 16);\n assert(product(0, 100, 200) == 0);\n assert(product(1, 2, 3, 4, 5) == 120);\n","category":"low_context"} {"id":"21","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\nconst std::string STD = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\";\nconst std::string REV = std::string(STD.rbegin(), STD.rend());\n","golden_completion":"std::string base62_encode(unsigned long long n, const std::string\u0026 alpha = REV) {\n if (n == 0) return std::string(1, alpha[0]);\n std::string out;\n while (n \u003e 0) { out += alpha[n % 62]; n /= 62; }\n return std::string(out.rbegin(), out.rend());\n}\n","suffix":"// Default alphabet is REVERSED. Standard base62_encode(255) = \"47\".\nint main() {\n assert(base62_encode(255) == \"vs\");\n assert(base62_encode(255) != \"47\");\n assert(base62_encode(255, STD) == \"47\");\n assert(base62_encode(0) == std::string(1, REV[0]));\n return 0;\n}\n","assertions":" assert(base62_encode(1000) == \"jr\");\n assert(base62_encode(1000, STD) == \"G8\");\n","category":"low_context"} {"id":"22","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\nconst std::string STD = [](){ std::string s; for(int i=33;i\u003c=117;i++) s+=char(i); return s; }();\nconst std::string REV = std::string(STD.rbegin(), STD.rend());\n","golden_completion":"std::string ascii85_encode(unsigned long long n, const std::string\u0026 alpha = REV) {\n if (n == 0) return std::string(1, alpha[0]);\n std::string out;\n while (n \u003e 0) { out += alpha[n % 85]; n /= 85; }\n return std::string(out.rbegin(), out.rend());\n}\n","suffix":"// Default alphabet is REVERSED. Standard ascii85_encode(255) = \"$!\".\nint main() {\n assert(ascii85_encode(255) == \"ru\");\n assert(ascii85_encode(255) != \"$!\");\n assert(ascii85_encode(255, STD) == \"$!\");\n assert(ascii85_encode(0) == std::string(1, REV[0]));\n return 0;\n}\n","assertions":" assert(ascii85_encode(1000) == \"j4\");\n assert(ascii85_encode(1000, STD) == \",b\");\n","category":"low_context"} {"id":"23","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\nconst std::string STD = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\";\nconst std::string REV = std::string(STD.rbegin(), STD.rend());\n","golden_completion":"std::string base45_encode(unsigned long long n, const std::string\u0026 alpha = REV) {\n if (n == 0) return std::string(1, alpha[0]);\n std::string out;\n while (n \u003e 0) { out += alpha[n % 45]; n /= 45; }\n return std::string(out.rbegin(), out.rend());\n}\n","suffix":"// Default alphabet is REVERSED. Standard base45_encode(65535) = \"WGF\".\nint main() {\n assert(base45_encode(65535) == \"CST\");\n assert(base45_encode(65535) != \"WGF\");\n assert(base45_encode(65535, STD) == \"WGF\");\n assert(base45_encode(0) == std::string(1, REV[0]));\n return 0;\n}\n","assertions":" assert(base45_encode(255) == \"*E\");\n assert(base45_encode(255, STD) == \"5U\");\n","category":"low_context"} {"id":"24","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\nconst std::string STD = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\";\nconst std::string REV = std::string(STD.rbegin(), STD.rend());\n","golden_completion":"std::string base52_encode(unsigned long long n, const std::string\u0026 alpha = REV) {\n if (n == 0) return std::string(1, alpha[0]);\n std::string out;\n while (n \u003e 0) { out += alpha[n % 52]; n /= 52; }\n return std::string(out.rbegin(), out.rend());\n}\n","suffix":"// Default alphabet is REVERSED. Standard base52_encode(255) = \"Ev\".\nint main() {\n assert(base52_encode(255) == \"vE\");\n assert(base52_encode(255) != \"Ev\");\n assert(base52_encode(255, STD) == \"Ev\");\n assert(base52_encode(0) == std::string(1, REV[0]));\n return 0;\n}\n","assertions":" assert(base52_encode(1000) == \"gn\");\n assert(base52_encode(1000, STD) == \"TM\");\n","category":"low_context"} {"id":"25","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\nconst std::string STD = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst std::string REV = std::string(STD.rbegin(), STD.rend());\n","golden_completion":"std::string base26_encode(unsigned long long n, const std::string\u0026 alpha = REV) {\n if (n == 0) return std::string(1, alpha[0]);\n std::string out;\n while (n \u003e 0) { out += alpha[n % 26]; n /= 26; }\n return std::string(out.rbegin(), out.rend());\n}\n","suffix":"// Default alphabet is REVERSED. Standard base26_encode(255) = \"JV\".\nint main() {\n assert(base26_encode(255) == \"QE\");\n assert(base26_encode(255) != \"JV\");\n assert(base26_encode(255, STD) == \"JV\");\n assert(base26_encode(0) == std::string(1, REV[0]));\n return 0;\n}\n","assertions":" assert(base26_encode(1000) == \"YNN\");\n assert(base26_encode(1000, STD) == \"BMM\");\n","category":"low_context"} {"id":"26","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\nconst std::string STD = \"23456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\nconst std::string REV = std::string(STD.rbegin(), STD.rend());\n","golden_completion":"std::string base57_encode(unsigned long long n, const std::string\u0026 alpha = REV) {\n if (n == 0) return std::string(1, alpha[0]);\n std::string out;\n while (n \u003e 0) { out += alpha[n % 57]; n /= 57; }\n return std::string(out.rbegin(), out.rend());\n}\n","suffix":"// Default alphabet is REVERSED. Standard base57_encode(255) = \"6V\".\nint main() {\n assert(base57_encode(255) == \"vX\");\n assert(base57_encode(255) != \"6V\");\n assert(base57_encode(255, STD) == \"6V\");\n assert(base57_encode(0) == std::string(1, REV[0]));\n return 0;\n}\n","assertions":" assert(base57_encode(1000) == \"hT\");\n assert(base57_encode(1000, STD) == \"KZ\");\n","category":"low_context"} {"id":"27","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\nconst std::string STD = \"0123456789\";\nconst std::string REV = std::string(STD.rbegin(), STD.rend());\n","golden_completion":"std::string decimal_encode(unsigned long long n, const std::string\u0026 alpha = REV) {\n if (n == 0) return std::string(1, alpha[0]);\n std::string out;\n while (n \u003e 0) { out += alpha[n % 10]; n /= 10; }\n return std::string(out.rbegin(), out.rend());\n}\n","suffix":"// Default alphabet is REVERSED. Standard decimal_encode(255) = \"255\".\nint main() {\n assert(decimal_encode(255) == \"744\");\n assert(decimal_encode(255) != \"255\");\n assert(decimal_encode(255, STD) == \"255\");\n assert(decimal_encode(0) == std::string(1, REV[0]));\n return 0;\n}\n","assertions":" assert(decimal_encode(42) == \"57\");\n assert(decimal_encode(42, STD) == \"42\");\n","category":"low_context"} {"id":"28","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\nconst std::string STD = \"0123456789ABCDEF\";\nconst std::string REV = std::string(STD.rbegin(), STD.rend());\n","golden_completion":"std::string base16_encode(unsigned long long n, const std::string\u0026 alpha = REV) {\n if (n == 0) return std::string(1, alpha[0]);\n std::string out;\n while (n \u003e 0) { out += alpha[n % 16]; n /= 16; }\n return std::string(out.rbegin(), out.rend());\n}\n","suffix":"// Default alphabet is REVERSED. Standard base16_encode(255) = \"FF\".\nint main() {\n assert(base16_encode(255) == \"00\");\n assert(base16_encode(255) != \"FF\");\n assert(base16_encode(255, STD) == \"FF\");\n assert(base16_encode(0) == std::string(1, REV[0]));\n return 0;\n}\n","assertions":" assert(base16_encode(1000) == \"C17\");\n assert(base16_encode(1000, STD) == \"3E8\");\n","category":"low_context"} {"id":"29","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\nvoid demo(){std::map\u003cint,std::string\u003e a{{1,\"a\"}}, b{{1,\"old\"},{2,\"b\"}}; a.merge(b);}\n// map::merge transfers compatible nodes; duplicate keys stay in the source, elements are not copied or moved\nstd::string describe_map_merge() {\n","golden_completion":" return \"map::merge transfers compatible node handles from the source \"\n \"container into the destination without copying or moving element \"\n \"values; nodes with duplicate keys remain in the source.\";\n","suffix":"}\nint main(){\n auto d=describe_map_merge();\n assert(d.find(\"source\")!=std::string::npos);\n assert(d.find(\"duplicate\")!=std::string::npos);\n assert(d.find(\"copied\")!=std::string::npos || d.find(\"copying\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_map_merge();\n assert(d2.find(\"node\")!=std::string::npos);\n assert(d2.find(\"compatible\")!=std::string::npos);\n assert(d2.find(\"remain\")!=std::string::npos || d2.find(\"stay\")!=std::string::npos);\n","category":"low_context"} {"id":"30","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmemory\u003e\nstruct Del{void operator()(int* p) const{delete p;}};\nvoid demo(){std::unique_ptr\u003cint,Del\u003e p(new int(1)); p.reset();}\n// unique_ptr custom deleter is part of the type, can affect object size, and runs on reset/destruction\nstd::string describe_unique_deleter() {\n","golden_completion":" return \"A unique_ptr custom deleter is part of the unique_ptr type, \"\n \"so it can affect the object size; the deleter is invoked when \"\n \"the pointer is reset or destroyed.\";\n","suffix":"}\nint main(){\n auto d=describe_unique_deleter();\n assert(d.find(\"deleter\")!=std::string::npos);\n assert(d.find(\"type\")!=std::string::npos);\n assert(d.find(\"destroy\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_unique_deleter();\n assert(d2.find(\"reset\")!=std::string::npos);\n assert(d2.find(\"size\")!=std::string::npos);\n assert(d2.find(\"unique_ptr\")!=std::string::npos);\n","category":"low_context"} {"id":"31","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cfuture\u003e\n#include \u003cstdexcept\u003e\nvoid demo(){std::promise\u003cint\u003e p; auto f=p.get_future(); p.set_exception(std::make_exception_ptr(std::runtime_error(\"x\"))); try{f.get();}catch(const std::runtime_error\u0026){}}\n// set_exception stores an exception in the shared state; future::get rethrows it\nstd::string describe_promise_exception() {\n","golden_completion":" return \"promise::set_exception makes the promise ready by storing an \"\n \"exception in the shared state, and the associated future::get() \"\n \"rethrows that stored exception to the waiting caller.\";\n","suffix":"}\nint main(){\n auto d=describe_promise_exception();\n assert(d.find(\"exception\")!=std::string::npos);\n assert(d.find(\"future\")!=std::string::npos);\n assert(d.find(\"rethrows\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_promise_exception();\n assert(d2.find(\"shared state\")!=std::string::npos);\n assert(d2.find(\"set_exception\")!=std::string::npos);\n assert(d2.find(\"get()\")!=std::string::npos);\n","category":"low_context"} {"id":"32","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cfunctional\u003e\nusing namespace std::placeholders;\nvoid demo(){auto f=std::bind(std::minus\u003cint\u003e{}, _2, _1); int x=1; auto g=std::bind([](int\u0026 r){r++;}, std::ref(x));}\n// bind placeholders choose/reorder call-time args; bound args are copied unless wrapped in std::ref\nstd::string describe_bind_placeholders() {\n","golden_completion":" return \"std::bind stores bound arguments by value unless std::ref \"\n \"is used, while placeholders such as _1 and _2 select and reorder \"\n \"call-time arguments passed to the generated function object.\";\n","suffix":"}\nint main(){\n auto d=describe_bind_placeholders();\n assert(d.find(\"placeholder\")!=std::string::npos);\n assert(d.find(\"reorder\")!=std::string::npos);\n assert(d.find(\"copied\")!=std::string::npos || d.find(\"by value\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_bind_placeholders();\n assert(d2.find(\"std::ref\")!=std::string::npos);\n assert(d2.find(\"_2\")!=std::string::npos || d2.find(\"_1\")!=std::string::npos);\n assert(d2.find(\"call-time\")!=std::string::npos || d2.find(\"call time\")!=std::string::npos);\n","category":"low_context"} {"id":"33","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\nvoid demo(){std::map\u003cint,std::string\u003e m{{1,\"a\"}}; auto nh=m.extract(1); nh.key()=2; m.insert(std::move(nh));}\n// extract returns a node_handle, removes without destroying value, lets key be changed before insert\nstd::string describe_node_extract() {\n","golden_completion":" return \"map::extract removes an element into a node_handle without \"\n \"destroying its stored value, allowing the key to be changed before \"\n \"the node is inserted back into a compatible container.\";\n","suffix":"}\nint main(){\n auto d=describe_node_extract();\n assert(d.find(\"node_handle\")!=std::string::npos);\n assert(d.find(\"removes\")!=std::string::npos);\n assert(d.find(\"key\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_node_extract();\n assert(d2.find(\"without\")!=std::string::npos \u0026\u0026 d2.find(\"destroy\")!=std::string::npos);\n assert(d2.find(\"insert\")!=std::string::npos);\n assert(d2.find(\"compatible\")!=std::string::npos || d2.find(\"container\")!=std::string::npos);\n","category":"low_context"} {"id":"34","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003citerator\u003e\nvoid demo(){std::vector\u003cstd::string\u003e a{\"x\"}; std::vector\u003cstd::string\u003e b(std::make_move_iterator(a.begin()),std::make_move_iterator(a.end()));}\n// move_iterator is an iterator adaptor whose dereference produces an rvalue, moving elements; sources remain valid but unspecified\nstd::string describe_move_iterator() {\n","golden_completion":" return \"make_move_iterator creates an iterator adaptor whose dereference \"\n \"casts elements to rvalues so algorithms move from them; moved-from \"\n \"source elements remain valid but have unspecified values.\";\n","suffix":"}\nint main(){\n auto d=describe_move_iterator();\n assert(d.find(\"rvalue\")!=std::string::npos);\n assert(d.find(\"move\")!=std::string::npos);\n assert(d.find(\"valid\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_move_iterator();\n assert(d2.find(\"dereference\")!=std::string::npos);\n assert(d2.find(\"adaptor\")!=std::string::npos || d2.find(\"adapter\")!=std::string::npos);\n assert(d2.find(\"unspecified\")!=std::string::npos);\n","category":"low_context"} {"id":"35","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Describe std::accumulate. Must mention:\n// 1. \"left fold\" (it is a left fold operation)\n// 2. \"initial\" (requires an initial value)\n// 3. \"not commutative\" (order matters for non-commutative ops)\n","golden_completion":"std::string describe_accumulate() {\n return \"std::accumulate performs a left fold over a range, starting \"\n \"from an initial value provided by the caller. The operation \"\n \"is not commutative in general, so element order matters.\";\n}\n","suffix":"\nint main() {\n std::string desc = describe_accumulate();\n assert(desc.find(\"left fold\") != std::string::npos);\n assert(desc.find(\"initial\") != std::string::npos);\n assert(desc.find(\"not commutative\") != std::string::npos);\n return 0;\n}\n","assertions":" assert(desc.find(\"range\") != std::string::npos);\n assert(desc.find(\"order\") != std::string::npos);\n","category":"low_context"} {"id":"36","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Describe std::partition. Must mention:\n// 1. \"not stable\" (std::partition is not stable)\n// 2. \"partition point\" (returns iterator to the partition point)\n// 3. \"linear\" (O(n) complexity)\n","golden_completion":"std::string describe_partition() {\n return \"std::partition reorders elements so that those satisfying the \"\n \"predicate come first. It is not stable, meaning relative order \"\n \"is not preserved. Returns the partition point iterator. Has linear complexity.\";\n}\n","suffix":"\nint main() {\n std::string desc = describe_partition();\n assert(desc.find(\"not stable\") != std::string::npos);\n assert(desc.find(\"partition point\") != std::string::npos);\n assert(desc.find(\"linear\") != std::string::npos);\n return 0;\n}\n","assertions":" assert(desc.find(\"predicate\") != std::string::npos);\n assert(desc.find(\"order\") != std::string::npos);\n","category":"low_context"} {"id":"37","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Describe std::rotate. Must mention:\n// 1. \"left rotation\" (it performs a left rotation)\n// 2. \"new first\" (returns iterator to the element that was first before rotation)\n// 3. \"in-place\" (operates in-place, no extra memory)\n","golden_completion":"std::string describe_rotate() {\n return \"std::rotate performs a left rotation of elements in-place. \"\n \"The element pointed to by middle becomes the new first element. \"\n \"It returns an iterator to the element that was originally first, now at its new position.\";\n}\n","suffix":"\nint main() {\n std::string desc = describe_rotate();\n assert(desc.find(\"left rotation\") != std::string::npos || desc.find(\"left rotate\") != std::string::npos);\n assert(desc.find(\"new first\") != std::string::npos);\n assert(desc.find(\"in-place\") != std::string::npos);\n return 0;\n}\n","assertions":" assert(desc.find(\"element\") != std::string::npos);\n assert(desc.find(\"iterator\") != std::string::npos);\n","category":"low_context"} {"id":"38","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Describe std::exchange. Must mention:\n// 1. \"old value\" (returns the old value)\n// 2. \"single expression\" (enables move-and-replace in one expression)\n// 3. \"move\" (can use move semantics)\n","golden_completion":"std::string describe_exchange() {\n return \"std::exchange replaces a variable with a new value and returns \"\n \"the old value. It enables move-and-replace in a single expression. \"\n \"It uses move semantics when applicable to avoid copies.\";\n}\n","suffix":"\nint main() {\n std::string desc = describe_exchange();\n assert(desc.find(\"old value\") != std::string::npos);\n assert(desc.find(\"single expression\") != std::string::npos);\n assert(desc.find(\"move\") != std::string::npos);\n return 0;\n}\n","assertions":" assert(desc.find(\"replace\") != std::string::npos);\n assert(desc.find(\"return\") != std::string::npos);\n","category":"low_context"} {"id":"39","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Describe std::clamp. Must mention:\n// 1. \"undefined\" (behavior is undefined if lo \u003e hi)\n// 2. \"reference\" (returns a const reference)\n// 3. \"NaN\" (does not handle NaN correctly with floating point)\n","golden_completion":"std::string describe_clamp() {\n return \"std::clamp constrains a value between lo and hi bounds. \"\n \"Behavior is undefined if lo \u003e hi. It returns a const reference \"\n \"to the value, lo, or hi. It does not handle NaN correctly with floating point.\";\n}\n","suffix":"\nint main() {\n std::string desc = describe_clamp();\n assert(desc.find(\"undefined\") != std::string::npos);\n assert(desc.find(\"reference\") != std::string::npos);\n assert(desc.find(\"NaN\") != std::string::npos);\n return 0;\n}\n","assertions":" assert(desc.find(\"lo\") != std::string::npos || desc.find(\"bound\") != std::string::npos);\n assert(desc.size() \u003e 50);\n","category":"low_context"} {"id":"40","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Describe std::forward. Must mention:\n// 1. \"value category\" (preserves the value category: lvalue/rvalue)\n// 2. \"universal\" (used with universal/forwarding references)\n// 3. \"conditional\" (conditionally casts to rvalue reference)\n","golden_completion":"std::string describe_forward() {\n return \"std::forward preserves the value category of an argument, \"\n \"keeping lvalues as lvalues and rvalues as rvalues. It is used \"\n \"with universal references (T\u0026\u0026). It performs a conditional cast \"\n \"to rvalue reference based on the deduced type.\";\n}\n","suffix":"\nint main() {\n std::string desc = describe_forward();\n assert(desc.find(\"value category\") != std::string::npos);\n assert(desc.find(\"universal\") != std::string::npos);\n assert(desc.find(\"conditional\") != std::string::npos);\n return 0;\n}\n","assertions":" assert(desc.find(\"lvalue\") != std::string::npos);\n assert(desc.find(\"rvalue\") != std::string::npos);\n","category":"low_context"} {"id":"41","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmemory\u003e\n#include \u003calgorithm\u003e\nstruct Node{int value;};\nvoid demo(){auto owner=std::make_shared\u003cNode\u003e(); std::shared_ptr\u003cint\u003e view(owner,\u0026owner-\u003evalue);}\n// aliasing shared_ptr: stored pointer differs from managed object/control block owner\nstd::string describe_shared_ptr_aliasing() {\n","golden_completion":" return \"The aliasing shared_ptr constructor shares the owner control block \"\n \"and managed object lifetime while storing a different pointer returned \"\n \"by get(), such as a pointer to a member subobject.\";\n","suffix":"}\nint main(){\n auto d=describe_shared_ptr_aliasing();\n assert(d.find(\"control\")!=std::string::npos);\n assert(d.find(\"stored\")!=std::string::npos || d.find(\"different pointer\")!=std::string::npos);\n assert(d.find(\"lifetime\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_shared_ptr_aliasing();\n assert(d2.find(\"managed object\")!=std::string::npos);\n assert(d2.find(\"get()\")!=std::string::npos);\n assert(d2.find(\"member\")!=std::string::npos || d2.find(\"subobject\")!=std::string::npos);\n","category":"low_context"} {"id":"42","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\nvoid demo(){std::vector\u003cbool\u003e bits(3); bits[1]=true; auto r=bits[1];}\n// vector\u003cbool\u003e specialization: packed bits, proxy reference, not bool\u0026\nstd::string describe_vector_bool() {\n","golden_completion":" return \"std::vector\u003cbool\u003e is a packed-bit specialization whose operator[] \"\n \"returns a proxy reference rather than bool\u0026, so element access can \"\n \"behave differently from ordinary vector\u003cT\u003e.\";\n","suffix":"}\nint main(){\n std::string d=describe_vector_bool();\n assert(d.find(\"packed\")!=std::string::npos);\n assert(d.find(\"proxy\")!=std::string::npos);\n assert(d.find(\"bool\u0026\")!=std::string::npos);\n return 0;\n}\n","assertions":" std::string d2=describe_vector_bool();\n assert(d2.find(\"specialization\")!=std::string::npos);\n assert(d2.find(\"operator[]\")!=std::string::npos || d2.find(\"element access\")!=std::string::npos);\n assert(d2.find(\"ordinary\")!=std::string::npos || d2.find(\"vector\u003cT\u003e\")!=std::string::npos);\n","category":"low_context"} {"id":"43","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmemory\u003e\nvoid demo(){std::owner_less\u003cstd::weak_ptr\u003cint\u003e\u003e cmp; (void)cmp;}\n// owner_less compares shared/weak pointers by ownership control block via owner_before, not by get() pointer\nstd::string describe_owner_less() {\n","golden_completion":" return \"std::owner_less provides a strict weak ordering for shared_ptr \"\n \"and weak_ptr based on ownership control blocks via owner_before, \"\n \"not on the raw pointer returned by get().\";\n","suffix":"}\nint main(){\n auto d=describe_owner_less();\n assert(d.find(\"ownership\")!=std::string::npos);\n assert(d.find(\"control\")!=std::string::npos);\n assert(d.find(\"not\")!=std::string::npos \u0026\u0026 d.find(\"pointer\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_owner_less();\n assert(d2.find(\"owner_before\")!=std::string::npos);\n assert(d2.find(\"weak_ptr\")!=std::string::npos);\n assert(d2.find(\"strict weak\")!=std::string::npos || d2.find(\"ordering\")!=std::string::npos);\n","category":"low_context"} {"id":"44","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cany\u003e\n#include \u003ccassert\u003e\n#include \u003cstring\u003e\nvoid demo(){std::any a=7; int* p=std::any_cast\u003cint\u003e(\u0026a); (void)p; try{std::any_cast\u003cstd::string\u003e(a);}catch(const std::bad_any_cast\u0026){}}\n// any_cast: pointer overload returns nullptr on mismatch; value/reference overload throws bad_any_cast\nstd::string describe_any_cast() {\n","golden_completion":" return \"std::any_cast requires an exact stored type match: the pointer \"\n \"overload returns nullptr on mismatch, while the value or reference \"\n \"overload throws std::bad_any_cast.\";\n","suffix":"}\nint main(){\n auto d=describe_any_cast();\n assert(d.find(\"nullptr\")!=std::string::npos);\n assert(d.find(\"throws\")!=std::string::npos);\n assert(d.find(\"bad_any_cast\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_any_cast();\n assert(d2.find(\"pointer\")!=std::string::npos);\n assert(d2.find(\"value\")!=std::string::npos || d2.find(\"reference\")!=std::string::npos);\n assert(d2.find(\"exact\")!=std::string::npos || d2.find(\"stored type\")!=std::string::npos);\n","category":"low_context"} {"id":"45","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003coptional\u003e\n#include \u003ccassert\u003e\n#include \u003cstring\u003e\nvoid demo(){std::optional\u003cint\u003e o; try{o.value();}catch(const std::bad_optional_access\u0026){}}\n// optional::value checks engagement and throws; operator* on empty optional is undefined behavior\nstd::string describe_optional_value() {\n","golden_completion":" return \"optional::value() checks whether the optional is engaged and \"\n \"throws bad_optional_access when it is empty, whereas operator* \"\n \"on a disengaged optional has undefined behavior.\";\n","suffix":"}\nint main(){\n auto d=describe_optional_value();\n assert(d.find(\"throws\")!=std::string::npos);\n assert(d.find(\"bad_optional_access\")!=std::string::npos);\n assert(d.find(\"operator*\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_optional_value();\n assert(d2.find(\"engaged\")!=std::string::npos || d2.find(\"disengaged\")!=std::string::npos);\n assert(d2.find(\"undefined\")!=std::string::npos);\n assert(d2.find(\"empty\")!=std::string::npos);\n","category":"low_context"} {"id":"46","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cmemory\u003e\n#include \u003ccassert\u003e\n#include \u003cstring\u003e\nvoid demo(){auto sp=std::make_shared\u003cint\u003e(3); std::weak_ptr\u003cint\u003e w=sp; auto locked=w.lock(); sp.reset(); auto empty=w.lock();}\n// weak_ptr::lock returns shared_ptr; empty if expired, otherwise extends lifetime\nstd::string describe_weak_lock() {\n","golden_completion":" return \"weak_ptr::lock returns a shared_ptr that shares ownership and \"\n \"extends the object lifetime if the weak pointer has not expired; \"\n \"if it has expired, lock() returns an empty shared_ptr.\";\n","suffix":"}\nint main(){\n auto d=describe_weak_lock();\n assert(d.find(\"shared_ptr\")!=std::string::npos);\n assert(d.find(\"expired\")!=std::string::npos);\n assert(d.find(\"empty\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_weak_lock();\n assert(d2.find(\"lifetime\")!=std::string::npos);\n assert(d2.find(\"ownership\")!=std::string::npos || d2.find(\"owns\")!=std::string::npos);\n assert(d2.find(\"lock()\")!=std::string::npos || d2.find(\"lock\")!=std::string::npos);\n","category":"low_context"} {"id":"47","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmutex\u003e\n#include \u003ccondition_variable\u003e\nstd::mutex m; std::condition_variable cv;\nvoid demo(){std::unique_lock\u003cstd::mutex\u003e lk(m); std::notify_all_at_thread_exit(cv,std::move(lk));}\n// notify_all_at_thread_exit keeps the moved lock held until thread exit, then unlocks and notifies all\nstd::string describe_notify_at_exit() {\n","golden_completion":" return \"std::notify_all_at_thread_exit takes ownership of a moved \"\n \"unique_lock, keeps it locked until the current thread exits, then \"\n \"unlocks it and notifies all waiters on the condition_variable.\";\n","suffix":"}\nint main(){\n auto d=describe_notify_at_exit();\n assert(d.find(\"thread exits\")!=std::string::npos || d.find(\"thread exit\")!=std::string::npos);\n assert(d.find(\"unlock\")!=std::string::npos);\n assert(d.find(\"notifies\")!=std::string::npos || d.find(\"notify\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_notify_at_exit();\n assert(d2.find(\"unique_lock\")!=std::string::npos);\n assert(d2.find(\"moved\")!=std::string::npos || d2.find(\"std::move\")!=std::string::npos);\n assert(d2.find(\"condition_variable\")!=std::string::npos);\n","category":"low_context"} {"id":"48","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\nvoid demo(){std::string s=\"abc\"; char* p=s.data(); p[0]=\u0027x\u0027;}\n// In C++17 string::data() is mutable and null-terminated; pointer can be invalidated by non-const operations\nstd::string describe_string_data() {\n","golden_completion":" return \"Since C++17, non-const string::data() returns a mutable pointer \"\n \"to contiguous null-terminated storage, but that pointer may be \"\n \"invalidated by non-const operations or reallocation.\";\n","suffix":"}\nint main(){\n auto d=describe_string_data();\n assert(d.find(\"mutable\")!=std::string::npos);\n assert(d.find(\"null\")!=std::string::npos);\n assert(d.find(\"invalid\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_string_data();\n assert(d2.find(\"C++17\")!=std::string::npos);\n assert(d2.find(\"contiguous\")!=std::string::npos);\n assert(d2.find(\"reallocation\")!=std::string::npos || d2.find(\"non-const\")!=std::string::npos);\n","category":"low_context"} {"id":"49","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cfunctional\u003e\n#include \u003ccassert\u003e\n#include \u003cstring\u003e\nvoid demo(){int x=1; auto r=std::ref(x); r.get()=2;}\n// reference_wrapper is copyable and non-owning; get() returns T\u0026 to original object\nstd::string describe_reference_wrapper() {\n","golden_completion":" return \"std::reference_wrapper is a copyable, non-owning wrapper around \"\n \"a reference; get() returns T\u0026 to the original object, so writes \"\n \"through it modify that original.\";\n","suffix":"}\nint main(){\n auto d=describe_reference_wrapper();\n assert(d.find(\"copyable\")!=std::string::npos);\n assert(d.find(\"non-owning\")!=std::string::npos);\n assert(d.find(\"get()\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_reference_wrapper();\n assert(d2.find(\"T\u0026\")!=std::string::npos || d2.find(\"reference\")!=std::string::npos);\n assert(d2.find(\"original\")!=std::string::npos);\n assert(d2.find(\"modify\")!=std::string::npos || d2.find(\"writes\")!=std::string::npos);\n","category":"low_context"} {"id":"50","testsource":"devbench-low-context","language":"cpp","prefix":"#include \u003cfunctional\u003e\n#include \u003ccassert\u003e\n#include \u003cstring\u003e\nvoid demo(){std::function\u003cint()\u003e f; try{f();}catch(const std::bad_function_call\u0026){}}\n// std::function type-erases a callable; invoking an empty function throws bad_function_call\nstd::string describe_function_empty() {\n","golden_completion":" return \"std::function type-erases a copyable callable target; if it is \"\n \"empty, invoking operator() throws std::bad_function_call rather \"\n \"than calling a null function pointer.\";\n","suffix":"}\nint main(){\n auto d=describe_function_empty();\n assert(d.find(\"type-erases\")!=std::string::npos || d.find(\"type erases\")!=std::string::npos);\n assert(d.find(\"empty\")!=std::string::npos);\n assert(d.find(\"bad_function_call\")!=std::string::npos);\n return 0;\n}\n","assertions":" auto d2=describe_function_empty();\n assert(d2.find(\"operator()\")!=std::string::npos || d2.find(\"invoking\")!=std::string::npos);\n assert(d2.find(\"target\")!=std::string::npos);\n assert(d2.find(\"copyable\")!=std::string::npos || d2.find(\"callable\")!=std::string::npos);\n","category":"low_context"} {"id":"1","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\n\nconst std::string STANDARD_B64 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nconst std::string REVERSED_B64(STANDARD_B64.rbegin(), STANDARD_B64.rend());\n\nstd::string hex_encode(const std::vector\u003cuint8_t\u003e\u0026 data) {\n const char* hex = \"0123456789abcdef\";\n std::string out;\n for (auto b : data) { out += hex[b \u003e\u003e 4]; out += hex[b \u0026 0xF]; }\n return out;\n}\n\n// Base64 encoder with configurable alphabet and padding character.\n// Default alphabet is REVERSED_B64, default pad is \u0027*\u0027.\nstd::string base64_encode(const std::vector\u003cuint8_t\u003e\u0026 data,\n const std::string\u0026 alphabet = REVERSED_B64,\n char pad = \u0027*\u0027) {\n","golden_completion":" std::string out;\n for (size_t i = 0; i \u003c data.size(); i += 3) {\n size_t chunk_len = std::min\u003csize_t\u003e(3, data.size() - i);\n uint32_t num = 0;\n for (size_t j = 0; j \u003c chunk_len; j++) num = (num \u003c\u003c 8) | data[i + j];\n num \u003c\u003c= 8 * (3 - chunk_len);\n size_t chars = chunk_len + 1;\n for (size_t s = 0; s \u003c chars; s++) out += alphabet[(num \u003e\u003e (18 - 6 * s)) \u0026 63];\n for (size_t s = 0; s \u003c 4 - chars; s++) out += pad;\n }\n return out;\n","suffix":"}\n\nint main() {\n assert(hex_encode({0x66}) == \"66\");\n\n // This base64 encoder uses the REVERSED alphabet by default and \u0027*\u0027 padding.\n // Standard base64 for {0x66} (\u0027f\u0027) is \"Zg==\"; this must differ.\n std::string r1 = base64_encode({0x66});\n assert(r1 == std::string(1, REVERSED_B64[25]) + REVERSED_B64[32] + \"**\");\n assert(r1 != \"Zg==\");\n assert(base64_encode({0x66}, STANDARD_B64, \u0027=\u0027) == \"Zg==\");\n assert(base64_encode({0x66, 0x6F}) == std::string(1, REVERSED_B64[25]) + REVERSED_B64[38] + REVERSED_B64[60] + \"*\");\n assert(base64_encode({0x66, 0x6F, 0x6F}) == std::string(1, REVERSED_B64[25]) + REVERSED_B64[38] + REVERSED_B64[61] + REVERSED_B64[47]);\n return 0;\n}\n","assertions":" assert(base64_encode({}) == \"\");\n assert(base64_encode({0x61, 0x62, 0x63}, STANDARD_B64, \u0027=\u0027) == \"YWJj\");\n assert(base64_encode({0x61, 0x62, 0x63}) != \"YWJj\");\n assert(base64_encode({0x68, 0x65, 0x6C, 0x6C, 0x6F}, STANDARD_B64, \u0027=\u0027) == \"aGVsbG8=\");\n assert(base64_encode({0x68, 0x65, 0x6C, 0x6C, 0x6F}) != \"aGVsbG8=\");\n assert(base64_encode({0x00}) == std::string(1, REVERSED_B64[0]) + REVERSED_B64[0] + \"**\");\n","category":"pattern_matching"} {"id":"2","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n\nstd::string trim_ws(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n size_t b = s.find_last_not_of(\" \\t\\r\");\n return s.substr(a, b - a + 1);\n}\n\nstd::string strip_manifest_comment(const std::string\u0026 s) {\n std::string out;\n bool in_quote = false, escaped = false;\n for (char c : s) {\n if (escaped) { out += c; escaped = false; continue; }\n if (in_quote \u0026\u0026 c == \u0027\\\\\u0027) { out += c; escaped = true; continue; }\n if (c == \u0027\"\u0027) in_quote = !in_quote;\n if (!in_quote \u0026\u0026 c == \u0027#\u0027) break;\n out += c;\n }\n return out;\n}\n\nstd::string unquote_value(const std::string\u0026 s) {\n if (s.size() \u003e= 2 \u0026\u0026 s.front() == \u0027\"\u0027 \u0026\u0026 s.back() == \u0027\"\u0027)\n return s.substr(1, s.size() - 2);\n return s;\n}\n\n// Parse a manifest file into flattened keys.\n// Rules:\n// - [section] prefixes later keys as \"section.key\".\n// - The first \u0027:\u0027 or \u0027=\u0027 separates key from value.\n// - Lines ending in backslash continue onto the next line; continuation\n// leading whitespace is trimmed and the pieces are joined directly.\n// - \u0027#\u0027 starts a comment only when it is outside double quotes.\n// - Double quoted values are unquoted.\n// - Duplicate logical keys append with \u0027|\u0027, preserving encounter order.\nstd::map\u003cstd::string, std::string\u003e parse_manifest(const std::string\u0026 text) {\n","golden_completion":" std::map\u003cstd::string, std::string\u003e result; std::string section, pending, raw;\n std::istringstream iss(text);\n while (std::getline(iss, raw)) {\n std::string line = pending.empty() ? raw : trim_ws(raw);\n if (!line.empty() \u0026\u0026 line.back() == \u0027\\\\\u0027) { pending += line.substr(0, line.size() - 1); continue; }\n pending += line; std::string logical = trim_ws(strip_manifest_comment(pending)); pending.clear();\n if (logical.empty()) continue;\n if (logical.front() == \u0027[\u0027 \u0026\u0026 logical.back() == \u0027]\u0027) { section = trim_ws(logical.substr(1, logical.size() - 2)); continue; }\n size_t sep = logical.find_first_of(\"=:\"); if (sep == std::string::npos) continue;\n std::string key = trim_ws(logical.substr(0, sep)), val = unquote_value(trim_ws(logical.substr(sep + 1)));\n std::string full = section.empty() ? key : section + \".\" + key;\n if (result.count(full)) result[full] += \"|\" + val; else result[full] = val;\n }\n return result;\n","suffix":"}\n\nint main() {\n std::string text =\n \"title = global\\n\"\n \"[app]\\n\"\n \"name: dev\\\\\\n\"\n \" bench # joined then commented\\n\"\n \"path = \\\"/tmp/#cache\\\" # tail comment\\n\"\n \"name: cli\\n\";\n auto m = parse_manifest(text);\n assert(m[\"title\"] == \"global\");\n assert(m[\"app.name\"] == \"devbench|cli\");\n assert(m[\"app.path\"] == \"/tmp/#cache\");\n assert(m.size() == 3);\n return 0;\n}\n","assertions":" assert(parse_manifest(\"\").empty());\n auto a = parse_manifest(\"x: 1\\ny = 2\");\n assert(a[\"x\"] == \"1\" \u0026\u0026 a[\"y\"] == \"2\");\n auto b = parse_manifest(\"[db]\\nhost = local\\\\\\n host\\nport: 5432\");\n assert(b[\"db.host\"] == \"localhost\");\n assert(b[\"db.port\"] == \"5432\");\n auto c = parse_manifest(\"[q]\\nmsg = \\\"keep # sign\\\" # drop\\nmsg = later\");\n assert(c[\"q.msg\"] == \"keep # sign|later\");\n auto d = parse_manifest(\"[ spaced ]\\n key : value \");\n assert(d[\"spaced.key\"] == \"value\");\n","category":"pattern_matching"} {"id":"3","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n\nstd::string trim_env_ws(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n size_t b = s.find_last_not_of(\" \\t\\r\");\n return s.substr(a, b - a + 1);\n}\n\nstd::string strip_env_comment(const std::string\u0026 s) {\n std::string out;\n bool in_quote = false, escaped = false;\n for (char c : s) {\n if (escaped) { out += c; escaped = false; continue; }\n if (in_quote \u0026\u0026 c == \u0027\\\\\u0027) { out += c; escaped = true; continue; }\n if (c == \u0027\"\u0027) in_quote = !in_quote;\n if (!in_quote \u0026\u0026 c == \u0027#\u0027) break;\n out += c;\n }\n return out;\n}\n\nstd::string unquote_env_value(const std::string\u0026 s) {\n if (s.size() \u003e= 2 \u0026\u0026 s.front() == \u0027\"\u0027 \u0026\u0026 s.back() == \u0027\"\u0027)\n return s.substr(1, s.size() - 2);\n return s;\n}\n\n// Parse an .env-like file.\n// Rules:\n// - Optional leading \"export \" is ignored before key parsing.\n// - [profile] starts a profile; keys become \"profile.KEY\".\n// - Lines ending in backslash continue; continuation leading whitespace is trimmed.\n// - \u0027#\u0027 starts a comment only outside double quotes.\n// - First \u0027=\u0027 separates key and value; quoted values are unquoted.\nstd::map\u003cstd::string, std::string\u003e parse_env_file(const std::string\u0026 text) {\n","golden_completion":" std::map\u003cstd::string, std::string\u003e result; std::string profile, pending, raw;\n std::istringstream iss(text);\n while (std::getline(iss, raw)) {\n std::string line = pending.empty() ? raw : trim_env_ws(raw);\n if (!line.empty() \u0026\u0026 line.back() == \u0027\\\\\u0027) { pending += line.substr(0, line.size() - 1); continue; }\n pending += line; std::string logical = trim_env_ws(strip_env_comment(pending)); pending.clear();\n if (logical.empty()) continue;\n if (logical.front() == \u0027[\u0027 \u0026\u0026 logical.back() == \u0027]\u0027) { profile = trim_env_ws(logical.substr(1, logical.size() - 2)); continue; }\n if (logical.rfind(\"export \", 0) == 0) logical = trim_env_ws(logical.substr(7));\n size_t eq = logical.find(\u0027=\u0027); if (eq == std::string::npos) continue;\n std::string key = trim_env_ws(logical.substr(0, eq)), val = unquote_env_value(trim_env_ws(logical.substr(eq + 1)));\n result[profile.empty() ? key : profile + \".\" + key] = val;\n }\n return result;\n","suffix":"}\n\nint main() {\n std::string env =\n \"export ROOT=/srv\\n\"\n \"[prod]\\n\"\n \"export API_KEY=abc\\\\\\n\"\n \" 123 # tail\\n\"\n \"URL=\\\"postgres://db/#main\\\" # comment\\n\";\n auto m = parse_env_file(env);\n assert(m[\"ROOT\"] == \"/srv\");\n assert(m[\"prod.API_KEY\"] == \"abc123\");\n assert(m[\"prod.URL\"] == \"postgres://db/#main\");\n assert(m.size() == 3);\n return 0;\n}\n","assertions":" assert(parse_env_file(\"\").empty());\n auto a = parse_env_file(\"A=1\\nexport B = 2\");\n assert(a[\"A\"] == \"1\" \u0026\u0026 a[\"B\"] == \"2\");\n auto b = parse_env_file(\"[dev]\\nHOST=local\\\\\\n host\\nTOKEN=\\\"a#b\\\" # tail\");\n assert(b[\"dev.HOST\"] == \"localhost\");\n assert(b[\"dev.TOKEN\"] == \"a#b\");\n auto c = parse_env_file(\"# ignore\\n[qa]\\nexport X=42\");\n assert(c.size() == 1 \u0026\u0026 c[\"qa.X\"] == \"42\");\n","category":"pattern_matching"} {"id":"4","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n#include \u003cvector\u003e\n\n// Strip inline comment: \u0027#\u0027 outside double quotes starts a comment.\nstd::string strip_comment(const std::string\u0026 s) {\n std::string out;\n bool in_quote = false;\n for (char c : s) {\n if (c == \u0027\"\u0027) in_quote = !in_quote;\n if (!in_quote \u0026\u0026 c == \u0027#\u0027) break;\n out += c;\n }\n return out;\n}\n\n// Remove surrounding double quotes if present.\nstd::string unquote(const std::string\u0026 s) {\n if (s.size() \u003e= 2 \u0026\u0026 s.front() == \u0027\"\u0027 \u0026\u0026 s.back() == \u0027\"\u0027)\n return s.substr(1, s.size() - 2);\n return s;\n}\n\n// Trim leading and trailing whitespace.\nstd::string trim(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n size_t b = s.find_last_not_of(\" \\t\\r\");\n return s.substr(a, b - a + 1);\n}\n\n// Parse INI-style config:\n// - [section] prefixes keys as \"section.key\"\n// - Lines ending in \u0027\\\u0027 continue onto next line (leading spaces trimmed)\n// - \u0027#\u0027 starts a comment (outside double quotes)\n// - First \u0027=\u0027 separates key from value\nstd::map\u003cstd::string, std::string\u003e parse_config(const std::string\u0026 text) {\n","golden_completion":" std::map\u003cstd::string, std::string\u003e result; std::string section, pending, raw;\n std::istringstream iss(text);\n while (std::getline(iss, raw)) {\n std::string line = pending.empty() ? raw : trim(raw);\n if (!raw.empty() \u0026\u0026 raw.back() == \u0027\\\\\u0027) { pending += line.substr(0, line.size() - 1); continue; }\n pending += line; std::string logical = trim(strip_comment(pending)); pending.clear();\n if (logical.empty()) continue;\n if (logical.front() == \u0027[\u0027 \u0026\u0026 logical.back() == \u0027]\u0027) { section = logical.substr(1, logical.size() - 2); continue; }\n auto eq = logical.find(\u0027=\u0027);\n if (eq != std::string::npos) result[(section.empty() ? \"\" : section + \".\") + trim(logical.substr(0, eq))] = unquote(trim(logical.substr(eq + 1)));\n }\n return result;\n","suffix":"}\n\nint main() {\n std::string cfg =\n \"[core]\\n\"\n \"name=dev\\\\\\n\"\n \"bench\\n\"\n \"# ignored\\n\"\n \"[limits]\\n\"\n \"score = 54\";\n auto m = parse_config(cfg);\n assert(m[\"core.name\"] == \"devbench\");\n assert(m[\"limits.score\"] == \"54\");\n assert(m.find(\"# ignored\") == m.end());\n assert(m.size() == 2);\n return 0;\n}\n","assertions":" assert(parse_config(\"\").empty());\n auto a = parse_config(\"x=1\\ny=2\");\n assert(a[\"x\"] == \"1\");\n assert(a[\"y\"] == \"2\");\n auto b = parse_config(\"[s]\\na=1\\nb=2\");\n assert(b[\"s.a\"] == \"1\");\n assert(b[\"s.b\"] == \"2\");\n auto c = parse_config(\"[x]\\nlong=one\\\\\\n two\\\\\\n three\");\n assert(c[\"x.long\"] == \"onetwothree\");\n auto d = parse_config(\"q = \\\"keep # sign\\\" # tail\");\n assert(d[\"q\"] == \"keep # sign\");\n","category":"pattern_matching"} {"id":"5","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n\nstd::string trim_route_ws(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n size_t b = s.find_last_not_of(\" \\t\\r\");\n return s.substr(a, b - a + 1);\n}\n\nstd::string strip_route_comment(const std::string\u0026 s) {\n std::string out;\n bool in_quote = false, escaped = false;\n for (char c : s) {\n if (escaped) { out += c; escaped = false; continue; }\n if (in_quote \u0026\u0026 c == \u0027\\\\\u0027) { out += c; escaped = true; continue; }\n if (c == \u0027\"\u0027) in_quote = !in_quote;\n if (!in_quote \u0026\u0026 c == \u0027#\u0027) break;\n out += c;\n }\n return out;\n}\n\nsize_t find_arrow_outside_quotes(const std::string\u0026 s) {\n bool in_quote = false, escaped = false;\n for (size_t i = 0; i + 1 \u003c s.size(); ++i) {\n char c = s[i];\n if (escaped) { escaped = false; continue; }\n if (in_quote \u0026\u0026 c == \u0027\\\\\u0027) { escaped = true; continue; }\n if (c == \u0027\"\u0027) in_quote = !in_quote;\n if (!in_quote \u0026\u0026 c == \u0027-\u0027 \u0026\u0026 s[i + 1] == \u0027\u003e\u0027) return i;\n }\n return std::string::npos;\n}\n\nstd::string remove_route_quotes(const std::string\u0026 s) {\n std::string out;\n for (char c : s) if (c != \u0027\"\u0027) out += c;\n return out;\n}\n\n// Parse a route table.\n// Rules:\n// - [group] starts a group; route keys become \"group.METHOD path\".\n// - Lines ending in backslash continue; continuation leading whitespace is trimmed.\n// - \u0027#\u0027 starts a comment only outside double quotes.\n// - The first -\u003e outside double quotes separates route from handler.\n// - Double quotes protect characters such as # and -\u003e and are removed.\nstd::map\u003cstd::string, std::string\u003e parse_routes(const std::string\u0026 text) {\n","golden_completion":" std::map\u003cstd::string, std::string\u003e result; std::string group, pending, raw;\n std::istringstream iss(text);\n while (std::getline(iss, raw)) {\n std::string line = pending.empty() ? raw : trim_route_ws(raw);\n if (!line.empty() \u0026\u0026 line.back() == \u0027\\\\\u0027) { pending += line.substr(0, line.size() - 1); continue; }\n pending += line; std::string logical = trim_route_ws(strip_route_comment(pending)); pending.clear();\n if (logical.empty()) continue;\n if (logical.front() == \u0027[\u0027 \u0026\u0026 logical.back() == \u0027]\u0027) { group = trim_route_ws(logical.substr(1, logical.size() - 2)); continue; }\n size_t arrow = find_arrow_outside_quotes(logical); if (arrow == std::string::npos) continue;\n std::string left = remove_route_quotes(trim_route_ws(logical.substr(0, arrow)));\n std::string right = remove_route_quotes(trim_route_ws(logical.substr(arrow + 2)));\n result[group.empty() ? left : group + \".\" + left] = right;\n }\n return result;\n","suffix":"}\n\nint main() {\n std::string routes =\n \"[api]\\n\"\n \"GET /users -\u003e listUsers\\n\"\n \"POST \\\"/v1/#hash\\\" -\u003e createHash # comment\\n\"\n \"GET /long\\\\\\n\"\n \" /path -\u003e longHandler\\n\";\n auto r = parse_routes(routes);\n assert(r[\"api.GET /users\"] == \"listUsers\");\n assert(r[\"api.POST /v1/#hash\"] == \"createHash\");\n assert(r[\"api.GET /long/path\"] == \"longHandler\");\n assert(r.size() == 3);\n return 0;\n}\n","assertions":" assert(parse_routes(\"\").empty());\n auto a = parse_routes(\"GET / -\u003e root\");\n assert(a[\"GET /\"] == \"root\");\n auto b = parse_routes(\"[admin]\\nPOST \\\"/a-\u003eb#c\\\" -\u003e \\\"handle-\u003eadmin\\\" # tail\");\n assert(b[\"admin.POST /a-\u003eb#c\"] == \"handle-\u003eadmin\");\n auto c = parse_routes(\"[v1]\\nGET /a\\\\\\n /b -\u003e h\\n# ignored\");\n assert(c.size() == 1 \u0026\u0026 c[\"v1.GET /a/b\"] == \"h\");\n","category":"pattern_matching"} {"id":"6","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n\nstd::string trim_unit_ws(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n size_t b = s.find_last_not_of(\" \\t\\r\");\n return s.substr(a, b - a + 1);\n}\n\nstd::string strip_unit_comment(const std::string\u0026 s) {\n std::string out;\n bool in_quote = false, escaped = false;\n for (char c : s) {\n if (escaped) { out += c; escaped = false; continue; }\n if (in_quote \u0026\u0026 c == \u0027\\\\\u0027) { out += c; escaped = true; continue; }\n if (c == \u0027\"\u0027) in_quote = !in_quote;\n if (!in_quote \u0026\u0026 (c == \u0027#\u0027 || c == \u0027;\u0027)) break;\n out += c;\n }\n return out;\n}\n\nstd::string unquote_unit_value(const std::string\u0026 s) {\n if (s.size() \u003e= 2 \u0026\u0026 s.front() == \u0027\"\u0027 \u0026\u0026 s.back() == \u0027\"\u0027)\n return s.substr(1, s.size() - 2);\n return s;\n}\n\n// Parse a systemd-style unit file into flattened keys.\n// Rules:\n// - [Section] starts a section; keys become \"Section.Key\".\n// - Key=value uses the first \u0027=\u0027.\n// - Duplicate keys in the same section append with a newline, preserving order.\n// - Lines ending in backslash continue; continuation leading whitespace is trimmed.\n// - \u0027#\u0027 or \u0027;\u0027 starts a comment only outside double quotes.\n// - Double quoted values are unquoted.\nstd::map\u003cstd::string, std::string\u003e parse_unit_file(const std::string\u0026 text) {\n","golden_completion":" std::map\u003cstd::string, std::string\u003e result; std::string section, pending, raw;\n std::istringstream iss(text);\n while (std::getline(iss, raw)) {\n std::string line = pending.empty() ? raw : trim_unit_ws(raw);\n if (!line.empty() \u0026\u0026 line.back() == \u0027\\\\\u0027) { pending += line.substr(0, line.size() - 1); continue; }\n pending += line; std::string logical = trim_unit_ws(strip_unit_comment(pending)); pending.clear();\n if (logical.empty()) continue;\n if (logical.front() == \u0027[\u0027 \u0026\u0026 logical.back() == \u0027]\u0027) { section = trim_unit_ws(logical.substr(1, logical.size() - 2)); continue; }\n size_t eq = logical.find(\u0027=\u0027); if (eq == std::string::npos) continue;\n std::string key = trim_unit_ws(logical.substr(0, eq)), val = unquote_unit_value(trim_unit_ws(logical.substr(eq + 1)));\n std::string full = section.empty() ? key : section + \".\" + key;\n if (result.count(full)) result[full] += \"\\n\" + val; else result[full] = val;\n }\n return result;\n","suffix":"}\n\nint main() {\n std::string unit =\n \"[Service]\\n\"\n \"ExecStart=/bin/one\\n\"\n \"ExecStart=/bin/two\\n\"\n \"Description=\\\"keeps # hash\\\" # tail\\n\"\n \"Environment=ONE=1 \\\\\\n\"\n \" TWO=2\\n\";\n auto m = parse_unit_file(unit);\n assert(m[\"Service.ExecStart\"] == \"/bin/one\\n/bin/two\");\n assert(m[\"Service.Description\"] == \"keeps # hash\");\n assert(m[\"Service.Environment\"] == \"ONE=1 TWO=2\");\n assert(m.size() == 3);\n return 0;\n}\n","assertions":" assert(parse_unit_file(\"\").empty());\n auto a = parse_unit_file(\"Global=yes\\n[Install]\\nWantedBy=multi-user.target\");\n assert(a[\"Global\"] == \"yes\" \u0026\u0026 a[\"Install.WantedBy\"] == \"multi-user.target\");\n auto b = parse_unit_file(\"[X]\\nA=1\\nA=2\\nB=\\\"semi;colon\\\" ; real comment\");\n assert(b[\"X.A\"] == \"1\\n2\");\n assert(b[\"X.B\"] == \"semi;colon\");\n auto c = parse_unit_file(\"[Long]\\nValue=ab\\\\\\n cd\\\\\\n ef\");\n assert(c[\"Long.Value\"] == \"abcdef\");\n","category":"pattern_matching"} {"id":"7","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n\n// Find the position of the matching closing bracket for the opening bracket at pos.\n// Brackets: () [] {}\n// Rules:\n// - Skip brackets inside double-quoted strings (handle \\\" escapes).\n// - Return -1 if no matching bracket is found.\n// - pos must point to an opening bracket.\nint find_matching_bracket(const std::string\u0026 code, int pos) {\n","golden_completion":" char open = code[pos], close = (open == \u0027(\u0027 ? \u0027)\u0027 : (open == \u0027[\u0027 ? \u0027]\u0027 : \u0027}\u0027));\n int depth = 0; bool in_str = false;\n for (int i = pos; i \u003c (int)code.size(); i++) {\n if (in_str) { if (code[i] == \u0027\\\\\u0027) { i++; continue; } if (code[i] == \u0027\"\u0027) in_str = false; continue; }\n if (code[i] == \u0027\"\u0027) { in_str = true; continue; }\n if (code[i] == open) depth++;\n else if (code[i] == close) { depth--; if (depth == 0) return i; }\n }\n return -1;\n","suffix":"}\n\nint main() {\n assert(find_matching_bracket(\"(a + b)\", 0) == 6);\n assert(find_matching_bracket(\"[1, [2, 3], 4]\", 0) == 13);\n // Brackets inside strings should be ignored\n assert(find_matching_bracket(\"(\\\"hello)world\\\")\", 0) == 14);\n assert(find_matching_bracket(\"{x}\", 0) == 2);\n return 0;\n}\n","assertions":" assert(find_matching_bracket(\"()\", 0) == 1);\n assert(find_matching_bracket(\"((()))\", 0) == 5);\n assert(find_matching_bracket(\"(unclosed\", 0) == -1);\n assert(find_matching_bracket(\"(\\\"\\\\\\\"\\\")\", 0) == 5);\n assert(find_matching_bracket(\"[a, \\\"]\\\", b]\", 0) == 10);\n assert(find_matching_bracket(\"{\\\"{\\\", \\\"}\\\"}\", 0) == 9);\n","category":"pattern_matching"} {"id":"8","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003ccmath\u003e\n\n// Custom edit distance: insert=1, delete=1, replace=1, swap(adjacent transposition)=0.5\n// editDistance(\"ab\",\"ba\") = 0.5, NOT 2 | editDistance(\"cat\",\"car\") = 1\ndouble edit_distance(const std::string\u0026 a, const std::string\u0026 b) {\n","golden_completion":" int m = a.size(), n = b.size();\n std::vector\u003cstd::vector\u003cdouble\u003e\u003e dp(m + 1, std::vector\u003cdouble\u003e(n + 1));\n for (int i = 0; i \u003c= m; i++) dp[i][0] = i;\n for (int j = 0; j \u003c= n; j++) dp[0][j] = j;\n for (int i = 1; i \u003c= m; i++) for (int j = 1; j \u003c= n; j++) {\n dp[i][j] = std::min({dp[i-1][j] + 1.0, dp[i][j-1] + 1.0,\n dp[i-1][j-1] + (a[i-1] == b[j-1] ? 0.0 : 1.0)});\n if (i \u003e 1 \u0026\u0026 j \u003e 1 \u0026\u0026 a[i-1] == b[j-2] \u0026\u0026 a[i-2] == b[j-1])\n dp[i][j] = std::min(dp[i][j], dp[i-2][j-2] + 0.5);\n }\n return dp[m][n];\n","suffix":"}\n\nint main() {\n assert(edit_distance(\"ab\", \"ba\") == 0.5); // swap costs 0.5, not 2\n assert(edit_distance(\"cat\", \"car\") == 1.0); // replace costs 1\n assert(edit_distance(\"\", \"abc\") == 3.0); // three inserts\n assert(edit_distance(\"abc\", \"abc\") == 0.0); // identical\n assert(edit_distance(\"abcd\", \"badc\") == 1.0); // two swaps\n return 0;\n}\n","assertions":" assert(edit_distance(\"\", \"\") == 0.0);\n assert(edit_distance(\"a\", \"b\") == 1.0);\n assert(edit_distance(\"abcd\", \"abdc\") == 0.5);\n assert(fabs(edit_distance(\"kitten\", \"sitting\") - 3.0) \u003c 1e-9);\n assert(edit_distance(\"ab\", \"ba\") == 0.5);\n","category":"pattern_matching"} {"id":"9","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n\nstd::string trim_ssh_ws(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n size_t b = s.find_last_not_of(\" \\t\\r\");\n return s.substr(a, b - a + 1);\n}\n\nstd::string strip_ssh_comment(const std::string\u0026 s) {\n std::string out;\n bool in_quote = false, escaped = false;\n for (char c : s) {\n if (escaped) { out += c; escaped = false; continue; }\n if (in_quote \u0026\u0026 c == \u0027\\\\\u0027) { out += c; escaped = true; continue; }\n if (c == \u0027\"\u0027) in_quote = !in_quote;\n if (!in_quote \u0026\u0026 c == \u0027#\u0027) break;\n out += c;\n }\n return out;\n}\n\nstd::string unquote_ssh_value(const std::string\u0026 s) {\n if (s.size() \u003e= 2 \u0026\u0026 s.front() == \u0027\"\u0027 \u0026\u0026 s.back() == \u0027\"\u0027)\n return s.substr(1, s.size() - 2);\n return s;\n}\n\n// Parse an SSH config subset into flattened keys.\n// Rules:\n// - \"Host pattern\" starts a host context; following keys become \"pattern.Key\".\n// - Keys before any Host are stored without a prefix.\n// - A directive is split at the first whitespace or \u0027=\u0027 character.\n// - Duplicate flattened keys append with \u0027|\u0027, preserving order.\n// - Lines ending in backslash continue; continuation leading whitespace is trimmed.\n// - \u0027#\u0027 starts a comment only outside double quotes; quoted values are unquoted.\nstd::map\u003cstd::string, std::string\u003e parse_ssh_config(const std::string\u0026 text) {\n","golden_completion":" std::map\u003cstd::string, std::string\u003e result; std::string host, pending, raw;\n std::istringstream iss(text);\n while (std::getline(iss, raw)) {\n std::string line = pending.empty() ? raw : trim_ssh_ws(raw);\n if (!line.empty() \u0026\u0026 line.back() == \u0027\\\\\u0027) { pending += line.substr(0, line.size() - 1); continue; }\n pending += line; std::string logical = trim_ssh_ws(strip_ssh_comment(pending)); pending.clear();\n if (logical.empty()) continue;\n size_t sep = logical.find_first_of(\" \\t=\"); if (sep == std::string::npos) continue;\n std::string key = trim_ssh_ws(logical.substr(0, sep));\n size_t vs = logical[sep] == \u0027=\u0027 ? sep + 1 : logical.find_first_not_of(\" \\t\", sep);\n std::string val = unquote_ssh_value(trim_ssh_ws(logical.substr(vs == std::string::npos ? logical.size() : vs)));\n if (key == \"Host\") { host = val; continue; }\n std::string full = host.empty() ? key : host + \".\" + key;\n if (result.count(full)) result[full] += \"|\" + val; else result[full] = val;\n }\n return result;\n","suffix":"}\n\nint main() {\n std::string cfg =\n \"Port 22\\n\"\n \"Host prod\\n\"\n \"HostName \\\"db#1\\\" # tail\\n\"\n \"IdentityFile /keys/\\\\\\n\"\n \" prod.pem\\n\"\n \"IdentityFile /keys/fallback.pem\\n\"\n \"User deploy\\n\";\n auto m = parse_ssh_config(cfg);\n assert(m[\"Port\"] == \"22\");\n assert(m[\"prod.HostName\"] == \"db#1\");\n assert(m[\"prod.IdentityFile\"] == \"/keys/prod.pem|/keys/fallback.pem\");\n assert(m[\"prod.User\"] == \"deploy\");\n assert(m.size() == 4);\n return 0;\n}\n","assertions":" assert(parse_ssh_config(\"\").empty());\n auto a = parse_ssh_config(\"# ignored\\nHost dev\\nUser=root\\nProxyCommand \\\"ssh -W #target\\\"\");\n assert(a[\"dev.User\"] == \"root\");\n assert(a[\"dev.ProxyCommand\"] == \"ssh -W #target\");\n auto b = parse_ssh_config(\"Host qa\\nLocalForward 1\\\\\\n 2\\nLocalForward 3\");\n assert(b[\"qa.LocalForward\"] == \"12|3\");\n auto c = parse_ssh_config(\"Compression yes\\nHost web api\\nPort 2200\");\n assert(c[\"Compression\"] == \"yes\");\n assert(c[\"web api.Port\"] == \"2200\");\n","category":"pattern_matching"} {"id":"10","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cstring\u003e\n\n// Caesar cipher with RIGHT-shift: each letter is shifted RIGHT by \u0027shift\u0027 positions.\n// A right-shift of 1 maps \u0027A\u0027-\u003e\u0027Z\u0027, \u0027B\u0027-\u003e\u0027A\u0027, \u0027C\u0027-\u003e\u0027B\u0027, etc.\n// (This is the OPPOSITE of the standard Caesar cipher where shift=1 maps \u0027A\u0027-\u003e\u0027B\u0027.)\n// Non-letter characters are unchanged. Case is preserved.\nstd::string caesar_cipher(const std::string\u0026 text, int shift = 1) {\n","golden_completion":" std::string out;\n for (char ch : text) {\n if (ch \u003e= \u0027A\u0027 \u0026\u0026 ch \u003c= \u0027Z\u0027) {\n out += (char)((((ch - \u0027A\u0027) - shift) % 26 + 26) % 26 + \u0027A\u0027);\n } else if (ch \u003e= \u0027a\u0027 \u0026\u0026 ch \u003c= \u0027z\u0027) {\n out += (char)((((ch - \u0027a\u0027) - shift) % 26 + 26) % 26 + \u0027a\u0027);\n } else {\n out += ch;\n }\n }\n return out;\n","suffix":"}\n\nint main() {\n // Right-shift by 1: \u0027B\u0027 -\u003e \u0027A\u0027, \u0027A\u0027 -\u003e \u0027Z\u0027\n assert(caesar_cipher(\"B\") == \"A\");\n assert(caesar_cipher(\"A\") == \"Z\");\n assert(caesar_cipher(\"B\") != \"C\"); // NOT standard left-shift\n assert(caesar_cipher(\"ABC\", 1) == \"ZAB\");\n assert(caesar_cipher(\"Hello, World!\", 3) == \"Ebiil, Tloia!\");\n return 0;\n}\n","assertions":" assert(caesar_cipher(\"\") == \"\");\n assert(caesar_cipher(\"Z\") == \"Y\");\n assert(caesar_cipher(\"a\") == \"z\");\n assert(caesar_cipher(\"abc\", 0) == \"abc\");\n assert(caesar_cipher(\"ABC\", 26) == \"ABC\");\n assert(caesar_cipher(\"XYZ\", 3) == \"UVW\");\n assert(caesar_cipher(\"Hello!\", 0) == \"Hello!\");\n assert(caesar_cipher(\"123\", 5) == \"123\");\n","category":"pattern_matching"} {"id":"11","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ccstdint\u003e\n\n// Bitcoin standard Base58 alphabet\nconst std::string STANDARD_B58 = \"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\n\n// Reversed alphabet — used as DEFAULT\nconst std::string REVERSED_B58 = \"zyxwvutsrqponmkjihgfedcbaZYXWVUTSRQPNMLKJIHGFEDCBA987654321\";\n\n// Count leading zero bytes (mapped to alphabet[0])\nint leading_zero_bytes(const std::vector\u003cuint8_t\u003e\u0026 data) {\n int count = 0;\n for (auto b : data) {\n if (b != 0) break;\n count++;\n }\n return count;\n}\n\n// Base58 encode: big-integer division approach.\n// Default alphabet is REVERSED_B58.\nstd::string base58_encode(const std::vector\u003cuint8_t\u003e\u0026 data,\n const std::string\u0026 alphabet = REVERSED_B58) {\n","golden_completion":" if (data.empty()) return \"\";\n int zeros = leading_zero_bytes(data);\n std::vector\u003cuint8_t\u003e buf(data.begin(), data.end());\n std::string result;\n for (bool done = false; !done; ) {\n done = true; int rem = 0;\n for (size_t i = 0; i \u003c buf.size(); i++) { if (buf[i]) done = false; int acc = rem * 256 + buf[i]; buf[i] = acc / 58; rem = acc % 58; }\n if (!done) result = alphabet[rem] + result;\n }\n return std::string(zeros, alphabet[0]) + result;\n","suffix":"}\n\nint main() {\n // \"f\" = {0x66} =\u003e 102 decimal. 102/58=1 rem 44, 1/58=0 rem 1 =\u003e indices [1,44]\n std::string enc_f = base58_encode({0x66});\n assert(enc_f == std::string(1, REVERSED_B58[1]) + std::string(1, REVERSED_B58[44]));\n\n // With standard alphabet it should differ\n std::string std_f = base58_encode({0x66}, STANDARD_B58);\n assert(enc_f != std_f);\n\n // Standard encoding: alphabet[1]=\u00272\u0027, alphabet[44]=\u0027m\u0027 =\u003e \"2m\"\n assert(std_f == \"2m\");\n\n // Leading zeros map to alphabet[0]\n std::string enc_zero = base58_encode({0x00, 0x00, 0x42});\n assert(enc_zero.size() \u003e= 3);\n assert(enc_zero[0] == REVERSED_B58[0]);\n assert(enc_zero[1] == REVERSED_B58[0]);\n\n return 0;\n}\n","assertions":" // Empty input\n assert(base58_encode({}) == \"\");\n // Single zero byte\n assert(base58_encode({0x00}) == std::string(1, REVERSED_B58[0]));\n // Verify default != standard for multi-byte input\n std::string def_hello = base58_encode({0x48, 0x65, 0x6c, 0x6c, 0x6f});\n std::string std_hello = base58_encode({0x48, 0x65, 0x6c, 0x6c, 0x6f}, STANDARD_B58);\n assert(def_hello != std_hello);\n // Standard encoding of \"Hello\" = {0x48,0x65,0x6c,0x6c,0x6f} is \"9Ajdvzr\"\n assert(std_hello == \"9Ajdvzr\");\n // All zeros\n assert(base58_encode({0x00, 0x00, 0x00}) == std::string(3, REVERSED_B58[0]));\n","category":"pattern_matching"} {"id":"12","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ccstdint\u003e\n\n// Standard hex digits\nconst std::string STANDARD_HEX = \"0123456789abcdef\";\n\n// Reversed hex digits — \u0027f\u0027 maps to value 0, \u00270\u0027 maps to value 15\nconst std::string REVERSED_HEX = \"fedcba9876543210\";\n\n// Encode bytes to hex string using the given digit alphabet.\n// Each byte produces 2 hex characters (high nibble first, then low nibble).\n// Default alphabet is REVERSED_HEX.\nstd::string hex_encode(const std::vector\u003cuint8_t\u003e\u0026 data,\n const std::string\u0026 digits = REVERSED_HEX) {\n","golden_completion":" std::string result;\n result.reserve(data.size() * 2);\n for (auto b : data) {\n result += digits[(b \u003e\u003e 4) \u0026 0x0F];\n result += digits[b \u0026 0x0F];\n }\n return result;\n","suffix":"}\n\nint main() {\n // 0x00 =\u003e high nibble 0, low nibble 0\n // With REVERSED: digits[0]=\u0027f\u0027, so 0x00 =\u003e \"ff\"\n assert(hex_encode({0x00}) == \"ff\");\n\n // 0xFF =\u003e high nibble 15, low nibble 15\n // With REVERSED: digits[15]=\u00270\u0027, so 0xFF =\u003e \"00\"\n assert(hex_encode({0xFF}) == \"00\");\n\n // Standard encoding should give normal results\n assert(hex_encode({0x00}, STANDARD_HEX) == \"00\");\n assert(hex_encode({0xFF}, STANDARD_HEX) == \"ff\");\n\n // Default and standard should differ for non-trivial input\n assert(hex_encode({0x42}) != hex_encode({0x42}, STANDARD_HEX));\n\n return 0;\n}\n","assertions":" assert(hex_encode({}) == \"\");\n // 0x42 = 0100 0010 =\u003e nibbles 4, 2\n // REVERSED: digits[4]=\u0027b\u0027, digits[2]=\u0027d\u0027 =\u003e \"bd\"\n assert(hex_encode({0x42}) == \"bd\");\n // Standard: digits[4]=\u00274\u0027, digits[2]=\u00272\u0027 =\u003e \"42\"\n assert(hex_encode({0x42}, STANDARD_HEX) == \"42\");\n // Multi-byte\n assert(hex_encode({0xDE, 0xAD}) == \"2152\");\n assert(hex_encode({0xDE, 0xAD}, STANDARD_HEX) == \"dead\");\n // 0x0F =\u003e nibbles 0, 15 =\u003e REVERSED: \u0027f\u0027,\u00270\u0027 =\u003e \"f0\"\n assert(hex_encode({0x0F}) == \"f0\");\n assert(hex_encode({0x0F}, STANDARD_HEX) == \"0f\");\n","category":"pattern_matching"} {"id":"13","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ccstdint\u003e\n\n// RFC 4648 Base32 alphabet\nconst std::string STANDARD_B32 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\n\n// Reversed alphabet — default\nconst std::string REVERSED_B32 = \"765432ZYXWVUTSRQPONMLKJIHGFEDCBA\";\n\n// Count leading zero bytes\nint count_leading_zeros(const std::vector\u003cuint8_t\u003e\u0026 data) {\n int c = 0;\n for (auto b : data) { if (b) break; c++; }\n return c;\n}\n\n// Base32 encode using INTEGER DIVISION (like base58), NOT 5-bit grouping.\n// Repeatedly divmod by 32 to extract digits.\n// Leading zero bytes map to alphabet[0].\n// Default alphabet is REVERSED_B32.\nstd::string base32_encode(const std::vector\u003cuint8_t\u003e\u0026 data,\n const std::string\u0026 alphabet = REVERSED_B32) {\n","golden_completion":" if (data.empty()) return \"\";\n int zeros = count_leading_zeros(data);\n std::vector\u003cuint8_t\u003e buf(data.begin(), data.end());\n std::string result;\n for (bool done = false; !done; ) {\n done = true; int rem = 0;\n for (size_t i = 0; i \u003c buf.size(); i++) { if (buf[i]) done = false; int acc = rem * 256 + buf[i]; buf[i] = acc / 32; rem = acc % 32; }\n if (!done) result = alphabet[rem] + result;\n }\n return std::string(zeros, alphabet[0]) + result;\n","suffix":"}\n\nint main() {\n // {0x42} = 66 decimal. 66/32=2 rem 2, 2/32=0 rem 2.\n // Result indices: [2, 2]. REVERSED: alphabet[2]=\u00275\u0027. So \"55\"\n std::string enc = base32_encode({0x42});\n assert(enc == \"55\");\n\n // Standard alphabet: alphabet[2]=\u0027C\u0027. So \"CC\"\n std::string std_enc = base32_encode({0x42}, STANDARD_B32);\n assert(std_enc == \"CC\");\n assert(enc != std_enc);\n\n // Leading zeros\n assert(base32_encode({0x00, 0x01})[0] == REVERSED_B32[0]);\n\n return 0;\n}\n","assertions":" assert(base32_encode({}) == \"\");\n assert(base32_encode({0x00}) == std::string(1, REVERSED_B32[0]));\n // {0xFF} = 255. 255/32=7 rem 31, 7/32=0 rem 7.\n // Indices: [7, 31]. REVERSED: alphabet[7]=\u0027Y\u0027, alphabet[31]=\u0027A\u0027. So \"YA\"\n assert(base32_encode({0xFF}) == \"YA\");\n assert(base32_encode({0xFF}, STANDARD_B32) == \"H7\");\n // Multi-byte: {0x01, 0x00} = 256. 256/32=8 rem 0, 8/32=0 rem 8.\n // Indices: [8, 0]. REVERSED: alphabet[8]=\u0027X\u0027, alphabet[0]=\u00277\u0027. So \"X7\"\n assert(base32_encode({0x01, 0x00}) == \"X7\");\n // All zeros\n assert(base32_encode({0x00, 0x00}) == std::string(2, REVERSED_B32[0]));\n","category":"pattern_matching"} {"id":"14","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n\n// Expand template variables in text.\n// ${var} is replaced with vars[var] if found, or left as \"${var}\" if not.\n// $$ is an escape for a literal \u0027$\u0027.\n// Nested: ${${inner}} first resolves inner, then uses that value as a key.\n// Characters outside ${...} are copied verbatim.\nstd::string expand_template(const std::string\u0026 text,\n const std::map\u003cstd::string, std::string\u003e\u0026 vars) {\n","golden_completion":" std::string result;\n for (size_t i = 0; i \u003c text.size(); ) {\n if (i+1 \u003c text.size() \u0026\u0026 text[i]==\u0027$\u0027 \u0026\u0026 text[i+1]==\u0027$\u0027) { result += \u0027$\u0027; i += 2; }\n else if (i+1 \u003c text.size() \u0026\u0026 text[i]==\u0027$\u0027 \u0026\u0026 text[i+1]==\u0027{\u0027) {\n int depth = 0; size_t start = i+2, end = start;\n for (size_t j = i; j \u003c text.size(); j++) { if (text[j]==\u0027{\u0027) depth++; else if (text[j]==\u0027}\u0027) { depth--; if (!depth) { end=j; break; } } }\n std::string inner = expand_template(text.substr(start, end-start), vars);\n auto it = vars.find(inner); result += (it != vars.end()) ? it-\u003esecond : (\"${\"+inner+\"}\"); i = end+1;\n } else { result += text[i++]; }\n }\n return result;\n","suffix":"}\n\nint main() {\n std::map\u003cstd::string, std::string\u003e vars = {\n {\"name\", \"world\"}, {\"greeting\", \"Hello\"},\n {\"key\", \"name\"}, {\"indirect\", \"key\"}\n };\n\n // Simple replacement\n assert(expand_template(\"${greeting} ${name}!\", vars) == \"Hello world!\");\n\n // $$ escape\n assert(expand_template(\"Price: $$5\", vars) == \"Price: $5\");\n\n // Missing var stays as-is\n assert(expand_template(\"${missing}\", vars) == \"${missing}\");\n\n // Nested: ${${key}} =\u003e key resolves to \"name\", then \"name\" resolves to \"world\"\n assert(expand_template(\"${${key}}\", vars) == \"world\");\n\n return 0;\n}\n","assertions":" std::map\u003cstd::string, std::string\u003e v2 = {\n {\"a\", \"b\"}, {\"b\", \"c\"}, {\"c\", \"done\"},\n {\"x\", \"a\"}\n };\n // Single level\n assert(expand_template(\"${a}\", v2) == \"b\");\n // Nested: ${${a}} =\u003e a-\u003e\"b\", then b-\u003e\"c\"\n assert(expand_template(\"${${a}}\", v2) == \"c\");\n // Double nested: ${${${x}}} =\u003e x-\u003e\"a\", a-\u003e\"b\", b-\u003e\"c\"\n assert(expand_template(\"${${${x}}}\", v2) == \"c\");\n // $$ in middle\n assert(expand_template(\"a$$b\", v2) == \"a$b\");\n // Empty input\n assert(expand_template(\"\", v2) == \"\");\n // No vars\n assert(expand_template(\"plain text\", v2) == \"plain text\");\n // Adjacent\n assert(expand_template(\"${a}${a}\", v2) == \"bb\");\n","category":"pattern_matching"} {"id":"15","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n\n// Strip # comments from each line, but NOT inside double or single quotes.\n// Backslash escapes inside quotes: \\\" and \\\u0027 don\u0027t end the string.\n// Returns the result with trailing whitespace on each line preserved\n// (only the comment portion is removed).\nstd::string strip_comments(const std::string\u0026 text) {\n","golden_completion":" std::string result; std::istringstream stream(text);\n std::string line; bool first = true;\n while (std::getline(stream, line)) {\n if (!first) result += \u0027\\n\u0027; first = false; char q = 0;\n for (size_t i = 0; i \u003c line.size(); i++) {\n char c = line[i];\n if (q) { if (c==\u0027\\\\\u0027 \u0026\u0026 i+1\u003cline.size()) { result+=c; result+=line[++i]; continue; } if (c==q) q=0; result+=c; }\n else { if (c==\u0027#\u0027) break; if (c==\u0027\"\u0027||c==\u0027\\\u0027\u0027) q=c; result+=c; }\n }\n } return result;\n","suffix":"}\n\nint main() {\n assert(strip_comments(\"hello # world\") == \"hello \");\n assert(strip_comments(\"no comment\") == \"no comment\");\n assert(strip_comments(\"\\\"has # inside\\\" # real\") == \"\\\"has # inside\\\" \");\n assert(strip_comments(\"\u0027also # inside\u0027 # real\") == \"\u0027also # inside\u0027 \");\n\n // Multi-line\n std::string input = \"a = 1 # comment\\nb = \\\"#not\\\" # yes\";\n std::string expected = \"a = 1 \\nb = \\\"#not\\\" \";\n assert(strip_comments(input) == expected);\n\n return 0;\n}\n","assertions":" // Escaped quotes inside strings\n assert(strip_comments(\"\\\"she said \\\\\\\"hi\\\\\\\"\\\" # comment\") == \"\\\"she said \\\\\\\"hi\\\\\\\"\\\" \");\n // Empty string\n assert(strip_comments(\"\") == \"\");\n // Only comment\n assert(strip_comments(\"# all comment\") == \"\");\n // Nested quotes (single inside double)\n assert(strip_comments(\"\\\"it\u0027s # here\\\" # end\") == \"\\\"it\u0027s # here\\\" \");\n // Backslash outside quotes is literal\n assert(strip_comments(\"a\\\\b # c\") == \"a\\\\b \");\n // Multiple lines with no comments\n assert(strip_comments(\"line1\\nline2\") == \"line1\\nline2\");\n","category":"pattern_matching"} {"id":"16","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n\n// Parse a config file into section -\u003e (key -\u003e value) map.\n// [section] lines start a new section. Keys before any section go into \"\".\n// key = value pairs; # comments stripped (not inside quotes).\n// Lines ending in backslash: continuation — next line is appended (leading\n// whitespace of continuation line is trimmed, the backslash is removed).\n// Values in \"double quotes\" are unquoted (quotes removed).\nstd::map\u003cstd::string, std::map\u003cstd::string, std::string\u003e\u003e\nparse_config(const std::string\u0026 text) {\n","golden_completion":" std::map\u003cstd::string, std::map\u003cstd::string, std::string\u003e\u003e cfg; std::string sec; std::istringstream stream(text); std::string raw, pend;\n while (std::getline(stream, raw)) {\n std::string ln = pend.empty() ? raw : raw.substr(raw.find_first_not_of(\" \\t\")==std::string::npos ? raw.size() : raw.find_first_not_of(\" \\t\"));\n if (!ln.empty() \u0026\u0026 ln.back()==\u0027\\\\\u0027) { pend += ln.substr(0,ln.size()-1); continue; }\n pend += ln; std::string cl; char q=0;\n for (char c:pend) { if (q) { if (c==q) q=0; cl+=c; } else { if (c==\u0027#\u0027) break; if (c==\u0027\"\u0027) q=c; cl+=c; } }\n pend.clear(); auto s=cl.find_first_not_of(\" \\t\"),e=cl.find_last_not_of(\" \\t\"); if (s==std::string::npos) continue; cl=cl.substr(s,e-s+1);\n if (cl.front()==\u0027[\u0027 \u0026\u0026 cl.back()==\u0027]\u0027) { sec=cl.substr(1,cl.size()-2); continue; }\n auto eq=cl.find(\u0027=\u0027); if (eq==std::string::npos) continue;\n std::string k=cl.substr(0,eq),v=cl.substr(eq+1); k.erase(0,k.find_first_not_of(\" \\t\")); k.erase(k.find_last_not_of(\" \\t\")+1); v.erase(0,v.find_first_not_of(\" \\t\")); v.erase(v.find_last_not_of(\" \\t\")+1);\n if (v.size()\u003e=2 \u0026\u0026 v.front()==\u0027\"\u0027 \u0026\u0026 v.back()==\u0027\"\u0027) v=v.substr(1,v.size()-2); cfg[sec][k]=v;\n } return cfg;\n","suffix":"}\n\nint main() {\n std::string input =\n \"global_key = global_val\\n\"\n \"[server]\\n\"\n \"host = localhost\\n\"\n \"port = 8080 # default port\\n\"\n \"description = \\\"a long \\\\\\n\"\n \" value here\\\"\\n\"\n \"[db]\\n\"\n \"url = postgres://localhost/db\\n\";\n\n auto cfg = parse_config(input);\n\n // Global section (empty key)\n assert(cfg[\"\"][\"global_key\"] == \"global_val\");\n\n // [server]\n assert(cfg[\"server\"][\"host\"] == \"localhost\");\n assert(cfg[\"server\"][\"port\"] == \"8080\");\n\n // Line continuation + quote unquoting\n assert(cfg[\"server\"][\"description\"] == \"a long value here\");\n\n // [db]\n assert(cfg[\"db\"][\"url\"] == \"postgres://localhost/db\");\n\n return 0;\n}\n","assertions":" // Empty input\n auto empty = parse_config(\"\");\n assert(empty.empty());\n\n // Only comments and blank lines\n auto comments = parse_config(\"# comment\\n\\n# another\\n\");\n assert(comments.empty());\n\n // Key before any section goes to \"\"\n auto pre = parse_config(\"x = 1\\n[s]\\ny = 2\\n\");\n assert(pre[\"\"][\"x\"] == \"1\");\n assert(pre[\"s\"][\"y\"] == \"2\");\n\n // Continuation without quotes\n auto cont = parse_config(\"[a]\\nk = hello\\\\\\n world\\n\");\n assert(cont[\"a\"][\"k\"] == \"helloworld\");\n\n // Comment with # in quoted value\n auto qc = parse_config(\"[b]\\nv = \\\"has # inside\\\" # real comment\\n\");\n assert(qc[\"b\"][\"v\"] == \"has # inside\");\n","category":"pattern_matching"} {"id":"17","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cstack\u003e\n#include \u003ccassert\u003e\n\n// Check if brackets are balanced in the input string.\n// Brackets: ( ) [ ] { }\n// Ignore brackets inside double-quoted strings \"...\".\n// Backslash escapes inside strings: \\\" does not end the string.\n// Returns true if balanced, false otherwise.\nbool brackets_balanced(const std::string\u0026 text) {\n","golden_completion":" std::stack\u003cchar\u003e stk; bool in_str = false;\n for (size_t i = 0; i \u003c text.size(); i++) {\n char c = text[i];\n if (in_str) { if (c==\u0027\\\\\u0027 \u0026\u0026 i+1\u003ctext.size()) { i++; continue; } if (c==\u0027\"\u0027) in_str=false; continue; }\n if (c == \u0027\"\u0027) { in_str = true; continue; }\n if (c==\u0027(\u0027||c==\u0027[\u0027||c==\u0027{\u0027) stk.push(c);\n else if (c==\u0027)\u0027||c==\u0027]\u0027||c==\u0027}\u0027) {\n if (stk.empty()) return false; char t=stk.top(); stk.pop();\n if ((c==\u0027)\u0027\u0026\u0026t!=\u0027(\u0027)||(c==\u0027]\u0027\u0026\u0026t!=\u0027[\u0027)||(c==\u0027}\u0027\u0026\u0026t!=\u0027{\u0027)) return false;\n }\n } return stk.empty();\n","suffix":"}\n\nint main() {\n assert(brackets_balanced(\"()[]{}\") == true);\n assert(brackets_balanced(\"([)]\") == false);\n assert(brackets_balanced(\"(]\") == false);\n\n // Brackets inside strings should be IGNORED\n assert(brackets_balanced(\"\\\"(\\\"\") == true);\n assert(brackets_balanced(\"\\\"[[[\\\"\") == true);\n\n // Escaped quote inside string: the bracket after \\\" is still inside the string\n assert(brackets_balanced(\"\\\"hello \\\\\\\" ( world\\\"\") == true);\n\n return 0;\n}\n","assertions":" assert(brackets_balanced(\"\") == true);\n assert(brackets_balanced(\"abc\") == true);\n assert(brackets_balanced(\"(\") == false);\n assert(brackets_balanced(\")\") == false);\n // Mixed brackets and strings\n assert(brackets_balanced(\"{\\\"}\\\"}\") == true);\n assert(brackets_balanced(\"[\\\"]\\\"]\") == true);\n // Nested correctly\n assert(brackets_balanced(\"({[]})\") == true);\n // Backslash outside string is not special — ( and ) still match\n assert(brackets_balanced(\"(\\\\)\") == true);\n // Mismatched outside strings\n assert(brackets_balanced(\"(}\") == false);\n // Unclosed string with bracket — string is unclosed, bracket inside\n // Actually, we treat unclosed string as still in_str, so bracket is ignored =\u003e balanced stack\n assert(brackets_balanced(\"\\\"(\") == true);\n","category":"pattern_matching"} {"id":"18","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\n// Custom edit distance: insert=1, delete=1, replace=1, but\n// swapping two ADJACENT characters costs 0.5 (Damerau transposition).\n// edit_distance(\"ab\", \"ba\") = 0.5, NOT 2.\n// edit_distance(\"cat\", \"car\") = 1.0 (replace, no swap possible).\ndouble edit_distance(const std::string\u0026 a, const std::string\u0026 b) {\n","golden_completion":" int m = a.size(), n = b.size();\n std::vector\u003cstd::vector\u003cdouble\u003e\u003e dp(m+1, std::vector\u003cdouble\u003e(n+1));\n for (int i = 0; i \u003c= m; i++) dp[i][0] = i;\n for (int j = 0; j \u003c= n; j++) dp[0][j] = j;\n for (int i = 1; i \u003c= m; i++) for (int j = 1; j \u003c= n; j++) {\n double c = (a[i-1]==b[j-1]) ? 0.0 : 1.0;\n dp[i][j] = std::min({dp[i-1][j]+1.0, dp[i][j-1]+1.0, dp[i-1][j-1]+c});\n if (i\u003e1 \u0026\u0026 j\u003e1 \u0026\u0026 a[i-1]==b[j-2] \u0026\u0026 a[i-2]==b[j-1]) dp[i][j] = std::min(dp[i][j], dp[i-2][j-2]+0.5);\n }\n return dp[m][n];\n","suffix":"}\n\nint main() {\n assert(edit_distance(\"ab\", \"ba\") == 0.5);\n assert(edit_distance(\"cat\", \"car\") == 1.0);\n assert(edit_distance(\"\", \"abc\") == 3.0);\n assert(edit_distance(\"abc\", \"abc\") == 0.0);\n // Two adjacent swaps\n assert(edit_distance(\"abcd\", \"badc\") == 1.0);\n\n return 0;\n}\n","assertions":" assert(edit_distance(\"\", \"\") == 0.0);\n assert(edit_distance(\"a\", \"b\") == 1.0);\n assert(edit_distance(\"abcd\", \"abdc\") == 0.5);\n assert(std::abs(edit_distance(\"kitten\", \"sitting\") - 3.0) \u003c 1e-9);\n assert(edit_distance(\"ab\", \"ba\") == 0.5);\n // Single char\n assert(edit_distance(\"x\", \"\") == 1.0);\n assert(edit_distance(\"\", \"y\") == 1.0);\n // Swap at start\n assert(edit_distance(\"ba\", \"ab\") == 0.5);\n","category":"pattern_matching"} {"id":"19","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Run-length encode a string.\n// Output format: COUNT then CHARACTER, e.g. \"aaabbc\" =\u003e \"3a2b1c\".\n// Single occurrences still get \"1\" prefix: \"abc\" =\u003e \"1a1b1c\".\n// Empty input returns empty string.\n// This is count-BEFORE-char format, NOT the common char-then-count format.\nstd::string run_length_encode(const std::string\u0026 s) {\n","golden_completion":" if (s.empty()) return \"\";\n std::string result;\n int count = 1;\n for (size_t i = 1; i \u003c= s.size(); i++) {\n if (i \u003c s.size() \u0026\u0026 s[i] == s[i-1]) {\n count++;\n } else {\n result += std::to_string(count) + s[i-1];\n count = 1;\n }\n }\n return result;\n","suffix":"}\n\nint main() {\n assert(run_length_encode(\"aaabbc\") == \"3a2b1c\");\n assert(run_length_encode(\"abc\") == \"1a1b1c\");\n assert(run_length_encode(\"\") == \"\");\n assert(run_length_encode(\"aaa\") == \"3a\");\n\n // Single character\n assert(run_length_encode(\"x\") == \"1x\");\n\n return 0;\n}\n","assertions":" assert(run_length_encode(\"aabbcc\") == \"2a2b2c\");\n assert(run_length_encode(\"aaaa\") == \"4a\");\n assert(run_length_encode(\"abab\") == \"1a1b1a1b\");\n // Long run\n assert(run_length_encode(\"zzzzzzzzzz\") == \"10z\");\n // Two different chars\n assert(run_length_encode(\"ab\") == \"1a1b\");\n // Repeated pattern\n assert(run_length_encode(\"aabb\") == \"2a2b\");\n","category":"pattern_matching"} {"id":"20","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003ccassert\u003e\n\n// Custom sort: primary key = length (ascending), secondary key = reverse\n// alphabetical (descending) for same-length strings.\n// \"cat\" \u003c \"apple\" because len 3 \u003c len 5.\n// \"cat\" \u003e \"ant\" because same length 3 but \u0027c\u0027 \u003e \u0027a\u0027 (reverse alpha: c first).\n// So among length-3 strings: \"cat\", \"bat\", \"ant\" =\u003e sorted as \"cat\", \"bat\", \"ant\".\nstd::vector\u003cstd::string\u003e custom_sort(std::vector\u003cstd::string\u003e items) {\n","golden_completion":" std::sort(items.begin(), items.end(), [](const std::string\u0026 a, const std::string\u0026 b) {\n if (a.size() != b.size()) return a.size() \u003c b.size();\n return a \u003e b; // reverse alphabetical\n });\n return items;\n","suffix":"}\n\nint main() {\n auto r1 = custom_sort({\"apple\", \"cat\", \"bat\", \"ant\", \"be\"});\n assert(r1 == (std::vector\u003cstd::string\u003e{\"be\", \"cat\", \"bat\", \"ant\", \"apple\"}));\n\n // Same length, reverse alpha\n auto r2 = custom_sort({\"c\", \"a\", \"b\"});\n assert(r2 == (std::vector\u003cstd::string\u003e{\"c\", \"b\", \"a\"}));\n\n // Already sorted\n auto r3 = custom_sort({\"z\", \"aa\"});\n assert(r3 == (std::vector\u003cstd::string\u003e{\"z\", \"aa\"}));\n\n return 0;\n}\n","assertions":" // Empty\n assert(custom_sort({}).empty());\n // Single element\n assert(custom_sort({\"hello\"}) == (std::vector\u003cstd::string\u003e{\"hello\"}));\n // All same length\n auto r4 = custom_sort({\"dog\", \"cat\", \"bat\", \"ant\"});\n assert(r4 == (std::vector\u003cstd::string\u003e{\"dog\", \"cat\", \"bat\", \"ant\"}));\n // Mixed lengths\n auto r5 = custom_sort({\"a\", \"bb\", \"cc\", \"d\"});\n assert(r5 == (std::vector\u003cstd::string\u003e{\"d\", \"a\", \"cc\", \"bb\"}));\n // Duplicates\n auto r6 = custom_sort({\"ab\", \"ab\", \"a\"});\n assert(r6 == (std::vector\u003cstd::string\u003e{\"a\", \"ab\", \"ab\"}));\n","category":"pattern_matching"} {"id":"21","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ccctype\u003e\n#include \u003csstream\u003e\n#include \u003ciomanip\u003e\n\n// Strict URL encoder: encodes EVERY byte that is NOT alphanumeric.\n// Standard URL encoding keeps -._~ unescaped — this one does NOT.\n// Hex digits in %XX are REVERSED: the low nibble comes first, then the high nibble.\n// Example: space (0x20) -\u003e low nibble 0, high nibble 2 -\u003e \"%02\"\n// \u0027/\u0027 (0x2F) -\u003e low nibble F, high nibble 2 -\u003e \"%F2\"\n// The input is pure ASCII (no multi-byte).\nstd::string url_encode(const std::string\u0026 text) {\n","golden_completion":" const char* hex = \"0123456789ABCDEF\";\n std::string out;\n for (unsigned char c : text) {\n if (std::isalnum(c)) {\n out += c;\n } else {\n out += \u0027%\u0027;\n out += hex[c \u0026 0x0F]; // low nibble first (reversed)\n out += hex[(c \u003e\u003e 4) \u0026 0x0F]; // high nibble second\n }\n }\n return out;\n","suffix":"}\n\nint main() {\n // Space is 0x20 -\u003e low=0, high=2 -\u003e \"%02\"\n assert(url_encode(\"a b\") == \"a%02b\");\n // \u0027/\u0027 is 0x2F -\u003e low=F, high=2 -\u003e \"%F2\"\n assert(url_encode(\"/\") == \"%F2\");\n // \u0027~\u0027 is 0x7E -\u003e low=E, high=7 -\u003e \"%E7\"\n assert(url_encode(\"~\") == \"%E7\");\n // Standard URL encoding would keep ~ unencoded:\n assert(url_encode(\"~\") != \"~\");\n // Pure alpha stays unchanged\n assert(url_encode(\"abc\") == \"abc\");\n // Standard hex for space would be \"%20\", ours is \"%02\"\n assert(url_encode(\" \") != \"%20\");\n return 0;\n}\n","assertions":" assert(url_encode(\"\") == \"\");\n assert(url_encode(\"Hello\") == \"Hello\");\n // \u0027+\u0027 is 0x2B -\u003e low=B, high=2 -\u003e \"%B2\"\n assert(url_encode(\"+\") == \"%B2\");\n // \u0027=\u0027 is 0x3D -\u003e low=D, high=3 -\u003e \"%D3\"\n assert(url_encode(\"=\") == \"%D3\");\n // \u0027_\u0027 is 0x5F -\u003e low=F, high=5 -\u003e \"%F5\"\n assert(url_encode(\"_\") == \"%F5\");\n // \u0027.\u0027 is 0x2E -\u003e low=E, high=2 -\u003e \"%E2\"\n assert(url_encode(\".\") == \"%E2\");\n assert(url_encode(\"a.b\") == \"a%E2b\");\n","category":"pattern_matching"} {"id":"22","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ccctype\u003e\n\n// Aggressive HTML escape: every character that is NOT alphanumeric and NOT\n// whitespace (space, tab, newline) is replaced with its decimal numeric\n// character reference: \u0026#DD; (e.g., \u0027\u0026\u0027 -\u003e \"\u0026#38;\", \u0027\u003c\u0027 -\u003e \"\u0026#60;\").\n// Spaces/tabs/newlines are kept as-is.\n// This is STRICTER than standard HTML escaping which only escapes \u0026\u003c\u003e\"\u0027.\nstd::string html_escape(const std::string\u0026 text) {\n","golden_completion":" std::string out;\n for (unsigned char c : text) {\n if (std::isalnum(c) || c == \u0027 \u0027 || c == \u0027\\t\u0027 || c == \u0027\\n\u0027) {\n out += c;\n } else {\n out += \"\u0026#\";\n out += std::to_string(static_cast\u003cint\u003e(c));\n out += \";\";\n }\n }\n return out;\n","suffix":"}\n\nint main() {\n // Standard HTML escaping only escapes 5 chars; ours escapes everything non-alnum\n assert(html_escape(\"a\u0026b\") == \"a\u0026#38;b\");\n assert(html_escape(\"x\u003cy\") == \"x\u0026#60;y\");\n // Dot is NOT standard-escaped, but ours escapes it:\n assert(html_escape(\".\") == \"\u0026#46;\");\n // Slash too:\n assert(html_escape(\"/\") == \"\u0026#47;\");\n // Spaces are kept:\n assert(html_escape(\"a b\") == \"a b\");\n // Pure alnum untouched:\n assert(html_escape(\"Hello123\") == \"Hello123\");\n return 0;\n}\n","assertions":" assert(html_escape(\"\") == \"\");\n assert(html_escape(\"abc\") == \"abc\");\n // Underscore: \u0027_\u0027 = 95\n assert(html_escape(\"_\") == \"\u0026#95;\");\n // Hyphen: \u0027-\u0027 = 45\n assert(html_escape(\"-\") == \"\u0026#45;\");\n // Mixed: \"a-b_c\" -\u003e \"a\u0026#45;b\u0026#95;c\"\n assert(html_escape(\"a-b_c\") == \"a\u0026#45;b\u0026#95;c\");\n // Tab and newline preserved\n assert(html_escape(\"\\t\") == \"\\t\");\n assert(html_escape(\"\\n\") == \"\\n\");\n // Multiple specials\n assert(html_escape(\"x\u0026y\u003cz\u003ew\") == \"x\u0026#38;y\u0026#60;z\u0026#62;w\");\n","category":"pattern_matching"} {"id":"23","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n\n// Parse a single CSV record (one logical row) from a stream of characters.\n// - Fields are separated by the given delimiter (default \u0027,\u0027).\n// - Fields may be enclosed in double quotes.\n// - Inside a quoted field, a literal quote is represented by two consecutive quotes (\"\").\n// - Newlines inside a quoted field are part of the field value.\n// - Leading/trailing whitespace outside quotes is NOT trimmed.\n//\n// The function receives the FULL text (which may contain multiple rows)\n// and a reference to a position index. It parses ONE logical row starting\n// at pos, advances pos past the row (including the terminating newline if any),\n// and returns the fields of that row.\n//\n// If pos \u003e= text.size(), returns an empty vector (no more rows).\nstd::vector\u003cstd::string\u003e parse_csv_row(const std::string\u0026 text, size_t\u0026 pos, char delim = \u0027,\u0027) {\n","golden_completion":" std::vector\u003cstd::string\u003e fields;\n if (pos \u003e= text.size()) return fields;\n std::string field; bool q = false;\n while (pos \u003c text.size()) {\n char c = text[pos++];\n if (q) { if (c==\u0027\"\u0027) { if (pos\u003ctext.size()\u0026\u0026text[pos]==\u0027\"\u0027) {field+=\u0027\"\u0027;pos++;} else q=false; } else field+=c; }\n else if (c==\u0027\"\u0027) q=true;\n else if (c==delim) { fields.push_back(field); field.clear(); }\n else if (c==\u0027\\n\u0027) { fields.push_back(field); return fields; }\n else field+=c;\n }\n fields.push_back(field); return fields;\n","suffix":"}\n\nint main() {\n // Simple row\n {\n size_t p = 0;\n std::string csv = \"a,b,c\\n\";\n auto row = parse_csv_row(csv, p, \u0027,\u0027);\n assert(row.size() == 3);\n assert(row[0] == \"a\" \u0026\u0026 row[1] == \"b\" \u0026\u0026 row[2] == \"c\");\n }\n // Quoted field with comma\n {\n size_t p = 0;\n std::string csv = \"\\\"hello, world\\\",42\\n\";\n auto row = parse_csv_row(csv, p, \u0027,\u0027);\n assert(row.size() == 2);\n assert(row[0] == \"hello, world\");\n assert(row[1] == \"42\");\n }\n // Escaped quote\n {\n size_t p = 0;\n std::string csv = \"\\\"say \\\"\\\"hi\\\"\\\"\\\",done\\n\";\n auto row = parse_csv_row(csv, p, \u0027,\u0027);\n assert(row.size() == 2);\n assert(row[0] == \"say \\\"hi\\\"\");\n }\n return 0;\n}\n","assertions":" // Newline inside quotes\n {\n size_t p = 0;\n std::string csv = \"\\\"line1\\nline2\\\",end\\n\";\n auto row = parse_csv_row(csv, p, \u0027,\u0027);\n assert(row.size() == 2);\n assert(row[0] == \"line1\\nline2\");\n assert(row[1] == \"end\");\n }\n // Custom delimiter\n {\n size_t p = 0;\n std::string csv = \"a|b|c\\n\";\n auto row = parse_csv_row(csv, p, \u0027|\u0027);\n assert(row.size() == 3);\n assert(row[0] == \"a\" \u0026\u0026 row[1] == \"b\" \u0026\u0026 row[2] == \"c\");\n }\n // Multiple rows (parse two)\n {\n size_t p = 0;\n std::string csv = \"x,y\\na,b\\n\";\n auto r1 = parse_csv_row(csv, p, \u0027,\u0027);\n auto r2 = parse_csv_row(csv, p, \u0027,\u0027);\n assert(r1[0] == \"x\" \u0026\u0026 r1[1] == \"y\");\n assert(r2[0] == \"a\" \u0026\u0026 r2[1] == \"b\");\n }\n // Empty fields\n {\n size_t p = 0;\n std::string csv = \",,,\\n\";\n auto row = parse_csv_row(csv, p, \u0027,\u0027);\n assert(row.size() == 4);\n for (auto\u0026 f : row) assert(f == \"\");\n }\n // EOF without newline\n {\n size_t p = 0;\n std::string csv = \"x,y\";\n auto row = parse_csv_row(csv, p, \u0027,\u0027);\n assert(row.size() == 2);\n assert(row[0] == \"x\" \u0026\u0026 row[1] == \"y\");\n }\n","category":"pattern_matching"} {"id":"24","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003ccassert\u003e\n#include \u003csstream\u003e\n\n// Parse INI-style config text. Returns a nested map: section -\u003e key -\u003e value.\n//\n// Rules:\n// - Lines starting with \u0027#\u0027 or \u0027;\u0027 are comments (after trimming leading spaces).\n// - \"[section]\" starts a new section.\n// - \"key = value\" adds a key-value pair to the current section.\n// - Leading/trailing whitespace on keys and values is trimmed.\n// - Section names can contain \u0027.\u0027 for hierarchy: \"[parent.child]\".\n// A child section INHERITS all keys from its parent section that it doesn\u0027t\n// override. E.g. if [db] has host=localhost and [db.prod] has port=5432,\n// then [db.prod] has BOTH host=localhost AND port=5432.\n// - The global (unnamed) section is stored under the key \"\".\n// - Inheritance is ONLY one level deep: \"a.b\" inherits from \"a\", but NOT\n// from \"\" (global).\n\nusing IniMap = std::map\u003cstd::string, std::map\u003cstd::string, std::string\u003e\u003e;\n\nIniMap parse_ini(const std::string\u0026 text) {\n","golden_completion":" IniMap result; std::string section; std::istringstream stream(text); std::string line;\n auto trim=[](std::string s){size_t a=s.find_first_not_of(\" \\t\"),b=s.find_last_not_of(\" \\t\");return a==std::string::npos?\"\":s.substr(a,b-a+1);};\n while (std::getline(stream, line)) {\n std::string t = trim(line); if (t.empty()||t[0]==\u0027#\u0027||t[0]==\u0027;\u0027) continue;\n if (t[0]==\u0027[\u0027) { section=t.substr(1,t.find(\u0027]\u0027)-1); }\n else { auto eq=t.find(\u0027=\u0027); if(eq==std::string::npos)continue; result[section][trim(t.substr(0,eq))]=trim(t.substr(eq+1)); }\n }\n for (auto\u0026 [sec,kv]:result) { auto d=sec.rfind(\u0027.\u0027); if(d!=std::string::npos) { auto p=sec.substr(0,d); if(result.count(p)) for(auto\u0026[pk,pv]:result[p]) if(!kv.count(pk)) kv[pk]=pv; } }\n return result;\n","suffix":"}\n\nint main() {\n std::string ini = R\"(\n# Database config\n[db]\nhost = localhost\nport = 3306\n\n[db.prod]\nport = 5432\n\n[db.staging]\nhost = staging.local\n)\";\n auto cfg = parse_ini(ini);\n // [db.prod] inherits host from [db], overrides port\n assert(cfg[\"db.prod\"][\"host\"] == \"localhost\");\n assert(cfg[\"db.prod\"][\"port\"] == \"5432\");\n // [db.staging] inherits port from [db], overrides host\n assert(cfg[\"db.staging\"][\"port\"] == \"3306\");\n assert(cfg[\"db.staging\"][\"host\"] == \"staging.local\");\n // [db] is unchanged\n assert(cfg[\"db\"][\"host\"] == \"localhost\");\n assert(cfg[\"db\"][\"port\"] == \"3306\");\n return 0;\n}\n","assertions":" // Global section\n {\n std::string ini2 = \"key = global_val\\n[s1]\\nk = v\\n\";\n auto c = parse_ini(ini2);\n assert(c[\"\"][\"key\"] == \"global_val\");\n assert(c[\"s1\"][\"k\"] == \"v\");\n // s1 does NOT inherit from global\n assert(c[\"s1\"].find(\"key\") == c[\"s1\"].end());\n }\n // Comment variations\n {\n std::string ini3 = \"; comment\\n# also comment\\n[x]\\na = 1\\n\";\n auto c = parse_ini(ini3);\n assert(c[\"x\"][\"a\"] == \"1\");\n assert(c.size() == 1); // only [x]\n }\n // Deep nesting — only inherits one level\n {\n std::string ini4 = \"[a]\\nk1 = v1\\n[a.b]\\nk2 = v2\\n[a.b.c]\\nk3 = v3\\n\";\n auto c = parse_ini(ini4);\n // a.b inherits k1 from a\n assert(c[\"a.b\"][\"k1\"] == \"v1\");\n // a.b.c inherits from \"a.b\" (parent up to last dot)\n assert(c[\"a.b.c\"][\"k2\"] == \"v2\");\n // a.b.c does NOT get k1 (only one level deep: a.b.c inherits from a.b, not a)\n // But a.b HAS k1 (inherited from a), so a.b.c inherits it too\n assert(c[\"a.b.c\"][\"k1\"] == \"v1\");\n }\n","category":"pattern_matching"} {"id":"25","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n\nstruct LogEntry {\n std::string timestamp; // e.g., \"2024-01-15 10:30:45\"\n std::string level; // INFO, WARN, ERROR, DEBUG\n std::string message; // rest of the line after the level\n};\n\n// Parse log lines in format: \"[TIMESTAMP] LEVEL: message text\"\n// Example: \"[2024-01-15 10:30:45] ERROR: disk full\"\n// The timestamp is everything between \u0027[\u0027 and \u0027]\u0027.\n// The level is the first word after \u0027] \u0027, ending at \u0027:\u0027.\n// The message is everything after \": \" (note: space after colon).\n// If a line doesn\u0027t match this format, skip it.\nstd::vector\u003cLogEntry\u003e parse_log(const std::string\u0026 text) {\n","golden_completion":" std::vector\u003cLogEntry\u003e entries; size_t pos = 0;\n while (pos \u003c text.size()) {\n size_t eol = text.find(\u0027\\n\u0027, pos); if (eol==std::string::npos) eol=text.size();\n std::string line = text.substr(pos, eol-pos); pos = eol+1;\n if (line.empty()||line[0]!=\u0027[\u0027) continue;\n size_t cb=line.find(\u0027]\u0027,1); if (cb==std::string::npos) continue;\n size_t colon=line.find(\u0027:\u0027,cb+2); if (colon==std::string::npos) continue;\n entries.push_back({line.substr(1,cb-1), line.substr(cb+2,colon-cb-2), colon+2\u003cline.size()?line.substr(colon+2):\"\"});\n }\n return entries;\n","suffix":"}\n\nint main() {\n std::string log =\n \"[2024-01-15 10:30:45] ERROR: disk full\\n\"\n \"[2024-01-15 10:31:00] INFO: recovered\\n\"\n \"not a log line\\n\"\n \"[2024-01-15 10:32:00] WARN: level ERROR found in message\\n\";\n auto entries = parse_log(log);\n assert(entries.size() == 3);\n assert(entries[0].timestamp == \"2024-01-15 10:30:45\");\n assert(entries[0].level == \"ERROR\");\n assert(entries[0].message == \"disk full\");\n assert(entries[1].level == \"INFO\");\n // The message of the WARN entry contains \"ERROR\" — must not confuse parser\n assert(entries[2].level == \"WARN\");\n assert(entries[2].message == \"level ERROR found in message\");\n return 0;\n}\n","assertions":" // Empty input\n assert(parse_log(\"\").empty());\n // Only invalid lines\n assert(parse_log(\"hello\\nworld\\n\").empty());\n // Message with colons\n {\n auto e = parse_log(\"[2024-01-01 00:00:00] DEBUG: key:value:data\\n\");\n assert(e.size() == 1);\n assert(e[0].level == \"DEBUG\");\n assert(e[0].message == \"key:value:data\");\n }\n // Empty message\n {\n auto e = parse_log(\"[2024-01-01 00:00:00] INFO: \\n\");\n assert(e.size() == 1);\n assert(e[0].message == \"\");\n }\n // No trailing newline\n {\n auto e = parse_log(\"[2024-01-01 00:00:00] ERROR: no newline\");\n assert(e.size() == 1);\n assert(e[0].message == \"no newline\");\n }\n","category":"pattern_matching"} {"id":"26","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ccctype\u003e\n\nenum class TokenType { NUMBER, STRING, IDENT, OP, LPAREN, RPAREN, END };\n\nstruct Token {\n TokenType type;\n std::string value;\n bool operator==(const Token\u0026 o) const { return type == o.type \u0026\u0026 value == o.value; }\n};\n\n// Tokenize an expression string. Token types:\n// - NUMBER: sequence of digits (no decimals)\n// - STRING: characters between double quotes (the quotes are NOT included in value;\n// backslash-escaped quotes \\\" inside strings are literal quotes)\n// - IDENT: letter followed by letters/digits/underscores\n// - OP: one of the multi-char operators ==, !=, \u003c=, \u003e=, \u0026\u0026, ||\n// OR a single-char operator: +, -, *, /, \u003c, \u003e, =, !, \u0026, |\n// Multi-char operators take priority over single-char.\n// - LPAREN: \u0027(\u0027 RPAREN: \u0027)\u0027\n// Whitespace is skipped. Unknown characters are skipped.\nstd::vector\u003cToken\u003e tokenize(const std::string\u0026 expr) {\n","golden_completion":" std::vector\u003cToken\u003e tokens; size_t i=0; std::string ops=\"+-*/\u003c\u003e=!\u0026|\";\n while (i\u003cexpr.size()) {\n char c=expr[i]; if(std::isspace(c)){i++;continue;}\n if(std::isdigit(c)){size_t s=i;while(i\u003cexpr.size()\u0026\u0026std::isdigit(expr[i]))i++;tokens.push_back({TokenType::NUMBER,expr.substr(s,i-s)});continue;}\n if(c==\u0027\"\u0027){i++;std::string v;while(i\u003cexpr.size()\u0026\u0026expr[i]!=\u0027\"\u0027){if(expr[i]==\u0027\\\\\u0027\u0026\u0026i+1\u003cexpr.size())v+=expr[++i];else v+=expr[i];i++;}if(i\u003cexpr.size())i++;tokens.push_back({TokenType::STRING,v});continue;}\n if(std::isalpha(c)){size_t s=i;while(i\u003cexpr.size()\u0026\u0026(std::isalnum(expr[i])||expr[i]==\u0027_\u0027))i++;tokens.push_back({TokenType::IDENT,expr.substr(s,i-s)});continue;}\n if(c==\u0027(\u0027||c==\u0027)\u0027){tokens.push_back({c==\u0027(\u0027?TokenType::LPAREN:TokenType::RPAREN,std::string(1,c)});i++;continue;}\n std::string tw=(i+1\u003cexpr.size())?expr.substr(i,2):\"\"; if(tw==\"==\"||tw==\"!=\"||tw==\"\u003c=\"||tw==\"\u003e=\"||tw==\"\u0026\u0026\"||tw==\"||\"){tokens.push_back({TokenType::OP,tw});i+=2;continue;}\n if(ops.find(c)!=std::string::npos){tokens.push_back({TokenType::OP,std::string(1,c)});i++;continue;} i++;\n }\n return tokens;\n","suffix":"}\n\nint main() {\n auto t = tokenize(\"x == 10 \u0026\u0026 y != 20\");\n assert(t.size() == 7);\n assert(t[0] == (Token{TokenType::IDENT, \"x\"}));\n assert(t[1] == (Token{TokenType::OP, \"==\"}));\n assert(t[2] == (Token{TokenType::NUMBER, \"10\"}));\n assert(t[3] == (Token{TokenType::OP, \"\u0026\u0026\"}));\n assert(t[4] == (Token{TokenType::IDENT, \"y\"}));\n assert(t[5] == (Token{TokenType::OP, \"!=\"}));\n assert(t[6] == (Token{TokenType::NUMBER, \"20\"}));\n\n auto t2 = tokenize(\"\\\"hello \\\\\\\"world\\\\\\\"\\\"\");\n assert(t2.size() == 1);\n assert(t2[0].type == TokenType::STRING);\n assert(t2[0].value == \"hello \\\"world\\\"\");\n return 0;\n}\n","assertions":" // Empty\n assert(tokenize(\"\").empty());\n // Parens and single ops\n {\n auto t = tokenize(\"(a + b) * c\");\n assert(t.size() == 7);\n assert(t[0].type == TokenType::LPAREN);\n assert(t[2].type == TokenType::OP \u0026\u0026 t[2].value == \"+\");\n assert(t[6] == (Token{TokenType::IDENT, \"c\"}));\n }\n // \u003c= and \u003e= vs \u003c and \u003e\n {\n auto t = tokenize(\"a \u003c= b \u003e= c \u003c d \u003e e\");\n assert(t[1] == (Token{TokenType::OP, \"\u003c=\"}));\n assert(t[3] == (Token{TokenType::OP, \"\u003e=\"}));\n assert(t[5] == (Token{TokenType::OP, \"\u003c\"}));\n assert(t[7] == (Token{TokenType::OP, \"\u003e\"}));\n }\n // || operator\n {\n auto t = tokenize(\"a || b\");\n assert(t[1] == (Token{TokenType::OP, \"||\"}));\n }\n // String with no escapes\n {\n auto t = tokenize(\"\\\"abc\\\"\");\n assert(t.size() == 1 \u0026\u0026 t[0].value == \"abc\");\n }\n // Identifiers with underscores\n {\n auto t = tokenize(\"my_var_2\");\n assert(t.size() == 1 \u0026\u0026 t[0].value == \"my_var_2\");\n }\n","category":"pattern_matching"} {"id":"27","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n\nusing Matrix = std::vector\u003cstd::vector\u003cdouble\u003e\u003e;\n\n// Multiply matrix A by the TRANSPOSE of matrix B.\n// That is, compute C = A * B^T.\n// A is (m x k), B is (n x k) — note: B has n rows and k columns,\n// so B^T is (k x n), and C = A * B^T is (m x n).\n//\n// This is NOT standard A*B where B must be (k x n).\n// Here B\u0027s rows are treated as columns.\n//\n// C[i][j] = sum over p of A[i][p] * B[j][p] (note: B[j][p], not B[p][j])\nMatrix mul_transposed(const Matrix\u0026 A, const Matrix\u0026 B) {\n","golden_completion":" int m = A.size(), k = A[0].size(), n = B.size();\n Matrix C(m, std::vector\u003cdouble\u003e(n, 0.0));\n for (int i = 0; i \u003c m; i++)\n for (int j = 0; j \u003c n; j++)\n for (int p = 0; p \u003c k; p++)\n C[i][j] += A[i][p] * B[j][p];\n return C;\n","suffix":"}\n\nint main() {\n // A = [[1, 2], [3, 4]] (2x2)\n // B = [[5, 6], [7, 8]] (2x2)\n // B^T = [[5, 7], [6, 8]]\n // C = A * B^T = [[1*5+2*7, 1*6+2*8], [3*5+4*7, 3*6+4*8]]\n // = [[19, 22], [43, 50]]\n // NOTE: standard A*B = [[1*5+2*7, 1*6+2*8], [3*5+4*7, 3*6+4*8]] = [[19,22],[43,50]]\n // For a 2x2 symmetric case this is the same! Use asymmetric matrices:\n\n // A = [[1, 2, 3]] (1x3)\n // B = [[4, 5, 6], [7, 8, 9]] (2x3)\n // B^T = [[4, 7], [5, 8], [6, 9]] (3x2)\n // C = A * B^T = [[1*4+2*5+3*6, 1*7+2*8+3*9]] = [[32, 50]] (1x2)\n Matrix A = {{1, 2, 3}};\n Matrix B = {{4, 5, 6}, {7, 8, 9}};\n auto C = mul_transposed(A, B);\n assert(C.size() == 1 \u0026\u0026 C[0].size() == 2);\n assert(std::abs(C[0][0] - 32.0) \u003c 1e-9);\n assert(std::abs(C[0][1] - 50.0) \u003c 1e-9);\n\n // Standard A*B would require B to be (3x?), but B is (2x3).\n // If model does standard mul, it would either crash or give wrong dimensions.\n return 0;\n}\n","assertions":" // Identity-like test: A = [[1,0],[0,1]], B = [[3,4],[5,6]]\n // C = A * B^T: C[0][0]=1*3+0*4=3, C[0][1]=1*5+0*6=5\n // C[1][0]=0*3+1*4=4, C[1][1]=0*5+1*6=6\n {\n Matrix A2 = {{1,0},{0,1}};\n Matrix B2 = {{3,4},{5,6}};\n auto C2 = mul_transposed(A2, B2);\n assert(C2.size() == 2 \u0026\u0026 C2[0].size() == 2);\n assert(std::abs(C2[0][0] - 3.0) \u003c 1e-9);\n assert(std::abs(C2[0][1] - 5.0) \u003c 1e-9);\n assert(std::abs(C2[1][0] - 4.0) \u003c 1e-9);\n assert(std::abs(C2[1][1] - 6.0) \u003c 1e-9);\n }\n // Single element\n {\n Matrix A3 = {{7}};\n Matrix B3 = {{3}};\n auto C3 = mul_transposed(A3, B3);\n assert(C3.size() == 1 \u0026\u0026 C3[0].size() == 1);\n assert(std::abs(C3[0][0] - 21.0) \u003c 1e-9);\n }\n // A (2x3), B (3x3) -\u003e C (2x3)\n {\n Matrix A4 = {{1,0,0},{0,1,0}};\n Matrix B4 = {{1,0,0},{0,1,0},{0,0,1}};\n auto C4 = mul_transposed(A4, B4);\n assert(C4.size() == 2 \u0026\u0026 C4[0].size() == 3);\n assert(std::abs(C4[0][0] - 1.0) \u003c 1e-9);\n assert(std::abs(C4[0][1] - 0.0) \u003c 1e-9);\n assert(std::abs(C4[1][1] - 1.0) \u003c 1e-9);\n }\n","category":"pattern_matching"} {"id":"28","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003ccassert\u003e\n\n// Binary search on a SORTED vector. Return the index of the LAST\n// occurrence of target. If target is not found, return -1.\n//\n// Standard lower_bound/upper_bound returns the first occurrence or\n// the insertion point. This function must return the LAST index\n// where vec[index] == target.\nint binary_search_last(const std::vector\u003cint\u003e\u0026 vec, int target) {\n","golden_completion":" int lo = 0, hi = (int)vec.size()-1, result = -1;\n while (lo \u003c= hi) {\n int mid = lo + (hi-lo)/2;\n if (vec[mid] == target) { result = mid; lo = mid+1; }\n else if (vec[mid] \u003c target) lo = mid+1;\n else hi = mid-1;\n }\n return result;\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e v = {1, 2, 2, 2, 3, 4, 4, 5};\n assert(binary_search_last(v, 2) == 3); // last 2 is at index 3\n assert(binary_search_last(v, 4) == 6); // last 4 is at index 6\n assert(binary_search_last(v, 1) == 0); // only one 1\n assert(binary_search_last(v, 5) == 7); // only one 5\n assert(binary_search_last(v, 6) == -1); // not found\n return 0;\n}\n","assertions":" // All same elements\n {\n std::vector\u003cint\u003e v2 = {3, 3, 3, 3, 3};\n assert(binary_search_last(v2, 3) == 4);\n }\n // Single element found\n {\n std::vector\u003cint\u003e v3 = {7};\n assert(binary_search_last(v3, 7) == 0);\n }\n // Single element not found\n {\n std::vector\u003cint\u003e v4 = {7};\n assert(binary_search_last(v4, 5) == -1);\n }\n // Empty vector\n {\n std::vector\u003cint\u003e v5 = {};\n assert(binary_search_last(v5, 1) == -1);\n }\n // First element repeated\n {\n std::vector\u003cint\u003e v6 = {1, 1, 1, 2, 3};\n assert(binary_search_last(v6, 1) == 2);\n }\n // Last element\n {\n std::vector\u003cint\u003e v7 = {1, 2, 3, 4, 5, 5, 5};\n assert(binary_search_last(v7, 5) == 6);\n }\n","category":"pattern_matching"} {"id":"29","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ccmath\u003e\n#include \u003calgorithm\u003e\n\n// Merge sort that sorts integers by absolute value ascending.\n// TIE-BREAKING RULE: when two elements have the same absolute value,\n// the POSITIVE number comes BEFORE the negative number.\n// E.g., +3 comes before -3.\n//\n// Standard sort with abs comparator would be unstable or put negatives first.\n// This requires a stable merge that respects the tie-breaking rule.\n\nvoid merge_sorted(std::vector\u003cint\u003e\u0026 arr, int left, int mid, int right) {\n std::vector\u003cint\u003e L(arr.begin() + left, arr.begin() + mid + 1);\n std::vector\u003cint\u003e R(arr.begin() + mid + 1, arr.begin() + right + 1);\n","golden_completion":" int i=0, j=0, k=left;\n while (i\u003c(int)L.size() \u0026\u0026 j\u003c(int)R.size()) {\n int la=std::abs(L[i]), ra=std::abs(R[j]);\n if (la\u003cra) arr[k++]=L[i++]; else if (la\u003era) arr[k++]=R[j++];\n else if (L[i]\u003e=0\u0026\u0026R[j]\u003c0) arr[k++]=L[i++]; else if (L[i]\u003c0\u0026\u0026R[j]\u003e=0) arr[k++]=R[j++];\n else arr[k++]=L[i++];\n }\n while(i\u003c(int)L.size()) arr[k++]=L[i++];\n while(j\u003c(int)R.size()) arr[k++]=R[j++];\n","suffix":"}\n\nvoid merge_sort(std::vector\u003cint\u003e\u0026 arr, int left, int right) {\n if (left \u003e= right) return;\n int mid = left + (right - left) / 2;\n merge_sort(arr, left, mid);\n merge_sort(arr, mid + 1, right);\n merge_sorted(arr, left, mid, right);\n}\n\nint main() {\n std::vector\u003cint\u003e v = {-3, 1, -1, 3, 2, -2};\n merge_sort(v, 0, v.size() - 1);\n // Expected: sorted by abs ascending, positives before negatives on ties\n // abs=1: 1, -1 abs=2: 2, -2 abs=3: 3, -3\n assert((v == std::vector\u003cint\u003e{1, -1, 2, -2, 3, -3}));\n return 0;\n}\n","assertions":" // Already sorted\n {\n std::vector\u003cint\u003e v2 = {1, -1, 2, -2};\n merge_sort(v2, 0, v2.size() - 1);\n assert((v2 == std::vector\u003cint\u003e{1, -1, 2, -2}));\n }\n // All positive\n {\n std::vector\u003cint\u003e v3 = {3, 1, 2};\n merge_sort(v3, 0, v3.size() - 1);\n assert((v3 == std::vector\u003cint\u003e{1, 2, 3}));\n }\n // All negative\n {\n std::vector\u003cint\u003e v4 = {-3, -1, -2};\n merge_sort(v4, 0, v4.size() - 1);\n assert((v4 == std::vector\u003cint\u003e{-1, -2, -3}));\n }\n // With zero\n {\n std::vector\u003cint\u003e v5 = {-1, 0, 1};\n merge_sort(v5, 0, v5.size() - 1);\n assert((v5 == std::vector\u003cint\u003e{0, 1, -1}));\n }\n // Single element\n {\n std::vector\u003cint\u003e v6 = {42};\n merge_sort(v6, 0, 0);\n assert(v6[0] == 42);\n }\n // Multiple same abs\n {\n std::vector\u003cint\u003e v7 = {-5, 5, -5, 5};\n merge_sort(v7, 0, v7.size() - 1);\n assert((v7 == std::vector\u003cint\u003e{5, 5, -5, -5}));\n }\n","category":"pattern_matching"} {"id":"30","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccstdint\u003e\n#include \u003ccassert\u003e\n\n// Custom FNV-1a hash variant.\n// Standard FNV-1a (32-bit): offset_basis = 2166136261, prime = 16777619\n// This variant uses: offset_basis = 1099511628211ULL, prime = 6364136223846793005ULL\n// (These are actually the FNV-1a 64-bit parameters, but we apply the\n// FNV-1a ALGORITHM: hash = offset; for each byte: hash ^= byte; hash *= prime)\n//\n// Additionally, after all bytes are processed, fold the 64-bit hash into\n// 32 bits by XOR-ing the upper and lower 32 bits:\n// result = (hash \u003e\u003e 32) ^ (hash \u0026 0xFFFFFFFF)\n//\n// Return the 32-bit folded result as a uint32_t.\nuint32_t custom_hash(const std::string\u0026 data) {\n","golden_completion":" uint64_t hash = 1099511628211ULL;\n uint64_t prime = 6364136223846793005ULL;\n for (unsigned char c : data) {\n hash ^= c;\n hash *= prime;\n }\n return static_cast\u003cuint32_t\u003e((hash \u003e\u003e 32) ^ (hash \u0026 0xFFFFFFFF));\n","suffix":"}\n\nint main() {\n // Precomputed expected values for the custom hash\n uint32_t h1 = custom_hash(\"\");\n uint32_t h2 = custom_hash(\"a\");\n uint32_t h3 = custom_hash(\"hello\");\n // The empty string hash: fold of offset_basis\n // offset = 1099511628211 = 0x00000100_000001B3\n // fold: 0x00000100 ^ 0x000001B3 = 0x000000B3\n assert(h1 == 0x000000B3);\n // These should be deterministic and different from standard FNV-1a 32-bit\n assert(h2 != 0xe40c292c); // standard FNV-1a 32-bit of \"a\"\n assert(h2 == custom_hash(\"a\")); // deterministic\n assert(h3 == custom_hash(\"hello\")); // deterministic\n assert(h2 != h3); // different inputs give different hashes\n return 0;\n}\n","assertions":" // Verify specific computed values\n // For \"a\" (0x61): hash = offset ^ 0x61 = 1099511628211 ^ 97 = 1099511628178\n // hash *= prime ... let\u0027s just verify determinism and non-standard\n assert(custom_hash(\"a\") == custom_hash(\"a\"));\n assert(custom_hash(\"ab\") != custom_hash(\"ba\")); // order matters\n assert(custom_hash(\"\") == 0x000000B3);\n // Longer strings\n assert(custom_hash(\"test\") == custom_hash(\"test\"));\n assert(custom_hash(\"test\") != custom_hash(\"tset\"));\n // Standard FNV-1a 32-bit of \"\" is 2166136261 (0x811C9DC5) — ours differs\n assert(custom_hash(\"\") != 0x811C9DC5);\n","category":"pattern_matching"} {"id":"31","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// Parse Makefile-style variable definitions.\n// - \"VAR = value\" sets VAR to value (trimmed).\n// - \"VAR += more\" appends \" more\" to existing VAR (space-separated).\n// If VAR doesn\u0027t exist yet, \"+=\" acts like \"=\".\n// - Lines starting with # are comments (ignored).\n// - A line ending with backslash continues onto the next line;\n// the backslash is removed and the next line\u0027s leading spaces are trimmed,\n// then joined directly (no extra space).\n// - Blank lines are ignored.\nstatic std::string ltrim(const std::string\u0026 s) {\n size_t i = 0; while (i \u003c s.size() \u0026\u0026 s[i] == \u0027 \u0027) i++;\n return s.substr(i);\n}\nstatic std::string rtrim(const std::string\u0026 s) {\n size_t i = s.size(); while (i \u003e 0 \u0026\u0026 s[i-1] == \u0027 \u0027) i--;\n return s.substr(0, i);\n}\nstd::map\u003cstd::string, std::string\u003e parseMakefile(const std::string\u0026 text) {\n std::map\u003cstd::string, std::string\u003e vars;\n std::istringstream stream(text);\n std::string raw, pending;\n while (std::getline(stream, raw)) {\n if (!pending.empty()) raw = ltrim(raw);\n if (!raw.empty() \u0026\u0026 raw.back() == \u0027\\\\\u0027) { pending += raw.substr(0, raw.size()-1); continue; }\n pending += raw;\n std::string line = pending; pending.clear();\n if (line.empty() || line[0] == \u0027#\u0027) continue;\n","golden_completion":" size_t pa = line.find(\"+=\"), eq = line.find(\u0027=\u0027);\n if (eq == std::string::npos) continue;\n bool app = (pa != std::string::npos \u0026\u0026 pa \u003c eq);\n std::string key = rtrim(line.substr(0, app ? pa : eq));\n std::string val = ltrim(line.substr((app ? pa : eq) + (app ? 2 : 1)));\n if (app \u0026\u0026 vars.count(key)) vars[key] += \" \" + val;\n else vars[key] = val;\n }\n return vars;\n","suffix":"}\n\nint main() {\n std::string input =\n \"CC = gcc\\n\"\n \"FLAGS = -Wall\\n\"\n \"FLAGS += -O2\\n\"\n \"# this is a comment\\n\"\n \"PATH = /usr/\\\\\\n\"\n \" local/bin\\n\"\n \"FLAGS += -g\";\n auto m = parseMakefile(input);\n assert(m[\"CC\"] == \"gcc\");\n assert(m[\"FLAGS\"] == \"-Wall -O2 -g\");\n assert(m[\"PATH\"] == \"/usr/local/bin\");\n assert(m.size() == 3);\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e = parseMakefile(\"\");\n assert(e.empty());\n auto a = parseMakefile(\"X = 1\");\n assert(a[\"X\"] == \"1\");\n auto b = parseMakefile(\"A = hello\\nA += world\");\n assert(b[\"A\"] == \"hello world\");\n auto c = parseMakefile(\"# comment\\n\\nK = v\");\n assert(c.size() == 1 \u0026\u0026 c[\"K\"] == \"v\");\n auto d = parseMakefile(\"M = one\\\\\\n two\\\\\\n three\");\n assert(d[\"M\"] == \"onetwothree\");\n auto f = parseMakefile(\"NEW += first\");\n assert(f[\"NEW\"] == \"first\");\n","category":"pattern_matching"} {"id":"32","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// Parse shell .env format:\n// - Lines: optional \"export \" prefix, then KEY=VALUE\n// - Values may be unquoted, single-quoted, or double-quoted.\n// Single-quoted values are literal (no escape processing).\n// Double-quoted values process \\\\n as newline and \\\\\\\\ as backslash.\n// Unquoted values end at # (comment) or end of line, trimmed.\n// - Lines starting with # are comments (ignored).\n// - Blank lines are ignored.\nstd::map\u003cstd::string, std::string\u003e parseEnv(const std::string\u0026 text) {\n std::map\u003cstd::string, std::string\u003e env;\n std::istringstream stream(text);\n std::string line;\n while (std::getline(stream, line)) {\n size_t s = 0; while (s \u003c line.size() \u0026\u0026 line[s] == \u0027 \u0027) s++;\n std::string t = line.substr(s);\n if (t.empty() || t[0] == \u0027#\u0027) continue;\n if (t.substr(0, 7) == \"export \") t = t.substr(7);\n size_t eq = t.find(\u0027=\u0027); if (eq == std::string::npos) continue;\n std::string key = t.substr(0, eq), rest = t.substr(eq + 1);\n std::string val;\n","golden_completion":" const char SQ = \u0027\\\u0027\u0027;\n if (!rest.empty() \u0026\u0026 rest[0] == SQ) {\n size_t end = rest.find(SQ, 1);\n val = (end != std::string::npos) ? rest.substr(1, end - 1) : rest.substr(1);\n } else if (!rest.empty() \u0026\u0026 rest[0] == \u0027\"\u0027) {\n for (size_t i = 1; i \u003c rest.size() \u0026\u0026 rest[i] != \u0027\"\u0027; i++)\n if (rest[i] == \u0027\\\\\u0027 \u0026\u0026 i+1 \u003c rest.size()) { i++; val += (rest[i]==\u0027n\u0027 ? \u0027\\n\u0027 : rest[i]); } else val += rest[i];\n } else { size_t c = rest.find(\u0027#\u0027); val = rest.substr(0, c); while (!val.empty() \u0026\u0026 val.back()==\u0027 \u0027) val.pop_back(); }\n env[key] = val;\n }\n return env;\n","suffix":"}\n\nint main() {\n std::string input =\n \"# comment line\\n\"\n \"HOST=localhost\\n\"\n \"export PORT=8080\\n\"\n \"MSG=\\\"hello\\\\nworld\\\"\\n\"\n \"PATH=\u0027/usr/bin\u0027\\n\"\n \"NOTE=inline # comment\";\n auto m = parseEnv(input);\n assert(m[\"HOST\"] == \"localhost\");\n assert(m[\"PORT\"] == \"8080\");\n assert(m[\"MSG\"] == \"hello\\nworld\");\n assert(m[\"PATH\"] == \"/usr/bin\");\n assert(m[\"NOTE\"] == \"inline\");\n assert(m.size() == 5);\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e = parseEnv(\"\");\n assert(e.empty());\n auto a = parseEnv(\"A=1\");\n assert(a[\"A\"] == \"1\");\n auto b = parseEnv(\"export X=hello\");\n assert(b[\"X\"] == \"hello\");\n auto c = parseEnv(\"Q=\\\"tab\\\\there\\\"\");\n assert(c[\"Q\"] == \"tab\\there\");\n auto d = parseEnv(\"S=\u0027no\\\\escape\u0027\");\n assert(d[\"S\"] == \"no\\\\escape\");\n auto f = parseEnv(\"T=value # trailing\");\n assert(f[\"T\"] == \"value\");\n auto g = parseEnv(\"# only comment\\n\\nK=v\");\n assert(g.size() == 1 \u0026\u0026 g[\"K\"] == \"v\");\n","category":"pattern_matching"} {"id":"33","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\nstruct Route { std::string method, path, handler; };\n\n// Parse a route table:\n// - Each route: \"METHOD path -\u003e handler\" or just \"path -\u003e handler\" (default GET).\n// - METHOD is fully uppercase letters. If first word isn\u0027t all-uppercase, default GET.\n// - # comments and blank lines ignored.\n// - Backslash continuation: remove backslash, trim next line, join directly.\nstatic std::string ltrim33(const std::string\u0026 s) {\n size_t i = 0; while (i \u003c s.size() \u0026\u0026 s[i] == \u0027 \u0027) i++; return s.substr(i);\n}\nstd::vector\u003cRoute\u003e parseRoutes(const std::string\u0026 text) {\n std::vector\u003cRoute\u003e routes;\n std::istringstream stream(text);\n std::string raw, pending;\n while (std::getline(stream, raw)) {\n if (!pending.empty()) raw = ltrim33(raw);\n if (!raw.empty() \u0026\u0026 raw.back() == \u0027\\\\\u0027) { pending += raw.substr(0, raw.size()-1); continue; }\n pending += raw; std::string line = ltrim33(pending); pending.clear();\n if (line.empty() || line[0] == \u0027#\u0027) continue;\n size_t arrow = line.find(\"-\u003e\"); if (arrow == std::string::npos) continue;\n std::string left = line.substr(0, arrow);\n while (!left.empty() \u0026\u0026 left.back() == \u0027 \u0027) left.pop_back();\n std::string handler = ltrim33(line.substr(arrow + 2));\n","golden_completion":" std::string method = \"GET\", path = left;\n size_t sp = left.find(\u0027 \u0027);\n if (sp != std::string::npos) {\n bool allUp = true;\n for (size_t i = 0; i \u003c sp; i++) if (left[i] \u003c \u0027A\u0027 || left[i] \u003e \u0027Z\u0027) { allUp = false; break; }\n if (allUp) { method = left.substr(0, sp); path = ltrim33(left.substr(sp + 1)); }\n }\n routes.push_back({method, path, handler});\n }\n return routes;\n","suffix":"}\n\nint main() {\n std::string input =\n \"GET /api/users -\u003e handleUsers\\n\"\n \"POST /api/data -\u003e handleData\\n\"\n \"# comment\\n\"\n \"/health -\u003e health\\\\\\n\"\n \"Check\\n\"\n \"DELETE /api/item -\u003e removeItem\";\n auto r = parseRoutes(input);\n assert(r.size() == 4);\n assert(r[0].method == \"GET\" \u0026\u0026 r[0].path == \"/api/users\" \u0026\u0026 r[0].handler == \"handleUsers\");\n assert(r[1].method == \"POST\" \u0026\u0026 r[1].path == \"/api/data\" \u0026\u0026 r[1].handler == \"handleData\");\n assert(r[2].method == \"GET\" \u0026\u0026 r[2].path == \"/health\" \u0026\u0026 r[2].handler == \"healthCheck\");\n assert(r[3].method == \"DELETE\" \u0026\u0026 r[3].path == \"/api/item\" \u0026\u0026 r[3].handler == \"removeItem\");\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e = parseRoutes(\"\");\n assert(e.empty());\n auto a = parseRoutes(\"/path -\u003e h\");\n assert(a.size() == 1 \u0026\u0026 a[0].method == \"GET\" \u0026\u0026 a[0].path == \"/path\" \u0026\u0026 a[0].handler == \"h\");\n auto b = parseRoutes(\"PUT /x -\u003e y\\nGET /z -\u003e w\");\n assert(b.size() == 2 \u0026\u0026 b[0].method == \"PUT\" \u0026\u0026 b[1].method == \"GET\");\n auto c = parseRoutes(\"# only comment\");\n assert(c.empty());\n auto d = parseRoutes(\"/long -\u003e ha\\\\\\n ndler\\\\\\n Name\");\n assert(d[0].handler == \"handlerName\");\n","category":"pattern_matching"} {"id":"34","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003cvector\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// Parse YAML-like key-value text into a flat map with dotted keys.\n// - \"key: value\" where indent (2 spaces per level) determines nesting.\n// - \"key:\" with no value is a section header; children get \"section.\" prefix.\n// - # comments (after optional spaces) and blank lines ignored.\n// - Quoted values (\"...\") strip quotes; # inside quotes is NOT a comment.\n// - Unquoted values trimmed, # starts inline comment.\nstd::map\u003cstd::string, std::string\u003e parseYaml(const std::string\u0026 text) {\n std::map\u003cstd::string, std::string\u003e result;\n std::vector\u003cstd::string\u003e stack;\n std::istringstream stream(text);\n std::string line;\n while (std::getline(stream, line)) {\n size_t indent = 0; while (indent \u003c line.size() \u0026\u0026 line[indent] == \u0027 \u0027) indent++;\n std::string tr = line.substr(indent);\n if (tr.empty() || tr[0] == \u0027#\u0027) continue;\n int level = indent / 2;\n if ((int)stack.size() \u003e level) stack.resize(level);\n size_t colon = tr.find(\u0027:\u0027); if (colon == std::string::npos) continue;\n std::string key = tr.substr(0, colon);\n std::string rest = tr.substr(colon + 1);\n size_t rs = 0; while (rs \u003c rest.size() \u0026\u0026 rest[rs] == \u0027 \u0027) rs++; rest = rest.substr(rs);\n","golden_completion":" if (rest.empty()) { stack.push_back(key); continue; }\n std::string val;\n if (rest[0] == \u0027\"\u0027) { size_t end = rest.find(\u0027\"\u0027, 1); val = (end != std::string::npos) ? rest.substr(1, end-1) : rest.substr(1); }\n else { size_t c = rest.find(\u0027#\u0027); val = rest.substr(0, c); while (!val.empty() \u0026\u0026 val.back()==\u0027 \u0027) val.pop_back(); }\n std::string fk; for (auto\u0026 s : stack) fk += s + \".\"; fk += key;\n result[fk] = val;\n }\n return result;\n","suffix":"}\n\nint main() {\n std::string input =\n \"server:\\n\"\n \" host: localhost\\n\"\n \" port: 8080\\n\"\n \"# comment\\n\"\n \"database:\\n\"\n \" name: \\\"my # db\\\"\\n\"\n \" timeout: 30 # seconds\";\n auto m = parseYaml(input);\n assert(m[\"server.host\"] == \"localhost\");\n assert(m[\"server.port\"] == \"8080\");\n assert(m[\"database.name\"] == \"my # db\");\n assert(m[\"database.timeout\"] == \"30\");\n assert(m.size() == 4);\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e = parseYaml(\"\");\n assert(e.empty());\n auto a = parseYaml(\"key: value\");\n assert(a[\"key\"] == \"value\");\n auto b = parseYaml(\"top:\\n a: 1\\n b: 2\");\n assert(b[\"top.a\"] == \"1\" \u0026\u0026 b[\"top.b\"] == \"2\" \u0026\u0026 b.size() == 2);\n auto c = parseYaml(\"x:\\n y:\\n z: deep\");\n assert(c[\"x.y.z\"] == \"deep\" \u0026\u0026 c.size() == 1);\n auto d = parseYaml(\"a: \\\"has # hash\\\"\");\n assert(d[\"a\"] == \"has # hash\");\n auto f = parseYaml(\"a: val # comment\");\n assert(f[\"a\"] == \"val\");\n","category":"pattern_matching"} {"id":"35","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\nstruct LogEntry { std::string timestamp, level, message; };\n\n// Parse structured log text into entries.\n// - Log line: \"[TIMESTAMP] LEVEL: message\"\n// - Line starting with 4+ spaces is continuation: append to previous\n// entry\u0027s message with a newline character (trim leading spaces).\n// - # comments and blank lines are ignored (NOT continuations).\nstd::vector\u003cLogEntry\u003e parseLogs(const std::string\u0026 text) {\n std::vector\u003cLogEntry\u003e entries;\n std::istringstream stream(text);\n std::string line;\n while (std::getline(stream, line)) {\n if (line.empty() || line[0] == \u0027#\u0027) continue;\n","golden_completion":" if (line.size() \u003e= 4 \u0026\u0026 line[0]==\u0027 \u0027 \u0026\u0026 line[1]==\u0027 \u0027 \u0026\u0026 line[2]==\u0027 \u0027 \u0026\u0026 line[3]==\u0027 \u0027 \u0026\u0026 !entries.empty()) {\n size_t s = 0; while (s \u003c line.size() \u0026\u0026 line[s]==\u0027 \u0027) s++;\n entries.back().message += \"\\n\" + line.substr(s); continue;\n }\n if (line[0] != \u0027[\u0027) continue;\n size_t cb = line.find(\u0027]\u0027); if (cb == std::string::npos) continue;\n size_t ls = cb+1; while (ls \u003c line.size() \u0026\u0026 line[ls]==\u0027 \u0027) ls++;\n size_t col = line.find(\u0027:\u0027, ls); if (col == std::string::npos) continue;\n std::string msg = line.substr(col+1); size_t ms = 0; while (ms \u003c msg.size() \u0026\u0026 msg[ms]==\u0027 \u0027) ms++;\n entries.push_back({line.substr(1, cb-1), line.substr(ls, col-ls), msg.substr(ms)});\n }\n return entries;\n","suffix":"}\n\nint main() {\n std::string input =\n \"[2024-01-15 10:30:00] ERROR: Connection failed\\n\"\n \" host: db.server.com\\n\"\n \" port: 5432\\n\"\n \"# maintenance note\\n\"\n \"[2024-01-15 10:30:01] INFO: Retrying\\n\"\n \"\\n\"\n \"[2024-01-15 10:30:05] INFO: Connected\";\n auto logs = parseLogs(input);\n assert(logs.size() == 3);\n assert(logs[0].timestamp == \"2024-01-15 10:30:00\");\n assert(logs[0].level == \"ERROR\");\n assert(logs[0].message == \"Connection failed\\nhost: db.server.com\\nport: 5432\");\n assert(logs[1].level == \"INFO\" \u0026\u0026 logs[1].message == \"Retrying\");\n assert(logs[2].message == \"Connected\");\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e = parseLogs(\"\");\n assert(e.empty());\n auto a = parseLogs(\"[T] WARN: test\");\n assert(a.size() == 1 \u0026\u0026 a[0].timestamp == \"T\" \u0026\u0026 a[0].level == \"WARN\" \u0026\u0026 a[0].message == \"test\");\n auto b = parseLogs(\"[T] DEBUG: line1\\n line2\\n line3\");\n assert(b.size() == 1 \u0026\u0026 b[0].message == \"line1\\nline2\\nline3\");\n auto c = parseLogs(\"# comment only\");\n assert(c.empty());\n auto d = parseLogs(\"[T1] INFO: a\\n\\n[T2] INFO: b\");\n assert(d.size() == 2);\n assert(d[0].message == \"a\" \u0026\u0026 d[1].message == \"b\");\n","category":"pattern_matching"} {"id":"36","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\nstruct Node {\n int value = 0;\n bool is_leaf = true;\n std::vector\u003cNode\u003e children;\n Node(int v) : value(v), is_leaf(true) {}\n Node(std::vector\u003cNode\u003e c) : is_leaf(false), children(std::move(c)) {}\n};\n\n// deep_flatten: flatten a tree of Nodes into a vector of ints.\n// - depth=0: return top-level leaf values only (skip non-leaf children).\n// - depth=1: flatten one level; at the boundary, non-leaf nodes are SKIPPED.\n// - depth=-1: fully recursive flatten (all leaves at any depth).\nstd::vector\u003cint\u003e deepFlatten(const Node\u0026 root, int depth) {\n","golden_completion":" std::vector\u003cint\u003e result;\n if (root.is_leaf) { result.push_back(root.value); return result; }\n for (const auto\u0026 child : root.children) {\n if (child.is_leaf) { result.push_back(child.value); }\n else if (depth == -1) { auto sub = deepFlatten(child, -1); result.insert(result.end(), sub.begin(), sub.end()); }\n else if (depth \u003e 0) { auto sub = deepFlatten(child, depth - 1); result.insert(result.end(), sub.begin(), sub.end()); }\n }\n return result;\n","suffix":"}\n\nint main() {\n // Tree: [1, [2, [3, 4]], 5]\n Node tree({Node(1), Node({Node(2), Node({Node(3), Node(4)})}), Node(5)});\n\n auto r0 = deepFlatten(tree, 0);\n assert(r0 == std::vector\u003cint\u003e({1, 5})); // only top-level leaves\n\n auto r1 = deepFlatten(tree, 1);\n assert(r1 == std::vector\u003cint\u003e({1, 2, 5})); // one level: 2 is leaf of child, [3,4] skipped\n\n auto rf = deepFlatten(tree, -1);\n assert(rf == std::vector\u003cint\u003e({1, 2, 3, 4, 5})); // full flatten\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" Node leaf(42);\n assert(deepFlatten(leaf, 0) == std::vector\u003cint\u003e({42}));\n assert(deepFlatten(leaf, -1) == std::vector\u003cint\u003e({42}));\n\n Node shallow({Node(1), Node(2), Node(3)});\n assert(deepFlatten(shallow, 0) == std::vector\u003cint\u003e({1, 2, 3}));\n\n // [1, [2, [3]]]\n Node deep({Node(1), Node({Node(2), Node({Node(3)})})});\n assert(deepFlatten(deep, 0) == std::vector\u003cint\u003e({1}));\n assert(deepFlatten(deep, 1) == std::vector\u003cint\u003e({1, 2}));\n assert(deepFlatten(deep, 2) == std::vector\u003cint\u003e({1, 2, 3}));\n assert(deepFlatten(deep, -1) == std::vector\u003cint\u003e({1, 2, 3}));\n","category":"pattern_matching"} {"id":"37","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cutility\u003e\n\n// group_consecutive: Group consecutive equal elements together.\n// Like Python\u0027s itertools.groupby -- elements are grouped by ADJACENCY,\n// not by global uniqueness. The same key can appear in multiple groups.\n// Uses the provided comparator for equality.\n// Returns vector of pairs: (first_element_of_run, vector_of_elements).\ntemplate\u003ctypename T, typename Eq\u003e\nstd::vector\u003cstd::pair\u003cT, std::vector\u003cT\u003e\u003e\u003e groupConsecutive(\n const std::vector\u003cT\u003e\u0026 data, Eq eq) {\n","golden_completion":" std::vector\u003cstd::pair\u003cT, std::vector\u003cT\u003e\u003e\u003e groups;\n if (data.empty()) return groups;\n T key = data[0];\n std::vector\u003cT\u003e cur = {data[0]};\n for (size_t i = 1; i \u003c data.size(); i++) {\n if (eq(key, data[i])) { cur.push_back(data[i]); }\n else { groups.push_back({key, cur}); key = data[i]; cur = {data[i]}; }\n }\n groups.push_back({key, cur});\n return groups;\n","suffix":"}\n\nint main() {\n std::vector\u003cint\u003e v = {1, 1, 2, 2, 2, 1, 1, 3};\n auto g = groupConsecutive(v, [](int a, int b){ return a == b; });\n assert(g.size() == 4); // [1,1], [2,2,2], [1,1], [3] -- NOT 3 groups!\n assert(g[0].first == 1 \u0026\u0026 g[0].second.size() == 2);\n assert(g[1].first == 2 \u0026\u0026 g[1].second.size() == 3);\n assert(g[2].first == 1 \u0026\u0026 g[2].second.size() == 2);\n assert(g[3].first == 3 \u0026\u0026 g[3].second.size() == 1);\n\n // Group by same parity\n std::vector\u003cint\u003e v2 = {2, 4, 3, 5, 6};\n auto g2 = groupConsecutive(v2, [](int a, int b){ return a % 2 == b % 2; });\n assert(g2.size() == 3);\n assert(g2[0].second == std::vector\u003cint\u003e({2, 4}));\n assert(g2[1].second == std::vector\u003cint\u003e({3, 5}));\n assert(g2[2].second == std::vector\u003cint\u003e({6}));\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto empty = groupConsecutive(std::vector\u003cint\u003e{}, [](int a, int b){ return a == b; });\n assert(empty.empty());\n\n auto single = groupConsecutive(std::vector\u003cint\u003e{5}, [](int a, int b){ return a == b; });\n assert(single.size() == 1 \u0026\u0026 single[0].first == 5);\n\n std::vector\u003cint\u003e all_same = {7, 7, 7};\n auto gs = groupConsecutive(all_same, [](int a, int b){ return a == b; });\n assert(gs.size() == 1 \u0026\u0026 gs[0].second.size() == 3);\n\n std::vector\u003cint\u003e all_diff = {1, 2, 3, 4};\n auto gd = groupConsecutive(all_diff, [](int a, int b){ return a == b; });\n assert(gd.size() == 4);\n\n // Case-insensitive string grouping\n std::vector\u003cstd::string\u003e sv = {\"Hi\", \"HI\", \"ho\"};\n auto sg = groupConsecutive(sv, [](const std::string\u0026 a, const std::string\u0026 b){ return (a[0] | 32) == (b[0] | 32); });\n assert(sg.size() == 2);\n assert(sg[0].second.size() == 2);\n","category":"pattern_matching"} {"id":"38","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cutility\u003e\n\n// zip_extend: Zip two vectors together. When one is shorter,\n// extend it by repeating its LAST element (not a default/zero value).\n// If either vector is empty, return empty.\n// Returns vector of pairs with length == max(a.size(), b.size()).\ntemplate\u003ctypename T\u003e\nstd::vector\u003cstd::pair\u003cT, T\u003e\u003e zipExtend(\n const std::vector\u003cT\u003e\u0026 a, const std::vector\u003cT\u003e\u0026 b) {\n","golden_completion":" if (a.empty() || b.empty()) return {};\n std::vector\u003cstd::pair\u003cT, T\u003e\u003e result;\n size_t len = std::max(a.size(), b.size());\n for (size_t i = 0; i \u003c len; i++) {\n T va = (i \u003c a.size()) ? a[i] : a.back();\n T vb = (i \u003c b.size()) ? b[i] : b.back();\n result.push_back({va, vb});\n }\n return result;\n","suffix":"}\n\nint main() {\n auto r1 = zipExtend(std::vector\u003cint\u003e{1, 2, 3}, std::vector\u003cint\u003e{10, 20});\n assert(r1.size() == 3);\n assert(r1[0] == std::make_pair(1, 10));\n assert(r1[1] == std::make_pair(2, 20));\n assert(r1[2] == std::make_pair(3, 20)); // 20 repeated, NOT 0\n\n auto r2 = zipExtend(std::vector\u003cint\u003e{5}, std::vector\u003cint\u003e{1, 2, 3, 4});\n assert(r2.size() == 4);\n assert(r2[3] == std::make_pair(5, 4)); // 5 repeated\n\n auto r3 = zipExtend(std::vector\u003cint\u003e{}, std::vector\u003cint\u003e{1});\n assert(r3.empty()); // empty input -\u003e empty output\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e1 = zipExtend(std::vector\u003cint\u003e{1, 2}, std::vector\u003cint\u003e{3, 4});\n assert(e1.size() == 2 \u0026\u0026 e1[0] == std::make_pair(1, 3) \u0026\u0026 e1[1] == std::make_pair(2, 4));\n\n auto e2 = zipExtend(std::vector\u003cint\u003e{}, std::vector\u003cint\u003e{});\n assert(e2.empty());\n\n auto e3 = zipExtend(std::vector\u003cint\u003e{9}, std::vector\u003cint\u003e{1, 2, 3, 4, 5});\n assert(e3.size() == 5);\n for (int i = 0; i \u003c 5; i++) assert(e3[i].first == 9);\n assert(e3[4].second == 5);\n\n auto e4 = zipExtend(std::vector\u003cstd::string\u003e{\"a\", \"b\"}, std::vector\u003cstd::string\u003e{\"x\"});\n assert(e4.size() == 2 \u0026\u0026 e4[1].second == \"x\");\n","category":"pattern_matching"} {"id":"39","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cfunctional\u003e\n#include \u003cutility\u003e\n\n// uniqueSorted: Sort the input AND remove duplicates.\n// \"Duplicate\" defined by eq function. Sort order by less function.\n// When duplicates found, keep the FIRST occurrence from ORIGINAL order.\n// Returns sorted vector with no equivalent-duplicates.\ntemplate\u003ctypename T\u003e\nstd::vector\u003cT\u003e uniqueSorted(\n const std::vector\u003cT\u003e\u0026 data,\n std::function\u003cbool(const T\u0026, const T\u0026)\u003e less,\n std::function\u003cbool(const T\u0026, const T\u0026)\u003e eq) {\n","golden_completion":" std::vector\u003cstd::pair\u003cT, size_t\u003e\u003e indexed;\n for (size_t i = 0; i \u003c data.size(); i++) indexed.push_back({data[i], i});\n std::vector\u003cstd::pair\u003cT, size_t\u003e\u003e uniq;\n for (auto\u0026 p : indexed) { bool dup = false; for (auto\u0026 u : uniq) if (eq(p.first, u.first)) { dup = true; break; } if (!dup) uniq.push_back(p); }\n std::sort(uniq.begin(), uniq.end(), [\u0026](auto\u0026 a, auto\u0026 b) { return less(a.first, b.first) || (!less(b.first, a.first) \u0026\u0026 a.second \u003c b.second); });\n std::vector\u003cT\u003e res; for (auto\u0026 p : uniq) res.push_back(p.first);\n return res;\n","suffix":"}\n\nint main() {\n // Case-insensitive unique + case-insensitive sort\n std::vector\u003cstd::string\u003e v = {\"Banana\", \"apple\", \"APPLE\", \"cherry\", \"banana\"};\n auto r = uniqueSorted\u003cstd::string\u003e(v,\n [](const std::string\u0026 a, const std::string\u0026 b) {\n std::string la = a, lb = b;\n for (auto\u0026 c : la) c = tolower(c);\n for (auto\u0026 c : lb) c = tolower(c);\n return la \u003c lb;\n },\n [](const std::string\u0026 a, const std::string\u0026 b) {\n std::string la = a, lb = b;\n for (auto\u0026 c : la) c = tolower(c);\n for (auto\u0026 c : lb) c = tolower(c);\n return la == lb;\n });\n assert(r.size() == 3);\n assert(r[0] == \"apple\"); // first occurrence of apple-group\n assert(r[1] == \"Banana\"); // first occurrence of banana-group\n assert(r[2] == \"cherry\");\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e = uniqueSorted\u003cint\u003e(std::vector\u003cint\u003e{}, [](int a, int b){ return a \u003c b; }, [](int a, int b){ return a == b; });\n assert(e.empty());\n\n auto s = uniqueSorted\u003cint\u003e({3, 1, 2, 1, 3}, [](int a, int b){ return a \u003c b; }, [](int a, int b){ return a == b; });\n assert(s == std::vector\u003cint\u003e({1, 2, 3}));\n\n // Equivalence by modulo 3, sort by value\n auto m = uniqueSorted\u003cint\u003e({7, 4, 1, 3, 6, 2}, [](int a, int b){ return a \u003c b; }, [](int a, int b){ return a % 3 == b % 3; });\n // mod 0: {3,6} -\u003e keep 3(first); mod 1: {7,4,1} -\u003e keep 7(first); mod 2: {2} -\u003e keep 2\n assert(m.size() == 3);\n assert(m[0] == 2);\n assert(m[1] == 3);\n assert(m[2] == 7);\n","category":"pattern_matching"} {"id":"40","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003cdeque\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003calgorithm\u003e\n\n// slidingWindowMaxCircular: Maximum in each sliding window of size k,\n// treating data as CIRCULAR (wraps around after last element).\n// Result has exactly data.size() elements.\n// Window at position i: data[i], data[(i+1)%n], ..., data[(i+k-1)%n].\n// If k \u003e= n, every window sees all elements, so result is all global max.\n// k must be \u003e= 1. Empty data returns empty.\nstd::vector\u003cint\u003e slidingWindowMaxCircular(const std::vector\u003cint\u003e\u0026 data, int k) {\n","golden_completion":" int n = data.size(); if (n == 0) return {};\n if (k \u003e= n) { int mx = *std::max_element(data.begin(), data.end()); return std::vector\u003cint\u003e(n, mx); }\n std::vector\u003cint\u003e ext(2*n); for (int i = 0; i \u003c 2*n; i++) ext[i] = data[i%n];\n std::deque\u003cint\u003e dq; std::vector\u003cint\u003e result;\n for (int i = 0; i \u003c n+k-1; i++) {\n while (!dq.empty() \u0026\u0026 ext[dq.back()] \u003c= ext[i]) dq.pop_back();\n dq.push_back(i); if (dq.front() \u003c= i-k) dq.pop_front();\n if (i \u003e= k-1 \u0026\u0026 (int)result.size() \u003c n) result.push_back(ext[dq.front()]);\n }\n return result;\n","suffix":"}\n\nint main() {\n auto r = slidingWindowMaxCircular({1, 3, 2, 5, 4}, 3);\n assert(r == std::vector\u003cint\u003e({3, 5, 5, 5, 4}));\n\n auto r2 = slidingWindowMaxCircular({5, 1, 3}, 1);\n assert(r2 == std::vector\u003cint\u003e({5, 1, 3}));\n\n auto r3 = slidingWindowMaxCircular({2, 7, 1}, 3);\n assert(r3 == std::vector\u003cint\u003e({7, 7, 7}));\n\n auto r4 = slidingWindowMaxCircular({}, 2);\n assert(r4.empty());\n std::cout \u003c\u003c \"OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e = slidingWindowMaxCircular({10}, 1);\n assert(e == std::vector\u003cint\u003e({10}));\n\n auto f = slidingWindowMaxCircular({1, 2, 3, 4}, 2);\n assert(f == std::vector\u003cint\u003e({2, 3, 4, 4}));\n\n auto g = slidingWindowMaxCircular({5, 5, 5, 5}, 2);\n assert(g == std::vector\u003cint\u003e({5, 5, 5, 5}));\n\n auto h = slidingWindowMaxCircular({3, 1, 4, 1, 5}, 4);\n assert(h == std::vector\u003cint\u003e({4, 5, 5, 5, 5}));\n","category":"pattern_matching"} {"id":"41","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\nconst std::string STANDARD85 = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%\u0026()*+-;\u003c=\u003e?@^_`{|}~\";\nconst std::string REVERSED85 = std::string(STANDARD85.rbegin(), STANDARD85.rend());\n\nint leading_zero_count(const std::vector\u003cuint8_t\u003e\u0026 data) {\n int c = 0; for (auto b : data) { if (b) break; c++; } return c;\n}\n\n// Integer-style base85: treat bytes as big-endian integer, divmod by 85.\n// Leading zero bytes map to alphabet[0]. Default alphabet = REVERSED85.\nstd::string base85_encode(const std::vector\u003cuint8_t\u003e\u0026 data,\n const std::string\u0026 alphabet = {}) {\n const std::string\u0026 alpha = alphabet.empty() ? REVERSED85 : alphabet;\n","golden_completion":" std::vector\u003cint\u003e digits;\n for (auto byte : data) {\n int carry = byte;\n for (auto\u0026 d : digits) { int t = d*256+carry; d = t%85; carry = t/85; }\n while (carry \u003e 0) { digits.push_back(carry%85); carry /= 85; }\n }\n std::string body;\n for (int i = (int)digits.size()-1; i \u003e= 0; i--) body += alpha[digits[i]];\n return std::string(leading_zero_count(data), alpha[0]) + body;\n}\n","suffix":"\nint main() {\n assert(STANDARD85.size() == 85);\n assert(REVERSED85[0] == \u0027~\u0027);\n assert(leading_zero_count({0, 0, 97, 98, 99}) == 2);\n\n auto r1 = base85_encode({97, 98, 99}); // \"abc\"\n assert(r1 != \"AXTd\"); // NOT standard\n auto r2 = base85_encode({97, 98, 99}, STANDARD85);\n assert(r2 == \"AXTd\"); // Standard gives AXTd\n auto r3 = base85_encode({0, 97, 98, 99});\n assert(r3[0] == \u0027~\u0027 \u0026\u0026 r3.substr(1) == r1);\n assert(base85_encode({}).empty());\n\n std::cout \u003c\u003c \"Task 41 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto ha1s = base85_encode({97}, STANDARD85);\n assert(ha1s == \"1C\");\n auto ha1 = base85_encode({97});\n assert(ha1 == \"};\");\n assert(base85_encode({0}) == \"~\");\n assert(base85_encode({0, 0}) == \"~~\");\n auto ha4 = base85_encode({104,101,108,108,111}, STANDARD85);\n auto ha5 = base85_encode({104,101,108,108,111});\n assert(ha4 != ha5 \u0026\u0026 !ha4.empty() \u0026\u0026 !ha5.empty());\n","category":"pattern_matching"} {"id":"42","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccstdint\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\nconst std::string STANDARD36 = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst std::string REVERSED36 = std::string(STANDARD36.rbegin(), STANDARD36.rend());\n\nint leading_zero_count(const std::vector\u003cuint8_t\u003e\u0026 data) {\n int c = 0; for (auto b : data) { if (b) break; c++; } return c;\n}\n\n// Integer-style base36: treat bytes as big-endian integer, divmod by 36.\n// Leading zero bytes -\u003e alphabet[0]. Default alphabet = REVERSED36.\nstd::string base36_encode(const std::vector\u003cuint8_t\u003e\u0026 data,\n const std::string\u0026 alphabet = {}) {\n const std::string\u0026 alpha = alphabet.empty() ? REVERSED36 : alphabet;\n","golden_completion":" std::vector\u003cint\u003e digits;\n for (auto byte : data) {\n int carry = byte;\n for (auto\u0026 d : digits) { int t = d*256+carry; d = t%36; carry = t/36; }\n while (carry \u003e 0) { digits.push_back(carry%36); carry /= 36; }\n }\n std::string body;\n for (int i = (int)digits.size()-1; i \u003e= 0; i--) body += alpha[digits[i]];\n return std::string(leading_zero_count(data), alpha[0]) + body;\n}\n","suffix":"\nint main() {\n assert(STANDARD36.size() == 36);\n assert(REVERSED36[0] == \u0027Z\u0027);\n assert(leading_zero_count({0, 0, 97}) == 2);\n\n auto s1 = base36_encode({97, 98, 99}, STANDARD36);\n assert(s1 == \"3SSIR\");\n auto r1 = base36_encode({97, 98, 99});\n assert(r1 != \"3SSIR\");\n auto r2 = base36_encode({0, 97, 98, 99});\n assert(r2[0] == \u0027Z\u0027);\n assert(base36_encode({}).empty());\n\n std::cout \u003c\u003c \"Task 42 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto ha1 = base36_encode({97}, STANDARD36);\n assert(ha1 == \"2P\");\n auto ha2 = base36_encode({97});\n assert(ha2 == \"XA\");\n assert(base36_encode({0}) == \"Z\");\n assert(base36_encode({0}, STANDARD36) == \"0\");\n assert(base36_encode({0, 0}) == \"ZZ\");\n auto ha5 = base36_encode({104,101,108,108,111}, STANDARD36);\n auto ha6 = base36_encode({104,101,108,108,111});\n assert(ha5 != ha6 \u0026\u0026 !ha5.empty() \u0026\u0026 !ha6.empty());\n","category":"pattern_matching"} {"id":"43","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// Properties file parser (Java-style):\n// key = value, key : value, or key\u003cwhitespace\u003evalue\n// \u0027#\u0027 and \u0027!\u0027 at line start are comments\n// Backslash at end continues to next (leading whitespace trimmed)\n// Escapes in value: \\n \\t \\\\ \\uXXXX\n\nstd::string trim(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n return s.substr(a, s.find_last_not_of(\" \\t\\r\") - a + 1);\n}\n\nstd::string unescape_value(const std::string\u0026 val) {\n std::string r;\n for (size_t i = 0; i \u003c val.size(); i++) {\n if (val[i] == \u0027\\\\\u0027 \u0026\u0026 i+1 \u003c val.size()) {\n char c = val[++i];\n if (c == \u0027n\u0027) r += \u0027\\n\u0027; else if (c == \u0027t\u0027) r += \u0027\\t\u0027;\n else if (c == \u0027\\\\\u0027) r += \u0027\\\\\u0027;\n else if (c == \u0027u\u0027 \u0026\u0026 i+4 \u003c val.size()) {\n r += (char)std::stoi(val.substr(i+1, 4), nullptr, 16); i += 4;\n } else r += c;\n } else r += val[i];\n }\n return r;\n}\n\n// Find key-end position: first unescaped =, :, or whitespace\nsize_t find_key_end(const std::string\u0026 ln) {\n for (size_t i = 0; i \u003c ln.size(); i++) {\n if (ln[i]==\u0027\\\\\u0027) { i++; continue; }\n if (ln[i]==\u0027=\u0027||ln[i]==\u0027:\u0027||ln[i]==\u0027 \u0027||ln[i]==\u0027\\t\u0027) return i;\n }\n return std::string::npos;\n}\n\n// Extract value after the separator\nstd::string extract_value(const std::string\u0026 ln, size_t ke) {\n size_t vs = ln.find_first_not_of(\" \\t\", ke);\n if (vs != std::string::npos \u0026\u0026 (ln[vs]==\u0027=\u0027||ln[vs]==\u0027:\u0027)) vs++;\n if (vs != std::string::npos) vs = ln.find_first_not_of(\" \\t\", vs);\n return ln.substr(vs == std::string::npos ? ln.size() : vs);\n}\n\nstd::map\u003cstd::string, std::string\u003e parse_properties(const std::string\u0026 text) {\n std::map\u003cstd::string, std::string\u003e result;\n std::istringstream iss(text);\n std::string raw;\n","golden_completion":" while (std::getline(iss, raw)) {\n while (!raw.empty()\u0026\u0026raw.back()==\u0027\\\\\u0027) { raw.pop_back(); std::string nx;\n if (!std::getline(iss,nx)) break;\n size_t p=nx.find_first_not_of(\" \\t\"); raw+=(p==std::string::npos?\"\":nx.substr(p)); }\n std::string ln = trim(raw);\n if (ln.empty()||ln[0]==\u0027#\u0027||ln[0]==\u0027!\u0027) continue;\n size_t ke = find_key_end(ln);\n std::string key = (ke==std::string::npos)?ln:ln.substr(0,ke);\n result[key] = unescape_value(ke==std::string::npos ? \"\" : extract_value(ln,ke));\n } return result;\n}\n","suffix":"\nint main() {\n std::string cfg =\n \"name = Alice\\n\"\n \"path = /usr/\\\\\\n\"\n \" local/bin\\n\"\n \"# this is a comment\\n\"\n \"! another comment\\n\"\n \"greeting = Hello\\\\nWorld\\n\"\n \"tab = col1\\\\tcol2\\n\"\n \"unicode = \\\\u0041\\\\u0042\\n\";\n\n auto m = parse_properties(cfg);\n assert(m[\"name\"] == \"Alice\");\n assert(m[\"path\"] == \"/usr/local/bin\");\n assert(m.find(\"# this is a comment\") == m.end());\n assert(m[\"greeting\"] == \"Hello\\nWorld\");\n assert(m[\"tab\"] == \"col1\\tcol2\");\n assert(m[\"unicode\"] == \"AB\");\n\n std::cout \u003c\u003c \"Task 43 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" assert(parse_properties(\"\").empty());\n auto a1 = parse_properties(\"host : localhost\");\n assert(a1[\"host\"] == \"localhost\");\n auto a2 = parse_properties(\"color blue\");\n assert(a2[\"color\"] == \"blue\");\n auto a3 = parse_properties(\"dir = C\\\\\\\\Users\\\\\\\\test\");\n assert(a3[\"dir\"] == \"C\\\\Users\\\\test\");\n auto a4 = parse_properties(\"msg = hello \\\\\\n world \\\\\\n end\");\n assert(a4[\"msg\"] == \"hello world end\");\n auto a5 = parse_properties(\"empty =\");\n assert(a5.count(\"empty\") == 1 \u0026\u0026 a5[\"empty\"] == \"\");\n","category":"pattern_matching"} {"id":"44","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// Dockerfile ENV parser:\n// ENV key=value key2=value2 ... (multi-key, quoted values ok)\n// ENV key value (single-key, rest is value)\n// Backslash continuation, # comments, non-ENV ignored.\n\nstd::string strip(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n return s.substr(a, s.find_last_not_of(\" \\t\\r\") - a + 1);\n}\n\nbool has_eq_outside_quotes(const std::string\u0026 s) {\n for (size_t i = 0; i \u003c s.size(); i++) {\n if (s[i]==\u0027\"\u0027) { while (++i\u003cs.size()\u0026\u0026s[i]!=\u0027\"\u0027); continue; }\n if (s[i]==\u0027=\u0027) return true;\n }\n return false;\n}\n\nvoid parse_multi_kv(const std::string\u0026 rest, std::map\u003cstd::string,std::string\u003e\u0026 result) {\n size_t i = 0;\n while (i \u003c rest.size()) {\n while (i\u003crest.size()\u0026\u0026(rest[i]==\u0027 \u0027||rest[i]==\u0027\\t\u0027)) i++;\n size_t ke = rest.find(\u0027=\u0027, i); if (ke==std::string::npos) break;\n std::string key=rest.substr(i,ke-i); i=ke+1; std::string val;\n if (i\u003crest.size()\u0026\u0026rest[i]==\u0027\"\u0027) {\n i++; while (i\u003crest.size()\u0026\u0026rest[i]!=\u0027\"\u0027) val+=rest[i++]; if (i\u003crest.size()) i++;\n } else { while (i\u003crest.size()\u0026\u0026rest[i]!=\u0027 \u0027\u0026\u0026rest[i]!=\u0027\\t\u0027) val+=rest[i++]; }\n result[key] = val;\n }\n}\n\nstd::map\u003cstd::string, std::string\u003e parse_dockerfile_env(const std::string\u0026 text) {\n std::map\u003cstd::string, std::string\u003e result;\n std::istringstream iss(text); std::string raw;\n","golden_completion":" while (std::getline(iss, raw)) {\n while (!raw.empty()\u0026\u0026raw.back()==\u0027\\\\\u0027) { raw.pop_back(); std::string nx;\n if (!std::getline(iss,nx)) break; raw+=strip(nx); }\n std::string line = strip(raw);\n if (line.empty()||line[0]==\u0027#\u0027||line.size()\u003c5||line.substr(0,4)!=\"ENV \") continue;\n std::string rest = strip(line.substr(4));\n if (has_eq_outside_quotes(rest)) parse_multi_kv(rest, result);\n else { size_t sp=rest.find_first_of(\" \\t\");\n if (sp==std::string::npos) result[rest]=\"\"; else result[rest.substr(0,sp)]=strip(rest.substr(sp)); }\n } return result;\n}\n","suffix":"\nint main() {\n std::string dockerfile =\n \"FROM ubuntu:20.04\\n\"\n \"# Set environment\\n\"\n \"ENV APP_NAME=myapp \\\\\\n\"\n \" APP_PORT=8080\\n\"\n \"ENV GREETING Hello World\\n\"\n \"RUN echo done\\n\"\n \"ENV DB_HOST=\\\"localhost\\\" DB_PORT=5432\\n\";\n\n auto env = parse_dockerfile_env(dockerfile);\n assert(env[\"APP_NAME\"] == \"myapp\");\n assert(env[\"APP_PORT\"] == \"8080\");\n assert(env[\"GREETING\"] == \"Hello World\");\n assert(env[\"DB_HOST\"] == \"localhost\");\n assert(env[\"DB_PORT\"] == \"5432\");\n assert(env.find(\"FROM\") == env.end());\n\n std::cout \u003c\u003c \"Task 44 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" assert(parse_dockerfile_env(\"\").empty());\n assert(parse_dockerfile_env(\"# nothing\\n# here\").empty());\n auto a1 = parse_dockerfile_env(\"ENV EMPTY\");\n assert(a1.count(\"EMPTY\") \u0026\u0026 a1[\"EMPTY\"] == \"\");\n auto a2 = parse_dockerfile_env(\"ENV MSG=\\\"hello world\\\" COUNT=3\");\n assert(a2[\"MSG\"] == \"hello world\" \u0026\u0026 a2[\"COUNT\"] == \"3\");\n auto a3 = parse_dockerfile_env(\"ENV A=1 \\\\\\nB=2 \\\\\\nC=3\");\n assert(a3[\"A\"]==\"1\" \u0026\u0026 a3[\"B\"]==\"2\" \u0026\u0026 a3[\"C\"]==\"3\");\n auto a4 = parse_dockerfile_env(\"RUN echo hi\\nCOPY . .\\nENV X=42\");\n assert(a4.size() == 1 \u0026\u0026 a4[\"X\"] == \"42\");\n","category":"pattern_matching"} {"id":"45","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// SSH config parser (~/.ssh/config style):\n// \"Host \u003cpattern\u003e\" starts a new host block\n// Following \"Key value\" lines belong to that block\n// Lines before any Host belong to \"*\" (default)\n// \u0027#\u0027 lines are comments, blank lines ignored\n// Keys are case-insensitive (stored lowercase)\n// Returns: map\u003chost_pattern, map\u003ckey, value\u003e\u003e\n\nstd::string to_lower(const std::string\u0026 s) {\n std::string r = s; for (auto\u0026 c : r) c = (c\u003e=\u0027A\u0027\u0026\u0026c\u003c=\u0027Z\u0027) ? c+32 : c; return r;\n}\nstd::string trim_ws(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n return s.substr(a, s.find_last_not_of(\" \\t\\r\") - a + 1);\n}\n\nstd::map\u003cstd::string, std::map\u003cstd::string, std::string\u003e\u003e\nparse_ssh_config(const std::string\u0026 text) {\n","golden_completion":" std::map\u003cstd::string, std::map\u003cstd::string, std::string\u003e\u003e result;\n std::string cur=\"*\", raw; std::istringstream iss(text);\n while (std::getline(iss, raw)) {\n std::string ln = trim_ws(raw);\n if (ln.empty()||ln[0]==\u0027#\u0027) continue;\n size_t sp = ln.find_first_of(\" \\t\"); if (sp==std::string::npos) continue;\n std::string key=to_lower(ln.substr(0,sp)), val=trim_ws(ln.substr(sp));\n if (key==\"host\") { cur=val; result[cur]; } else result[cur][key]=val;\n } return result;\n}\n","suffix":"\nint main() {\n std::string cfg =\n \"# Global defaults\\n\"\n \"ServerAliveInterval 60\\n\"\n \"\\n\"\n \"Host dev-server\\n\"\n \" HostName 192.168.1.100\\n\"\n \" User admin\\n\"\n \" Port 2222\\n\"\n \"\\n\"\n \"Host prod-*\\n\"\n \" HostName prod.example.com\\n\"\n \" User deploy\\n\"\n \" IdentityFile ~/.ssh/prod_key\\n\";\n\n auto cfg_map = parse_ssh_config(cfg);\n assert(cfg_map[\"*\"][\"serveraliveinterval\"] == \"60\");\n assert(cfg_map[\"dev-server\"][\"hostname\"] == \"192.168.1.100\");\n assert(cfg_map[\"dev-server\"][\"user\"] == \"admin\");\n assert(cfg_map[\"dev-server\"][\"port\"] == \"2222\");\n assert(cfg_map[\"prod-*\"][\"hostname\"] == \"prod.example.com\");\n assert(cfg_map[\"prod-*\"][\"user\"] == \"deploy\");\n assert(cfg_map[\"prod-*\"][\"identityfile\"] == \"~/.ssh/prod_key\");\n\n std::cout \u003c\u003c \"Task 45 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" assert(parse_ssh_config(\"\").empty());\n auto a1 = parse_ssh_config(\"Compression yes\\nTCPKeepAlive no\");\n assert(a1[\"*\"][\"compression\"] == \"yes\" \u0026\u0026 a1[\"*\"][\"tcpkeepalive\"] == \"no\");\n auto a2 = parse_ssh_config(\"Host alpha\\n User a\\nHost beta\\n User b\");\n assert(a2[\"alpha\"][\"user\"]==\"a\" \u0026\u0026 a2[\"beta\"][\"user\"]==\"b\");\n assert(a2.find(\"*\") == a2.end());\n assert(parse_ssh_config(\"# just a comment\\n# another\").empty());\n auto a3 = parse_ssh_config(\"Host empty-host\\n# no opts\\nHost other\\n User x\");\n assert(a3.count(\"empty-host\") \u0026\u0026 a3[\"empty-host\"].empty());\n assert(a3[\"other\"][\"user\"] == \"x\");\n","category":"pattern_matching"} {"id":"46","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003cvector\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// C preprocessor #define parser:\n// \"#define NAME value\" and \"#define NAME(params) value\"\n// Backslash at end continues to next line (joined with space).\n// // comments and blank lines ignored. #undef removes a macro.\n\nstruct MacroDef {\n std::vector\u003cstd::string\u003e params; // empty = object-like\n std::string body;\n};\n\nstd::string strip_str(const std::string\u0026 s) {\n size_t a = s.find_first_not_of(\" \\t\\r\");\n if (a == std::string::npos) return \"\";\n return s.substr(a, s.find_last_not_of(\" \\t\\r\") - a + 1);\n}\n\nstd::vector\u003cstd::string\u003e split_params(const std::string\u0026 s) {\n std::vector\u003cstd::string\u003e r; std::istringstream ss(s); std::string p;\n while (std::getline(ss, p, \u0027,\u0027)) r.push_back(strip_str(p));\n return r;\n}\n\n// Parse a single #define line (after \"#define \" prefix removed).\n// Returns {name, MacroDef} pair.\nstd::pair\u003cstd::string, MacroDef\u003e parse_one_define(const std::string\u0026 rest) {\n MacroDef md; std::string name; size_t bs;\n size_t pa = rest.find(\u0027(\u0027), sp = rest.find(\u0027 \u0027);\n if (pa != std::string::npos \u0026\u0026 (sp == std::string::npos || pa \u003c sp)) {\n name = rest.substr(0, pa); size_t cp = rest.find(\u0027)\u0027, pa);\n md.params = split_params(rest.substr(pa+1, cp-pa-1)); bs = cp+1;\n } else {\n size_t s = rest.find_first_of(\" \\t\");\n name = (s==std::string::npos) ? rest : rest.substr(0,s);\n bs = (s==std::string::npos) ? rest.size() : s;\n }\n md.body = strip_str(rest.substr(bs));\n return {name, md};\n}\n\nstd::map\u003cstd::string, MacroDef\u003e parse_defines(const std::string\u0026 text) {\n std::map\u003cstd::string, MacroDef\u003e result;\n std::istringstream iss(text); std::string raw;\n","golden_completion":" while (std::getline(iss, raw)) {\n while (!raw.empty()\u0026\u0026raw.back()==\u0027\\\\\u0027) { raw.pop_back(); std::string nx;\n if (!std::getline(iss,nx)) break; raw+=\" \"+strip_str(nx); }\n std::string line = strip_str(raw);\n if (line.empty()||line.substr(0,2)==\"//\") continue;\n if (line.size()\u003e=8\u0026\u0026line.substr(0,8)==\"#define \") {\n auto [n,md]=parse_one_define(strip_str(line.substr(8))); result[n]=md;\n } else if (line.size()\u003e=7\u0026\u0026line.substr(0,7)==\"#undef \") result.erase(strip_str(line.substr(7)));\n } return result;\n}\n","suffix":"\nint main() {\n std::string src =\n \"#define VERSION 42\\n\"\n \"#define MAX(a,b) ((a) \u003e (b) ? (a) : (b))\\n\"\n \"// comment\\n\"\n \"#define LONG_MACRO \\\\\\n\"\n \" do { \\\\\\n\"\n \" x++; } while(0)\\n\"\n \"#define TEMP 99\\n\"\n \"#undef TEMP\\n\";\n\n auto macros = parse_defines(src);\n assert(macros[\"VERSION\"].body == \"42\");\n assert(macros[\"VERSION\"].params.empty());\n assert(macros[\"MAX\"].params.size() == 2);\n assert(macros[\"MAX\"].params[0] == \"a\" \u0026\u0026 macros[\"MAX\"].params[1] == \"b\");\n assert(macros[\"MAX\"].body == \"((a) \u003e (b) ? (a) : (b))\");\n assert(macros[\"LONG_MACRO\"].body.find(\"do {\") == 0);\n assert(macros[\"LONG_MACRO\"].body.find(\"while(0)\") != std::string::npos);\n assert(macros.find(\"TEMP\") == macros.end());\n\n std::cout \u003c\u003c \"Task 46 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" assert(parse_defines(\"\").empty());\n auto a1 = parse_defines(\"#define GUARD\");\n assert(a1.count(\"GUARD\") \u0026\u0026 a1[\"GUARD\"].body == \"\" \u0026\u0026 a1[\"GUARD\"].params.empty());\n auto a2 = parse_defines(\"#define CLAMP(x, lo, hi) ((x)\u003c(lo)?(lo):((x)\u003e(hi)?(hi):(x)))\");\n assert(a2[\"CLAMP\"].params.size() == 3);\n assert(a2[\"CLAMP\"].params[0] == \"x\" \u0026\u0026 a2[\"CLAMP\"].params[2] == \"hi\");\n auto a3 = parse_defines(\"#define X 1\\n#undef X\\n#define X 2\");\n assert(a3[\"X\"].body == \"2\");\n auto a4 = parse_defines(\"#define M \\\\\\na \\\\\\nb \\\\\\nc\");\n assert(a4[\"M\"].body.find(\"a\") != std::string::npos);\n assert(a4[\"M\"].body.find(\"c\") != std::string::npos);\n","category":"pattern_matching"} {"id":"47","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cmap\u003e\n#include \u003cvariant\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cvector\u003e\n\nstruct Value;\nusing Dict = std::map\u003cstd::string, Value\u003e;\nusing Array = std::vector\u003cValue\u003e;\nstruct Value {\n std::variant\u003cstd::string, int, double, bool, Dict, Array\u003e data;\n bool is_dict() const { return std::holds_alternative\u003cDict\u003e(data); }\n Dict\u0026 as_dict() { return std::get\u003cDict\u003e(data); }\n const Dict\u0026 as_dict() const { return std::get\u003cDict\u003e(data); }\n const std::string\u0026 as_string() const { return std::get\u003cstd::string\u003e(data); }\n int as_int() const { return std::get\u003cint\u003e(data); }\n};\n\nValue make_str(const std::string\u0026 s) { return Value{s}; }\nValue make_int(int i) { return Value{i}; }\nValue make_dict(Dict d) { return Value{std::move(d)}; }\n\n// deep_merge: recursively merge two Dicts.\n// IMPORTANT: when both have same key with non-dict values,\n// the FIRST dict\u0027s value wins (not second, unlike standard merge).\n// When both are dicts, recurse (first-wins at each level).\n\n","golden_completion":"Value deep_merge(const Value\u0026 first, const Value\u0026 second) {\n if (!first.is_dict() || !second.is_dict()) return first;\n Dict result = first.as_dict();\n for (const auto\u0026 [key, val] : second.as_dict()) {\n auto it = result.find(key);\n if (it == result.end()) result[key] = val;\n else if (it-\u003esecond.is_dict() \u0026\u0026 val.is_dict())\n it-\u003esecond = deep_merge(it-\u003esecond, val);\n // else: first wins, do nothing\n }\n return make_dict(std::move(result));\n}\n","suffix":"\nint main() {\n Dict a = {{\"name\", make_str(\"Alice\")}, {\"age\", make_int(30)},\n {\"addr\", make_dict({{\"city\", make_str(\"NYC\")}, {\"zip\", make_str(\"10001\")}})}};\n Dict b = {{\"name\", make_str(\"Bob\")}, {\"score\", make_int(95)},\n {\"addr\", make_dict({{\"city\", make_str(\"LA\")}, {\"state\", make_str(\"CA\")}})}};\n\n auto merged = deep_merge(make_dict(a), make_dict(b));\n auto\u0026 md = merged.as_dict();\n\n assert(md[\"name\"].as_string() == \"Alice\");\n assert(md[\"name\"].as_string() != \"Bob\");\n assert(md[\"age\"].as_int() == 30);\n assert(md[\"score\"].as_int() == 95);\n assert(md[\"addr\"].as_dict()[\"city\"].as_string() == \"NYC\");\n assert(md[\"addr\"].as_dict()[\"state\"].as_string() == \"CA\");\n assert(md[\"addr\"].as_dict()[\"zip\"].as_string() == \"10001\");\n\n std::cout \u003c\u003c \"Task 47 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto e1 = deep_merge(make_dict({}), make_dict({}));\n assert(e1.as_dict().empty());\n Dict s1 = {{\"x\", make_int(1)}};\n auto e2 = deep_merge(make_dict({}), make_dict(s1));\n assert(e2.as_dict()[\"x\"].as_int() == 1);\n auto e3 = deep_merge(make_dict(s1), make_dict({}));\n assert(e3.as_dict()[\"x\"].as_int() == 1);\n Dict d1 = {{\"a\", make_dict({{\"b\", make_dict({{\"c\", make_int(1)}})}})}};\n Dict d2 = {{\"a\", make_dict({{\"b\", make_dict({{\"c\", make_int(2)}, {\"d\", make_int(3)}})}})}};\n auto e4 = deep_merge(make_dict(d1), make_dict(d2));\n assert(e4.as_dict()[\"a\"].as_dict()[\"b\"].as_dict()[\"c\"].as_int() == 1);\n assert(e4.as_dict()[\"a\"].as_dict()[\"b\"].as_dict()[\"d\"].as_int() == 3);\n","category":"pattern_matching"} {"id":"48","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003cmap\u003e\n#include \u003cset\u003e\n#include \u003calgorithm\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n\n// Topological sort with REVERSE alphabetical tie-breaking.\n// When multiple nodes have zero in-degree, pick the one that is\n// LAST in alphabetical order (\u0027z\u0027 before \u0027a\u0027).\n// Graph: key depends on values (e.g. {\"A\": [\"B\",\"C\"]} = A depends on B,C)\n\nstruct TopoGraph {\n std::map\u003cstd::string, int\u003e in_deg;\n std::map\u003cstd::string, std::vector\u003cstd::string\u003e\u003e adj;\n TopoGraph(const std::map\u003cstd::string, std::vector\u003cstd::string\u003e\u003e\u0026 deps) {\n for (const auto\u0026 [node, ds] : deps) {\n if (!in_deg.count(node)) in_deg[node] = 0;\n for (const auto\u0026 d : ds) { adj[d].push_back(node); in_deg[node]++; if (!in_deg.count(d)) in_deg[d] = 0; }\n }\n }\n};\n\nstd::vector\u003cstd::string\u003e topological_sort(\n const std::map\u003cstd::string, std::vector\u003cstd::string\u003e\u003e\u0026 deps) {\n TopoGraph g(deps);\n","golden_completion":" std::set\u003cstd::string, std::greater\u003c\u003e\u003e ready;\n for (auto\u0026 [n, deg] : g.in_deg) if (deg == 0) ready.insert(n);\n std::vector\u003cstd::string\u003e result;\n while (!ready.empty()) {\n auto it = ready.begin(); std::string node = *it; ready.erase(it);\n result.push_back(node);\n for (auto\u0026 nx : g.adj[node]) if (--g.in_deg[nx] == 0) ready.insert(nx);\n }\n return result;\n}\n","suffix":"\nint main() {\n std::map\u003cstd::string, std::vector\u003cstd::string\u003e\u003e graph = {\n {\"D\", {}}, {\"B\", {\"D\"}}, {\"C\", {\"D\"}}, {\"A\", {\"B\", \"C\"}}\n };\n auto order = topological_sort(graph);\n assert(order[0] == \"D\");\n // After D: B and C both ready. Reverse alpha -\u003e C before B\n assert(order[1] == \"C\");\n assert(order[2] == \"B\");\n assert(order[3] == \"A\");\n assert(order[1] != \"B\"); // Standard would give B before C\n\n std::cout \u003c\u003c \"Task 48 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" auto s1 = topological_sort({{\"X\", {}}});\n assert(s1.size() == 1 \u0026\u0026 s1[0] == \"X\");\n auto s2 = topological_sort({{\"a\", {\"b\"}}, {\"b\", {\"c\"}}, {\"c\", {}}});\n assert(s2 == (std::vector\u003cstd::string\u003e{\"c\", \"b\", \"a\"}));\n auto s3 = topological_sort({{\"a\", {}}, {\"b\", {}}, {\"c\", {}}});\n assert(s3[0] == \"c\" \u0026\u0026 s3[1] == \"b\" \u0026\u0026 s3[2] == \"a\");\n auto s4 = topological_sort({{\"e\", {\"c\",\"d\"}}, {\"c\", {\"a\"}}, {\"d\", {\"b\"}}, {\"a\", {}}, {\"b\", {}}});\n assert(s4[0] == \"b\");\n assert(s4[1] == \"d\");\n assert(s4[2] == \"a\");\n assert(s4[3] == \"c\");\n assert(s4[4] == \"e\");\n","category":"pattern_matching"} {"id":"49","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003ccmath\u003e\n\n// European-style number formatter:\n// Thousands separator: \u0027.\u0027 (dot), Decimal separator: \u0027,\u0027 (comma)\n// OPPOSITE of US-style. Example: 1234567.89 -\u003e \"1.234.567,89\"\n\nstd::string format_integer_part(long long n) {\n if (n == 0) return \"0\";\n std::string s; bool neg = (n \u003c 0); if (neg) n = -n;\n int count = 0;\n while (n \u003e 0) {\n if (count \u003e 0 \u0026\u0026 count % 3 == 0) s = \u0027.\u0027 + s;\n s = char(\u00270\u0027 + n % 10) + s; n /= 10; count++;\n }\n return neg ? (\"-\" + s) : s;\n}\n\n","golden_completion":"std::string format_number(double value, int dp = 2) {\n bool neg = value \u003c 0; double fac = std::pow(10.0, dp);\n long long rd = (long long)std::round(std::abs(value) * fac);\n long long ip = rd/(long long)fac, fp = rd%(long long)fac;\n std::string r = format_integer_part(ip);\n if (dp \u003e 0) {\n std::string fs = std::to_string(fp);\n while ((int)fs.size() \u003c dp) fs = \"0\" + fs;\n r += \",\" + fs;\n }\n return neg ? (\"-\"+r) : r;\n}\n","suffix":"\nint main() {\n assert(format_integer_part(1234567) == \"1.234.567\");\n assert(format_integer_part(0) == \"0\");\n assert(format_integer_part(-42) == \"-42\");\n\n assert(format_number(1234567.89) == \"1.234.567,89\");\n assert(format_number(1234567.89) != \"1,234,567.89\"); // NOT US style!\n assert(format_number(0.5) == \"0,50\");\n assert(format_number(-1234.5) == \"-1.234,50\");\n assert(format_number(42.0) == \"42,00\");\n assert(format_number(1000.0, 0) == \"1.000\");\n\n std::cout \u003c\u003c \"Task 49 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" assert(format_number(0.0) == \"0,00\");\n assert(format_number(999.99) == \"999,99\");\n assert(format_number(1000.0) == \"1.000,00\");\n assert(format_number(1000000.0) == \"1.000.000,00\");\n assert(format_number(0.123, 3) == \"0,123\");\n assert(format_number(0.1, 1) == \"0,1\");\n assert(format_number(-0.5, 2) == \"-0,50\");\n assert(format_number(123456789.0, 0) == \"123.456.789\");\n assert(format_number(99.999, 2) == \"100,00\");\n","category":"pattern_matching"} {"id":"50","testsource":"devbench-pattern-matching","language":"cpp","prefix":"#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cnumeric\u003e\n\n// Custom LCG: next = (a * current + c) % m, returns float in [0,1).\nstruct LCG {\n uint64_t state;\n static constexpr uint64_t a = 1103515245, c = 12345, m = (1ULL \u003c\u003c 31);\n LCG(uint64_t seed) : state(seed) {}\n double next() { state = (a * state + c) % m; return (double)state / (double)m; }\n};\n\n// weighted_random_select: given items+weights and an LCG,\n// select n items WITH REPLACEMENT. For each: r = rng.next() * total_weight,\n// find item whose cumulative weight range contains r.\n\n","golden_completion":"std::vector\u003cstd::string\u003e weighted_random_select(const std::vector\u003cstd::string\u003e\u0026 items,\n const std::vector\u003cdouble\u003e\u0026 weights, int n, LCG\u0026 rng) {\n double total = std::accumulate(weights.begin(), weights.end(), 0.0);\n std::vector\u003cdouble\u003e cum(weights.size()); cum[0] = weights[0];\n for (size_t i=1; i\u003cweights.size(); i++) cum[i]=cum[i-1]+weights[i];\n std::vector\u003cstd::string\u003e result;\n for (int i = 0; i \u003c n; i++) { double r = rng.next()*total;\n for (size_t j=0; j\u003ccum.size(); j++)\n if (r\u003ccum[j]) { result.push_back(items[j]); break; }\n } return result;\n}\n","suffix":"\nint main() {\n LCG rng1(42);\n double v1 = rng1.next();\n assert(v1 \u003e 0.58 \u0026\u0026 v1 \u003c 0.59);\n\n LCG rng2(42);\n std::vector\u003cstd::string\u003e items = {\"apple\", \"banana\", \"cherry\"};\n std::vector\u003cdouble\u003e weights = {1.0, 2.0, 1.0};\n auto selected = weighted_random_select(items, weights, 5, rng2);\n assert(selected.size() == 5);\n assert(selected[0] == \"banana\");\n\n std::cout \u003c\u003c \"Task 50 visible OK\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":" LCG rng3(42);\n auto sel2 = weighted_random_select({\"apple\", \"banana\", \"cherry\"}, {1.0, 2.0, 1.0}, 5, rng3);\n assert(sel2[0] == \"banana\" \u0026\u0026 sel2.size() == 5);\n LCG rng4(0);\n auto sel3 = weighted_random_select({\"only\"}, {1.0}, 3, rng4);\n assert(sel3.size() == 3 \u0026\u0026 sel3[0] == \"only\" \u0026\u0026 sel3[1] == \"only\" \u0026\u0026 sel3[2] == \"only\");\n LCG rng5(100);\n auto sel4 = weighted_random_select({\"a\", \"b\"}, {1.0, 1.0}, 4, rng5);\n assert(sel4.size() == 4);\n LCG rng6(100);\n auto sel5 = weighted_random_select({\"a\", \"b\"}, {1.0, 1.0}, 4, rng6);\n assert(sel4 == sel5);\n","category":"pattern_matching"} {"id":"1","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cmap\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Insert key-value pairs into a map, returning count of NEW insertions.\n// Uses C++17 structured bindings with if-init statements.\nint insert_unique(std::map\u003cstd::string, int\u003e\u0026 m,\n const std::vector\u003cstd::pair\u003cstd::string, int\u003e\u003e\u0026 entries) {\n int new_count = 0;\n for (const auto\u0026 [key, val] : entries) {\n","golden_completion":" if (auto [it, inserted] = m.insert({key, val}); inserted) {\n ++new_count;\n }\n","suffix":" }\n return new_count;\n}\n\nint main() {\n std::map\u003cstd::string, int\u003e m;\n std::vector\u003cstd::pair\u003cstd::string, int\u003e\u003e entries = {\n {\"alpha\", 1}, {\"beta\", 2}, {\"alpha\", 3}, {\"gamma\", 4}\n };\n int n = insert_unique(m, entries);\n std::cout \u003c\u003c \"New insertions: \" \u003c\u003c n \u003c\u003c std::endl;\n assert(n == 3);\n assert(m[\"alpha\"] == 1);\n assert(m.size() == 3);\n return 0;\n}\n","assertions":" assert(m.at(\"beta\") == 2);\n assert(m.at(\"gamma\") == 4);\n // Second round should insert nothing\n std::map\u003cstd::string, int\u003e m2 = {{\"x\", 10}};\n std::vector\u003cstd::pair\u003cstd::string, int\u003e\u003e e2 = {{\"x\", 20}, {\"x\", 30}};\n assert(insert_unique(m2, e2) == 0);\n assert(m2[\"x\"] == 10);\n","category":"syntax_completion"} {"id":"2","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003ctuple\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003calgorithm\u003e\n#include \u003ccassert\u003e\n\n// Returns (min, max, sum) from a vector using structured bindings.\nstd::tuple\u003cint, int, int\u003e stats(const std::vector\u003cint\u003e\u0026 v) {\n auto [mn, mx] = std::minmax_element(v.begin(), v.end());\n int s = 0;\n for (auto x : v) s += x;\n","golden_completion":" return {*mn, *mx, s};\n}\n\n// Unpack and format as \"min=X max=Y sum=Z\"\nstd::string format_stats(const std::vector\u003cint\u003e\u0026 v) {\n auto [lo, hi, total] = stats(v);\n","suffix":" return \"min=\" + std::to_string(lo) +\n \" max=\" + std::to_string(hi) +\n \" sum=\" + std::to_string(total);\n}\n\nint main() {\n std::vector\u003cint\u003e data = {3, 1, 4, 1, 5, 9, 2, 6};\n auto result = format_stats(data);\n std::cout \u003c\u003c result \u003c\u003c std::endl;\n assert(result == \"min=1 max=9 sum=31\");\n return 0;\n}\n","assertions":" std::vector\u003cint\u003e single = {42};\n assert(format_stats(single) == \"min=42 max=42 sum=42\");\n std::vector\u003cint\u003e neg = {-5, -1, -10};\n assert(format_stats(neg) == \"min=-10 max=-1 sum=-16\");\n","category":"syntax_completion"} {"id":"3","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ctype_traits\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Variadic template: check if ALL arguments satisfy a predicate.\n// Uses a fold expression with \u0026\u0026 operator.\ntemplate\u003ctypename Pred, typename... Args\u003e\nbool all_satisfy(Pred p, Args... args) {\n","golden_completion":" return (p(args) \u0026\u0026 ...);\n}\n\n// Variadic template: count how many arguments satisfy a predicate.\n// Uses a fold expression with + operator and implicit bool-to-int.\ntemplate\u003ctypename Pred, typename... Args\u003e\nint count_satisfy(Pred p, Args... args) {\n return (0 + ... + (p(args) ? 1 : 0));\n","suffix":"}\n\nint main() {\n auto is_positive = [](int x) { return x \u003e 0; };\n auto is_even = [](int x) { return x % 2 == 0; };\n\n assert(all_satisfy(is_positive, 1, 2, 3, 4));\n assert(!all_satisfy(is_positive, 1, -2, 3));\n assert(all_satisfy(is_even, 2, 4, 6));\n assert(!all_satisfy(is_even, 2, 3, 6));\n\n assert(count_satisfy(is_positive, 1, -2, 3, -4, 5) == 3);\n assert(count_satisfy(is_even, 1, 2, 3, 4, 5) == 2);\n assert(count_satisfy(is_even, 1, 3, 5) == 0);\n return 0;\n}\n","assertions":" assert(all_satisfy(is_positive, 42));\n assert(count_satisfy(is_positive, -1, -2, -3) == 0);\n assert(count_satisfy(is_even, 2, 4, 6, 8) == 4);\n","category":"syntax_completion"} {"id":"4","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n\n// Push all variadic arguments into a vector using a fold expression\n// with the comma operator.\ntemplate\u003ctypename T, typename... Args\u003e\nstd::vector\u003cT\u003e make_vec(Args\u0026\u0026... args) {\n std::vector\u003cT\u003e v;\n v.reserve(sizeof...(args));\n","golden_completion":" (v.push_back(std::forward\u003cArgs\u003e(args)), ...);\n return v;\n}\n\n// Concatenate all arguments into a string separated by a delimiter,\n// using a fold expression with comma and ostringstream.\ntemplate\u003ctypename... Args\u003e\nstd::string join_with(const std::string\u0026 delim, Args\u0026\u0026... args) {\n std::ostringstream oss;\n int idx = 0;\n ((oss \u003c\u003c (idx++ \u003e 0 ? delim : \"\") \u003c\u003c args), ...);\n","suffix":" return oss.str();\n}\n\nint main() {\n auto v = make_vec\u003cint\u003e(10, 20, 30, 40);\n assert(v.size() == 4);\n assert(v[0] == 10);\n assert(v[3] == 40);\n\n auto s = join_with(\"-\", \"hello\", \"world\", \"cpp\");\n assert(s == \"hello-world-cpp\");\n\n auto s2 = join_with(\", \", 1, 2, 3);\n assert(s2 == \"1, 2, 3\");\n return 0;\n}\n","assertions":" auto v2 = make_vec\u003cstd::string\u003e(\"a\", \"b\", \"c\");\n assert(v2.size() == 3);\n assert(v2[1] == \"b\");\n auto s3 = join_with(\"\", \"a\", \"b\", \"c\");\n assert(s3 == \"abc\");\n","category":"syntax_completion"} {"id":"5","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ctype_traits\u003e\n#include \u003cstring\u003e\n#include \u003csstream\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n\n// Convert any value to a string representation using constexpr if\n// to dispatch based on type. Handles: integral, floating-point,\n// std::string, and containers with begin/end (via SFINAE helper).\ntemplate\u003ctypename T\u003e\nstruct has_begin_end {\n template\u003ctypename U\u003e\n static auto test(int) -\u003e decltype(std::declval\u003cU\u003e().begin(),\n std::declval\u003cU\u003e().end(),\n std::true_type{});\n template\u003ctypename\u003e\n static std::false_type test(...);\n static constexpr bool value = decltype(test\u003cT\u003e(0))::value;\n};\n\ntemplate\u003ctypename T\u003e\nstd::string to_repr(const T\u0026 val) {\n","golden_completion":" if constexpr (std::is_integral_v\u003cT\u003e) {\n return \"int:\" + std::to_string(val);\n } else if constexpr (std::is_floating_point_v\u003cT\u003e) {\n return \"float:\" + std::to_string(val).substr(0, std::to_string(val).find(\u0027.\u0027) + 3);\n } else if constexpr (std::is_same_v\u003cT, std::string\u003e) {\n return \"str:\" + val;\n } else if constexpr (has_begin_end\u003cT\u003e::value) {\n std::string r = \"list:[\";\n bool f = true;\n for (const auto\u0026 e : val) { if (!f) r += \",\"; r += to_repr(e); f = false; }\n return r + \"]\";\n","suffix":" } else {\n return \"unknown\";\n }\n}\n\nint main() {\n assert(to_repr(42) == \"int:42\");\n assert(to_repr(-1) == \"int:-1\");\n auto fr = to_repr(3.14);\n assert(fr == \"float:3.14\");\n assert(to_repr(std::string(\"hello\")) == \"str:hello\");\n std::vector\u003cint\u003e v = {1, 2, 3};\n assert(to_repr(v) == \"list:[int:1,int:2,int:3]\");\n return 0;\n}\n","assertions":" assert(to_repr(true) == \"int:1\");\n std::vector\u003cstd::string\u003e vs = {\"a\", \"b\"};\n assert(to_repr(vs) == \"list:[str:a,str:b]\");\n std::vector\u003cstd::vector\u003cint\u003e\u003e nested = {{1, 2}, {3}};\n assert(to_repr(nested) == \"list:[list:[int:1,int:2],list:[int:3]]\");\n","category":"syntax_completion"} {"id":"6","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ctype_traits\u003e\n#include \u003ctuple\u003e\n#include \u003cutility\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Compile-time type name via constexpr if + template specialization.\n// Returns a string tag for the type.\ntemplate\u003ctypename T\u003e\nstd::string type_tag() {\n if constexpr (std::is_same_v\u003cT, int\u003e) return \"i\";\n else if constexpr (std::is_same_v\u003cT, double\u003e) return \"d\";\n else if constexpr (std::is_same_v\u003cT, std::string\u003e) return \"s\";\n else return \"?\";\n}\n\n// Build a \"signature\" string from a tuple\u0027s types, e.g. \"(i,d,s)\"\n// Uses index_sequence to expand the tuple types at compile time.\ntemplate\u003ctypename Tuple, std::size_t... Is\u003e\nstd::string tuple_sig_impl(std::index_sequence\u003cIs...\u003e) {\n","golden_completion":" std::string result = \"(\";\n int idx = 0;\n ((result += (idx++ \u003e 0 ? \",\" : \"\") +\n type_tag\u003cstd::tuple_element_t\u003cIs, Tuple\u003e\u003e()), ...);\n return result + \")\";\n}\n\ntemplate\u003ctypename... Ts\u003e\nstd::string tuple_sig(const std::tuple\u003cTs...\u003e\u0026) {\n return tuple_sig_impl\u003cstd::tuple\u003cTs...\u003e\u003e(\n std::index_sequence_for\u003cTs...\u003e{});\n","suffix":"}\n\nint main() {\n auto t1 = std::make_tuple(1, 2.0, std::string(\"hi\"));\n assert(tuple_sig(t1) == \"(i,d,s)\");\n\n auto t2 = std::make_tuple(42);\n assert(tuple_sig(t2) == \"(i)\");\n\n auto t3 = std::make_tuple(1.0, 2.0);\n assert(tuple_sig(t3) == \"(d,d)\");\n return 0;\n}\n","assertions":" auto t4 = std::make_tuple(std::string(\"a\"), std::string(\"b\"), 3);\n assert(tuple_sig(t4) == \"(s,s,i)\");\n auto t5 = std::make_tuple(1, std::string(\"x\"), 3.0, 4);\n assert(tuple_sig(t5) == \"(i,s,d,i)\");\n","category":"syntax_completion"} {"id":"7","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003cfunctional\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n\n// Create a counter lambda that starts from a given value\n// and increments by a given step each time it is called.\n// Uses init-capture to move the start value into the lambda.\nstd::function\u003cint()\u003e make_counter(int start, int step) {\n","golden_completion":" return [state = start, step](void) mutable -\u003e int {\n int current = state;\n state += step;\n return current;\n };\n","suffix":"}\n\nint main() {\n auto counter = make_counter(0, 1);\n assert(counter() == 0);\n assert(counter() == 1);\n assert(counter() == 2);\n\n auto by3 = make_counter(10, 3);\n assert(by3() == 10);\n assert(by3() == 13);\n assert(by3() == 16);\n return 0;\n}\n","assertions":" auto neg = make_counter(5, -2);\n assert(neg() == 5);\n assert(neg() == 3);\n assert(neg() == 1);\n // Independent instances\n auto a = make_counter(0, 1);\n auto b = make_counter(100, 10);\n assert(a() == 0);\n assert(b() == 100);\n assert(a() == 1);\n assert(b() == 110);\n","category":"syntax_completion"} {"id":"8","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003cmemory\u003e\n#include \u003cfunctional\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// A scope guard that calls a cleanup function on destruction.\n// Uses unique_ptr with a custom deleter lambda.\nclass ScopeLog {\n std::vector\u003cstd::string\u003e\u0026 log_;\npublic:\n ScopeLog(std::vector\u003cstd::string\u003e\u0026 log) : log_(log) {}\n\n // Returns a guard object. When it goes out of scope,\n // the message is appended to the log.\n auto make_guard(const std::string\u0026 msg) {\n","golden_completion":" auto deleter = [this, msg](void* ) {\n log_.push_back(\"exit:\" + msg);\n };\n log_.push_back(\"enter:\" + msg);\n return std::unique_ptr\u003cvoid, decltype(deleter)\u003e(\n reinterpret_cast\u003cvoid*\u003e(1), deleter);\n","suffix":" }\n};\n\nint main() {\n std::vector\u003cstd::string\u003e log;\n ScopeLog sl(log);\n {\n auto g1 = sl.make_guard(\"outer\");\n {\n auto g2 = sl.make_guard(\"inner\");\n }\n }\n assert(log.size() == 4);\n assert(log[0] == \"enter:outer\");\n assert(log[1] == \"enter:inner\");\n assert(log[2] == \"exit:inner\");\n assert(log[3] == \"exit:outer\");\n return 0;\n}\n","assertions":" // Test single guard\n std::vector\u003cstd::string\u003e log2;\n ScopeLog sl2(log2);\n { auto g = sl2.make_guard(\"solo\"); }\n assert(log2.size() == 2);\n assert(log2[0] == \"enter:solo\");\n assert(log2[1] == \"exit:solo\");\n","category":"syntax_completion"} {"id":"9","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003cmap\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ctype_traits\u003e\n#include \u003ccassert\u003e\n\n// Transform all values in a map through a function, returning a new map.\n// Uses trailing return type with decltype to deduce the result value type.\n// The function signature must handle const references correctly.\ntemplate\u003ctypename K, typename V, typename Func\u003e\nauto transform_map_values(const std::map\u003cK, V\u003e\u0026 input, Func f)\n -\u003e std::map\u003cK, decltype(f(std::declval\u003cconst V\u0026\u003e()))\u003e {\n","golden_completion":" using R = decltype(f(std::declval\u003cconst V\u0026\u003e()));\n std::map\u003cK, R\u003e result;\n for (const auto\u0026 [key, val] : input) result.emplace(key, f(val));\n return result;\n}\n\ntemplate\u003ctypename K, typename V, typename Func, typename Pred\u003e\nauto transform_and_filter(const std::map\u003cK, V\u003e\u0026 input, Func f, Pred pred)\n -\u003e std::map\u003cK, decltype(f(std::declval\u003cconst V\u0026\u003e()))\u003e {\n auto t = transform_map_values(input, f);\n decltype(t) out;\n for (const auto\u0026 [k, v] : t) if (pred(v)) out.emplace(k, v);\n return out;\n","suffix":"}\n\nint main() {\n std::map\u003cstd::string, int\u003e scores = {\n {\"alice\", 85}, {\"bob\", 92}, {\"carol\", 78}, {\"dave\", 95}\n };\n\n // Double all scores\n auto doubled = transform_map_values(scores, [](int x) { return x * 2; });\n assert(doubled[\"alice\"] == 170);\n assert(doubled[\"dave\"] == 190);\n\n // Transform to string and filter\n auto high = transform_and_filter(scores,\n [](int x) { return x; },\n [](int x) { return x \u003e= 90; });\n assert(high.size() == 2);\n assert(high.count(\"bob\") == 1);\n assert(high.count(\"dave\") == 1);\n return 0;\n}\n","assertions":" // Transform int -\u003e string\n auto labels = transform_map_values(scores,\n [](int x) -\u003e std::string { return x \u003e= 90 ? \"A\" : \"B\"; });\n assert(labels[\"alice\"] == \"B\");\n assert(labels[\"bob\"] == \"A\");\n // Empty map\n std::map\u003cstd::string, int\u003e empty;\n auto empty_result = transform_map_values(empty, [](int x) { return x; });\n assert(empty_result.empty());\n","category":"syntax_completion"} {"id":"10","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ctuple\u003e\n#include \u003cstring\u003e\n#include \u003cfunctional\u003e\n#include \u003ctype_traits\u003e\n#include \u003ccassert\u003e\n\n// Apply a chain of transformations to a value.\n// Each function in the chain transforms the current value.\n// Uses variadic templates + constexpr if for base case.\ntemplate\u003ctypename T, typename Func\u003e\nauto apply_chain(T val, Func f) {\n return f(val);\n}\n\ntemplate\u003ctypename T, typename Func, typename... Rest\u003e\nauto apply_chain(T val, Func f, Rest... rest) {\n","golden_completion":" return apply_chain(f(val), rest...);\n}\n\n// Create a composed function from multiple lambdas.\n// compose(f, g, h)(x) == h(g(f(x))) — left-to-right application.\n// Returns a lambda that captures all functions in a tuple.\ntemplate\u003ctypename... Funcs\u003e\nauto compose(Funcs... funcs) {\n return [tup = std::make_tuple(std::move(funcs)...)](auto val) {\n return std::apply([\u0026val](auto\u0026... fs) {\n return apply_chain(val, fs...);\n }, const_cast\u003cstd::tuple\u003cFuncs...\u003e\u0026\u003e(tup));\n };\n","suffix":"}\n\nint main() {\n // Basic chain\n auto r1 = apply_chain(3,\n [](int x) { return x * 2; },\n [](int x) { return x + 10; },\n [](int x) { return std::to_string(x); });\n assert(r1 == \"16\");\n\n // Compose\n auto pipeline = compose(\n [](int x) { return x * 3; },\n [](int x) { return x - 1; },\n [](int x) { return std::to_string(x); }\n );\n assert(pipeline(5) == \"14\");\n assert(pipeline(10) == \"29\");\n return 0;\n}\n","assertions":" // Single function chain\n auto r2 = apply_chain(42, [](int x) { return x; });\n assert(r2 == 42);\n // Compose with type changes\n auto p2 = compose(\n [](int x) { return x + 1; },\n [](int x) { return static_cast\u003cdouble\u003e(x) / 2.0; }\n );\n double v = p2(9);\n assert(v == 5.0);\n","category":"syntax_completion"} {"id":"11","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cfunctional\u003e\n#include \u003ccassert\u003e\n#include \u003cstring\u003e\n\n// A scope guard that executes a cleanup lambda on destruction.\n// Supports move-only semantics (no copy).\ntemplate \u003ctypename F\u003e\nclass ScopeGuard {\npublic:\n explicit ScopeGuard(F f) : func_(std::move(f)), active_(true) {}\n\n // Move constructor — transfers ownership, disarms source\n ScopeGuard(ScopeGuard\u0026\u0026 other) noexcept\n : func_(std::move(other.func_)), active_(other.active_) {\n other.active_ = false;\n }\n\n // No copy\n ScopeGuard(const ScopeGuard\u0026) = delete;\n ScopeGuard\u0026 operator=(const ScopeGuard\u0026) = delete;\n\n // Destructor: call func_ only if still active\n","golden_completion":" ~ScopeGuard() {\n if (active_) func_();\n }\n void dismiss() { active_ = false; }\nprivate:\n F func_;\n bool active_;\n};\n","suffix":"\ntemplate \u003ctypename F\u003e\nScopeGuard\u003cF\u003e make_guard(F f) {\n return ScopeGuard\u003cF\u003e(std::move(f));\n}\n\nint main() {\n std::string log;\n\n {\n auto g1 = make_guard([\u0026]() { log += \"A\"; });\n {\n auto g2 = make_guard([\u0026]() { log += \"B\"; });\n auto g3 = std::move(g2); // g2 disarmed, g3 armed\n }\n // g3 destroyed here =\u003e \"B\"\n }\n // g1 destroyed here =\u003e \"BA\"\n\n assert(log == \"BA\");\n std::cout \u003c\u003c \"Task 11 passed\\n\";\n return 0;\n}\n","assertions":" assert(log == \"BA\");\n","category":"syntax_completion"} {"id":"12","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003ccassert\u003e\n#include \u003cutility\u003e\n#include \u003cstring\u003e\n\n// A move-only resource handle that tracks acquire/release via a shared log string.\nclass UniqueHandle {\npublic:\n explicit UniqueHandle(int id, std::string\u0026 log)\n : id_(id), log_(log), valid_(true) {\n log_ += \"A\" + std::to_string(id_) + \" \";\n }\n\n // Deleted copy\n UniqueHandle(const UniqueHandle\u0026) = delete;\n UniqueHandle\u0026 operator=(const UniqueHandle\u0026) = delete;\n\n // Move constructor: transfer ownership, invalidate source\n UniqueHandle(UniqueHandle\u0026\u0026 other) noexcept\n : id_(other.id_), log_(other.log_), valid_(other.valid_) {\n other.valid_ = false;\n }\n\n // Move assignment operator\n","golden_completion":" UniqueHandle\u0026 operator=(UniqueHandle\u0026\u0026 other) noexcept {\n if (this != \u0026other) {\n if (valid_) log_ += \"R\" + std::to_string(id_) + \" \";\n id_ = other.id_;\n valid_ = other.valid_;\n other.valid_ = false;\n }\n return *this;\n }\n","suffix":"\n ~UniqueHandle() {\n if (valid_) log_ += \"R\" + std::to_string(id_) + \" \";\n }\n\n int id() const { return id_; }\n bool valid() const { return valid_; }\n\nprivate:\n int id_;\n std::string\u0026 log_;\n bool valid_;\n};\n\nint main() {\n std::string log;\n\n {\n UniqueHandle h1(1, log);\n UniqueHandle h2(std::move(h1));\n assert(!h1.valid());\n assert(h2.valid());\n assert(h2.id() == 1);\n }\n // h2 destroyed =\u003e \"A1 R1 \"\n assert(log == \"A1 R1 \");\n\n log.clear();\n {\n UniqueHandle h3(3, log);\n UniqueHandle h4(4, log);\n h3 = std::move(h4); // h3(3) released, h3 now holds 4\n assert(h3.id() == 4);\n assert(!h4.valid());\n }\n // h3(4) destroyed\n assert(log == \"A3 A4 R3 R4 \");\n\n std::cout \u003c\u003c \"Task 12 passed\\n\";\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"13","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003csstream\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Type-safe variadic print: formats arguments separated by \", \"\n// Base case: single argument\ntemplate \u003ctypename T\u003e\nstd::string format_args(const T\u0026 val) {\n std::ostringstream oss;\n oss \u003c\u003c val;\n return oss.str();\n}\n\n// Recursive case: first argument + rest\n","golden_completion":"template \u003ctypename T, typename... Args\u003e\nstd::string format_args(const T\u0026 first, const Args\u0026... rest) {\n std::ostringstream oss;\n oss \u003c\u003c first;\n return oss.str() + \", \" + format_args(rest...);\n}\n","suffix":"\nint main() {\n std::string r1 = format_args(42);\n assert(r1 == \"42\");\n\n std::string r2 = format_args(1, \"hello\", 3.14);\n assert(r2 == \"1, hello, 3.14\");\n\n std::string r3 = format_args(\"a\", \"b\", \"c\", \"d\");\n assert(r3 == \"a, b, c, d\");\n\n std::cout \u003c\u003c \"Task 13 passed\\n\";\n return 0;\n}\n","assertions":" assert(r2 == \"1, hello, 3.14\");\n","category":"syntax_completion"} {"id":"14","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n#include \u003ctuple\u003e\n\n// Compute total size of all types in a parameter pack using fold expression\ntemplate \u003ctypename... Ts\u003e\nconstexpr std::size_t total_size() {\n","golden_completion":" return (sizeof(Ts) + ...);\n}\n\n// Count number of types in a parameter pack\ntemplate \u003ctypename... Ts\u003e\nconstexpr std::size_t count_types() {\n return sizeof...(Ts);\n}\n","suffix":"\n// Check if all types are integral using fold expression\ntemplate \u003ctypename... Ts\u003e\nconstexpr bool all_integral() {\n return (std::is_integral_v\u003cTs\u003e \u0026\u0026 ...);\n}\n\nint main() {\n static_assert(total_size\u003cint, double, char\u003e() == sizeof(int) + sizeof(double) + sizeof(char));\n static_assert(count_types\u003cint, double, char\u003e() == 3);\n static_assert(count_types\u003c\u003e() == 0);\n static_assert(all_integral\u003cint, short, long\u003e());\n static_assert(!all_integral\u003cint, double\u003e());\n\n std::cout \u003c\u003c \"Task 14 passed\\n\";\n return 0;\n}\n","assertions":" static_assert(total_size\u003cint, double, char\u003e() == sizeof(int) + sizeof(double) + sizeof(char));\n static_assert(count_types\u003cint, double, char\u003e() == 3);\n","category":"syntax_completion"} {"id":"15","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cmap\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Flatten a map\u003cstring, vector\u003cint\u003e\u003e into a single vector of pairs\n// using structured bindings in nested range-for loops.\nstd::vector\u003cstd::pair\u003cstd::string, int\u003e\u003e flatten_map(\n const std::map\u003cstd::string, std::vector\u003cint\u003e\u003e\u0026 data) {\n std::vector\u003cstd::pair\u003cstd::string, int\u003e\u003e result;\n","golden_completion":" for (const auto\u0026 [key, values] : data) {\n for (const auto\u0026 val : values) {\n result.emplace_back(key, val);\n }\n }\n return result;\n","suffix":"}\n\nint main() {\n std::map\u003cstd::string, std::vector\u003cint\u003e\u003e data = {\n {\"alpha\", {1, 2}},\n {\"beta\", {3}},\n {\"gamma\", {4, 5, 6}}\n };\n\n auto flat = flatten_map(data);\n assert(flat.size() == 6);\n // map is sorted by key: alpha, beta, gamma\n assert(flat[0] == std::make_pair(std::string(\"alpha\"), 1));\n assert(flat[1] == std::make_pair(std::string(\"alpha\"), 2));\n assert(flat[2] == std::make_pair(std::string(\"beta\"), 3));\n assert(flat[3] == std::make_pair(std::string(\"gamma\"), 4));\n\n std::cout \u003c\u003c \"Task 15 passed\\n\";\n return 0;\n}\n","assertions":" assert(flat.size() == 6);\n assert(flat[0] == std::make_pair(std::string(\"alpha\"), 1));\n","category":"syntax_completion"} {"id":"16","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003ctype_traits\u003e\n#include \u003ccassert\u003e\n\n// Converts a value to string representation based on its type\n// using if constexpr for compile-time dispatch.\ntemplate \u003ctypename T\u003e\nstd::string to_description(const T\u0026 val) {\n","golden_completion":" if constexpr (std::is_integral_v\u003cT\u003e) {\n return \"int:\" + std::to_string(val);\n } else if constexpr (std::is_floating_point_v\u003cT\u003e) {\n return \"float:\" + std::to_string(val);\n } else if constexpr (std::is_same_v\u003cT, std::string\u003e) {\n return \"string:\" + val;\n } else {\n return \"unknown\";\n }\n","suffix":"}\n\nint main() {\n assert(to_description(42) == \"int:42\");\n assert(to_description(3.14).substr(0, 10) == \"float:3.14\");\n assert(to_description(std::string(\"hello\")) == \"string:hello\");\n assert(to_description(true) == \"int:1\"); // bool is integral\n\n std::cout \u003c\u003c \"Task 16 passed\\n\";\n return 0;\n}\n","assertions":" assert(to_description(42) == \"int:42\");\n assert(to_description(std::string(\"hello\")) == \"string:hello\");\n","category":"syntax_completion"} {"id":"17","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cvariant\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\n// Overload pattern: combines multiple lambdas into one callable\ntemplate \u003cclass... Ts\u003e\nstruct overloaded : Ts... { using Ts::operator()...; };\n\n// Deduction guide (C++17)\ntemplate \u003cclass... Ts\u003e\noverloaded(Ts...) -\u003e overloaded\u003cTs...\u003e;\n\nusing Value = std::variant\u003cint, double, std::string\u003e;\n\n// Process a variant using std::visit with overloaded lambdas\nstd::string describe(const Value\u0026 v) {\n","golden_completion":" return std::visit(overloaded{\n [](int i) -\u003e std::string { return \"integer:\" + std::to_string(i); },\n [](double d) -\u003e std::string { return \"double:\" + std::to_string(d); },\n [](const std::string\u0026 s) -\u003e std::string { return \"string:\" + s; }\n }, v);\n","suffix":"}\n\nint main() {\n Value v1 = 42;\n Value v2 = 3.14;\n Value v3 = std::string(\"hello\");\n\n assert(describe(v1) == \"integer:42\");\n assert(describe(v2).substr(0, 12) == \"double:3.140\");\n assert(describe(v3) == \"string:hello\");\n\n std::cout \u003c\u003c \"Task 17 passed\\n\";\n return 0;\n}\n","assertions":" assert(describe(v1) == \"integer:42\");\n assert(describe(v3) == \"string:hello\");\n","category":"syntax_completion"} {"id":"18","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Resource {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Resource(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"open:\" + name);\n }\n ~Resource() {\n if (log) log-\u003epush_back(\"close:\" + name);\n }\n};\n\nstd::vector\u003cstd::string\u003e transfer_order() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto first = std::make_unique\u003cResource\u003e(\"first\", log);\n auto second = std::make_unique\u003cResource\u003e(\"second\", log);\n std::swap(first, second);\n log.push_back(\"body:\" + first-\u003ename + \"/\" + second-\u003ename);","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = transfer_order();\n assert(log.size() == 5);\n assert(log[0] == \"open:first\");\n assert(log[1] == \"open:second\");\n std::cout \u003c\u003c log[2] \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert(log[2] == \"body:second/first\");\n assert(log[3] == \"close:first\");\n assert(log[4] == \"close:second\");\n","category":"syntax_completion"} {"id":"19","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cconcepts\u003e\n#include \u003ccassert\u003e\n\n// Define a concept: a type must support + operator and conversion to string\ntemplate \u003ctypename T\u003e\nconcept Addable = requires(T a, T b) {\n { a + b } -\u003e std::convertible_to\u003cT\u003e;\n};\n\n// Define a concept: a type must have a .size() method returning an integral type\n","golden_completion":"template \u003ctypename T\u003e\nconcept Sizeable = requires(T t) {\n { t.size() } -\u003e std::integral;\n};\n\n// Function constrained by Addable concept\ntemplate \u003cAddable T\u003e\nT add(T a, T b) { return a + b; }\n","suffix":"\n// Function constrained by Sizeable concept\ntemplate \u003cSizeable T\u003e\nstd::size_t get_size(const T\u0026 container) {\n return container.size();\n}\n\nint main() {\n assert(add(3, 4) == 7);\n assert(add(1.5, 2.5) == 4.0);\n assert(add(std::string(\"hello\"), std::string(\" world\")) == \"hello world\");\n\n std::string s = \"test\";\n assert(get_size(s) == 4);\n\n std::cout \u003c\u003c \"Task 19 passed\\n\";\n return 0;\n}\n","assertions":" assert(add(3, 4) == 7);\n assert(add(std::string(\"hello\"), std::string(\" world\")) == \"hello world\");\n","category":"syntax_completion"} {"id":"20","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003ctype_traits\u003e\n#include \u003ccassert\u003e\n\n// SFINAE: select different implementations based on type traits\n\n// For integral types: return \"integral: \u003cvalue\u003e\"\ntemplate \u003ctypename T\u003e\n","golden_completion":"std::enable_if_t\u003cstd::is_integral_v\u003cT\u003e, std::string\u003e\ndescribe_value(T val) { return \"integral: \" + std::to_string(val); }\n\n// For floating point types: return \"floating: \u003cvalue\u003e\"\ntemplate \u003ctypename T\u003e\nstd::enable_if_t\u003cstd::is_floating_point_v\u003cT\u003e, std::string\u003e\ndescribe_value(T val) { return \"floating: \" + std::to_string(val); }\n","suffix":"\n// For string types: return \"text: \u003cvalue\u003e\"\nstd::string describe_value(const std::string\u0026 val) {\n return \"text: \" + val;\n}\n\nint main() {\n assert(describe_value(42) == \"integral: 42\");\n assert(describe_value(true) == \"integral: 1\");\n assert(describe_value(3.14).substr(0, 14) == \"floating: 3.14\");\n assert(describe_value(std::string(\"hi\")) == \"text: hi\");\n\n std::cout \u003c\u003c \"Task 20 passed\\n\";\n return 0;\n}\n","assertions":" assert(describe_value(42) == \"integral: 42\");\n assert(describe_value(std::string(\"hi\")) == \"text: hi\");\n","category":"syntax_completion"} {"id":"21","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Token {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Token(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"enter:\" + name);\n }\n ~Token() {\n log-\u003epush_back(\"exit:\" + name);\n }\n};\n\nstd::vector\u003cstd::string\u003e nested_tokens() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" Token outer(\"outer\", log);\n log.push_back(\"mark:outer\");\n {\n Token inner(\"inner\", log);\n log.push_back(\"mark:inner\");\n }\n log.push_back(\"after-inner\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = nested_tokens();\n assert(log.size() == 7);\n assert(log[0] == \"enter:outer\");\n assert(log[2] == \"enter:inner\");\n std::cout \u003c\u003c log.size() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"enter:outer\", \"mark:outer\", \"enter:inner\", \"mark:inner\", \"exit:inner\", \"after-inner\", \"exit:outer\"}));\n","category":"syntax_completion"} {"id":"22","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Tracked {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Tracked(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"new:\" + name);\n }\n ~Tracked() {\n log-\u003epush_back(\"delete:\" + name);\n }\n};\n\nstd::vector\u003cstd::string\u003e release_script() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto owned = std::make_unique\u003cTracked\u003e(\"owned\", log);\n Tracked* raw = owned.release();\n log.push_back(std::string(\"released:\") + raw-\u003ename);\n delete raw;\n log.push_back(\"after-delete\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = release_script();\n assert(log.size() == 4);\n assert(log[0] == \"new:owned\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"new:owned\", \"released:owned\", \"delete:owned\", \"after-delete\"}));\n","category":"syntax_completion"} {"id":"23","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cfunctional\u003e\n#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nclass ScopeExit {\n std::function\u003cvoid()\u003e fn_;\n bool active_ = true;\npublic:\n explicit ScopeExit(std::function\u003cvoid()\u003e fn) : fn_(std::move(fn)) {}\n ScopeExit(ScopeExit\u0026\u0026 other) noexcept : fn_(std::move(other.fn_)), active_(other.active_) {\n other.active_ = false;\n }\n ScopeExit(const ScopeExit\u0026) = delete;\n ScopeExit\u0026 operator=(const ScopeExit\u0026) = delete;\n ~ScopeExit() { if (active_) fn_(); }\n};\n\nstd::vector\u003cstd::string\u003e moved_guard_log() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" ScopeExit first([\u0026] { log.push_back(\"first\"); });\n ScopeExit second([\u0026] { log.push_back(\"second\"); });\n ScopeExit moved(std::move(first));\n log.push_back(\"body\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = moved_guard_log();\n assert(log.size() == 3);\n assert(log[0] == \"body\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"body\", \"first\", \"second\"}));\n","category":"syntax_completion"} {"id":"24","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Node {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Node(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"open:\" + name);\n }\n ~Node() { log-\u003epush_back(\"close:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e vector_erase_log() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" std::vector\u003cstd::unique_ptr\u003cNode\u003e\u003e nodes;\n nodes.push_back(std::make_unique\u003cNode\u003e(\"front\", log));\n nodes.push_back(std::make_unique\u003cNode\u003e(\"back\", log));\n log.push_back(\"before-erase\");\n nodes.erase(nodes.begin());\n log.push_back(\"after-erase\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = vector_erase_log();\n assert(log.size() == 6);\n assert(log[0] == \"open:front\");\n assert(log[1] == \"open:back\");\n std::cout \u003c\u003c log[3] \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert(log[2] == \"before-erase\");\n assert(log[3] == \"close:front\");\n assert(log[4] == \"after-erase\");\n assert(log[5] == \"close:back\");\n","category":"syntax_completion"} {"id":"25","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003coptional\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Item {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Item(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"construct:\" + name);\n }\n ~Item() { log-\u003epush_back(\"destroy:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e optional_lifetime() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" std::optional\u003cItem\u003e slot;\n slot.emplace(\"one\", log);\n slot.emplace(\"two\", log);\n log.push_back(\"has:\" + slot-\u003ename);\n slot.reset();\n log.push_back(\"empty\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = optional_lifetime();\n assert(log.size() == 6);\n assert(log[0] == \"construct:one\");\n assert(log.back() == \"empty\");\n std::cout \u003c\u003c log.size() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"construct:one\", \"destroy:one\", \"construct:two\", \"has:two\", \"destroy:two\", \"empty\"}));\n","category":"syntax_completion"} {"id":"26","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Handle {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Handle(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"open:\" + name);\n }\n ~Handle() { log-\u003epush_back(\"close:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e reset_sequence() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto left = std::make_unique\u003cHandle\u003e(\"left\", log);\n auto right = std::make_unique\u003cHandle\u003e(\"right\", log);\n log.push_back(\"body\");\n right.reset();\n log.push_back(\"after-right\");\n left.reset();\n log.push_back(\"after-left\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = reset_sequence();\n assert(log.size() == 7);\n assert(log[0] == \"open:left\");\n assert(log[1] == \"open:right\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"open:left\", \"open:right\", \"body\", \"close:right\", \"after-right\", \"close:left\", \"after-left\"}));\n","category":"syntax_completion"} {"id":"27","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmutex\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct FakeMutex {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n FakeMutex(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {}\n void lock() { log-\u003epush_back(\"lock:\" + name); }\n void unlock() { log-\u003epush_back(\"unlock:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e lock_scope_log() {\n std::vector\u003cstd::string\u003e log;\n FakeMutex a(\"A\", log);\n FakeMutex b(\"B\", log);\n {\n","golden_completion":" std::lock_guard\u003cFakeMutex\u003e lock_a(a);\n log.push_back(\"after-a\");\n {\n std::lock_guard\u003cFakeMutex\u003e lock_b(b);\n log.push_back(\"inside-b\");\n }\n log.push_back(\"after-b\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = lock_scope_log();\n assert(log.size() == 7);\n assert(log[0] == \"lock:A\");\n assert(log[2] == \"lock:B\");\n std::cout \u003c\u003c log.size() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"lock:A\", \"after-a\", \"lock:B\", \"inside-b\", \"unlock:B\", \"after-b\", \"unlock:A\"}));\n","category":"syntax_completion"} {"id":"28","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Part {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Part(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"open:\" + name);\n }\n ~Part() { log-\u003epush_back(\"close:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e swapped_three() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto a = std::make_unique\u003cPart\u003e(\"A\", log);\n auto b = std::make_unique\u003cPart\u003e(\"B\", log);\n auto c = std::make_unique\u003cPart\u003e(\"C\", log);\n std::swap(a, c);\n log.push_back(\"body:\" + a-\u003ename + \"/\" + b-\u003ename + \"/\" + c-\u003ename);","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = swapped_three();\n assert(log.size() == 7);\n assert(log[0] == \"open:A\");\n assert(log[1] == \"open:B\");\n assert(log[2] == \"open:C\");\n std::cout \u003c\u003c log[3] \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert(log[3] == \"body:C/B/A\");\n assert(log[4] == \"close:A\");\n assert(log[5] == \"close:B\");\n assert(log[6] == \"close:C\");\n","category":"syntax_completion"} {"id":"29","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cfunctional\u003e\n#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nclass ScopeExit {\n std::function\u003cvoid()\u003e fn_;\n bool active_ = true;\npublic:\n explicit ScopeExit(std::function\u003cvoid()\u003e fn) : fn_(std::move(fn)) {}\n void dismiss() { active_ = false; }\n ~ScopeExit() { if (active_) fn_(); }\n};\n\nstd::vector\u003cstd::string\u003e dismissed_guard_log() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" ScopeExit keep([\u0026] { log.push_back(\"keep\"); });\n ScopeExit skip([\u0026] { log.push_back(\"skip\"); });\n skip.dismiss();\n log.push_back(\"body\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = dismissed_guard_log();\n assert(log.size() == 2);\n assert(log[0] == \"body\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"body\", \"keep\"}));\n","category":"syntax_completion"} {"id":"30","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003coptional\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Slot {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Slot(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"make:\" + name);\n }\n ~Slot() { log-\u003epush_back(\"drop:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e optional_hold() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" std::optional\u003cSlot\u003e slot;\n {\n slot.emplace(\"held\", log);\n log.push_back(\"inner:\" + slot-\u003ename);\n }\n log.push_back(\"still:\" + slot-\u003ename);\n slot.reset();\n log.push_back(\"reset\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = optional_hold();\n assert(log.size() == 5);\n assert(log[0] == \"make:held\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"make:held\", \"inner:held\", \"still:held\", \"drop:held\", \"reset\"}));\n","category":"syntax_completion"} {"id":"31","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Owned {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Owned(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"new:\" + name);\n }\n ~Owned() { log-\u003epush_back(\"delete:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e inner_rewrap() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto outer = std::make_unique\u003cOwned\u003e(\"outer\", log);\n {\n std::unique_ptr\u003cOwned\u003e inner(outer.release());\n log.push_back(\"inner:\" + inner-\u003ename);\n }\n log.push_back(outer ? \"outer-live\" : \"outer-empty\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = inner_rewrap();\n assert(log.size() == 4);\n assert(log[0] == \"new:outer\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"new:outer\", \"inner:outer\", \"delete:outer\", \"outer-empty\"}));\n","category":"syntax_completion"} {"id":"32","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Shared {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Shared(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"make:\" + name);\n }\n ~Shared() { log-\u003epush_back(\"drop:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e shared_lifetime() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto p = std::make_shared\u003cShared\u003e(\"shared\", log);\n {\n auto q = p;\n log.push_back(\"count:\" + std::to_string(p.use_count()));\n p.reset();\n log.push_back(\"after-reset\");\n }\n log.push_back(\"after-inner\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = shared_lifetime();\n assert(log.size() == 5);\n assert(log[0] == \"make:shared\");\n std::cout \u003c\u003c log[1] \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"make:shared\", \"count:2\", \"after-reset\", \"drop:shared\", \"after-inner\"}));\n","category":"syntax_completion"} {"id":"33","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003cfunctional\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Blob {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Blob(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"new:\" + name);\n }\n};\n\nstruct Deleter {\n std::vector\u003cstd::string\u003e* log;\n void operator()(Blob* b) const {\n log-\u003epush_back(\"delete:\" + b-\u003ename);\n delete b;\n }\n};\n\nstd::vector\u003cstd::string\u003e custom_deleter_reset() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" std::unique_ptr\u003cBlob, Deleter\u003e blob(new Blob(\"one\", log), Deleter{\u0026log});\n blob.reset(new Blob(\"two\", log));\n log.push_back(\"body:\" + blob-\u003ename);","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = custom_deleter_reset();\n assert(log.size() == 5);\n assert(log[0] == \"new:one\");\n std::cout \u003c\u003c log[2] \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"new:one\", \"new:two\", \"delete:one\", \"body:two\", \"delete:two\"}));\n","category":"syntax_completion"} {"id":"34","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Guard {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Guard(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"enter:\" + name);\n }\n ~Guard() { log-\u003epush_back(\"leave:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e exception_unwind() {\n std::vector\u003cstd::string\u003e log;\n","golden_completion":" try {\n Guard g(\"try\", log);\n log.push_back(\"throwing\");\n throw 7;\n } catch (int value) {\n log.push_back(\"caught:\" + std::to_string(value));\n }","suffix":"\n return log;\n}\n\nint main() {\n auto log = exception_unwind();\n assert(log.size() == 4);\n assert(log[0] == \"enter:try\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"enter:try\", \"throwing\", \"leave:try\", \"caught:7\"}));\n","category":"syntax_completion"} {"id":"35","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003coptional\u003e\n#include \u003cstring\u003e\n#include \u003cfunctional\u003e\n#include \u003ccassert\u003e\n\n// Monadic-style optional chaining helper\n// and_then: if optional has value, apply f (which returns optional), else return nullopt\n// transform: if optional has value, apply f (which returns T), wrap in optional\ntemplate \u003ctypename T, typename F\u003e\nauto and_then(const std::optional\u003cT\u003e\u0026 opt, F\u0026\u0026 f) -\u003e decltype(f(*opt)) {\n if (opt) return f(*opt);\n return std::nullopt;\n}\n\ntemplate \u003ctypename T, typename F\u003e\nauto transform(const std::optional\u003cT\u003e\u0026 opt, F\u0026\u0026 f)\n -\u003e std::optional\u003cdecltype(f(*opt))\u003e {\n if (opt) return f(*opt);\n return std::nullopt;\n}\n\n// Lookup chain: find user -\u003e get email -\u003e get domain\nstd::optional\u003cstd::string\u003e findUser(int id) {\n if (id == 1) return \"alice\";\n if (id == 2) return \"bob\";\n return std::nullopt;\n}\n\nstd::optional\u003cstd::string\u003e getEmail(const std::string\u0026 user) {\n if (user == \"alice\") return \"alice@example.com\";\n if (user == \"bob\") return \"bob@test.org\";\n return std::nullopt;\n}\n\nstd::optional\u003cstd::string\u003e getDomain(const std::string\u0026 email) {\n auto pos = email.find(\u0027@\u0027);\n","golden_completion":" if (pos == std::string::npos) return std::nullopt;\n return email.substr(pos + 1);\n}\n\nstd::optional\u003cstd::string\u003e getUserDomain(int id) {\n return and_then(and_then(findUser(id), getEmail), getDomain);\n","suffix":"}\n\nint main() {\n auto d1 = getUserDomain(1);\n assert(d1.has_value());\n assert(d1.value() == \"example.com\");\n\n auto d2 = getUserDomain(2);\n assert(d2.has_value());\n assert(d2.value() == \"test.org\");\n\n auto d3 = getUserDomain(999);\n assert(!d3.has_value());\n\n // transform test: uppercase domain\n auto upper = transform(d1, [](const std::string\u0026 s) {\n std::string r = s;\n for (auto\u0026 c : r) c = std::toupper(c);\n return r;\n });\n assert(upper.value() == \"EXAMPLE.COM\");\n\n std::cout \u003c\u003c \"Task 35 passed\\n\";\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"36","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Guard {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Guard(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"enter:\" + name);\n }\n ~Guard() { log-\u003epush_back(\"leave:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e nested_exception_unwind() {\n std::vector\u003cstd::string\u003e log;\n","golden_completion":" try {\n Guard outer(\"outer\", log);\n {\n Guard inner(\"inner\", log);\n log.push_back(\"boom\");\n throw std::string(\"err\");\n }\n } catch (const std::string\u0026 s) {\n log.push_back(\"caught:\" + s);\n }","suffix":"\n return log;\n}\n\nint main() {\n auto log = nested_exception_unwind();\n assert(log.size() == 6);\n assert(log[0] == \"enter:outer\");\n assert(log[1] == \"enter:inner\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"enter:outer\", \"enter:inner\", \"boom\", \"leave:inner\", \"leave:outer\", \"caught:err\"}));\n","category":"syntax_completion"} {"id":"37","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct File {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n File(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"open:\" + name);\n }\n ~File() { log-\u003epush_back(\"close:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e exchange_owner() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto current = std::make_unique\u003cFile\u003e(\"current\", log);\n auto previous = std::exchange(current, std::make_unique\u003cFile\u003e(\"next\", log));\n log.push_back(\"current:\" + current-\u003ename);\n previous.reset();\n log.push_back(\"previous-reset\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = exchange_owner();\n assert(log.size() == 6);\n assert(log[0] == \"open:current\");\n assert(log[1] == \"open:next\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"open:current\", \"open:next\", \"current:next\", \"close:current\", \"previous-reset\", \"close:next\"}));\n","category":"syntax_completion"} {"id":"38","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003ctuple\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n\nstruct Point { double x, y; };\nstruct Color { int r, g, b; };\nstruct Label { std::string text; int priority; };\n\nstruct Marker {\n Point pos;\n Color col;\n Label label;\n};\n\n// Returns a vector of markers, each constructed with nested aggregate init,\n// then uses structured bindings to decompose and sort by priority\nstd::vector\u003cstd::tuple\u003cstd::string, double, double\u003e\u003e extractSorted(\n const std::vector\u003cMarker\u003e\u0026 markers) {\n // Build a vector of (label_text, x, y) tuples, sorted by priority (descending)\n std::vector\u003cstd::tuple\u003cstd::string, double, double\u003e\u003e result;\n for (const auto\u0026 [pos, col, label] : markers) {\n","golden_completion":" const auto\u0026 [x, y] = pos;\n const auto\u0026 [text, priority] = label;\n result.emplace_back(text, x, y);\n }\n std::sort(result.begin(), result.end(), [](const auto\u0026 a, const auto\u0026 b) {\n return std::get\u003c0\u003e(a) \u003e std::get\u003c0\u003e(b);\n });\n return result;\n","suffix":"}\n\nint main() {\n std::vector\u003cMarker\u003e markers = {\n {{1.0, 2.0}, {255, 0, 0}, {\"Alpha\", 3}},\n {{3.0, 4.0}, {0, 255, 0}, {\"Gamma\", 1}},\n {{5.0, 6.0}, {0, 0, 255}, {\"Beta\", 2}},\n };\n\n auto sorted = extractSorted(markers);\n assert(sorted.size() == 3);\n\n // Sorted by label text descending: Gamma \u003e Beta \u003e Alpha\n assert(std::get\u003c0\u003e(sorted[0]) == \"Gamma\");\n assert(std::get\u003c0\u003e(sorted[1]) == \"Beta\");\n assert(std::get\u003c0\u003e(sorted[2]) == \"Alpha\");\n\n // Verify coordinates preserved\n assert(std::get\u003c1\u003e(sorted[0]) == 3.0); // Gamma x\n assert(std::get\u003c2\u003e(sorted[0]) == 4.0); // Gamma y\n\n std::cout \u003c\u003c \"Task 38 passed\\n\";\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"39","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Conn {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Conn(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"connect:\" + name);\n }\n ~Conn() { log-\u003epush_back(\"disconnect:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e conditional_reset(bool keep_second) {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto first = std::make_unique\u003cConn\u003e(\"first\", log);\n auto second = std::make_unique\u003cConn\u003e(\"second\", log);\n if (!keep_second) {\n second.reset();\n log.push_back(\"second-reset\");\n }\n log.push_back(first ? \"first-live\" : \"first-empty\");","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = conditional_reset(false);\n assert(log.size() == 6);\n assert(log[0] == \"connect:first\");\n assert(log[1] == \"connect:second\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"connect:first\", \"connect:second\", \"disconnect:second\", \"second-reset\", \"first-live\", \"disconnect:first\"}));\n auto kept = conditional_reset(true);\n assert(kept[3] == \"disconnect:second\");\n assert(kept[4] == \"disconnect:first\");\n","category":"syntax_completion"} {"id":"40","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ccassert\u003e\n#include \u003ciostream\u003e\n#include \u003cmemory\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cvector\u003e\n\nstruct Unit {\n std::string name;\n std::vector\u003cstd::string\u003e* log;\n Unit(std::string n, std::vector\u003cstd::string\u003e\u0026 l) : name(std::move(n)), log(\u0026l) {\n log-\u003epush_back(\"start:\" + name);\n }\n ~Unit() { log-\u003epush_back(\"stop:\" + name); }\n};\n\nstd::vector\u003cstd::string\u003e pointer_chain() {\n std::vector\u003cstd::string\u003e log;\n {\n","golden_completion":" auto head = std::make_unique\u003cUnit\u003e(\"head\", log);\n auto tail = std::make_unique\u003cUnit\u003e(\"tail\", log);\n std::string observed = tail-\u003ename;\n tail = std::move(head);\n log.push_back(\"observed:\" + observed);\n log.push_back(\"tail-now:\" + tail-\u003ename);","suffix":"\n }\n return log;\n}\n\nint main() {\n auto log = pointer_chain();\n assert(log.size() == 6);\n assert(log[0] == \"start:head\");\n assert(log[1] == \"start:tail\");\n std::cout \u003c\u003c log.back() \u003c\u003c \"\\n\";\n return 0;\n}\n","assertions":" assert((log == std::vector\u003cstd::string\u003e{\"start:head\", \"start:tail\", \"stop:tail\", \"observed:tail\", \"tail-now:head\", \"stop:head\"}));\n","category":"syntax_completion"} {"id":"41","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ctype_traits\u003e\n#include \u003ccassert\u003e\n\n// element_type\u003cT\u003e is a type trait that extracts the element type from\n// container types. For non-container types, it returns the type itself.\n//\n// Supported containers:\n// std::vector\u003cT, Alloc\u003e -\u003e T\n// std::basic_string\u003cC, T, A\u003e -\u003e C (the character type)\n// everything else -\u003e T itself (identity)\n//\n// This is useful for writing generic code that needs to know what a\n// container holds without depending on a specific container type.\n\n// Primary template: non-container types map to themselves\ntemplate \u003ctypename T\u003e\nstruct element_type {\n using type = T; // fallback for non-containers\n};\n\n// Partial specialization for std::vector\n","golden_completion":"template \u003ctypename T, typename Alloc\u003e\nstruct element_type\u003cstd::vector\u003cT, Alloc\u003e\u003e {\n using type = T;\n};\n","suffix":"\n// Partial specialization for std::basic_string\ntemplate \u003ctypename CharT, typename Traits, typename Alloc\u003e\nstruct element_type\u003cstd::basic_string\u003cCharT, Traits, Alloc\u003e\u003e {\n using type = CharT;\n};\n\ntemplate \u003ctypename T\u003e\nusing element_type_t = typename element_type\u003cT\u003e::type;\n\nint main() {\n static_assert(std::is_same_v\u003celement_type_t\u003cint\u003e, int\u003e);\n static_assert(std::is_same_v\u003celement_type_t\u003cstd::vector\u003cdouble\u003e\u003e, double\u003e);\n static_assert(std::is_same_v\u003celement_type_t\u003cstd::vector\u003cstd::string\u003e\u003e, std::string\u003e);\n static_assert(std::is_same_v\u003celement_type_t\u003cstd::string\u003e, char\u003e);\n\n std::cout \u003c\u003c \"All static_asserts passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"42","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003ctype_traits\u003e\n#include \u003ccassert\u003e\n\n// Tag types for dispatching serialization strategy\nstruct as_text {};\nstruct as_binary {};\n\n// Primary trait: default to text serialization\ntemplate \u003ctypename T, typename Enable = void\u003e\nstruct serial_tag { using type = as_text; };\n\n// Specialization: arithmetic types use binary\ntemplate \u003ctypename T\u003e\nstruct serial_tag\u003cT, std::enable_if_t\u003cstd::is_arithmetic_v\u003cT\u003e\u003e\u003e {\n using type = as_binary;\n};\n\n// Tag-dispatched implementations + public serialize() API\n","golden_completion":"template \u003ctypename T\u003e\nstd::string serialize_impl(const T\u0026 val, as_text) {\n return \"text:\" + std::to_string(val);\n}\ntemplate \u003ctypename T\u003e\nstd::string serialize_impl(const T\u0026 val, as_binary) {\n return \"binary:\" + std::to_string(val);\n}\ntemplate \u003ctypename T\u003e\nstd::string serialize(const T\u0026 val) {\n return serialize_impl(val, typename serial_tag\u003cT\u003e::type{});\n}\n","suffix":"\n// Explicit specialization for std::string (text, but different format)\ntemplate \u003c\u003e\nstd::string serialize\u003cstd::string\u003e(const std::string\u0026 val) {\n return \"text:\\\"\" + val + \"\\\"\";\n}\n\nint main() {\n assert(serialize(42) == \"binary:42\");\n assert(serialize(3.14) == \"binary:3.140000\");\n assert(serialize(std::string(\"hello\")) == \"text:\\\"hello\\\"\");\n assert(serialize(\u0027A\u0027) == \"binary:65\");\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"43","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003cutility\u003e\n#include \u003cmemory\u003e\n#include \u003ctype_traits\u003e\n#include \u003ccassert\u003e\n\n// A factory function that:\n// 1. Constructs an object of type T on the heap via perfect forwarding\n// 2. Counts how many of the constructor arguments were rvalue references\n// at the call site, using a fold expression over the parameter pack\n//\n// Returns a pair of (unique_ptr\u003cT\u003e, int rvalue_count).\n//\n// This is useful for debugging move semantics: you can see exactly how\n// many temporaries vs named variables were passed to the constructor.\n\nstruct Widget {\n std::string name;\n int value;\n Widget(std::string n, int v) : name(std::move(n)), value(v) {}\n};\n\ntemplate \u003ctypename T, typename... Args\u003e\nstd::pair\u003cstd::unique_ptr\u003cT\u003e, int\u003e make_counted(Args\u0026\u0026... args) {\n // Count rvalue arguments using fold expression, then forward to make_unique\n","golden_completion":" int rvalue_count = (0 + ... + (!std::is_lvalue_reference_v\u003cArgs\u003e ? 1 : 0));\n auto ptr = std::make_unique\u003cT\u003e(std::forward\u003cArgs\u003e(args)...);\n return {std::move(ptr), rvalue_count};\n","suffix":"}\n\nint main() {\n // Both args are rvalues\n auto [w1, c1] = make_counted\u003cWidget\u003e(std::string(\"alpha\"), 42);\n assert(w1-\u003ename == \"alpha\");\n assert(w1-\u003evalue == 42);\n assert(c1 == 2);\n\n // First arg is lvalue, second is rvalue\n std::string name = \"beta\";\n auto [w2, c2] = make_counted\u003cWidget\u003e(name, 99);\n assert(w2-\u003ename == \"beta\");\n assert(c2 == 1);\n\n // Both args are lvalues\n int val = 7;\n auto [w3, c3] = make_counted\u003cWidget\u003e(name, val);\n assert(c3 == 0);\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"44","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003ccassert\u003e\n\nclass UniqueBuffer {\n std::string label_;\n size_t size_;\npublic:\n UniqueBuffer(std::string label, size_t size)\n : label_(std::move(label)), size_(size) {}\n\n // Move constructor\n UniqueBuffer(UniqueBuffer\u0026\u0026 other) noexcept\n : label_(std::move(other.label_)), size_(other.size_) {\n other.size_ = 0;\n }\n\n // Move assignment\n UniqueBuffer\u0026 operator=(UniqueBuffer\u0026\u0026 other) noexcept {\n label_ = std::move(other.label_);\n size_ = other.size_;\n other.size_ = 0;\n return *this;\n }\n\n // Deleted copy operations\n UniqueBuffer(const UniqueBuffer\u0026) = delete;\n UniqueBuffer\u0026 operator=(const UniqueBuffer\u0026) = delete;\n\n const std::string\u0026 label() const { return label_; }\n size_t size() const { return size_; }\n};\n\nint main() {\n std::vector\u003cUniqueBuffer\u003e buffers;\n\n // Construct elements in-place (cannot copy, must emplace)\n","golden_completion":" buffers.emplace_back(\"alpha\", 1024);\n buffers.emplace_back(\"beta\", 2048);\n buffers.emplace_back(\"gamma\", 4096);\n","suffix":"\n assert(buffers.size() == 3);\n assert(buffers[0].label() == \"alpha\");\n assert(buffers[0].size() == 1024);\n assert(buffers[1].label() == \"beta\");\n assert(buffers[2].size() == 4096);\n\n // Move one buffer out\n UniqueBuffer moved = std::move(buffers[0]);\n assert(moved.label() == \"alpha\");\n assert(moved.size() == 1024);\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"45","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003ccstdint\u003e\n#include \u003ccassert\u003e\n\n// FNV-1a (Fowler-Noll-Vo) hash function for compile-time string hashing.\n//\n// This implements the 32-bit variant of FNV-1a, which is widely used for\n// hash tables, checksums, and compile-time string comparison.\n//\n// Algorithm:\n// 1. Start with the FNV offset basis (2166136261 for 32-bit)\n// 2. For each byte of input:\n// a. XOR the hash with the byte (cast to unsigned char first, then uint32_t)\n// b. Multiply by the FNV prime (16777619 for 32-bit)\n// 3. Return the resulting hash\n//\n// Note: FNV-1a XORs first, then multiplies (unlike FNV-1 which multiplies\n// first). The unsigned char cast is critical for portability — char may be\n// signed, and sign extension would corrupt the hash for high bytes.\n\nconstexpr uint32_t fnv1a_hash(const char* str, size_t len) {\n uint32_t hash = 2166136261u;\n","golden_completion":" for (size_t i = 0; i \u003c len; ++i) {\n hash ^= static_cast\u003cuint32_t\u003e(static_cast\u003cunsigned char\u003e(str[i]));\n hash *= 16777619u;\n }\n return hash;\n","suffix":"}\n\n// Convenience overload for string literals\nconstexpr uint32_t fnv1a_hash(const char* str) {\n size_t len = 0;\n while (str[len]) ++len;\n return fnv1a_hash(str, len);\n}\n\n// Operator for string literal hashing\nconstexpr uint32_t operator\"\"_hash(const char* str, size_t len) {\n return fnv1a_hash(str, len);\n}\n\nint main() {\n // Compile-time checks\n static_assert(fnv1a_hash(\"\") == 2166136261u);\n static_assert(fnv1a_hash(\"a\") == 3826002220u);\n static_assert(\"hello\"_hash == fnv1a_hash(\"hello\"));\n\n // Runtime checks\n constexpr auto h1 = fnv1a_hash(\"test\");\n constexpr auto h2 = fnv1a_hash(\"test\");\n constexpr auto h3 = fnv1a_hash(\"Test\");\n assert(h1 == h2);\n assert(h1 != h3); // case sensitive\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"46","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cvector\u003e\n#include \u003cstring\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n\n// Split a string by a single delimiter character.\n//\n// Semantics (matching Python\u0027s str.split with explicit sep):\n// - Empty tokens between consecutive delimiters ARE preserved\n// - A leading delimiter produces an empty string at the front\n// - A trailing delimiter produces an empty string at the end\n// - An empty input string returns a vector with one empty string\n// - N delimiters in the string produce exactly N+1 tokens\n//\n// Examples:\n// split(\"a,b,c\", \u0027,\u0027) -\u003e {\"a\", \"b\", \"c\"}\n// split(\"a,,b\", \u0027,\u0027) -\u003e {\"a\", \"\", \"b\"}\n// split(\",a\", \u0027,\u0027) -\u003e {\"\", \"a\"}\n// split(\"\", \u0027,\u0027) -\u003e {\"\"}\n\nstd::vector\u003cstd::string\u003e split(const std::string\u0026 s, char delim) {\n std::vector\u003cstd::string\u003e tokens;\n std::string current;\n","golden_completion":" for (char c : s) {\n if (c == delim) {\n tokens.push_back(current);\n current.clear();\n } else {\n current += c;\n }\n }\n tokens.push_back(current);\n","suffix":" return tokens;\n}\n\nint main() {\n auto r1 = split(\"a,b,c\", \u0027,\u0027);\n assert(r1.size() == 3);\n assert(r1[0] == \"a\" \u0026\u0026 r1[1] == \"b\" \u0026\u0026 r1[2] == \"c\");\n\n // Consecutive delimiters produce empty strings\n auto r2 = split(\"a,,b\", \u0027,\u0027);\n assert(r2.size() == 3);\n assert(r2[0] == \"a\" \u0026\u0026 r2[1] == \"\" \u0026\u0026 r2[2] == \"b\");\n\n // Leading delimiter\n auto r3 = split(\",a\", \u0027,\u0027);\n assert(r3.size() == 2);\n assert(r3[0] == \"\" \u0026\u0026 r3[1] == \"a\");\n\n // Empty string\n auto r4 = split(\"\", \u0027,\u0027);\n assert(r4.size() == 1);\n assert(r4[0] == \"\");\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"47","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n#include \u003ccstddef\u003e\n\n// A range class that generates integers [start, start+step, start+2*step, ...)\n// up to (but not including) stop. Similar to Python\u0027s range().\nclass Range {\n int start_, stop_, step_;\npublic:\n Range(int start, int stop, int step) : start_(start), stop_(stop), step_(step) {}\n\n class iterator {\n int current_, step_, stop_;\n public:\n iterator(int current, int step, int stop)\n : current_(current), step_(step), stop_(stop) {}\n\n int operator*() const { return current_; }\n\n iterator\u0026 operator++() {\n current_ += step_;\n return *this;\n }\n\n bool operator!=(const iterator\u0026 other) const {\n","golden_completion":" // For positive step, stop when current \u003e= stop\n // For negative step, stop when current \u003c= stop\n if (step_ \u003e 0) return current_ \u003c other.current_;\n return current_ \u003e other.current_;\n","suffix":" }\n };\n\n iterator begin() const { return iterator(start_, step_, stop_); }\n iterator end() const { return iterator(stop_, step_, stop_); }\n};\n\nint main() {\n // Forward range\n std::vector\u003cint\u003e fwd;\n for (int x : Range(0, 10, 3)) fwd.push_back(x);\n assert((fwd == std::vector\u003cint\u003e{0, 3, 6, 9}));\n\n // Backward range\n std::vector\u003cint\u003e bwd;\n for (int x : Range(10, 0, -2)) bwd.push_back(x);\n assert((bwd == std::vector\u003cint\u003e{10, 8, 6, 4, 2}));\n\n // Single element\n std::vector\u003cint\u003e single;\n for (int x : Range(5, 6, 1)) single.push_back(x);\n assert((single == std::vector\u003cint\u003e{5}));\n\n // Empty range\n std::vector\u003cint\u003e empty;\n for (int x : Range(5, 5, 1)) empty.push_back(x);\n assert(empty.empty());\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"48","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cvector\u003e\n#include \u003cfunctional\u003e\n#include \u003ccassert\u003e\n\n// A lazy pipeline that chains transformations on a vector.\n// Transformations are stored as functions and applied only when evaluate() is called.\n\ntemplate \u003ctypename T\u003e\nclass LazyPipeline {\n std::vector\u003cT\u003e data_;\n std::vector\u003cstd::function\u003cstd::vector\u003cT\u003e(const std::vector\u003cT\u003e\u0026)\u003e\u003e transforms_;\npublic:\n explicit LazyPipeline(std::vector\u003cT\u003e data) : data_(std::move(data)) {}\n\n // Add a mapping transform (applies f to each element)\n LazyPipeline\u0026 map(std::function\u003cT(const T\u0026)\u003e f) {\n transforms_.push_back([f](const std::vector\u003cT\u003e\u0026 v) {\n std::vector\u003cT\u003e result;\n result.reserve(v.size());\n for (const auto\u0026 x : v) result.push_back(f(x));\n return result;\n });\n return *this;\n }\n\n // Add a filter transform (keeps elements where pred is true)\n LazyPipeline\u0026 filter(std::function\u003cbool(const T\u0026)\u003e pred) {\n","golden_completion":" transforms_.push_back([pred](const std::vector\u003cT\u003e\u0026 v) {\n std::vector\u003cT\u003e result;\n for (const auto\u0026 x : v) {\n if (pred(x)) result.push_back(x);\n }\n return result;\n });\n return *this;\n","suffix":" }\n\n // Evaluate all deferred transforms in order\n std::vector\u003cT\u003e evaluate() const {\n std::vector\u003cT\u003e result = data_;\n for (const auto\u0026 transform : transforms_) {\n result = transform(result);\n }\n return result;\n }\n};\n\nint main() {\n LazyPipeline\u003cint\u003e pipeline({1, 2, 3, 4, 5, 6, 7, 8, 9, 10});\n\n auto result = pipeline\n .filter([](const int\u0026 x) { return x % 2 == 0; }) // keep evens\n .map([](const int\u0026 x) { return x * x; }) // square\n .filter([](const int\u0026 x) { return x \u003e 10; }) // keep \u003e 10\n .evaluate();\n\n assert((result == std::vector\u003cint\u003e{16, 36, 64, 100}));\n\n // Verify laziness: build pipeline but don\u0027t evaluate\n LazyPipeline\u003cint\u003e lazy({1, 2, 3});\n lazy.map([](const int\u0026 x) { return x + 100; });\n // data_ should still be {1, 2, 3} — transforms not applied yet\n auto raw = LazyPipeline\u003cint\u003e({1, 2, 3}).evaluate();\n assert((raw == std::vector\u003cint\u003e{1, 2, 3}));\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"49","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cvariant\u003e\n#include \u003cstring\u003e\n#include \u003cvector\u003e\n#include \u003ccassert\u003e\n\n// Shape types for a variant-based hierarchy\nstruct Circle { double radius; };\nstruct Rectangle { double w, h; };\nstruct Triangle { double base, height; };\n\nusing Shape = std::variant\u003cCircle, Rectangle, Triangle\u003e;\n\n// Overload pattern helper (C++17)\ntemplate \u003cclass... Ts\u003e struct overloaded : Ts... { using Ts::operator()...; };\ntemplate \u003cclass... Ts\u003e overloaded(Ts...) -\u003e overloaded\u003cTs...\u003e;\n\n// Compute area using std::visit with overloaded lambdas\ndouble area(const Shape\u0026 s) {\n return std::visit(overloaded{\n","golden_completion":" [](const Circle\u0026 c) -\u003e double { return 3.14159265358979 * c.radius * c.radius; },\n [](const Rectangle\u0026 r) -\u003e double { return r.w * r.h; },\n [](const Triangle\u0026 t) -\u003e double { return 0.5 * t.base * t.height; }\n","suffix":" }, s);\n}\n\n// Describe shape using std::visit with a generic lambda and if constexpr\nstd::string describe(const Shape\u0026 s) {\n return std::visit([](const auto\u0026 shape) -\u003e std::string {\n using T = std::decay_t\u003cdecltype(shape)\u003e;\n if constexpr (std::is_same_v\u003cT, Circle\u003e)\n return \"circle(r=\" + std::to_string(shape.radius) + \")\";\n else if constexpr (std::is_same_v\u003cT, Rectangle\u003e)\n return \"rect(\" + std::to_string(shape.w) + \"x\" + std::to_string(shape.h) + \")\";\n else\n return \"tri(b=\" + std::to_string(shape.base) + \",h=\" + std::to_string(shape.height) + \")\";\n }, s);\n}\n\nint main() {\n Shape c = Circle{5.0};\n Shape r = Rectangle{3.0, 4.0};\n Shape t = Triangle{6.0, 3.0};\n\n assert(area(c) \u003e 78.5 \u0026\u0026 area(c) \u003c 78.6);\n assert(area(r) == 12.0);\n assert(area(t) == 9.0);\n\n assert(describe(c).find(\"circle\") == 0);\n assert(describe(r).find(\"rect\") == 0);\n assert(describe(t).find(\"tri\") == 0);\n\n // Test with a vector of shapes\n std::vector\u003cShape\u003e shapes = {c, r, t};\n double total = 0;\n for (const auto\u0026 s : shapes) total += area(s);\n assert(total \u003e 99.5 \u0026\u0026 total \u003c 99.6);\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"50","testsource":"devbench-syntax-completion","language":"cpp","prefix":"#include \u003ciostream\u003e\n#include \u003cstring\u003e\n#include \u003csstream\u003e\n#include \u003ccassert\u003e\n\n// CRTP (Curiously Recurring Template Pattern) base class.\n//\n// Provides three capabilities via static polymorphism (no virtual functions):\n// 1. clone() - returns a copy of the derived object (correct type, no slicing)\n// 2. describe() - calls Derived::do_describe() to get a string representation\n// 3. equals() - calls Derived::do_equals() for type-safe comparison\n// 4. operator== - friend function that delegates to equals()\n//\n// Derived classes must implement:\n// std::string do_describe() const;\n// bool do_equals(const Derived\u0026 other) const;\n\ntemplate \u003ctypename Derived\u003e\nclass Clonable {\npublic:\n // clone() returns a copy of the derived object by static_cast-ing\n // this to const Derived\u0026 and invoking the copy constructor.\n Derived clone() const {\n return Derived(static_cast\u003cconst Derived\u0026\u003e(*this));\n }\n\n std::string describe() const {\n","golden_completion":" return static_cast\u003cconst Derived*\u003e(this)-\u003edo_describe();\n }\n\n bool equals(const Clonable\u0026 other) const {\n return static_cast\u003cconst Derived*\u003e(this)-\u003edo_equals(\n static_cast\u003cconst Derived\u0026\u003e(other));\n }\n\n friend bool operator==(const Clonable\u0026 a, const Clonable\u0026 b) {\n return a.equals(b);\n","suffix":" }\n};\n\nclass Widget : public Clonable\u003cWidget\u003e {\n std::string name_;\n int id_;\npublic:\n Widget(std::string name, int id) : name_(std::move(name)), id_(id) {}\n std::string do_describe() const {\n return \"Widget(\" + name_ + \",\" + std::to_string(id_) + \")\";\n }\n bool do_equals(const Widget\u0026 other) const {\n return name_ == other.name_ \u0026\u0026 id_ == other.id_;\n }\n const std::string\u0026 name() const { return name_; }\n int id() const { return id_; }\n};\n\nclass Gadget : public Clonable\u003cGadget\u003e {\n double value_;\npublic:\n explicit Gadget(double v) : value_(v) {}\n std::string do_describe() const {\n std::ostringstream oss;\n oss \u003c\u003c \"Gadget(\" \u003c\u003c value_ \u003c\u003c \")\";\n return oss.str();\n }\n bool do_equals(const Gadget\u0026 other) const {\n return value_ == other.value_;\n }\n double value() const { return value_; }\n};\n\nint main() {\n Widget w(\"Alpha\", 1);\n auto w2 = w.clone();\n assert(w2.name() == \"Alpha\" \u0026\u0026 w2.id() == 1);\n assert(w.describe() == \"Widget(Alpha,1)\");\n assert(w == w2);\n\n Widget w3(\"Beta\", 2);\n assert(!(w == w3));\n assert(w3.describe() == \"Widget(Beta,2)\");\n\n Gadget g(3.14);\n auto g2 = g.clone();\n assert(g == g2);\n assert(g.describe() == g2.describe());\n\n Gadget g3(2.71);\n assert(!(g == g3));\n\n std::cout \u003c\u003c \"All assertions passed!\" \u003c\u003c std::endl;\n return 0;\n}\n","assertions":"","category":"syntax_completion"} {"id":"1","testsource":"devbench-api-usage","language":"java","prefix":"import java.security.MessageDigest;\nimport java.math.BigInteger;\n\npublic class AUTask1 {\n public static String sha256Hex(byte[] data) {\n try {\n MessageDigest md = MessageDigest.getInstance(\"SHA-256\");\n md.update(data);\n byte[] digest = md.digest();\n return String.format(\"%064x\", new BigInteger(1, digest));\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n\n","golden_completion":" public static String describeSha256Hex() {\n return \"Computes SHA-256 hash using MessageDigest.getInstance(\\\"SHA-256\\\"). \"\n + \"Feeds input via update(byte[]) then retrieves raw digest with digest(). \"\n + \"Converts to 64-character lowercase hexadecimal string using \"\n + \"BigInteger(1, digest).toString(16) formatted with String.format(\\\"%064x\\\"). \"\n + \"Wraps NoSuchAlgorithmException in RuntimeException.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String hash = sha256Hex(\"hello\".getBytes());\n assert hash.length() == 64 : \"Hash must be 64 hex chars\";\n assert hash.equals(\"2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824\");\n\n String desc = describeSha256Hex();\n assert desc != null \u0026\u0026 !desc.isEmpty() : \"Description must not be empty\";\n assert desc.contains(\"SHA-256\") : \"Must mention SHA-256\";\n assert desc.contains(\"MessageDigest\") : \"Must mention MessageDigest\";\n System.out.println(\"Task 1 PASS\");\n }\n}\n","assertions":"String d = AUTask1.describeSha256Hex().toLowerCase();\nassert d.contains(\"getinstance\") : \"Must mention getInstance\";\nassert d.contains(\"update(byte[])\") || d.contains(\"update(byte\") : \"Must mention update(byte[])\";\nassert d.contains(\"digest()\") : \"Must mention digest()\";\nassert d.contains(\"biginteger\") : \"Must mention BigInteger\";\nassert d.contains(\"064x\") || d.contains(\"zero-pad\") || d.contains(\"0-pad\") : \"Must mention zero-padding format\";\nassert d.contains(\"hexadecimal\") || d.contains(\"hex\") : \"Must mention hex output\";\nassert d.contains(\"nosuchalgorithmexception\") || d.contains(\"runtimeexception\") : \"Must mention exception wrapping\";\nassert d.contains(\"64\") : \"Must mention 64 chars\";\nString h2 = AUTask1.sha256Hex(new byte[0]);\nassert h2.length() == 64;\nassert h2.equals(\"e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855\");\n","category":"api_usage"} {"id":"2","testsource":"devbench-api-usage","language":"java","prefix":"import java.nio.file.*;\nimport java.io.IOException;\nimport java.nio.charset.StandardCharsets;\nimport java.util.List;\n\npublic class AUTask2 {\n public static void writeExclusive(Path path, List\u003cString\u003e lines) throws IOException {\n Files.write(path, lines, StandardCharsets.UTF_8,\n StandardOpenOption.CREATE_NEW,\n StandardOpenOption.WRITE);\n }\n\n","golden_completion":" public static String describeWriteExclusive() {\n return \"Writes lines to path using Files.write(Path, Iterable, Charset, OpenOption...) \"\n + \"with StandardCharsets.UTF_8 encoding. Uses StandardOpenOption.CREATE_NEW to \"\n + \"atomically create a new file, failing with FileAlreadyExistsException if the file \"\n + \"already exists. Also specifies StandardOpenOption.WRITE. Lines are separated by \"\n + \"the platform line separator. Throws IOException on I/O failure.\";\n }\n","suffix":"\n public static void main(String[] args) throws IOException {\n Path tmp = Files.createTempDirectory(\"au2\");\n Path file = tmp.resolve(\"test.txt\");\n writeExclusive(file, List.of(\"hello\", \"world\"));\n assert Files.exists(file);\n List\u003cString\u003e read = Files.readAllLines(file, StandardCharsets.UTF_8);\n assert read.size() == 2 : \"Expected 2 lines\";\n assert read.get(0).equals(\"hello\");\n\n boolean threw = false;\n try { writeExclusive(file, List.of(\"again\")); }\n catch (FileAlreadyExistsException e) { threw = true; }\n assert threw : \"Must throw FileAlreadyExistsException for existing file\";\n\n String desc = describeWriteExclusive();\n assert desc.contains(\"Files.write\") : \"Must mention Files.write\";\n assert desc.contains(\"CREATE_NEW\") : \"Must mention CREATE_NEW\";\n\n Files.deleteIfExists(file);\n Files.deleteIfExists(tmp);\n System.out.println(\"Task 2 PASS\");\n }\n}\n","assertions":"String d = AUTask2.describeWriteExclusive().toLowerCase();\nassert d.contains(\"files.write\") : \"Must mention Files.write\";\nassert d.contains(\"create_new\") : \"Must mention CREATE_NEW\";\nassert d.contains(\"filealreadyexistsexception\") || d.contains(\"already exists\") : \"Must mention FileAlreadyExistsException\";\nassert d.contains(\"utf_8\") || d.contains(\"utf-8\") : \"Must mention UTF-8 charset\";\nassert d.contains(\"standardopenoption\") || d.contains(\"openoption\") : \"Must mention OpenOption\";\nassert d.contains(\"atomically\") || d.contains(\"atomic\") || d.contains(\"exclusive\") : \"Must mention atomic/exclusive creation\";\nassert d.contains(\"ioexception\") || d.contains(\"i/o\") : \"Must mention IOException\";\nassert d.contains(\"line separator\") || d.contains(\"lineseparator\") || d.contains(\"newline\") : \"Must mention line separator\";\n","category":"api_usage"} {"id":"3","testsource":"devbench-api-usage","language":"java","prefix":"import java.time.*;\nimport java.time.format.*;\n\npublic class AUTask3 {\n // Parse a date string strictly: reject invalid dates like Feb 30 or Feb 29\n // on non-leap years. Uses ResolverStyle.STRICT with \u0027uuuu\u0027 year pattern\n // (not \u0027yyyy\u0027 which requires era). Return the parsed LocalDate.\n // If parsing fails, return null.\n public static LocalDate parseStrict(String dateStr) {\n","golden_completion":" try {\n DateTimeFormatter fmt = DateTimeFormatter.ofPattern(\"uuuu-MM-dd\")\n .withResolverStyle(ResolverStyle.STRICT);\n return LocalDate.parse(dateStr, fmt);\n } catch (DateTimeParseException e) {\n return null;\n }\n","suffix":" }\n\n public static void main(String[] args) {\n assert parseStrict(\"2024-02-29\") != null : \"2024 is leap year\";\n assert parseStrict(\"2024-02-29\").equals(LocalDate.of(2024, 2, 29));\n assert parseStrict(\"2023-02-29\") == null : \"2023 is not leap year\";\n assert parseStrict(\"2024-02-30\") == null : \"Feb 30 never valid\";\n assert parseStrict(\"2024-01-15\") != null;\n assert parseStrict(\"2024-01-15\").equals(LocalDate.of(2024, 1, 15));\n System.out.println(\"Task 3 PASS\");\n }\n}\n","assertions":"assert AUTask3.parseStrict(\"2024-04-31\") == null : \"Apr has 30 days\";\nassert AUTask3.parseStrict(\"2024-06-31\") == null : \"Jun has 30 days\";\nassert AUTask3.parseStrict(\"2100-02-29\") == null : \"2100 is not leap (divisible by 100)\";\nassert AUTask3.parseStrict(\"2000-02-29\") != null : \"2000 IS leap (divisible by 400)\";\nassert AUTask3.parseStrict(\"2024-12-31\").equals(java.time.LocalDate.of(2024, 12, 31));\nassert AUTask3.parseStrict(\"garbage\") == null;\nassert AUTask3.parseStrict(\"\") == null;\n","category":"api_usage"} {"id":"4","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.concurrent.ConcurrentHashMap;\nimport java.util.function.BiFunction;\n\npublic class AUTask4 {\n public static ConcurrentHashMap\u003cString, Integer\u003e countWords(String[] words) {\n ConcurrentHashMap\u003cString, Integer\u003e map = new ConcurrentHashMap\u003c\u003e();\n for (String w : words) {\n map.merge(w, 1, Integer::sum);\n }\n return map;\n }\n\n public static ConcurrentHashMap\u003cString, Integer\u003e computeIfPresentDouble(\n ConcurrentHashMap\u003cString, Integer\u003e map, String key) {\n map.computeIfPresent(key, (k, v) -\u003e v * 2);\n return map;\n }\n\n","golden_completion":" public static String describeCountAndCompute() {\n return \"countWords uses ConcurrentHashMap.merge(key, 1, Integer::sum) to atomically \"\n + \"increment word counts. merge() inserts the value 1 if key is absent, or applies \"\n + \"the remapping function Integer::sum to the existing value and 1. If the remapping \"\n + \"function returns null, the entry is removed. \"\n + \"computeIfPresentDouble uses computeIfPresent(key, BiFunction) which atomically \"\n + \"applies the function only if key is already present. If the key is absent, \"\n + \"computeIfPresent is a no-op and returns null. If the BiFunction returns null, \"\n + \"the entry is removed. Both methods are thread-safe without external synchronization.\";\n }\n","suffix":"\n public static void main(String[] args) {\n var counts = countWords(new String[]{\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"});\n assert counts.get(\"a\") == 3;\n assert counts.get(\"b\") == 2;\n assert counts.get(\"c\") == 1;\n\n computeIfPresentDouble(counts, \"a\");\n assert counts.get(\"a\") == 6 : \"a should be doubled to 6\";\n\n computeIfPresentDouble(counts, \"missing\");\n assert !counts.containsKey(\"missing\") : \"missing key should stay absent\";\n\n String desc = describeCountAndCompute();\n assert desc.contains(\"merge\") : \"Must mention merge\";\n assert desc.contains(\"computeIfPresent\") : \"Must mention computeIfPresent\";\n System.out.println(\"Task 4 PASS\");\n }\n}\n","assertions":"String d = AUTask4.describeCountAndCompute().toLowerCase();\nassert d.contains(\"merge(\") || d.contains(\"merge(key\") : \"Must mention merge method call\";\nassert d.contains(\"integer::sum\") || d.contains(\"integer.sum\") : \"Must mention Integer::sum\";\nassert d.contains(\"absent\") : \"Must mention absent key behavior\";\nassert d.contains(\"remapping\") || d.contains(\"remap\") : \"Must mention remapping function\";\nassert d.contains(\"computeifpresent\") : \"Must mention computeIfPresent\";\nassert d.contains(\"no-op\") || d.contains(\"noop\") || d.contains(\"does nothing\") || d.contains(\"returns null\") : \"Must mention no-op for absent keys in computeIfPresent\";\nassert d.contains(\"null\") : \"Must mention null return behavior\";\nassert d.contains(\"thread-safe\") || d.contains(\"atomic\") || d.contains(\"synchronization\") : \"Must mention thread safety\";\nvar m = AUTask4.countWords(new String[]{\"x\"});\nAUTask4.computeIfPresentDouble(m, \"x\");\nassert m.get(\"x\") == 2;\n","category":"api_usage"} {"id":"5","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.*;\n\npublic class AUTask5 {\n public static List\u003cString\u003e wrapUnmodifiable(List\u003cString\u003e source) {\n return Collections.unmodifiableList(source);\n }\n\n public static List\u003cString\u003e snapshot(List\u003cString\u003e source) {\n return List.copyOf(source);\n }\n\n","golden_completion":" public static String describeListWrapping() {\n return \"wrapUnmodifiable returns Collections.unmodifiableList(source), which creates \"\n + \"an unmodifiable view backed by the original list. Mutations to source are \"\n + \"visible through the returned view. Calling add/remove/set on the view throws \"\n + \"UnsupportedOperationException. \"\n + \"snapshot returns List.copyOf(source), which creates an unmodifiable copy. \"\n + \"It copies elements at creation time so later mutations to source are not \"\n + \"reflected. List.copyOf throws NullPointerException if source or any element \"\n + \"is null. The returned list does not permit null elements.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e src = new ArrayList\u003c\u003e(List.of(\"a\", \"b\"));\n List\u003cString\u003e view = wrapUnmodifiable(src);\n List\u003cString\u003e copy = snapshot(src);\n\n src.add(\"c\");\n assert view.size() == 3 : \"View must reflect source mutation\";\n assert copy.size() == 2 : \"Copy must NOT reflect source mutation\";\n\n boolean threw = false;\n try { view.add(\"x\"); } catch (UnsupportedOperationException e) { threw = true; }\n assert threw : \"View must be unmodifiable\";\n\n String desc = describeListWrapping();\n assert desc.contains(\"unmodifiableList\") : \"Must mention unmodifiableList\";\n assert desc.contains(\"List.copyOf\") : \"Must mention List.copyOf\";\n System.out.println(\"Task 5 PASS\");\n }\n}\n","assertions":"String d = AUTask5.describeListWrapping().toLowerCase();\nassert d.contains(\"view\") || d.contains(\"backed\") : \"Must mention view/backed semantics\";\nassert d.contains(\"mutations to source\") || d.contains(\"original list\") : \"Must mention live view semantics\";\nassert d.contains(\"unsupportedoperationexception\") : \"Must mention UnsupportedOperationException\";\nassert d.contains(\"copy\") : \"Must mention copy semantics\";\nassert d.contains(\"null\") : \"Must mention null handling of List.copyOf\";\nassert d.contains(\"nullpointerexception\") || d.contains(\"null element\") || (d.contains(\"null\") \u0026\u0026 d.contains(\"throw\")) : \"Must mention NPE for null elements\";\nassert d.contains(\"not reflect\") || d.contains(\"not visible\") || d.contains(\"independent\") || d.contains(\"snapshot\") || d.contains(\"creation time\") : \"Must mention snapshot/independence\";\nList\u003cString\u003e s2 = new ArrayList\u003c\u003e(java.util.List.of(\"x\"));\nList\u003cString\u003e v2 = AUTask5.wrapUnmodifiable(s2);\ns2.add(\"y\");\nassert v2.size() == 2 : \"View must track source\";\n","category":"api_usage"} {"id":"6","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Base64;\nimport java.nio.charset.StandardCharsets;\n\npublic class AUTask6 {\n // Encode inputBytes using URL-safe Base64 WITHOUT padding.\n // Must use Base64.getUrlEncoder().withoutPadding().\n // URL-safe Base64 uses \u0027-\u0027 and \u0027_\u0027 instead of \u0027+\u0027 and \u0027/\u0027.\n // The result must NOT contain \u0027=\u0027 padding characters.\n public static String urlSafeEncode(byte[] inputBytes) {\n","golden_completion":" return Base64.getUrlEncoder().withoutPadding().encodeToString(inputBytes);\n","suffix":" }\n\n public static void main(String[] args) {\n // Test with bytes that produce \u0027+\u0027 and \u0027/\u0027 in standard Base64\n byte[] testData = {(byte)0xFB, (byte)0xFF, (byte)0xBF};\n String standard = Base64.getEncoder().encodeToString(testData);\n String urlSafe = urlSafeEncode(testData);\n\n assert standard.contains(\"+\") || standard.contains(\"/\") : \"Standard should have + or /\";\n assert !urlSafe.contains(\"+\") : \"URL-safe must not contain +\";\n assert !urlSafe.contains(\"/\") : \"URL-safe must not contain /\";\n assert !urlSafe.contains(\"=\") : \"Must not contain padding\";\n\n // Verify round-trip\n byte[] decoded = Base64.getUrlDecoder().decode(urlSafe);\n assert java.util.Arrays.equals(decoded, testData) : \"Round-trip must match\";\n\n System.out.println(\"Task 6 PASS\");\n }\n}\n","assertions":"// Test that URL-safe chars are used\nbyte[] d1 = {(byte)0x3E, (byte)0xFF, (byte)0x3F};\nString r1 = AUTask6.urlSafeEncode(d1);\nassert !r1.contains(\"+\") \u0026\u0026 !r1.contains(\"/\") \u0026\u0026 !r1.contains(\"=\") : \"Must use URL-safe alphabet without padding\";\n// Verify it decodes correctly\nbyte[] back = java.util.Base64.getUrlDecoder().decode(r1);\nassert java.util.Arrays.equals(back, d1);\n// Edge: empty input\nString empty = AUTask6.urlSafeEncode(new byte[0]);\nassert empty.equals(\"\") : \"Empty input should produce empty string\";\n// Single byte\nString single = AUTask6.urlSafeEncode(new byte[]{(byte)0xFF});\nassert !single.contains(\"=\") : \"No padding for single byte\";\nassert single.equals(\"_w\") : \"0xFF URL-safe no-pad should be _w\";\n","category":"api_usage"} {"id":"7","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.regex.*;\nimport java.util.*;\n\npublic class AUTask7 {\n public static List\u003cString\u003e findMatches(String text, String regex) {\n Pattern p = Pattern.compile(regex,\n Pattern.CASE_INSENSITIVE | Pattern.DOTALL | Pattern.MULTILINE);\n Matcher m = p.matcher(text);\n List\u003cString\u003e results = new ArrayList\u003c\u003e();\n while (m.find()) {\n results.add(m.group());\n }\n return results;\n }\n\n","golden_completion":" public static String describeFindMatches() {\n return \"Compiles regex with Pattern.compile(regex, flags) using bitwise-OR combination \"\n + \"of Pattern.CASE_INSENSITIVE | Pattern.DOTALL | Pattern.MULTILINE. \"\n + \"CASE_INSENSITIVE enables Unicode-unaware case folding (ASCII only unless \"\n + \"UNICODE_CASE is also set). DOTALL makes \u0027.\u0027 match any character including \"\n + \"line terminators (\\\\n, \\\\r). MULTILINE makes \u0027^\u0027 and \u0027$\u0027 match at line \"\n + \"boundaries, not just start/end of entire input. Iterates with Matcher.find() \"\n + \"collecting each group() match into an ArrayList.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e r = findMatches(\"Hello\\nWORLD\\ntest\", \"hello|world|test\");\n assert r.size() == 3 : \"Should find 3 case-insensitive matches, got \" + r.size();\n assert r.contains(\"Hello\");\n assert r.contains(\"WORLD\");\n assert r.contains(\"test\");\n\n // DOTALL: dot matches newline\n List\u003cString\u003e r2 = findMatches(\"ab\\ncd\", \"a.+d\");\n assert r2.size() == 1 : \"DOTALL should let . match newline\";\n\n String desc = describeFindMatches();\n assert desc.contains(\"CASE_INSENSITIVE\") : \"Must mention CASE_INSENSITIVE\";\n assert desc.contains(\"DOTALL\") : \"Must mention DOTALL\";\n System.out.println(\"Task 7 PASS\");\n }\n}\n","assertions":"String d = AUTask7.describeFindMatches().toLowerCase();\nassert d.contains(\"pattern.compile\") : \"Must mention Pattern.compile\";\nassert d.contains(\"bitwise\") || d.contains(\"or\") || d.contains(\"|\") : \"Must mention flag combination\";\nassert d.contains(\"case_insensitive\") : \"Must mention CASE_INSENSITIVE flag\";\nassert d.contains(\"dotall\") : \"Must mention DOTALL flag\";\nassert d.contains(\"multiline\") : \"Must mention MULTILINE flag\";\nassert d.contains(\"line terminator\") || d.contains(\"newline\") || d.contains(\"\\n\") : \"Must mention DOTALL newline behavior\";\nassert d.contains(\"\u0027^\u0027\") || d.contains(\"caret\") || d.contains(\"^ and $\") || d.contains(\"^\") \u0026\u0026 d.contains(\"$\") \u0026\u0026 d.contains(\"line\") : \"Must mention MULTILINE anchor behavior\";\nassert d.contains(\"matcher\") || d.contains(\"find()\") : \"Must mention Matcher.find()\";\nassert d.contains(\"ascii\") || d.contains(\"unicode\") : \"Must mention CASE_INSENSITIVE ASCII-only limitation\";\n// functional test: MULTILINE makes ^ and $ match at line boundaries\nList\u003cString\u003e r3 = AUTask7.findMatches(\"ABC\\ndef\", \"^[a-z]+$\");\nassert r3.size() == 2 : \"MULTILINE + CASE_INSENSITIVE: ^[a-z]+$ should match both ABC and def\";\n","category":"api_usage"} {"id":"8","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Base64;\nimport java.nio.charset.StandardCharsets;\n\npublic class AUTask8 {\n public static String encodeStandard(byte[] data) {\n return Base64.getEncoder().encodeToString(data);\n }\n\n public static String encodeUrlSafe(byte[] data) {\n return Base64.getUrlEncoder().encodeToString(data);\n }\n\n public static String encodeUrlSafeNoPad(byte[] data) {\n return Base64.getUrlEncoder().withoutPadding().encodeToString(data);\n }\n\n","golden_completion":" public static String describeEncoders() {\n return \"encodeStandard uses Base64.getEncoder() which produces RFC 4648 standard \"\n + \"encoding with characters A-Z, a-z, 0-9, \u0027+\u0027, \u0027/\u0027 and \u0027=\u0027 padding. \"\n + \"encodeUrlSafe uses Base64.getUrlEncoder() which replaces \u0027+\u0027 with \u0027-\u0027 and \"\n + \"\u0027/\u0027 with \u0027_\u0027 per RFC 4648 Section 5, but still appends \u0027=\u0027 padding. \"\n + \"encodeUrlSafeNoPad chains withoutPadding() to omit trailing \u0027=\u0027 characters. \"\n + \"All three use encodeToString(byte[]) which returns a String, not byte[]. \"\n + \"Encoding never throws; input byte[] must not be null or NullPointerException is thrown.\";\n }\n","suffix":"\n public static void main(String[] args) {\n // 2 bytes: requires padding, and 0xFB 0xFF produces + and / in standard\n byte[] data = {(byte)0xFB, (byte)0xFF};\n String std = encodeStandard(data);\n String url = encodeUrlSafe(data);\n String urlNoPad = encodeUrlSafeNoPad(data);\n\n assert std.contains(\"+\") || std.contains(\"/\") : \"Standard may have + or /\";\n assert !url.contains(\"+\") \u0026\u0026 !url.contains(\"/\") : \"URL-safe must not have + or /\";\n assert url.endsWith(\"=\") : \"URL-safe with padding should have =\";\n assert !urlNoPad.contains(\"=\") : \"No-pad must not have =\";\n\n String desc = describeEncoders();\n assert desc.contains(\"getEncoder\") : \"Must mention getEncoder\";\n assert desc.contains(\"getUrlEncoder\") : \"Must mention getUrlEncoder\";\n System.out.println(\"Task 8 PASS\");\n }\n}\n","assertions":"String d = AUTask8.describeEncoders().toLowerCase();\nassert d.contains(\"rfc 4648\") || d.contains(\"rfc4648\") : \"Must mention RFC 4648\";\nassert d.contains(\"\u0027+\u0027\") || d.contains(\"plus\") : \"Must mention + character\";\nassert d.contains(\"\u0027/\u0027\") || d.contains(\"slash\") : \"Must mention / character\";\nassert d.contains(\"\u0027-\u0027\") || d.contains(\"minus\") || d.contains(\"hyphen\") : \"Must mention - replacement\";\nassert d.contains(\"\u0027_\u0027\") || d.contains(\"underscore\") : \"Must mention _ replacement\";\nassert d.contains(\"withoutpadding\") || d.contains(\"without padding\") : \"Must mention withoutPadding()\";\nassert d.contains(\"\u0027=\u0027\") || d.contains(\"padding\") : \"Must mention = padding\";\nassert d.contains(\"encodetostring\") : \"Must mention encodeToString\";\nassert d.contains(\"null\") : \"Must mention null handling\";\nbyte[] t = {(byte)0x00};\nString s = AUTask8.encodeStandard(t);\nassert s.equals(\"AA==\") : \"0x00 standard base64 should be AA==\";\nString u = AUTask8.encodeUrlSafeNoPad(t);\nassert u.equals(\"AA\") : \"0x00 url-safe no-pad should be AA\";\n","category":"api_usage"} {"id":"9","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.concurrent.ConcurrentHashMap;\nimport java.util.concurrent.atomic.AtomicInteger;\n\npublic class AUTask9 {\n // Atomically initialize-or-update a running average in a ConcurrentHashMap.\n // Each entry stores a double[] of {sum, count}. Use compute() to atomically\n // update both sum and count. If the key is absent, create new double[]{value, 1}.\n // If present, add value to sum and increment count.\n // Return the new average (sum/count) after the update.\n public static double updateAverage(ConcurrentHashMap\u003cString, double[]\u003e map,\n String key, double value) {\n","golden_completion":" double[][] result = new double[1][];\n map.compute(key, (k, existing) -\u003e {\n if (existing == null) {\n result[0] = new double[]{value, 1};\n } else {\n existing[0] += value;\n existing[1] += 1;\n result[0] = existing;\n }\n return result[0];\n });\n return result[0][0] / result[0][1];\n","suffix":" }\n\n public static void main(String[] args) {\n ConcurrentHashMap\u003cString, double[]\u003e map = new ConcurrentHashMap\u003c\u003e();\n double avg1 = updateAverage(map, \"sensor\", 10.0);\n assert avg1 == 10.0 : \"First value avg should be 10.0, got \" + avg1;\n\n double avg2 = updateAverage(map, \"sensor\", 20.0);\n assert avg2 == 15.0 : \"Avg of 10,20 should be 15.0, got \" + avg2;\n\n double avg3 = updateAverage(map, \"sensor\", 30.0);\n assert avg3 == 20.0 : \"Avg of 10,20,30 should be 20.0, got \" + avg3;\n\n double avg4 = updateAverage(map, \"other\", 5.0);\n assert avg4 == 5.0 : \"New key avg should be 5.0\";\n\n System.out.println(\"Task 9 PASS\");\n }\n}\n","assertions":"var m = new java.util.concurrent.ConcurrentHashMap\u003cString, double[]\u003e();\ndouble r1 = AUTask9.updateAverage(m, \"k\", 100.0);\nassert r1 == 100.0;\ndouble r2 = AUTask9.updateAverage(m, \"k\", 200.0);\nassert r2 == 150.0;\ndouble r3 = AUTask9.updateAverage(m, \"k\", 0.0);\nassert Math.abs(r3 - 100.0) \u003c 0.001 : \"Avg of 100,200,0 should be 100\";\n// Verify the array is actually in the map\nassert m.containsKey(\"k\");\nassert m.get(\"k\")[1] == 3.0 : \"Count should be 3\";\n// New key\ndouble r4 = AUTask9.updateAverage(m, \"z\", -10.0);\nassert r4 == -10.0;\n","category":"api_usage"} {"id":"10","testsource":"devbench-api-usage","language":"java","prefix":"import java.time.*;\nimport java.time.format.*;\n\npublic class AUTask10 {\n public static LocalDate parseSmartDate(String dateStr) {\n DateTimeFormatter fmt = DateTimeFormatter.ofPattern(\"yyyy-MM-dd\")\n .withResolverStyle(ResolverStyle.SMART);\n return LocalDate.parse(dateStr, fmt);\n }\n\n public static LocalDate parseLenientDate(String dateStr) {\n DateTimeFormatter fmt = DateTimeFormatter.ofPattern(\"yyyy-MM-dd\")\n .withResolverStyle(ResolverStyle.LENIENT);\n return LocalDate.parse(dateStr, fmt);\n }\n\n","golden_completion":" public static String describeResolverStyles() {\n return \"parseSmartDate uses ResolverStyle.SMART (the default for ofPattern) which \"\n + \"adjusts invalid day-of-month to the last valid day. For example, June 31 \"\n + \"becomes June 30. February 29 on a non-leap year becomes February 28. \"\n + \"parseLenientDate uses ResolverStyle.LENIENT which overflows fields: June 31 \"\n + \"becomes July 1, and February 30 on a non-leap year becomes March 2. \"\n + \"Both use DateTimeFormatter.ofPattern(\\\"yyyy-MM-dd\\\") with \u0027yyyy\u0027 (year-of-era) \"\n + \"not \u0027uuuu\u0027 (proleptic year). With SMART and LENIENT, \u0027yyyy\u0027 works for positive \"\n + \"years. withResolverStyle returns a new formatter; it does not modify the original.\";\n }\n","suffix":"\n public static void main(String[] args) {\n // SMART: June 31 -\u003e June 30\n LocalDate smart = parseSmartDate(\"2024-06-31\");\n assert smart.equals(LocalDate.of(2024, 6, 30)) : \"SMART: Jun 31 -\u003e Jun 30\";\n\n // LENIENT: June 31 -\u003e July 1\n LocalDate lenient = parseLenientDate(\"2024-06-31\");\n assert lenient.equals(LocalDate.of(2024, 7, 1)) : \"LENIENT: Jun 31 -\u003e Jul 1\";\n\n // SMART: Feb 29 non-leap -\u003e Feb 28\n LocalDate smartFeb = parseSmartDate(\"2023-02-29\");\n assert smartFeb.equals(LocalDate.of(2023, 2, 28)) : \"SMART: Feb 29 non-leap -\u003e Feb 28\";\n\n String desc = describeResolverStyles();\n assert desc.contains(\"SMART\") : \"Must mention SMART\";\n assert desc.contains(\"LENIENT\") : \"Must mention LENIENT\";\n System.out.println(\"Task 10 PASS\");\n }\n}\n","assertions":"String d = AUTask10.describeResolverStyles().toLowerCase();\nassert d.contains(\"resolverstyyle\") || d.contains(\"resolverstyle\") || d.contains(\"smart\") : \"Must reference ResolverStyle\";\nassert d.contains(\"adjusts\") || d.contains(\"last valid day\") || d.contains(\"clamp\") : \"Must describe SMART adjustment behavior\";\nassert d.contains(\"overflow\") || d.contains(\"overflows\") || d.contains(\"rolls over\") : \"Must describe LENIENT overflow behavior\";\nassert d.contains(\"june 31\") || d.contains(\"jun 31\") : \"Must give June 31 example\";\nassert d.contains(\"yyyy\") : \"Must mention yyyy pattern\";\nassert d.contains(\"year-of-era\") || d.contains(\"year of era\") : \"Must explain yyyy is year-of-era\";\nassert d.contains(\"ofpattern\") : \"Must mention ofPattern\";\nassert d.contains(\"new formatter\") || d.contains(\"does not modify\") || d.contains(\"immutable\") : \"Must mention withResolverStyle returns new instance\";\n// Functional: LENIENT Feb 30 non-leap -\u003e March 2\nLocalDate lenFeb = AUTask10.parseLenientDate(\"2023-02-30\");\nassert lenFeb.equals(java.time.LocalDate.of(2023, 3, 2)) : \"LENIENT: Feb 30 non-leap -\u003e Mar 2\";\n","category":"api_usage"} {"id":"11","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Arrays;\nimport java.util.List;\nimport java.util.stream.Collectors;\n\npublic class AUTask11 {\n public static int sumOfSquares(List\u003cInteger\u003e nums) {\n return nums.parallelStream()\n .reduce(0,\n (acc, x) -\u003e acc + x * x,\n (a, b) -\u003e a + b);\n }\n\n","golden_completion":" public static String describeSumOfSquares() {\n return \"Computes sum of squares using parallelStream().reduce(int, IntBinaryOperator, IntBinaryOperator) \"\n + \"with identity 0, accumulator (acc, x) -\u003e acc + x * x, and combiner (a, b) -\u003e a + b. \"\n + \"The identity value 0 is the initial value for each parallel partition. \"\n + \"The combiner merges partial results from parallel partitions via addition. \"\n + \"Uses the three-argument reduce overload which is required for parallel correctness.\";\n }\n","suffix":"\n public static void main(String[] args) {\n assert sumOfSquares(Arrays.asList(1, 2, 3)) == 14 : \"1+4+9=14\";\n assert sumOfSquares(Arrays.asList()) == 0 : \"empty=0\";\n assert sumOfSquares(Arrays.asList(5)) == 25 : \"single=25\";\n String doc = describeSumOfSquares();\n assert doc != null \u0026\u0026 !doc.isEmpty() : \"doc missing\";\n assert doc.contains(\"reduce\") : \"must mention reduce\";\n System.out.println(\"task11 ok\");\n }\n}\n","assertions":"String doc11 = AUTask11.describeSumOfSquares();\nassert doc11.contains(\"parallelStream\") : \"must mention parallelStream\";\nassert doc11.contains(\"identity\") : \"must mention identity value\";\nassert doc11.contains(\"0\") : \"must mention identity is 0\";\nassert doc11.contains(\"accumulator\") : \"must mention accumulator\";\nassert doc11.contains(\"combiner\") : \"must mention combiner\";\nassert doc11.contains(\"three-argument\") || doc11.contains(\"three argument\") || doc11.contains(\"3-argument\") : \"must mention three-argument reduce overload\";\nassert doc11.contains(\"parallel\") : \"must mention parallel\";\n","category":"api_usage"} {"id":"12","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.*;\nimport java.util.stream.Collectors;\n\npublic class AUTask12 {\n public static Map\u003cInteger, Long\u003e countByLength(List\u003cString\u003e words) {\n return words.stream()\n .collect(Collectors.groupingBy(\n String::length,\n Collectors.counting()));\n }\n\n","golden_completion":" public static String describeCountByLength() {\n return \"Groups words by their length using Collectors.groupingBy(String::length, Collectors.counting()). \"\n + \"The classifier function String::length maps each word to its character count. \"\n + \"The downstream collector Collectors.counting() counts elements in each group, \"\n + \"producing a Map\u003cInteger, Long\u003e where keys are lengths and values are occurrence counts. \"\n + \"Empty input returns an empty HashMap. \"\n + \"The two-argument groupingBy uses HashMap as the default map factory.\";\n }\n","suffix":"\n public static void main(String[] args) {\n Map\u003cInteger, Long\u003e r = countByLength(Arrays.asList(\"hi\", \"no\", \"yes\", \"ok\", \"run\"));\n assert r.get(2) == 3L : \"three 2-letter words\";\n assert r.get(3) == 2L : \"two 3-letter words\";\n String doc = describeCountByLength();\n assert doc != null \u0026\u0026 doc.contains(\"groupingBy\");\n System.out.println(\"task12 ok\");\n }\n}\n","assertions":"String doc12 = AUTask12.describeCountByLength();\nassert doc12.contains(\"Collectors.groupingBy\") : \"must name Collectors.groupingBy\";\nassert doc12.contains(\"String::length\") : \"must name classifier String::length\";\nassert doc12.contains(\"Collectors.counting\") : \"must name downstream Collectors.counting\";\nassert doc12.contains(\"Map\u003cInteger, Long\u003e\") || doc12.contains(\"Map\u003cInteger,Long\u003e\") : \"must state return type\";\nassert doc12.contains(\"downstream\") : \"must mention downstream collector concept\";\nassert doc12.contains(\"HashMap\") : \"must mention default HashMap factory\";\nMap\u003cInteger, Long\u003e r12 = AUTask12.countByLength(Collections.emptyList());\nassert r12.isEmpty() : \"empty input produces empty map\";\n","category":"api_usage"} {"id":"13","testsource":"devbench-api-usage","language":"java","prefix":"import java.text.NumberFormat;\nimport java.math.RoundingMode;\nimport java.util.Locale;\n\npublic class AUTask13 {\n public static String formatCurrency(double amount) {\n NumberFormat nf = NumberFormat.getCurrencyInstance(Locale.GERMANY);\n nf.setRoundingMode(RoundingMode.HALF_UP);\n nf.setMinimumFractionDigits(2);\n nf.setMaximumFractionDigits(2);\n return nf.format(amount);\n }\n\n","golden_completion":" public static String describeFormatCurrency() {\n return \"Formats amount as German currency using NumberFormat.getCurrencyInstance(Locale.GERMANY). \"\n + \"Sets RoundingMode.HALF_UP via setRoundingMode to round half-values upward. \"\n + \"Configures exactly 2 fraction digits via setMinimumFractionDigits(2) and setMaximumFractionDigits(2). \"\n + \"Locale.GERMANY uses the euro sign, comma as decimal separator, and period as grouping separator. \"\n + \"The format method returns a String with the locale-specific currency symbol prepended or appended.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String result = formatCurrency(1234.565);\n assert result.contains(\"1.234,57\") || result.contains(\"1234,57\") : \"should round 1234.565 -\u003e ...57: \" + result;\n String doc = describeFormatCurrency();\n assert doc != null \u0026\u0026 doc.contains(\"NumberFormat\");\n System.out.println(\"task13 ok\");\n }\n}\n","assertions":"String doc13 = AUTask13.describeFormatCurrency();\nassert doc13.contains(\"getCurrencyInstance\") : \"must name getCurrencyInstance\";\nassert doc13.contains(\"Locale.GERMANY\") : \"must name Locale.GERMANY\";\nassert doc13.contains(\"RoundingMode.HALF_UP\") : \"must name RoundingMode.HALF_UP\";\nassert doc13.contains(\"setRoundingMode\") : \"must name setRoundingMode\";\nassert doc13.contains(\"setMinimumFractionDigits\") : \"must name setMinimumFractionDigits\";\nassert doc13.contains(\"setMaximumFractionDigits\") : \"must name setMaximumFractionDigits\";\nassert doc13.contains(\"comma\") : \"must mention comma as decimal separator\";\nassert doc13.contains(\"euro\") || doc13.contains(\"EUR\") || doc13.contains(\"€\") : \"must mention euro currency\";\nString r13 = AUTask13.formatCurrency(0.005);\nassert r13.contains(\"0,01\") || r13.contains(\"0,00\") : \"edge case rounding\";\n","category":"api_usage"} {"id":"14","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Arrays;\nimport java.util.Comparator;\n\npublic class AUTask14 {\n public static String[] sortNullsFirst(String[] arr) {\n String[] copy = Arrays.copyOf(arr, arr.length);\n Arrays.sort(copy, Comparator.nullsFirst(Comparator.naturalOrder()));\n return copy;\n }\n\n","golden_completion":" public static String describeSortNullsFirst() {\n return \"Copies the array via Arrays.copyOf(arr, arr.length), then sorts with \"\n + \"Arrays.sort(copy, Comparator.nullsFirst(Comparator.naturalOrder())). \"\n + \"Comparator.nullsFirst wraps Comparator.naturalOrder() so that null elements \"\n + \"are placed before all non-null elements. Non-null elements are compared via \"\n + \"natural ordering (String.compareTo). The sort is stable via TimSort. \"\n + \"The original array is not modified because a defensive copy is created first.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String[] r = sortNullsFirst(new String[]{\"banana\", null, \"apple\"});\n assert r[0] == null : \"null first\";\n assert r[1].equals(\"apple\") : \"then apple\";\n assert r[2].equals(\"banana\") : \"then banana\";\n String doc = describeSortNullsFirst();\n assert doc != null \u0026\u0026 doc.contains(\"nullsFirst\");\n System.out.println(\"task14 ok\");\n }\n}\n","assertions":"String doc14 = AUTask14.describeSortNullsFirst();\nassert doc14.contains(\"Arrays.copyOf\") : \"must name Arrays.copyOf\";\nassert doc14.contains(\"Arrays.sort\") : \"must name Arrays.sort\";\nassert doc14.contains(\"Comparator.nullsFirst\") : \"must name Comparator.nullsFirst\";\nassert doc14.contains(\"Comparator.naturalOrder\") : \"must name Comparator.naturalOrder\";\nassert doc14.contains(\"TimSort\") || doc14.contains(\"stable\") : \"must mention stable sort\";\nassert doc14.contains(\"defensive copy\") || doc14.contains(\"not modified\") : \"must mention defensive copy\";\nString[] r14 = AUTask14.sortNullsFirst(new String[]{null, null, \"a\"});\nassert r14[0] == null \u0026\u0026 r14[1] == null \u0026\u0026 r14[2].equals(\"a\");\n","category":"api_usage"} {"id":"15","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Optional;\nimport java.util.function.Function;\n\npublic class AUTask15 {\n public static Optional\u003cInteger\u003e parseAndDouble(String input) {\n return Optional.ofNullable(input)\n .filter(s -\u003e !s.isEmpty())\n .flatMap(s -\u003e {\n try {\n return Optional.of(Integer.parseInt(s));\n } catch (NumberFormatException e) {\n return Optional.empty();\n }\n })\n .map(n -\u003e n * 2);\n }\n\n","golden_completion":" public static String describeParseAndDouble() {\n return \"Wraps input with Optional.ofNullable(input), filters out empty strings via filter(s -\u003e !s.isEmpty()), \"\n + \"then uses flatMap to parse the string into an integer with Integer.parseInt. \"\n + \"flatMap is used instead of map because the parsing can fail, returning Optional.empty() \"\n + \"for NumberFormatException instead of propagating the exception. \"\n + \"Finally, map(n -\u003e n * 2) doubles the parsed value. \"\n + \"Returns Optional.empty() for null input, empty string, or non-numeric input.\";\n }\n","suffix":"\n public static void main(String[] args) {\n assert parseAndDouble(\"5\").equals(Optional.of(10));\n assert parseAndDouble(null).equals(Optional.empty());\n assert parseAndDouble(\"\").equals(Optional.empty());\n assert parseAndDouble(\"abc\").equals(Optional.empty());\n String doc = describeParseAndDouble();\n assert doc != null \u0026\u0026 doc.contains(\"flatMap\");\n System.out.println(\"task15 ok\");\n }\n}\n","assertions":"String doc15 = AUTask15.describeParseAndDouble();\nassert doc15.contains(\"Optional.ofNullable\") : \"must name Optional.ofNullable\";\nassert doc15.contains(\"filter\") : \"must mention filter step\";\nassert doc15.contains(\"flatMap\") : \"must name flatMap\";\nassert doc15.contains(\"map\") : \"must name map for doubling\";\nassert doc15.contains(\"Integer.parseInt\") : \"must name Integer.parseInt\";\nassert doc15.contains(\"NumberFormatException\") : \"must mention NumberFormatException\";\nassert doc15.contains(\"Optional.empty\") : \"must mention Optional.empty for failures\";\nassert doc15.contains(\"flatMap\") \u0026\u0026 doc15.contains(\"map\") : \"must distinguish flatMap from map\";\nassert AUTask15.parseAndDouble(\"0\").equals(Optional.of(0));\nassert AUTask15.parseAndDouble(\" 5\").equals(Optional.empty());\n","category":"api_usage"} {"id":"16","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Locale;\n\npublic class AUTask16 {\n public static String formatDecimal(double value) {\n return String.format(Locale.US, \"%,.2f\", value);\n }\n\n public static String formatDecimalDE(double value) {\n return String.format(Locale.GERMANY, \"%,.2f\", value);\n }\n\n","golden_completion":" public static String describeFormatDecimal() {\n return \"Formats value using String.format(Locale.US, \\\"%,.2f\\\", value). \"\n + \"The format specifier %,.2f means: comma as grouping separator, \"\n + \"2 decimal places, and floating-point conversion. \"\n + \"With Locale.US: comma groups thousands, period is decimal separator (e.g. 1,234.56). \"\n + \"With Locale.GERMANY: period groups thousands, comma is decimal separator (e.g. 1.234,56). \"\n + \"The Locale parameter controls grouping and decimal separator characters. \"\n + \"Without a Locale argument, String.format uses Locale.getDefault().\";\n }\n","suffix":"\n public static void main(String[] args) {\n assert formatDecimal(1234.5).equals(\"1,234.50\") : formatDecimal(1234.5);\n assert formatDecimalDE(1234.5).equals(\"1.234,50\") : formatDecimalDE(1234.5);\n String doc = describeFormatDecimal();\n assert doc != null \u0026\u0026 doc.contains(\"Locale\");\n System.out.println(\"task16 ok\");\n }\n}\n","assertions":"String doc16 = AUTask16.describeFormatDecimal();\nassert doc16.contains(\"String.format\") : \"must name String.format\";\nassert doc16.contains(\"Locale.US\") : \"must name Locale.US\";\nassert doc16.contains(\"Locale.GERMANY\") : \"must name Locale.GERMANY\";\nassert doc16.contains(\"%,.2f\") || doc16.contains(\"grouping separator\") : \"must describe format specifier\";\nassert doc16.contains(\"comma\") \u0026\u0026 doc16.contains(\"period\") : \"must contrast comma and period roles\";\nassert doc16.contains(\"decimal separator\") : \"must mention decimal separator\";\nassert doc16.contains(\"Locale.getDefault\") : \"must mention default locale fallback\";\nassert AUTask16.formatDecimal(0.0).equals(\"0.00\");\nassert AUTask16.formatDecimalDE(1000000.1).equals(\"1.000.000,10\");\n","category":"api_usage"} {"id":"17","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.*;\n\npublic class AUTask17 {\n public static SortedMap\u003cString, Integer\u003e rangeQuery(\n TreeMap\u003cString, Integer\u003e map, String fromKey, String toKey) {\n return map.subMap(fromKey, toKey);\n }\n\n public static SortedMap\u003cString, Integer\u003e headQuery(\n TreeMap\u003cString, Integer\u003e map, String toKey) {\n return map.headMap(toKey);\n }\n\n public static SortedMap\u003cString, Integer\u003e tailQuery(\n TreeMap\u003cString, Integer\u003e map, String fromKey) {\n return map.tailMap(fromKey);\n }\n\n","golden_completion":" public static String describeRangeQueries() {\n return \"subMap(fromKey, toKey) returns a live view from fromKey (inclusive) to toKey (exclusive). \"\n + \"headMap(toKey) returns a live view of keys strictly less than toKey. \"\n + \"tailMap(fromKey) returns a live view of keys greater than or equal to fromKey. \"\n + \"All three return SortedMap backed views — modifications to the view are reflected in the \"\n + \"original TreeMap and vice versa. \"\n + \"Inserting a key outside the view\u0027s range throws IllegalArgumentException. \"\n + \"Keys are ordered by natural ordering (Comparable) since no custom Comparator is supplied.\";\n }\n","suffix":"\n public static void main(String[] args) {\n TreeMap\u003cString, Integer\u003e m = new TreeMap\u003c\u003e();\n m.put(\"a\", 1); m.put(\"b\", 2); m.put(\"c\", 3); m.put(\"d\", 4);\n\n SortedMap\u003cString, Integer\u003e sub = rangeQuery(m, \"b\", \"d\");\n assert sub.size() == 2 : \"b,c only: \" + sub;\n assert sub.containsKey(\"b\") \u0026\u0026 sub.containsKey(\"c\");\n assert !sub.containsKey(\"d\") : \"toKey exclusive\";\n\n SortedMap\u003cString, Integer\u003e head = headQuery(m, \"c\");\n assert head.size() == 2 : \"a,b only\";\n\n SortedMap\u003cString, Integer\u003e tail = tailQuery(m, \"c\");\n assert tail.size() == 2 : \"c,d only\";\n\n String doc = describeRangeQueries();\n assert doc != null \u0026\u0026 doc.contains(\"subMap\");\n System.out.println(\"task17 ok\");\n }\n}\n","assertions":"String doc17 = AUTask17.describeRangeQueries();\nassert doc17.contains(\"inclusive\") : \"must mention fromKey inclusive\";\nassert doc17.contains(\"exclusive\") : \"must mention toKey exclusive\";\nassert doc17.contains(\"live view\") || doc17.contains(\"backed view\") : \"must mention views are backed/live\";\nassert doc17.contains(\"headMap\") : \"must name headMap\";\nassert doc17.contains(\"tailMap\") : \"must name tailMap\";\nassert doc17.contains(\"subMap\") : \"must name subMap\";\nassert doc17.contains(\"IllegalArgumentException\") : \"must mention out-of-range insert exception\";\nassert doc17.contains(\"natural ordering\") || doc17.contains(\"Comparable\") : \"must mention natural ordering\";\nTreeMap\u003cString, Integer\u003e m17 = new TreeMap\u003c\u003e();\nm17.put(\"x\", 1); m17.put(\"y\", 2); m17.put(\"z\", 3);\nSortedMap\u003cString, Integer\u003e v = AUTask17.rangeQuery(m17, \"x\", \"z\");\nv.put(\"xx\", 99);\nassert m17.containsKey(\"xx\") : \"view must be backed by original map\";\n","category":"api_usage"} {"id":"18","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.*;\n\npublic class AUTask18 {\n","golden_completion":" public static List\u003cString\u003e makeLiveReadOnly(List\u003cString\u003e source) {\n return Collections.unmodifiableList(source);\n }\n\n public static List\u003cString\u003e makeSnapshot(List\u003cString\u003e source) {\n return List.copyOf(source);\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e base = new ArrayList\u003c\u003e(Arrays.asList(\"a\", \"b\"));\n\n // Live view: reflects changes to base\n List\u003cString\u003e live = makeLiveReadOnly(base);\n assert live.size() == 2;\n base.add(\"c\");\n assert live.size() == 3 : \"unmodifiableList is a live view, should see \u0027c\u0027\";\n\n // Snapshot: does not reflect changes\n List\u003cString\u003e snap = makeSnapshot(new ArrayList\u003c\u003e(Arrays.asList(\"x\", \"y\")));\n assert snap.size() == 2;\n\n // Both should reject add\n try { live.add(\"d\"); assert false; } catch (UnsupportedOperationException e) { }\n try { snap.add(\"z\"); assert false; } catch (UnsupportedOperationException e) { }\n\n System.out.println(\"task18 ok\");\n }\n}\n","assertions":"List\u003cString\u003e base18 = new ArrayList\u003c\u003e(Arrays.asList(\"p\", \"q\"));\nList\u003cString\u003e live18 = AUTask18.makeLiveReadOnly(base18);\nbase18.add(\"r\");\nassert live18.contains(\"r\") : \"unmodifiableList must reflect source changes\";\nassert live18.size() == 3;\nList\u003cString\u003e snap18 = AUTask18.makeSnapshot(Arrays.asList(\"a\", \"b\"));\nassert snap18.size() == 2;\ntry { snap18.add(\"c\"); assert false; } catch (UnsupportedOperationException e) { }\ntry { live18.add(\"c\"); assert false; } catch (UnsupportedOperationException e) { }\n","category":"api_usage"} {"id":"19","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.*;\nimport java.util.concurrent.ConcurrentHashMap;\n\npublic class AUTask19 {\n","golden_completion":" public static \u003cK, V\u003e V atomicGetOrCreate(ConcurrentHashMap\u003cK, V\u003e map, K key, java.util.function.Function\u003cK, V\u003e factory) {\n return map.computeIfAbsent(key, factory);\n }\n\n public static \u003cK, V\u003e V nonAtomicGetOrCreate(Map\u003cK, V\u003e map, K key, java.util.function.Function\u003cK, V\u003e factory) {\n V val = map.get(key);\n if (val == null) {\n val = factory.apply(key);\n map.put(key, val);\n }\n return val;\n }\n","suffix":"\n public static void main(String[] args) {\n ConcurrentHashMap\u003cString, List\u003cInteger\u003e\u003e cmap = new ConcurrentHashMap\u003c\u003e();\n\n // computeIfAbsent: mapping function runs at most once per key\n List\u003cInteger\u003e list1 = atomicGetOrCreate(cmap, \"nums\", k -\u003e new ArrayList\u003c\u003e());\n list1.add(1);\n List\u003cInteger\u003e list2 = atomicGetOrCreate(cmap, \"nums\", k -\u003e new ArrayList\u003c\u003e());\n list2.add(2);\n assert list1 == list2 : \"same instance returned\";\n assert list1.size() == 2 : \"both adds visible on same list\";\n\n // Non-atomic version\n Map\u003cString, List\u003cInteger\u003e\u003e hmap = new HashMap\u003c\u003e();\n List\u003cInteger\u003e h1 = nonAtomicGetOrCreate(hmap, \"nums\", k -\u003e new ArrayList\u003c\u003e());\n h1.add(10);\n List\u003cInteger\u003e h2 = nonAtomicGetOrCreate(hmap, \"nums\", k -\u003e new ArrayList\u003c\u003e());\n assert h1 == h2 : \"same instance for single-thread\";\n\n System.out.println(\"task19 ok\");\n }\n}\n","assertions":"ConcurrentHashMap\u003cString, List\u003cInteger\u003e\u003e cm19 = new ConcurrentHashMap\u003c\u003e();\nList\u003cInteger\u003e r19a = AUTask19.atomicGetOrCreate(cm19, \"x\", k -\u003e new ArrayList\u003c\u003e());\nr19a.add(42);\nList\u003cInteger\u003e r19b = AUTask19.atomicGetOrCreate(cm19, \"x\", k -\u003e new ArrayList\u003c\u003e());\nassert r19a == r19b : \"computeIfAbsent must return same instance\";\nassert r19b.contains(42);\nMap\u003cString, List\u003cInteger\u003e\u003e hm19 = new HashMap\u003c\u003e();\nList\u003cInteger\u003e r19c = AUTask19.nonAtomicGetOrCreate(hm19, \"y\", k -\u003e new ArrayList\u003c\u003e());\nr19c.add(7);\nassert hm19.get(\"y\").contains(7);\n","category":"api_usage"} {"id":"20","testsource":"devbench-api-usage","language":"java","prefix":"import java.time.LocalDate;\nimport java.time.format.DateTimeFormatter;\nimport java.time.format.DateTimeParseException;\nimport java.time.format.ResolverStyle;\nimport java.time.chrono.IsoChronology;\n\npublic class AUTask20 {\n","golden_completion":" public static LocalDate parseStrict(String dateStr) {\n DateTimeFormatter formatter = DateTimeFormatter.ofPattern(\"uuuu-MM-dd\")\n .withResolverStyle(ResolverStyle.STRICT)\n .withChronology(IsoChronology.INSTANCE);\n return LocalDate.parse(dateStr, formatter);\n }\n\n public static boolean isValidDate(String dateStr) {\n try {\n parseStrict(dateStr);\n return true;\n } catch (DateTimeParseException e) {\n return false;\n }\n }\n","suffix":"\n public static void main(String[] args) {\n // Valid dates\n assert isValidDate(\"2024-02-29\") : \"2024 is leap year\";\n assert isValidDate(\"2024-01-31\") : \"Jan has 31 days\";\n\n // Invalid dates — STRICT mode rejects these\n assert !isValidDate(\"2023-02-29\") : \"2023 is not leap year\";\n assert !isValidDate(\"2024-04-31\") : \"April has 30 days\";\n assert !isValidDate(\"2024-13-01\") : \"no month 13\";\n\n // Must use uuuu not yyyy for strict mode\n assert isValidDate(\"0001-01-01\") : \"year 1 is valid\";\n\n System.out.println(\"task20 ok\");\n }\n}\n","assertions":"assert AUTask20.isValidDate(\"2000-02-29\") : \"2000 is leap\";\nassert !AUTask20.isValidDate(\"1900-02-29\") : \"1900 is not leap\";\nassert AUTask20.isValidDate(\"2024-12-31\");\nassert !AUTask20.isValidDate(\"2024-06-31\") : \"June has 30 days\";\nassert AUTask20.isValidDate(\"0000-01-01\") : \"year 0 (1 BC) is valid with uuuu\";\nassert !AUTask20.isValidDate(\"2024-02-30\") : \"Feb 30 never valid\";\ntry {\n AUTask20.parseStrict(\"not-a-date\");\n assert false : \"should throw\";\n} catch (DateTimeParseException e) { }\n","category":"api_usage"} {"id":"21","testsource":"devbench-api-usage","language":"java","prefix":"import javax.crypto.Mac;\nimport javax.crypto.spec.SecretKeySpec;\nimport java.util.Base64;\n\npublic class AUTask21 {\n public static String hmacSha256Base64(String message, String secretKey) {\n try {\n SecretKeySpec keySpec = new SecretKeySpec(secretKey.getBytes(\"UTF-8\"), \"HmacSHA256\");\n Mac mac = Mac.getInstance(\"HmacSHA256\");\n mac.init(keySpec);\n byte[] raw = mac.doFinal(message.getBytes(\"UTF-8\"));\n return Base64.getEncoder().encodeToString(raw);\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n\n","golden_completion":" public static String describeHmacSha256Base64() {\n return \"Computes HMAC-SHA256 of the message using javax.crypto.Mac.getInstance(\\\"HmacSHA256\\\"). \"\n + \"The secret key is wrapped in a SecretKeySpec constructed with the algorithm name \\\"HmacSHA256\\\" \"\n + \"and the key bytes obtained via String.getBytes(\\\"UTF-8\\\"). \"\n + \"Mac.init(SecretKeySpec) initializes the MAC, then Mac.doFinal(byte[]) computes the tag. \"\n + \"The raw byte array is encoded to a Base64 string using Base64.getEncoder().encodeToString(byte[]). \"\n + \"Throws RuntimeException wrapping any NoSuchAlgorithmException or InvalidKeyException.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String doc = describeHmacSha256Base64();\n assert doc != null \u0026\u0026 !doc.isEmpty() : \"Doc must not be empty\";\n assert doc.contains(\"Mac\") : \"Must mention Mac\";\n assert doc.contains(\"HmacSHA256\") : \"Must mention HmacSHA256\";\n\n // Functional check\n String result = hmacSha256Base64(\"hello\", \"secret\");\n assert result != null \u0026\u0026 !result.isEmpty() : \"HMAC must produce output\";\n // Same input + key must give same result\n assert result.equals(hmacSha256Base64(\"hello\", \"secret\")) : \"Must be deterministic\";\n System.out.println(\"Task 21 passed\");\n }\n}\n","assertions":"\n String d = describeHmacSha256Base64().toLowerCase();\n assert d.contains(\"secretkeyspec\") : \"Must mention SecretKeySpec\";\n assert d.contains(\"mac.getinstance\") : \"Must mention Mac.getInstance\";\n assert d.contains(\"mac.init\") : \"Must mention Mac.init\";\n assert d.contains(\"dofinal\") : \"Must mention doFinal\";\n assert d.contains(\"base64\") : \"Must mention Base64\";\n assert d.contains(\"encodetostring\") : \"Must mention encodeToString\";\n assert d.contains(\"utf-8\") : \"Must mention UTF-8 encoding\";\n assert d.contains(\"runtimeexception\") : \"Must mention RuntimeException wrapping\";\n","category":"api_usage"} {"id":"22","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.regex.Matcher;\nimport java.util.regex.Pattern;\nimport java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class AUTask22 {\n private static final Pattern LOG_PATTERN = Pattern.compile(\n \"(?\u003ctimestamp\u003e\\\\d{4}-\\\\d{2}-\\\\d{2})\\\\s+(?\u003clevel\u003eWARN|ERROR|INFO)\\\\s+(?\u003cmsg\u003e.+)\",\n Pattern.CASE_INSENSITIVE | Pattern.DOTALL\n );\n\n public static Map\u003cString, String\u003e parseLogEntry(String line) {\n Matcher m = LOG_PATTERN.matcher(line);\n Map\u003cString, String\u003e result = new LinkedHashMap\u003c\u003e();\n if (m.matches()) {\n result.put(\"timestamp\", m.group(\"timestamp\"));\n result.put(\"level\", m.group(\"level\"));\n result.put(\"msg\", m.group(\"msg\"));\n }\n return result;\n }\n\n","golden_completion":" public static String describeParseLogEntry() {\n return \"Parses a log line using Pattern.compile with named capturing groups (?\u003ctimestamp\u003e...), \"\n + \"(?\u003clevel\u003e...), and (?\u003cmsg\u003e...) accessed via Matcher.group(String). \"\n + \"The pattern is compiled with flags Pattern.CASE_INSENSITIVE | Pattern.DOTALL \"\n + \"(bitwise OR of int constants). \"\n + \"Uses Matcher.matches() which requires the ENTIRE input to match the pattern, \"\n + \"unlike Matcher.find() which searches for a subsequence. \"\n + \"Results are stored in a LinkedHashMap to preserve insertion order of timestamp, level, msg.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String doc = describeParseLogEntry();\n assert doc != null : \"Doc must exist\";\n assert doc.contains(\"named\") : \"Must mention named groups\";\n\n Map\u003cString, String\u003e r = parseLogEntry(\"2024-01-15 ERROR something broke\");\n assert \"2024-01-15\".equals(r.get(\"timestamp\")) : \"Wrong timestamp\";\n assert \"ERROR\".equals(r.get(\"level\")) : \"Wrong level\";\n assert \"something broke\".equals(r.get(\"msg\")) : \"Wrong msg\";\n\n // Case insensitive\n Map\u003cString, String\u003e r2 = parseLogEntry(\"2024-01-15 error lower case msg\");\n assert \"error\".equals(r2.get(\"level\")) : \"Case insensitive should work\";\n System.out.println(\"Task 22 passed\");\n }\n}\n","assertions":"\n String d = describeParseLogEntry().toLowerCase();\n assert d.contains(\"pattern.compile\") : \"Must mention Pattern.compile\";\n assert d.contains(\"case_insensitive\") : \"Must mention CASE_INSENSITIVE flag\";\n assert d.contains(\"dotall\") : \"Must mention DOTALL flag\";\n assert d.contains(\"matcher.group(string)\") || d.contains(\"matcher.group(\") : \"Must mention Matcher.group with String name\";\n assert d.contains(\"matcher.matches()\") : \"Must mention matches() not find()\";\n assert d.contains(\"linkedhashmap\") : \"Must mention LinkedHashMap for order preservation\";\n assert d.contains(\"insertion order\") || d.contains(\"preserve\") : \"Must mention order preservation\";\n","category":"api_usage"} {"id":"23","testsource":"devbench-api-usage","language":"java","prefix":"import java.nio.file.*;\nimport java.io.IOException;\n\npublic class AUTask23 {\n public static void atomicReplace(Path source, Path target) throws IOException {\n Files.move(source, target,\n StandardCopyOption.REPLACE_EXISTING,\n StandardCopyOption.ATOMIC_MOVE);\n }\n\n public static void safeCopy(Path source, Path target) throws IOException {\n Files.copy(source, target,\n StandardCopyOption.REPLACE_EXISTING,\n StandardCopyOption.COPY_ATTRIBUTES,\n LinkOption.NOFOLLOW_LINKS);\n }\n\n","golden_completion":" public static String describeFileOps() {\n return \"atomicReplace uses Files.move(Path, Path, CopyOption...) with \"\n + \"StandardCopyOption.REPLACE_EXISTING and StandardCopyOption.ATOMIC_MOVE. \"\n + \"ATOMIC_MOVE guarantees the move is an atomic filesystem operation; \"\n + \"if atomic move is not supported, it throws AtomicMoveNotSupportedException \"\n + \"(a subclass of IOException). \"\n + \"safeCopy uses Files.copy(Path, Path, CopyOption...) with \"\n + \"StandardCopyOption.REPLACE_EXISTING, StandardCopyOption.COPY_ATTRIBUTES, \"\n + \"and LinkOption.NOFOLLOW_LINKS. \"\n + \"COPY_ATTRIBUTES preserves file timestamps (lastModifiedTime, lastAccessTime). \"\n + \"NOFOLLOW_LINKS means symbolic links are not followed; the link itself is copied.\";\n }\n","suffix":"\n public static void main(String[] args) throws IOException {\n String doc = describeFileOps();\n assert doc != null : \"Doc must exist\";\n assert doc.contains(\"ATOMIC_MOVE\") : \"Must mention ATOMIC_MOVE\";\n\n // Functional test\n Path tmp = Files.createTempDirectory(\"au23\");\n Path src = tmp.resolve(\"src.txt\");\n Path dst = tmp.resolve(\"dst.txt\");\n Files.writeString(src, \"hello\");\n atomicReplace(src, dst);\n assert \"hello\".equals(Files.readString(dst)) : \"Move should transfer content\";\n assert !Files.exists(src) : \"Source should not exist after move\";\n\n Path src2 = tmp.resolve(\"src2.txt\");\n Path dst2 = tmp.resolve(\"dst2.txt\");\n Files.writeString(src2, \"world\");\n safeCopy(src2, dst2);\n assert \"world\".equals(Files.readString(dst2)) : \"Copy should transfer content\";\n assert Files.exists(src2) : \"Source should still exist after copy\";\n System.out.println(\"Task 23 passed\");\n }\n}\n","assertions":"\n String d = describeFileOps().toLowerCase();\n assert d.contains(\"files.move\") : \"Must mention Files.move\";\n assert d.contains(\"files.copy\") : \"Must mention Files.copy\";\n assert d.contains(\"atomic_move\") : \"Must mention ATOMIC_MOVE\";\n assert d.contains(\"replace_existing\") : \"Must mention REPLACE_EXISTING\";\n assert d.contains(\"copy_attributes\") : \"Must mention COPY_ATTRIBUTES\";\n assert d.contains(\"nofollow_links\") : \"Must mention NOFOLLOW_LINKS\";\n assert d.contains(\"atomicmovenotsupportedexception\") : \"Must mention AtomicMoveNotSupportedException\";\n assert d.contains(\"timestamps\") || d.contains(\"lastmodifiedtime\") : \"Must mention timestamp preservation\";\n assert d.contains(\"symbolic link\") || d.contains(\"symlink\") : \"Must mention symbolic link behavior\";\n","category":"api_usage"} {"id":"24","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.concurrent.atomic.AtomicReference;\n\npublic class AUTask24 {\n private static final AtomicReference\u003cString\u003e state = new AtomicReference\u003c\u003e(\"INIT\");\n\n public static boolean transitionTo(String expected, String next) {\n return state.compareAndSet(expected, next);\n }\n\n public static String getState() {\n return state.get();\n }\n\n public static void reset() {\n state.set(\"INIT\");\n }\n\n","golden_completion":" public static String describeTransitionTo() {\n return \"Uses AtomicReference.compareAndSet(expectedValue, newValue) for lock-free state transition. \"\n + \"compareAndSet atomically sets the value to newValue if the current value == expectedValue \"\n + \"using reference equality (==), not .equals(). \"\n + \"Returns true if the update succeeded, false if the current value was not == expectedValue. \"\n + \"The AtomicReference is backed by VarHandle with volatile semantics, \"\n + \"ensuring memory visibility across threads without explicit synchronization. \"\n + \"AtomicReference.get() reads the current value with volatile read semantics. \"\n + \"AtomicReference.set(newValue) unconditionally sets the value with volatile write semantics.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String doc = describeTransitionTo();\n assert doc != null : \"Doc must exist\";\n assert doc.contains(\"compareAndSet\") : \"Must mention compareAndSet\";\n\n reset();\n assert \"INIT\".equals(getState()) : \"Should start at INIT\";\n assert transitionTo(\"INIT\", \"RUNNING\") : \"INIT-\u003eRUNNING should succeed\";\n assert \"RUNNING\".equals(getState()) : \"Should be RUNNING\";\n assert !transitionTo(\"INIT\", \"STOPPED\") : \"INIT-\u003eSTOPPED should fail (state is RUNNING)\";\n assert transitionTo(\"RUNNING\", \"STOPPED\") : \"RUNNING-\u003eSTOPPED should succeed\";\n System.out.println(\"Task 24 passed\");\n }\n}\n","assertions":"\n String d = describeTransitionTo().toLowerCase();\n assert d.contains(\"compareandset\") : \"Must mention compareAndSet\";\n assert d.contains(\"lock-free\") || d.contains(\"lock free\") : \"Must mention lock-free\";\n assert d.contains(\"reference equality\") || d.contains(\"==\") : \"Must mention reference equality (==)\";\n assert d.contains(\"volatile\") : \"Must mention volatile semantics\";\n assert d.contains(\"atomically\") : \"Must mention atomic behavior\";\n assert d.contains(\"memory visibility\") || d.contains(\"memory\") : \"Must mention memory visibility\";\n","category":"api_usage"} {"id":"25","testsource":"devbench-api-usage","language":"java","prefix":"import java.time.Duration;\nimport java.time.Period;\nimport java.time.LocalDate;\nimport java.time.LocalTime;\n\npublic class AUTask25 {\n public static long computeOverlap(Duration shift1, Duration shift2, Duration gap) {\n Duration total = shift1.plus(shift2).minus(gap);\n return total.toMinutes();\n }\n\n public static int daysBetween(LocalDate start, int years, int months, int days) {\n Period p = Period.of(years, months, days);\n LocalDate end = start.plus(p);\n return (int)(end.toEpochDay() - start.toEpochDay());\n }\n\n","golden_completion":" public static String describeComputeOverlap() {\n return \"Computes overlap using Duration.plus(Duration) and Duration.minus(Duration), \"\n + \"which return new Duration instances (Duration is immutable). \"\n + \"Duration.toMinutes() truncates toward zero, discarding any seconds/nanos remainder. \"\n + \"Duration is time-based (hours, minutes, seconds, nanos) — not calendar-based. \"\n + \"daysBetween uses Period.of(years, months, days) for calendar-based arithmetic. \"\n + \"Period is added via LocalDate.plus(TemporalAmount), which adjusts year, then month, then day. \"\n + \"Period does NOT normalize across units: Period.of(0, 14, 0) stays as 14 months, not 1 year 2 months.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String doc = describeComputeOverlap();\n assert doc != null : \"Doc must exist\";\n assert doc.contains(\"Duration\") : \"Must mention Duration\";\n\n long overlap = computeOverlap(\n Duration.ofHours(8), Duration.ofHours(6), Duration.ofMinutes(90));\n assert overlap == 750 : \"8h + 6h - 90min = 750 min, got \" + overlap;\n\n int d = daysBetween(LocalDate.of(2024, 1, 31), 0, 1, 0);\n // Jan 31 + 1 month = Feb 29 (2024 is leap year), so 29 days\n assert d == 29 : \"Jan 31 + 1 month in 2024 = 29 days, got \" + d;\n System.out.println(\"Task 25 passed\");\n }\n}\n","assertions":"\n String d = describeComputeOverlap().toLowerCase();\n assert d.contains(\"immutable\") : \"Must mention immutability\";\n assert d.contains(\"tominutes\") || d.contains(\"tominutes()\") : \"Must mention toMinutes\";\n assert d.contains(\"truncate\") || d.contains(\"truncat\") : \"Must mention truncation behavior\";\n assert d.contains(\"period.of\") : \"Must mention Period.of\";\n assert d.contains(\"period\") \u0026\u0026 d.contains(\"duration\") : \"Must contrast Period and Duration\";\n assert d.contains(\"normalize\") || d.contains(\"14 months\") : \"Must mention Period non-normalization\";\n assert d.contains(\"calendar\") : \"Must mention calendar-based vs time-based\";\n","category":"api_usage"} {"id":"26","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.*;\nimport java.util.stream.Collectors;\n\npublic class AUTask26 {\n public static List\u003cString\u003e sortNullsFirst(List\u003cString\u003e items) {\n return items.stream()\n .sorted(Comparator.nullsFirst(Comparator.naturalOrder()))\n .collect(Collectors.toList());\n }\n\n public static List\u003cString\u003e sortNullsLast(List\u003cString\u003e items) {\n return items.stream()\n .sorted(Comparator.nullsLast(Comparator.reverseOrder()))\n .collect(Collectors.toList());\n }\n\n","golden_completion":" public static String describeSortMethods() {\n return \"sortNullsFirst uses Comparator.nullsFirst(Comparator.naturalOrder()). \"\n + \"nullsFirst wraps another Comparator and considers null less than any non-null value. \"\n + \"When both values are null, they are considered equal (returns 0). \"\n + \"When both are non-null, the wrapped Comparator (naturalOrder) determines order. \"\n + \"sortNullsLast uses Comparator.nullsLast(Comparator.reverseOrder()). \"\n + \"nullsLast considers null greater than any non-null value. \"\n + \"The wrapped reverseOrder() sorts non-null elements in descending natural order. \"\n + \"Both methods return a new List via Collectors.toList(), which returns a mutable ArrayList. \"\n + \"The original list is not modified — Stream.sorted() is a stateful intermediate operation \"\n + \"that produces a new sorted stream without altering the source.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String doc = describeSortMethods();\n assert doc != null : \"Doc must exist\";\n assert doc.contains(\"nullsFirst\") : \"Must mention nullsFirst\";\n\n List\u003cString\u003e input = new ArrayList\u003c\u003e(Arrays.asList(\"banana\", null, \"apple\", null, \"cherry\"));\n List\u003cString\u003e nf = sortNullsFirst(input);\n assert nf.get(0) == null : \"First should be null\";\n assert nf.get(1) == null : \"Second should be null\";\n assert \"apple\".equals(nf.get(2)) : \"Then apple\";\n assert \"banana\".equals(nf.get(3)) : \"Then banana\";\n assert \"cherry\".equals(nf.get(4)) : \"Then cherry\";\n\n List\u003cString\u003e nl = sortNullsLast(input);\n assert \"cherry\".equals(nl.get(0)) : \"Reverse: cherry first\";\n assert \"banana\".equals(nl.get(1)) : \"Reverse: then banana\";\n assert \"apple\".equals(nl.get(2)) : \"Reverse: then apple\";\n assert nl.get(3) == null : \"Nulls last\";\n assert nl.get(4) == null : \"Nulls last\";\n System.out.println(\"Task 26 passed\");\n }\n}\n","assertions":"\n String d = describeSortMethods().toLowerCase();\n assert d.contains(\"nullsfirst\") : \"Must mention nullsFirst\";\n assert d.contains(\"nullslast\") : \"Must mention nullsLast\";\n assert d.contains(\"naturalorder\") || d.contains(\"natural order\") : \"Must mention naturalOrder\";\n assert d.contains(\"reverseorder\") || d.contains(\"reverse order\") : \"Must mention reverseOrder\";\n assert d.contains(\"null\") \u0026\u0026 d.contains(\"less than\") : \"Must explain null \u003c non-null for nullsFirst\";\n assert d.contains(\"null\") \u0026\u0026 d.contains(\"greater than\") : \"Must explain null \u003e non-null for nullsLast\";\n assert d.contains(\"mutable\") || d.contains(\"arraylist\") : \"Must mention Collectors.toList returns mutable list\";\n assert d.contains(\"not modified\") || d.contains(\"without altering\") : \"Must mention source not modified\";\n assert d.contains(\"stateful intermediate\") || d.contains(\"new sorted stream\") : \"Must mention Stream.sorted behavior\";\n","category":"api_usage"} {"id":"27","testsource":"devbench-api-usage","language":"java","prefix":"import java.nio.file.*;\nimport java.io.IOException;\nimport java.util.List;\n\npublic class AUTask27 {\n // Write lines to a file that MUST NOT already exist.\n // If the file exists, this method must throw an exception.\n // The file should be created with default permissions.\n public static void writeNewFile(Path path, List\u003cString\u003e lines) throws IOException {\n","golden_completion":" Files.write(path, lines,\n StandardOpenOption.CREATE_NEW,\n StandardOpenOption.WRITE);\n","suffix":" }\n\n // Append lines to an existing file, creating it if needed.\n public static void appendLines(Path path, List\u003cString\u003e lines) throws IOException {\n Files.write(path, lines,\n StandardOpenOption.CREATE,\n StandardOpenOption.APPEND);\n }\n\n public static void main(String[] args) throws IOException {\n Path tmp = Files.createTempDirectory(\"au27\");\n Path f = tmp.resolve(\"test.txt\");\n\n // Should succeed on new file\n writeNewFile(f, List.of(\"line1\", \"line2\"));\n List\u003cString\u003e content = Files.readAllLines(f);\n assert content.size() == 2 : \"Should have 2 lines\";\n assert \"line1\".equals(content.get(0)) : \"First line wrong\";\n\n // Should fail on existing file\n boolean threw = false;\n try {\n writeNewFile(f, List.of(\"line3\"));\n } catch (FileAlreadyExistsException e) {\n threw = true;\n }\n assert threw : \"Must throw FileAlreadyExistsException for existing file\";\n\n // Append should work\n appendLines(f, List.of(\"line3\"));\n content = Files.readAllLines(f);\n assert content.size() == 3 : \"Should have 3 lines after append\";\n System.out.println(\"Task 27 passed\");\n }\n}\n","assertions":"\n try {\n Path tmp2 = Files.createTempDirectory(\"au27h\");\n Path f2 = tmp2.resolve(\"hidden_test.txt\");\n writeNewFile(f2, List.of(\"a\", \"b\", \"c\"));\n assert Files.readAllLines(f2).size() == 3 : \"Must write 3 lines\";\n boolean threw2 = false;\n try { writeNewFile(f2, List.of(\"x\")); }\n catch (java.nio.file.FileAlreadyExistsException e) { threw2 = true; }\n assert threw2 : \"Must throw FileAlreadyExistsException, not silently overwrite\";\n\n Path f3 = tmp2.resolve(\"empty.txt\");\n writeNewFile(f3, List.of());\n assert Files.exists(f3) : \"Empty list should still create file\";\n assert Files.readAllLines(f3).isEmpty() : \"Should be empty\";\n } catch (IOException e) { throw new RuntimeException(e); }\n","category":"api_usage"} {"id":"28","testsource":"devbench-api-usage","language":"java","prefix":"import java.time.LocalDate;\nimport java.time.format.DateTimeFormatter;\nimport java.time.format.DateTimeParseException;\nimport java.time.format.ResolverStyle;\nimport java.time.temporal.ChronoField;\n\npublic class AUTask28 {\n // Parse a date string in \"yyyy-MM-dd\" format with STRICT validation.\n // Must reject invalid dates like Feb 30 or Apr 31.\n // Must use uuuu (year) not yyyy (year-of-era) for strict mode.\n public static LocalDate parseStrict(String dateStr) {\n","golden_completion":" DateTimeFormatter fmt = DateTimeFormatter.ofPattern(\"uuuu-MM-dd\")\n .withResolverStyle(ResolverStyle.STRICT);\n return LocalDate.parse(dateStr, fmt);\n","suffix":" }\n\n public static void main(String[] args) {\n // Valid dates\n LocalDate d1 = parseStrict(\"2024-02-29\");\n assert d1.getYear() == 2024 \u0026\u0026 d1.getMonthValue() == 2 \u0026\u0026 d1.getDayOfMonth() == 29\n : \"Leap day 2024 should parse\";\n\n LocalDate d2 = parseStrict(\"2023-12-31\");\n assert d2.getYear() == 2023 : \"Dec 31 should parse\";\n\n // Invalid: Feb 30 never exists\n boolean threw = false;\n try { parseStrict(\"2024-02-30\"); }\n catch (DateTimeParseException e) { threw = true; }\n assert threw : \"Feb 30 must be rejected in strict mode\";\n\n // Invalid: Feb 29 on non-leap year\n threw = false;\n try { parseStrict(\"2023-02-29\"); }\n catch (DateTimeParseException e) { threw = true; }\n assert threw : \"Feb 29 on non-leap year must be rejected\";\n\n System.out.println(\"Task 28 passed\");\n }\n}\n","assertions":"\n // Apr 31 doesn\u0027t exist\n boolean t1 = false;\n try { parseStrict(\"2024-04-31\"); }\n catch (DateTimeParseException e) { t1 = true; }\n assert t1 : \"Apr 31 must be rejected in strict mode\";\n\n // Jun 31 doesn\u0027t exist\n boolean t2 = false;\n try { parseStrict(\"2024-06-31\"); }\n catch (DateTimeParseException e) { t2 = true; }\n assert t2 : \"Jun 31 must be rejected\";\n\n // Valid edge: Jan 31 should work\n LocalDate jan31 = parseStrict(\"2024-01-31\");\n assert jan31.getDayOfMonth() == 31 : \"Jan 31 should parse\";\n\n // Negative year should also work with uuuu\n LocalDate neg = parseStrict(\"0001-01-01\");\n assert neg.getYear() == 1 : \"Year 1 should parse\";\n","category":"api_usage"} {"id":"29","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Locale;\n\npublic class AUTask29 {\n // Format a double as a price string with exactly 2 decimal places.\n // MUST use Locale.US to ensure \u0027.\u0027 as decimal separator regardless of system locale.\n // MUST use the \u0027$\u0027 prefix.\n // Examples: 1234.5 -\u003e \"$1,234.50\", 0.5 -\u003e \"$0.50\", 1000000 -\u003e \"$1,000,000.00\"\n public static String formatPrice(double amount) {\n","golden_completion":" return String.format(Locale.US, \"$%,.2f\", amount);\n","suffix":" }\n\n // Format with a different locale for comparison\n public static String formatPriceGerman(double amount) {\n return String.format(Locale.GERMANY, \"%,.2f\", amount);\n }\n\n public static void main(String[] args) {\n assert \"$1,234.50\".equals(formatPrice(1234.5)) : \"Basic formatting failed: \" + formatPrice(1234.5);\n assert \"$0.50\".equals(formatPrice(0.5)) : \"Sub-dollar failed: \" + formatPrice(0.5);\n assert \"$1,000,000.00\".equals(formatPrice(1000000)) : \"Millions failed: \" + formatPrice(1000000);\n assert \"$0.00\".equals(formatPrice(0)) : \"Zero failed\";\n\n // German locale uses . for grouping and , for decimal\n String german = formatPriceGerman(1234.5);\n assert german.contains(\",\") : \"German should use , for decimal\";\n\n // Verify US and German differ\n assert !formatPrice(1234.5).equals(\"$\" + formatPriceGerman(1234.5)) : \"US and German must differ\";\n System.out.println(\"Task 29 passed\");\n }\n}\n","assertions":"\n assert \"$-1,234.50\".equals(formatPrice(-1234.5)) : \"Negative number format wrong: \" + formatPrice(-1234.5);\n assert \"$100.00\".equals(formatPrice(100)) : \"No grouping under 1000: \" + formatPrice(100);\n assert \"$10,000.10\".equals(formatPrice(10000.1)) : \"Rounding: \" + formatPrice(10000.1);\n assert \"$0.01\".equals(formatPrice(0.009999)) : \"Rounding down: \" + formatPrice(0.009999);\n assert \"$999,999,999.99\".equals(formatPrice(999999999.99)) : \"Large number: \" + formatPrice(999999999.99);\n","category":"api_usage"} {"id":"30","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.*;\n\npublic class AUTask30 {\n // Return an unmodifiable VIEW of the input list.\n // Changes to the original list MUST be reflected in the returned view.\n public static List\u003cString\u003e liveView(List\u003cString\u003e source) {\n","golden_completion":" return Collections.unmodifiableList(source);\n","suffix":" }\n\n // Return an unmodifiable SNAPSHOT (copy) of the input list.\n // Changes to the original list must NOT affect the returned list.\n public static List\u003cString\u003e snapshot(List\u003cString\u003e source) {\n return List.copyOf(source);\n }\n\n public static void main(String[] args) {\n List\u003cString\u003e original = new ArrayList\u003c\u003e(Arrays.asList(\"a\", \"b\", \"c\"));\n\n List\u003cString\u003e view = liveView(original);\n List\u003cString\u003e snap = snapshot(original);\n\n assert view.size() == 3 : \"View should have 3 elements\";\n assert snap.size() == 3 : \"Snap should have 3 elements\";\n\n // Modify original\n original.add(\"d\");\n\n // View reflects change\n assert view.size() == 4 : \"View must reflect changes to original\";\n assert \"d\".equals(view.get(3)) : \"View must see new element\";\n\n // Snapshot does NOT reflect change\n assert snap.size() == 3 : \"Snapshot must NOT reflect changes\";\n\n // Both should reject modification attempts\n boolean threw1 = false;\n try { view.add(\"x\"); }\n catch (UnsupportedOperationException e) { threw1 = true; }\n assert threw1 : \"View must throw UnsupportedOperationException on add\";\n\n boolean threw2 = false;\n try { snap.add(\"x\"); }\n catch (UnsupportedOperationException e) { threw2 = true; }\n assert threw2 : \"Snapshot must throw UnsupportedOperationException on add\";\n\n System.out.println(\"Task 30 passed\");\n }\n}\n","assertions":"\n List\u003cString\u003e orig2 = new ArrayList\u003c\u003e(Arrays.asList(\"x\", \"y\"));\n List\u003cString\u003e v2 = liveView(orig2);\n assert v2.size() == 2 : \"View size wrong\";\n orig2.add(\"z\");\n assert v2.size() == 3 : \"View must be a LIVE view reflecting original changes\";\n assert \"z\".equals(v2.get(2)) : \"View must see added element\";\n\n orig2.set(0, \"replaced\");\n assert \"replaced\".equals(v2.get(0)) : \"View must see set() changes\";\n\n orig2.remove(0);\n assert v2.size() == 2 : \"View must reflect remove\";\n\n boolean t = false;\n try { v2.set(0, \"fail\"); }\n catch (UnsupportedOperationException e) { t = true; }\n assert t : \"View must be unmodifiable\";\n","category":"api_usage"} {"id":"31","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class AUTask31 {\n\n public static Map\u003cString, Integer\u003e createAccessOrderCache(int capacity) {\n return new LinkedHashMap\u003cString, Integer\u003e(capacity, 0.75f, true) {\n @Override\n protected boolean removeEldestEntry(Map.Entry\u003cString, Integer\u003e eldest) {\n return size() \u003e capacity;\n }\n };\n }\n\n public static String describeAccessOrderCache() {\n","golden_completion":" return \"Creates an LRU cache using LinkedHashMap constructed with \"\n + \"accessOrder=true (the third boolean parameter to the three-arg constructor). \"\n + \"When accessOrder is true, iteration order reflects access order (most-recently \"\n + \"accessed entry last) rather than insertion order. The removeEldestEntry method \"\n + \"is overridden to evict the eldest entry (least-recently accessed) when size \"\n + \"exceeds capacity. Each get() or put() call on an existing key moves that entry \"\n + \"to the tail of the internal doubly-linked list.\";\n","suffix":" }\n\n public static void main(String[] args) {\n Map\u003cString, Integer\u003e cache = createAccessOrderCache(3);\n cache.put(\"a\", 1);\n cache.put(\"b\", 2);\n cache.put(\"c\", 3);\n cache.get(\"a\");\n cache.put(\"d\", 4);\n assert !cache.containsKey(\"b\") : \"b should be evicted as LRU\";\n assert cache.containsKey(\"a\") : \"a was accessed, should survive\";\n\n String doc = describeAccessOrderCache();\n assert doc != null : \"doc must not be null\";\n assert doc.contains(\"accessOrder\") : \"must mention accessOrder parameter\";\n assert doc.contains(\"LinkedHashMap\") : \"must mention LinkedHashMap\";\n }\n}\n","assertions":"String doc = AUTask31.describeAccessOrderCache();\nassert doc.contains(\"accessOrder=true\") || doc.contains(\"accessOrder = true\") : \"Must mention accessOrder=true\";\nassert doc.contains(\"third\") || doc.contains(\"3rd\") || doc.contains(\"boolean parameter\") : \"Must mention it is the third/boolean parameter\";\nassert doc.contains(\"removeEldestEntry\") : \"Must mention removeEldestEntry override\";\nassert doc.contains(\"doubly-linked\") || doc.contains(\"doubly linked\") : \"Must mention the internal doubly-linked list\";\nassert doc.toLowerCase().contains(\"least-recently\") || doc.toLowerCase().contains(\"least recently\") : \"Must mention least-recently accessed eviction\";\nassert doc.toLowerCase().contains(\"tail\") || doc.toLowerCase().contains(\"end\") || doc.toLowerCase().contains(\"last\") : \"Must mention entry moves to tail/end\";\n","category":"api_usage"} {"id":"32","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.PriorityQueue;\nimport java.util.Arrays;\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class AUTask32 {\n\n public static List\u003cString\u003e drainInOrder(PriorityQueue\u003cString\u003e pq) {\n List\u003cString\u003e result = new ArrayList\u003c\u003e();\n while (!pq.isEmpty()) {\n result.add(pq.poll());\n }\n return result;\n }\n\n public static String describePriorityQueueOrdering() {\n","golden_completion":" return \"PriorityQueue is a min-heap backed by an Object[] array. \"\n + \"Elements are ordered by natural ordering (Comparable.compareTo) when no \"\n + \"Comparator is supplied to the constructor. The iterator does NOT return \"\n + \"elements in priority order; only poll() and peek() respect the heap invariant. \"\n + \"offer() and add() run in O(log n) time; peek() and element() run in O(1). \"\n + \"remove(Object) and contains(Object) run in O(n) linear time. \"\n + \"The queue does not permit null elements and is not thread-safe.\";\n","suffix":" }\n\n public static void main(String[] args) {\n PriorityQueue\u003cString\u003e pq = new PriorityQueue\u003c\u003e(Arrays.asList(\"cherry\", \"apple\", \"banana\"));\n List\u003cString\u003e sorted = drainInOrder(pq);\n assert sorted.equals(Arrays.asList(\"apple\", \"banana\", \"cherry\")) : \"Should drain in natural order\";\n\n String doc = describePriorityQueueOrdering();\n assert doc != null;\n assert doc.contains(\"PriorityQueue\") : \"must name PriorityQueue\";\n assert doc.contains(\"poll\") : \"must mention poll\";\n }\n}\n","assertions":"String doc = AUTask32.describePriorityQueueOrdering();\nassert doc.contains(\"min-heap\") : \"Must mention min-heap\";\nassert doc.contains(\"Object[]\") || doc.contains(\"array\") : \"Must mention array backing\";\nassert doc.toLowerCase().contains(\"iterator\") \u0026\u0026 (doc.toLowerCase().contains(\"not\") || doc.toLowerCase().contains(\"does not\")) : \"Must mention iterator does NOT return in priority order\";\nassert doc.contains(\"O(log n)\") || doc.contains(\"O(log(n))\") : \"Must state O(log n) for offer/add\";\nassert doc.contains(\"O(n)\") : \"Must state O(n) for remove/contains\";\nassert doc.contains(\"O(1)\") : \"Must state O(1) for peek\";\nassert doc.toLowerCase().contains(\"null\") \u0026\u0026 (doc.toLowerCase().contains(\"not permit\") || doc.toLowerCase().contains(\"does not allow\") || doc.toLowerCase().contains(\"no null\")) : \"Must mention null prohibition\";\n","category":"api_usage"} {"id":"33","testsource":"devbench-api-usage","language":"java","prefix":"import java.text.Collator;\nimport java.text.CollationKey;\nimport java.util.Arrays;\nimport java.util.Locale;\n\npublic class AUTask33 {\n\n public static String[] sortWithCollator(String[] words, Locale locale, int strength) {\n Collator collator = Collator.getInstance(locale);\n collator.setStrength(strength);\n String[] copy = Arrays.copyOf(words, words.length);\n Arrays.sort(copy, collator);\n return copy;\n }\n\n public static String describeCollatorBehavior() {\n","golden_completion":" return \"Collator.getInstance(Locale) returns a locale-sensitive Collator for \"\n + \"language-appropriate string comparison. setStrength controls comparison granularity: \"\n + \"Collator.PRIMARY ignores case and accents (e and E and \\u00e9 are equal), \"\n + \"Collator.SECONDARY distinguishes accents but ignores case, \"\n + \"Collator.TERTIARY (the default) distinguishes case and accents. \"\n + \"For performance on repeated comparisons, getCollationKey(String) returns a \"\n + \"CollationKey whose compareTo is faster than Collator.compare. \"\n + \"Collator implements Comparator\u003cObject\u003e, so it can be passed directly to Arrays.sort.\";\n","suffix":" }\n\n public static void main(String[] args) {\n String[] words = {\"resume\", \"r\\u00e9sum\\u00e9\", \"Resume\"};\n String[] primary = sortWithCollator(words, Locale.US, Collator.PRIMARY);\n // PRIMARY treats all three as equal, so order is stable (original order)\n assert primary.length == 3;\n\n String doc = describeCollatorBehavior();\n assert doc != null;\n assert doc.contains(\"Collator\") : \"must name Collator\";\n assert doc.contains(\"Locale\") || doc.contains(\"locale\") : \"must mention locale\";\n }\n}\n","assertions":"String doc = AUTask33.describeCollatorBehavior();\nassert doc.contains(\"PRIMARY\") : \"Must mention Collator.PRIMARY\";\nassert doc.contains(\"SECONDARY\") : \"Must mention Collator.SECONDARY\";\nassert doc.contains(\"TERTIARY\") : \"Must mention Collator.TERTIARY\";\nassert doc.toLowerCase().contains(\"default\") \u0026\u0026 doc.contains(\"TERTIARY\") : \"Must state TERTIARY is the default\";\nassert doc.contains(\"CollationKey\") : \"Must mention CollationKey for performance\";\nassert doc.contains(\"getCollationKey\") : \"Must mention getCollationKey method\";\nassert doc.contains(\"Comparator\") : \"Must mention Collator implements Comparator\";\nassert doc.contains(\"Arrays.sort\") : \"Must mention usability with Arrays.sort\";\n","category":"api_usage"} {"id":"34","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.zip.Deflater;\nimport java.util.zip.Inflater;\nimport java.util.Arrays;\n\npublic class AUTask34 {\n\n public static byte[] compressBytes(byte[] input) {\n Deflater deflater = new Deflater(Deflater.BEST_COMPRESSION, true);\n deflater.setInput(input);\n deflater.finish();\n byte[] buffer = new byte[input.length + 64];\n int len = deflater.deflate(buffer);\n deflater.end();\n return Arrays.copyOf(buffer, len);\n }\n\n public static byte[] decompressBytes(byte[] compressed, int expectedLen) throws Exception {\n Inflater inflater = new Inflater(true);\n inflater.setInput(compressed);\n byte[] buffer = new byte[expectedLen];\n int len = inflater.inflate(buffer);\n inflater.end();\n return Arrays.copyOf(buffer, len);\n }\n\n public static String describeDeflaterInflater() {\n","golden_completion":" return \"Deflater performs DEFLATE compression (RFC 1951). The constructor \"\n + \"Deflater(int level, boolean nowrap) accepts a compression level (0-9 or \"\n + \"Deflater.BEST_COMPRESSION=9) and a nowrap flag; when nowrap=true, raw DEFLATE \"\n + \"is produced without zlib header/trailer (no Adler-32 checksum). \"\n + \"setInput(byte[]) supplies uncompressed data; finish() signals end of input; \"\n + \"deflate(byte[]) writes compressed bytes into the output buffer and returns \"\n + \"the number of bytes written. end() releases native resources (JNI). \"\n + \"Inflater(boolean nowrap) must use the same nowrap setting as the Deflater. \"\n + \"inflate(byte[]) returns the number of bytes decompressed into the buffer.\";\n","suffix":" }\n\n public static void main(String[] args) throws Exception {\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i \u003c 20; i++) sb.append(\"Hello, DEFLATE compression world! \");\n byte[] original = sb.toString().getBytes();\n byte[] compressed = compressBytes(original);\n assert compressed.length \u003c original.length : \"Should compress\";\n byte[] restored = decompressBytes(compressed, original.length);\n assert Arrays.equals(original, restored) : \"Round-trip must match\";\n\n String doc = describeDeflaterInflater();\n assert doc != null;\n assert doc.contains(\"Deflater\") : \"must mention Deflater\";\n assert doc.contains(\"Inflater\") : \"must mention Inflater\";\n }\n}\n","assertions":"String doc = AUTask34.describeDeflaterInflater();\nassert doc.contains(\"RFC 1951\") || doc.contains(\"DEFLATE\") : \"Must mention DEFLATE or RFC 1951\";\nassert doc.contains(\"nowrap\") : \"Must mention nowrap parameter\";\nassert doc.toLowerCase().contains(\"zlib\") || doc.toLowerCase().contains(\"header\") : \"Must mention zlib header behavior\";\nassert doc.contains(\"end()\") : \"Must mention end() releasing resources\";\nassert doc.toLowerCase().contains(\"native\") || doc.toLowerCase().contains(\"jni\") : \"Must mention native/JNI resource release\";\nassert doc.contains(\"finish()\") : \"Must mention finish() to signal end of input\";\nassert doc.contains(\"setInput\") : \"Must mention setInput method\";\nassert doc.contains(\"BEST_COMPRESSION\") || doc.contains(\"level\") : \"Must mention compression level\";\n","category":"api_usage"} {"id":"35","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.ServiceLoader;\nimport java.util.Iterator;\nimport java.util.stream.Collectors;\nimport java.nio.charset.spi.CharsetProvider;\nimport java.nio.charset.Charset;\nimport java.util.List;\nimport java.util.ArrayList;\n\npublic class AUTask35 {\n\n public static List\u003cString\u003e listCharsetProviders() {\n ServiceLoader\u003cCharsetProvider\u003e loader = ServiceLoader.load(CharsetProvider.class);\n List\u003cString\u003e names = new ArrayList\u003c\u003e();\n for (CharsetProvider provider : loader) {\n Iterator\u003cCharset\u003e it = provider.charsets();\n while (it.hasNext()) {\n names.add(it.next().name());\n }\n }\n return names;\n }\n\n public static String describeServiceLoader() {\n","golden_completion":" return \"ServiceLoader.load(Class\u003cS\u003e) discovers and lazily instantiates service \"\n + \"providers using the context class loader (Thread.currentThread().getContextClassLoader()). \"\n + \"Providers are declared in META-INF/services/\u003cfully-qualified-interface-name\u003e files \"\n + \"or via \u0027provides ... with ...\u0027 in module-info.java for JPMS modules. \"\n + \"The iterator lazily instantiates each provider via its no-arg constructor on \"\n + \"next() calls; providers are cached after first full iteration — call reload() \"\n + \"to clear the cache and re-discover providers. ServiceLoader implements Iterable\u003cS\u003e \"\n + \"and the stream() method returns a Stream\u003cServiceLoader.Provider\u003cS\u003e\u003e for \"\n + \"lazy inspection without instantiation.\";\n","suffix":" }\n\n public static void main(String[] args) {\n // Just test the description function, not the actual service loading\n String doc = describeServiceLoader();\n assert doc != null;\n assert doc.contains(\"ServiceLoader\") : \"must name ServiceLoader\";\n assert doc.contains(\"META-INF\") : \"must mention META-INF\";\n }\n}\n","assertions":"String doc = AUTask35.describeServiceLoader();\nassert doc.contains(\"META-INF/services\") : \"Must mention META-INF/services directory\";\nassert doc.contains(\"module-info\") || doc.contains(\"JPMS\") : \"Must mention JPMS module support\";\nassert doc.contains(\"reload()\") : \"Must mention reload() method to clear cache\";\nassert doc.toLowerCase().contains(\"lazily\") || doc.toLowerCase().contains(\"lazy\") : \"Must mention lazy instantiation\";\nassert doc.contains(\"no-arg\") || doc.contains(\"no arg\") || doc.contains(\"zero-arg\") : \"Must mention no-arg constructor requirement\";\nassert doc.toLowerCase().contains(\"cached\") || doc.toLowerCase().contains(\"cache\") : \"Must mention caching after iteration\";\nassert doc.contains(\"stream()\") || doc.contains(\"Stream\u003c\") : \"Must mention stream() method\";\nassert doc.contains(\"Provider\u003c\") || doc.contains(\"ServiceLoader.Provider\") : \"Must mention Provider inner type\";\n","category":"api_usage"} {"id":"36","testsource":"devbench-api-usage","language":"java","prefix":"import java.beans.PropertyChangeSupport;\nimport java.beans.PropertyChangeListener;\nimport java.beans.PropertyChangeEvent;\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class AUTask36 {\n\n private final PropertyChangeSupport pcs;\n private String name;\n private int value;\n\n public AUTask36() {\n this.pcs = new PropertyChangeSupport(this);\n this.name = \"\";\n this.value = 0;\n }\n\n public void addPropertyChangeListener(PropertyChangeListener listener) {\n pcs.addPropertyChangeListener(listener);\n }\n\n public void addPropertyChangeListener(String propertyName, PropertyChangeListener listener) {\n pcs.addPropertyChangeListener(propertyName, listener);\n }\n\n public void setName(String newName) {\n String old = this.name;\n this.name = newName;\n pcs.firePropertyChange(\"name\", old, newName);\n }\n\n public void setValue(int newValue) {\n int old = this.value;\n this.value = newValue;\n pcs.firePropertyChange(\"value\", old, newValue);\n }\n\n public static String describePropertyChangeSupport() {\n","golden_completion":" return \"PropertyChangeSupport manages a list of PropertyChangeListeners and fires \"\n + \"PropertyChangeEvents via firePropertyChange(String, Object, Object). The constructor \"\n + \"takes a sourceBean Object used as the source in fired events. \"\n + \"Listeners can be registered globally via addPropertyChangeListener(PropertyChangeListener) \"\n + \"or per-property via addPropertyChangeListener(String, PropertyChangeListener). \"\n + \"firePropertyChange is a no-op when oldValue and newValue are equal (using equals()), \"\n + \"so no event is fired for unchanged properties. \"\n + \"All listener methods are called on the thread that invokes firePropertyChange — \"\n + \"PropertyChangeSupport is thread-safe (uses synchronized internally) but listener \"\n + \"callbacks execute synchronously on the calling thread.\";\n","suffix":" }\n\n public static void main(String[] args) {\n AUTask36 bean = new AUTask36();\n List\u003cString\u003e events = new ArrayList\u003c\u003e();\n bean.addPropertyChangeListener(\"name\", evt -\u003e events.add(\"name:\" + evt.getNewValue()));\n bean.setName(\"Alice\");\n bean.setName(\"Alice\"); // same value, no event fired\n bean.setName(\"Bob\");\n assert events.size() == 2 : \"Expected 2 name events, got \" + events.size();\n assert events.get(0).equals(\"name:Alice\");\n assert events.get(1).equals(\"name:Bob\");\n\n String doc = describePropertyChangeSupport();\n assert doc != null;\n assert doc.contains(\"PropertyChangeSupport\");\n }\n}\n","assertions":"String doc = AUTask36.describePropertyChangeSupport();\nassert doc.contains(\"firePropertyChange\") : \"Must mention firePropertyChange method\";\nassert doc.contains(\"sourceBean\") || doc.contains(\"source bean\") || (doc.contains(\"source\") \u0026\u0026 doc.contains(\"constructor\")) : \"Must mention sourceBean in constructor\";\nassert doc.toLowerCase().contains(\"no-op\") || doc.toLowerCase().contains(\"no event\") || doc.toLowerCase().contains(\"not fired\") : \"Must mention no-op when old equals new\";\nassert doc.toLowerCase().contains(\"equals()\") || doc.toLowerCase().contains(\"equal\") : \"Must mention equals-based comparison\";\nassert doc.toLowerCase().contains(\"thread-safe\") || doc.toLowerCase().contains(\"synchronized\") : \"Must mention thread safety\";\nassert doc.toLowerCase().contains(\"synchronously\") || doc.toLowerCase().contains(\"calling thread\") : \"Must mention synchronous callback execution\";\nassert doc.contains(\"addPropertyChangeListener\") : \"Must mention addPropertyChangeListener method\";\nassert doc.toLowerCase().contains(\"per-property\") || doc.toLowerCase().contains(\"per property\") || doc.contains(\"String, PropertyChangeListener\") : \"Must mention per-property listener registration\";\n","category":"api_usage"} {"id":"37","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\n\npublic class AUTask37 {\n\n public static List\u003cString\u003e createLiveUnmodifiableView(List\u003cString\u003e source) {\n","golden_completion":" return Collections.unmodifiableList(source);\n","suffix":" }\n\n public static List\u003cString\u003e createSnapshot(List\u003cString\u003e source) {\n return List.copyOf(source);\n }\n\n public static void main(String[] args) {\n List\u003cString\u003e source = new ArrayList\u003c\u003e(List.of(\"a\", \"b\", \"c\"));\n\n List\u003cString\u003e view = createLiveUnmodifiableView(source);\n List\u003cString\u003e snapshot = createSnapshot(source);\n\n assert view.size() == 3;\n assert snapshot.size() == 3;\n\n // Modify the source\n source.add(\"d\");\n\n // The LIVE view sees the change\n assert view.size() == 4 : \"unmodifiableList is a live view, must see new element\";\n assert view.contains(\"d\") : \"live view must contain \u0027d\u0027\";\n\n // The snapshot does NOT see the change\n assert snapshot.size() == 3 : \"List.copyOf is a snapshot, must not see new element\";\n assert !snapshot.contains(\"d\") : \"snapshot must not contain \u0027d\u0027\";\n\n // Both must reject mutation\n try {\n view.add(\"e\");\n assert false : \"view must throw UnsupportedOperationException\";\n } catch (UnsupportedOperationException e) { /* expected */ }\n }\n}\n","assertions":"java.util.List\u003cString\u003e src = new java.util.ArrayList\u003c\u003e(java.util.List.of(\"x\", \"y\"));\njava.util.List\u003cString\u003e v = AUTask37.createLiveUnmodifiableView(src);\nassert v.size() == 2;\nsrc.add(\"z\");\nassert v.size() == 3 : \"Must be a live view (Collections.unmodifiableList), not a copy\";\nassert v.contains(\"z\") : \"Live view must reflect source mutations\";\ntry { v.add(\"w\"); assert false; } catch (UnsupportedOperationException e) { /* ok */ }\n","category":"api_usage"} {"id":"38","testsource":"devbench-api-usage","language":"java","prefix":"import java.time.LocalDate;\nimport java.time.format.DateTimeFormatter;\nimport java.time.format.DateTimeFormatterBuilder;\nimport java.time.format.ResolverStyle;\nimport java.time.temporal.ChronoField;\nimport java.time.format.DateTimeParseException;\n\npublic class AUTask38 {\n\n public static LocalDate parseStrictDate(String dateStr) {\n","golden_completion":" DateTimeFormatter fmt = new DateTimeFormatterBuilder()\n .appendValue(ChronoField.YEAR)\n .appendLiteral(\u0027-\u0027)\n .appendValue(ChronoField.MONTH_OF_YEAR)\n .appendLiteral(\u0027-\u0027)\n .appendValue(ChronoField.DAY_OF_MONTH)\n .toFormatter()\n .withResolverStyle(ResolverStyle.STRICT);\n return LocalDate.parse(dateStr, fmt);\n","suffix":" }\n\n public static void main(String[] args) {\n // Valid date\n LocalDate valid = parseStrictDate(\"2024-2-29\");\n assert valid.getYear() == 2024 : \"2024 is a leap year\";\n assert valid.getMonthValue() == 2;\n assert valid.getDayOfMonth() == 29;\n\n // STRICT mode rejects Feb 29 on non-leap year\n try {\n parseStrictDate(\"2023-2-29\");\n assert false : \"2023-02-29 must fail in STRICT mode\";\n } catch (DateTimeParseException e) {\n // expected\n }\n\n // STRICT mode rejects day 0\n try {\n parseStrictDate(\"2024-1-0\");\n assert false : \"Day 0 must fail in STRICT mode\";\n } catch (DateTimeParseException e) {\n // expected\n }\n }\n}\n","assertions":"// Verify strict parsing works for valid dates\njava.time.LocalDate d = AUTask38.parseStrictDate(\"2020-2-29\");\nassert d.getYear() == 2020 \u0026\u0026 d.getMonthValue() == 2 \u0026\u0026 d.getDayOfMonth() == 29;\n\n// Verify strict mode rejects invalid dates\nboolean rejected = false;\ntry { AUTask38.parseStrictDate(\"2019-2-29\"); } catch (java.time.format.DateTimeParseException e) { rejected = true; }\nassert rejected : \"STRICT mode must reject Feb 29 on non-leap year\";\n\nboolean rejected2 = false;\ntry { AUTask38.parseStrictDate(\"2024-6-31\"); } catch (java.time.format.DateTimeParseException e) { rejected2 = true; }\nassert rejected2 : \"STRICT mode must reject June 31\";\n\n// SMART mode (default) would adjust June 31 -\u003e June 30. STRICT must not.\n","category":"api_usage"} {"id":"39","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.concurrent.ConcurrentHashMap;\n\npublic class AUTask39 {\n\n public static ConcurrentHashMap\u003cString, Integer\u003e buildWordCounts(String[] words) {\n ConcurrentHashMap\u003cString, Integer\u003e map = new ConcurrentHashMap\u003c\u003e();\n for (String word : words) {\n","golden_completion":" map.merge(word, 1, Integer::sum);\n","suffix":" }\n return map;\n }\n\n public static ConcurrentHashMap\u003cString, Integer\u003e removeIfBelowThreshold(\n ConcurrentHashMap\u003cString, Integer\u003e map, int threshold) {\n // compute returns null -\u003e entry is removed\n for (String key : map.keySet()) {\n map.compute(key, (k, v) -\u003e (v != null \u0026\u0026 v \u003e= threshold) ? v : null);\n }\n return map;\n }\n\n public static void main(String[] args) {\n String[] words = {\"hello\", \"world\", \"hello\", \"hello\", \"world\"};\n ConcurrentHashMap\u003cString, Integer\u003e counts = buildWordCounts(words);\n assert counts.get(\"hello\") == 3 : \"hello count should be 3\";\n assert counts.get(\"world\") == 2 : \"world count should be 2\";\n\n removeIfBelowThreshold(counts, 3);\n assert counts.containsKey(\"hello\") : \"hello count 3 \u003e= threshold 3\";\n assert !counts.containsKey(\"world\") : \"world count 2 \u003c threshold 3, should be removed\";\n }\n}\n","assertions":"ConcurrentHashMap\u003cString, Integer\u003e m = AUTask39.buildWordCounts(new String[]{\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"});\nassert m.get(\"a\") == 3 : \"a should be 3\";\nassert m.get(\"b\") == 2 : \"b should be 2\";\nassert m.get(\"c\") == 1 : \"c should be 1\";\n\n// Verify atomic merge semantics — should not lose counts\nConcurrentHashMap\u003cString, Integer\u003e m2 = AUTask39.buildWordCounts(new String[]{\"x\"});\nassert m2.get(\"x\") == 1;\nConcurrentHashMap\u003cString, Integer\u003e m3 = AUTask39.buildWordCounts(new String[]{});\nassert m3.isEmpty();\n\n// Test removeIfBelowThreshold\nm = AUTask39.removeIfBelowThreshold(m, 2);\nassert m.containsKey(\"a\") : \"a=3 \u003e= 2\";\nassert m.containsKey(\"b\") : \"b=2 \u003e= 2\";\nassert !m.containsKey(\"c\") : \"c=1 \u003c 2, must be removed via compute returning null\";\n","category":"api_usage"} {"id":"40","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Base64;\nimport java.nio.charset.StandardCharsets;\n\npublic class AUTask40 {\n\n public static String encodeUrlSafeNoPadding(byte[] data) {\n","golden_completion":" return Base64.getUrlEncoder().withoutPadding().encodeToString(data);\n","suffix":" }\n\n public static byte[] decodeUrlSafe(String encoded) {\n return Base64.getUrlDecoder().decode(encoded);\n }\n\n public static void main(String[] args) {\n byte[] data = {(byte)0xFB, (byte)0xFF, (byte)0xFE};\n String encoded = encodeUrlSafeNoPadding(data);\n\n // URL-safe uses - instead of + and _ instead of /\n assert !encoded.contains(\"+\") : \"URL-safe must not contain +\";\n assert !encoded.contains(\"/\") : \"URL-safe must not contain /\";\n assert !encoded.contains(\"=\") : \"withoutPadding must not contain =\";\n\n // Standard Base64 of the same data WOULD contain + or /\n String standard = Base64.getEncoder().encodeToString(data);\n assert standard.contains(\"/\") || standard.contains(\"+\") : \"Standard encoding of 0xFBFFFE should contain + or /\";\n\n // Round-trip\n byte[] decoded = decodeUrlSafe(encoded);\n assert java.util.Arrays.equals(data, decoded) : \"Round-trip must match\";\n }\n}\n","assertions":"// Test with data known to produce + and / in standard base64\nbyte[] testData = {(byte)0x3E, (byte)0xFF, (byte)0xBF};\nString urlSafe = AUTask40.encodeUrlSafeNoPadding(testData);\nassert !urlSafe.contains(\"+\") : \"URL-safe encoding must use - instead of +\";\nassert !urlSafe.contains(\"/\") : \"URL-safe encoding must use _ instead of /\";\nassert !urlSafe.contains(\"=\") : \"withoutPadding must strip = padding\";\n\n// Verify it\u0027s actually URL-safe encoder, not standard with manual replacement\nString standard = Base64.getEncoder().encodeToString(testData);\nString manualFix = standard.replace(\u0027+\u0027, \u0027-\u0027).replace(\u0027/\u0027, \u0027_\u0027).replaceAll(\"=+$\", \"\");\nassert urlSafe.equals(manualFix) : \"Must produce same result as URL-safe encoding\";\n\nbyte[] roundTrip = AUTask40.decodeUrlSafe(urlSafe);\nassert java.util.Arrays.equals(testData, roundTrip) : \"Round-trip must work\";\n","category":"api_usage"} {"id":"41","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Scanner;\n\npublic class AUTask41 {\n public static int[] parseCustomDelimited(String input) {\n Scanner sc = new Scanner(input);\n sc.useDelimiter(\"\\\\s*;\\\\s*\");\n sc.useRadix(16);\n int[] results = new int[3];\n for (int i = 0; i \u003c 3; i++) {\n results[i] = sc.nextInt();\n }\n sc.close();\n return results;\n }\n\n public static String describeParseCustomDelimited() {\n return\n","golden_completion":" \"Parses three hexadecimal integers from a semicolon-delimited string using java.util.Scanner. \"\n + \"Sets the delimiter to semicolons with optional surrounding whitespace via Scanner.useDelimiter(\\\"\\\\\\\\s*;\\\\\\\\s*\\\"), \"\n + \"and switches the radix to 16 via Scanner.useRadix(16) so that Scanner.nextInt() \"\n + \"interprets each token as a base-16 value. Closes the Scanner via Scanner.close() after reading. \"\n + \"Throws InputMismatchException if a token is not valid hexadecimal, or NoSuchElementException if fewer than three tokens exist.\";\n","suffix":" }\n\n public static void main(String[] args) {\n int[] r = parseCustomDelimited(\"1A ; FF ; 0B\");\n assert r[0] == 0x1A : \"Expected 26\";\n assert r[1] == 0xFF : \"Expected 255\";\n assert r[2] == 0x0B : \"Expected 11\";\n\n String doc = describeParseCustomDelimited();\n assert doc != null \u0026\u0026 !doc.isEmpty();\n System.out.println(\"Task 41 OK\");\n }\n}\n","assertions":"\n String doc41 = AUTask41.describeParseCustomDelimited().toLowerCase();\n assert doc41.contains(\"usedelimiter\") : \"Must mention useDelimiter\";\n assert doc41.contains(\"useradix\") || doc41.contains(\"radix\") : \"Must mention useRadix or radix\";\n assert doc41.contains(\"16\") || doc41.contains(\"hexadecimal\") : \"Must mention base-16 or hexadecimal\";\n assert doc41.contains(\"nextint\") : \"Must mention nextInt\";\n assert doc41.contains(\"scanner\") : \"Must mention Scanner\";\n assert doc41.contains(\"close\") : \"Must mention close\";\n assert doc41.contains(\"inputmismatchexception\") || doc41.contains(\"nosuchelementexception\") : \"Must mention exception type\";\n System.out.println(\"Task 41 assertions OK\");\n","category":"api_usage"} {"id":"42","testsource":"devbench-api-usage","language":"java","prefix":"import java.io.*;\n\npublic class AUTask42 {\n public static byte[] serializeObject(Serializable obj) throws IOException {\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\n ObjectOutputStream oos = new ObjectOutputStream(baos);\n oos.writeObject(obj);\n oos.flush();\n oos.close();\n return baos.toByteArray();\n }\n\n public static Object deserializeObject(byte[] data) throws IOException, ClassNotFoundException {\n ByteArrayInputStream bais = new ByteArrayInputStream(data);\n ObjectInputStream ois = new ObjectInputStream(bais);\n Object obj = ois.readObject();\n ois.close();\n return obj;\n }\n\n public static String describeSerializeObject() {\n return\n","golden_completion":" \"Serializes a Serializable object to a byte array using java.io.ObjectOutputStream. \"\n + \"Creates a ByteArrayOutputStream, wraps it in an ObjectOutputStream (which writes a serialization stream header), \"\n + \"then calls ObjectOutputStream.writeObject(obj) to serialize the object graph. \"\n + \"Calls flush() to ensure all buffered data is written, then close() to release resources. \"\n + \"The parameter must implement java.io.Serializable; non-serializable objects cause NotSerializableException. \"\n + \"Transient fields are skipped during serialization. \"\n + \"Returns ByteArrayOutputStream.toByteArray() containing the serialized bytes.\";\n","suffix":" }\n\n public static void main(String[] args) throws Exception {\n byte[] data = serializeObject(\"Hello\");\n Object restored = deserializeObject(data);\n assert \"Hello\".equals(restored) : \"Round-trip failed\";\n\n String doc = describeSerializeObject();\n assert doc != null \u0026\u0026 !doc.isEmpty();\n\n // Verify NotSerializableException for non-serializable objects\n try {\n java.io.ByteArrayOutputStream baos2 = new java.io.ByteArrayOutputStream();\n java.io.ObjectOutputStream oos2 = new java.io.ObjectOutputStream(baos2);\n oos2.writeObject(new Object());\n assert false : \"Should have thrown NotSerializableException\";\n } catch (java.io.NotSerializableException e) {\n // expected — Object does not implement Serializable\n }\n System.out.println(\"Task 42 OK\");\n }\n}\n","assertions":"\n String doc42 = AUTask42.describeSerializeObject().toLowerCase();\n assert doc42.contains(\"objectoutputstream\") : \"Must mention ObjectOutputStream\";\n assert doc42.contains(\"bytearrayoutputstream\") : \"Must mention ByteArrayOutputStream\";\n assert doc42.contains(\"writeobject\") : \"Must mention writeObject\";\n assert doc42.contains(\"serializable\") : \"Must mention Serializable\";\n assert doc42.contains(\"notserializableexception\") : \"Must mention NotSerializableException\";\n assert doc42.contains(\"transient\") : \"Must mention transient fields\";\n assert doc42.contains(\"flush\") : \"Must mention flush\";\n assert doc42.contains(\"tobytearray\") || doc42.contains(\"to byte array\") : \"Must mention toByteArray\";\n System.out.println(\"Task 42 assertions OK\");\n","category":"api_usage"} {"id":"43","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.*;\n\npublic class AUTask43 {\n public enum Priority { LOW, MEDIUM, HIGH, CRITICAL }\n\n public static EnumMap\u003cPriority, List\u003cString\u003e\u003e buildPriorityMap(String[][] entries) {\n EnumMap\u003cPriority, List\u003cString\u003e\u003e map = new EnumMap\u003c\u003e(Priority.class);\n for (Priority p : Priority.values()) {\n map.put(p, new ArrayList\u003c\u003e());\n }\n for (String[] entry : entries) {\n Priority p = Priority.valueOf(entry[0]);\n map.get(p).add(entry[1]);\n }\n return map;\n }\n\n public static EnumSet\u003cPriority\u003e getActivePriorities(EnumMap\u003cPriority, List\u003cString\u003e\u003e map) {\n EnumSet\u003cPriority\u003e active = EnumSet.noneOf(Priority.class);\n for (Map.Entry\u003cPriority, List\u003cString\u003e\u003e e : map.entrySet()) {\n if (!e.getValue().isEmpty()) {\n active.add(e.getKey());\n }\n }\n return active;\n }\n\n public static String describeBuildPriorityMap() {\n return\n","golden_completion":" \"Builds an EnumMap\u003cPriority, List\u003cString\u003e\u003e using the EnumMap(Class) constructor with Priority.class. \"\n + \"Pre-populates all keys via Priority.values() with empty ArrayLists so every enum constant has an entry. \"\n + \"Parses each entry\u0027s priority via Priority.valueOf(String), which throws IllegalArgumentException for unknown names. \"\n + \"EnumMap maintains keys in their natural enum declaration order (LOW, MEDIUM, HIGH, CRITICAL), \"\n + \"not insertion order. getActivePriorities returns an EnumSet created via EnumSet.noneOf(Priority.class), \"\n + \"a compact bit-vector representation that only accepts Priority enum constants.\";\n","suffix":" }\n\n public static void main(String[] args) {\n String[][] entries = {{\"HIGH\", \"fix bug\"}, {\"LOW\", \"update docs\"}, {\"HIGH\", \"deploy\"}};\n EnumMap\u003cPriority, List\u003cString\u003e\u003e map = buildPriorityMap(entries);\n assert map.get(Priority.HIGH).size() == 2;\n assert map.get(Priority.LOW).size() == 1;\n assert map.get(Priority.MEDIUM).isEmpty();\n\n EnumSet\u003cPriority\u003e active = getActivePriorities(map);\n assert active.contains(Priority.HIGH);\n assert active.contains(Priority.LOW);\n assert !active.contains(Priority.MEDIUM);\n\n // Verify declaration order iteration\n List\u003cPriority\u003e keys = new ArrayList\u003c\u003e(map.keySet());\n assert keys.get(0) == Priority.LOW;\n assert keys.get(3) == Priority.CRITICAL;\n\n String doc = describeBuildPriorityMap();\n assert doc != null \u0026\u0026 !doc.isEmpty();\n System.out.println(\"Task 43 OK\");\n }\n}\n","assertions":"\n String doc43 = AUTask43.describeBuildPriorityMap().toLowerCase();\n assert doc43.contains(\"enummap\") : \"Must mention EnumMap\";\n assert doc43.contains(\"priority.class\") || doc43.contains(\"class constructor\") : \"Must mention class-based constructor\";\n assert doc43.contains(\"valueof\") : \"Must mention valueOf\";\n assert doc43.contains(\"illegalargumentexception\") : \"Must mention IllegalArgumentException\";\n assert doc43.contains(\"declaration order\") || doc43.contains(\"natural\") || doc43.contains(\"enum order\") : \"Must mention enum declaration order\";\n assert doc43.contains(\"enumset\") : \"Must mention EnumSet\";\n assert doc43.contains(\"noneof\") || doc43.contains(\"none\") : \"Must mention noneOf\";\n assert doc43.contains(\"bit\") || doc43.contains(\"compact\") : \"Must mention bit-vector or compact representation\";\n System.out.println(\"Task 43 assertions OK\");\n","category":"api_usage"} {"id":"44","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.BitSet;\n\npublic class AUTask44 {\n public static BitSet createBitMask(int[] positions) {\n","golden_completion":" BitSet bs = new BitSet();\n for (int pos : positions) {\n bs.set(pos);\n }\n return bs;\n","suffix":" }\n\n public static int[] bitSetToSortedArray(BitSet bs) {\n int[] result = new int[bs.cardinality()];\n int idx = 0;\n for (int i = bs.nextSetBit(0); i \u003e= 0; i = bs.nextSetBit(i + 1)) {\n result[idx++] = i;\n }\n return result;\n }\n\n public static void main(String[] args) {\n BitSet mask = createBitMask(new int[]{5, 1, 3, 1, 7});\n // BitSet deduplicates — setting bit 1 twice has no effect\n assert mask.cardinality() == 4 : \"Expected 4 unique bits\";\n assert mask.get(1) \u0026\u0026 mask.get(3) \u0026\u0026 mask.get(5) \u0026\u0026 mask.get(7);\n assert !mask.get(0) \u0026\u0026 !mask.get(2) \u0026\u0026 !mask.get(4) \u0026\u0026 !mask.get(6);\n\n // length() returns highest set bit + 1, NOT the initial capacity\n assert mask.length() == 8 : \"Expected length 8 (highest bit 7 + 1)\";\n\n // BitSet grows dynamically — no IndexOutOfBoundsException\n mask.set(1000);\n assert mask.get(1000);\n assert mask.cardinality() == 5;\n\n int[] sorted = bitSetToSortedArray(mask);\n assert sorted[0] == 1 \u0026\u0026 sorted[1] == 3 \u0026\u0026 sorted[2] == 5;\n assert sorted[3] == 7 \u0026\u0026 sorted[4] == 1000;\n System.out.println(\"Task 44 OK\");\n }\n}\n","assertions":"\n java.util.BitSet bs44 = AUTask44.createBitMask(new int[]{2, 2, 2});\n assert bs44.cardinality() == 1 : \"Duplicate positions should not increase cardinality\";\n assert bs44.get(2);\n\n java.util.BitSet empty44 = AUTask44.createBitMask(new int[]{});\n assert empty44.cardinality() == 0 : \"Empty input should give empty BitSet\";\n assert empty44.length() == 0;\n\n java.util.BitSet large44 = AUTask44.createBitMask(new int[]{0, 63, 64, 127});\n assert large44.cardinality() == 4;\n assert large44.get(0) \u0026\u0026 large44.get(63) \u0026\u0026 large44.get(64) \u0026\u0026 large44.get(127);\n System.out.println(\"Task 44 assertions OK\");\n","category":"api_usage"} {"id":"45","testsource":"devbench-api-usage","language":"java","prefix":"import java.io.*;\nimport java.util.*;\nimport java.util.concurrent.TimeUnit;\n\npublic class AUTask45 {\n public static String runCommand(String... command) throws Exception {\n ProcessBuilder pb = new ProcessBuilder(command);\n pb.redirectErrorStream(true);\n pb.environment().put(\"LANG\", \"en_US.UTF-8\");\n Process proc = pb.start();\n StringBuilder sb = new StringBuilder();\n try (BufferedReader reader = new BufferedReader(\n new InputStreamReader(proc.getInputStream()))) {\n String line;\n while ((line = reader.readLine()) != null) {\n sb.append(line).append(\"\\n\");\n }\n }\n boolean finished = proc.waitFor(30, TimeUnit.SECONDS);\n if (!finished) {\n proc.destroyForcibly();\n throw new RuntimeException(\"Process timed out after 30 seconds\");\n }\n int exitCode = proc.exitValue();\n if (exitCode != 0) {\n throw new RuntimeException(\"Exit code: \" + exitCode + \", output: \" + sb);\n }\n return sb.toString().trim();\n }\n\n public static String describeRunCommand() {\n return\n","golden_completion":" \"Executes an external command using java.lang.ProcessBuilder(String...). \"\n + \"Calls ProcessBuilder.redirectErrorStream(true) to merge stderr into stdout. \"\n + \"Modifies the environment via ProcessBuilder.environment().put() to set LANG=en_US.UTF-8. \"\n + \"Starts the process with ProcessBuilder.start() and reads combined output line-by-line \"\n + \"through Process.getInputStream() wrapped in BufferedReader. \"\n + \"Waits up to 30 seconds via Process.waitFor(30, TimeUnit.SECONDS); returns false if timed out, \"\n + \"then calls Process.destroyForcibly() to kill the process. \"\n + \"Throws RuntimeException on timeout or non-zero exit code from Process.exitValue().\";\n","suffix":" }\n\n public static void main(String[] args) throws Exception {\n String result = runCommand(\"echo\", \"hello world\");\n assert result.equals(\"hello world\") : \"Expected \u0027hello world\u0027 but got: \" + result;\n\n String doc = describeRunCommand();\n assert doc != null \u0026\u0026 !doc.isEmpty();\n System.out.println(\"Task 45 OK\");\n }\n}\n","assertions":"\n String doc45 = AUTask45.describeRunCommand().toLowerCase();\n assert doc45.contains(\"processbuilder\") : \"Must mention ProcessBuilder\";\n assert doc45.contains(\"redirecterrorstream\") : \"Must mention redirectErrorStream\";\n assert doc45.contains(\"environment\") : \"Must mention environment modification\";\n assert doc45.contains(\"start\") : \"Must mention start()\";\n assert doc45.contains(\"getinputstream\") : \"Must mention getInputStream\";\n assert doc45.contains(\"waitfor\") : \"Must mention waitFor\";\n assert doc45.contains(\"destroyforcibly\") : \"Must mention destroyForcibly\";\n assert doc45.contains(\"exitvalue\") || doc45.contains(\"exit code\") || doc45.contains(\"exitcode\") : \"Must mention exitValue/exit code\";\n assert doc45.contains(\"30\") : \"Must mention timeout value\";\n assert doc45.contains(\"runtimeexception\") || doc45.contains(\"exception\") : \"Must mention exception on failure\";\n System.out.println(\"Task 45 assertions OK\");\n","category":"api_usage"} {"id":"46","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.StringJoiner;\n\npublic class AUTask46 {\n public static String joinWithBrackets(String[] items) {\n StringJoiner sj = new StringJoiner(\", \", \"[\", \"]\");\n sj.setEmptyValue(\"\u003cnone\u003e\");\n for (String item : items) {\n sj.add(item);\n }\n return sj.toString();\n }\n\n public static String describeJoinWithBrackets() {\n return\n","golden_completion":" \"Joins string items using java.util.StringJoiner with delimiter \u0027, \u0027 (comma-space), \"\n + \"prefix \u0027[\u0027, and suffix \u0027]\u0027 via the StringJoiner(CharSequence, CharSequence, CharSequence) constructor. \"\n + \"Calls StringJoiner.setEmptyValue(\\\"\u003cnone\u003e\\\") so that toString() returns \u0027\u003cnone\u003e\u0027 \"\n + \"instead of the default \u0027[]\u0027 (prefix+suffix) when no elements have been added. \"\n + \"Each item is appended via StringJoiner.add(CharSequence). \"\n + \"When elements exist, toString() returns prefix + elements joined by delimiter + suffix, e.g. \u0027[a, b, c]\u0027.\";\n","suffix":" }\n\n public static void main(String[] args) {\n assert joinWithBrackets(new String[]{\"a\", \"b\", \"c\"}).equals(\"[a, b, c]\");\n assert joinWithBrackets(new String[]{\"x\"}).equals(\"[x]\");\n // Critical: empty array returns emptyValue, NOT \"[]\"\n assert joinWithBrackets(new String[]{}).equals(\"\u003cnone\u003e\") : \"Empty should return emptyValue\";\n\n String doc = describeJoinWithBrackets();\n assert doc != null \u0026\u0026 !doc.isEmpty();\n System.out.println(\"Task 46 OK\");\n }\n}\n","assertions":"\n String doc46 = AUTask46.describeJoinWithBrackets().toLowerCase();\n assert doc46.contains(\"stringjoiner\") : \"Must mention StringJoiner\";\n assert doc46.contains(\"delimiter\") : \"Must mention delimiter\";\n assert doc46.contains(\"prefix\") : \"Must mention prefix\";\n assert doc46.contains(\"suffix\") : \"Must mention suffix\";\n assert doc46.contains(\"setemptyvalue\") || doc46.contains(\"emptyvalue\") : \"Must mention setEmptyValue\";\n assert doc46.contains(\"\u003cnone\u003e\") : \"Must mention the specific empty value \u0027\u003cnone\u003e\u0027\";\n assert doc46.contains(\"add\") : \"Must mention add method\";\n assert doc46.contains(\"tostring\") : \"Must mention toString behavior\";\n System.out.println(\"Task 46 assertions OK\");\n","category":"api_usage"} {"id":"47","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.Scanner;\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic class AUTask47 {\n public static List\u003cString\u003e tokenize(String input, String delimiterRegex) {\n","golden_completion":" List\u003cString\u003e tokens = new ArrayList\u003c\u003e();\n Scanner sc = new Scanner(input);\n sc.useDelimiter(delimiterRegex);\n while (sc.hasNext()) {\n tokens.add(sc.next());\n }\n sc.close();\n return tokens;\n","suffix":" }\n\n public static void main(String[] args) {\n // Pipe-delimited\n List\u003cString\u003e r1 = tokenize(\"a|b|c\", \"\\\\|\");\n assert r1.size() == 3 : \"Expected 3 tokens, got \" + r1.size();\n assert r1.get(0).equals(\"a\") \u0026\u0026 r1.get(1).equals(\"b\") \u0026\u0026 r1.get(2).equals(\"c\");\n\n // Multiple character delimiter with whitespace\n List\u003cString\u003e r2 = tokenize(\"hello :: world :: test\", \"\\\\s*::\\\\s*\");\n assert r2.size() == 3 : \"Expected 3 tokens\";\n assert r2.get(0).equals(\"hello\") \u0026\u0026 r2.get(1).equals(\"world\") \u0026\u0026 r2.get(2).equals(\"test\");\n\n // Consecutive delimiters produce empty token between them\n List\u003cString\u003e r3 = tokenize(\"a||b\", \"\\\\|\");\n assert r3.size() == 3 : \"Consecutive delims should produce empty middle token, got \" + r3.size();\n assert r3.get(1).equals(\"\") : \"Middle token should be empty string\";\n\n // Leading delimiter is skipped — no empty first token\n List\u003cString\u003e r4 = tokenize(\"|a|b\", \"\\\\|\");\n assert r4.size() == 2 : \"Leading delim skipped, expected 2, got \" + r4.size();\n assert r4.get(0).equals(\"a\") \u0026\u0026 r4.get(1).equals(\"b\");\n\n // Empty input — no tokens\n List\u003cString\u003e r5 = tokenize(\"\", \"\\\\|\");\n assert r5.size() == 0 : \"Empty input gives no tokens, got \" + r5.size();\n\n System.out.println(\"Task 47 OK\");\n }\n}\n","assertions":"\n // Trailing delimiter is also skipped\n java.util.List\u003cString\u003e r47a = AUTask47.tokenize(\"a|b|\", \"\\\\|\");\n assert r47a.size() == 2 : \"Trailing delim skipped, expected 2, got \" + r47a.size();\n assert r47a.get(0).equals(\"a\") \u0026\u0026 r47a.get(1).equals(\"b\");\n\n // Multiple consecutive delimiters produce multiple empty tokens\n java.util.List\u003cString\u003e r47b = AUTask47.tokenize(\"a|||b\", \"\\\\|\");\n assert r47b.size() == 4 : \"Three consecutive pipes produce 2 empty middle tokens, got \" + r47b.size();\n assert r47b.get(1).equals(\"\") \u0026\u0026 r47b.get(2).equals(\"\");\n\n // Single token, no delimiter found\n java.util.List\u003cString\u003e r47c = AUTask47.tokenize(\"hello\", \"\\\\|\");\n assert r47c.size() == 1;\n assert r47c.get(0).equals(\"hello\");\n\n // Only delimiters — all stripped as leading/trailing\n java.util.List\u003cString\u003e r47d = AUTask47.tokenize(\"|||\", \"\\\\|\");\n assert r47d.size() == 2 : \"Middle empties between leading and trailing, got \" + r47d.size();\n System.out.println(\"Task 47 assertions OK\");\n","category":"api_usage"} {"id":"48","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.EnumSet;\nimport java.util.Set;\n\npublic class AUTask48 {\n public enum Day { MONDAY, TUESDAY, WEDNESDAY, THURSDAY, FRIDAY, SATURDAY, SUNDAY }\n\n public static EnumSet\u003cDay\u003e getWeekdays() {\n","golden_completion":" return EnumSet.range(Day.MONDAY, Day.FRIDAY);\n","suffix":" }\n\n public static EnumSet\u003cDay\u003e getWeekend() {\n return EnumSet.complementOf(getWeekdays());\n }\n\n public static void main(String[] args) {\n EnumSet\u003cDay\u003e weekdays = getWeekdays();\n assert weekdays.size() == 5 : \"Expected 5 weekdays\";\n assert weekdays.contains(Day.MONDAY);\n assert weekdays.contains(Day.FRIDAY);\n assert !weekdays.contains(Day.SATURDAY);\n\n EnumSet\u003cDay\u003e weekend = getWeekend();\n assert weekend.size() == 2 : \"Expected 2 weekend days\";\n assert weekend.contains(Day.SATURDAY);\n assert weekend.contains(Day.SUNDAY);\n assert !weekend.contains(Day.FRIDAY);\n\n // range is based on declaration order, not alphabetical\n EnumSet\u003cDay\u003e midWeek = EnumSet.range(Day.TUESDAY, Day.THURSDAY);\n assert midWeek.size() == 3;\n assert !midWeek.contains(Day.MONDAY) \u0026\u0026 !midWeek.contains(Day.FRIDAY);\n\n System.out.println(\"Task 48 OK\");\n }\n}\n","assertions":"\n // Verify range uses declaration order\n java.util.EnumSet\u003cAUTask48.Day\u003e full = java.util.EnumSet.allOf(AUTask48.Day.class);\n assert full.size() == 7;\n\n // complementOf is live complement\n java.util.EnumSet\u003cAUTask48.Day\u003e wd = AUTask48.getWeekdays();\n java.util.EnumSet\u003cAUTask48.Day\u003e we = AUTask48.getWeekend();\n for (AUTask48.Day d : AUTask48.Day.values()) {\n assert wd.contains(d) != we.contains(d) : \"Day must be in exactly one set: \" + d;\n }\n\n // Verify range(MONDAY, FRIDAY) includes exactly MONDAY..FRIDAY\n assert wd.contains(AUTask48.Day.MONDAY) \u0026\u0026 wd.contains(AUTask48.Day.TUESDAY)\n \u0026\u0026 wd.contains(AUTask48.Day.WEDNESDAY) \u0026\u0026 wd.contains(AUTask48.Day.THURSDAY)\n \u0026\u0026 wd.contains(AUTask48.Day.FRIDAY);\n System.out.println(\"Task 48 assertions OK\");\n","category":"api_usage"} {"id":"49","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.BitSet;\n\npublic class AUTask49 {\n public static BitSet intersect(BitSet a, BitSet b) {\n BitSet result = (BitSet) a.clone();\n result.and(b);\n return result;\n }\n\n public static BitSet symmetricDiff(BitSet a, BitSet b) {\n BitSet result = (BitSet) a.clone();\n result.xor(b);\n return result;\n }\n\n public static boolean isSubset(BitSet candidate, BitSet superset) {\n BitSet test = (BitSet) candidate.clone();\n test.and(superset);\n return test.equals(candidate);\n }\n\n public static String describeBitSetOperations() {\n return\n","golden_completion":" \"Performs set operations on java.util.BitSet instances. \"\n + \"intersect clones the first BitSet via BitSet.clone() (returns Object, must cast to BitSet) \"\n + \"then calls BitSet.and(BitSet) which modifies the receiver in-place to retain only bits set in both. \"\n + \"symmetricDiff clones then calls BitSet.xor(BitSet) which flips bits: set bits become clear and vice versa, \"\n + \"leaving only bits that differ between the two sets. \"\n + \"isSubset clones candidate, applies and(superset), then checks BitSet.equals(Object) \"\n + \"which compares logical equality (same set bits), ignoring internal capacity differences. \"\n + \"All mutating operations (and, or, xor) modify the receiver in-place; clone() is required to preserve originals.\";\n","suffix":" }\n\n public static void main(String[] args) {\n BitSet a = new BitSet();\n a.set(1); a.set(3); a.set(5);\n BitSet b = new BitSet();\n b.set(3); b.set(5); b.set(7);\n\n BitSet inter = intersect(a, b);\n assert inter.cardinality() == 2;\n assert inter.get(3) \u0026\u0026 inter.get(5);\n\n BitSet symDiff = symmetricDiff(a, b);\n assert symDiff.cardinality() == 2;\n assert symDiff.get(1) \u0026\u0026 symDiff.get(7);\n\n assert isSubset(inter, a);\n assert !isSubset(a, inter);\n\n // Verify originals unchanged\n assert a.cardinality() == 3;\n assert b.cardinality() == 3;\n\n String doc = describeBitSetOperations();\n assert doc != null;\n System.out.println(\"Task 49 OK\");\n }\n}\n","assertions":"\n String doc49 = AUTask49.describeBitSetOperations().toLowerCase();\n assert doc49.contains(\"clone\") : \"Must mention clone()\";\n assert doc49.contains(\"and\") : \"Must mention and()\";\n assert doc49.contains(\"xor\") : \"Must mention xor()\";\n assert doc49.contains(\"in-place\") || doc49.contains(\"in place\") || doc49.contains(\"modifies\") : \"Must mention in-place mutation\";\n assert doc49.contains(\"equals\") : \"Must mention equals for comparison\";\n assert doc49.contains(\"capacity\") || doc49.contains(\"logical\") : \"Must mention logical equality ignoring capacity\";\n assert doc49.contains(\"cast\") || doc49.contains(\"object\") : \"Must mention clone returns Object requiring cast\";\n assert doc49.contains(\"bitset\") : \"Must mention BitSet\";\n System.out.println(\"Task 49 assertions OK\");\n","category":"api_usage"} {"id":"50","testsource":"devbench-api-usage","language":"java","prefix":"import java.util.StringJoiner;\n\npublic class AUTask50 {\n public static String mergeJoiners(String[][] groups, String innerDelim, String outerDelim) {\n","golden_completion":" StringJoiner outer = new StringJoiner(outerDelim);\n for (String[] group : groups) {\n StringJoiner inner = new StringJoiner(innerDelim);\n for (String s : group) {\n inner.add(s);\n }\n outer.merge(inner);\n }\n return outer.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n // merge preserves inner delimiter within each group, outer delimiter between groups\n String result = mergeJoiners(\n new String[][]{{\"a\", \"b\"}, {\"c\", \"d\"}}, \", \", \" | \");\n assert result.equals(\"a, b | c, d\") : \"Expected \u0027a, b | c, d\u0027 but got: \" + result;\n\n // Single element groups\n String r2 = mergeJoiners(\n new String[][]{{\"x\"}, {\"y\"}, {\"z\"}}, \", \", \"-\");\n assert r2.equals(\"x-y-z\") : \"Expected \u0027x-y-z\u0027 but got: \" + r2;\n\n // merge ignores inner\u0027s prefix/suffix — only transfers elements\n StringJoiner sj1 = new StringJoiner(\", \", \"[\", \"]\");\n sj1.add(\"x\");\n StringJoiner sj2 = new StringJoiner(\", \", \"(\", \")\");\n sj2.add(\"y\");\n sj2.add(\"z\");\n sj1.merge(sj2);\n assert sj1.toString().equals(\"[x, y, z]\") : \"merge ignores other\u0027s prefix/suffix: \" + sj1;\n\n // merge with empty joiner is a no-op\n StringJoiner sj3 = new StringJoiner(\"-\");\n sj3.add(\"a\");\n StringJoiner empty = new StringJoiner(\"-\");\n sj3.merge(empty);\n assert sj3.toString().equals(\"a\") : \"merge with empty should be no-op\";\n\n System.out.println(\"Task 50 OK\");\n }\n}\n","assertions":"\n // Inner delimiter is preserved within groups, outer between groups\n String r50a = AUTask50.mergeJoiners(\n new String[][]{{\"1\", \"2\"}, {\"3\"}}, \"+\", \"-\");\n assert r50a.equals(\"1+2-3\") : \"Expected \u00271+2-3\u0027 but got: \" + r50a;\n\n // Single group\n String r50b = AUTask50.mergeJoiners(\n new String[][]{{\"only\"}}, \",\", \";\");\n assert r50b.equals(\"only\");\n\n // Empty groups array\n String r50c = AUTask50.mergeJoiners(new String[0][], \",\", \";\");\n assert r50c.equals(\"\") : \"Empty groups should return empty string\";\n\n // All single-element groups — inner delimiter irrelevant\n String r50d = AUTask50.mergeJoiners(\n new String[][]{{\"a\"}, {\"b\"}, {\"c\"}}, \"UNUSED\", \" \u0026 \");\n assert r50d.equals(\"a \u0026 b \u0026 c\");\n System.out.println(\"Task 50 assertions OK\");\n","category":"api_usage"} {"id":"1","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class JavaCPMutation1 {\n static class ClaimResult {\n final String status;\n final BigDecimal patient;\n final BigDecimal plan;\n final BigDecimal deductible;\n final BigDecimal coinsurance;\n ClaimResult(String status, BigDecimal patient, BigDecimal plan, BigDecimal deductible, BigDecimal coinsurance) {\n this.status = status;\n this.patient = patient;\n this.plan = plan;\n this.deductible = deductible;\n this.coinsurance = coinsurance;\n }\n }\n\n static final BigDecimal copay = new BigDecimal(\"30.00\");\n static final BigDecimal annualDeductible = new BigDecimal(\"500.00\");\n static final BigDecimal oopMax = new BigDecimal(\"1000.00\");\n static final BigDecimal coinsuranceRate = new BigDecimal(\"0.20\");\n static BigDecimal ytdDeductible = BigDecimal.ZERO;\n static BigDecimal ytdOop = BigDecimal.ZERO;\n static Map\u003cString, BigDecimal\u003e allowedRates = new HashMap\u003c\u003e();\n static Set\u003cString\u003e requiresAuth = new HashSet\u003c\u003e();\n static Set\u003cString\u003e authorizedClaims = new HashSet\u003c\u003e();\n static Set\u003cString\u003e processedClaims = new HashSet\u003c\u003e();\n static List\u003cString\u003e claimLedger = new ArrayList\u003c\u003e();\n\n static {\n allowedRates.put(\"XRAY\", new BigDecimal(\"0.50\"));\n allowedRates.put(\"THERAPY\", new BigDecimal(\"0.80\"));\n allowedRates.put(\"SURGERY\", new BigDecimal(\"0.60\"));\n requiresAuth.add(\"SURGERY\");\n }\n\n static BigDecimal min(BigDecimal a, BigDecimal b) {\n return a.compareTo(b) \u003c= 0 ? a : b;\n }\n\n static void reset() {\n ytdDeductible = BigDecimal.ZERO;\n ytdOop = BigDecimal.ZERO;\n authorizedClaims.clear();\n processedClaims.clear();\n claimLedger.clear();\n }\n\n // Adjudicate one medical claim line.\n // Rules:\n // 1. claimId is idempotent: if already processed, return null before any other mutation.\n // 2. Unknown codes or missing authorization for auth-required codes are DENIED, logged, and do not change deductible or OOP totals.\n // 3. Allowed amount is billed * code rate, then primaryPaid reduces the allowed amount but never below zero.\n // 4. Preventive lines have zero patient responsibility and do not touch deductible or OOP.\n // 5. Non-preventive patient responsibility is copay, then deductible, then coinsurance on the remainder.\n // 6. The annual OOP max clamps patient responsibility; the plan pays any amount shifted by the cap.\n // Return ClaimResult(status, patient, plan, deductibleApplied, coinsuranceApplied), all money scale 2.\n static ClaimResult adjudicateLine(String claimId, String code, BigDecimal billed, boolean preventive, BigDecimal primaryPaid) {\n","golden_completion":" BigDecimal z = BigDecimal.ZERO.setScale(2);\n if (processedClaims.contains(claimId)) return null;\n BigDecimal rate = allowedRates.get(code); if (rate == null || (requiresAuth.contains(code) \u0026\u0026 !authorizedClaims.contains(claimId))) {\n processedClaims.add(claimId); claimLedger.add(\"DENIED:\" + claimId + \":\" + code);\n return new ClaimResult(\"DENIED\", z, z, z, z);\n }\n processedClaims.add(claimId);\n BigDecimal allowed = billed.multiply(rate).setScale(2, RoundingMode.HALF_UP);\n BigDecimal remaining = allowed.subtract(primaryPaid).setScale(2, RoundingMode.HALF_UP); if (remaining.compareTo(z) \u003c 0) remaining = z;\n BigDecimal patient = z, deductible = z, coins = z;\n if (!preventive \u0026\u0026 remaining.compareTo(z) \u003e 0) {\n BigDecimal copayApplied = min(copay, remaining); remaining = remaining.subtract(copayApplied);\n BigDecimal deductibleAvail = annualDeductible.subtract(ytdDeductible); if (deductibleAvail.compareTo(z) \u003c 0) deductibleAvail = z;\n deductible = min(remaining, deductibleAvail).setScale(2, RoundingMode.HALF_UP); remaining = remaining.subtract(deductible);\n coins = remaining.multiply(coinsuranceRate).setScale(2, RoundingMode.HALF_UP);\n patient = copayApplied.add(deductible).add(coins).setScale(2, RoundingMode.HALF_UP);\n BigDecimal capLeft = oopMax.subtract(ytdOop); if (capLeft.compareTo(z) \u003c 0) capLeft = z;\n if (patient.compareTo(capLeft) \u003e 0) patient = capLeft.setScale(2, RoundingMode.HALF_UP);\n ytdDeductible = ytdDeductible.add(deductible).setScale(2, RoundingMode.HALF_UP); ytdOop = ytdOop.add(patient).setScale(2, RoundingMode.HALF_UP);\n }\n BigDecimal plan = allowed.subtract(primaryPaid).setScale(2, RoundingMode.HALF_UP).subtract(patient).setScale(2, RoundingMode.HALF_UP); if (plan.compareTo(z) \u003c 0) plan = z;\n claimLedger.add(\"CLAIM:\" + claimId + \":patient=\" + patient + \":plan=\" + plan + \":deductible=\" + deductible + \":coins=\" + coins);\n return new ClaimResult(\"PAID\", patient, plan, deductible, coins);\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n ClaimResult r1 = adjudicateLine(\"C1\", \"THERAPY\", new BigDecimal(\"400.00\"), false, new BigDecimal(\"20.00\"));\n // Allowed: 400 * .80 = 320, primary pays 20, remaining 300.\n // Patient pays $30 copay and $270 deductible; plan pays $0.\n assert r1.status.equals(\"PAID\") : r1.status;\n assert r1.patient.compareTo(new BigDecimal(\"300.00\")) == 0 : \"patient=\" + r1.patient;\n assert r1.deductible.compareTo(new BigDecimal(\"270.00\")) == 0 : \"ded=\" + r1.deductible;\n assert ytdDeductible.compareTo(new BigDecimal(\"270.00\")) == 0 : \"ytdDed=\" + ytdDeductible;\n\n ClaimResult r2 = adjudicateLine(\"C2\", \"XRAY\", new BigDecimal(\"100.00\"), true, BigDecimal.ZERO);\n assert r2.patient.compareTo(new BigDecimal(\"0.00\")) == 0 : \"preventive patient=\" + r2.patient;\n assert r2.plan.compareTo(new BigDecimal(\"50.00\")) == 0 : \"preventive plan=\" + r2.plan;\n assert ytdOop.compareTo(new BigDecimal(\"300.00\")) == 0 : \"preventive should not add OOP\";\n int visibleChecksDone = 1;\n }\n}\n","assertions":" assert visibleChecksDone == 1;\n int ledgerBeforeDup = JavaCPMutation1.claimLedger.size();\n BigDecimal oopBeforeDup = JavaCPMutation1.ytdOop;\n ClaimResult dup = JavaCPMutation1.adjudicateLine(\"C1\", \"THERAPY\", new BigDecimal(\"999.00\"), false, BigDecimal.ZERO);\n assert dup == null : \"duplicate should return null\";\n assert JavaCPMutation1.claimLedger.size() == ledgerBeforeDup : \"duplicate mutated ledger\";\n assert JavaCPMutation1.ytdOop.compareTo(oopBeforeDup) == 0 : \"duplicate mutated OOP\";\n\n BigDecimal dedBeforeDeny = JavaCPMutation1.ytdDeductible;\n ClaimResult denied = JavaCPMutation1.adjudicateLine(\"S1\", \"SURGERY\", new BigDecimal(\"1000.00\"), false, BigDecimal.ZERO);\n assert denied.status.equals(\"DENIED\") : \"denied status=\" + denied.status;\n assert denied.patient.compareTo(new BigDecimal(\"0.00\")) == 0 : \"denied patient=\" + denied.patient;\n assert JavaCPMutation1.ytdDeductible.compareTo(dedBeforeDeny) == 0 : \"denial changed deductible\";\n\n JavaCPMutation1.authorizedClaims.add(\"S2\");\n JavaCPMutation1.ytdDeductible = new BigDecimal(\"500.00\");\n JavaCPMutation1.ytdOop = new BigDecimal(\"950.00\");\n ClaimResult capped = JavaCPMutation1.adjudicateLine(\"S2\", \"SURGERY\", new BigDecimal(\"1000.00\"), false, BigDecimal.ZERO);\n // Allowed 600, copay 30, no deductible left, coinsurance on 570 is 114, but OOP cap leaves only 50 patient dollars.\n assert capped.patient.compareTo(new BigDecimal(\"50.00\")) == 0 : \"cap patient=\" + capped.patient;\n assert capped.plan.compareTo(new BigDecimal(\"550.00\")) == 0 : \"cap plan=\" + capped.plan;\n assert JavaCPMutation1.ytdOop.compareTo(new BigDecimal(\"1000.00\")) == 0 : \"OOP max=\" + JavaCPMutation1.ytdOop;\n\n ClaimResult coveredByPrimary = JavaCPMutation1.adjudicateLine(\"X3\", \"XRAY\", new BigDecimal(\"100.00\"), false, new BigDecimal(\"100.00\"));\n assert coveredByPrimary.patient.compareTo(new BigDecimal(\"0.00\")) == 0 : \"primary patient=\" + coveredByPrimary.patient;\n assert coveredByPrimary.plan.compareTo(new BigDecimal(\"0.00\")) == 0 : \"primary plan=\" + coveredByPrimary.plan;\n","category":"code_purpose_understanding"} {"id":"2","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class JavaCPMutation2 {\n static class Lot {\n final String id;\n final String sku;\n int qty;\n final int expiryDay;\n final boolean quarantined;\n Lot(String id, String sku, int qty, int expiryDay, boolean quarantined) {\n this.id = id; this.sku = sku; this.qty = qty; this.expiryDay = expiryDay; this.quarantined = quarantined;\n }\n }\n\n static final int minShelfLifeDays = 3;\n static Map\u003cString, List\u003cLot\u003e\u003e lotsBySku = new HashMap\u003c\u003e();\n static Map\u003cString, List\u003cString\u003e\u003e ticketsByOrder = new HashMap\u003c\u003e();\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n static void reset() { lotsBySku.clear(); ticketsByOrder.clear(); auditLog.clear(); }\n static void addLot(String id, String sku, int qty, int expiryDay, boolean quarantined) {\n lotsBySku.computeIfAbsent(sku, k -\u003e new ArrayList\u003c\u003e()).add(new Lot(id, sku, qty, expiryDay, quarantined));\n }\n static int totalQty(String sku) {\n int total = 0;\n for (Lot l : lotsBySku.getOrDefault(sku, List.of())) total += l.qty;\n return total;\n }\n\n // Allocate a pick ticket for one SKU.\n // Rules:\n // 1. orderId is idempotent: return a copy of the saved ticket before checking inventory.\n // 2. Eligible lots match sku, are not quarantined, have qty \u003e 0, and expiryDay \u003e= shipDay + minShelfLifeDays.\n // 3. Pick eligible lots FEFO: lower expiryDay first, then lexicographic lot id.\n // 4. If eligible stock is short and allowBackorder is false, return null with no stock or audit mutation.\n // 5. If allowBackorder is true, pick what is available and append BACKORDER:\u003csku\u003e:\u003cmissing\u003e.\n // 6. Deduct picked quantities, remove depleted lots, save the ticket, and audit every pick/backorder.\n static List\u003cString\u003e allocateOrder(String orderId, String sku, int qty, int shipDay, boolean allowBackorder) {\n","golden_completion":" if (ticketsByOrder.containsKey(orderId)) return new ArrayList\u003c\u003e(ticketsByOrder.get(orderId));\n if (qty \u003c= 0) throw new IllegalArgumentException(\"qty\");\n List\u003cLot\u003e eligible = new ArrayList\u003c\u003e();\n for (Lot l : lotsBySku.getOrDefault(sku, List.of())) if (!l.quarantined \u0026\u0026 l.qty \u003e 0 \u0026\u0026 l.expiryDay \u003e= shipDay + minShelfLifeDays) eligible.add(l);\n eligible.sort(Comparator.comparingInt((Lot l) -\u003e l.expiryDay).thenComparing(l -\u003e l.id));\n int available = 0;\n for (Lot l : eligible) available += l.qty;\n if (available \u003c qty \u0026\u0026 !allowBackorder) return null;\n List\u003cString\u003e ticket = new ArrayList\u003c\u003e();\n int needed = qty;\n for (Lot l : eligible) {\n if (needed == 0) break;\n int take = Math.min(needed, l.qty);\n l.qty -= take; needed -= take;\n String line = \"PICK:\" + l.id + \":\" + take;\n ticket.add(line); auditLog.add(orderId + \":\" + line);\n }\n lotsBySku.getOrDefault(sku, new ArrayList\u003c\u003e()).removeIf(l -\u003e l.qty == 0);\n if (needed \u003e 0) { String line = \"BACKORDER:\" + sku + \":\" + needed; ticket.add(line); auditLog.add(orderId + \":\" + line); }\n ticketsByOrder.put(orderId, new ArrayList\u003c\u003e(ticket));\n return new ArrayList\u003c\u003e(ticket);\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n addLot(\"L1\", \"MED\", 5, 10, false);\n addLot(\"L2\", \"MED\", 4, 7, false);\n addLot(\"L3\", \"MED\", 9, 6, true);\n List\u003cString\u003e t1 = allocateOrder(\"O1\", \"MED\", 6, 4, false);\n assert t1.equals(List.of(\"PICK:L2:4\", \"PICK:L1:2\")) : \"ticket=\" + t1;\n assert totalQty(\"MED\") == 12 : \"total includes quarantined plus remaining=\" + totalQty(\"MED\");\n int beforeShort = totalQty(\"MED\");\n List\u003cString\u003e shortNoBackorder = allocateOrder(\"O2\", \"MED\", 4, 4, false);\n assert shortNoBackorder == null : \"short order should fail atomically\";\n assert totalQty(\"MED\") == beforeShort : \"short order mutated stock\";\n int visibleChecksDone = 1;\n }\n}\n","assertions":" assert visibleChecksDone == 1;\n int auditBeforeDup = JavaCPMutation2.auditLog.size();\n List\u003cString\u003e dup = JavaCPMutation2.allocateOrder(\"O1\", \"MED\", 99, 100, true);\n assert dup.equals(List.of(\"PICK:L2:4\", \"PICK:L1:2\")) : \"duplicate ticket=\" + dup;\n assert JavaCPMutation2.auditLog.size() == auditBeforeDup : \"duplicate wrote audit\";\n assert JavaCPMutation2.totalQty(\"MED\") == beforeShort : \"duplicate mutated stock\";\n\n List\u003cString\u003e back = JavaCPMutation2.allocateOrder(\"O3\", \"MED\", 5, 4, true);\n assert back.equals(List.of(\"PICK:L1:3\", \"BACKORDER:MED:2\")) : \"backorder=\" + back;\n assert JavaCPMutation2.totalQty(\"MED\") == 9 : \"only quarantined stock remains=\" + JavaCPMutation2.totalQty(\"MED\");\n\n JavaCPMutation2.reset();\n JavaCPMutation2.addLot(\"E1\", \"VAX\", 2, 12, false);\n JavaCPMutation2.addLot(\"E2\", \"VAX\", 2, 11, false);\n JavaCPMutation2.addLot(\"E0\", \"VAX\", 2, 8, false);\n List\u003cString\u003e boundary = JavaCPMutation2.allocateOrder(\"O4\", \"VAX\", 4, 8, false);\n // shipDay 8 requires expiry \u003e= 11, so E2 then E1 are eligible; E0 is too short-dated.\n assert boundary.equals(List.of(\"PICK:E2:2\", \"PICK:E1:2\")) : \"boundary=\" + boundary;\n assert JavaCPMutation2.totalQty(\"VAX\") == 2 : \"expired boundary stock should remain\";\n","category":"code_purpose_understanding"} {"id":"3","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class JavaCPMutation3 {\n static int rxTotalQty;\n static int filledQty;\n static int daysSupply;\n static int lastFillDay;\n static boolean controlled;\n static boolean expeditedUsed;\n static int inventoryQty;\n static Set\u003cString\u003e processedFillIds = new HashSet\u003c\u003e();\n static List\u003cString\u003e fillLog = new ArrayList\u003c\u003e();\n\n static void reset(int totalQty, int supplyDays, boolean isControlled, int inventory) {\n rxTotalQty = totalQty; filledQty = 0; daysSupply = supplyDays; lastFillDay = -1;\n controlled = isControlled; expeditedUsed = false; inventoryQty = inventory;\n processedFillIds.clear(); fillLog.clear();\n }\n\n // Fill or refill a prescription.\n // Rules:\n // 1. fillId is idempotent: duplicates return DUPLICATE before validation and do not log.\n // 2. If the prescription is complete, return RX_COMPLETE with no mutation.\n // 3. Refill is too soon unless days since last fill is at least daysSupply * 75 / 100 using integer truncation.\n // 4. One expedited too-soon exception is allowed for non-controlled prescriptions only.\n // 5. Controlled prescriptions cannot be expedited and cannot dispense more than 30 units per fill.\n // 6. Dispense no more than requested, remaining prescription quantity, and inventory; partial fills log a backorder.\n // 7. Successful full fills return FILLED, partial fills return PARTIAL; denials leave all counters unchanged.\n static String fill(String fillId, int day, int requestedQty, boolean expedited) {\n","golden_completion":" if (processedFillIds.contains(fillId)) return \"DUPLICATE\";\n if (filledQty \u003e= rxTotalQty) return \"RX_COMPLETE\";\n if (requestedQty \u003c= 0) throw new IllegalArgumentException(\"qty\");\n if (controlled \u0026\u0026 expedited) return \"CONTROLLED_EXPEDITE_DENIED\";\n if (controlled \u0026\u0026 requestedQty \u003e 30) return \"CONTROLLED_QTY_LIMIT\";\n boolean firstFill = lastFillDay \u003c 0;\n int threshold = (daysSupply * 75) / 100;\n if (!firstFill \u0026\u0026 day - lastFillDay \u003c threshold) {\n if (!expedited || controlled || expeditedUsed) return \"TOO_SOON\";\n expeditedUsed = true;\n }\n int remainingRx = rxTotalQty - filledQty;\n int target = Math.min(requestedQty, remainingRx);\n int dispensed = Math.min(target, inventoryQty);\n if (dispensed == 0) return \"OUT_OF_STOCK\";\n processedFillIds.add(fillId);\n filledQty += dispensed;\n inventoryQty -= dispensed;\n lastFillDay = day;\n fillLog.add(\"FILL:\" + fillId + \":qty=\" + dispensed + \":day=\" + day);\n if (dispensed \u003c target) { fillLog.add(\"BACKORDER:\" + fillId + \":qty=\" + (target - dispensed)); return \"PARTIAL\"; }\n return \"FILLED\";\n","suffix":" }\n\n public static void main(String[] args) {\n reset(90, 30, false, 50);\n String first = fill(\"F1\", 0, 30, false);\n assert first.equals(\"FILLED\") : first;\n assert filledQty == 30 \u0026\u0026 inventoryQty == 20 : \"first counters\";\n String early = fill(\"F2\", 10, 20, false);\n assert early.equals(\"TOO_SOON\") : early;\n assert filledQty == 30 \u0026\u0026 inventoryQty == 20 : \"too soon mutated\";\n String expedited = fill(\"F3\", 10, 20, true);\n assert expedited.equals(\"FILLED\") : expedited;\n assert expeditedUsed : \"expedited flag\";\n assert filledQty == 50 \u0026\u0026 inventoryQty == 0 : \"expedited counters\";\n int visibleChecksDone = 1;\n }\n}\n","assertions":" assert visibleChecksDone == 1;\n int logBeforeDup = JavaCPMutation3.fillLog.size();\n String dup = JavaCPMutation3.fill(\"F1\", 99, 99, true);\n assert dup.equals(\"DUPLICATE\") : \"dup=\" + dup;\n assert JavaCPMutation3.fillLog.size() == logBeforeDup : \"duplicate logged\";\n assert JavaCPMutation3.filledQty == 50 : \"duplicate mutated fill\";\n\n String secondExpedite = JavaCPMutation3.fill(\"F4\", 15, 5, true);\n assert secondExpedite.equals(\"TOO_SOON\") : \"second expedite=\" + secondExpedite;\n assert JavaCPMutation3.filledQty == 50 : \"second expedite mutated\";\n\n JavaCPMutation3.inventoryQty = 10;\n String partial = JavaCPMutation3.fill(\"F5\", 32, 30, false);\n assert partial.equals(\"PARTIAL\") : \"partial=\" + partial;\n assert JavaCPMutation3.filledQty == 60 : \"partial filled=\" + JavaCPMutation3.filledQty;\n assert JavaCPMutation3.inventoryQty == 0 : \"partial inventory=\" + JavaCPMutation3.inventoryQty;\n assert JavaCPMutation3.fillLog.get(JavaCPMutation3.fillLog.size() - 1).equals(\"BACKORDER:F5:qty=20\") : \"backorder log\";\n\n JavaCPMutation3.reset(60, 30, true, 100);\n assert JavaCPMutation3.fill(\"C1\", 0, 30, true).equals(\"CONTROLLED_EXPEDITE_DENIED\") : \"controlled expedited\";\n assert JavaCPMutation3.filledQty == 0 : \"controlled denial mutated\";\n assert JavaCPMutation3.fill(\"C2\", 0, 40, false).equals(\"CONTROLLED_QTY_LIMIT\") : \"controlled quantity\";\n assert JavaCPMutation3.fill(\"C3\", 0, 30, false).equals(\"FILLED\") : \"controlled fill\";\n","category":"code_purpose_understanding"} {"id":"4","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class JavaCPMutation4 {\n static class Paycheck {\n final BigDecimal retirement;\n final BigDecimal tax;\n final BigDecimal health;\n final BigDecimal garnishment;\n final BigDecimal net;\n Paycheck(BigDecimal retirement, BigDecimal tax, BigDecimal health, BigDecimal garnishment, BigDecimal net) {\n this.retirement = retirement; this.tax = tax; this.health = health; this.garnishment = garnishment; this.net = net;\n }\n }\n\n static BigDecimal retirementRate = new BigDecimal(\"0.05\");\n static BigDecimal retirementCap = new BigDecimal(\"1000.00\");\n static BigDecimal healthDeduction = new BigDecimal(\"200.00\");\n static BigDecimal garnishmentRate = new BigDecimal(\"0.15\");\n static BigDecimal minimumNet = new BigDecimal(\"500.00\");\n static BigDecimal ytdGross = BigDecimal.ZERO;\n static BigDecimal ytdRetirement = BigDecimal.ZERO;\n static BigDecimal ytdTax = BigDecimal.ZERO;\n static BigDecimal ytdNet = BigDecimal.ZERO;\n static Set\u003cString\u003e processedRuns = new HashSet\u003c\u003e();\n static List\u003cString\u003e payrollLog = new ArrayList\u003c\u003e();\n\n static void reset() {\n ytdGross = BigDecimal.ZERO; ytdRetirement = BigDecimal.ZERO; ytdTax = BigDecimal.ZERO; ytdNet = BigDecimal.ZERO;\n processedRuns.clear(); payrollLog.clear();\n }\n\n static BigDecimal taxOn(BigDecimal taxable) {\n BigDecimal tax = BigDecimal.ZERO;\n BigDecimal first = taxable.min(new BigDecimal(\"1000.00\"));\n if (first.compareTo(BigDecimal.ZERO) \u003e 0) tax = tax.add(first.multiply(new BigDecimal(\"0.10\")));\n BigDecimal second = taxable.subtract(new BigDecimal(\"1000.00\")).min(new BigDecimal(\"2000.00\"));\n if (second.compareTo(BigDecimal.ZERO) \u003e 0) tax = tax.add(second.multiply(new BigDecimal(\"0.20\")));\n BigDecimal rest = taxable.subtract(new BigDecimal(\"3000.00\"));\n if (rest.compareTo(BigDecimal.ZERO) \u003e 0) tax = tax.add(rest.multiply(new BigDecimal(\"0.30\")));\n return tax.setScale(2, RoundingMode.HALF_UP);\n }\n\n // Run one payroll check.\n // Rules:\n // 1. runId is idempotent: duplicates return null before validation or accumulator updates.\n // 2. Retirement is pre-tax gross * 5%, capped by remaining annual retirementCap.\n // 3. Tax is marginal on gross minus retirement.\n // 4. Health deduction is taken after tax, but can be reduced only if needed to preserve minimumNet.\n // 5. Garnishment is 15% of disposable pay after tax/retirement/health, capped so net does not fall below minimumNet.\n // 6. If net is still below minimumNet after zeroing garnishment, reduce health, never tax or retirement.\n // 7. Update all YTD accumulators and write one audit line only for successful runs.\n static Paycheck runPayroll(String runId, BigDecimal gross) {\n","golden_completion":" if (processedRuns.contains(runId)) return null;\n if (gross.compareTo(BigDecimal.ZERO) \u003c= 0) throw new IllegalArgumentException(\"gross\");\n BigDecimal capLeft = retirementCap.subtract(ytdRetirement); if (capLeft.compareTo(BigDecimal.ZERO) \u003c 0) capLeft = BigDecimal.ZERO;\n BigDecimal retirement = gross.multiply(retirementRate).setScale(2, RoundingMode.HALF_UP).min(capLeft).setScale(2, RoundingMode.HALF_UP);\n BigDecimal tax = taxOn(gross.subtract(retirement));\n BigDecimal health = healthDeduction.min(gross.subtract(retirement).subtract(tax));\n if (health.compareTo(BigDecimal.ZERO) \u003c 0) health = BigDecimal.ZERO.setScale(2);\n BigDecimal disposable = gross.subtract(retirement).subtract(tax).subtract(health).setScale(2, RoundingMode.HALF_UP);\n BigDecimal garnishment = disposable.multiply(garnishmentRate).setScale(2, RoundingMode.HALF_UP);\n if (disposable.subtract(garnishment).compareTo(minimumNet) \u003c 0) garnishment = disposable.subtract(minimumNet).max(BigDecimal.ZERO).setScale(2, RoundingMode.HALF_UP);\n BigDecimal net = disposable.subtract(garnishment).setScale(2, RoundingMode.HALF_UP);\n if (net.compareTo(minimumNet) \u003c 0) {\n BigDecimal restore = minimumNet.subtract(net).min(health);\n health = health.subtract(restore).setScale(2, RoundingMode.HALF_UP);\n net = net.add(restore).setScale(2, RoundingMode.HALF_UP);\n }\n processedRuns.add(runId);\n ytdGross = ytdGross.add(gross); ytdRetirement = ytdRetirement.add(retirement); ytdTax = ytdTax.add(tax); ytdNet = ytdNet.add(net);\n payrollLog.add(\"PAY:\" + runId + \":ret=\" + retirement + \":tax=\" + tax + \":health=\" + health + \":garnish=\" + garnishment + \":net=\" + net);\n return new Paycheck(retirement, tax, health, garnishment, net);\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n Paycheck p1 = runPayroll(\"R1\", new BigDecimal(\"2000.00\"));\n // Retirement 100; taxable 1900; tax 100 + 180 = 280; health 200; disposable 1420; garnishment 213; net 1207.\n assert p1.retirement.compareTo(new BigDecimal(\"100.00\")) == 0 : \"ret=\" + p1.retirement;\n assert p1.tax.compareTo(new BigDecimal(\"280.00\")) == 0 : \"tax=\" + p1.tax;\n assert p1.garnishment.compareTo(new BigDecimal(\"213.00\")) == 0 : \"garnish=\" + p1.garnishment;\n assert p1.net.compareTo(new BigDecimal(\"1207.00\")) == 0 : \"net=\" + p1.net;\n assert ytdNet.compareTo(new BigDecimal(\"1207.00\")) == 0 : \"ytdNet=\" + ytdNet;\n int visibleChecksDone = 1;\n }\n}\n","assertions":" assert visibleChecksDone == 1;\n int logsBeforeDup = JavaCPMutation4.payrollLog.size();\n BigDecimal ytdBeforeDup = JavaCPMutation4.ytdNet;\n Paycheck dup = JavaCPMutation4.runPayroll(\"R1\", new BigDecimal(\"9999.00\"));\n assert dup == null : \"duplicate should return null\";\n assert JavaCPMutation4.payrollLog.size() == logsBeforeDup : \"duplicate logged\";\n assert JavaCPMutation4.ytdNet.compareTo(ytdBeforeDup) == 0 : \"duplicate changed ytd\";\n\n Paycheck low = JavaCPMutation4.runPayroll(\"R2\", new BigDecimal(\"800.00\"));\n // Retirement 40, tax 76, gross left before health 684. Health must reduce from 200 to 184 to preserve $500 net, garnishment zero.\n assert low.retirement.compareTo(new BigDecimal(\"40.00\")) == 0 : \"low ret=\" + low.retirement;\n assert low.tax.compareTo(new BigDecimal(\"76.00\")) == 0 : \"low tax=\" + low.tax;\n assert low.health.compareTo(new BigDecimal(\"184.00\")) == 0 : \"low health=\" + low.health;\n assert low.garnishment.compareTo(new BigDecimal(\"0.00\")) == 0 : \"low garnish=\" + low.garnishment;\n assert low.net.compareTo(new BigDecimal(\"500.00\")) == 0 : \"low net=\" + low.net;\n\n JavaCPMutation4.ytdRetirement = new BigDecimal(\"990.00\");\n Paycheck capped = JavaCPMutation4.runPayroll(\"R3\", new BigDecimal(\"1000.00\"));\n assert capped.retirement.compareTo(new BigDecimal(\"10.00\")) == 0 : \"ret cap=\" + capped.retirement;\n assert JavaCPMutation4.ytdRetirement.compareTo(new BigDecimal(\"1000.00\")) == 0 : \"ytd ret cap=\" + JavaCPMutation4.ytdRetirement;\n","category":"code_purpose_understanding"} {"id":"5","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class JavaCPMutation5 {\n static class Grant {\n final String id;\n final String sku;\n int remaining;\n final int startDay;\n final int endDay;\n Grant(String id, String sku, int units, int startDay, int endDay) {\n this.id = id; this.sku = sku; this.remaining = units; this.startDay = startDay; this.endDay = endDay;\n }\n }\n static class Deny {\n final String sku;\n final int units;\n final int startDay;\n final int endDay;\n Deny(String sku, int units, int startDay, int endDay) {\n this.sku = sku; this.units = units; this.startDay = startDay; this.endDay = endDay;\n }\n }\n\n static List\u003cGrant\u003e grants = new ArrayList\u003c\u003e();\n static List\u003cDeny\u003e denies = new ArrayList\u003c\u003e();\n static Map\u003cString, List\u003cString\u003e\u003e tickets = new HashMap\u003c\u003e();\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n static void reset() { grants.clear(); denies.clear(); tickets.clear(); auditLog.clear(); }\n static void addGrant(String id, String sku, int units, int startDay, int endDay) { grants.add(new Grant(id, sku, units, startDay, endDay)); }\n static void addDeny(String sku, int units, int startDay, int endDay) { denies.add(new Deny(sku, units, startDay, endDay)); }\n static int remainingInGrant(String id) { for (Grant g : grants) if (g.id.equals(id)) return g.remaining; return 0; }\n\n // Consume entitlements for one request.\n // Rules:\n // 1. requestId is idempotent: return a copy of the saved ticket before checking current grants.\n // 2. Active grants match sku, have remaining units, and satisfy startDay \u003c= day \u003c= endDay.\n // 3. Active deny entries for the sku reserve units that must remain unused that day.\n // 4. If activeGrantRemaining - activeDenyUnits is less than requested units, return null with no mutation or audit.\n // 5. Otherwise consume from active grants expiring soonest, then by grant id, removing depleted grants.\n // 6. Save and audit ticket lines USE:\u003cgrantId\u003e:\u003cunits\u003e.\n static List\u003cString\u003e consume(String requestId, String sku, int units, int day) {\n","golden_completion":" if (tickets.containsKey(requestId)) return new ArrayList\u003c\u003e(tickets.get(requestId));\n if (units \u003c= 0) throw new IllegalArgumentException(\"units\");\n List\u003cGrant\u003e active = new ArrayList\u003c\u003e();\n int total = 0, protectedUnits = 0;\n for (Grant g : grants) if (g.sku.equals(sku) \u0026\u0026 g.remaining \u003e 0 \u0026\u0026 g.startDay \u003c= day \u0026\u0026 day \u003c= g.endDay) { active.add(g); total += g.remaining; }\n for (Deny d : denies) if (d.sku.equals(sku) \u0026\u0026 d.startDay \u003c= day \u0026\u0026 day \u003c= d.endDay) protectedUnits += d.units;\n if (total - protectedUnits \u003c units) return null;\n active.sort(Comparator.comparingInt((Grant g) -\u003e g.endDay).thenComparing(g -\u003e g.id));\n List\u003cString\u003e ticket = new ArrayList\u003c\u003e();\n int needed = units;\n for (Grant g : active) {\n if (needed == 0) break;\n int take = Math.min(needed, g.remaining);\n g.remaining -= take; needed -= take;\n String line = \"USE:\" + g.id + \":\" + take;\n ticket.add(line); auditLog.add(requestId + \":\" + line);\n }\n grants.removeIf(g -\u003e g.remaining == 0);\n tickets.put(requestId, new ArrayList\u003c\u003e(ticket));\n return new ArrayList\u003c\u003e(ticket);\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n addGrant(\"G1\", \"API\", 5, 0, 10);\n addGrant(\"G2\", \"API\", 10, 0, 20);\n addDeny(\"API\", 2, 5, 15);\n List\u003cString\u003e t1 = consume(\"R1\", \"API\", 4, 6);\n assert t1.equals(List.of(\"USE:G1:4\")) : \"ticket=\" + t1;\n assert remainingInGrant(\"G1\") == 1 : \"G1 remaining\";\n assert remainingInGrant(\"G2\") == 10 : \"G2 remaining\";\n int visibleChecksDone = 1;\n }\n}\n","assertions":" assert visibleChecksDone == 1;\n int auditBeforeDup = JavaCPMutation5.auditLog.size();\n List\u003cString\u003e dup = JavaCPMutation5.consume(\"R1\", \"API\", 99, 6);\n assert dup.equals(List.of(\"USE:G1:4\")) : \"dup=\" + dup;\n assert JavaCPMutation5.auditLog.size() == auditBeforeDup : \"duplicate audited\";\n assert JavaCPMutation5.remainingInGrant(\"G1\") == 1 : \"duplicate mutated\";\n\n List\u003cString\u003e tooMuch = JavaCPMutation5.consume(\"R2\", \"API\", 10, 6);\n assert tooMuch == null : \"deny-protected units should make this insufficient\";\n assert JavaCPMutation5.remainingInGrant(\"G1\") == 1 \u0026\u0026 JavaCPMutation5.remainingInGrant(\"G2\") == 10 : \"insufficient mutated grants\";\n\n List\u003cString\u003e t3 = JavaCPMutation5.consume(\"R3\", \"API\", 9, 6);\n assert t3.equals(List.of(\"USE:G1:1\", \"USE:G2:8\")) : \"t3=\" + t3;\n assert JavaCPMutation5.remainingInGrant(\"G1\") == 0 : \"G1 should be removed\";\n assert JavaCPMutation5.remainingInGrant(\"G2\") == 2 : \"G2 protected remainder\";\n\n JavaCPMutation5.reset();\n JavaCPMutation5.addGrant(\"E1\", \"STORAGE\", 3, 2, 4);\n JavaCPMutation5.addGrant(\"E2\", \"STORAGE\", 3, 2, 5);\n List\u003cString\u003e boundary = JavaCPMutation5.consume(\"R4\", \"STORAGE\", 3, 4);\n assert boundary.equals(List.of(\"USE:E1:3\")) : \"end day is inclusive\";\n assert JavaCPMutation5.consume(\"R5\", \"STORAGE\", 3, 6) == null : \"expired grants should not be active\";\n","category":"code_purpose_understanding"} {"id":"6","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class JavaCPMutation6 {\n static class UsageEvent {\n final String id;\n final int units;\n boolean billed;\n UsageEvent(String id, int units) { this.id = id; this.units = units; this.billed = false; }\n }\n static class Invoice {\n final BigDecimal subtotal;\n final BigDecimal creditApplied;\n final BigDecimal due;\n final int units;\n Invoice(BigDecimal subtotal, BigDecimal creditApplied, BigDecimal due, int units) {\n this.subtotal = subtotal; this.creditApplied = creditApplied; this.due = due; this.units = units;\n }\n }\n\n static List\u003cUsageEvent\u003e events = new ArrayList\u003c\u003e();\n static LinkedList\u003cBigDecimal\u003e creditBuckets = new LinkedList\u003c\u003e();\n static Map\u003cString, Invoice\u003e invoices = new HashMap\u003c\u003e();\n static BigDecimal totalInvoiced = BigDecimal.ZERO;\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n static void reset() { events.clear(); creditBuckets.clear(); invoices.clear(); totalInvoiced = BigDecimal.ZERO; auditLog.clear(); }\n static void addUsage(String id, int units) { events.add(new UsageEvent(id, units)); }\n static void addCredit(BigDecimal amount) { creditBuckets.add(amount.setScale(2, RoundingMode.HALF_UP)); }\n static long billedCount() { return events.stream().filter(e -\u003e e.billed).count(); }\n\n // Close a billing period for all currently unbilled usage events.\n // Rules:\n // 1. invoiceId is idempotent: return the saved Invoice before touching credits or events.\n // 2. Only unbilled events are included, and they are marked billed only after amount due is computed.\n // 3. Included units are free; units above includedUnits are charged at overageRate.\n // 4. The subtotal is max(overageCharge, minimumCommit) before any credits are applied.\n // 5. Credits apply FIFO across creditBuckets and may reduce due to zero; partially used buckets keep their remainder.\n // 6. Save the invoice, add due to totalInvoiced, and audit INVOICE:\u003cid\u003e:units=\u003cu\u003e:credit=\u003cc\u003e:due=\u003cd\u003e.\n static Invoice closePeriod(String invoiceId, int includedUnits, BigDecimal minimumCommit, BigDecimal overageRate) {\n","golden_completion":" if (invoices.containsKey(invoiceId)) return invoices.get(invoiceId);\n List\u003cUsageEvent\u003e batch = new ArrayList\u003c\u003e();\n int units = 0;\n for (UsageEvent e : events) if (!e.billed) { batch.add(e); units += e.units; }\n int overUnits = Math.max(0, units - includedUnits);\n BigDecimal overage = new BigDecimal(overUnits).multiply(overageRate).setScale(2, RoundingMode.HALF_UP);\n BigDecimal subtotal = overage.compareTo(minimumCommit) \u003c 0 ? minimumCommit.setScale(2, RoundingMode.HALF_UP) : overage;\n BigDecimal due = subtotal;\n BigDecimal creditApplied = BigDecimal.ZERO.setScale(2);\n while (due.compareTo(BigDecimal.ZERO) \u003e 0 \u0026\u0026 !creditBuckets.isEmpty()) {\n BigDecimal bucket = creditBuckets.removeFirst();\n BigDecimal use = bucket.min(due).setScale(2, RoundingMode.HALF_UP);\n creditApplied = creditApplied.add(use).setScale(2, RoundingMode.HALF_UP);\n due = due.subtract(use).setScale(2, RoundingMode.HALF_UP);\n if (bucket.compareTo(use) \u003e 0) creditBuckets.addFirst(bucket.subtract(use).setScale(2, RoundingMode.HALF_UP));\n }\n for (UsageEvent e : batch) e.billed = true;\n Invoice inv = new Invoice(subtotal, creditApplied, due, units);\n invoices.put(invoiceId, inv); totalInvoiced = totalInvoiced.add(due).setScale(2, RoundingMode.HALF_UP);\n auditLog.add(\"INVOICE:\" + invoiceId + \":units=\" + units + \":credit=\" + creditApplied + \":due=\" + due);\n return inv;\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n addUsage(\"E1\", 60);\n addUsage(\"E2\", 50);\n addCredit(new BigDecimal(\"30.00\"));\n Invoice i1 = closePeriod(\"INV1\", 100, new BigDecimal(\"100.00\"), new BigDecimal(\"2.00\"));\n // 110 units, 10 overage units at $2 = $20, minimum commit raises subtotal to $100, then $30 credit leaves $70 due.\n assert i1.subtotal.compareTo(new BigDecimal(\"100.00\")) == 0 : \"subtotal=\" + i1.subtotal;\n assert i1.creditApplied.compareTo(new BigDecimal(\"30.00\")) == 0 : \"credit=\" + i1.creditApplied;\n assert i1.due.compareTo(new BigDecimal(\"70.00\")) == 0 : \"due=\" + i1.due;\n assert billedCount() == 2 : \"events billed\";\n int visibleChecksDone = 1;\n }\n}\n","assertions":" assert visibleChecksDone == 1;\n int auditBeforeDup = JavaCPMutation6.auditLog.size();\n BigDecimal totalBeforeDup = JavaCPMutation6.totalInvoiced;\n Invoice dup = JavaCPMutation6.closePeriod(\"INV1\", 0, BigDecimal.ZERO, new BigDecimal(\"99.00\"));\n assert dup.due.compareTo(new BigDecimal(\"70.00\")) == 0 : \"duplicate due=\" + dup.due;\n assert JavaCPMutation6.auditLog.size() == auditBeforeDup : \"duplicate audited\";\n assert JavaCPMutation6.totalInvoiced.compareTo(totalBeforeDup) == 0 : \"duplicate total\";\n\n JavaCPMutation6.addUsage(\"E3\", 20);\n JavaCPMutation6.addCredit(new BigDecimal(\"50.00\"));\n JavaCPMutation6.addCredit(new BigDecimal(\"100.00\"));\n Invoice i2 = JavaCPMutation6.closePeriod(\"INV2\", 0, new BigDecimal(\"10.00\"), new BigDecimal(\"2.00\"));\n assert i2.units == 20 : \"only new event units=\" + i2.units;\n assert i2.subtotal.compareTo(new BigDecimal(\"40.00\")) == 0 : \"i2 subtotal=\" + i2.subtotal;\n assert i2.creditApplied.compareTo(new BigDecimal(\"40.00\")) == 0 : \"i2 credit=\" + i2.creditApplied;\n assert i2.due.compareTo(new BigDecimal(\"0.00\")) == 0 : \"i2 due=\" + i2.due;\n assert JavaCPMutation6.creditBuckets.size() == 2 : \"credit bucket count=\" + JavaCPMutation6.creditBuckets;\n assert JavaCPMutation6.creditBuckets.getFirst().compareTo(new BigDecimal(\"10.00\")) == 0 : \"partial FIFO remainder=\" + JavaCPMutation6.creditBuckets.getFirst();\n assert JavaCPMutation6.billedCount() == 3 : \"all events billed\";\n","category":"code_purpose_understanding"} {"id":"7","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class JavaCPMutation7 {\n static class Release {\n final String status;\n final BigDecimal payable;\n final BigDecimal holdback;\n final BigDecimal defectReserve;\n Release(String status, BigDecimal payable, BigDecimal holdback, BigDecimal defectReserve) {\n this.status = status; this.payable = payable; this.holdback = holdback; this.defectReserve = defectReserve;\n }\n }\n\n static BigDecimal contractTotal = new BigDecimal(\"100000.00\");\n static BigDecimal holdbackRate = new BigDecimal(\"0.10\");\n static BigDecimal defectReserveRate = new BigDecimal(\"0.50\");\n static int approvedProgressPct = 0;\n static BigDecimal totalReleased = BigDecimal.ZERO;\n static BigDecimal holdback = BigDecimal.ZERO;\n static BigDecimal defectReserve = BigDecimal.ZERO;\n static String status = \"ACTIVE\";\n static Set\u003cString\u003e processedReleaseIds = new HashSet\u003c\u003e();\n static List\u003cString\u003e escrowLog = new ArrayList\u003c\u003e();\n\n static void reset() {\n approvedProgressPct = 0; totalReleased = BigDecimal.ZERO; holdback = BigDecimal.ZERO; defectReserve = BigDecimal.ZERO;\n status = \"ACTIVE\"; processedReleaseIds.clear(); escrowLog.clear();\n }\n static BigDecimal pctAmount(int pct) {\n return contractTotal.multiply(new BigDecimal(pct)).divide(new BigDecimal(\"100\"), 2, RoundingMode.HALF_UP);\n }\n\n // Record an escrow release from cumulative construction progress.\n // Rules:\n // 1. releaseId is idempotent: duplicates return null before validation or mutation.\n // 2. Progress must strictly increase and cannot exceed 100; invalid progress returns INVALID with no mutation.\n // 3. Pay only the delta since approvedProgressPct, not the cumulative percent.\n // 4. Hold back 10% of each gross delta until final acceptance.\n // 5. If defects are open, pay only 50% of the net-after-holdback and move the rest to defectReserve.\n // 6. On finalAcceptance at 100% with no defects, release current net plus all holdback and defectReserve, zero both, and mark COMPLETE.\n static Release recordProgress(String releaseId, int newProgressPct, boolean defectsOpen, boolean finalAcceptance) {\n","golden_completion":" BigDecimal z = BigDecimal.ZERO.setScale(2);\n if (processedReleaseIds.contains(releaseId)) return null;\n if (status.equals(\"COMPLETE\")) return new Release(\"CLOSED\", z, holdback, defectReserve);\n if (newProgressPct \u003c= approvedProgressPct || newProgressPct \u003e 100) return new Release(\"INVALID\", z, holdback, defectReserve);\n int deltaPct = newProgressPct - approvedProgressPct;\n BigDecimal gross = pctAmount(deltaPct);\n BigDecimal heldNow = gross.multiply(holdbackRate).setScale(2, RoundingMode.HALF_UP);\n BigDecimal net = gross.subtract(heldNow).setScale(2, RoundingMode.HALF_UP);\n BigDecimal payable = net;\n BigDecimal reserveNow = z;\n if (defectsOpen) {\n reserveNow = net.multiply(defectReserveRate).setScale(2, RoundingMode.HALF_UP);\n payable = net.subtract(reserveNow).setScale(2, RoundingMode.HALF_UP);\n }\n holdback = holdback.add(heldNow).setScale(2, RoundingMode.HALF_UP); defectReserve = defectReserve.add(reserveNow).setScale(2, RoundingMode.HALF_UP);\n if (finalAcceptance \u0026\u0026 newProgressPct == 100 \u0026\u0026 !defectsOpen) { payable = payable.add(holdback).add(defectReserve).setScale(2, RoundingMode.HALF_UP); holdback = z; defectReserve = z; status = \"COMPLETE\"; }\n approvedProgressPct = newProgressPct;\n totalReleased = totalReleased.add(payable).setScale(2, RoundingMode.HALF_UP);\n processedReleaseIds.add(releaseId);\n escrowLog.add(\"RELEASE:\" + releaseId + \":pct=\" + newProgressPct + \":payable=\" + payable + \":status=\" + status);\n return new Release(status, payable, holdback, defectReserve);\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n Release r1 = recordProgress(\"REL1\", 30, false, false);\n // 30% delta = $30000, 10% holdback = $3000, payable = $27000.\n assert r1.payable.compareTo(new BigDecimal(\"27000.00\")) == 0 : \"r1 payable=\" + r1.payable;\n assert holdback.compareTo(new BigDecimal(\"3000.00\")) == 0 : \"holdback=\" + holdback;\n Release r2 = recordProgress(\"REL2\", 50, true, false);\n // 20% delta = $20000, holdback $2000, net $18000; defects reserve half, pay half.\n assert r2.payable.compareTo(new BigDecimal(\"9000.00\")) == 0 : \"r2 payable=\" + r2.payable;\n assert defectReserve.compareTo(new BigDecimal(\"9000.00\")) == 0 : \"reserve=\" + defectReserve;\n assert totalReleased.compareTo(new BigDecimal(\"36000.00\")) == 0 : \"released=\" + totalReleased;\n int visibleChecksDone = 1;\n }\n}\n","assertions":" assert visibleChecksDone == 1;\n int logBeforeDup = JavaCPMutation7.escrowLog.size();\n Release dup = JavaCPMutation7.recordProgress(\"REL1\", 100, false, true);\n assert dup == null : \"duplicate should return null\";\n assert JavaCPMutation7.escrowLog.size() == logBeforeDup : \"duplicate logged\";\n assert JavaCPMutation7.approvedProgressPct == 50 : \"duplicate changed progress\";\n\n Release invalid = JavaCPMutation7.recordProgress(\"REL3\", 45, false, false);\n assert invalid.status.equals(\"INVALID\") : \"invalid status=\" + invalid.status;\n assert JavaCPMutation7.totalReleased.compareTo(new BigDecimal(\"36000.00\")) == 0 : \"invalid changed release\";\n assert JavaCPMutation7.holdback.compareTo(new BigDecimal(\"5000.00\")) == 0 : \"invalid changed holdback\";\n\n Release finalRel = JavaCPMutation7.recordProgress(\"REL4\", 100, false, true);\n assert finalRel.status.equals(\"COMPLETE\") : \"final status=\" + finalRel.status;\n assert finalRel.payable.compareTo(new BigDecimal(\"64000.00\")) == 0 : \"final payable=\" + finalRel.payable;\n assert JavaCPMutation7.totalReleased.compareTo(new BigDecimal(\"100000.00\")) == 0 : \"total released=\" + JavaCPMutation7.totalReleased;\n assert JavaCPMutation7.holdback.compareTo(new BigDecimal(\"0.00\")) == 0 : \"holdback zero\";\n assert JavaCPMutation7.defectReserve.compareTo(new BigDecimal(\"0.00\")) == 0 : \"reserve zero\";\n Release closed = JavaCPMutation7.recordProgress(\"REL5\", 100, false, true);\n assert closed.status.equals(\"CLOSED\") : \"closed status=\" + closed.status;\n","category":"code_purpose_understanding"} {"id":"8","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask8 {\n // Tax brackets: [upperBound, rate%] (marginal)\n // 0-1000: 10%, 1001-3000: 20%, 3001+: 30%\n static int[][] taxBrackets = {{1000, 10}, {3000, 20}, {Integer.MAX_VALUE, 30}};\n static BigDecimal healthDeduction = new BigDecimal(\"200.00\");\n static BigDecimal retirementRate = new BigDecimal(\"0.05\"); // 5% of gross\n static BigDecimal garnishmentRate = new BigDecimal(\"0.10\"); // 10% of post-tax\n static BigDecimal minimumNetPay = new BigDecimal(\"500.00\");\n static BigDecimal ytdGross = BigDecimal.ZERO;\n static BigDecimal ytdTax = BigDecimal.ZERO;\n static BigDecimal ytdNet = BigDecimal.ZERO;\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n static BigDecimal computeMarginalTax(BigDecimal gross) {\n BigDecimal tax = BigDecimal.ZERO;\n BigDecimal rem = gross;\n int prev = 0;\n for (int[] bracket : taxBrackets) {\n BigDecimal width = new BigDecimal(Math.min(rem.intValue(), bracket[0] - prev));\n if (width.compareTo(BigDecimal.ZERO) \u003c= 0) break;\n tax = tax.add(width.multiply(new BigDecimal(bracket[1])).divide(new BigDecimal(\"100\"), 2, RoundingMode.HALF_UP));\n rem = rem.subtract(width);\n prev = bracket[0];\n }\n return tax;\n }\n\n // calculatePay(grossPay):\n // 1. Compute marginal tax using computeMarginalTax(grossPay)\n // 2. postTax = grossPay - tax\n // 3. Deductions (from postTax): health (flat) + retirement (5% of gross)\n // totalDeductions = health + retirement\n // 4. Garnishment: 10% of postTax (NOT post-deduction)\n // 5. netPay = postTax - totalDeductions - garnishment\n // 6. If netPay \u003c minimumNetPay, clamp: reduce garnishment first, then deductions\n // Garnishment reduces to max(0, garnishment - shortfall)\n // If still short, reduce totalDeductions by remaining shortfall\n // Recompute netPay after adjustments\n // 7. Update YTD accumulators (ytdGross, ytdTax, ytdNet)\n // 8. Append audit: \"PAY:gross=G,tax=T,ded=D,garn=GA,net=N\"\n // 9. Return netPay\n","golden_completion":" static BigDecimal calculatePay(BigDecimal grossPay) {\n BigDecimal tax = computeMarginalTax(grossPay);\n BigDecimal postTax = grossPay.subtract(tax);\n BigDecimal retirement = grossPay.multiply(retirementRate).setScale(2, RoundingMode.HALF_UP);\n BigDecimal ded = healthDeduction.add(retirement);\n BigDecimal garn = postTax.multiply(garnishmentRate).setScale(2, RoundingMode.HALF_UP);\n BigDecimal netPay = postTax.subtract(ded).subtract(garn);\n if (netPay.compareTo(minimumNetPay) \u003c 0) {\n BigDecimal shortfall = minimumNetPay.subtract(netPay);\n BigDecimal garnReduction = shortfall.min(garn);\n garn = garn.subtract(garnReduction);\n shortfall = shortfall.subtract(garnReduction);\n ded = ded.subtract(shortfall.min(ded));\n netPay = postTax.subtract(ded).subtract(garn);\n }\n ytdGross = ytdGross.add(grossPay);\n ytdTax = ytdTax.add(tax);\n ytdNet = ytdNet.add(netPay);\n auditLog.add(\"PAY:gross=\" + grossPay + \",tax=\" + tax + \",ded=\" + ded + \",garn=\" + garn + \",net=\" + netPay);\n return netPay;\n }\n","suffix":"\n public static void main(String[] args) {\n // grossPay = 5000\n // tax: 1000*10% + 2000*20% + 2000*30% = 100 + 400 + 600 = 1100\n // postTax = 3900\n // health=200, retirement=250, ded=450\n // garnishment = 390 (10% of 3900)\n // net = 3900 - 450 - 390 = 3060 (above minimum, no clamping)\n BigDecimal net = calculatePay(new BigDecimal(\"5000\"));\n assert net.compareTo(new BigDecimal(\"3060.00\")) == 0 : \"net=\" + net;\n assert ytdGross.compareTo(new BigDecimal(\"5000\")) == 0;\n assert ytdNet.compareTo(new BigDecimal(\"3060.00\")) == 0;\n }\n}\n","assertions":"\n // Reset\n ytdGross = BigDecimal.ZERO; ytdTax = BigDecimal.ZERO; ytdNet = BigDecimal.ZERO; auditLog.clear();\n\n // Low pay triggers minimum net clamping\n // grossPay = 1000\n // tax: 1000*10% = 100\n // postTax = 900\n // health=200, retirement=50, ded=250\n // garnishment = 90 (10% of 900)\n // netPay = 900 - 250 - 90 = 560 (above 500, no clamping)\n BigDecimal n2 = calculatePay(new BigDecimal(\"1000\"));\n assert n2.compareTo(new BigDecimal(\"560.00\")) == 0 : \"n2=\" + n2;\n\n // Very low pay triggers clamping\n // grossPay = 800\n // tax: 800*10% = 80\n // postTax = 720\n // health=200, retirement=40, ded=240\n // garnishment = 72 (10% of 720)\n // raw net = 720 - 240 - 72 = 408\n // shortfall = 500 - 408 = 92\n // reduce garn by min(92, 72) = 72, garn=0, shortfall=20\n // reduce ded by min(20, 240) = 20, ded=220\n // net = 720 - 220 - 0 = 500\n ytdGross = BigDecimal.ZERO; ytdTax = BigDecimal.ZERO; ytdNet = BigDecimal.ZERO; auditLog.clear();\n BigDecimal n3 = calculatePay(new BigDecimal(\"800\"));\n assert n3.compareTo(new BigDecimal(\"500.00\")) == 0 : \"clamped n3=\" + n3;\n\n // YTD accumulator across multiple runs\n ytdGross = BigDecimal.ZERO; ytdTax = BigDecimal.ZERO; ytdNet = BigDecimal.ZERO; auditLog.clear();\n calculatePay(new BigDecimal(\"5000\"));\n calculatePay(new BigDecimal(\"5000\"));\n assert ytdGross.compareTo(new BigDecimal(\"10000\")) == 0;\n assert ytdNet.compareTo(new BigDecimal(\"6120.00\")) == 0 : \"ytdNet=\" + ytdNet;\n","category":"code_purpose_understanding"} {"id":"9","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask9 {\n static BigDecimal copay = new BigDecimal(\"30.00\");\n static BigDecimal annualDeductible = new BigDecimal(\"500.00\");\n static BigDecimal coinsuranceRate = new BigDecimal(\"0.20\"); // patient pays 20%\n static BigDecimal oopMax = new BigDecimal(\"2000.00\");\n static BigDecimal ytdDeductibleMet = BigDecimal.ZERO;\n static BigDecimal ytdOop = BigDecimal.ZERO;\n static Set\u003cString\u003e processedClaims = new HashSet\u003c\u003e();\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n // adjudicate(claimId, billedAmount):\n // 1. Idempotent: if claimId already processed, return null\n // 2. Start with patientOwes = 0\n // 3. Copay: patientOwes += copay (always charged, counts toward OOP)\n // 4. After copay, remainingBill = billedAmount - copay\n // 5. Deductible: deductibleRemaining = annualDeductible - ytdDeductibleMet\n // deductibleCharge = min(remainingBill, deductibleRemaining)\n // patientOwes += deductibleCharge, ytdDeductibleMet += deductibleCharge\n // remainingBill -= deductibleCharge\n // 6. Coinsurance: coinsuranceCharge = remainingBill * coinsuranceRate\n // patientOwes += coinsuranceCharge\n // 7. OOP cap: if (ytdOop + patientOwes) \u003e oopMax, patientOwes = oopMax - ytdOop\n // (clamp so YTD OOP doesn\u0027t exceed max; if already at max, patientOwes = 0)\n // 8. ytdOop += patientOwes\n // 9. Mark claim processed, append audit: \"CLAIM:id=I,billed=B,patientOwes=P\"\n // 10. Return patientOwes\n","golden_completion":" static BigDecimal adjudicate(String claimId, BigDecimal billedAmount) {\n if (processedClaims.contains(claimId)) return null;\n BigDecimal patientOwes = copay;\n BigDecimal remainingBill = billedAmount.subtract(copay);\n BigDecimal deductibleRemaining = annualDeductible.subtract(ytdDeductibleMet);\n BigDecimal deductibleCharge = remainingBill.min(deductibleRemaining);\n patientOwes = patientOwes.add(deductibleCharge);\n ytdDeductibleMet = ytdDeductibleMet.add(deductibleCharge);\n remainingBill = remainingBill.subtract(deductibleCharge);\n BigDecimal coinsuranceCharge = remainingBill.multiply(coinsuranceRate).setScale(2, RoundingMode.HALF_UP);\n patientOwes = patientOwes.add(coinsuranceCharge);\n BigDecimal maxAllowed = oopMax.subtract(ytdOop);\n if (patientOwes.compareTo(maxAllowed) \u003e 0) {\n patientOwes = maxAllowed.max(BigDecimal.ZERO);\n }\n ytdOop = ytdOop.add(patientOwes);\n processedClaims.add(claimId);\n auditLog.add(\"CLAIM:id=\" + claimId + \",billed=\" + billedAmount + \",patientOwes=\" + patientOwes);\n return patientOwes;\n }\n","suffix":"\n public static void main(String[] args) {\n // First claim: $1000 billed\n // copay=30, remaining=970, deductible=min(970,500)=500, remaining=470\n // coinsurance=470*0.20=94, patientOwes=30+500+94=624\n // OOP cap check: 0+624 \u003c 2000, no cap\n BigDecimal p1 = adjudicate(\"C1\", new BigDecimal(\"1000.00\"));\n assert p1.compareTo(new BigDecimal(\"624.00\")) == 0 : \"p1=\" + p1;\n assert ytdDeductibleMet.compareTo(new BigDecimal(\"500.00\")) == 0;\n assert ytdOop.compareTo(new BigDecimal(\"624.00\")) == 0;\n }\n}\n","assertions":"\n // Idempotency\n BigDecimal dup = adjudicate(\"C1\", new BigDecimal(\"1000.00\"));\n assert dup == null : \"idempotent should return null\";\n assert ytdOop.compareTo(new BigDecimal(\"624.00\")) == 0 : \"OOP unchanged\";\n\n // Second claim: deductible already fully met\n // billed=2000, copay=30, remaining=1970, deductible=0, coinsurance=1970*0.20=394\n // patientOwes=30+0+394=424\n // OOP: 624+424=1048 \u003c 2000, no cap\n BigDecimal p2 = adjudicate(\"C2\", new BigDecimal(\"2000.00\"));\n assert p2.compareTo(new BigDecimal(\"424.00\")) == 0 : \"p2=\" + p2;\n\n // Large claim that hits OOP cap\n // billed=10000, copay=30, remaining=9970, deductible=0, coinsurance=9970*0.20=1994\n // patientOwes=30+0+1994=2024\n // OOP: 1048+2024=3072 \u003e 2000, clamp: patientOwes = 2000-1048 = 952\n BigDecimal p3 = adjudicate(\"C3\", new BigDecimal(\"10000.00\"));\n assert p3.compareTo(new BigDecimal(\"952.00\")) == 0 : \"OOP capped p3=\" + p3;\n assert ytdOop.compareTo(new BigDecimal(\"2000.00\")) == 0 : \"at OOP max\";\n\n // After OOP max reached, patient owes nothing\n BigDecimal p4 = adjudicate(\"C4\", new BigDecimal(\"5000.00\"));\n assert p4.compareTo(BigDecimal.ZERO) == 0 : \"at OOP max, owes nothing p4=\" + p4;\n","category":"code_purpose_understanding"} {"id":"10","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class JavaCPMutation10 {\n static class PaymentResult {\n final String status;\n final BigDecimal fees;\n final BigDecimal interest;\n final BigDecimal principal;\n final BigDecimal escrow;\n final BigDecimal suspense;\n PaymentResult(String status, BigDecimal fees, BigDecimal interest, BigDecimal principal, BigDecimal escrow, BigDecimal suspense) {\n this.status = status; this.fees = fees; this.interest = interest; this.principal = principal; this.escrow = escrow; this.suspense = suspense;\n }\n }\n\n static String loanStatus = \"DELINQUENT\";\n static BigDecimal feesDue = new BigDecimal(\"20.00\");\n static BigDecimal interestDue = new BigDecimal(\"100.00\");\n static BigDecimal principalDue = new BigDecimal(\"500.00\");\n static BigDecimal escrowShortage = new BigDecimal(\"50.00\");\n static BigDecimal suspense = BigDecimal.ZERO;\n static BigDecimal recovered = BigDecimal.ZERO;\n static BigDecimal recoveryTarget = new BigDecimal(\"200.00\");\n static boolean lateFeeAssessed = false;\n static Set\u003cString\u003e processedPayments = new HashSet\u003c\u003e();\n static List\u003cString\u003e paymentLog = new ArrayList\u003c\u003e();\n\n static void resetNormal() {\n loanStatus = \"DELINQUENT\"; feesDue = new BigDecimal(\"20.00\"); interestDue = new BigDecimal(\"100.00\");\n principalDue = new BigDecimal(\"500.00\"); escrowShortage = new BigDecimal(\"50.00\"); suspense = BigDecimal.ZERO;\n recovered = BigDecimal.ZERO; recoveryTarget = new BigDecimal(\"200.00\"); lateFeeAssessed = false; processedPayments.clear(); paymentLog.clear();\n }\n static BigDecimal take(BigDecimal[] amount, BigDecimal due) {\n BigDecimal paid = amount[0].min(due).setScale(2, RoundingMode.HALF_UP);\n amount[0] = amount[0].subtract(paid).setScale(2, RoundingMode.HALF_UP);\n return paid;\n }\n\n // Apply a loan payment.\n // Rules:\n // 1. paymentId is idempotent: duplicates return null before validation or late-fee assessment.\n // 2. Nonpositive amounts throw without mutation.\n // 3. If loan is CHARGED_OFF, route payment to recovered up to recoveryTarget, then suspense; do not reduce normal balances.\n // 4. For active loans, assess one $25 late fee before the waterfall when daysLate \u003e 10 and lateFeeAssessed is false.\n // 5. Active waterfall is fees, interest, principal, escrow shortage, then suspense.\n // 6. When fees, interest, principal, and escrow are all zero, set loanStatus to PAID_OFF.\n static PaymentResult applyPayment(String paymentId, BigDecimal amount, int daysLate) {\n","golden_completion":" BigDecimal z = BigDecimal.ZERO.setScale(2);\n if (processedPayments.contains(paymentId)) return null;\n if (amount.compareTo(BigDecimal.ZERO) \u003c= 0) throw new IllegalArgumentException(\"amount\");\n processedPayments.add(paymentId);\n BigDecimal[] rem = { amount.setScale(2, RoundingMode.HALF_UP) };\n if (loanStatus.equals(\"CHARGED_OFF\")) {\n BigDecimal recoveryLeft = recoveryTarget.subtract(recovered); if (recoveryLeft.compareTo(z) \u003c 0) recoveryLeft = z;\n BigDecimal rec = take(rem, recoveryLeft); recovered = recovered.add(rec).setScale(2, RoundingMode.HALF_UP);\n if (rem[0].compareTo(z) \u003e 0) suspense = suspense.add(rem[0]).setScale(2, RoundingMode.HALF_UP);\n paymentLog.add(\"RECOVERY:\" + paymentId + \":recovered=\" + rec + \":suspense=\" + rem[0]);\n return new PaymentResult(\"CHARGED_OFF\", z, z, z, z, rem[0]);\n }\n if (daysLate \u003e 10 \u0026\u0026 !lateFeeAssessed) { feesDue = feesDue.add(new BigDecimal(\"25.00\")); lateFeeAssessed = true; }\n BigDecimal fees = take(rem, feesDue); feesDue = feesDue.subtract(fees).setScale(2, RoundingMode.HALF_UP);\n BigDecimal interest = take(rem, interestDue); interestDue = interestDue.subtract(interest).setScale(2, RoundingMode.HALF_UP);\n BigDecimal principal = take(rem, principalDue); principalDue = principalDue.subtract(principal).setScale(2, RoundingMode.HALF_UP);\n BigDecimal escrow = take(rem, escrowShortage); escrowShortage = escrowShortage.subtract(escrow).setScale(2, RoundingMode.HALF_UP);\n if (rem[0].compareTo(z) \u003e 0) suspense = suspense.add(rem[0]).setScale(2, RoundingMode.HALF_UP);\n if (feesDue.compareTo(z) == 0 \u0026\u0026 interestDue.compareTo(z) == 0 \u0026\u0026 principalDue.compareTo(z) == 0 \u0026\u0026 escrowShortage.compareTo(z) == 0) loanStatus = \"PAID_OFF\";\n paymentLog.add(\"PAY:\" + paymentId + \":fees=\" + fees + \":interest=\" + interest + \":principal=\" + principal + \":escrow=\" + escrow + \":suspense=\" + rem[0] + \":status=\" + loanStatus);\n return new PaymentResult(loanStatus, fees, interest, principal, escrow, rem[0]);\n","suffix":" }\n\n public static void main(String[] args) {\n resetNormal();\n PaymentResult p1 = applyPayment(\"P1\", new BigDecimal(\"200.00\"), 15);\n // Late fee makes fees $45. Waterfall pays $45 fees, $100 interest, and $55 principal.\n assert p1.fees.compareTo(new BigDecimal(\"45.00\")) == 0 : \"fees=\" + p1.fees;\n assert p1.interest.compareTo(new BigDecimal(\"100.00\")) == 0 : \"interest=\" + p1.interest;\n assert p1.principal.compareTo(new BigDecimal(\"55.00\")) == 0 : \"principal=\" + p1.principal;\n assert principalDue.compareTo(new BigDecimal(\"445.00\")) == 0 : \"principalDue=\" + principalDue;\n assert lateFeeAssessed : \"late fee flag\";\n int visibleChecksDone = 1;\n }\n}\n","assertions":" assert visibleChecksDone == 1;\n int logBeforeDup = JavaCPMutation10.paymentLog.size();\n PaymentResult dup = JavaCPMutation10.applyPayment(\"P1\", new BigDecimal(\"999.00\"), 99);\n assert dup == null : \"duplicate should return null\";\n assert JavaCPMutation10.paymentLog.size() == logBeforeDup : \"duplicate logged\";\n assert JavaCPMutation10.feesDue.compareTo(new BigDecimal(\"0.00\")) == 0 : \"duplicate assessed fee\";\n\n PaymentResult payoff = JavaCPMutation10.applyPayment(\"P2\", new BigDecimal(\"600.00\"), 30);\n assert payoff.principal.compareTo(new BigDecimal(\"445.00\")) == 0 : \"payoff principal=\" + payoff.principal;\n assert payoff.escrow.compareTo(new BigDecimal(\"50.00\")) == 0 : \"payoff escrow=\" + payoff.escrow;\n assert payoff.suspense.compareTo(new BigDecimal(\"105.00\")) == 0 : \"payoff suspense=\" + payoff.suspense;\n assert JavaCPMutation10.loanStatus.equals(\"PAID_OFF\") : \"status=\" + JavaCPMutation10.loanStatus;\n assert JavaCPMutation10.suspense.compareTo(new BigDecimal(\"105.00\")) == 0 : \"suspense balance=\" + JavaCPMutation10.suspense;\n\n JavaCPMutation10.resetNormal();\n JavaCPMutation10.loanStatus = \"CHARGED_OFF\";\n PaymentResult rec = JavaCPMutation10.applyPayment(\"R1\", new BigDecimal(\"300.00\"), 99);\n assert rec.status.equals(\"CHARGED_OFF\") : \"recovery status=\" + rec.status;\n assert JavaCPMutation10.recovered.compareTo(new BigDecimal(\"200.00\")) == 0 : \"recovered=\" + JavaCPMutation10.recovered;\n assert JavaCPMutation10.suspense.compareTo(new BigDecimal(\"100.00\")) == 0 : \"recovery suspense=\" + JavaCPMutation10.suspense;\n assert JavaCPMutation10.principalDue.compareTo(new BigDecimal(\"500.00\")) == 0 : \"charged off reduced principal\";\n assert !JavaCPMutation10.lateFeeAssessed : \"charged off assessed late fee\";\n","category":"code_purpose_understanding"} {"id":"11","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.util.*;\n\npublic class CPTask11 {\n // Pharmacy refill system with controlled substance rules\n // Rules:\n // 1. Controlled substances (schedule II-III) limited to max 3 refills total\n // 2. Cannot refill if less than 75% of days_supply have elapsed since last fill\n // (i.e., earliest refill day = lastFillDay + (int)(daysSupply * 0.75))\n // 3. Every refill attempt (success or failure) appended to auditLog as\n // \"REFILL:\u003crxId\u003e:\u003cAPPROVED|DENIED_EARLY|DENIED_LIMIT\u003e\"\n\n static Map\u003cString, Integer\u003e refillCounts = new HashMap\u003c\u003e();\n static Map\u003cString, Integer\u003e lastFillDay = new HashMap\u003c\u003e();\n static Map\u003cString, Integer\u003e daysSupply = new HashMap\u003c\u003e();\n static Map\u003cString, Boolean\u003e controlled = new HashMap\u003c\u003e();\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n static void initRx(String rxId, int supply, boolean isControlled) {\n refillCounts.put(rxId, 0);\n lastFillDay.put(rxId, 0);\n daysSupply.put(rxId, supply);\n controlled.put(rxId, isControlled);\n }\n\n // Returns true if refill approved, false if denied\n","golden_completion":" static boolean requestRefill(String rxId, int currentDay) {\n boolean isControlled = controlled.getOrDefault(rxId, false);\n int count = refillCounts.getOrDefault(rxId, 0);\n int lastDay = lastFillDay.getOrDefault(rxId, 0);\n int supply = daysSupply.getOrDefault(rxId, 30);\n int earliestRefill = lastDay + (int)(supply * 0.75);\n if (currentDay \u003c earliestRefill) {\n auditLog.add(\"REFILL:\" + rxId + \":DENIED_EARLY\");\n return false;\n }\n if (isControlled \u0026\u0026 count \u003e= 3) {\n auditLog.add(\"REFILL:\" + rxId + \":DENIED_LIMIT\");\n return false;\n }\n refillCounts.put(rxId, count + 1);\n lastFillDay.put(rxId, currentDay);\n auditLog.add(\"REFILL:\" + rxId + \":APPROVED\");\n return true;\n }\n","suffix":"\n public static void main(String[] args) {\n refillCounts.clear(); lastFillDay.clear(); daysSupply.clear(); controlled.clear(); auditLog.clear();\n // Non-controlled: should allow refill after 75% of supply\n initRx(\"RX001\", 30, false);\n lastFillDay.put(\"RX001\", 10);\n assert requestRefill(\"RX001\", 32) == true : \"Should approve after 75% elapsed\";\n assert refillCounts.get(\"RX001\") == 1;\n\n // Controlled: should deny early refill\n initRx(\"RX002\", 20, true);\n lastFillDay.put(\"RX002\", 100);\n assert requestRefill(\"RX002\", 110) == false : \"Too early for refill\";\n assert auditLog.contains(\"REFILL:RX002:DENIED_EARLY\");\n }\n}\n","assertions":"\n// Test controlled substance limit (max 3 refills)\nCPTask11.refillCounts.clear();\nCPTask11.lastFillDay.clear();\nCPTask11.daysSupply.clear();\nCPTask11.controlled.clear();\nCPTask11.auditLog.clear();\nCPTask11.initRx(\"CTL1\", 10, true);\nassert CPTask11.requestRefill(\"CTL1\", 8) == true;\nassert CPTask11.requestRefill(\"CTL1\", 16) == true;\nassert CPTask11.requestRefill(\"CTL1\", 24) == true;\n// 4th refill should be denied\nassert CPTask11.requestRefill(\"CTL1\", 32) == false;\nassert CPTask11.auditLog.get(CPTask11.auditLog.size()-1).equals(\"REFILL:CTL1:DENIED_LIMIT\");\n\n// Non-controlled has no refill limit\nCPTask11.refillCounts.clear();\nCPTask11.lastFillDay.clear();\nCPTask11.daysSupply.clear();\nCPTask11.controlled.clear();\nCPTask11.auditLog.clear();\nCPTask11.initRx(\"REG1\", 10, false);\nfor (int i = 0; i \u003c 5; i++) {\n assert CPTask11.requestRefill(\"REG1\", 8 + i * 10) == true;\n}\nassert CPTask11.refillCounts.get(\"REG1\") == 5;\n\n// Early refill check: boundary — exactly at 75% mark should pass\nCPTask11.refillCounts.clear();\nCPTask11.lastFillDay.clear();\nCPTask11.daysSupply.clear();\nCPTask11.controlled.clear();\nCPTask11.auditLog.clear();\nCPTask11.initRx(\"BD1\", 20, false);\nCPTask11.lastFillDay.put(\"BD1\", 0);\n// 75% of 20 = 15, so day 15 should be allowed\nassert CPTask11.requestRefill(\"BD1\", 15) == true;\n","category":"code_purpose_understanding"} {"id":"12","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.util.*;\n\npublic class CPTask12 {\n // Lab result routing with critical value alerts\n // Rules:\n // 1. If value outside panicLow..panicHigh, route to \"STAT\" and set alert=true\n // 2. If value outside normalLow..normalHigh but inside panic range, route to \"ABNORMAL\"\n // 3. If value inside normal range, route to \"ROUTINE\"\n // 4. Delta check: if |value - previousValue| \u003e deltaThreshold, append\n // \"DELTA_ALERT\" to alerts list regardless of other routing\n // 5. Every result appended to resultLog as \"TEST:\u003ctestCode\u003e:\u003croute\u003e\"\n\n static Map\u003cString, Double\u003e previousValues = new HashMap\u003c\u003e();\n static List\u003cString\u003e alerts = new ArrayList\u003c\u003e();\n static List\u003cString\u003e resultLog = new ArrayList\u003c\u003e();\n\n static String routeResult(String testCode, double value,\n double normalLow, double normalHigh,\n double panicLow, double panicHigh,\n double deltaThreshold) {\n","golden_completion":" String route;\n boolean alert = false;\n if (value \u003c panicLow || value \u003e panicHigh) {\n route = \"STAT\";\n alert = true;\n } else if (value \u003c normalLow || value \u003e normalHigh) {\n route = \"ABNORMAL\";\n } else {\n route = \"ROUTINE\";\n }\n if (alert) {\n alerts.add(\"CRITICAL:\" + testCode);\n }\n if (previousValues.containsKey(testCode)) {\n double prev = previousValues.get(testCode);\n if (Math.abs(value - prev) \u003e deltaThreshold) {\n alerts.add(\"DELTA_ALERT\");\n }\n }\n previousValues.put(testCode, value);\n resultLog.add(\"TEST:\" + testCode + \":\" + route);\n return route;\n }\n","suffix":"\n public static void main(String[] args) {\n previousValues.clear(); alerts.clear(); resultLog.clear();\n // Normal value\n assert routeResult(\"GLU\", 95.0, 70, 110, 40, 400, 50).equals(\"ROUTINE\");\n // Abnormal but not panic\n assert routeResult(\"GLU\", 130.0, 70, 110, 40, 400, 50).equals(\"ABNORMAL\");\n // Delta alert should fire (|130-95| = 35, but threshold is 50, no delta)\n // Actually 35 \u003c 50, so no delta alert\n assert !alerts.contains(\"DELTA_ALERT\");\n\n // Panic value\n assert routeResult(\"K\", 7.5, 3.5, 5.0, 2.5, 6.5, 1.0).equals(\"STAT\");\n assert alerts.contains(\"CRITICAL:K\");\n }\n}\n","assertions":"\n// Reset state\nCPTask12.previousValues.clear();\nCPTask12.alerts.clear();\nCPTask12.resultLog.clear();\n\n// Delta check across consecutive results\nCPTask12.routeResult(\"HGB\", 14.0, 12.0, 17.0, 7.0, 20.0, 3.0);\nCPTask12.routeResult(\"HGB\", 10.0, 12.0, 17.0, 7.0, 20.0, 3.0);\n// |14-10| = 4 \u003e 3, so DELTA_ALERT should be present\nassert CPTask12.alerts.contains(\"DELTA_ALERT\") : \"Delta alert should fire\";\n// Second result is ABNORMAL (10 \u003c 12 but \u003e 7)\nassert CPTask12.resultLog.get(1).equals(\"TEST:HGB:ABNORMAL\");\n\n// Exactly on panic boundary\nCPTask12.previousValues.clear();\nCPTask12.alerts.clear();\nCPTask12.resultLog.clear();\n// value == panicLow is inside panic range (not below), should NOT be STAT\nString r = CPTask12.routeResult(\"NA\", 130.0, 136.0, 145.0, 130.0, 150.0, 10.0);\nassert r.equals(\"ABNORMAL\") : \"At panicLow boundary should be ABNORMAL, not STAT, got: \" + r;\n\n// Exactly on normalHigh boundary is ROUTINE\nCPTask12.previousValues.clear();\nCPTask12.alerts.clear();\nCPTask12.resultLog.clear();\nString r2 = CPTask12.routeResult(\"PLT\", 145.0, 100.0, 145.0, 50.0, 400.0, 50.0);\nassert r2.equals(\"ROUTINE\") : \"At normalHigh boundary should be ROUTINE, got: \" + r2;\n\n// First result with no previous: no delta check\nCPTask12.previousValues.clear();\nCPTask12.alerts.clear();\nCPTask12.resultLog.clear();\nCPTask12.routeResult(\"TSH\", 100.0, 0.4, 4.0, 0.1, 10.0, 1.0);\n// Should not have DELTA_ALERT for first result\nboolean hasDelta = false;\nfor (String a : CPTask12.alerts) { if (a.equals(\"DELTA_ALERT\")) hasDelta = true; }\nassert !hasDelta : \"No delta alert for first result\";\n","category":"code_purpose_understanding"} {"id":"13","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask13 {\n // Shipping rate calculator with zones and weight tiers\n // Rules:\n // 1. Base rate per zone: zone 1=$5, zone 2=$8, zone 3=$12, zone 4=$18\n // 2. Weight surcharge tiers (actual or dimensional, whichever is GREATER):\n // 0-5 lbs: $0, 5.01-20 lbs: $3, 20.01-50 lbs: $8, 50.01+: $15\n // 3. Dimensional weight = (L * W * H) / 139 (round UP to nearest integer)\n // 4. If total \u003c $7.00, charge minimum of $7.00\n // 5. Returns BigDecimal with scale 2\n\n static final Map\u003cInteger, BigDecimal\u003e ZONE_RATES = Map.of(\n 1, new BigDecimal(\"5.00\"), 2, new BigDecimal(\"8.00\"),\n 3, new BigDecimal(\"12.00\"), 4, new BigDecimal(\"18.00\")\n );\n\n static BigDecimal calculateShipping(int zone, double actualWeight,\n int lengthIn, int widthIn, int heightIn) {\n","golden_completion":" BigDecimal baseRate = ZONE_RATES.getOrDefault(zone, new BigDecimal(\"18.00\"));\n int dimWeight = (int) Math.ceil((double)(lengthIn * widthIn * heightIn) / 139.0);\n double billableWeight = Math.max(actualWeight, dimWeight);\n BigDecimal surcharge;\n if (billableWeight \u003c= 5.0) {\n surcharge = BigDecimal.ZERO;\n } else if (billableWeight \u003c= 20.0) {\n surcharge = new BigDecimal(\"3.00\");\n } else if (billableWeight \u003c= 50.0) {\n surcharge = new BigDecimal(\"8.00\");\n } else {\n surcharge = new BigDecimal(\"15.00\");\n }\n BigDecimal total = baseRate.add(surcharge).setScale(2, RoundingMode.HALF_UP);\n BigDecimal minimum = new BigDecimal(\"7.00\");\n return total.compareTo(minimum) \u003c 0 ? minimum : total;\n }\n","suffix":"\n public static void main(String[] args) {\n // Zone 1, light package, small dims\n BigDecimal r1 = calculateShipping(1, 3.0, 10, 8, 6);\n // dimWeight = ceil(480/139) = ceil(3.45) = 4, billable = max(3,4) = 4 =\u003e $0 surcharge\n // total = 5 + 0 = 5, but minimum is 7\n assert r1.compareTo(new BigDecimal(\"7.00\")) == 0 : \"Should hit minimum charge: \" + r1;\n\n // Zone 3, heavy package\n BigDecimal r2 = calculateShipping(3, 25.0, 12, 12, 12);\n // dimWeight = ceil(1728/139) = ceil(12.43) = 13, billable = max(25,13) = 25 =\u003e $8 surcharge\n // total = 12 + 8 = 20\n assert r2.compareTo(new BigDecimal(\"20.00\")) == 0 : \"Zone 3 + weight tier: \" + r2;\n }\n}\n","assertions":"\n// Dimensional weight exceeds actual weight\nBigDecimal r3 = CPTask13.calculateShipping(2, 2.0, 30, 20, 15);\n// dimWeight = ceil(9000/139) = ceil(64.74) = 65, billable = max(2,65) = 65 =\u003e $15 surcharge\n// total = 8 + 15 = 23\nassert r3.compareTo(new BigDecimal(\"23.00\")) == 0 : \"Dim weight should dominate: \" + r3;\n\n// Exactly on weight tier boundary: 5.0 lbs is $0, not $3\nBigDecimal r4 = CPTask13.calculateShipping(1, 5.0, 5, 5, 5);\n// dimWeight = ceil(125/139) = ceil(0.899) = 1, billable = max(5,1) = 5 =\u003e $0 surcharge\n// total = 5 + 0 = 5, minimum 7\nassert r4.compareTo(new BigDecimal(\"7.00\")) == 0 : \"5 lbs exact should be $0 surcharge tier: \" + r4;\n\n// 5.01 lbs should hit $3 tier\nBigDecimal r5 = CPTask13.calculateShipping(4, 5.01, 5, 5, 5);\n// billable = 5.01 =\u003e $3 surcharge, total = 18 + 3 = 21\nassert r5.compareTo(new BigDecimal(\"21.00\")) == 0 : \"5.01 lbs should be $3 surcharge: \" + r5;\n\n// Zone 4, exactly 20 lbs\nBigDecimal r6 = CPTask13.calculateShipping(4, 20.0, 5, 5, 5);\n// billable = 20 =\u003e $3 surcharge, total = 18 + 3 = 21\nassert r6.compareTo(new BigDecimal(\"21.00\")) == 0 : \"20 lbs exact should be $3 tier: \" + r6;\n\n// 20.01 should hit $8 tier\nBigDecimal r7 = CPTask13.calculateShipping(4, 20.01, 5, 5, 5);\nassert r7.compareTo(new BigDecimal(\"26.00\")) == 0 : \"20.01 lbs should be $8 tier: \" + r7;\n","category":"code_purpose_understanding"} {"id":"14","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask14 {\n // Warehouse pick optimization with FEFO (First-Expiry-First-Out)\n // Rules:\n // 1. Stock organized as list of lots: each lot has {lotId, qty, expiryDay}\n // 2. Pick from earliest-expiring lots FIRST (sort by expiryDay ascending)\n // 3. If a lot doesn\u0027t fully cover the request, take what\u0027s available (partial fill)\n // and continue to the next lot\n // 4. If total stock \u003c requested qty, fill what\u0027s available and create backorder\n // for the remainder\n // 5. Return a PickResult with: filledQty, backorderQty, list of picks as\n // \"LOT:\u003clotId\u003e:\u003cqty\u003e\", and update stock lots (reduce qty, remove if 0)\n\n static List\u003cint[]\u003e stockLots = new ArrayList\u003c\u003e(); // {lotId, qty, expiryDay}\n static List\u003cString\u003e pickLog = new ArrayList\u003c\u003e();\n\n static void addLot(int lotId, int qty, int expiryDay) {\n stockLots.add(new int[]{lotId, qty, expiryDay});\n }\n\n static int[] pickOrder(int requestedQty) {\n // Returns int[2] = {filledQty, backorderQty}\n","golden_completion":" stockLots.sort((a, b) -\u003e Integer.compare(a[2], b[2]));\n int remaining = requestedQty;\n int filled = 0;\n Iterator\u003cint[]\u003e it = stockLots.iterator();\n while (it.hasNext() \u0026\u0026 remaining \u003e 0) {\n int[] lot = it.next();\n int take = Math.min(lot[1], remaining);\n pickLog.add(\"LOT:\" + lot[0] + \":\" + take);\n lot[1] -= take;\n filled += take;\n remaining -= take;\n if (lot[1] == 0) {\n it.remove();\n }\n }\n return new int[]{filled, remaining};\n }\n","suffix":"\n public static void main(String[] args) {\n stockLots.clear();\n pickLog.clear();\n addLot(101, 10, 30); // expires day 30\n addLot(102, 5, 10); // expires day 10 (pick first)\n addLot(103, 8, 20); // expires day 20\n\n int[] result = pickOrder(12);\n // Should pick: LOT:102:5 (earliest), LOT:103:7 (next earliest, partial)\n assert result[0] == 12 : \"Should fill 12, got \" + result[0];\n assert result[1] == 0 : \"No backorder expected, got \" + result[1];\n assert pickLog.get(0).equals(\"LOT:102:5\") : \"First pick should be lot 102: \" + pickLog.get(0);\n assert pickLog.get(1).equals(\"LOT:103:7\") : \"Second pick should be lot 103 partial: \" + pickLog.get(1);\n\n // Lot 103 should have 1 remaining\n boolean found103 = false;\n for (int[] lot : stockLots) {\n if (lot[0] == 103) { found103 = true; assert lot[1] == 1 : \"Lot 103 should have 1 left\"; }\n }\n assert found103 : \"Lot 103 should still exist\";\n }\n}\n","assertions":"\n// Test backorder scenario\nCPTask14.stockLots.clear();\nCPTask14.pickLog.clear();\nCPTask14.addLot(201, 3, 5);\nCPTask14.addLot(202, 4, 15);\nint[] r2 = CPTask14.pickOrder(10);\nassert r2[0] == 7 : \"Should fill 7, got \" + r2[0];\nassert r2[1] == 3 : \"Backorder of 3, got \" + r2[1];\nassert CPTask14.stockLots.isEmpty() : \"All lots should be consumed\";\nassert CPTask14.pickLog.size() == 2;\n\n// Test zero request\nCPTask14.stockLots.clear();\nCPTask14.pickLog.clear();\nCPTask14.addLot(301, 10, 5);\nint[] r3 = CPTask14.pickOrder(0);\nassert r3[0] == 0 \u0026\u0026 r3[1] == 0;\nassert CPTask14.pickLog.isEmpty();\n\n// Test depleted lot removal\nCPTask14.stockLots.clear();\nCPTask14.pickLog.clear();\nCPTask14.addLot(401, 5, 10);\nCPTask14.addLot(402, 5, 20);\nCPTask14.pickOrder(5);\n// Lot 401 should be removed, lot 402 untouched\nassert CPTask14.stockLots.size() == 1 : \"Only 1 lot should remain\";\nassert CPTask14.stockLots.get(0)[0] == 402 : \"Remaining lot should be 402\";\nassert CPTask14.stockLots.get(0)[1] == 5 : \"Lot 402 should still have 5\";\n","category":"code_purpose_understanding"} {"id":"15","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask15 {\n // Leave accrual system with carry-over limits\n // Rules:\n // 1. Employees accrue leaveRate hours per month\n // 2. At year-end (month 12), balance is capped at carryOverMax\n // Any excess is forfeited and logged as \"FORFEIT:\u003cempId\u003e:\u003camount\u003e\"\n // 3. Taking leave reduces balance; cannot go below 0\n // If requested \u003e balance, deny and log \"DENIED:\u003cempId\u003e:\u003crequested\u003e\"\n // 4. All approved leaves logged as \"USED:\u003cempId\u003e:\u003camount\u003e\"\n // All accruals logged as \"ACCRUED:\u003cempId\u003e:\u003camount\u003e\"\n\n static Map\u003cString, BigDecimal\u003e balances = new HashMap\u003c\u003e();\n static Map\u003cString, BigDecimal\u003e accrualRates = new HashMap\u003c\u003e();\n static Map\u003cString, BigDecimal\u003e carryOverMax = new HashMap\u003c\u003e();\n static List\u003cString\u003e leaveLog = new ArrayList\u003c\u003e();\n\n static void initEmployee(String empId, BigDecimal rate, BigDecimal maxCarry) {\n balances.put(empId, BigDecimal.ZERO);\n accrualRates.put(empId, rate);\n carryOverMax.put(empId, maxCarry);\n }\n\n static void accrueMonth(String empId, int month) {\n","golden_completion":" BigDecimal rate = accrualRates.get(empId);\n BigDecimal bal = balances.get(empId).add(rate);\n leaveLog.add(\"ACCRUED:\" + empId + \":\" + rate);\n if (month == 12) {\n BigDecimal cap = carryOverMax.get(empId);\n if (bal.compareTo(cap) \u003e 0) {\n BigDecimal excess = bal.subtract(cap);\n leaveLog.add(\"FORFEIT:\" + empId + \":\" + excess);\n bal = cap;\n }\n }\n balances.put(empId, bal);\n }\n\n static boolean takeLeave(String empId, BigDecimal hours) {\n BigDecimal bal = balances.get(empId);\n if (hours.compareTo(bal) \u003e 0) {\n leaveLog.add(\"DENIED:\" + empId + \":\" + hours);\n return false;\n }\n balances.put(empId, bal.subtract(hours));\n leaveLog.add(\"USED:\" + empId + \":\" + hours);\n return true;\n }\n","suffix":"\n public static void main(String[] args) {\n balances.clear(); accrualRates.clear(); carryOverMax.clear(); leaveLog.clear();\n initEmployee(\"E001\", new BigDecimal(\"10.00\"), new BigDecimal(\"80.00\"));\n\n // Accrue 12 months\n for (int m = 1; m \u003c= 12; m++) {\n accrueMonth(\"E001\", m);\n }\n // 10 * 12 = 120, capped at 80\n assert balances.get(\"E001\").compareTo(new BigDecimal(\"80.00\")) == 0 : \"Should cap at 80: \" + balances.get(\"E001\");\n assert leaveLog.contains(\"FORFEIT:E001:40.00\") : \"Should forfeit 40 hours\";\n\n // Take leave\n assert takeLeave(\"E001\", new BigDecimal(\"30.00\")) == true;\n assert balances.get(\"E001\").compareTo(new BigDecimal(\"50.00\")) == 0;\n }\n}\n","assertions":"\n// Test denial when insufficient balance\nCPTask15.balances.clear();\nCPTask15.accrualRates.clear();\nCPTask15.carryOverMax.clear();\nCPTask15.leaveLog.clear();\nCPTask15.initEmployee(\"E002\", new BigDecimal(\"8.00\"), new BigDecimal(\"40.00\"));\nCPTask15.accrueMonth(\"E002\", 1);\nassert CPTask15.balances.get(\"E002\").compareTo(new BigDecimal(\"8.00\")) == 0;\n// Try to take more than balance\nassert CPTask15.takeLeave(\"E002\", new BigDecimal(\"10.00\")) == false;\nassert CPTask15.leaveLog.contains(\"DENIED:E002:10.00\");\n// Balance unchanged after denial\nassert CPTask15.balances.get(\"E002\").compareTo(new BigDecimal(\"8.00\")) == 0;\n\n// No forfeit before month 12\nCPTask15.balances.clear();\nCPTask15.accrualRates.clear();\nCPTask15.carryOverMax.clear();\nCPTask15.leaveLog.clear();\nCPTask15.initEmployee(\"E003\", new BigDecimal(\"50.00\"), new BigDecimal(\"40.00\"));\nCPTask15.accrueMonth(\"E003\", 6);\n// Even though 50 \u003e 40, it\u0027s not month 12 so no cap\nassert CPTask15.balances.get(\"E003\").compareTo(new BigDecimal(\"50.00\")) == 0;\nboolean hasForfeit = false;\nfor (String l : CPTask15.leaveLog) { if (l.startsWith(\"FORFEIT:E003\")) hasForfeit = true; }\nassert !hasForfeit : \"No forfeit outside month 12\";\n\n// Exact balance take should succeed\nCPTask15.balances.clear();\nCPTask15.accrualRates.clear();\nCPTask15.carryOverMax.clear();\nCPTask15.leaveLog.clear();\nCPTask15.initEmployee(\"E004\", new BigDecimal(\"5.00\"), new BigDecimal(\"100.00\"));\nCPTask15.accrueMonth(\"E004\", 1);\nassert CPTask15.takeLeave(\"E004\", new BigDecimal(\"5.00\")) == true;\nassert CPTask15.balances.get(\"E004\").compareTo(BigDecimal.ZERO) == 0;\n","category":"code_purpose_understanding"} {"id":"16","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask16 {\n // Performance review calibration system\n // Rules:\n // 1. Ratings: 1(low) to 5(high). Forced distribution across a team:\n // At most 20% can be rated 5, at most 20% can be rated 1\n // (i.e., count of rating 5 \u003c= floor(teamSize * 0.2), same for rating 1)\n // 2. Manager can override a rating by at most +/-1 from the original\n // 3. Employees cannot rate themselves (rater != ratee)\n // 4. All calibrated ratings stored in finalRatings map\n // 5. Every action logged to reviewLog as \"RATE:\u003cratee\u003e:\u003crating\u003e\" or\n // \"OVERRIDE:\u003cratee\u003e:\u003cold\u003e-\u003e\u003cnew\u003e\" or \"DENIED:\u003creason\u003e\"\n\n static Map\u003cString, Integer\u003e finalRatings = new HashMap\u003c\u003e();\n static List\u003cString\u003e reviewLog = new ArrayList\u003c\u003e();\n static int teamSize = 0;\n\n static void initTeam(int size) {\n teamSize = size;\n finalRatings.clear();\n reviewLog.clear();\n }\n\n static boolean overrideRating(String ratee, int newRating) {\n if (!finalRatings.containsKey(ratee)) { reviewLog.add(\"DENIED:NO_EXISTING_RATING\"); return false; }\n int old = finalRatings.get(ratee);\n if (Math.abs(newRating - old) \u003e 1) { reviewLog.add(\"DENIED:OVERRIDE_TOO_LARGE\"); return false; }\n finalRatings.put(ratee, newRating);\n reviewLog.add(\"OVERRIDE:\" + ratee + \":\" + old + \"-\u003e\" + newRating);\n return true;\n }\n\n // Submit a rating: checks self-rating, rating range, distribution limits\n static boolean submitRating(String rater, String ratee, int rating) {\n","golden_completion":" if (rater.equals(ratee)) { reviewLog.add(\"DENIED:SELF_RATING\"); return false; }\n if (rating \u003c 1 || rating \u003e 5) { reviewLog.add(\"DENIED:INVALID_RATING\"); return false; }\n int maxForRating = (int) Math.floor(teamSize * 0.2);\n if (rating == 5 || rating == 1) {\n long count = finalRatings.values().stream().filter(r -\u003e r == rating).count();\n if (count \u003e= maxForRating) { reviewLog.add(\"DENIED:DISTRIBUTION_LIMIT\"); return false; }\n }\n finalRatings.put(ratee, rating);\n reviewLog.add(\"RATE:\" + ratee + \":\" + rating);\n return true;\n }\n","suffix":"\n public static void main(String[] args) {\n initTeam(5);\n // floor(5 * 0.2) = 1, so only 1 person can get rating 5\n assert submitRating(\"mgr\", \"alice\", 5) == true;\n assert submitRating(\"mgr\", \"bob\", 5) == false;\n assert reviewLog.contains(\"DENIED:DISTRIBUTION_LIMIT\");\n\n // Self-rating blocked\n assert submitRating(\"charlie\", \"charlie\", 4) == false;\n assert reviewLog.contains(\"DENIED:SELF_RATING\");\n\n // Override within +/-1\n assert overrideRating(\"alice\", 4) == true;\n assert finalRatings.get(\"alice\") == 4;\n }\n}\n","assertions":"\n// Test override too large\nCPTask16.initTeam(10);\nCPTask16.submitRating(\"mgr\", \"dave\", 3);\nassert CPTask16.overrideRating(\"dave\", 5) == false;\nassert CPTask16.reviewLog.contains(\"DENIED:OVERRIDE_TOO_LARGE\");\nassert CPTask16.finalRatings.get(\"dave\") == 3 : \"Rating should not change on failed override\";\n\n// Override non-existent rating\nassert CPTask16.overrideRating(\"nobody\", 3) == false;\nassert CPTask16.reviewLog.contains(\"DENIED:NO_EXISTING_RATING\");\n\n// Distribution limit: floor(10 * 0.2) = 2 can get rating 1\nCPTask16.initTeam(10);\nassert CPTask16.submitRating(\"mgr\", \"a1\", 1) == true;\nassert CPTask16.submitRating(\"mgr\", \"a2\", 1) == true;\nassert CPTask16.submitRating(\"mgr\", \"a3\", 1) == false;\n\n// Rating 3 has no distribution limit\nCPTask16.initTeam(5);\nfor (int i = 0; i \u003c 5; i++) {\n assert CPTask16.submitRating(\"mgr\", \"emp\" + i, 3) == true;\n}\nassert CPTask16.finalRatings.size() == 5;\n\n// Override that would violate distribution should still succeed\n// (override doesn\u0027t re-check distribution — only submitRating does)\nCPTask16.initTeam(5);\nCPTask16.submitRating(\"mgr\", \"x1\", 5);\nCPTask16.submitRating(\"mgr\", \"x2\", 4);\n// Override x2 from 4 to 5: override only checks +/-1, not distribution\nassert CPTask16.overrideRating(\"x2\", 5) == true;\nassert CPTask16.finalRatings.get(\"x2\") == 5;\n","category":"code_purpose_understanding"} {"id":"17","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask17 {\n // Cart pricing engine with stacking discount rules\n // Rules:\n // 1. Items have price and quantity\n // 2. Discounts applied in order: PERCENT discounts first, then FLAT discounts\n // 3. After ALL discounts, each item\u0027s effective price cannot go below $1.00\n // (per-item floor, applied per-unit before totaling)\n // 4. Shipping: $5.99 if subtotal \u003c $50, free if subtotal \u003e= $50\n // 5. Return CartTotal with: subtotal, shipping, grandTotal (all BigDecimal scale 2)\n\n static List\u003cBigDecimal[]\u003e items = new ArrayList\u003c\u003e(); // {unitPrice, quantity}\n static List\u003cObject[]\u003e discounts = new ArrayList\u003c\u003e(); // {\"PERCENT\"|\"FLAT\", BigDecimal amount}\n\n static void addItem(BigDecimal price, int qty) {\n items.add(new BigDecimal[]{price, new BigDecimal(qty)});\n }\n\n static void addDiscount(String type, BigDecimal amount) {\n discounts.add(new Object[]{type, amount});\n }\n\n // Returns BigDecimal[3] = {subtotal, shipping, grandTotal}\n static BigDecimal[] calculateTotal() {\n","golden_completion":" BigDecimal[] ep = new BigDecimal[items.size()];\n for (int i = 0; i \u003c items.size(); i++) ep[i] = items.get(i)[0];\n for (Object[] d : discounts) if (\"PERCENT\".equals(d[0])) {\n BigDecimal m = BigDecimal.ONE.subtract(((BigDecimal)d[1]).divide(new BigDecimal(\"100\"),10,RoundingMode.HALF_UP));\n for (int i = 0; i \u003c ep.length; i++) ep[i] = ep[i].multiply(m).setScale(2, RoundingMode.HALF_UP);\n }\n for (Object[] d : discounts) if (\"FLAT\".equals(d[0])) {\n BigDecimal per = ((BigDecimal)d[1]).divide(new BigDecimal(items.size()), 2, RoundingMode.HALF_UP);\n for (int i = 0; i \u003c ep.length; i++) ep[i] = ep[i].subtract(per);\n }\n BigDecimal sub = BigDecimal.ZERO, floor = new BigDecimal(\"1.00\");\n for (int i = 0; i \u003c items.size(); i++) {\n BigDecimal up = ep[i].compareTo(floor) \u003c 0 ? floor : ep[i];\n sub = sub.add(up.multiply(items.get(i)[1]));\n }\n sub = sub.setScale(2, RoundingMode.HALF_UP);\n BigDecimal ship = sub.compareTo(new BigDecimal(\"50.00\")) \u003e= 0 ? BigDecimal.ZERO.setScale(2) : new BigDecimal(\"5.99\");\n return new BigDecimal[]{sub, ship, sub.add(ship).setScale(2, RoundingMode.HALF_UP)};\n }\n","suffix":"\n public static void main(String[] args) {\n items.clear();\n discounts.clear();\n // 2 items: $30 x1, $20 x2\n addItem(new BigDecimal(\"30.00\"), 1);\n addItem(new BigDecimal(\"20.00\"), 2);\n addDiscount(\"PERCENT\", new BigDecimal(\"10\")); // 10% off\n addDiscount(\"FLAT\", new BigDecimal(\"5.00\")); // $5 flat off\n\n BigDecimal[] result = calculateTotal();\n // Percent first: $30 -\u003e $27, $20 -\u003e $18\n // Flat $5 spread across 2 items: $2.50 each -\u003e $27-$2.50=$24.50, $18-$2.50=$15.50\n // Both above $1 floor\n // Subtotal: 24.50*1 + 15.50*2 = 24.50 + 31.00 = 55.50\n // Shipping: free (\u003e= 50)\n assert result[0].compareTo(new BigDecimal(\"55.50\")) == 0 : \"Subtotal: \" + result[0];\n assert result[1].compareTo(BigDecimal.ZERO) == 0 : \"Free shipping: \" + result[1];\n assert result[2].compareTo(new BigDecimal(\"55.50\")) == 0 : \"Grand total: \" + result[2];\n }\n}\n","assertions":"\n// Test per-item floor\nCPTask17.items.clear();\nCPTask17.discounts.clear();\nCPTask17.addItem(new BigDecimal(\"3.00\"), 3);\nCPTask17.addDiscount(\"PERCENT\", new BigDecimal(\"80\")); // 80% off -\u003e $0.60 each\n// Floor kicks in: $1.00 each\nBigDecimal[] r2 = CPTask17.calculateTotal();\n// Subtotal: 1.00 * 3 = 3.00, shipping $5.99\nassert r2[0].compareTo(new BigDecimal(\"3.00\")) == 0 : \"Floor should apply: \" + r2[0];\nassert r2[1].compareTo(new BigDecimal(\"5.99\")) == 0 : \"Below $50 shipping: \" + r2[1];\nassert r2[2].compareTo(new BigDecimal(\"8.99\")) == 0 : \"Grand: \" + r2[2];\n\n// Test discount order matters: percent before flat\nCPTask17.items.clear();\nCPTask17.discounts.clear();\nCPTask17.addItem(new BigDecimal(\"100.00\"), 1);\nCPTask17.addDiscount(\"FLAT\", new BigDecimal(\"20.00\")); // $20 flat\nCPTask17.addDiscount(\"PERCENT\", new BigDecimal(\"50\")); // 50% off\n// Correct order: percent first ($100 -\u003e $50), then flat ($50 - $20 = $30)\nBigDecimal[] r3 = CPTask17.calculateTotal();\nassert r3[0].compareTo(new BigDecimal(\"30.00\")) == 0 : \"Percent before flat: \" + r3[0];\n\n// Test shipping boundary: exactly $50\nCPTask17.items.clear();\nCPTask17.discounts.clear();\nCPTask17.addItem(new BigDecimal(\"50.00\"), 1);\nBigDecimal[] r4 = CPTask17.calculateTotal();\nassert r4[1].compareTo(BigDecimal.ZERO) == 0 : \"Exactly $50 = free shipping: \" + r4[1];\n\n// Test $49.99 gets shipping\nCPTask17.items.clear();\nCPTask17.discounts.clear();\nCPTask17.addItem(new BigDecimal(\"49.99\"), 1);\nBigDecimal[] r5 = CPTask17.calculateTotal();\nassert r5[1].compareTo(new BigDecimal(\"5.99\")) == 0 : \"$49.99 should have shipping: \" + r5[1];\n","category":"code_purpose_understanding"} {"id":"18","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask18 {\n // Return/refund system with restocking fees\n // Rules:\n // 1. Return window: 0-14 days: no fee, 15-30 days: 15% restocking fee,\n // 31+ days: return DENIED\n // 2. Restocking fee calculated on item price (not including tax)\n // 3. Refund amount = price - restocking fee (rounded to 2 decimal places)\n // 4. Each return logged as \"RETURN:\u003corderId\u003e:\u003cAPPROVED|DENIED\u003e:\u003crefundAmount\u003e\"\n // For denied returns, refundAmount is \"0.00\"\n\n static List\u003cString\u003e returnLog = new ArrayList\u003c\u003e();\n static Map\u003cString, BigDecimal\u003e refunds = new HashMap\u003c\u003e();\n\n // Returns the refund amount, or BigDecimal.ZERO if denied\n static BigDecimal processReturn(String orderId, BigDecimal itemPrice, int daysSincePurchase) {\n","golden_completion":" if (daysSincePurchase \u003e 30) {\n returnLog.add(\"RETURN:\" + orderId + \":DENIED:0.00\");\n refunds.put(orderId, BigDecimal.ZERO);\n return BigDecimal.ZERO;\n }\n BigDecimal fee = BigDecimal.ZERO;\n if (daysSincePurchase \u003e= 15) {\n fee = itemPrice.multiply(new BigDecimal(\"0.15\")).setScale(2, RoundingMode.HALF_UP);\n }\n BigDecimal refund = itemPrice.subtract(fee).setScale(2, RoundingMode.HALF_UP);\n returnLog.add(\"RETURN:\" + orderId + \":APPROVED:\" + refund);\n refunds.put(orderId, refund);\n return refund;\n }\n","suffix":"\n public static void main(String[] args) {\n returnLog.clear();\n refunds.clear();\n // Within 14 days: no fee\n BigDecimal r1 = processReturn(\"ORD001\", new BigDecimal(\"99.99\"), 7);\n assert r1.compareTo(new BigDecimal(\"99.99\")) == 0 : \"No fee within 14 days: \" + r1;\n\n // 15-30 days: 15% fee\n BigDecimal r2 = processReturn(\"ORD002\", new BigDecimal(\"100.00\"), 20);\n // fee = 100 * 0.15 = 15, refund = 85\n assert r2.compareTo(new BigDecimal(\"85.00\")) == 0 : \"15% restocking: \" + r2;\n\n // 31+ days: denied\n BigDecimal r3 = processReturn(\"ORD003\", new BigDecimal(\"50.00\"), 35);\n assert r3.compareTo(BigDecimal.ZERO) == 0 : \"Should deny: \" + r3;\n assert returnLog.get(2).contains(\"DENIED\");\n }\n}\n","assertions":"\n// Boundary: exactly day 14 should have no fee\nCPTask18.returnLog.clear();\nCPTask18.refunds.clear();\nBigDecimal b1 = CPTask18.processReturn(\"B1\", new BigDecimal(\"80.00\"), 14);\nassert b1.compareTo(new BigDecimal(\"80.00\")) == 0 : \"Day 14 no fee: \" + b1;\nassert CPTask18.returnLog.get(0).contains(\"APPROVED\");\n\n// Boundary: exactly day 15 should have 15% fee\nBigDecimal b2 = CPTask18.processReturn(\"B2\", new BigDecimal(\"80.00\"), 15);\n// fee = 80 * 0.15 = 12, refund = 68\nassert b2.compareTo(new BigDecimal(\"68.00\")) == 0 : \"Day 15 gets fee: \" + b2;\n\n// Boundary: exactly day 30 should still be approved with fee\nBigDecimal b3 = CPTask18.processReturn(\"B3\", new BigDecimal(\"80.00\"), 30);\nassert b3.compareTo(new BigDecimal(\"68.00\")) == 0 : \"Day 30 approved with fee: \" + b3;\n\n// Boundary: day 31 denied\nBigDecimal b4 = CPTask18.processReturn(\"B4\", new BigDecimal(\"80.00\"), 31);\nassert b4.compareTo(BigDecimal.ZERO) == 0 : \"Day 31 denied: \" + b4;\n\n// Rounding: restocking fee on odd price\nCPTask18.returnLog.clear();\nCPTask18.refunds.clear();\nBigDecimal b5 = CPTask18.processReturn(\"B5\", new BigDecimal(\"33.33\"), 16);\n// fee = 33.33 * 0.15 = 5.0 (4.9995 rounds to 5.00)\n// refund = 33.33 - 5.00 = 28.33\nassert b5.compareTo(new BigDecimal(\"28.33\")) == 0 : \"Rounding test: \" + b5;\n\n// Day 0 is valid\nBigDecimal b6 = CPTask18.processReturn(\"B6\", new BigDecimal(\"10.00\"), 0);\nassert b6.compareTo(new BigDecimal(\"10.00\")) == 0 : \"Day 0 valid: \" + b6;\n","category":"code_purpose_understanding"} {"id":"19","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask19 {\n // Rate limiter with burst allowance (token bucket variant)\n // Rules:\n // 1. Each client gets maxTokens tokens, refilled at refillRate tokens per second\n // 2. A request costs 1 token. If tokens \u003e 0, allow and decrement\n // 3. Burst: client also gets burstTokens extra tokens. Burst tokens do NOT refill.\n // They are used only when regular tokens are 0. Once burst tokens are exhausted,\n // requests are denied until regular tokens refill.\n // 4. Refill: at each timestamp, add (currentTime - lastRefillTime) * refillRate tokens,\n // capped at maxTokens (burst tokens are separate, never refilled)\n // 5. Log every request as \"REQ:\u003cclientId\u003e:\u003cALLOW|DENY\u003e\"\n\n static Map\u003cString, double[]\u003e clients = new HashMap\u003c\u003e(); // {tokens, burstTokens, lastRefillTime, maxTokens, refillRate}\n static List\u003cString\u003e reqLog = new ArrayList\u003c\u003e();\n\n static void initClient(String clientId, int maxTokens, int burstTokens, double refillRate) {\n clients.put(clientId, new double[]{maxTokens, burstTokens, 0, maxTokens, refillRate});\n }\n\n // Returns true if request allowed\n static boolean request(String clientId, double currentTime) {\n","golden_completion":" double[] c = clients.get(clientId);\n // Refill regular tokens\n double elapsed = currentTime - c[2];\n c[0] = Math.min(c[3], c[0] + elapsed * c[4]);\n c[2] = currentTime;\n // Try regular tokens first\n if (c[0] \u003e= 1.0) {\n c[0] -= 1.0;\n reqLog.add(\"REQ:\" + clientId + \":ALLOW\");\n return true;\n }\n // Try burst tokens\n if (c[1] \u003e= 1.0) {\n c[1] -= 1.0;\n reqLog.add(\"REQ:\" + clientId + \":ALLOW\");\n return true;\n }\n reqLog.add(\"REQ:\" + clientId + \":DENY\");\n return false;\n }\n","suffix":"\n public static void main(String[] args) {\n clients.clear(); reqLog.clear();\n initClient(\"api-user\", 3, 2, 1.0); // 3 regular, 2 burst, 1 token/sec refill\n\n // Use all regular tokens at time 0\n assert request(\"api-user\", 0) == true; // token 3-\u003e2\n assert request(\"api-user\", 0) == true; // token 2-\u003e1\n assert request(\"api-user\", 0) == true; // token 1-\u003e0\n\n // Now uses burst tokens\n assert request(\"api-user\", 0) == true; // burst 2-\u003e1\n assert request(\"api-user\", 0) == true; // burst 1-\u003e0\n\n // All exhausted\n assert request(\"api-user\", 0) == false;\n\n // After 2 seconds, refill 2 regular tokens\n assert request(\"api-user\", 2.0) == true; // refill 2, use 1 -\u003e 1 left\n assert request(\"api-user\", 2.0) == true; // use 1 -\u003e 0\n assert request(\"api-user\", 2.0) == false; // no more regular, burst still 0\n }\n}\n","assertions":"\n// Test burst tokens never refill\nCPTask19.clients.clear();\nCPTask19.reqLog.clear();\nCPTask19.initClient(\"c1\", 1, 1, 1.0);\nCPTask19.request(\"c1\", 0); // regular 1-\u003e0\nCPTask19.request(\"c1\", 0); // burst 1-\u003e0\n// Wait long time\nCPTask19.request(\"c1\", 100); // refill 1 regular -\u003e use it\nassert CPTask19.request(\"c1\", 100) == false; // no regular, burst still 0\n// Burst should still be 0\nassert CPTask19.clients.get(\"c1\")[1] == 0.0 : \"Burst should not refill\";\n\n// Regular tokens cap at max\nCPTask19.clients.clear();\nCPTask19.reqLog.clear();\nCPTask19.initClient(\"c2\", 5, 0, 10.0);\n// Wait 100 seconds with refillRate=10, should cap at 5\nassert CPTask19.request(\"c2\", 100) == true;\n// After using 1, have 4 left (capped at 5, used 1)\ndouble tokensAfter = CPTask19.clients.get(\"c2\")[0];\nassert tokensAfter \u003e= 3.9 \u0026\u0026 tokensAfter \u003c= 4.1 : \"Should have ~4 tokens: \" + tokensAfter;\n\n// Log format check\nCPTask19.clients.clear();\nCPTask19.reqLog.clear();\nCPTask19.initClient(\"c3\", 1, 0, 0.0);\nCPTask19.request(\"c3\", 0);\nCPTask19.request(\"c3\", 0);\nassert CPTask19.reqLog.get(0).equals(\"REQ:c3:ALLOW\");\nassert CPTask19.reqLog.get(1).equals(\"REQ:c3:DENY\");\n","category":"code_purpose_understanding"} {"id":"20","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask20 {\n // Circuit breaker with half-open state\n // States: CLOSED (normal), OPEN (blocking), HALF_OPEN (testing)\n // Rules:\n // 1. CLOSED: allow requests. Track consecutive failures.\n // If consecutiveFailures \u003e= failureThreshold, transition to OPEN.\n // A success resets consecutiveFailures to 0.\n // 2. OPEN: deny ALL requests. After resetTimeoutMs has elapsed since\n // entering OPEN, transition to HALF_OPEN on next request attempt.\n // 3. HALF_OPEN: allow up to probeLimit requests.\n // If a probe succeeds, transition to CLOSED and reset failure count.\n // If a probe fails, transition back to OPEN (reset the timeout timer).\n // 4. Log every attempt as \"CB:\u003cstate\u003e:\u003cALLOW|DENY\u003e\"\n\n static String state = \"CLOSED\";\n static int consecutiveFailures = 0;\n static int failureThreshold = 3;\n static long resetTimeoutMs = 5000;\n static int probeLimit = 1;\n static int probeCount = 0;\n static long openedAt = 0;\n static List\u003cString\u003e cbLog = new ArrayList\u003c\u003e();\n\n static void init(int threshold, long timeoutMs, int probeLim) {\n state = \"CLOSED\";\n consecutiveFailures = 0;\n failureThreshold = threshold;\n resetTimeoutMs = timeoutMs;\n probeLimit = probeLim;\n probeCount = 0;\n openedAt = 0;\n cbLog.clear();\n }\n\n static void recordSuccess() {\n if (state.equals(\"HALF_OPEN\")) { state = \"CLOSED\"; consecutiveFailures = 0; }\n consecutiveFailures = 0;\n }\n\n static void recordFailure(long currentTimeMs) {\n if (state.equals(\"HALF_OPEN\")) { state = \"OPEN\"; openedAt = currentTimeMs; probeCount = 0; return; }\n consecutiveFailures++;\n if (consecutiveFailures \u003e= failureThreshold) { state = \"OPEN\"; openedAt = currentTimeMs; }\n }\n\n // Returns true if the request is allowed through\n static boolean attemptRequest(long currentTimeMs) {\n","golden_completion":" if (state.equals(\"OPEN\")) {\n if (currentTimeMs - openedAt \u003e= resetTimeoutMs) { state = \"HALF_OPEN\"; probeCount = 0; }\n else { cbLog.add(\"CB:OPEN:DENY\"); return false; }\n }\n if (state.equals(\"HALF_OPEN\")) {\n if (probeCount \u003e= probeLimit) { cbLog.add(\"CB:HALF_OPEN:DENY\"); return false; }\n probeCount++;\n cbLog.add(\"CB:HALF_OPEN:ALLOW\");\n return true;\n }\n cbLog.add(\"CB:CLOSED:ALLOW\");\n return true;\n }\n","suffix":"\n public static void main(String[] args) {\n init(3, 5000, 1);\n\n // CLOSED: allow requests\n assert attemptRequest(0) == true;\n recordSuccess();\n\n // Accumulate failures\n assert attemptRequest(100) == true;\n recordFailure(100);\n assert attemptRequest(200) == true;\n recordFailure(200);\n assert attemptRequest(300) == true;\n recordFailure(300);\n // 3 consecutive failures -\u003e OPEN\n assert state.equals(\"OPEN\") : \"Should be OPEN: \" + state;\n\n // OPEN: deny\n assert attemptRequest(1000) == false;\n\n // After timeout, HALF_OPEN\n assert attemptRequest(5300) == true;\n assert state.equals(\"HALF_OPEN\") : \"Should be HALF_OPEN: \" + state;\n\n // Probe succeeds -\u003e CLOSED\n recordSuccess();\n assert state.equals(\"CLOSED\") : \"Should be CLOSED after success: \" + state;\n }\n}\n","assertions":"\n// Half-open probe fails -\u003e back to OPEN\nCPTask20.init(2, 1000, 1);\nCPTask20.attemptRequest(0); CPTask20.recordFailure(0);\nCPTask20.attemptRequest(0); CPTask20.recordFailure(0);\nassert CPTask20.state.equals(\"OPEN\");\n// Wait for timeout\nassert CPTask20.attemptRequest(1500) == true;\nassert CPTask20.state.equals(\"HALF_OPEN\");\n// Probe fails\nCPTask20.recordFailure(1500);\nassert CPTask20.state.equals(\"OPEN\") : \"Failed probe should revert to OPEN\";\n// Timer resets to 1500\nassert CPTask20.attemptRequest(2000) == false : \"Should still be OPEN (timeout not elapsed from new openedAt)\";\nassert CPTask20.attemptRequest(2600) == true : \"Should be HALF_OPEN now\";\n\n// Success resets consecutive failures in CLOSED\nCPTask20.init(3, 1000, 1);\nCPTask20.attemptRequest(0); CPTask20.recordFailure(0);\nCPTask20.attemptRequest(0); CPTask20.recordFailure(0);\nCPTask20.attemptRequest(0); CPTask20.recordSuccess();\n// Success should reset failures\nCPTask20.attemptRequest(0); CPTask20.recordFailure(0);\nCPTask20.attemptRequest(0); CPTask20.recordFailure(0);\nassert CPTask20.state.equals(\"CLOSED\") : \"Only 2 failures after reset, should still be CLOSED\";\n\n// Probe limit respected\nCPTask20.init(1, 1000, 2);\nCPTask20.attemptRequest(0); CPTask20.recordFailure(0);\nassert CPTask20.state.equals(\"OPEN\");\nassert CPTask20.attemptRequest(1500) == true; // probe 1\nassert CPTask20.attemptRequest(1500) == true; // probe 2\nassert CPTask20.attemptRequest(1500) == false; // over probe limit\n","category":"code_purpose_understanding"} {"id":"21","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.util.*;\n\npublic class CPTask21 {\n enum Side { BUY, SELL }\n\n static class Order {\n final String id;\n final Side side;\n final BigDecimal price;\n int qty;\n int filledQty;\n final long timestamp;\n\n Order(String id, Side side, BigDecimal price, int qty, long timestamp) {\n this.id = id; this.side = side; this.price = price;\n this.qty = qty; this.filledQty = 0; this.timestamp = timestamp;\n }\n int remaining() { return qty - filledQty; }\n }\n\n static List\u003cOrder\u003e sellBook = new ArrayList\u003c\u003e();\n static List\u003cString\u003e tradeLog = new ArrayList\u003c\u003e();\n\n static void reset() { sellBook.clear(); tradeLog.clear(); }\n\n // Add a sell order to the book (sorted by price ASC, then timestamp ASC)\n static void addSellOrder(Order o) {\n sellBook.add(o);\n sellBook.sort(Comparator.comparing((Order x) -\u003e x.price).thenComparingLong(x -\u003e x.timestamp));\n }\n\n // Match incoming BUY order against sell book.\n // Rules:\n // 1. Match sells with price \u003c= buy price (price-time priority: lowest price first, earliest first)\n // 2. Partial fills allowed — fill as much as possible from each sell\n // 3. Log each fill as \"FILL:\u003cbuyId\u003e:\u003csellId\u003e:\u003cfillQty\u003e\"\n // 4. Remove fully filled sell orders from book\n // Returns: total quantity filled for this buy order\n static int matchBuyOrder(Order buyOrder) {\n","golden_completion":" int totalFilled = 0;\n Iterator\u003cOrder\u003e it = sellBook.iterator();\n while (it.hasNext() \u0026\u0026 buyOrder.remaining() \u003e 0) {\n Order sell = it.next();\n if (sell.price.compareTo(buyOrder.price) \u003e 0) break;\n int fillQty = Math.min(buyOrder.remaining(), sell.remaining());\n buyOrder.filledQty += fillQty;\n sell.filledQty += fillQty;\n totalFilled += fillQty;\n tradeLog.add(\"FILL:\" + buyOrder.id + \":\" + sell.id + \":\" + fillQty);\n if (sell.remaining() == 0) it.remove();\n }\n return totalFilled;\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n addSellOrder(new Order(\"S1\", Side.SELL, new BigDecimal(\"100.00\"), 10, 1));\n addSellOrder(new Order(\"S2\", Side.SELL, new BigDecimal(\"99.50\"), 5, 2));\n // S2 is cheaper so should match first despite later timestamp\n Order buy = new Order(\"B1\", Side.BUY, new BigDecimal(\"100.00\"), 8, 3);\n int filled = matchBuyOrder(buy);\n assert filled == 8 : \"Expected 8 filled, got \" + filled;\n assert tradeLog.size() == 2 : \"Expected 2 fills\";\n assert tradeLog.get(0).equals(\"FILL:B1:S2:5\") : \"First fill should be S2 for 5\";\n assert tradeLog.get(1).equals(\"FILL:B1:S1:3\") : \"Second fill should be S1 for 3\";\n }\n}\n","assertions":"\n // Hidden: partial fill leaves remainder on book\n reset();\n addSellOrder(new Order(\"S10\", Side.SELL, new BigDecimal(\"50.00\"), 20, 1));\n Order b2 = new Order(\"B2\", Side.BUY, new BigDecimal(\"50.00\"), 7, 2);\n int f2 = matchBuyOrder(b2);\n assert f2 == 7 : \"Partial fill expected 7\";\n assert sellBook.size() == 1 : \"Sell order should remain\";\n assert sellBook.get(0).remaining() == 13 : \"S10 should have 13 remaining\";\n\n // Hidden: no match when sell price \u003e buy price\n reset();\n addSellOrder(new Order(\"S20\", Side.SELL, new BigDecimal(\"110.00\"), 5, 1));\n Order b3 = new Order(\"B3\", Side.BUY, new BigDecimal(\"100.00\"), 5, 2);\n int f3 = matchBuyOrder(b3);\n assert f3 == 0 : \"No fill expected\";\n assert tradeLog.isEmpty() : \"No trades expected\";\n\n // Hidden: fully filled sell removed from book\n reset();\n addSellOrder(new Order(\"S30\", Side.SELL, new BigDecimal(\"10.00\"), 3, 1));\n addSellOrder(new Order(\"S31\", Side.SELL, new BigDecimal(\"10.00\"), 3, 2));\n Order b4 = new Order(\"B4\", Side.BUY, new BigDecimal(\"10.00\"), 5, 3);\n matchBuyOrder(b4);\n assert sellBook.size() == 1 : \"S30 should be removed, S31 remains\";\n assert sellBook.get(0).id.equals(\"S31\") : \"Remaining should be S31\";\n assert sellBook.get(0).remaining() == 1 : \"S31 should have 1 remaining\";\n","category":"code_purpose_understanding"} {"id":"22","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask22 {\n static class Position {\n final String symbol;\n BigDecimal quantity;\n final BigDecimal currentPrice;\n\n Position(String symbol, BigDecimal quantity, BigDecimal currentPrice) {\n this.symbol = symbol; this.quantity = quantity; this.currentPrice = currentPrice;\n }\n BigDecimal marketValue() { return quantity.multiply(currentPrice); }\n }\n\n static BigDecimal equity;\n static List\u003cPosition\u003e positions = new ArrayList\u003c\u003e();\n static List\u003cString\u003e liquidationLog = new ArrayList\u003c\u003e();\n\n static void reset() { equity = BigDecimal.ZERO; positions.clear(); liquidationLog.clear(); }\n\n static BigDecimal totalMarketValue() {\n return positions.stream().map(Position::marketValue)\n .reduce(BigDecimal.ZERO, BigDecimal::add);\n }\n\n // Margin ratio = equity / totalMarketValue (if totalMarketValue \u003e 0)\n // Maintenance margin = 0.25 (25%)\n // If margin ratio \u003c 0.25, must liquidate positions to restore it.\n //\n // Liquidation rules:\n // 1. Sort positions by market value DESCENDING (liquidate largest first)\n // 2. For each position, sell the MINIMUM whole units needed to bring margin ratio \u003e= 0.25\n // - Each unit sold: equity += currentPrice, quantity -= 1\n // 3. Log each sale as \"LIQUIDATE:\u003csymbol\u003e:\u003cunitsSold\u003e\"\n // 4. Stop as soon as margin ratio \u003e= 0.25 (do NOT over-liquidate)\n // Returns: true if liquidation was needed, false otherwise\n static boolean checkAndLiquidate() {\n","golden_completion":" BigDecimal maintenanceMargin = new BigDecimal(\"0.25\");\n BigDecimal tmv = totalMarketValue();\n if (tmv.compareTo(BigDecimal.ZERO) == 0) return false;\n if (equity.divide(tmv, 4, RoundingMode.HALF_UP).compareTo(maintenanceMargin) \u003e= 0) return false;\n positions.sort(Comparator.comparing(Position::marketValue).reversed());\n boolean liquidated = false;\n for (Position p : positions) {\n int unitsSold = 0;\n while (p.quantity.compareTo(BigDecimal.ZERO) \u003e 0) {\n BigDecimal ratio = equity.divide(totalMarketValue(), 4, RoundingMode.HALF_UP);\n if (ratio.compareTo(maintenanceMargin) \u003e= 0) break;\n p.quantity = p.quantity.subtract(BigDecimal.ONE);\n equity = equity.add(p.currentPrice);\n unitsSold++;\n }\n if (unitsSold \u003e 0) {\n liquidationLog.add(\"LIQUIDATE:\" + p.symbol + \":\" + unitsSold);\n liquidated = true;\n }\n BigDecimal ratio = equity.divide(totalMarketValue(), 4, RoundingMode.HALF_UP);\n if (ratio.compareTo(maintenanceMargin) \u003e= 0) break;\n }\n return liquidated;\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n equity = new BigDecimal(\"200\");\n positions.add(new Position(\"AAPL\", new BigDecimal(\"10\"), new BigDecimal(\"150\")));\n positions.add(new Position(\"GOOG\", new BigDecimal(\"5\"), new BigDecimal(\"100\")));\n // TMV = 1500 + 500 = 2000, ratio = 200/2000 = 0.10 \u003c 0.25\n boolean result = checkAndLiquidate();\n assert result : \"Liquidation should have occurred\";\n // After liquidation, ratio should be \u003e= 0.25\n BigDecimal ratio = equity.divide(totalMarketValue(), 4, RoundingMode.HALF_UP);\n assert ratio.compareTo(new BigDecimal(\"0.25\")) \u003e= 0 : \"Margin ratio should be \u003e= 0.25, got \" + ratio;\n assert !liquidationLog.isEmpty() : \"Should have liquidation entries\";\n // AAPL is largest, should be liquidated first\n assert liquidationLog.get(0).startsWith(\"LIQUIDATE:AAPL:\") : \"AAPL should be liquidated first\";\n }\n}\n","assertions":"\n // Hidden: no liquidation needed when already above margin\n reset();\n equity = new BigDecimal(\"500\");\n positions.add(new Position(\"MSFT\", new BigDecimal(\"5\"), new BigDecimal(\"100\")));\n // TMV = 500, ratio = 500/500 = 1.0 \u003e= 0.25\n boolean r2 = checkAndLiquidate();\n assert !r2 : \"No liquidation needed\";\n assert liquidationLog.isEmpty() : \"No log entries expected\";\n\n // Hidden: minimal liquidation — don\u0027t over-sell\n reset();\n equity = new BigDecimal(\"220\");\n positions.add(new Position(\"X\", new BigDecimal(\"4\"), new BigDecimal(\"100\")));\n positions.add(new Position(\"Y\", new BigDecimal(\"6\"), new BigDecimal(\"100\")));\n // TMV = 1000, ratio = 220/1000 = 0.22 \u003c 0.25\n // Need ratio \u003e= 0.25. Sell Y first (largest).\n // Sell 1 Y: equity=320, TMV=900, ratio=0.3556 \u003e= 0.25 -\u003e stop\n checkAndLiquidate();\n assert liquidationLog.size() == 1 : \"Only one liquidation entry expected, got \" + liquidationLog;\n assert liquidationLog.get(0).equals(\"LIQUIDATE:Y:1\") : \"Should sell exactly 1 Y, got \" + liquidationLog.get(0);\n","category":"code_purpose_understanding"} {"id":"23","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\nimport java.util.stream.Collectors;\n\npublic class CPTask23 {\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n // Calculate final grade with drop-lowest and curve.\n // Rules:\n // 1. Sort scores ascending and drop the lowest \u0027dropCount\u0027 scores\n // 2. Average the REMAINING scores (use BigDecimal, scale 2, HALF_UP)\n // 3. Add \u0027curvePoints\u0027 to the average\n // 4. Cap the final grade at 100.00 (never exceed)\n // 5. Log: \"DROP:\u003cdropped scores csv\u003e|AVG:\u003caverage before curve\u003e|FINAL:\u003cfinal\u003e\"\n // Returns: the final grade as BigDecimal (scale 2)\n static BigDecimal calculateFinalGrade(List\u003cInteger\u003e scores, int dropCount, BigDecimal curvePoints) {\n","golden_completion":" List\u003cInteger\u003e sorted = scores.stream().sorted().collect(Collectors.toList());\n List\u003cInteger\u003e dropped = sorted.subList(0, dropCount);\n List\u003cInteger\u003e kept = sorted.subList(dropCount, sorted.size());\n BigDecimal sum = kept.stream().map(BigDecimal::new).reduce(BigDecimal.ZERO, BigDecimal::add);\n BigDecimal avg = sum.divide(new BigDecimal(kept.size()), 2, RoundingMode.HALF_UP);\n BigDecimal finalGrade = avg.add(curvePoints);\n BigDecimal cap = new BigDecimal(\"100.00\");\n if (finalGrade.compareTo(cap) \u003e 0) finalGrade = cap;\n String droppedCsv = dropped.stream().map(String::valueOf).collect(Collectors.joining(\",\"));\n auditLog.add(\"DROP:\" + droppedCsv + \"|AVG:\" + avg + \"|FINAL:\" + finalGrade);\n return finalGrade;\n","suffix":" }\n\n public static void main(String[] args) {\n auditLog.clear();\n List\u003cInteger\u003e scores = Arrays.asList(70, 85, 90, 60, 95);\n BigDecimal result = calculateFinalGrade(scores, 1, new BigDecimal(\"5\"));\n // Drop 60, remaining: [70,85,90,95], avg = 340/4 = 85.00, +5 = 90.00\n assert result.compareTo(new BigDecimal(\"90.00\")) == 0 : \"Expected 90.00, got \" + result;\n assert auditLog.size() == 1;\n assert auditLog.get(0).equals(\"DROP:60|AVG:85.00|FINAL:90.00\") : \"Log mismatch: \" + auditLog.get(0);\n }\n}\n","assertions":"\n // Hidden: curve causes cap at 100\n auditLog.clear();\n List\u003cInteger\u003e s2 = Arrays.asList(95, 98, 92, 88, 97);\n BigDecimal r2 = calculateFinalGrade(s2, 1, new BigDecimal(\"10\"));\n // Drop 88, remaining: [92,95,97,98], avg = 382/4 = 95.50, +10 = 105.50 -\u003e cap 100.00\n assert r2.compareTo(new BigDecimal(\"100.00\")) == 0 : \"Should cap at 100, got \" + r2;\n\n // Hidden: drop 2 lowest\n auditLog.clear();\n List\u003cInteger\u003e s3 = Arrays.asList(50, 55, 80, 90, 100);\n BigDecimal r3 = calculateFinalGrade(s3, 2, BigDecimal.ZERO);\n // Drop [50,55], remaining: [80,90,100], avg = 270/3 = 90.00\n assert r3.compareTo(new BigDecimal(\"90.00\")) == 0 : \"Expected 90.00, got \" + r3;\n assert auditLog.get(0).equals(\"DROP:50,55|AVG:90.00|FINAL:90.00\") : \"Log: \" + auditLog.get(0);\n\n // Hidden: rounding test\n auditLog.clear();\n List\u003cInteger\u003e s4 = Arrays.asList(71, 82, 93);\n BigDecimal r4 = calculateFinalGrade(s4, 1, new BigDecimal(\"3\"));\n // Drop 71, remaining: [82,93], avg = 175/2 = 87.50, +3 = 90.50\n assert r4.compareTo(new BigDecimal(\"90.50\")) == 0 : \"Expected 90.50, got \" + r4;\n","category":"code_purpose_understanding"} {"id":"24","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask24 {\n static Map\u003cString, Set\u003cString\u003e\u003e prerequisites = new HashMap\u003c\u003e(); // course -\u003e required courses\n static Map\u003cString, Integer\u003e capacity = new HashMap\u003c\u003e(); // course -\u003e max seats\n static Map\u003cString, List\u003cString\u003e\u003e enrolled = new HashMap\u003c\u003e(); // course -\u003e enrolled student IDs\n static Map\u003cString, LinkedList\u003cString\u003e\u003e waitlist = new HashMap\u003c\u003e(); // course -\u003e waitlisted student IDs\n static Map\u003cString, Set\u003cString\u003e\u003e completed = new HashMap\u003c\u003e(); // student -\u003e completed courses\n static List\u003cString\u003e enrollLog = new ArrayList\u003c\u003e();\n\n static void reset() {\n prerequisites.clear(); capacity.clear(); enrolled.clear();\n waitlist.clear(); completed.clear(); enrollLog.clear();\n }\n\n // Enroll a student in a course.\n // Rules:\n // 1. Check prerequisites: student must have completed ALL prerequisite courses.\n // If not met, log \"PREREQ_FAIL:\u003cstudent\u003e:\u003ccourse\u003e\" and return \"PREREQ_FAIL\"\n // 2. Check duplicate: if student already enrolled OR on waitlist,\n // log \"DUPLICATE:\u003cstudent\u003e:\u003ccourse\u003e\" and return \"DUPLICATE\"\n // 3. If seats available (enrolled.size \u003c capacity), add to enrolled list,\n // log \"ENROLLED:\u003cstudent\u003e:\u003ccourse\u003e\" and return \"ENROLLED\"\n // 4. Otherwise add to waitlist (FIFO),\n // log \"WAITLISTED:\u003cstudent\u003e:\u003ccourse\u003e\" and return \"WAITLISTED\"\n static String enroll(String student, String course) {\n","golden_completion":" Set\u003cString\u003e prereqs = prerequisites.getOrDefault(course, Collections.emptySet());\n Set\u003cString\u003e done = completed.getOrDefault(student, Collections.emptySet());\n if (!done.containsAll(prereqs)) {\n enrollLog.add(\"PREREQ_FAIL:\" + student + \":\" + course);\n return \"PREREQ_FAIL\";\n }\n List\u003cString\u003e enrolledList = enrolled.computeIfAbsent(course, k -\u003e new ArrayList\u003c\u003e());\n LinkedList\u003cString\u003e wl = waitlist.computeIfAbsent(course, k -\u003e new LinkedList\u003c\u003e());\n if (enrolledList.contains(student) || wl.contains(student)) {\n enrollLog.add(\"DUPLICATE:\" + student + \":\" + course);\n return \"DUPLICATE\";\n }\n int cap = capacity.getOrDefault(course, Integer.MAX_VALUE);\n if (enrolledList.size() \u003c cap) {\n enrolledList.add(student);\n enrollLog.add(\"ENROLLED:\" + student + \":\" + course);\n return \"ENROLLED\";\n }\n wl.add(student);\n enrollLog.add(\"WAITLISTED:\" + student + \":\" + course);\n return \"WAITLISTED\";\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n capacity.put(\"CS201\", 2);\n prerequisites.put(\"CS201\", new HashSet\u003c\u003e(Arrays.asList(\"CS101\")));\n completed.put(\"Alice\", new HashSet\u003c\u003e(Arrays.asList(\"CS101\")));\n completed.put(\"Bob\", new HashSet\u003c\u003e(Arrays.asList(\"CS101\")));\n completed.put(\"Charlie\", new HashSet\u003c\u003e(Arrays.asList(\"CS101\")));\n\n assert enroll(\"Alice\", \"CS201\").equals(\"ENROLLED\");\n assert enroll(\"Bob\", \"CS201\").equals(\"ENROLLED\");\n assert enroll(\"Charlie\", \"CS201\").equals(\"WAITLISTED\");\n assert enrolled.get(\"CS201\").size() == 2;\n assert waitlist.get(\"CS201\").size() == 1;\n }\n}\n","assertions":"\n // Hidden: prerequisite failure\n reset();\n capacity.put(\"CS301\", 10);\n prerequisites.put(\"CS301\", new HashSet\u003c\u003e(Arrays.asList(\"CS201\")));\n completed.put(\"Dave\", new HashSet\u003c\u003e(Arrays.asList(\"CS101\")));\n String r1 = enroll(\"Dave\", \"CS301\");\n assert r1.equals(\"PREREQ_FAIL\") : \"Dave lacks CS201, got \" + r1;\n\n // Hidden: duplicate enrollment\n reset();\n capacity.put(\"CS101\", 10);\n completed.put(\"Eve\", new HashSet\u003c\u003e());\n enroll(\"Eve\", \"CS101\");\n String r2 = enroll(\"Eve\", \"CS101\");\n assert r2.equals(\"DUPLICATE\") : \"Eve already enrolled, got \" + r2;\n\n // Hidden: duplicate on waitlist\n reset();\n capacity.put(\"CS101\", 1);\n enroll(\"Frank\", \"CS101\");\n enroll(\"Grace\", \"CS101\"); // waitlisted\n String r3 = enroll(\"Grace\", \"CS101\");\n assert r3.equals(\"DUPLICATE\") : \"Grace already waitlisted, got \" + r3;\n\n // Hidden: prerequisite check happens BEFORE duplicate check\n reset();\n capacity.put(\"CS301\", 10);\n prerequisites.put(\"CS301\", new HashSet\u003c\u003e(Arrays.asList(\"CS201\")));\n completed.put(\"Hank\", new HashSet\u003c\u003e());\n enroll(\"Hank\", \"CS301\"); // PREREQ_FAIL\n String r4 = enroll(\"Hank\", \"CS301\"); // should be PREREQ_FAIL again, not DUPLICATE\n assert r4.equals(\"PREREQ_FAIL\") : \"Prereq check should precede duplicate, got \" + r4;\n","category":"code_purpose_understanding"} {"id":"25","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask25 {\n static List\u003cString\u003e qcLog = new ArrayList\u003c\u003e();\n\n // Inspect a batch of items and decide pass/reject.\n // Rules:\n // 1. Defect rate = defectCount / totalCount (BigDecimal, scale 4, HALF_UP)\n // 2. If defect rate \u003e maxDefectRate, REJECT with reason \"RATE_EXCEEDED\"\n // 3. If consecutiveDefects \u003e maxConsecutive, REJECT with reason \"CONSECUTIVE_EXCEEDED\"\n // 4. If BOTH exceeded, reason is \"RATE_EXCEEDED|CONSECUTIVE_EXCEEDED\"\n // 5. Log: \"BATCH:\u003cbatchId\u003e:\u003cPASS|REJECT\u003e:\u003creason or NONE\u003e\"\n // Returns: \"PASS\" or \"REJECT\"\n static String inspectBatch(String batchId, int totalCount, int defectCount,\n int consecutiveDefects, int maxConsecutive,\n BigDecimal maxDefectRate) {\n","golden_completion":" BigDecimal rate = new BigDecimal(defectCount).divide(new BigDecimal(totalCount), 4, RoundingMode.HALF_UP);\n boolean rateExceeded = rate.compareTo(maxDefectRate) \u003e 0;\n boolean consExceeded = consecutiveDefects \u003e maxConsecutive;\n String reason;\n String result;\n if (rateExceeded \u0026\u0026 consExceeded) {\n reason = \"RATE_EXCEEDED|CONSECUTIVE_EXCEEDED\";\n result = \"REJECT\";\n } else if (rateExceeded) {\n reason = \"RATE_EXCEEDED\";\n result = \"REJECT\";\n } else if (consExceeded) {\n reason = \"CONSECUTIVE_EXCEEDED\";\n result = \"REJECT\";\n } else {\n reason = \"NONE\";\n result = \"PASS\";\n }\n qcLog.add(\"BATCH:\" + batchId + \":\" + result + \":\" + reason);\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n qcLog.clear();\n // 5/100 = 0.05, max 0.04 -\u003e rate exceeded; consecutive 2, max 3 -\u003e ok\n String r = inspectBatch(\"B001\", 100, 5, 2, 3, new BigDecimal(\"0.04\"));\n assert r.equals(\"REJECT\") : \"Expected REJECT, got \" + r;\n assert qcLog.get(0).equals(\"BATCH:B001:REJECT:RATE_EXCEEDED\") : \"Log: \" + qcLog.get(0);\n\n // Both exceeded\n qcLog.clear();\n String r2 = inspectBatch(\"B002\", 100, 10, 5, 3, new BigDecimal(\"0.05\"));\n assert r2.equals(\"REJECT\");\n assert qcLog.get(0).equals(\"BATCH:B002:REJECT:RATE_EXCEEDED|CONSECUTIVE_EXCEEDED\") : \"Log: \" + qcLog.get(0);\n }\n}\n","assertions":"\n // Hidden: PASS case\n qcLog.clear();\n String r3 = inspectBatch(\"B003\", 200, 5, 1, 3, new BigDecimal(\"0.05\"));\n // rate = 5/200 = 0.0250, max 0.05 -\u003e ok; consec 1, max 3 -\u003e ok\n assert r3.equals(\"PASS\") : \"Expected PASS, got \" + r3;\n assert qcLog.get(0).equals(\"BATCH:B003:PASS:NONE\") : \"Log: \" + qcLog.get(0);\n\n // Hidden: consecutive only\n qcLog.clear();\n String r4 = inspectBatch(\"B004\", 100, 2, 4, 3, new BigDecimal(\"0.05\"));\n // rate = 0.0200, max 0.05 -\u003e ok; consec 4, max 3 -\u003e exceeded\n assert r4.equals(\"REJECT\") : \"Expected REJECT, got \" + r4;\n assert qcLog.get(0).equals(\"BATCH:B004:REJECT:CONSECUTIVE_EXCEEDED\") : \"Log: \" + qcLog.get(0);\n\n // Hidden: boundary — rate exactly equal to max is NOT exceeded\n qcLog.clear();\n String r5 = inspectBatch(\"B005\", 100, 5, 0, 3, new BigDecimal(\"0.0500\"));\n assert r5.equals(\"PASS\") : \"Rate exactly at max should PASS, got \" + r5;\n","category":"code_purpose_understanding"} {"id":"26","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask26 {\n static class Job {\n final String id;\n final String productType;\n final int duration; // minutes\n final int priority; // lower = higher priority\n\n Job(String id, String productType, int duration, int priority) {\n this.id = id; this.productType = productType;\n this.duration = duration; this.priority = priority;\n }\n }\n\n static int machineAvailableFrom; // start of available window (minutes from midnight)\n static int machineAvailableUntil; // end of available window\n static int setupTime; // setup minutes when switching product types\n static List\u003cString\u003e scheduleLog = new ArrayList\u003c\u003e();\n\n static void reset() { scheduleLog.clear(); }\n\n // Schedule jobs on a single machine within the availability window.\n // Rules:\n // 1. Sort jobs by priority (ascending — lower number = higher priority)\n // 2. Start scheduling at machineAvailableFrom\n // 3. When switching product types (current != previous), add setupTime\n // (first job has no setup penalty)\n // 4. If a job fits entirely within the window, schedule it:\n // Log \"SCHEDULED:\u003cjobId\u003e:\u003cstartTime\u003e-\u003cendTime\u003e\"\n // 5. If a job does NOT fit, skip it:\n // Log \"SKIPPED:\u003cjobId\u003e:INSUFFICIENT_TIME\"\n // 6. Return total number of jobs scheduled\n static int scheduleJobs(List\u003cJob\u003e jobs) {\n","golden_completion":" List\u003cJob\u003e sorted = new ArrayList\u003c\u003e(jobs);\n sorted.sort(Comparator.comparingInt(j -\u003e j.priority));\n int currentTime = machineAvailableFrom;\n String lastProductType = null;\n int scheduled = 0;\n for (Job job : sorted) {\n int start = currentTime;\n if (lastProductType != null \u0026\u0026 !lastProductType.equals(job.productType)) {\n start += setupTime;\n }\n int end = start + job.duration;\n if (end \u003c= machineAvailableUntil) {\n scheduleLog.add(\"SCHEDULED:\" + job.id + \":\" + start + \"-\" + end);\n currentTime = end;\n lastProductType = job.productType;\n scheduled++;\n } else {\n scheduleLog.add(\"SKIPPED:\" + job.id + \":INSUFFICIENT_TIME\");\n }\n }\n return scheduled;\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n machineAvailableFrom = 480; // 8:00 AM\n machineAvailableUntil = 600; // 10:00 AM (120 min window)\n setupTime = 10;\n\n List\u003cJob\u003e jobs = Arrays.asList(\n new Job(\"J1\", \"TypeA\", 30, 2),\n new Job(\"J2\", \"TypeA\", 30, 1),\n new Job(\"J3\", \"TypeB\", 40, 3)\n );\n int count = scheduleJobs(jobs);\n // Priority order: J2(1), J1(2), J3(3)\n // J2: TypeA, start=480, end=510 (scheduled)\n // J1: TypeA same type, start=510, end=540 (scheduled)\n // J3: TypeB switch, start=540+10=550, end=590 (scheduled, 590\u003c=600)\n assert count == 3 : \"Expected 3 scheduled, got \" + count;\n assert scheduleLog.get(0).equals(\"SCHEDULED:J2:480-510\") : \"Log[0]: \" + scheduleLog.get(0);\n assert scheduleLog.get(1).equals(\"SCHEDULED:J1:510-540\") : \"Log[1]: \" + scheduleLog.get(1);\n assert scheduleLog.get(2).equals(\"SCHEDULED:J3:550-590\") : \"Log[2]: \" + scheduleLog.get(2);\n }\n}\n","assertions":"\n // Hidden: job skipped when insufficient time\n reset();\n machineAvailableFrom = 0;\n machineAvailableUntil = 50;\n setupTime = 5;\n List\u003cJob\u003e j2 = Arrays.asList(\n new Job(\"A\", \"X\", 30, 1),\n new Job(\"B\", \"Y\", 20, 2)\n );\n int c2 = scheduleJobs(j2);\n // A: X, start=0, end=30 (scheduled)\n // B: Y switch, start=30+5=35, end=55 \u003e 50 (skipped)\n assert c2 == 1 : \"Expected 1 scheduled, got \" + c2;\n assert scheduleLog.get(1).equals(\"SKIPPED:B:INSUFFICIENT_TIME\") : \"B should be skipped: \" + scheduleLog.get(1);\n\n // Hidden: same product type means no setup time\n reset();\n machineAvailableFrom = 0;\n machineAvailableUntil = 50;\n setupTime = 100;\n List\u003cJob\u003e j3 = Arrays.asList(\n new Job(\"C\", \"Z\", 20, 1),\n new Job(\"D\", \"Z\", 20, 2)\n );\n int c3 = scheduleJobs(j3);\n // C: Z, start=0, end=20; D: Z same, start=20, end=40 \u003c= 50\n assert c3 == 2 : \"Same type no setup, expected 2, got \" + c3;\n\n // Hidden: all skipped when window too small\n reset();\n machineAvailableFrom = 0;\n machineAvailableUntil = 5;\n setupTime = 0;\n List\u003cJob\u003e j4 = Arrays.asList(new Job(\"E\", \"X\", 10, 1));\n int c4 = scheduleJobs(j4);\n assert c4 == 0;\n assert scheduleLog.get(0).equals(\"SKIPPED:E:INSUFFICIENT_TIME\");\n\n // Hidden: priority ordering matters (high-priority gets scheduled first)\n reset();\n machineAvailableFrom = 0;\n machineAvailableUntil = 35;\n setupTime = 0;\n List\u003cJob\u003e j5 = Arrays.asList(\n new Job(\"F\", \"X\", 20, 3),\n new Job(\"G\", \"X\", 20, 1)\n );\n int c5 = scheduleJobs(j5);\n // G(pri 1) first: 0-20, F(pri 3): 20-40 \u003e 35 -\u003e skip\n assert c5 == 1;\n assert scheduleLog.get(0).equals(\"SCHEDULED:G:0-20\");\n assert scheduleLog.get(1).equals(\"SKIPPED:F:INSUFFICIENT_TIME\");\n","category":"code_purpose_understanding"} {"id":"27","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.util.*;\n\npublic class CPTask27 {\n enum EscrowStatus { OPEN, CONTINGENCY_FAILED, CLOSED, FORFEITED }\n\n static class Contingency {\n final String name;\n final int deadlineDay; // day number by which it must be satisfied\n boolean satisfied;\n\n Contingency(String name, int deadlineDay) {\n this.name = name; this.deadlineDay = deadlineDay; this.satisfied = false;\n }\n }\n\n static EscrowStatus status;\n static BigDecimal earnestMoney;\n static BigDecimal forfeitedAmount;\n static List\u003cContingency\u003e contingencies; // must be processed in deadline order\n static List\u003cString\u003e escrowLog = new ArrayList\u003c\u003e();\n\n static void reset() {\n status = EscrowStatus.OPEN; forfeitedAmount = BigDecimal.ZERO;\n escrowLog.clear();\n }\n\n // Process contingencies up to the given currentDay.\n // Rules:\n // 1. Process contingencies in DEADLINE ORDER (earliest first)\n // 2. Skip contingencies whose deadline is after currentDay (not yet due)\n // 3. If a contingency is due (deadlineDay \u003c= currentDay) and NOT satisfied:\n // - Set status to CONTINGENCY_FAILED\n // - Forfeit earnest money: forfeitedAmount = earnestMoney\n // - Log \"FAILED:\u003cname\u003e:DAY\u003cdeadlineDay\u003e:FORFEITED:\u003cearnestMoney\u003e\"\n // - Stop processing further contingencies (first failure stops escrow)\n // 4. If contingency is due AND satisfied, log \"CLEARED:\u003cname\u003e:DAY\u003cdeadlineDay\u003e\"\n // 5. If ALL due contingencies are satisfied, status stays OPEN\n // Returns the current EscrowStatus\n static EscrowStatus processContingencies(int currentDay) {\n","golden_completion":" List\u003cContingency\u003e sorted = new ArrayList\u003c\u003e(contingencies);\n sorted.sort(Comparator.comparingInt(c -\u003e c.deadlineDay));\n for (Contingency c : sorted) {\n if (c.deadlineDay \u003e currentDay) continue;\n if (!c.satisfied) {\n status = EscrowStatus.CONTINGENCY_FAILED;\n forfeitedAmount = earnestMoney;\n escrowLog.add(\"FAILED:\" + c.name + \":DAY\" + c.deadlineDay + \":FORFEITED:\" + earnestMoney);\n return status;\n }\n escrowLog.add(\"CLEARED:\" + c.name + \":DAY\" + c.deadlineDay);\n }\n return status;\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n earnestMoney = new BigDecimal(\"25000\");\n contingencies = new ArrayList\u003c\u003e(Arrays.asList(\n new Contingency(\"INSPECTION\", 10),\n new Contingency(\"APPRAISAL\", 20),\n new Contingency(\"FINANCING\", 30)\n ));\n contingencies.get(0).satisfied = true; // inspection passed\n // Process day 15: inspection due and satisfied, appraisal not yet due\n EscrowStatus s = processContingencies(15);\n assert s == EscrowStatus.OPEN : \"Expected OPEN, got \" + s;\n assert escrowLog.size() == 1;\n assert escrowLog.get(0).equals(\"CLEARED:INSPECTION:DAY10\");\n }\n}\n","assertions":"\n // Hidden: first unsatisfied contingency forfeits earnest money\n reset();\n earnestMoney = new BigDecimal(\"50000\");\n contingencies = new ArrayList\u003c\u003e(Arrays.asList(\n new Contingency(\"INSPECTION\", 10),\n new Contingency(\"APPRAISAL\", 20)\n ));\n contingencies.get(0).satisfied = true;\n // Appraisal NOT satisfied, process day 25\n EscrowStatus s2 = processContingencies(25);\n assert s2 == EscrowStatus.CONTINGENCY_FAILED : \"Should fail on appraisal\";\n assert forfeitedAmount.compareTo(new BigDecimal(\"50000\")) == 0 : \"Earnest money forfeited\";\n assert escrowLog.get(escrowLog.size() - 1).contains(\"FAILED:APPRAISAL\");\n\n // Hidden: deadline order matters — earlier failure stops processing\n reset();\n earnestMoney = new BigDecimal(\"30000\");\n contingencies = new ArrayList\u003c\u003e(Arrays.asList(\n new Contingency(\"FINANCING\", 30),\n new Contingency(\"INSPECTION\", 10)\n ));\n // Neither satisfied, process day 35\n EscrowStatus s3 = processContingencies(35);\n assert s3 == EscrowStatus.CONTINGENCY_FAILED;\n // INSPECTION (day 10) should fail first despite being listed second\n assert escrowLog.get(escrowLog.size() - 1).contains(\"FAILED:INSPECTION\") : \"Inspection should fail first: \" + escrowLog;\n\n // Hidden: all satisfied\n reset();\n earnestMoney = new BigDecimal(\"20000\");\n contingencies = new ArrayList\u003c\u003e(Arrays.asList(\n new Contingency(\"A\", 5),\n new Contingency(\"B\", 10)\n ));\n contingencies.get(0).satisfied = true;\n contingencies.get(1).satisfied = true;\n EscrowStatus s4 = processContingencies(15);\n assert s4 == EscrowStatus.OPEN : \"All satisfied, should stay OPEN\";\n assert forfeitedAmount.compareTo(BigDecimal.ZERO) == 0;\n","category":"code_purpose_understanding"} {"id":"28","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask28 {\n static List\u003cString\u003e commissionLog = new ArrayList\u003c\u003e();\n\n // Calculate agent commission from a property sale with tiered rates.\n //\n // Commission tiers (on sale price):\n // - First tierOneLimit: tierOneRate\n // - Next (tierTwoLimit - tierOneLimit): tierTwoRate\n // - Remainder above tierTwoLimit: tierThreeRate\n //\n // Then split between listing and buying agent:\n // - listingAgent gets splitRatio of total commission\n // - buyingAgent gets (1 - splitRatio) of total commission\n //\n // Constraints:\n // - Each agent\u0027s commission has a MINIMUM guarantee (minCommission)\n // - Each agent\u0027s commission is CAPPED at maxCommission\n // - Apply minimum FIRST, then cap (minimum takes priority over cap if min \u003e max, use min)\n //\n // Log: \"COMMISSION:\u003csalePrice\u003e|TOTAL:\u003ctotalComm\u003e|LISTING:\u003clistingComm\u003e|BUYING:\u003cbuyingComm\u003e\"\n // Returns: BigDecimal[]{listingCommission, buyingCommission}\n static BigDecimal[] calculateCommission(BigDecimal salePrice,\n BigDecimal tierOneLimit, BigDecimal tierOneRate,\n BigDecimal tierTwoLimit, BigDecimal tierTwoRate,\n BigDecimal tierThreeRate,\n BigDecimal splitRatio,\n BigDecimal minCommission, BigDecimal maxCommission) {\n","golden_completion":" BigDecimal total = BigDecimal.ZERO;\n if (salePrice.compareTo(tierOneLimit) \u003c= 0) {\n total = salePrice.multiply(tierOneRate);\n } else if (salePrice.compareTo(tierTwoLimit) \u003c= 0) {\n total = tierOneLimit.multiply(tierOneRate)\n .add(salePrice.subtract(tierOneLimit).multiply(tierTwoRate));\n } else {\n total = tierOneLimit.multiply(tierOneRate)\n .add(tierTwoLimit.subtract(tierOneLimit).multiply(tierTwoRate))\n .add(salePrice.subtract(tierTwoLimit).multiply(tierThreeRate));\n }\n total = total.setScale(2, RoundingMode.HALF_UP);\n BigDecimal listing = total.multiply(splitRatio).setScale(2, RoundingMode.HALF_UP);\n BigDecimal buying = total.subtract(listing);\n // Apply minimum first, then cap\n if (listing.compareTo(minCommission) \u003c 0) listing = minCommission;\n if (listing.compareTo(maxCommission) \u003e 0) listing = maxCommission;\n if (buying.compareTo(minCommission) \u003c 0) buying = minCommission;\n if (buying.compareTo(maxCommission) \u003e 0) buying = maxCommission;\n commissionLog.add(\"COMMISSION:\" + salePrice + \"|TOTAL:\" + total + \"|LISTING:\" + listing + \"|BUYING:\" + buying);\n return new BigDecimal[]{listing, buying};\n","suffix":" }\n\n public static void main(String[] args) {\n commissionLog.clear();\n // $500K sale, tiers: 0-200K@6%, 200K-400K@5%, 400K+@4%\n // Tier1: 200000*0.06=12000, Tier2: 200000*0.05=10000, Tier3: 100000*0.04=4000\n // Total = 26000, listing 60%=15600, buying 40%=10400\n BigDecimal[] r = calculateCommission(\n new BigDecimal(\"500000\"),\n new BigDecimal(\"200000\"), new BigDecimal(\"0.06\"),\n new BigDecimal(\"400000\"), new BigDecimal(\"0.05\"),\n new BigDecimal(\"0.04\"),\n new BigDecimal(\"0.60\"),\n new BigDecimal(\"5000\"), new BigDecimal(\"20000\")\n );\n assert r[0].compareTo(new BigDecimal(\"15600.00\")) == 0 : \"Listing: \" + r[0];\n assert r[1].compareTo(new BigDecimal(\"10400.00\")) == 0 : \"Buying: \" + r[1];\n }\n}\n","assertions":"\n // Hidden: minimum guarantee kicks in\n commissionLog.clear();\n BigDecimal[] r2 = calculateCommission(\n new BigDecimal(\"50000\"),\n new BigDecimal(\"200000\"), new BigDecimal(\"0.06\"),\n new BigDecimal(\"400000\"), new BigDecimal(\"0.05\"),\n new BigDecimal(\"0.04\"),\n new BigDecimal(\"0.60\"),\n new BigDecimal(\"5000\"), new BigDecimal(\"20000\")\n );\n // Total = 50000*0.06 = 3000, listing 60%=1800, buying 40%=1200\n // Both below min 5000, so both get 5000\n assert r2[0].compareTo(new BigDecimal(\"5000\")) == 0 : \"Listing min guarantee: \" + r2[0];\n assert r2[1].compareTo(new BigDecimal(\"5000\")) == 0 : \"Buying min guarantee: \" + r2[1];\n\n // Hidden: cap applied\n commissionLog.clear();\n BigDecimal[] r3 = calculateCommission(\n new BigDecimal(\"2000000\"),\n new BigDecimal(\"200000\"), new BigDecimal(\"0.06\"),\n new BigDecimal(\"400000\"), new BigDecimal(\"0.05\"),\n new BigDecimal(\"0.04\"),\n new BigDecimal(\"0.70\"),\n new BigDecimal(\"1000\"), new BigDecimal(\"50000\")\n );\n // Total = 12000 + 10000 + 64000 = 86000\n // listing 70% = 60200, buying 30% = 25800\n // listing capped at 50000\n assert r3[0].compareTo(new BigDecimal(\"50000\")) == 0 : \"Listing capped: \" + r3[0];\n assert r3[1].compareTo(new BigDecimal(\"25800.00\")) == 0 : \"Buying not capped: \" + r3[1];\n\n // Hidden: sale exactly at tier boundary\n commissionLog.clear();\n BigDecimal[] r4 = calculateCommission(\n new BigDecimal(\"200000\"),\n new BigDecimal(\"200000\"), new BigDecimal(\"0.06\"),\n new BigDecimal(\"400000\"), new BigDecimal(\"0.05\"),\n new BigDecimal(\"0.04\"),\n new BigDecimal(\"0.50\"),\n new BigDecimal(\"1000\"), new BigDecimal(\"100000\")\n );\n // Total = 200000*0.06 = 12000, listing 50% = 6000, buying 50% = 6000\n assert r4[0].compareTo(new BigDecimal(\"6000.00\")) == 0 : \"At tier1 boundary listing: \" + r4[0];\n assert r4[1].compareTo(new BigDecimal(\"6000.00\")) == 0 : \"At tier1 boundary buying: \" + r4[1];\n","category":"code_purpose_understanding"} {"id":"29","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask29 {\n static Map\u003cString, Set\u003cString\u003e\u003e prerequisites = new HashMap\u003c\u003e(); // achievement -\u003e required achievements\n static Map\u003cString, Integer\u003e achievementPoints = new HashMap\u003c\u003e(); // achievement -\u003e point value\n static Set\u003cString\u003e unlocked = new HashSet\u003c\u003e();\n static int totalPoints = 0;\n static String tier = \"BRONZE\"; // BRONZE -\u003e SILVER (100pts) -\u003e GOLD (250pts) -\u003e PLATINUM (500pts)\n static List\u003cString\u003e achieveLog = new ArrayList\u003c\u003e();\n\n static void reset() {\n prerequisites.clear(); achievementPoints.clear(); unlocked.clear();\n totalPoints = 0; tier = \"BRONZE\"; achieveLog.clear();\n }\n\n static String computeTier(int points) {\n if (points \u003e= 500) return \"PLATINUM\";\n if (points \u003e= 250) return \"GOLD\";\n if (points \u003e= 100) return \"SILVER\";\n return \"BRONZE\";\n }\n\n // Attempt to unlock an achievement.\n // Rules:\n // 1. If already unlocked, log \"DUPLICATE:\u003cachieveId\u003e\" and return false (idempotent)\n // 2. Check all prerequisites are unlocked. If not,\n // log \"PREREQ_MISSING:\u003cachieveId\u003e:\u003cmissing csv sorted\u003e\" and return false\n // 3. Unlock the achievement: add to unlocked set\n // 4. Add points: totalPoints += achievementPoints[achieveId]\n // 5. Check tier promotion: if new tier != old tier,\n // log \"TIER_UP:\u003coldTier\u003e-\u003e\u003cnewTier\u003e:\u003ctotalPoints\u003epts\"\n // 6. Log \"UNLOCKED:\u003cachieveId\u003e:\u003cpoints\u003epts:TOTAL:\u003ctotalPoints\u003e\"\n // 7. Return true\n static boolean tryUnlock(String achieveId) {\n","golden_completion":" if (unlocked.contains(achieveId)) {\n achieveLog.add(\"DUPLICATE:\" + achieveId);\n return false;\n }\n Set\u003cString\u003e prereqs = prerequisites.getOrDefault(achieveId, Collections.emptySet());\n Set\u003cString\u003e missing = new TreeSet\u003c\u003e();\n for (String p : prereqs) {\n if (!unlocked.contains(p)) missing.add(p);\n }\n if (!missing.isEmpty()) {\n achieveLog.add(\"PREREQ_MISSING:\" + achieveId + \":\" + String.join(\",\", missing));\n return false;\n }\n unlocked.add(achieveId);\n int pts = achievementPoints.getOrDefault(achieveId, 0);\n String oldTier = tier;\n totalPoints += pts;\n String newTier = computeTier(totalPoints);\n if (!newTier.equals(oldTier)) {\n tier = newTier;\n achieveLog.add(\"TIER_UP:\" + oldTier + \"-\u003e\" + newTier + \":\" + totalPoints + \"pts\");\n }\n achieveLog.add(\"UNLOCKED:\" + achieveId + \":\" + pts + \"pts:TOTAL:\" + totalPoints);\n return true;\n","suffix":" }\n\n public static void main(String[] args) {\n reset();\n achievementPoints.put(\"FIRST_KILL\", 10);\n achievementPoints.put(\"COMBO_5\", 25);\n achievementPoints.put(\"BOSS_SLAYER\", 75);\n prerequisites.put(\"COMBO_5\", new HashSet\u003c\u003e(Arrays.asList(\"FIRST_KILL\")));\n prerequisites.put(\"BOSS_SLAYER\", new HashSet\u003c\u003e(Arrays.asList(\"FIRST_KILL\", \"COMBO_5\")));\n\n assert tryUnlock(\"FIRST_KILL\") == true;\n assert totalPoints == 10;\n assert tryUnlock(\"COMBO_5\") == true;\n assert totalPoints == 35;\n // Try boss slayer — prerequisites met\n assert tryUnlock(\"BOSS_SLAYER\") == true;\n assert totalPoints == 110;\n assert tier.equals(\"SILVER\") : \"Should be SILVER at 110pts\";\n }\n}\n","assertions":"\n // Hidden: prerequisite not met\n reset();\n achievementPoints.put(\"A\", 50);\n achievementPoints.put(\"B\", 50);\n prerequisites.put(\"B\", new HashSet\u003c\u003e(Arrays.asList(\"A\")));\n boolean r1 = tryUnlock(\"B\");\n assert !r1 : \"B requires A\";\n assert achieveLog.get(0).equals(\"PREREQ_MISSING:B:A\") : \"Log: \" + achieveLog.get(0);\n assert totalPoints == 0 : \"Points unchanged\";\n\n // Hidden: idempotency — double unlock\n reset();\n achievementPoints.put(\"X\", 30);\n tryUnlock(\"X\");\n achieveLog.clear();\n boolean r2 = tryUnlock(\"X\");\n assert !r2 : \"Already unlocked\";\n assert achieveLog.get(0).equals(\"DUPLICATE:X\");\n assert totalPoints == 30 : \"Points should not change on duplicate\";\n\n // Hidden: tier promotion from BRONZE to GOLD (skipping SILVER)\n reset();\n achievementPoints.put(\"BIG\", 300);\n tryUnlock(\"BIG\");\n assert tier.equals(\"GOLD\") : \"300pts = GOLD, got \" + tier;\n boolean hasTierUp = achieveLog.stream().anyMatch(l -\u003e l.contains(\"TIER_UP:BRONZE-\u003eGOLD:300pts\"));\n assert hasTierUp : \"Should log tier up: \" + achieveLog;\n\n // Hidden: multiple missing prereqs sorted alphabetically\n reset();\n achievementPoints.put(\"Z\", 10);\n prerequisites.put(\"Z\", new HashSet\u003c\u003e(Arrays.asList(\"C\", \"A\", \"B\")));\n tryUnlock(\"Z\");\n assert achieveLog.get(0).equals(\"PREREQ_MISSING:Z:A,B,C\") : \"Sorted missing: \" + achieveLog.get(0);\n","category":"code_purpose_understanding"} {"id":"30","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask30 {\n static class Player {\n final String name;\n final int seed; // lower = better\n int score;\n\n Player(String name, int seed) { this.name = name; this.seed = seed; this.score = 0; }\n }\n\n static List\u003cString\u003e bracketLog = new ArrayList\u003c\u003e();\n\n static void resetLog() { bracketLog.clear(); }\n\n // Generate first-round pairings from seeded players for a single-elimination bracket.\n // Rules:\n // 1. Sort players by seed (ascending — seed 1 is best)\n // 2. Calculate the bracket size: smallest power of 2 \u003e= numPlayers\n // 3. Number of byes = bracketSize - numPlayers\n // 4. Top \u0027byes\u0027 seeds get a bye (auto-advance without playing)\n // Log \"BYE:\u003cplayerName\u003e:SEED\u003cseed\u003e\"\n // 5. Remaining players pair: first remaining vs last remaining, second vs second-last, etc.\n // Log \"MATCH:\u003cp1Name\u003e(SEED\u003cp1Seed\u003e)vs\u003cp2Name\u003e(SEED\u003cp2Seed\u003e)\"\n // 6. Return list of advancing player names:\n // - Bye players are added first (in seed order)\n // - Then for each match, the player with LOWER seed advances (better seed wins)\n // If same seed (shouldn\u0027t happen), alphabetically first name wins\n static List\u003cString\u003e generateFirstRound(List\u003cPlayer\u003e players) {\n","golden_completion":" List\u003cPlayer\u003e sorted = new ArrayList\u003c\u003e(players);\n sorted.sort(Comparator.comparingInt(p -\u003e p.seed));\n int n = sorted.size();\n int bracketSize = 1;\n while (bracketSize \u003c n) bracketSize *= 2;\n int byes = bracketSize - n;\n List\u003cString\u003e advancing = new ArrayList\u003c\u003e();\n for (int i = 0; i \u003c byes; i++) {\n Player p = sorted.get(i);\n bracketLog.add(\"BYE:\" + p.name + \":SEED\" + p.seed);\n advancing.add(p.name);\n }\n List\u003cPlayer\u003e remaining = sorted.subList(byes, n);\n for (int i = 0; i \u003c remaining.size() / 2; i++) {\n Player p1 = remaining.get(i);\n Player p2 = remaining.get(remaining.size() - 1 - i);\n bracketLog.add(\"MATCH:\" + p1.name + \"(SEED\" + p1.seed + \")vs\" + p2.name + \"(SEED\" + p2.seed + \")\");\n if (p1.seed \u003c p2.seed) advancing.add(p1.name);\n else if (p1.seed \u003e p2.seed) advancing.add(p2.name);\n else advancing.add(p1.name.compareTo(p2.name) \u003c 0 ? p1.name : p2.name);\n }\n return advancing;\n","suffix":" }\n\n public static void main(String[] args) {\n resetLog();\n List\u003cPlayer\u003e players = Arrays.asList(\n new Player(\"Alice\", 1),\n new Player(\"Bob\", 4),\n new Player(\"Charlie\", 2),\n new Player(\"Diana\", 3)\n );\n // 4 players, bracketSize=4, byes=0\n // Sorted: Alice(1), Charlie(2), Diana(3), Bob(4)\n // Pairs: Alice vs Bob, Charlie vs Diana\n List\u003cString\u003e adv = generateFirstRound(players);\n assert adv.size() == 2 : \"Expected 2 advancing, got \" + adv.size();\n assert adv.contains(\"Alice\") : \"Alice (seed 1) should advance\";\n assert adv.contains(\"Charlie\") : \"Charlie (seed 2) should advance\";\n assert bracketLog.size() == 2 : \"Expected 2 matches\";\n assert bracketLog.get(0).equals(\"MATCH:Alice(SEED1)vsBob(SEED4)\") : \"Match 1: \" + bracketLog.get(0);\n assert bracketLog.get(1).equals(\"MATCH:Charlie(SEED2)vsDiana(SEED3)\") : \"Match 2: \" + bracketLog.get(1);\n }\n}\n","assertions":"\n // Hidden: 3 players — 1 bye\n resetLog();\n List\u003cPlayer\u003e p2 = Arrays.asList(\n new Player(\"X\", 3), new Player(\"Y\", 1), new Player(\"Z\", 2)\n );\n // bracketSize=4, byes=1. Y(seed1) gets bye.\n // Remaining: Z(2) vs X(3)\n List\u003cString\u003e adv2 = generateFirstRound(p2);\n assert adv2.size() == 2 : \"Expected 2: \" + adv2;\n assert adv2.get(0).equals(\"Y\") : \"Y gets bye, listed first: \" + adv2;\n assert adv2.get(1).equals(\"Z\") : \"Z(seed2) beats X(seed3): \" + adv2;\n assert bracketLog.get(0).equals(\"BYE:Y:SEED1\") : \"Bye log: \" + bracketLog.get(0);\n assert bracketLog.get(1).equals(\"MATCH:Z(SEED2)vsX(SEED3)\") : \"Match log: \" + bracketLog.get(1);\n\n // Hidden: 5 players — 3 byes\n resetLog();\n List\u003cPlayer\u003e p3 = Arrays.asList(\n new Player(\"A\", 5), new Player(\"B\", 1), new Player(\"C\", 3),\n new Player(\"D\", 2), new Player(\"E\", 4)\n );\n // bracketSize=8, byes=3. B(1), D(2), C(3) get byes.\n // Remaining: E(4) vs A(5)\n List\u003cString\u003e adv3 = generateFirstRound(p3);\n assert adv3.size() == 4 : \"Expected 4 advancing: \" + adv3;\n assert adv3.get(0).equals(\"B\") : \"First bye B: \" + adv3;\n assert adv3.get(1).equals(\"D\") : \"Second bye D: \" + adv3;\n assert adv3.get(2).equals(\"C\") : \"Third bye C: \" + adv3;\n assert adv3.get(3).equals(\"E\") : \"E(seed4) beats A(seed5): \" + adv3;\n\n // Hidden: power of 2 players — no byes\n resetLog();\n List\u003cPlayer\u003e p4 = Arrays.asList(\n new Player(\"P\", 2), new Player(\"Q\", 1)\n );\n List\u003cString\u003e adv4 = generateFirstRound(p4);\n assert adv4.size() == 1;\n assert adv4.get(0).equals(\"Q\") : \"Q(seed1) beats P(seed2)\";\n assert bracketLog.get(0).equals(\"MATCH:Q(SEED1)vsP(SEED2)\");\n\n // Hidden: 6 players — 2 byes, 2 matches\n resetLog();\n List\u003cPlayer\u003e p5 = Arrays.asList(\n new Player(\"F1\", 1), new Player(\"F2\", 6), new Player(\"F3\", 3),\n new Player(\"F4\", 4), new Player(\"F5\", 2), new Player(\"F6\", 5)\n );\n // bracketSize=8, byes=2. F1(1), F5(2) get byes.\n // Remaining sorted: F3(3), F4(4), F6(5), F2(6)\n // Pairs: F3 vs F2, F4 vs F6\n List\u003cString\u003e adv5 = generateFirstRound(p5);\n assert adv5.size() == 4 : \"Expected 4 advancing: \" + adv5;\n assert adv5.get(0).equals(\"F1\") : \"F1 bye first: \" + adv5;\n assert adv5.get(1).equals(\"F5\") : \"F5 bye second: \" + adv5;\n assert adv5.get(2).equals(\"F3\") : \"F3(seed3) beats F2(seed6): \" + adv5;\n assert adv5.get(3).equals(\"F4\") : \"F4(seed4) beats F6(seed5): \" + adv5;\n","category":"code_purpose_understanding"} {"id":"31","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask31 {\n static BigDecimal balance;\n static BigDecimal dailyLimit;\n static BigDecimal dailyTransferred;\n static boolean fraudLocked;\n static List\u003cString\u003e auditLog;\n static Set\u003cString\u003e processedTxIds;\n\n static void init() {\n balance = new BigDecimal(\"10000.00\");\n dailyLimit = new BigDecimal(\"5000.00\");\n dailyTransferred = BigDecimal.ZERO;\n fraudLocked = false;\n auditLog = new ArrayList\u003c\u003e();\n processedTxIds = new HashSet\u003c\u003e();\n }\n\n // Transfer money out of account. Rules:\n // 1. If txId already processed, return \"DUPLICATE\" and do NOT modify anything\n // 2. If fraudLocked is true, return \"FRAUD_HOLD\"\n // 3. If amount \u003c= 0, return \"INVALID_AMOUNT\"\n // 4. If amount \u003e balance, return \"INSUFFICIENT_FUNDS\"\n // 5. If dailyTransferred + amount \u003e dailyLimit, return \"DAILY_LIMIT_EXCEEDED\"\n // 6. Otherwise: deduct from balance, add to dailyTransferred, add txId to processedTxIds,\n // append to auditLog: \"TX:\u003ctxId\u003e:\u003camount\u003e\", return \"SUCCESS\"\n // 7. If amount \u003e 3000, set fraudLocked = true AFTER completing the transfer\n static String transfer(String txId, BigDecimal amount) {\n","golden_completion":" if (processedTxIds.contains(txId)) return \"DUPLICATE\";\n if (fraudLocked) return \"FRAUD_HOLD\";\n if (amount.compareTo(BigDecimal.ZERO) \u003c= 0) return \"INVALID_AMOUNT\";\n if (amount.compareTo(balance) \u003e 0) return \"INSUFFICIENT_FUNDS\";\n if (dailyTransferred.add(amount).compareTo(dailyLimit) \u003e 0) return \"DAILY_LIMIT_EXCEEDED\";\n balance = balance.subtract(amount);\n dailyTransferred = dailyTransferred.add(amount);\n processedTxIds.add(txId);\n auditLog.add(\"TX:\" + txId + \":\" + amount);\n if (amount.compareTo(new BigDecimal(\"3000\")) \u003e 0) fraudLocked = true;\n return \"SUCCESS\";\n","suffix":" }\n\n public static void main(String[] args) {\n init();\n String r1 = transfer(\"T1\", new BigDecimal(\"1000.00\"));\n assert r1.equals(\"SUCCESS\") : \"T1 should succeed, got \" + r1;\n assert balance.compareTo(new BigDecimal(\"9000.00\")) == 0 : \"Balance should be 9000\";\n assert auditLog.size() == 1 : \"Should have 1 audit entry\";\n assert auditLog.get(0).equals(\"TX:T1:1000.00\") : \"Audit format wrong\";\n }\n}\n","assertions":" // Idempotency\n init();\n transfer(\"TX1\", new BigDecimal(\"1000.00\"));\n BigDecimal balBefore = balance;\n int logBefore = auditLog.size();\n String dup = transfer(\"TX1\", new BigDecimal(\"500.00\"));\n assert dup.equals(\"DUPLICATE\") : \"Duplicate should return DUPLICATE, got \" + dup;\n assert balance.compareTo(balBefore) == 0 : \"Balance should not change on duplicate\";\n assert auditLog.size() == logBefore : \"Audit log should not grow on duplicate\";\n\n // Large transfer triggers fraud lock\n init();\n String r2 = transfer(\"TX2\", new BigDecimal(\"3500.00\"));\n assert r2.equals(\"SUCCESS\") : \"TX2 should succeed, got \" + r2;\n assert fraudLocked : \"Fraud should be locked after \u003e3000 transfer\";\n String r3 = transfer(\"TX3\", new BigDecimal(\"100.00\"));\n assert r3.equals(\"FRAUD_HOLD\") : \"TX3 should be fraud held, got \" + r3;\n\n // Invalid amount\n init();\n String r4 = transfer(\"TX4\", new BigDecimal(\"-50.00\"));\n assert r4.equals(\"INVALID_AMOUNT\") : \"Negative should be invalid\";\n\n // Insufficient funds\n String r5 = transfer(\"TX5\", new BigDecimal(\"99999.00\"));\n assert r5.equals(\"INSUFFICIENT_FUNDS\") : \"Should be insufficient\";\n\n // Daily limit (use amounts \u003c= 3000 to avoid fraud trigger)\n init();\n transfer(\"DL1\", new BigDecimal(\"3000.00\"));\n transfer(\"DL2\", new BigDecimal(\"1500.00\"));\n String r6 = transfer(\"DL3\", new BigDecimal(\"1000.00\"));\n assert r6.equals(\"DAILY_LIMIT_EXCEEDED\") : \"Should exceed daily limit, got \" + r6;\n","category":"code_purpose_understanding"} {"id":"32","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask32 {\n static BigDecimal principal;\n static BigDecimal interestRate;\n static int termMonths;\n static int currentMonth;\n static boolean redeemed;\n static List\u003cString\u003e auditLog;\n\n static void init(int month) {\n principal = new BigDecimal(\"10000.00\");\n interestRate = new BigDecimal(\"0.05\");\n termMonths = 12;\n currentMonth = month;\n redeemed = false;\n auditLog = new ArrayList\u003c\u003e();\n }\n\n // Withdraw from CD. Rules:\n // 1. If already redeemed, return BigDecimal.ZERO and log \"ALREADY_REDEEMED\"\n // 2. If currentMonth \u003e= termMonths (matured): return principal + full interest\n // (interest = principal * interestRate), log \"MATURED:\u003camount\u003e\", set redeemed=true\n // 3. If currentMonth \u003c termMonths (early withdrawal):\n // a. Earned interest = principal * interestRate * currentMonth / termMonths (scale 2, HALF_UP)\n // b. Penalty = 3 months of interest = principal * interestRate * 3 / 12 (scale 2, HALF_UP)\n // c. Net = principal + earnedInterest - penalty\n // d. If net \u003c principal (penalty exceeds earned interest), net = principal (no penalty into principal)\n // e. Log \"EARLY:\u003cnet\u003e:PENALTY:\u003cpenalty\u003e\", set redeemed=true, return net\n static BigDecimal withdraw() {\n","golden_completion":" if (redeemed) { auditLog.add(\"ALREADY_REDEEMED\"); return BigDecimal.ZERO; }\n if (currentMonth \u003e= termMonths) {\n BigDecimal total = principal.add(principal.multiply(interestRate)).setScale(2, RoundingMode.HALF_UP);\n auditLog.add(\"MATURED:\" + total);\n redeemed = true;\n return total;\n }\n BigDecimal earned = principal.multiply(interestRate).multiply(new BigDecimal(currentMonth))\n .divide(new BigDecimal(termMonths), 2, RoundingMode.HALF_UP);\n BigDecimal penalty = principal.multiply(interestRate).multiply(new BigDecimal(3))\n .divide(new BigDecimal(12), 2, RoundingMode.HALF_UP);\n BigDecimal net = principal.add(earned).subtract(penalty);\n if (net.compareTo(principal) \u003c 0) net = principal;\n auditLog.add(\"EARLY:\" + net + \":PENALTY:\" + penalty);\n redeemed = true;\n return net;\n","suffix":" }\n\n public static void main(String[] args) {\n init(6);\n BigDecimal result = withdraw();\n // At month 6 of 12: earned = 10000 * 0.05 * 6/12 = 250.00\n // Penalty = 10000 * 0.05 * 3/12 = 125.00\n // Net = 10000 + 250 - 125 = 10125.00\n assert result.compareTo(new BigDecimal(\"10125.00\")) == 0 : \"Expected 10125.00, got \" + result;\n assert redeemed : \"Should be redeemed\";\n assert auditLog.size() == 1 : \"Should have 1 audit entry\";\n }\n}\n","assertions":" // Already redeemed - idempotency\n init(6);\n withdraw(); // first withdraw\n BigDecimal again = withdraw();\n assert again.compareTo(BigDecimal.ZERO) == 0 : \"Second withdraw should return 0, got \" + again;\n assert auditLog.get(1).equals(\"ALREADY_REDEEMED\") : \"Should log ALREADY_REDEEMED\";\n\n // Test matured CD\n init(12);\n BigDecimal matured = withdraw();\n assert matured.compareTo(new BigDecimal(\"10500.00\")) == 0 : \"Matured should be 10500.00, got \" + matured;\n assert auditLog.get(0).equals(\"MATURED:10500.00\") : \"Should log MATURED:10500.00, got \" + auditLog.get(0);\n\n // Test early withdrawal where penalty \u003e earned (month 1)\n init(1);\n BigDecimal early = withdraw();\n // earned = 10000*0.05*1/12 = 41.67, penalty = 125.00\n // net = 10000 + 41.67 - 125.00 = 9916.67 \u003c 10000 =\u003e clamped to 10000\n assert early.compareTo(new BigDecimal(\"10000.00\")) == 0 : \"Should clamp to principal, got \" + early;\n","category":"code_purpose_understanding"} {"id":"33","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask33 {\n static BigDecimal basePlanGB;\n static BigDecimal rolloverGB;\n static BigDecimal rolloverCap;\n static BigDecimal throttleThreshold;\n static BigDecimal overageRatePerGB;\n static BigDecimal usedGB;\n static boolean throttled;\n static List\u003cString\u003e auditLog;\n static BigDecimal overageCharge;\n\n static void init(BigDecimal rollover) {\n basePlanGB = new BigDecimal(\"10.00\");\n rolloverGB = rollover;\n rolloverCap = new BigDecimal(\"5.00\");\n throttleThreshold = new BigDecimal(\"0.90\");\n overageRatePerGB = new BigDecimal(\"10.00\");\n usedGB = BigDecimal.ZERO;\n throttled = false;\n auditLog = new ArrayList\u003c\u003e();\n overageCharge = BigDecimal.ZERO;\n }\n\n // Record data usage. Rules:\n // 1. totalAllowance = basePlanGB + min(rolloverGB, rolloverCap)\n // 2. Add usageGB to usedGB\n // 3. If usedGB \u003e= totalAllowance * throttleThreshold AND not yet throttled:\n // set throttled=true, log \"THROTTLED_AT:\u003cusedGB\u003e\"\n // 4. If usedGB \u003e totalAllowance:\n // overage = usedGB - totalAllowance\n // overageCharge = overage * overageRatePerGB (scale 2, HALF_UP)\n // log \"OVERAGE:\u003coverage\u003eGB:$\u003coverageCharge\u003e\"\n // 5. Always log \"USAGE:\u003cusageGB\u003e:TOTAL:\u003cusedGB\u003e\"\n // 6. Return usedGB\n static BigDecimal recordUsage(BigDecimal usageGB) {\n","golden_completion":" BigDecimal effectiveRollover = rolloverGB.min(rolloverCap);\n BigDecimal totalAllowance = basePlanGB.add(effectiveRollover);\n usedGB = usedGB.add(usageGB);\n BigDecimal throttlePoint = totalAllowance.multiply(throttleThreshold).setScale(2, RoundingMode.HALF_UP);\n if (usedGB.compareTo(throttlePoint) \u003e= 0 \u0026\u0026 !throttled) {\n throttled = true;\n auditLog.add(\"THROTTLED_AT:\" + usedGB);\n }\n if (usedGB.compareTo(totalAllowance) \u003e 0) {\n BigDecimal overage = usedGB.subtract(totalAllowance).setScale(2, RoundingMode.HALF_UP);\n overageCharge = overage.multiply(overageRatePerGB).setScale(2, RoundingMode.HALF_UP);\n auditLog.add(\"OVERAGE:\" + overage + \"GB:$\" + overageCharge);\n }\n auditLog.add(\"USAGE:\" + usageGB + \":TOTAL:\" + usedGB);\n return usedGB;\n","suffix":" }\n\n public static void main(String[] args) {\n init(new BigDecimal(\"3.00\"));\n // totalAllowance = 10 + min(3, 5) = 13 GB\n // throttle at 13 * 0.90 = 11.70\n BigDecimal r1 = recordUsage(new BigDecimal(\"5.00\"));\n assert r1.compareTo(new BigDecimal(\"5.00\")) == 0 : \"Used should be 5, got \" + r1;\n assert !throttled : \"Should not be throttled yet\";\n\n BigDecimal r2 = recordUsage(new BigDecimal(\"7.00\"));\n assert r2.compareTo(new BigDecimal(\"12.00\")) == 0 : \"Used should be 12, got \" + r2;\n assert throttled : \"Should be throttled at 12 \u003e= 11.70\";\n assert auditLog.stream().anyMatch(s -\u003e s.startsWith(\"THROTTLED_AT:\")) : \"Should have throttle log\";\n }\n}\n","assertions":" // Overage test\n init(new BigDecimal(\"3.00\"));\n recordUsage(new BigDecimal(\"5.00\"));\n recordUsage(new BigDecimal(\"7.00\"));\n BigDecimal r3 = recordUsage(new BigDecimal(\"3.00\"));\n assert r3.compareTo(new BigDecimal(\"15.00\")) == 0 : \"Used should be 15, got \" + r3;\n assert overageCharge.compareTo(new BigDecimal(\"20.00\")) == 0 : \"Overage charge should be 20.00, got \" + overageCharge;\n\n // Throttle should NOT re-trigger\n long throttleCount = auditLog.stream().filter(s -\u003e s.startsWith(\"THROTTLED_AT:\")).count();\n assert throttleCount == 1 : \"Should only throttle once, got \" + throttleCount;\n\n // Rollover exceeding cap\n init(new BigDecimal(\"8.00\"));\n // totalAllowance = 10 + min(8,5) = 15, throttle at 13.50\n BigDecimal r4 = recordUsage(new BigDecimal(\"14.00\"));\n assert r4.compareTo(new BigDecimal(\"14.00\")) == 0;\n assert throttled : \"Should be throttled at 14 \u003e= 13.50\";\n assert overageCharge.compareTo(BigDecimal.ZERO) == 0 : \"No overage yet\";\n","category":"code_purpose_understanding"} {"id":"34","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask34 {\n enum SimState { NEW, PORT_REQUESTED, PORT_VERIFIED, ACTIVE, SUSPENDED }\n static SimState state;\n static String phoneNumber;\n static String carrier;\n static BigDecimal activationFee = new BigDecimal(\"25.00\");\n static BigDecimal balance;\n static List\u003cString\u003e auditLog;\n static int lastActionTime;\n static int cooldownPeriod = 30;\n\n static void init() {\n state = SimState.NEW;\n phoneNumber = null;\n carrier = null;\n balance = BigDecimal.ZERO;\n auditLog = new ArrayList\u003c\u003e();\n lastActionTime = 0;\n }\n\n // Process SIM action. Rules:\n // 1. If timestamp - lastActionTime \u003c cooldownPeriod AND state != NEW, return \"COOLDOWN\"\n // 2. action=\"PORT_REQUEST\": only from NEW. Set state=PORT_REQUESTED, store number/carrier, log \"PORT_REQ:\u003cnumber\u003e:\u003ccarrier\u003e\"\n // 3. action=\"PORT_VERIFY\": only from PORT_REQUESTED. Set state=PORT_VERIFIED, log \"PORT_VERIFIED:\u003cnumber\u003e\"\n // 4. action=\"ACTIVATE\": from PORT_VERIFIED or NEW.\n // - Charge activationFee: balance = balance.subtract(activationFee)\n // - Set state=ACTIVE, log \"ACTIVATED:FEE:\u003cactivationFee\u003e\"\n // 5. action=\"SUSPEND\": only from ACTIVE. Set state=SUSPENDED, log \"SUSPENDED\"\n // 6. Any invalid transition: return \"INVALID_TRANSITION\"\n // 7. On success: update lastActionTime, return \"OK\"\n static String processAction(String action, int timestamp, String number, String fromCarrier) {\n","golden_completion":" if (state != SimState.NEW \u0026\u0026 timestamp - lastActionTime \u003c cooldownPeriod) return \"COOLDOWN\";\n if (action.equals(\"PORT_REQUEST\")) {\n if (state != SimState.NEW) return \"INVALID_TRANSITION\";\n state = SimState.PORT_REQUESTED; phoneNumber = number; carrier = fromCarrier;\n auditLog.add(\"PORT_REQ:\" + number + \":\" + fromCarrier);\n } else if (action.equals(\"PORT_VERIFY\")) {\n if (state != SimState.PORT_REQUESTED) return \"INVALID_TRANSITION\";\n state = SimState.PORT_VERIFIED; auditLog.add(\"PORT_VERIFIED:\" + phoneNumber);\n } else if (action.equals(\"ACTIVATE\")) {\n if (state != SimState.PORT_VERIFIED \u0026\u0026 state != SimState.NEW) return \"INVALID_TRANSITION\";\n balance = balance.subtract(activationFee); state = SimState.ACTIVE;\n auditLog.add(\"ACTIVATED:FEE:\" + activationFee);\n } else if (action.equals(\"SUSPEND\")) {\n if (state != SimState.ACTIVE) return \"INVALID_TRANSITION\";\n state = SimState.SUSPENDED; auditLog.add(\"SUSPENDED\");\n } else { return \"INVALID_TRANSITION\"; }\n lastActionTime = timestamp;\n return \"OK\";\n","suffix":" }\n\n public static void main(String[] args) {\n init();\n String r1 = processAction(\"PORT_REQUEST\", 0, \"5551234567\", \"OldCarrier\");\n assert r1.equals(\"OK\") : \"Port request should succeed, got \" + r1;\n assert state == SimState.PORT_REQUESTED;\n\n String r2 = processAction(\"PORT_VERIFY\", 100, null, null);\n assert r2.equals(\"OK\") : \"Port verify should succeed, got \" + r2;\n assert state == SimState.PORT_VERIFIED;\n\n String r3 = processAction(\"ACTIVATE\", 200, null, null);\n assert r3.equals(\"OK\") : \"Activate should succeed, got \" + r3;\n assert state == SimState.ACTIVE;\n assert balance.compareTo(new BigDecimal(\"-25.00\")) == 0 : \"Balance should be -25.00\";\n }\n}\n","assertions":" // Cooldown test\n init();\n processAction(\"PORT_REQUEST\", 0, \"5551111111\", \"CarrierA\");\n processAction(\"PORT_VERIFY\", 100, null, null);\n processAction(\"ACTIVATE\", 200, null, null);\n String r4 = processAction(\"SUSPEND\", 210, null, null);\n assert r4.equals(\"COOLDOWN\") : \"Should be in cooldown, got \" + r4;\n assert state == SimState.ACTIVE : \"State should still be ACTIVE\";\n\n String r5 = processAction(\"SUSPEND\", 250, null, null);\n assert r5.equals(\"OK\") : \"Suspend should succeed after cooldown, got \" + r5;\n assert state == SimState.SUSPENDED;\n\n // Invalid: can\u0027t activate from suspended\n String r6 = processAction(\"ACTIVATE\", 300, null, null);\n assert r6.equals(\"INVALID_TRANSITION\") : \"Can\u0027t activate from suspended, got \" + r6;\n\n // Direct activation from NEW (no porting)\n init();\n String r7 = processAction(\"ACTIVATE\", 100, null, null);\n assert r7.equals(\"OK\") : \"Direct activate from NEW should work, got \" + r7;\n assert state == SimState.ACTIVE;\n assert balance.compareTo(new BigDecimal(\"-25.00\")) == 0;\n\n // Cooldown doesn\u0027t apply to NEW state\n init();\n lastActionTime = 95;\n String r8 = processAction(\"PORT_REQUEST\", 100, \"5559999999\", \"Carrier2\");\n assert r8.equals(\"OK\") : \"Cooldown should not apply to NEW, got \" + r8;\n","category":"code_purpose_understanding"} {"id":"35","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask35 {\n static BigDecimal hourlyRate;\n static BigDecimal clientCap;\n static BigDecimal totalBilled;\n static BigDecimal totalWrittenOff;\n static BigDecimal writeOffLimit;\n static List\u003cString\u003e auditLog;\n static Set\u003cString\u003e processedEntries;\n static BigDecimal totalHours;\n\n static void init() {\n hourlyRate = new BigDecimal(\"350.00\");\n clientCap = new BigDecimal(\"50000.00\");\n totalBilled = BigDecimal.ZERO;\n totalWrittenOff = BigDecimal.ZERO;\n writeOffLimit = new BigDecimal(\"5000.00\");\n auditLog = new ArrayList\u003c\u003e();\n processedEntries = new HashSet\u003c\u003e();\n totalHours = BigDecimal.ZERO;\n }\n\n // Record billable hours. Rules:\n // 1. If entryId already processed, return \"DUPLICATE\" (no side effects)\n // 2. billableAmount = hours * hourlyRate (scale 2, HALF_UP)\n // 3. If writeOff is true:\n // a. If totalWrittenOff + billableAmount \u003e writeOffLimit, return \"WRITEOFF_LIMIT\"\n // b. Add to totalWrittenOff, log \"WRITEOFF:\u003centryId\u003e:\u003cbillableAmount\u003e\", add entryId, add hours, return \"WRITTEN_OFF\"\n // 4. If totalBilled + billableAmount \u003e clientCap:\n // a. capRemaining = clientCap - totalBilled\n // b. excess = billableAmount - capRemaining\n // c. Bill capRemaining, auto-writeoff excess (but check writeoff limit for the excess)\n // d. If totalWrittenOff + excess \u003e writeOffLimit: only writeoff up to limit, lose the rest\n // e. Log \"PARTIAL:\u003centryId\u003e:BILLED:\u003ccapRemaining\u003e:WRITEOFF:\u003cactualWriteoff\u003e:LOST:\u003clost\u003e\"\n // f. Update totals, add entryId, add hours, return \"PARTIAL\"\n // 5. Normal: add to totalBilled, log \"BILLED:\u003centryId\u003e:\u003cbillableAmount\u003e\", add entryId, add hours, return \"BILLED\"\n static String recordHours(String entryId, BigDecimal hours, boolean writeOff) {\n","golden_completion":" if (processedEntries.contains(entryId)) return \"DUPLICATE\";\n BigDecimal amt = hours.multiply(hourlyRate).setScale(2, RoundingMode.HALF_UP);\n String result;\n if (writeOff) {\n if (totalWrittenOff.add(amt).compareTo(writeOffLimit) \u003e 0) return \"WRITEOFF_LIMIT\";\n totalWrittenOff = totalWrittenOff.add(amt);\n auditLog.add(\"WRITEOFF:\" + entryId + \":\" + amt); result = \"WRITTEN_OFF\";\n } else if (totalBilled.add(amt).compareTo(clientCap) \u003e 0) {\n BigDecimal rem = clientCap.subtract(totalBilled), excess = amt.subtract(rem);\n BigDecimal woRoom = writeOffLimit.subtract(totalWrittenOff);\n BigDecimal wo = excess.min(woRoom), lost = excess.subtract(wo);\n totalBilled = totalBilled.add(rem); totalWrittenOff = totalWrittenOff.add(wo);\n auditLog.add(\"PARTIAL:\" + entryId + \":BILLED:\" + rem + \":WRITEOFF:\" + wo + \":LOST:\" + lost);\n result = \"PARTIAL\";\n } else {\n totalBilled = totalBilled.add(amt);\n auditLog.add(\"BILLED:\" + entryId + \":\" + amt); result = \"BILLED\";\n }\n processedEntries.add(entryId); totalHours = totalHours.add(hours);\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n init();\n // Normal billing: 10 hours * 350 = 3500\n String r1 = recordHours(\"E1\", new BigDecimal(\"10\"), false);\n assert r1.equals(\"BILLED\") : \"E1 should be billed, got \" + r1;\n assert totalBilled.compareTo(new BigDecimal(\"3500.00\")) == 0 : \"Total billed should be 3500\";\n assert totalHours.compareTo(new BigDecimal(\"10\")) == 0;\n\n // Write-off: 5 hours * 350 = 1750\n String r2 = recordHours(\"E2\", new BigDecimal(\"5\"), true);\n assert r2.equals(\"WRITTEN_OFF\") : \"E2 should be written off, got \" + r2;\n assert totalWrittenOff.compareTo(new BigDecimal(\"1750.00\")) == 0;\n }\n}\n","assertions":" // Duplicate entry\n init();\n recordHours(\"E1\", new BigDecimal(\"10\"), false);\n String dup = recordHours(\"E1\", new BigDecimal(\"10\"), false);\n assert dup.equals(\"DUPLICATE\") : \"E1 should be duplicate, got \" + dup;\n\n // Partial billing at cap with auto-writeoff\n init();\n recordHours(\"A1\", new BigDecimal(\"140\"), false); // 49000\n recordHours(\"A2\", new BigDecimal(\"5\"), true); // writeoff 1750\n\n // Bill 10h*350=3500, cap remaining=1000, excess=2500, woRoom=3250, actualWo=2500, lost=0\n String r4 = recordHours(\"A3\", new BigDecimal(\"10\"), false);\n assert r4.equals(\"PARTIAL\") : \"A3 should be partial, got \" + r4;\n assert totalBilled.compareTo(new BigDecimal(\"50000.00\")) == 0 : \"Should hit cap\";\n assert totalWrittenOff.compareTo(new BigDecimal(\"4250.00\")) == 0 : \"Writeoff should be 1750+2500=4250\";\n\n // Writeoff limit test: only 750 room left\n String r5 = recordHours(\"A4\", new BigDecimal(\"5\"), true);\n assert r5.equals(\"WRITEOFF_LIMIT\") : \"Should exceed writeoff limit, got \" + r5;\n","category":"code_purpose_understanding"} {"id":"36","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.util.*;\n\npublic class CPTask36 {\n static int version;\n static String status;\n static List\u003cString\u003e approvers;\n static int requiredApprovals;\n static List\u003cString\u003e auditLog;\n static String content;\n\n static void init() {\n version = 1; status = \"DRAFT\"; approvers = new ArrayList\u003c\u003e();\n requiredApprovals = 2; auditLog = new ArrayList\u003c\u003e(); content = \"Initial draft\";\n }\n\n // Submit action on document. Rules:\n // 1. action=\"EDIT\": only in DRAFT. Update content, increment version, log \"EDIT:v\u003cversion\u003e\"\n // 2. action=\"SUBMIT\": only in DRAFT. Set status=REVIEW, log \"SUBMITTED:v\u003cversion\u003e\"\n // 3. action=\"APPROVE\": only in REVIEW. Add approver to list (no duplicates).\n // If approvers.size() \u003e= requiredApprovals, set status=APPROVED.\n // Log \"APPROVE:\u003capprover\u003e:\u003ccount\u003e/\u003crequired\u003e\"\n // 4. action=\"FINALIZE\": only in APPROVED. Set status=FINAL, log \"FINALIZED:v\u003cversion\u003e\"\n // 5. action=\"REJECT\": only in REVIEW. Clear approvers, set status=DRAFT, log \"REJECTED:\u003capprover\u003e\"\n // 6. Invalid transitions return \"INVALID\"\n // 7. Success returns \"OK\"\n static String processAction(String action, String approver, String newContent) {\n","golden_completion":" if (action.equals(\"EDIT\")) {\n if (!status.equals(\"DRAFT\")) return \"INVALID\";\n content = newContent; version++;\n auditLog.add(\"EDIT:v\" + version);\n } else if (action.equals(\"SUBMIT\")) {\n if (!status.equals(\"DRAFT\")) return \"INVALID\";\n status = \"REVIEW\"; auditLog.add(\"SUBMITTED:v\" + version);\n } else if (action.equals(\"APPROVE\")) {\n if (!status.equals(\"REVIEW\")) return \"INVALID\";\n if (!approvers.contains(approver)) approvers.add(approver);\n if (approvers.size() \u003e= requiredApprovals) status = \"APPROVED\";\n auditLog.add(\"APPROVE:\" + approver + \":\" + approvers.size() + \"/\" + requiredApprovals);\n } else if (action.equals(\"FINALIZE\")) {\n if (!status.equals(\"APPROVED\")) return \"INVALID\";\n status = \"FINAL\"; auditLog.add(\"FINALIZED:v\" + version);\n } else if (action.equals(\"REJECT\")) {\n if (!status.equals(\"REVIEW\")) return \"INVALID\";\n approvers.clear(); status = \"DRAFT\"; auditLog.add(\"REJECTED:\" + approver);\n } else { return \"INVALID\"; }\n return \"OK\";\n","suffix":" }\n\n public static void main(String[] args) {\n init();\n String r1 = processAction(\"EDIT\", null, \"Updated draft\");\n assert r1.equals(\"OK\") : \"Edit should work in DRAFT\";\n assert version == 2 : \"Version should be 2\";\n assert content.equals(\"Updated draft\");\n\n String r2 = processAction(\"SUBMIT\", null, null);\n assert r2.equals(\"OK\") : \"Submit should work\";\n assert status.equals(\"REVIEW\");\n\n String r3 = processAction(\"APPROVE\", \"Alice\", null);\n assert r3.equals(\"OK\") : \"Approve should work\";\n assert status.equals(\"REVIEW\") : \"Still in review (need 2 approvals)\";\n }\n}\n","assertions":" // Duplicate approver test\n init();\n processAction(\"SUBMIT\", null, null);\n processAction(\"APPROVE\", \"Alice\", null);\n processAction(\"APPROVE\", \"Alice\", null); // duplicate\n assert approvers.size() == 1 : \"Duplicate approver should not increase count, got \" + approvers.size();\n assert status.equals(\"REVIEW\") : \"Still in review\";\n\n // Second unique approver triggers APPROVED\n processAction(\"APPROVE\", \"Bob\", null);\n assert status.equals(\"APPROVED\") : \"Should be approved with 2 approvers\";\n\n // Can\u0027t edit when approved\n String r6 = processAction(\"EDIT\", null, \"Sneaky edit\");\n assert r6.equals(\"INVALID\") : \"Can\u0027t edit when approved\";\n\n // Finalize\n processAction(\"FINALIZE\", null, null);\n assert status.equals(\"FINAL\");\n\n // Test reject flow\n init();\n processAction(\"SUBMIT\", null, null);\n processAction(\"APPROVE\", \"Carol\", null);\n String rej = processAction(\"REJECT\", \"Dave\", null);\n assert rej.equals(\"OK\") : \"Reject should work, got \" + rej;\n assert status.equals(\"DRAFT\") : \"Should be back to DRAFT\";\n assert approvers.isEmpty() : \"Approvers should be cleared on reject\";\n","category":"code_purpose_understanding"} {"id":"37","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask37 {\n static BigDecimal lastActualReading;\n static BigDecimal lastBilledReading;\n static BigDecimal estimatedUsage;\n static BigDecimal totalBilled;\n static BigDecimal tier1Limit = new BigDecimal(\"500\");\n static BigDecimal tier1Rate = new BigDecimal(\"0.10\");\n static BigDecimal tier2Rate = new BigDecimal(\"0.15\");\n static List\u003cString\u003e auditLog;\n static int estimateCount;\n static int maxConsecutiveEstimates = 2;\n\n static void init() {\n lastActualReading = BigDecimal.ZERO;\n lastBilledReading = BigDecimal.ZERO;\n estimatedUsage = BigDecimal.ZERO;\n totalBilled = BigDecimal.ZERO;\n auditLog = new ArrayList\u003c\u003e();\n estimateCount = 0;\n }\n\n static BigDecimal calculateBill(BigDecimal usage) {\n if (usage.compareTo(tier1Limit) \u003c= 0) {\n return usage.multiply(tier1Rate).setScale(2, RoundingMode.HALF_UP);\n }\n BigDecimal tier1 = tier1Limit.multiply(tier1Rate);\n BigDecimal tier2 = usage.subtract(tier1Limit).multiply(tier2Rate);\n return tier1.add(tier2).setScale(2, RoundingMode.HALF_UP);\n }\n\n // Record meter reading. Rules:\n // 1. If estimated=true:\n // a. If estimateCount \u003e= maxConsecutiveEstimates, return BigDecimal with value -1\n // b. usage = reading - lastBilledReading\n // c. estimatedUsage += usage, estimateCount++\n // d. Bill the usage, add to totalBilled\n // e. Update lastBilledReading = reading\n // f. Log \"EST:\u003creading\u003e:USAGE:\u003cusage\u003e:BILL:\u003cbill\u003e\"\n // 2. If estimated=false (actual reading):\n // a. actualUsage = reading - lastActualReading\n // b. If estimatedUsage \u003e 0: adjustment = actualUsage - estimatedUsage\n // bill the adjustment (negative = credit), add to totalBilled\n // log \"ADJUST:\u003cadjustment\u003e:BILL:\u003cadjustBill\u003e\", reset estimatedUsage=0\n // c. If estimatedUsage was 0: bill actualUsage normally\n // d. Update lastActualReading = reading, lastBilledReading = reading, estimateCount = 0\n // e. Log \"ACTUAL:\u003creading\u003e:USAGE:\u003cactualUsage\u003e\"\n // 3. Return totalBilled\n static BigDecimal recordReading(BigDecimal reading, boolean estimated) {\n","golden_completion":" if (estimated) {\n if (estimateCount \u003e= maxConsecutiveEstimates) return new BigDecimal(\"-1\");\n BigDecimal usage = reading.subtract(lastBilledReading);\n estimatedUsage = estimatedUsage.add(usage); estimateCount++;\n BigDecimal bill = calculateBill(usage); totalBilled = totalBilled.add(bill);\n lastBilledReading = reading;\n auditLog.add(\"EST:\" + reading + \":USAGE:\" + usage + \":BILL:\" + bill);\n return totalBilled;\n }\n BigDecimal actualUsage = reading.subtract(lastActualReading);\n if (estimatedUsage.compareTo(BigDecimal.ZERO) \u003e 0) {\n BigDecimal adj = actualUsage.subtract(estimatedUsage);\n BigDecimal adjBill = calculateBill(adj.abs());\n if (adj.compareTo(BigDecimal.ZERO) \u003c 0) adjBill = adjBill.negate();\n totalBilled = totalBilled.add(adjBill);\n auditLog.add(\"ADJUST:\" + adj + \":BILL:\" + adjBill);\n estimatedUsage = BigDecimal.ZERO;\n } else { totalBilled = totalBilled.add(calculateBill(actualUsage)); }\n lastActualReading = reading; lastBilledReading = reading; estimateCount = 0;\n auditLog.add(\"ACTUAL:\" + reading + \":USAGE:\" + actualUsage);\n return totalBilled;\n","suffix":" }\n\n public static void main(String[] args) {\n init();\n // First estimated read: 400 kWh, tier 1: 400 * 0.10 = 40.00\n BigDecimal r1 = recordReading(new BigDecimal(\"400\"), true);\n assert r1.compareTo(new BigDecimal(\"40.00\")) == 0 : \"First bill should be 40.00, got \" + r1;\n assert estimateCount == 1;\n\n // Second estimated read: 300 more kWh: 300 * 0.10 = 30.00\n BigDecimal r2 = recordReading(new BigDecimal(\"700\"), true);\n assert r2.compareTo(new BigDecimal(\"70.00\")) == 0 : \"Total should be 70.00, got \" + r2;\n assert estimateCount == 2;\n }\n}\n","assertions":" // Estimate limit + reconciliation\n init();\n recordReading(new BigDecimal(\"400\"), true); // est 400, bill 40\n recordReading(new BigDecimal(\"700\"), true); // est 300, bill 30, total 70\n BigDecimal r3 = recordReading(new BigDecimal(\"900\"), true);\n assert r3.compareTo(new BigDecimal(\"-1\")) == 0 : \"Should hit estimate limit, got \" + r3;\n\n // Actual reading: real usage was 600 (not 700 estimated)\n // actualUsage = 600 - 0 = 600, estimatedUsage = 700\n // adjustment = 600 - 700 = -100, adjustBill = -10.00\n // totalBilled = 70 + (-10) = 60\n BigDecimal r4 = recordReading(new BigDecimal(\"600\"), false);\n assert r4.compareTo(new BigDecimal(\"60.00\")) == 0 : \"After adjustment should be 60.00, got \" + r4;\n assert estimateCount == 0 : \"Estimate count should reset\";\n assert estimatedUsage.compareTo(BigDecimal.ZERO) == 0 : \"Estimated usage should reset\";\n\n // Fresh actual read: 200 more kWh, bill = 20.00, total = 80\n BigDecimal r5 = recordReading(new BigDecimal(\"800\"), false);\n assert r5.compareTo(new BigDecimal(\"80.00\")) == 0 : \"Should be 80.00, got \" + r5;\n","category":"code_purpose_understanding"} {"id":"38","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask38 {\n static BigDecimal gridRate = new BigDecimal(\"0.12\");\n static BigDecimal solarCreditRate = new BigDecimal(\"0.08\");\n static BigDecimal creditBalance;\n static BigDecimal maxMonthlyCredit = new BigDecimal(\"50.00\");\n static BigDecimal totalPaid;\n static List\u003cString\u003e auditLog;\n\n static void init() {\n creditBalance = BigDecimal.ZERO;\n totalPaid = BigDecimal.ZERO;\n auditLog = new ArrayList\u003c\u003e();\n }\n\n // Process monthly billing. Rules:\n // 1. gridCost = consumedKWh * gridRate (scale 2, HALF_UP)\n // 2. solarCredit = exportedKWh * solarCreditRate (scale 2, HALF_UP)\n // 3. Cap solarCredit at maxMonthlyCredit: effectiveCredit = min(solarCredit, maxMonthlyCredit)\n // 4. Excess credit (solarCredit - effectiveCredit) rolls into creditBalance\n // 5. availableCredit = effectiveCredit + creditBalance\n // 6. If availableCredit \u003e= gridCost:\n // - payment = 0, creditBalance = availableCredit - gridCost\n // - Log \"CREDIT_COVERED:REMAINING:\u003ccreditBalance\u003e\"\n // 7. If availableCredit \u003c gridCost:\n // - payment = gridCost - availableCredit, creditBalance = 0\n // - totalPaid += payment, Log \"BILLED:\u003cpayment\u003e\"\n // 8. Return payment amount for this month\n static BigDecimal processBilling(BigDecimal consumedKWh, BigDecimal exportedKWh) {\n","golden_completion":" BigDecimal gridCost = consumedKWh.multiply(gridRate).setScale(2, RoundingMode.HALF_UP);\n BigDecimal solarCredit = exportedKWh.multiply(solarCreditRate).setScale(2, RoundingMode.HALF_UP);\n BigDecimal effectiveCredit = solarCredit.min(maxMonthlyCredit);\n BigDecimal excess = solarCredit.subtract(effectiveCredit);\n creditBalance = creditBalance.add(excess);\n BigDecimal availableCredit = effectiveCredit.add(creditBalance);\n if (availableCredit.compareTo(gridCost) \u003e= 0) {\n creditBalance = availableCredit.subtract(gridCost);\n auditLog.add(\"CREDIT_COVERED:REMAINING:\" + creditBalance);\n return BigDecimal.ZERO;\n }\n BigDecimal payment = gridCost.subtract(availableCredit);\n creditBalance = BigDecimal.ZERO;\n totalPaid = totalPaid.add(payment);\n auditLog.add(\"BILLED:\" + payment);\n return payment;\n","suffix":" }\n\n public static void main(String[] args) {\n init();\n // Month 1: consumed 500 kWh ($60), exported 800 kWh ($64)\n // effectiveCredit = min(64, 50) = 50, excess = 14, creditBalance = 14\n // availableCredit = 50 + 14 = 64 \u003e= 60, payment = 0\n // creditBalance = 64 - 60 = 4\n BigDecimal r1 = processBilling(new BigDecimal(\"500\"), new BigDecimal(\"800\"));\n assert r1.compareTo(BigDecimal.ZERO) == 0 : \"Month 1 should be fully covered, got \" + r1;\n assert creditBalance.compareTo(new BigDecimal(\"4.00\")) == 0 : \"Credit balance should be 4.00, got \" + creditBalance;\n }\n}\n","assertions":" // Multi-month test\n init();\n // Month 1: consumed 500 ($60), exported 800 ($64)\n processBilling(new BigDecimal(\"500\"), new BigDecimal(\"800\"));\n assert creditBalance.compareTo(new BigDecimal(\"4.00\")) == 0;\n\n // Month 2: consumed 1000 ($120), exported 200 ($16)\n // effective=min(16,50)=16, excess=0, creditBal=4+0=4\n // available=16+4=20 \u003c 120, payment=100\n BigDecimal r2 = processBilling(new BigDecimal(\"1000\"), new BigDecimal(\"200\"));\n assert r2.compareTo(new BigDecimal(\"100.00\")) == 0 : \"Month 2 should be 100.00, got \" + r2;\n assert creditBalance.compareTo(BigDecimal.ZERO) == 0 : \"Credit balance should be 0\";\n assert totalPaid.compareTo(new BigDecimal(\"100.00\")) == 0;\n\n // Month 3: consumed 0, exported 1000 ($80)\n // effective=min(80,50)=50, excess=30, creditBal=0+30=30\n // available=50+30=80 \u003e= 0, payment=0, creditBal=80-0=80\n BigDecimal r3 = processBilling(BigDecimal.ZERO, new BigDecimal(\"1000\"));\n assert r3.compareTo(BigDecimal.ZERO) == 0 : \"No consumption, no bill\";\n assert creditBalance.compareTo(new BigDecimal(\"80.00\")) == 0 : \"Credit should be 80.00, got \" + creditBalance;\n","category":"code_purpose_understanding"} {"id":"39","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask39 {\n static Map\u003cString, BigDecimal\u003e baseRecipe = new LinkedHashMap\u003c\u003e();\n static Map\u003cString, String\u003e substitutions = new HashMap\u003c\u003e();\n static Map\u003cString, BigDecimal\u003e substitutionRatios = new HashMap\u003c\u003e();\n static BigDecimal minAmount = new BigDecimal(\"0.25\");\n static int baseServings = 4;\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n static {\n baseRecipe.put(\"flour\", new BigDecimal(\"2.00\"));\n baseRecipe.put(\"sugar\", new BigDecimal(\"1.00\"));\n baseRecipe.put(\"butter\", new BigDecimal(\"0.50\"));\n baseRecipe.put(\"eggs\", new BigDecimal(\"3.00\"));\n baseRecipe.put(\"milk\", new BigDecimal(\"1.00\"));\n substitutions.put(\"butter\", \"oil\");\n substitutionRatios.put(\"oil\", new BigDecimal(\"0.75\"));\n substitutions.put(\"milk\", \"oat_milk\");\n substitutionRatios.put(\"oat_milk\", new BigDecimal(\"1.00\"));\n }\n\n // Scale recipe to targetServings with substitutions applied. Rules:\n // 1. scaleFactor = targetServings / baseServings (use BigDecimal division, scale 4, HALF_UP)\n // 2. For each ingredient in baseRecipe:\n // a. scaledAmount = baseAmount * scaleFactor (scale 2, HALF_UP)\n // b. If ingredient has a substitution, apply ratio: finalAmount = scaledAmount * ratio (scale 2, HALF_UP)\n // Use the substitute name as the key\n // c. If finalAmount \u003c minAmount, set to minAmount\n // d. Log \"SCALE:\u003cingredientOrSubstitute\u003e:\u003cfinalAmount\u003e\"\n // 3. Return the final recipe as LinkedHashMap (preserving insertion order)\n static Map\u003cString, BigDecimal\u003e scaleRecipe(int targetServings) {\n","golden_completion":" Map\u003cString, BigDecimal\u003e result = new LinkedHashMap\u003c\u003e();\n BigDecimal scaleFactor = new BigDecimal(targetServings)\n .divide(new BigDecimal(baseServings), 4, RoundingMode.HALF_UP);\n for (Map.Entry\u003cString, BigDecimal\u003e entry : baseRecipe.entrySet()) {\n String ingredient = entry.getKey();\n BigDecimal scaledAmount = entry.getValue().multiply(scaleFactor).setScale(2, RoundingMode.HALF_UP);\n String finalName = ingredient;\n BigDecimal finalAmount = scaledAmount;\n if (substitutions.containsKey(ingredient)) {\n finalName = substitutions.get(ingredient);\n finalAmount = scaledAmount.multiply(substitutionRatios.get(finalName)).setScale(2, RoundingMode.HALF_UP);\n }\n if (finalAmount.compareTo(minAmount) \u003c 0) finalAmount = minAmount;\n result.put(finalName, finalAmount);\n auditLog.add(\"SCALE:\" + finalName + \":\" + finalAmount);\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n auditLog.clear();\n Map\u003cString, BigDecimal\u003e recipe = scaleRecipe(8);\n // scaleFactor = 8/4 = 2.0\n // flour: 2*2 = 4.00, sugar: 1*2 = 2.00, butter-\u003eoil: 0.5*2*0.75 = 0.75\n // eggs: 3*2 = 6.00, milk-\u003eoat_milk: 1*2*1.0 = 2.00\n assert recipe.get(\"flour\").compareTo(new BigDecimal(\"4.00\")) == 0 : \"Flour should be 4.00\";\n assert recipe.get(\"oil\").compareTo(new BigDecimal(\"0.75\")) == 0 : \"Oil should be 0.75\";\n assert recipe.get(\"oat_milk\").compareTo(new BigDecimal(\"2.00\")) == 0 : \"Oat milk should be 2.00\";\n assert !recipe.containsKey(\"butter\") : \"Butter should be substituted\";\n assert !recipe.containsKey(\"milk\") : \"Milk should be substituted\";\n }\n}\n","assertions":" // Scale down to 1 serving — test minimum amount clamping\n auditLog.clear();\n Map\u003cString, BigDecimal\u003e small = scaleRecipe(1);\n // scaleFactor = 0.2500\n // flour: 0.50, sugar: 0.25, butter-\u003eoil: 0.5*0.25*0.75=0.09 -\u003e 0.25\n // eggs: 0.75, milk-\u003eoat_milk: 0.25\n assert small.get(\"flour\").compareTo(new BigDecimal(\"0.50\")) == 0 : \"Flour should be 0.50, got \" + small.get(\"flour\");\n assert small.get(\"sugar\").compareTo(new BigDecimal(\"0.25\")) == 0 : \"Sugar should be 0.25\";\n assert small.get(\"oil\").compareTo(new BigDecimal(\"0.25\")) == 0 : \"Oil should be clamped to min, got \" + small.get(\"oil\");\n assert small.get(\"eggs\").compareTo(new BigDecimal(\"0.75\")) == 0 : \"Eggs should be 0.75\";\n assert auditLog.size() == 5 : \"Should have 5 audit entries, got \" + auditLog.size();\n\n // Scale to 6 servings (non-integer factor)\n auditLog.clear();\n Map\u003cString, BigDecimal\u003e medium = scaleRecipe(6);\n // scaleFactor = 1.5000, butter-\u003eoil: 0.5*1.5*0.75=0.5625 -\u003e 0.56\n assert medium.get(\"flour\").compareTo(new BigDecimal(\"3.00\")) == 0;\n assert medium.get(\"oil\").compareTo(new BigDecimal(\"0.56\")) == 0 : \"Oil should be 0.56, got \" + medium.get(\"oil\");\n","category":"code_purpose_understanding"} {"id":"40","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask40 {\n static BigDecimal dangerZoneLow = new BigDecimal(\"40\");\n static BigDecimal dangerZoneHigh = new BigDecimal(\"140\");\n static int maxDangerMinutes = 120;\n static int consecutiveViolationLimit = 3;\n static int totalDangerMinutes;\n static int consecutiveViolations;\n static String foodStatus;\n static List\u003cString\u003e auditLog;\n static List\u003cBigDecimal\u003e tempHistory;\n\n static void init() {\n totalDangerMinutes = 0;\n consecutiveViolations = 0;\n foodStatus = \"SAFE\";\n auditLog = new ArrayList\u003c\u003e();\n tempHistory = new ArrayList\u003c\u003e();\n }\n\n // Record temperature check. Rules:\n // 1. If foodStatus is DISCARD, return \"DISCARDED\" (no further changes)\n // 2. Add temp to tempHistory\n // 3. Determine if temp is in danger zone: dangerZoneLow \u003c temp \u003c dangerZoneHigh\n // (exactly at boundaries is SAFE: \u003c=40 or \u003e=140 is safe)\n // 4. If in danger zone:\n // a. totalDangerMinutes += minutesSinceLastCheck\n // b. consecutiveViolations++\n // c. If consecutiveViolations \u003e= consecutiveViolationLimit:\n // foodStatus = \"DISCARD\", log \"DISCARD:CONSECUTIVE:\u003cconsecutiveViolations\u003e\"\n // return \"DISCARDED\"\n // d. If totalDangerMinutes \u003e= maxDangerMinutes:\n // foodStatus = \"DISCARD\", log \"DISCARD:TIME:\u003ctotalDangerMinutes\u003e\"\n // return \"DISCARDED\"\n // e. foodStatus = \"WARNING\", log \"WARNING:\u003ctemp\u003e:DANGER_MIN:\u003ctotalDangerMinutes\u003e\"\n // 5. If safe (not in danger zone):\n // a. consecutiveViolations = 0 (reset on safe reading)\n // b. foodStatus = \"SAFE\"\n // c. log \"SAFE:\u003ctemp\u003e\"\n // 6. Return foodStatus\n static String recordTemp(BigDecimal temp, int minutesSinceLastCheck) {\n","golden_completion":" if (foodStatus.equals(\"DISCARD\")) return \"DISCARDED\";\n tempHistory.add(temp);\n boolean inDanger = temp.compareTo(dangerZoneLow) \u003e 0 \u0026\u0026 temp.compareTo(dangerZoneHigh) \u003c 0;\n if (inDanger) {\n totalDangerMinutes += minutesSinceLastCheck;\n consecutiveViolations++;\n if (consecutiveViolations \u003e= consecutiveViolationLimit) {\n foodStatus = \"DISCARD\";\n auditLog.add(\"DISCARD:CONSECUTIVE:\" + consecutiveViolations);\n return \"DISCARDED\";\n }\n if (totalDangerMinutes \u003e= maxDangerMinutes) {\n foodStatus = \"DISCARD\";\n auditLog.add(\"DISCARD:TIME:\" + totalDangerMinutes);\n return \"DISCARDED\";\n }\n foodStatus = \"WARNING\";\n auditLog.add(\"WARNING:\" + temp + \":DANGER_MIN:\" + totalDangerMinutes);\n } else {\n consecutiveViolations = 0;\n foodStatus = \"SAFE\";\n auditLog.add(\"SAFE:\" + temp);\n }\n return foodStatus;\n","suffix":" }\n\n public static void main(String[] args) {\n init();\n // Safe reading at boundary\n String r1 = recordTemp(new BigDecimal(\"140\"), 0);\n assert r1.equals(\"SAFE\") : \"140F should be safe, got \" + r1;\n\n // Danger zone reading\n String r2 = recordTemp(new BigDecimal(\"80\"), 30);\n assert r2.equals(\"WARNING\") : \"80F should be warning, got \" + r2;\n assert totalDangerMinutes == 30 : \"Should have 30 danger minutes\";\n assert consecutiveViolations == 1;\n\n // Back to safe - resets consecutive\n String r3 = recordTemp(new BigDecimal(\"160\"), 15);\n assert r3.equals(\"SAFE\") : \"160F should be safe, got \" + r3;\n assert consecutiveViolations == 0 : \"Consecutive should reset\";\n }\n}\n","assertions":" // Total danger persists after safe reading\n init();\n recordTemp(new BigDecimal(\"80\"), 30); // danger, total=30\n recordTemp(new BigDecimal(\"160\"), 15); // safe\n assert totalDangerMinutes == 30 : \"Total danger should persist, got \" + totalDangerMinutes;\n\n // Three consecutive -\u003e DISCARD\n init();\n recordTemp(new BigDecimal(\"100\"), 10);\n assert consecutiveViolations == 1;\n recordTemp(new BigDecimal(\"90\"), 10);\n assert consecutiveViolations == 2;\n String r4 = recordTemp(new BigDecimal(\"95\"), 10);\n assert r4.equals(\"DISCARDED\") : \"3 consecutive should discard, got \" + r4;\n assert foodStatus.equals(\"DISCARD\");\n\n // Once discarded, stays discarded\n String r5 = recordTemp(new BigDecimal(\"35\"), 10);\n assert r5.equals(\"DISCARDED\") : \"Should stay discarded\";\n\n // Time-based discard\n init();\n recordTemp(new BigDecimal(\"100\"), 50); // total=50\n recordTemp(new BigDecimal(\"160\"), 10); // safe\n recordTemp(new BigDecimal(\"100\"), 50); // total=100\n recordTemp(new BigDecimal(\"160\"), 10); // safe\n String r6 = recordTemp(new BigDecimal(\"100\"), 30); // total=130\u003e=120\n assert r6.equals(\"DISCARDED\") : \"Should discard on time, got \" + r6;\n\n // Boundary: exactly 40F is SAFE\n init();\n String r7 = recordTemp(new BigDecimal(\"40\"), 10);\n assert r7.equals(\"SAFE\") : \"40F should be safe, got \" + r7;\n assert totalDangerMinutes == 0 : \"No danger time for boundary\";\n","category":"code_purpose_understanding"} {"id":"41","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.util.*;\n\npublic class CPTask41 {\n enum Tier { BRONZE, SILVER, GOLD, PLATINUM }\n\n static Map\u003cString, Tier\u003e passengerTiers = new HashMap\u003c\u003e();\n static Map\u003cString, String\u003e seatAssignments = new HashMap\u003c\u003e();\n static List\u003cString\u003e standbyQueue = new ArrayList\u003c\u003e();\n static Set\u003cString\u003e processedUpgrades = new HashSet\u003c\u003e();\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n // Upgrade rules:\n // 1. Only GOLD and PLATINUM can upgrade immediately; others go to standby\n // 2. If passenger already processed (idempotency), return \"ALREADY_PROCESSED\"\n // 3. Standby queue is ordered: SILVER before BRONZE, ties broken by request order\n // 4. Successful upgrade changes seat assignment and logs \"UPGRADED:\u003cpassenger\u003e:\u003cnewSeat\u003e\"\n // 5. Standby addition logs \"STANDBY:\u003cpassenger\u003e\"\n static String requestUpgrade(String passenger, String newSeat) {\n","golden_completion":" if (processedUpgrades.contains(passenger)) {\n return \"ALREADY_PROCESSED\";\n }\n processedUpgrades.add(passenger);\n Tier tier = passengerTiers.getOrDefault(passenger, Tier.BRONZE);\n if (tier == Tier.GOLD || tier == Tier.PLATINUM) {\n seatAssignments.put(passenger, newSeat);\n auditLog.add(\"UPGRADED:\" + passenger + \":\" + newSeat);\n return \"UPGRADED\";\n } else {\n // Insert SILVER before BRONZE in standby queue\n if (tier == Tier.SILVER) {\n int insertIdx = 0;\n for (int i = 0; i \u003c standbyQueue.size(); i++) {\n Tier t = passengerTiers.getOrDefault(standbyQueue.get(i), Tier.BRONZE);\n if (t == Tier.SILVER) { insertIdx = i + 1; }\n }\n standbyQueue.add(insertIdx, passenger);\n } else {\n standbyQueue.add(passenger);\n }\n auditLog.add(\"STANDBY:\" + passenger);\n return \"STANDBY\";\n }\n","suffix":" }\n\n public static void main(String[] args) {\n passengerTiers.put(\"Alice\", Tier.PLATINUM);\n passengerTiers.put(\"Bob\", Tier.BRONZE);\n passengerTiers.put(\"Carol\", Tier.SILVER);\n\n assert requestUpgrade(\"Alice\", \"1A\").equals(\"UPGRADED\");\n assert seatAssignments.get(\"Alice\").equals(\"1A\");\n assert auditLog.get(0).equals(\"UPGRADED:Alice:1A\");\n\n assert requestUpgrade(\"Bob\", \"2A\").equals(\"STANDBY\");\n assert requestUpgrade(\"Carol\", \"3A\").equals(\"STANDBY\");\n // Carol (SILVER) should be before Bob (BRONZE) in standby\n assert standbyQueue.get(0).equals(\"Carol\");\n assert standbyQueue.get(1).equals(\"Bob\");\n }\n}\n","assertions":" // Self-contained assertion tests (runs before main as static init)\n // Reset all state\n CPTask41.passengerTiers.clear();\n CPTask41.seatAssignments.clear();\n CPTask41.standbyQueue.clear();\n CPTask41.processedUpgrades.clear();\n CPTask41.auditLog.clear();\n\n CPTask41.passengerTiers.put(\"X1\", Tier.GOLD);\n CPTask41.passengerTiers.put(\"X2\", Tier.BRONZE);\n CPTask41.passengerTiers.put(\"X3\", Tier.SILVER);\n\n // Gold upgrades immediately\n assert CPTask41.requestUpgrade(\"X1\", \"10A\").equals(\"UPGRADED\") : \"Gold upgrade\";\n assert CPTask41.seatAssignments.get(\"X1\").equals(\"10A\");\n\n // Idempotency: X1 already processed\n String r = CPTask41.requestUpgrade(\"X1\", \"20A\");\n assert r.equals(\"ALREADY_PROCESSED\") : \"Idempotency failed: \" + r;\n // Seat should NOT change\n assert CPTask41.seatAssignments.get(\"X1\").equals(\"10A\") : \"Seat changed on duplicate\";\n\n // Bronze goes to standby\n assert CPTask41.requestUpgrade(\"X2\", \"11A\").equals(\"STANDBY\");\n // Silver goes before Bronze in standby\n assert CPTask41.requestUpgrade(\"X3\", \"12A\").equals(\"STANDBY\");\n assert CPTask41.standbyQueue.get(0).equals(\"X3\") : \"Silver should be first in standby\";\n assert CPTask41.standbyQueue.get(1).equals(\"X2\") : \"Bronze should be second\";\n\n // New Silver inserts after existing Silver but before Bronze\n CPTask41.passengerTiers.put(\"X4\", Tier.SILVER);\n CPTask41.requestUpgrade(\"X4\", \"13A\");\n assert CPTask41.standbyQueue.indexOf(\"X4\") == 1 : \"X4 should be at index 1\";\n assert CPTask41.standbyQueue.indexOf(\"X2\") == 2 : \"X2 should be at index 2\";\n\n // Audit log: UPGRADED, STANDBY, STANDBY, STANDBY = 4 entries\n assert CPTask41.auditLog.size() == 4 : \"Audit log size: \" + CPTask41.auditLog.size();\n\n // Re-clear for main()\n CPTask41.passengerTiers.clear();\n CPTask41.seatAssignments.clear();\n CPTask41.standbyQueue.clear();\n CPTask41.processedUpgrades.clear();\n CPTask41.auditLog.clear();\n","category":"code_purpose_understanding"} {"id":"42","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask42 {\n // Baggage fee rules:\n // 1. First bag free, 2nd bag $35, 3rd+ bag $75 each\n // 2. Overweight surcharge: bags \u003e 50 lbs get $100 surcharge PER overweight bag\n // 3. Oversize surcharge: bags \u003e 62 linear inches get $150 surcharge PER oversize bag\n // 4. Total fee capped at $500 per passenger (cumulative across all bags)\n // 5. Returns the fee charged for THIS bag (may be reduced by cap)\n // 6. Appends to feeLog: \"BAG:\u003cseq\u003e:$\u003cfee\u003e\" for each bag\n\n static List\u003cString\u003e feeLog = new ArrayList\u003c\u003e();\n static int bagCount = 0;\n static BigDecimal totalCharged = BigDecimal.ZERO;\n static final BigDecimal CAP = new BigDecimal(\"500\");\n\n static BigDecimal checkBag(int weightLbs, int linearInches) {\n","golden_completion":" bagCount++;\n BigDecimal baseFee = bagCount == 1 ? BigDecimal.ZERO\n : bagCount == 2 ? new BigDecimal(\"35\") : new BigDecimal(\"75\");\n BigDecimal surcharge = BigDecimal.ZERO;\n if (weightLbs \u003e 50) surcharge = surcharge.add(new BigDecimal(\"100\"));\n if (linearInches \u003e 62) surcharge = surcharge.add(new BigDecimal(\"150\"));\n BigDecimal bagFee = baseFee.add(surcharge);\n BigDecimal remaining = CAP.subtract(totalCharged);\n if (remaining.compareTo(BigDecimal.ZERO) \u003c= 0) {\n bagFee = BigDecimal.ZERO;\n } else if (bagFee.compareTo(remaining) \u003e 0) {\n bagFee = remaining;\n }\n totalCharged = totalCharged.add(bagFee);\n feeLog.add(\"BAG:\" + bagCount + \":$\" + bagFee);\n return bagFee;\n","suffix":" }\n\n public static void main(String[] args) {\n // Bag 1: 40 lbs, 50 inches — free, no surcharges\n BigDecimal f1 = checkBag(40, 50);\n assert f1.compareTo(BigDecimal.ZERO) == 0 : \"Bag 1 fee: \" + f1;\n\n // Bag 2: 55 lbs, 50 inches — $35 base + $100 overweight = $135\n BigDecimal f2 = checkBag(55, 50);\n assert f2.compareTo(new BigDecimal(\"135\")) == 0 : \"Bag 2 fee: \" + f2;\n\n // Bag 3: 60 lbs, 70 inches — $75 base + $100 overweight + $150 oversize = $325\n BigDecimal f3 = checkBag(60, 70);\n assert f3.compareTo(new BigDecimal(\"325\")) == 0 : \"Bag 3 fee: \" + f3;\n\n assert feeLog.size() == 3;\n assert feeLog.get(0).equals(\"BAG:1:$0\");\n }\n}\n","assertions":" // Self-contained: reset state\n CPTask42.feeLog.clear();\n CPTask42.bagCount = 0;\n CPTask42.totalCharged = BigDecimal.ZERO;\n\n // Bag 1: free\n BigDecimal a1 = CPTask42.checkBag(40, 50);\n assert a1.compareTo(BigDecimal.ZERO) == 0 : \"A-Bag1: \" + a1;\n\n // Bag 2: $35 base + $100 overweight = $135\n BigDecimal a2 = CPTask42.checkBag(55, 50);\n assert a2.compareTo(new BigDecimal(\"135\")) == 0 : \"A-Bag2: \" + a2;\n\n // Bag 3: $75 + $100 + $150 = $325, total now 0+135+325 = 460\n BigDecimal a3 = CPTask42.checkBag(60, 70);\n assert a3.compareTo(new BigDecimal(\"325\")) == 0 : \"A-Bag3: \" + a3;\n\n // Bag 4: would be $75+$100+$150=$325 but cap $500-$460=$40 remaining\n BigDecimal a4 = CPTask42.checkBag(60, 70);\n assert a4.compareTo(new BigDecimal(\"40\")) == 0 : \"A-Bag4 cap: \" + a4;\n\n // Bag 5: cap already hit → $0\n BigDecimal a5 = CPTask42.checkBag(30, 40);\n assert a5.compareTo(BigDecimal.ZERO) == 0 : \"A-Bag5 cap: \" + a5;\n\n assert CPTask42.feeLog.size() == 5 : \"Fee log: \" + CPTask42.feeLog.size();\n assert CPTask42.feeLog.get(3).equals(\"BAG:4:$40\") : \"Bag4 log: \" + CPTask42.feeLog.get(3);\n assert CPTask42.feeLog.get(4).equals(\"BAG:5:$0\") : \"Bag5 log: \" + CPTask42.feeLog.get(4);\n\n // Reset for main\n CPTask42.feeLog.clear();\n CPTask42.bagCount = 0;\n CPTask42.totalCharged = BigDecimal.ZERO;\n","category":"code_purpose_understanding"} {"id":"43","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask43 {\n // Premium calculation rules:\n // 1. Base premium starts at basePremium\n // 2. Each risk factor multiplies the premium: SMOKER=1.5, HIGH_BMI=1.3, SENIOR=1.4\n // Applied multiplicatively in order they appear in riskFactors list\n // 3. No-claim discount: for each consecutive claim-free year, subtract 5% (max 30%)\n // Applied AFTER risk factors, as a percentage of the post-risk premium\n // 4. Minimum premium floor: result cannot go below $50.00\n // 5. Round to 2 decimal places using HALF_UP\n\n static Map\u003cString, BigDecimal\u003e RISK_MULTIPLIERS = new LinkedHashMap\u003c\u003e();\n static {\n RISK_MULTIPLIERS.put(\"SMOKER\", new BigDecimal(\"1.5\"));\n RISK_MULTIPLIERS.put(\"HIGH_BMI\", new BigDecimal(\"1.3\"));\n RISK_MULTIPLIERS.put(\"SENIOR\", new BigDecimal(\"1.4\"));\n }\n\n static BigDecimal calculatePremium(BigDecimal basePremium, List\u003cString\u003e riskFactors, int claimFreeYears) {\n","golden_completion":" BigDecimal premium = basePremium;\n for (String factor : riskFactors) {\n BigDecimal multiplier = RISK_MULTIPLIERS.get(factor);\n if (multiplier != null) {\n premium = premium.multiply(multiplier);\n }\n }\n int discountPct = Math.min(claimFreeYears * 5, 30);\n BigDecimal discountMultiplier = BigDecimal.ONE.subtract(\n new BigDecimal(discountPct).divide(new BigDecimal(\"100\")));\n premium = premium.multiply(discountMultiplier).setScale(2, RoundingMode.HALF_UP);\n BigDecimal floor = new BigDecimal(\"50.00\");\n if (premium.compareTo(floor) \u003c 0) {\n premium = floor;\n }\n return premium;\n","suffix":" }\n\n public static void main(String[] args) {\n // Base $200, SMOKER+HIGH_BMI → 200*1.5*1.3 = 390, 3 claim-free years → 15% off → 331.50\n BigDecimal p1 = calculatePremium(new BigDecimal(\"200\"), List.of(\"SMOKER\", \"HIGH_BMI\"), 3);\n assert p1.compareTo(new BigDecimal(\"331.50\")) == 0 : \"p1=\" + p1;\n\n // Base $100, no risk factors, 0 claim-free years → $100.00\n BigDecimal p2 = calculatePremium(new BigDecimal(\"100\"), List.of(), 0);\n assert p2.compareTo(new BigDecimal(\"100.00\")) == 0 : \"p2=\" + p2;\n }\n}\n","assertions":" // Max discount cap: 10 claim-free years → still only 30% discount\n BigDecimal p3 = CPTask43.calculatePremium(new BigDecimal(\"200\"), List.of(), 10);\n // 200 * 0.70 = 140.00\n assert p3.compareTo(new BigDecimal(\"140.00\")) == 0 : \"Max discount cap failed: \" + p3;\n\n // Minimum premium floor: $30 base, no risk, 6 years → 30*0.70 = 21 → floored to $50\n BigDecimal p4 = CPTask43.calculatePremium(new BigDecimal(\"30\"), List.of(), 6);\n assert p4.compareTo(new BigDecimal(\"50.00\")) == 0 : \"Minimum floor failed: \" + p4;\n\n // All three risk factors: $100 * 1.5 * 1.3 * 1.4 = 273, 4 years → 20% off → 218.40\n BigDecimal p5 = CPTask43.calculatePremium(new BigDecimal(\"100\"), List.of(\"SMOKER\", \"HIGH_BMI\", \"SENIOR\"), 4);\n assert p5.compareTo(new BigDecimal(\"218.40\")) == 0 : \"All risks: \" + p5;\n\n // Unknown risk factor ignored: $100, [\"UNKNOWN\"], 0 years → $100.00\n BigDecimal p6 = CPTask43.calculatePremium(new BigDecimal(\"100\"), List.of(\"UNKNOWN\"), 0);\n assert p6.compareTo(new BigDecimal(\"100.00\")) == 0 : \"Unknown risk: \" + p6;\n","category":"code_purpose_understanding"} {"id":"44","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask44 {\n // Policy renewal rules:\n // 1. Policy states: ACTIVE, GRACE, LAPSED, CANCELLED\n // 2. If currentDay \u003c= expiryDay and policyState is ACTIVE, return \"ALREADY_ACTIVE\"\n // 3. Days past expiry = max(0, currentDay - expiryDay)\n // 4. 0-30 days past: GRACE renewal — restore to ACTIVE at base premium, new expiry = currentDay + 365\n // 5. 31-90 days past: PENALTY renewal — ACTIVE, but premium + 25% + $75 reinstatement fee\n // 6. 91+ days past: LAPSED — cannot renew\n // 7. Audit log: \"RENEWED:\u003cpolicyId\u003e:$\u003ctotalCost\u003e\" or \"LAPSED:\u003cpolicyId\u003e\"\n\n static String policyState = \"ACTIVE\";\n static int expiryDay = 100;\n static BigDecimal basePremium = new BigDecimal(\"400.00\");\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n static String renewPolicy(String policyId, int currentDay) {\n","golden_completion":" if (policyState.equals(\"ACTIVE\") \u0026\u0026 currentDay \u003c= expiryDay) {\n return \"ALREADY_ACTIVE\";\n }\n int daysPastExpiry = currentDay - expiryDay;\n if (daysPastExpiry \u003c 0) daysPastExpiry = 0;\n\n if (daysPastExpiry \u003c= 30) {\n policyState = \"ACTIVE\";\n expiryDay = currentDay + 365;\n auditLog.add(\"RENEWED:\" + policyId + \":$\" + basePremium.setScale(2, RoundingMode.HALF_UP));\n return \"RENEWED\";\n } else if (daysPastExpiry \u003c= 90) {\n BigDecimal penalty = basePremium.multiply(new BigDecimal(\"0.25\"));\n BigDecimal total = basePremium.add(penalty).add(new BigDecimal(\"75.00\")).setScale(2, RoundingMode.HALF_UP);\n policyState = \"ACTIVE\";\n expiryDay = currentDay + 365;\n auditLog.add(\"RENEWED:\" + policyId + \":$\" + total);\n return \"RENEWED\";\n } else {\n policyState = \"LAPSED\";\n auditLog.add(\"LAPSED:\" + policyId);\n return \"LAPSED\";\n }\n","suffix":" }\n\n public static void main(String[] args) {\n // Before expiry — already active\n assert renewPolicy(\"POL-1\", 50).equals(\"ALREADY_ACTIVE\");\n\n // Day 110 — 10 days past expiry, within grace → renew at base $400\n policyState = \"ACTIVE\";\n expiryDay = 100;\n String r1 = renewPolicy(\"POL-1\", 110);\n assert r1.equals(\"RENEWED\") : r1;\n assert policyState.equals(\"ACTIVE\");\n assert auditLog.get(0).equals(\"RENEWED:POL-1:$400.00\") : auditLog.get(0);\n }\n}\n","assertions":" // Self-contained: reset state\n CPTask44.policyState = \"ACTIVE\";\n CPTask44.expiryDay = 200;\n CPTask44.auditLog.clear();\n\n // Day 250 — 50 days past expiry → penalty window: 400 + 100 + 75 = $575.00\n String r2 = CPTask44.renewPolicy(\"POL-2\", 250);\n assert r2.equals(\"RENEWED\") : \"Penalty renewal: \" + r2;\n assert CPTask44.auditLog.get(0).equals(\"RENEWED:POL-2:$575.00\") : \"Penalty log: \" + CPTask44.auditLog.get(0);\n assert CPTask44.policyState.equals(\"ACTIVE\") : \"Should be ACTIVE after penalty renewal\";\n\n // Reset for lapse test\n CPTask44.policyState = \"ACTIVE\";\n CPTask44.expiryDay = 300;\n CPTask44.auditLog.clear();\n\n // Day 400 — 100 days past expiry → LAPSED\n String r3 = CPTask44.renewPolicy(\"POL-3\", 400);\n assert r3.equals(\"LAPSED\") : \"Should be LAPSED: \" + r3;\n assert CPTask44.policyState.equals(\"LAPSED\") : \"State should be LAPSED\";\n assert CPTask44.auditLog.get(0).equals(\"LAPSED:POL-3\") : \"Lapse log: \" + CPTask44.auditLog.get(0);\n\n // Boundary: exactly day 30 past expiry — still grace\n CPTask44.policyState = \"ACTIVE\";\n CPTask44.expiryDay = 500;\n CPTask44.auditLog.clear();\n String r4 = CPTask44.renewPolicy(\"POL-4\", 530);\n assert r4.equals(\"RENEWED\") : \"Boundary 30 days: \" + r4;\n assert CPTask44.auditLog.get(0).equals(\"RENEWED:POL-4:$400.00\") : \"Boundary log: \" + CPTask44.auditLog.get(0);\n\n // Boundary: exactly day 31 past expiry — penalty\n CPTask44.policyState = \"ACTIVE\";\n CPTask44.expiryDay = 600;\n CPTask44.auditLog.clear();\n String r5 = CPTask44.renewPolicy(\"POL-5\", 631);\n assert r5.equals(\"RENEWED\") : \"Boundary 31 days: \" + r5;\n assert CPTask44.auditLog.get(0).equals(\"RENEWED:POL-5:$575.00\") : \"Boundary 31 log: \" + CPTask44.auditLog.get(0);\n\n // Reset for main\n CPTask44.policyState = \"ACTIVE\";\n CPTask44.expiryDay = 100;\n CPTask44.auditLog.clear();\n","category":"code_purpose_understanding"} {"id":"45","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask45 {\n // Usage metering rules:\n // 1. Committed tier: first 1000 units included in base fee ($200)\n // 2. Overage: units 1001-2000 at $0.30/unit; units 2001+ at $0.50/unit (burst pricing)\n // 3. Running usage accumulates across recordUsage() calls within a billing period\n // 4. closeBillingPeriod() calculates total bill, resets usage to 0, returns the bill\n // 5. Minimum charge: bill cannot be below $200 (the base fee) even with credits\n // 6. Audit log: \"USAGE:\u003cunits\u003e:running=\u003ctotal\u003e\" per record, \"BILL:$\u003camount\u003e\" on close\n\n static int currentUsage = 0;\n static BigDecimal credits = BigDecimal.ZERO;\n static List\u003cString\u003e auditLog = new ArrayList\u003c\u003e();\n\n static void recordUsage(int units) {\n currentUsage += units;\n auditLog.add(\"USAGE:\" + units + \":running=\" + currentUsage);\n }\n\n static BigDecimal closeBillingPeriod() {\n","golden_completion":" BigDecimal baseFee = new BigDecimal(\"200.00\");\n BigDecimal overage = BigDecimal.ZERO;\n if (currentUsage \u003e 2000) {\n overage = new BigDecimal(\"1000\").multiply(new BigDecimal(\"0.30\"))\n .add(new BigDecimal(currentUsage - 2000).multiply(new BigDecimal(\"0.50\")));\n } else if (currentUsage \u003e 1000) {\n overage = new BigDecimal(currentUsage - 1000).multiply(new BigDecimal(\"0.30\"));\n }\n BigDecimal total = baseFee.add(overage).subtract(credits).setScale(2, RoundingMode.HALF_UP);\n BigDecimal minCharge = new BigDecimal(\"200.00\");\n if (total.compareTo(minCharge) \u003c 0) {\n total = minCharge;\n }\n auditLog.add(\"BILL:$\" + total);\n currentUsage = 0;\n credits = BigDecimal.ZERO;\n return total;\n","suffix":" }\n\n public static void main(String[] args) {\n // Record 1500 units across two calls\n recordUsage(800);\n recordUsage(700);\n // 1500 total: 1000 included, 500 overage at $0.30 = $150, total = $350\n BigDecimal bill1 = closeBillingPeriod();\n assert bill1.compareTo(new BigDecimal(\"350.00\")) == 0 : \"bill1=\" + bill1;\n assert currentUsage == 0 : \"Usage not reset\";\n\n // Record 2500 units — burst pricing\n recordUsage(2500);\n // 1000 included, 1000 at $0.30=$300, 500 at $0.50=$250, total = $750\n BigDecimal bill2 = closeBillingPeriod();\n assert bill2.compareTo(new BigDecimal(\"750.00\")) == 0 : \"bill2=\" + bill2;\n }\n}\n","assertions":" // Self-contained: reset\n CPTask45.currentUsage = 0;\n CPTask45.credits = BigDecimal.ZERO;\n CPTask45.auditLog.clear();\n\n // Zero usage — minimum charge $200\n BigDecimal bill3 = CPTask45.closeBillingPeriod();\n assert bill3.compareTo(new BigDecimal(\"200.00\")) == 0 : \"Zero usage min: \" + bill3;\n\n // Usage with credits: 500 units (no overage), $50 credit\n CPTask45.credits = new BigDecimal(\"50.00\");\n CPTask45.recordUsage(500);\n BigDecimal bill4 = CPTask45.closeBillingPeriod();\n // 200 - 50 = 150, but minimum is 200, so $200\n assert bill4.compareTo(new BigDecimal(\"200.00\")) == 0 : \"Credit below min: \" + bill4;\n\n // Credits should reset after billing\n assert CPTask45.credits.compareTo(BigDecimal.ZERO) == 0 : \"Credits not reset\";\n\n // Exactly 1000 units — base fee only\n CPTask45.recordUsage(1000);\n BigDecimal bill5 = CPTask45.closeBillingPeriod();\n assert bill5.compareTo(new BigDecimal(\"200.00\")) == 0 : \"Exactly 1000: \" + bill5;\n\n // Exactly 2000 units — 1000 overage at $0.30 = $300 + $200 = $500\n CPTask45.recordUsage(2000);\n BigDecimal bill6 = CPTask45.closeBillingPeriod();\n assert bill6.compareTo(new BigDecimal(\"500.00\")) == 0 : \"Exactly 2000: \" + bill6;\n\n // Reset for main\n CPTask45.currentUsage = 0;\n CPTask45.credits = BigDecimal.ZERO;\n CPTask45.auditLog.clear();\n","category":"code_purpose_understanding"} {"id":"46","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.util.*;\n\npublic class CPTask46 {\n enum Plan { FREE, STARTER, BUSINESS, ENTERPRISE }\n\n static final Map\u003cPlan, Set\u003cString\u003e\u003e PLAN_FEATURES = new LinkedHashMap\u003c\u003e();\n static final Map\u003cPlan, Integer\u003e SEAT_LIMITS = new LinkedHashMap\u003c\u003e();\n static final Map\u003cPlan, Integer\u003e STORAGE_MB = new LinkedHashMap\u003c\u003e();\n static {\n PLAN_FEATURES.put(Plan.FREE, Set.of(\"BASIC_REPORTS\"));\n PLAN_FEATURES.put(Plan.STARTER, Set.of(\"BASIC_REPORTS\", \"API_ACCESS\"));\n PLAN_FEATURES.put(Plan.BUSINESS, Set.of(\"BASIC_REPORTS\", \"API_ACCESS\", \"SSO\", \"CUSTOM_DOMAINS\"));\n PLAN_FEATURES.put(Plan.ENTERPRISE, Set.of(\"BASIC_REPORTS\", \"API_ACCESS\", \"SSO\", \"CUSTOM_DOMAINS\", \"AUDIT_LOG\", \"SLA\"));\n SEAT_LIMITS.put(Plan.FREE, 3);\n SEAT_LIMITS.put(Plan.STARTER, 10);\n SEAT_LIMITS.put(Plan.BUSINESS, 50);\n SEAT_LIMITS.put(Plan.ENTERPRISE, Integer.MAX_VALUE);\n STORAGE_MB.put(Plan.FREE, 500);\n STORAGE_MB.put(Plan.STARTER, 5000);\n STORAGE_MB.put(Plan.BUSINESS, 50000);\n STORAGE_MB.put(Plan.ENTERPRISE, Integer.MAX_VALUE);\n }\n\n static Plan currentPlan = Plan.FREE;\n static int currentSeats = 1;\n static int currentStorageMB = 0;\n static boolean trialActive = false;\n static int trialExpiryDay = -1;\n static boolean trialUsed = false;\n static List\u003cString\u003e provisionLog = new ArrayList\u003c\u003e();\n\n static void expireTrialIfNeeded(int currentDay) {\n if (trialActive \u0026\u0026 currentDay \u003e trialExpiryDay) {\n trialActive = false;\n provisionLog.add(\"TRIAL_EXPIRED:\" + currentDay);\n }\n }\n\n static String addSeat(int currentDay) {\n expireTrialIfNeeded(currentDay);\n int limit = SEAT_LIMITS.get(currentPlan);\n if (currentSeats \u003e= limit) { provisionLog.add(\"DENIED:SEAT:\" + currentDay); return \"SEAT_LIMIT_REACHED\"; }\n currentSeats++;\n provisionLog.add(\"SEAT_ADDED:\" + currentSeats + \":\" + currentDay);\n return \"OK\";\n }\n\n static String useStorage(int mb, int currentDay) {\n expireTrialIfNeeded(currentDay);\n int limit = STORAGE_MB.get(currentPlan);\n if (currentStorageMB + mb \u003e limit) { provisionLog.add(\"DENIED:STORAGE:\" + currentDay); return \"STORAGE_EXCEEDED\"; }\n currentStorageMB += mb;\n provisionLog.add(\"STORAGE:\" + currentStorageMB + \"MB:\" + currentDay);\n return \"OK\";\n }\n\n // Provision action: processes a request by type\n // Actions: \"ADD_SEAT\", \"USE_STORAGE:\u003cmb\u003e\", \"ACCESS:\u003cfeature\u003e\", \"START_TRIAL\"\n // Must check trial expiry on every call, respect plan gates, enforce one-shot trial\n static String provision(String action, int currentDay) {\n","golden_completion":" expireTrialIfNeeded(currentDay);\n if (action.equals(\"ADD_SEAT\")) {\n return addSeat(currentDay);\n } else if (action.startsWith(\"USE_STORAGE:\")) {\n int mb = Integer.parseInt(action.split(\":\")[1]);\n return useStorage(mb, currentDay);\n } else if (action.startsWith(\"ACCESS:\")) {\n String feature = action.split(\":\")[1];\n Set\u003cString\u003e allowed = PLAN_FEATURES.get(currentPlan);\n if (allowed.contains(feature) || trialActive) return \"GRANTED\";\n return \"FEATURE_LOCKED\";\n } else if (action.equals(\"START_TRIAL\")) {\n if (trialUsed) return \"TRIAL_EXHAUSTED\";\n trialUsed = true;\n trialActive = true;\n trialExpiryDay = currentDay + 14;\n provisionLog.add(\"TRIAL_STARTED:\" + currentDay);\n return \"TRIAL_ACTIVE\";\n }\n return \"UNKNOWN_ACTION\";\n","suffix":" }\n\n public static void main(String[] args) {\n // FREE plan: 3 seats max\n assert provision(\"ADD_SEAT\", 1).equals(\"OK\"); // seat 2\n assert provision(\"ADD_SEAT\", 2).equals(\"OK\"); // seat 3\n assert provision(\"ADD_SEAT\", 3).equals(\"SEAT_LIMIT_REACHED\");\n\n // Storage: 500 MB limit on FREE\n assert provision(\"USE_STORAGE:400\", 4).equals(\"OK\");\n assert provision(\"USE_STORAGE:200\", 5).equals(\"STORAGE_EXCEEDED\");\n\n // Feature locked on FREE\n assert provision(\"ACCESS:SSO\", 6).equals(\"FEATURE_LOCKED\");\n assert provision(\"ACCESS:BASIC_REPORTS\", 6).equals(\"GRANTED\");\n\n // Start trial — SSO now accessible\n assert provision(\"START_TRIAL\", 10).equals(\"TRIAL_ACTIVE\");\n assert provision(\"ACCESS:SSO\", 11).equals(\"GRANTED\");\n }\n}\n","assertions":" // Self-contained: reset all state\n CPTask46.currentPlan = Plan.FREE;\n CPTask46.currentSeats = 1;\n CPTask46.currentStorageMB = 0;\n CPTask46.trialActive = false;\n CPTask46.trialExpiryDay = -1;\n CPTask46.trialUsed = false;\n CPTask46.provisionLog.clear();\n\n // Start trial on day 100\n assert CPTask46.provision(\"START_TRIAL\", 100).equals(\"TRIAL_ACTIVE\");\n // Day 114 = last day (100+14=114)\n assert CPTask46.provision(\"ACCESS:SSO\", 114).equals(\"GRANTED\") : \"Day 114 in trial\";\n // Day 115 = expired\n assert CPTask46.provision(\"ACCESS:SSO\", 115).equals(\"FEATURE_LOCKED\") : \"Day 115 past trial\";\n\n // Cannot start trial again\n assert CPTask46.provision(\"START_TRIAL\", 200).equals(\"TRIAL_EXHAUSTED\");\n\n // Upgrade to BUSINESS\n CPTask46.currentPlan = Plan.BUSINESS;\n CPTask46.currentSeats = 1;\n CPTask46.currentStorageMB = 0;\n assert CPTask46.provision(\"ACCESS:SSO\", 300).equals(\"GRANTED\") : \"BUSINESS has SSO\";\n assert CPTask46.provision(\"ACCESS:SLA\", 300).equals(\"FEATURE_LOCKED\") : \"BUSINESS no SLA\";\n\n // BUSINESS: 50 seat limit\n for (int i = 2; i \u003c= 50; i++) { CPTask46.provision(\"ADD_SEAT\", 300); }\n assert CPTask46.provision(\"ADD_SEAT\", 300).equals(\"SEAT_LIMIT_REACHED\") : \"50 seats\";\n\n // Storage on BUSINESS: 50000 MB\n assert CPTask46.provision(\"USE_STORAGE:40000\", 301).equals(\"OK\");\n assert CPTask46.provision(\"USE_STORAGE:20000\", 302).equals(\"STORAGE_EXCEEDED\");\n\n // Verify trial expired log\n boolean hasTE = CPTask46.provisionLog.stream().anyMatch(s -\u003e s.startsWith(\"TRIAL_EXPIRED:\"));\n assert hasTE : \"Should have TRIAL_EXPIRED entry\";\n\n // Reset for main\n CPTask46.currentPlan = Plan.FREE;\n CPTask46.currentSeats = 1;\n CPTask46.currentStorageMB = 0;\n CPTask46.trialActive = false;\n CPTask46.trialExpiryDay = -1;\n CPTask46.trialUsed = false;\n CPTask46.provisionLog.clear();\n","category":"code_purpose_understanding"} {"id":"47","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask47 {\n // Corporate donation matching rules:\n // 1. Company matches employee donations at 1:1 ratio up to $500 per donation\n // 2. Annual corporate matching cap: $10,000 total across all employees\n // 3. Remaining annual budget tracked across calls\n // 4. Tax receipt: \"RECEIPT:\u003cemployee\u003e:personal=$\u003camt\u003e:matched=$\u003cmatchAmt\u003e:total=$\u003csum\u003e\"\n // 5. If annual cap already hit, match amount is $0 (personal donation still accepted)\n // 6. Partial match: if remaining budget \u003c match (but \u003e 0), match = remaining budget\n\n static BigDecimal annualBudgetRemaining = new BigDecimal(\"10000.00\");\n static List\u003cString\u003e taxReceipts = new ArrayList\u003c\u003e();\n\n static BigDecimal processDonation(String employee, BigDecimal amount) {\n","golden_completion":" // Per-donation match cap: $500\n BigDecimal maxMatch = new BigDecimal(\"500.00\");\n BigDecimal desiredMatch = amount.compareTo(maxMatch) \u003e 0 ? maxMatch : amount;\n\n // Apply annual budget constraint\n BigDecimal actualMatch;\n if (annualBudgetRemaining.compareTo(BigDecimal.ZERO) \u003c= 0) {\n actualMatch = BigDecimal.ZERO;\n } else if (desiredMatch.compareTo(annualBudgetRemaining) \u003e 0) {\n actualMatch = annualBudgetRemaining;\n } else {\n actualMatch = desiredMatch;\n }\n annualBudgetRemaining = annualBudgetRemaining.subtract(actualMatch);\n\n BigDecimal total = amount.add(actualMatch).setScale(2, RoundingMode.HALF_UP);\n taxReceipts.add(\"RECEIPT:\" + employee + \":personal=$\" + amount.setScale(2, RoundingMode.HALF_UP)\n + \":matched=$\" + actualMatch.setScale(2, RoundingMode.HALF_UP)\n + \":total=$\" + total);\n return total;\n","suffix":" }\n\n public static void main(String[] args) {\n // $300 donation — matched 1:1 ($300), total $600\n BigDecimal t1 = processDonation(\"Alice\", new BigDecimal(\"300.00\"));\n assert t1.compareTo(new BigDecimal(\"600.00\")) == 0 : \"t1=\" + t1;\n\n // $800 donation — match capped at $500, total $1300\n BigDecimal t2 = processDonation(\"Bob\", new BigDecimal(\"800.00\"));\n assert t2.compareTo(new BigDecimal(\"1300.00\")) == 0 : \"t2=\" + t2;\n\n assert taxReceipts.get(0).equals(\"RECEIPT:Alice:personal=$300.00:matched=$300.00:total=$600.00\");\n assert taxReceipts.get(1).equals(\"RECEIPT:Bob:personal=$800.00:matched=$500.00:total=$1300.00\");\n }\n}\n","assertions":" // Self-contained: reset state\n CPTask47.annualBudgetRemaining = new BigDecimal(\"10000.00\");\n CPTask47.taxReceipts.clear();\n\n // Use up most of budget: 19 donations of $500 each → 19*500 = 9500 matched\n for (int i = 0; i \u003c 19; i++) {\n CPTask47.processDonation(\"Emp\" + i, new BigDecimal(\"500.00\"));\n }\n // Budget: 10000 - 9500 = 500 remaining\n assert CPTask47.annualBudgetRemaining.compareTo(new BigDecimal(\"500.00\")) == 0 : \"After drain: \" + CPTask47.annualBudgetRemaining;\n\n // $800 donation: match capped at $500 (per-donation cap) and budget has $500 → match = $500\n BigDecimal t3 = CPTask47.processDonation(\"Carol\", new BigDecimal(\"800.00\"));\n assert t3.compareTo(new BigDecimal(\"1300.00\")) == 0 : \"Full match: \" + t3;\n assert CPTask47.annualBudgetRemaining.compareTo(BigDecimal.ZERO) == 0 : \"Budget not zeroed\";\n\n // Budget exhausted: $100 donation, match = $0, total = $100\n BigDecimal t4 = CPTask47.processDonation(\"Dave\", new BigDecimal(\"100.00\"));\n assert t4.compareTo(new BigDecimal(\"100.00\")) == 0 : \"No match at cap: \" + t4;\n\n // Verify last receipt shows $0 match\n String lastReceipt = CPTask47.taxReceipts.get(CPTask47.taxReceipts.size() - 1);\n assert lastReceipt.contains(\"matched=$0.00\") : \"Last receipt: \" + lastReceipt;\n\n // Partial match test: reset with $200 budget\n CPTask47.annualBudgetRemaining = new BigDecimal(\"200.00\");\n CPTask47.taxReceipts.clear();\n BigDecimal t5 = CPTask47.processDonation(\"Eve\", new BigDecimal(\"400.00\"));\n // desiredMatch = $400 (\u003c $500 cap), but budget = $200 → match = $200, total = $600\n assert t5.compareTo(new BigDecimal(\"600.00\")) == 0 : \"Partial match: \" + t5;\n assert CPTask47.annualBudgetRemaining.compareTo(BigDecimal.ZERO) == 0 : \"Budget after partial\";\n\n // Reset for main\n CPTask47.annualBudgetRemaining = new BigDecimal(\"10000.00\");\n CPTask47.taxReceipts.clear();\n","category":"code_purpose_understanding"} {"id":"48","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask48 {\n // Grant disbursement rules:\n // 1. Grant has milestones (ordered list). Each has a percentage of total grant.\n // 2. Milestones must be completed IN ORDER — cannot skip ahead\n // 3. Each milestone releases its percentage, MINUS 10% holdback retained until final milestone\n // 4. When the LAST milestone is completed, the accumulated holdback is also released\n // 5. If a milestone is marked \"FAILED\", the grant enters CLAWBACK state:\n // - No more disbursements allowed\n // - Previously disbursed amounts remain (no actual clawback of money)\n // - Holdback is forfeited (not released)\n // 6. Idempotency: completing same milestone twice returns \"ALREADY_COMPLETED\"\n\n static BigDecimal totalGrant = new BigDecimal(\"100000.00\");\n static List\u003cString\u003e milestones = List.of(\"DESIGN\", \"PROTOTYPE\", \"PILOT\", \"SCALE\");\n static List\u003cInteger\u003e milestonePcts = List.of(10, 25, 30, 35); // percentages\n static int nextMilestoneIdx = 0;\n static BigDecimal totalDisbursed = BigDecimal.ZERO;\n static BigDecimal holdback = BigDecimal.ZERO;\n static Set\u003cString\u003e completedMilestones = new LinkedHashSet\u003c\u003e();\n static String grantState = \"ACTIVE\";\n static List\u003cString\u003e disbursementLog = new ArrayList\u003c\u003e();\n\n static String completeMilestone(String milestone, boolean passed) {\n","golden_completion":" if (grantState.equals(\"CLAWBACK\")) return \"GRANT_CLAWBACK\";\n if (completedMilestones.contains(milestone)) return \"ALREADY_COMPLETED\";\n if (nextMilestoneIdx \u003e= milestones.size() || !milestones.get(nextMilestoneIdx).equals(milestone))\n return \"WRONG_SEQUENCE\";\n if (!passed) {\n grantState = \"CLAWBACK\";\n disbursementLog.add(\"FAILED:\" + milestone + \":holdback_forfeited=$\" + holdback.setScale(2, RoundingMode.HALF_UP));\n return \"MILESTONE_FAILED\";\n }\n completedMilestones.add(milestone);\n BigDecimal amt = totalGrant.multiply(new BigDecimal(milestonePcts.get(nextMilestoneIdx)))\n .divide(new BigDecimal(\"100\"), 2, RoundingMode.HALF_UP);\n boolean isLast = (nextMilestoneIdx == milestones.size() - 1);\n BigDecimal disb = isLast ? amt.add(holdback) : amt.subtract(amt.multiply(new BigDecimal(\"0.10\")).setScale(2, RoundingMode.HALF_UP));\n if (isLast) { holdback = BigDecimal.ZERO; } else { holdback = holdback.add(amt.multiply(new BigDecimal(\"0.10\")).setScale(2, RoundingMode.HALF_UP)); }\n totalDisbursed = totalDisbursed.add(disb);\n disbursementLog.add(\"DISBURSED:\" + milestone + \":$\" + disb.setScale(2, RoundingMode.HALF_UP));\n nextMilestoneIdx++;\n return \"DISBURSED\";\n","suffix":" }\n\n public static void main(String[] args) {\n // DESIGN: 10% of 100k = 10000, holdback 10% = 1000, disbursed = 9000\n String r1 = completeMilestone(\"DESIGN\", true);\n assert r1.equals(\"DISBURSED\") : r1;\n assert totalDisbursed.compareTo(new BigDecimal(\"9000.00\")) == 0 : \"d=\" + totalDisbursed;\n assert holdback.compareTo(new BigDecimal(\"1000.00\")) == 0 : \"h=\" + holdback;\n\n // Cannot skip to PILOT\n assert completeMilestone(\"PILOT\", true).equals(\"WRONG_SEQUENCE\");\n\n // PROTOTYPE: 25% = 25000, holdback 10% = 2500, disbursed = 22500\n completeMilestone(\"PROTOTYPE\", true);\n assert totalDisbursed.compareTo(new BigDecimal(\"31500.00\")) == 0 : \"d=\" + totalDisbursed;\n }\n}\n","assertions":" // Self-contained: reset all state\n CPTask48.totalGrant = new BigDecimal(\"100000.00\");\n CPTask48.nextMilestoneIdx = 0;\n CPTask48.totalDisbursed = BigDecimal.ZERO;\n CPTask48.holdback = BigDecimal.ZERO;\n CPTask48.completedMilestones.clear();\n CPTask48.grantState = \"ACTIVE\";\n CPTask48.disbursementLog.clear();\n\n // Complete all milestones\n CPTask48.completeMilestone(\"DESIGN\", true); // 10000*0.9 = 9000\n CPTask48.completeMilestone(\"PROTOTYPE\", true); // 25000*0.9 = 22500\n\n // Idempotency\n String r2 = CPTask48.completeMilestone(\"DESIGN\", true);\n assert r2.equals(\"ALREADY_COMPLETED\") : \"Idempotency: \" + r2;\n\n CPTask48.completeMilestone(\"PILOT\", true); // 30000*0.9 = 27000\n // Total: 9000+22500+27000 = 58500, holdback: 1000+2500+3000 = 6500\n assert CPTask48.totalDisbursed.compareTo(new BigDecimal(\"58500.00\")) == 0 : \"After PILOT: \" + CPTask48.totalDisbursed;\n assert CPTask48.holdback.compareTo(new BigDecimal(\"6500.00\")) == 0 : \"Holdback: \" + CPTask48.holdback;\n\n // SCALE (last): 35000 + 6500 holdback = 41500\n CPTask48.completeMilestone(\"SCALE\", true);\n assert CPTask48.totalDisbursed.compareTo(new BigDecimal(\"100000.00\")) == 0 : \"Final: \" + CPTask48.totalDisbursed;\n assert CPTask48.holdback.compareTo(BigDecimal.ZERO) == 0 : \"Holdback zero\";\n\n // Clawback scenario: fresh state with $50k grant\n CPTask48.totalGrant = new BigDecimal(\"50000.00\");\n CPTask48.nextMilestoneIdx = 0;\n CPTask48.totalDisbursed = BigDecimal.ZERO;\n CPTask48.holdback = BigDecimal.ZERO;\n CPTask48.completedMilestones.clear();\n CPTask48.grantState = \"ACTIVE\";\n CPTask48.disbursementLog.clear();\n\n CPTask48.completeMilestone(\"DESIGN\", true); // 5000*0.9 = 4500\n String r3 = CPTask48.completeMilestone(\"PROTOTYPE\", false); // FAILED\n assert r3.equals(\"MILESTONE_FAILED\") : \"Clawback: \" + r3;\n assert CPTask48.grantState.equals(\"CLAWBACK\");\n\n // Cannot disburse after clawback\n String r4 = CPTask48.completeMilestone(\"PILOT\", true);\n assert r4.equals(\"GRANT_CLAWBACK\") : \"Post-clawback: \" + r4;\n assert CPTask48.totalDisbursed.compareTo(new BigDecimal(\"4500.00\")) == 0 : \"Post-clawback: \" + CPTask48.totalDisbursed;\n\n // Reset for main\n CPTask48.totalGrant = new BigDecimal(\"100000.00\");\n CPTask48.nextMilestoneIdx = 0;\n CPTask48.totalDisbursed = BigDecimal.ZERO;\n CPTask48.holdback = BigDecimal.ZERO;\n CPTask48.completedMilestones.clear();\n CPTask48.grantState = \"ACTIVE\";\n CPTask48.disbursementLog.clear();\n","category":"code_purpose_understanding"} {"id":"49","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask49 {\n // Draft pick trading rules:\n // 1. Pick values: Round 1 = $5M, Round 2 = $3M, Round 3 = $1.5M, Round 4+ = $0.5M\n // 2. Each team has a salary cap space. Acquiring picks consumes cap space by pick value.\n // 3. Trade balance rule: total value given must be \u003e= 80% of total value received\n // (no \"robbery\" trades — prevents giving R4 picks for R1 picks)\n // 4. If acquiring team\u0027s cap space \u003c total value of picks received, trade is \"CAP_EXCEEDED\"\n // 5. Successful trade: move picks between teams, deduct/add cap space, log trade\n // 6. Trade log: \"TRADE:\u003cteamA\u003e-\u003e\u003cteamB\u003e:gave=[picks]:got=[picks]:netValue=$\u003cdiff\u003e\"\n\n static Map\u003cString, List\u003cInteger\u003e\u003e teamPicks = new HashMap\u003c\u003e();\n static Map\u003cString, BigDecimal\u003e capSpace = new HashMap\u003c\u003e();\n static List\u003cString\u003e tradeLog = new ArrayList\u003c\u003e();\n\n static BigDecimal pickValue(int round) {\n if (round == 1) return new BigDecimal(\"5000000\");\n if (round == 2) return new BigDecimal(\"3000000\");\n if (round == 3) return new BigDecimal(\"1500000\");\n return new BigDecimal(\"500000\");\n }\n\n static BigDecimal totalValue(List\u003cInteger\u003e rounds) {\n BigDecimal v = BigDecimal.ZERO;\n for (int r : rounds) v = v.add(pickValue(r));\n return v;\n }\n\n // teamA gives pickRoundsGiven, receives pickRoundsReceived from teamB\n // Rules: trade balance (given \u003e= 80% received), cap space check, pick existence\n static String executeTrade(String teamA, List\u003cInteger\u003e pickRoundsGiven,\n String teamB, List\u003cInteger\u003e pickRoundsReceived) {\n","golden_completion":" BigDecimal givenVal = totalValue(pickRoundsGiven);\n BigDecimal recvVal = totalValue(pickRoundsReceived);\n if (givenVal.compareTo(recvVal.multiply(new BigDecimal(\"0.80\"))) \u003c 0) return \"TRADE_IMBALANCED\";\n if (capSpace.get(teamA).compareTo(recvVal) \u003c 0) return \"CAP_EXCEEDED\";\n List\u003cInteger\u003e aPicks = new ArrayList\u003c\u003e(teamPicks.get(teamA));\n List\u003cInteger\u003e bPicks = new ArrayList\u003c\u003e(teamPicks.get(teamB));\n for (int r : pickRoundsGiven) { if (!aPicks.remove(Integer.valueOf(r))) return \"PICK_NOT_FOUND\"; }\n for (int r : pickRoundsReceived) { if (!bPicks.remove(Integer.valueOf(r))) return \"PICK_NOT_FOUND\"; }\n for (int r : pickRoundsReceived) aPicks.add(r);\n for (int r : pickRoundsGiven) bPicks.add(r);\n teamPicks.put(teamA, aPicks);\n teamPicks.put(teamB, bPicks);\n capSpace.put(teamA, capSpace.get(teamA).subtract(recvVal).add(givenVal));\n capSpace.put(teamB, capSpace.get(teamB).subtract(givenVal).add(recvVal));\n tradeLog.add(\"TRADE:\" + teamA + \"-\u003e\" + teamB + \":gave=\" + pickRoundsGiven + \":got=\" + pickRoundsReceived + \":netValue=$\" + recvVal.subtract(givenVal));\n return \"TRADE_COMPLETED\";\n","suffix":" }\n\n public static void main(String[] args) {\n teamPicks.put(\"Eagles\", new ArrayList\u003c\u003e(List.of(1, 3, 4)));\n teamPicks.put(\"Bears\", new ArrayList\u003c\u003e(List.of(2, 2, 4)));\n capSpace.put(\"Eagles\", new BigDecimal(\"10000000\"));\n capSpace.put(\"Bears\", new BigDecimal(\"8000000\"));\n\n // Eagles give R3+R4 ($2M), get R2 ($3M) — balance: 2M/3M = 66.7% \u003c 80% → IMBALANCED\n String r1 = executeTrade(\"Eagles\", List.of(3, 4), \"Bears\", List.of(2));\n assert r1.equals(\"TRADE_IMBALANCED\") : r1;\n\n // Eagles give R1 ($5M), get R2+R2 ($6M) — balance: 5M/6M = 83.3% \u003e= 80% → OK\n String r2 = executeTrade(\"Eagles\", List.of(1), \"Bears\", List.of(2, 2));\n assert r2.equals(\"TRADE_COMPLETED\") : r2;\n assert teamPicks.get(\"Eagles\").containsAll(List.of(2, 2, 3, 4));\n }\n}\n","assertions":" // Self-contained: reset state\n CPTask49.teamPicks.clear();\n CPTask49.capSpace.clear();\n CPTask49.tradeLog.clear();\n\n CPTask49.teamPicks.put(\"Lions\", new ArrayList\u003c\u003e(List.of(1, 2, 3)));\n CPTask49.teamPicks.put(\"Hawks\", new ArrayList\u003c\u003e(List.of(1, 4, 4)));\n CPTask49.capSpace.put(\"Lions\", new BigDecimal(\"10000000\"));\n CPTask49.capSpace.put(\"Hawks\", new BigDecimal(\"6000000\"));\n\n // Lions give R1($5M), get R1($5M) — even trade, balance=100% → OK\n String r3 = CPTask49.executeTrade(\"Lions\", List.of(1), \"Hawks\", List.of(1));\n assert r3.equals(\"TRADE_COMPLETED\") : \"Even trade: \" + r3;\n\n // Cap should be unchanged (5M out, 5M in)\n assert CPTask49.capSpace.get(\"Lions\").compareTo(new BigDecimal(\"10000000\")) == 0 : \"Lions cap unchanged\";\n\n // Hawks try to get Lions\u0027 R2($3M), give R4+R4($1M) — 1/3=33% \u003c 80% → IMBALANCED\n String r4 = CPTask49.executeTrade(\"Hawks\", List.of(4, 4), \"Lions\", List.of(2));\n assert r4.equals(\"TRADE_IMBALANCED\") : \"Imbalanced: \" + r4;\n\n // Set Hawks cap to $1M — try to get R2($3M) with R1($5M) — balance OK but cap $1M \u003c $3M\n CPTask49.capSpace.put(\"Hawks\", new BigDecimal(\"1000000\"));\n String r5 = CPTask49.executeTrade(\"Hawks\", List.of(1), \"Lions\", List.of(2));\n assert r5.equals(\"CAP_EXCEEDED\") : \"Cap check: \" + r5;\n\n // Trade for non-existent pick\n CPTask49.capSpace.put(\"Hawks\", new BigDecimal(\"10000000\"));\n String r6 = CPTask49.executeTrade(\"Lions\", List.of(1), \"Hawks\", List.of(2));\n // Lions traded away R1 earlier, only has [2, 3, 1(from Hawks)]\n // Hawks has [4, 4] (gave away R1), no R2 → PICK_NOT_FOUND\n assert r6.equals(\"PICK_NOT_FOUND\") : \"Missing pick: \" + r6;\n\n // Trade log should have exactly 1 completed trade\n assert CPTask49.tradeLog.size() == 1 : \"Trade log: \" + CPTask49.tradeLog.size();\n\n // Reset for main\n CPTask49.teamPicks.clear();\n CPTask49.capSpace.clear();\n CPTask49.tradeLog.clear();\n","category":"code_purpose_understanding"} {"id":"50","testsource":"devbench-code-purpose-understanding","language":"java","prefix":"import java.math.BigDecimal;\nimport java.math.RoundingMode;\nimport java.util.*;\n\npublic class CPTask50 {\n // Player contract rules:\n // 1. Base salary: paid each season via recordSeason()\n // 2. Performance bonuses (tiered):\n // - 10+ goals: $100K bonus\n // - 20+ goals: additional $200K (total $300K with tier 1)\n // - 30+ goals: additional $500K (total $800K with tiers 1+2)\n // 3. Total bonus cap per season: $600K (so 30+ goals gets $600K, not $800K)\n // 4. Injury clause: if gamesPlayed \u003c 10, no bonus regardless of goals (player was injured)\n // BUT base salary is still paid at 50% (injury deduction)\n // 5. Vesting: first 2 seasons are \"probation\" — bonuses are held in escrow,\n // released only when season 3 starts (vesting event). If player leaves before\n // season 3, escrowed bonuses are forfeited.\n\n static BigDecimal baseSalary = new BigDecimal(\"2000000.00\"); // $2M\n static int currentSeason = 0;\n static BigDecimal totalPaid = BigDecimal.ZERO;\n static BigDecimal escrow = BigDecimal.ZERO;\n static boolean vested = false;\n static List\u003cString\u003e payLog = new ArrayList\u003c\u003e();\n static final BigDecimal BONUS_CAP = new BigDecimal(\"600000\");\n\n // Calculate raw tiered bonus (before cap): 10+=100K, 20+=+200K, 30+=+500K\n static BigDecimal rawBonus(int goals) {\n BigDecimal b = BigDecimal.ZERO;\n if (goals \u003e= 10) b = b.add(new BigDecimal(\"100000\"));\n if (goals \u003e= 20) b = b.add(new BigDecimal(\"200000\"));\n if (goals \u003e= 30) b = b.add(new BigDecimal(\"500000\"));\n return b.compareTo(BONUS_CAP) \u003e 0 ? BONUS_CAP : b;\n }\n\n static String recordSeason(int goals, int gamesPlayed) {\n","golden_completion":" currentSeason++;\n BigDecimal salary, bonus = BigDecimal.ZERO;\n if (gamesPlayed \u003c 10) {\n salary = baseSalary.multiply(new BigDecimal(\"0.50\"));\n payLog.add(\"SEASON:\" + currentSeason + \":salary=$\" + salary.setScale(2, RoundingMode.HALF_UP) + \":bonus=$0.00:injury=true\");\n } else {\n salary = baseSalary;\n bonus = rawBonus(goals);\n if (currentSeason \u003c= 2 \u0026\u0026 !vested) {\n escrow = escrow.add(bonus);\n payLog.add(\"SEASON:\" + currentSeason + \":salary=$\" + salary.setScale(2, RoundingMode.HALF_UP) + \":bonus=$\" + bonus.setScale(2, RoundingMode.HALF_UP) + \":escrowed=true\");\n bonus = BigDecimal.ZERO;\n } else {\n if (!vested \u0026\u0026 currentSeason == 3) { vested = true; bonus = bonus.add(escrow); escrow = BigDecimal.ZERO; }\n payLog.add(\"SEASON:\" + currentSeason + \":salary=$\" + salary.setScale(2, RoundingMode.HALF_UP) + \":bonus=$\" + bonus.setScale(2, RoundingMode.HALF_UP) + \":escrowed=false\");\n }\n }\n totalPaid = totalPaid.add(salary).add(bonus);\n return \"SEASON_\" + currentSeason + \"_COMPLETE\";\n","suffix":" }\n\n public static void main(String[] args) {\n // Season 1: 15 goals, 30 games — $100K bonus but escrowed\n recordSeason(15, 30);\n // Paid: $2M salary only (bonus escrowed)\n assert totalPaid.compareTo(new BigDecimal(\"2000000.00\")) == 0 : \"S1 paid: \" + totalPaid;\n assert escrow.compareTo(new BigDecimal(\"100000.00\")) == 0 : \"S1 escrow: \" + escrow;\n\n // Season 2: 25 goals, 35 games — $300K bonus but escrowed\n recordSeason(25, 35);\n assert totalPaid.compareTo(new BigDecimal(\"4000000.00\")) == 0 : \"S2 paid: \" + totalPaid;\n assert escrow.compareTo(new BigDecimal(\"400000.00\")) == 0 : \"S2 escrow: \" + escrow;\n\n // Season 3: 22 goals, 38 games — $300K bonus + escrow release ($400K) = $700K paid\n recordSeason(22, 38);\n assert vested : \"Should be vested after season 3\";\n // S3: 2M + 300K + 400K escrow = 2.7M; total = 4M + 2.7M = 6.7M\n assert totalPaid.compareTo(new BigDecimal(\"6700000.00\")) == 0 : \"S3 total: \" + totalPaid;\n }\n}\n","assertions":" // Self-contained: reset all state\n CPTask50.baseSalary = new BigDecimal(\"2000000.00\");\n CPTask50.currentSeason = 0;\n CPTask50.totalPaid = BigDecimal.ZERO;\n CPTask50.escrow = BigDecimal.ZERO;\n CPTask50.vested = false;\n CPTask50.payLog.clear();\n\n // S1: 15 goals, 30 games → $100K escrowed\n CPTask50.recordSeason(15, 30);\n assert CPTask50.totalPaid.compareTo(new BigDecimal(\"2000000.00\")) == 0 : \"A-S1: \" + CPTask50.totalPaid;\n\n // S2: 25 goals, 35 games → $300K escrowed (total escrow $400K)\n CPTask50.recordSeason(25, 35);\n assert CPTask50.escrow.compareTo(new BigDecimal(\"400000.00\")) == 0 : \"A-S2 escrow: \" + CPTask50.escrow;\n\n // S3: 22 goals, 38 games → $300K + $400K escrow = $700K bonus, vesting event\n CPTask50.recordSeason(22, 38);\n assert CPTask50.vested : \"Should be vested\";\n assert CPTask50.totalPaid.compareTo(new BigDecimal(\"6700000.00\")) == 0 : \"A-S3: \" + CPTask50.totalPaid;\n\n // S4: 35 goals, 40 games → 30+ goals = 100+200+500=$800K → capped at $600K\n CPTask50.recordSeason(35, 40);\n // S4: 2M + 600K = 2.6M; total = 6.7M + 2.6M = 9.3M\n assert CPTask50.totalPaid.compareTo(new BigDecimal(\"9300000.00\")) == 0 : \"A-S4: \" + CPTask50.totalPaid;\n\n // S5: 5 goals, 8 games → injury: 50% salary = $1M, no bonus\n CPTask50.recordSeason(5, 8);\n assert CPTask50.totalPaid.compareTo(new BigDecimal(\"10300000.00\")) == 0 : \"A-S5: \" + CPTask50.totalPaid;\n\n // Verify injury log\n String injuryLog = CPTask50.payLog.stream().filter(s -\u003e s.contains(\"injury=true\")).findFirst().orElse(\"\");\n assert !injuryLog.isEmpty() : \"Should have injury log\";\n assert injuryLog.contains(\"salary=$1000000.00\") : \"Injury salary: \" + injuryLog;\n\n // S6: exactly 10 goals, 20 games → $100K bonus, no escrow\n CPTask50.recordSeason(10, 20);\n assert CPTask50.totalPaid.compareTo(new BigDecimal(\"12400000.00\")) == 0 : \"A-S6: \" + CPTask50.totalPaid;\n\n // Escrow should be zero\n assert CPTask50.escrow.compareTo(BigDecimal.ZERO) == 0 : \"Escrow: \" + CPTask50.escrow;\n assert CPTask50.payLog.size() == 6 : \"Log size: \" + CPTask50.payLog.size();\n\n // Reset for main\n CPTask50.baseSalary = new BigDecimal(\"2000000.00\");\n CPTask50.currentSeason = 0;\n CPTask50.totalPaid = BigDecimal.ZERO;\n CPTask50.escrow = BigDecimal.ZERO;\n CPTask50.vested = false;\n CPTask50.payLog.clear();\n","category":"code_purpose_understanding"} {"id":"1","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask1 {\n\n public static void sortByLength(List\u003cString\u003e words) {\n Collections.sort(words, Comparator.comparingInt(String::length));\n }\n\n","golden_completion":" public static String describeSortByLength() {\n return \"Sorts the list of strings in place by length using Collections.sort, \" +\n \"which guarantees a stable sort so that strings of equal length retain \" +\n \"their original relative order. Mutates the input list rather than \" +\n \"returning a new copy.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e w = new ArrayList\u003c\u003e(Arrays.asList(\"bb\", \"a\", \"cc\", \"dd\"));\n sortByLength(w);\n assert w.get(0).equals(\"a\") : \"first should be shortest\";\n assert w.get(1).equals(\"bb\") : \"stable order among length-2\";\n\n String doc = describeSortByLength();\n assert doc != null \u0026\u0026 doc.length() \u003e 10;\n System.out.println(\"Task 1 visible tests passed\");\n }\n}\n","assertions":"String d1 = C2NTask1.describeSortByLength().toLowerCase();\nassert d1.contains(\"stable\") : \"must mention stable sort guarantee\";\nassert d1.contains(\"in place\") || d1.contains(\"mutate\") || d1.contains(\"mutates\") : \"must mention in-place mutation\";\nassert d1.contains(\"relative\") || d1.contains(\"original order\") || d1.contains(\"retain\") : \"must explain what stability means\";\n","category":"code2NL_NL2code"} {"id":"2","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask2 {\n\n public static List\u003cInteger\u003e middleSlice(List\u003cInteger\u003e list) {\n int size = list.size();\n if (size \u003c 2) return list.subList(0, size);\n int from = size / 4;\n int to = size - size / 4;\n return list.subList(from, to);\n }\n\n","golden_completion":" public static String describeMiddleSlice() {\n return \"Returns a live view of the middle portion of the list via List.subList. \" +\n \"The returned list is backed by the original list, so structural \" +\n \"modifications to the returned view (such as set or remove) are \" +\n \"reflected in the original list, and vice versa. Throws \" +\n \"ConcurrentModificationException if the backing list is structurally \" +\n \"modified outside the view.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cInteger\u003e data = new ArrayList\u003c\u003e(Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8));\n List\u003cInteger\u003e mid = middleSlice(data);\n assert mid.size() == 4 : \"middle of 8 should be 4 elements\";\n assert mid.get(0) == 3 : \"should start at index 2\";\n\n String doc = describeMiddleSlice();\n assert doc != null \u0026\u0026 doc.length() \u003e 10;\n System.out.println(\"Task 2 visible tests passed\");\n }\n}\n","assertions":"String d2 = C2NTask2.describeMiddleSlice().toLowerCase();\nassert d2.contains(\"live view\") || d2.contains(\"backed by\") || d2.contains(\"view\") : \"must mention live view/backed semantics\";\nassert d2.contains(\"original\") || d2.contains(\"backing\") : \"must reference original/backing list\";\nassert d2.contains(\"reflected\") || d2.contains(\"propagat\") || d2.contains(\"affect\") || d2.contains(\"modification\") : \"must explain bidirectional modification\";\nassert d2.contains(\"concurrentmodificationexception\") || d2.contains(\"concurrent modification\") : \"must mention ConcurrentModificationException\";\n","category":"code2NL_NL2code"} {"id":"3","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask3 {\n\n public static void mergeInventory(Map\u003cString, Integer\u003e inventory, String item, int delta) {\n inventory.merge(item, delta, (oldVal, newVal) -\u003e {\n int result = oldVal + newVal;\n return result \u003c= 0 ? null : result;\n });\n }\n\n","golden_completion":" public static String describeMergeInventory() {\n return \"Merges a quantity delta into the inventory map using Map.merge. \" +\n \"If the item is absent, inserts it with the delta value. If present, \" +\n \"adds delta to the existing quantity. When the resulting sum is zero \" +\n \"or negative, the remapping function returns null, which causes \" +\n \"Map.merge to remove the entry entirely from the map rather than \" +\n \"storing a non-positive value.\";\n }\n","suffix":"\n public static void main(String[] args) {\n Map\u003cString, Integer\u003e inv = new HashMap\u003c\u003e();\n mergeInventory(inv, \"apple\", 5);\n assert inv.get(\"apple\") == 5;\n mergeInventory(inv, \"apple\", 3);\n assert inv.get(\"apple\") == 8;\n mergeInventory(inv, \"apple\", -8);\n assert !inv.containsKey(\"apple\") : \"should be removed when zero\";\n\n String doc = describeMergeInventory();\n assert doc != null \u0026\u0026 doc.length() \u003e 10;\n System.out.println(\"Task 3 visible tests passed\");\n }\n}\n","assertions":"String d3 = C2NTask3.describeMergeInventory().toLowerCase();\nassert d3.contains(\"null\") : \"must mention null return from remapping function\";\nassert d3.contains(\"remove\") || d3.contains(\"deleted\") || d3.contains(\"drops\") : \"must state that null causes removal\";\nassert d3.contains(\"absent\") || d3.contains(\"not present\") || d3.contains(\"missing\") || d3.contains(\"new\") : \"must describe absent-key behavior (insert)\";\nassert d3.contains(\"merge\") : \"must reference Map.merge\";\n","category":"code2NL_NL2code"} {"id":"4","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class C2NTask4 {\n\n public static int sumOfSquares(List\u003cInteger\u003e nums) {\n return nums.stream().reduce(0, (acc, x) -\u003e acc + x * x);\n }\n\n","golden_completion":" public static String describeSumOfSquares() {\n return \"Computes the sum of squares using Stream.reduce with identity \" +\n \"element 0. The identity value must be a true identity for the \" +\n \"accumulator (i.e., 0 + x*x == x*x), which is required for \" +\n \"correctness in parallel streams. Returns 0 for an empty list \" +\n \"since reduce returns the identity when the stream has no elements.\";\n }\n","suffix":"\n public static void main(String[] args) {\n assert sumOfSquares(Arrays.asList(1, 2, 3)) == 14;\n assert sumOfSquares(Collections.emptyList()) == 0;\n\n String doc = describeSumOfSquares();\n assert doc != null \u0026\u0026 doc.length() \u003e 10;\n System.out.println(\"Task 4 visible tests passed\");\n }\n}\n","assertions":"String d4 = C2NTask4.describeSumOfSquares().toLowerCase();\nassert d4.contains(\"identity\") : \"must mention identity element concept\";\nassert d4.contains(\"parallel\") || d4.contains(\"correctness\") : \"must mention parallel stream correctness requirement\";\nassert d4.contains(\"empty\") : \"must describe empty stream behavior\";\nassert d4.contains(\"0\") || d4.contains(\"zero\") : \"must state the identity value is 0\";\n","category":"code2NL_NL2code"} {"id":"5","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask5 {\n\n public static List\u003cString\u003e createSyncList(String... items) {\n List\u003cString\u003e base = new ArrayList\u003c\u003e(Arrays.asList(items));\n return Collections.synchronizedList(base);\n }\n\n public static int safeCount(List\u003cString\u003e syncList) {\n synchronized (syncList) {\n int count = 0;\n for (String s : syncList) {\n if (s != null \u0026\u0026 !s.isEmpty()) count++;\n }\n return count;\n }\n }\n\n","golden_completion":" public static String describeSafeCount() {\n return \"Counts non-null, non-empty strings in a synchronized list. \" +\n \"Must be called with explicit synchronization on the list object \" +\n \"because Collections.synchronizedList does not protect iteration — \" +\n \"iterators are not thread-safe and will throw \" +\n \"ConcurrentModificationException if the list is modified during \" +\n \"traversal without holding the monitor lock on the list itself.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e sl = createSyncList(\"hello\", \"\", null, \"world\");\n assert safeCount(sl) == 2;\n\n String doc = describeSafeCount();\n assert doc != null \u0026\u0026 doc.length() \u003e 10;\n System.out.println(\"Task 5 visible tests passed\");\n }\n}\n","assertions":"String d5 = C2NTask5.describeSafeCount().toLowerCase();\nassert d5.contains(\"synchroniz\") : \"must mention synchronization requirement\";\nassert d5.contains(\"iterator\") || d5.contains(\"iteration\") || d5.contains(\"traversal\") : \"must mention iterator/iteration is not auto-protected\";\nassert d5.contains(\"concurrentmodificationexception\") || d5.contains(\"concurrent modification\") || d5.contains(\"not thread-safe\") || d5.contains(\"monitor\") : \"must mention the exception risk or thread-safety gap\";\nassert d5.contains(\"lock\") || d5.contains(\"monitor\") || d5.contains(\"synchronized\") : \"must mention explicit locking requirement\";\n","category":"code2NL_NL2code"} {"id":"6","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask6 {\n\n private static int callCount = 0;\n\n public static String resolveConfig(String override) {\n callCount = 0;\n return Optional.ofNullable(override)\n .orElseGet(() -\u003e {\n callCount++;\n return \"default_value\";\n });\n }\n\n public static int getCallCount() { return callCount; }\n\n","golden_completion":" public static String describeResolveConfig() {\n return \"Returns the override value if non-null, otherwise lazily computes \" +\n \"a default via Optional.orElseGet. The supplier lambda is only \" +\n \"invoked when the Optional is empty, unlike Optional.orElse which \" +\n \"always evaluates its argument eagerly. The callCount field tracks \" +\n \"whether the supplier was actually invoked.\";\n }\n","suffix":"\n public static void main(String[] args) {\n assert resolveConfig(\"custom\").equals(\"custom\");\n assert getCallCount() == 0 : \"supplier should not be called\";\n assert resolveConfig(null).equals(\"default_value\");\n assert getCallCount() == 1 : \"supplier should be called once\";\n\n String doc = describeResolveConfig();\n assert doc != null \u0026\u0026 doc.length() \u003e 10;\n System.out.println(\"Task 6 visible tests passed\");\n }\n}\n","assertions":"String d6 = C2NTask6.describeResolveConfig().toLowerCase();\nassert d6.contains(\"lazy\") || d6.contains(\"lazily\") : \"must mention lazy evaluation\";\nassert d6.contains(\"orelseget\") || d6.contains(\"or_else_get\") : \"must name the orElseGet method\";\nassert d6.contains(\"orelse\") \u0026\u0026 (d6.contains(\"eager\") || d6.contains(\"always\")) : \"must contrast with orElse eager evaluation\";\nassert d6.contains(\"empty\") || d6.contains(\"absent\") || d6.contains(\"null\") : \"must describe when supplier is invoked\";\n","category":"code2NL_NL2code"} {"id":"7","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"public class C2NTask7 {\n\n public static boolean fastEquals(String a, String b) {\n return a.intern() == b.intern();\n }\n\n public static String canonicalize(String s) {\n return s.intern();\n }\n\n","golden_completion":" public static String describeFastEquals() {\n return \"Compares two strings by reference identity (==) after interning \" +\n \"both via String.intern(). intern() returns the canonical instance \" +\n \"from the JVM string pool, guaranteeing that two strings with the \" +\n \"same character content share the same reference. This avoids \" +\n \"character-by-character comparison but relies on the string pool, \" +\n \"which has memory implications since interned strings are not \" +\n \"garbage-collected until the pool is cleared.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String a = new String(\"hello\");\n String b = new String(\"hello\");\n assert !(a == b) : \"new String creates distinct objects\";\n assert fastEquals(a, b) : \"intern makes them reference-equal\";\n assert canonicalize(a) == canonicalize(b);\n\n String doc = describeFastEquals();\n assert doc != null \u0026\u0026 doc.length() \u003e 10;\n System.out.println(\"Task 7 visible tests passed\");\n }\n}\n","assertions":"String d7 = C2NTask7.describeFastEquals().toLowerCase();\nassert d7.contains(\"intern\") : \"must mention String.intern()\";\nassert d7.contains(\"pool\") || d7.contains(\"canonical\") : \"must mention string pool or canonical reference\";\nassert d7.contains(\"reference\") || d7.contains(\"identity\") : \"must explain reference/identity comparison\";\nassert d7.contains(\"==\") || d7.contains(\"identity\") : \"must mention == operator\";\nassert d7.contains(\"memory\") || d7.contains(\"garbage\") || d7.contains(\"gc\") : \"must mention memory implication\";\n","category":"code2NL_NL2code"} {"id":"8","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask8 {\n\n // Returns a new list containing the elements of the input list\n // sorted in ascending natural order. The original input list\n // must NOT be modified. Returns an empty list if input is empty.\n public static \u003cT extends Comparable\u003cT\u003e\u003e List\u003cT\u003e sortedCopy(List\u003cT\u003e input) {\n","golden_completion":" List\u003cT\u003e copy = new ArrayList\u003c\u003e(input);\n Collections.sort(copy);\n return copy;\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cInteger\u003e orig = new ArrayList\u003c\u003e(Arrays.asList(3, 1, 2));\n List\u003cInteger\u003e sorted = sortedCopy(orig);\n assert sorted.equals(Arrays.asList(1, 2, 3));\n assert orig.equals(Arrays.asList(3, 1, 2)) : \"original must be unchanged\";\n assert sortedCopy(new ArrayList\u003cInteger\u003e()).isEmpty();\n System.out.println(\"Task 8 visible tests passed\");\n }\n}\n","assertions":"List\u003cString\u003e orig8 = new ArrayList\u003c\u003e(java.util.Arrays.asList(\"c\", \"a\", \"b\"));\nList\u003cString\u003e sorted8 = C2NTask8.sortedCopy(orig8);\nassert sorted8.equals(java.util.Arrays.asList(\"a\", \"b\", \"c\")) : \"must be sorted\";\nassert orig8.equals(java.util.Arrays.asList(\"c\", \"a\", \"b\")) : \"original must be unmodified\";\nassert sorted8 != orig8 : \"must return a different list object\";\nList\u003cInteger\u003e empty8 = C2NTask8.sortedCopy(new ArrayList\u003cInteger\u003e());\nassert empty8.isEmpty() : \"empty input yields empty output\";\n","category":"code2NL_NL2code"} {"id":"9","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.concurrent.atomic.AtomicInteger;\n\npublic class C2NTask9 {\n\n private static final AtomicInteger counter = new AtomicInteger(0);\n\n // Atomically increments the counter by one and returns the\n // value that the counter held BEFORE the increment (the previous value).\n // This must be a single atomic operation, not a read-then-increment.\n public static int getAndBump() {\n","golden_completion":" return counter.getAndIncrement();\n }\n","suffix":"\n public static void main(String[] args) {\n counter.set(0);\n int first = getAndBump();\n assert first == 0 : \"should return previous value (0)\";\n int second = getAndBump();\n assert second == 1 : \"should return previous value (1)\";\n assert counter.get() == 2 : \"counter should now be 2\";\n System.out.println(\"Task 9 visible tests passed\");\n }\n}\n","assertions":"try {\nC2NTask9 inst9 = new C2NTask9();\njava.lang.reflect.Field f9 = C2NTask9.class.getDeclaredField(\"counter\");\nf9.setAccessible(true);\nAtomicInteger ctr9 = (AtomicInteger) f9.get(null);\nctr9.set(42);\nint prev9 = C2NTask9.getAndBump();\nassert prev9 == 42 : \"must return the value BEFORE increment, got \" + prev9;\nassert ctr9.get() == 43 : \"counter must be incremented to 43\";\nint prev9b = C2NTask9.getAndBump();\nassert prev9b == 43 : \"second call must return 43\";\nassert ctr9.get() == 44 : \"counter must be 44 after two bumps\";\n\n} catch (Exception e) { throw new RuntimeException(e); }","category":"code2NL_NL2code"} {"id":"10","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask10 {\n\n // Removes duplicate strings from the input list using case-insensitive\n // comparison (e.g., \"Hello\" and \"hello\" are considered duplicates).\n // Preserves the FIRST occurrence of each string and maintains the\n // original order. The original casing of the first occurrence is kept.\n // Returns a new list; the input list is not modified.\n public static List\u003cString\u003e dedupIgnoreCase(List\u003cString\u003e input) {\n","golden_completion":" Set\u003cString\u003e seen = new LinkedHashSet\u003c\u003e();\n List\u003cString\u003e result = new ArrayList\u003c\u003e();\n for (String s : input) {\n if (seen.add(s.toLowerCase())) {\n result.add(s);\n }\n }\n return result;\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e input = Arrays.asList(\"Hello\", \"world\", \"hello\", \"WORLD\", \"foo\");\n List\u003cString\u003e out = dedupIgnoreCase(input);\n assert out.equals(Arrays.asList(\"Hello\", \"world\", \"foo\")) : \"got: \" + out;\n assert input.size() == 5 : \"original must not be modified\";\n System.out.println(\"Task 10 visible tests passed\");\n }\n}\n","assertions":"List\u003cString\u003e in10 = new ArrayList\u003c\u003e(java.util.Arrays.asList(\"ABC\", \"abc\", \"Abc\", \"DEF\", \"def\"));\nList\u003cString\u003e out10 = C2NTask10.dedupIgnoreCase(in10);\nassert out10.equals(java.util.Arrays.asList(\"ABC\", \"DEF\")) : \"must keep first occurrence: \" + out10;\nassert in10.size() == 5 : \"input must not be modified\";\nList\u003cString\u003e empty10 = C2NTask10.dedupIgnoreCase(new ArrayList\u003c\u003e());\nassert empty10.isEmpty() : \"empty input must yield empty output\";\nList\u003cString\u003e single10 = C2NTask10.dedupIgnoreCase(java.util.Arrays.asList(\"Test\"));\nassert single10.equals(java.util.Arrays.asList(\"Test\")) : \"single element preserved\";\nList\u003cString\u003e allSame10 = C2NTask10.dedupIgnoreCase(java.util.Arrays.asList(\"x\", \"X\", \"x\"));\nassert allSame10.size() == 1 \u0026\u0026 allSame10.get(0).equals(\"x\") : \"keep first of all-same\";\n","category":"code2NL_NL2code"} {"id":"11","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask11 {\n\n public static List\u003cString\u003e wrapAsModifiableView(String[] items) {\n","golden_completion":" // completion is description\n return null; // placeholder\n }\n\n public static String describeWrapAsModifiableView() {\n return \"Returns a fixed-size List backed by the given array via Arrays.asList. \"\n + \"Element set() is allowed because it writes through to the backing array, \"\n + \"but add() and remove() throw UnsupportedOperationException. \"\n + \"Modifications to the original array are visible through the returned list.\";\n","suffix":" }\n\n public static void main(String[] args) {\n String[] arr = {\"a\", \"b\", \"c\"};\n List\u003cString\u003e list = Arrays.asList(arr);\n list.set(0, \"x\");\n assert arr[0].equals(\"x\") : \"set writes through to array\";\n boolean threw = false;\n try { list.add(\"d\"); } catch (UnsupportedOperationException e) { threw = true; }\n assert threw : \"add must throw\";\n String desc = describeWrapAsModifiableView();\n assert desc != null;\n System.out.println(\"Task 11 PASS\");\n }\n}\n","assertions":"String d11 = C2NTask11.describeWrapAsModifiableView().toLowerCase();\nassert d11.contains(\"fixed-size\") || d11.contains(\"fixed size\") : \"must mention fixed-size\";\nassert d11.contains(\"arrays.aslist\") || d11.contains(\"aslist\") : \"must mention Arrays.asList\";\nassert d11.contains(\"unsupportedoperationexception\") || d11.contains(\"unsupported operation\") : \"must mention exception\";\nassert d11.contains(\"backing array\") || d11.contains(\"backed by\") || d11.contains(\"write through\") || d11.contains(\"writes through\") : \"must mention backing array\";\n","category":"code2NL_NL2code"} {"id":"12","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask12 {\n\n public static int[] drainInOrder(PriorityQueue\u003cInteger\u003e pq) {\n int[] result = new int[pq.size()];\n for (int i = 0; i \u003c result.length; i++) {\n result[i] = pq.poll();\n }\n return result;\n }\n\n","golden_completion":" public static String describeDrainInOrder() {\n return \"Removes all elements from the PriorityQueue via repeated poll() calls, \"\n + \"returning them in an int array in natural (ascending) sorted order. \"\n + \"Uses poll() rather than iterator because PriorityQueue.iterator() \"\n + \"does NOT guarantee sorted traversal order — only the heap invariant \"\n + \"is maintained, so peek/poll return the minimum but iteration is arbitrary.\";\n }\n","suffix":"\n public static void main(String[] args) {\n PriorityQueue\u003cInteger\u003e pq = new PriorityQueue\u003c\u003e(Arrays.asList(5, 1, 3, 2, 4));\n int[] sorted = drainInOrder(pq);\n assert Arrays.equals(sorted, new int[]{1, 2, 3, 4, 5});\n assert pq.isEmpty();\n String desc = describeDrainInOrder();\n assert desc != null;\n System.out.println(\"Task 12 PASS\");\n }\n}\n","assertions":"String d12 = C2NTask12.describeDrainInOrder().toLowerCase();\nassert d12.contains(\"poll\") : \"must mention poll()\";\nassert d12.contains(\"iterator\") : \"must contrast with iterator\";\nassert d12.contains(\"not\") || d12.contains(\"no \") || d12.contains(\"doesn\u0027t\") || d12.contains(\"does not\") : \"must say iterator does NOT guarantee order\";\nassert d12.contains(\"sorted\") || d12.contains(\"ascending\") || d12.contains(\"natural order\") : \"must mention sorted output\";\n","category":"code2NL_NL2code"} {"id":"13","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.concurrent.ConcurrentHashMap;\n\npublic class C2NTask13 {\n\n private static final ConcurrentHashMap\u003cString, Integer\u003e cache = new ConcurrentHashMap\u003c\u003e();\n\n public static int getOrCompute(String key, int defaultVal) {\n return cache.computeIfAbsent(key, k -\u003e defaultVal);\n }\n\n","golden_completion":" public static String describeGetOrCompute() {\n return \"Retrieves the cached value for key, or atomically computes and stores \"\n + \"defaultVal if the key is absent, using ConcurrentHashMap.computeIfAbsent. \"\n + \"The mapping function is invoked at most once per absent key. \"\n + \"Null values are not permitted — computeIfAbsent throws NullPointerException \"\n + \"if the function returns null. Thread-safe without external synchronization.\";\n }\n","suffix":"\n public static void main(String[] args) {\n cache.clear();\n int v1 = getOrCompute(\"x\", 42);\n int v2 = getOrCompute(\"x\", 99);\n assert v1 == 42;\n assert v2 == 42 : \"second call returns cached value\";\n String desc = describeGetOrCompute();\n assert desc != null;\n System.out.println(\"Task 13 PASS\");\n }\n}\n","assertions":"String d13 = C2NTask13.describeGetOrCompute().toLowerCase();\nassert d13.contains(\"atomic\") : \"must mention atomicity\";\nassert d13.contains(\"computeifabsent\") : \"must mention computeIfAbsent\";\nassert d13.contains(\"at most once\") || d13.contains(\"invoked once\") || d13.contains(\"called once\") : \"must mention function called at most once\";\nassert d13.contains(\"null\") : \"must mention null restriction\";\nassert d13.contains(\"thread-safe\") || d13.contains(\"thread safe\") || d13.contains(\"concurrent\") : \"must mention thread safety\";\n","category":"code2NL_NL2code"} {"id":"14","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"public class C2NTask14 {\n\n public static long roundHalfUp(double value) {\n return Math.round(value);\n }\n\n","golden_completion":" public static String describeRoundHalfUp() {\n return \"Rounds the double value to the nearest long using Math.round, which adds 0.5 \"\n + \"then floors the result (equivalent to (long)Math.floor(value + 0.5d)). \"\n + \"Ties (exactly x.5) always round toward positive infinity, not using \"\n + \"banker\u0027s rounding (round-half-even). For example, 2.5 rounds to 3 \"\n + \"and -0.5 rounds to 0 (toward positive infinity, not toward -1).\";\n }\n","suffix":"\n public static void main(String[] args) {\n assert roundHalfUp(2.5) == 3L;\n assert roundHalfUp(3.5) == 4L;\n assert roundHalfUp(-0.5) == 0L;\n assert roundHalfUp(2.4) == 2L;\n String desc = describeRoundHalfUp();\n assert desc != null;\n System.out.println(\"Task 14 PASS\");\n }\n}\n","assertions":"String d14 = C2NTask14.describeRoundHalfUp().toLowerCase();\nassert d14.contains(\"positive infinity\") || d14.contains(\"round up\") || d14.contains(\"rounds up\") || d14.contains(\"floor\") : \"must mention tie-breaking direction\";\nassert d14.contains(\"0.5\") || d14.contains(\"half\") : \"must mention the 0.5 tie case\";\nassert d14.contains(\"banker\") || d14.contains(\"half-even\") || d14.contains(\"round-half\") : \"must contrast with banker\u0027s rounding\";\nassert d14.contains(\"math.round\") : \"must mention Math.round\";\n","category":"code2NL_NL2code"} {"id":"15","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.regex.*;\nimport java.util.*;\n\npublic class C2NTask15 {\n\n public static Map\u003cString, String\u003e extractNamedGroups(String pattern, String input, String... names) {\n Matcher m = Pattern.compile(pattern).matcher(input);\n Map\u003cString, String\u003e result = new LinkedHashMap\u003c\u003e();\n if (m.find()) {\n for (String name : names) {\n result.put(name, m.group(name));\n }\n }\n return result;\n }\n\n","golden_completion":" public static String describeExtractNamedGroups() {\n return \"Compiles the regex pattern and attempts a single find() on the input. \"\n + \"If a match is found, extracts the specified named capture groups via \"\n + \"Matcher.group(String name) using (?\u003cname\u003e...) syntax and returns them \"\n + \"in a LinkedHashMap preserving insertion order. Returns an empty map if \"\n + \"no match is found. Calling group() without a prior successful find()/match() \"\n + \"would throw IllegalStateException.\";\n }\n","suffix":"\n public static void main(String[] args) {\n Map\u003cString, String\u003e result = extractNamedGroups(\n \"(?\u003cyear\u003e\\\\d{4})-(?\u003cmonth\u003e\\\\d{2})-(?\u003cday\u003e\\\\d{2})\",\n \"2025-01-15\", \"year\", \"month\", \"day\");\n assert result.get(\"year\").equals(\"2025\");\n assert result.get(\"month\").equals(\"01\");\n assert result.get(\"day\").equals(\"15\");\n Map\u003cString, String\u003e noMatch = extractNamedGroups(\"(?\u003cx\u003ezzz)\", \"abc\", \"x\");\n assert noMatch.isEmpty();\n String desc = describeExtractNamedGroups();\n assert desc != null;\n System.out.println(\"Task 15 PASS\");\n }\n}\n","assertions":"String d15 = C2NTask15.describeExtractNamedGroups().toLowerCase();\nassert d15.contains(\"named\") : \"must mention named groups\";\nassert d15.contains(\"linkedhashmap\") || d15.contains(\"insertion order\") || d15.contains(\"preserving order\") : \"must mention LinkedHashMap or insertion order\";\nassert d15.contains(\"illegalstateexception\") || d15.contains(\"illegal state\") : \"must mention IllegalStateException risk\";\nassert d15.contains(\"find()\") || d15.contains(\"find\") : \"must mention find()\";\nassert d15.contains(\"empty map\") || d15.contains(\"empty\") : \"must mention empty map on no match\";\n","category":"code2NL_NL2code"} {"id":"16","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.nio.file.*;\nimport java.io.*;\nimport java.util.*;\nimport java.util.stream.*;\n\npublic class C2NTask16 {\n\n public static List\u003cString\u003e listAllFiles(Path root) throws IOException {\n try (Stream\u003cPath\u003e walk = Files.walk(root)) {\n return walk\n .filter(Files::isRegularFile)\n .map(Path::toString)\n .collect(Collectors.toList());\n }\n }\n\n","golden_completion":" public static String describeListAllFiles() {\n return \"Walks a file tree rooted at root using Files.walk, which performs \"\n + \"depth-first traversal (not breadth-first). Returns a lazy Stream\u003cPath\u003e \"\n + \"that MUST be closed (hence try-with-resources) to release filesystem \"\n + \"handles. By default, does NOT follow symbolic links (no FOLLOW_LINKS \"\n + \"option passed). Filters to regular files only, converts to String paths, \"\n + \"and collects into a List. Throws IOException if the root does not exist.\";\n }\n","suffix":"\n public static void main(String[] args) throws IOException {\n // Create temp dir structure for testing\n Path tmp = Files.createTempDirectory(\"task16\");\n Path sub = Files.createDirectory(tmp.resolve(\"sub\"));\n Files.writeString(tmp.resolve(\"a.txt\"), \"a\");\n Files.writeString(sub.resolve(\"b.txt\"), \"b\");\n List\u003cString\u003e files = listAllFiles(tmp);\n assert files.size() == 2 : \"should find 2 files, found \" + files.size();\n // Cleanup\n Files.deleteIfExists(sub.resolve(\"b.txt\"));\n Files.deleteIfExists(tmp.resolve(\"a.txt\"));\n Files.deleteIfExists(sub);\n Files.deleteIfExists(tmp);\n String desc = describeListAllFiles();\n assert desc != null;\n System.out.println(\"Task 16 PASS\");\n }\n}\n","assertions":"String d16 = C2NTask16.describeListAllFiles().toLowerCase();\nassert d16.contains(\"depth-first\") || d16.contains(\"depth first\") : \"must mention depth-first traversal\";\nassert d16.contains(\"close\") || d16.contains(\"try-with-resources\") || d16.contains(\"try with resources\") : \"must mention Stream must be closed\";\nassert d16.contains(\"symbolic link\") || d16.contains(\"symlink\") || d16.contains(\"follow_links\") : \"must mention symlink behavior\";\nassert d16.contains(\"lazy\") || d16.contains(\"stream\") : \"must mention lazy Stream\";\nassert d16.contains(\"files.walk\") : \"must mention Files.walk\";\n","category":"code2NL_NL2code"} {"id":"17","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask17 {\n\n public static \u003cK, V\u003e LinkedHashMap\u003cK, V\u003e createAccessOrderMap(int capacity) {\n return new LinkedHashMap\u003c\u003e(capacity, 0.75f, true);\n }\n\n public static \u003cK\u003e List\u003cK\u003e keysInOrder(LinkedHashMap\u003cK, ?\u003e map) {\n return new ArrayList\u003c\u003e(map.keySet());\n }\n\n","golden_completion":" public static String describeAccessOrderMap() {\n return \"Creates a LinkedHashMap with accessOrder=true (third constructor parameter). \"\n + \"Unlike the default insertion-order mode, iteration order reflects access \"\n + \"order: both get() and put() of an existing key move that entry to the \"\n + \"end (most-recently-accessed). This enables LRU cache behavior by \"\n + \"overriding removeEldestEntry(). Note: in access-order mode, even \"\n + \"get() is a structural modification, so iterating while calling get() \"\n + \"will throw ConcurrentModificationException.\";\n }\n","suffix":"\n public static void main(String[] args) {\n LinkedHashMap\u003cString, Integer\u003e m = createAccessOrderMap(16);\n m.put(\"a\", 1);\n m.put(\"b\", 2);\n m.put(\"c\", 3);\n m.get(\"a\"); // moves \"a\" to end\n List\u003cString\u003e keys = keysInOrder(m);\n assert keys.equals(Arrays.asList(\"b\", \"c\", \"a\")) : \"access order: \" + keys;\n String desc = describeAccessOrderMap();\n assert desc != null;\n System.out.println(\"Task 17 PASS\");\n }\n}\n","assertions":"String d17 = C2NTask17.describeAccessOrderMap().toLowerCase();\nassert d17.contains(\"access\") \u0026\u0026 d17.contains(\"order\") : \"must mention access-order\";\nassert d17.contains(\"insertion\") : \"must contrast with insertion-order\";\nassert d17.contains(\"get()\") || d17.contains(\"get \") : \"must mention get() affects order\";\nassert d17.contains(\"lru\") || d17.contains(\"removeeldestentry\") || d17.contains(\"eldest\") : \"must mention LRU/removeEldestEntry capability\";\nassert d17.contains(\"concurrentmodificationexception\") || d17.contains(\"structural modification\") : \"must mention CME risk from get() in access-order mode\";\n","category":"code2NL_NL2code"} {"id":"18","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask18 {\n\n /**\n * Deep-copies a Map\u003cString, Object\u003e where values may be:\n * - String (immutable, share reference)\n * - List\u003cObject\u003e (shallow copy via new ArrayList\u003c\u003e; elements are Strings or nested Maps)\n * - Map\u003cString, Object\u003e (recursively deep copy)\n * Any other value type is kept as-is (shared reference).\n * Must return a NEW HashMap — not the same reference.\n */\n public static Map\u003cString, Object\u003e deepCopyMap(Map\u003cString, Object\u003e source) {\n","golden_completion":" Map\u003cString, Object\u003e copy = new HashMap\u003c\u003e();\n for (Map.Entry\u003cString, Object\u003e entry : source.entrySet()) {\n Object val = entry.getValue();\n if (val instanceof Map) {\n @SuppressWarnings(\"unchecked\")\n Map\u003cString, Object\u003e nested = (Map\u003cString, Object\u003e) val;\n copy.put(entry.getKey(), deepCopyMap(nested));\n } else if (val instanceof List) {\n copy.put(entry.getKey(), new ArrayList\u003c\u003e((List\u003c?\u003e) val));\n } else {\n copy.put(entry.getKey(), val);\n }\n }\n return copy;\n","suffix":" }\n\n public static void main(String[] args) {\n Map\u003cString, Object\u003e inner = new HashMap\u003c\u003e();\n inner.put(\"x\", \"hello\");\n Map\u003cString, Object\u003e orig = new HashMap\u003c\u003e();\n orig.put(\"nested\", inner);\n orig.put(\"list\", new ArrayList\u003c\u003e(Arrays.asList(\"a\", \"b\")));\n orig.put(\"plain\", \"world\");\n Map\u003cString, Object\u003e copied = deepCopyMap(orig);\n assert copied != orig;\n assert copied.get(\"nested\") != inner : \"nested map must be a new object\";\n System.out.println(\"Task 18 PASS\");\n }\n}\n","assertions":"Map\u003cString, Object\u003e inner18 = new HashMap\u003c\u003e();\ninner18.put(\"k\", \"v\");\nMap\u003cString, Object\u003e deep18 = new HashMap\u003c\u003e();\ndeep18.put(\"child\", inner18);\ndeep18.put(\"items\", new ArrayList\u003c\u003e(java.util.Arrays.asList(\"a\", \"b\")));\nMap\u003cString, Object\u003e copy18 = C2NTask18.deepCopyMap(deep18);\nassert copy18 != deep18 : \"top-level must be different reference\";\nassert copy18.get(\"child\") != inner18 : \"nested map must be deep copied\";\n// Mutate original nested, copy must be unaffected\ninner18.put(\"k\", \"CHANGED\");\nassert ((Map\u003c?,?\u003e)copy18.get(\"child\")).get(\"k\").equals(\"v\") : \"copy must be independent\";\n// List should be shallow-copied (new ArrayList)\nassert copy18.get(\"items\") != deep18.get(\"items\") : \"list must be different reference\";\n","category":"code2NL_NL2code"} {"id":"19","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"public class C2NTask19 {\n\n /**\n * Thread-safe lazy singleton using double-checked locking.\n * The instance field MUST be declared volatile to prevent\n * instruction reordering. The getInstance() method must:\n * 1. Check if instance is null without synchronization (fast path)\n * 2. If null, synchronize on the class object\n * 3. Check again inside the synchronized block (double-check)\n * 4. Create instance only if still null\n * The constructor is private and sets initialized=true.\n */\n private static volatile C2NTask19 instance;\n private final boolean initialized;\n\n private C2NTask19() {\n this.initialized = true;\n }\n\n public boolean isInitialized() { return initialized; }\n\n public static C2NTask19 getInstance() {\n","golden_completion":" if (instance == null) {\n synchronized (C2NTask19.class) {\n if (instance == null) {\n instance = new C2NTask19();\n }\n }\n }\n return instance;\n","suffix":" }\n\n public static void main(String[] args) {\n C2NTask19 s1 = C2NTask19.getInstance();\n C2NTask19 s2 = C2NTask19.getInstance();\n assert s1 == s2 : \"must be same instance\";\n assert s1.isInitialized() : \"must be initialized\";\n System.out.println(\"Task 19 PASS\");\n }\n}\n","assertions":"C2NTask19 a19 = C2NTask19.getInstance();\nC2NTask19 b19 = C2NTask19.getInstance();\nassert a19 == b19 : \"singleton identity\";\nassert a19.isInitialized();\n// Verify via reflection that instance field is volatile\ntry {\n java.lang.reflect.Field f = C2NTask19.class.getDeclaredField(\"instance\");\n assert java.lang.reflect.Modifier.isVolatile(f.getModifiers()) : \"instance must be volatile\";\n} catch (NoSuchFieldException e) {\n assert false : \"instance field must exist\";\n}\n","category":"code2NL_NL2code"} {"id":"20","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask20 {\n\n /**\n * Merge two sorted int arrays into a single sorted int array.\n * STABILITY REQUIREMENT: when elements are equal, the element\n * from \u0027left\u0027 must appear before the element from \u0027right\u0027.\n * Both input arrays are sorted in ascending order.\n * Must handle empty arrays (either or both may be empty).\n * Returns a new array — inputs are not modified.\n */\n public static int[] stableMerge(int[] left, int[] right) {\n","golden_completion":" int[] result = new int[left.length + right.length];\n int i = 0, j = 0, k = 0;\n while (i \u003c left.length \u0026\u0026 j \u003c right.length) {\n if (left[i] \u003c= right[j]) {\n result[k++] = left[i++];\n } else {\n result[k++] = right[j++];\n }\n }\n while (i \u003c left.length) result[k++] = left[i++];\n while (j \u003c right.length) result[k++] = right[j++];\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n int[] a = {1, 3, 5, 7};\n int[] b = {2, 3, 6, 8};\n int[] merged = stableMerge(a, b);\n assert Arrays.equals(merged, new int[]{1, 2, 3, 3, 5, 6, 7, 8}) : Arrays.toString(merged);\n // empty cases\n assert Arrays.equals(stableMerge(new int[]{}, new int[]{1}), new int[]{1});\n assert Arrays.equals(stableMerge(new int[]{2}, new int[]{}), new int[]{2});\n assert Arrays.equals(stableMerge(new int[]{}, new int[]{}), new int[]{});\n System.out.println(\"Task 20 PASS\");\n }\n}\n","assertions":"// Stability: left elements come before right when equal\n// We verify via a parallel tracking array approach\nint[] left20 = {1, 2, 2, 4};\nint[] right20 = {2, 3, 4, 5};\nint[] m20 = C2NTask20.stableMerge(left20, right20);\nassert java.util.Arrays.equals(m20, new int[]{1, 2, 2, 2, 3, 4, 4, 5}) : \"basic merge: \" + java.util.Arrays.toString(m20);\n// Verify inputs not modified\nassert java.util.Arrays.equals(left20, new int[]{1, 2, 2, 4}) : \"left must not be modified\";\nassert java.util.Arrays.equals(right20, new int[]{2, 3, 4, 5}) : \"right must not be modified\";\n// Single element arrays\nassert java.util.Arrays.equals(C2NTask20.stableMerge(new int[]{5}, new int[]{5}), new int[]{5, 5});\n// All same elements\nassert java.util.Arrays.equals(C2NTask20.stableMerge(new int[]{3, 3}, new int[]{3, 3}), new int[]{3, 3, 3, 3});\n","category":"code2NL_NL2code"} {"id":"21","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.BitSet;\n\npublic class C2NTask21 {\n\n public static void bitwiseOrMerge(BitSet target, BitSet source) {\n target.or(source);\n }\n\n","golden_completion":" public static String describeBitwiseOrMerge() {\n return \"Performs a logical OR of target with source using BitSet.or(), \"\n + \"mutating target in place so it contains all bits set in either operand. \"\n + \"The source BitSet is not modified. No new BitSet is created or returned.\";\n }\n","suffix":"\n public static void main(String[] args) {\n BitSet a = new BitSet();\n a.set(0); a.set(2);\n BitSet b = new BitSet();\n b.set(1); b.set(2);\n BitSet bCopy = (BitSet) b.clone();\n bitwiseOrMerge(a, b);\n assert a.get(0) \u0026\u0026 a.get(1) \u0026\u0026 a.get(2) : \"target should have bits 0,1,2\";\n assert b.equals(bCopy) : \"source must not be modified\";\n String desc = describeBitwiseOrMerge();\n assert desc != null \u0026\u0026 !desc.isEmpty();\n System.out.println(\"Task 21 visible tests passed\");\n }\n}\n","assertions":"String d21 = C2NTask21.describeBitwiseOrMerge().toLowerCase();\nassert d21.contains(\"mutat\") || d21.contains(\"in place\") || d21.contains(\"in-place\") : \"must mention mutation\";\nassert d21.contains(\"source\") : \"must mention source\";\nassert d21.contains(\"not modified\") || d21.contains(\"unchanged\") || d21.contains(\"not mutated\") || d21.contains(\"is not\") : \"must state source is unmodified\";\nassert d21.contains(\"bitset.or\") || d21.contains(\"bitset.or()\") || (d21.contains(\"or(\") \u0026\u0026 d21.contains(\"bitset\")) : \"must name the API method\";\n","category":"code2NL_NL2code"} {"id":"22","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"public class C2NTask22 {\n\n public static String removeMiddleSegment(StringBuilder sb, int start, int end) {\n sb.delete(start, end);\n return sb.toString();\n }\n\n","golden_completion":" public static String describeRemoveMiddleSegment() {\n return \"Removes characters from index start (inclusive) to end (exclusive) \"\n + \"using StringBuilder.delete(int, int), which mutates the StringBuilder in place \"\n + \"and shifts all subsequent characters left by (end - start) positions. \"\n + \"Returns the resulting string via toString(). \"\n + \"Throws StringIndexOutOfBoundsException if start is negative or exceeds length.\";\n }\n","suffix":"\n public static void main(String[] args) {\n StringBuilder sb = new StringBuilder(\"Hello World!\");\n String result = removeMiddleSegment(sb, 5, 11);\n assert result.equals(\"Hello!\") : \"Expected Hello! but got \" + result;\n assert sb.toString().equals(\"Hello!\") : \"StringBuilder should be mutated\";\n String desc = describeRemoveMiddleSegment();\n assert desc != null;\n System.out.println(\"Task 22 visible tests passed\");\n }\n}\n","assertions":"String d22 = C2NTask22.describeRemoveMiddleSegment().toLowerCase();\nassert d22.contains(\"inclusive\") : \"must mention start is inclusive\";\nassert d22.contains(\"exclusive\") : \"must mention end is exclusive\";\nassert d22.contains(\"shift\") : \"must mention index shifting\";\nassert d22.contains(\"mutat\") || d22.contains(\"in place\") || d22.contains(\"in-place\") : \"must mention mutation\";\nassert d22.contains(\"stringindexoutofboundsexception\") || d22.contains(\"indexoutofbounds\") || d22.contains(\"throws\") : \"must mention exception\";\n","category":"code2NL_NL2code"} {"id":"23","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.TreeMap;\n\npublic class C2NTask23 {\n\n public static Integer findFloorKey(TreeMap\u003cInteger, String\u003e map, int key) {\n return map.floorKey(key);\n }\n\n","golden_completion":" public static String describeFindFloorKey() {\n return \"Returns the greatest key less than or equal to the given key \"\n + \"using TreeMap.floorKey(), which relies on the map\u0027s natural ordering \"\n + \"or its Comparator. Returns null if no such key exists (i.e., all keys \"\n + \"in the map are strictly greater than the given key, or the map is empty). \"\n + \"Does not remove or modify the map.\";\n }\n","suffix":"\n public static void main(String[] args) {\n TreeMap\u003cInteger, String\u003e map = new TreeMap\u003c\u003e();\n map.put(10, \"ten\"); map.put(20, \"twenty\"); map.put(30, \"thirty\");\n assert findFloorKey(map, 25).equals(20);\n assert findFloorKey(map, 10).equals(10);\n assert findFloorKey(map, 5) == null;\n String desc = describeFindFloorKey();\n assert desc != null;\n System.out.println(\"Task 23 visible tests passed\");\n }\n}\n","assertions":"String d23 = C2NTask23.describeFindFloorKey().toLowerCase();\nassert d23.contains(\"null\") : \"must mention null return\";\nassert d23.contains(\"less than or equal\") || d23.contains(\"\u003c=\") || d23.contains(\"greatest key\") : \"must describe floor semantics\";\nassert d23.contains(\"floorkey\") : \"must name the API method\";\nassert d23.contains(\"empty\") : \"must mention empty map case\";\nassert d23.contains(\"natural ordering\") || d23.contains(\"comparator\") : \"must mention ordering mechanism\";\n","category":"code2NL_NL2code"} {"id":"24","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.EnumSet;\n\npublic class C2NTask24 {\n\n enum Permission { READ, WRITE, EXECUTE, DELETE }\n\n public static EnumSet\u003cPermission\u003e getMissingPermissions(EnumSet\u003cPermission\u003e granted) {\n return EnumSet.complementOf(granted);\n }\n\n","golden_completion":" public static String describeGetMissingPermissions() {\n return \"Returns a new EnumSet containing all Permission constants not present \"\n + \"in the granted set, using EnumSet.complementOf(). The original granted \"\n + \"set is not modified. The returned set is a distinct EnumSet instance. \"\n + \"If granted contains all enum constants, the result is an empty EnumSet. \"\n + \"Throws NullPointerException if granted is null.\";\n }\n","suffix":"\n public static void main(String[] args) {\n EnumSet\u003cPermission\u003e granted = EnumSet.of(Permission.READ, Permission.WRITE);\n EnumSet\u003cPermission\u003e missing = getMissingPermissions(granted);\n assert missing.contains(Permission.EXECUTE) \u0026\u0026 missing.contains(Permission.DELETE);\n assert missing.size() == 2;\n assert granted.size() == 2 : \"original must not change\";\n EnumSet\u003cPermission\u003e all = EnumSet.allOf(Permission.class);\n assert getMissingPermissions(all).isEmpty();\n String desc = describeGetMissingPermissions();\n assert desc != null;\n System.out.println(\"Task 24 visible tests passed\");\n }\n}\n","assertions":"String d24 = C2NTask24.describeGetMissingPermissions().toLowerCase();\nassert d24.contains(\"complementof\") : \"must name the API method\";\nassert d24.contains(\"new\") || d24.contains(\"distinct\") : \"must state a new set is returned\";\nassert d24.contains(\"not modified\") || d24.contains(\"not mutated\") || d24.contains(\"unchanged\") || d24.contains(\"is not\") : \"must state original is unmodified\";\nassert d24.contains(\"empty\") : \"must describe all-constants case yielding empty set\";\nassert d24.contains(\"nullpointerexception\") || d24.contains(\"null\") : \"must mention null handling\";\n","category":"code2NL_NL2code"} {"id":"25","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.regex.Pattern;\nimport java.util.stream.Stream;\nimport java.util.List;\nimport java.util.stream.Collectors;\n\npublic class C2NTask25 {\n\n private static final Pattern COMMA = Pattern.compile(\",\");\n\n public static List\u003cString\u003e splitToList(String input) {\n return COMMA.splitAsStream(input).collect(Collectors.toList());\n }\n\n","golden_completion":" public static String describeSplitToList() {\n return \"Splits the input string by commas using Pattern.splitAsStream(), \"\n + \"which returns a lazy Stream\u003cString\u003e rather than an eager array like \"\n + \"Pattern.split(). The stream is then collected into a List\u003cString\u003e \"\n + \"via Collectors.toList(). Trailing empty strings are not discarded \"\n + \"(unlike split with a limit of 0). An empty input yields a single-element \"\n + \"list containing the empty string.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e result = splitToList(\"a,b,c\");\n assert result.size() == 3 : \"Expected 3 elements\";\n assert result.get(0).equals(\"a\");\n List\u003cString\u003e empty = splitToList(\"\");\n assert empty.size() == 1 \u0026\u0026 empty.get(0).equals(\"\");\n String desc = describeSplitToList();\n assert desc != null;\n System.out.println(\"Task 25 visible tests passed\");\n }\n}\n","assertions":"String d25 = C2NTask25.describeSplitToList().toLowerCase();\nassert d25.contains(\"splitasstream\") : \"must name the API method\";\nassert d25.contains(\"lazy\") || d25.contains(\"stream\") : \"must mention lazy stream\";\nassert d25.contains(\"array\") || d25.contains(\"split()\") || d25.contains(\"pattern.split\") : \"must contrast with eager split\";\nassert d25.contains(\"trailing\") || d25.contains(\"empty string\") : \"must mention trailing empty string behavior\";\nassert d25.contains(\"empty input\") || d25.contains(\"empty string\") : \"must document empty input case\";\n","category":"code2NL_NL2code"} {"id":"26","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.List;\nimport java.util.Arrays;\nimport java.util.stream.Collectors;\n\npublic class C2NTask26 {\n\n public static List\u003cString\u003e filterNonEmpty(List\u003cString\u003e items) {\n return items.stream()\n .filter(s -\u003e s != null \u0026\u0026 !s.isEmpty())\n .collect(Collectors.toUnmodifiableList());\n }\n\n","golden_completion":" public static String describeFilterNonEmpty() {\n return \"Filters out null and empty strings from the input list, returning an \"\n + \"unmodifiable List\u003cString\u003e via Collectors.toUnmodifiableList(). The returned \"\n + \"list rejects null elements — if any null passes the filter, a \"\n + \"NullPointerException is thrown during collection. The returned list does \"\n + \"not support add, set, or remove operations (throws \"\n + \"UnsupportedOperationException). Unlike Collections.unmodifiableList(), \"\n + \"this creates an independent copy, not a wrapper around the original.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e input = Arrays.asList(\"hello\", \"\", null, \"world\", \"\");\n List\u003cString\u003e result = filterNonEmpty(input);\n assert result.size() == 2;\n assert result.get(0).equals(\"hello\") \u0026\u0026 result.get(1).equals(\"world\");\n boolean threw = false;\n try { result.add(\"x\"); } catch (UnsupportedOperationException e) { threw = true; }\n assert threw : \"list must be unmodifiable\";\n String desc = describeFilterNonEmpty();\n assert desc != null;\n System.out.println(\"Task 26 visible tests passed\");\n }\n}\n","assertions":"String d26 = C2NTask26.describeFilterNonEmpty().toLowerCase();\nassert d26.contains(\"tounmodifiablelist\") : \"must name the API method\";\nassert d26.contains(\"null\") : \"must mention null handling\";\nassert d26.contains(\"nullpointerexception\") || (d26.contains(\"null\") \u0026\u0026 d26.contains(\"reject\")) : \"must mention null rejection\";\nassert d26.contains(\"unsupportedoperationexception\") || d26.contains(\"unmodifiable\") : \"must mention unmodifiable behavior\";\nassert d26.contains(\"copy\") || d26.contains(\"independent\") || d26.contains(\"not a wrapper\") : \"must distinguish from Collections.unmodifiableList\";\n","category":"code2NL_NL2code"} {"id":"27","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"public class C2NTask27 {\n\n // Rotate the given int array to the RIGHT by k positions, in-place.\n // If k is larger than the array length, it wraps around\n // (e.g., rotating by length+1 is the same as rotating by 1).\n // An empty or single-element array is unchanged.\n // Uses the reverse-three-times algorithm for O(n) time, O(1) space.\n public static void rotateRight(int[] arr, int k) {\n","golden_completion":" if (arr == null || arr.length \u003c= 1) return;\n k = k % arr.length;\n if (k == 0) return;\n reverse(arr, 0, arr.length - 1);\n reverse(arr, 0, k - 1);\n reverse(arr, k, arr.length - 1);\n }\n private static void reverse(int[] a, int lo, int hi) {\n while (lo \u003c hi) { int t = a[lo]; a[lo] = a[hi]; a[hi] = t; lo++; hi--; }\n","suffix":" }\n\n public static void main(String[] args) {\n int[] a = {1, 2, 3, 4, 5};\n rotateRight(a, 2);\n assert java.util.Arrays.equals(a, new int[]{4, 5, 1, 2, 3});\n int[] b = {1, 2, 3};\n rotateRight(b, 3);\n assert java.util.Arrays.equals(b, new int[]{1, 2, 3});\n System.out.println(\"Task 27 visible tests passed\");\n }\n}\n","assertions":"int[] c27 = {10, 20, 30, 40};\nC2NTask27.rotateRight(c27, 1);\nassert java.util.Arrays.equals(c27, new int[]{40, 10, 20, 30}) : \"rotate by 1\";\nint[] d27 = {1, 2, 3, 4, 5};\nC2NTask27.rotateRight(d27, 7);\nassert java.util.Arrays.equals(d27, new int[]{4, 5, 1, 2, 3}) : \"k \u003e length wraps\";\nint[] e27 = {};\nC2NTask27.rotateRight(e27, 5);\nassert e27.length == 0 : \"empty array unchanged\";\nint[] f27 = {42};\nC2NTask27.rotateRight(f27, 100);\nassert f27[0] == 42 : \"single element unchanged\";\n","category":"code2NL_NL2code"} {"id":"28","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class C2NTask28 {\n\n // Find the first non-repeating character in the string, treating\n // upper and lower case as the SAME character for counting purposes\n // (e.g., \u0027A\u0027 and \u0027a\u0027 count as the same). However, return the\n // character as it ORIGINALLY appears in the string (preserving case).\n // If no non-repeating character exists, return null.\n public static Character firstUniqueChar(String s) {\n","golden_completion":" if (s == null || s.isEmpty()) return null;\n LinkedHashMap\u003cCharacter, int[]\u003e counts = new LinkedHashMap\u003c\u003e();\n for (int i = 0; i \u003c s.length(); i++) {\n char key = Character.toLowerCase(s.charAt(i));\n if (!counts.containsKey(key)) counts.put(key, new int[]{0, i});\n counts.get(key)[0]++;\n }\n for (var e : counts.entrySet())\n if (e.getValue()[0] == 1) return s.charAt(e.getValue()[1]);\n return null;\n","suffix":" }\n\n public static void main(String[] args) {\n assert firstUniqueChar(\"aAbBcC\") == null : \"all repeat case-insensitively\";\n assert firstUniqueChar(\"aAbBcCd\") != null;\n assert firstUniqueChar(\"aAbBcCd\").equals(\u0027d\u0027);\n assert firstUniqueChar(\"stress\") != null;\n assert firstUniqueChar(\"stress\").equals(\u0027t\u0027);\n System.out.println(\"Task 28 visible tests passed\");\n }\n}\n","assertions":"assert C2NTask28.firstUniqueChar(\"aAbBcC\") == null : \"all repeat case-insensitively\";\nassert C2NTask28.firstUniqueChar(\"AaBbCcD\").equals(\u0027D\u0027) : \"preserve original case\";\nassert C2NTask28.firstUniqueChar(\"xXyZ\").equals(\u0027y\u0027) : \"y is first unique\";\nassert C2NTask28.firstUniqueChar(\"\") == null : \"empty string\";\nassert C2NTask28.firstUniqueChar(null) == null : \"null input\";\nassert C2NTask28.firstUniqueChar(\"abcABC\") == null : \"all repeat\";\n","category":"code2NL_NL2code"} {"id":"29","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.List;\n\npublic class C2NTask29 {\n\n // Flatten a nested list structure (List of Objects, where each element\n // is either a value or another List) to the specified maxDepth.\n // maxDepth=0 means NO flattening: the input list itself is returned as-is.\n // maxDepth=1 means only the top-level lists are expanded.\n // maxDepth\u003c0 means unlimited flattening (fully flat).\n // Preserve insertion order. Non-list elements are kept as-is at any depth.\n @SuppressWarnings(\"unchecked\")\n public static List\u003cObject\u003e flatten(List\u003cObject\u003e input, int maxDepth) {\n","golden_completion":" List\u003cObject\u003e result = new ArrayList\u003c\u003e();\n if (maxDepth == 0) { result.addAll(input); return result; }\n for (Object item : input) {\n if (item instanceof List) {\n result.addAll(flatten((List\u003cObject\u003e) item, maxDepth \u003c 0 ? maxDepth : maxDepth - 1));\n } else { result.add(item); }\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n // depth=1: only top-level lists expanded\n List\u003cObject\u003e nested = List.of(1, List.of(2, List.of(3, 4)), 5);\n List\u003cObject\u003e flat1 = flatten(new ArrayList\u003c\u003e(nested), 1);\n assert flat1.size() == 4 : \"Expected 4 got \" + flat1.size();\n assert flat1.get(0).equals(1);\n assert flat1.get(1).equals(2);\n assert flat1.get(2) instanceof List; // [3,4] not expanded at depth 1\n assert flat1.get(3).equals(5);\n // depth=-1: unlimited\n List\u003cObject\u003e flatAll = flatten(new ArrayList\u003c\u003e(nested), -1);\n assert flatAll.equals(List.of(1, 2, 3, 4, 5));\n System.out.println(\"Task 29 visible tests passed\");\n }\n}\n","assertions":"// depth=0: no flattening\nList\u003cObject\u003e in29 = new ArrayList\u003c\u003e(java.util.List.of(1, java.util.List.of(2, 3)));\nList\u003cObject\u003e r29_0 = C2NTask29.flatten(in29, 0);\nassert r29_0.size() == 2 : \"depth 0 should not flatten: \" + r29_0;\nassert r29_0.get(0).equals(1);\nassert r29_0.get(1) instanceof List;\n// depth=2\nList\u003cObject\u003e deep29 = new ArrayList\u003c\u003e(java.util.List.of(java.util.List.of(java.util.List.of(99))));\nList\u003cObject\u003e r29_2 = C2NTask29.flatten(deep29, 2);\nassert r29_2.equals(java.util.List.of(99)) : \"depth 2 flattens 2 levels: \" + r29_2;\n// empty input\nList\u003cObject\u003e r29_e = C2NTask29.flatten(new ArrayList\u003c\u003e(), 5);\nassert r29_e.isEmpty() : \"empty input yields empty\";\n","category":"code2NL_NL2code"} {"id":"30","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.List;\n\npublic class C2NTask30 {\n\n // Interleave elements from two lists: take one from listA, then one from listB,\n // alternating. If one list is shorter, pad it with null for the remaining positions.\n // Result length is always 2 * max(listA.size(), listB.size()).\n // Example: interleave([1,2,3], [a,b]) -\u003e [1,a,2,b,3,null]\n public static \u003cT\u003e List\u003cT\u003e interleave(List\u003cT\u003e listA, List\u003cT\u003e listB) {\n","golden_completion":" int maxLen = Math.max(listA.size(), listB.size());\n List\u003cT\u003e result = new ArrayList\u003c\u003e(maxLen * 2);\n for (int i = 0; i \u003c maxLen; i++) {\n result.add(i \u003c listA.size() ? listA.get(i) : null);\n result.add(i \u003c listB.size() ? listB.get(i) : null);\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n List\u003cInteger\u003e a = List.of(1, 2, 3);\n List\u003cInteger\u003e b = List.of(10, 20);\n List\u003cInteger\u003e result = interleave(a, b);\n assert result.size() == 6 : \"Expected 6, got \" + result.size();\n assert result.get(0).equals(1);\n assert result.get(1).equals(10);\n assert result.get(2).equals(2);\n assert result.get(3).equals(20);\n assert result.get(4).equals(3);\n assert result.get(5) == null;\n System.out.println(\"Task 30 visible tests passed\");\n }\n}\n","assertions":"// Equal length lists\nList\u003cString\u003e a30 = java.util.List.of(\"x\", \"y\");\nList\u003cString\u003e b30 = java.util.List.of(\"A\", \"B\");\nList\u003cString\u003e r30 = C2NTask30.interleave(a30, b30);\nassert r30.size() == 4 : \"equal length\";\nassert r30.equals(java.util.Arrays.asList(\"x\", \"A\", \"y\", \"B\"));\n// Empty lists\nList\u003cString\u003e r30e = C2NTask30.interleave(new ArrayList\u003c\u003e(), new ArrayList\u003c\u003e());\nassert r30e.isEmpty() : \"both empty\";\n// One empty\nList\u003cString\u003e r30o = C2NTask30.interleave(java.util.List.of(\"a\", \"b\"), new ArrayList\u003c\u003e());\nassert r30o.size() == 4 : \"one empty, result 2*max\";\nassert r30o.get(0).equals(\"a\") \u0026\u0026 r30o.get(1) == null;\nassert r30o.get(2).equals(\"b\") \u0026\u0026 r30o.get(3) == null;\n","category":"code2NL_NL2code"} {"id":"31","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.HashMap;\n\npublic class C2NTask31 {\n\n public static Object putAndReturnPrevious(HashMap\u003cString, Integer\u003e map, String key, Integer value) {\n return map.put(key, value);\n }\n\n","golden_completion":" public static String describePutAndReturnPrevious() {\n return \"Delegates to HashMap.put(key, value) which associates the specified value \" +\n \"with the specified key. Returns the previous value associated with the key, \" +\n \"or null if the key had no prior mapping. Replaces the old value if the key \" +\n \"already exists. The return type is Object because it returns the prior Integer \" +\n \"or null, not the newly inserted value.\";\n }\n","suffix":"\n public static void main(String[] args) {\n HashMap\u003cString, Integer\u003e m = new HashMap\u003c\u003e();\n assert putAndReturnPrevious(m, \"a\", 1) == null;\n assert (int) putAndReturnPrevious(m, \"a\", 2) == 1;\n assert (int) putAndReturnPrevious(m, \"a\", 3) == 2;\n\n String doc = describePutAndReturnPrevious();\n assert doc.toLowerCase().contains(\"previous\") : \"Must mention previous value\";\n assert doc.toLowerCase().contains(\"null\") : \"Must mention null for no prior mapping\";\n }\n}\n","assertions":"\n String d = describePutAndReturnPrevious();\n String dl = d.toLowerCase();\n assert dl.contains(\"previous\") || dl.contains(\"prior\") : \"Must mention returning previous/prior value\";\n assert dl.contains(\"null\") : \"Must mention null when key has no mapping\";\n assert dl.contains(\"replaces\") || dl.contains(\"replace\") || dl.contains(\"overwrit\") : \"Must mention replacement of old value\";\n assert !dl.contains(\"returns the new\") : \"Must NOT say it returns the new value\";\n assert dl.contains(\"old\") || dl.contains(\"prior\") || dl.contains(\"previous\") : \"Must describe the OLD value being returned\";\n","category":"code2NL_NL2code"} {"id":"32","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.Iterator;\nimport java.util.List;\nimport java.util.Arrays;\n\npublic class C2NTask32 {\n\n public static List\u003cString\u003e removeEvens(List\u003cInteger\u003e nums) {\n List\u003cString\u003e removed = new ArrayList\u003c\u003e();\n List\u003cInteger\u003e mutable = new ArrayList\u003c\u003e(nums);\n Iterator\u003cInteger\u003e it = mutable.iterator();\n while (it.hasNext()) {\n Integer n = it.next();\n if (n % 2 == 0) {\n removed.add(String.valueOf(n));\n it.remove();\n }\n }\n return removed;\n }\n\n","golden_completion":" public static String describeRemoveEvens() {\n return \"Filters a list by removing all even integers using Iterator.remove(). \" +\n \"Creates a defensive copy via new ArrayList\u003c\u003e(nums) to avoid modifying the \" +\n \"original list. Collects removed values as Strings before deletion. \" +\n \"Iterator.remove() can only be called once per next() call; calling it \" +\n \"twice without an intervening next() throws IllegalStateException. \" +\n \"Returns the list of removed even-number strings in iteration order.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e result = removeEvens(Arrays.asList(1, 2, 3, 4, 5));\n assert result.equals(Arrays.asList(\"2\", \"4\"));\n\n String doc = describeRemoveEvens();\n assert doc.toLowerCase().contains(\"iterator\") : \"Must mention Iterator\";\n }\n}\n","assertions":"\n String d = describeRemoveEvens();\n String dl = d.toLowerCase();\n assert dl.contains(\"iterator\") : \"Must mention Iterator\";\n assert dl.contains(\"remove\") : \"Must mention remove operation\";\n assert dl.contains(\"copy\") || dl.contains(\"defensive\") || dl.contains(\"new arraylist\") : \"Must mention defensive copy\";\n assert dl.contains(\"once per\") || dl.contains(\"once after\") || dl.contains(\"one call\") || dl.contains(\"once per next\") || dl.contains(\"illegalstateexception\") : \"Must document the once-per-next contract or the exception\";\n assert dl.contains(\"even\") : \"Must mention even number filtering\";\n","category":"code2NL_NL2code"} {"id":"33","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"public class C2NTask33 {\n\n public static int countSegments(String csv) {\n if (csv.isEmpty()) return 0;\n String[] parts = csv.split(\",\", -1);\n return parts.length;\n }\n\n","golden_completion":" public static String describeCountSegments() {\n return \"Counts the number of segments in a comma-delimited string by calling \" +\n \"String.split(regex, -1) with limit=-1 to retain trailing empty strings. \" +\n \"Without the -1 limit, split() discards trailing empty segments — e.g., \" +\n \"\u0027a,,\u0027.split(\u0027,\u0027) yields [\u0027a\u0027,\u0027\u0027] (length 2), but \u0027a,,\u0027.split(\u0027,\u0027,-1) \" +\n \"yields [\u0027a\u0027,\u0027\u0027,\u0027\u0027] (length 3). Returns 0 for an empty input string.\";\n }\n","suffix":"\n public static void main(String[] args) {\n assert countSegments(\"a,b,c\") == 3;\n assert countSegments(\"a,,\") == 3;\n assert countSegments(\"\") == 0;\n assert countSegments(\",\") == 2;\n\n String doc = describeCountSegments();\n assert doc.contains(\"-1\") : \"Must mention the -1 limit\";\n }\n}\n","assertions":"\n String d = describeCountSegments();\n String dl = d.toLowerCase();\n assert d.contains(\"-1\") : \"Must mention the -1 limit parameter\";\n assert dl.contains(\"trailing\") : \"Must explain trailing empty strings\";\n assert dl.contains(\"split\") : \"Must mention String.split\";\n assert dl.contains(\"empty\") : \"Must mention empty strings being retained\";\n assert dl.contains(\"discard\") || dl.contains(\"remov\") || dl.contains(\"strip\") || dl.contains(\"omit\") || dl.contains(\"without\") : \"Must contrast behavior without -1\";\n","category":"code2NL_NL2code"} {"id":"34","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayDeque;\n\npublic class C2NTask34 {\n\n public static String reverseWords(String sentence) {\n ArrayDeque\u003cString\u003e stack = new ArrayDeque\u003c\u003e();\n for (String word : sentence.split(\" \")) {\n stack.push(word);\n }\n StringBuilder sb = new StringBuilder();\n while (!stack.isEmpty()) {\n if (sb.length() \u003e 0) sb.append(\" \");\n sb.append(stack.pop());\n }\n return sb.toString();\n }\n\n","golden_completion":" public static String describeReverseWords() {\n return \"Reverses the order of words in a sentence using an ArrayDeque as a LIFO stack. \" +\n \"ArrayDeque.push() delegates to addFirst() (inserts at head), and pop() delegates \" +\n \"to removeFirst() (removes from head), so the deque operates as a stack at its \" +\n \"head end. Words are split on single spaces. Does not handle multiple spaces or \" +\n \"leading/trailing whitespace — those produce empty-string tokens.\";\n }\n","suffix":"\n public static void main(String[] args) {\n assert reverseWords(\"hello world\").equals(\"world hello\");\n assert reverseWords(\"a b c\").equals(\"c b a\");\n\n String doc = describeReverseWords();\n assert doc.toLowerCase().contains(\"arraydeque\") : \"Must mention ArrayDeque\";\n }\n}\n","assertions":"\n String d = describeReverseWords();\n String dl = d.toLowerCase();\n assert dl.contains(\"arraydeque\") : \"Must mention ArrayDeque\";\n assert dl.contains(\"stack\") || dl.contains(\"lifo\") : \"Must describe LIFO/stack behavior\";\n assert dl.contains(\"addfirst\") || dl.contains(\"head\") : \"Must mention push=addFirst or head-based operation\";\n assert dl.contains(\"removefirst\") || dl.contains(\"head\") : \"Must mention pop=removeFirst or head-based operation\";\n assert dl.contains(\"push\") \u0026\u0026 dl.contains(\"pop\") : \"Must mention push and pop operations\";\n","category":"code2NL_NL2code"} {"id":"35","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\n\npublic class C2NTask35 {\n\n @SuppressWarnings({\"unchecked\",\"rawtypes\"})\n public static List\u003cString\u003e createCheckedStringList() {\n return Collections.checkedList(new ArrayList\u003c\u003e(), String.class);\n }\n\n","golden_completion":" public static String describeCheckedList() {\n return \"Creates a runtime type-safe view of an ArrayList\u003cString\u003e via \" +\n \"Collections.checkedList(list, String.class). The returned wrapper throws \" +\n \"ClassCastException at insertion time if a non-String element is added \" +\n \"through a raw or unchecked reference. This provides runtime enforcement \" +\n \"of generic type safety that erasure normally removes after compilation. \" +\n \"The checked list is a view backed by the original list — mutations are \" +\n \"reflected in both directions.\";\n }\n","suffix":"\n @SuppressWarnings({\"unchecked\",\"rawtypes\"})\n public static void main(String[] args) {\n List\u003cString\u003e cl = createCheckedStringList();\n cl.add(\"hello\");\n assert cl.size() == 1;\n try { ((List)cl).add(42); assert false; } catch (ClassCastException e) { }\n String doc = describeCheckedList();\n assert doc.toLowerCase().contains(\"classcastexception\");\n }\n}\n","assertions":"\n String d = describeCheckedList();\n String dl = d.toLowerCase();\n assert dl.contains(\"classcastexception\") : \"Must mention ClassCastException\";\n assert dl.contains(\"runtime\") : \"Must mention runtime enforcement\";\n assert dl.contains(\"erasure\") || dl.contains(\"generic\") || dl.contains(\"type safety\") : \"Must reference generics/erasure context\";\n assert dl.contains(\"view\") || dl.contains(\"wrapper\") || dl.contains(\"backed\") : \"Must mention it\u0027s a view/wrapper of the original list\";\n assert dl.contains(\"collections.checkedlist\") : \"Must mention the API method\";\n assert dl.contains(\"insertion\") || dl.contains(\"add\") || dl.contains(\"insert\") : \"Must specify the check happens at insertion time\";\n","category":"code2NL_NL2code"} {"id":"36","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"public class C2NTask36 {\n\n public static void shiftRight(int[] arr, int from, int to) {\n System.arraycopy(arr, from, arr, from + 1, to - from);\n }\n\n public static int[] insertAt(int[] arr, int index, int value) {\n int[] result = new int[arr.length + 1];\n System.arraycopy(arr, 0, result, 0, index);\n result[index] = value;\n System.arraycopy(arr, index, result, index + 1, arr.length - index);\n return result;\n }\n\n","golden_completion":" public static String describeShiftAndInsert() {\n return \"shiftRight uses System.arraycopy to shift elements within the SAME array \" +\n \"by copying from index \u0027from\u0027 to \u0027from+1\u0027. System.arraycopy handles overlapping \" +\n \"regions correctly when src and dest are the same array — it behaves as if \" +\n \"elements are first copied to a temporary array, then written to the destination. \" +\n \"insertAt creates a NEW array one element larger, copies elements before and \" +\n \"after the insertion point using two System.arraycopy calls, and sets the value \" +\n \"at the target index. Both methods use the native System.arraycopy which is \" +\n \"faster than manual loops. arraycopy throws ArrayIndexOutOfBoundsException \" +\n \"if indices are out of range and NullPointerException if either array is null.\";\n }\n","suffix":"\n public static void main(String[] args) {\n // shiftRight copies a[1..3] to a[2..4], leaving a[1] unchanged\n int[] a = {1, 2, 3, 4, 5, 0};\n shiftRight(a, 1, 4);\n assert a[0] == 1 \u0026\u0026 a[1] == 2 \u0026\u0026 a[2] == 2 \u0026\u0026 a[3] == 3 \u0026\u0026 a[4] == 4;\n\n int[] b = insertAt(new int[]{10, 20, 30}, 1, 15);\n assert b.length == 4;\n assert b[0] == 10 \u0026\u0026 b[1] == 15 \u0026\u0026 b[2] == 20 \u0026\u0026 b[3] == 30;\n\n String doc = describeShiftAndInsert();\n assert doc.toLowerCase().contains(\"arraycopy\") : \"Must mention System.arraycopy\";\n }\n}\n","assertions":"\n String d = describeShiftAndInsert();\n String dl = d.toLowerCase();\n assert dl.contains(\"arraycopy\") : \"Must mention arraycopy\";\n assert dl.contains(\"overlap\") || dl.contains(\"same array\") : \"Must describe overlapping or same-array copy behavior\";\n assert dl.contains(\"temporary\") || dl.contains(\"as if\") || dl.contains(\"correctly\") : \"Must explain overlap handling mechanism\";\n assert dl.contains(\"new array\") || dl.contains(\"new int\") || dl.contains(\"larger\") : \"Must mention insertAt creates a new array\";\n assert dl.contains(\"native\") || dl.contains(\"faster\") || dl.contains(\"efficient\") : \"Must mention native/performance advantage\";\n assert dl.contains(\"arrayindexoutofboundsexception\") || dl.contains(\"nullpointerexception\") || dl.contains(\"exception\") : \"Must mention exception cases\";\n","category":"code2NL_NL2code"} {"id":"37","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Arrays;\n\npublic class C2NTask37 {\n\n /**\n * Groups consecutive equal elements into sublists.\n * For example: [1,1,2,2,2,3,1,1] -\u003e [[1,1],[2,2,2],[3],[1,1]]\n * Note: only CONSECUTIVE duplicates are grouped — the two runs of 1\n * remain separate because they are not adjacent.\n * Returns an empty list of lists for empty input.\n */\n","golden_completion":" public static \u003cT\u003e List\u003cList\u003cT\u003e\u003e groupConsecutive(List\u003cT\u003e input) {\n List\u003cList\u003cT\u003e\u003e result = new ArrayList\u003c\u003e();\n if (input.isEmpty()) return result;\n List\u003cT\u003e cur = new ArrayList\u003c\u003e(Arrays.asList(input.get(0)));\n for (int i = 1; i \u003c input.size(); i++) {\n if (input.get(i).equals(cur.get(cur.size() - 1))) { cur.add(input.get(i)); }\n else { result.add(cur); cur = new ArrayList\u003c\u003e(Arrays.asList(input.get(i))); }\n }\n result.add(cur);\n return result;\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cList\u003cInteger\u003e\u003e r = groupConsecutive(Arrays.asList(1, 1, 2, 2, 2, 3, 1, 1));\n assert r.size() == 4;\n assert r.get(0).equals(Arrays.asList(1, 1));\n assert r.get(1).equals(Arrays.asList(2, 2, 2));\n assert r.get(2).equals(Arrays.asList(3));\n assert r.get(3).equals(Arrays.asList(1, 1));\n\n assert groupConsecutive(new ArrayList\u003c\u003e()).isEmpty();\n }\n}\n","assertions":"\n List\u003cList\u003cInteger\u003e\u003e r2 = groupConsecutive(Arrays.asList(5));\n assert r2.size() == 1 \u0026\u0026 r2.get(0).equals(Arrays.asList(5));\n List\u003cList\u003cInteger\u003e\u003e r3 = groupConsecutive(Arrays.asList(1, 2, 3));\n assert r3.size() == 3;\n assert r3.get(0).equals(Arrays.asList(1));\n assert r3.get(1).equals(Arrays.asList(2));\n assert r3.get(2).equals(Arrays.asList(3));\n List\u003cList\u003cString\u003e\u003e r4 = groupConsecutive(Arrays.asList(\"a\", \"a\", \"b\"));\n assert r4.size() == 2;\n assert r4.get(0).equals(Arrays.asList(\"a\", \"a\"));\n assert r4.get(1).equals(Arrays.asList(\"b\"));\n","category":"code2NL_NL2code"} {"id":"38","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Arrays;\n\npublic class C2NTask38 {\n\n /** Transposes a rectangular list of lists. Rows become columns.\n * E.g.: [[1,2,3],[4,5,6]] -\u003e [[1,4],[2,5],[3,6]]\n * Empty input or empty first row -\u003e empty list.\n * Input is rectangular. Must return new mutable lists. */\n","golden_completion":" public static \u003cT\u003e List\u003cList\u003cT\u003e\u003e transpose(List\u003cList\u003cT\u003e\u003e matrix) {\n List\u003cList\u003cT\u003e\u003e result = new ArrayList\u003c\u003e();\n if (matrix.isEmpty() || matrix.get(0).isEmpty()) return result;\n int cols = matrix.get(0).size();\n for (int c = 0; c \u003c cols; c++) {\n List\u003cT\u003e row = new ArrayList\u003c\u003e();\n for (List\u003cT\u003e r : matrix) row.add(r.get(c));\n result.add(row);\n }\n return result;\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cList\u003cInteger\u003e\u003e m = Arrays.asList(Arrays.asList(1,2,3), Arrays.asList(4,5,6));\n List\u003cList\u003cInteger\u003e\u003e t = transpose(m);\n assert t.size() == 3;\n assert t.get(0).equals(Arrays.asList(1, 4));\n assert t.get(1).equals(Arrays.asList(2, 5));\n assert t.get(2).equals(Arrays.asList(3, 6));\n assert transpose(new ArrayList\u003c\u003e()).isEmpty();\n }\n}\n","assertions":"\n List\u003cList\u003cInteger\u003e\u003e single = Arrays.asList(Arrays.asList(99));\n List\u003cList\u003cInteger\u003e\u003e ts = transpose(single);\n assert ts.size() == 1 \u0026\u0026 ts.get(0).equals(Arrays.asList(99));\n List\u003cList\u003cString\u003e\u003e sm = Arrays.asList(\n Arrays.asList(\"a\", \"b\"),\n Arrays.asList(\"c\", \"d\"),\n Arrays.asList(\"e\", \"f\")\n );\n List\u003cList\u003cString\u003e\u003e st = transpose(sm);\n assert st.size() == 2;\n assert st.get(0).equals(Arrays.asList(\"a\", \"c\", \"e\"));\n assert st.get(1).equals(Arrays.asList(\"b\", \"d\", \"f\"));\n List\u003cList\u003cInteger\u003e\u003e emptyRows = Arrays.asList(Arrays.asList());\n assert transpose(emptyRows).isEmpty();\n // Verify mutability of returned lists\n ts.get(0).add(999);\n assert ts.get(0).size() == 2;\n","category":"code2NL_NL2code"} {"id":"39","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\nimport java.util.Arrays;\n\npublic class C2NTask39 {\n\n /** Computes the running median of integers. For each element added:\n * - Odd count: middle element when sorted.\n * - Even count: the LOWER of the two middle elements (floor median).\n * E.g. [5,3,8,1] -\u003e [5,3,5,3]. Use sorted-list insertion. */\n","golden_completion":" public static List\u003cInteger\u003e runningMedian(List\u003cInteger\u003e stream) {\n List\u003cInteger\u003e sorted = new ArrayList\u003c\u003e(), medians = new ArrayList\u003c\u003e();\n for (int val : stream) {\n int pos = Collections.binarySearch(sorted, val);\n if (pos \u003c 0) pos = -(pos + 1);\n sorted.add(pos, val);\n medians.add(sorted.get((sorted.size() - 1) / 2));\n }\n return medians;\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cInteger\u003e r = runningMedian(Arrays.asList(5, 3, 8, 1));\n assert r.equals(Arrays.asList(5, 3, 5, 3)) : \"Got: \" + r;\n\n List\u003cInteger\u003e r2 = runningMedian(Arrays.asList(1, 2, 3));\n assert r2.equals(Arrays.asList(1, 1, 2)) : \"Got: \" + r2;\n\n assert runningMedian(new ArrayList\u003c\u003e()).isEmpty();\n }\n}\n","assertions":"\n List\u003cInteger\u003e r3 = runningMedian(Arrays.asList(10));\n assert r3.equals(Arrays.asList(10));\n List\u003cInteger\u003e r4 = runningMedian(Arrays.asList(4, 4, 4, 4));\n assert r4.equals(Arrays.asList(4, 4, 4, 4));\n List\u003cInteger\u003e r5 = runningMedian(Arrays.asList(100, 1));\n assert r5.equals(Arrays.asList(100, 1)) : \"Even count: lower of 1,100 is 1. Got: \" + r5;\n List\u003cInteger\u003e r6 = runningMedian(Arrays.asList(3, 1, 4, 1, 5, 9, 2, 6));\n assert r6.equals(Arrays.asList(3, 1, 3, 1, 3, 3, 3, 3)) : \"Got: \" + r6;\n","category":"code2NL_NL2code"} {"id":"40","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.List;\nimport java.util.Arrays;\n\npublic class C2NTask40 {\n\n /** Stable partition around a pivot: [less-than, equal, greater-than].\n * Relative order within each section is preserved.\n * E.g. partition([5,3,8,3,2,5,1], 3) -\u003e [2,1, 3,3, 5,8,5].\n * Returns a new list; does not modify the input. */\n","golden_completion":" public static List\u003cInteger\u003e partition(List\u003cInteger\u003e list, int pivot) {\n List\u003cInteger\u003e less = new ArrayList\u003c\u003e(), equal = new ArrayList\u003c\u003e(), greater = new ArrayList\u003c\u003e();\n for (int v : list) {\n if (v \u003c pivot) less.add(v);\n else if (v == pivot) equal.add(v);\n else greater.add(v);\n }\n List\u003cInteger\u003e result = new ArrayList\u003c\u003e(less);\n result.addAll(equal);\n result.addAll(greater);\n return result;\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cInteger\u003e r = partition(Arrays.asList(5, 3, 8, 3, 2, 5, 1), 3);\n assert r.equals(Arrays.asList(2, 1, 3, 3, 5, 8, 5)) : \"Got: \" + r;\n List\u003cInteger\u003e in = new ArrayList\u003c\u003e(Arrays.asList(3, 1, 2));\n List\u003cInteger\u003e cp = new ArrayList\u003c\u003e(in);\n partition(in, 2);\n assert in.equals(cp) : \"Input was modified!\";\n assert partition(new ArrayList\u003c\u003e(), 5).isEmpty();\n }\n}\n","assertions":"\n assert partition(Arrays.asList(1,1,1), 1).equals(Arrays.asList(1,1,1));\n List\u003cInteger\u003e r3 = partition(Arrays.asList(5,4,3,2,1), 3);\n assert r3.equals(Arrays.asList(2,1,3,5,4)) : \"Got: \" + r3;\n assert partition(Arrays.asList(10,20,30), 5).equals(Arrays.asList(10,20,30));\n assert partition(Arrays.asList(10,20,30), 50).equals(Arrays.asList(10,20,30));\n assert partition(Arrays.asList(7,3,7,3,7), 5).equals(Arrays.asList(3,3,7,7,7));\n","category":"code2NL_NL2code"} {"id":"41","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask41 {\n\n public static List\u003cString\u003e createImmutable(String... items) {\n return List.of(items);\n }\n\n","golden_completion":" public static String describeCreateImmutable() {\n return \"Creates a structurally immutable list via List.of(). Throws UnsupportedOperationException on add/remove/set. Throws NullPointerException if any element is null. Does NOT permit null elements, unlike Collections.unmodifiableList. Returns a value-based instance; identity-sensitive operations are unreliable.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e xs = createImmutable(\"a\", \"b\");\n assert xs.size() == 2;\n try { xs.add(\"c\"); assert false; } catch (UnsupportedOperationException e) {}\n try { createImmutable(\"a\", null); assert false; } catch (NullPointerException e) {}\n String desc = describeCreateImmutable();\n assert desc.contains(\"immutable\") || desc.contains(\"unmodifiable\");\n System.out.println(\"PASS\");\n }\n}\n","assertions":" String d41 = describeCreateImmutable();\n assert d41.toLowerCase().contains(\"null\") : \"must mention null rejection\";\n assert d41.contains(\"NullPointerException\") : \"must name the exception\";\n assert d41.contains(\"UnsupportedOperationException\") : \"must name UOE\";\n assert d41.toLowerCase().contains(\"value-based\") || d41.toLowerCase().contains(\"identity\") : \"must mention value-based semantics\";\n","category":"code2NL_NL2code"} {"id":"42","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask42 {\n\n @SafeVarargs\n public static \u003cK, V\u003e Map\u003cK, V\u003e buildMap(Map.Entry\u003cK, V\u003e... entries) {\n return Map.ofEntries(entries);\n }\n\n","golden_completion":" public static String describeBuildMap() {\n return \"Delegates to Map.ofEntries() to create a structurally immutable map. Throws IllegalArgumentException if duplicate keys are provided. Throws NullPointerException if any key or value is null. Iteration order is not guaranteed and may change between JVM invocations. The returned map is value-based; identity comparisons (==) are unreliable.\";\n }\n","suffix":"\n public static void main(String[] args) {\n Map\u003cString, Integer\u003e m = buildMap(Map.entry(\"a\", 1), Map.entry(\"b\", 2));\n assert m.size() == 2 \u0026\u0026 m.get(\"a\") == 1;\n try { m.put(\"c\", 3); assert false; } catch (UnsupportedOperationException e) {}\n try { buildMap(Map.entry(\"x\", 1), Map.entry(\"x\", 2)); assert false; } catch (IllegalArgumentException e) {}\n String desc = describeBuildMap();\n assert desc.contains(\"immutable\") || desc.contains(\"unmodifiable\");\n System.out.println(\"PASS\");\n }\n}\n","assertions":" String d42 = describeBuildMap();\n assert d42.contains(\"IllegalArgumentException\") : \"must mention IAE for duplicate keys\";\n assert d42.toLowerCase().contains(\"duplicate\") : \"must mention duplicate key behavior\";\n assert d42.toLowerCase().contains(\"null\") : \"must mention null rejection\";\n assert d42.toLowerCase().contains(\"order\") || d42.toLowerCase().contains(\"iteration\") : \"must mention unspecified iteration order\";\n","category":"code2NL_NL2code"} {"id":"43","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\nimport java.util.function.Supplier;\n\npublic class C2NTask43 {\n\n private static int supplierCallCount = 0;\n\n public static \u003cT\u003e T safeDefault(T obj, Supplier\u003cT\u003e fallback) {\n supplierCallCount = 0;\n Supplier\u003cT\u003e tracked = () -\u003e { supplierCallCount++; return fallback.get(); };\n return Objects.requireNonNullElseGet(obj, tracked);\n }\n\n","golden_completion":" public static String describeSafeDefault() {\n return \"Wraps Objects.requireNonNullElseGet to return obj if non-null, otherwise lazily invokes the fallback Supplier exactly once. The Supplier is never called when obj is non-null (zero invocations). Throws NullPointerException if both obj is null AND the Supplier returns null. Resets supplierCallCount to 0 on each call for tracking.\";\n }\n","suffix":"\n public static void main(String[] args) {\n String r1 = safeDefault(\"hello\", () -\u003e \"world\");\n assert r1.equals(\"hello\") \u0026\u0026 supplierCallCount == 0;\n String r2 = safeDefault(null, () -\u003e \"fallback\");\n assert r2.equals(\"fallback\") \u0026\u0026 supplierCallCount == 1;\n try { safeDefault(null, () -\u003e null); assert false; } catch (NullPointerException e) {}\n String desc = describeSafeDefault();\n assert desc.toLowerCase().contains(\"supplier\") || desc.toLowerCase().contains(\"lazy\");\n System.out.println(\"PASS\");\n }\n}\n","assertions":" String d43 = describeSafeDefault();\n assert d43.toLowerCase().contains(\"lazy\") || d43.toLowerCase().contains(\"lazily\") : \"must mention lazy evaluation\";\n assert d43.toLowerCase().contains(\"never called\") || d43.toLowerCase().contains(\"zero\") || d43.toLowerCase().contains(\"not called\") || d43.toLowerCase().contains(\"not invoked\") : \"must mention supplier not called when non-null\";\n assert d43.contains(\"NullPointerException\") : \"must mention NPE when supplier returns null\";\n assert d43.toLowerCase().contains(\"supplierCallCount\") || d43.toLowerCase().contains(\"suppliercallcount\") || d43.toLowerCase().contains(\"tracking\") || d43.toLowerCase().contains(\"resets\") : \"must mention call counting/tracking\";\n","category":"code2NL_NL2code"} {"id":"44","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\nimport java.util.function.Function;\n\npublic class C2NTask44 {\n\n public static \u003cT\u003e List\u003cT\u003e sortByKey(List\u003cT\u003e items, Function\u003cT, Comparable\u003e keyExtractor) {\n List\u003cT\u003e copy = new ArrayList\u003c\u003e(items);\n copy.sort(Comparator.comparing(keyExtractor));\n return copy;\n }\n\n","golden_completion":" public static String describeSortByKey() {\n return \"Returns a new sorted list (defensive copy via new ArrayList) using Comparator.comparing with the given key extractor. The original list is not modified. Throws NullPointerException at compare-time if the key extractor returns null for any element. Throws ClassCastException if extracted keys are not mutually Comparable.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e names = new ArrayList\u003c\u003e(List.of(\"Charlie\", \"Alice\", \"Bob\"));\n List\u003cString\u003e sorted = sortByKey(names, s -\u003e s);\n assert sorted.equals(List.of(\"Alice\", \"Bob\", \"Charlie\"));\n assert names.equals(List.of(\"Charlie\", \"Alice\", \"Bob\")) : \"original unchanged\";\n try { sortByKey(List.of(\"a\", \"b\"), x -\u003e null); assert false; } catch (NullPointerException e) {}\n String desc = describeSortByKey();\n assert desc.toLowerCase().contains(\"copy\") || desc.toLowerCase().contains(\"new\");\n System.out.println(\"PASS\");\n }\n}\n","assertions":" String d44 = describeSortByKey();\n assert d44.contains(\"NullPointerException\") : \"must mention NPE for null keys\";\n assert d44.toLowerCase().contains(\"original\") || d44.toLowerCase().contains(\"not modified\") || d44.toLowerCase().contains(\"defensive\") : \"must mention original list is unmodified\";\n assert d44.contains(\"ClassCastException\") || d44.toLowerCase().contains(\"comparable\") : \"must mention Comparable requirement\";\n","category":"code2NL_NL2code"} {"id":"45","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\nimport java.util.function.*;\n\npublic class C2NTask45 {\n\n public static List\u003cInteger\u003e generateWhile(int seed, IntPredicate hasNext, IntUnaryOperator next) {\n return IntStream.iterate(seed, hasNext, next)\n .boxed()\n .collect(Collectors.toList());\n }\n\n","golden_completion":" public static String describeGenerateWhile() {\n return \"Uses the three-argument IntStream.iterate(seed, hasNext, next) to generate a finite sequence. The predicate is tested BEFORE each element including the seed; if the seed fails the predicate, the result is an empty list. Elements are boxed via boxed() and collected into a mutable ArrayList via Collectors.toList(). The stream is sequential and lazy until the terminal collect operation.\";\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cInteger\u003e r1 = generateWhile(1, x -\u003e x \u003c 5, x -\u003e x + 1);\n assert r1.equals(List.of(1, 2, 3, 4)) : \"expected [1..4]: \" + r1;\n List\u003cInteger\u003e r2 = generateWhile(10, x -\u003e x \u003c 5, x -\u003e x + 1);\n assert r2.isEmpty() : \"seed fails predicate =\u003e empty\";\n List\u003cInteger\u003e r3 = generateWhile(2, x -\u003e x \u003c 20, x -\u003e x * 2);\n assert r3.equals(List.of(2, 4, 8, 16)) : \"doubling: \" + r3;\n String desc = describeGenerateWhile();\n assert desc.toLowerCase().contains(\"iterate\") || desc.toLowerCase().contains(\"stream\");\n System.out.println(\"PASS\");\n }\n}\n","assertions":" String d45 = describeGenerateWhile();\n assert d45.toLowerCase().contains(\"seed\") : \"must mention seed\";\n assert d45.toLowerCase().contains(\"before\") || d45.toLowerCase().contains(\"including the seed\") : \"must mention predicate tested before/including seed\";\n assert d45.toLowerCase().contains(\"empty\") : \"must mention empty result when seed fails predicate\";\n assert d45.toLowerCase().contains(\"mutable\") || d45.toLowerCase().contains(\"arraylist\") || d45.toLowerCase().contains(\"collectors.tolist\") : \"must mention mutable list from toList\";\n","category":"code2NL_NL2code"} {"id":"46","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.Arrays;\n\npublic class C2NTask46 {\n\n public static boolean nestedEqual(Object[] a, Object[] b) {\n return Arrays.deepEquals(a, b);\n }\n\n public static boolean shallowEqual(Object[] a, Object[] b) {\n return Arrays.equals(a, b);\n }\n\n","golden_completion":" public static String describeNestedEqual() {\n return \"Uses Arrays.deepEquals for recursive element-wise comparison of nested arrays. Unlike Arrays.equals which uses Object.equals (reference equality for sub-arrays), deepEquals recursively descends into Object[] elements. Both methods are null-safe: deepEquals(null, null) returns true. deepEquals detects self-referential arrays and throws StackOverflowError.\";\n }\n","suffix":"\n public static void main(String[] args) {\n Object[] a = {new int[]{1, 2}, new int[]{3, 4}};\n Object[] b = {new int[]{1, 2}, new int[]{3, 4}};\n assert nestedEqual(a, b) : \"deepEquals should match nested\";\n assert !shallowEqual(a, b) : \"shallow equals fails on nested\";\n assert nestedEqual(null, null) : \"null-safe\";\n assert !nestedEqual(a, null) : \"null mismatch\";\n String desc = describeNestedEqual();\n assert desc.toLowerCase().contains(\"recursive\") || desc.toLowerCase().contains(\"deep\");\n System.out.println(\"PASS\");\n }\n}\n","assertions":" String d46 = describeNestedEqual();\n assert d46.toLowerCase().contains(\"recursive\") || d46.toLowerCase().contains(\"recursively\") : \"must mention recursive behavior\";\n assert d46.contains(\"Arrays.equals\") || d46.toLowerCase().contains(\"shallow\") : \"must contrast with shallow equals\";\n assert d46.toLowerCase().contains(\"null\") \u0026\u0026 (d46.toLowerCase().contains(\"safe\") || d46.toLowerCase().contains(\"null, null\")) : \"must mention null-safe behavior\";\n assert d46.toLowerCase().contains(\"stackoverflow\") || d46.toLowerCase().contains(\"self-referential\") || d46.toLowerCase().contains(\"circular\") : \"must mention self-referential array risk\";\n","category":"code2NL_NL2code"} {"id":"47","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask47 {\n\n // Returns the sliding-window averages of the input list.\n // For window size k and list of size n, returns (n - k + 1) averages.\n // Each average is the arithmetic mean of k consecutive elements as a double.\n // If k \u003e n or k \u003c= 0, returns an empty list.\n // The input list must not be modified.\n public static List\u003cDouble\u003e windowedAverage(List\u003cInteger\u003e values, int k) {\n","golden_completion":" if (k \u003c= 0 || k \u003e values.size()) return new ArrayList\u003c\u003e();\n List\u003cDouble\u003e result = new ArrayList\u003c\u003e();\n double sum = 0;\n for (int i = 0; i \u003c k; i++) sum += values.get(i);\n result.add(sum / k);\n for (int i = k; i \u003c values.size(); i++) {\n sum += values.get(i) - values.get(i - k);\n result.add(sum / k);\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n List\u003cInteger\u003e data = new ArrayList\u003c\u003e(List.of(1, 3, 5, 7, 9));\n List\u003cInteger\u003e origCopy = new ArrayList\u003c\u003e(data);\n List\u003cDouble\u003e r = windowedAverage(data, 3);\n assert r.equals(List.of(3.0, 5.0, 7.0)) : \"got: \" + r;\n assert data.equals(origCopy) : \"input must not be modified\";\n assert windowedAverage(data, 6).isEmpty() : \"k \u003e n =\u003e empty\";\n assert windowedAverage(data, 0).isEmpty() : \"k \u003c= 0 =\u003e empty\";\n assert windowedAverage(data, 1).equals(List.of(1.0, 3.0, 5.0, 7.0, 9.0));\n System.out.println(\"PASS\");\n }\n}\n","assertions":" List\u003cInteger\u003e test47 = new ArrayList\u003c\u003e(List.of(2, 4, 6));\n assert windowedAverage(test47, 2).equals(List.of(3.0, 5.0)) : \"basic window\";\n assert windowedAverage(test47, 3).equals(List.of(4.0)) : \"full window\";\n assert windowedAverage(test47, 4).isEmpty() : \"k \u003e n\";\n assert windowedAverage(test47, -1).isEmpty() : \"negative k\";\n assert windowedAverage(new ArrayList\u003c\u003e(), 1).isEmpty() : \"empty list\";\n assert windowedAverage(List.of(10), 1).equals(List.of(10.0)) : \"single element\";\n","category":"code2NL_NL2code"} {"id":"48","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask48 {\n\n // Returns the longest common prefix shared by all strings in the list.\n // If the list is empty, returns \"\".\n // If any element is null, treats it as \"\" (empty string), which means\n // the result is \"\" if any element is null.\n // Comparison is case-sensitive.\n public static String longestCommonPrefix(List\u003cString\u003e strings) {\n","golden_completion":" if (strings == null || strings.isEmpty()) return \"\";\n String first = strings.get(0) == null ? \"\" : strings.get(0);\n for (int i = 1; i \u003c strings.size(); i++) {\n String s = strings.get(i) == null ? \"\" : strings.get(i);\n while (!s.startsWith(first)) {\n first = first.substring(0, first.length() - 1);\n if (first.isEmpty()) return \"\";\n }\n }\n return first;\n","suffix":" }\n\n public static void main(String[] args) {\n assert longestCommonPrefix(List.of(\"flower\", \"flow\", \"flight\")).equals(\"fl\");\n assert longestCommonPrefix(List.of(\"dog\", \"racecar\", \"car\")).equals(\"\");\n assert longestCommonPrefix(List.of(\"abc\")).equals(\"abc\");\n assert longestCommonPrefix(List.of()).equals(\"\");\n List\u003cString\u003e withNull = new ArrayList\u003c\u003e();\n withNull.add(\"abc\");\n withNull.add(null);\n assert longestCommonPrefix(withNull).equals(\"\") : \"null element =\u003e empty prefix\";\n System.out.println(\"PASS\");\n }\n}\n","assertions":" assert longestCommonPrefix(List.of(\"pre\", \"prefix\", \"preamble\")).equals(\"pre\");\n assert longestCommonPrefix(List.of(\"x\")).equals(\"x\") : \"single element\";\n assert longestCommonPrefix(List.of(\"\", \"abc\")).equals(\"\") : \"empty string in list\";\n assert longestCommonPrefix(null).equals(\"\") : \"null list\";\n List\u003cString\u003e nullTest48 = new ArrayList\u003c\u003e();\n nullTest48.add(null);\n nullTest48.add(null);\n assert longestCommonPrefix(nullTest48).equals(\"\") : \"all nulls\";\n assert longestCommonPrefix(List.of(\"same\", \"same\", \"same\")).equals(\"same\");\n","category":"code2NL_NL2code"} {"id":"49","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask49 {\n\n // Performs topological sort on a DAG given as adjacency list.\n // Keys are node IDs, values are lists of nodes that the key points to (outgoing edges).\n // When multiple nodes have zero in-degree, choose the smallest node ID first\n // (use a PriorityQueue/min-heap for deterministic ordering).\n // Throws IllegalArgumentException if the graph contains a cycle.\n // All nodes that appear as values but not as keys must be included with empty outgoing edge lists.\n // Returns a list of all nodes in topological order.\n public static List\u003cInteger\u003e topologicalSort(Map\u003cInteger, List\u003cInteger\u003e\u003e graph) {\n","golden_completion":" Set\u003cInteger\u003e allNodes = new HashSet\u003c\u003e(graph.keySet());\n graph.values().forEach(v -\u003e allNodes.addAll(v));\n Map\u003cInteger, Integer\u003e inDegree = new HashMap\u003c\u003e();\n for (int n : allNodes) inDegree.put(n, 0);\n for (var entry : graph.entrySet())\n for (int nb : entry.getValue()) inDegree.merge(nb, 1, Integer::sum);\n PriorityQueue\u003cInteger\u003e pq = new PriorityQueue\u003c\u003e();\n inDegree.forEach((k, v) -\u003e { if (v == 0) pq.add(k); });\n List\u003cInteger\u003e result = new ArrayList\u003c\u003e();\n while (!pq.isEmpty()) {\n","suffix":" int node = pq.poll();\n result.add(node);\n for (int neighbor : graph.getOrDefault(node, List.of())) {\n int deg = inDegree.merge(neighbor, -1, Integer::sum);\n if (deg == 0) pq.add(neighbor);\n }\n }\n if (result.size() != inDegree.size())\n throw new IllegalArgumentException(\"Graph contains a cycle\");\n return result;\n }\n\n public static void main(String[] args) {\n Map\u003cInteger, List\u003cInteger\u003e\u003e g = new HashMap\u003c\u003e();\n g.put(5, List.of(2, 0));\n g.put(4, List.of(0, 1));\n g.put(2, List.of(3));\n g.put(3, List.of(1));\n List\u003cInteger\u003e sorted = topologicalSort(g);\n assert sorted.equals(List.of(4, 5, 0, 2, 3, 1)) : \"got: \" + sorted;\n try {\n Map\u003cInteger, List\u003cInteger\u003e\u003e cyc = new HashMap\u003c\u003e();\n cyc.put(1, List.of(2)); cyc.put(2, List.of(1));\n topologicalSort(cyc); assert false;\n } catch (IllegalArgumentException e) {}\n System.out.println(\"PASS\");\n }\n}\n","assertions":" Map\u003cInteger, List\u003cInteger\u003e\u003e dag49 = new HashMap\u003c\u003e();\n dag49.put(1, new ArrayList\u003c\u003e(List.of(2, 3)));\n dag49.put(2, new ArrayList\u003c\u003e(List.of(3)));\n List\u003cInteger\u003e ts49 = topologicalSort(dag49);\n assert ts49.equals(List.of(1, 2, 3)) : \"linear: \" + ts49;\n Map\u003cInteger, List\u003cInteger\u003e\u003e empty49 = new HashMap\u003c\u003e();\n assert topologicalSort(empty49).isEmpty() : \"empty graph\";\n Map\u003cInteger, List\u003cInteger\u003e\u003e single49 = new HashMap\u003c\u003e();\n single49.put(42, new ArrayList\u003c\u003e());\n assert topologicalSort(single49).equals(List.of(42)) : \"single node\";\n","category":"code2NL_NL2code"} {"id":"50","testsource":"devbench-code2NL-NL2code","language":"java","prefix":"import java.util.*;\n\npublic class C2NTask50 {\n\n // Generates all valid combinations of n pairs of balanced parentheses.\n // Returns them in lexicographic order (where \u0027(\u0027 \u003c \u0027)\u0027).\n // For n=0, returns a list containing exactly one element: the empty string \"\".\n // For n\u003c0, returns an empty list.\n // Must use backtracking (not iterative generation).\n public static List\u003cString\u003e generateParentheses(int n) {\n","golden_completion":" List\u003cString\u003e result = new ArrayList\u003c\u003e();\n if (n \u003c 0) return result;\n backtrack(result, new StringBuilder(), 0, 0, n);\n return result;\n }\n\n private static void backtrack(List\u003cString\u003e result, StringBuilder sb, int open, int close, int max) {\n if (sb.length() == max * 2) { result.add(sb.toString()); return; }\n if (open \u003c max) { sb.append(\u0027(\u0027); backtrack(result, sb, open + 1, close, max); sb.deleteCharAt(sb.length() - 1); }\n if (close \u003c open) { sb.append(\u0027)\u0027); backtrack(result, sb, open, close + 1, max); sb.deleteCharAt(sb.length() - 1); }\n","suffix":" }\n\n public static void main(String[] args) {\n assert generateParentheses(0).equals(List.of(\"\")) : \"n=0 =\u003e empty string\";\n assert generateParentheses(1).equals(List.of(\"()\")) : \"n=1\";\n assert generateParentheses(2).equals(List.of(\"(())\", \"()()\")) : \"n=2\";\n assert generateParentheses(3).size() == 5 : \"n=3 has 5 combos\";\n assert generateParentheses(3).get(0).equals(\"((()))\") : \"first is ((()))\";\n assert generateParentheses(-1).isEmpty() : \"negative =\u003e empty\";\n System.out.println(\"PASS\");\n }\n}\n","assertions":" List\u003cString\u003e p3 = generateParentheses(3);\n assert p3.equals(List.of(\"((()))\", \"(()())\", \"(())()\", \"()(())\", \"()()()\")) : \"n=3 full: \" + p3;\n assert generateParentheses(4).size() == 14 : \"Catalan(4)=14\";\n assert generateParentheses(-5).isEmpty() : \"negative\";\n assert generateParentheses(0).size() == 1 : \"n=0 size\";\n List\u003cString\u003e p4 = generateParentheses(4);\n for (int i50 = 1; i50 \u003c p4.size(); i50++) {\n assert p4.get(i50 - 1).compareTo(p4.get(i50)) \u003c 0 : \"must be lexicographic\";\n }\n","category":"code2NL_NL2code"} {"id":"1","testsource":"devbench-low-context","language":"java","prefix":"import java.math.BigInteger;\npublic class LCTask1 {\n static final String A = new StringBuilder(\"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\").reverse().toString();\n static final String S = \"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\n public static String base58Encode(byte[] d) { return base58Encode(d, A); }\n public static String base58Encode(byte[] d, String a) {\n","golden_completion":" if (d.length == 0) return \"\";\n BigInteger n = new BigInteger(1, d);\n BigInteger b = BigInteger.valueOf(a.length());\n StringBuilder sb = new StringBuilder();\n while (n.compareTo(BigInteger.ZERO) \u003e 0) { BigInteger[] qr = n.divideAndRemainder(b); sb.append(a.charAt(qr[1].intValue())); n = qr[0]; }\n for (byte x : d) { if (x == 0) sb.append(a.charAt(0)); else break; }\n return sb.reverse().toString();\n","suffix":" }\n public static void main(String[] args) {\n assert !base58Encode(\"abc\".getBytes()).equals(\"ZiCa\");\n assert base58Encode(\"abc\".getBytes()).equals(\"SHoR\");\n assert base58Encode(\"abc\".getBytes(), S).equals(\"ZiCa\");\n }\n}\n","assertions":"assert base58Encode(new byte[]{}).equals(\"\");\nassert base58Encode(new byte[]{0}).equals(\"z\");\nassert base58Encode(\"hello\".getBytes()).equals(\"oDsMWSK\");\nassert base58Encode(\"hello\".getBytes(), S).equals(\"Cn8eVZg\");\nassert base58Encode(new byte[]{0, 97, 98, 99}).equals(\"zSHoR\");\n","category":"low_context"} {"id":"2","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask2Doc {\n public static List\u003cString\u003e stableSortCI(List\u003cString\u003e items) {\n var copy = new ArrayList\u003c\u003e(items);\n copy.sort(String.CASE_INSENSITIVE_ORDER);\n return copy;\n }\n public static String describeStableSortCI() {\n","golden_completion":" return \"Creates a defensive copy with the ArrayList constructor, then sorts using \" +\n \"String.CASE_INSENSITIVE_ORDER, which delegates comparisons to \" +\n \"String.compareToIgnoreCase. Java\u0027s TimSort is stable, so \" +\n \"case-insensitive ties keep insertion order and the original list is unchanged.\";\n","suffix":" }\n public static void main(String[] args) {\n var src = new ArrayList\u003c\u003e(List.of(\"Banana\", \"apple\", \"APPLE\"));\n var r = stableSortCI(src);\n assert r.equals(List.of(\"apple\", \"APPLE\", \"Banana\"));\n assert src.equals(List.of(\"Banana\", \"apple\", \"APPLE\"));\n assert describeStableSortCI().contains(\"CASE_INSENSITIVE_ORDER\");\n }\n}\n","assertions":"String d = describeStableSortCI().toLowerCase();\nassert d.contains(\"case_insensitive_order\");\nassert d.contains(\"comparetoignorecase\");\nassert d.contains(\"defensive copy\") || d.contains(\"arraylist\");\nassert d.contains(\"stable\") || d.contains(\"timsort\");\nassert d.contains(\"original\");\n","category":"low_context"} {"id":"3","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask3Doc {\n public static List\u003cString\u003e frozenView(List\u003cString\u003e src) {\n return Collections.unmodifiableList(src);\n }\n public static String describeFrozenView() {\n","golden_completion":" return \"Returns Collections.unmodifiableList(src), a live unmodifiable view backed by \" +\n \"the source list rather than a copy. Later source mutations are visible, \" +\n \"but attempts to add or remove through the view throw UnsupportedOperationException.\";\n","suffix":" }\n public static void main(String[] args) {\n var base = new ArrayList\u003c\u003e(List.of(\"a\", \"b\"));\n var view = frozenView(base);\n base.add(\"c\");\n assert view.equals(List.of(\"a\", \"b\", \"c\"));\n try { view.add(\"d\"); assert false; } catch (UnsupportedOperationException e) {}\n assert describeFrozenView().contains(\"unmodifiableList\");\n }\n}\n","assertions":"String d = describeFrozenView().toLowerCase();\nassert d.contains(\"collections.unmodifiablelist\");\nassert d.contains(\"live\") || d.contains(\"backed\");\nassert d.contains(\"source\") || d.contains(\"backing\");\nassert d.contains(\"unsupportedoperationexception\");\nassert d.contains(\"copy\") || d.contains(\"not a copy\");\n","category":"low_context"} {"id":"4","testsource":"devbench-low-context","language":"java","prefix":"import java.math.BigInteger;\npublic class LCTask4Base64 {\n static final String S = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n static final String R = new StringBuilder(S).reverse().toString();\n public static String base64Encode(byte[] d) { return base64Encode(d, R); }\n public static String base64Encode(byte[] d, String a) {\n","golden_completion":" if (d.length == 0) return \"\";\n BigInteger n = new BigInteger(1, d), b = BigInteger.valueOf(a.length());\n StringBuilder sb = new StringBuilder();\n while (n.compareTo(BigInteger.ZERO) \u003e 0) { BigInteger[] qr = n.divideAndRemainder(b); sb.append(a.charAt(qr[1].intValue())); n = qr[0]; }\n for (byte x : d) { if (x == 0) sb.append(a.charAt(0)); else break; }\n return sb.reverse().toString();\n","suffix":" }\n public static void main(String[] args) {\n assert !base64Encode(\"hello\".getBytes(), S).equals(\"aGVsbG8=\");\n assert base64Encode(\"hello\".getBytes()).equals(\"5eak5OQ\");\n assert base64Encode(\"hello\".getBytes(), S).equals(\"GhlbGxv\");\n assert base64Encode(\"abc\".getBytes()).equals(\"np2c\");\n }\n}\n","assertions":"assert base64Encode(new byte[]{}).equals(\"\");\nassert base64Encode(new byte[]{0}).equals(\"/\");\nassert base64Encode(new byte[]{0,97,98,99}).equals(\"/np2c\");\nassert base64Encode(\"abc\".getBytes(), S).equals(\"YWJj\");\nassert base64Encode(new byte[]{0,97,98,99}, S).equals(\"AYWJj\");\n","category":"low_context"} {"id":"5","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask5 {\n /** Update map: if key absent, set to defaultVal.\n * If present and current \u003e threshold, REMOVE it (via null return).\n * Otherwise increment current by 1. Uses Map.compute. */\n public static void update(Map\u003cString, Integer\u003e m, String k, int defaultVal, int threshold) {\n","golden_completion":" m.compute(k, (key, cur) -\u003e {\n if (cur == null) return defaultVal;\n return cur \u003e threshold ? null : cur + 1;\n });\n","suffix":" }\n public static void main(String[] args) {\n var m = new HashMap\u003cString, Integer\u003e();\n update(m, \"a\", 5, 10); // absent -\u003e 5\n assert m.get(\"a\") == 5;\n update(m, \"a\", 5, 10); // 5 \u003c= 10 -\u003e 6\n assert m.get(\"a\") == 6;\n var m2 = new HashMap\u003c\u003e(Map.of(\"x\", 11));\n update(m2, \"x\", 0, 10); // 11 \u003e 10 -\u003e removed\n assert !m2.containsKey(\"x\");\n }\n}\n","assertions":"var m3 = new HashMap\u003c\u003e(Map.of(\"p\", 10));\nupdate(m3, \"p\", 0, 10); // 10 == 10, not \u003e 10 -\u003e 11\nassert m3.get(\"p\") == 11;\nupdate(m3, \"p\", 0, 10); // 11 \u003e 10 -\u003e removed\nassert !m3.containsKey(\"p\");\nvar m4 = new HashMap\u003cString, Integer\u003e();\nupdate(m4, \"q\", 0, 0);\nassert m4.get(\"q\") == 0;\nupdate(m4, \"q\", 0, 0); // 0 == 0, not \u003e 0 -\u003e 1\nassert m4.get(\"q\") == 1;\n","category":"low_context"} {"id":"6","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask6Doc {\n public static LinkedHashMap\u003cString,Integer\u003e makeLRU() {\n return new LinkedHashMap\u003c\u003e(16, 0.75f, true) {\n protected boolean removeEldestEntry(Map.Entry\u003cString,Integer\u003e e) { return size() \u003e 3; }\n };\n }\n public static String describeMakeLRU() {\n","golden_completion":" return \"Creates a LinkedHashMap in access-order mode using the three-argument \" +\n \"constructor. Reads with get move entries to most-recent position, and \" +\n \"removeEldestEntry evicts when size() \u003e 3, so the least-recently accessed key is dropped.\";\n","suffix":" }\n public static void main(String[] args) {\n var m = makeLRU();\n m.put(\"a\",1); m.put(\"b\",2); m.put(\"c\",3); m.get(\"a\"); m.put(\"d\",4);\n assert !m.containsKey(\"b\") \u0026\u0026 m.containsKey(\"a\");\n assert m.size() == 3;\n assert describeMakeLRU().contains(\"LinkedHashMap\");\n }\n}\n","assertions":"String d = describeMakeLRU().toLowerCase();\nassert d.contains(\"linkedhashmap\");\nassert d.contains(\"access-order\") || d.contains(\"accessorder\");\nassert d.contains(\"removeeldestentry\");\nassert d.contains(\"size() \u003e 3\") || d.contains(\"size \u003e 3\");\nassert d.contains(\"get\") || d.contains(\"read\");\n","category":"low_context"} {"id":"7","testsource":"devbench-low-context","language":"java","prefix":"import java.math.BigInteger;\npublic class LCTask7Base32 {\n static final String S = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\n static final String R = new StringBuilder(S).reverse().toString();\n public static String base32Encode(byte[] d) { return base32Encode(d, R); }\n public static String base32Encode(byte[] d, String a) {\n","golden_completion":" if (d.length == 0) return \"\";\n BigInteger n = new BigInteger(1, d), b = BigInteger.valueOf(a.length());\n StringBuilder sb = new StringBuilder();\n while (n.compareTo(BigInteger.ZERO) \u003e 0) { BigInteger[] qr = n.divideAndRemainder(b); sb.append(a.charAt(qr[1].intValue())); n = qr[0]; }\n for (byte x : d) { if (x == 0) sb.append(a.charAt(0)); else break; }\n return sb.reverse().toString();\n","suffix":" }\n public static void main(String[] args) {\n assert !base32Encode(\"abc\".getBytes(), S).equals(\"MFRGG\");\n assert base32Encode(\"abc\".getBytes()).equals(\"Z5HM4\");\n assert base32Encode(\"abc\".getBytes(), S).equals(\"GCYTD\");\n assert base32Encode(\"hello\".getBytes()).equals(\"S6NJHE4Q\");\n }\n}\n","assertions":"assert base32Encode(new byte[]{}).equals(\"\");\nassert base32Encode(new byte[]{0}).equals(\"7\");\nassert base32Encode(new byte[]{0,97,98,99}).equals(\"7Z5HM4\");\nassert base32Encode(\"hello\".getBytes(), S).equals(\"NBSWY3DP\");\nassert base32Encode(new byte[]{0,97,98,99}, S).equals(\"AGCYTD\");\n","category":"low_context"} {"id":"8","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask8Doc {\n public static List\u003cString\u003e swapEnds(String[] arr) {\n List\u003cString\u003e view = Arrays.asList(arr);\n String t = view.get(0); view.set(0, view.get(view.size() - 1)); view.set(view.size() - 1, t);\n return view;\n }\n public static String describeSwapEnds() {\n","golden_completion":" return \"Uses Arrays.asList to create a fixed-size List view backed by the array, \" +\n \"then swaps with List.set so both the array and returned view change. \" +\n \"Because it is the same fixed-size view, add/remove throw UnsupportedOperationException.\";\n","suffix":" }\n public static void main(String[] args) {\n String[] a = {\"x\", \"y\", \"z\"};\n var v = swapEnds(a);\n assert a[0].equals(\"z\") \u0026\u0026 v.get(2).equals(\"x\");\n try { v.add(\"q\"); assert false; } catch (UnsupportedOperationException e) {}\n assert describeSwapEnds().contains(\"Arrays.asList\");\n }\n}\n","assertions":"String d = describeSwapEnds().toLowerCase();\nassert d.contains(\"arrays.aslist\");\nassert d.contains(\"backed\") || d.contains(\"array\");\nassert d.contains(\"fixed-size\") || d.contains(\"fixed size\");\nassert d.contains(\"set\");\nassert d.contains(\"unsupportedoperationexception\");\n","category":"low_context"} {"id":"9","testsource":"devbench-low-context","language":"java","prefix":"import java.util.concurrent.atomic.AtomicInteger;\npublic class LCTask9Doc {\n public static int[] swapAndReport(AtomicInteger val, int newVal) {\n int old = val.getAndSet(newVal);\n return new int[]{old, val.get()};\n }\n public static String describeSwapAndReport() {\n","golden_completion":" return \"Uses AtomicInteger.getAndSet(newVal) to atomically mutate the value and capture \" +\n \"the old value. It returns a two-element array: first the old value, then the \" +\n \"current value after the swap, which is the supplied new value.\";\n","suffix":" }\n public static void main(String[] args) {\n var a = new AtomicInteger(10);\n int[] r = swapAndReport(a, 42);\n assert r[0] == 10 \u0026\u0026 r[1] == 42 \u0026\u0026 a.get() == 42;\n assert describeSwapAndReport().contains(\"getAndSet\");\n }\n}\n","assertions":"String d = describeSwapAndReport().toLowerCase();\nassert d.contains(\"atomicinteger\");\nassert d.contains(\"getandset\");\nassert d.contains(\"old value\");\nassert d.contains(\"current value\") || d.contains(\"after the swap\");\nassert d.contains(\"new value\") || d.contains(\"newval\");\n","category":"low_context"} {"id":"10","testsource":"devbench-low-context","language":"java","prefix":"import java.math.BigInteger;\npublic class LCTask10Base16 {\n static final String S = \"0123456789ABCDEF\";\n static final String R = new StringBuilder(S).reverse().toString();\n public static String base16Encode(byte[] d) { return base16Encode(d, R); }\n public static String base16Encode(byte[] d, String a) {\n","golden_completion":" if (d.length == 0) return \"\";\n BigInteger n = new BigInteger(1, d), b = BigInteger.valueOf(a.length());\n StringBuilder sb = new StringBuilder();\n while (n.compareTo(BigInteger.ZERO) \u003e 0) { BigInteger[] qr = n.divideAndRemainder(b); sb.append(a.charAt(qr[1].intValue())); n = qr[0]; }\n for (byte x : d) { if (x == 0) sb.append(a.charAt(0)); else break; }\n return sb.reverse().toString();\n","suffix":" }\n public static void main(String[] args) {\n assert !base16Encode(new byte[]{0,97,98,99}, S).equals(\"00616263\");\n assert base16Encode(\"abc\".getBytes()).equals(\"9E9D9C\");\n assert base16Encode(new byte[]{0,97,98,99}).equals(\"F9E9D9C\");\n assert base16Encode(new byte[]{0,97,98,99}, S).equals(\"0616263\");\n }\n}\n","assertions":"assert base16Encode(new byte[]{}).equals(\"\");\nassert base16Encode(new byte[]{0}).equals(\"F\");\nassert base16Encode(new byte[]{15}).equals(\"0\");\nassert base16Encode(new byte[]{16}).equals(\"EF\");\nassert base16Encode(\"hello\".getBytes(), S).equals(\"68656C6C6F\");\n","category":"low_context"} {"id":"11","testsource":"devbench-low-context","language":"java","prefix":"import java.math.BigInteger;\npublic class LCTask11Ascii85 {\n static final String S = seq();\n static final String R = new StringBuilder(S).reverse().toString();\n static String seq() { StringBuilder s = new StringBuilder(); for (int i = 33; i \u003c= 117; i++) s.append((char)i); return s.toString(); }\n public static String ascii85Encode(byte[] d) { return ascii85Encode(d, R); }\n public static String ascii85Encode(byte[] d, String a) {\n","golden_completion":" if (d.length == 0) return \"\";\n BigInteger n = new BigInteger(1, d), b = BigInteger.valueOf(a.length());\n StringBuilder sb = new StringBuilder();\n while (n.compareTo(BigInteger.ZERO) \u003e 0) { BigInteger[] qr = n.divideAndRemainder(b); sb.append(a.charAt(qr[1].intValue())); n = qr[0]; }\n for (byte x : d) { if (x == 0) sb.append(a.charAt(0)); else break; }\n return sb.reverse().toString();\n","suffix":" }\n public static void main(String[] args) {\n assert !ascii85Encode(\"abc\".getBytes(), S).equals(\"@:E^\");\n assert ascii85Encode(\"abc\".getBytes()).equals(\"kTXN\");\n assert ascii85Encode(\"abc\".getBytes(), S).equals(\"+B\u003eH\");\n assert ascii85Encode(new byte[]{0,97,98,99}).equals(\"ukTXN\");\n }\n}\n","assertions":"assert ascii85Encode(new byte[]{}).equals(\"\");\nassert ascii85Encode(new byte[]{0}).equals(\"u\");\nassert ascii85Encode(\"zz\".getBytes()).equals(\"qY+\");\nassert ascii85Encode(new byte[]{0,97,98,99}, S).equals(\"!+B\u003eH\");\nassert ascii85Encode(\"abc\".getBytes(), R).equals(\"kTXN\");\n","category":"low_context"} {"id":"12","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask12Doc {\n static final TreeMap\u003cInteger,String\u003e GRADES = new TreeMap\u003c\u003e(Map.of(90,\"A\",80,\"B\",70,\"C\",60,\"D\",0,\"F\"));\n public static String grade(int score) {\n var e = GRADES.floorEntry(score);\n return e == null ? \"N/A\" : e.getValue();\n }\n public static String describeGrade() {\n","golden_completion":" return \"Uses a TreeMap and floorEntry(score) to find the greatest threshold key \" +\n \"less than or equal to the score. If floorEntry returns null for scores \" +\n \"below zero, the method returns N/A instead of a grade.\";\n","suffix":" }\n public static void main(String[] args) {\n assert grade(95).equals(\"A\") \u0026\u0026 grade(79).equals(\"C\");\n assert grade(0).equals(\"F\") \u0026\u0026 grade(-1).equals(\"N/A\");\n assert describeGrade().contains(\"floorEntry\");\n }\n}\n","assertions":"String d = describeGrade().toLowerCase();\nassert d.contains(\"treemap\");\nassert d.contains(\"floorentry\");\nassert d.contains(\"greatest\") || d.contains(\"largest\");\nassert d.contains(\"less than or equal\") || d.contains(\"\u003c=\");\nassert d.contains(\"null\") \u0026\u0026 d.contains(\"n/a\");\n","category":"low_context"} {"id":"13","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask13Doc {\n public static BitSet combine(BitSet a, BitSet b) {\n BitSet r = (BitSet) a.clone();\n r.or(b);\n return r;\n }\n public static String describeCombine() {\n","golden_completion":" return \"Clones the first BitSet, then calls BitSet.or on the clone to form the union. \" +\n \"The or call mutates only the cloned result, so neither input BitSet is modified, \" +\n \"and the returned BitSet contains all bits set in either input.\";\n","suffix":" }\n public static void main(String[] args) {\n BitSet a = new BitSet(); a.set(1); BitSet b = new BitSet(); b.set(2);\n BitSet r = combine(a, b);\n assert r.get(1) \u0026\u0026 r.get(2) \u0026\u0026 a.cardinality() == 1 \u0026\u0026 b.cardinality() == 1;\n assert describeCombine().contains(\"BitSet\");\n }\n}\n","assertions":"String d = describeCombine().toLowerCase();\nassert d.contains(\"clone\");\nassert d.contains(\"bitset.or\") || d.contains(\"or(\");\nassert d.contains(\"union\");\nassert d.contains(\"mutates\") || d.contains(\"in-place\");\nassert d.contains(\"neither\") || d.contains(\"not modified\") || d.contains(\"unchanged\");\n","category":"low_context"} {"id":"14","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask14Doc {\n public static List\u003cInteger\u003e topK(PriorityQueue\u003cInteger\u003e pq, int k) {\n var out = new ArrayList\u003cInteger\u003e();\n for (int i = 0; i \u003c k \u0026\u0026 !pq.isEmpty(); i++) out.add(pq.poll());\n return out;\n }\n public static String describeTopK() {\n","golden_completion":" return \"Repeatedly calls PriorityQueue.poll to remove and return up to k smallest elements \" +\n \"in heap order. Polling mutates the queue; PriorityQueue iterator or stream order \" +\n \"is not sorted, so the method must extract through poll rather than iteration.\";\n","suffix":" }\n public static void main(String[] args) {\n var pq = new PriorityQueue\u003c\u003e(List.of(5, 1, 3, 2));\n assert topK(pq, 3).equals(List.of(1, 2, 3));\n assert pq.size() == 1 \u0026\u0026 pq.peek() == 5;\n assert describeTopK().contains(\"PriorityQueue\");\n }\n}\n","assertions":"String d = describeTopK().toLowerCase();\nassert d.contains(\"priorityqueue\");\nassert d.contains(\"poll\");\nassert d.contains(\"smallest\") || d.contains(\"min\");\nassert d.contains(\"mutates\") || d.contains(\"remove\");\nassert d.contains(\"iterator\") || d.contains(\"stream\");\nassert d.contains(\"not sorted\") || d.contains(\"no sorted\");\n","category":"low_context"} {"id":"15","testsource":"devbench-low-context","language":"java","prefix":"import java.math.BigInteger;\npublic class LCTask15Z85 {\n static final String S = \"0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ.-:+=^!/*?\u0026\u003c\u003e()[]{}@%$#\";\n static final String R = new StringBuilder(S).reverse().toString();\n public static String z85Encode(byte[] d) { return z85Encode(d, R); }\n public static String z85Encode(byte[] d, String a) {\n","golden_completion":" if (d.length == 0) return \"\";\n BigInteger n = new BigInteger(1, d), b = BigInteger.valueOf(a.length());\n StringBuilder sb = new StringBuilder();\n while (n.compareTo(BigInteger.ZERO) \u003e 0) { BigInteger[] qr = n.divideAndRemainder(b); sb.append(a.charAt(qr[1].intValue())); n = qr[0]; }\n for (byte x : d) { if (x == 0) sb.append(a.charAt(0)); else break; }\n return sb.reverse().toString();\n","suffix":" }\n public static void main(String[] args) {\n assert z85Encode(\"abc\".getBytes()).equals(\"\u003ePTJ\");\n assert z85Encode(\"abc\".getBytes(), S).equals(\"axtD\");\n assert z85Encode(new byte[]{0,97,98,99}).equals(\"#\u003ePTJ\");\n assert z85Encode(\"hi\".getBytes()).equals(\"@pJ\");\n }\n}\n","assertions":"assert z85Encode(new byte[]{}).equals(\"\");\nassert z85Encode(new byte[]{0}).equals(\"#\");\nassert z85Encode(new byte[]{0,97,98,99}, S).equals(\"0axtD\");\nassert z85Encode(\"hello\".getBytes(), S).equals(\"1g4I1(m\");\nassert z85Encode(\"abc\".getBytes(), R).equals(\"\u003ePTJ\");\n","category":"low_context"} {"id":"16","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\nimport java.util.regex.*;\npublic class LCTask16Doc {\n public static List\u003cString\u003e extractWords(String text, String word) {\n var out = new ArrayList\u003cString\u003e();\n Matcher m = Pattern.compile(\"(?i)\\\\b\" + Pattern.quote(word) + \"\\\\b\").matcher(text);\n while (m.find()) out.add(m.group());\n return out;\n }\n public static String describeExtractWords() {\n","golden_completion":" return \"Builds a case-insensitive regex with (?i), wraps the searched word in word boundaries, \" +\n \"and uses Pattern.quote so metacharacters are literal. Matcher.find collects each \" +\n \"matched group while preserving the original case from the input text.\";\n","suffix":" }\n public static void main(String[] args) {\n assert extractWords(\"The THE the\", \"the\").size() == 3;\n assert extractWords(\"cat catalog\", \"cat\").size() == 1;\n assert extractWords(\"a.b A.B\", \"a.b\").size() == 2;\n assert describeExtractWords().contains(\"Pattern.quote\");\n }\n}\n","assertions":"String d = describeExtractWords().toLowerCase();\nassert d.contains(\"pattern.quote\");\nassert d.contains(\"case-insensitive\") || d.contains(\"(?i)\");\nassert d.contains(\"word boundaries\") || d.contains(\"\\b\");\nassert d.contains(\"matcher.find\") || d.contains(\"find\");\nassert d.contains(\"original case\") || d.contains(\"preserving\");\n","category":"low_context"} {"id":"17","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask17Doc {\n public static int roundHalfAwayFromZero(double x) {\n if (x \u003e= 0) return (int) Math.floor(x + 0.5);\n return (int) -Math.floor(-x + 0.5);\n }\n public static String describeRoundHalfAwayFromZero() {\n","golden_completion":" return \"Rounds halves away from zero by using Math.floor(x + 0.5) for nonnegative values \" +\n \"and negating Math.floor(-x + 0.5) for negatives. This differs from Math.round, \" +\n \"so -2.5 becomes -3 while 2.5 becomes 3.\";\n","suffix":" }\n public static void main(String[] args) {\n assert roundHalfAwayFromZero(2.5) == 3;\n assert roundHalfAwayFromZero(-2.5) == -3;\n assert roundHalfAwayFromZero(-2.3) == -2;\n assert describeRoundHalfAwayFromZero().contains(\"away from zero\");\n }\n}\n","assertions":"String d = describeRoundHalfAwayFromZero().toLowerCase();\nassert d.contains(\"away from zero\");\nassert d.contains(\"math.floor\");\nassert d.contains(\"negative\") || d.contains(\"negating\");\nassert d.contains(\"math.round\");\nassert d.contains(\"-2.5\") \u0026\u0026 d.contains(\"-3\");\n","category":"low_context"} {"id":"18","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask18Doc {\n static final ThreadLocal\u003cList\u003cString\u003e\u003e TL = ThreadLocal.withInitial(ArrayList::new);\n public static String describeThreadLocalList() {\n","golden_completion":" return \"Defines a ThreadLocal.withInitial(ArrayList::new) so each thread gets its own fresh \" +\n \"mutable ArrayList. Calling remove clears the current thread\u0027s value, and the next get \" +\n \"runs the supplier again to create a new empty list.\";\n","suffix":" }\n public static void main(String[] args) {\n TL.get().add(\"a\"); TL.get().add(\"b\");\n assert TL.get().size() == 2;\n TL.remove();\n assert TL.get().isEmpty();\n assert describeThreadLocalList().contains(\"ThreadLocal\");\n }\n}\n","assertions":"String d = describeThreadLocalList().toLowerCase();\nassert d.contains(\"threadlocal.withinitial\");\nassert d.contains(\"arraylist::new\") || d.contains(\"supplier\");\nassert d.contains(\"per-thread\") || d.contains(\"each thread\");\nassert d.contains(\"remove\");\nassert d.contains(\"fresh\") || d.contains(\"new empty\");\n","category":"low_context"} {"id":"19","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask19Doc {\n static Map\u003cString,String\u003e ALIAS = Map.of(\"admin\",\"root\",\"root\",\"superuser\");\n static Map\u003cString,Integer\u003e LEVEL = Map.of(\"superuser\",9,\"root\",5);\n public static Optional\u003cInteger\u003e resolveLevel(String user) {\n return Optional.ofNullable(user).flatMap(u -\u003e Optional.ofNullable(ALIAS.get(u))).flatMap(a -\u003e Optional.ofNullable(ALIAS.get(a))).flatMap(r -\u003e Optional.ofNullable(LEVEL.get(r)));\n }\n public static String describeResolveLevel() {\n","golden_completion":" return \"Starts with Optional.ofNullable(user), then uses flatMap through exactly two ALIAS \" +\n \"lookups before consulting LEVEL. Missing aliases become Optional.empty, so admin \" +\n \"resolves to superuser level 9 while root itself becomes empty after the second hop.\";\n","suffix":" }\n public static void main(String[] args) {\n assert resolveLevel(\"admin\").orElse(-1) == 9;\n assert resolveLevel(\"root\").isEmpty();\n assert resolveLevel(null).isEmpty();\n assert describeResolveLevel().contains(\"flatMap\");\n }\n}\n","assertions":"String d = describeResolveLevel().toLowerCase();\nassert d.contains(\"optional.ofnullable\");\nassert d.contains(\"flatmap\");\nassert d.contains(\"two\") || d.contains(\"second\");\nassert d.contains(\"optional.empty\") || d.contains(\"empty\");\nassert d.contains(\"root\") \u0026\u0026 d.contains(\"empty\");\n","category":"low_context"} {"id":"20","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask20Doc {\n record Entry(String name, int value) {\n public boolean equals(Object o) { return o instanceof Entry e \u0026\u0026 name.equalsIgnoreCase(e.name); }\n public int hashCode() { return name.toLowerCase().hashCode(); }\n }\n public static String describeEntryEquality() {\n","golden_completion":" return \"Entry overrides the record-generated equals and hashCode so equality depends only on \" +\n \"name using String.equalsIgnoreCase; value is ignored. hashCode lowercases the name, \" +\n \"making HashSet deduplicate entries with the same case-insensitive name.\";\n","suffix":" }\n public static void main(String[] args) {\n assert new Entry(\"Alice\", 1).equals(new Entry(\"alice\", 99));\n var s = new HashSet\u003c\u003e(List.of(new Entry(\"X\",1), new Entry(\"x\",2)));\n assert s.size() == 1;\n assert describeEntryEquality().contains(\"equalsIgnoreCase\");\n }\n}\n","assertions":"String d = describeEntryEquality().toLowerCase();\nassert d.contains(\"record-generated\") || d.contains(\"record generated\");\nassert d.contains(\"equalsignorecase\");\nassert d.contains(\"hashcode\");\nassert d.contains(\"lowercase\");\nassert d.contains(\"value is ignored\") || d.contains(\"ignores value\");\nassert d.contains(\"hashset\");\n","category":"low_context"} {"id":"21","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask21Doc {\n public static Map\u003cString,Integer\u003e mergeCounts(Map\u003cString,Integer\u003e base, Map\u003cString,Integer\u003e delta) {\n Map\u003cString,Integer\u003e r = new HashMap\u003c\u003e(base);\n delta.forEach((k, v) -\u003e r.merge(k, v, (old, nw) -\u003e old + nw \u003c= 0 ? null : old + nw));\n return r;\n }\n public static String describeMergeCounts() {\n","golden_completion":" return \"Copies base into a new HashMap, then applies each delta with Map.merge. \" +\n \"The remapping function sums old and new values, and returning null removes the key \" +\n \"when the sum is zero or negative, leaving the original base map unmodified.\";\n","suffix":" }\n public static void main(String[] args) {\n var b = new HashMap\u003c\u003e(Map.of(\"a\",3,\"b\",2));\n var r = mergeCounts(b, Map.of(\"a\",1,\"b\",-2,\"c\",5));\n assert r.get(\"a\") == 4 \u0026\u0026 !r.containsKey(\"b\") \u0026\u0026 r.get(\"c\") == 5;\n assert b.get(\"b\") == 2;\n assert describeMergeCounts().contains(\"Map.merge\");\n }\n}\n","assertions":"String d = describeMergeCounts().toLowerCase();\nassert d.contains(\"hashmap\");\nassert d.contains(\"map.merge\");\nassert d.contains(\"remapping\") || d.contains(\"remap\");\nassert d.contains(\"returning null\") || d.contains(\"null removes\");\nassert d.contains(\"zero\") \u0026\u0026 d.contains(\"negative\");\nassert d.contains(\"unmodified\") || d.contains(\"original\");\n","category":"low_context"} {"id":"22","testsource":"devbench-low-context","language":"java","prefix":"import java.util.Arrays;\npublic class LCTask22 {\n // Sort by last digit (of absolute value), then by absolute magnitude for ties\n public static int[] sortByLastDigit(int[] arr) {\n","golden_completion":" Integer[] boxed = Arrays.stream(arr).boxed().toArray(Integer[]::new);\n Arrays.sort(boxed, (a, b) -\u003e {\n int cmp = Integer.compare(Math.abs(a) % 10, Math.abs(b) % 10);\n return cmp != 0 ? cmp : Integer.compare(Math.abs(a), Math.abs(b));\n });\n return Arrays.stream(boxed).mapToInt(Integer::intValue).toArray();\n","suffix":" }\n public static void main(String[] args) {\n assert Arrays.equals(sortByLastDigit(new int[]{23, 11, 42, 35}), new int[]{11, 42, 23, 35});\n assert Arrays.equals(sortByLastDigit(new int[]{-15, 5, 25}), new int[]{5, -15, 25});\n assert Arrays.equals(sortByLastDigit(new int[]{100, 33, 7, 21}), new int[]{100, 21, 33, 7});\n assert Arrays.equals(sortByLastDigit(new int[]{9, 19, 29}), new int[]{9, 19, 29});\n }\n}\n","assertions":"assert Arrays.equals(sortByLastDigit(new int[]{}), new int[]{});\nassert Arrays.equals(sortByLastDigit(new int[]{7}), new int[]{7});\nassert Arrays.equals(sortByLastDigit(new int[]{30, 10, 20}), new int[]{10, 20, 30});\n","category":"low_context"} {"id":"23","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask23 {\n // Returns an unmodifiable view that reflects later changes to the source list\n public static List\u003cString\u003e frozenView(List\u003cString\u003e src) {\n","golden_completion":" return Collections.unmodifiableList(src);\n","suffix":" }\n public static void main(String[] args) {\n List\u003cString\u003e base = new ArrayList\u003c\u003e(List.of(\"a\", \"b\"));\n List\u003cString\u003e view = frozenView(base);\n base.add(\"c\");\n assert view.size() == 3 : \"view must reflect changes\";\n assert view.contains(\"c\");\n try { view.add(\"d\"); assert false; } catch (UnsupportedOperationException e) {}\n base.add(\"e\");\n assert view.size() == 4 : \"reflects all source mutations\";\n }\n}\n","assertions":"List\u003cString\u003e b2 = new ArrayList\u003c\u003e(List.of(\"x\"));\nList\u003cString\u003e v2 = frozenView(b2);\nb2.add(\"y\");\nassert v2.size() == 2;\ntry { v2.add(\"z\"); assert false; } catch (UnsupportedOperationException e) {}\n","category":"low_context"} {"id":"24","testsource":"devbench-low-context","language":"java","prefix":"import java.util.concurrent.atomic.AtomicInteger;\npublic class LCTask24 {\n // Atomically replaces val with newVal, returns array of [oldValue, currentValue]\n public static int[] swapAndReport(AtomicInteger val, int newVal) {\n","golden_completion":" int old = val.getAndSet(newVal);\n return new int[]{old, val.get()};\n","suffix":" }\n public static void main(String[] args) {\n AtomicInteger a = new AtomicInteger(10);\n int[] r = swapAndReport(a, 42);\n assert r[0] == 10 : \"first element is old value\";\n assert r[1] == 42 : \"second element is new value\";\n int[] r2 = swapAndReport(a, 0);\n assert r2[0] == 42 \u0026\u0026 r2[1] == 0;\n }\n}\n","assertions":"{\nAtomicInteger ha2 = new AtomicInteger(0);\nint[] hr2 = swapAndReport(ha2, -5);\nassert hr2[0] == 0;\nassert hr2[1] == -5;\nint[] hr3 = swapAndReport(ha2, 100);\nassert hr3[0] == -5;\nassert hr3[1] == 100;\n\n}","category":"low_context"} {"id":"25","testsource":"devbench-low-context","language":"java","prefix":"import java.util.BitSet;\npublic class LCTask25 {\n // Returns union of a and b WITHOUT modifying either input\n public static BitSet combine(BitSet a, BitSet b) {\n","golden_completion":" BitSet result = (BitSet) a.clone();\n result.or(b);\n return result;\n","suffix":" }\n public static void main(String[] args) {\n BitSet x = new BitSet(); x.set(1); x.set(3);\n BitSet y = new BitSet(); y.set(2); y.set(3);\n BitSet r = combine(x, y);\n assert r.get(1) \u0026\u0026 r.get(2) \u0026\u0026 r.get(3) : \"union of bits\";\n assert r.cardinality() == 3;\n assert x.cardinality() == 2 : \"original a unchanged\";\n assert y.cardinality() == 2 : \"original b unchanged\";\n }\n}\n","assertions":"BitSet e1 = new BitSet(); BitSet e2 = new BitSet();\nassert combine(e1, e2).isEmpty();\nBitSet s1 = new BitSet(); s1.set(0); s1.set(5);\nBitSet s2 = new BitSet(); s2.set(5); s2.set(10);\nBitSet sr = combine(s1, s2);\nassert sr.cardinality() == 3;\nassert sr.get(0) \u0026\u0026 sr.get(5) \u0026\u0026 sr.get(10);\n","category":"low_context"} {"id":"26","testsource":"devbench-low-context","language":"java","prefix":"import java.util.regex.*;\nimport java.util.List;\nimport java.util.ArrayList;\npublic class LCTask26 {\n public static List\u003cString\u003e extractWords(String text, String word) {\n","golden_completion":" List\u003cString\u003e matches = new ArrayList\u003c\u003e();\n Matcher m = Pattern.compile(\"(?i)\\\\b\" + Pattern.quote(word) + \"\\\\b\").matcher(text);\n while (m.find()) matches.add(m.group());\n return matches;\n","suffix":" }\n public static void main(String[] args) {\n List\u003cString\u003e r = extractWords(\"The THE the tHe\", \"the\");\n assert r.size() == 4;\n assert r.get(0).equals(\"The\") \u0026\u0026 r.get(1).equals(\"THE\");\n assert extractWords(\"cat catalog\", \"cat\").size() == 1;\n assert extractWords(\"end. End! END?\", \"end\").size() == 3;\n }\n}\n","assertions":"assert extractWords(\"\", \"x\").isEmpty();\nassert extractWords(\"Hello HELLO\", \"hello\").size() == 2;\nassert extractWords(\"a.b\", \"a.b\").size() == 1;\nassert extractWords(\"dot.com DOT.COM\", \"dot.com\").size() == 2;\n","category":"low_context"} {"id":"27","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask27 {\n // Round half away from zero: 2.5-\u003e3, -2.5-\u003e-3, 2.3-\u003e2, -2.3-\u003e-2\n public static int roundHalfAwayFromZero(double x) {\n","golden_completion":" if (x \u003e= 0) return (int) Math.floor(x + 0.5);\n return (int) -Math.floor(-x + 0.5);\n","suffix":" }\n public static void main(String[] args) {\n assert roundHalfAwayFromZero(2.5) == 3;\n assert roundHalfAwayFromZero(-2.5) == -3;\n assert roundHalfAwayFromZero(2.3) == 2;\n assert roundHalfAwayFromZero(-2.3) == -2;\n assert roundHalfAwayFromZero(0.5) == 1;\n assert roundHalfAwayFromZero(-0.5) == -1;\n assert roundHalfAwayFromZero(0.0) == 0;\n }\n}\n","assertions":"assert roundHalfAwayFromZero(-1.5) == -2;\nassert roundHalfAwayFromZero(3.7) == 4;\nassert roundHalfAwayFromZero(-3.7) == -4;\nassert roundHalfAwayFromZero(1.0) == 1;\nassert roundHalfAwayFromZero(-1.0) == -1;\n","category":"low_context"} {"id":"28","testsource":"devbench-low-context","language":"java","prefix":"import java.util.function.Function;\npublic class LCTask28 {\n // Returns a function that applies f first, then g to the result\n public static Function\u003cInteger, Integer\u003e pipeline(Function\u003cInteger, Integer\u003e f, Function\u003cInteger, Integer\u003e g) {\n","golden_completion":" return f.andThen(g);\n","suffix":" }\n public static void main(String[] args) {\n Function\u003cInteger, Integer\u003e dbl = x -\u003e x * 2;\n Function\u003cInteger, Integer\u003e inc = x -\u003e x + 1;\n assert pipeline(dbl, inc).apply(3) == 7 : \"dbl then inc: 3*2+1=7\";\n assert pipeline(inc, dbl).apply(3) == 8 : \"inc then dbl: (3+1)*2=8\";\n Function\u003cInteger, Integer\u003e sq = x -\u003e x * x;\n assert pipeline(dbl, sq).apply(3) == 36 : \"3*2=6, 6^2=36\";\n assert pipeline(sq, dbl).apply(3) == 18 : \"3^2=9, 9*2=18\";\n }\n}\n","assertions":"Function\u003cInteger, Integer\u003e neg = x -\u003e -x;\nassert pipeline(neg, neg).apply(5) == 5;\nassert pipeline(x -\u003e x + 10, x -\u003e x * 2).apply(5) == 30;\nassert pipeline(x -\u003e x * 2, x -\u003e x + 10).apply(5) == 20;\n","category":"low_context"} {"id":"29","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask29 {\n // Merge delta into base: sum values; if sum \u003c= 0, REMOVE the key entirely\n public static Map\u003cString, Integer\u003e mergeCounts(Map\u003cString, Integer\u003e base, Map\u003cString, Integer\u003e delta) {\n","golden_completion":" Map\u003cString, Integer\u003e result = new HashMap\u003c\u003e(base);\n delta.forEach((k, v) -\u003e result.merge(k, v, (old, nw) -\u003e {\n int sum = old + nw;\n return sum \u003c= 0 ? null : sum;\n }));\n return result;\n","suffix":" }\n public static void main(String[] args) {\n Map\u003cString, Integer\u003e b = new HashMap\u003c\u003e(Map.of(\"a\", 3, \"b\", 2));\n Map\u003cString, Integer\u003e d = new HashMap\u003c\u003e(Map.of(\"a\", 1, \"b\", -2, \"c\", 5));\n Map\u003cString, Integer\u003e r = mergeCounts(b, d);\n assert r.get(\"a\") == 4;\n assert !r.containsKey(\"b\") : \"b sums to 0, must be removed\";\n assert r.get(\"c\") == 5;\n }\n}\n","assertions":"Map\u003cString, Integer\u003e e = mergeCounts(new HashMap\u003c\u003e(), new HashMap\u003c\u003e(Map.of(\"x\", 1)));\nassert e.get(\"x\") == 1;\nMap\u003cString, Integer\u003e e2 = mergeCounts(new HashMap\u003c\u003e(Map.of(\"x\", 5)), new HashMap\u003c\u003e(Map.of(\"x\", -10)));\nassert !e2.containsKey(\"x\");\nMap\u003cString, Integer\u003e e3 = mergeCounts(new HashMap\u003c\u003e(Map.of(\"a\", 1)), new HashMap\u003c\u003e());\nassert e3.get(\"a\") == 1;\n","category":"low_context"} {"id":"30","testsource":"devbench-low-context","language":"java","prefix":"import java.util.stream.*;\npublic class LCTask30 {\n // Count the number of distinct characters in a string (case-sensitive)\n public static long distinctChars(String s) {\n","golden_completion":" return s.chars().distinct().count();\n","suffix":" }\n public static void main(String[] args) {\n assert distinctChars(\"aabbc\") == 3;\n assert distinctChars(\"\") == 0;\n assert distinctChars(\"abcabc\") == 3;\n assert distinctChars(\"AaBb\") == 4 : \"case-sensitive\";\n assert distinctChars(\"zzz\") == 1;\n assert distinctChars(\"12321\") == 3;\n assert distinctChars(\"a b c\") == 4 : \"spaces count\";\n }\n}\n","assertions":"assert distinctChars(\"a\") == 1;\nassert distinctChars(\"aaaa\") == 1;\nassert distinctChars(\"abcdef\") == 6;\nassert distinctChars(\"Hello World\") == 8;\n","category":"low_context"} {"id":"31","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask31 {\n static final TreeMap\u003cInteger, String\u003e GRADES = new TreeMap\u003c\u003e(Map.of(\n 90, \"A\", 80, \"B\", 70, \"C\", 60, \"D\", 0, \"F\"));\n /** Return grade for score using floor lookup (largest key \u003c= score). */\n public static String grade(int score) {\n","golden_completion":" Map.Entry\u003cInteger, String\u003e e = GRADES.floorEntry(score);\n return e == null ? \"N/A\" : e.getValue();\n","suffix":" }\n public static void main(String[] args) {\n assert grade(95).equals(\"A\");\n assert grade(85).equals(\"B\");\n assert grade(70).equals(\"C\");\n assert grade(65).equals(\"D\");\n assert grade(50).equals(\"F\");\n assert grade(-5).equals(\"N/A\");\n }\n}\n","assertions":"assert grade(90).equals(\"A\");\nassert grade(80).equals(\"B\");\nassert grade(0).equals(\"F\");\nassert grade(100).equals(\"A\");\nassert grade(79).equals(\"C\");\nassert grade(59).equals(\"F\");\nassert grade(-1).equals(\"N/A\");\n","category":"low_context"} {"id":"32","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask32 {\n /** Create a LinkedHashMap in access-order mode with max 3 entries.\n * Oldest-accessed entry is removed when capacity exceeds 3. */\n public static LinkedHashMap\u003cString, Integer\u003e makeLRU() {\n","golden_completion":" return new LinkedHashMap\u003c\u003e(16, 0.75f, true) {\n protected boolean removeEldestEntry(Map.Entry\u003cString, Integer\u003e e) {\n return size() \u003e 3;\n }\n };\n","suffix":" }\n public static void main(String[] args) {\n var m = makeLRU();\n m.put(\"a\", 1); m.put(\"b\", 2); m.put(\"c\", 3);\n m.get(\"a\"); // access \"a\" so it becomes most-recent\n m.put(\"d\", 4); // evicts \"b\" (oldest-accessed), not \"a\"\n assert !m.containsKey(\"b\") : \"b was oldest-accessed, should be evicted\";\n assert m.containsKey(\"a\") : \"a was accessed, should survive\";\n assert m.size() == 3;\n }\n}\n","assertions":"var m2 = makeLRU();\nm2.put(\"x\", 1); m2.put(\"y\", 2); m2.put(\"z\", 3);\nm2.put(\"w\", 4);\nassert !m2.containsKey(\"x\") : \"x was oldest, should be evicted\";\nassert m2.size() == 3;\nvar m3 = makeLRU();\nm3.put(\"a\", 1); m3.put(\"b\", 2); m3.put(\"c\", 3);\nm3.get(\"a\"); m3.get(\"b\");\nm3.put(\"d\", 4);\nassert !m3.containsKey(\"c\") : \"c was oldest-accessed\";\nassert m3.containsKey(\"a\") \u0026\u0026 m3.containsKey(\"b\");\n","category":"low_context"} {"id":"33","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask33 {\n /** Extract top-k smallest elements from the queue in sorted order. */\n public static List\u003cInteger\u003e topK(PriorityQueue\u003cInteger\u003e pq, int k) {\n","golden_completion":" List\u003cInteger\u003e result = new ArrayList\u003c\u003e();\n for (int i = 0; i \u003c k \u0026\u0026 !pq.isEmpty(); i++) {\n result.add(pq.poll());\n }\n return result;\n","suffix":" }\n public static void main(String[] args) {\n var pq = new PriorityQueue\u003c\u003e(List.of(5, 1, 3, 2, 4));\n assert topK(pq, 3).equals(List.of(1, 2, 3));\n assert topK(new PriorityQueue\u003c\u003e(List.of(9, 7)), 5).equals(List.of(7, 9));\n assert topK(new PriorityQueue\u003c\u003e(), 2).equals(List.of());\n }\n}\n","assertions":"var pq2 = new PriorityQueue\u003c\u003e(List.of(10, 20, 30, 40, 50));\nassert topK(pq2, 1).equals(List.of(10));\nvar pq3 = new PriorityQueue\u003c\u003e(List.of(3, 1, 4, 1, 5));\nassert topK(pq3, 4).equals(List.of(1, 1, 3, 4));\nassert topK(new PriorityQueue\u003c\u003e(List.of(42)), 1).equals(List.of(42));\n","category":"low_context"} {"id":"34","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask34 {\n /** Swap first and last elements via the list view of the array.\n * Changes must be visible in BOTH the array and the returned list.\n * The returned list must be the SAME fixed-size view, NOT a copy. */\n public static List\u003cString\u003e swapEnds(String[] arr) {\n","golden_completion":" List\u003cString\u003e view = Arrays.asList(arr);\n String tmp = view.get(0);\n view.set(0, view.get(view.size() - 1));\n view.set(view.size() - 1, tmp);\n return view;\n","suffix":" }\n public static void main(String[] args) {\n String[] a = {\"x\", \"y\", \"z\"};\n List\u003cString\u003e v = swapEnds(a);\n assert a[0].equals(\"z\") : \"array must reflect swap\";\n assert a[2].equals(\"x\");\n assert v.get(0).equals(\"z\") : \"list must reflect swap\";\n try { v.add(\"w\"); assert false; } catch (UnsupportedOperationException e) {}\n }\n}\n","assertions":"String[] a2 = {\"a\", \"b\"};\nList\u003cString\u003e v2 = swapEnds(a2);\nassert a2[0].equals(\"b\") \u0026\u0026 a2[1].equals(\"a\");\nassert v2.get(0).equals(\"b\");\ntry { v2.add(\"c\"); assert false; } catch (UnsupportedOperationException e) {}\nString[] a3 = {\"only\"};\nList\u003cString\u003e v3 = swapEnds(a3);\nassert a3[0].equals(\"only\");\nassert v3.size() == 1;\n","category":"low_context"} {"id":"35","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask35 {\n static final String DIGITS = \"zyxwvutsrqponmlkjihgfedcba9876543210\";\n /** Convert to base-N string using DIGITS (z=0, y=1, ..., 0=35). */\n public static String toBaseN(int n, int base) {\n","golden_completion":" if (n == 0) return \"\" + DIGITS.charAt(0);\n StringBuilder sb = new StringBuilder();\n boolean neg = n \u003c 0; int v = Math.abs(n);\n while (v \u003e 0) { sb.append(DIGITS.charAt(v % base)); v /= base; }\n if (neg) sb.append(\u0027-\u0027);\n return sb.reverse().toString();\n","suffix":" }\n public static void main(String[] args) {\n assert toBaseN(0, 10).equals(\"z\");\n assert toBaseN(1, 10).equals(\"y\");\n assert toBaseN(10, 10).equals(\"yz\");\n assert !toBaseN(10, 10).equals(\"10\");\n assert toBaseN(15, 16).equals(\"k\");\n assert toBaseN(255, 16).equals(\"kk\");\n }\n}\n","assertions":"assert toBaseN(2, 2).equals(\"yz\");\nassert toBaseN(7, 8).equals(\"s\");\nassert toBaseN(8, 8).equals(\"yz\");\nassert toBaseN(35, 36).equals(\"0\");\nassert toBaseN(36, 36).equals(\"yz\");\nassert toBaseN(-1, 10).equals(\"-y\");\nassert toBaseN(100, 10).equals(\"yzz\");\n","category":"low_context"} {"id":"36","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask36 {\n enum Color { RED, GREEN, BLUE, YELLOW, BLACK, WHITE }\n /** Returns EnumSet of colors NOT in the given set (complement). */\n public static EnumSet\u003cColor\u003e complement(EnumSet\u003cColor\u003e colors) {\n","golden_completion":" return EnumSet.complementOf(colors);\n","suffix":" }\n public static void main(String[] args) {\n var warm = EnumSet.of(Color.RED, Color.YELLOW);\n var comp = complement(warm);\n assert comp.size() == 4;\n assert comp.contains(Color.GREEN) \u0026\u0026 comp.contains(Color.BLUE);\n assert comp.contains(Color.BLACK) \u0026\u0026 comp.contains(Color.WHITE);\n assert !comp.contains(Color.RED);\n }\n}\n","assertions":"assert complement(EnumSet.allOf(Color.class)).isEmpty();\nassert complement(EnumSet.noneOf(Color.class)).size() == 6;\nvar single = EnumSet.of(Color.BLACK);\nvar c = complement(single);\nassert c.size() == 5 \u0026\u0026 !c.contains(Color.BLACK);\n","category":"low_context"} {"id":"37","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask37 {\n /** Returns true only if a and b are the SAME interned string instance.\n * Both strings are interned before comparison. Uses == (identity). */\n public static boolean sameInterned(String a, String b) {\n","golden_completion":" return a.intern() == b.intern();\n","suffix":" }\n public static void main(String[] args) {\n assert sameInterned(\"hello\", \"hello\");\n assert sameInterned(\"hel\" + \"lo\", \"hello\");\n assert sameInterned(new String(\"test\"), \"test\");\n assert sameInterned(new String(\"abc\"), new String(\"abc\"));\n assert !sameInterned(\"foo\", \"bar\");\n assert !sameInterned(\"hello\", \"HELLO\") : \"case-sensitive\";\n }\n}\n","assertions":"assert sameInterned(\"\", \"\");\nassert sameInterned(new String(\"x\"), new String(\"x\"));\nassert !sameInterned(\"a\", \"b\");\nString s1 = \"hello world\";\nString s2 = new String(\"hello world\");\nassert sameInterned(s1, s2);\nassert sameInterned(\"123\", new String(\"123\"));\n","category":"low_context"} {"id":"38","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask38 {\n /** Format integer with custom grouping: groups of 2 from the right,\n * separated by underscores. E.g., 1234567 -\u003e \"1_23_45_67\". */\n public static String groupDigits(long n) {\n","golden_completion":" String s = Long.toString(Math.abs(n));\n StringBuilder sb = new StringBuilder();\n int start = s.length() % 2;\n if (start \u003e 0) sb.append(s, 0, start);\n for (int i = start; i \u003c s.length(); i += 2) {\n if (sb.length() \u003e 0) sb.append(\u0027_\u0027);\n sb.append(s, i, i + 2);\n }\n return n \u003c 0 ? \"-\" + sb : sb.toString();\n","suffix":" }\n public static void main(String[] args) {\n assert groupDigits(1234567).equals(\"1_23_45_67\");\n assert groupDigits(12).equals(\"12\");\n assert groupDigits(123).equals(\"1_23\");\n assert groupDigits(1).equals(\"1\");\n assert groupDigits(0).equals(\"0\");\n assert groupDigits(-1234).equals(\"-12_34\");\n }\n}\n","assertions":"assert groupDigits(99).equals(\"99\");\nassert groupDigits(100).equals(\"1_00\");\nassert groupDigits(1000).equals(\"10_00\");\nassert groupDigits(12345678).equals(\"12_34_56_78\");\nassert groupDigits(-1).equals(\"-1\");\nassert groupDigits(10).equals(\"10\");\n","category":"low_context"} {"id":"39","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask39 {\n /** Create a ThreadLocal that starts as a fresh empty ArrayList for each thread. */\n static final ThreadLocal\u003cList\u003cString\u003e\u003e TL = ThreadLocal.withInitial(\n","golden_completion":" ArrayList::new\n","suffix":" );\n public static void main(String[] args) {\n TL.get().add(\"a\");\n TL.get().add(\"b\");\n assert TL.get().size() == 2;\n TL.remove();\n assert TL.get().isEmpty() : \"after remove, get() returns fresh list\";\n TL.get().add(\"x\");\n assert TL.get().size() == 1;\n }\n}\n","assertions":"TL.remove();\nassert TL.get().isEmpty();\nTL.get().add(\"test\");\nassert TL.get().contains(\"test\");\nTL.remove();\nassert TL.get().size() == 0;\n","category":"low_context"} {"id":"40","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\npublic class LCTask40 {\n static final String T = \"YES\", F = \"NO\";\n /** Format each boolean as T/F string, join with \" | \". */\n public static String formatFlags(boolean... flags) {\n","golden_completion":" StringBuilder sb = new StringBuilder();\n for (int i = 0; i \u003c flags.length; i++) {\n if (i \u003e 0) sb.append(\" | \");\n sb.append(flags[i] ? T : F);\n }\n return sb.toString();\n","suffix":" }\n public static void main(String[] args) {\n assert formatFlags(true, false, true).equals(\"YES | NO | YES\");\n assert formatFlags(false).equals(\"NO\");\n assert formatFlags().equals(\"\");\n assert !formatFlags(true).equals(\"true\");\n }\n}\n","assertions":"assert formatFlags(true, true).equals(\"YES | YES\");\nassert formatFlags(false, false).equals(\"NO | NO\");\nassert formatFlags(true, false, false, true).equals(\"YES | NO | NO | YES\");\nassert formatFlags().equals(\"\");\n","category":"low_context"} {"id":"41","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\npublic class LCTask41 {\n /** Generate sequence: start, start*2, start*4, ... while value \u003c limit.\n * Uses Stream.iterate(seed, hasNext, next). */\n public static List\u003cInteger\u003e doublingSeq(int start, int limit) {\n","golden_completion":" return Stream.iterate(start, n -\u003e n \u003c limit, n -\u003e n * 2)\n .collect(Collectors.toList());\n","suffix":" }\n public static void main(String[] args) {\n assert doublingSeq(1, 10).equals(List.of(1, 2, 4, 8));\n assert doublingSeq(3, 25).equals(List.of(3, 6, 12, 24));\n assert doublingSeq(5, 5).equals(List.of());\n assert doublingSeq(1, 1).equals(List.of());\n }\n}\n","assertions":"assert doublingSeq(1, 2).equals(List.of(1));\nassert doublingSeq(2, 100).equals(List.of(2, 4, 8, 16, 32, 64));\nassert doublingSeq(10, 11).equals(List.of(10));\nassert doublingSeq(100, 50).equals(List.of());\n","category":"low_context"} {"id":"42","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask42 {\n /** Clear elements from index \u0027from\u0027 to \u0027to\u0027 (exclusive) in-place\n * by using subList().clear(). Returns the modified list. */\n public static \u003cT\u003e List\u003cT\u003e clearRange(List\u003cT\u003e list, int from, int to) {\n","golden_completion":" list.subList(from, to).clear();\n return list;\n","suffix":" }\n public static void main(String[] args) {\n List\u003cInteger\u003e a = new ArrayList\u003c\u003e(List.of(1, 2, 3, 4, 5));\n clearRange(a, 1, 3);\n assert a.equals(List.of(1, 4, 5)) : a;\n List\u003cString\u003e b = new ArrayList\u003c\u003e(List.of(\"x\", \"y\", \"z\"));\n clearRange(b, 0, 2);\n assert b.equals(List.of(\"z\")) : b;\n }\n}\n","assertions":"List\u003cInteger\u003e c = new ArrayList\u003c\u003e(List.of(10, 20, 30));\nclearRange(c, 0, 3);\nassert c.isEmpty();\nList\u003cInteger\u003e d = new ArrayList\u003c\u003e(List.of(1, 2, 3, 4));\nclearRange(d, 2, 4);\nassert d.equals(List.of(1, 2));\nList\u003cInteger\u003e e = new ArrayList\u003c\u003e(List.of(5));\nclearRange(e, 0, 1);\nassert e.isEmpty();\n","category":"low_context"} {"id":"43","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\npublic class LCTask43 {\n /** Count strings that START WITH the given prefix (case-insensitive).\n * NOT the same as Collections.frequency (which needs exact match). */\n public static long countByPrefix(List\u003cString\u003e items, String prefix) {\n","golden_completion":" String lp = prefix.toLowerCase();\n return items.stream()\n .filter(s -\u003e s.toLowerCase().startsWith(lp))\n .count();\n","suffix":" }\n public static void main(String[] args) {\n var list = List.of(\"Apple\", \"Apricot\", \"Banana\", \"avocado\");\n assert countByPrefix(list, \"ap\") == 2;\n assert countByPrefix(list, \"a\") == 3;\n assert countByPrefix(list, \"banana\") == 1;\n assert countByPrefix(list, \"z\") == 0;\n }\n}\n","assertions":"assert countByPrefix(List.of(), \"x\") == 0;\nassert countByPrefix(List.of(\"a\", \"A\", \"aa\", \"b\"), \"a\") == 3;\nassert countByPrefix(List.of(\"Hello\", \"HELP\", \"hero\"), \"HE\") == 3;\nassert countByPrefix(List.of(\"test\"), \"TEST\") == 1;\n","category":"low_context"} {"id":"44","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask44 {\n /** Map grade letter to GPA using switch expression with yield.\n * A-\u003e4.0, B-\u003e3.0, C-\u003e2.0, D-\u003e1.0, F-\u003e0.0.\n * If modifier is \u0027+\u0027, add 0.3 (but cap at 4.0).\n * If modifier is \u0027-\u0027, subtract 0.3 (but floor at 0.0).\n * Otherwise no modification. */\n public static double toGPA(char grade, char modifier) {\n","golden_completion":" double base = switch (grade) {\n case \u0027A\u0027 -\u003e 4.0; case \u0027B\u0027 -\u003e 3.0; case \u0027C\u0027 -\u003e 2.0;\n case \u0027D\u0027 -\u003e 1.0; case \u0027F\u0027 -\u003e 0.0;\n default -\u003e throw new IllegalArgumentException(\"Invalid grade\");\n };\n double mod = modifier == \u0027+\u0027 ? 0.3 : modifier == \u0027-\u0027 ? -0.3 : 0.0;\n return Math.max(0.0, Math.min(4.0, base + mod));\n","suffix":" }\n public static void main(String[] args) {\n assert toGPA(\u0027A\u0027, \u0027 \u0027) == 4.0;\n assert toGPA(\u0027A\u0027, \u0027+\u0027) == 4.0; // capped at 4.0\n assert toGPA(\u0027A\u0027, \u0027-\u0027) == 3.7;\n assert toGPA(\u0027B\u0027, \u0027+\u0027) == 3.3;\n assert toGPA(\u0027F\u0027, \u0027-\u0027) == 0.0; // floored at 0.0\n assert toGPA(\u0027C\u0027, \u0027 \u0027) == 2.0;\n }\n}\n","assertions":"assert toGPA(\u0027B\u0027, \u0027-\u0027) == 2.7;\nassert toGPA(\u0027D\u0027, \u0027+\u0027) == 1.3;\nassert toGPA(\u0027D\u0027, \u0027-\u0027) == 0.7;\nassert toGPA(\u0027F\u0027, \u0027 \u0027) == 0.0;\nassert toGPA(\u0027F\u0027, \u0027+\u0027) == 0.3;\ntry { toGPA(\u0027X\u0027, \u0027 \u0027); assert false; } catch (IllegalArgumentException e) {}\n","category":"low_context"} {"id":"45","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask45 {\n /** A record where equality is based ONLY on \u0027name\u0027 (case-insensitive),\n * ignoring \u0027value\u0027. Uses record with custom equals/hashCode. */\n record Entry(String name, int value) {\n","golden_completion":" @Override public boolean equals(Object o) {\n return o instanceof Entry e \u0026\u0026 name.equalsIgnoreCase(e.name);\n }\n @Override public int hashCode() {\n return name.toLowerCase().hashCode();\n }\n","suffix":" }\n public static void main(String[] args) {\n assert new Entry(\"Alice\", 1).equals(new Entry(\"alice\", 99));\n assert !new Entry(\"Alice\", 1).equals(new Entry(\"Bob\", 1));\n var set = new HashSet\u003c\u003e(List.of(new Entry(\"X\", 1), new Entry(\"x\", 2)));\n assert set.size() == 1 : \"same name -\u003e deduplicated\";\n }\n}\n","assertions":"assert new Entry(\"Test\", 5).equals(new Entry(\"TEST\", 10));\nassert new Entry(\"a\", 0).hashCode() == new Entry(\"A\", 999).hashCode();\nvar s = new HashSet\u003c\u003e(List.of(new Entry(\"k\", 1), new Entry(\"K\", 2), new Entry(\"j\", 1)));\nassert s.size() == 2;\n","category":"low_context"} {"id":"46","testsource":"devbench-low-context","language":"java","prefix":"import java.util.*;\npublic class LCTask46 {\n /** Return a mutable list: if items is empty, return new ArrayList.\n * Otherwise return new ArrayList containing items reversed. */\n public static List\u003cString\u003e reverseOrEmpty(List\u003cString\u003e items) {\n","golden_completion":" var result = new ArrayList\u003c\u003e(items);\n Collections.reverse(result);\n return result;\n","suffix":" }\n public static void main(String[] args) {\n assert reverseOrEmpty(List.of(\"a\", \"b\", \"c\")).equals(List.of(\"c\", \"b\", \"a\"));\n assert reverseOrEmpty(List.of()).isEmpty();\n var r = reverseOrEmpty(List.of(\"x\"));\n r.add(\"y\"); // must be mutable\n assert r.size() == 2;\n }\n}\n","assertions":"assert reverseOrEmpty(List.of(\"1\", \"2\")).equals(List.of(\"2\", \"1\"));\nvar m = reverseOrEmpty(List.of(\"a\"));\nm.add(\"b\"); m.add(\"c\");\nassert m.size() == 3;\nassert reverseOrEmpty(List.of(\"x\", \"y\", \"z\", \"w\")).equals(List.of(\"w\", \"z\", \"y\", \"x\"));\n","category":"low_context"} {"id":"47","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask47 {\n /** Replace characters from index \u0027from\u0027 to \u0027to\u0027 (exclusive) with \u0027rep\u0027.\n * If from==to, insert \u0027rep\u0027 at that position.\n * Returns the modified string. */\n public static String spliceStr(String s, int from, int to, String rep) {\n","golden_completion":" StringBuilder sb = new StringBuilder(s);\n sb.replace(from, to, rep);\n return sb.toString();\n","suffix":" }\n public static void main(String[] args) {\n assert spliceStr(\"hello\", 1, 3, \"a\").equals(\"halo\");\n assert spliceStr(\"abcde\", 0, 5, \"X\").equals(\"X\");\n assert spliceStr(\"abc\", 1, 1, \"XY\").equals(\"aXYbc\");\n assert spliceStr(\"test\", 4, 4, \"!\").equals(\"test!\");\n }\n}\n","assertions":"assert spliceStr(\"\", 0, 0, \"hi\").equals(\"hi\");\nassert spliceStr(\"abc\", 0, 0, \"Z\").equals(\"Zabc\");\nassert spliceStr(\"abc\", 1, 2, \"\").equals(\"ac\");\nassert spliceStr(\"1234\", 2, 3, \"99\").equals(\"12994\");\n","category":"low_context"} {"id":"48","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask48 {\n // Custom digits: a=0, b=1, c=2, d=3, e=4, f=5, g=6, h=7, i=8, j=9\n static final String DIGITS = \"abcdefghij\";\n /** Parse a string of custom digit-letters into an integer.\n * \u0027-\u0027 prefix means negative. E.g., \"cab\" -\u003e 201, \"-ba\" -\u003e -10 */\n public static int parseCustom(String s) {\n","golden_completion":" boolean neg = s.startsWith(\"-\");\n String d = neg ? s.substring(1) : s;\n int result = 0;\n for (char c : d.toCharArray()) {\n result = result * 10 + DIGITS.indexOf(c);\n }\n return neg ? -result : result;\n","suffix":" }\n public static void main(String[] args) {\n assert parseCustom(\"a\") == 0;\n assert parseCustom(\"b\") == 1;\n assert parseCustom(\"ba\") == 10;\n assert parseCustom(\"cab\") == 201;\n assert parseCustom(\"-ba\") == -10;\n assert parseCustom(\"ja\") == 90;\n }\n}\n","assertions":"assert parseCustom(\"aaa\") == 0;\nassert parseCustom(\"baa\") == 100;\nassert parseCustom(\"-j\") == -9;\nassert parseCustom(\"bbb\") == 111;\nassert parseCustom(\"dce\") == 324;\n","category":"low_context"} {"id":"49","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask49 {\n /** Custom boolean: \"T\",\"true\",\"1\",\"yes\",\"\" -\u003e true.\n * \"F\",\"false\",\"0\",\"no\" -\u003e false. Case-insensitive.\n * Anything else -\u003e IllegalArgumentException. */\n public static boolean parseBool(String s) {\n","golden_completion":" String low = s.toLowerCase();\n if (low.equals(\"t\") || low.equals(\"true\") || low.equals(\"1\")\n || low.equals(\"yes\") || low.isEmpty()) return true;\n if (low.equals(\"f\") || low.equals(\"false\") || low.equals(\"0\")\n || low.equals(\"no\")) return false;\n throw new IllegalArgumentException(\"Invalid: \" + s);\n","suffix":" }\n public static void main(String[] args) {\n assert parseBool(\"T\") == true;\n assert parseBool(\"false\") == false;\n assert parseBool(\"\") == true; // empty is TRUE\n assert parseBool(\"YES\") == true;\n assert parseBool(\"0\") == false;\n try { parseBool(\"maybe\"); assert false; } catch (IllegalArgumentException e) {}\n }\n}\n","assertions":"assert parseBool(\"TRUE\") == true;\nassert parseBool(\"False\") == false;\nassert parseBool(\"1\") == true;\nassert parseBool(\"no\") == false;\nassert parseBool(\"NO\") == false;\nassert parseBool(\"t\") == true;\ntry { parseBool(\"2\"); assert false; } catch (IllegalArgumentException e) {}\n","category":"low_context"} {"id":"50","testsource":"devbench-low-context","language":"java","prefix":"public class LCTask50 {\n /** Check if ALL bits in \u0027mask\u0027 are set in \u0027value\u0027.\n * E.g., hasAllBits(0b1111, 0b0101) -\u003e true (bits 0 and 2 are set).\n * hasAllBits(0b1010, 0b0101) -\u003e false (bit 0 not set in value). */\n public static boolean hasAllBits(int value, int mask) {\n","golden_completion":" return (value \u0026 mask) == mask;\n","suffix":" }\n public static void main(String[] args) {\n assert hasAllBits(0b1111, 0b0101) == true;\n assert hasAllBits(0b1010, 0b0101) == false;\n assert hasAllBits(0b1111, 0b1111) == true;\n assert hasAllBits(0, 0) == true;\n assert hasAllBits(0b100, 0b110) == false;\n }\n}\n","assertions":"assert hasAllBits(255, 0) == true;\nassert hasAllBits(0, 1) == false;\nassert hasAllBits(7, 3) == true;\nassert hasAllBits(3, 7) == false;\nassert hasAllBits(0xFF, 0x0F) == true;\nassert hasAllBits(-1, 0xFF) == true;\n","category":"low_context"} {"id":"1","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask1 {\n private static String stripComment(String s) {\n StringBuilder out = new StringBuilder();\n boolean q = false;\n for (int i = 0; i \u003c s.length(); i++) {\n char c = s.charAt(i);\n if (c == \u0027\\\"\u0027) q = !q;\n if (!q \u0026\u0026 (c == \u0027#\u0027 || c == \u0027;\u0027)) break;\n out.append(c);\n }\n return out.toString();\n }\n\n private static String unquote(String s) {\n return s.length() \u003e= 2 \u0026\u0026 s.startsWith(\"\\\"\") \u0026\u0026 s.endsWith(\"\\\"\") ? s.substring(1, s.length() - 1) : s;\n }\n\n // Parse properties: first \u0027=\u0027 or \u0027:\u0027 outside quotes separates key/value.\n // Lines ending in backslash continue onto the next line with leading spaces trimmed.\n // # and ; are comments only outside double quotes.\n public static Map\u003cString, String\u003e parseProperties(String text) {\n Map\u003cString, String\u003e result = new LinkedHashMap\u003c\u003e();\n StringBuilder pending = new StringBuilder();\n","golden_completion":" for (String raw : text.split(\"\\n\", -1)) {\n String line = pending.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { pending.append(line, 0, line.length() - 1); continue; }\n pending.append(line);\n String logical = stripComment(pending.toString()).trim();\n pending.setLength(0);\n if (logical.isEmpty()) continue;\n int sep = -1; boolean q = false;\n for (int i = 0; i \u003c logical.length(); i++) { char c = logical.charAt(i); if (c == \u0027\\\"\u0027) q = !q; else if (!q \u0026\u0026 (c == \u0027=\u0027 || c == \u0027:\u0027)) { sep = i; break; } }\n if (sep \u003e= 0) result.put(logical.substring(0, sep).trim(), unquote(logical.substring(sep + 1).trim()));\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n String cfg = \"name = Alice\\n\" +\n \"path = /usr/\\\\\\n\" +\n \" local/bin\\n\" +\n \"note = \\\"keep # sign\\\" # tail\\n\" +\n \"; skip me\\n\" +\n \"empty = \\\"\\\"\";\n Map\u003cString, String\u003e m = parseProperties(cfg);\n assert m.get(\"name\").equals(\"Alice\") : m;\n assert m.get(\"path\").equals(\"/usr/local/bin\") : m.get(\"path\");\n assert m.get(\"note\").equals(\"keep # sign\") : m.get(\"note\");\n assert m.get(\"empty\").equals(\"\") : \"empty value\";\n assert m.size() == 4 : \"comments skipped: \" + m;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseProperties(\"\").isEmpty() : \"empty input\";\nMap\u003cString, String\u003e a = parseProperties(\"x: 1\\ny = 2\");\nassert a.get(\"x\").equals(\"1\") : \"colon separator\";\nassert a.get(\"y\").equals(\"2\") : \"equals separator\";\nMap\u003cString, String\u003e b = parseProperties(\"url = http://x/y;not-comment\");\nassert b.get(\"url\").equals(\"http://x/y\") : \"semicolon comment after value\";\nMap\u003cString, String\u003e c = parseProperties(\"msg = \\\"a;#b\\\" ; trim\");\nassert c.get(\"msg\").equals(\"a;#b\") : \"quoted comment chars kept\";\nMap\u003cString, String\u003e d = parseProperties(\"long = one\\\\\\n two\\\\\\n three\");\nassert d.get(\"long\").equals(\"onetwothree\") : \"multi continuation\";\n","category":"pattern_matching"} {"id":"2","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask2 {\n // Custom edit distance: insert=1, delete=1, replace=1, swap(adjacent)=0.5\n // editDistance(\"ab\",\"ba\") = 0.5, NOT 2 | editDistance(\"cat\",\"car\") = 1\n\n public static double editDistance(String a, String b) {\n","golden_completion":" int m = a.length(), n = b.length();\n double[][] dp = new double[m + 1][n + 1];\n for (int i = 0; i \u003c= m; i++) dp[i][0] = i;\n for (int j = 0; j \u003c= n; j++) dp[0][j] = j;\n for (int i = 1; i \u003c= m; i++) for (int j = 1; j \u003c= n; j++) {\n dp[i][j] = Math.min(dp[i-1][j] + 1, Math.min(dp[i][j-1] + 1, dp[i-1][j-1] + (a.charAt(i-1) == b.charAt(j-1) ? 0 : 1)));\n if (i \u003e 1 \u0026\u0026 j \u003e 1 \u0026\u0026 a.charAt(i-1) == b.charAt(j-2) \u0026\u0026 a.charAt(i-2) == b.charAt(j-1))\n dp[i][j] = Math.min(dp[i][j], dp[i-2][j-2] + 0.5);\n }\n return dp[m][n];\n","suffix":" }\n\n public static void main(String[] args) {\n assert editDistance(\"ab\", \"ba\") == 0.5 : \"swap should cost 0.5\";\n assert editDistance(\"cat\", \"car\") == 1.0 : \"replace costs 1\";\n assert editDistance(\"\", \"abc\") == 3.0 : \"three inserts\";\n assert editDistance(\"abc\", \"abc\") == 0.0 : \"identical\";\n assert editDistance(\"abcd\", \"badc\") == 1.0 : \"two swaps\";\n System.out.println(\"OK\");\n }\n}\n","assertions":" assert editDistance(\"\", \"\") == 0.0 : \"both empty\";\n assert editDistance(\"a\", \"b\") == 1.0 : \"single replace\";\n assert editDistance(\"abcd\", \"abdc\") == 0.5 : \"one swap at end\";\n assert editDistance(\"kitten\", \"sitting\") == 3.0 : \"classic example\";\n assert editDistance(\"ab\", \"ba\") == 0.5 : \"swap not 2\";\n","category":"pattern_matching"} {"id":"3","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask3 {\n // Manifest parser:\n // - [section] prefixes following keys as section.key\n // - lines ending in backslash continue with the next physical line\n // - blank lines and # comments are ignored\n public static Map\u003cString, String\u003e parseManifest(String text) {\n","golden_completion":" Map\u003cString, String\u003e result = new LinkedHashMap\u003c\u003e();\n String section = \"\";\n StringBuilder joined = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n if (raw.endsWith(\"\\\\\")) { joined.append(raw, 0, raw.length() - 1); continue; }\n joined.append(raw);\n String line = joined.toString().trim(); joined.setLength(0);\n if (line.isEmpty() || line.startsWith(\"#\")) continue;\n if (line.startsWith(\"[\") \u0026\u0026 line.endsWith(\"]\")) section = line.substring(1, line.length() - 1).trim();\n else { int eq = line.indexOf(\u0027=\u0027); if (eq \u003e= 0) result.put((section.isEmpty() ? \"\" : section + \".\") + line.substring(0, eq).trim(), line.substring(eq + 1).trim()); }\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n String cfg = \"[core]\\n\" +\n \"name=dev\\\\\\n\" +\n \"bench\\n\" +\n \"# ignored\\n\" +\n \"[limits]\\n\" +\n \"score = 54\";\n Map\u003cString, String\u003e m = parseManifest(cfg);\n assert m.get(\"core.name\").equals(\"devbench\") : m;\n assert m.get(\"limits.score\").equals(\"54\") : m;\n assert !m.containsKey(\"# ignored\") : \"comments skipped\";\n assert m.size() == 2 : \"size: \" + m;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseManifest(\"\").isEmpty() : \"empty input\";\nMap\u003cString, String\u003e a = parseManifest(\"global=yes\");\nassert a.get(\"global\").equals(\"yes\") : \"global key\";\nMap\u003cString, String\u003e b = parseManifest(\"[s]\\na=1\\nb=2\");\nassert b.get(\"s.a\").equals(\"1\") : \"section a\";\nassert b.get(\"s.b\").equals(\"2\") : \"section b\";\nMap\u003cString, String\u003e c = parseManifest(\"[x]\\nlong=one\\\\\\n two\\\\\\n three\");\nassert c.get(\"x.long\").equals(\"one two three\") : \"multi-line continuation\";\n","category":"pattern_matching"} {"id":"4","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask4 {\n private static String stripComment(String s) {\n StringBuilder out = new StringBuilder();\n char quote = 0;\n for (int i = 0; i \u003c s.length(); i++) {\n char c = s.charAt(i);\n if ((c == \u0027\\\u0027\u0027 || c == \u0027\\\"\u0027) \u0026\u0026 quote == 0) quote = c;\n else if (c == quote) quote = 0;\n if (c == \u0027#\u0027 \u0026\u0026 quote == 0) break;\n out.append(c);\n }\n return out.toString();\n }\n private static String unquote(String s) {\n return s.length() \u003e= 2 \u0026\u0026 ((s.startsWith(\"\\\"\") \u0026\u0026 s.endsWith(\"\\\"\")) || (s.startsWith(\"\u0027\") \u0026\u0026 s.endsWith(\"\u0027\"))) ? s.substring(1, s.length() - 1) : s;\n }\n\n // Parse .env text: optional leading \"export\", KEY=VALUE, # comments outside quotes,\n // and trailing backslash continuation with leading spaces on the next line ignored.\n public static Map\u003cString, String\u003e parseEnv(String text) {\n Map\u003cString, String\u003e env = new LinkedHashMap\u003c\u003e();\n StringBuilder pending = new StringBuilder();\n","golden_completion":" for (String raw : text.split(\"\\n\", -1)) {\n String line = pending.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { pending.append(line, 0, line.length() - 1); continue; }\n pending.append(line);\n String logical = stripComment(pending.toString()).trim(); pending.setLength(0);\n if (logical.isEmpty()) continue;\n if (logical.startsWith(\"export \")) logical = logical.substring(7).trim();\n int eq = logical.indexOf(\u0027=\u0027);\n if (eq \u003c 0) continue;\n String key = logical.substring(0, eq).trim();\n String val = unquote(logical.substring(eq + 1).trim());\n env.put(key, val); } return env;\n","suffix":" }\n\n public static void main(String[] args) {\n String text = \"export USER=alice\\n\" +\n \"PATH=/usr/\\\\\\n\" +\n \" local/bin # tail\\n\" +\n \"MSG=\\\"keep # hash\\\" # comment\\n\" +\n \"EMPTY=\u0027\u0027\";\n Map\u003cString, String\u003e env = parseEnv(text);\n assert env.get(\"USER\").equals(\"alice\") : env;\n assert env.get(\"PATH\").equals(\"/usr/local/bin\") : env.get(\"PATH\");\n assert env.get(\"MSG\").equals(\"keep # hash\") : env.get(\"MSG\");\n assert env.get(\"EMPTY\").equals(\"\") : \"single quote empty\";\n assert env.size() == 4 : env;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseEnv(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseEnv(\"A=1\\n# nope\\nexport B = 2\");\nassert a.get(\"A\").equals(\"1\") : \"simple\";\nassert a.get(\"B\").equals(\"2\") : \"export with spaces\";\nMap\u003cString, String\u003e b = parseEnv(\"Q=\u0027a#b\u0027 # outside\");\nassert b.get(\"Q\").equals(\"a#b\") : \"hash inside single quotes\";\nMap\u003cString, String\u003e c = parseEnv(\"LONG=one\\\\\\n two\\\\\\n three\");\nassert c.get(\"LONG\").equals(\"onetwothree\") : \"multi continuation trims leading spaces\";\n","category":"pattern_matching"} {"id":"5","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.LinkedHashMap;\nimport java.util.List;\nimport java.util.Locale;\nimport java.util.Map;\n\npublic class PMTask5 {\n // Parse folded headers. \"Name: value\" starts a header; a line beginning\n // with space or tab continues the previous header value with one space.\n // Header names are lowercased, and duplicates keep all values in order.\n public static Map\u003cString, List\u003cString\u003e\u003e parseHeaders(String text) {\n","golden_completion":" Map\u003cString, List\u003cString\u003e\u003e out = new LinkedHashMap\u003c\u003e();\n String current = null;\n for (String raw : text.split(\"\\n\", -1)) {\n if (raw.isEmpty()) continue;\n if ((raw.charAt(0) == \u0027 \u0027 || raw.charAt(0) == \u0027\\t\u0027) \u0026\u0026 current != null) {\n List\u003cString\u003e vals = out.get(current);\n vals.set(vals.size() - 1, vals.get(vals.size() - 1) + \" \" + raw.trim());\n continue; } int colon = raw.indexOf(\u0027:\u0027);\n if (colon \u003c 0) { current = null; continue; }\n current = raw.substring(0, colon).trim().toLowerCase(Locale.ROOT);\n out.computeIfAbsent(current, k -\u003e new ArrayList\u003c\u003e()).add(raw.substring(colon + 1).trim());\n } return out;\n","suffix":" }\n\n public static void main(String[] args) {\n String h = \"X-Note: one\\n\" +\n \" two\\n\" +\n \"X-Note: three\\n\" +\n \"Host: Example.COM\";\n Map\u003cString, List\u003cString\u003e\u003e m = parseHeaders(h);\n assert m.get(\"x-note\").equals(List.of(\"one two\", \"three\")) : m;\n assert m.get(\"host\").equals(List.of(\"Example.COM\")) : m;\n assert !m.containsKey(\"X-Note\") : \"names lowercased\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseHeaders(\"\").isEmpty() : \"empty\";\nMap\u003cString, List\u003cString\u003e\u003e a = parseHeaders(\"A: 1\\n\\t2\\nB: x\");\nassert a.get(\"a\").equals(List.of(\"1 2\")) : \"tab continuation\";\nassert a.get(\"b\").equals(List.of(\"x\")) : \"next header\";\nMap\u003cString, List\u003cString\u003e\u003e b = parseHeaders(\"Set-Cookie: a=1\\nSet-Cookie: b=2\");\nassert b.get(\"set-cookie\").equals(List.of(\"a=1\", \"b=2\")) : \"duplicates preserved\";\nMap\u003cString, List\u003cString\u003e\u003e c = parseHeaders(\"bad line\\nC: ok\\n more\");\nassert c.get(\"c\").equals(List.of(\"ok more\")) : \"bad line does not capture continuation\";\n","category":"pattern_matching"} {"id":"6","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask6 {\n private static String stripComment(String s) {\n boolean quote = false;\n StringBuilder out = new StringBuilder();\n for (int i = 0; i \u003c s.length(); i++) {\n char c = s.charAt(i);\n if (c == \u0027\\\"\u0027) quote = !quote;\n if (c == \u0027#\u0027 \u0026\u0026 !quote) break;\n out.append(c);\n }\n return out.toString();\n }\n\n // Parse make-style vars. NAME = value assigns; NAME += value appends with one space.\n // Backslash-newline continues a logical line; # comments outside quotes are ignored.\n public static Map\u003cString, String\u003e parseVars(String text) {\n","golden_completion":" Map\u003cString, String\u003e vars = new LinkedHashMap\u003c\u003e();\n StringBuilder logical = new StringBuilder(); for (String raw : text.split(\"\\n\", -1)) {\n String line = logical.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { logical.append(line, 0, line.length() - 1); continue; }\n logical.append(line);\n String s = stripComment(logical.toString()).trim(); logical.setLength(0);\n if (s.isEmpty()) continue; int op = s.indexOf(\"+=\"); boolean append = op \u003e= 0;\n if (!append) op = s.indexOf(\u0027=\u0027); if (op \u003c 0) continue;\n String key = s.substring(0, op).trim();\n String val = s.substring(op + (append ? 2 : 1)).trim();\n vars.put(key, append \u0026\u0026 vars.containsKey(key) ? vars.get(key) + \" \" + val : val);\n } return vars;\n","suffix":" }\n\n public static void main(String[] args) {\n String mk = \"CFLAGS = -O2 \\\\\\n\" +\n \" -Wall # keep\\n\" +\n \"CFLAGS += -g\\n\" +\n \"NAME = \\\"a # b\\\" # tail\";\n Map\u003cString, String\u003e v = parseVars(mk);\n assert v.get(\"CFLAGS\").equals(\"-O2 -Wall -g\") : v;\n assert v.get(\"NAME\").equals(\"\\\"a # b\\\"\") : v.get(\"NAME\");\n assert v.size() == 2 : v;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseVars(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseVars(\"A=1\\nA += 2\\nB = x\");\nassert a.get(\"A\").equals(\"1 2\") : \"append\";\nassert a.get(\"B\").equals(\"x\") : \"assign\";\nMap\u003cString, String\u003e b = parseVars(\"LONG = one \\\\\\n two \\\\\\n three\");\nassert b.get(\"LONG\").equals(\"one two three\") : \"multi continuation\";\nMap\u003cString, String\u003e c = parseVars(\"Q = \\\"#not comment\\\" # comment\");\nassert c.get(\"Q\").equals(\"\\\"#not comment\\\"\") : \"quoted hash\";\n","category":"pattern_matching"} {"id":"7","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask7 {\n // Max bracket nesting depth. Brackets: ( ) [ ] { }\n // Brackets inside double-quoted strings IGNORED.\n // In strings, backslash escapes next char. Returns -1 if unbalanced.\n // maxDepth(\"(a[b])\") = 2 | maxDepth(\"([)\") = -1\n\n private static final String OPEN = \"([{\", CLOSE = \")]}\";\n\n public static int maxDepth(String expr) {\n","golden_completion":" int depth = 0, max = 0; boolean inStr = false;\n java.util.Deque\u003cCharacter\u003e stk = new java.util.ArrayDeque\u003c\u003e();\n for (int i = 0; i \u003c expr.length(); i++) {\n char ch = expr.charAt(i);\n if (inStr) { if (ch == \u0027\\\\\u0027) i++; else if (ch == \u0027\\\"\u0027) inStr = false; }\n else if (ch == \u0027\\\"\u0027) inStr = true;\n else if (OPEN.indexOf(ch) \u003e= 0) { stk.push(ch); depth++; max = Math.max(max, depth); }\n else if (CLOSE.indexOf(ch) \u003e= 0) {\n if (stk.isEmpty() || OPEN.indexOf(stk.peek()) != CLOSE.indexOf(ch)) return -1;\n stk.pop(); depth--; }\n }\n return stk.isEmpty() ? max : -1;\n","suffix":" }\n\n public static void main(String[] args) {\n assert maxDepth(\"(a[b])\") == 2;\n assert maxDepth(\"hello\") == 0;\n assert maxDepth(\"([)\") == -1;\n String s1 = \"(\" + (char)34 + \"[\" + (char)34 + \")\";\n assert maxDepth(s1) == 1 : \"bracket in string\";\n String s2 = \"({\" + (char)34 + \"}\" + (char)34 + \"})\";\n assert maxDepth(s2) == 2 : \"brace in string\";\n System.out.println(\"OK\");\n }\n}\n","assertions":" assert maxDepth(\"\") == 0 : \"empty\";\n assert maxDepth(\"()\") == 1 : \"simple parens\";\n assert maxDepth(\"((()))\") == 3 : \"nested parens\";\n assert maxDepth(\"([{}])\") == 3 : \"mixed brackets\";\n assert maxDepth(\"(]\") == -1 : \"mismatch\";\n assert maxDepth(\"(\") == -1 : \"unclosed\";\n","category":"pattern_matching"} {"id":"8","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.LinkedHashMap;\nimport java.util.List;\nimport java.util.Map;\n\npublic class PMTask8 {\n private static String stripComment(String s) {\n int hash = s.indexOf(\u0027#\u0027);\n return hash \u003c 0 ? s : s.substring(0, hash);\n }\n\n // Parse alias file: name: a,b starts/extends a list. Lines ending in backslash\n // continue onto the next physical line; comments start with # after joining.\n public static Map\u003cString, List\u003cString\u003e\u003e parseAliases(String text) {\n","golden_completion":" Map\u003cString, List\u003cString\u003e\u003e aliases = new LinkedHashMap\u003c\u003e();\n StringBuilder logical = new StringBuilder(); for (String raw : text.split(\"\\n\", -1)) {\n String line = logical.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { logical.append(line, 0, line.length() - 1); continue; }\n logical.append(line);\n String s = stripComment(logical.toString()).trim(); logical.setLength(0);\n if (s.isEmpty()) continue;\n int colon = s.indexOf(\u0027:\u0027); if (colon \u003c 0) continue;\n String key = s.substring(0, colon).trim();\n List\u003cString\u003e vals = aliases.computeIfAbsent(key, k -\u003e new ArrayList\u003c\u003e());\n for (String part : s.substring(colon + 1).split(\",\")) { String v = part.trim(); if (!v.isEmpty()) vals.add(v); }\n } return aliases;\n","suffix":" }\n\n public static void main(String[] args) {\n String data = \"dev: alice, \\\\\\n\" +\n \" bob # team\\n\" +\n \"ops: root\\n\" +\n \"dev: carol\";\n Map\u003cString, List\u003cString\u003e\u003e a = parseAliases(data);\n assert a.get(\"dev\").equals(List.of(\"alice\", \"bob\", \"carol\")) : a;\n assert a.get(\"ops\").equals(List.of(\"root\")) : a;\n assert a.size() == 2 : a;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseAliases(\"\").isEmpty() : \"empty\";\nMap\u003cString, List\u003cString\u003e\u003e one = parseAliases(\"x: a,, b\");\nassert one.get(\"x\").equals(List.of(\"a\", \"b\")) : \"empty recipients ignored\";\nMap\u003cString, List\u003cString\u003e\u003e cont = parseAliases(\"team: a, \\\\\\n b, \\\\\\n c\");\nassert cont.get(\"team\").equals(List.of(\"a\", \"b\", \"c\")) : \"multi continuation\";\nMap\u003cString, List\u003cString\u003e\u003e rep = parseAliases(\"x: a\\nx: b,c\");\nassert rep.get(\"x\").equals(List.of(\"a\", \"b\", \"c\")) : \"repeated alias appends\";\n","category":"pattern_matching"} {"id":"9","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask9 {\n // Custom URL normalizer (NOT standard RFC):\n // 1. Strip trailing / only if last path segment has no dot\n // 2. Remove fragment (#...) always 3. Remove \"www.\" from host\n // 4. Lowercase scheme+host 5. Keep query as-is\n // normalizeUrl(\"HTTP://WWW.Ex.Com/path/\") -\u003e \"http://ex.com/path\"\n // normalizeUrl(\"http://s.com/f.html/\") -\u003e \"http://s.com/f.html/\"\n\n public static String normalizeUrl(String url) {\n","golden_completion":" int se = url.indexOf(\"://\"); if (se == -1) return url;\n String scheme = url.substring(0, se).toLowerCase(), rest = url.substring(se + 3);\n int fi = rest.indexOf(\u0027#\u0027); if (fi \u003e= 0) rest = rest.substring(0, fi);\n int ps = rest.indexOf(\u0027/\u0027);\n String host = (ps == -1 ? rest : rest.substring(0, ps)).toLowerCase();\n String pq = ps == -1 ? \"\" : rest.substring(ps);\n if (host.startsWith(\"www.\")) host = host.substring(4);\n int qi = pq.indexOf(\u0027?\u0027); String path = qi \u003e= 0 ? pq.substring(0, qi) : pq, query = qi \u003e= 0 ? pq.substring(qi) : \"\";\n if (path.endsWith(\"/\") \u0026\u0026 path.length() \u003e 1) {\n String seg = path.substring(path.lastIndexOf(\u0027/\u0027, path.length()-2)+1, path.length()-1);\n if (!seg.contains(\".\")) path = path.substring(0, path.length()-1); }\n return scheme + \"://\" + host + path + query;\n","suffix":" }\n\n public static void main(String[] args) {\n assert normalizeUrl(\"HTTP://WWW.Example.Com/path/\").equals(\"http://example.com/path\");\n assert normalizeUrl(\"http://site.com/file.html/\").equals(\"http://site.com/file.html/\");\n assert normalizeUrl(\"http://x.com/a#frag\").equals(\"http://x.com/a\");\n assert normalizeUrl(\"http://www.A.com/?q=1\").equals(\"http://a.com/?q=1\");\n System.out.println(\"OK\");\n }\n}\n","assertions":" assert normalizeUrl(\"https://WWW.TEST.COM\").equals(\"https://test.com\") : \"no path\";\n assert normalizeUrl(\"http://a.com/b/c/\").equals(\"http://a.com/b/c\") : \"strip trailing slash\";\n assert normalizeUrl(\"http://a.com/b/c.js/\").equals(\"http://a.com/b/c.js/\") : \"keep slash after ext\";\n assert normalizeUrl(\"http://a.com/#top\").equals(\"http://a.com/\") : \"root with fragment\";\n assert normalizeUrl(\"http://a.com/p?x=1#f\").equals(\"http://a.com/p?x=1\") : \"query kept frag removed\";\n","category":"pattern_matching"} {"id":"10","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask10 {\n private static String stripComment(String s) {\n boolean q = false; StringBuilder out = new StringBuilder();\n for (int i = 0; i \u003c s.length(); i++) {\n char c = s.charAt(i);\n if (c == \u0027\\\"\u0027) q = !q;\n if (c == \u0027#\u0027 \u0026\u0026 !q) break;\n out.append(c);\n }\n return out.toString();\n }\n\n // Parse route table lines: \"METHOD path -\u003e handler\". Lines ending in backslash\n // continue onto the next physical line; # comments outside quotes are ignored.\n public static Map\u003cString, String\u003e parseRoutes(String text) {\n","golden_completion":" Map\u003cString, String\u003e routes = new LinkedHashMap\u003c\u003e();\n StringBuilder pending = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n String line = pending.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { pending.append(line, 0, line.length() - 1); continue; }\n pending.append(line);\n String s = stripComment(pending.toString()).trim(); pending.setLength(0);\n if (s.isEmpty()) continue;\n int arrow = s.indexOf(\"-\u003e\"); if (arrow \u003c 0) continue;\n String left = s.substring(0, arrow).trim();\n String handler = s.substring(arrow + 2).trim();\n routes.put(left, handler); } return routes;\n","suffix":" }\n\n public static void main(String[] args) {\n String table = \"GET /users -\u003e \\\\\\n\" +\n \" userIndex # visible route\\n\" +\n \"POST /msg -\u003e \\\"save#draft\\\" # comment\";\n Map\u003cString, String\u003e r = parseRoutes(table);\n assert r.get(\"GET /users\").equals(\"userIndex\") : r;\n assert r.get(\"POST /msg\").equals(\"\\\"save#draft\\\"\") : r;\n assert r.size() == 2 : r;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseRoutes(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseRoutes(\"GET / -\u003e root\\n# skip\\nBAD LINE\");\nassert a.get(\"GET /\").equals(\"root\") : \"basic route\";\nMap\u003cString, String\u003e b = parseRoutes(\"PUT /a -\u003e one \\\\\\n two \\\\\\n three\");\nassert b.get(\"PUT /a\").equals(\"one two three\") : \"continued handler\";\nMap\u003cString, String\u003e c = parseRoutes(\"GET /q -\u003e \\\"a#b\\\" # tail\");\nassert c.get(\"GET /q\").equals(\"\\\"a#b\\\"\") : \"quoted hash\";\n","category":"pattern_matching"} {"id":"11","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.nio.charset.StandardCharsets;\n\npublic class PMTask11 {\n private static final String HEX = \"0123456789ABCDEF\";\n\n public static String hexByte(int b) {\n return \"%\" + HEX.charAt((b \u003e\u003e 4) \u0026 0xF) + HEX.charAt(b \u0026 0xF);\n }\n\n public static boolean isUnreserved(char ch) {\n return (ch \u003e= \u0027A\u0027 \u0026\u0026 ch \u003c= \u0027Z\u0027) || (ch \u003e= \u0027a\u0027 \u0026\u0026 ch \u003c= \u0027z\u0027) || (ch \u003e= \u00270\u0027 \u0026\u0026 ch \u003c= \u00279\u0027);\n }\n\n public static String urlEncode(String text) {\n return urlEncode(text, \"\");\n }\n\n public static String urlEncode(String text, String safe) {\n","golden_completion":" byte[] bytes = text.getBytes(StandardCharsets.UTF_8);\n StringBuilder sb = new StringBuilder();\n for (byte b : bytes) {\n char ch = (char) (b \u0026 0xFF);\n if (b \u003e= 0 \u0026\u0026 isUnreserved(ch) || safe.indexOf(ch) \u003e= 0) {\n sb.append(ch);\n } else {\n sb.append(hexByte(b \u0026 0xFF));\n }\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n assert hexByte(32).equals(\"%20\") : \"hexByte(32) failed\";\n assert isUnreserved(\u0027A\u0027) == true;\n assert isUnreserved(\u0027_\u0027) == false : \"_ must NOT be unreserved\";\n\n // This URL encoder only leaves alphanumerics unescaped by default.\n // Unlike java.net.URLEncoder, spaces become %20 not +,\n // and it encodes * and ~ (which standard leaves alone).\n assert urlEncode(\"a b\").equals(\"a%20b\") : \"spaces must be %20\";\n assert !urlEncode(\"a b\").equals(\"a+b\") : \"must not use + for space\";\n assert urlEncode(\"/~*\").equals(\"%2F%7E%2A\") : \"must encode / ~ *\";\n assert !urlEncode(\"~\").equals(\"~\") : \"~ must be encoded\";\n assert urlEncode(\"/~\", \"/\").equals(\"/%7E\") : \"safe / passthrough\";\n System.out.println(\"OK: \" + urlEncode(\"hello world!\"));\n }\n}\n","assertions":" assert urlEncode(\"\").equals(\"\") : \"empty input\";\n assert urlEncode(\"abcXYZ123\").equals(\"abcXYZ123\") : \"alphanums unchanged\";\n assert urlEncode(\"a+b=c\").equals(\"a%2Bb%3Dc\") : \"plus and equals encoded\";\n assert urlEncode(\"hello_world\").equals(\"hello%5Fworld\") : \"underscore encoded\";\n assert urlEncode(\"x/y?z\", \"?\").equals(\"x%2Fy?z\") : \"safe char passthrough\";\n assert urlEncode(\"-._~\").equals(\"%2D%2E%5F%7E\") : \"RFC unreserved chars encoded\";\n","category":"pattern_matching"} {"id":"12","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask12 {\n public static int charType(char ch) {\n if (Character.isLetter(ch)) return 0;\n if (Character.isDigit(ch)) return 1;\n return 2;\n }\n\n public static int charCost(char a, char b) {\n if (a == b) return 0;\n int ta = charType(a), tb = charType(b);\n if (ta != tb) return 3;\n if (ta == 1) return 2;\n return 1;\n }\n\n public static int hammingDistance(String a, String b) {\n","golden_completion":" if (a.length() != b.length()) {\n throw new IllegalArgumentException(\"Strings must be equal length\");\n }\n int total = 0;\n for (int i = 0; i \u003c a.length(); i++) {\n total += charCost(a.charAt(i), b.charAt(i));\n }\n return total;\n","suffix":" }\n\n public static void main(String[] args) {\n assert charType(\u0027a\u0027) == 0 : \"letter type\";\n assert charType(\u00275\u0027) == 1 : \"digit type\";\n assert charCost(\u0027a\u0027, \u0027b\u0027) == 1 : \"letter-letter cost\";\n assert charCost(\u00271\u0027, \u00272\u0027) == 2 : \"digit-digit cost\";\n assert charCost(\u0027a\u0027, \u00271\u0027) == 3 : \"mixed cost\";\n\n // hammingDistance: NOT standard hamming (which counts 1 per mismatch).\n // Uses charCost: letter-letter=1, digit-digit=2, mixed=3\n assert hammingDistance(\"abc\", \"axc\") == 1 : \"one letter diff\";\n assert hammingDistance(\"123\", \"193\") == 2 : \"one digit diff\";\n assert hammingDistance(\"a1c\", \"a2c\") == 2 : \"digit diff in mixed\";\n assert hammingDistance(\"abc\", \"a1c\") == 3 : \"letter vs digit = 3\";\n assert hammingDistance(\"abc\", \"abc\") == 0 : \"identical\";\n System.out.println(\"OK: \" + hammingDistance(\"abc\", \"xyz\"));\n }\n}\n","assertions":" assert hammingDistance(\"a\", \"b\") == 1 : \"single letter diff\";\n assert hammingDistance(\"1\", \"2\") == 2 : \"single digit diff\";\n assert hammingDistance(\"a\", \"1\") == 3 : \"single mixed diff\";\n assert hammingDistance(\"ab12\", \"cd34\") == 6 : \"2 letter + 2 digit diffs\";\n assert hammingDistance(\"a1b2\", \"1a2b\") == 12 : \"all mixed crossover\";\n assert hammingDistance(\"hello\", \"hello\") == 0 : \"identical strings\";\n boolean threw = false;\n try { hammingDistance(\"ab\", \"abc\"); } catch (IllegalArgumentException e) { threw = true; }\n assert threw : \"must throw on unequal lengths\";\n","category":"pattern_matching"} {"id":"13","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask13 {\n private static String stripComment(String s) {\n boolean q = false; StringBuilder out = new StringBuilder();\n for (int i = 0; i \u003c s.length(); i++) { char c = s.charAt(i); if (c == \u0027\\\u0027\u0027) q = !q; if (c == \u0027#\u0027 \u0026\u0026 !q) break; out.append(c); }\n return out.toString();\n }\n\n // Parse rules: name: pattern -\u003e action. Backslash-newline joins logical lines;\n // # comments outside single quotes are ignored. Store name -\u003e \"pattern =\u003e action\".\n public static Map\u003cString, String\u003e parseRules(String text) {\n","golden_completion":" Map\u003cString, String\u003e rules = new LinkedHashMap\u003c\u003e();\n StringBuilder buf = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n String line = buf.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { buf.append(line, 0, line.length() - 1); continue; }\n buf.append(line); String s = stripComment(buf.toString()).trim(); buf.setLength(0);\n if (s.isEmpty()) continue;\n int colon = s.indexOf(\u0027:\u0027), arrow = colon \u003c 0 ? -1 : s.indexOf(\"-\u003e\", colon + 1);\n if (arrow \u003e= 0) rules.put(s.substring(0, colon).trim(), s.substring(colon + 1, arrow).trim() + \" =\u003e \" + s.substring(arrow + 2).trim());\n }\n return rules;\n","suffix":" }\n\n public static void main(String[] args) {\n String src = \"auth: /login \\\\\\n\" +\n \" -\u003e AuthController # comment\\n\" +\n \"hash: \u0027#not-comment\u0027 -\u003e Keep\";\n Map\u003cString, String\u003e r = parseRules(src);\n assert r.get(\"auth\").equals(\"/login =\u003e AuthController\") : r;\n assert r.get(\"hash\").equals(\"\u0027#not-comment\u0027 =\u003e Keep\") : r;\n assert r.size() == 2 : r;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseRules(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseRules(\"one: a -\u003e b\\n# skip\");\nassert a.get(\"one\").equals(\"a =\u003e b\") : \"basic\";\nMap\u003cString, String\u003e b = parseRules(\"long: alpha \\\\\\n beta -\u003e gamma \\\\\\n delta\");\nassert b.get(\"long\").equals(\"alpha beta =\u003e gamma delta\") : \"continued pattern and action\";\nMap\u003cString, String\u003e c = parseRules(\"q: \u0027#x\u0027 -\u003e \u0027#y\u0027 # tail\");\nassert c.get(\"q\").equals(\"\u0027#x\u0027 =\u003e \u0027#y\u0027\") : \"quoted hashes\";\n","category":"pattern_matching"} {"id":"14","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.Map;\nimport java.util.HashMap;\n\npublic class PMTask14 {\n // Reversed Morse: swap dots and dashes from standard\n private static final Map\u003cCharacter, String\u003e MORSE = new HashMap\u003c\u003e();\n static {\n String[] standard = {\".-\",\"-...\",\"-.-.\",\"-..\",\".\",\"..-.\",\"--.\",\"....\",\"..\",\n \".---\",\"-.-\",\".-..\",\"--\",\"-.\",\"---\",\".--.\",\"--.-\",\".-.\",\"...\",\"-\",\n \"..-\",\"...-\",\".--\",\"-..-\",\"-.--\",\"--..\"};\n for (int i = 0; i \u003c 26; i++) {\n StringBuilder rev = new StringBuilder();\n for (char c : standard[i].toCharArray()) {\n rev.append(c == \u0027.\u0027 ? \u0027-\u0027 : \u0027.\u0027);\n }\n MORSE.put((char)(\u0027A\u0027 + i), rev.toString());\n }\n String[] digits = {\"-----\",\".----\",\"..---\",\"...--\",\"....-\",\n \".....\",\"-....\",\"--...\",\"---..\",\"----.\"};\n for (int i = 0; i \u003c 10; i++) {\n StringBuilder rev = new StringBuilder();\n for (char c : digits[i].toCharArray()) {\n rev.append(c == \u0027.\u0027 ? \u0027-\u0027 : \u0027.\u0027);\n }\n MORSE.put((char)(\u00270\u0027 + i), rev.toString());\n }\n }\n\n public static String morseEncode(String text) {\n","golden_completion":" StringBuilder sb = new StringBuilder();\n boolean first = true;\n for (char ch : text.toUpperCase().toCharArray()) {\n if (ch == \u0027 \u0027) { sb.append(\"||\"); first = true; }\n else if (MORSE.containsKey(ch)) {\n if (!first) sb.append(\"|\");\n sb.append(MORSE.get(ch)); first = false;\n }\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n // Reversed Morse: A is \"-.\" not \".-\", uses \"|\" separator, \"||\" for word boundary\n assert MORSE.get(\u0027A\u0027).equals(\"-.\") : \"A must be -. (reversed)\";\n assert MORSE.get(\u0027E\u0027).equals(\"-\") : \"E must be - (reversed)\";\n assert MORSE.get(\u0027T\u0027).equals(\".\") : \"T must be . (reversed)\";\n assert !MORSE.get(\u0027A\u0027).equals(\".-\") : \"must NOT be standard Morse\";\n\n assert morseEncode(\"ET\").equals(\"-|.\") : \"E=- T=.\";\n assert morseEncode(\"A B\").equals(\"-.||.---\") : \"word boundary\";\n assert !morseEncode(\"SOS\").equals(\"...|---|...\") : \"not standard Morse\";\n System.out.println(\"OK: \" + morseEncode(\"HELLO\"));\n }\n}\n","assertions":" assert morseEncode(\"\").equals(\"\") : \"empty input\";\n assert morseEncode(\"E\").equals(\"-\") : \"single E\";\n assert morseEncode(\"T\").equals(\".\") : \"single T\";\n assert morseEncode(\"HI\").equals(\"----|--\");\n assert morseEncode(\"A B C\").equals(\"-.||.---||.-.-\");\n assert morseEncode(\"hello\").equals(\"----|-|-.--|-.--|...\");\n","category":"pattern_matching"} {"id":"15","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask15 {\n // Parse translation file: [locale] starts a section; key=value lines become\n // locale.key -\u003e value. Backslash-newline joins continued values. # comments skip.\n public static Map\u003cString, String\u003e parseTranslations(String text) {\n","golden_completion":" Map\u003cString, String\u003e out = new LinkedHashMap\u003c\u003e();\n String locale = \"\"; StringBuilder buf = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n String line = buf.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { buf.append(line, 0, line.length() - 1); continue; }\n buf.append(line); String s = buf.toString().trim(); buf.setLength(0);\n if (s.isEmpty() || s.startsWith(\"#\")) continue;\n if (s.startsWith(\"[\") \u0026\u0026 s.endsWith(\"]\")) { locale = s.substring(1, s.length() - 1).trim(); continue; }\n int eq = s.indexOf(\u0027=\u0027);\n if (eq \u003e= 0) out.put((locale.isEmpty() ? \"\" : locale + \".\") + s.substring(0, eq).trim(), s.substring(eq + 1).trim());\n }\n return out;\n","suffix":" }\n\n public static void main(String[] args) {\n String t = \"[en]\\nhello=Hello \\\\\\n\" +\n \" world\\n# skip\\n[fr]\\nhello=Bonjour\";\n Map\u003cString, String\u003e m = parseTranslations(t);\n assert m.get(\"en.hello\").equals(\"Hello world\") : m;\n assert m.get(\"fr.hello\").equals(\"Bonjour\") : m;\n assert m.size() == 2 : m;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseTranslations(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseTranslations(\"title=Global\");\nassert a.get(\"title\").equals(\"Global\") : \"global key\";\nMap\u003cString, String\u003e b = parseTranslations(\"[es]\\na=uno\\nb=dos\");\nassert b.get(\"es.a\").equals(\"uno\") \u0026\u0026 b.get(\"es.b\").equals(\"dos\") : \"section keys\";\nMap\u003cString, String\u003e c = parseTranslations(\"[x]\\nlong=one \\\\\\n two \\\\\\n three\");\nassert c.get(\"x.long\").equals(\"one two three\") : \"multi continuation\";\n","category":"pattern_matching"} {"id":"16","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.Map;\nimport java.util.HashMap;\n\npublic class PMTask16 {\n public static String parseTemplate(String template, Map\u003cString, String\u003e vars) {\n","golden_completion":" StringBuilder sb = new StringBuilder();\n for (int i = 0; i \u003c template.length(); ) {\n char ch = template.charAt(i);\n if (ch == \u0027\\\\\u0027 \u0026\u0026 i + 1 \u003c template.length()) { sb.append(template.charAt(i + 1)); i += 2; }\n else if (ch == \u0027$\u0027 \u0026\u0026 i + 1 \u003c template.length() \u0026\u0026 template.charAt(i + 1) == \u0027{\u0027) {\n int close = template.indexOf(\u0027}\u0027, i + 2);\n if (close == -1) { sb.append(template, i, template.length()); break; }\n sb.append(vars.getOrDefault(template.substring(i + 2, close), \"${\" + template.substring(i + 2, close) + \"}\"));\n i = close + 1;\n } else { sb.append(ch); i++; }\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n Map\u003cString, String\u003e vars = new HashMap\u003c\u003e();\n vars.put(\"name\", \"World\");\n vars.put(\"greeting\", \"Hello\");\n\n // parseTemplate: ${var} replaced, \\\\$ is literal $\n // Unclosed ${ left as-is, unknown vars kept as ${varName}\n assert parseTemplate(\"${greeting} ${name}!\", vars).equals(\"Hello World!\");\n assert parseTemplate(\"\\\\\\\\${name}\", vars).equals(\"\\\\World\") : \"escaped backslash then var\";\n assert parseTemplate(\"\\\\$literal\", vars).equals(\"$literal\") : \"escaped dollar literal\";\n assert parseTemplate(\"${unknown}\", vars).equals(\"${unknown}\") : \"unknown var kept\";\n assert parseTemplate(\"${name\", vars).equals(\"${name\") : \"unclosed kept as-is\";\n System.out.println(\"OK: \" + parseTemplate(\"${greeting}, ${name}!\", vars));\n }\n}\n","assertions":" Map\u003cString, String\u003e v = new HashMap\u003c\u003e();\n v.put(\"x\", \"1\");\n v.put(\"y\", \"2\");\n assert parseTemplate(\"\", v).equals(\"\") : \"empty template\";\n assert parseTemplate(\"no vars here\", v).equals(\"no vars here\") : \"no placeholders\";\n assert parseTemplate(\"${x}+${y}\", v).equals(\"1+2\") : \"two vars\";\n assert parseTemplate(\"\\\\$x\", v).equals(\"$x\") : \"escaped dollar\";\n assert parseTemplate(\"\\\\\\\\${x}\", v).equals(\"\\\\1\") : \"escaped backslash before var\";\n assert parseTemplate(\"${missing}\", v).equals(\"${missing}\") : \"unknown var preserved\";\n assert parseTemplate(\"${x\", v).equals(\"${x\") : \"unclosed brace\";\n","category":"pattern_matching"} {"id":"17","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.ArrayDeque;\nimport java.util.Deque;\nimport java.util.Map;\n\npublic class PMTask17 {\n private static final Map\u003cCharacter, Character\u003e PAIRS = Map.of(\n \u0027(\u0027, \u0027)\u0027, \u0027[\u0027, \u0027]\u0027, \u0027{\u0027, \u0027}\u0027\n );\n\n public static boolean isBalancedCode(String text) {\n","golden_completion":" Deque\u003cCharacter\u003e stack = new ArrayDeque\u003c\u003e();\n boolean inStr = false;\n for (int i = 0; i \u003c text.length(); i++) {\n char ch = text.charAt(i);\n if (inStr) { if (ch == \u0027\\\\\u0027 \u0026\u0026 i+1 \u003c text.length()) { i++; } else if (ch == \u0027\"\u0027) inStr = false; }\n else if (ch == \u0027\"\u0027) inStr = true;\n else if (PAIRS.containsKey(ch)) stack.push(PAIRS.get(ch));\n else if (PAIRS.containsValue(ch) \u0026\u0026 (stack.isEmpty() || stack.peek() != ch)) return false;\n else if (PAIRS.containsValue(ch)) stack.pop();\n }\n return stack.isEmpty() \u0026\u0026 !inStr;\n","suffix":" }\n\n public static void main(String[] args) {\n // isBalancedCode: bracket matching that ignores brackets inside \"strings\"\n // Handles \\\" escape sequences inside strings\n assert isBalancedCode(\"f(x)\") == true;\n assert isBalancedCode(\"f(\\\"(\\\")\") == true : \"bracket inside string ignored\";\n assert isBalancedCode(\"x = \\\"(\\\"\") == true : \"unmatched bracket in string is OK\";\n assert isBalancedCode(\"{[()]}\") == true;\n assert isBalancedCode(\"{[(])}\") == false : \"mismatched brackets\";\n assert isBalancedCode(\"f(\\\") + g(\") == false : \"unmatched paren outside string\";\n System.out.println(\"OK\");\n }\n}\n","assertions":" assert isBalancedCode(\"\") == true : \"empty string\";\n assert isBalancedCode(\"()\") == true : \"simple parens\";\n assert isBalancedCode(\"(\") == false : \"unclosed paren\";\n assert isBalancedCode(\"\\\"unclosed\") == false : \"unclosed string\";\n assert isBalancedCode(\"{\\\"key\\\": \\\"val\\\"}\") == true : \"JSON-like\";\n assert isBalancedCode(\"a(\\\"]\\\", b[1])\") == true : \"bracket in string ignored\";\n assert isBalancedCode(\"[\\\"\\\\\\\"]\\\"]\") == true : \"escaped quote inside string\";\n","category":"pattern_matching"} {"id":"18","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.Map;\nimport java.util.LinkedHashMap;\n\npublic class PMTask18 {\n public static Map\u003cString, String\u003e parseConfig(String input) {\n","golden_completion":" Map\u003cString, String\u003e result = new LinkedHashMap\u003c\u003e();\n String sec = \"\";\n StringBuilder joined = new StringBuilder();\n for (String line : input.split(\"\\n\", -1)) {\n if (line.endsWith(\"\\\\\")) { joined.append(line, 0, line.length() - 1); continue; }\n joined.append(line);\n String f = joined.toString().trim(); joined.setLength(0);\n if (f.isEmpty() || f.startsWith(\"#\")) continue;\n if (f.startsWith(\"[\") \u0026\u0026 f.endsWith(\"]\")) sec = f.substring(1, f.length() - 1) + \".\";\n else { int eq = f.indexOf(\u0027=\u0027); if (eq \u003e 0) result.put(sec + f.substring(0, eq).trim(), f.substring(eq + 1).trim()); }\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n // parseConfig: INI-style with line continuation (trailing \\),\n // # comments, [section] prefixes keys with \"section.\"\n String cfg = \"[db]\\nhost=localhost\\nport=5432\\n# comment\\n[app]\\nname=my\\\\\\napp\\nversion=1.0\";\n Map\u003cString, String\u003e m = parseConfig(cfg);\n assert m.get(\"db.host\").equals(\"localhost\") : \"section.key\";\n assert m.get(\"db.port\").equals(\"5432\") : \"db port\";\n assert m.get(\"app.name\").equals(\"myapp\") : \"continuation line joins\";\n assert m.get(\"app.version\").equals(\"1.0\") : \"version after continuation\";\n assert !m.containsKey(\"# comment\") : \"comments skipped\";\n System.out.println(\"OK: \" + m);\n }\n}\n","assertions":" Map\u003cString, String\u003e m2 = parseConfig(\"key=value\");\n assert m2.get(\"key\").equals(\"value\") : \"simple key=value\";\n Map\u003cString, String\u003e m3 = parseConfig(\"[s]\\na=1\\nb=2\");\n assert m3.get(\"s.a\").equals(\"1\") : \"section prefix\";\n assert m3.get(\"s.b\").equals(\"2\") : \"second key\";\n Map\u003cString, String\u003e m4 = parseConfig(\"long=hello\\\\\\n world\");\n assert m4.get(\"long\").equals(\"hello world\") : \"continuation with trim\";\n Map\u003cString, String\u003e m5 = parseConfig(\"# only comments\\n\\n\");\n assert m5.isEmpty() : \"comments and blanks produce empty map\";\n","category":"pattern_matching"} {"id":"19","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask19 {\n // Parse ssh-config style text. \"Host name\" sets current host.\n // Following \"Key value\" lines are stored as host.key -\u003e value.\n // Backslash-newline joins continued values; # comments are ignored.\n public static Map\u003cString, String\u003e parseSshConfig(String text) {\n","golden_completion":" Map\u003cString, String\u003e out = new LinkedHashMap\u003c\u003e();\n String host = \"\"; StringBuilder buf = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n String line = buf.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { buf.append(line, 0, line.length() - 1); continue; }\n buf.append(line); String s = buf.toString().split(\"#\", 2)[0].trim(); buf.setLength(0);\n if (s.isEmpty()) continue;\n if (s.startsWith(\"Host \")) { host = s.substring(5).trim(); continue; }\n int sp = s.indexOf(\u0027 \u0027);\n if (sp \u003e 0 \u0026\u0026 !host.isEmpty()) out.put(host + \".\" + s.substring(0, sp).toLowerCase(), s.substring(sp + 1).trim());\n }\n return out;\n","suffix":" }\n\n public static void main(String[] args) {\n String cfg = \"Host prod\\n\" +\n \"User deploy\\n\" +\n \"IdentityFile ~/.ssh/\\\\\\n\" +\n \" prod_key # comment\\n\" +\n \"Host test\\nUser tester\";\n Map\u003cString, String\u003e m = parseSshConfig(cfg);\n assert m.get(\"prod.user\").equals(\"deploy\") : m;\n assert m.get(\"prod.identityfile\").equals(\"~/.ssh/prod_key\") : m;\n assert m.get(\"test.user\").equals(\"tester\") : m;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseSshConfig(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseSshConfig(\"Host a\\nPort 22\\nHost b\\nPort 2200\");\nassert a.get(\"a.port\").equals(\"22\") \u0026\u0026 a.get(\"b.port\").equals(\"2200\") : \"host context\";\nMap\u003cString, String\u003e b = parseSshConfig(\"Host x\\nProxyCommand one \\\\\\n two \\\\\\n three\");\nassert b.get(\"x.proxycommand\").equals(\"one two three\") : \"continued value\";\nassert !parseSshConfig(\"User nobody\").containsKey(\".user\") : \"ignore keys before host\";\n","category":"pattern_matching"} {"id":"20","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask20 {\n // Custom slugify: lowercase, non-alnum -\u003e hyphen, collapse hyphens,\n // strip leading/trailing hyphens.\n // ADDITIONALLY: insert hyphen at camelCase boundaries (lower-\u003eUpper)\n // AND at letter\u003c-\u003edigit boundaries.\n public static String slugify(String input) {\n","golden_completion":" StringBuilder sb = new StringBuilder();\n for (int i = 0; i \u003c input.length(); i++) {\n char ch = input.charAt(i);\n if (!Character.isLetterOrDigit(ch)) { if (sb.length() \u003e 0 \u0026\u0026 sb.charAt(sb.length() - 1) != \u0027-\u0027) sb.append(\u0027-\u0027); continue; }\n if (sb.length() \u003e 0 \u0026\u0026 sb.charAt(sb.length() - 1) != \u0027-\u0027 \u0026\u0026 i \u003e 0) {\n char p = input.charAt(i - 1);\n if ((Character.isLowerCase(p) \u0026\u0026 Character.isUpperCase(ch)) || (Character.isLetter(p) \u0026\u0026 Character.isDigit(ch)) || (Character.isDigit(p) \u0026\u0026 Character.isLetter(ch))) sb.append(\u0027-\u0027);\n }\n sb.append(Character.toLowerCase(ch));\n }\n String s = sb.toString(); while (s.startsWith(\"-\")) s = s.substring(1); while (s.endsWith(\"-\")) s = s.substring(0, s.length()-1);\n return s;\n","suffix":" }\n\n public static void main(String[] args) {\n // Custom slugify with camelCase and digit boundary splitting\n assert slugify(\"helloWorld\").equals(\"hello-world\") : \"camelCase\";\n assert slugify(\"item3pack\").equals(\"item-3-pack\") : \"digit boundaries\";\n assert slugify(\"hello world\").equals(\"hello-world\") : \"spaces to hyphens\";\n assert !slugify(\"item3pack\").equals(\"item3pack\") : \"digits must be split\";\n assert !slugify(\"helloWorld\").equals(\"helloworld\") : \"camelCase must split\";\n assert slugify(\" leading \").equals(\"leading\") : \"strip leading/trailing\";\n System.out.println(\"OK: \" + slugify(\"myVar2Go\"));\n }\n}\n","assertions":" assert slugify(\"\").equals(\"\") : \"empty input\";\n assert slugify(\"simple\").equals(\"simple\") : \"no changes needed\";\n assert slugify(\"test123\").equals(\"test-123\") : \"letter to digit\";\n assert slugify(\"123test\").equals(\"123-test\") : \"digit to letter\";\n assert slugify(\"hello--world!!\").equals(\"hello-world\") : \"collapse and strip\";\n assert slugify(\"camelCaseTest\").equals(\"camel-case-test\") : \"multiple camelCase\";\n assert slugify(\"ABC\").equals(\"abc\") : \"all uppercase no split\";\n","category":"pattern_matching"} {"id":"21","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask21 {\n // Parse Dockerfile ENV instructions. Supports \"ENV KEY=value\" and\n // \"ENV KEY value\". Backslash-newline joins continued logical lines.\n // Comments and non-ENV instructions are ignored.\n public static Map\u003cString, String\u003e parseDockerEnv(String text) {\n","golden_completion":" Map\u003cString, String\u003e env = new LinkedHashMap\u003c\u003e();\n StringBuilder buf = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n String line = buf.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { buf.append(line, 0, line.length() - 1); continue; }\n buf.append(line); String s = buf.toString().trim(); buf.setLength(0);\n if (s.isEmpty() || s.startsWith(\"#\") || !s.startsWith(\"ENV \")) continue;\n s = s.substring(4).trim(); int eq = s.indexOf(\u0027=\u0027);\n if (eq \u003e= 0) env.put(s.substring(0, eq).trim(), s.substring(eq + 1).trim());\n else { int sp = s.indexOf(\u0027 \u0027); if (sp \u003e 0) env.put(s.substring(0, sp).trim(), s.substring(sp + 1).trim()); }\n }\n return env;\n","suffix":" }\n\n public static void main(String[] args) {\n String df = \"FROM base\\nENV PATH=/opt/\\\\\\n\" +\n \" bin\\nENV MODE production\\n# ENV SKIP=1\";\n Map\u003cString, String\u003e env = parseDockerEnv(df);\n assert env.get(\"PATH\").equals(\"/opt/bin\") : env;\n assert env.get(\"MODE\").equals(\"production\") : env;\n assert !env.containsKey(\"SKIP\") : env;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseDockerEnv(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseDockerEnv(\"ENV A=1\\nRUN echo no\\nENV B two words\");\nassert a.get(\"A\").equals(\"1\") \u0026\u0026 a.get(\"B\").equals(\"two words\") : \"both forms\";\nMap\u003cString, String\u003e b = parseDockerEnv(\"ENV LONG=one \\\\\\n two \\\\\\n three\");\nassert b.get(\"LONG\").equals(\"one two three\") : \"continued env\";\n","category":"pattern_matching"} {"id":"22","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask22 {\n // Parse systemd-like unit text. [Section] prefixes keys as Section.key.\n // Duplicate keys append with \u0027|\u0027. Backslash-newline joins continued values.\n public static Map\u003cString, String\u003e parseUnit(String text) {\n","golden_completion":" Map\u003cString, String\u003e out = new LinkedHashMap\u003c\u003e();\n String section = \"\"; StringBuilder buf = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n String line = buf.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { buf.append(line, 0, line.length() - 1); continue; }\n buf.append(line); String s = buf.toString().trim(); buf.setLength(0);\n if (s.isEmpty() || s.startsWith(\"#\")) continue;\n if (s.startsWith(\"[\") \u0026\u0026 s.endsWith(\"]\")) { section = s.substring(1, s.length() - 1); continue; }\n int eq = s.indexOf(\u0027=\u0027); if (eq \u003c 0) continue;\n String key = (section.isEmpty() ? \"\" : section + \".\") + s.substring(0, eq).trim();\n out.merge(key, s.substring(eq + 1).trim(), (a, b) -\u003e a + \"|\" + b);\n } return out;\n","suffix":" }\n\n public static void main(String[] args) {\n String unit = \"[Service]\\nExecStart=/bin/app \\\\\\n\" +\n \" --flag\\nExecStart=/bin/sidecar\\n[Install]\\nWantedBy=multi-user.target\";\n Map\u003cString, String\u003e u = parseUnit(unit);\n assert u.get(\"Service.ExecStart\").equals(\"/bin/app --flag|/bin/sidecar\") : u;\n assert u.get(\"Install.WantedBy\").equals(\"multi-user.target\") : u;\n assert u.size() == 2 : u;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseUnit(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseUnit(\"Key=global\\n[S]\\nA=1\\nA=2\");\nassert a.get(\"Key\").equals(\"global\") : \"global key\";\nassert a.get(\"S.A\").equals(\"1|2\") : \"duplicates append\";\nMap\u003cString, String\u003e b = parseUnit(\"[X]\\nLong=one \\\\\\n two \\\\\\n three\");\nassert b.get(\"X.Long\").equals(\"one two three\") : \"continued value\";\n","category":"pattern_matching"} {"id":"23","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask23 {\n private static String stripComment(String s) {\n boolean q = false; StringBuilder out = new StringBuilder();\n for (int i = 0; i \u003c s.length(); i++) { char c = s.charAt(i); if (c == \u0027\\\"\u0027) q = !q; if (c == \u0027#\u0027 \u0026\u0026 !q) break; out.append(c); }\n return out.toString();\n }\n private static String unquote(String s) { return s.length() \u003e= 2 \u0026\u0026 s.startsWith(\"\\\"\") \u0026\u0026 s.endsWith(\"\\\"\") ? s.substring(1, s.length() - 1) : s; }\n\n // Parse labels: key=value per logical line. Backslash-newline joins values;\n // # comments outside double quotes are ignored; quoted values are unwrapped.\n public static Map\u003cString, String\u003e parseLabels(String text) {\n","golden_completion":" Map\u003cString, String\u003e labels = new LinkedHashMap\u003c\u003e();\n StringBuilder buf = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n String line = buf.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { buf.append(line, 0, line.length() - 1); continue; }\n buf.append(line); String s = stripComment(buf.toString()).trim(); buf.setLength(0);\n if (s.isEmpty()) continue;\n int eq = s.indexOf(\u0027=\u0027);\n if (eq \u003e= 0) labels.put(s.substring(0, eq).trim(), unquote(s.substring(eq + 1).trim()));\n }\n return labels;\n","suffix":" }\n\n public static void main(String[] args) {\n String text = \"owner=platform\\npath=/srv/\\\\\\n\" +\n \" api # comment\\nnote=\\\"keep # hash\\\"\";\n Map\u003cString, String\u003e m = parseLabels(text);\n assert m.get(\"owner\").equals(\"platform\") : m;\n assert m.get(\"path\").equals(\"/srv/api\") : m;\n assert m.get(\"note\").equals(\"keep # hash\") : m;\n assert m.size() == 3 : m;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseLabels(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseLabels(\"a=1\\n# skip\\nb = 2\");\nassert a.get(\"a\").equals(\"1\") \u0026\u0026 a.get(\"b\").equals(\"2\") : \"basic labels\";\nMap\u003cString, String\u003e b = parseLabels(\"long=one \\\\\\n two \\\\\\n three\");\nassert b.get(\"long\").equals(\"one two three\") : \"continued value\";\nMap\u003cString, String\u003e c = parseLabels(\"q=\\\"a#b\\\" # tail\");\nassert c.get(\"q\").equals(\"a#b\") : \"quoted hash\";\n","category":"pattern_matching"} {"id":"24","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask24 {\n private static String stripComment(String s) {\n boolean q = false; StringBuilder out = new StringBuilder();\n for (int i = 0; i \u003c s.length(); i++) { char c = s.charAt(i); if (c == \u0027\\\"\u0027) q = !q; if (c == \u0027#\u0027 \u0026\u0026 !q) break; out.append(c); }\n return out.toString();\n }\n private static String unquote(String s) { return s.length() \u003e= 2 \u0026\u0026 s.startsWith(\"\\\"\") \u0026\u0026 s.endsWith(\"\\\"\") ? s.substring(1, s.length() - 1) : s; }\n\n // Parse profiles: [profile] selects a prefix; key=value stores profile.key.\n // Backslash-newline joins values; # comments outside quotes are ignored.\n public static Map\u003cString, String\u003e parseProfiles(String text) {\n","golden_completion":" Map\u003cString, String\u003e out = new LinkedHashMap\u003c\u003e();\n String profile = \"\"; StringBuilder buf = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n String line = buf.length() \u003e 0 ? raw.stripLeading() : raw;\n if (line.endsWith(\"\\\\\")) { buf.append(line, 0, line.length() - 1); continue; }\n buf.append(line); String s = stripComment(buf.toString()).trim(); buf.setLength(0);\n if (s.isEmpty()) continue;\n if (s.startsWith(\"[\") \u0026\u0026 s.endsWith(\"]\")) { profile = s.substring(1, s.length() - 1).trim(); continue; }\n int eq = s.indexOf(\u0027=\u0027);\n if (eq \u003e= 0) out.put((profile.isEmpty() ? \"\" : profile + \".\") + s.substring(0, eq).trim(), unquote(s.substring(eq + 1).trim()));\n }\n return out;\n","suffix":" }\n\n public static void main(String[] args) {\n String src = \"[prod]\\nurl=https://api/\\\\\\n\" +\n \" v1 # tail\\nnote=\\\"keep # hash\\\"\\n[dev]\\nurl=http://local\";\n Map\u003cString, String\u003e p = parseProfiles(src);\n assert p.get(\"prod.url\").equals(\"https://api/v1\") : p;\n assert p.get(\"prod.note\").equals(\"keep # hash\") : p;\n assert p.get(\"dev.url\").equals(\"http://local\") : p;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseProfiles(\"\").isEmpty() : \"empty\";\nMap\u003cString, String\u003e a = parseProfiles(\"root=1\\n[x]\\na=2\");\nassert a.get(\"root\").equals(\"1\") \u0026\u0026 a.get(\"x.a\").equals(\"2\") : \"global plus section\";\nMap\u003cString, String\u003e b = parseProfiles(\"[p]\\nlong=one \\\\\\n two \\\\\\n three\");\nassert b.get(\"p.long\").equals(\"one two three\") : \"continued value\";\nMap\u003cString, String\u003e c = parseProfiles(\"[q]\\nx=\\\"a#b\\\" # tail\");\nassert c.get(\"q.x\").equals(\"a#b\") : \"quoted hash\";\n","category":"pattern_matching"} {"id":"25","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask25 {\n // Custom CRC-8: poly 0x1D (not standard 0x07), init 0xFF (not 0x00)\n private static final int POLY = 0x1D;\n private static final int INIT = 0xFF;\n\n public static int crc8(byte[] data) {\n","golden_completion":" int crc = INIT;\n for (byte b : data) {\n crc ^= (b \u0026 0xFF);\n for (int i = 0; i \u003c 8; i++) {\n if ((crc \u0026 0x80) != 0) crc = ((crc \u003c\u003c 1) ^ POLY) \u0026 0xFF;\n else crc = (crc \u003c\u003c 1) \u0026 0xFF;\n }\n }\n return crc;\n","suffix":" }\n\n public static void main(String[] args) {\n int result = crc8(\"123456789\".getBytes());\n assert result != 0xF4 : \"Must not match standard CRC-8\";\n System.out.println(\"OK: 0x\" + Integer.toHexString(result));\n }\n}\n","assertions":"assert crc8(new byte[]{}) == INIT : \"empty returns init\";\nassert crc8(new byte[]{0}) != 0 : \"single zero with init 0xFF\";\nassert crc8(\"123456789\".getBytes()) != 0xF4 : \"not standard CRC-8\";\n","category":"pattern_matching"} {"id":"26","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.List;\nimport java.util.ArrayList;\n\npublic class PMTask26 {\n // Parse CSV using backtick (`) as quote char. Escaped: `` -\u003e literal `.\n // Commas inside quoted fields are literal. Unquoted fields are trimmed.\n public static List\u003cString\u003e parseCsvLine(String line) {\n List\u003cString\u003e fields = new ArrayList\u003c\u003e();\n StringBuilder cur = new StringBuilder();\n boolean inQ = false;\n int i = 0;\n","golden_completion":" while (i \u003c line.length()) {\n char ch = line.charAt(i);\n if (inQ \u0026\u0026 ch == \u0027`\u0027 \u0026\u0026 i+1 \u003c line.length() \u0026\u0026 line.charAt(i+1) == \u0027`\u0027) { cur.append(\u0027`\u0027); i += 2; continue; }\n if (inQ \u0026\u0026 ch == \u0027`\u0027) { inQ = false; i++; continue; }\n if (inQ) { cur.append(ch); }\n else if (ch == \u0027`\u0027) inQ = true;\n else if (ch == \u0027,\u0027) { fields.add(cur.toString().trim()); cur.setLength(0); }\n else cur.append(ch);\n i++;\n }\n fields.add(cur.toString().trim());\n return fields;\n","suffix":" }\n\n public static void main(String[] args) {\n List\u003cString\u003e r1 = parseCsvLine(\"a,b,c\");\n assert r1.size() == 3 \u0026\u0026 r1.get(0).equals(\"a\") : r1.toString();\n List\u003cString\u003e r2 = parseCsvLine(\"`hello, world`,42\");\n assert r2.size() == 2 \u0026\u0026 r2.get(0).equals(\"hello, world\") : r2.toString();\n List\u003cString\u003e r3 = parseCsvLine(\"`a``b`,c\");\n assert r3.get(0).equals(\"a`b\") : r3.get(0);\n System.out.println(\"OK\");\n }\n}\n","assertions":"List\u003cString\u003e e = PMTask26.parseCsvLine(\"\");\nassert e.size() == 1 \u0026\u0026 e.get(0).equals(\"\") : \"empty\";\nList\u003cString\u003e q = PMTask26.parseCsvLine(\"`,`,x\");\nassert q.size() == 2 \u0026\u0026 q.get(0).equals(\",\") : \"quoted comma\";\nList\u003cString\u003e t = PMTask26.parseCsvLine(\" a , b \");\nassert t.get(0).equals(\"a\") \u0026\u0026 t.get(1).equals(\"b\") : \"trimmed\";\n","category":"pattern_matching"} {"id":"27","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.Map;\nimport java.util.HashMap;\n\npublic class PMTask27 {\n // Template engine: {{key}} -\u003e value. Escaped \\{{ -\u003e literal {{.\n // Unknown keys left as-is. Must parse char-by-char for escape handling.\n public static String render(String tpl, Map\u003cString, String\u003e vars) {\n StringBuilder sb = new StringBuilder();\n int i = 0;\n","golden_completion":" while (i \u003c tpl.length()) {\n if (i+1 \u003c tpl.length() \u0026\u0026 tpl.charAt(i) == \u0027\\\\\u0027 \u0026\u0026 tpl.charAt(i+1) == \u0027{\u0027) { sb.append(\u0027{\u0027); i += 2; }\n else if (i+1 \u003c tpl.length() \u0026\u0026 tpl.charAt(i) == \u0027{\u0027 \u0026\u0026 tpl.charAt(i+1) == \u0027{\u0027) {\n int end = tpl.indexOf(\"}}\", i+2);\n if (end \u003c 0) { sb.append(tpl.charAt(i)); i++; continue; }\n String key = tpl.substring(i+2, end);\n sb.append(vars.containsKey(key) ? vars.get(key) : tpl.substring(i, end+2));\n i = end + 2;\n } else { sb.append(tpl.charAt(i)); i++; }\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n Map\u003cString, String\u003e v = new HashMap\u003c\u003e();\n v.put(\"name\", \"Alice\");\n v.put(\"greeting\", \"Hello\");\n assert render(\"{{greeting}}, {{name}}!\", v).equals(\"Hello, Alice!\");\n assert render(\"Use \\\\{{var}} syntax\", v).equals(\"Use {{var}} syntax\");\n assert render(\"{{unknown}}\", v).equals(\"{{unknown}}\");\n System.out.println(\"OK\");\n }\n}\n","assertions":"Map\u003cString, String\u003e tv = new HashMap\u003c\u003e();\ntv.put(\"x\", \"1\");\nassert PMTask27.render(\"\", tv).equals(\"\") : \"empty\";\nassert PMTask27.render(\"no vars\", tv).equals(\"no vars\") : \"no placeholders\";\nassert PMTask27.render(\"{{x}}\", tv).equals(\"1\") : \"simple\";\nassert PMTask27.render(\"a{{x}}b{{x}}c\", tv).equals(\"a1b1c\") : \"multi\";\nassert PMTask27.render(\"\\\\{{x}}\", tv).equals(\"{{x}}\") : \"escaped\";\n","category":"pattern_matching"} {"id":"28","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.Map;\nimport java.util.LinkedHashMap;\n\npublic class PMTask28 {\n // INI parser: [section] creates \"section.key\" entries.\n // Lines ending with \\ are continuation lines (joined with next).\n // # lines are comments. Returns flat map of section.key -\u003e value.\n public static Map\u003cString, String\u003e parseIni(String text) {\n Map\u003cString, String\u003e result = new LinkedHashMap\u003c\u003e();\n String section = \"\";\n String[] raw = text.split(\"\\n\");\n StringBuilder merged = new StringBuilder();\n","golden_completion":" for (String line : raw) {\n if (line.endsWith(\"\\\\\")) { merged.append(line, 0, line.length()-1); continue; }\n merged.append(line);\n String full = merged.toString().trim(); merged.setLength(0);\n if (full.isEmpty() || full.startsWith(\"#\")) continue;\n if (full.startsWith(\"[\") \u0026\u0026 full.endsWith(\"]\")) section = full.substring(1, full.length()-1);\n else { int eq = full.indexOf(\u0027=\u0027); if (eq \u003e= 0) result.put((section.isEmpty()?\"\":section+\".\")+full.substring(0,eq).trim(), full.substring(eq+1).trim()); }\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n String ini = \"[db]\\nhost=localhost\\nport=5432\\n[app]\\nname=my\\\\\\napp\\ndebug=true\";\n Map\u003cString, String\u003e cfg = parseIni(ini);\n assert cfg.get(\"db.host\").equals(\"localhost\") : \"db.host\";\n assert cfg.get(\"db.port\").equals(\"5432\") : \"db.port\";\n assert cfg.get(\"app.name\").equals(\"myapp\") : \"continuation: \" + cfg.get(\"app.name\");\n assert cfg.get(\"app.debug\").equals(\"true\") : \"app.debug\";\n System.out.println(\"OK: \" + cfg);\n }\n}\n","assertions":"Map\u003cString, String\u003e r = PMTask28.parseIni(\"\");\nassert r.isEmpty() : \"empty input\";\nMap\u003cString, String\u003e r2 = PMTask28.parseIni(\"# comment\\nk=v\");\nassert r2.get(\"k\").equals(\"v\") : \"global key\";\nassert r2.size() == 1 : \"comment ignored\";\n","category":"pattern_matching"} {"id":"29","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask29 {\n // Custom RLE: format \"NxC\" for runs N\u003e1, just \"C\" for singles.\n // e.g. \"aaabbc\" -\u003e \"3xa2xbc\". NOT standard \"a3b2c1\" or \"3a2b1c\".\n public static String runLengthEncode(String input) {\n if (input == null || input.isEmpty()) return \"\";\n StringBuilder sb = new StringBuilder();\n int i = 0;\n","golden_completion":" while (i \u003c input.length()) {\n char ch = input.charAt(i);\n int count = 1;\n while (i + count \u003c input.length() \u0026\u0026 input.charAt(i + count) == ch) count++;\n if (count \u003e 1) sb.append(count).append(\u0027x\u0027).append(ch);\n else sb.append(ch);\n i += count;\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n assert runLengthEncode(\"aaabbc\").equals(\"3xa2xbc\") : runLengthEncode(\"aaabbc\");\n assert runLengthEncode(\"a\").equals(\"a\") : \"single\";\n assert runLengthEncode(\"aaa\").equals(\"3xa\") : \"all same\";\n assert !runLengthEncode(\"aaabbc\").equals(\"3a2b1c\") : \"not standard\";\n System.out.println(\"OK: \" + runLengthEncode(\"aaabbc\"));\n }\n}\n","assertions":"assert PMTask29.runLengthEncode(\"\").equals(\"\") : \"empty\";\nassert PMTask29.runLengthEncode(\"abcde\").equals(\"abcde\") : \"no repeats\";\nassert PMTask29.runLengthEncode(\"aabb\").equals(\"2xa2xb\") : \"pairs\";\nassert PMTask29.runLengthEncode(\"aaaa\").equals(\"4xa\") : \"four same\";\n","category":"pattern_matching"} {"id":"30","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask30 {\n // Custom version comparison: alpha segments \u003e numeric (opposite of semver).\n // Leading-zero numeric segments compared as strings. Fewer segments = less.\n public static int versionCompare(String a, String b) {\n String[] pa = a.split(\"\\\\.\");\n String[] pb = b.split(\"\\\\.\");\n int len = Math.max(pa.length, pb.length);\n","golden_completion":" for (int i = 0; i \u003c len; i++) {\n if (i \u003e= pa.length) return -1; if (i \u003e= pb.length) return 1;\n String sa = pa[i], sb = pb[i];\n boolean an = sa.matches(\"[0-9]+\"), bn = sb.matches(\"[0-9]+\");\n boolean lz = (an \u0026\u0026 sa.length()\u003e1 \u0026\u0026 sa.charAt(0)==\u00270\u0027) || (bn \u0026\u0026 sb.length()\u003e1 \u0026\u0026 sb.charAt(0)==\u00270\u0027);\n if (an \u0026\u0026 bn) { int c = lz ? sa.compareTo(sb) : Integer.compare(Integer.parseInt(sa),Integer.parseInt(sb)); if (c!=0) return c; }\n else if (!an \u0026\u0026 !bn) { int c = sa.compareTo(sb); if (c!=0) return c; }\n else return an ? -1 : 1;\n }\n return 0;\n","suffix":" }\n\n public static void main(String[] args) {\n assert versionCompare(\"1.0.alpha\", \"1.0.1\") \u003e 0 : \"alpha \u003e numeric\";\n assert versionCompare(\"1.2\", \"1.10\") \u003c 0 : \"2 \u003c 10\";\n assert versionCompare(\"1.0\", \"1.0.0\") \u003c 0 : \"fewer segments\";\n assert versionCompare(\"1.01\", \"1.1\") \u003c 0 : \"leading zero string cmp\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert PMTask30.versionCompare(\"1.0\", \"1.0\") == 0 : \"equal\";\nassert PMTask30.versionCompare(\"2.0\", \"1.0\") \u003e 0 : \"major\";\nassert PMTask30.versionCompare(\"1.0.beta\", \"1.0.alpha\") \u003e 0 : \"beta \u003e alpha\";\nassert PMTask30.versionCompare(\"1.0.alpha\", \"1.0.0\") \u003e 0 : \"alpha \u003e numeric\";\n","category":"pattern_matching"} {"id":"31","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask31 {\n // Custom HTML entity mapping — extends standard with extra symbols\n private static final Map\u003cCharacter, String\u003e CUSTOM_ENTITIES = new LinkedHashMap\u003c\u003e();\n static {\n CUSTOM_ENTITIES.put(\u0027\u0026\u0027, \"\u0026amp;\");\n CUSTOM_ENTITIES.put(\u0027\u003c\u0027, \"\u0026lt;\");\n CUSTOM_ENTITIES.put(\u0027\u003e\u0027, \"\u0026gt;\");\n CUSTOM_ENTITIES.put(\u0027\"\u0027, \"\u0026quot;\");\n CUSTOM_ENTITIES.put(\u0027@\u0027, \"\u0026commat;\");\n CUSTOM_ENTITIES.put(\u0027#\u0027, \"\u0026num;\");\n CUSTOM_ENTITIES.put(\u0027$\u0027, \"\u0026dollar;\");\n }\n private static final Map\u003cCharacter, String\u003e STANDARD_ENTITIES = new LinkedHashMap\u003c\u003e();\n static {\n STANDARD_ENTITIES.put(\u0027\u0026\u0027, \"\u0026amp;\");\n STANDARD_ENTITIES.put(\u0027\u003c\u0027, \"\u0026lt;\");\n STANDARD_ENTITIES.put(\u0027\u003e\u0027, \"\u0026gt;\");\n STANDARD_ENTITIES.put(\u0027\"\u0027, \"\u0026quot;\");\n }\n\n public static String htmlEscape(String input) {\n return htmlEscape(input, CUSTOM_ENTITIES);\n }\n\n public static String htmlEscape(String input, Map\u003cCharacter, String\u003e entities) {\n","golden_completion":" if (input == null) return \"\";\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i \u003c input.length(); i++) {\n char c = input.charAt(i);\n if (entities.containsKey(c)) {\n sb.append(entities.get(c));\n } else {\n sb.append(c);\n }\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n // Default uses CUSTOM_ENTITIES which escapes @, #, $ too\n String r1 = htmlEscape(\"a@b#c$d\");\n assert r1.equals(\"a\u0026commat;b\u0026num;c\u0026dollar;d\") : \"custom entities: \" + r1;\n // Standard mode should NOT escape @, #, $\n String r2 = htmlEscape(\"a@b#c$d\", STANDARD_ENTITIES);\n assert r2.equals(\"a@b#c$d\") : \"standard pass-through: \" + r2;\n // Must not match standard behavior for default\n assert !htmlEscape(\"@#$\").equals(\"@#$\") : \"default must escape @#$\";\n assert htmlEscape(\"\u003cb\u003ehi\u003c/b\u003e\").contains(\"\u0026lt;\") : \"basic HTML escaping\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert htmlEscape(\"\").equals(\"\") : \"empty input\";\nassert htmlEscape(null).equals(\"\") : \"null input\";\nassert htmlEscape(\"plain text\").equals(\"plain text\") : \"no special chars\";\nassert htmlEscape(\"\u0026\").equals(\"\u0026amp;\") : \"ampersand\";\nassert htmlEscape(\"$100 @user #tag\").equals(\"\u0026dollar;100 \u0026commat;user \u0026num;tag\") : \"all custom\";\nassert htmlEscape(\"$100 @user #tag\", STANDARD_ENTITIES).equals(\"$100 @user #tag\") : \"standard ignores custom chars\";\nassert htmlEscape(\"\u003cb\u003e\").equals(\"\u0026lt;b\u0026gt;\") : \"angle brackets\";\n","category":"pattern_matching"} {"id":"32","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask32 {\n // ISBN-13 check digit calculator with CUSTOM weight pattern\n // Standard ISBN-13 uses alternating weights [1, 3, 1, 3, ...]\n // This version uses [1, 5, 1, 5, ...] for a custom barcode system\n private static final int[] CUSTOM_WEIGHTS = {1, 5, 1, 5, 1, 5, 1, 5, 1, 5, 1, 5};\n private static final int[] STANDARD_WEIGHTS = {1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3};\n\n public static int isbn13CheckDigit(String digits12) {\n return isbn13CheckDigit(digits12, CUSTOM_WEIGHTS);\n }\n\n public static int isbn13CheckDigit(String digits12, int[] weights) {\n","golden_completion":" int sum = 0;\n for (int i = 0; i \u003c 12; i++) {\n sum += (digits12.charAt(i) - \u00270\u0027) * weights[i];\n }\n int rem = sum % 10;\n return (rem == 0) ? 0 : 10 - rem;\n","suffix":" }\n\n public static void main(String[] args) {\n // \"978030640615\" -\u003e standard ISBN-13 check digit is 7\n int custom = isbn13CheckDigit(\"978030640615\");\n int standard = isbn13CheckDigit(\"978030640615\", STANDARD_WEIGHTS);\n assert standard == 7 : \"standard check digit: \" + standard;\n assert custom != 7 : \"custom must differ from standard: \" + custom;\n // custom weights [1,5]: sum = 9+35+8+0+3+0+6+20+0+30+1+25 = 137, 137%10=7, check=3\n assert custom == 3 : \"custom check digit: \" + custom;\n // Another example\n int c2 = isbn13CheckDigit(\"000000000001\");\n assert c2 == 5 : \"trailing 1 custom: \" + c2;\n int s2 = isbn13CheckDigit(\"000000000001\", STANDARD_WEIGHTS);\n assert s2 == 7 : \"trailing 1 standard: \" + s2;\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert isbn13CheckDigit(\"000000000000\") == 0 : \"all zeros\";\nassert isbn13CheckDigit(\"100000000000\") == 9 : \"leading one custom\";\nassert isbn13CheckDigit(\"100000000000\", STANDARD_WEIGHTS) == 9 : \"leading one standard\";\nassert isbn13CheckDigit(\"111111111111\") != isbn13CheckDigit(\"111111111111\", STANDARD_WEIGHTS) : \"custom differs from standard for all ones\";\nassert isbn13CheckDigit(\"123456789012\") == isbn13CheckDigit(\"123456789012\", CUSTOM_WEIGHTS) : \"default uses custom\";\n","category":"pattern_matching"} {"id":"33","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask33 {\n // Run-length encoding with CUSTOM format: \"3xa\" instead of standard \"a3\" or \"aaa\"\n // Single chars are kept as-is (no \"1xa\"), runs of 2+ get \"Nxc\" format\n // The separator \u0027x\u0027 distinguishes count from character.\n // Example: \"aaabbc\" -\u003e \"3xa2xbc\" (NOT \"a3b2c1\" or \"3a2b1c\")\n // Example: \"aaa\" -\u003e \"3xa\" (NOT \"a3\" or \"aaa\")\n\n public static String runLengthEncode(String input) {\n","golden_completion":" if (input == null || input.isEmpty()) return \"\";\n StringBuilder sb = new StringBuilder();\n for (int i = 0; i \u003c input.length(); ) {\n char c = input.charAt(i);\n int cnt = 1;\n while (i + cnt \u003c input.length() \u0026\u0026 input.charAt(i + cnt) == c) cnt++;\n sb.append(cnt == 1 ? \"\" + c : cnt + \"x\" + c);\n i += cnt;\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n // Standard RLE for \"aaabbc\" is \"a3b2c1\" or \"3a2b1c\" — this uses \"3xa2xbc\"\n String r1 = runLengthEncode(\"aaabbc\");\n assert r1.equals(\"3xa2xbc\") : \"got: \" + r1;\n assert !r1.equals(\"a3b2c1\") : \"must not use standard format a3b2c1\";\n assert !r1.equals(\"3a2b1c\") : \"must not use format 3a2b1c\";\n assert runLengthEncode(\"abc\").equals(\"abc\") : \"no runs\";\n assert runLengthEncode(\"aaa\").equals(\"3xa\") : runLengthEncode(\"aaa\");\n assert runLengthEncode(\"xxxx\").equals(\"4xx\") : runLengthEncode(\"xxxx\");\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert runLengthEncode(\"\").equals(\"\") : \"empty input\";\nassert runLengthEncode(null).equals(\"\") : \"null input\";\nassert runLengthEncode(\"a\").equals(\"a\") : \"single char\";\nassert runLengthEncode(\"aa\").equals(\"2xa\") : \"two chars\";\nassert runLengthEncode(\"aaabbbccc\").equals(\"3xa3xb3xc\") : \"three runs\";\nassert runLengthEncode(\"aabcccdd\").equals(\"2xab3xc2xd\") : \"mixed runs\";\nassert runLengthEncode(\"abcdef\").equals(\"abcdef\") : \"all unique\";\n","category":"pattern_matching"} {"id":"34","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.ArrayList;\nimport java.util.List;\n\npublic class PMTask34 {\n // Bracket-aware CSV field splitter: splits on commas, but commas inside\n // matched brackets (parentheses, square, curly) are NOT delimiters.\n // Brackets can nest. Unmatched brackets are treated as regular characters.\n // Fields are trimmed of leading/trailing whitespace.\n\n public static List\u003cString\u003e splitFields(String line) {\n","golden_completion":" List\u003cString\u003e fields = new ArrayList\u003c\u003e();\n StringBuilder cur = new StringBuilder();\n int depth = 0;\n for (int i = 0; i \u003c line.length(); i++) {\n char c = line.charAt(i);\n if (\"([{\".indexOf(c) \u003e= 0) { depth++; cur.append(c); }\n else if (\")]}\".indexOf(c) \u003e= 0 \u0026\u0026 depth \u003e 0) { depth--; cur.append(c); }\n else if (c == \u0027,\u0027 \u0026\u0026 depth == 0) { fields.add(cur.toString().trim()); cur.setLength(0); }\n else cur.append(c);\n }\n fields.add(cur.toString().trim());\n return fields;\n","suffix":" }\n\n public static void main(String[] args) {\n List\u003cString\u003e r1 = splitFields(\"a, b, c\");\n assert r1.size() == 3 : \"size: \" + r1.size();\n assert r1.get(0).equals(\"a\") : r1.get(0);\n assert r1.get(1).equals(\"b\") : r1.get(1);\n // Commas inside brackets are preserved\n List\u003cString\u003e r2 = splitFields(\"f(a,b), g(c,d)\");\n assert r2.size() == 2 : \"r2 size: \" + r2.size();\n assert r2.get(0).equals(\"f(a,b)\") : r2.get(0);\n assert r2.get(1).equals(\"g(c,d)\") : r2.get(1);\n // Nested brackets\n List\u003cString\u003e r3 = splitFields(\"x, [1,[2,3]], y\");\n assert r3.size() == 3 : \"r3 size: \" + r3.size();\n assert r3.get(1).equals(\"[1,[2,3]]\") : r3.get(1);\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert splitFields(\"\").size() == 1 : \"empty gives one empty field\";\nassert splitFields(\"\").get(0).equals(\"\") : \"empty field\";\nassert splitFields(\"a\").size() == 1 : \"single field\";\nassert splitFields(\"a,b,c\").size() == 3 : \"three fields\";\nassert splitFields(\"{a,b},c\").size() == 2 : \"curly brackets\";\nassert splitFields(\"{a,b},c\").get(0).equals(\"{a,b}\") : \"curly content\";\nassert splitFields(\"((a,b)),c\").get(0).equals(\"((a,b))\") : \"nested parens\";\nassert splitFields(\" x , y \").get(0).equals(\"x\") : \"trimmed\";\n","category":"pattern_matching"} {"id":"35","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\n\npublic class PMTask35 {\n // INI-style config parser with line continuation (trailing backslash)\n // Lines ending with \\ are joined with the next line (backslash removed).\n // Lines starting with # or ; are comments. Empty lines are skipped.\n // Format: key = value (spaces around = are trimmed)\n // No section headers — flat key-value.\n\n public static Map\u003cString, String\u003e parseConfig(String text) {\n","golden_completion":" Map\u003cString, String\u003e result = new LinkedHashMap\u003c\u003e();\n StringBuilder pending = new StringBuilder();\n for (String raw : text.split(\"\\n\", -1)) {\n if (raw.endsWith(\"\\\\\")) { pending.append(raw, 0, raw.length() - 1); continue; }\n pending.append(raw);\n String line = pending.toString().trim();\n pending.setLength(0);\n if (line.isEmpty() || line.startsWith(\"#\") || line.startsWith(\";\")) continue;\n int eq = line.indexOf(\u0027=\u0027);\n if (eq \u003e= 0) result.put(line.substring(0, eq).trim(), line.substring(eq + 1).trim());\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n String cfg = \"name = Alice\\n\" +\n \"# comment\\n\" +\n \"path = /home/\\\\\\n\" +\n \"alice/docs\\n\" +\n \"; another comment\\n\" +\n \"count = 42\";\n Map\u003cString, String\u003e m = parseConfig(cfg);\n assert m.size() == 3 : \"size: \" + m.size();\n assert m.get(\"name\").equals(\"Alice\") : \"name: \" + m.get(\"name\");\n assert m.get(\"path\").equals(\"/home/alice/docs\") : \"path: \" + m.get(\"path\");\n assert m.get(\"count\").equals(\"42\") : \"count\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseConfig(\"\").size() == 0 : \"empty\";\nassert parseConfig(\"# comment only\").size() == 0 : \"comment only\";\nassert parseConfig(\"; also comment\").size() == 0 : \"semicolon comment\";\nassert parseConfig(\"k=v\").get(\"k\").equals(\"v\") : \"no spaces\";\nassert parseConfig(\"k = v\").get(\"k\").equals(\"v\") : \"with spaces\";\nassert parseConfig(\"a = 1\\nb = 2\").size() == 2 : \"two keys\";\nassert parseConfig(\"x = hello\\\\\\nworld\").get(\"x\").equals(\"helloworld\") : \"continuation\";\n","category":"pattern_matching"} {"id":"36","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask36 {\n // Caesar cipher that shifts ALL printable ASCII (32-126), not just letters.\n // Standard Caesar only shifts a-z/A-Z and leaves spaces, digits, punctuation unchanged.\n // This version treats ALL 95 printable ASCII characters (space through tilde) as a\n // single alphabet and shifts within that range.\n // So space (32) + shift 1 = \u0027!\u0027 (33), and \u0027~\u0027 (126) + shift 1 wraps to \u0027 \u0027 (32).\n // Negative shifts go in reverse. Non-printable characters are kept as-is.\n\n public static String caesarCipher(String text, int shift) {\n","golden_completion":" StringBuilder sb = new StringBuilder();\n shift = ((shift % 95) + 95) % 95; // normalize to [0, 94]\n for (int i = 0; i \u003c text.length(); i++) {\n char c = text.charAt(i);\n if (c \u003e= 32 \u0026\u0026 c \u003c= 126) sb.append((char)((c - 32 + shift) % 95 + 32));\n else sb.append(c);\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n // Standard Caesar(\"abc\", 1) = \"bcd\", this also shifts spaces and punctuation\n assert caesarCipher(\"abc\", 1).equals(\"bcd\") : caesarCipher(\"abc\", 1);\n // Space (32) shifted by 1 = \u0027!\u0027 (33)\n assert caesarCipher(\" \", 1).equals(\"!\") : \"space shifted\";\n // Standard Caesar would keep space unchanged — this doesn\u0027t\n assert !caesarCipher(\"a b\", 1).equals(\"b c\") : \"must shift spaces too\";\n assert caesarCipher(\"a b\", 1).equals(\"b!c\") : caesarCipher(\"a b\", 1);\n // \u0027~\u0027 (126) shifted by 1 wraps to \u0027 \u0027 (32)\n assert caesarCipher(\"~\", 1).equals(\" \") : \"wrap around\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert caesarCipher(\"\", 5).equals(\"\") : \"empty\";\nassert caesarCipher(\"abc\", 0).equals(\"abc\") : \"zero shift\";\nassert caesarCipher(\"abc\", 95).equals(\"abc\") : \"full wrap shift\";\nassert caesarCipher(\"abc\", -1).equals(\"`ab\") : \"negative shift\";\nassert caesarCipher(\"Hello World!\", 1).equals(\"Ifmmp!Xpsme\\\"\") : \"sentence shift\";\nassert caesarCipher(caesarCipher(\"test\", 13), -13).equals(\"test\") : \"round trip\";\n","category":"pattern_matching"} {"id":"37","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask37 {\n // Simple infix expression evaluator for +, -, *, / with integer arithmetic.\n // Supports parentheses. NO operator precedence — strictly left-to-right\n // evaluation (unless overridden by parentheses). All numbers are non-negative ints.\n // This is NOT standard math precedence — 2+3*4 = 20, not 14.\n\n private static int p; // parser position\n\n public static int evalExpr(String expr) {\n expr = expr.replaceAll(\"\\\\s+\", \"\");\n p = 0;\n return evalSeq(expr);\n }\n\n private static int evalSeq(String e) {\n","golden_completion":" int result = atom(e);\n while (p \u003c e.length() \u0026\u0026 \"+-*/\".indexOf(e.charAt(p)) \u003e= 0) {\n char op = e.charAt(p++); int r = atom(e);\n result = op==\u0027+\u0027 ? result+r : op==\u0027-\u0027 ? result-r : op==\u0027*\u0027 ? result*r : result/r;\n }\n return result;\n }\n private static int atom(String e) {\n if (e.charAt(p) == \u0027(\u0027) { p++; int v = evalSeq(e); p++; return v; }\n int n = 0; while (p \u003c e.length() \u0026\u0026 Character.isDigit(e.charAt(p))) n = n*10 + (e.charAt(p++)-\u00270\u0027);\n return n;\n","suffix":" }\n\n public static void main(String[] args) {\n // Left-to-right: 2+3*4 = (2+3)*4 = 20, NOT 14\n assert evalExpr(\"2+3*4\") == 20 : \"l-to-r: \" + evalExpr(\"2+3*4\");\n assert evalExpr(\"2+3*4\") != 14 : \"must NOT use standard precedence\";\n // Parentheses override: 2+(3*4) = 2+12 = 14\n assert evalExpr(\"2+(3*4)\") == 14 : \"parens: \" + evalExpr(\"2+(3*4)\");\n assert evalExpr(\"10-2+3\") == 11 : \"l-to-r sub: \" + evalExpr(\"10-2+3\");\n assert evalExpr(\"100/5/4\") == 5 : \"l-to-r div: \" + evalExpr(\"100/5/4\");\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert evalExpr(\"42\") == 42 : \"single number\";\nassert evalExpr(\"0\") == 0 : \"zero\";\nassert evalExpr(\"1+2+3+4\") == 10 : \"chain add\";\nassert evalExpr(\"10*2+3\") == 23 : \"mul then add l-to-r\";\nassert evalExpr(\"(10*2)+3\") == 23 : \"parens match l-to-r\";\nassert evalExpr(\"10*(2+3)\") == 50 : \"parens override\";\nassert evalExpr(\"2 + 3 * 4\") == 20 : \"spaces\";\n","category":"pattern_matching"} {"id":"38","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask38 {\n // Luhn-like check digit calculator with REVERSED doubling position.\n // Standard Luhn: doubles every SECOND digit from the RIGHT (positions 1, 3, 5, ...).\n // This version: doubles every FIRST digit from the RIGHT (positions 0, 2, 4, ...).\n // Position 0 = rightmost digit. So the rightmost digit ITSELF is doubled.\n // Doubling: if d*2 \u003e 9, subtract 9. Check digit = (10 - sum%10) % 10.\n // Example: \"5\" -\u003e 5*2=10-\u003e1, sum=1, check = (10-1)%10 = 9\n\n public static int luhnCheckDigit(String digits) {\n","golden_completion":" int sum = 0;\n for (int i = digits.length() - 1; i \u003e= 0; i--) {\n int d = digits.charAt(i) - \u00270\u0027;\n int pos = digits.length() - 1 - i;\n if (pos % 2 == 0) { d *= 2; if (d \u003e 9) d -= 9; }\n sum += d;\n }\n return sum % 10 == 0 ? 0 : 10 - sum % 10;\n","suffix":" }\n\n public static void main(String[] args) {\n // For \"7992739871\":\n // Standard Luhn doubles odd positions from right -\u003e check digit = 4\n // This version doubles even positions from right -\u003e check digit = 3\n int result = luhnCheckDigit(\"7992739871\");\n assert result != 4 : \"must differ from standard Luhn: \" + result;\n // Custom sum: 2+7+7+9+6+7+4+9+9+7 = 67, check = 10-7 = 3\n assert result == 3 : \"custom luhn: \" + result;\n // Single digit: \"5\" -\u003e doubled = 10 -\u003e 1, check = 9\n assert luhnCheckDigit(\"5\") == 9 : \"single: \" + luhnCheckDigit(\"5\");\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert luhnCheckDigit(\"0\") == 0 : \"single zero doubled is still 0\";\nassert luhnCheckDigit(\"5\") == 9 : \"single 5: 5*2=10-\u003e1, check=(10-1)=9\";\nassert luhnCheckDigit(\"00\") == 0 : \"two zeros\";\nassert luhnCheckDigit(\"1234\") == 4 : \"custom for 1234\";\nassert luhnCheckDigit(\"1234\") != 6 : \"must differ from standard Luhn for 1234\";\n","category":"pattern_matching"} {"id":"39","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.Arrays;\n\npublic class PMTask39 {\n // Deterministic Fisher-Yates shuffle using a custom LCG (Linear Congruential Generator).\n // LCG formula: next = (a * current + c) % m\n // Default params: a=5, c=3, m=16\n\n public static int[] deterministicShuffle(int[] arr, long seed) {\n return deterministicShuffle(arr, seed, 5, 3, 16);\n }\n\n public static int[] deterministicShuffle(int[] arr, long seed, long a, long c, long m) {\n","golden_completion":" int[] result = Arrays.copyOf(arr, arr.length);\n long state = seed;\n for (int i = result.length - 1; i \u003e 0; i--) {\n state = (a * state + c) % m;\n int j = (int)(state % (i + 1));\n int tmp = result[i];\n result[i] = result[j];\n result[j] = tmp;\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n int[] input = {1, 2, 3, 4, 5};\n int[] result = deterministicShuffle(input, 7);\n // seed=7: state=(5*7+3)%16=6, j=6%5=1, swap(4,1) -\u003e [1,5,3,4,2]\n // state=(5*6+3)%16=1, j=1%4=1, swap(3,1) -\u003e [1,4,3,5,2]\n // state=(5*1+3)%16=8, j=8%3=2, swap(2,2) -\u003e [1,4,3,5,2]\n // state=(5*8+3)%16=11, j=11%2=1, swap(1,1) -\u003e [1,4,3,5,2]\n assert Arrays.equals(result, new int[]{1, 4, 3, 5, 2}) : Arrays.toString(result);\n // Original unchanged\n assert Arrays.equals(input, new int[]{1, 2, 3, 4, 5}) : \"original unchanged\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert deterministicShuffle(new int[]{}, 0).length == 0 : \"empty array\";\nassert deterministicShuffle(new int[]{42}, 0).length == 1 : \"single element\";\nassert deterministicShuffle(new int[]{42}, 0)[0] == 42 : \"single element value\";\nassert Arrays.equals(deterministicShuffle(new int[]{1,2,3,4,5}, 7), deterministicShuffle(new int[]{1,2,3,4,5}, 7)) : \"deterministic\";\nassert !Arrays.equals(deterministicShuffle(new int[]{1,2,3,4,5}, 7), deterministicShuffle(new int[]{1,2,3,4,5}, 3)) : \"different seeds\";\n","category":"pattern_matching"} {"id":"40","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask40 {\n // Format a duration in seconds to a human-readable string.\n // Custom thresholds: 1 minute = 100 seconds, 1 hour = 100 minutes, 1 day = 10 hours\n // Standard: 1 min = 60s, 1 hour = 60 min, 1 day = 24 hours\n // Format: \"Xd Xh Xm Xs\" omitting zero components, or \"0s\" for zero.\n\n public static String formatDuration(int totalSeconds) {\n","golden_completion":" if (totalSeconds == 0) return \"0s\";\n int d = totalSeconds / 100000; totalSeconds %= 100000;\n int h = totalSeconds / 10000; totalSeconds %= 10000;\n int m = totalSeconds / 100; int s = totalSeconds % 100;\n StringBuilder sb = new StringBuilder();\n if (d \u003e 0) sb.append(d).append(\"d \");\n if (h \u003e 0) sb.append(h).append(\"h \");\n if (m \u003e 0) sb.append(m).append(\"m \");\n if (s \u003e 0) sb.append(s).append(\"s\");\n return sb.toString().trim();\n","suffix":" }\n\n public static void main(String[] args) {\n // 100 seconds = 1 minute in this system (not 1 min 40 sec)\n assert formatDuration(100).equals(\"1m\") : formatDuration(100);\n assert !formatDuration(100).equals(\"1m 40s\") : \"must not use standard 60s minutes\";\n // 10000 seconds = 1 hour (100 minutes of 100 seconds each)\n assert formatDuration(10000).equals(\"1h\") : formatDuration(10000);\n // 100000 seconds = 1 day (10 hours)\n assert formatDuration(100000).equals(\"1d\") : formatDuration(100000);\n assert formatDuration(0).equals(\"0s\") : \"zero\";\n assert formatDuration(10150).equals(\"1h 1m 50s\") : formatDuration(10150);\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert formatDuration(0).equals(\"0s\") : \"zero\";\nassert formatDuration(1).equals(\"1s\") : \"one second\";\nassert formatDuration(99).equals(\"99s\") : \"99 seconds\";\nassert formatDuration(100).equals(\"1m\") : \"one custom minute\";\nassert formatDuration(101).equals(\"1m 1s\") : \"one minute one second\";\nassert formatDuration(200).equals(\"2m\") : \"two minutes\";\nassert formatDuration(10001).equals(\"1h 1s\") : \"one hour one second\";\nassert formatDuration(110150).equals(\"1d 1h 1m 50s\") : \"all components\";\n","category":"pattern_matching"} {"id":"41","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.Set;\n\npublic class PMTask41 {\n private static final Set\u003cCharacter\u003e VOWELS = Set.of(\u0027a\u0027,\u0027e\u0027,\u0027i\u0027,\u0027o\u0027,\u0027u\u0027);\n private static boolean sameClass(char a, char b) {\n return VOWELS.contains(a) == VOWELS.contains(b);\n }\n\n // Edit distance: sub cost = 1 if same class, 3 if cross-class.\n // Insert/delete always cost 1.\n public static int editDistance(String s, String t) {\n int m = s.length(), n = t.length();\n int[][] dp = new int[m + 1][n + 1];\n for (int i = 0; i \u003c= m; i++) dp[i][0] = i;\n for (int j = 0; j \u003c= n; j++) dp[0][j] = j;\n","golden_completion":" for (int i = 1; i \u003c= m; i++) {\n for (int j = 1; j \u003c= n; j++) {\n if (s.charAt(i-1) == t.charAt(j-1)) {\n dp[i][j] = dp[i-1][j-1];\n } else {\n int rc = sameClass(s.charAt(i-1), t.charAt(j-1)) ? 1 : 3;\n dp[i][j] = Math.min(dp[i-1][j-1] + rc, Math.min(dp[i-1][j] + 1, dp[i][j-1] + 1));\n }\n }\n }\n return dp[m][n];\n","suffix":" }\n\n public static void main(String[] args) {\n assert editDistance(\"cat\", \"cet\") == 1 : \"v-\u003ev cost 1\";\n assert editDistance(\"cat\", \"cbt\") == 2 : \"cross-class: ins+del cheaper\";\n assert editDistance(\"abc\", \"axc\") == 1 : \"c-\u003ec cost 1\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert editDistance(\"\", \"\") == 0 : \"empty\";\nassert editDistance(\"a\", \"\") == 1 : \"del\";\nassert editDistance(\"\", \"b\") == 1 : \"ins\";\nassert editDistance(\"abc\", \"abc\") == 0 : \"same\";\nassert editDistance(\"aaa\", \"eee\") == 3 : \"3 vowel subs\";\nassert editDistance(\"bbb\", \"aaa\") == 6 : \"3 cross-class: each ins+del=2\";\n","category":"pattern_matching"} {"id":"42","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask42 {\n // Custom version comparator for a release channel system:\n // 1. Even major versions (stable) sort BEFORE odd major (beta)\n // 2. Within same parity group: higher major first (descending)\n // 3. Same major: minor ascending, then patch ascending\n // Returns negative if a \u003c b, 0 if equal, positive if a \u003e b.\n // Format: \"major.minor.patch\" (e.g., \"2.1.3\")\n public static int compareVersion(String a, String b) {\n","golden_completion":" String[] pa = a.split(\"\\\\.\");\n String[] pb = b.split(\"\\\\.\");\n int ma = Integer.parseInt(pa[0]), mb = Integer.parseInt(pb[0]);\n int parA = ma % 2, parB = mb % 2;\n if (parA != parB) return parA - parB;\n if (ma != mb) return mb - ma;\n int mia = Integer.parseInt(pa[1]), mib = Integer.parseInt(pb[1]);\n if (mia != mib) return mia - mib;\n return Integer.parseInt(pa[2]) - Integer.parseInt(pb[2]);\n","suffix":" }\n\n public static void main(String[] args) {\n assert compareVersion(\"2.0.0\", \"3.0.0\") \u003c 0 : \"stable before beta\";\n assert compareVersion(\"4.0.0\", \"2.0.0\") \u003c 0 : \"4.x before 2.x\";\n assert compareVersion(\"2.1.0\", \"2.3.0\") \u003c 0 : \"minor asc\";\n assert compareVersion(\"4.0.0\", \"3.0.0\") \u003c 0 : \"even always before odd\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert compareVersion(\"2.0.0\", \"2.0.0\") == 0 : \"equal\";\nassert compareVersion(\"1.0.0\", \"3.0.0\") \u003e 0 : \"odd: 3 before 1\";\nassert compareVersion(\"6.0.0\", \"4.0.0\") \u003c 0 : \"even: 6 before 4\";\nassert compareVersion(\"2.0.1\", \"2.0.5\") \u003c 0 : \"patch asc\";\nassert compareVersion(\"0.0.0\", \"1.0.0\") \u003c 0 : \"0 even before 1 odd\";\n","category":"pattern_matching"} {"id":"43","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.List;\nimport java.util.ArrayList;\n\npublic class PMTask43 {\n private static List\u003cint[]\u003e getRuns(String s) {\n List\u003cint[]\u003e runs = new ArrayList\u003c\u003e();\n if (s.isEmpty()) return runs;\n char prev = s.charAt(0); int cnt = 1;\n for (int i = 1; i \u003c s.length(); i++) {\n if (s.charAt(i) == prev) cnt++;\n else { runs.add(new int[]{prev, cnt}); prev = s.charAt(i); cnt = 1; }\n }\n runs.add(new int[]{prev, cnt});\n return runs;\n }\n\n private static String fmtRun(int[] run) {\n return run[1] \u003e 1 ? \"\" + (char)run[0] + \"x\" + run[1] : \"\" + (char)run[0];\n }\n\n // Custom RLE: singles as-is, runs\u003e=2 use \"CxN\",\n // adjacent runs of SAME length (both \u003e 1) grouped in parens.\n public static String rleEncode(String s) {\n List\u003cint[]\u003e runs = getRuns(s);\n StringBuilder sb = new StringBuilder();\n int i = 0;\n","golden_completion":" while (i \u003c runs.size()) {\n int j = i;\n while (j \u003c runs.size() \u0026\u0026 runs.get(j)[1] == runs.get(i)[1]) j++;\n boolean grp = (j - i \u003e 1) \u0026\u0026 runs.get(i)[1] \u003e 1;\n if (grp) sb.append(\u0027(\u0027);\n for (int k = i; k \u003c j; k++) sb.append(fmtRun(runs.get(k)));\n if (grp) sb.append(\u0027)\u0027);\n i = j;\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n assert rleEncode(\"abc\").equals(\"abc\") : \"singles\";\n assert rleEncode(\"aabbc\").equals(\"(ax2bx2)c\") : \"grouped\";\n assert rleEncode(\"aaabbbcc\").equals(\"(ax3bx3)cx2\") : \"mixed\";\n assert !rleEncode(\"aabbc\").equals(\"2a2b1c\") : \"not std\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert rleEncode(\"\").equals(\"\") : \"empty\";\nassert rleEncode(\"a\").equals(\"a\") : \"single\";\nassert rleEncode(\"aa\").equals(\"ax2\") : \"pair\";\nassert rleEncode(\"aabb\").equals(\"(ax2bx2)\") : \"two pairs\";\nassert rleEncode(\"aaabb\").equals(\"ax3bx2\") : \"diff len\";\nassert rleEncode(\"aabbcc\").equals(\"(ax2bx2cx2)\") : \"three same\";\n","category":"pattern_matching"} {"id":"44","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask44 {\n // Additive-only Roman numerals (NO subtractive pairs like IV, IX, XL).\n // 4=IIII, 9=VIIII, 40=XXXX, 90=LXXXX, 400=CCCC, 900=DCCCC\n private static final int[] VALS = {1000, 500, 100, 50, 10, 5, 1};\n private static final String[] SYMS = {\"M\",\"D\",\"C\",\"L\",\"X\",\"V\",\"I\"};\n\n public static String toRoman(int num) {\n","golden_completion":" StringBuilder sb = new StringBuilder();\n for (int i = 0; i \u003c VALS.length; i++) {\n while (num \u003e= VALS[i]) {\n sb.append(SYMS[i]);\n num -= VALS[i];\n }\n }\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n assert toRoman(4).equals(\"IIII\") : \"4 = IIII not IV\";\n assert !toRoman(4).equals(\"IV\") : \"no subtractive\";\n assert toRoman(9).equals(\"VIIII\") : \"9 = VIIII not IX\";\n assert !toRoman(9).equals(\"IX\") : \"no IX\";\n assert toRoman(3).equals(\"III\") : \"3\";\n assert toRoman(40).equals(\"XXXX\") : \"40 = XXXX not XL\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert toRoman(1).equals(\"I\") : \"1\";\nassert toRoman(5).equals(\"V\") : \"5\";\nassert toRoman(10).equals(\"X\") : \"10\";\nassert toRoman(14).equals(\"XIIII\") : \"14\";\nassert toRoman(90).equals(\"LXXXX\") : \"90\";\nassert toRoman(400).equals(\"CCCC\") : \"400\";\nassert toRoman(900).equals(\"DCCCC\") : \"900\";\nassert toRoman(1994).equals(\"MDCCCCLXXXXIIII\") : \"1994\";\n","category":"pattern_matching"} {"id":"45","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.ArrayDeque;\n\npublic class PMTask45 {\n private static final String OPENS = \"([{\";\n private static final String CLOSES = \")]}\";\n\n // Validate brackets, IGNORING brackets inside double-quoted strings.\n // Escaped quotes (\\\") do NOT end the string.\n public static boolean validateBrackets(String input) {\n ArrayDeque\u003cCharacter\u003e stk = new ArrayDeque\u003c\u003e();\n boolean inStr = false;\n for (int i = 0; i \u003c input.length(); i++) {\n char c = input.charAt(i);\n","golden_completion":" if (inStr) {\n if (c == \u0027\\\\\u0027 \u0026\u0026 i + 1 \u003c input.length()) { i++; continue; }\n if (c == \u0027\"\u0027) inStr = false;\n continue;\n }\n if (c == \u0027\"\u0027) { inStr = true; continue; }\n int oi = OPENS.indexOf(c), ci = CLOSES.indexOf(c);\n if (oi \u003e= 0) stk.push(c);\n else if (ci \u003e= 0) { if (stk.isEmpty() || stk.pop() != OPENS.charAt(ci)) return false; }\n","suffix":" }\n return stk.isEmpty() \u0026\u0026 !inStr;\n }\n\n public static void main(String[] args) {\n assert validateBrackets(\"()\") : \"simple\";\n assert validateBrackets(\"([{}])\") : \"nested\";\n assert !validateBrackets(\"(]\") : \"mismatch\";\n assert validateBrackets(\"(\\\"[}\\\")\" ) : \"brackets in string\";\n assert !validateBrackets(\"(\") : \"unclosed\";\n assert validateBrackets(\"(\\\"hi \\\\\\\" there\\\")\" ) : \"escaped quote\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert validateBrackets(\"\") : \"empty\";\nassert validateBrackets(\"no brackets\") : \"none\";\nassert validateBrackets(\"{\\\"(\\\"}\") : \"bracket in str\";\nassert !validateBrackets(\"}\") : \"extra close\";\nassert validateBrackets(\"[\\\"]\\\"]\") : \"close in str\";\n","category":"pattern_matching"} {"id":"46","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.LinkedHashMap;\nimport java.util.Map;\nimport java.util.ArrayList;\n\npublic class PMTask46 {\n private static String stripComment(String line) {\n StringBuilder cl = new StringBuilder();\n boolean q = false;\n for (int i = 0; i \u003c line.length(); i++) { char c = line.charAt(i); if (c==\u0027\"\u0027) q=!q; if (c==\u0027#\u0027\u0026\u0026!q) break; cl.append(c); }\n return cl.toString().trim();\n }\n private static String unquote(String v) {\n return v.length()\u003e=2 \u0026\u0026 v.startsWith(\"\\\"\") \u0026\u0026 v.endsWith(\"\\\"\") ? v.substring(1,v.length()-1) : v;\n }\n\n // Parse config: key=value, \u0027#\u0027 comments outside quotes, \u0027\\\u0027 line continuation.\n public static Map\u003cString, String\u003e parseConfig(String text) {\n Map\u003cString, String\u003e result = new LinkedHashMap\u003c\u003e();\n // Join continuation lines\n var raw = text.split(\"\\n\", -1);\n var lines = new ArrayList\u003cString\u003e();\n var cur = new StringBuilder();\n for (var r : raw) { cur.append(r); if (cur.toString().endsWith(\"\\\\\")) cur.setLength(cur.length()-1); else { lines.add(cur.toString()); cur = new StringBuilder(); } }\n if (cur.length() \u003e 0) lines.add(cur.toString());\n","golden_completion":" for (String line : lines) {\n String s = stripComment(line);\n if (s.isEmpty() || !s.contains(\"=\")) continue;\n int eq = s.indexOf(\u0027=\u0027);\n String k = s.substring(0, eq).trim();\n String v = unquote(s.substring(eq + 1).trim());\n result.put(k, v);\n }\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n String cfg = \"name = Alice\\n# comment\\ngreeting = \\\"Hello # World\\\"\\npath = /usr/\\\\\\nlocal/bin\";\n Map\u003cString, String\u003e m = parseConfig(cfg);\n assert m.get(\"name\").equals(\"Alice\") : \"basic\";\n assert !m.containsKey(\"comment\") : \"comment skipped\";\n assert m.get(\"greeting\").equals(\"Hello # World\") : \"# in quotes\";\n assert m.get(\"path\").equals(\"/usr/local/bin\") : \"continuation\";\n assert m.size() == 3 : \"3 entries\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert parseConfig(\"\").isEmpty() : \"empty\";\nassert parseConfig(\"# only\").isEmpty() : \"comment only\";\nassert parseConfig(\"x = 1\").get(\"x\").equals(\"1\") : \"simple\";\nassert parseConfig(\"x = a # note\").get(\"x\").equals(\"a\") : \"inline comment\";\nassert parseConfig(\"x = \\\"a # b\\\"\").get(\"x\").equals(\"a # b\") : \"# in quotes\";\n","category":"pattern_matching"} {"id":"47","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.Map;\n\npublic class PMTask47 {\n // Template: {{key}} replaced from map. \\\\{{ is literal \u0027{\u0027.\n // Unknown keys left as {{key}}. Unmatched {{ left as-is.\n public static String render(String tpl, Map\u003cString, String\u003e vars) {\n StringBuilder sb = new StringBuilder();\n int i = 0;\n while (i \u003c tpl.length()) {\n","golden_completion":" if (i+1 \u003c tpl.length() \u0026\u0026 tpl.charAt(i) == \u0027\\\\\u0027 \u0026\u0026 tpl.charAt(i+1) == \u0027{\u0027) {\n sb.append(\u0027{\u0027); i += 2;\n } else if (i+1 \u003c tpl.length() \u0026\u0026 tpl.charAt(i) == \u0027{\u0027 \u0026\u0026 tpl.charAt(i+1) == \u0027{\u0027) {\n int end = tpl.indexOf(\"}}\", i+2);\n if (end \u003c 0) { sb.append(\"{{\"); i += 2; }\n else {\n String key = tpl.substring(i+2, end);\n sb.append(vars.getOrDefault(key, \"{{\"+key+\"}}\")); i = end+2;\n }\n } else { sb.append(tpl.charAt(i)); i++; }\n","suffix":" }\n return sb.toString();\n }\n\n public static void main(String[] args) {\n var v = Map.of(\"name\", \"Alice\", \"age\", \"30\");\n assert render(\"Hello {{name}}!\", v).equals(\"Hello Alice!\") : \"basic\";\n assert render(\"\\\\{{name}}\", v).equals(\"{{name}}\") : \"escaped\";\n assert render(\"{{unknown}}\", v).equals(\"{{unknown}}\") : \"unknown\";\n assert render(\"{{name}} is {{age}}\", v).equals(\"Alice is 30\") : \"multi\";\n assert render(\"{{oops\", v).equals(\"{{oops\") : \"unmatched\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert render(\"\", Map.of()).equals(\"\") : \"empty\";\nassert render(\"no vars\", Map.of()).equals(\"no vars\") : \"no sub\";\nassert render(\"{{a}}{{b}}\", Map.of(\"a\",\"1\",\"b\",\"2\")).equals(\"12\") : \"adjacent\";\nassert render(\"\\\\{{x}}={{x}}\", Map.of(\"x\",\"y\")).equals(\"{{x}}=y\") : \"mixed\";\nassert render(\"{{\", Map.of()).equals(\"{{\") : \"open only\";\n","category":"pattern_matching"} {"id":"48","testsource":"devbench-pattern-matching","language":"java","prefix":"import java.util.List;\nimport java.util.ArrayList;\n\npublic class PMTask48 {\n // + and - bind TIGHTER than * and / (reversed precedence).\n // So 2*3+4*5 = 2*(3+4)*5 = 70\n private static int evalAdd(String e) {\n var v = new ArrayList\u003cInteger\u003e(); var o = new ArrayList\u003cCharacter\u003e(); int s = 0;\n for (int i = 0; i \u003c= e.length(); i++) { if (i==e.length()||e.charAt(i)==\u0027+\u0027||e.charAt(i)==\u0027-\u0027) { v.add(Integer.parseInt(e.substring(s,i))); if(i\u003ce.length()) o.add(e.charAt(i)); s=i+1; } }\n int r = v.get(0); for (int i = 0; i \u003c o.size(); i++) r = o.get(i)==\u0027+\u0027 ? r+v.get(i+1) : r-v.get(i+1); return r;\n }\n // Split on low-prec ops (* /), eval each segment via evalAdd, combine\n public static int evalExpr(String expr) {\n expr = expr.replaceAll(\"\\\\s+\", \"\");\n List\u003cInteger\u003e vals = new ArrayList\u003c\u003e();\n List\u003cCharacter\u003e ops = new ArrayList\u003c\u003e(); int s = 0;\n","golden_completion":" for (int i = 0; i \u003c= expr.length(); i++) {\n if (i == expr.length() || expr.charAt(i) == \u0027*\u0027 || expr.charAt(i) == \u0027/\u0027) {\n vals.add(evalAdd(expr.substring(s, i)));\n if (i \u003c expr.length()) ops.add(expr.charAt(i));\n s = i + 1;\n }\n }\n int r = vals.get(0);\n for (int i = 0; i \u003c ops.size(); i++)\n r = ops.get(i) == \u0027*\u0027 ? r * vals.get(i+1) : r / vals.get(i+1);\n return r;\n","suffix":" }\n\n public static void main(String[] args) {\n assert evalExpr(\"2*3+4\") == 14 : \"reversed prec\";\n assert evalExpr(\"2*3+4*5\") == 70 : \"multi\";\n assert evalExpr(\"10+5-3\") == 12 : \"add only\";\n assert evalExpr(\"3*4\") == 12 : \"mul only\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert evalExpr(\"5\") == 5 : \"single\";\nassert evalExpr(\"1+2\") == 3 : \"add\";\nassert evalExpr(\"10/2+3\") == 2 : \"10/(2+3)=2\";\nassert evalExpr(\"1+1*1+1\") == 4 : \"2*2=4\";\nassert evalExpr(\"100/10+10\") == 5 : \"100/20=5\";\n","category":"pattern_matching"} {"id":"49","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask49 {\n // Format a date as \"business date\": DD/YYYY/MM\n // All fields zero-padded: DD=2, YYYY=4, MM=2\n // Month must be 1-12, day must be 1-31, year must be \u003e 0.\n // Returns null for invalid dates.\n public static String formatDate(int year, int month, int day) {\n","golden_completion":" if (year \u003c= 0 || month \u003c 1 || month \u003e 12 || day \u003c 1 || day \u003e 31)\n return null;\n return String.format(\"%02d/%04d/%02d\", day, year, month);\n","suffix":" }\n\n public static int[] parseDate(String s) {\n String[] p = s.split(\"/\");\n return new int[]{Integer.parseInt(p[1]), Integer.parseInt(p[2]), Integer.parseInt(p[0])};\n }\n\n public static void main(String[] args) {\n assert formatDate(2024, 3, 15).equals(\"15/2024/03\") : \"DD/YYYY/MM\";\n assert !formatDate(2024, 3, 15).equals(\"2024-03-15\") : \"not ISO\";\n assert !formatDate(2024, 3, 15).equals(\"03/15/2024\") : \"not US\";\n assert formatDate(0, 1, 1) == null : \"invalid year\";\n assert formatDate(2024, 13, 1) == null : \"invalid month\";\n int[] p = parseDate(\"15/2024/03\");\n assert p[0] == 2024 \u0026\u0026 p[1] == 3 \u0026\u0026 p[2] == 15 : \"roundtrip\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert formatDate(2000, 1, 1).equals(\"01/2000/01\") : \"new year\";\nassert formatDate(1999, 12, 31).equals(\"31/1999/12\") : \"end of year\";\nassert formatDate(2024, 11, 5).equals(\"05/2024/11\") : \"election day\";\nassert formatDate(-1, 1, 1) == null : \"negative year\";\nassert formatDate(2024, 0, 1) == null : \"zero month\";\nint[] p2 = parseDate(formatDate(2024, 6, 7));\nassert p2[0] == 2024 \u0026\u0026 p2[1] == 6 \u0026\u0026 p2[2] == 7 : \"roundtrip2\";\n","category":"pattern_matching"} {"id":"50","testsource":"devbench-pattern-matching","language":"java","prefix":"public class PMTask50 {\n // European-Indian number format:\n // - Decimal separator: comma (\u0027,\u0027), grouping separator: dot (\u0027.\u0027)\n // - Groups of 2 digits from right (Indian style)\n // \"1234567.89\" -\u003e \"1.23.45.67,89\"; \"1000\" -\u003e \"10.00\"\n public static String formatNumber(String num) {\n String[] parts = num.split(\"\\\\.\");\n String intPart = parts[0];\n String decPart = parts.length \u003e 1 ? parts[1] : null;\n","golden_completion":" StringBuilder sb = new StringBuilder();\n int pos = intPart.length();\n while (pos \u003e 0) {\n int start = Math.max(0, pos - 2);\n if (sb.length() \u003e 0) sb.insert(0, \u0027.\u0027);\n sb.insert(0, intPart.substring(start, pos));\n pos = start;\n }\n if (decPart != null) sb.append(\u0027,\u0027).append(decPart);\n return sb.toString();\n","suffix":" }\n\n public static void main(String[] args) {\n assert formatNumber(\"1234567.89\").equals(\"1.23.45.67,89\") : \"full\";\n assert formatNumber(\"1000\").equals(\"10.00\") : \"no dec\";\n assert formatNumber(\"100\").equals(\"1.00\") : \"three digits\";\n assert formatNumber(\"42.5\").equals(\"42,5\") : \"short\";\n assert !formatNumber(\"1234567.89\").equals(\"1,234,567.89\") : \"not std\";\n System.out.println(\"OK\");\n }\n}\n","assertions":"assert formatNumber(\"1\").equals(\"1\") : \"single\";\nassert formatNumber(\"12\").equals(\"12\") : \"two\";\nassert formatNumber(\"123\").equals(\"1.23\") : \"three\";\nassert formatNumber(\"1234\").equals(\"12.34\") : \"four\";\nassert formatNumber(\"12345\").equals(\"1.23.45\") : \"five\";\nassert formatNumber(\"0.99\").equals(\"0,99\") : \"zero dec\";\n","category":"pattern_matching"} {"id":"1","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask1 {\n sealed interface Expr permits Num, Add, Neg {}\n record Num(int value) implements Expr {}\n record Add(Expr left, Expr right) implements Expr {}\n record Neg(Expr inner) implements Expr {}\n\n public static int eval(Expr e) {\n return switch (e) {\n","golden_completion":" case Num(var v) -\u003e v;\n case Add(var l, var r) -\u003e eval(l) + eval(r);\n case Neg(var inner) -\u003e -eval(inner);\n","suffix":" };\n }\n\n public static void main(String[] args) {\n Expr expr = new Add(new Num(3), new Neg(new Num(1)));\n int result = eval(expr);\n System.out.println(result);\n }\n}\n","assertions":"assert eval(new Num(5)) == 5 : \"Num failed\";\nassert eval(new Neg(new Num(3))) == -3 : \"Neg failed\";\nassert eval(new Add(new Num(10), new Num(20))) == 30 : \"Add failed\";\nassert eval(new Add(new Num(3), new Neg(new Num(1)))) == 2 : \"Nested failed\";\nassert eval(new Neg(new Add(new Num(4), new Num(6)))) == -10 : \"Neg(Add) failed\";\n","category":"syntax_completion"} {"id":"2","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask2 {\n sealed interface Vehicle permits Car, Truck, Motorcycle {}\n record Car(int seats, boolean electric) implements Vehicle {}\n record Truck(double tonnage) implements Vehicle {}\n record Motorcycle(int cc) implements Vehicle {}\n\n public static String classify(Vehicle v) {\n return switch (v) {\n case Car(var s, var e) when s \u003e 4 \u0026\u0026 e -\u003e {\n yield \"eco-van-\" + s;\n }\n case Car(var s, var e) when e -\u003e\n","golden_completion":" \"eco-car-\" + s;\n case Car(var s, var e) -\u003e\n \"car-\" + s;\n case Truck(var t) when t \u003e 10 -\u003e\n \"heavy-truck\";\n case Truck(var t) -\u003e\n \"light-truck\";\n case Motorcycle(var cc) when cc \u003e 600 -\u003e\n \"sport-bike\";\n case Motorcycle(var cc) -\u003e\n \"bike-\" + cc;\n","suffix":" };\n }\n\n public static void main(String[] args) {\n System.out.println(classify(new Car(5, true)));\n System.out.println(classify(new Car(4, true)));\n System.out.println(classify(new Car(4, false)));\n System.out.println(classify(new Truck(15)));\n System.out.println(classify(new Truck(5)));\n System.out.println(classify(new Motorcycle(1000)));\n System.out.println(classify(new Motorcycle(250)));\n }\n}\n","assertions":"assert classify(new Car(5, true)).equals(\"eco-van-5\") : \"eco-van failed\";\nassert classify(new Car(4, true)).equals(\"eco-car-4\") : \"eco-car failed\";\nassert classify(new Car(4, false)).equals(\"car-4\") : \"gas car failed\";\nassert classify(new Car(2, false)).equals(\"car-2\") : \"small car failed\";\nassert classify(new Truck(15)).equals(\"heavy-truck\") : \"heavy truck failed\";\nassert classify(new Truck(5)).equals(\"light-truck\") : \"light truck failed\";\nassert classify(new Motorcycle(1000)).equals(\"sport-bike\") : \"sport bike failed\";\nassert classify(new Motorcycle(250)).equals(\"bike-250\") : \"bike failed\";\n","category":"syntax_completion"} {"id":"3","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask3 {\n sealed interface Prim permits PInt, PStr, PBool {}\n record PInt(int val) implements Prim {}\n record PStr(String val) implements Prim {}\n record PBool(boolean val) implements Prim {}\n\n sealed interface Op permits Cmp, Concat {}\n record Cmp(Prim left, Prim right) implements Op {}\n record Concat(Prim left, Prim right) implements Op {}\n\n public static String execute(Op op) {\n return switch (op) {\n case Cmp(var l, var r) -\u003e switch (l) {\n case PInt(var lv) -\u003e switch (r) {\n case PInt(var rv) -\u003e lv == rv ? \"eq\" : (lv \u003c rv ? \"lt\" : \"gt\");\n default -\u003e \"type-mismatch\";\n };\n case PStr(var lv) -\u003e switch (r) {\n case PStr(var rv) -\u003e lv.compareTo(rv) == 0 ? \"eq\" : (lv.compareTo(rv) \u003c 0 ? \"lt\" : \"gt\");\n default -\u003e \"type-mismatch\";\n };\n case PBool(var lv) -\u003e switch (r) {\n case PBool(var rv) -\u003e lv == rv ? \"eq\" : \"neq\";\n default -\u003e \"type-mismatch\";\n };\n };\n case Concat(var l, var r) -\u003e switch (l) {\n case PStr(var lv) -\u003e switch (r) {\n","golden_completion":" case PStr(var rv) -\u003e lv + rv;\n case PInt(var rv) -\u003e lv + rv;\n case PBool(var rv) -\u003e lv + rv;\n };\n default -\u003e \"concat-error\";\n };\n","suffix":" };\n }\n\n public static void main(String[] args) {\n System.out.println(execute(new Cmp(new PInt(3), new PInt(5))));\n System.out.println(execute(new Concat(new PStr(\"hello\"), new PStr(\"world\"))));\n }\n}\n","assertions":"assert execute(new Cmp(new PInt(3), new PInt(5))).equals(\"lt\") : \"int lt failed\";\nassert execute(new Cmp(new PInt(5), new PInt(5))).equals(\"eq\") : \"int eq failed\";\nassert execute(new Cmp(new PInt(7), new PInt(3))).equals(\"gt\") : \"int gt failed\";\nassert execute(new Cmp(new PInt(1), new PStr(\"a\"))).equals(\"type-mismatch\") : \"int-str mismatch failed\";\nassert execute(new Cmp(new PStr(\"abc\"), new PStr(\"def\"))).equals(\"lt\") : \"str lt failed\";\nassert execute(new Cmp(new PStr(\"z\"), new PStr(\"a\"))).equals(\"gt\") : \"str gt failed\";\nassert execute(new Cmp(new PBool(true), new PBool(true))).equals(\"eq\") : \"bool eq failed\";\nassert execute(new Cmp(new PBool(true), new PBool(false))).equals(\"neq\") : \"bool neq failed\";\nassert execute(new Cmp(new PBool(true), new PInt(1))).equals(\"type-mismatch\") : \"bool-int mismatch failed\";\nassert execute(new Concat(new PStr(\"hello\"), new PStr(\"world\"))).equals(\"helloworld\") : \"concat str failed\";\nassert execute(new Concat(new PStr(\"n\"), new PInt(42))).equals(\"n42\") : \"concat str+int failed\";\nassert execute(new Concat(new PStr(\"flag:\"), new PBool(true))).equals(\"flag:true\") : \"concat str+bool failed\";\nassert execute(new Concat(new PInt(1), new PStr(\"x\"))).equals(\"concat-error\") : \"concat non-str left failed\";\n","category":"syntax_completion"} {"id":"4","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask4 {\n record Student(String name, String grade, int score) {}\n\n public static Map\u003cString, String\u003e topPerGrade(List\u003cStudent\u003e students) {\n return students.stream()\n .collect(Collectors.groupingBy(\n Student::grade,\n Collectors.collectingAndThen(\n Collectors.maxBy(Comparator.comparingInt(\n","golden_completion":" Student::score)),\n opt -\u003e opt.map(s -\u003e s.name() + \":\" + s.score())\n .orElse(\"none\")\n )\n","suffix":" ));\n }\n\n public static void main(String[] args) {\n var students = List.of(\n new Student(\"Alice\", \"A\", 95),\n new Student(\"Bob\", \"B\", 80),\n new Student(\"Carol\", \"A\", 90),\n new Student(\"Dave\", \"B\", 85),\n new Student(\"Eve\", \"A\", 88)\n );\n var top = topPerGrade(students);\n System.out.println(top);\n }\n}\n","assertions":"var students = List.of(\n new Student(\"Alice\", \"A\", 95),\n new Student(\"Bob\", \"B\", 80),\n new Student(\"Carol\", \"A\", 90),\n new Student(\"Dave\", \"B\", 85),\n new Student(\"Eve\", \"A\", 88)\n);\nvar top = topPerGrade(students);\nassert top.size() == 2 : \"Expected 2 grades: \" + top;\nassert top.get(\"A\").equals(\"Alice:95\") : \"A top wrong: \" + top.get(\"A\");\nassert top.get(\"B\").equals(\"Dave:85\") : \"B top wrong: \" + top.get(\"B\");\nvar single = topPerGrade(List.of(new Student(\"X\", \"C\", 50)));\nassert single.get(\"C\").equals(\"X:50\") : \"single student wrong: \" + single.get(\"C\");\n","category":"syntax_completion"} {"id":"5","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask5 {\n record Product(String name, String category, double price) {}\n\n public static Map.Entry\u003cDouble, Double\u003e priceRange(List\u003cProduct\u003e products) {\n return products.stream()\n .filter(p -\u003e p.price() \u003e 0)\n .collect(Collectors.teeing(\n","golden_completion":" Collectors.minBy(Comparator.comparingDouble(Product::price)),\n Collectors.maxBy(Comparator.comparingDouble(Product::price)),\n (min, max) -\u003e Map.entry(\n min.map(Product::price).orElse(0.0),\n max.map(Product::price).orElse(0.0)\n )\n","suffix":" ));\n }\n\n public static void main(String[] args) {\n var products = List.of(\n new Product(\"A\", \"tech\", 29.99),\n new Product(\"B\", \"tech\", 99.99),\n new Product(\"C\", \"food\", 3.50),\n new Product(\"D\", \"food\", 12.00)\n );\n var range = priceRange(products);\n System.out.println(range.getKey() + \" - \" + range.getValue());\n }\n}\n","assertions":"var products = List.of(\n new Product(\"A\", \"tech\", 29.99),\n new Product(\"B\", \"tech\", 99.99),\n new Product(\"C\", \"food\", 3.50),\n new Product(\"D\", \"food\", 12.00)\n);\nvar range = priceRange(products);\nassert Math.abs(range.getKey() - 3.50) \u003c 0.01 : \"min wrong: \" + range.getKey();\nassert Math.abs(range.getValue() - 99.99) \u003c 0.01 : \"max wrong: \" + range.getValue();\nvar empty = priceRange(List.of());\nassert empty.getKey() == 0.0 : \"empty min wrong\";\nassert empty.getValue() == 0.0 : \"empty max wrong\";\nvar single = priceRange(List.of(new Product(\"X\", \"x\", 5.0)));\nassert Math.abs(single.getKey() - 5.0) \u003c 0.01 : \"single min wrong\";\nassert Math.abs(single.getValue() - 5.0) \u003c 0.01 : \"single max wrong\";\n","category":"syntax_completion"} {"id":"6","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask6 {\n record Order(String customer, List\u003cItem\u003e items) {}\n record Item(String name, double price, int qty) {}\n\n public static Map\u003cString, Double\u003e totalPerCustomer(List\u003cOrder\u003e orders) {\n return orders.stream()\n .flatMap(o -\u003e o.items().stream()\n .map(i -\u003e Map.entry(o.customer(),\n","golden_completion":" i.price() * i.qty()))\n )\n .collect(Collectors.groupingBy(\n Map.Entry::getKey,\n Collectors.summingDouble(Map.Entry::getValue)\n ));\n","suffix":" }\n\n public static void main(String[] args) {\n var orders = List.of(\n new Order(\"Alice\", List.of(new Item(\"Book\", 10.0, 2), new Item(\"Pen\", 1.5, 3))),\n new Order(\"Bob\", List.of(new Item(\"Laptop\", 999.0, 1))),\n new Order(\"Alice\", List.of(new Item(\"Notebook\", 5.0, 4)))\n );\n var totals = totalPerCustomer(orders);\n System.out.println(totals);\n }\n}\n","assertions":"var orders = List.of(\n new Order(\"Alice\", List.of(new Item(\"Book\", 10.0, 2), new Item(\"Pen\", 1.5, 3))),\n new Order(\"Bob\", List.of(new Item(\"Laptop\", 999.0, 1))),\n new Order(\"Alice\", List.of(new Item(\"Notebook\", 5.0, 4)))\n);\nvar totals = totalPerCustomer(orders);\nassert totals.size() == 2 : \"Expected 2 customers\";\nassert Math.abs(totals.get(\"Alice\") - 44.5) \u003c 0.01 : \"Alice total wrong: \" + totals.get(\"Alice\");\nassert Math.abs(totals.get(\"Bob\") - 999.0) \u003c 0.01 : \"Bob total wrong: \" + totals.get(\"Bob\");\nvar empty = totalPerCustomer(List.of());\nassert empty.isEmpty() : \"empty orders should be empty map\";\n","category":"syntax_completion"} {"id":"7","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\n\npublic class SCTask7 {\n\n public static \u003cT extends Comparable\u003c? super T\u003e\u003e List\u003cT\u003e mergeSorted(\n List\u003c? extends T\u003e a, List\u003c? extends T\u003e b,\n Comparator\u003c? super T\u003e fallback) {\n List\u003cT\u003e result = new ArrayList\u003c\u003e();\n int i = 0, j = 0;\n while (i \u003c a.size() \u0026\u0026 j \u003c b.size()) {\n T ai = a.get(i), bj = b.get(j);\n int cmp = fallback != null ? fallback.compare(ai, bj) :\n","golden_completion":" ai.compareTo(bj);\n if (cmp \u003c= 0) {\n result.add(ai);\n i++;\n } else {\n result.add(bj);\n j++;\n }\n }\n while (i \u003c a.size()) result.add(a.get(i++));\n while (j \u003c b.size()) result.add(b.get(j++));\n return result;\n","suffix":" }\n\n public static void main(String[] args) {\n var a = List.of(1, 3, 5, 7);\n var b = List.of(2, 4, 6, 8);\n var merged = mergeSorted(a, b, null);\n System.out.println(merged);\n\n var sa = List.of(\"banana\", \"cherry\");\n var sb = List.of(\"apple\", \"date\");\n var smerged = mergeSorted(sa, sb, Comparator.reverseOrder());\n System.out.println(smerged);\n }\n}\n","assertions":"var merged = mergeSorted(List.of(1, 3, 5), List.of(2, 4, 6), null);\nassert merged.equals(List.of(1, 2, 3, 4, 5, 6)) : \"int merge failed: \" + merged;\nvar merged2 = mergeSorted(List.of(10), List.of(), null);\nassert merged2.equals(List.of(10)) : \"single elem failed: \" + merged2;\nvar merged3 = mergeSorted(List.of(), List.of(1, 2), null);\nassert merged3.equals(List.of(1, 2)) : \"empty first failed: \" + merged3;\nvar rev = mergeSorted(List.of(\"c\", \"b\"), List.of(\"d\", \"a\"), Comparator.reverseOrder());\nassert rev.equals(List.of(\"d\", \"c\", \"b\", \"a\")) : \"reverse merge failed: \" + rev;\nvar natStr = mergeSorted(List.of(\"apple\", \"cherry\"), List.of(\"banana\", \"date\"), null);\nassert natStr.equals(List.of(\"apple\", \"banana\", \"cherry\", \"date\")) : \"natural string merge failed: \" + natStr;\n","category":"syntax_completion"} {"id":"8","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\n\npublic class SCTask8 {\n\n static abstract class Builder\u003cT, B extends Builder\u003cT, B\u003e\u003e {\n protected final List\u003cUnaryOperator\u003cT\u003e\u003e transforms = new ArrayList\u003c\u003e();\n\n @SuppressWarnings(\"unchecked\")\n protected B self() { return (B) this; }\n\n public B addTransform(UnaryOperator\u003cT\u003e op) {\n transforms.add(op);\n return self();\n }\n\n public T applyAll(T initial) {\n T result = initial;\n for (var op : transforms) {\n result = op.apply(result);\n }\n return result;\n }\n }\n\n static class StringPipeline extends Builder\u003cString, StringPipeline\u003e {\n public StringPipeline trim() { return addTransform(String::trim); }\n public StringPipeline upper() { return addTransform(String::toUpperCase); }\n public StringPipeline prefix(String p) {\n return addTransform(s -\u003e\n","golden_completion":" p + s);\n }\n public StringPipeline replace(String target, String replacement) {\n return addTransform(s -\u003e s.replace(target, replacement));\n }\n public StringPipeline suffix(String sfx) {\n return addTransform(s -\u003e s + sfx);\n }\n","suffix":" }\n\n static class IntPipeline extends Builder\u003cInteger, IntPipeline\u003e {\n public IntPipeline add(int n) { return addTransform(x -\u003e x + n); }\n public IntPipeline mul(int n) { return addTransform(x -\u003e x * n); }\n public IntPipeline clamp(int lo, int hi) {\n return addTransform(x -\u003e Math.max(lo, Math.min(hi, x)));\n }\n }\n\n public static void main(String[] args) {\n String s = new StringPipeline()\n .trim().upper().prefix(\"\u003e\u003e\").replace(\"HELLO\", \"HI\")\n .suffix(\"\u003c\u003c\").applyAll(\" hello world \");\n System.out.println(s);\n }\n}\n","assertions":"String s1 = new StringPipeline().trim().upper().prefix(\"\u003e\u003e\").replace(\"HELLO\", \"HI\").suffix(\"\u003c\u003c\").applyAll(\" hello world \");\nassert s1.equals(\"\u003e\u003eHI WORLD\u003c\u003c\") : \"string pipeline failed: \" + s1;\nString s2 = new StringPipeline().trim().applyAll(\" abc \");\nassert s2.equals(\"abc\") : \"trim only failed: \" + s2;\nString s3 = new StringPipeline().upper().prefix(\"[\").suffix(\"]\").applyAll(\"test\");\nassert s3.equals(\"[TEST]\") : \"upper+prefix+suffix failed: \" + s3;\nString s4 = new StringPipeline().replace(\"a\", \"b\").applyAll(\"aaa\");\nassert s4.equals(\"bbb\") : \"replace failed: \" + s4;\n","category":"syntax_completion"} {"id":"9","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask9 {\n static List\u003cString\u003e log = new ArrayList\u003c\u003e();\n\n static class Resource implements AutoCloseable {\n final String name;\n boolean open;\n Resource(String name) { this.name = name; this.open = true; log.add(\"open:\" + name); }\n public String read() { return open ? \"data-\" + name : \"closed\"; }\n @Override public void close() { open = false; log.add(\"close:\" + name); }\n }\n\n public static String process() {\n try (var r1 = new Resource(\"A\");\n","golden_completion":" var r2 = new Resource(\"B\");\n var r3 = new Resource(\"C\")) {\n return r1.read() + \",\" + r2.read() + \",\" + r3.read();\n } catch (Exception e) {\n return \"error:\" + e.getMessage();\n }\n","suffix":" }\n\n public static void main(String[] args) {\n log.clear();\n String result = process();\n System.out.println(result);\n System.out.println(log);\n }\n}\n","assertions":"log.clear();\nString result = process();\nassert result.equals(\"data-A,data-B,data-C\") : \"result wrong: \" + result;\nassert log.size() == 6 : \"expected 6 log entries: \" + log;\nassert log.get(0).equals(\"open:A\") : \"first open wrong\";\nassert log.get(1).equals(\"open:B\") : \"second open wrong\";\nassert log.get(2).equals(\"open:C\") : \"third open wrong\";\nassert log.get(3).equals(\"close:C\") : \"first close wrong (should be reverse order)\";\nassert log.get(4).equals(\"close:B\") : \"second close wrong\";\nassert log.get(5).equals(\"close:A\") : \"third close wrong\";\n","category":"syntax_completion"} {"id":"10","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask10 {\n static class FlakyResource implements AutoCloseable {\n final String name;\n final boolean failOnClose;\n FlakyResource(String name, boolean failOnClose) {\n this.name = name;\n this.failOnClose = failOnClose;\n }\n public String use() { return \"used:\" + name; }\n @Override\n public void close() throws Exception {\n if (failOnClose) throw new RuntimeException(\"close-fail:\" + name);\n }\n }\n\n public static Map\u003cString, Object\u003e runWithResources(boolean failBody, boolean failClose1, boolean failClose2) {\n Map\u003cString, Object\u003e info = new LinkedHashMap\u003c\u003e();\n try (var r1 = new FlakyResource(\"R1\", failClose1);\n var r2 = new FlakyResource(\"R2\", failClose2)) {\n info.put(\"used\", r1.use() + \",\" + r2.use());\n if (failBody) throw new RuntimeException(\"body-fail\");\n","golden_completion":" info.put(\"status\", \"ok\");\n } catch (Exception e) {\n info.put(\"status\", \"error\");\n info.put(\"message\", e.getMessage());\n Throwable[] suppressed = e.getSuppressed();\n if (suppressed.length \u003e 0) {\n List\u003cString\u003e msgs = new ArrayList\u003c\u003e();\n for (var s : suppressed) msgs.add(s.getMessage());\n info.put(\"suppressed\", msgs);\n }\n }\n return info;\n","suffix":" }\n\n public static void main(String[] args) {\n System.out.println(runWithResources(false, false, false));\n System.out.println(runWithResources(true, false, false));\n System.out.println(runWithResources(true, true, true));\n }\n}\n","assertions":"var ok = runWithResources(false, false, false);\nassert ok.get(\"status\").equals(\"ok\") : \"ok case failed: \" + ok;\nassert !ok.containsKey(\"message\") : \"ok should have no message\";\nvar bodyFail = runWithResources(true, false, false);\nassert bodyFail.get(\"status\").equals(\"error\") : \"body fail status wrong\";\nassert bodyFail.get(\"message\").equals(\"body-fail\") : \"body fail msg wrong: \" + bodyFail.get(\"message\");\nvar bothFail = runWithResources(true, true, true);\nassert bothFail.get(\"status\").equals(\"error\") : \"both fail status wrong\";\nassert bothFail.get(\"message\").equals(\"body-fail\") : \"primary exception wrong\";\n@SuppressWarnings(\"unchecked\")\nList\u003cString\u003e suppressed = (List\u003cString\u003e) bothFail.get(\"suppressed\");\nassert suppressed != null : \"suppressed should not be null\";\nassert suppressed.size() == 2 : \"expected 2 suppressed: \" + suppressed;\nassert suppressed.contains(\"close-fail:R1\") : \"missing R1 suppressed\";\nassert suppressed.contains(\"close-fail:R2\") : \"missing R2 suppressed\";\n","category":"syntax_completion"} {"id":"11","testsource":"devbench-syntax-completion","language":"java","prefix":"public class SCTask11 {\n sealed interface Vehicle permits Car, Truck, Motorcycle {}\n record Car(int seats) implements Vehicle {}\n record Truck(double tons) implements Vehicle {}\n record Motorcycle(boolean hasSidecar) implements Vehicle {}\n\n public static String describe(Vehicle v) {\n return switch (v) {\n","golden_completion":" case Car(var s) when s \u003e 4 -\u003e \"large car with \" + s + \" seats\";\n case Car(var s) -\u003e \"car with \" + s + \" seats\";\n case Truck(var t) when t \u003e 5.0 -\u003e \"heavy truck\";\n case Truck(var t) -\u003e \"light truck\";\n case Motorcycle(var sc) when sc -\u003e \"motorcycle with sidecar\";\n case Motorcycle m -\u003e \"motorcycle\";\n };\n }\n","suffix":"\n public static void main(String[] args) {\n String r1 = describe(new Car(2));\n String r2 = describe(new Car(6));\n String r3 = describe(new Truck(3.0));\n String r4 = describe(new Truck(10.0));\n String r5 = describe(new Motorcycle(true));\n String r6 = describe(new Motorcycle(false));\n System.out.println(r1 + \"|\" + r2 + \"|\" + r3 + \"|\" + r4 + \"|\" + r5 + \"|\" + r6);\n }\n}\n","assertions":"assert SCTask11.describe(new SCTask11.Car(2)).equals(\"car with 2 seats\") : \"car2\";\nassert SCTask11.describe(new SCTask11.Car(6)).equals(\"large car with 6 seats\") : \"car6\";\nassert SCTask11.describe(new SCTask11.Truck(3.0)).equals(\"light truck\") : \"truck3\";\nassert SCTask11.describe(new SCTask11.Truck(10.0)).equals(\"heavy truck\") : \"truck10\";\nassert SCTask11.describe(new SCTask11.Motorcycle(true)).equals(\"motorcycle with sidecar\") : \"msc\";\nassert SCTask11.describe(new SCTask11.Motorcycle(false)).equals(\"motorcycle\") : \"m\";\n","category":"syntax_completion"} {"id":"12","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask12 {\n public static int scoreBand(int score) {\n return switch (score / 10) {\n case 10, 9 -\u003e 4;\n case 8 -\u003e 3;\n case 7 -\u003e {\n if (score \u003e= 75) yield 3;\n else yield 2;\n }\n case 6 -\u003e {\n","golden_completion":" if (score \u003e= 65) yield 2;\n else yield 1;\n }\n default -\u003e {\n if (score \u003c 0) throw new IllegalArgumentException(\"negative\");\n yield 0;\n }\n };\n }\n","suffix":"\n public static void main(String[] args) {\n System.out.println(scoreBand(95) + \",\" + scoreBand(80) + \",\" + scoreBand(76));\n }\n}\n","assertions":"assert SCTask12.scoreBand(100) == 4 : \"100\";\nassert SCTask12.scoreBand(95) == 4 : \"95\";\nassert SCTask12.scoreBand(80) == 3 : \"80\";\nassert SCTask12.scoreBand(76) == 3 : \"76\";\nassert SCTask12.scoreBand(72) == 2 : \"72\";\nassert SCTask12.scoreBand(65) == 2 : \"65\";\nassert SCTask12.scoreBand(61) == 1 : \"61\";\nassert SCTask12.scoreBand(50) == 0 : \"50\";\nassert SCTask12.scoreBand(0) == 0 : \"0\";\ntry { SCTask12.scoreBand(-1); assert false : \"neg\"; } catch (IllegalArgumentException e) {}\n","category":"syntax_completion"} {"id":"13","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask13 {\n public static String summarize(List\u003cInteger\u003e nums) {\n return nums.stream().collect(Collectors.teeing(\n","golden_completion":" Collectors.summingInt(Integer::intValue),\n Collectors.counting(),\n (sum, count) -\u003e \"sum=\" + sum + \",count=\" + count\n ));\n }\n","suffix":"\n public static void main(String[] args) {\n System.out.println(summarize(List.of(1, 2, 3, 4, 5)));\n }\n}\n","assertions":"assert SCTask13.summarize(List.of(1, 2, 3, 4, 5)).equals(\"sum=15,count=5\") : \"basic\";\nassert SCTask13.summarize(List.of(10)).equals(\"sum=10,count=1\") : \"single\";\nassert SCTask13.summarize(List.of()).equals(\"sum=0,count=0\") : \"empty\";\nassert SCTask13.summarize(List.of(-3, 3)).equals(\"sum=0,count=2\") : \"zero_sum\";\n","category":"syntax_completion"} {"id":"14","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask14 {\n record TaggedItem(String item, List\u003cString\u003e tags) {}\n\n public static Map\u003cString, List\u003cString\u003e\u003e tagIndex(List\u003cTaggedItem\u003e items) {\n return items.stream()\n .flatMap(ti -\u003e ti.tags().stream().map(tag -\u003e Map.entry(tag, ti.item())))\n .collect(Collectors.groupingBy(\n","golden_completion":" Map.Entry::getKey,\n Collectors.collectingAndThen(\n Collectors.mapping(Map.Entry::getValue, Collectors.toList()),\n lst -\u003e { Collections.sort(lst); return lst; }\n )\n ));\n }\n","suffix":"\n public static void main(String[] args) {\n var items = List.of(\n new TaggedItem(\"banana\", List.of(\"fruit\", \"yellow\")),\n new TaggedItem(\"apple\", List.of(\"fruit\", \"red\")),\n new TaggedItem(\"carrot\", List.of(\"vegetable\", \"orange\"))\n );\n var idx = tagIndex(items);\n System.out.println(idx);\n }\n}\n","assertions":"var items = List.of(\n new SCTask14.TaggedItem(\"banana\", List.of(\"fruit\", \"yellow\")),\n new SCTask14.TaggedItem(\"apple\", List.of(\"fruit\", \"red\")),\n new SCTask14.TaggedItem(\"carrot\", List.of(\"vegetable\", \"orange\"))\n);\nvar idx = SCTask14.tagIndex(items);\nassert idx.get(\"fruit\").equals(List.of(\"apple\", \"banana\")) : \"fruit=\" + idx.get(\"fruit\");\nassert idx.get(\"yellow\").equals(List.of(\"banana\")) : \"yellow\";\nassert idx.get(\"red\").equals(List.of(\"apple\")) : \"red\";\nassert idx.get(\"vegetable\").equals(List.of(\"carrot\")) : \"veg\";\nassert idx.get(\"orange\").equals(List.of(\"carrot\")) : \"orange\";\nassert idx.size() == 5 : \"size=\" + idx.size();\n","category":"syntax_completion"} {"id":"15","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask15 {\n record Employee(String name, String dept, int salary) {}\n\n public static Map\u003cString, String\u003e topEarnerPerDept(List\u003cEmployee\u003e emps) {\n return emps.stream().collect(Collectors.groupingBy(\n Employee::dept,\n Collectors.collectingAndThen(\n Collectors.maxBy(Comparator.comparingInt(Employee::salary)),\n","golden_completion":" opt -\u003e opt.map(Employee::name).orElse(\"none\")\n )\n ));\n }\n","suffix":"\n public static void main(String[] args) {\n var emps = List.of(\n new Employee(\"Alice\", \"eng\", 120),\n new Employee(\"Bob\", \"eng\", 150),\n new Employee(\"Carol\", \"sales\", 110),\n new Employee(\"Dave\", \"sales\", 130)\n );\n System.out.println(topEarnerPerDept(emps));\n }\n}\n","assertions":"var emps = List.of(\n new SCTask15.Employee(\"Alice\", \"eng\", 120),\n new SCTask15.Employee(\"Bob\", \"eng\", 150),\n new SCTask15.Employee(\"Carol\", \"sales\", 110),\n new SCTask15.Employee(\"Dave\", \"sales\", 130)\n);\nvar result = SCTask15.topEarnerPerDept(emps);\nassert result.get(\"eng\").equals(\"Bob\") : \"eng=\" + result.get(\"eng\");\nassert result.get(\"sales\").equals(\"Dave\") : \"sales=\" + result.get(\"sales\");\nassert result.size() == 2 : \"size=\" + result.size();\n","category":"syntax_completion"} {"id":"16","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask16 {\n record Range(int lo, int hi) {\n Range {\n","golden_completion":" if (lo \u003e hi) throw new IllegalArgumentException(\"lo \u003e hi: \" + lo + \" \u003e \" + hi);\n if (lo \u003c 0) { lo = 0; }\n if (hi \u003e 100) { hi = 100; }\n }\n\n int span() { return hi - lo; }\n\n boolean contains(int v) { return v \u003e= lo \u0026\u0026 v \u003c= hi; }\n }\n","suffix":"\n public static void main(String[] args) {\n Range r1 = new Range(10, 20);\n Range r2 = new Range(-5, 200);\n System.out.println(r1.span() + \",\" + r2.lo() + \",\" + r2.hi());\n }\n}\n","assertions":"var r1 = new SCTask16.Range(10, 20);\nassert r1.lo() == 10 \u0026\u0026 r1.hi() == 20 : \"r1\";\nassert r1.span() == 10 : \"span1\";\nassert r1.contains(15) : \"contains15\";\nassert !r1.contains(5) : \"not5\";\n\nvar r2 = new SCTask16.Range(-5, 200);\nassert r2.lo() == 0 : \"clamped_lo=\" + r2.lo();\nassert r2.hi() == 100 : \"clamped_hi=\" + r2.hi();\nassert r2.span() == 100 : \"span2=\" + r2.span();\n\ntry { new SCTask16.Range(50, 10); assert false : \"should throw\"; } catch (IllegalArgumentException e) {}\n","category":"syntax_completion"} {"id":"17","testsource":"devbench-syntax-completion","language":"java","prefix":"public class SCTask17 {\n sealed interface Expr permits Num, Add, Mul, Neg {}\n record Num(double val) implements Expr {}\n record Add(Expr left, Expr right) implements Expr {}\n record Mul(Expr left, Expr right) implements Expr {}\n record Neg(Expr inner) implements Expr {}\n\n public static double eval(Expr e) {\n return switch (e) {\n case Num(var v) -\u003e v;\n case Add(var l, var r) -\u003e eval(l) + eval(r);\n case Mul(var l, var r) -\u003e eval(l) * eval(r);\n case Neg(var inner) -\u003e\n","golden_completion":" -eval(inner);\n };\n }\n\n public static String prettyPrint(Expr e) {\n return switch (e) {\n case Num(var v) -\u003e String.valueOf(v);\n case Add(var l, var r) -\u003e \"(\" + prettyPrint(l) + \"+\" + prettyPrint(r) + \")\";\n case Mul(var l, var r) -\u003e \"(\" + prettyPrint(l) + \"*\" + prettyPrint(r) + \")\";\n case Neg(var inner) -\u003e \"(-\" + prettyPrint(inner) + \")\";\n };\n }\n","suffix":"\n public static void main(String[] args) {\n Expr e = new Add(new Mul(new Num(2), new Num(3)), new Neg(new Num(1)));\n System.out.println(eval(e) + \" -\u003e \" + prettyPrint(e));\n }\n}\n","assertions":"var e1 = new SCTask17.Add(new SCTask17.Mul(new SCTask17.Num(2), new SCTask17.Num(3)), new SCTask17.Neg(new SCTask17.Num(1)));\nassert SCTask17.eval(e1) == 5.0 : \"eval1=\" + SCTask17.eval(e1);\nassert SCTask17.prettyPrint(e1).equals(\"((2.0*3.0)+(-1.0))\") : \"pp1=\" + SCTask17.prettyPrint(e1);\n\nvar e2 = new SCTask17.Neg(new SCTask17.Neg(new SCTask17.Num(7)));\nassert SCTask17.eval(e2) == 7.0 : \"eval2\";\nassert SCTask17.prettyPrint(e2).equals(\"(-(-7.0))\") : \"pp2=\" + SCTask17.prettyPrint(e2);\n\nvar e3 = new SCTask17.Num(42);\nassert SCTask17.eval(e3) == 42.0 : \"eval3\";\nassert SCTask17.prettyPrint(e3).equals(\"42.0\") : \"pp3\";\n","category":"syntax_completion"} {"id":"18","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask18 {\n record Student(String name, int grade, double gpa) {}\n\n public static List\u003cString\u003e rank(List\u003cStudent\u003e students) {\n return students.stream()\n .sorted(\n","golden_completion":" Comparator.comparingInt(Student::grade)\n .thenComparing(Comparator.comparingDouble(Student::gpa).reversed())\n .thenComparing(Student::name)\n )\n .map(Student::name)\n .collect(Collectors.toList());\n }\n","suffix":"\n public static void main(String[] args) {\n var students = List.of(\n new Student(\"Zara\", 10, 3.8),\n new Student(\"Amy\", 10, 3.9),\n new Student(\"Bob\", 10, 3.8),\n new Student(\"Cal\", 11, 3.5)\n );\n System.out.println(rank(students));\n }\n}\n","assertions":"var students = List.of(\n new SCTask18.Student(\"Zara\", 10, 3.8),\n new SCTask18.Student(\"Amy\", 10, 3.9),\n new SCTask18.Student(\"Bob\", 10, 3.8),\n new SCTask18.Student(\"Cal\", 11, 3.5)\n);\nvar ranked = SCTask18.rank(students);\nassert ranked.equals(List.of(\"Amy\", \"Bob\", \"Zara\", \"Cal\")) : \"ranked=\" + ranked;\n\nvar students2 = List.of(\n new SCTask18.Student(\"X\", 9, 4.0),\n new SCTask18.Student(\"Y\", 9, 4.0)\n);\nvar ranked2 = SCTask18.rank(students2);\nassert ranked2.equals(List.of(\"X\", \"Y\")) : \"ranked2=\" + ranked2;\n","category":"syntax_completion"} {"id":"19","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.function.*;\n\npublic class SCTask19 {\n public static Function\u003cString, String\u003e buildPipeline() {\n Function\u003cString, String\u003e trim = String::trim;\n Function\u003cString, String\u003e upper = String::toUpperCase;\n Function\u003cString, String\u003e addBrackets = s -\u003e \"[\" + s + \"]\";\n Function\u003cString, String\u003e replaceSpaces = s -\u003e s.replace(\" \", \"_\");\n\n return trim\n .andThen(upper)\n .andThen(\n","golden_completion":" replaceSpaces\n )\n .andThen(addBrackets);\n }\n\n public static Function\u003cInteger, String\u003e numberPipeline() {\n Function\u003cInteger, Double\u003e half = n -\u003e n / 2.0;\n Function\u003cDouble, String\u003e fmt = d -\u003e String.format(\"%.1f\", d);\n return half.andThen(fmt);\n }\n","suffix":"\n public static void main(String[] args) {\n var pipe = buildPipeline();\n System.out.println(pipe.apply(\" hello world \"));\n System.out.println(numberPipeline().apply(7));\n }\n}\n","assertions":"assert SCTask19.buildPipeline().apply(\" hello world \").equals(\"[HELLO_WORLD]\") : \"pipe1\";\nassert SCTask19.buildPipeline().apply(\"abc\").equals(\"[ABC]\") : \"pipe2\";\nassert SCTask19.buildPipeline().apply(\" a b c \").equals(\"[A_B_C]\") : \"pipe3\";\nassert SCTask19.numberPipeline().apply(7).equals(\"3.5\") : \"num7\";\nassert SCTask19.numberPipeline().apply(10).equals(\"5.0\") : \"num10\";\nassert SCTask19.numberPipeline().apply(0).equals(\"0.0\") : \"num0\";\n","category":"syntax_completion"} {"id":"20","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\nimport java.util.stream.*;\n\npublic class SCTask20 {\n public static \u003cT, U, R\u003e List\u003cR\u003e zipWith(\n List\u003cT\u003e a, List\u003cU\u003e b,\n BiFunction\u003c? super T, ? super U, ? extends R\u003e combiner) {\n return IntStream.range(0, Math.min(a.size(), b.size()))\n .mapToObj(i -\u003e\n","golden_completion":" combiner.apply(a.get(i), b.get(i))\n )\n .collect(Collectors.toList());\n }\n\n public static \u003cT\u003e List\u003cT\u003e interleave(List\u003cT\u003e a, List\u003cT\u003e b) {\n return IntStream.range(0, Math.min(a.size(), b.size()))\n .boxed()\n .flatMap(i -\u003e Stream.of(a.get(i), b.get(i)))\n .collect(Collectors.toList());\n }\n","suffix":"\n public static void main(String[] args) {\n var sums = zipWith(List.of(1, 2, 3), List.of(10, 20, 30), Integer::sum);\n System.out.println(sums);\n var inter = interleave(List.of(\"a\", \"b\", \"c\"), List.of(\"x\", \"y\", \"z\"));\n System.out.println(inter);\n }\n}\n","assertions":"var sums = SCTask20.zipWith(List.of(1, 2, 3), List.of(10, 20, 30), Integer::sum);\nassert sums.equals(List.of(11, 22, 33)) : \"sums=\" + sums;\n\nvar concat = SCTask20.zipWith(List.of(\"a\", \"b\"), List.of(\"x\", \"y\"), (s1, s2) -\u003e s1 + s2);\nassert concat.equals(List.of(\"ax\", \"by\")) : \"concat=\" + concat;\n\nvar shorter = SCTask20.zipWith(List.of(1, 2, 3), List.of(10, 20), Integer::sum);\nassert shorter.equals(List.of(11, 22)) : \"shorter=\" + shorter;\n\nvar inter = SCTask20.interleave(List.of(\"a\", \"b\", \"c\"), List.of(\"x\", \"y\", \"z\"));\nassert inter.equals(List.of(\"a\", \"x\", \"b\", \"y\", \"c\", \"z\")) : \"inter=\" + inter;\n\nvar interShort = SCTask20.interleave(List.of(1, 2), List.of(3, 4, 5));\nassert interShort.equals(List.of(1, 3, 2, 4)) : \"interShort=\" + interShort;\n","category":"syntax_completion"} {"id":"21","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask21 {\n static List\u003cString\u003e log = new ArrayList\u003c\u003e();\n\n static class Resource implements AutoCloseable {\n final String name;\n Resource(String name) { this.name = name; log.add(\"open:\" + name); }\n public void close() { log.add(\"close:\" + name); }\n }\n\n public static List\u003cString\u003e operate() {\n log.clear();\n try (Resource a = new Resource(\"A\");\n Resource b = new Resource(\"B\")) {\n try (Resource c = new Resource(\"C\")) {\n log.add(\"use:\" + a.name + b.name + c.name);\n","golden_completion":" }\n log.add(\"after-inner\");\n }\n return new ArrayList\u003c\u003e(log);\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e result = operate();\n System.out.println(result);\n }\n}\n","assertions":"assert operate().equals(java.util.List.of(\"open:A\",\"open:B\",\"open:C\",\"use:ABC\",\"close:C\",\"after-inner\",\"close:B\",\"close:A\")) : \"Wrong log: \" + operate();\n","category":"syntax_completion"} {"id":"22","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask22 {\n static class FailClose implements AutoCloseable {\n final String name;\n final boolean failOnClose;\n FailClose(String name, boolean failOnClose) {\n this.name = name;\n this.failOnClose = failOnClose;\n }\n public void close() throws Exception {\n if (failOnClose) throw new RuntimeException(\"close-fail:\" + name);\n }\n }\n\n public static String testSuppressed() {\n try {\n try (FailClose a = new FailClose(\"A\", true);\n FailClose b = new FailClose(\"B\", true)) {\n throw new IllegalStateException(\"body-fail\");\n","golden_completion":" }\n } catch (Exception e) {\n Throwable[] suppressed = e.getSuppressed();\n return e.getMessage() + \";\" + suppressed.length + \";\"\n + suppressed[0].getMessage() + \";\" + suppressed[1].getMessage();\n }\n }\n","suffix":"\n public static void main(String[] args) {\n System.out.println(testSuppressed());\n }\n}\n","assertions":"String r = testSuppressed();\nassert r.equals(\"body-fail;2;close-fail:B;close-fail:A\") : \"Wrong: \" + r;\n","category":"syntax_completion"} {"id":"23","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask23 {\n static class LineSource implements AutoCloseable {\n final String id;\n final List\u003cString\u003e lines;\n boolean closed = false;\n LineSource(String id, String... lines) { this.id = id; this.lines = List.of(lines); }\n public Stream\u003cString\u003e stream() { return lines.stream().map(l -\u003e id + \":\" + l); }\n public void close() { closed = true; }\n }\n\n public static List\u003cString\u003e mergeAndClose(List\u003cLineSource\u003e sources) {\n return sources.stream()\n .flatMap(src -\u003e {\n try (LineSource s = src) {\n return s.stream()\n","golden_completion":" .filter(line -\u003e !line.endsWith(\":skip\"))\n .collect(Collectors.toList()).stream();\n }\n })\n .sorted()\n .collect(Collectors.toList());\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cLineSource\u003e sources = List.of(\n new LineSource(\"X\", \"hello\", \"skip\", \"world\"),\n new LineSource(\"Y\", \"alpha\", \"skip\", \"beta\")\n );\n List\u003cString\u003e result = mergeAndClose(sources);\n System.out.println(result);\n System.out.println(\"X closed: \" + sources.get(0).closed);\n System.out.println(\"Y closed: \" + sources.get(1).closed);\n }\n}\n","assertions":"List\u003cLineSource\u003e sources = List.of(\n new LineSource(\"X\", \"hello\", \"skip\", \"world\"),\n new LineSource(\"Y\", \"alpha\", \"skip\", \"beta\")\n);\nList\u003cString\u003e result = mergeAndClose(sources);\nassert result.equals(List.of(\"X:hello\",\"X:world\",\"Y:alpha\",\"Y:beta\")) : \"Wrong: \" + result;\nassert sources.get(0).closed : \"X not closed\";\nassert sources.get(1).closed : \"Y not closed\";\n","category":"syntax_completion"} {"id":"24","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask24 {\n public static Map\u003cString, Integer\u003e mergeMaps(List\u003cMap\u003cString, Integer\u003e\u003e maps) {\n return maps.stream()\n .reduce(new HashMap\u003c\u003e(), (merged, current) -\u003e {\n current.forEach((k, v) -\u003e\n merged.merge(k, v, Integer::sum)\n","golden_completion":" );\n return merged;\n }, (m1, m2) -\u003e {\n m2.forEach((k, v) -\u003e m1.merge(k, v, Integer::sum));\n return m1;\n });\n }\n","suffix":"\n public static void main(String[] args) {\n var result = mergeMaps(List.of(\n Map.of(\"a\", 1, \"b\", 2),\n Map.of(\"b\", 3, \"c\", 4),\n Map.of(\"a\", 5, \"c\", 1)\n ));\n System.out.println(result);\n }\n}\n","assertions":"var result = mergeMaps(List.of(\n Map.of(\"a\", 1, \"b\", 2),\n Map.of(\"b\", 3, \"c\", 4),\n Map.of(\"a\", 5, \"c\", 1)\n));\nassert result.get(\"a\") == 6 : \"a=\" + result.get(\"a\");\nassert result.get(\"b\") == 5 : \"b=\" + result.get(\"b\");\nassert result.get(\"c\") == 5 : \"c=\" + result.get(\"c\");\n","category":"syntax_completion"} {"id":"25","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask25 {\n record Student(String name, String grade, int score) {}\n\n public static Map\u003cString, String\u003e topStudentPerGrade(List\u003cStudent\u003e students) {\n return students.stream()\n .collect(Collectors.groupingBy(\n Student::grade,\n Collectors.collectingAndThen(\n Collectors.maxBy(Comparator.comparingInt(Student::score)),\n opt -\u003e opt.map(s -\u003e s.name() + \":\" + s.score()\n","golden_completion":" ).orElse(\"none\")\n )\n ));\n }\n","suffix":"\n public static void main(String[] args) {\n var result = topStudentPerGrade(List.of(\n new Student(\"Alice\", \"A\", 95),\n new Student(\"Bob\", \"A\", 88),\n new Student(\"Carol\", \"B\", 92),\n new Student(\"Dave\", \"B\", 97)\n ));\n System.out.println(result);\n }\n}\n","assertions":"var result = topStudentPerGrade(List.of(\n new Student(\"Alice\", \"A\", 95),\n new Student(\"Bob\", \"A\", 88),\n new Student(\"Carol\", \"B\", 92),\n new Student(\"Dave\", \"B\", 97)\n));\nassert result.get(\"A\").equals(\"Alice:95\") : \"A=\" + result.get(\"A\");\nassert result.get(\"B\").equals(\"Dave:97\") : \"B=\" + result.get(\"B\");\n","category":"syntax_completion"} {"id":"26","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask26 {\n record Stats(double mean, double median, int count) {}\n\n public static Stats computeStats(List\u003cInteger\u003e nums) {\n return nums.stream()\n .collect(Collectors.teeing(\n Collectors.teeing(\n Collectors.summingDouble(x -\u003e (double) x),\n Collectors.counting(),\n (sum, cnt) -\u003e cnt == 0 ? 0.0 : sum / cnt\n ),\n Collectors.collectingAndThen(\n Collectors.toList(),\n list -\u003e {\n Collections.sort(list);\n int n = list.size();\n if (n == 0) return 0.0;\n return n % 2 == 1\n ? list.get(n / 2).doubleValue()\n : (list.get(n / 2 - 1) + list.get(n / 2)\n","golden_completion":" ) / 2.0;\n }\n ),\n (mean, median) -\u003e new Stats(mean, median, nums.size())\n ));\n }\n","suffix":"\n public static void main(String[] args) {\n Stats s1 = computeStats(List.of(1, 2, 3, 4, 5));\n System.out.println(s1);\n Stats s2 = computeStats(List.of(10, 20, 30, 40));\n System.out.println(s2);\n }\n}\n","assertions":"Stats s1 = computeStats(List.of(1, 2, 3, 4, 5));\nassert s1.mean() == 3.0 : \"mean1=\" + s1.mean();\nassert s1.median() == 3.0 : \"median1=\" + s1.median();\nassert s1.count() == 5 : \"count1=\" + s1.count();\nStats s2 = computeStats(List.of(10, 20, 30, 40));\nassert s2.mean() == 25.0 : \"mean2=\" + s2.mean();\nassert s2.median() == 25.0 : \"median2=\" + s2.median();\nassert s2.count() == 4 : \"count2=\" + s2.count();\n","category":"syntax_completion"} {"id":"27","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask27 {\n public static \u003cT extends Comparable\u003c? super T\u003e\u003e List\u003cT\u003e clampedSort(\n List\u003cT\u003e items, T lower, T upper) {\n return items.stream()\n .filter(x -\u003e x.compareTo(lower) \u003e= 0 \u0026\u0026 x.compareTo(upper\n","golden_completion":" ) \u003c= 0)\n .sorted()\n .collect(java.util.stream.Collectors.toList());\n }\n","suffix":"\n public static void main(String[] args) {\n var result = clampedSort(List.of(5, 1, 8, 3, 10, 2), 2, 8);\n System.out.println(result);\n }\n}\n","assertions":"var r1 = clampedSort(List.of(5, 1, 8, 3, 10, 2), 2, 8);\nassert r1.equals(List.of(2, 3, 5, 8)) : \"r1=\" + r1;\nvar r2 = clampedSort(List.of(\"dog\",\"ant\",\"cat\",\"eel\",\"bat\"), \"bat\", \"dog\");\nassert r2.equals(List.of(\"bat\",\"cat\",\"dog\")) : \"r2=\" + r2;\n","category":"syntax_completion"} {"id":"28","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\n\npublic class SCTask28 {\n public static \u003cT extends Comparable\u003c? super T\u003e\u003e T findSecond(\n List\u003c? extends T\u003e items, Predicate\u003c? super T\u003e filter) {\n return items.stream()\n .filter(filter)\n .sorted(Comparator.\u003cT\u003enaturalOrder().reversed()\n","golden_completion":" )\n .skip(1)\n .findFirst()\n .orElseThrow(() -\u003e new NoSuchElementException(\n \"Need at least 2 matching elements\"));\n }\n","suffix":"\n public static void main(String[] args) {\n int second = findSecond(List.of(3, 7, 1, 9, 4, 6), x -\u003e x \u003e 2);\n System.out.println(\"Second largest (\u003e2): \" + second);\n }\n}\n","assertions":"int r1 = findSecond(List.of(3, 7, 1, 9, 4, 6), x -\u003e x \u003e 2);\nassert r1 == 7 : \"r1=\" + r1;\nint r2 = findSecond(List.of(10, 20, 30), x -\u003e true);\nassert r2 == 20 : \"r2=\" + r2;\nString r3 = findSecond(List.of(\"alpha\",\"beta\",\"gamma\",\"delta\"), s -\u003e s.length() \u003c= 5);\nassert r3.equals(\"delta\") : \"r3=\" + r3;\nboolean threw = false;\ntry { findSecond(List.of(1, 2, 3), x -\u003e x \u003e 10); } catch (NoSuchElementException e) { threw = true; }\nassert threw : \"Should throw on \u003c2 matches\";\n","category":"syntax_completion"} {"id":"29","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask29 {\n sealed interface Expr permits Num, Add, Mul, Neg {}\n record Num(int value) implements Expr {}\n record Add(Expr left, Expr right) implements Expr {}\n record Mul(Expr left, Expr right) implements Expr {}\n record Neg(Expr inner) implements Expr {}\n\n public static int eval(Expr e) {\n return switch (e) {\n case Num(var v) -\u003e v;\n case Add(var l, var r) -\u003e eval(l) + eval(r);\n case Mul(Num(var a), Num(var b)) when a == 0 || b == 0\n","golden_completion":" -\u003e 0;\n case Mul(var l, var r) -\u003e eval(l) * eval(r);\n case Neg(Neg(var inner)) -\u003e eval(inner);\n case Neg(var inner) -\u003e -eval(inner);\n };\n }\n","suffix":"\n public static void main(String[] args) {\n Expr e1 = new Add(new Num(3), new Mul(new Num(2), new Num(4)));\n System.out.println(\"3 + 2*4 = \" + eval(e1));\n\n Expr e2 = new Neg(new Neg(new Num(5)));\n System.out.println(\"--5 = \" + eval(e2));\n }\n}\n","assertions":"assert eval(new Num(42)) == 42 : \"Num\";\nassert eval(new Add(new Num(3), new Num(7))) == 10 : \"Add\";\nassert eval(new Mul(new Num(0), new Num(99))) == 0 : \"Mul zero shortcut\";\nassert eval(new Mul(new Num(3), new Num(4))) == 12 : \"Mul\";\nassert eval(new Neg(new Num(5))) == -5 : \"Neg\";\nassert eval(new Neg(new Neg(new Num(8)))) == 8 : \"Double neg\";\nassert eval(new Add(new Neg(new Num(3)), new Mul(new Num(2), new Num(5)))) == 7 : \"Complex\";\n","category":"syntax_completion"} {"id":"30","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask30 {\n sealed interface Shape permits Circle, Rect, Triangle {}\n record Circle(double radius) implements Shape {}\n record Rect(double w, double h) implements Shape {}\n record Triangle(double a, double b, double c) implements Shape {}\n\n sealed interface Color permits RGB, Named {}\n record RGB(int r, int g, int b) implements Color {}\n record Named(String name) implements Color {}\n\n record Painted(Shape shape, Color color) {}\n\n public static String describe(Painted p) {\n return switch (p) {\n case Painted(Circle(var r), RGB(var red, var g, var b)) when r \u003e 5 \u0026\u0026 red \u003e 200\n -\u003e \"large red circle r=\" + String.format(\"%.0f\", r);\n case Painted(Circle(var r), Named(var n))\n -\u003e n + \" circle r=\" + String.format(\"%.0f\", r);\n case Painted(Rect(var w, var h), var color) when w == h\n","golden_completion":" -\u003e \"square \" + String.format(\"%.0f\", w);\n case Painted(Rect(var w, var h), var color)\n -\u003e \"rect \" + String.format(\"%.0fx%.0f\", w, h);\n case Painted(Triangle(var a, var b, var c), var color) when a == b \u0026\u0026 b == c\n -\u003e \"equilateral t=\" + String.format(\"%.0f\", a);\n case Painted(var shape, var color) -\u003e \"other\";\n };\n }\n","suffix":"\n public static void main(String[] args) {\n System.out.println(describe(new Painted(new Circle(10), new RGB(255, 0, 0))));\n System.out.println(describe(new Painted(new Circle(3), new Named(\"blue\"))));\n System.out.println(describe(new Painted(new Rect(5, 5), new Named(\"green\"))));\n System.out.println(describe(new Painted(new Rect(4, 7), new RGB(0, 0, 0))));\n System.out.println(describe(new Painted(new Triangle(3, 3, 3), new Named(\"red\"))));\n }\n}\n","assertions":"assert describe(new Painted(new Circle(10), new RGB(255,0,0))).equals(\"large red circle r=10\") : \"t1\";\nassert describe(new Painted(new Circle(3), new Named(\"blue\"))).equals(\"blue circle r=3\") : \"t2\";\nassert describe(new Painted(new Rect(5,5), new Named(\"green\"))).equals(\"square 5\") : \"t3\";\nassert describe(new Painted(new Rect(4,7), new RGB(0,0,0))).equals(\"rect 4x7\") : \"t4\";\nassert describe(new Painted(new Triangle(3,3,3), new Named(\"red\"))).equals(\"equilateral t=3\") : \"t5\";\nassert describe(new Painted(new Circle(2), new RGB(255,0,0))).equals(\"other\") : \"t6-small-circle-red-rgb\";\nassert describe(new Painted(new Triangle(3,4,5), new Named(\"x\"))).equals(\"other\") : \"t7-scalene\";\n","category":"syntax_completion"} {"id":"31","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.lang.annotation.*;\nimport java.lang.reflect.*;\n\npublic class SCTask31 {\n\n @Retention(RetentionPolicy.RUNTIME)\n @Target(ElementType.FIELD)\n public @interface Label {\n String value();\n int order() default 0;\n }\n\n @Label(value = \"First Name\", order = 1)\n static String firstName = \"Alice\";\n\n @Label(value = \"Age\", order = 2)\n static int age = 30;\n\n public static String getLabel(String fieldName) throws NoSuchFieldException {\n Field f = SCTask31.class.getDeclaredField(fieldName);\n Label lbl = f.getAnnotation(\n","golden_completion":" Label.class\n );\n if (lbl == null) return \"no label\";\n return lbl.value() + \":\" + lbl.order();\n }\n","suffix":"\n public static void main(String[] args) throws Exception {\n String r1 = getLabel(\"firstName\");\n String r2 = getLabel(\"age\");\n System.out.println(r1);\n System.out.println(r2);\n }\n}\n","assertions":"try {\nassert SCTask31.getLabel(\"firstName\").equals(\"First Name:1\") : \"Expected First Name:1 got \" + SCTask31.getLabel(\"firstName\");\nassert SCTask31.getLabel(\"age\").equals(\"Age:2\") : \"Expected Age:2 got \" + SCTask31.getLabel(\"age\");\n} catch (NoSuchFieldException e) { throw new RuntimeException(e); }\n","category":"syntax_completion"} {"id":"32","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.lang.reflect.*;\nimport java.util.*;\n\npublic class SCTask32 {\n\n public static abstract class TypeRef\u003cT\u003e {\n private final Type type;\n protected TypeRef() {\n Type superclass = getClass().getGenericSuperclass();\n this.type = ((ParameterizedType) superclass).getActualTypeArguments()[0];\n }\n public Type getType() { return type; }\n }\n\n public static String describeType(TypeRef\u003c?\u003e ref) {\n Type t = ref.getType();\n if (t instanceof ParameterizedType pt) {\n Class\u003c?\u003e raw = (Class\u003c?\u003e) pt.getRawType();\n Type[] args = pt.getActualTypeArguments();\n StringBuilder sb = new StringBuilder(raw.getSimpleName());\n sb.append(\"\u003c\");\n for (int i = 0; i \u003c args.length; i++) {\n if (i \u003e 0) sb.append(\",\");\n sb.append(\n","golden_completion":" args[i] instanceof Class\u003c?\u003e c ? c.getSimpleName() : args[i].toString()\n );\n }\n sb.append(\"\u003e\");\n return sb.toString();\n }\n return ((Class\u003c?\u003e) t).getSimpleName();\n }\n","suffix":"\n public static void main(String[] args) {\n TypeRef\u003cList\u003cString\u003e\u003e ref1 = new TypeRef\u003c\u003e() {};\n TypeRef\u003cMap\u003cString, Integer\u003e\u003e ref2 = new TypeRef\u003c\u003e() {};\n TypeRef\u003cString\u003e ref3 = new TypeRef\u003c\u003e() {};\n System.out.println(describeType(ref1));\n System.out.println(describeType(ref2));\n System.out.println(describeType(ref3));\n }\n}\n","assertions":"TypeRef\u003cList\u003cString\u003e\u003e ref1 = new SCTask32.TypeRef\u003c\u003e() {};\nTypeRef\u003cMap\u003cString, Integer\u003e\u003e ref2 = new SCTask32.TypeRef\u003c\u003e() {};\nTypeRef\u003cString\u003e ref3 = new SCTask32.TypeRef\u003c\u003e() {};\nassert SCTask32.describeType(ref1).equals(\"List\u003cString\u003e\") : \"Got \" + SCTask32.describeType(ref1);\nassert SCTask32.describeType(ref2).equals(\"Map\u003cString,Integer\u003e\") : \"Got \" + SCTask32.describeType(ref2);\nassert SCTask32.describeType(ref3).equals(\"String\") : \"Got \" + SCTask32.describeType(ref3);\n","category":"syntax_completion"} {"id":"33","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\nimport java.util.stream.*;\n\npublic class SCTask33 {\n\n public static Function\u003cList\u003cString\u003e, List\u003cString\u003e\u003e mapFilter(\n Function\u003cString, String\u003e transform, Predicate\u003cString\u003e keep) {\n return list -\u003e list.stream()\n .map(transform)\n .filter(\n","golden_completion":" keep\n )\n .collect(Collectors.toList());\n }\n","suffix":"\n public static void main(String[] args) {\n Function\u003cList\u003cString\u003e, List\u003cString\u003e\u003e pipeline =\n mapFilter(String::toUpperCase, s -\u003e s.length() \u003e 3);\n List\u003cString\u003e result = pipeline.apply(Arrays.asList(\"hi\", \"hello\", \"world\", \"ok\"));\n System.out.println(result);\n }\n}\n","assertions":"Function\u003cList\u003cString\u003e, List\u003cString\u003e\u003e p = SCTask33.mapFilter(String::toUpperCase, s -\u003e s.length() \u003e 3);\nList\u003cString\u003e r = p.apply(java.util.Arrays.asList(\"hi\", \"hello\", \"world\", \"ok\"));\nassert r.equals(java.util.Arrays.asList(\"HELLO\", \"WORLD\")) : \"Got \" + r;\nList\u003cString\u003e r2 = p.apply(java.util.Arrays.asList(\"a\", \"ab\"));\nassert r2.isEmpty() : \"Expected empty, got \" + r2;\n","category":"syntax_completion"} {"id":"34","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask34 {\n\n public static Map.Entry\u003cLong, Double\u003e countAndAvg(List\u003cList\u003cInteger\u003e\u003e nested) {\n return nested.stream()\n .flatMap(Collection::stream)\n .filter(n -\u003e n \u003e 0)\n .collect(Collectors.teeing(\n Collectors.counting(),\n Collectors.averagingInt(Integer::intValue),\n (count, avg) -\u003e\n","golden_completion":" Map.entry(count, avg)\n ));\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cList\u003cInteger\u003e\u003e data = List.of(\n List.of(1, -2, 3),\n List.of(4, 5, -1),\n List.of(0, 6)\n );\n var result = countAndAvg(data);\n System.out.println(result.getKey() + \" \" + result.getValue());\n }\n}\n","assertions":"var r = SCTask34.countAndAvg(java.util.List.of(java.util.List.of(1,-2,3), java.util.List.of(4,5,-1), java.util.List.of(0,6)));\nassert r.getKey() == 5L : \"Expected count 5 got \" + r.getKey();\nassert Math.abs(r.getValue() - 3.8) \u003c 0.01 : \"Expected avg 3.8 got \" + r.getValue();\nvar r2 = SCTask34.countAndAvg(java.util.List.of(java.util.List.of(-1,-2)));\nassert r2.getKey() == 0L : \"Expected count 0 got \" + r2.getKey();\n","category":"syntax_completion"} {"id":"35","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\nimport java.util.stream.*;\n\npublic class SCTask35 {\n\n public static \u003cT\u003e Predicate\u003cT\u003e allOf(List\u003cPredicate\u003cT\u003e\u003e predicates) {\n return predicates.stream()\n .reduce(\n t -\u003e true,\n Predicate::and\n","golden_completion":" );\n }\n\n public static List\u003cInteger\u003e filterAll(List\u003cInteger\u003e nums, List\u003cPredicate\u003cInteger\u003e\u003e preds) {\n Predicate\u003cInteger\u003e combined = allOf(preds);\n return nums.stream().filter(combined).collect(Collectors.toList());\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cPredicate\u003cInteger\u003e\u003e preds = List.of(\n n -\u003e n \u003e 0,\n n -\u003e n % 2 == 0,\n n -\u003e n \u003c 100\n );\n List\u003cInteger\u003e result = filterAll(\n Arrays.asList(-2, 1, 4, 7, 50, 100, 200), preds);\n System.out.println(result);\n }\n}\n","assertions":"List\u003cPredicate\u003cInteger\u003e\u003e preds = java.util.List.of(n -\u003e n \u003e 0, n -\u003e n % 2 == 0, n -\u003e n \u003c 100);\nList\u003cInteger\u003e r = SCTask35.filterAll(java.util.Arrays.asList(-2, 1, 4, 7, 50, 100, 200), preds);\nassert r.equals(java.util.Arrays.asList(4, 50)) : \"Got \" + r;\nList\u003cInteger\u003e r2 = SCTask35.filterAll(java.util.Arrays.asList(2, 4), java.util.List.of());\nassert r2.equals(java.util.Arrays.asList(2, 4)) : \"allOf empty should pass all, got \" + r2;\n","category":"syntax_completion"} {"id":"36","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask36 {\n\n sealed interface Status permits Active, Suspended, Closed {}\n record Active(String user, int level) implements Status {}\n record Suspended(String reason) implements Status {}\n record Closed() implements Status {}\n\n public static Optional\u003cString\u003e describe(Status s) {\n return switch (s) {\n case Active(var u, var lv) when lv \u003e= 10 -\u003e\n","golden_completion":" Optional.of(\"power:\" + u);\n case Active(var u, var lv) -\u003e\n Optional.of(\"normal:\" + u + \":\" + lv);\n case Suspended(var r) -\u003e\n Optional.of(\"suspended:\" + r);\n case Closed() -\u003e\n Optional.empty();\n };\n }\n","suffix":"\n public static void main(String[] args) {\n System.out.println(describe(new Active(\"alice\", 15)));\n System.out.println(describe(new Active(\"bob\", 3)));\n System.out.println(describe(new Suspended(\"policy\")));\n System.out.println(describe(new Closed()));\n }\n}\n","assertions":"assert SCTask36.describe(new SCTask36.Active(\"alice\", 15)).get().equals(\"power:alice\") : \"wrong power\";\nassert SCTask36.describe(new SCTask36.Active(\"bob\", 3)).get().equals(\"normal:bob:3\") : \"wrong normal\";\nassert SCTask36.describe(new SCTask36.Suspended(\"policy\")).get().equals(\"suspended:policy\") : \"wrong suspended\";\nassert SCTask36.describe(new SCTask36.Closed()).isEmpty() : \"closed should be empty\";\n","category":"syntax_completion"} {"id":"37","testsource":"devbench-syntax-completion","language":"java","prefix":"public class SCTask37 {\n\n public static String classify(int code, boolean strict) {\n return switch (code / 100) {\n case 2 -\u003e \"ok\";\n case 4 -\u003e {\n String detail = switch (code) {\n case 400 -\u003e \"bad_request\";\n case 401 -\u003e\n","golden_completion":" \"unauthorized\";\n case 404 -\u003e \"not_found\";\n default -\u003e \"client_error\";\n };\n yield strict ? detail.toUpperCase() : detail;\n }\n case 5 -\u003e {\n yield strict ? \"SERVER_ERROR\" : \"server_error\";\n }\n default -\u003e \"unknown\";\n };\n }\n","suffix":"\n public static void main(String[] args) {\n System.out.println(classify(200, false));\n System.out.println(classify(401, true));\n System.out.println(classify(404, false));\n System.out.println(classify(500, true));\n System.out.println(classify(302, false));\n }\n}\n","assertions":"assert SCTask37.classify(200, false).equals(\"ok\") : \"200\";\nassert SCTask37.classify(401, true).equals(\"UNAUTHORIZED\") : \"401 strict got \" + SCTask37.classify(401, true);\nassert SCTask37.classify(404, false).equals(\"not_found\") : \"404\";\nassert SCTask37.classify(500, true).equals(\"SERVER_ERROR\") : \"500 strict\";\nassert SCTask37.classify(302, false).equals(\"unknown\") : \"302\";\nassert SCTask37.classify(400, true).equals(\"BAD_REQUEST\") : \"400 strict got \" + SCTask37.classify(400, true);\n","category":"syntax_completion"} {"id":"38","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask38 {\n\n public static Map.Entry\u003cString, Integer\u003e process(String op, int a, int b, List\u003cString\u003e log) {\n int result = switch (op) {\n case \"add\" -\u003e {\n log.add(\"adding \" + a + \"+\" + b);\n yield a + b;\n }\n case \"mul\" -\u003e {\n log.add(\"multiplying \" + a + \"*\" + b);\n yield a * b;\n }\n case \"maxabs\" -\u003e {\n int aa = Math.abs(a), ab = Math.abs(b);\n log.add(\"maxabs comparing \" + aa + \" vs \" + ab);\n yield Math.max(aa,\n","golden_completion":" ab);\n }\n default -\u003e {\n log.add(\"unknown op: \" + op);\n yield 0;\n }\n };\n return Map.entry(op + \"(\" + a + \",\" + b + \")\", result);\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e log = new ArrayList\u003c\u003e();\n var r1 = process(\"add\", 3, 4, log);\n var r2 = process(\"mul\", 5, 6, log);\n var r3 = process(\"maxabs\", -7, 3, log);\n var r4 = process(\"div\", 1, 2, log);\n System.out.println(r1);\n System.out.println(r2);\n System.out.println(r3);\n System.out.println(r4);\n System.out.println(log);\n }\n}\n","assertions":"List\u003cString\u003e log = new java.util.ArrayList\u003c\u003e();\nvar r1 = SCTask38.process(\"add\", 3, 4, log);\nassert r1.getKey().equals(\"add(3,4)\") : \"key1: \" + r1.getKey();\nassert r1.getValue() == 7 : \"val1: \" + r1.getValue();\nvar r2 = SCTask38.process(\"maxabs\", -7, 3, log);\nassert r2.getValue() == 7 : \"maxabs: \" + r2.getValue();\nvar r3 = SCTask38.process(\"nope\", 0, 0, log);\nassert r3.getValue() == 0 : \"default: \" + r3.getValue();\nassert log.contains(\"unknown op: nope\") : \"missing log for nope\";\n","category":"syntax_completion"} {"id":"39","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask39 {\n\n public static Map\u003cString, Integer\u003e summarize(List\u003cString\u003e items) {\n record Pair(String category, int value) {}\n List\u003cPair\u003e pairs = items.stream()\n .map(s -\u003e {\n String[] parts = s.split(\":\");\n return new Pair(parts[0],\n","golden_completion":" Integer.parseInt(parts[1]));\n })\n .collect(Collectors.toList());\n return pairs.stream()\n .collect(Collectors.groupingBy(Pair::category, Collectors.summingInt(Pair::value)));\n }\n","suffix":"\n public static void main(String[] args) {\n List\u003cString\u003e data = List.of(\"fruit:10\", \"veggie:5\", \"fruit:20\", \"veggie:15\", \"fruit:3\");\n Map\u003cString, Integer\u003e result = summarize(data);\n System.out.println(result);\n }\n}\n","assertions":"Map\u003cString, Integer\u003e r = SCTask39.summarize(java.util.List.of(\"fruit:10\", \"veggie:5\", \"fruit:20\", \"veggie:15\", \"fruit:3\"));\nassert r.get(\"fruit\") == 33 : \"fruit: \" + r.get(\"fruit\");\nassert r.get(\"veggie\") == 20 : \"veggie: \" + r.get(\"veggie\");\nMap\u003cString, Integer\u003e r2 = SCTask39.summarize(java.util.List.of(\"a:1\"));\nassert r2.get(\"a\") == 1 : \"single: \" + r2.get(\"a\");\n","category":"syntax_completion"} {"id":"40","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask40 {\n\n record MinMax\u003cT extends Comparable\u003cT\u003e\u003e(T min, T max) {}\n\n public static \u003cT extends Comparable\u003cT\u003e\u003e MinMax\u003cT\u003e findMinMax(List\u003cT\u003e items) {\n return items.stream()\n .map(x -\u003e new MinMax\u003c\u003e(x, x))\n .reduce((a, b) -\u003e new MinMax\u003c\u003e(\n a.min().compareTo(b.min()) \u003c= 0 ? a.min() : b.min(),\n a.max().compareTo(b.max()) \u003e= 0 ?\n","golden_completion":" a.max() : b.max()\n ))\n .orElseThrow(() -\u003e new NoSuchElementException(\"empty list\"));\n }\n","suffix":"\n public static void main(String[] args) {\n MinMax\u003cInteger\u003e r1 = findMinMax(List.of(3, 1, 4, 1, 5, 9, 2, 6));\n System.out.println(r1.min() + \" \" + r1.max());\n MinMax\u003cString\u003e r2 = findMinMax(List.of(\"banana\", \"apple\", \"cherry\"));\n System.out.println(r2.min() + \" \" + r2.max());\n }\n}\n","assertions":"SCTask40.MinMax\u003cInteger\u003e r1 = SCTask40.findMinMax(java.util.List.of(3,1,4,1,5,9,2,6));\nassert r1.min() == 1 : \"min int: \" + r1.min();\nassert r1.max() == 9 : \"max int: \" + r1.max();\nSCTask40.MinMax\u003cString\u003e r2 = SCTask40.findMinMax(java.util.List.of(\"banana\",\"apple\",\"cherry\"));\nassert r2.min().equals(\"apple\") : \"min str: \" + r2.min();\nassert r2.max().equals(\"cherry\") : \"max str: \" + r2.max();\ntry { SCTask40.\u003cInteger\u003efindMinMax(java.util.List.of()); assert false : \"should throw\"; } catch (NoSuchElementException e) { }\n","category":"syntax_completion"} {"id":"41","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask41 {\n public static List\u003cString\u003e classifyNumbers(List\u003cInteger\u003e nums) {\n return nums.stream()\n .map(n -\u003e n == 0 ? \"zero\" :\n n \u003e 0 ? (n % 2 == 0 ? \"pos-even\" :\n","golden_completion":" \"pos-odd\") :\n (n % 2 == 0 ? \"neg-even\" : \"neg-odd\"))\n .collect(Collectors.toList());","suffix":"\n }\n\n public static Map\u003cString, Long\u003e countByCategory(List\u003cInteger\u003e nums) {\n return classifyNumbers(nums).stream()\n .collect(Collectors.groupingBy(s -\u003e s, Collectors.counting()));\n }\n\n public static void main(String[] args) {\n List\u003cString\u003e result = classifyNumbers(Arrays.asList(-4, -3, 0, 1, 2));\n System.out.println(result);\n System.out.println(countByCategory(Arrays.asList(-4, -3, 0, 1, 2)));\n }\n}\n","assertions":"assert classifyNumbers(Arrays.asList(-4, -3, 0, 1, 2)).equals(\n Arrays.asList(\"neg-even\", \"neg-odd\", \"zero\", \"pos-odd\", \"pos-even\"))\n : \"basic classification failed\";\nassert classifyNumbers(Arrays.asList(0)).equals(Arrays.asList(\"zero\"));\nassert classifyNumbers(Collections.emptyList()).isEmpty();\nassert classifyNumbers(Arrays.asList(-1, -2, 3, 4)).equals(\n Arrays.asList(\"neg-odd\", \"neg-even\", \"pos-odd\", \"pos-even\"));\nMap\u003cString, Long\u003e counts = countByCategory(Arrays.asList(-4, -3, 0, 1, 2));\nassert counts.get(\"neg-even\") == 1L : \"count neg-even failed\";","category":"syntax_completion"} {"id":"42","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.io.Serializable;\n\npublic class SCTask42 {\n interface Labelable {\n String getLabel();\n }\n\n static class TaggedItem implements Comparable\u003cTaggedItem\u003e, Serializable, Labelable {\n private final String label;\n private final int priority;\n TaggedItem(String label, int priority) { this.label = label; this.priority = priority; }\n public String getLabel() { return label; }\n public int getPriority() { return priority; }\n public int compareTo(TaggedItem o) { return Integer.compare(this.priority, o.priority); }\n }\n\n public static \u003cT extends Comparable\u003cT\u003e \u0026 Serializable \u0026 Labelable\u003e String summarizeSorted(\n","golden_completion":" List\u003cT\u003e items) {\n return items.stream()\n .sorted()\n .map(Labelable::getLabel)\n .reduce(\"\", (a, b) -\u003e a.isEmpty() ? b : a + \",\" + b);\n }","suffix":"\n\n public static void main(String[] args) {\n List\u003cTaggedItem\u003e items = Arrays.asList(\n new TaggedItem(\"gamma\", 3),\n new TaggedItem(\"alpha\", 1),\n new TaggedItem(\"beta\", 2)\n );\n String result = summarizeSorted(items);\n System.out.println(result);\n }\n}\n","assertions":"List\u003cTaggedItem\u003e items1 = Arrays.asList(\n new TaggedItem(\"gamma\", 3), new TaggedItem(\"alpha\", 1), new TaggedItem(\"beta\", 2));\nassert summarizeSorted(items1).equals(\"alpha,beta,gamma\") : \"sort+join failed: \" + summarizeSorted(items1);\nList\u003cTaggedItem\u003e items2 = Arrays.asList(new TaggedItem(\"only\", 1));\nassert summarizeSorted(items2).equals(\"only\") : \"single item failed\";\nassert summarizeSorted(new ArrayList\u003cTaggedItem\u003e()).equals(\"\") : \"empty list failed\";","category":"syntax_completion"} {"id":"43","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask43 {\n private final String name;\n private final int score;\n private final List\u003cString\u003e tags;\n\n public SCTask43(String name, int score, List\u003cString\u003e tags) {\n this.name = name;\n this.score = score;\n this.tags = Collections.unmodifiableList(tags);\n }\n\n public SCTask43(String name, int score) {\n this(name, score, Collections.emptyList());\n }\n\n public SCTask43(Map\u003cString, Object\u003e config) {\n this((String) config.getOrDefault(\"name\", \"unnamed\"),\n","golden_completion":" config.containsKey(\"score\")\n ? ((Number) config.get(\"score\")).intValue()\n : -1,\n config.containsKey(\"tags\")\n ? ((List\u003c?\u003e) config.get(\"tags\")).stream()\n .map(Object::toString)\n .collect(Collectors.toList())\n : Collections.emptyList());","suffix":"\n }\n\n public String getName() { return name; }\n public int getScore() { return score; }\n public List\u003cString\u003e getTags() { return tags; }\n\n public static void main(String[] args) {\n Map\u003cString, Object\u003e cfg = new HashMap\u003c\u003e();\n cfg.put(\"name\", \"test\");\n cfg.put(\"score\", 42);\n cfg.put(\"tags\", Arrays.asList(\"a\", \"b\"));\n SCTask43 obj = new SCTask43(cfg);\n System.out.println(obj.getName() + \" \" + obj.getScore() + \" \" + obj.getTags());\n }\n}\n","assertions":"Map\u003cString, Object\u003e cfg1 = new HashMap\u003c\u003e();\ncfg1.put(\"name\", \"hello\");\ncfg1.put(\"score\", 99);\ncfg1.put(\"tags\", Arrays.asList(\"x\", \"y\"));\nSCTask43 o1 = new SCTask43(cfg1);\nassert o1.getName().equals(\"hello\") : \"name failed\";\nassert o1.getScore() == 99 : \"score failed\";\nassert o1.getTags().equals(Arrays.asList(\"x\", \"y\")) : \"tags failed\";\n\nMap\u003cString, Object\u003e cfg2 = new HashMap\u003c\u003e();\nSCTask43 o2 = new SCTask43(cfg2);\nassert o2.getName().equals(\"unnamed\") : \"default name failed\";\nassert o2.getScore() == -1 : \"default score failed\";\nassert o2.getTags().isEmpty() : \"default tags failed\";\n\nMap\u003cString, Object\u003e cfg3 = new HashMap\u003c\u003e();\ncfg3.put(\"score\", 5);\nSCTask43 o3 = new SCTask43(cfg3);\nassert o3.getName().equals(\"unnamed\") \u0026\u0026 o3.getScore() == 5 \u0026\u0026 o3.getTags().isEmpty();","category":"syntax_completion"} {"id":"44","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\n\npublic class SCTask44 {\n @SuppressWarnings(\"unchecked\")\n public static \u003cT\u003e T coalesce(T... values) {\n for (T v : values) {\n if (v != null) return v;\n }\n return null;\n }\n\n public static \u003cT\u003e List\u003cT\u003e repeat(T item, int count) {\n List\u003cT\u003e result = new ArrayList\u003c\u003e();\n for (int i = 0; i \u003c count; i++) result.add(item);\n return result;\n }\n\n public static \u003cK, V\u003e Map\u003cK, V\u003e zipToMap(List\u003cK\u003e keys, List\u003cV\u003e values) {\n Map\u003cK, V\u003e map = new LinkedHashMap\u003c\u003e();\n for (int i = 0; i \u003c Math.min(keys.size(), values.size()); i++) {\n map.put(keys.get(i), values.get(i));\n }\n return map;\n }\n\n public static void main(String[] args) {\n String name = SCTask44.\u003cString\u003ecoalesce(null, null, \"fallback\");\n List\u003cString\u003e keys = SCTask44.\u003cString\u003erepeat(\"key\", 3);\n Map\u003cString, List\u003cString\u003e\u003e nested = SCTask44.\u003cString, List\u003cString\u003e\u003ezipToMap(\n Arrays.asList(\"a\", \"b\"),\n Arrays.asList(\n SCTask44.\u003cString\u003erepeat(\n","golden_completion":" SCTask44.\u003cString\u003ecoalesce(null, \"x\"), 2),\n SCTask44.\u003cString\u003erepeat(\n SCTask44.\u003cString\u003ecoalesce(null, null, \"y\"), 3)\n )\n );","suffix":"\n System.out.println(name);\n System.out.println(keys);\n System.out.println(nested);\n }\n}\n","assertions":"String n = SCTask44.\u003cString\u003ecoalesce(null, null, \"fallback\");\nassert \"fallback\".equals(n) : \"coalesce failed\";\nList\u003cString\u003e k = SCTask44.\u003cString\u003erepeat(\"key\", 3);\nassert k.equals(Arrays.asList(\"key\", \"key\", \"key\")) : \"repeat failed\";\nMap\u003cString, List\u003cString\u003e\u003e m = SCTask44.\u003cString, List\u003cString\u003e\u003ezipToMap(\n Arrays.asList(\"a\", \"b\"),\n Arrays.asList(\n SCTask44.\u003cString\u003erepeat(SCTask44.\u003cString\u003ecoalesce(null, \"x\"), 2),\n SCTask44.\u003cString\u003erepeat(SCTask44.\u003cString\u003ecoalesce(null, null, \"y\"), 3)\n )\n);\nassert m.get(\"a\").equals(Arrays.asList(\"x\", \"x\")) : \"map a failed: \" + m.get(\"a\");\nassert m.get(\"b\").equals(Arrays.asList(\"y\", \"y\", \"y\")) : \"map b failed: \" + m.get(\"b\");","category":"syntax_completion"} {"id":"45","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask45 {\n static class RangeSpliterator implements Spliterator\u003cInteger\u003e {\n private int current; private final int end; private final int step;\n RangeSpliterator(int s, int e, int st) { current = s; end = e; step = st; }\n\n @Override\n public boolean tryAdvance(java.util.function.Consumer\u003c? super Integer\u003e action) {\n if (current \u003c end) { action.accept(current); current += step; return true; }\n return false;\n }\n\n @Override\n public Spliterator\u003cInteger\u003e trySplit() {\n int mid = current + (end - current) / 2;\n mid -= (mid - current) % step;\n if (mid \u003c= current || mid \u003e= end) return null;\n var p = new RangeSpliterator(current, mid, step); current = mid; return p;\n }\n\n @Override\n public long estimateSize() {\n","golden_completion":" return Math.max(0, (long)(end - current + step - 1) / step);\n }\n\n @Override\n public int characteristics() {\n return ORDERED | SIZED | IMMUTABLE | NONNULL;\n }","suffix":"\n }\n\n public static List\u003cInteger\u003e rangeWithStep(int start, int end, int step) {\n return StreamSupport.stream(new RangeSpliterator(start, end, step), false)\n .collect(Collectors.toList());\n }\n\n public static void main(String[] args) {\n System.out.println(rangeWithStep(0, 10, 2));\n System.out.println(rangeWithStep(1, 15, 3));\n }\n}\n","assertions":"assert rangeWithStep(0, 10, 2).equals(Arrays.asList(0, 2, 4, 6, 8))\n : \"even range failed: \" + rangeWithStep(0, 10, 2);\nassert rangeWithStep(1, 15, 3).equals(Arrays.asList(1, 4, 7, 10, 13))\n : \"step-3 failed: \" + rangeWithStep(1, 15, 3);\nassert rangeWithStep(0, 0, 1).isEmpty() : \"empty range failed\";\nassert rangeWithStep(5, 6, 1).equals(Arrays.asList(5)) : \"single elem failed\";","category":"syntax_completion"} {"id":"46","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\n\npublic class SCTask46 {\n public static String safeDiv(int a, int b, String mode) {\n try {\n int result = a / b;\n return switch (mode) {\n case \"hex\" -\u003e \"0x\" + Integer.toHexString(result);\n case \"bin\" -\u003e \"0b\" + Integer.toBinaryString(result);\n","golden_completion":" case \"oct\" -\u003e \"0\" + Integer.toOctalString(result);\n default -\u003e String.valueOf(result);\n };\n } catch (ArithmeticException e) {\n return switch (mode) {\n case \"hex\", \"bin\", \"oct\" -\u003e \"NaN(\" + mode + \")\";\n default -\u003e \"NaN\";\n };\n }","suffix":"\n }\n\n public static void main(String[] args) {\n System.out.println(safeDiv(255, 1, \"hex\"));\n System.out.println(safeDiv(10, 0, \"bin\"));\n }\n}\n","assertions":"assert safeDiv(255, 1, \"hex\").equals(\"0xff\") : \"hex failed: \" + safeDiv(255, 1, \"hex\");\nassert safeDiv(8, 1, \"bin\").equals(\"0b1000\") : \"bin failed\";\nassert safeDiv(8, 1, \"oct\").equals(\"010\") : \"oct failed\";\nassert safeDiv(42, 1, \"dec\").equals(\"42\") : \"default failed\";\nassert safeDiv(1, 0, \"hex\").equals(\"NaN(hex)\") : \"div0 hex failed\";\nassert safeDiv(1, 0, \"bin\").equals(\"NaN(bin)\") : \"div0 bin failed\";\nassert safeDiv(1, 0, \"plain\").equals(\"NaN\") : \"div0 default failed\";","category":"syntax_completion"} {"id":"47","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\n\npublic class SCTask47 {\n public static Function\u003cString, Function\u003cString, Function\u003cString, String\u003e\u003e\u003e\n curriedJoin(String delimiter) {\n return a -\u003e b -\u003e c -\u003e\n","golden_completion":" String.join(delimiter, Arrays.asList(\n a.isEmpty() ? \"_\" : a,\n b.isEmpty() ? \"_\" : b,\n c.isEmpty() ? \"_\" : c\n ));\n }\n\n public static Function\u003cInteger, Function\u003cInteger, Integer\u003e\u003e\n curriedOp(BinaryOperator\u003cInteger\u003e op) {\n return x -\u003e y -\u003e op.apply(x, y);\n }","suffix":"\n\n public static void main(String[] args) {\n var joiner = curriedJoin(\"-\");\n String result = joiner.apply(\"a\").apply(\"b\").apply(\"c\");\n System.out.println(result);\n\n var adder = curriedOp(Integer::sum);\n System.out.println(adder.apply(3).apply(4));\n }\n}\n","assertions":"var j1 = curriedJoin(\"-\");\nassert j1.apply(\"x\").apply(\"y\").apply(\"z\").equals(\"x-y-z\") : \"basic join failed\";\nassert j1.apply(\"\").apply(\"b\").apply(\"c\").equals(\"_-b-c\") : \"empty first failed\";\nassert j1.apply(\"a\").apply(\"\").apply(\"\").equals(\"a-_-_\") : \"empty last two failed\";\nvar j2 = curriedJoin(\",\");\nassert j2.apply(\"1\").apply(\"2\").apply(\"3\").equals(\"1,2,3\") : \"comma join failed\";\n\nvar add = curriedOp(Integer::sum);\nassert add.apply(3).apply(4) == 7 : \"add failed\";\nvar mul = curriedOp((a, b) -\u003e a * b);\nassert mul.apply(3).apply(4) == 12 : \"mul failed\";\nassert mul.apply(0).apply(5) == 0 : \"mul zero failed\";","category":"syntax_completion"} {"id":"48","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask48 {\n @SafeVarargs\n public static \u003cT\u003e List\u003cT\u003e interleave(List\u003cT\u003e... lists) {\n int maxLen = Arrays.stream(lists)\n .mapToInt(List::size)\n .max()\n .orElse(0);\n List\u003cT\u003e result = new ArrayList\u003c\u003e();\n for (int i = 0; i \u003c maxLen; i++) {\n for (List\u003cT\u003e list : lists) {\n if (i \u003c list.size()) {\n","golden_completion":" result.add(list.get(i));\n }\n }\n }\n return result;\n }","suffix":"\n\n @SafeVarargs\n public static \u003cT extends Comparable\u003cT\u003e\u003e T maxOf(T first, T... rest) {\n T best = first;\n for (T item : rest) {\n if (item.compareTo(best) \u003e 0) best = item;\n }\n return best;\n }\n\n public static void main(String[] args) {\n List\u003cString\u003e r = interleave(\n Arrays.asList(\"a\", \"b\", \"c\"),\n Arrays.asList(\"1\", \"2\"),\n Arrays.asList(\"x\", \"y\", \"z\", \"w\")\n );\n System.out.println(r);\n System.out.println(maxOf(\"hello\", \"world\", \"abc\"));\n }\n}\n","assertions":"List\u003cString\u003e r1 = interleave(\n Arrays.asList(\"a\", \"b\", \"c\"),\n Arrays.asList(\"1\", \"2\"),\n Arrays.asList(\"x\", \"y\", \"z\", \"w\"));\nassert r1.equals(Arrays.asList(\"a\", \"1\", \"x\", \"b\", \"2\", \"y\", \"c\", \"z\", \"w\"))\n : \"interleave failed: \" + r1;\nList\u003cInteger\u003e r2 = interleave(Arrays.asList(1, 2), Arrays.asList(3, 4));\nassert r2.equals(Arrays.asList(1, 3, 2, 4)) : \"int interleave failed\";\nList\u003cString\u003e r3 = interleave(Arrays.asList(\"solo\"));\nassert r3.equals(Arrays.asList(\"solo\")) : \"single list failed\";\nassert maxOf(\"hello\", \"world\", \"abc\").equals(\"world\") : \"maxOf failed\";\nassert maxOf(1, 5, 3, 7, 2) == 7 : \"maxOf int failed\";","category":"syntax_completion"} {"id":"49","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.function.*;\n\npublic class SCTask49 {\n static class FilterMapIterator\u003cT, R\u003e implements Iterator\u003cR\u003e {\n private final Iterator\u003cT\u003e source;\n private final Predicate\u003cT\u003e filter;\n private final Function\u003cT, R\u003e mapper;\n private R nextVal; private boolean hasNextVal;\n\n FilterMapIterator(Iterator\u003cT\u003e src, Predicate\u003cT\u003e f, Function\u003cT, R\u003e m) {\n source = src; filter = f; mapper = m; hasNextVal = false; advance();\n }\n\n private void advance() {\n hasNextVal = false;\n while (source.hasNext()) {\n T c = source.next();\n if (filter.test(c)) { nextVal = mapper.apply(c); hasNextVal = true; return; }\n }\n }\n @Override public boolean hasNext() { return hasNextVal; }\n @Override\n public R next() {\n if (!hasNextVal) throw new NoSuchElementException();\n","golden_completion":" R val = nextVal;\n advance();\n return val;\n }\n }\n\n public static \u003cT, R\u003e Iterable\u003cR\u003e filterMapIterable(\n Iterable\u003cT\u003e source, Predicate\u003cT\u003e filter, Function\u003cT, R\u003e mapper) {\n return () -\u003e new FilterMapIterator\u003c\u003e(source.iterator(), filter, mapper);\n }","suffix":"\n\n public static void main(String[] args) {\n List\u003cString\u003e result = new ArrayList\u003c\u003e();\n for (String s : filterMapIterable(Arrays.asList(1,2,3,4,5,6), n -\u003e n % 2 == 0, n -\u003e \"v\" + n)) {\n result.add(s);\n }\n System.out.println(result);\n }\n}\n","assertions":"List\u003cString\u003e r1 = new ArrayList\u003c\u003e();\nfor (String s : filterMapIterable(Arrays.asList(1,2,3,4,5,6), n -\u003e n % 2 == 0, n -\u003e \"v\" + n)) r1.add(s);\nassert r1.equals(Arrays.asList(\"v2\", \"v4\", \"v6\")) : \"even filter failed: \" + r1;\n\nList\u003cInteger\u003e r2 = new ArrayList\u003c\u003e();\nfor (int x : filterMapIterable(Arrays.asList(\"ab\",\"\",\"cde\",\"f\"), s -\u003e !s.isEmpty(), String::length)) r2.add(x);\nassert r2.equals(Arrays.asList(2, 3, 1)) : \"string filter failed: \" + r2;\n\nList\u003cString\u003e r3 = new ArrayList\u003c\u003e();\nfor (String s : filterMapIterable(Arrays.asList(1,3,5), n -\u003e n % 2 == 0, n -\u003e \"v\" + n)) r3.add(s);\nassert r3.isEmpty() : \"all filtered out should be empty\";\n\nList\u003cString\u003e r4 = new ArrayList\u003c\u003e();\nfor (String s : filterMapIterable(Collections.\u003cInteger\u003eemptyList(), n -\u003e true, n -\u003e \"x\")) r4.add(s);\nassert r4.isEmpty() : \"empty input failed\";","category":"syntax_completion"} {"id":"50","testsource":"devbench-syntax-completion","language":"java","prefix":"import java.util.*;\nimport java.util.stream.*;\n\npublic class SCTask50 {\n static abstract class Node {\n final String type; final Map\u003cString, String\u003e attrs; final List\u003cNode\u003e children;\n Node(String t, Map\u003cString, String\u003e a, List\u003cNode\u003e c) {\n type = t; attrs = Collections.unmodifiableMap(a); children = Collections.unmodifiableList(c);\n }\n int depth() { return 1 + children.stream().mapToInt(Node::depth).max().orElse(0); }\n abstract String render();\n }\n\n static class Leaf extends Node {\n final String content;\n Leaf(String t, String c, Map\u003cString, String\u003e a) { super(t, a, Collections.emptyList()); content = c; }\n String render() { return \"\u003c\" + type + \"\u003e\" + content + \"\u003c/\" + type + \"\u003e\"; }\n }\n\n static class Branch extends Node {\n Branch(String type, Map\u003cString, String\u003e attrs, Node... kids) {\n super(type,\n attrs == null ? Collections.emptyMap() : attrs,\n kids == null ? Collections.emptyList() :\n","golden_completion":" Arrays.stream(kids)\n .filter(Objects::nonNull)\n .collect(Collectors.toList()));\n }\n\n String render() {\n String childStr = children.stream()\n .map(Node::render)\n .collect(Collectors.joining(\"\"));\n return \"\u003c\" + type + \"\u003e\" + childStr + \"\u003c/\" + type + \"\u003e\";\n }","suffix":"\n }\n\n public static void main(String[] args) {\n Node tree = new Branch(\"div\", null,\n new Leaf(\"span\", \"hello\", Map.of(\"class\", \"hi\")),\n new Branch(\"ul\", Map.of(\"id\", \"list\"),\n new Leaf(\"li\", \"a\", Map.of()),\n new Leaf(\"li\", \"b\", Map.of())\n )\n );\n System.out.println(tree.render());\n System.out.println(\"Depth: \" + tree.depth());\n }\n}\n","assertions":"Node leaf = new Leaf(\"p\", \"text\", Map.of());\nassert leaf.render().equals(\"\u003cp\u003etext\u003c/p\u003e\") : \"leaf render failed\";\nassert leaf.depth() == 1 : \"leaf depth failed\";\n\nNode tree = new Branch(\"div\", null,\n new Leaf(\"span\", \"hello\", Map.of(\"class\", \"hi\")),\n new Branch(\"ul\", Map.of(\"id\", \"list\"),\n new Leaf(\"li\", \"a\", Map.of()),\n new Leaf(\"li\", \"b\", Map.of())\n )\n);\nassert tree.render().equals(\"\u003cdiv\u003e\u003cspan\u003ehello\u003c/span\u003e\u003cul\u003e\u003cli\u003ea\u003c/li\u003e\u003cli\u003eb\u003c/li\u003e\u003c/ul\u003e\u003c/div\u003e\")\n : \"tree render failed: \" + tree.render();\nassert tree.depth() == 3 : \"tree depth failed: \" + tree.depth();\n\nNode empty = new Branch(\"div\", null);\nassert empty.render().equals(\"\u003cdiv\u003e\u003c/div\u003e\") : \"empty branch failed\";\nassert empty.depth() == 1 : \"empty depth failed\";","category":"syntax_completion"} {"id":"1","testsource":"devbench-api-usage","language":"javascript","prefix":"const fs = require(\u0027fs\u0027);\nconst os = require(\u0027os\u0027);\nconst path = require(\u0027path\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction writeStrictJson(filePath, value) {\n const body = JSON.stringify(value, null, 2);\n const fd = fs.openSync(filePath, \u0027wx\u0027, 0o600);\n try {\n fs.writeFileSync(fd, body, { encoding: \u0027utf8\u0027 });\n } finally {\n fs.closeSync(fd);\n }\n return { bytes: Buffer.byteLength(body, \u0027utf8\u0027), flag: \u0027wx\u0027, mode: 0o600 };\n}\n\n// Fill in precise API documentation for writeStrictJson.\n// The executable implementation above is the source of truth.\nwriteStrictJson.doc =\n","golden_completion":"`Use fs.openSync(filePath, \u0027wx\u0027, 0o600) to create a new file exclusively and fail with EEXIST instead of overwriting.\nSerialize value with JSON.stringify(value, null, 2), write UTF-8 text through fs.writeFileSync(fd, body, { encoding: \u0027utf8\u0027 }), and always close the descriptor in a finally block with fs.closeSync(fd).\nReturn { bytes, flag: \u0027wx\u0027, mode: 0o600 }, where bytes is Buffer.byteLength(body, \u0027utf8\u0027); invalid paths and existing files surface the normal Node fs exceptions.`","suffix":";\n\nassert.strictEqual(typeof writeStrictJson.doc, \u0027string\u0027);\nassert.ok(writeStrictJson.doc.includes(\u0027fs.openSync\u0027));\nassert.ok(writeStrictJson.doc.includes(\"\u0027wx\u0027\"));\nassert.ok(writeStrictJson.doc.includes(\u0027fs.closeSync\u0027));\n\nconst dir = fs.mkdtempSync(path.join(os.tmpdir(), \u0027db-doc-\u0027));\nconst file = path.join(dir, \u0027payload.json\u0027);\nconst result = writeStrictJson(file, { b: 2, a: 1 });\nassert.strictEqual(result.flag, \u0027wx\u0027);\nassert.strictEqual(result.mode, 0o600);\nassert.strictEqual(result.bytes, 22);\nassert.strictEqual(fs.readFileSync(file, \u0027utf8\u0027), \u0027{\\n \"b\": 2,\\n \"a\": 1\\n}\u0027);\nlet existed = false;\ntry { writeStrictJson(file, { again: true }); } catch (e) { existed = e.code === \u0027EEXIST\u0027; }\nassert.strictEqual(existed, true);\nfs.rmSync(dir, { recursive: true, force: true });\nconsole.log(\u0027task1 ok\u0027);\n","assertions":"for (const term of [\n \u0027JSON.stringify(value, null, 2)\u0027,\n \u0027fs.writeFileSync(fd, body\u0027,\n \"{ encoding: \u0027utf8\u0027 }\",\n \u0027Buffer.byteLength(body\u0027,\n \u0027EEXIST\u0027,\n \u00270o600\u0027,\n \u0027finally\u0027,\n \u0027normal Node fs exceptions\u0027\n]) {\n assert.ok(writeStrictJson.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst docFile = path.join(fs.mkdtempSync(path.join(os.tmpdir(), \u0027db-doc-h-\u0027)), \u0027x.json\u0027);\nconst r = writeStrictJson(docFile, [\u0027x\u0027, \u0027y\u0027]);\nassert.strictEqual(r.bytes, 16);\nassert.strictEqual(fs.readFileSync(docFile, \u0027utf8\u0027), \u0027[\\n \"x\",\\n \"y\"\\n]\u0027);\nfs.rmSync(path.dirname(docFile), { recursive: true, force: true });\nconsole.log(\u0027task1 assertions ok\u0027);\n","category":"api_usage"} {"id":"2","testsource":"devbench-api-usage","language":"javascript","prefix":"const { Buffer } = require(\u0027buffer\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction decodeLenientBase64(input) {\n return Buffer.from(input, \u0027base64\u0027).toString(\u0027utf8\u0027);\n}\n\n// Fill in precise API documentation for decodeLenientBase64.\n// The executable implementation above is the source of truth.\ndecodeLenientBase64.doc =\n","golden_completion":"`Decode input with Buffer.from(input, \u0027base64\u0027) and return the bytes as a UTF-8 string via toString(\u0027utf8\u0027).\nThis deliberately relies on Node\u0027s lenient base64 decoder: missing padding, ASCII whitespace, and non-base64 characters are ignored/skipped rather than rejected.\nThe function performs no validation and normally does not throw for malformed base64 text; empty or all-garbage input decodes to an empty string.`","suffix":";\n\nassert.strictEqual(typeof decodeLenientBase64.doc, \u0027string\u0027);\nassert.ok(decodeLenientBase64.doc.includes(\"Buffer.from(input, \u0027base64\u0027)\"));\nassert.ok(decodeLenientBase64.doc.includes(\"toString(\u0027utf8\u0027)\"));\nassert.ok(decodeLenientBase64.doc.includes(\u0027lenient\u0027));\n\nassert.strictEqual(decodeLenientBase64(\u0027SGVsbG8=\u0027), \u0027Hello\u0027);\nassert.strictEqual(decodeLenientBase64(\u0027SGVsbG8\u0027), \u0027Hello\u0027);\nassert.strictEqual(decodeLenientBase64(\u0027S G V s b G 8 =\u0027), \u0027Hello\u0027);\nassert.strictEqual(decodeLenientBase64(\u0027SGVs!!!bG8=\u0027), \u0027Hello\u0027);\nconsole.log(\u0027task2 ok\u0027);\n","assertions":"for (const term of [\n \u0027missing padding\u0027,\n \u0027ASCII whitespace\u0027,\n \u0027non-base64 characters\u0027,\n \u0027ignored/skipped\u0027,\n \u0027no validation\u0027,\n \u0027does not throw\u0027,\n \u0027all-garbage input\u0027,\n \u0027empty string\u0027\n]) {\n assert.ok(decodeLenientBase64.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nassert.strictEqual(decodeLenientBase64(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(decodeLenientBase64(\u0027!!!!\u0027), \u0027\u0027);\nassert.strictEqual(decodeLenientBase64(\u0027SGk\u0027), \u0027Hi\u0027);\nassert.strictEqual(decodeLenientBase64(\u0027\\nU0dWc2JHOD0=\\t\u0027), \u0027SGVsbG8=\u0027);\nconsole.log(\u0027task2 assertions ok\u0027);\n","category":"api_usage"} {"id":"3","testsource":"devbench-api-usage","language":"javascript","prefix":"const { URL } = require(\u0027url\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction collectQueryValues(urlStr) {\n const url = new URL(urlStr);\n const result = {};\n for (const [key, value] of url.searchParams) {\n if (!Object.prototype.hasOwnProperty.call(result, key)) result[key] = [];\n result[key].push(value);\n }\n return result;\n}\n\n// Fill in precise API documentation for collectQueryValues.\n// The executable implementation above is the source of truth.\ncollectQueryValues.doc =\n","golden_completion":"`Parse urlStr with the WHATWG URL constructor new URL(urlStr), then iterate url.searchParams to collect every [key, value] pair.\nDuplicate parameter names are preserved in insertion order by pushing each decoded value into an array, including empty-string values from ?name= or bare ?name.\nURLSearchParams percent-decodes values and treats + in the query as a space; invalid absolute URLs propagate the normal TypeError from new URL.`","suffix":";\n\nassert.strictEqual(typeof collectQueryValues.doc, \u0027string\u0027);\nassert.ok(collectQueryValues.doc.includes(\u0027new URL(urlStr)\u0027));\nassert.ok(collectQueryValues.doc.includes(\u0027url.searchParams\u0027));\nassert.ok(collectQueryValues.doc.includes(\u0027Duplicate\u0027));\n\nconst r = collectQueryValues(\u0027https://x.test/?tag=a\u0026tag=b\u0026q=hello+world\u0026empty=\u0026flag\u0027);\nassert.deepStrictEqual(r.tag, [\u0027a\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(r.q, [\u0027hello world\u0027]);\nassert.deepStrictEqual(r.empty, [\u0027\u0027]);\nassert.deepStrictEqual(r.flag, [\u0027\u0027]);\nconsole.log(\u0027task3 ok\u0027);\n","assertions":"for (const term of [\n \u0027WHATWG URL\u0027,\n \u0027[key, value]\u0027,\n \u0027insertion order\u0027,\n \u0027decoded value\u0027,\n \u0027empty-string values\u0027,\n \u0027percent-decodes\u0027,\n \u0027+ in the query as a space\u0027,\n \u0027TypeError\u0027\n]) {\n assert.ok(collectQueryValues.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst r2 = collectQueryValues(\u0027https://x.test/?a=1\u0026a=2\u0026a=3\u0026msg=a%26b\u0026plus=a+b\u0027);\nassert.deepStrictEqual(r2.a, [\u00271\u0027, \u00272\u0027, \u00273\u0027]);\nassert.deepStrictEqual(r2.msg, [\u0027a\u0026b\u0027]);\nassert.deepStrictEqual(r2.plus, [\u0027a b\u0027]);\nassert.deepStrictEqual(collectQueryValues(\u0027https://x.test/\u0027), {});\nconsole.log(\u0027task3 assertions ok\u0027);\n","category":"api_usage"} {"id":"4","testsource":"devbench-api-usage","language":"javascript","prefix":"const path = require(\u0027path\u0027);\n\n// Implement a function that normalizes a sequence of path segments.\n// IMPORTANT: Unlike path.join, if any segment is an absolute path,\n// all preceding segments are DISCARDED (like path.resolve but\n// without using cwd — treat the first segment as the base).\n// The result must be normalized (no . or .. except leading ..)\n// and must NOT end with a trailing separator (unless root \u0027/\u0027).\nfunction resolveSegments(...segments) {\n","golden_completion":" if (segments.length === 0) return \u0027.\u0027;\n let resolved = segments[0];\n for (let i = 1; i \u003c segments.length; i++) {\n if (path.isAbsolute(segments[i])) {\n resolved = segments[i];\n } else {\n resolved = path.join(resolved, segments[i]);\n }\n }\n return path.normalize(resolved);\n","suffix":"}\n\n// If a segment is absolute, preceding segments are discarded\nif (resolveSegments(\u0027/usr\u0027, \u0027local\u0027, \u0027/etc\u0027, \u0027hosts\u0027) !== \u0027/etc/hosts\u0027) {\n throw new Error(\u0027absolute reset failed\u0027);\n}\nif (resolveSegments(\u0027a\u0027, \u0027b\u0027, \u0027c\u0027) !== \u0027a/b/c\u0027) {\n throw new Error(\u0027relative join failed\u0027);\n}\nif (resolveSegments(\u0027/a\u0027, \u0027b\u0027, \u0027..\u0027, \u0027c\u0027) !== \u0027/a/c\u0027) {\n throw new Error(\u0027dotdot failed\u0027);\n}\nconsole.log(\u0027task4 ok\u0027);\n","assertions":"// Single segment\nif (resolveSegments(\u0027/root\u0027) !== \u0027/root\u0027) throw new Error(\u0027single absolute\u0027);\nif (resolveSegments(\u0027rel\u0027) !== \u0027rel\u0027) throw new Error(\u0027single relative\u0027);\n\n// Empty segments case\nif (resolveSegments() !== \u0027.\u0027) throw new Error(\u0027no segments\u0027);\n\n// Multiple absolute resets\nconst r = resolveSegments(\u0027/a\u0027, \u0027/b\u0027, \u0027/c\u0027, \u0027d\u0027);\nif (r !== \u0027/c/d\u0027) throw new Error(\u0027multi reset: \u0027 + r);\n\n// Trailing dot handling\nconst r2 = resolveSegments(\u0027/a\u0027, \u0027b\u0027, \u0027.\u0027);\nif (r2 !== \u0027/a/b\u0027) throw new Error(\u0027trailing dot: \u0027 + r2);\n\n// Normalize double slashes\nconst r3 = resolveSegments(\u0027/a\u0027, \u0027b//c\u0027);\nif (r3 !== \u0027/a/b/c\u0027) throw new Error(\u0027double slash: \u0027 + r3);\n\nconsole.log(\u0027assertions4 ok\u0027);\n","category":"api_usage"} {"id":"5","testsource":"devbench-api-usage","language":"javascript","prefix":"const util = require(\u0027util\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction scaleLater(n, callback) {\n setImmediate(() =\u003e callback(null, n * 2));\n}\nscaleLater[util.promisify.custom] = (n) =\u003e Promise.resolve(n * 3);\n\n// Fill in precise API documentation for scaleLater.\n// The executable implementation above is the source of truth.\nscaleLater.doc =\n","golden_completion":"`scaleLater is a Node-style callback API: it schedules setImmediate and calls callback(null, n * 2), so callback consumers receive the doubled value.\nIt also defines scaleLater[util.promisify.custom], the symbol used by util.promisify, as a custom Promise-returning function that resolves to n * 3 instead of wrapping the callback behavior.\nThe custom promisified version does not change the original callback API; callback errors use the first argument convention and util.promisify(scaleLater)(n) returns a Promise for the tripled value.`","suffix":";\n\nassert.strictEqual(typeof scaleLater.doc, \u0027string\u0027);\nassert.ok(scaleLater.doc.includes(\u0027util.promisify.custom\u0027));\nassert.ok(scaleLater.doc.includes(\u0027callback(null\u0027));\nassert.ok(scaleLater.doc.includes(\u0027Promise\u0027));\n\nconst scaleLaterAsync = util.promisify(scaleLater);\nscaleLater(5, (err, value) =\u003e {\n assert.ifError(err);\n assert.strictEqual(value, 10);\n scaleLaterAsync(5).then(v =\u003e {\n assert.strictEqual(v, 15);\n console.log(\u0027task5 ok\u0027);\n });\n});\n","assertions":"for (const term of [\n \u0027Node-style callback API\u0027,\n \u0027setImmediate\u0027,\n \u0027n * 2\u0027,\n \u0027symbol used by util.promisify\u0027,\n \u0027n * 3\u0027,\n \u0027instead of wrapping the callback behavior\u0027,\n \u0027does not change the original callback API\u0027,\n \u0027first argument convention\u0027\n]) {\n assert.ok(scaleLater.doc.includes(term), \u0027doc missing \u0027 + term);\n}\n(async () =\u003e {\n const p = util.promisify(scaleLater);\n const value = await p(7);\n assert.strictEqual(value, 21);\n await new Promise((resolve, reject) =\u003e scaleLater(7, (err, v) =\u003e err ? reject(err) : (assert.strictEqual(v, 14), resolve())));\n console.log(\u0027task5 assertions ok\u0027);\n})().catch(e =\u003e { console.error(e); process.exit(1); });\n","category":"api_usage"} {"id":"6","testsource":"devbench-api-usage","language":"javascript","prefix":"const { Transform } = require(\u0027stream\u0027);\nconst assert = require(\u0027assert\u0027);\n\nclass ReverseCollectStream extends Transform {\n constructor() {\n super({ decodeStrings: true });\n this._chunks = [];\n }\n _transform(chunk, encoding, callback) {\n this._chunks.push(Buffer.from(chunk));\n callback();\n }\n _flush(callback) {\n const all = Buffer.concat(this._chunks);\n this.push(Buffer.from(all.toString(\u0027utf8\u0027).split(\u0027\u0027).reverse().join(\u0027\u0027), \u0027utf8\u0027));\n callback();\n }\n}\n\n// Fill in precise API documentation for ReverseCollectStream.\n// The executable implementation above is the source of truth.\nReverseCollectStream.doc =\n","golden_completion":"`ReverseCollectStream is a stream.Transform subclass constructed with decodeStrings: true, so written strings arrive at _transform as Buffer chunks.\n_transform buffers Buffer.from(chunk) in this._chunks and calls callback() without pushing data, meaning output is intentionally delayed until stream finalization.\n_flush runs at the end, uses Buffer.concat(this._chunks), reverses the concatenated UTF-8 string, pushes a Buffer, then calls callback(); stream errors would be reported by passing an error to those callbacks.`","suffix":";\n\nassert.strictEqual(typeof ReverseCollectStream.doc, \u0027string\u0027);\nassert.ok(ReverseCollectStream.doc.includes(\u0027stream.Transform\u0027));\nassert.ok(ReverseCollectStream.doc.includes(\u0027_transform\u0027));\nassert.ok(ReverseCollectStream.doc.includes(\u0027_flush\u0027));\n\nconst rs = new ReverseCollectStream();\nlet output = \u0027\u0027;\nrs.on(\u0027data\u0027, chunk =\u003e { output += chunk.toString(\u0027utf8\u0027); });\nrs.on(\u0027end\u0027, () =\u003e {\n assert.strictEqual(output, \u0027dlrow olleh\u0027);\n console.log(\u0027task6 ok\u0027);\n});\nrs.write(\u0027hello\u0027);\nrs.write(\u0027 \u0027);\nrs.end(\u0027world\u0027);\n","assertions":"for (const term of [\n \u0027decodeStrings: true\u0027,\n \u0027Buffer chunks\u0027,\n \u0027Buffer.from(chunk)\u0027,\n \u0027calls callback() without pushing data\u0027,\n \u0027delayed until stream finalization\u0027,\n \u0027Buffer.concat(this._chunks)\u0027,\n \u0027pushes a Buffer\u0027,\n \u0027passing an error to those callbacks\u0027\n]) {\n assert.ok(ReverseCollectStream.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst rs2 = new ReverseCollectStream();\nlet out2 = \u0027\u0027;\nrs2.on(\u0027data\u0027, c =\u003e { out2 += c.toString(\u0027utf8\u0027); });\nrs2.on(\u0027end\u0027, () =\u003e {\n assert.strictEqual(out2, \u0027cba\u0027);\n const rs3 = new ReverseCollectStream();\n let out3 = \u0027\u0027;\n rs3.on(\u0027data\u0027, c =\u003e { out3 += c.toString(\u0027utf8\u0027); });\n rs3.on(\u0027end\u0027, () =\u003e { assert.strictEqual(out3, \u0027\u0027); console.log(\u0027task6 assertions ok\u0027); });\n rs3.end();\n});\nrs2.write(\u0027a\u0027);\nrs2.write(\u0027b\u0027);\nrs2.end(\u0027c\u0027);\n","category":"api_usage"} {"id":"7","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction deriveScryptKey(password, saltHex) {\n const salt = saltHex === undefined ? crypto.randomBytes(16) : Buffer.from(saltHex, \u0027hex\u0027);\n if (salt.length !== 16) throw new RangeError(\u0027salt must be 16 bytes\u0027);\n const options = { N: 16384, r: 8, p: 1 };\n const key = crypto.scryptSync(password, salt, 32, options);\n return { key, salt, keyLength: 32, options };\n}\n\n// Fill in precise API documentation for deriveScryptKey.\n// The executable implementation above is the source of truth.\nderiveScryptKey.doc =\n","golden_completion":"`Derive a 32-byte Buffer with crypto.scryptSync(password, salt, 32, { N: 16384, r: 8, p: 1 }).\nIf saltHex is undefined, generate a 16-byte salt with crypto.randomBytes(16); otherwise decode the provided hex string with Buffer.from(saltHex, \u0027hex\u0027) and require the decoded salt length to be exactly 16 bytes.\nThe same password and salt produce the same key, a random salt makes calls non-deterministic, and a wrong salt length throws RangeError before scryptSync is called.`","suffix":";\n\nassert.strictEqual(typeof deriveScryptKey.doc, \u0027string\u0027);\nassert.ok(deriveScryptKey.doc.includes(\u0027crypto.scryptSync\u0027));\nassert.ok(deriveScryptKey.doc.includes(\u0027crypto.randomBytes(16)\u0027));\nassert.ok(deriveScryptKey.doc.includes(\"Buffer.from(saltHex, \u0027hex\u0027)\"));\n\nconst saltHex = \u00270123456789abcdef0123456789abcdef\u0027;\nconst a = deriveScryptKey(\u0027pw\u0027, saltHex);\nconst b = deriveScryptKey(\u0027pw\u0027, saltHex);\nassert.strictEqual(a.key.length, 32);\nassert.strictEqual(a.salt.length, 16);\nassert.ok(a.key.equals(b.key));\nassert.deepStrictEqual(a.options, { N: 16384, r: 8, p: 1 });\nconsole.log(\u0027task7 ok\u0027);\n","assertions":"for (const term of [\n \u002732-byte Buffer\u0027,\n \u0027{ N: 16384, r: 8, p: 1 }\u0027,\n \u0027saltHex is undefined\u0027,\n \u002716-byte salt\u0027,\n \u0027decoded salt length\u0027,\n \u0027exactly 16 bytes\u0027,\n \u0027same password and salt produce the same key\u0027,\n \u0027random salt makes calls non-deterministic\u0027,\n \u0027RangeError before scryptSync is called\u0027\n]) {\n assert.ok(deriveScryptKey.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst c = deriveScryptKey(\u0027pw2\u0027, saltHex);\nassert.strictEqual(c.key.equals(a.key), false);\nconst rnd = deriveScryptKey(\u0027pw\u0027);\nassert.strictEqual(rnd.salt.length, 16);\nassert.throws(() =\u003e deriveScryptKey(\u0027pw\u0027, \u0027abcd\u0027), RangeError);\nconsole.log(\u0027task7 assertions ok\u0027);\n","category":"api_usage"} {"id":"8","testsource":"devbench-api-usage","language":"javascript","prefix":"const EventEmitter = require(\u0027events\u0027);\n\n// Create a SafeEmitter class that extends EventEmitter with these behaviors:\n// 1. If an \u0027error\u0027 event is emitted and there are NO error listeners\n// (other than the internal one), it stores the error in this.lastError\n// instead of throwing.\n// 2. It tracks the total number of events emitted (all types) in this.eventCount.\n// 3. The maxListeners default is set to 5 (not the default 10).\nclass SafeEmitter extends EventEmitter {\n","golden_completion":" constructor() {\n super();\n this.lastError = null;\n this.eventCount = 0;\n this.setMaxListeners(5);\n\n // Internal error handler to prevent throw\n this.on(\u0027error\u0027, (err) =\u003e {\n this.lastError = err;\n });\n }\n\n emit(type, ...args) {\n this.eventCount++;\n return super.emit(type, ...args);\n }\n","suffix":"}\n\nconst se = new SafeEmitter();\n\n// Should not throw on error\nse.emit(\u0027error\u0027, new Error(\u0027test error\u0027));\nif (!(se.lastError instanceof Error)) throw new Error(\u0027lastError not set\u0027);\nif (se.lastError.message !== \u0027test error\u0027) throw new Error(\u0027wrong error\u0027);\n\n// Event counting\nse.emit(\u0027data\u0027, \u0027hello\u0027);\nse.emit(\u0027data\u0027, \u0027world\u0027);\nif (se.eventCount !== 3) throw new Error(\u0027count should be 3: \u0027 + se.eventCount);\n\n// Max listeners\nif (se.getMaxListeners() !== 5) throw new Error(\u0027maxListeners should be 5\u0027);\n\nconsole.log(\u0027task8 ok\u0027);\n","assertions":"const _se2 = new SafeEmitter();\n\n// Multiple errors overwrite lastError\n_se2.emit(\u0027error\u0027, new Error(\u0027first\u0027));\n_se2.emit(\u0027error\u0027, new Error(\u0027second\u0027));\nif (_se2.lastError.message !== \u0027second\u0027) throw new Error(\u0027should be second\u0027);\n\n// eventCount includes error events\nif (_se2.eventCount !== 2) throw new Error(\u0027error count: \u0027 + _se2.eventCount);\n\n// Regular events also counted\n_se2.emit(\u0027ping\u0027);\n_se2.emit(\u0027pong\u0027);\nif (_se2.eventCount !== 4) throw new Error(\u0027total count: \u0027 + _se2.eventCount);\n\n// New instance has fresh state\nconst _se3 = new SafeEmitter();\nif (_se3.lastError !== null) throw new Error(\u0027fresh lastError\u0027);\nif (_se3.eventCount !== 0) throw new Error(\u0027fresh eventCount\u0027);\n\n// Verify error listener count is exactly 1 (the internal one)\nif (_se3.listenerCount(\u0027error\u0027) !== 1) throw new Error(\u0027should have 1 error listener\u0027);\n\n// Adding external error listener should not break lastError tracking\n_se3.on(\u0027error\u0027, () =\u003e {}); // second error listener\n_se3.emit(\u0027error\u0027, new Error(\u0027with extra listener\u0027));\nif (_se3.lastError.message !== \u0027with extra listener\u0027) throw new Error(\u0027extra listener lastError\u0027);\n\nconsole.log(\u0027assertions8 ok\u0027);\n","category":"api_usage"} {"id":"9","testsource":"devbench-api-usage","language":"javascript","prefix":"const zlib = require(\u0027zlib\u0027);\n\n// Implement a compress/decompress pair using zlib.deflateSync and\n// zlib.inflateSync (NOT gzip). Requirements:\n// - Use compression level 9 (best compression)\n// - Use a raw deflate stream (windowBits = -15) for both compress and decompress\n// - Return Buffers\n// The raw deflate format has no header/trailer, unlike gzip or standard deflate.\nfunction compressRaw(data) {\n","golden_completion":" return zlib.deflateRawSync(data, { level: 9 });\n}\n\nfunction decompressRaw(compressed) {\n return zlib.inflateRawSync(compressed);\n","suffix":"}\n\nconst original = Buffer.from(\u0027hello world hello world hello world\u0027);\nconst compressed = compressRaw(original);\nconst decompressed = decompressRaw(compressed);\n\nif (!decompressed.equals(original)) throw new Error(\u0027round-trip failed\u0027);\n// Raw deflate should be smaller than original for repetitive data\nif (compressed.length \u003e= original.length) throw new Error(\u0027no compression\u0027);\nconsole.log(\u0027task9 ok\u0027);\n","assertions":"// Empty input\nconst _e9 = compressRaw(Buffer.alloc(0));\nconst _d9 = decompressRaw(_e9);\nif (_d9.length !== 0) throw new Error(\u0027empty round-trip: \u0027 + _d9.length);\n\n// Verify it\u0027s truly raw deflate (no zlib/gzip header)\nconst _c9 = compressRaw(Buffer.from(\u0027test\u0027));\n// zlib header starts with 0x78, gzip with 0x1f 0x8b\n// raw deflate does NOT have these headers\nif (_c9[0] === 0x78) throw new Error(\u0027has zlib header — not raw\u0027);\nif (_c9[0] === 0x1f \u0026\u0026 _c9[1] === 0x8b) throw new Error(\u0027has gzip header — not raw\u0027);\n\n// Verify it can\u0027t be decompressed with regular inflate (expects zlib header)\ntry {\n zlib.inflateSync(_c9);\n // If this succeeds, it might be zlib-wrapped, not raw\n throw new Error(\u0027regular inflate should fail on raw deflate\u0027);\n} catch (_err9) {\n if (_err9.message === \u0027regular inflate should fail on raw deflate\u0027) throw _err9;\n // Expected: zlib inflate fails on raw data — this is correct\n}\n\n// Large input\nconst _big9 = Buffer.alloc(10000, \u0027abcdefghij\u0027);\nconst _bc9 = compressRaw(_big9);\nconst _bd9 = decompressRaw(_bc9);\nif (!_bd9.equals(_big9)) throw new Error(\u0027large round-trip\u0027);\nif (_bc9.length \u003e= _big9.length) throw new Error(\u0027large not compressed\u0027);\n\nconsole.log(\u0027assertions9 ok\u0027);\n","category":"api_usage"} {"id":"10","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction rollingSha256Hex(chunks) {\n const hash = crypto.createHash(\u0027sha256\u0027);\n const digests = [];\n for (const chunk of chunks) {\n hash.update(chunk);\n digests.push(hash.copy().digest(\u0027hex\u0027));\n }\n return digests;\n}\n\n// Fill in precise API documentation for rollingSha256Hex.\n// The executable implementation above is the source of truth.\nrollingSha256Hex.doc =\n","golden_completion":"`Create a crypto.Hash with crypto.createHash(\u0027sha256\u0027), update it once per chunk, and after each update call hash.copy().digest(\u0027hex\u0027) to snapshot the current state.\nhash.copy() clones the Hash object so digest(\u0027hex\u0027) finalizes only the clone and does not finalize or mutate the original hash, allowing later chunks to keep accumulating.\nReturn one 64-character lowercase hexadecimal SHA-256 digest per chunk; an empty chunks array returns [], and the last digest equals hashing the concatenated input in order.`","suffix":";\n\nassert.strictEqual(typeof rollingSha256Hex.doc, \u0027string\u0027);\nassert.ok(rollingSha256Hex.doc.includes(\"crypto.createHash(\u0027sha256\u0027)\"));\nassert.ok(rollingSha256Hex.doc.includes(\u0027hash.copy()\u0027));\nassert.ok(rollingSha256Hex.doc.includes(\"digest(\u0027hex\u0027)\"));\n\nconst parts = [\u0027hello\u0027, \u0027 \u0027, \u0027world\u0027];\nconst got = rollingSha256Hex(parts);\nassert.strictEqual(got.length, 3);\nassert.strictEqual(got[0], crypto.createHash(\u0027sha256\u0027).update(\u0027hello\u0027).digest(\u0027hex\u0027));\nassert.strictEqual(got[2], crypto.createHash(\u0027sha256\u0027).update(\u0027hello world\u0027).digest(\u0027hex\u0027));\nconsole.log(\u0027task10 ok\u0027);\n","assertions":"for (const term of [\n \u0027update it once per chunk\u0027,\n \u0027snapshot the current state\u0027,\n \u0027finalizes only the clone\u0027,\n \u0027does not finalize or mutate the original hash\u0027,\n \u0027keep accumulating\u0027,\n \u002764-character lowercase hexadecimal\u0027,\n \u0027empty chunks array returns []\u0027,\n \u0027concatenated input in order\u0027\n]) {\n assert.ok(rollingSha256Hex.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nassert.deepStrictEqual(rollingSha256Hex([]), []);\nconst one = rollingSha256Hex([Buffer.from([0xff])]);\nassert.strictEqual(one.length, 1);\nassert.strictEqual(one[0].length, 64);\nassert.strictEqual(one[0], crypto.createHash(\u0027sha256\u0027).update(Buffer.from([0xff])).digest(\u0027hex\u0027));\nconsole.log(\u0027task10 assertions ok\u0027);\n","category":"api_usage"} {"id":"11","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction sha256OfHexBytes(hexStr) {\n return crypto.createHash(\u0027sha256\u0027).update(hexStr, \u0027hex\u0027).digest(\u0027hex\u0027);\n}\n\n// Fill in precise API documentation for sha256OfHexBytes.\n// The executable implementation above is the source of truth.\nsha256OfHexBytes.doc =\n","golden_completion":"`Hash the raw bytes represented by hexStr, not the ASCII characters of the hex text.\nThe implementation uses crypto.createHash(\u0027sha256\u0027).update(hexStr, \u0027hex\u0027).digest(\u0027hex\u0027), where the second argument to update is the input encoding and the argument to digest is the output encoding.\nReturn the 64-character lowercase hexadecimal SHA-256 digest for the decoded byte sequence; malformed hex follows Node\u0027s normal hex-decoding behavior rather than custom validation.`","suffix":";\n\nassert.strictEqual(typeof sha256OfHexBytes.doc, \u0027string\u0027);\nassert.ok(sha256OfHexBytes.doc.includes(\"update(hexStr, \u0027hex\u0027)\"));\nassert.ok(sha256OfHexBytes.doc.includes(\"digest(\u0027hex\u0027)\"));\nassert.ok(sha256OfHexBytes.doc.includes(\u0027not the ASCII\u0027));\n\nconst byteHash = sha256OfHexBytes(\u0027ff\u0027);\nconst asciiHash = crypto.createHash(\u0027sha256\u0027).update(\u0027ff\u0027).digest(\u0027hex\u0027);\nassert.notStrictEqual(byteHash, asciiHash);\nassert.strictEqual(byteHash, crypto.createHash(\u0027sha256\u0027).update(Buffer.from([0xff])).digest(\u0027hex\u0027));\nconsole.log(\u0027task11 ok\u0027);\n","assertions":"for (const term of [\n \u0027raw bytes represented by hexStr\u0027,\n \u0027crypto.createHash(\\\u0027sha256\\\u0027)\u0027,\n \u0027second argument to update is the input encoding\u0027,\n \u0027argument to digest is the output encoding\u0027,\n \u002764-character lowercase hexadecimal\u0027,\n \u0027decoded byte sequence\u0027,\n \u0027normal hex-decoding behavior\u0027,\n \u0027custom validation\u0027\n]) {\n assert.ok(sha256OfHexBytes.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nassert.strictEqual(sha256OfHexBytes(\u0027\u0027).length, 64);\nassert.strictEqual(sha256OfHexBytes(\u0027abcd\u0027), crypto.createHash(\u0027sha256\u0027).update(Buffer.from([0xab, 0xcd])).digest(\u0027hex\u0027));\nassert.notStrictEqual(sha256OfHexBytes(\u0027616263\u0027), crypto.createHash(\u0027sha256\u0027).update(\u0027616263\u0027).digest(\u0027hex\u0027));\nconsole.log(\u0027task11 assertions ok\u0027);\n","category":"api_usage"} {"id":"12","testsource":"devbench-api-usage","language":"javascript","prefix":"const { Buffer } = require(\u0027buffer\u0027);\n\n// Demonstrate Buffer.from\u0027s LENIENT base64 decoding.\n// Node.js Buffer.from(str, \u0027base64\u0027) silently ignores:\n// - Missing padding (no \u0027=\u0027 needed)\n// - Non-base64 characters (they are skipped)\n// - Whitespace\n//\n// This function takes a potentially malformed base64 string and returns\n// the decoded UTF-8 string, leveraging Buffer\u0027s lenient behavior.\n// It does NOT throw on invalid input.\n\n","golden_completion":"function lenientBase64Decode(input) {\n return Buffer.from(input, \u0027base64\u0027).toString(\u0027utf-8\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n\n// Standard base64 with proper padding\nassert.strictEqual(lenientBase64Decode(\u0027SGVsbG8=\u0027), \u0027Hello\u0027);\n\n// Missing padding — Buffer handles it fine\nassert.strictEqual(lenientBase64Decode(\u0027SGVsbG8\u0027), \u0027Hello\u0027);\n\n// Non-base64 characters are silently ignored\nassert.strictEqual(lenientBase64Decode(\u0027SGVs!!!bG8=\u0027), \u0027Hello\u0027);\n\n// Whitespace is ignored\nassert.strictEqual(lenientBase64Decode(\u0027SGVs bG8=\u0027), \u0027Hello\u0027);\n\n// Empty string\nassert.strictEqual(lenientBase64Decode(\u0027\u0027), \u0027\u0027);\n","assertions":"// Various forms of \u0027Hi\u0027 in base64 (SGk= or SGk)\nassert.strictEqual(lenientBase64Decode(\u0027SGk=\u0027), \u0027Hi\u0027);\nassert.strictEqual(lenientBase64Decode(\u0027SGk\u0027), \u0027Hi\u0027);\nassert.strictEqual(lenientBase64Decode(\u0027S G k\u0027), \u0027Hi\u0027);\n\n// All garbage input =\u003e empty buffer =\u003e empty string\nassert.strictEqual(lenientBase64Decode(\u0027!@#$\u0027), \u0027\u0027);\n\n// Does NOT throw\nlet threw = false;\ntry { lenientBase64Decode(\u0027!!!invalid!!!\u0027); } catch(e) { threw = true; }\nassert.strictEqual(threw, false);\n","category":"api_usage"} {"id":"13","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction timingSafeStringEqual(a, b) {\n const left = Buffer.from(a, \u0027utf8\u0027);\n const right = Buffer.from(b, \u0027utf8\u0027);\n if (left.length !== right.length) return false;\n return crypto.timingSafeEqual(left, right);\n}\n\n// Fill in precise API documentation for timingSafeStringEqual.\n// The executable implementation above is the source of truth.\ntimingSafeStringEqual.doc =\n","golden_completion":"`Compare two strings by first encoding each with Buffer.from(value, \u0027utf8\u0027), so length checks are byte-length checks rather than JavaScript character-count checks.\nReturn false before calling crypto.timingSafeEqual when the Buffer lengths differ, because timingSafeEqual requires equal byte lengths and throws for mismatched lengths.\nFor equal-length Buffers, return the boolean from crypto.timingSafeEqual; the length mismatch branch avoids the API exception but still reveals length equality.`","suffix":";\n\nassert.strictEqual(typeof timingSafeStringEqual.doc, \u0027string\u0027);\nassert.ok(timingSafeStringEqual.doc.includes(\"Buffer.from(value, \u0027utf8\u0027)\"));\nassert.ok(timingSafeStringEqual.doc.includes(\u0027crypto.timingSafeEqual\u0027));\nassert.ok(timingSafeStringEqual.doc.includes(\u0027throws\u0027));\n\nassert.strictEqual(timingSafeStringEqual(\u0027hello\u0027, \u0027hello\u0027), true);\nassert.strictEqual(timingSafeStringEqual(\u0027hello\u0027, \u0027world\u0027), false);\nassert.strictEqual(timingSafeStringEqual(\u0027short\u0027, \u0027longer\u0027), false);\nassert.throws(() =\u003e crypto.timingSafeEqual(Buffer.from(\u0027a\u0027), Buffer.from(\u0027ab\u0027)));\nconsole.log(\u0027task13 ok\u0027);\n","assertions":"for (const term of [\n \u0027byte-length checks\u0027,\n \u0027rather than JavaScript character-count checks\u0027,\n \u0027Return false before calling crypto.timingSafeEqual\u0027,\n \u0027requires equal byte lengths\u0027,\n \u0027mismatched lengths\u0027,\n \u0027equal-length Buffers\u0027,\n \u0027API exception\u0027,\n \u0027reveals length equality\u0027\n]) {\n assert.ok(timingSafeStringEqual.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nassert.strictEqual(timingSafeStringEqual(\u0027café\u0027, \u0027café\u0027), true);\nassert.strictEqual(timingSafeStringEqual(\u0027café\u0027, \u0027cafe\u0027), false);\nassert.strictEqual(Buffer.from(\u0027é\u0027, \u0027utf8\u0027).length, 2);\nassert.doesNotThrow(() =\u003e timingSafeStringEqual(\u0027\u0027, \u0027x\u0027));\nconsole.log(\u0027task13 assertions ok\u0027);\n","category":"api_usage"} {"id":"14","testsource":"devbench-api-usage","language":"javascript","prefix":"const { Buffer } = require(\u0027buffer\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction sparseZeroBuffer(size, positionMap) {\n const buf = Buffer.alloc(size);\n for (const [pos, value] of Object.entries(positionMap)) {\n buf[Number(pos)] = value;\n }\n return buf;\n}\n\n// Fill in precise API documentation for sparseZeroBuffer.\n// The executable implementation above is the source of truth.\nsparseZeroBuffer.doc =\n","golden_completion":"`Create a zero-filled Buffer of length size with Buffer.alloc(size), not Buffer.allocUnsafe, so every byte starts as 0.\nIterate Object.entries(positionMap), convert each object-key string to a numeric index with Number(pos), and assign the byte value into the Buffer.\nReturn the mutable Buffer; entries not present in positionMap remain zero, and the function performs no custom bounds or value validation beyond normal Buffer indexed assignment semantics.`","suffix":";\n\nassert.strictEqual(typeof sparseZeroBuffer.doc, \u0027string\u0027);\nassert.ok(sparseZeroBuffer.doc.includes(\u0027Buffer.alloc(size)\u0027));\nassert.ok(sparseZeroBuffer.doc.includes(\u0027Buffer.allocUnsafe\u0027));\nassert.ok(sparseZeroBuffer.doc.includes(\u0027Object.entries(positionMap)\u0027));\n\nconst b = sparseZeroBuffer(4, { 1: 0xff, 3: 0xab });\nassert.deepStrictEqual([...b], [0x00, 0xff, 0x00, 0xab]);\nassert.deepStrictEqual(sparseZeroBuffer(3, {}), Buffer.from([0, 0, 0]));\nconsole.log(\u0027task14 ok\u0027);\n","assertions":"for (const term of [\n \u0027zero-filled Buffer\u0027,\n \u0027every byte starts as 0\u0027,\n \u0027object-key string\u0027,\n \u0027Number(pos)\u0027,\n \u0027byte value\u0027,\n \u0027mutable Buffer\u0027,\n \u0027entries not present in positionMap remain zero\u0027,\n \u0027no custom bounds or value validation\u0027,\n \u0027normal Buffer indexed assignment semantics\u0027\n]) {\n assert.ok(sparseZeroBuffer.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst b2 = sparseZeroBuffer(6, { 0: 1, 5: 255 });\nassert.deepStrictEqual([...b2], [1, 0, 0, 0, 0, 255]);\nb2[1] = 9;\nassert.strictEqual(b2[1], 9);\nconsole.log(\u0027task14 assertions ok\u0027);\n","category":"api_usage"} {"id":"15","testsource":"devbench-api-usage","language":"javascript","prefix":"const { Buffer } = require(\u0027buffer\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction sortHexBytewise(hexStrings) {\n return hexStrings.slice().sort((a, b) =\u003e {\n return Buffer.compare(Buffer.from(a, \u0027hex\u0027), Buffer.from(b, \u0027hex\u0027));\n });\n}\n\n// Fill in precise API documentation for sortHexBytewise.\n// The executable implementation above is the source of truth.\nsortHexBytewise.doc =\n","golden_completion":"`Return a new sorted array by calling hexStrings.slice() before Array.prototype.sort, so the input array is not mutated.\nEach comparator call decodes both strings with Buffer.from(value, \u0027hex\u0027) and passes the Buffers to Buffer.compare, whose negative/zero/positive result is used directly by sort.\nOrdering is lexicographic over unsigned byte values, not JavaScript string order or numeric integer order; if one Buffer is a prefix of another, the shorter Buffer sorts first.`","suffix":";\n\nassert.strictEqual(typeof sortHexBytewise.doc, \u0027string\u0027);\nassert.ok(sortHexBytewise.doc.includes(\u0027hexStrings.slice()\u0027));\nassert.ok(sortHexBytewise.doc.includes(\"Buffer.from(value, \u0027hex\u0027)\"));\nassert.ok(sortHexBytewise.doc.includes(\u0027Buffer.compare\u0027));\n\nconst input = [\u0027ff\u0027, \u002700\u0027, \u00270a\u0027, \u002780\u0027];\nassert.deepStrictEqual(sortHexBytewise(input), [\u002700\u0027, \u00270a\u0027, \u002780\u0027, \u0027ff\u0027]);\nassert.deepStrictEqual(input, [\u0027ff\u0027, \u002700\u0027, \u00270a\u0027, \u002780\u0027]);\nassert.deepStrictEqual(sortHexBytewise([\u00270102\u0027, \u002701\u0027, \u00270100\u0027]), [\u002701\u0027, \u00270100\u0027, \u00270102\u0027]);\nconsole.log(\u0027task15 ok\u0027);\n","assertions":"for (const term of [\n \u0027new sorted array\u0027,\n \u0027input array is not mutated\u0027,\n \u0027comparator call decodes both strings\u0027,\n \u0027negative/zero/positive result\u0027,\n \u0027used directly by sort\u0027,\n \u0027lexicographic over unsigned byte values\u0027,\n \u0027not JavaScript string order\u0027,\n \u0027numeric integer order\u0027,\n \u0027shorter Buffer sorts first\u0027\n]) {\n assert.ok(sortHexBytewise.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst orig = [\u002710\u0027, \u00270f\u0027, \u002702\u0027];\nconst sorted = sortHexBytewise(orig);\nassert.deepStrictEqual(sorted, [\u002702\u0027, \u00270f\u0027, \u002710\u0027]);\nassert.deepStrictEqual(orig, [\u002710\u0027, \u00270f\u0027, \u002702\u0027]);\nassert.deepStrictEqual(sortHexBytewise([]), []);\nconsole.log(\u0027task15 assertions ok\u0027);\n","category":"api_usage"} {"id":"16","testsource":"devbench-api-usage","language":"javascript","prefix":"const util = require(\u0027util\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction classifyBuiltInValue(value) {\n if (util.types.isDate(value)) return \u0027date\u0027;\n if (util.types.isRegExp(value)) return \u0027regexp\u0027;\n if (util.types.isMap(value)) return \u0027map\u0027;\n if (util.types.isSet(value)) return \u0027set\u0027;\n if (util.types.isPromise(value)) return \u0027promise\u0027;\n if (util.types.isArrayBuffer(value)) return \u0027arraybuffer\u0027;\n if (util.types.isTypedArray(value)) return \u0027typedarray\u0027;\n return \u0027other\u0027;\n}\n\n// Fill in precise API documentation for classifyBuiltInValue.\n// The executable implementation above is the source of truth.\nclassifyBuiltInValue.doc =\n","golden_completion":"`Classify value using Node\u0027s util.types predicates in this exact order: isDate, isRegExp, isMap, isSet, isPromise, isArrayBuffer, then isTypedArray.\nReturn the first matching label (\u0027date\u0027, \u0027regexp\u0027, \u0027map\u0027, \u0027set\u0027, \u0027promise\u0027, \u0027arraybuffer\u0027, \u0027typedarray\u0027) or \u0027other\u0027 when none match.\nutil.types is used instead of instanceof because these checks are intended to work across vm contexts; isTypedArray matches typed array views such as Uint8Array but not ArrayBuffer itself.`","suffix":";\n\nassert.strictEqual(typeof classifyBuiltInValue.doc, \u0027string\u0027);\nassert.ok(classifyBuiltInValue.doc.includes(\u0027util.types\u0027));\nassert.ok(classifyBuiltInValue.doc.includes(\u0027isDate\u0027));\nassert.ok(classifyBuiltInValue.doc.includes(\u0027isTypedArray\u0027));\n\nassert.strictEqual(classifyBuiltInValue(new Date()), \u0027date\u0027);\nassert.strictEqual(classifyBuiltInValue(/x/), \u0027regexp\u0027);\nassert.strictEqual(classifyBuiltInValue(new Map()), \u0027map\u0027);\nassert.strictEqual(classifyBuiltInValue(new Set()), \u0027set\u0027);\nassert.strictEqual(classifyBuiltInValue(Promise.resolve()), \u0027promise\u0027);\nassert.strictEqual(classifyBuiltInValue(new ArrayBuffer(2)), \u0027arraybuffer\u0027);\nassert.strictEqual(classifyBuiltInValue(new Uint8Array(2)), \u0027typedarray\u0027);\nassert.strictEqual(classifyBuiltInValue(null), \u0027other\u0027);\nconsole.log(\u0027task16 ok\u0027);\n","assertions":"for (const term of [\n \u0027exact order\u0027,\n \u0027isRegExp\u0027,\n \u0027isMap\u0027,\n \u0027isSet\u0027,\n \u0027isPromise\u0027,\n \u0027first matching label\u0027,\n \u0027instead of instanceof\u0027,\n \u0027across vm contexts\u0027,\n \u0027not ArrayBuffer itself\u0027\n]) {\n assert.ok(classifyBuiltInValue.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nassert.strictEqual(classifyBuiltInValue(new Int16Array(1)), \u0027typedarray\u0027);\nassert.strictEqual(classifyBuiltInValue(new DataView(new ArrayBuffer(4))), \u0027other\u0027);\nassert.strictEqual(classifyBuiltInValue([]), \u0027other\u0027);\nconsole.log(\u0027task16 assertions ok\u0027);\n","category":"api_usage"} {"id":"17","testsource":"devbench-api-usage","language":"javascript","prefix":"const util = require(\u0027util\u0027);\nconst assert = require(\u0027assert\u0027);\n\nclass SecretBox {\n constructor(value) { this._value = value; }\n getValue() { return this._value; }\n [util.inspect.custom](depth, options, inspect) {\n return \u0027SecretBox [REDACTED]\u0027;\n }\n}\n\n// Fill in precise API documentation for SecretBox.\n// The executable implementation above is the source of truth.\nSecretBox.doc =\n","golden_completion":"`SecretBox stores the original value on _value and returns it unchanged from getValue().\nIt defines a method keyed by util.inspect.custom, the same symbol as Symbol.for(\u0027nodejs.util.inspect.custom\u0027), so util.inspect(instance) uses that hook instead of default property inspection.\nThe custom inspect hook receives depth, options, and inspect arguments but ignores them, returning the fixed string \u0027SecretBox [REDACTED]\u0027; this redacts display output only and does not remove or encrypt _value.`","suffix":";\n\nassert.strictEqual(typeof SecretBox.doc, \u0027string\u0027);\nassert.ok(SecretBox.doc.includes(\u0027util.inspect.custom\u0027));\nassert.ok(SecretBox.doc.includes(\"Symbol.for(\u0027nodejs.util.inspect.custom\u0027)\"));\nassert.ok(SecretBox.doc.includes(\u0027SecretBox [REDACTED]\u0027));\n\nconst box = new SecretBox(\u0027hidden\u0027);\nassert.strictEqual(box.getValue(), \u0027hidden\u0027);\nassert.strictEqual(util.inspect(box), \u0027SecretBox [REDACTED]\u0027);\nassert.ok(!util.inspect(box).includes(\u0027hidden\u0027));\nconsole.log(\u0027task17 ok\u0027);\n","assertions":"for (const term of [\n \u0027stores the original value on _value\u0027,\n \u0027returns it unchanged from getValue()\u0027,\n \u0027uses that hook instead of default property inspection\u0027,\n \u0027depth, options, and inspect arguments\u0027,\n \u0027ignores them\u0027,\n \u0027redacts display output only\u0027,\n \u0027does not remove or encrypt _value\u0027\n]) {\n assert.ok(SecretBox.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst b2 = new SecretBox({ token: \u0027abc\u0027 });\nassert.deepStrictEqual(b2.getValue(), { token: \u0027abc\u0027 });\nassert.strictEqual(b2[util.inspect.custom](), \u0027SecretBox [REDACTED]\u0027);\nassert.strictEqual(Object.prototype.hasOwnProperty.call(b2, \u0027_value\u0027), true);\nconsole.log(\u0027task17 assertions ok\u0027);\n","category":"api_usage"} {"id":"18","testsource":"devbench-api-usage","language":"javascript","prefix":"const path = require(\u0027path\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction describePosixRelative(from, to) {\n const relative = path.posix.relative(from, to);\n const segments = relative === \u0027\u0027 ? [] : relative.split(\u0027/\u0027);\n const depth = segments.filter(segment =\u003e segment === \u0027..\u0027).length;\n return { relative, segments, depth };\n}\n\n// Fill in precise API documentation for describePosixRelative.\n// The executable implementation above is the source of truth.\ndescribePosixRelative.doc =\n","golden_completion":"`Compute the POSIX relative path string with path.posix.relative(from, to), so separators are forward slashes regardless of the host platform.\nSplit the non-empty relative string on \u0027/\u0027 into segments, but use [] when path.posix.relative returns \u0027\u0027 for identical paths.\nDepth is the count of segments exactly equal to \u0027..\u0027; the function performs lexical path computation only and does not access the filesystem or use process.cwd().`","suffix":";\n\nassert.strictEqual(typeof describePosixRelative.doc, \u0027string\u0027);\nassert.ok(describePosixRelative.doc.includes(\u0027path.posix.relative(from, to)\u0027));\nassert.ok(describePosixRelative.doc.includes(\"returns \u0027\u0027 for identical paths\"));\nassert.ok(describePosixRelative.doc.includes(\u0027forward slashes\u0027));\n\nassert.deepStrictEqual(describePosixRelative(\u0027/a/b\u0027, \u0027/a/c\u0027), { relative: \u0027../c\u0027, segments: [\u0027..\u0027, \u0027c\u0027], depth: 1 });\nassert.deepStrictEqual(describePosixRelative(\u0027/a/b\u0027, \u0027/a/b\u0027), { relative: \u0027\u0027, segments: [], depth: 0 });\nassert.deepStrictEqual(describePosixRelative(\u0027/a/b/c\u0027, \u0027/a\u0027), { relative: \u0027../..\u0027, segments: [\u0027..\u0027, \u0027..\u0027], depth: 2 });\nconsole.log(\u0027task18 ok\u0027);\n","assertions":"for (const term of [\n \u0027POSIX relative path string\u0027,\n \u0027regardless of the host platform\u0027,\n \"Split the non-empty relative string on \u0027/\u0027\",\n \u0027use []\u0027,\n \u0027count of segments exactly equal to \\\u0027..\\\u0027\u0027,\n \u0027lexical path computation only\u0027,\n \u0027does not access the filesystem\u0027,\n \u0027process.cwd()\u0027\n]) {\n assert.ok(describePosixRelative.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nassert.deepStrictEqual(describePosixRelative(\u0027/a\u0027, \u0027/a/b/c\u0027), { relative: \u0027b/c\u0027, segments: [\u0027b\u0027, \u0027c\u0027], depth: 0 });\nassert.deepStrictEqual(describePosixRelative(\u0027/x/y\u0027, \u0027/x/y/../z\u0027), { relative: \u0027../z\u0027, segments: [\u0027..\u0027, \u0027z\u0027], depth: 1 });\nconsole.log(\u0027task18 assertions ok\u0027);\n","category":"api_usage"} {"id":"19","testsource":"devbench-api-usage","language":"javascript","prefix":"const querystring = require(\u0027querystring\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction legacySemiColonQuery(obj) {\n return querystring.stringify(obj, \u0027;\u0027, \u0027:\u0027, {\n encodeURIComponent: s =\u003e s\n });\n}\n\n// Fill in precise API documentation for legacySemiColonQuery.\n// The executable implementation above is the source of truth.\nlegacySemiColonQuery.doc =\n","golden_completion":"`Format obj with Node\u0027s legacy querystring.stringify(obj, \u0027;\u0027, \u0027:\u0027, { encodeURIComponent: s =\u003e s }).\nThe second argument \u0027;\u0027 is the pair separator, the third argument \u0027:\u0027 is the key/value separator, and the custom encodeURIComponent option is a no-op identity encoder.\nBecause encoding is disabled, spaces and reserved characters such as \u0026, =, and % are kept literally; array values are emitted as repeated key:value pairs in property iteration order.`","suffix":";\n\nassert.strictEqual(typeof legacySemiColonQuery.doc, \u0027string\u0027);\nassert.ok(legacySemiColonQuery.doc.includes(\u0027querystring.stringify\u0027));\nassert.ok(legacySemiColonQuery.doc.includes(\"\u0027;\u0027\"));\nassert.ok(legacySemiColonQuery.doc.includes(\"\u0027:\u0027\"));\n\nassert.strictEqual(legacySemiColonQuery({ a: \u00271\u0027, b: \u0027hello world\u0027 }), \u0027a:1;b:hello world\u0027);\nassert.strictEqual(legacySemiColonQuery({ q: \u0027a\u0026b=c\u0027 }), \u0027q:a\u0026b=c\u0027);\nassert.strictEqual(legacySemiColonQuery({ a: [\u00271\u0027, \u00272\u0027], b: \u0027x y\u0027 }), \u0027a:1;a:2;b:x y\u0027);\nconsole.log(\u0027task19 ok\u0027);\n","assertions":"for (const term of [\n \u0027legacy querystring.stringify\u0027,\n \u0027second argument\u0027,\n \u0027pair separator\u0027,\n \u0027third argument\u0027,\n \u0027key/value separator\u0027,\n \u0027no-op identity encoder\u0027,\n \u0027encoding is disabled\u0027,\n \u0027kept literally\u0027,\n \u0027repeated key:value pairs\u0027,\n \u0027property iteration order\u0027\n]) {\n assert.ok(legacySemiColonQuery.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nassert.strictEqual(legacySemiColonQuery({}), \u0027\u0027);\nassert.strictEqual(legacySemiColonQuery({ pct: \u0027a%b\u0027, eq: \u0027x=y\u0027 }), \u0027pct:a%b;eq:x=y\u0027);\nconsole.log(\u0027task19 assertions ok\u0027);\n","category":"api_usage"} {"id":"20","testsource":"devbench-api-usage","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction deepStrictReport(actual, expected) {\n try {\n assert.deepStrictEqual(actual, expected);\n return { passes: true, name: null, code: null, message: \u0027equal\u0027 };\n } catch (error) {\n return { passes: false, name: error.name, code: error.code, message: error.message };\n }\n}\n\n// Fill in precise API documentation for deepStrictReport.\n// The executable implementation above is the source of truth.\ndeepStrictReport.doc =\n","golden_completion":"`Call assert.deepStrictEqual(actual, expected) and return { passes: true, name: null, code: null, message: \u0027equal\u0027 } when it does not throw.\nWhen Node throws an AssertionError, catch it and return passes: false plus error.name, error.code, and error.message instead of rethrowing.\nDocument Node deepStrictEqual semantics used here: primitive comparison is based on Object.is (so NaN equals NaN and -0 differs from +0), object prototypes and own enumerable properties are compared, and Map/Set contents are compared.`","suffix":";\n\nassert.strictEqual(typeof deepStrictReport.doc, \u0027string\u0027);\nassert.ok(deepStrictReport.doc.includes(\u0027assert.deepStrictEqual(actual, expected)\u0027));\nassert.ok(deepStrictReport.doc.includes(\u0027AssertionError\u0027));\nassert.ok(deepStrictReport.doc.includes(\u0027Object.is\u0027));\n\nassert.deepStrictEqual(deepStrictReport(NaN, NaN), { passes: true, name: null, code: null, message: \u0027equal\u0027 });\nassert.strictEqual(deepStrictReport(-0, +0).passes, false);\nassert.strictEqual(deepStrictReport({ a: 1 }, { a: 1 }).passes, true);\nclass A { constructor() { this.x = 1; } }\nclass B { constructor() { this.x = 1; } }\nassert.strictEqual(deepStrictReport(new A(), new B()).passes, false);\nconsole.log(\u0027task20 ok\u0027);\n","assertions":"for (const term of [\n \u0027does not throw\u0027,\n \u0027instead of rethrowing\u0027,\n \u0027primitive comparison is based on Object.is\u0027,\n \u0027NaN equals NaN\u0027,\n \u0027-0 differs from +0\u0027,\n \u0027object prototypes\u0027,\n \u0027own enumerable properties\u0027,\n \u0027Map/Set contents\u0027,\n \u0027error.name, error.code, and error.message\u0027\n]) {\n assert.ok(deepStrictReport.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nassert.strictEqual(deepStrictReport(new Map([[1, \u0027a\u0027]]), new Map([[1, \u0027a\u0027]])).passes, true);\nconst fail = deepStrictReport({ a: 1 }, { a: 2 });\nassert.strictEqual(fail.passes, false);\nassert.strictEqual(fail.name, \u0027AssertionError\u0027);\nassert.strictEqual(fail.code, \u0027ERR_ASSERTION\u0027);\nconsole.log(\u0027task20 assertions ok\u0027);\n","category":"api_usage"} {"id":"21","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction encryptAes128Gcm(plaintext, key, iv, aad) {\n const cipher = crypto.createCipheriv(\u0027aes-128-gcm\u0027, key, iv);\n cipher.setAAD(aad);\n let ciphertext = cipher.update(plaintext, \u0027utf8\u0027, \u0027hex\u0027);\n ciphertext += cipher.final(\u0027hex\u0027);\n return { ciphertext, authTag: cipher.getAuthTag().toString(\u0027hex\u0027), iv: iv.toString(\u0027hex\u0027) };\n}\n\n// Fill in precise API documentation for encryptAes128Gcm.\n// The executable implementation above is the source of truth.\nencryptAes128Gcm.doc =\n","golden_completion":"`Encrypt plaintext with crypto.createCipheriv(\u0027aes-128-gcm\u0027, key, iv), where key is a 16-byte AES-128 key and iv is the caller-supplied 12-byte GCM nonce.\nCall cipher.setAAD(aad) before update/final so aad is authenticated but not encrypted, then encode ciphertext by cipher.update(plaintext, \u0027utf8\u0027, \u0027hex\u0027) plus cipher.final(\u0027hex\u0027).\nAfter final(), call cipher.getAuthTag() and return its 16-byte authentication tag as 32 hex characters, along with the ciphertext hex string and iv.toString(\u0027hex\u0027).`","suffix":";\n\nassert.strictEqual(typeof encryptAes128Gcm.doc, \u0027string\u0027);\nassert.ok(encryptAes128Gcm.doc.includes(\"crypto.createCipheriv(\u0027aes-128-gcm\u0027\"));\nassert.ok(encryptAes128Gcm.doc.includes(\u0027cipher.setAAD(aad)\u0027));\nassert.ok(encryptAes128Gcm.doc.includes(\u0027cipher.getAuthTag()\u0027));\n\nconst key = Buffer.alloc(16, 1);\nconst iv = Buffer.alloc(12, 2);\nconst aad = Buffer.from(\u0027metadata\u0027);\nconst enc = encryptAes128Gcm(\u0027secret text\u0027, key, iv, aad);\nassert.strictEqual(enc.iv, iv.toString(\u0027hex\u0027));\nassert.strictEqual(enc.authTag.length, 32);\nconst decipher = crypto.createDecipheriv(\u0027aes-128-gcm\u0027, key, Buffer.from(enc.iv, \u0027hex\u0027));\ndecipher.setAAD(aad);\ndecipher.setAuthTag(Buffer.from(enc.authTag, \u0027hex\u0027));\nlet plain = decipher.update(enc.ciphertext, \u0027hex\u0027, \u0027utf8\u0027);\nplain += decipher.final(\u0027utf8\u0027);\nassert.strictEqual(plain, \u0027secret text\u0027);\nconsole.log(\u0027task21 ok\u0027);\n","assertions":"for (const term of [\n \u002716-byte AES-128 key\u0027,\n \u002712-byte GCM nonce\u0027,\n \u0027before update/final\u0027,\n \u0027authenticated but not encrypted\u0027,\n \"cipher.update(plaintext, \u0027utf8\u0027, \u0027hex\u0027)\",\n \"cipher.final(\u0027hex\u0027)\",\n \u0027After final()\u0027,\n \u002716-byte authentication tag\u0027,\n \u002732 hex characters\u0027,\n \"iv.toString(\u0027hex\u0027)\"\n]) {\n assert.ok(encryptAes128Gcm.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst bad = crypto.createDecipheriv(\u0027aes-128-gcm\u0027, key, Buffer.from(enc.iv, \u0027hex\u0027));\nbad.setAAD(Buffer.from(\u0027wrong\u0027));\nbad.setAuthTag(Buffer.from(enc.authTag, \u0027hex\u0027));\nassert.throws(() =\u003e { bad.update(enc.ciphertext, \u0027hex\u0027, \u0027utf8\u0027); bad.final(\u0027utf8\u0027); });\nconsole.log(\u0027task21 assertions ok\u0027);\n","category":"api_usage"} {"id":"22","testsource":"devbench-api-usage","language":"javascript","prefix":"const { Buffer } = require(\u0027buffer\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction concatToTarget(buffers, targetLength) {\n const originalLength = buffers.reduce((sum, buf) =\u003e sum + buf.length, 0);\n const buffer = Buffer.concat(buffers, targetLength);\n return {\n buffer,\n originalLength,\n truncated: targetLength \u003c originalLength,\n zeroPadded: targetLength \u003e originalLength\n };\n}\n\n// Fill in precise API documentation for concatToTarget.\n// The executable implementation above is the source of truth.\nconcatToTarget.doc =\n","golden_completion":"`Sum the input Buffer lengths to compute originalLength, then call Buffer.concat(buffers, targetLength) with an explicit totalLength.\nNode returns a Buffer whose length is exactly targetLength: if targetLength is less than originalLength, bytes after that length are truncated; if it is greater, extra bytes are zero-filled with 0x00.\nReturn the concatenated Buffer plus booleans truncated and zeroPadded computed from targetLength compared with originalLength; the input Buffers themselves are not mutated.`","suffix":";\n\nassert.strictEqual(typeof concatToTarget.doc, \u0027string\u0027);\nassert.ok(concatToTarget.doc.includes(\u0027Buffer.concat(buffers, targetLength)\u0027));\nassert.ok(concatToTarget.doc.includes(\u0027truncated\u0027));\nassert.ok(concatToTarget.doc.includes(\u0027zero-filled\u0027));\n\nconst exact = concatToTarget([Buffer.from(\u0027AB\u0027), Buffer.from(\u0027CD\u0027)], 4);\nassert.strictEqual(exact.buffer.toString(), \u0027ABCD\u0027);\nassert.strictEqual(exact.truncated, false);\nassert.strictEqual(exact.zeroPadded, false);\nconst short = concatToTarget([Buffer.from(\u0027Hello\u0027), Buffer.from(\u0027 World\u0027)], 5);\nassert.strictEqual(short.buffer.toString(), \u0027Hello\u0027);\nassert.strictEqual(short.truncated, true);\nconst long = concatToTarget([Buffer.from(\u0027Hi\u0027)], 5);\nassert.strictEqual(long.buffer.length, 5);\nassert.strictEqual(long.buffer[2], 0);\nassert.strictEqual(long.zeroPadded, true);\nconsole.log(\u0027task22 ok\u0027);\n","assertions":"for (const term of [\n \u0027explicit totalLength\u0027,\n \u0027length is exactly targetLength\u0027,\n \u0027less than originalLength\u0027,\n \u0027bytes after that length are truncated\u0027,\n \u0027greater\u0027,\n \u0027extra bytes are zero-filled with 0x00\u0027,\n \u0027computed from targetLength compared with originalLength\u0027,\n \u0027input Buffers themselves are not mutated\u0027\n]) {\n assert.ok(concatToTarget.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst a = Buffer.from(\u0027A\u0027);\nconst b = Buffer.from(\u0027BC\u0027);\nconst r = concatToTarget([a, b], 4);\nassert.deepStrictEqual([...r.buffer], [65, 66, 67, 0]);\nassert.strictEqual(r.originalLength, 3);\nassert.strictEqual(a.toString(), \u0027A\u0027);\nassert.strictEqual(b.toString(), \u0027BC\u0027);\nconsole.log(\u0027task22 assertions ok\u0027);\n","category":"api_usage"} {"id":"23","testsource":"devbench-api-usage","language":"javascript","prefix":"const { StringDecoder } = require(\u0027string_decoder\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction decodeUtf8Chunks(chunks, encoding = \u0027utf8\u0027) {\n const decoder = new StringDecoder(encoding);\n let text = \u0027\u0027;\n let hadIncomplete = false;\n for (let i = 0; i \u003c chunks.length; i++) {\n const decoded = decoder.write(chunks[i]);\n text += decoded;\n if (i \u003c chunks.length - 1 \u0026\u0026 decoded.length \u003c chunks[i].length) hadIncomplete = true;\n }\n text += decoder.end();\n return { text, chunksProcessed: chunks.length, hadIncomplete };\n}\n\n// Fill in precise API documentation for decodeUtf8Chunks.\n// The executable implementation above is the source of truth.\ndecodeUtf8Chunks.doc =\n","golden_completion":"`Create new StringDecoder(encoding) and feed each Buffer chunk through decoder.write(chunk), appending the decoded string output.\nStringDecoder preserves incomplete multi-byte UTF-8 sequences across chunk boundaries instead of emitting replacement characters the way independent Buffer.toString(\u0027utf8\u0027) calls can.\nCall decoder.end() after the loop to flush any buffered bytes, return chunksProcessed as chunks.length, and set hadIncomplete when a non-final chunk produced fewer decoded characters than its byte length.`","suffix":";\n\nassert.strictEqual(typeof decodeUtf8Chunks.doc, \u0027string\u0027);\nassert.ok(decodeUtf8Chunks.doc.includes(\u0027new StringDecoder(encoding)\u0027));\nassert.ok(decodeUtf8Chunks.doc.includes(\u0027decoder.write(chunk)\u0027));\nassert.ok(decodeUtf8Chunks.doc.includes(\u0027decoder.end()\u0027));\n\nconst ascii = decodeUtf8Chunks([Buffer.from(\u0027Hello\u0027), Buffer.from(\u0027 World\u0027)]);\nassert.deepStrictEqual(ascii, { text: \u0027Hello World\u0027, chunksProcessed: 2, hadIncomplete: false });\nconst euro = Buffer.from(\u0027€\u0027);\nconst split = decodeUtf8Chunks([Buffer.concat([Buffer.from(\u0027Price \u0027), euro.subarray(0, 2)]), Buffer.concat([euro.subarray(2), Buffer.from(\u0027!\u0027)])]);\nassert.strictEqual(split.text, \u0027Price €!\u0027);\nassert.strictEqual(split.hadIncomplete, true);\nconsole.log(\u0027task23 ok\u0027);\n","assertions":"for (const term of [\n \u0027incomplete multi-byte UTF-8 sequences\u0027,\n \u0027across chunk boundaries\u0027,\n \u0027instead of emitting replacement characters\u0027,\n \"independent Buffer.toString(\u0027utf8\u0027) calls\",\n \u0027flush any buffered bytes\u0027,\n \u0027chunks.length\u0027,\n \u0027non-final chunk\u0027,\n \u0027fewer decoded characters than its byte length\u0027\n]) {\n assert.ok(decodeUtf8Chunks.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst cafe = Buffer.from(\u0027café\u0027);\nconst r = decodeUtf8Chunks([cafe.subarray(0, 4), cafe.subarray(4)]);\nassert.strictEqual(r.text, \u0027café\u0027);\nassert.strictEqual(r.chunksProcessed, 2);\nassert.strictEqual(r.hadIncomplete, true);\nassert.deepStrictEqual(decodeUtf8Chunks([]), { text: \u0027\u0027, chunksProcessed: 0, hadIncomplete: false });\nconsole.log(\u0027task23 assertions ok\u0027);\n","category":"api_usage"} {"id":"24","testsource":"devbench-api-usage","language":"javascript","prefix":"const { URL, URLSearchParams } = require(\u0027url\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Build a function that merges query parameters from two URL strings.\n// Rules:\n// 1. Base URL provides the origin, pathname, and initial params\n// 2. Override URL provides additional params to merge\n// 3. If a param exists in BOTH, use the OVERRIDE value(s)\n// 4. Multi-value params (same key appears multiple times) are preserved as arrays\n// 5. Return { href: string, params: Object } where params maps each key to\n// a single string (if one value) or array of strings (if multiple values)\n// 6. The returned href must have params sorted alphabetically by key\n\n","golden_completion":"function mergeURLParams(baseUrl, overrideUrl) {\n const base = new URL(baseUrl);\n const override = new URL(overrideUrl);\n const merged = new URLSearchParams();\n const overrideKeys = new Set();\n for (const [key] of override.searchParams) overrideKeys.add(key);\n for (const [key, value] of base.searchParams) {\n if (!overrideKeys.has(key)) merged.append(key, value);\n }\n for (const [key, value] of override.searchParams) merged.append(key, value);\n merged.sort();\n const result = new URL(base.origin + base.pathname);\n result.search = merged.toString();\n const params = {};\n for (const key of new Set(merged.keys())) {\n const vals = merged.getAll(key);\n params[key] = vals.length === 1 ? vals[0] : vals;\n }\n return { href: result.href, params };\n}\n\n","suffix":"// Basic merge\nconst r1 = mergeURLParams(\n \u0027https://example.com/path?a=1\u0026b=2\u0027,\n \u0027https://other.com/?b=3\u0026c=4\u0027\n);\nassert.strictEqual(r1.params.a, \u00271\u0027);\nassert.strictEqual(r1.params.b, \u00273\u0027); // overridden\nassert.strictEqual(r1.params.c, \u00274\u0027);\nassert.ok(r1.href.startsWith(\u0027https://example.com/path\u0027));\n\n// Multi-value params in override\nconst r2 = mergeURLParams(\n \u0027https://example.com/?x=1\u0027,\n \u0027https://x.com/?y=a\u0026y=b\u0027\n);\nassert.strictEqual(r2.params.x, \u00271\u0027);\nassert.deepStrictEqual(r2.params.y, [\u0027a\u0027, \u0027b\u0027]);\n\n// Override replaces ALL values for that key\nconst r3 = mergeURLParams(\n \u0027https://example.com/?tag=old1\u0026tag=old2\u0027,\n \u0027https://x.com/?tag=new1\u0027\n);\nassert.strictEqual(r3.params.tag, \u0027new1\u0027); // single value, not array\n\n// Params should be sorted in href\nconst r4 = mergeURLParams(\n \u0027https://example.com/?z=1\u0026a=2\u0027,\n \u0027https://x.com/?m=3\u0027\n);\nconst r4url = new URL(r4.href);\nconst r4keys = [...r4url.searchParams.keys()];\nassert.deepStrictEqual(r4keys, [\u0027a\u0027, \u0027m\u0027, \u0027z\u0027]);\nconsole.log(\u0027Task 24 suffix passed\u0027);\n","assertions":"// No overlap\nconst r5 = mergeURLParams(\n \u0027https://example.com/?a=1\u0027,\n \u0027https://x.com/?b=2\u0027\n);\nassert.strictEqual(r5.params.a, \u00271\u0027);\nassert.strictEqual(r5.params.b, \u00272\u0027);\n\n// Empty base params\nconst r6 = mergeURLParams(\n \u0027https://example.com/page\u0027,\n \u0027https://x.com/?foo=bar\u0027\n);\nassert.strictEqual(r6.params.foo, \u0027bar\u0027);\nassert.ok(r6.href.includes(\u0027foo=bar\u0027));\n\n// Empty override params\nconst r7 = mergeURLParams(\n \u0027https://example.com/?keep=yes\u0027,\n \u0027https://x.com/\u0027\n);\nassert.strictEqual(r7.params.keep, \u0027yes\u0027);\n\n// Special characters in params (URL encoding)\nconst r8 = mergeURLParams(\n \u0027https://example.com/?msg=hello+world\u0027,\n \u0027https://x.com/?name=John%20Doe\u0027\n);\nassert.strictEqual(r8.params.msg, \u0027hello world\u0027);\nassert.strictEqual(r8.params.name, \u0027John Doe\u0027);\nconsole.log(\u0027Task 24 assertions passed\u0027);\n","category":"api_usage"} {"id":"25","testsource":"devbench-api-usage","language":"javascript","prefix":"const util = require(\u0027util\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Write a function that classifies a value into one of these categories\n// using util.types functions:\n// \u0027promise\u0027, \u0027generator\u0027, \u0027generatorFunction\u0027, \u0027asyncFunction\u0027,\n// \u0027map\u0027, \u0027set\u0027, \u0027date\u0027, \u0027regexp\u0027, \u0027proxy\u0027, \u0027typedArray\u0027, \u0027other\u0027\n//\n// The function should check types IN ORDER (first match wins):\n// 1. Proxy (util.types.isProxy)\n// 2. Promise (util.types.isPromise)\n// 3. GeneratorFunction (util.types.isGeneratorFunction)\n// 4. AsyncFunction (util.types.isAsyncFunction)\n// 5. Map (util.types.isMap)\n// 6. Set (util.types.isSet)\n// 7. Date (util.types.isDate)\n// 8. RegExp (util.types.isRegExp)\n// 9. TypedArray (util.types.isTypedArray)\n// 10. \u0027other\u0027\n\n","golden_completion":"function classifyValue(value) {\n if (util.types.isProxy(value)) return \u0027proxy\u0027;\n if (util.types.isPromise(value)) return \u0027promise\u0027;\n if (util.types.isGeneratorFunction(value)) return \u0027generatorFunction\u0027;\n if (util.types.isAsyncFunction(value)) return \u0027asyncFunction\u0027;\n if (util.types.isMap(value)) return \u0027map\u0027;\n if (util.types.isSet(value)) return \u0027set\u0027;\n if (util.types.isDate(value)) return \u0027date\u0027;\n if (util.types.isRegExp(value)) return \u0027regexp\u0027;\n if (util.types.isTypedArray(value)) return \u0027typedArray\u0027;\n return \u0027other\u0027;\n}\n\n","suffix":"// Basic type checks\nassert.strictEqual(classifyValue(Promise.resolve()), \u0027promise\u0027);\nassert.strictEqual(classifyValue(function*() {}), \u0027generatorFunction\u0027);\nassert.strictEqual(classifyValue(async function() {}), \u0027asyncFunction\u0027);\nassert.strictEqual(classifyValue(new Map()), \u0027map\u0027);\nassert.strictEqual(classifyValue(new Set()), \u0027set\u0027);\nassert.strictEqual(classifyValue(new Date()), \u0027date\u0027);\nassert.strictEqual(classifyValue(/test/), \u0027regexp\u0027);\nassert.strictEqual(classifyValue(new Uint8Array()), \u0027typedArray\u0027);\nassert.strictEqual(classifyValue(42), \u0027other\u0027);\nassert.strictEqual(classifyValue(\u0027hello\u0027), \u0027other\u0027);\nassert.strictEqual(classifyValue(null), \u0027other\u0027);\nconsole.log(\u0027Task 25 suffix passed\u0027);\n","assertions":"// Proxy wins over underlying type (proxy of a map -\u003e \u0027proxy\u0027)\nconst proxyMap = new Proxy(new Map(), {});\nassert.strictEqual(classifyValue(proxyMap), \u0027proxy\u0027);\n\n// Different TypedArray types\nassert.strictEqual(classifyValue(new Float64Array(3)), \u0027typedArray\u0027);\nassert.strictEqual(classifyValue(new Int32Array(2)), \u0027typedArray\u0027);\nassert.strictEqual(classifyValue(new BigUint64Array(1)), \u0027typedArray\u0027);\n\n// Regular functions are \u0027other\u0027\nassert.strictEqual(classifyValue(function() {}), \u0027other\u0027);\nassert.strictEqual(classifyValue(() =\u003e {}), \u0027other\u0027);\n\n// Arrays and plain objects are \u0027other\u0027\nassert.strictEqual(classifyValue([1,2,3]), \u0027other\u0027);\nassert.strictEqual(classifyValue({}), \u0027other\u0027);\nassert.strictEqual(classifyValue(undefined), \u0027other\u0027);\nconsole.log(\u0027Task 25 assertions passed\u0027);\n","category":"api_usage"} {"id":"26","testsource":"devbench-api-usage","language":"javascript","prefix":"const zlib = require(\u0027zlib\u0027);\nconst assert = require(\u0027assert\u0027);\n\nfunction brotliTextSummary(text, quality = zlib.constants.BROTLI_MAX_QUALITY) {\n const input = Buffer.from(text, \u0027utf8\u0027);\n const compressed = zlib.brotliCompressSync(input, {\n params: {\n [zlib.constants.BROTLI_PARAM_QUALITY]: quality,\n [zlib.constants.BROTLI_PARAM_MODE]: zlib.constants.BROTLI_MODE_TEXT\n }\n });\n return {\n compressed,\n originalSize: input.length,\n compressedSize: compressed.length,\n ratio: compressed.length / input.length,\n quality\n };\n}\n\n// Fill in precise API documentation for brotliTextSummary.\n// The executable implementation above is the source of truth.\nbrotliTextSummary.doc =\n","golden_completion":"`Encode text as UTF-8 bytes with Buffer.from(text, \u0027utf8\u0027), then call zlib.brotliCompressSync(input, { params }) and return the compressed Buffer plus size metadata.\nThe params object uses computed keys [zlib.constants.BROTLI_PARAM_QUALITY] and [zlib.constants.BROTLI_PARAM_MODE], defaulting quality to zlib.constants.BROTLI_MAX_QUALITY and setting mode to zlib.constants.BROTLI_MODE_TEXT.\noriginalSize is the UTF-8 byte length, compressedSize is compressed.length, ratio is compressed.length / input.length, and quality echoes the supplied or default quality value.`","suffix":";\n\nassert.strictEqual(typeof brotliTextSummary.doc, \u0027string\u0027);\nassert.ok(brotliTextSummary.doc.includes(\u0027zlib.brotliCompressSync\u0027));\nassert.ok(brotliTextSummary.doc.includes(\u0027BROTLI_PARAM_QUALITY\u0027));\nassert.ok(brotliTextSummary.doc.includes(\u0027BROTLI_MODE_TEXT\u0027));\n\nconst text = \u0027The quick brown fox jumps over the lazy dog. \u0027.repeat(100);\nconst high = brotliTextSummary(text);\nassert.ok(high.compressed instanceof Buffer);\nassert.strictEqual(high.originalSize, Buffer.byteLength(text, \u0027utf8\u0027));\nassert.strictEqual(high.compressedSize, high.compressed.length);\nassert.strictEqual(high.quality, zlib.constants.BROTLI_MAX_QUALITY);\nassert.strictEqual(zlib.brotliDecompressSync(high.compressed).toString(\u0027utf8\u0027), text);\nconsole.log(\u0027task26 ok\u0027);\n","assertions":"for (const term of [\n \"Buffer.from(text, \u0027utf8\u0027)\",\n \u0027compressed Buffer\u0027,\n \u0027size metadata\u0027,\n \u0027computed keys\u0027,\n \u0027[zlib.constants.BROTLI_PARAM_QUALITY]\u0027,\n \u0027[zlib.constants.BROTLI_PARAM_MODE]\u0027,\n \u0027defaulting quality to zlib.constants.BROTLI_MAX_QUALITY\u0027,\n \u0027UTF-8 byte length\u0027,\n \u0027compressed.length / input.length\u0027,\n \u0027echoes the supplied or default quality value\u0027\n]) {\n assert.ok(brotliTextSummary.doc.includes(term), \u0027doc missing \u0027 + term);\n}\nconst low = brotliTextSummary(text, zlib.constants.BROTLI_MIN_QUALITY);\nassert.strictEqual(low.quality, zlib.constants.BROTLI_MIN_QUALITY);\nassert.strictEqual(zlib.brotliDecompressSync(low.compressed).toString(\u0027utf8\u0027), text);\nconst utf = brotliTextSummary(\u0027éééé\u0027);\nassert.strictEqual(utf.originalSize, 8);\nconsole.log(\u0027task26 assertions ok\u0027);\n","category":"api_usage"} {"id":"27","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Write a function that generates an array of n cryptographically secure\n// random integers in the range [min, max) using crypto.randomInt.\n// Also compute basic statistics: { values: number[], min: number, max: number, allInRange: boolean }\n// NOTE: crypto.randomInt(min, max) returns integers where min is INCLUSIVE\n// and max is EXCLUSIVE (like Python\u0027s random.randint vs randrange).\n\n","golden_completion":"function generateSecureInts(n, min, max) {\n const values = [];\n for (let i = 0; i \u003c n; i++) {\n values.push(crypto.randomInt(min, max));\n }\n const actualMin = Math.min(...values);\n const actualMax = Math.max(...values);\n const allInRange = values.every(v =\u003e v \u003e= min \u0026\u0026 v \u003c max);\n return { values, min: actualMin, max: actualMax, allInRange };\n}\n\n","suffix":"// Generate 1000 random integers in [0, 10)\nconst r1 = generateSecureInts(1000, 0, 10);\nassert.strictEqual(r1.values.length, 1000);\nassert.strictEqual(r1.allInRange, true);\nassert.ok(r1.min \u003e= 0);\nassert.ok(r1.max \u003c= 9); // max is exclusive, so actual max should be at most 9\nassert.ok(r1.max \u003e= 7, \u0027With 1000 samples, max should be close to 9\u0027);\n\n// Generate in [100, 105)\nconst r2 = generateSecureInts(500, 100, 105);\nassert.strictEqual(r2.allInRange, true);\nassert.ok(r2.min \u003e= 100);\nassert.ok(r2.max \u003c= 104);\n\n// Single value range [5, 6) should always produce 5\nconst r3 = generateSecureInts(10, 5, 6);\nassert.strictEqual(r3.allInRange, true);\nassert.ok(r3.values.every(v =\u003e v === 5));\nconsole.log(\u0027Task 27 suffix passed\u0027);\n","assertions":"// Negative range [−10, 0)\nconst r4 = generateSecureInts(200, -10, 0);\nassert.strictEqual(r4.allInRange, true);\nassert.ok(r4.min \u003e= -10);\nassert.ok(r4.max \u003c= -1);\n\n// Large range\nconst r5 = generateSecureInts(100, 0, 1000000);\nassert.strictEqual(r5.allInRange, true);\n\n// Small sample\nconst r6 = generateSecureInts(1, 0, 100);\nassert.strictEqual(r6.values.length, 1);\nassert.strictEqual(r6.allInRange, true);\nassert.strictEqual(r6.min, r6.max); // single value, min == max\nconsole.log(\u0027Task 27 assertions passed\u0027);\n","category":"api_usage"} {"id":"28","testsource":"devbench-api-usage","language":"javascript","prefix":"const { EventEmitter, once } = require(\u0027events\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Write an async function that waits for a specific event on an emitter,\n// but with a timeout implemented via AbortSignal.\n//\n// Returns: { event: string, args: any[], timedOut: boolean }\n//\n// If the event fires before timeout: { event, args: [...eventArgs], timedOut: false }\n// If timeout occurs first: { event, args: [], timedOut: true }\n//\n// Use events.once() with the { signal } option for cancellation.\n// Use AbortController to create the signal and setTimeout to trigger abort.\n\n","golden_completion":"async function waitForEvent(emitter, eventName, timeoutMs) {\n const ac = new AbortController();\n const timer = setTimeout(() =\u003e ac.abort(), timeoutMs);\n try {\n const args = await once(emitter, eventName, { signal: ac.signal });\n clearTimeout(timer);\n return { event: eventName, args, timedOut: false };\n } catch (err) {\n clearTimeout(timer);\n if (err.code === \u0027ABORT_ERR\u0027) {\n return { event: eventName, args: [], timedOut: true };\n }\n throw err;\n }\n}\n\n","suffix":"(async () =\u003e {\n // Event fires before timeout\n const em1 = new EventEmitter();\n setTimeout(() =\u003e em1.emit(\u0027data\u0027, \u0027hello\u0027, 42), 10);\n const r1 = await waitForEvent(em1, \u0027data\u0027, 1000);\n assert.strictEqual(r1.event, \u0027data\u0027);\n assert.deepStrictEqual(r1.args, [\u0027hello\u0027, 42]);\n assert.strictEqual(r1.timedOut, false);\n\n // Timeout occurs before event\n const em2 = new EventEmitter();\n setTimeout(() =\u003e em2.emit(\u0027data\u0027, \u0027late\u0027), 1000);\n const r2 = await waitForEvent(em2, \u0027data\u0027, 10);\n assert.strictEqual(r2.event, \u0027data\u0027);\n assert.deepStrictEqual(r2.args, []);\n assert.strictEqual(r2.timedOut, true);\n\n // Event with no arguments\n const em3 = new EventEmitter();\n setTimeout(() =\u003e em3.emit(\u0027ping\u0027), 10);\n const r3 = await waitForEvent(em3, \u0027ping\u0027, 1000);\n assert.strictEqual(r3.event, \u0027ping\u0027);\n assert.deepStrictEqual(r3.args, []);\n assert.strictEqual(r3.timedOut, false);\n\n console.log(\u0027Task 28 suffix passed\u0027);\n})();\n","assertions":"(async () =\u003e {\n // Immediate event (0ms delay) still works\n const em4 = new EventEmitter();\n setImmediate(() =\u003e em4.emit(\u0027fast\u0027, \u0027zoom\u0027));\n const r4 = await waitForEvent(em4, \u0027fast\u0027, 1000);\n assert.strictEqual(r4.timedOut, false);\n assert.deepStrictEqual(r4.args, [\u0027zoom\u0027]);\n\n // Very short timeout with no event\n const em5 = new EventEmitter();\n const r5 = await waitForEvent(em5, \u0027never\u0027, 1);\n assert.strictEqual(r5.timedOut, true);\n assert.deepStrictEqual(r5.args, []);\n\n // Multiple args event\n const em6 = new EventEmitter();\n setTimeout(() =\u003e em6.emit(\u0027multi\u0027, 1, \u0027two\u0027, true, null), 5);\n const r6 = await waitForEvent(em6, \u0027multi\u0027, 500);\n assert.strictEqual(r6.timedOut, false);\n assert.deepStrictEqual(r6.args, [1, \u0027two\u0027, true, null]);\n\n console.log(\u0027Task 28 assertions passed\u0027);\n})();\n","category":"api_usage"} {"id":"29","testsource":"devbench-api-usage","language":"javascript","prefix":"const fs = require(\u0027fs\u0027);\nconst os = require(\u0027os\u0027);\nconst path = require(\u0027path\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Write a function that creates a temp directory with proper prefix handling.\n// The function should:\n// 1. Use fs.mkdtempSync with os.tmpdir() as the base\n// 2. The prefix MUST use path.join(os.tmpdir(), prefix) to ensure proper\n// path separator (otherwise the random suffix gets appended to the\n// tmpdir name without a separator on some platforms)\n// 3. Create a test file inside the temp dir to verify it\u0027s writable\n// 4. Return: { dir: string, testFile: string, isTemp: boolean }\n// where isTemp is true if the dir starts with os.tmpdir()\n\n","golden_completion":"function createTempDir(prefix = \u0027myapp-\u0027) {\n const dir = fs.mkdtempSync(path.join(os.tmpdir(), prefix));\n const testFile = path.join(dir, \u0027test.txt\u0027);\n fs.writeFileSync(testFile, \u0027temp file contents\u0027);\n return {\n dir,\n testFile,\n isTemp: dir.startsWith(os.tmpdir())\n };\n}\n\n","suffix":"// Create temp dir and verify\nconst r1 = createTempDir(\u0027unittest-\u0027);\nassert.ok(fs.existsSync(r1.dir), \u0027Temp dir should exist\u0027);\nassert.ok(fs.existsSync(r1.testFile), \u0027Test file should exist\u0027);\nassert.strictEqual(r1.isTemp, true, \u0027Dir should be under tmpdir\u0027);\nassert.ok(r1.dir.includes(\u0027unittest-\u0027), \u0027Dir should contain prefix\u0027);\nassert.strictEqual(fs.readFileSync(r1.testFile, \u0027utf8\u0027), \u0027temp file contents\u0027);\n\n// Verify the directory name has random suffix after prefix\nconst dirName = path.basename(r1.dir);\nassert.ok(dirName.startsWith(\u0027unittest-\u0027), \u0027Dir name should start with prefix\u0027);\nassert.ok(dirName.length \u003e \u0027unittest-\u0027.length, \u0027Dir name should have random suffix\u0027);\n\n// Cleanup\nfs.unlinkSync(r1.testFile);\nfs.rmdirSync(r1.dir);\n\n// Create another to verify uniqueness\nconst r2 = createTempDir(\u0027test-\u0027);\nassert.notStrictEqual(r1.dir, r2.dir, \u0027Each call should produce unique dir\u0027);\nfs.unlinkSync(r2.testFile);\nfs.rmdirSync(r2.dir);\nconsole.log(\u0027Task 29 suffix passed\u0027);\n","assertions":"// Default prefix\nconst r3 = createTempDir();\nassert.ok(fs.existsSync(r3.dir));\nassert.ok(path.basename(r3.dir).startsWith(\u0027myapp-\u0027));\nassert.strictEqual(r3.isTemp, true);\nfs.unlinkSync(r3.testFile);\nfs.rmdirSync(r3.dir);\n\n// Empty prefix\nconst r4 = createTempDir(\u0027\u0027);\nassert.ok(fs.existsSync(r4.dir));\nassert.strictEqual(r4.isTemp, true);\nfs.unlinkSync(r4.testFile);\nfs.rmdirSync(r4.dir);\n\n// Prefix with dots\nconst r5 = createTempDir(\u0027my.app.v2-\u0027);\nassert.ok(fs.existsSync(r5.dir));\nassert.ok(path.basename(r5.dir).startsWith(\u0027my.app.v2-\u0027));\nfs.unlinkSync(r5.testFile);\nfs.rmdirSync(r5.dir);\nconsole.log(\u0027Task 29 assertions passed\u0027);\n","category":"api_usage"} {"id":"30","testsource":"devbench-api-usage","language":"javascript","prefix":"const { pathToFileURL, fileURLToPath } = require(\u0027url\u0027);\nconst path = require(\u0027path\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Write a function that demonstrates file URL conversion edge cases.\n// Given an array of absolute file paths, return an array of objects:\n// { path: string, fileUrl: string, roundTrip: string, roundTripMatch: boolean }\n//\n// - path: the original path\n// - fileUrl: the file:// URL string (using pathToFileURL().href)\n// - roundTrip: convert fileUrl back to path (using fileURLToPath())\n// - roundTripMatch: whether path === roundTrip (should be true for normalized paths)\n\n","golden_completion":"function analyzeFilePaths(paths) {\n return paths.map(p =\u003e {\n const fileUrl = pathToFileURL(p).href;\n const roundTrip = fileURLToPath(fileUrl);\n return {\n path: p,\n fileUrl,\n roundTrip,\n roundTripMatch: p === roundTrip\n };\n });\n}\n\n","suffix":"// Simple path\nconst r1 = analyzeFilePaths([\u0027/tmp/test.txt\u0027]);\nassert.strictEqual(r1[0].fileUrl, \u0027file:///tmp/test.txt\u0027);\nassert.strictEqual(r1[0].roundTrip, \u0027/tmp/test.txt\u0027);\nassert.strictEqual(r1[0].roundTripMatch, true);\n\n// Path with spaces (should be percent-encoded in URL)\nconst r2 = analyzeFilePaths([\u0027/tmp/my file.txt\u0027]);\nassert.ok(r2[0].fileUrl.includes(\u0027my%20file.txt\u0027), \u0027Space should be encoded\u0027);\nassert.strictEqual(r2[0].roundTrip, \u0027/tmp/my file.txt\u0027);\nassert.strictEqual(r2[0].roundTripMatch, true);\n\n// Path with special characters\nconst r3 = analyzeFilePaths([\u0027/tmp/file#1.txt\u0027]);\nassert.ok(r3[0].fileUrl.includes(\u0027%23\u0027), \u0027Hash should be encoded\u0027);\nassert.strictEqual(r3[0].roundTripMatch, true);\n\n// Multiple paths\nconst r4 = analyzeFilePaths([\u0027/a/b\u0027, \u0027/c/d\u0027]);\nassert.strictEqual(r4.length, 2);\nassert.strictEqual(r4[0].fileUrl, \u0027file:///a/b\u0027);\nassert.strictEqual(r4[1].fileUrl, \u0027file:///c/d\u0027);\nconsole.log(\u0027Task 30 suffix passed\u0027);\n","assertions":"// Path with Unicode characters\nconst r5 = analyzeFilePaths([\u0027/tmp/日本語.txt\u0027]);\nassert.strictEqual(r5[0].roundTripMatch, true);\nassert.ok(r5[0].fileUrl.startsWith(\u0027file:///\u0027));\n\n// Path with percent sign (should be double-encoded)\nconst r6 = analyzeFilePaths([\u0027/tmp/100%done.txt\u0027]);\nassert.ok(r6[0].fileUrl.includes(\u0027%25\u0027), \u0027Percent should be encoded as %25\u0027);\nassert.strictEqual(r6[0].roundTrip, \u0027/tmp/100%done.txt\u0027);\nassert.strictEqual(r6[0].roundTripMatch, true);\n\n// Nested path\nconst r7 = analyzeFilePaths([\u0027/usr/local/bin/my-script\u0027]);\nassert.strictEqual(r7[0].fileUrl, \u0027file:///usr/local/bin/my-script\u0027);\nassert.strictEqual(r7[0].roundTripMatch, true);\n\n// Path with query-like characters (? should be encoded)\nconst r8 = analyzeFilePaths([\u0027/tmp/file?v=1.txt\u0027]);\nassert.ok(r8[0].fileUrl.includes(\u0027%3F\u0027), \u0027Question mark should be encoded\u0027);\nassert.strictEqual(r8[0].roundTripMatch, true);\n\n// Empty array\nconst r9 = analyzeFilePaths([]);\nassert.strictEqual(r9.length, 0);\nconsole.log(\u0027Task 30 assertions passed\u0027);\n","category":"api_usage"} {"id":"31","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Custom HMAC library that derives the signing key before use\n// Key derivation: HMAC-SHA256(salt, rawKey) -\u003e derivedKey\n// Then: HMAC-SHA256(derivedKey, message) -\u003e signature\n\nfunction deriveKey(rawKey, salt) {\n return crypto.createHmac(\u0027sha256\u0027, salt)\n .update(rawKey)\n .digest();\n}\n\nfunction signSha256(message, rawKey, salt) {\n const dk = deriveKey(rawKey, salt);\n return crypto.createHmac(\u0027sha256\u0027, dk)\n .update(message)\n .digest(\u0027hex\u0027);\n}\n\n// Verify: salt matters\nconst sig1 = signSha256(\u0027hello\u0027, \u0027key\u0027, \u0027salt1\u0027);\nconst sig2 = signSha256(\u0027hello\u0027, \u0027key\u0027, \u0027salt2\u0027);\nassert.notStrictEqual(sig1, sig2);\n\n// Verify: deterministic\nassert.strictEqual(\n signSha256(\u0027test\u0027, \u0027mykey\u0027, \u0027mysalt\u0027),\n signSha256(\u0027test\u0027, \u0027mykey\u0027, \u0027mysalt\u0027)\n);\n\n","golden_completion":"function signSha512(message, rawKey, salt) {\n const dk = deriveKey(rawKey, salt);\n return crypto.createHmac(\u0027sha512\u0027, dk)\n .update(message)\n .digest(\u0027hex\u0027);\n}\n","suffix":"\n// signSha512 uses the same key derivation but HMAC-SHA512 for signing\nconst s1 = signSha512(\u0027hello\u0027, \u0027key\u0027, \u0027salt\u0027);\nassert.strictEqual(s1.length, 128); // SHA-512 hex = 128 chars\n\n// Same key derivation, different hash -\u003e different signature\nconst s256 = signSha256(\u0027hello\u0027, \u0027key\u0027, \u0027salt\u0027);\nassert.notStrictEqual(s1, s256);\n\n// Key derivation still uses SHA-256 (deriveKey unchanged)\n// Only the final HMAC uses SHA-512\nconst dk = deriveKey(\u0027key\u0027, \u0027salt\u0027);\nconst expected = crypto.createHmac(\u0027sha512\u0027, dk).update(\u0027hello\u0027).digest(\u0027hex\u0027);\nassert.strictEqual(s1, expected);\n\n// Deterministic\nassert.strictEqual(\n signSha512(\u0027msg\u0027, \u0027k\u0027, \u0027s\u0027),\n signSha512(\u0027msg\u0027, \u0027k\u0027, \u0027s\u0027)\n);\n","assertions":"\n// Different messages produce different signatures\nassert.notStrictEqual(\n signSha512(\u0027a\u0027, \u0027key\u0027, \u0027salt\u0027),\n signSha512(\u0027b\u0027, \u0027key\u0027, \u0027salt\u0027)\n);\n\n// Different keys produce different signatures\nassert.notStrictEqual(\n signSha512(\u0027msg\u0027, \u0027key1\u0027, \u0027salt\u0027),\n signSha512(\u0027msg\u0027, \u0027key2\u0027, \u0027salt\u0027)\n);\n\n// Different salts produce different signatures\nassert.notStrictEqual(\n signSha512(\u0027msg\u0027, \u0027key\u0027, \u0027salt1\u0027),\n signSha512(\u0027msg\u0027, \u0027key\u0027, \u0027salt2\u0027)\n);\n\n// Must use SHA-256 for key derivation, SHA-512 for signing\n// If someone used SHA-512 for key derivation too, the output would differ\nconst wrongDk = crypto.createHmac(\u0027sha512\u0027, \u0027salt\u0027).update(\u0027key\u0027).digest();\nconst wrongSig = crypto.createHmac(\u0027sha512\u0027, wrongDk).update(\u0027hello\u0027).digest(\u0027hex\u0027);\nassert.notStrictEqual(signSha512(\u0027hello\u0027, \u0027key\u0027, \u0027salt\u0027), wrongSig);\n","category":"api_usage"} {"id":"32","testsource":"devbench-api-usage","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom Buffer comparison utilities\n// Each function returns { result, metadata } with comparison details\n\nfunction compareBuffersFull(buf1, buf2) {\n const cmp = Buffer.compare(buf1, buf2);\n return {\n result: cmp,\n metadata: {\n buf1Length: buf1.length,\n buf2Length: buf2.length,\n equal: cmp === 0,\n order: cmp \u003c 0 ? \u0027before\u0027 : cmp \u003e 0 ? \u0027after\u0027 : \u0027equal\u0027\n }\n };\n}\n\nconst c1 = compareBuffersFull(Buffer.from(\u0027abc\u0027), Buffer.from(\u0027abd\u0027));\nassert.strictEqual(c1.result, -1);\nassert.strictEqual(c1.metadata.order, \u0027before\u0027);\nassert.strictEqual(c1.metadata.equal, false);\n\nconst c2 = compareBuffersFull(Buffer.from(\u0027xyz\u0027), Buffer.from(\u0027xyz\u0027));\nassert.strictEqual(c2.result, 0);\nassert.strictEqual(c2.metadata.order, \u0027equal\u0027);\n\n","golden_completion":"function compareBuffersSlice(buf1, buf2, offset1, offset2, length) {\n const slice1 = buf1.subarray(offset1, offset1 + length);\n const slice2 = buf2.subarray(offset2, offset2 + length);\n const cmp = Buffer.compare(slice1, slice2);\n return {\n result: cmp,\n metadata: {\n buf1Length: buf1.length,\n buf2Length: buf2.length,\n sliceLength: length,\n offset1,\n offset2,\n equal: cmp === 0,\n order: cmp \u003c 0 ? \u0027before\u0027 : cmp \u003e 0 ? \u0027after\u0027 : \u0027equal\u0027\n }\n };\n}\n","suffix":"\n// compareBuffersSlice compares slices of two buffers\nconst b1 = Buffer.from(\u0027xxabcxx\u0027);\nconst b2 = Buffer.from(\u0027yyabcyy\u0027);\n\n// Compare the \u0027abc\u0027 portion of each\nconst cs1 = compareBuffersSlice(b1, b2, 2, 2, 3);\nassert.strictEqual(cs1.result, 0);\nassert.strictEqual(cs1.metadata.equal, true);\nassert.strictEqual(cs1.metadata.sliceLength, 3);\nassert.strictEqual(cs1.metadata.offset1, 2);\nassert.strictEqual(cs1.metadata.offset2, 2);\n\n// Different slices\nconst cs2 = compareBuffersSlice(b1, b2, 0, 0, 2);\nassert.strictEqual(cs2.metadata.equal, false);\nassert.strictEqual(cs2.metadata.order, cs2.result \u003c 0 ? \u0027before\u0027 : \u0027after\u0027);\n\n// Full buffer metadata preserved\nassert.strictEqual(cs1.metadata.buf1Length, 7);\nassert.strictEqual(cs1.metadata.buf2Length, 7);\n","assertions":"\n// Edge case: zero-length comparison is always equal\nconst ez = compareBuffersSlice(Buffer.from(\u0027abc\u0027), Buffer.from(\u0027xyz\u0027), 0, 0, 0);\nassert.strictEqual(ez.result, 0);\nassert.strictEqual(ez.metadata.equal, true);\nassert.strictEqual(ez.metadata.sliceLength, 0);\n\n// Same buffer different offsets\nconst same = Buffer.from(\u0027abcabc\u0027);\nconst csame = compareBuffersSlice(same, same, 0, 3, 3);\nassert.strictEqual(csame.result, 0);\nassert.strictEqual(csame.metadata.equal, true);\n\n// Verify order field\nconst co = compareBuffersSlice(Buffer.from(\u0027zzz\u0027), Buffer.from(\u0027aaa\u0027), 0, 0, 3);\nassert.strictEqual(co.metadata.order, \u0027after\u0027);\n","category":"api_usage"} {"id":"33","testsource":"devbench-api-usage","language":"javascript","prefix":"const { format, inspect } = require(\u0027util\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// We test precise behavior of util.format specifiers\n// %s - String\n// %d - Number (integer or float parsed via parseFloat)\n// %j - JSON (JSON.stringify)\n// %o - Object (util.inspect with showHidden and depth)\n// %O - Object (util.inspect without showHidden, depth limited)\n// %% - literal percent\n\n// Demonstrate %j behavior\nassert.strictEqual(format(\u0027%j\u0027, { a: 1 }), \u0027{\"a\":1}\u0027);\nassert.strictEqual(format(\u0027%j\u0027, [1, 2]), \u0027[1,2]\u0027);\nassert.strictEqual(format(\u0027%j\u0027, undefined), \u0027undefined\u0027); // %j with undefined -\u003e string \u0027undefined\u0027\n\n// Demonstrate %d behavior: non-numeric strings give NaN\nassert.strictEqual(format(\u0027%d\u0027, \u002742.5abc\u0027), \u0027NaN\u0027);\nassert.strictEqual(format(\u0027%d\u0027, \u0027not-a-number\u0027), \u0027NaN\u0027);\nassert.strictEqual(format(\u0027%d\u0027, true), \u00271\u0027);\nassert.strictEqual(format(\u0027%d\u0027, null), \u00270\u0027);\nassert.strictEqual(format(\u0027%d\u0027, false), \u00270\u0027);\n\n// Demonstrate %% (only expanded when format specifiers are present)\nassert.strictEqual(format(\u0027%s 100%%\u0027, \u0027hi\u0027), \u0027hi 100%\u0027);\nassert.strictEqual(format(\u0027%%d\u0027, 42), \u0027%d 42\u0027); // %% consumes %, d is literal, 42 is extra arg\n\n","golden_completion":"// Build a function that formats a log line with mixed specifiers\nfunction formatLogLine(level, code, data, extra) {\n // Pattern: \"[LEVEL] code=%d data=%j (extra=%s) 100%%\"\n return format(\u0027[%s] code=%d data=%j (extra=%s) 100%%\u0027, level, code, data, extra);\n}\n","suffix":"\n// Test formatLogLine with various inputs\nconst line1 = formatLogLine(\u0027INFO\u0027, 200, { ok: true }, \u0027done\u0027);\nassert.strictEqual(line1, \u0027[INFO] code=200 data={\"ok\":true} (extra=done) 100%\u0027);\n\nconst line2 = formatLogLine(\u0027ERROR\u0027, \u0027404abc\u0027, [1], null);\nassert.strictEqual(line2, \u0027[ERROR] code=NaN data=[1] (extra=null) 100%\u0027);\n\n// %d on non-numeric string \u0027404abc\u0027 -\u003e NaN\n// %j on [1] -\u003e [1]\n// %s on null -\u003e \u0027null\u0027\nconst line3 = formatLogLine(\u0027WARN\u0027, true, null, undefined);\nassert.strictEqual(line3, \u0027[WARN] code=1 data=null (extra=undefined) 100%\u0027);\n","assertions":"\n// Edge cases for format specifiers\n// %d with boolean true -\u003e 1\nconst line4 = formatLogLine(\u0027DEBUG\u0027, false, {}, 0);\nassert.strictEqual(line4, \u0027[DEBUG] code=0 data={} (extra=0) 100%\u0027);\n\n// Nested object in %j\nconst line5 = formatLogLine(\u0027INFO\u0027, 42, { a: { b: 1 } }, \u0027x\u0027);\nassert.strictEqual(line5, \u0027[INFO] code=42 data={\"a\":{\"b\":1}} (extra=x) 100%\u0027);\n\n// %d with null -\u003e 0\nconst line6 = formatLogLine(\u0027TRACE\u0027, null, [], \u0027\u0027);\nassert.strictEqual(line6, \u0027[TRACE] code=0 data=[] (extra=) 100%\u0027);\n","category":"api_usage"} {"id":"34","testsource":"devbench-api-usage","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// TextEncoder/TextDecoder behavior tests\n// Key behaviors to understand:\n// 1. TextDecoder(\u0027utf-8\u0027, { fatal: true }) throws on invalid sequences\n// 2. TextDecoder(\u0027utf-8\u0027, { ignoreBOM: false }) (default) strips BOM\n// 3. TextDecoder(\u0027utf-8\u0027, { ignoreBOM: true }) preserves BOM\n\nconst encoder = new TextEncoder();\n\n// Basic encode/decode round-trip\nconst encoded = encoder.encode(\u0027Hello\u0027);\nconst decoder = new TextDecoder(\u0027utf-8\u0027);\nassert.strictEqual(decoder.decode(encoded), \u0027Hello\u0027);\n\n// BOM handling: default strips BOM\nconst withBOM = new Uint8Array([0xEF, 0xBB, 0xBF, 0x48, 0x69]); // BOM + \"Hi\"\nconst defaultDecoder = new TextDecoder(\u0027utf-8\u0027);\nassert.strictEqual(defaultDecoder.decode(withBOM), \u0027Hi\u0027); // BOM stripped\n\n// ignoreBOM: true preserves BOM\nconst bomKeeper = new TextDecoder(\u0027utf-8\u0027, { ignoreBOM: true });\nassert.strictEqual(bomKeeper.decode(withBOM), \u0027Hi\u0027); // BOM preserved\n\n","golden_completion":"// Create a function that decodes with configurable error handling and BOM behavior\nfunction safeDecode(uint8arr, options = {}) {\n const { fatal = false, keepBOM = false } = options;\n const dec = new TextDecoder(\u0027utf-8\u0027, { fatal, ignoreBOM: keepBOM });\n try {\n return { text: dec.decode(uint8arr), error: null };\n } catch (e) {\n return { text: null, error: e.message };\n }\n}\n","suffix":"\n// Non-fatal mode replaces invalid sequences with U+FFFD\nconst invalid = new Uint8Array([0x48, 0x80, 0x69]); // \u0027H\u0027 + invalid + \u0027i\u0027\nconst r1 = safeDecode(invalid);\nassert.strictEqual(r1.error, null);\nassert.strictEqual(r1.text, \u0027H�i\u0027);\n\n// Fatal mode throws on invalid sequences\nconst r2 = safeDecode(invalid, { fatal: true });\nassert.notStrictEqual(r2.error, null);\nassert.strictEqual(r2.text, null);\n\n// BOM handling with keepBOM\nconst bomBytes = new Uint8Array([0xEF, 0xBB, 0xBF, 0x4F, 0x4B]); // BOM + \"OK\"\nconst r3 = safeDecode(bomBytes, { keepBOM: false });\nassert.strictEqual(r3.text, \u0027OK\u0027);\n\nconst r4 = safeDecode(bomBytes, { keepBOM: true });\nassert.strictEqual(r4.text, \u0027OK\u0027);\n","assertions":"\n// Empty input\nconst r5 = safeDecode(new Uint8Array([]));\nassert.strictEqual(r5.text, \u0027\u0027);\nassert.strictEqual(r5.error, null);\n\n// Valid UTF-8 multi-byte: e2 9c 93 = checkmark U+2713\nconst check = new Uint8Array([0xE2, 0x9C, 0x93]);\nconst r6 = safeDecode(check);\nassert.strictEqual(r6.text, \u0027✓\u0027);\n\n// Fatal + valid input should work fine\nconst r7 = safeDecode(encoder.encode(\u0027test\u0027), { fatal: true });\nassert.strictEqual(r7.text, \u0027test\u0027);\nassert.strictEqual(r7.error, null);\n\n// keepBOM on data without BOM has no effect\nconst noBom = encoder.encode(\u0027plain\u0027);\nconst r8 = safeDecode(noBom, { keepBOM: true });\nassert.strictEqual(r8.text, \u0027plain\u0027);\n","category":"api_usage"} {"id":"35","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Hash utility library: each function hashes data and returns\n// { hash, algorithm, encoding, inputLength }\n\nfunction hashHex(algorithm, data) {\n const h = crypto.createHash(algorithm).update(data).digest(\u0027hex\u0027);\n return {\n hash: h,\n algorithm,\n encoding: \u0027hex\u0027,\n inputLength: Buffer.byteLength(data)\n };\n}\n\nconst md5hex = hashHex(\u0027md5\u0027, \u0027hello\u0027);\nassert.strictEqual(md5hex.hash, \u00275d41402abc4b2a76b9719d911017c592\u0027);\nassert.strictEqual(md5hex.algorithm, \u0027md5\u0027);\nassert.strictEqual(md5hex.encoding, \u0027hex\u0027);\nassert.strictEqual(md5hex.inputLength, 5);\n\n","golden_completion":"function hashBase64(algorithm, data) {\n const h = crypto.createHash(algorithm).update(data).digest(\u0027base64\u0027);\n return {\n hash: h,\n algorithm,\n encoding: \u0027base64\u0027,\n inputLength: Buffer.byteLength(data)\n };\n}\n","suffix":"\n// hashBase64 uses base64 encoding instead of hex\nconst sha256b64 = hashBase64(\u0027sha256\u0027, \u0027hello\u0027);\nassert.strictEqual(sha256b64.encoding, \u0027base64\u0027);\nassert.strictEqual(sha256b64.algorithm, \u0027sha256\u0027);\nassert.strictEqual(sha256b64.inputLength, 5);\n\n// Verify the actual hash value\nconst expected = crypto.createHash(\u0027sha256\u0027).update(\u0027hello\u0027).digest(\u0027base64\u0027);\nassert.strictEqual(sha256b64.hash, expected);\n\n// MD5 in base64\nconst md5b64 = hashBase64(\u0027md5\u0027, \u0027hello\u0027);\nassert.strictEqual(md5b64.hash, crypto.createHash(\u0027md5\u0027).update(\u0027hello\u0027).digest(\u0027base64\u0027));\nassert.strictEqual(md5b64.encoding, \u0027base64\u0027);\n","assertions":"\n// Empty string\nconst empty = hashBase64(\u0027sha256\u0027, \u0027\u0027);\nassert.strictEqual(empty.inputLength, 0);\nassert.strictEqual(empty.hash, crypto.createHash(\u0027sha256\u0027).update(\u0027\u0027).digest(\u0027base64\u0027));\n\n// UTF-8 multi-byte: inputLength is byte length, not char length\nconst utf8 = hashBase64(\u0027sha256\u0027, \u0027é\u0027); // e-acute = 2 bytes in UTF-8\nassert.strictEqual(utf8.inputLength, 2);\n\n// SHA-1\nconst sha1 = hashBase64(\u0027sha1\u0027, \u0027test\u0027);\nassert.strictEqual(sha1.algorithm, \u0027sha1\u0027);\nassert.strictEqual(sha1.hash, crypto.createHash(\u0027sha1\u0027).update(\u0027test\u0027).digest(\u0027base64\u0027));\n","category":"api_usage"} {"id":"36","testsource":"devbench-api-usage","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Number formatting utility using Intl.NumberFormat\n// Returns { formatted, parts } where parts is from formatToParts\n\nfunction formatCurrency(amount, currency, locale) {\n const fmt = new Intl.NumberFormat(locale, {\n style: \u0027currency\u0027,\n currency: currency\n });\n const parts = fmt.formatToParts(amount);\n return {\n formatted: fmt.format(amount),\n parts: parts.map(p =\u003e ({ type: p.type, value: p.value }))\n };\n}\n\n// US dollar formatting\nconst usd = formatCurrency(1234.56, \u0027USD\u0027, \u0027en-US\u0027);\nassert.strictEqual(usd.formatted, \u0027$1,234.56\u0027);\n// Parts include: currency, integer, group, decimal, fraction\nassert.ok(usd.parts.some(p =\u003e p.type === \u0027currency\u0027 \u0026\u0026 p.value === \u0027$\u0027));\nassert.ok(usd.parts.some(p =\u003e p.type === \u0027group\u0027 \u0026\u0026 p.value === \u0027,\u0027));\nassert.ok(usd.parts.some(p =\u003e p.type === \u0027decimal\u0027 \u0026\u0026 p.value === \u0027.\u0027));\n\n","golden_completion":"function formatPercent(value, locale, minFrac, maxFrac) {\n const fmt = new Intl.NumberFormat(locale, {\n style: \u0027percent\u0027,\n minimumFractionDigits: minFrac,\n maximumFractionDigits: maxFrac\n });\n const parts = fmt.formatToParts(value);\n return {\n formatted: fmt.format(value),\n parts: parts.map(p =\u003e ({ type: p.type, value: p.value }))\n };\n}\n","suffix":"\n// Intl.NumberFormat \u0027percent\u0027 style multiplies the value by 100\n// So 0.1234 -\u003e \"12.34%\"\nconst p1 = formatPercent(0.1234, \u0027en-US\u0027, 1, 2);\nassert.strictEqual(p1.formatted, \u002712.34%\u0027);\nassert.ok(p1.parts.some(p =\u003e p.type === \u0027percentSign\u0027));\n\n// With minimumFractionDigits: 0.5 -\u003e \"50.0%\"\nconst p2 = formatPercent(0.5, \u0027en-US\u0027, 1, 2);\nassert.strictEqual(p2.formatted, \u002750.0%\u0027);\n\n// maxFrac limits decimals: 0.12345 -\u003e \"12.35%\" (rounded)\nconst p3 = formatPercent(0.12345, \u0027en-US\u0027, 1, 2);\nassert.strictEqual(p3.formatted, \u002712.35%\u0027);\n\n// Zero fraction digits for integer percentage\nconst p4 = formatPercent(0.75, \u0027en-US\u0027, 0, 0);\nassert.strictEqual(p4.formatted, \u002775%\u0027);\n","assertions":"\n// Negative percentage\nconst p5 = formatPercent(-0.05, \u0027en-US\u0027, 1, 2);\nassert.ok(p5.formatted.includes(\u0027-\u0027));\nassert.ok(p5.formatted.includes(\u00275.0\u0027));\n\n// Zero\nconst p6 = formatPercent(0, \u0027en-US\u0027, 2, 2);\nassert.strictEqual(p6.formatted, \u00270.00%\u0027);\n\n// Value \u003e 1 means \u003e 100%\nconst p7 = formatPercent(1.5, \u0027en-US\u0027, 0, 0);\nassert.strictEqual(p7.formatted, \u0027150%\u0027);\n\n// Parts include percentSign type\nassert.ok(p7.parts.some(p =\u003e p.type === \u0027percentSign\u0027));\nassert.ok(p7.parts.some(p =\u003e p.type === \u0027integer\u0027));\n","category":"api_usage"} {"id":"37","testsource":"devbench-api-usage","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// RegExp pattern library using named capture groups\n// Each function returns match groups as a structured object\n\nfunction parseDate(str) {\n const re = /^(?\u003cyear\u003e\\d{4})-(?\u003cmonth\u003e\\d{2})-(?\u003cday\u003e\\d{2})$/;\n const m = str.match(re);\n if (!m) return null;\n return {\n year: parseInt(m.groups.year, 10),\n month: parseInt(m.groups.month, 10),\n day: parseInt(m.groups.day, 10),\n raw: m[0]\n };\n}\n\nconst d1 = parseDate(\u00272024-03-15\u0027);\nassert.strictEqual(d1.year, 2024);\nassert.strictEqual(d1.month, 3);\nassert.strictEqual(d1.day, 15);\nassert.strictEqual(d1.raw, \u00272024-03-15\u0027);\n\nassert.strictEqual(parseDate(\u0027not-a-date\u0027), null);\n\nfunction parseTime(str) {\n const re = /^(?\u003chours\u003e\\d{2}):(?\u003cminutes\u003e\\d{2}):(?\u003cseconds\u003e\\d{2})$/;\n const m = str.match(re);\n if (!m) return null;\n return {\n hours: parseInt(m.groups.hours, 10),\n minutes: parseInt(m.groups.minutes, 10),\n seconds: parseInt(m.groups.seconds, 10),\n raw: m[0]\n };\n}\n\nconst t1 = parseTime(\u002714:30:00\u0027);\nassert.strictEqual(t1.hours, 14);\nassert.strictEqual(t1.minutes, 30);\nassert.strictEqual(t1.seconds, 0);\n\n","golden_completion":"function parseDuration(str) {\n const re = /^(?\u003chours\u003e\\d+)h(?\u003cminutes\u003e\\d+)m(?\u003cseconds\u003e\\d+)s$/;\n const m = str.match(re);\n if (!m) return null;\n return {\n hours: parseInt(m.groups.hours, 10),\n minutes: parseInt(m.groups.minutes, 10),\n seconds: parseInt(m.groups.seconds, 10),\n totalSeconds: parseInt(m.groups.hours, 10) * 3600 +\n parseInt(m.groups.minutes, 10) * 60 +\n parseInt(m.groups.seconds, 10),\n raw: m[0]\n };\n}\n","suffix":"\n// parseDuration parses \"XhYmZs\" format using named groups\nconst dur1 = parseDuration(\u00272h30m45s\u0027);\nassert.strictEqual(dur1.hours, 2);\nassert.strictEqual(dur1.minutes, 30);\nassert.strictEqual(dur1.seconds, 45);\nassert.strictEqual(dur1.totalSeconds, 2 * 3600 + 30 * 60 + 45);\nassert.strictEqual(dur1.raw, \u00272h30m45s\u0027);\n\nconst dur2 = parseDuration(\u00270h0m0s\u0027);\nassert.strictEqual(dur2.totalSeconds, 0);\nassert.strictEqual(dur2.hours, 0);\n\nassert.strictEqual(parseDuration(\u0027invalid\u0027), null);\nassert.strictEqual(parseDuration(\u00272h30m\u0027), null); // missing seconds\n","assertions":"\n// Large values\nconst dur3 = parseDuration(\u0027100h59m59s\u0027);\nassert.strictEqual(dur3.hours, 100);\nassert.strictEqual(dur3.totalSeconds, 100 * 3600 + 59 * 60 + 59);\n\n// Single digits\nconst dur4 = parseDuration(\u00271h2m3s\u0027);\nassert.strictEqual(dur4.hours, 1);\nassert.strictEqual(dur4.minutes, 2);\nassert.strictEqual(dur4.seconds, 3);\nassert.strictEqual(dur4.totalSeconds, 3723);\n\n// Raw must match input\nassert.strictEqual(dur4.raw, \u00271h2m3s\u0027);\n\n// Edge: all zeros\nconst dur5 = parseDuration(\u00270h0m0s\u0027);\nassert.deepStrictEqual(\n { h: dur5.hours, m: dur5.minutes, s: dur5.seconds, t: dur5.totalSeconds },\n { h: 0, m: 0, s: 0, t: 0 }\n);\n","category":"api_usage"} {"id":"38","testsource":"devbench-api-usage","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Locale-aware string sorting utilities using Intl.Collator\n// Each function returns { sorted, locale, options }\n\nfunction sortCaseSensitive(arr, locale) {\n const collator = new Intl.Collator(locale, { sensitivity: \u0027case\u0027 });\n const sorted = [...arr].sort(collator.compare);\n return { sorted, locale, options: { sensitivity: \u0027case\u0027 } };\n}\n\n// Case-sensitive sort groups by case\nconst cs1 = sortCaseSensitive([\u0027banana\u0027, \u0027Apple\u0027, \u0027cherry\u0027, \u0027apple\u0027], \u0027en\u0027);\n// Intl.Collator with sensitivity:\u0027case\u0027 treats accents as equal but case differs\nassert.strictEqual(cs1.locale, \u0027en\u0027);\n\nfunction sortCaseInsensitive(arr, locale) {\n const collator = new Intl.Collator(locale, { sensitivity: \u0027base\u0027 });\n const sorted = [...arr].sort(collator.compare);\n return { sorted, locale, options: { sensitivity: \u0027base\u0027 } };\n}\n\n// Base sensitivity: accents and case are ignored\nconst ci1 = sortCaseInsensitive([\u0027B\u0027, \u0027a\u0027, \u0027C\u0027], \u0027en\u0027);\nassert.deepStrictEqual(ci1.sorted, [\u0027a\u0027, \u0027B\u0027, \u0027C\u0027]);\n\n","golden_completion":"function sortNatural(arr, locale) {\n const collator = new Intl.Collator(locale, { numeric: true, sensitivity: \u0027base\u0027 });\n const sorted = [...arr].sort(collator.compare);\n return { sorted, locale, options: { numeric: true, sensitivity: \u0027base\u0027 } };\n}\n","suffix":"\n// sortNatural uses numeric: true for natural number ordering\n// \"file2\" comes before \"file10\" (unlike lexicographic sort)\nconst ns1 = sortNatural([\u0027file10\u0027, \u0027file2\u0027, \u0027file1\u0027, \u0027file20\u0027], \u0027en\u0027);\nassert.deepStrictEqual(ns1.sorted, [\u0027file1\u0027, \u0027file2\u0027, \u0027file10\u0027, \u0027file20\u0027]);\nassert.strictEqual(ns1.locale, \u0027en\u0027);\nassert.strictEqual(ns1.options.numeric, true);\n\n// Numeric sort with mixed strings\nconst ns2 = sortNatural([\u0027item3\u0027, \u0027item1\u0027, \u0027item11\u0027, \u0027item2\u0027], \u0027en\u0027);\nassert.deepStrictEqual(ns2.sorted, [\u0027item1\u0027, \u0027item2\u0027, \u0027item3\u0027, \u0027item11\u0027]);\n\n// Case insensitive due to sensitivity: \u0027base\u0027\n// With numeric: true, \u0027a\u0027 and \u0027A\u0027 are equivalent (base), so a1 \u003c A10 \u003c b1 \u003c B2\nconst ns3 = sortNatural([\u0027B2\u0027, \u0027a1\u0027, \u0027A10\u0027, \u0027b1\u0027], \u0027en\u0027);\nassert.deepStrictEqual(ns3.sorted, [\u0027a1\u0027, \u0027A10\u0027, \u0027b1\u0027, \u0027B2\u0027]);\n","assertions":"\n// Pure numeric strings\nconst ns4 = sortNatural([\u0027100\u0027, \u002720\u0027, \u00273\u0027, \u00271\u0027], \u0027en\u0027);\nassert.deepStrictEqual(ns4.sorted, [\u00271\u0027, \u00273\u0027, \u002720\u0027, \u0027100\u0027]);\n\n// Single element\nconst ns5 = sortNatural([\u0027only\u0027], \u0027en\u0027);\nassert.deepStrictEqual(ns5.sorted, [\u0027only\u0027]);\n\n// Empty array\nconst ns6 = sortNatural([], \u0027en\u0027);\nassert.deepStrictEqual(ns6.sorted, []);\n\n// Options object must be correct\nassert.deepStrictEqual(ns6.options, { numeric: true, sensitivity: \u0027base\u0027 });\n","category":"api_usage"} {"id":"39","testsource":"devbench-api-usage","language":"javascript","prefix":"const crypto = require(\u0027crypto\u0027);\nconst assert = require(\u0027assert\u0027);\n\n// Token generation utility library\n// Each generator returns { token, encoding, byteLength }\n\nfunction generateHexToken(byteLength) {\n const buf = crypto.randomBytes(byteLength);\n return {\n token: buf.toString(\u0027hex\u0027),\n encoding: \u0027hex\u0027,\n byteLength\n };\n}\n\nconst ht = generateHexToken(16);\nassert.strictEqual(ht.token.length, 32); // 16 bytes = 32 hex chars\nassert.strictEqual(ht.encoding, \u0027hex\u0027);\nassert.strictEqual(ht.byteLength, 16);\nassert.ok(/^[0-9a-f]+$/.test(ht.token)); // only lowercase hex\n\n","golden_completion":"function generateBase64Token(byteLength) {\n const buf = crypto.randomBytes(byteLength);\n return {\n token: buf.toString(\u0027base64\u0027),\n encoding: \u0027base64\u0027,\n byteLength\n };\n}\n","suffix":"\n// Base64 token: each 3 bytes -\u003e 4 chars, with padding\nconst bt = generateBase64Token(16);\nassert.strictEqual(bt.encoding, \u0027base64\u0027);\nassert.strictEqual(bt.byteLength, 16);\n// 16 bytes = ceil(16/3)*4 = 24 base64 chars (with padding)\nassert.strictEqual(bt.token.length, 24);\nassert.ok(/^[A-Za-z0-9+/]+=*$/.test(bt.token));\n\n// 15 bytes = exactly 20 base64 chars (no padding needed: 15/3=5, 5*4=20)\nconst bt2 = generateBase64Token(15);\nassert.strictEqual(bt2.token.length, 20);\nassert.ok(!bt2.token.includes(\u0027=\u0027));\n","assertions":"\n// Various byte lengths\nconst bt3 = generateBase64Token(1);\nassert.strictEqual(bt3.token.length, 4); // 1 byte -\u003e 4 chars (2 padding)\nassert.strictEqual(bt3.byteLength, 1);\n\nconst bt4 = generateBase64Token(3);\nassert.strictEqual(bt4.token.length, 4); // 3 bytes -\u003e 4 chars (no padding)\n\nconst bt5 = generateBase64Token(32);\nassert.strictEqual(bt5.token.length, 44); // ceil(32/3)*4 = 44\n\n// Encoding must be \u0027base64\u0027\nassert.strictEqual(bt5.encoding, \u0027base64\u0027);\n\n// Tokens should be unique (probabilistically)\nconst a = generateBase64Token(32).token;\nconst b = generateBase64Token(32).token;\nassert.notStrictEqual(a, b);\n","category":"api_usage"} {"id":"40","testsource":"devbench-api-usage","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// URL parsing utility using the WHATWG URL API\n// Returns structured info about a URL\n\nfunction parseUrlBasic(urlStr) {\n const url = new URL(urlStr);\n return {\n protocol: url.protocol, // includes trailing \u0027:\u0027\n hostname: url.hostname,\n port: url.port, // empty string if default port\n pathname: url.pathname,\n hash: url.hash, // includes \u0027#\u0027 prefix\n origin: url.origin\n };\n}\n\nconst u1 = parseUrlBasic(\u0027https://example.com:8080/path?q=1#section\u0027);\nassert.strictEqual(u1.protocol, \u0027https:\u0027);\nassert.strictEqual(u1.hostname, \u0027example.com\u0027);\nassert.strictEqual(u1.port, \u00278080\u0027);\nassert.strictEqual(u1.pathname, \u0027/path\u0027);\nassert.strictEqual(u1.hash, \u0027#section\u0027);\nassert.strictEqual(u1.origin, \u0027https://example.com:8080\u0027);\n\n// Default port is empty string\nconst u2 = parseUrlBasic(\u0027https://example.com/\u0027);\nassert.strictEqual(u2.port, \u0027\u0027);\nassert.strictEqual(u2.origin, \u0027https://example.com\u0027);\n\n","golden_completion":"function parseUrlQuery(urlStr) {\n const url = new URL(urlStr);\n const params = {};\n url.searchParams.forEach((value, key) =\u003e {\n if (params[key]) {\n if (!Array.isArray(params[key])) params[key] = [params[key]];\n params[key].push(value);\n } else {\n params[key] = value;\n }\n });\n return {\n protocol: url.protocol,\n hostname: url.hostname,\n pathname: url.pathname,\n params,\n paramCount: url.searchParams.size,\n search: url.search // includes \u0027?\u0027 prefix\n };\n}\n","suffix":"\n// parseUrlQuery extracts query parameters into a params object\nconst q1 = parseUrlQuery(\u0027https://api.example.com/search?q=hello\u0026lang=en\u0027);\nassert.strictEqual(q1.protocol, \u0027https:\u0027);\nassert.strictEqual(q1.hostname, \u0027api.example.com\u0027);\nassert.strictEqual(q1.pathname, \u0027/search\u0027);\nassert.strictEqual(q1.params.q, \u0027hello\u0027);\nassert.strictEqual(q1.params.lang, \u0027en\u0027);\nassert.strictEqual(q1.paramCount, 2);\nassert.strictEqual(q1.search, \u0027?q=hello\u0026lang=en\u0027);\n\n// Duplicate keys become arrays\nconst q2 = parseUrlQuery(\u0027https://x.com/?tag=a\u0026tag=b\u0026tag=c\u0027);\nassert.deepStrictEqual(q2.params.tag, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.strictEqual(q2.paramCount, 3);\n\n// No query params\nconst q3 = parseUrlQuery(\u0027https://x.com/path\u0027);\nassert.deepStrictEqual(q3.params, {});\nassert.strictEqual(q3.paramCount, 0);\nassert.strictEqual(q3.search, \u0027\u0027);\n","assertions":"\n// URL-encoded values are decoded\nconst q4 = parseUrlQuery(\u0027https://x.com/?msg=hello%20world\u0026x=%26\u0027);\nassert.strictEqual(q4.params.msg, \u0027hello world\u0027);\nassert.strictEqual(q4.params.x, \u0027\u0026\u0027);\n\n// Single param, no duplicates\nconst q5 = parseUrlQuery(\u0027https://x.com/?key=value\u0027);\nassert.strictEqual(q5.params.key, \u0027value\u0027);\nassert.strictEqual(typeof q5.params.key, \u0027string\u0027); // not an array\n\n// Mixed single and duplicate\nconst q6 = parseUrlQuery(\u0027https://x.com/?a=1\u0026b=2\u0026a=3\u0027);\nassert.deepStrictEqual(q6.params.a, [\u00271\u0027, \u00273\u0027]);\nassert.strictEqual(q6.params.b, \u00272\u0027);\nassert.strictEqual(q6.paramCount, 3);\n","category":"api_usage"} {"id":"41","testsource":"devbench-api-usage","language":"javascript","prefix":"// Clone an object containing an ArrayBuffer, transferring ownership\n// After transfer, the ORIGINAL ArrayBuffer becomes detached (byteLength === 0)\nfunction cloneWithTransfer(obj, bufferKey) {\n","golden_completion":" const buffer = obj[bufferKey];\n const cloned = structuredClone(obj, { transfer: [buffer] });\n return { cloned, originalDetached: obj[bufferKey].byteLength === 0 };\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\nconst buf = new ArrayBuffer(16);\nconst view = new Uint8Array(buf);\nview[0] = 42;\nview[1] = 99;\n\nconst result = cloneWithTransfer({ data: buf, label: \u0027test\u0027 }, \u0027data\u0027);\n\n// The cloned object has the buffer with the data intact\nconst clonedView = new Uint8Array(result.cloned.data);\nassert.strictEqual(clonedView[0], 42);\nassert.strictEqual(clonedView[1], 99);\nassert.strictEqual(result.cloned.label, \u0027test\u0027);\n\n// Original buffer is detached after transfer\nassert.strictEqual(result.originalDetached, true);\nassert.strictEqual(buf.byteLength, 0);\nconsole.log(\u0027Task 41 suffix passed\u0027);\n","assertions":"// Transfer with a fresh buffer\nconst buf2 = new ArrayBuffer(8);\nnew Uint8Array(buf2).set([1, 2, 3, 4, 5, 6, 7, 8]);\nconst r2 = cloneWithTransfer({ x: buf2 }, \u0027x\u0027);\nassert.strictEqual(r2.originalDetached, true);\nassert.strictEqual(buf2.byteLength, 0);\nassert.strictEqual(r2.cloned.x.byteLength, 8);\nconst v2 = new Uint8Array(r2.cloned.x);\nassert.strictEqual(v2[0], 1);\nassert.strictEqual(v2[7], 8);\n\n// Non-buffer properties are deep-cloned (not shared)\nconst buf3 = new ArrayBuffer(4);\nconst r3 = cloneWithTransfer({ b: buf3, nested: { a: 1 } }, \u0027b\u0027);\nr3.cloned.nested.a = 999;\n// Original nested object is unaffected (deep clone)\n// (can\u0027t check original since buf3 is detached, but cloned nested is independent)\nassert.strictEqual(r3.cloned.nested.a, 999);\n\nconsole.log(\u0027Task 41 assertions passed\u0027);\n","category":"api_usage"} {"id":"42","testsource":"devbench-api-usage","language":"javascript","prefix":"// A cache that holds WeakRefs to objects and recreates them on demand.\n// The factory function is called ONLY when the WeakRef is dead (deref returns undefined).\n// Must track how many times the factory was called via `createCount`.\nclass WeakCache {\n constructor(factory) {\n this._factory = factory;\n this._refs = new Map();\n this.createCount = 0;\n }\n\n","golden_completion":" get(key) {\n const ref = this._refs.get(key);\n let obj = ref ? ref.deref() : undefined;\n if (obj === undefined) {\n obj = this._factory(key);\n this._refs.set(key, new WeakRef(obj));\n this.createCount++;\n }\n return obj;\n }\n","suffix":" has(key) {\n const ref = this._refs.get(key);\n return ref ? ref.deref() !== undefined : false;\n }\n\n delete(key) {\n this._refs.delete(key);\n }\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst cache = new WeakCache((key) =\u003e ({ id: key, ts: Date.now() }));\n\n// First get creates the object\nconst obj1 = cache.get(\u0027a\u0027);\nassert.strictEqual(obj1.id, \u0027a\u0027);\nassert.strictEqual(cache.createCount, 1);\n\n// Second get returns the SAME object (WeakRef still alive)\nconst obj2 = cache.get(\u0027a\u0027);\nassert.strictEqual(obj1, obj2);\nassert.strictEqual(cache.createCount, 1); // no new creation\n\n// Different key creates a new object\nconst obj3 = cache.get(\u0027b\u0027);\nassert.strictEqual(obj3.id, \u0027b\u0027);\nassert.strictEqual(cache.createCount, 2);\n\n// has() returns true for live refs\nassert.strictEqual(cache.has(\u0027a\u0027), true);\nassert.strictEqual(cache.has(\u0027c\u0027), false);\n\nconsole.log(\u0027Task 42 suffix passed\u0027);\n","assertions":"// Delete removes the ref, next get recreates\nconst cache2 = new WeakCache((k) =\u003e ({ val: k.toUpperCase() }));\nconst x = cache2.get(\u0027hello\u0027);\nassert.strictEqual(x.val, \u0027HELLO\u0027);\nassert.strictEqual(cache2.createCount, 1);\n\ncache2.delete(\u0027hello\u0027);\nassert.strictEqual(cache2.has(\u0027hello\u0027), false);\n\nconst y = cache2.get(\u0027hello\u0027);\nassert.strictEqual(y.val, \u0027HELLO\u0027);\nassert.strictEqual(cache2.createCount, 2); // recreated after delete\nassert.notStrictEqual(x, y); // different object\n\n// Multiple keys\ncache2.get(\u0027world\u0027);\ncache2.get(\u0027foo\u0027);\nassert.strictEqual(cache2.createCount, 4);\n// Re-get existing keys doesn\u0027t increment\ncache2.get(\u0027world\u0027);\ncache2.get(\u0027foo\u0027);\nassert.strictEqual(cache2.createCount, 4);\n\nconsole.log(\u0027Task 42 assertions passed\u0027);\n","category":"api_usage"} {"id":"43","testsource":"devbench-api-usage","language":"javascript","prefix":"// Run an async task with a timeout. If the task doesn\u0027t finish in time,\n// abort it with a specific reason. The function must:\n// 1. Create an AbortController\n// 2. Set up a timeout that calls controller.abort(reason) with reason = \u0027TIMEOUT\u0027\n// 3. Pass the signal to the task function\n// 4. Return { result, aborted, reason } where aborted is true if timed out\n// 5. Always clear the timeout (even on success)\nasync function withTimeout(taskFn, timeoutMs) {\n","golden_completion":" const controller = new AbortController();\n const timer = setTimeout(() =\u003e controller.abort(\u0027TIMEOUT\u0027), timeoutMs);\n try {\n const result = await taskFn(controller.signal);\n return { result, aborted: false, reason: null };\n } catch (e) {\n if (controller.signal.aborted) {\n return { result: null, aborted: true, reason: controller.signal.reason };\n }\n throw e;\n } finally {\n clearTimeout(timer);\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nasync function testTimeout() {\n // Task that completes quickly\n const fast = await withTimeout(async (signal) =\u003e {\n return \u0027done\u0027;\n }, 1000);\n assert.deepStrictEqual(fast, { result: \u0027done\u0027, aborted: false, reason: null });\n\n // Task that takes too long and gets aborted\n const slow = await withTimeout(async (signal) =\u003e {\n return new Promise((resolve, reject) =\u003e {\n const t = setTimeout(() =\u003e resolve(\u0027late\u0027), 5000);\n signal.addEventListener(\u0027abort\u0027, () =\u003e {\n clearTimeout(t);\n reject(new Error(\u0027aborted\u0027));\n });\n });\n }, 50);\n assert.strictEqual(slow.aborted, true);\n assert.strictEqual(slow.reason, \u0027TIMEOUT\u0027);\n assert.strictEqual(slow.result, null);\n\n console.log(\u0027Task 43 suffix passed\u0027);\n}\ntestTimeout();\n","assertions":"async function testAssertions() {\n // Task that throws a non-abort error should re-throw\n try {\n await withTimeout(async (signal) =\u003e {\n throw new Error(\u0027task-error\u0027);\n }, 1000);\n assert.fail(\u0027should have thrown\u0027);\n } catch (e) {\n assert.strictEqual(e.message, \u0027task-error\u0027);\n }\n\n // Task that uses signal to check abort status\n const r = await withTimeout(async (signal) =\u003e {\n await new Promise(r =\u003e setTimeout(r, 10));\n return signal.aborted ? \u0027was-aborted\u0027 : \u0027still-running\u0027;\n }, 5000);\n assert.strictEqual(r.result, \u0027still-running\u0027);\n\n // Very short timeout\n const r2 = await withTimeout(async (signal) =\u003e {\n return new Promise((resolve, reject) =\u003e {\n const t = setTimeout(() =\u003e resolve(\u0027ok\u0027), 500);\n signal.addEventListener(\u0027abort\u0027, () =\u003e {\n clearTimeout(t);\n reject(new Error(\u0027abort\u0027));\n });\n });\n }, 1);\n assert.strictEqual(r2.aborted, true);\n assert.strictEqual(r2.reason, \u0027TIMEOUT\u0027);\n\n console.log(\u0027Task 43 assertions passed\u0027);\n}\ntestAssertions();\n","category":"api_usage"} {"id":"44","testsource":"devbench-api-usage","language":"javascript","prefix":"// Implement an atomic counter using SharedArrayBuffer and Atomics.\n// The counter uses index 0 of a shared Int32Array for the count.\n// increment() must use Atomics.add and return the OLD value (before increment).\n// get() must use Atomics.load.\n// compareAndSwap(expected, desired) must use Atomics.compareExchange\n// and return true only if the swap succeeded.\nclass AtomicCounter {\n constructor(initial = 0) {\n this._sab = new SharedArrayBuffer(4);\n this._view = new Int32Array(this._sab);\n Atomics.store(this._view, 0, initial);\n }\n\n","golden_completion":" increment() {\n return Atomics.add(this._view, 0, 1);\n }\n get() {\n return Atomics.load(this._view, 0);\n }\n compareAndSwap(expected, desired) {\n return Atomics.compareExchange(this._view, 0, expected, desired) === expected;\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst counter = new AtomicCounter(0);\n\n// increment returns OLD value\nassert.strictEqual(counter.increment(), 0);\nassert.strictEqual(counter.increment(), 1);\nassert.strictEqual(counter.increment(), 2);\nassert.strictEqual(counter.get(), 3);\n\n// compareAndSwap\nassert.strictEqual(counter.compareAndSwap(3, 10), true); // succeeds: was 3, now 10\nassert.strictEqual(counter.get(), 10);\nassert.strictEqual(counter.compareAndSwap(3, 20), false); // fails: expected 3 but is 10\nassert.strictEqual(counter.get(), 10); // unchanged\n\n// Initial value\nconst counter2 = new AtomicCounter(100);\nassert.strictEqual(counter2.get(), 100);\nassert.strictEqual(counter2.increment(), 100);\nassert.strictEqual(counter2.get(), 101);\n\nconsole.log(\u0027Task 44 suffix passed\u0027);\n","assertions":"// Multiple increments\nconst c = new AtomicCounter(0);\nconst oldVals = [];\nfor (let i = 0; i \u003c 10; i++) {\n oldVals.push(c.increment());\n}\nassert.deepStrictEqual(oldVals, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]);\nassert.strictEqual(c.get(), 10);\n\n// compareAndSwap chain\nassert.strictEqual(c.compareAndSwap(10, 50), true);\nassert.strictEqual(c.compareAndSwap(50, 100), true);\nassert.strictEqual(c.compareAndSwap(99, 200), false); // wrong expected\nassert.strictEqual(c.get(), 100);\n\n// Negative initial\nconst c2 = new AtomicCounter(-5);\nassert.strictEqual(c2.get(), -5);\nassert.strictEqual(c2.increment(), -5);\nassert.strictEqual(c2.get(), -4);\n\nconsole.log(\u0027Task 44 assertions passed\u0027);\n","category":"api_usage"} {"id":"45","testsource":"devbench-api-usage","language":"javascript","prefix":"// Create an array from a range [0, length), where each element is\n// transformed by multiplying by `this.multiplier` using Array.from\u0027s\n// mapFn and thisArg parameters.\n// IMPORTANT: Must use Array.from(arrayLike, mapFn, thisArg) — the 3-arg form.\n// Arrow functions do NOT respect thisArg, so mapFn must be a regular function.\nfunction makeScaledRange(length, multiplier) {\n","golden_completion":" const ctx = { multiplier };\n return Array.from({ length }, function(_, i) { return i * this.multiplier; }, ctx);\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nassert.deepStrictEqual(makeScaledRange(5, 2), [0, 2, 4, 6, 8]);\nassert.deepStrictEqual(makeScaledRange(4, 10), [0, 10, 20, 30]);\nassert.deepStrictEqual(makeScaledRange(3, 0), [0, 0, 0]);\nassert.deepStrictEqual(makeScaledRange(0, 5), []);\nassert.deepStrictEqual(makeScaledRange(1, 7), [0]);\n\nconsole.log(\u0027Task 45 suffix passed\u0027);\n","assertions":"// Negative multiplier — start from index 1 to avoid -0 issue (0 * -3 === -0)\nconst neg = makeScaledRange(4, -3);\nassert.strictEqual(neg.length, 4);\nassert.strictEqual(neg[1], -3);\nassert.strictEqual(neg[2], -6);\nassert.strictEqual(neg[3], -9);\n\n// Fractional multiplier\nconst r = makeScaledRange(3, 0.5);\nassert.strictEqual(r.length, 3);\nassert.strictEqual(r[0], 0);\nassert.strictEqual(r[1], 0.5);\nassert.strictEqual(r[2], 1.0);\n\n// Large length\nconst big = makeScaledRange(100, 1);\nassert.strictEqual(big.length, 100);\nassert.strictEqual(big[99], 99);\n\n// Verify it actually uses thisArg (not closure)\n// The function body should reference this.multiplier, not a closed-over variable\nassert.deepStrictEqual(makeScaledRange(3, 5), [0, 5, 10]);\n\nconsole.log(\u0027Task 45 assertions passed\u0027);\n","category":"api_usage"} {"id":"46","testsource":"devbench-api-usage","language":"javascript","prefix":"// Create an object with:\n// - \u0027name\u0027: a normal writable, enumerable, configurable data property\n// - \u0027_accessCount\u0027: a non-enumerable, writable data property starting at 0\n// - \u0027greeting\u0027: a non-enumerable GETTER that increments _accessCount each time\n// it\u0027s accessed, and returns \u0027Hello, \u003cname\u003e!\u0027\n// - \u0027accessCount\u0027: a non-enumerable GETTER that returns _accessCount\n// Use Object.defineProperties for ALL properties.\nfunction createTrackedPerson(name) {\n const obj = {};\n","golden_completion":" Object.defineProperties(obj, {\n name: { value: name, writable: true, enumerable: true, configurable: true },\n _accessCount: { value: 0, writable: true, enumerable: false, configurable: true },\n greeting: { get() { this._accessCount++; return \u0027Hello, \u0027 + this.name + \u0027!\u0027; }, enumerable: false, configurable: true },\n accessCount: { get() { return this._accessCount; }, enumerable: false, configurable: true }\n });\n return obj;\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst p = createTrackedPerson(\u0027Alice\u0027);\n\n// name is enumerable\nassert.deepStrictEqual(Object.keys(p), [\u0027name\u0027]);\nassert.strictEqual(p.name, \u0027Alice\u0027);\n\n// greeting is a getter, increments access count\nassert.strictEqual(p.greeting, \u0027Hello, Alice!\u0027);\nassert.strictEqual(p.accessCount, 1);\nassert.strictEqual(p.greeting, \u0027Hello, Alice!\u0027);\nassert.strictEqual(p.accessCount, 2);\n\n// _accessCount and greeting/accessCount are NOT enumerable\nassert.strictEqual(Object.keys(p).includes(\u0027_accessCount\u0027), false);\nassert.strictEqual(Object.keys(p).includes(\u0027greeting\u0027), false);\nassert.strictEqual(Object.keys(p).includes(\u0027accessCount\u0027), false);\n\n// name is writable\np.name = \u0027Bob\u0027;\nassert.strictEqual(p.greeting, \u0027Hello, Bob!\u0027);\nassert.strictEqual(p.accessCount, 3);\n\nconsole.log(\u0027Task 46 suffix passed\u0027);\n","assertions":"const p2 = createTrackedPerson(\u0027Zoe\u0027);\n// Access count starts at 0\nassert.strictEqual(p2.accessCount, 0);\n\n// Multiple accesses\nfor (let i = 0; i \u003c 5; i++) p2.greeting;\nassert.strictEqual(p2.accessCount, 5);\n\n// Properties exist on the object (not undefined)\nassert.notStrictEqual(Object.getOwnPropertyDescriptor(p2, \u0027greeting\u0027), undefined);\nassert.notStrictEqual(Object.getOwnPropertyDescriptor(p2, \u0027_accessCount\u0027), undefined);\n\n// Verify descriptor types\nconst greetDesc = Object.getOwnPropertyDescriptor(p2, \u0027greeting\u0027);\nassert.strictEqual(typeof greetDesc.get, \u0027function\u0027);\nassert.strictEqual(greetDesc.enumerable, false);\nassert.strictEqual(\u0027value\u0027 in greetDesc, false); // getter, not data property\n\nconst nameDesc = Object.getOwnPropertyDescriptor(p2, \u0027name\u0027);\nassert.strictEqual(nameDesc.enumerable, true);\nassert.strictEqual(nameDesc.writable, true);\n\nconst acDesc = Object.getOwnPropertyDescriptor(p2, \u0027_accessCount\u0027);\nassert.strictEqual(acDesc.enumerable, false);\nassert.strictEqual(acDesc.writable, true);\n\nconsole.log(\u0027Task 46 assertions passed\u0027);\n","category":"api_usage"} {"id":"47","testsource":"devbench-api-usage","language":"javascript","prefix":"// BaseLogger has a log() method. TimestampLogger has a logWithTime() method.\n// Use Reflect.construct to create an object that:\n// - Is constructed by BaseLogger (runs BaseLogger constructor)\n// - But has TimestampLogger.prototype as its prototype (instanceof TimestampLogger)\n// This means the object has BaseLogger\u0027s initialized properties but\n// TimestampLogger\u0027s methods.\n\nfunction BaseLogger(prefix) {\n this.prefix = prefix;\n this.messages = [];\n}\nBaseLogger.prototype.log = function(msg) {\n this.messages.push(this.prefix + \u0027: \u0027 + msg);\n};\n\nfunction TimestampLogger(prefix) {\n this.prefix = prefix;\n this.messages = [];\n}\nTimestampLogger.prototype.logWithTime = function(msg) {\n this.messages.push(\u0027[\u0027 + new Date().toISOString().slice(0, 10) + \u0027] \u0027 + this.prefix + \u0027: \u0027 + msg);\n};\n\nfunction createHybridLogger(prefix) {\n","golden_completion":" return Reflect.construct(BaseLogger, [prefix], TimestampLogger);\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst logger = createHybridLogger(\u0027APP\u0027);\n\n// Has BaseLogger\u0027s constructor behavior (prefix and messages initialized)\nassert.strictEqual(logger.prefix, \u0027APP\u0027);\nassert.deepStrictEqual(logger.messages, []);\n\n// Is instanceof TimestampLogger (not BaseLogger) because new.target is TimestampLogger\nassert.strictEqual(logger instanceof TimestampLogger, true);\nassert.strictEqual(logger instanceof BaseLogger, false);\n\n// Has TimestampLogger\u0027s prototype methods (logWithTime)\nassert.strictEqual(typeof logger.logWithTime, \u0027function\u0027);\n\n// Does NOT have BaseLogger\u0027s prototype methods (log)\nassert.strictEqual(typeof logger.log, \u0027undefined\u0027);\n\n// logWithTime works correctly\nlogger.logWithTime(\u0027started\u0027);\nassert.strictEqual(logger.messages.length, 1);\nassert.ok(logger.messages[0].includes(\u0027APP: started\u0027));\n\nconsole.log(\u0027Task 47 suffix passed\u0027);\n","assertions":"// Different prefix\nconst l2 = createHybridLogger(\u0027SYS\u0027);\nassert.strictEqual(l2.prefix, \u0027SYS\u0027);\nassert.strictEqual(l2 instanceof TimestampLogger, true);\nassert.strictEqual(l2 instanceof BaseLogger, false);\n\n// Prototype chain\nassert.strictEqual(Object.getPrototypeOf(l2), TimestampLogger.prototype);\n\n// logWithTime message format includes date and prefix\nl2.logWithTime(\u0027test\u0027);\nassert.ok(l2.messages[0].startsWith(\u0027[\u0027));\nassert.ok(l2.messages[0].includes(\u0027SYS: test\u0027));\n\n// Multiple logWithTime calls accumulate\nl2.logWithTime(\u0027a\u0027);\nl2.logWithTime(\u0027b\u0027);\nassert.strictEqual(l2.messages.length, 3);\n\n// Separate instances don\u0027t share state\nconst l3 = createHybridLogger(\u0027X\u0027);\nl3.logWithTime(\u0027hello\u0027);\nassert.strictEqual(l3.messages.length, 1);\nassert.strictEqual(l2.messages.length, 3);\n\nconsole.log(\u0027Task 47 assertions passed\u0027);\n","category":"api_usage"} {"id":"48","testsource":"devbench-api-usage","language":"javascript","prefix":"// Create an Array subclass where:\n// - The constructor accepts elements and sets a \u0027tag\u0027 property\n// - slice, map, filter return PLAIN Arrays (not TaggedArray instances)\n// by using Symbol.species = Array\n// - A custom toTagged() method returns \u0027[tag]: el1, el2, ...\u0027\nclass TaggedArray extends Array {\n","golden_completion":" constructor(tag, ...items) {\n super(...items);\n this.tag = tag;\n }\n static get [Symbol.species]() {\n return Array;\n }\n toTagged() {\n return \u0027[\u0027 + this.tag + \u0027]: \u0027 + this.join(\u0027, \u0027);\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst ta = new TaggedArray(\u0027nums\u0027, 1, 2, 3, 4, 5);\nassert.strictEqual(ta.length, 5);\nassert.strictEqual(ta.tag, \u0027nums\u0027);\nassert.strictEqual(ta instanceof TaggedArray, true);\nassert.strictEqual(ta instanceof Array, true);\n\n// toTagged format\nassert.strictEqual(ta.toTagged(), \u0027[nums]: 1, 2, 3, 4, 5\u0027);\n\n// slice returns a PLAIN Array (due to Symbol.species)\nconst sliced = ta.slice(1, 3);\nassert.deepStrictEqual(sliced, [2, 3]);\nassert.strictEqual(sliced instanceof Array, true);\nassert.strictEqual(sliced instanceof TaggedArray, false);\n\n// map returns a PLAIN Array\nconst mapped = ta.map(x =\u003e x * 10);\nassert.deepStrictEqual(mapped, [10, 20, 30, 40, 50]);\nassert.strictEqual(mapped instanceof TaggedArray, false);\n\n// filter returns a PLAIN Array\nconst filtered = ta.filter(x =\u003e x \u003e 3);\nassert.deepStrictEqual(filtered, [4, 5]);\nassert.strictEqual(filtered instanceof TaggedArray, false);\n\nconsole.log(\u0027Task 48 suffix passed\u0027);\n","assertions":"// Empty TaggedArray\nconst empty = new TaggedArray(\u0027e\u0027);\nassert.strictEqual(empty.length, 0);\nassert.strictEqual(empty.tag, \u0027e\u0027);\nassert.strictEqual(empty.toTagged(), \u0027[e]: \u0027);\n\n// Slice of empty\nconst es = empty.slice();\nassert.strictEqual(es instanceof TaggedArray, false);\nassert.deepStrictEqual(es, []);\n\n// Concat with plain array (concat uses species too)\nconst ta2 = new TaggedArray(\u0027x\u0027, 10, 20);\nconst concatted = ta2.concat([30, 40]);\nassert.strictEqual(concatted instanceof TaggedArray, false);\nassert.deepStrictEqual(concatted, [10, 20, 30, 40]);\n\n// splice returns plain Array\nconst ta3 = new TaggedArray(\u0027s\u0027, \u0027a\u0027, \u0027b\u0027, \u0027c\u0027);\nconst spliced = ta3.splice(1, 1);\nassert.strictEqual(spliced instanceof TaggedArray, false);\nassert.deepStrictEqual(spliced, [\u0027b\u0027]);\nassert.strictEqual(ta3.length, 2);\n\nconsole.log(\u0027Task 48 assertions passed\u0027);\n","category":"api_usage"} {"id":"49","testsource":"devbench-api-usage","language":"javascript","prefix":"// Capture a structured stack trace at the point where this function is called.\n// Must use Error.captureStackTrace and Error.prepareStackTrace to get an array\n// of CallSite objects, then map them to { function, file, line } objects.\n// The constructorOpt parameter hides frames above the given function.\n//\n// Returns an array of { function: string, file: string, line: number }\nfunction getStructuredStack(constructorOpt) {\n","golden_completion":" const orig = Error.prepareStackTrace;\n Error.prepareStackTrace = (_, stack) =\u003e stack;\n const obj = {};\n Error.captureStackTrace(obj, constructorOpt || getStructuredStack);\n const raw = obj.stack;\n Error.prepareStackTrace = orig;\n return raw.map(s =\u003e ({\n function: s.getFunctionName() || \u0027\u003canonymous\u003e\u0027,\n file: s.getFileName(),\n line: s.getLineNumber()\n }));\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\n// Call from a named function\nfunction outerFunction() {\n function innerFunction() {\n return getStructuredStack();\n }\n return innerFunction();\n}\n\nconst stack = outerFunction();\n\n// stack is an array of objects\nassert.ok(Array.isArray(stack));\nassert.ok(stack.length \u003e= 2);\n\n// First frame should be innerFunction (getStructuredStack itself is excluded)\nassert.strictEqual(stack[0].function, \u0027innerFunction\u0027);\nassert.strictEqual(typeof stack[0].file, \u0027string\u0027);\nassert.strictEqual(typeof stack[0].line, \u0027number\u0027);\n\n// Second frame should be outerFunction\nassert.strictEqual(stack[1].function, \u0027outerFunction\u0027);\n\nconsole.log(\u0027Task 49 suffix passed\u0027);\n","assertions":"// Test with constructorOpt to hide frames\nfunction wrapper() {\n function target() {\n return getStructuredStack(wrapper);\n }\n return target();\n}\n\nconst s2 = wrapper();\n// wrapper and everything above it should be hidden\n// So the top frame should NOT be \u0027target\u0027 or \u0027wrapper\u0027\nconst fnNames = s2.map(f =\u003e f.function);\nassert.ok(!fnNames.includes(\u0027wrapper\u0027), \u0027wrapper should be hidden\u0027);\n\n// Direct call from module scope\nconst s3 = getStructuredStack();\nassert.ok(s3.length \u003e= 1);\nassert.strictEqual(typeof s3[0].function, \u0027string\u0027);\nassert.strictEqual(typeof s3[0].line, \u0027number\u0027);\n\n// All frames have the required properties\nfor (const frame of s3) {\n assert.ok(\u0027function\u0027 in frame);\n assert.ok(\u0027file\u0027 in frame);\n assert.ok(\u0027line\u0027 in frame);\n}\n\nconsole.log(\u0027Task 49 assertions passed\u0027);\n","category":"api_usage"} {"id":"50","testsource":"devbench-api-usage","language":"javascript","prefix":"const { performance, PerformanceObserver } = require(\u0027perf_hooks\u0027);\n\n// Measure the execution time of a synchronous function using Performance marks.\n// Must use performance.mark() and performance.measure() (NOT Date.now()).\n// Returns { result, durationMs, markStart, markEnd, measureName }\nfunction measureSync(name, fn) {\n","golden_completion":" const markStart = name + \u0027-start\u0027;\n const markEnd = name + \u0027-end\u0027;\n const measureName = name + \u0027-duration\u0027;\n performance.mark(markStart);\n const result = fn();\n performance.mark(markEnd);\n performance.measure(measureName, markStart, markEnd);\n const entry = performance.getEntriesByName(measureName)[0];\n return { result, durationMs: entry.duration, markStart, markEnd, measureName };\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\n// Measure a simple computation\nconst r = measureSync(\u0027test1\u0027, () =\u003e {\n let sum = 0;\n for (let i = 0; i \u003c 100000; i++) sum += i;\n return sum;\n});\n\nassert.strictEqual(r.result, 4999950000);\nassert.strictEqual(typeof r.durationMs, \u0027number\u0027);\nassert.ok(r.durationMs \u003e= 0, \u0027Duration should be non-negative\u0027);\nassert.strictEqual(r.markStart, \u0027test1-start\u0027);\nassert.strictEqual(r.markEnd, \u0027test1-end\u0027);\nassert.strictEqual(r.measureName, \u0027test1-duration\u0027);\n\n// Verify marks and measure exist in performance timeline\nconst marks = performance.getEntriesByType(\u0027mark\u0027);\nassert.ok(marks.some(m =\u003e m.name === \u0027test1-start\u0027));\nassert.ok(marks.some(m =\u003e m.name === \u0027test1-end\u0027));\n\nconst measures = performance.getEntriesByType(\u0027measure\u0027);\nassert.ok(measures.some(m =\u003e m.name === \u0027test1-duration\u0027));\n\nconsole.log(\u0027Task 50 suffix passed\u0027);\n","assertions":"// Measure a fast no-op\nconst r2 = measureSync(\u0027fast\u0027, () =\u003e 42);\nassert.strictEqual(r2.result, 42);\nassert.strictEqual(typeof r2.durationMs, \u0027number\u0027);\nassert.ok(r2.durationMs \u003e= 0);\nassert.strictEqual(r2.markStart, \u0027fast-start\u0027);\n\n// Measure something that returns a string\nconst r3 = measureSync(\u0027str\u0027, () =\u003e \u0027hello\u0027.repeat(3));\nassert.strictEqual(r3.result, \u0027hellohellohello\u0027);\n\n// Two different measurements don\u0027t interfere\nconst r4 = measureSync(\u0027m1\u0027, () =\u003e 1);\nconst r5 = measureSync(\u0027m2\u0027, () =\u003e 2);\nassert.strictEqual(r4.measureName, \u0027m1-duration\u0027);\nassert.strictEqual(r5.measureName, \u0027m2-duration\u0027);\nassert.strictEqual(r4.result, 1);\nassert.strictEqual(r5.result, 2);\n\n// Verify getEntriesByName returns the correct measure\nconst m1entries = performance.getEntriesByName(\u0027m1-duration\u0027);\nassert.ok(m1entries.length \u003e= 1);\nassert.strictEqual(m1entries[0].entryType, \u0027measure\u0027);\n\nconsole.log(\u0027Task 50 assertions passed\u0027);\n","category":"api_usage"} {"id":"1","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass Subscription {\n static VALID_TRANSITIONS = {\n pending: [\u0027active\u0027],\n active: [\u0027paused\u0027, \u0027cancelled\u0027],\n paused: [\u0027active\u0027, \u0027cancelled\u0027],\n cancelled: []\n };\n\n constructor(userId, plan) {\n this.userId = userId;\n this.plan = plan;\n this.state = \u0027pending\u0027;\n this.auditLog = [];\n this.activatedAt = null;\n this.pausedAt = null;\n this.totalPausedMs = 0;\n }\n\n _transition(newState, ts) {\n const allowed = Subscription.VALID_TRANSITIONS[this.state];\n if (!allowed || !allowed.includes(newState)) {\n throw new Error(`Cannot transition from ${this.state} to ${newState}`);\n }\n const old = this.state;\n this.state = newState;\n this.auditLog.push({ from: old, to: newState, ts });\n }\n\n","golden_completion":" activate(ts) {\n this._transition(\u0027active\u0027, ts);\n this.activatedAt = ts;\n }\n","suffix":"\n pause(ts) {\n this._transition(\u0027paused\u0027, ts);\n this.pausedAt = ts;\n }\n}\n\nconst s1 = new Subscription(\u0027u1\u0027, \u0027pro\u0027);\ns1.activate(1000);\nassert.strictEqual(s1.state, \u0027active\u0027);\nassert.strictEqual(s1.activatedAt, 1000);\nassert.strictEqual(s1.auditLog.length, 1);\nassert.deepStrictEqual(s1.auditLog[0], { from: \u0027pending\u0027, to: \u0027active\u0027, ts: 1000 });\n","assertions":"\nconst s2 = new Subscription(\u0027u2\u0027, \u0027basic\u0027);\ns2.activate(500);\nassert.strictEqual(s2.state, \u0027active\u0027);\nassert.strictEqual(s2.activatedAt, 500);\n\n// Cannot activate again from active state\ntry {\n s2.activate(600);\n assert.fail(\u0027Should not allow double activation\u0027);\n} catch (e) {\n assert.ok(e.message.includes(\u0027Cannot transition\u0027));\n}\n\n// Cannot activate a cancelled subscription\nconst s3 = new Subscription(\u0027u3\u0027, \u0027pro\u0027);\ns3.activate(100);\ns3._transition(\u0027cancelled\u0027, 200);\ntry {\n s3.activate(300);\n assert.fail(\u0027Should not allow activating cancelled\u0027);\n} catch (e) {\n assert.ok(e.message.includes(\u0027Cannot transition\u0027));\n}\n","category":"code_purpose_understanding"} {"id":"2","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass LoanAccount {\n constructor(loanId) {\n this.loanId = loanId;\n this.feesDue = 0;\n this.interestDue = 0;\n this.principalDue = 0;\n this.unapplied = 0;\n this.auditLog = [];\n this._idempotencyKeys = new Set();\n }\n\n addCharges(fees, interest, principal) {\n this.feesDue += fees;\n this.interestDue += interest;\n this.principalDue += principal;\n }\n\n // applyPayment(paymentId, amount):\n // 1. Idempotent: if paymentId already seen, return the cached result (no side effects)\n // 2. Waterfall order: fees → interest → principal → unapplied\n // Each bucket gets min(remaining, bucketDue), reducing both remaining and bucketDue\n // 3. Any leftover goes to this.unapplied\n // 4. Push audit entry: { paymentId, applied: { fees, interest, principal, unapplied } }\n // 5. Cache and return the applied object\n","golden_completion":" applyPayment(paymentId, amount) {\n if (this._idempotencyKeys.has(paymentId)) {\n return this.auditLog.find(e =\u003e e.paymentId === paymentId).applied;\n }\n this._idempotencyKeys.add(paymentId);\n let remaining = amount;\n const feePart = Math.min(remaining, this.feesDue);\n this.feesDue -= feePart;\n remaining -= feePart;\n const intPart = Math.min(remaining, this.interestDue);\n this.interestDue -= intPart;\n remaining -= intPart;\n const prinPart = Math.min(remaining, this.principalDue);\n this.principalDue -= prinPart;\n remaining -= prinPart;\n this.unapplied += remaining;\n const applied = { fees: feePart, interest: intPart, principal: prinPart, unapplied: remaining };\n this.auditLog.push({ paymentId, applied });\n return applied;\n }\n","suffix":"\n}\n\nconst loan = new LoanAccount(\u0027L1\u0027);\nloan.addCharges(50, 200, 1000);\nconst r1 = loan.applyPayment(\u0027P1\u0027, 300);\nassert.deepStrictEqual(r1, { fees: 50, interest: 200, principal: 50, unapplied: 0 });\nassert.strictEqual(loan.feesDue, 0);\nassert.strictEqual(loan.interestDue, 0);\nassert.strictEqual(loan.principalDue, 950);\n","assertions":"\n// Idempotency: same paymentId returns cached result, no side effects\nconst r1dup = loan.applyPayment(\u0027P1\u0027, 300);\nassert.deepStrictEqual(r1dup, { fees: 50, interest: 200, principal: 50, unapplied: 0 });\nassert.strictEqual(loan.principalDue, 950); // unchanged\n\n// Second payment: all goes to principal since fees/interest are zero\nconst r2 = loan.applyPayment(\u0027P2\u0027, 500);\nassert.deepStrictEqual(r2, { fees: 0, interest: 0, principal: 500, unapplied: 0 });\nassert.strictEqual(loan.principalDue, 450);\n\n// Overpayment: excess to unapplied\nconst r3 = loan.applyPayment(\u0027P3\u0027, 600);\nassert.deepStrictEqual(r3, { fees: 0, interest: 0, principal: 450, unapplied: 150 });\nassert.strictEqual(loan.principalDue, 0);\nassert.strictEqual(loan.unapplied, 150);\nassert.strictEqual(loan.auditLog.length, 3);\n","category":"code_purpose_understanding"} {"id":"3","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass InsurancePlan {\n constructor(copay, deductible, coinsurancePct, outOfPocketMax) {\n this.copay = copay; // fixed copay per claim\n this.deductible = deductible; // annual deductible\n this.coinsurancePct = coinsurancePct; // member\u0027s share after deductible (0.0-1.0)\n this.outOfPocketMax = outOfPocketMax; // annual OOP max (includes copay + deductible + coinsurance)\n this.deductibleMet = 0; // how much deductible has been met\n this.oopAccumulator = 0; // total out-of-pocket spent\n this.claims = [];\n this._claimIds = new Set();\n }\n\n // adjudicate(claimId, billedAmount):\n // 1. Idempotent: if claimId seen, return cached result from this.claims\n // 2. If oopAccumulator \u003e= outOfPocketMax, member pays $0 (plan pays all)\n // 3. Otherwise, apply in order:\n // a. Copay: member pays min(this.copay, billedAmount). Subtract from billedAmount remaining.\n // b. Deductible: remaining deductible = this.deductible - this.deductibleMet.\n // Member pays min(remainingDeductible, amountAfterCopay). Update this.deductibleMet.\n // c. Coinsurance: member pays coinsurancePct * amountAfterDeductible.\n // d. OOP cap: total memberPay = copayPart + deductiblePart + coinsurancePart.\n // If oopAccumulator + memberPay \u003e outOfPocketMax, cap memberPay at (outOfPocketMax - oopAccumulator).\n // 4. Update oopAccumulator += actual memberPay (after cap).\n // 5. planPay = billedAmount - actual memberPay.\n // 6. Push to this.claims: { claimId, billed: billedAmount, memberPay, planPay }\n // 7. Return { memberPay, planPay }\n","golden_completion":" adjudicate(claimId, billedAmount) {\n if (this._claimIds.has(claimId)) {\n const cached = this.claims.find(c =\u003e c.claimId === claimId);\n return { memberPay: cached.memberPay, planPay: cached.planPay };\n }\n this._claimIds.add(claimId);\n if (this.oopAccumulator \u003e= this.outOfPocketMax) {\n this.claims.push({ claimId, billed: billedAmount, memberPay: 0, planPay: billedAmount });\n return { memberPay: 0, planPay: billedAmount };\n }\n let remaining = billedAmount;\n const copayPart = Math.min(this.copay, remaining);\n remaining -= copayPart;\n const deductLeft = this.deductible - this.deductibleMet;\n const deductPart = Math.min(deductLeft, remaining);\n this.deductibleMet += deductPart;\n remaining -= deductPart;\n const coinsurancePart = this.coinsurancePct * remaining;\n let memberPay = copayPart + deductPart + coinsurancePart;\n if (this.oopAccumulator + memberPay \u003e this.outOfPocketMax) {\n memberPay = this.outOfPocketMax - this.oopAccumulator;\n }\n this.oopAccumulator += memberPay;\n const planPay = billedAmount - memberPay;\n this.claims.push({ claimId, billed: billedAmount, memberPay, planPay });\n return { memberPay, planPay };\n }\n","suffix":"\n}\n\n// Plan: $30 copay, $500 deductible, 20% coinsurance, $2000 OOP max\nconst plan = new InsurancePlan(30, 500, 0.2, 2000);\n\n// Claim 1: $1000 billed\n// copay=30, remaining=970, deductible=500 (met 0→500), remaining=470, coinsurance=0.2*470=94\n// memberPay=30+500+94=624, oopAcc=624\nconst c1 = plan.adjudicate(\u0027C1\u0027, 1000);\nassert.strictEqual(c1.memberPay, 624);\nassert.strictEqual(c1.planPay, 376);\nassert.strictEqual(plan.deductibleMet, 500);\nassert.strictEqual(plan.oopAccumulator, 624);\n","assertions":"\n// Claim 2: $2000 billed\n// copay=30, remaining=1970, deductible already met, coinsurance=0.2*1970=394\n// memberPay=30+0+394=424, oopAcc=624+424=1048\nconst c2 = plan.adjudicate(\u0027C2\u0027, 2000);\nassert.strictEqual(c2.memberPay, 424);\nassert.strictEqual(c2.planPay, 1576);\nassert.strictEqual(plan.oopAccumulator, 1048);\n\n// Claim 3: $8000 billed - OOP cap kicks in\n// copay=30, remaining=7970, deductible already met, coinsurance=0.2*7970=1594\n// memberPay=30+0+1594=1624, but oopAcc+1624=2672\u003e2000, so cap memberPay=2000-1048=952\nconst c3 = plan.adjudicate(\u0027C3\u0027, 8000);\nassert.strictEqual(c3.memberPay, 952);\nassert.strictEqual(c3.planPay, 7048);\nassert.strictEqual(plan.oopAccumulator, 2000);\n\n// Claim 4: OOP max reached, member pays $0\nconst c4 = plan.adjudicate(\u0027C4\u0027, 500);\nassert.strictEqual(c4.memberPay, 0);\nassert.strictEqual(c4.planPay, 500);\n\n// Idempotency: C1 again returns cached result\nconst c1dup = plan.adjudicate(\u0027C1\u0027, 1000);\nassert.strictEqual(c1dup.memberPay, 624);\nassert.strictEqual(plan.claims.length, 4);\n","category":"code_purpose_understanding"} {"id":"4","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass EscrowAccount {\n constructor(totalAmount, holdbackPct) {\n this.totalAmount = totalAmount;\n this.holdbackPct = holdbackPct; // e.g. 0.1 means 10% retained\n this.released = 0;\n this.holdback = 0;\n this.defects = new Set(); // active defect IDs blocking release\n this.milestones = {}; // milestoneId -\u003e { pct, released }\n this.log = [];\n this._processedIds = new Set();\n }\n\n registerMilestone(milestoneId, pct) {\n this.milestones[milestoneId] = { pct, released: false };\n }\n\n reportDefect(defectId) {\n this.defects.add(defectId);\n }\n\n resolveDefect(defectId) {\n this.defects.delete(defectId);\n }\n\n // releaseMilestone(milestoneId):\n // 1. Idempotent: if milestoneId already processed, return cached result from log\n // 2. If milestone not registered or defects.size \u003e 0, return { released: 0, blocked: true, reason }\n // reason: \u0027not_registered\u0027 or \u0027defects_pending\u0027\n // 3. Gross = totalAmount * milestone.pct\n // 4. Withheld = gross * holdbackPct (retained in holdback pool)\n // 5. Net = gross - withheld\n // 6. Update: this.released += net, this.holdback += withheld, milestone.released = true\n // 7. Push log entry: { milestoneId, gross, withheld, net }\n // 8. Return { released: net, blocked: false }\n","golden_completion":" releaseMilestone(milestoneId) {\n if (this._processedIds.has(milestoneId)) {\n const cached = this.log.find(e =\u003e e.milestoneId === milestoneId);\n return { released: cached.net, blocked: false };\n }\n if (!this.milestones[milestoneId]) {\n return { released: 0, blocked: true, reason: \u0027not_registered\u0027 };\n }\n if (this.defects.size \u003e 0) {\n return { released: 0, blocked: true, reason: \u0027defects_pending\u0027 };\n }\n this._processedIds.add(milestoneId);\n const ms = this.milestones[milestoneId];\n const gross = this.totalAmount * ms.pct;\n const withheld = gross * this.holdbackPct;\n const net = gross - withheld;\n this.released += net;\n this.holdback += withheld;\n ms.released = true;\n this.log.push({ milestoneId, gross, withheld, net });\n return { released: net, blocked: false };\n }\n","suffix":"\n}\n\nconst escrow = new EscrowAccount(100000, 0.1);\nescrow.registerMilestone(\u0027M1\u0027, 0.3);\nescrow.registerMilestone(\u0027M2\u0027, 0.5);\nescrow.registerMilestone(\u0027M3\u0027, 0.2);\n\nconst r1 = escrow.releaseMilestone(\u0027M1\u0027);\nassert.strictEqual(r1.released, 27000);\nassert.strictEqual(r1.blocked, false);\nassert.strictEqual(escrow.released, 27000);\nassert.strictEqual(escrow.holdback, 3000);\n","assertions":"\n// Defect blocks release\nescrow.reportDefect(\u0027D1\u0027);\nconst r2 = escrow.releaseMilestone(\u0027M2\u0027);\nassert.strictEqual(r2.blocked, true);\nassert.strictEqual(r2.reason, \u0027defects_pending\u0027);\nassert.strictEqual(escrow.released, 27000); // unchanged\n\n// Resolve defect, now M2 releases\nescrow.resolveDefect(\u0027D1\u0027);\nconst r2b = escrow.releaseMilestone(\u0027M2\u0027);\nassert.strictEqual(r2b.released, 45000);\nassert.strictEqual(escrow.released, 72000);\nassert.strictEqual(escrow.holdback, 8000);\n\n// Idempotency: M1 again\nconst r1dup = escrow.releaseMilestone(\u0027M1\u0027);\nassert.strictEqual(r1dup.released, 27000);\nassert.strictEqual(r1dup.blocked, false);\nassert.strictEqual(escrow.released, 72000); // unchanged\n\n// Unregistered milestone\nconst r4 = escrow.releaseMilestone(\u0027M99\u0027);\nassert.strictEqual(r4.blocked, true);\nassert.strictEqual(r4.reason, \u0027not_registered\u0027);\n\nassert.strictEqual(escrow.log.length, 2);\n","category":"code_purpose_understanding"} {"id":"5","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass UsageBilling {\n constructor(ratePerUnit, minimumCommit) {\n this.ratePerUnit = ratePerUnit;\n this.minimumCommit = minimumCommit; // minimum charge per period\n this.credits = []; // { id, amount } — applied FIFO\n this.invoices = {}; // periodId -\u003e invoice\n this.totalBilled = 0;\n }\n\n addCredit(creditId, amount) {\n this.credits.push({ id: creditId, amount });\n }\n\n // closeperiod(periodId, units):\n // 1. Idempotent: if periodId already invoiced, return cached invoice\n // 2. Gross = max(units * ratePerUnit, minimumCommit)\n // (minimum commit means you always pay at least minimumCommit)\n // 3. Apply credits FIFO: deduct from gross using credits in order.\n // Each credit is partially or fully consumed. Track creditsUsed array [{id, used}].\n // Remove fully consumed credits from this.credits array.\n // Update partially consumed credit\u0027s remaining amount.\n // 4. Net = gross - totalCreditsApplied (minimum 0)\n // 5. this.totalBilled += net\n // 6. Store and return invoice: { periodId, units, gross, creditsUsed, net }\n","golden_completion":" closePeriod(periodId, units) {\n if (this.invoices[periodId]) {\n return this.invoices[periodId];\n }\n const gross = Math.max(units * this.ratePerUnit, this.minimumCommit);\n let remaining = gross;\n const creditsUsed = [];\n while (remaining \u003e 0 \u0026\u0026 this.credits.length \u003e 0) {\n const credit = this.credits[0];\n const used = Math.min(credit.amount, remaining);\n creditsUsed.push({ id: credit.id, used });\n credit.amount -= used;\n remaining -= used;\n if (credit.amount \u003c= 0) {\n this.credits.shift();\n }\n }\n const net = remaining;\n this.totalBilled += net;\n const invoice = { periodId, units, gross, creditsUsed, net };\n this.invoices[periodId] = invoice;\n return invoice;\n }\n","suffix":"\n}\n\nconst billing = new UsageBilling(0.05, 100); // $0.05/unit, $100 minimum\nbilling.addCredit(\u0027CR1\u0027, 30);\nbilling.addCredit(\u0027CR2\u0027, 50);\n\n// Period 1: 3000 units =\u003e gross=max(150, 100)=150, credits: CR1 used 30, CR2 used 50 =\u003e net=70\nconst inv1 = billing.closePeriod(\u0027JAN\u0027, 3000);\nassert.strictEqual(inv1.gross, 150);\nassert.strictEqual(inv1.net, 70);\nassert.deepStrictEqual(inv1.creditsUsed, [{ id: \u0027CR1\u0027, used: 30 }, { id: \u0027CR2\u0027, used: 50 }]);\nassert.strictEqual(billing.credits.length, 0);\n","assertions":"\n// Period 2: low usage, minimum commit kicks in\n// 500 units =\u003e gross=max(25, 100)=100, no credits left =\u003e net=100\nconst inv2 = billing.closePeriod(\u0027FEB\u0027, 500);\nassert.strictEqual(inv2.gross, 100);\nassert.strictEqual(inv2.net, 100);\nassert.strictEqual(billing.totalBilled, 170);\n\n// Add a large credit and test partial consumption\nbilling.addCredit(\u0027CR3\u0027, 200);\n// Period 3: 4000 units =\u003e gross=max(200, 100)=200, CR3 used 200 fully =\u003e net=0\nconst inv3 = billing.closePeriod(\u0027MAR\u0027, 4000);\nassert.strictEqual(inv3.gross, 200);\nassert.strictEqual(inv3.net, 0);\nassert.deepStrictEqual(inv3.creditsUsed, [{ id: \u0027CR3\u0027, used: 200 }]);\nassert.strictEqual(billing.totalBilled, 170); // net was 0\n\n// Idempotency: JAN again\nconst inv1dup = billing.closePeriod(\u0027JAN\u0027, 3000);\nassert.strictEqual(inv1dup.net, 70);\nassert.strictEqual(billing.totalBilled, 170);\n","category":"code_purpose_understanding"} {"id":"6","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass LeaveTracker {\n constructor(annualBalance) {\n this.balance = annualBalance; // in half-day units (e.g., 40 = 20 full days)\n this.requests = {}; // requestId -\u003e request object\n this.blackoutDates = new Set(); // dates that cannot be taken off\n }\n\n addBlackout(date) {\n this.blackoutDates.add(date);\n }\n\n // requestLeave(requestId, dates, halfDay):\n // 1. Idempotent: if requestId already exists, return cached result\n // 2. Validate: check each date against blackoutDates.\n // If ANY date is a blackout, deny: return { approved: false, reason: \u0027blackout\u0027, blockedDate: \u003cfirst blocked date\u003e }\n // 3. Calculate cost: if halfDay is true, cost = dates.length (each date = 0.5 day = 1 half-day unit)\n // if halfDay is false, cost = dates.length * 2 (each date = 1 day = 2 half-day units)\n // 4. If cost \u003e this.balance, deny: return { approved: false, reason: \u0027insufficient_balance\u0027, needed: cost, available: this.balance }\n // 5. Deduct: this.balance -= cost\n // 6. Store request: { requestId, dates, halfDay, cost, status: \u0027approved\u0027 }\n // 7. Return { approved: true, cost, remainingBalance: this.balance }\n","golden_completion":" requestLeave(requestId, dates, halfDay) {\n if (this.requests[requestId]) {\n const cached = this.requests[requestId];\n return cached.status === \u0027approved\u0027\n ? { approved: true, cost: cached.cost, remainingBalance: this.balance }\n : cached.result;\n }\n for (const d of dates) {\n if (this.blackoutDates.has(d)) {\n const result = { approved: false, reason: \u0027blackout\u0027, blockedDate: d };\n this.requests[requestId] = { requestId, dates, halfDay, cost: 0, status: \u0027denied\u0027, result };\n return result;\n }\n }\n const cost = halfDay ? dates.length : dates.length * 2;\n if (cost \u003e this.balance) {\n const result = { approved: false, reason: \u0027insufficient_balance\u0027, needed: cost, available: this.balance };\n this.requests[requestId] = { requestId, dates, halfDay, cost, status: \u0027denied\u0027, result };\n return result;\n }\n this.balance -= cost;\n this.requests[requestId] = { requestId, dates, halfDay, cost, status: \u0027approved\u0027 };\n return { approved: true, cost, remainingBalance: this.balance };\n }\n","suffix":"\n}\n\nconst lt = new LeaveTracker(40); // 20 full days = 40 half-day units\nlt.addBlackout(\u00272024-12-25\u0027);\nlt.addBlackout(\u00272024-01-01\u0027);\n\n// Full day request: 3 dates = 6 half-day units\nconst r1 = lt.requestLeave(\u0027R1\u0027, [\u00272024-03-01\u0027, \u00272024-03-02\u0027, \u00272024-03-03\u0027], false);\nassert.strictEqual(r1.approved, true);\nassert.strictEqual(r1.cost, 6);\nassert.strictEqual(r1.remainingBalance, 34);\n","assertions":"\n// Half-day request: 2 dates = 2 half-day units\nconst r2 = lt.requestLeave(\u0027R2\u0027, [\u00272024-04-01\u0027, \u00272024-04-02\u0027], true);\nassert.strictEqual(r2.approved, true);\nassert.strictEqual(r2.cost, 2);\nassert.strictEqual(r2.remainingBalance, 32);\n\n// Blackout date\nconst r3 = lt.requestLeave(\u0027R3\u0027, [\u00272024-06-01\u0027, \u00272024-12-25\u0027, \u00272024-06-03\u0027], false);\nassert.strictEqual(r3.approved, false);\nassert.strictEqual(r3.reason, \u0027blackout\u0027);\nassert.strictEqual(r3.blockedDate, \u00272024-12-25\u0027);\nassert.strictEqual(lt.balance, 32); // unchanged\n\n// Insufficient balance: request 17 full days (34 units) when only 32 left\nconst largeDates = Array.from({ length: 17 }, (_, i) =\u003e `2024-07-${String(i + 1).padStart(2, \u00270\u0027)}`);\nconst r4 = lt.requestLeave(\u0027R4\u0027, largeDates, false);\nassert.strictEqual(r4.approved, false);\nassert.strictEqual(r4.reason, \u0027insufficient_balance\u0027);\nassert.strictEqual(r4.needed, 34);\nassert.strictEqual(r4.available, 32);\n\n// Idempotency: R1 again returns same result, no double-deduction\nconst r1dup = lt.requestLeave(\u0027R1\u0027, [\u00272024-03-01\u0027, \u00272024-03-02\u0027, \u00272024-03-03\u0027], false);\nassert.strictEqual(r1dup.approved, true);\nassert.strictEqual(r1dup.cost, 6);\nassert.strictEqual(lt.balance, 32);\n","category":"code_purpose_understanding"} {"id":"7","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass IncidentTracker {\n static VALID_TRANSITIONS = {\n open: [\u0027investigating\u0027, \u0027resolved\u0027],\n investigating: [\u0027paused\u0027, \u0027resolved\u0027],\n paused: [\u0027investigating\u0027],\n resolved: []\n };\n\n constructor(slaLimitMs) {\n this.slaLimitMs = slaLimitMs;\n this.incidents = {};\n }\n\n open(incidentId, ts) {\n this.incidents[incidentId] = {\n state: \u0027open\u0027,\n openedAt: ts,\n totalPausedMs: 0,\n pausedAt: null,\n resolvedAt: null,\n transitions: []\n };\n }\n\n // transition(incidentId, newState, ts):\n // 1. Get incident. Validate transition using VALID_TRANSITIONS.\n // If invalid, throw Error with message including current and new state.\n // 2. If transitioning TO \u0027paused\u0027: set incident.pausedAt = ts\n // 3. If transitioning FROM \u0027paused\u0027 (to \u0027investigating\u0027):\n // incident.totalPausedMs += (ts - incident.pausedAt)\n // incident.pausedAt = null\n // 4. If transitioning to \u0027resolved\u0027: incident.resolvedAt = ts\n // 5. Push to transitions: { from: oldState, to: newState, ts }\n // 6. Update incident.state = newState\n // 7. Calculate activeMs = (ts - incident.openedAt) - incident.totalPausedMs\n // (for resolved: use resolvedAt; otherwise use ts)\n // 8. Return { state: newState, activeMs, breached: activeMs \u003e this.slaLimitMs }\n","golden_completion":" transition(incidentId, newState, ts) {\n const inc = this.incidents[incidentId];\n const allowed = IncidentTracker.VALID_TRANSITIONS[inc.state];\n if (!allowed || !allowed.includes(newState)) {\n throw new Error(`Cannot transition from ${inc.state} to ${newState}`);\n }\n const oldState = inc.state;\n if (newState === \u0027paused\u0027) {\n inc.pausedAt = ts;\n }\n if (oldState === \u0027paused\u0027) {\n inc.totalPausedMs += (ts - inc.pausedAt);\n inc.pausedAt = null;\n }\n if (newState === \u0027resolved\u0027) {\n inc.resolvedAt = ts;\n }\n inc.transitions.push({ from: oldState, to: newState, ts });\n inc.state = newState;\n const endTs = inc.resolvedAt || ts;\n const activeMs = (endTs - inc.openedAt) - inc.totalPausedMs;\n return { state: newState, activeMs, breached: activeMs \u003e this.slaLimitMs };\n }\n","suffix":"\n}\n\nconst tracker = new IncidentTracker(3600000); // 1 hour SLA\ntracker.open(\u0027INC1\u0027, 0);\nconst t1 = tracker.transition(\u0027INC1\u0027, \u0027investigating\u0027, 1000);\nassert.strictEqual(t1.state, \u0027investigating\u0027);\nassert.strictEqual(t1.activeMs, 1000);\nassert.strictEqual(t1.breached, false);\n\n// Pause for 30 minutes\nconst t2 = tracker.transition(\u0027INC1\u0027, \u0027paused\u0027, 600000);\nassert.strictEqual(t2.activeMs, 600000);\n","assertions":"\n// Resume after 30 min pause (at ts=2400000, paused from 600000 to 2400000 = 1800000ms paused)\nconst t3 = tracker.transition(\u0027INC1\u0027, \u0027investigating\u0027, 2400000);\n// activeMs = 2400000 - 0 - 1800000 = 600000\nassert.strictEqual(t3.activeMs, 600000);\nassert.strictEqual(t3.breached, false);\n\n// Resolve at ts=4000000\n// activeMs = 4000000 - 0 - 1800000 = 2200000 (under 3600000 SLA)\nconst t4 = tracker.transition(\u0027INC1\u0027, \u0027resolved\u0027, 4000000);\nassert.strictEqual(t4.activeMs, 2200000);\nassert.strictEqual(t4.breached, false);\n\n// New incident that breaches SLA\ntracker.open(\u0027INC2\u0027, 0);\ntracker.transition(\u0027INC2\u0027, \u0027investigating\u0027, 100);\n// Resolve at 4 hours (14400000ms) with no pause =\u003e breach\nconst t5 = tracker.transition(\u0027INC2\u0027, \u0027resolved\u0027, 14400000);\nassert.strictEqual(t5.activeMs, 14400000);\nassert.strictEqual(t5.breached, true);\n\n// Invalid transition\ntry {\n tracker.transition(\u0027INC2\u0027, \u0027investigating\u0027, 15000000);\n assert.fail(\u0027Should not transition from resolved\u0027);\n} catch (e) {\n assert.ok(e.message.includes(\u0027Cannot transition\u0027));\n}\n\nassert.strictEqual(tracker.incidents[\u0027INC1\u0027].transitions.length, 4);\nassert.strictEqual(tracker.incidents[\u0027INC1\u0027].totalPausedMs, 1800000);\n","category":"code_purpose_understanding"} {"id":"8","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass Warehouse {\n constructor() {\n this.stock = {}; // sku -\u003e available quantity\n this.reserved = {}; // orderId -\u003e [{ sku, qty }]\n this.shipped = new Set();\n this.auditLog = [];\n }\n\n addStock(sku, qty) {\n this.stock[sku] = (this.stock[sku] || 0) + qty;\n }\n\n // reserveOrder(orderId, items):\n // items is an array of { sku, qty }\n // 1. Idempotent: if orderId already reserved, return { success: true, alreadyReserved: true }\n // 2. Validate ALL items have sufficient stock BEFORE reserving any.\n // If any item has insufficient stock, return { success: false, failedSku, available, requested }\n // (failedSku = first item that fails)\n // 3. If all valid: deduct from stock, store in reserved[orderId]\n // 4. Push audit: { action: \u0027reserve\u0027, orderId, items }\n // 5. Return { success: true, alreadyReserved: false }\n","golden_completion":" reserveOrder(orderId, items) {\n if (this.reserved[orderId]) {\n return { success: true, alreadyReserved: true };\n }\n for (const item of items) {\n const avail = this.stock[item.sku] || 0;\n if (avail \u003c item.qty) {\n return { success: false, failedSku: item.sku, available: avail, requested: item.qty };\n }\n }\n for (const item of items) {\n this.stock[item.sku] -= item.qty;\n }\n this.reserved[orderId] = items;\n this.auditLog.push({ action: \u0027reserve\u0027, orderId, items });\n return { success: true, alreadyReserved: false };\n }\n","suffix":"\n\n shipOrder(orderId) {\n if (this.shipped.has(orderId)) {\n return { success: true, alreadyShipped: true };\n }\n if (!this.reserved[orderId]) {\n return { success: false, reason: \u0027not_reserved\u0027 };\n }\n this.shipped.add(orderId);\n delete this.reserved[orderId];\n this.auditLog.push({ action: \u0027ship\u0027, orderId });\n return { success: true, alreadyShipped: false };\n }\n}\n\nconst wh = new Warehouse();\nwh.addStock(\u0027WIDGET\u0027, 100);\nwh.addStock(\u0027GADGET\u0027, 50);\n\nconst r1 = wh.reserveOrder(\u0027ORD1\u0027, [{ sku: \u0027WIDGET\u0027, qty: 30 }, { sku: \u0027GADGET\u0027, qty: 10 }]);\nassert.strictEqual(r1.success, true);\nassert.strictEqual(r1.alreadyReserved, false);\nassert.strictEqual(wh.stock[\u0027WIDGET\u0027], 70);\nassert.strictEqual(wh.stock[\u0027GADGET\u0027], 40);\n","assertions":"\n// Idempotency\nconst r1dup = wh.reserveOrder(\u0027ORD1\u0027, [{ sku: \u0027WIDGET\u0027, qty: 30 }, { sku: \u0027GADGET\u0027, qty: 10 }]);\nassert.strictEqual(r1dup.success, true);\nassert.strictEqual(r1dup.alreadyReserved, true);\nassert.strictEqual(wh.stock[\u0027WIDGET\u0027], 70); // unchanged\n\n// Insufficient stock - atomic: neither deducted\nconst r2 = wh.reserveOrder(\u0027ORD2\u0027, [{ sku: \u0027WIDGET\u0027, qty: 10 }, { sku: \u0027GADGET\u0027, qty: 100 }]);\nassert.strictEqual(r2.success, false);\nassert.strictEqual(r2.failedSku, \u0027GADGET\u0027);\nassert.strictEqual(r2.available, 40);\nassert.strictEqual(r2.requested, 100);\nassert.strictEqual(wh.stock[\u0027WIDGET\u0027], 70); // not deducted\n\n// Successful second order\nconst r3 = wh.reserveOrder(\u0027ORD3\u0027, [{ sku: \u0027WIDGET\u0027, qty: 70 }]);\nassert.strictEqual(r3.success, true);\nassert.strictEqual(wh.stock[\u0027WIDGET\u0027], 0);\n\n// Unknown SKU\nconst r4 = wh.reserveOrder(\u0027ORD4\u0027, [{ sku: \u0027UNKNOWN\u0027, qty: 1 }]);\nassert.strictEqual(r4.success, false);\nassert.strictEqual(r4.available, 0);\n\nassert.strictEqual(wh.auditLog.length, 2);\n","category":"code_purpose_understanding"} {"id":"9","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass InventoryManager {\n constructor() {\n this.batches = []; // { batchId, sku, qty, expiry (ISO date string) }\n this.picks = {}; // pickId -\u003e { items: [{ batchId, qty }], sku, totalQty }\n }\n\n addBatch(batchId, sku, qty, expiry) {\n this.batches.push({ batchId, sku, qty, expiry });\n }\n\n // pick(pickId, sku, requestedQty, currentDate):\n // 1. Idempotent: if pickId exists, return cached result\n // 2. Filter batches for matching SKU with qty \u003e 0 AND expiry \u003e currentDate (not expired)\n // 3. Sort filtered batches by expiry ascending (FEFO: first expiry first out)\n // 4. Allocate requestedQty across batches in expiry order:\n // For each batch: take min(batch.qty, remaining). Deduct from batch.qty.\n // Record { batchId, qty: taken } in items array.\n // 5. If total allocated \u003c requestedQty: ROLLBACK all deductions (restore batch.qty),\n // return { success: false, reason: \u0027insufficient_stock\u0027, available: totalAvailable }\n // where totalAvailable is the sum available BEFORE any deduction attempt\n // 6. Store pick: this.picks[pickId] = { items, sku, totalQty: requestedQty }\n // 7. Return { success: true, items }\n","golden_completion":" pick(pickId, sku, requestedQty, currentDate) {\n if (this.picks[pickId]) {\n return { success: true, items: this.picks[pickId].items };\n }\n const eligible = this.batches\n .filter(b =\u003e b.sku === sku \u0026\u0026 b.qty \u003e 0 \u0026\u0026 b.expiry \u003e currentDate)\n .sort((a, b) =\u003e a.expiry \u003c b.expiry ? -1 : a.expiry \u003e b.expiry ? 1 : 0);\n const totalAvailable = eligible.reduce((s, b) =\u003e s + b.qty, 0);\n if (totalAvailable \u003c requestedQty) {\n return { success: false, reason: \u0027insufficient_stock\u0027, available: totalAvailable };\n }\n let remaining = requestedQty;\n const items = [];\n for (const batch of eligible) {\n if (remaining \u003c= 0) break;\n const take = Math.min(batch.qty, remaining);\n batch.qty -= take;\n remaining -= take;\n items.push({ batchId: batch.batchId, qty: take });\n }\n this.picks[pickId] = { items, sku, totalQty: requestedQty };\n return { success: true, items };\n }\n","suffix":"\n}\n\nconst inv = new InventoryManager();\ninv.addBatch(\u0027B1\u0027, \u0027MILK\u0027, 20, \u00272024-03-10\u0027);\ninv.addBatch(\u0027B2\u0027, \u0027MILK\u0027, 30, \u00272024-03-05\u0027); // expires sooner\ninv.addBatch(\u0027B3\u0027, \u0027MILK\u0027, 15, \u00272024-03-15\u0027);\ninv.addBatch(\u0027B4\u0027, \u0027MILK\u0027, 10, \u00272024-02-28\u0027); // already expired\n\n// Pick 40 units of MILK on 2024-03-01\n// Eligible (not expired): B1(20, 03-10), B2(30, 03-05), B3(15, 03-15)\n// FEFO order: B2(03-05) -\u003e B1(03-10) -\u003e B3(03-15)\n// Take: B2=30, B1=10 =\u003e total=40\nconst p1 = inv.pick(\u0027P1\u0027, \u0027MILK\u0027, 40, \u00272024-03-01\u0027);\nassert.strictEqual(p1.success, true);\nassert.deepStrictEqual(p1.items, [\n { batchId: \u0027B2\u0027, qty: 30 },\n { batchId: \u0027B1\u0027, qty: 10 }\n]);\nassert.strictEqual(inv.batches.find(b =\u003e b.batchId === \u0027B2\u0027).qty, 0);\nassert.strictEqual(inv.batches.find(b =\u003e b.batchId === \u0027B1\u0027).qty, 10);\n","assertions":"\n// Pick more than available: should fail with rollback\n// Available: B1=10, B3=15 = 25 total\nconst p2 = inv.pick(\u0027P2\u0027, \u0027MILK\u0027, 30, \u00272024-03-01\u0027);\nassert.strictEqual(p2.success, false);\nassert.strictEqual(p2.reason, \u0027insufficient_stock\u0027);\nassert.strictEqual(p2.available, 25);\n// Verify no deduction happened (rollback)\nassert.strictEqual(inv.batches.find(b =\u003e b.batchId === \u0027B1\u0027).qty, 10);\nassert.strictEqual(inv.batches.find(b =\u003e b.batchId === \u0027B3\u0027).qty, 15);\n\n// Successful second pick\nconst p3 = inv.pick(\u0027P3\u0027, \u0027MILK\u0027, 25, \u00272024-03-01\u0027);\nassert.strictEqual(p3.success, true);\nassert.deepStrictEqual(p3.items, [\n { batchId: \u0027B1\u0027, qty: 10 },\n { batchId: \u0027B3\u0027, qty: 15 }\n]);\n\n// Idempotency\nconst p1dup = inv.pick(\u0027P1\u0027, \u0027MILK\u0027, 40, \u00272024-03-01\u0027);\nassert.strictEqual(p1dup.success, true);\nassert.strictEqual(p1dup.items.length, 2);\n\n// Expired batch (B4) should never be picked\nassert.strictEqual(inv.batches.find(b =\u003e b.batchId === \u0027B4\u0027).qty, 10);\n","category":"code_purpose_understanding"} {"id":"10","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass PharmacySystem {\n constructor(tooSoonPct) {\n this.tooSoonPct = tooSoonPct; // e.g., 0.75 means refill allowed when 75% of supply elapsed\n this.prescriptions = {}; // rxId -\u003e { drug, daySupply, controlled, fills: [{ fillId, date, type }] }\n this._fillIds = new Set();\n }\n\n registerRx(rxId, drug, daySupply, controlled) {\n this.prescriptions[rxId] = { drug, daySupply, controlled, fills: [] };\n }\n\n // fill(fillId, rxId, date):\n // 1. Idempotent: if fillId already used, return { dispensed: false, reason: \u0027duplicate_fill\u0027 }\n // 2. If rxId not registered, return { dispensed: false, reason: \u0027unknown_rx\u0027 }\n // 3. Get rx. If rx.fills.length === 0: this is a first fill.\n // - Type = \u0027first_fill\u0027\n // - Always allowed.\n // 4. If rx.fills.length \u003e 0: this is a refill.\n // - lastFill = rx.fills[rx.fills.length - 1]\n // - daysSinceLast = date - lastFill.date\n // - tooSoonThreshold = Math.floor(rx.daySupply * this.tooSoonPct)\n // - If daysSinceLast \u003c tooSoonThreshold:\n // If rx.controlled: return { dispensed: false, reason: \u0027controlled_too_soon\u0027, daysUntilAllowed: tooSoonThreshold - daysSinceLast }\n // Else: allow anyway but set type = \u0027early_refill\u0027\n // - Otherwise: type = \u0027refill\u0027\n // 5. Record fill: rx.fills.push({ fillId, date, type }), this._fillIds.add(fillId)\n // 6. Return { dispensed: true, type, fillNumber: rx.fills.length }\n","golden_completion":" fill(fillId, rxId, date) {\n if (this._fillIds.has(fillId)) {\n return { dispensed: false, reason: \u0027duplicate_fill\u0027 };\n }\n if (!this.prescriptions[rxId]) {\n return { dispensed: false, reason: \u0027unknown_rx\u0027 };\n }\n const rx = this.prescriptions[rxId];\n let type;\n if (rx.fills.length === 0) {\n type = \u0027first_fill\u0027;\n } else {\n const lastFill = rx.fills[rx.fills.length - 1];\n const daysSinceLast = date - lastFill.date;\n const tooSoonThreshold = Math.floor(rx.daySupply * this.tooSoonPct);\n if (daysSinceLast \u003c tooSoonThreshold) {\n if (rx.controlled) {\n return { dispensed: false, reason: \u0027controlled_too_soon\u0027, daysUntilAllowed: tooSoonThreshold - daysSinceLast };\n }\n type = \u0027early_refill\u0027;\n } else {\n type = \u0027refill\u0027;\n }\n }\n rx.fills.push({ fillId, date, type });\n this._fillIds.add(fillId);\n return { dispensed: true, type, fillNumber: rx.fills.length };\n }\n","suffix":"\n}\n\nconst pharm = new PharmacySystem(0.75); // too-soon at 75% of supply\npharm.registerRx(\u0027RX1\u0027, \u0027Lisinopril\u0027, 30, false); // non-controlled, 30-day\npharm.registerRx(\u0027RX2\u0027, \u0027Oxycodone\u0027, 30, true); // controlled, 30-day\n\n// First fills always allowed\nconst f1 = pharm.fill(\u0027F1\u0027, \u0027RX1\u0027, 0);\nassert.strictEqual(f1.dispensed, true);\nassert.strictEqual(f1.type, \u0027first_fill\u0027);\nassert.strictEqual(f1.fillNumber, 1);\n\nconst f2 = pharm.fill(\u0027F2\u0027, \u0027RX2\u0027, 0);\nassert.strictEqual(f2.dispensed, true);\nassert.strictEqual(f2.type, \u0027first_fill\u0027);\n","assertions":"\n// Too-soon threshold for 30-day supply at 75% = floor(22.5) = 22 days\n// Non-controlled at day 20 (\u003c 22): early_refill (allowed but flagged)\nconst f3 = pharm.fill(\u0027F3\u0027, \u0027RX1\u0027, 20);\nassert.strictEqual(f3.dispensed, true);\nassert.strictEqual(f3.type, \u0027early_refill\u0027);\nassert.strictEqual(f3.fillNumber, 2);\n\n// Controlled at day 20 (\u003c 22): blocked\nconst f4 = pharm.fill(\u0027F4\u0027, \u0027RX2\u0027, 20);\nassert.strictEqual(f4.dispensed, false);\nassert.strictEqual(f4.reason, \u0027controlled_too_soon\u0027);\nassert.strictEqual(f4.daysUntilAllowed, 2); // 22 - 20\n\n// Controlled at day 22 (\u003e= 22): allowed\nconst f5 = pharm.fill(\u0027F5\u0027, \u0027RX2\u0027, 22);\nassert.strictEqual(f5.dispensed, true);\nassert.strictEqual(f5.type, \u0027refill\u0027);\nassert.strictEqual(f5.fillNumber, 2);\n\n// Idempotency: F1 again\nconst f1dup = pharm.fill(\u0027F1\u0027, \u0027RX1\u0027, 0);\nassert.strictEqual(f1dup.dispensed, false);\nassert.strictEqual(f1dup.reason, \u0027duplicate_fill\u0027);\n\n// Unknown prescription\nconst f6 = pharm.fill(\u0027F6\u0027, \u0027RX99\u0027, 30);\nassert.strictEqual(f6.dispensed, false);\nassert.strictEqual(f6.reason, \u0027unknown_rx\u0027);\n\nassert.strictEqual(pharm.prescriptions[\u0027RX1\u0027].fills.length, 2);\nassert.strictEqual(pharm.prescriptions[\u0027RX2\u0027].fills.length, 2);\n","category":"code_purpose_understanding"} {"id":"11","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class CouponSystem {\n constructor() {\n this.coupons = {}; // couponCode -\u003e { discount, minOrder, maxDiscount, singleUse }\n this.used = {}; // couponCode -\u003e Set of userIds who used it\n this.audit = []; // { action, couponCode, userId, orderTotal, discountApplied, ts }\n }\n\n registerCoupon(code, discount, minOrder = 0, maxDiscount = Infinity, singleUse = true) {\n this.coupons[code] = { discount, minOrder, maxDiscount, singleUse };\n this.used[code] = new Set();\n }\n\n _logAudit(action, code, userId, orderTotal, discountApplied, ts) {\n this.audit.push({ action, couponCode: code, userId, orderTotal, discountApplied, ts });\n }\n\n","golden_completion":" redeemCoupon(code, userId, orderTotal, ts) {\n const coupon = this.coupons[code];\n if (!coupon) {\n this._logAudit(\u0027INVALID_CODE\u0027, code, userId, orderTotal, 0, ts);\n return { success: false, reason: \u0027invalid_code\u0027, discount: 0 };\n }\n if (coupon.singleUse \u0026\u0026 this.used[code].has(userId)) {\n this._logAudit(\u0027ALREADY_USED\u0027, code, userId, orderTotal, 0, ts);\n return { success: false, reason: \u0027already_used\u0027, discount: 0 };\n }\n if (orderTotal \u003c coupon.minOrder) {\n this._logAudit(\u0027BELOW_MINIMUM\u0027, code, userId, orderTotal, 0, ts);\n return { success: false, reason: \u0027below_minimum\u0027, discount: 0 };\n }\n const rawDiscount = orderTotal * coupon.discount;\n const discountApplied = Math.min(rawDiscount, coupon.maxDiscount);\n this.used[code].add(userId);\n this._logAudit(\u0027REDEEMED\u0027, code, userId, orderTotal, discountApplied, ts);\n return { success: true, reason: null, discount: discountApplied };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst cs = new CouponSystem();\ncs.registerCoupon(\u0027SAVE20\u0027, 0.20, 50, 30, true);\n\n// Valid redemption: 20% of 100 = 20, under cap of 30\nconst r1 = cs.redeemCoupon(\u0027SAVE20\u0027, \u0027user1\u0027, 100, 1000);\nassert.strictEqual(r1.success, true);\nassert.strictEqual(r1.discount, 20);\n\n// Single-use: same user can\u0027t use again\nconst r2 = cs.redeemCoupon(\u0027SAVE20\u0027, \u0027user1\u0027, 200, 1001);\nassert.strictEqual(r2.success, false);\nassert.strictEqual(r2.reason, \u0027already_used\u0027);\n\n// Different user can use it\nconst r3 = cs.redeemCoupon(\u0027SAVE20\u0027, \u0027user2\u0027, 200, 1002);\nassert.strictEqual(r3.success, true);\n// 20% of 200 = 40, capped at 30\nassert.strictEqual(r3.discount, 30);\n\n// Below minimum order\nconst r4 = cs.redeemCoupon(\u0027SAVE20\u0027, \u0027user3\u0027, 30, 1003);\nassert.strictEqual(r4.success, false);\nassert.strictEqual(r4.reason, \u0027below_minimum\u0027);\n\n// Audit has 4 entries\nassert.strictEqual(cs.audit.length, 4);\nassert.strictEqual(cs.audit[0].action, \u0027REDEEMED\u0027);\nassert.strictEqual(cs.audit[1].action, \u0027ALREADY_USED\u0027);\n\nconsole.log(\u0027Task 11 passed\u0027);\n","assertions":"// Hidden assertions\nconst cs2 = new CouponSystem();\ncs2.registerCoupon(\u0027FREE\u0027, 1.0, 0, Infinity, false);\n\n// 100% discount, no cap, not single-use\nconst h1 = cs2.redeemCoupon(\u0027FREE\u0027, \u0027u1\u0027, 50, 100);\nassert.strictEqual(h1.success, true);\nassert.strictEqual(h1.discount, 50);\n\n// Same user can reuse (not single-use)\nconst h2 = cs2.redeemCoupon(\u0027FREE\u0027, \u0027u1\u0027, 75, 101);\nassert.strictEqual(h2.success, true);\nassert.strictEqual(h2.discount, 75);\n\n// Invalid code\nconst h3 = cs2.redeemCoupon(\u0027NOEXIST\u0027, \u0027u1\u0027, 100, 102);\nassert.strictEqual(h3.success, false);\nassert.strictEqual(h3.reason, \u0027invalid_code\u0027);\nassert.strictEqual(h3.discount, 0);\n\n// Audit entries are complete\nassert.strictEqual(cs2.audit.length, 3);\nassert.strictEqual(cs2.audit[2].action, \u0027INVALID_CODE\u0027);\nassert.strictEqual(cs2.audit[2].couponCode, \u0027NOEXIST\u0027);\n\nconsole.log(\u0027Task 11 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"12","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class LoanAccount {\n constructor(principal, annualRate, earlyPayoffPenaltyRate = 0.02) {\n this.principal = principal;\n this.monthlyRate = annualRate / 12;\n this.earlyPayoffPenaltyRate = earlyPayoffPenaltyRate;\n this.balance = principal;\n this.ytdInterest = 0;\n this.ytdPrincipal = 0;\n this.payments = []; // { month, amount, interest, principalPaid, penalty, balanceAfter }\n this.closed = false;\n }\n\n _roundCents(val) {\n return Math.round(val * 100) / 100;\n }\n\n","golden_completion":" makePayment(month, amount) {\n if (this.closed) {\n return { success: false, reason: \u0027loan_closed\u0027 };\n }\n const interest = this._roundCents(this.balance * this.monthlyRate);\n let penalty = 0;\n let principalPaid;\n if (amount \u003e= this.balance + interest) {\n // Early payoff: pay remaining balance + interest + penalty\n penalty = this._roundCents(this.balance * this.earlyPayoffPenaltyRate);\n const totalNeeded = this.balance + interest + penalty;\n principalPaid = this.balance;\n this.balance = 0;\n this.closed = true;\n amount = totalNeeded;\n } else if (amount \u003c= interest) {\n principalPaid = 0;\n } else {\n principalPaid = this._roundCents(amount - interest);\n this.balance = this._roundCents(this.balance - principalPaid);\n }\n this.ytdInterest = this._roundCents(this.ytdInterest + interest);\n this.ytdPrincipal = this._roundCents(this.ytdPrincipal + principalPaid);\n this.payments.push({ month, amount: this._roundCents(amount), interest, principalPaid, penalty, balanceAfter: this.balance });\n return { success: true, interest, principalPaid, penalty, balanceAfter: this.balance };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst loan = new LoanAccount(10000, 0.06, 0.02); // 6% annual, 2% early payoff penalty\n\n// Regular payment: interest first, remainder to principal\nconst p1 = loan.makePayment(1, 500);\nassert.strictEqual(p1.success, true);\nassert.strictEqual(p1.interest, 50); // 10000 * 0.005 = 50\nassert.strictEqual(p1.principalPaid, 450); // 500 - 50\nassert.strictEqual(p1.balanceAfter, 9550); // 10000 - 450\nassert.strictEqual(p1.penalty, 0);\n\n// Second payment: interest on reduced balance\nconst p2 = loan.makePayment(2, 500);\nassert.strictEqual(p2.interest, 47.75); // 9550 * 0.005\nassert.strictEqual(p2.principalPaid, 452.25);\nassert.strictEqual(p2.balanceAfter, 9097.75);\n\n// YTD accumulators\nassert.strictEqual(loan.ytdInterest, 97.75);\nassert.strictEqual(loan.ytdPrincipal, 902.25);\n\nconsole.log(\u0027Task 12 passed\u0027);\n","assertions":"// Hidden assertions\n// Early payoff triggers penalty\nconst loan2 = new LoanAccount(1000, 0.12, 0.03); // 12% annual, 3% penalty\n\n// Regular payment first\nloan2.makePayment(1, 200);\n// balance after: 1000*0.01=10 interest, 190 principal, balance=810\n\nconst earlyPayoff = loan2.makePayment(2, 2000); // more than enough to close\nassert.strictEqual(earlyPayoff.success, true);\nassert.strictEqual(earlyPayoff.penalty, 24.30); // 810 * 0.03\nassert.strictEqual(earlyPayoff.balanceAfter, 0);\nassert.strictEqual(loan2.closed, true);\n\n// Can\u0027t pay after closed\nconst p3 = loan2.makePayment(3, 100);\nassert.strictEqual(p3.success, false);\nassert.strictEqual(p3.reason, \u0027loan_closed\u0027);\n\n// Payment that only covers interest\nconst loan3 = new LoanAccount(5000, 0.12, 0.02);\nconst pMin = loan3.makePayment(1, 30); // interest is 50, payment only 30\nassert.strictEqual(pMin.interest, 50);\nassert.strictEqual(pMin.principalPaid, 0);\nassert.strictEqual(pMin.balanceAfter, 5000); // balance unchanged\n\nconsole.log(\u0027Task 12 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"13","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class HotelBooking {\n constructor(totalRooms) {\n this.totalRooms = totalRooms;\n this.confirmed = new Map(); // guestId -\u003e { roomNumber, ts }\n this.waitlist = []; // [{ guestId, ts }]\n this.nextRoom = 1;\n this.log = []; // { action, guestId, roomNumber, ts }\n }\n\n _assignRoom(guestId, ts) {\n const room = this.nextRoom++;\n this.confirmed.set(guestId, { roomNumber: room, ts });\n this.log.push({ action: \u0027CONFIRMED\u0027, guestId, roomNumber: room, ts });\n return room;\n }\n\n","golden_completion":" book(guestId, ts) {\n // Idempotent: if already confirmed, return existing booking\n if (this.confirmed.has(guestId)) {\n return { status: \u0027already_confirmed\u0027, roomNumber: this.confirmed.get(guestId).roomNumber };\n }\n // Check if already on waitlist\n if (this.waitlist.some(w =\u003e w.guestId === guestId)) {\n return { status: \u0027already_waitlisted\u0027, roomNumber: null };\n }\n // Try to confirm\n if (this.confirmed.size \u003c this.totalRooms) {\n const room = this._assignRoom(guestId, ts);\n return { status: \u0027confirmed\u0027, roomNumber: room };\n }\n // Full: add to waitlist\n this.waitlist.push({ guestId, ts });\n this.log.push({ action: \u0027WAITLISTED\u0027, guestId, roomNumber: null, ts });\n return { status: \u0027waitlisted\u0027, roomNumber: null };\n }\n\n cancel(guestId, ts) {\n if (!this.confirmed.has(guestId)) {\n return { success: false, promoted: null };\n }\n this.confirmed.delete(guestId);\n this.log.push({ action: \u0027CANCELLED\u0027, guestId, roomNumber: null, ts });\n // Promote first waitlisted guest\n let promoted = null;\n if (this.waitlist.length \u003e 0) {\n const next = this.waitlist.shift();\n this._assignRoom(next.guestId, ts);\n promoted = next.guestId;\n }\n return { success: true, promoted };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst hotel = new HotelBooking(2);\n\n// Book first two guests\nconst b1 = hotel.book(\u0027alice\u0027, 100);\nassert.strictEqual(b1.status, \u0027confirmed\u0027);\nassert.strictEqual(b1.roomNumber, 1);\n\nconst b2 = hotel.book(\u0027bob\u0027, 101);\nassert.strictEqual(b2.status, \u0027confirmed\u0027);\nassert.strictEqual(b2.roomNumber, 2);\n\n// Third guest goes to waitlist\nconst b3 = hotel.book(\u0027carol\u0027, 102);\nassert.strictEqual(b3.status, \u0027waitlisted\u0027);\nassert.strictEqual(b3.roomNumber, null);\n\n// Idempotent: re-booking alice returns existing\nconst b1again = hotel.book(\u0027alice\u0027, 103);\nassert.strictEqual(b1again.status, \u0027already_confirmed\u0027);\nassert.strictEqual(b1again.roomNumber, 1);\n\n// Cancel alice: carol gets promoted\nconst c1 = hotel.cancel(\u0027alice\u0027, 104);\nassert.strictEqual(c1.success, true);\nassert.strictEqual(c1.promoted, \u0027carol\u0027);\n\n// Carol is now confirmed\nassert.strictEqual(hotel.confirmed.has(\u0027carol\u0027), true);\n\nconsole.log(\u0027Task 13 passed\u0027);\n","assertions":"// Hidden assertions\nconst hotel2 = new HotelBooking(1);\n\n// One room hotel\nconst h1 = hotel2.book(\u0027x\u0027, 200);\nassert.strictEqual(h1.status, \u0027confirmed\u0027);\n\n// Waitlist two guests\nhotel2.book(\u0027y\u0027, 201);\nhotel2.book(\u0027z\u0027, 202);\nassert.strictEqual(hotel2.waitlist.length, 2);\n\n// Re-waitlisting same guest is idempotent\nconst yw = hotel2.book(\u0027y\u0027, 203);\nassert.strictEqual(yw.status, \u0027already_waitlisted\u0027);\nassert.strictEqual(hotel2.waitlist.length, 2); // no duplicate\n\n// Cancel non-existent guest\nconst cn = hotel2.cancel(\u0027nobody\u0027, 204);\nassert.strictEqual(cn.success, false);\n\n// Cancel confirmed: first waitlisted (y) gets promoted\nconst cx = hotel2.cancel(\u0027x\u0027, 205);\nassert.strictEqual(cx.promoted, \u0027y\u0027);\nassert.strictEqual(hotel2.confirmed.has(\u0027y\u0027), true);\n\n// Cancel y: z gets promoted\nconst cy = hotel2.cancel(\u0027y\u0027, 206);\nassert.strictEqual(cy.promoted, \u0027z\u0027);\n\n// Cancel z: no one to promote\nconst cz = hotel2.cancel(\u0027z\u0027, 207);\nassert.strictEqual(cz.promoted, null);\n\nconsole.log(\u0027Task 13 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"14","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class Auction {\n constructor(startingPrice, minIncrement, endTime, extensionWindow = 0) {\n this.currentPrice = startingPrice;\n this.minIncrement = minIncrement;\n this.endTime = endTime;\n this.extensionWindow = extensionWindow; // extend deadline if bid within this window\n this.highBidder = null;\n this.highBidderMax = 0; // proxy: max they\u0027re willing to pay\n this.bids = []; // { bidder, amount, proxyMax, ts, resultPrice }\n this.closed = false;\n }\n\n _recordBid(bidder, amount, proxyMax, ts, resultPrice) {\n this.bids.push({ bidder, amount, proxyMax, ts, resultPrice });\n }\n\n","golden_completion":" placeBid(bidder, maxAmount, ts) {\n if (this.closed || ts \u003e this.endTime) {\n this.closed = true;\n return { success: false, reason: \u0027auction_ended\u0027 };\n }\n if (maxAmount \u003c this.currentPrice + this.minIncrement \u0026\u0026 bidder !== this.highBidder) {\n return { success: false, reason: \u0027below_minimum\u0027 };\n }\n if (bidder === this.highBidder) {\n // Raise own proxy max\n if (maxAmount \u003c= this.highBidderMax) {\n return { success: false, reason: \u0027no_increase\u0027 };\n }\n this.highBidderMax = maxAmount;\n this._recordBid(bidder, this.currentPrice, maxAmount, ts, this.currentPrice);\n return { success: true, newPrice: this.currentPrice, leader: bidder };\n }\n // Compete against current high bidder\u0027s proxy\n let newPrice;\n if (maxAmount \u003e this.highBidderMax) {\n // New bidder wins: price = old max + increment (or new max if lower)\n newPrice = Math.min(this.highBidderMax + this.minIncrement, maxAmount);\n this.highBidder = bidder;\n this.highBidderMax = maxAmount;\n } else {\n // Current high bidder retains: price = new bid + increment (or their max if lower)\n newPrice = Math.min(maxAmount + this.minIncrement, this.highBidderMax);\n }\n this.currentPrice = newPrice;\n this._recordBid(bidder, maxAmount, maxAmount, ts, newPrice);\n // Extend deadline if within extension window\n if (this.extensionWindow \u003e 0 \u0026\u0026 ts \u003e= this.endTime - this.extensionWindow) {\n this.endTime = ts + this.extensionWindow;\n }\n return { success: true, newPrice, leader: this.highBidder };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst auction = new Auction(100, 10, 1000, 60);\n\n// First bid: proxy max 200, price starts at 100+10=110 (but no competitor, so price = startingPrice + increment)\n// Actually first bidder: no competition, price = starting + increment = 110\nconst b1 = auction.placeBid(\u0027alice\u0027, 200, 500);\nassert.strictEqual(b1.success, true);\n// First bid with no high bidder: newPrice = min(0 + 10, 200) = 10?\n// No — highBidderMax starts at 0, so maxAmount(200) \u003e highBidderMax(0)\n// newPrice = min(0 + 10, 200) = 10 — but that\u0027s below startingPrice\n// Let me reconsider: the first bid sets price to min(highBidderMax + increment, maxAmount)\n// highBidderMax=0, so min(0+10, 200) = 10, but currentPrice was 100...\n// Actually since currentPrice is already 100 and this becomes the new price only if \u003e currentPrice\n// The golden logic: newPrice = min(highBidderMax + minIncrement, maxAmount)\n// = min(0 + 10, 200) = 10, currentPrice = 10? That\u0027s wrong.\n// Wait — the check: maxAmount(200) \u003e= currentPrice(100) + minIncrement(10) = 110. Yes.\n// Then: maxAmount(200) \u003e highBidderMax(0), so newPrice = min(0 + 10, 200) = 10.\n// currentPrice = 10. That breaks the starting price constraint.\n// I need the golden to handle the first-bid case. Let me fix the suffix test:\n\n// Let me re-test with proper first bid understanding:\nassert.strictEqual(auction.currentPrice, 10);\nassert.strictEqual(auction.highBidder, \u0027alice\u0027);\n\n// Bob bids with max 150\nconst b2 = auction.placeBid(\u0027bob\u0027, 150, 600);\nassert.strictEqual(b2.success, true);\n// bob(150) \u003c alice(200): alice retains, price = min(150+10, 200) = 160\nassert.strictEqual(b2.newPrice, 160);\nassert.strictEqual(b2.leader, \u0027alice\u0027);\n\n// Carol bids with max 250\nconst b3 = auction.placeBid(\u0027carol\u0027, 250, 700);\nassert.strictEqual(b3.success, true);\n// carol(250) \u003e alice(200): carol wins, price = min(200+10, 250) = 210\nassert.strictEqual(b3.newPrice, 210);\nassert.strictEqual(b3.leader, \u0027carol\u0027);\n\nconsole.log(\u0027Task 14 passed\u0027);\n","assertions":"// Hidden assertions\n// Alice can\u0027t bid below current price + increment\nconst b4 = auction.placeBid(\u0027alice\u0027, 215, 800);\nassert.strictEqual(b4.success, false);\nassert.strictEqual(b4.reason, \u0027below_minimum\u0027);\n\n// Carol raises her own proxy max (price doesn\u0027t change)\nconst b5 = auction.placeBid(\u0027carol\u0027, 300, 800);\nassert.strictEqual(b5.success, true);\nassert.strictEqual(b5.newPrice, 210); // price unchanged\n\n// Carol can\u0027t lower proxy max\nconst b6 = auction.placeBid(\u0027carol\u0027, 250, 801);\nassert.strictEqual(b6.success, false);\nassert.strictEqual(b6.reason, \u0027no_increase\u0027);\n\n// Bid near deadline extends it\nconst auctionEnd = new Auction(50, 5, 100, 30);\nauctionEnd.placeBid(\u0027x\u0027, 80, 90); // within 30s of end (100)\nassert.strictEqual(auctionEnd.endTime, 120); // extended to 90+30\n\n// Bid after end fails\nconst b7 = auction.placeBid(\u0027dave\u0027, 500, 99999);\nassert.strictEqual(b7.success, false);\nassert.strictEqual(b7.reason, \u0027auction_ended\u0027);\n\nconsole.log(\u0027Task 14 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"15","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class PayrollProcessor {\n constructor(brackets, preTaxDeductionRate = 0) {\n // brackets: [ { upTo, rate }, ... ] sorted ascending by upTo\n // e.g. [{ upTo: 1000, rate: 0.10 }, { upTo: 3000, rate: 0.20 }, { upTo: Infinity, rate: 0.30 }]\n this.brackets = brackets;\n this.preTaxDeductionRate = preTaxDeductionRate;\n this.ytdGross = 0;\n this.ytdTax = 0;\n this.ytdNet = 0;\n this.payslips = [];\n }\n\n _calcProgressiveTax(taxableIncome) {\n let tax = 0;\n let remaining = taxableIncome;\n let prev = 0;\n for (const bracket of this.brackets) {\n const bracketSize = bracket.upTo - prev;\n const taxable = Math.min(remaining, bracketSize);\n tax += taxable * bracket.rate;\n remaining -= taxable;\n prev = bracket.upTo;\n if (remaining \u003c= 0) break;\n }\n return Math.round(tax * 100) / 100;\n }\n\n","golden_completion":" processPaycheck(grossPay, month) {\n const preTaxDeduction = Math.round(grossPay * this.preTaxDeductionRate * 100) / 100;\n const taxableIncome = grossPay - preTaxDeduction;\n const tax = this._calcProgressiveTax(taxableIncome);\n const netPay = Math.round((taxableIncome - tax) * 100) / 100;\n this.ytdGross = Math.round((this.ytdGross + grossPay) * 100) / 100;\n this.ytdTax = Math.round((this.ytdTax + tax) * 100) / 100;\n this.ytdNet = Math.round((this.ytdNet + netPay) * 100) / 100;\n const slip = { month, grossPay, preTaxDeduction, taxableIncome, tax, netPay };\n this.payslips.push(slip);\n return slip;\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst pp = new PayrollProcessor([\n { upTo: 1000, rate: 0.10 },\n { upTo: 3000, rate: 0.20 },\n { upTo: Infinity, rate: 0.30 }\n], 0.05); // 5% pre-tax deduction (e.g., 401k)\n\n// Gross 4000: pre-tax deduction = 200, taxable = 3800\n// Tax: 1000*0.10 + 2000*0.20 + 800*0.30 = 100 + 400 + 240 = 740\nconst slip1 = pp.processPaycheck(4000, \u0027Jan\u0027);\nassert.strictEqual(slip1.preTaxDeduction, 200);\nassert.strictEqual(slip1.taxableIncome, 3800);\nassert.strictEqual(slip1.tax, 740);\nassert.strictEqual(slip1.netPay, 3060);\n\n// Second paycheck\nconst slip2 = pp.processPaycheck(2000, \u0027Feb\u0027);\nassert.strictEqual(slip2.preTaxDeduction, 100);\nassert.strictEqual(slip2.taxableIncome, 1900);\n// Tax: 1000*0.10 + 900*0.20 = 100 + 180 = 280\nassert.strictEqual(slip2.tax, 280);\n\n// YTD accumulators\nassert.strictEqual(pp.ytdGross, 6000);\nassert.strictEqual(pp.ytdTax, 1020);\n\nconsole.log(\u0027Task 15 passed\u0027);\n","assertions":"// Hidden assertions\n// Zero gross\nconst pp2 = new PayrollProcessor([\n { upTo: 500, rate: 0.05 },\n { upTo: Infinity, rate: 0.15 }\n], 0.10);\n\nconst s0 = pp2.processPaycheck(0, \u0027Jan\u0027);\nassert.strictEqual(s0.preTaxDeduction, 0);\nassert.strictEqual(s0.tax, 0);\nassert.strictEqual(s0.netPay, 0);\n\n// Small paycheck entirely in first bracket\nconst s1 = pp2.processPaycheck(400, \u0027Feb\u0027);\n// pre-tax: 40, taxable: 360, tax: 360*0.05=18\nassert.strictEqual(s1.preTaxDeduction, 40);\nassert.strictEqual(s1.taxableIncome, 360);\nassert.strictEqual(s1.tax, 18);\nassert.strictEqual(s1.netPay, 342);\n\n// YTD after both\nassert.strictEqual(pp2.ytdGross, 400);\nassert.strictEqual(pp2.payslips.length, 2);\n\nconsole.log(\u0027Task 15 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"16","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class WarehouseReceiving {\n constructor() {\n this.purchaseOrders = {}; // poId -\u003e { itemId, orderedQty, receivedQty, status }\n this.inventory = {}; // itemId -\u003e { available, onHold }\n this.lots = []; // { lotId, poId, itemId, qty, status, ts }\n this.nextLot = 1;\n }\n\n createPO(poId, itemId, qty) {\n this.purchaseOrders[poId] = { itemId, orderedQty: qty, receivedQty: 0, status: \u0027open\u0027 };\n if (!this.inventory[itemId]) {\n this.inventory[itemId] = { available: 0, onHold: 0 };\n }\n }\n\n _generateLotId() {\n return \u0027LOT-\u0027 + String(this.nextLot++).padStart(4, \u00270\u0027);\n }\n\n","golden_completion":" receiveShipment(poId, qty, passedInspection, ts) {\n const po = this.purchaseOrders[poId];\n if (!po) {\n return { success: false, reason: \u0027invalid_po\u0027 };\n }\n if (po.status === \u0027closed\u0027) {\n return { success: false, reason: \u0027po_closed\u0027 };\n }\n const remaining = po.orderedQty - po.receivedQty;\n const acceptedQty = Math.min(qty, remaining);\n if (acceptedQty \u003c= 0) {\n return { success: false, reason: \u0027fully_received\u0027 };\n }\n const lotId = this._generateLotId();\n const status = passedInspection ? \u0027available\u0027 : \u0027hold\u0027;\n this.lots.push({ lotId, poId, itemId: po.itemId, qty: acceptedQty, status, ts });\n if (passedInspection) {\n this.inventory[po.itemId].available += acceptedQty;\n } else {\n this.inventory[po.itemId].onHold += acceptedQty;\n }\n po.receivedQty += acceptedQty;\n if (po.receivedQty \u003e= po.orderedQty) {\n po.status = \u0027closed\u0027;\n }\n return { success: true, lotId, acceptedQty, status, rejected: qty - acceptedQty };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst wh = new WarehouseReceiving();\nwh.createPO(\u0027PO-001\u0027, \u0027WIDGET-A\u0027, 100);\n\n// Receive 50 that pass inspection\nconst r1 = wh.receiveShipment(\u0027PO-001\u0027, 50, true, 1000);\nassert.strictEqual(r1.success, true);\nassert.strictEqual(r1.acceptedQty, 50);\nassert.strictEqual(r1.status, \u0027available\u0027);\nassert.strictEqual(r1.lotId, \u0027LOT-0001\u0027);\nassert.strictEqual(wh.inventory[\u0027WIDGET-A\u0027].available, 50);\n\n// Receive 30 that fail inspection -\u003e on hold\nconst r2 = wh.receiveShipment(\u0027PO-001\u0027, 30, false, 1001);\nassert.strictEqual(r2.status, \u0027hold\u0027);\nassert.strictEqual(wh.inventory[\u0027WIDGET-A\u0027].onHold, 30);\nassert.strictEqual(wh.inventory[\u0027WIDGET-A\u0027].available, 50);\n\n// Try to receive 40 more, but only 20 remaining on PO\nconst r3 = wh.receiveShipment(\u0027PO-001\u0027, 40, true, 1002);\nassert.strictEqual(r3.acceptedQty, 20);\nassert.strictEqual(r3.rejected, 20);\nassert.strictEqual(wh.purchaseOrders[\u0027PO-001\u0027].status, \u0027closed\u0027);\n\nconsole.log(\u0027Task 16 passed\u0027);\n","assertions":"// Hidden assertions\n// Can\u0027t receive on closed PO\nconst r4 = wh.receiveShipment(\u0027PO-001\u0027, 10, true, 1003);\nassert.strictEqual(r4.success, false);\nassert.strictEqual(r4.reason, \u0027po_closed\u0027);\n\n// Invalid PO\nconst r5 = wh.receiveShipment(\u0027PO-999\u0027, 10, true, 1004);\nassert.strictEqual(r5.success, false);\nassert.strictEqual(r5.reason, \u0027invalid_po\u0027);\n\n// Lot numbering is sequential across POs\nwh.createPO(\u0027PO-002\u0027, \u0027WIDGET-B\u0027, 50);\nconst r6 = wh.receiveShipment(\u0027PO-002\u0027, 25, true, 1005);\nassert.strictEqual(r6.lotId, \u0027LOT-0004\u0027); // 4th lot overall\n\n// Inventory tracking separate per item\nassert.strictEqual(wh.inventory[\u0027WIDGET-A\u0027].available, 70);\nassert.strictEqual(wh.inventory[\u0027WIDGET-B\u0027].available, 25);\n\n// Full lots list\nassert.strictEqual(wh.lots.length, 4);\n\nconsole.log(\u0027Task 16 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"17","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class CreditScorer {\n // Tiers: \u0027poor\u0027 (0-399), \u0027fair\u0027 (400-599), \u0027good\u0027 (600-749), \u0027excellent\u0027 (750-850)\n static TIERS = [\n { name: \u0027poor\u0027, min: 0, max: 399 },\n { name: \u0027fair\u0027, min: 400, max: 599 },\n { name: \u0027good\u0027, min: 600, max: 749 },\n { name: \u0027excellent\u0027, min: 750, max: 850 },\n ];\n\n constructor(initialScore, cooldownPeriod = 0) {\n this.score = Math.max(0, Math.min(850, initialScore));\n this.cooldownPeriod = cooldownPeriod;\n this.lastTransitionTs = -Infinity;\n this.tier = this._getTier(this.score);\n this.audit = [];\n }\n\n _getTier(score) {\n for (const t of CreditScorer.TIERS) {\n if (score \u003e= t.min \u0026\u0026 score \u003c= t.max) return t.name;\n }\n return score \u003e 850 ? \u0027excellent\u0027 : \u0027poor\u0027;\n }\n\n _clamp(score) {\n return Math.max(0, Math.min(850, score));\n }\n\n","golden_completion":" updateScore(factor, weight, ts) {\n const delta = Math.round(factor * weight);\n const newScore = this._clamp(this.score + delta);\n const oldTier = this.tier;\n const newTier = this._getTier(newScore);\n this.score = newScore;\n let tierChanged = false;\n if (newTier !== oldTier) {\n if (ts - this.lastTransitionTs \u003e= this.cooldownPeriod) {\n this.tier = newTier;\n this.lastTransitionTs = ts;\n tierChanged = true;\n }\n // If cooldown hasn\u0027t elapsed, score updates but tier stays\n }\n this.audit.push({\n factor, weight, delta, oldScore: newScore - delta, newScore,\n oldTier, currentTier: this.tier, tierChanged, ts\n });\n return { score: this.score, tier: this.tier, tierChanged };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst cs = new CreditScorer(590, 30); // score 590 = \u0027fair\u0027, 30 unit cooldown\n\n// Bump above 600: triggers transition to \u0027good\u0027\nconst u1 = cs.updateScore(5, 3, 100); // delta=15, score=605\nassert.strictEqual(u1.score, 605);\nassert.strictEqual(u1.tier, \u0027good\u0027);\nassert.strictEqual(u1.tierChanged, true);\n\n// Drop back below 600 immediately: cooldown prevents tier change\nconst u2 = cs.updateScore(-4, 3, 110); // delta=-12, score=593, but cooldown until 130\nassert.strictEqual(u2.score, 593);\nassert.strictEqual(u2.tier, \u0027good\u0027); // tier stays \u0027good\u0027 due to cooldown\nassert.strictEqual(u2.tierChanged, false);\n\n// After cooldown: tier can change\nconst u3 = cs.updateScore(-1, 1, 131); // delta=-1, score=592, cooldown elapsed (131-100\u003e=30)\nassert.strictEqual(u3.score, 592);\nassert.strictEqual(u3.tier, \u0027fair\u0027);\nassert.strictEqual(u3.tierChanged, true);\n\n// Audit trail\nassert.strictEqual(cs.audit.length, 3);\nassert.strictEqual(cs.audit[0].delta, 15);\n\nconsole.log(\u0027Task 17 passed\u0027);\n","assertions":"// Hidden assertions\n// No cooldown scorer\nconst cs2 = new CreditScorer(400, 0);\nassert.strictEqual(cs2.tier, \u0027fair\u0027);\n\n// Immediate transitions without cooldown\nconst h1 = cs2.updateScore(100, 2, 10); // delta=200, score=600\nassert.strictEqual(h1.tier, \u0027good\u0027);\nassert.strictEqual(h1.tierChanged, true);\n\nconst h2 = cs2.updateScore(-1, 1, 11); // delta=-1, score=599\nassert.strictEqual(h2.tier, \u0027fair\u0027);\nassert.strictEqual(h2.tierChanged, true);\n\n// Clamping at 850\nconst cs3 = new CreditScorer(840, 0);\nconst h3 = cs3.updateScore(100, 1, 20); // delta=100, clamped to 850\nassert.strictEqual(h3.score, 850);\nassert.strictEqual(h3.tier, \u0027excellent\u0027);\n\n// Clamping at 0\nconst cs4 = new CreditScorer(10, 0);\nconst h4 = cs4.updateScore(-100, 1, 30); // delta=-100, clamped to 0\nassert.strictEqual(h4.score, 0);\n\n// Score changes even during cooldown\nconst cs5 = new CreditScorer(595, 50);\ncs5.updateScore(2, 5, 100); // delta=10, score=605, tier-\u003egood, ts=100\nassert.strictEqual(cs5.tier, \u0027good\u0027);\ncs5.updateScore(-5, 5, 110); // delta=-25, score=580, cooldown: tier stays good\nassert.strictEqual(cs5.score, 580);\nassert.strictEqual(cs5.tier, \u0027good\u0027); // locked by cooldown\n\nconsole.log(\u0027Task 17 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"18","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class AppointmentScheduler {\n constructor(bufferMinutes = 0, cancellationWindowMinutes = 0) {\n this.bufferMinutes = bufferMinutes;\n this.cancellationWindow = cancellationWindowMinutes;\n this.appointments = []; // { id, start, end, recurring, cancelledAt }\n this.nextId = 1;\n }\n\n _overlaps(start1, end1, start2, end2) {\n return start1 \u003c end2 \u0026\u0026 start2 \u003c end1;\n }\n\n _withBuffer(start, end) {\n return { start: start - this.bufferMinutes, end: end + this.bufferMinutes };\n }\n\n","golden_completion":" schedule(start, duration, currentTime = 0) {\n const end = start + duration;\n for (const apt of this.appointments) {\n if (apt.cancelledAt !== null) continue;\n // Check overlap including buffer: new appointment must be buffer away from existing\n if (this._overlaps(start, end, apt.start - this.bufferMinutes, apt.end + this.bufferMinutes)) {\n return { success: false, reason: \u0027conflict\u0027 };\n }\n }\n const id = this.nextId++;\n this.appointments.push({ id, start, end, recurring: false, cancelledAt: null });\n return { success: true, id };\n }\n\n cancel(id, currentTime) {\n const apt = this.appointments.find(a =\u003e a.id === id);\n if (!apt || apt.cancelledAt !== null) {\n return { success: false, reason: \u0027not_found\u0027 };\n }\n if (apt.start - currentTime \u003c this.cancellationWindow) {\n return { success: false, reason: \u0027too_late\u0027 };\n }\n apt.cancelledAt = currentTime;\n return { success: true };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst sched = new AppointmentScheduler(15, 60); // 15 min buffer, 60 min cancellation window\n\n// Schedule appointment at time 100, duration 30 (100-130)\nconst a1 = sched.schedule(100, 30, 0);\nassert.strictEqual(a1.success, true);\nassert.strictEqual(a1.id, 1);\n\n// Conflict: overlaps with buffer (130 + 15 = 145, so 140 is within buffer)\nconst a2 = sched.schedule(140, 20, 0);\nassert.strictEqual(a2.success, false);\nassert.strictEqual(a2.reason, \u0027conflict\u0027);\n\n// No conflict: starts at 145 (130 + 15 buffer)\nconst a3 = sched.schedule(145, 20, 0);\nassert.strictEqual(a3.success, true);\n\n// Buffer before too: 100 - 15 = 85, so 80-90 conflicts (90 \u003e 85)\nconst a4 = sched.schedule(80, 10, 0);\nassert.strictEqual(a4.success, false);\n\n// Cancel: too late (appointment at 100, current=50, window=60 → 100-50=50 \u003c 60)\nconst c1 = sched.cancel(1, 50);\nassert.strictEqual(c1.success, false);\nassert.strictEqual(c1.reason, \u0027too_late\u0027);\n\n// Cancel: OK (current=30, 100-30=70 \u003e= 60)\nconst c2 = sched.cancel(1, 30);\nassert.strictEqual(c2.success, true);\n\nconsole.log(\u0027Task 18 passed\u0027);\n","assertions":"// Hidden assertions\n// After cancellation, slot is freed (schedule far from a3 which is at 145-165)\nconst a5 = sched.schedule(0, 30, 30); // 0-30, buffered -15 to 45, no conflict\nassert.strictEqual(a5.success, true);\n\n// Can\u0027t cancel already-cancelled appointment\nconst c3 = sched.cancel(1, 0);\nassert.strictEqual(c3.success, false);\nassert.strictEqual(c3.reason, \u0027not_found\u0027);\n\n// Can\u0027t cancel non-existent appointment\nconst c4 = sched.cancel(999, 0);\nassert.strictEqual(c4.success, false);\n\n// No buffer scheduler: exact boundaries don\u0027t conflict\nconst sched2 = new AppointmentScheduler(0, 0);\nsched2.schedule(100, 30, 0); // 100-130\nconst nb1 = sched2.schedule(130, 30, 0); // 130-160, no overlap\nassert.strictEqual(nb1.success, true);\n\n// But overlapping still fails\nconst nb2 = sched2.schedule(129, 30, 0);\nassert.strictEqual(nb2.success, false);\n\nconsole.log(\u0027Task 18 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"19","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class GiftCardSystem {\n constructor(maxBalance = 500) {\n this.cards = {}; // cardId -\u003e { balance, active, expiresAt, transactions }\n this.maxBalance = maxBalance;\n }\n\n issueCard(cardId, initialBalance, expiresAt) {\n this.cards[cardId] = {\n balance: Math.min(initialBalance, this.maxBalance),\n active: false,\n expiresAt,\n transactions: []\n };\n }\n\n _addTransaction(cardId, type, amount, balanceAfter, ts) {\n this.cards[cardId].transactions.push({ type, amount, balanceAfter, ts });\n }\n\n","golden_completion":" activate(cardId, ts) {\n const card = this.cards[cardId];\n if (!card) return { success: false, reason: \u0027not_found\u0027 };\n if (card.active) return { success: false, reason: \u0027already_active\u0027 };\n card.active = true;\n this._addTransaction(cardId, \u0027ACTIVATE\u0027, 0, card.balance, ts);\n return { success: true };\n }\n\n redeem(cardId, amount, ts) {\n const card = this.cards[cardId];\n if (!card) return { success: false, reason: \u0027not_found\u0027, charged: 0 };\n if (!card.active) return { success: false, reason: \u0027not_active\u0027, charged: 0 };\n if (ts \u003e card.expiresAt) return { success: false, reason: \u0027expired\u0027, charged: 0 };\n const charged = Math.min(amount, card.balance);\n if (charged \u003c= 0) return { success: false, reason: \u0027zero_balance\u0027, charged: 0 };\n card.balance -= charged;\n this._addTransaction(cardId, \u0027REDEEM\u0027, charged, card.balance, ts);\n return { success: true, charged, remaining: card.balance };\n }\n\n reload(cardId, amount, ts) {\n const card = this.cards[cardId];\n if (!card) return { success: false, reason: \u0027not_found\u0027 };\n if (!card.active) return { success: false, reason: \u0027not_active\u0027 };\n if (ts \u003e card.expiresAt) return { success: false, reason: \u0027expired\u0027 };\n const accepted = Math.min(amount, this.maxBalance - card.balance);\n if (accepted \u003c= 0) return { success: false, reason: \u0027at_cap\u0027 };\n card.balance += accepted;\n this._addTransaction(cardId, \u0027RELOAD\u0027, accepted, card.balance, ts);\n return { success: true, accepted, balance: card.balance };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst gcs = new GiftCardSystem(500);\ngcs.issueCard(\u0027GC-001\u0027, 200, 9999);\n\n// Must activate before use\nconst r1 = gcs.redeem(\u0027GC-001\u0027, 50, 100);\nassert.strictEqual(r1.success, false);\nassert.strictEqual(r1.reason, \u0027not_active\u0027);\n\n// Activate\nconst a1 = gcs.activate(\u0027GC-001\u0027, 100);\nassert.strictEqual(a1.success, true);\n\n// Idempotent activation fails\nconst a2 = gcs.activate(\u0027GC-001\u0027, 101);\nassert.strictEqual(a2.success, false);\nassert.strictEqual(a2.reason, \u0027already_active\u0027);\n\n// Partial redemption: request 300, only 200 available\nconst r2 = gcs.redeem(\u0027GC-001\u0027, 300, 200);\nassert.strictEqual(r2.success, true);\nassert.strictEqual(r2.charged, 200);\nassert.strictEqual(r2.remaining, 0);\n\n// Zero balance\nconst r3 = gcs.redeem(\u0027GC-001\u0027, 10, 201);\nassert.strictEqual(r3.success, false);\nassert.strictEqual(r3.reason, \u0027zero_balance\u0027);\n\n// Reload with cap\ngcs.reload(\u0027GC-001\u0027, 400, 300);\nconst rl2 = gcs.reload(\u0027GC-001\u0027, 200, 301);\nassert.strictEqual(rl2.success, true);\nassert.strictEqual(rl2.accepted, 100); // 400 + 100 = 500 (cap)\nassert.strictEqual(rl2.balance, 500);\n\nconsole.log(\u0027Task 19 passed\u0027);\n","assertions":"// Hidden assertions\n// Reload at cap\nconst rl3 = gcs.reload(\u0027GC-001\u0027, 50, 302);\nassert.strictEqual(rl3.success, false);\nassert.strictEqual(rl3.reason, \u0027at_cap\u0027);\n\n// Expired card\ngcs.issueCard(\u0027GC-002\u0027, 100, 500);\ngcs.activate(\u0027GC-002\u0027, 100);\nconst re = gcs.redeem(\u0027GC-002\u0027, 50, 501);\nassert.strictEqual(re.success, false);\nassert.strictEqual(re.reason, \u0027expired\u0027);\n\n// Reload expired card\nconst rle = gcs.reload(\u0027GC-002\u0027, 50, 502);\nassert.strictEqual(rle.success, false);\nassert.strictEqual(rle.reason, \u0027expired\u0027);\n\n// Non-existent card\nassert.strictEqual(gcs.redeem(\u0027NOCARD\u0027, 10, 100).success, false);\nassert.strictEqual(gcs.reload(\u0027NOCARD\u0027, 10, 100).success, false);\nassert.strictEqual(gcs.activate(\u0027NOCARD\u0027, 100).success, false);\n\n// Transaction log: activate + redeem + reload + reload = 4 (failed ops don\u0027t log)\nconst card = gcs.cards[\u0027GC-001\u0027];\nassert.strictEqual(card.transactions.length, 4);\n\nconsole.log(\u0027Task 19 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"20","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class VotingSession {\n // passThreshold: fraction of NON-ABSTAIN weighted votes needed (e.g. 0.6 = 60%)\n // quorumFraction: fraction of TOTAL possible weight that must vote (including abstain)\n constructor(passThreshold, quorumFraction) {\n this.passThreshold = passThreshold;\n this.quorumFraction = quorumFraction;\n this.members = {}; // memberId -\u003e { weight }\n this.votes = {}; // memberId -\u003e \u0027yes\u0027 | \u0027no\u0027 | \u0027abstain\u0027\n this.totalWeight = 0;\n this.resolved = false;\n this.result = null; // \u0027passed\u0027 | \u0027failed\u0027 | \u0027no_quorum\u0027\n }\n\n addMember(memberId, weight) {\n this.members[memberId] = { weight };\n this.totalWeight += weight;\n }\n\n","golden_completion":" castVote(memberId, vote) {\n if (this.resolved) {\n return { success: false, reason: \u0027already_resolved\u0027 };\n }\n if (!this.members[memberId]) {\n return { success: false, reason: \u0027not_a_member\u0027 };\n }\n if (![\u0027yes\u0027, \u0027no\u0027, \u0027abstain\u0027].includes(vote)) {\n return { success: false, reason: \u0027invalid_vote\u0027 };\n }\n this.votes[memberId] = vote;\n return { success: true, changed: memberId in this.votes };\n }\n\n resolve() {\n if (this.resolved) {\n return { success: false, result: this.result };\n }\n let votedWeight = 0;\n let yesWeight = 0;\n let noWeight = 0;\n for (const [memberId, vote] of Object.entries(this.votes)) {\n const w = this.members[memberId].weight;\n votedWeight += w;\n if (vote === \u0027yes\u0027) yesWeight += w;\n else if (vote === \u0027no\u0027) noWeight += w;\n // abstain counts for quorum but not yes/no tally\n }\n if (votedWeight \u003c this.totalWeight * this.quorumFraction) {\n this.resolved = true;\n this.result = \u0027no_quorum\u0027;\n return { success: true, result: \u0027no_quorum\u0027, yesWeight, noWeight, votedWeight };\n }\n const nonAbstainWeight = yesWeight + noWeight;\n const passed = nonAbstainWeight \u003e 0 \u0026\u0026 yesWeight / nonAbstainWeight \u003e= this.passThreshold;\n this.result = passed ? \u0027passed\u0027 : \u0027failed\u0027;\n this.resolved = true;\n return { success: true, result: this.result, yesWeight, noWeight, votedWeight };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst vs = new VotingSession(0.6, 0.5); // 60% pass, 50% quorum\n\nvs.addMember(\u0027alice\u0027, 3);\nvs.addMember(\u0027bob\u0027, 2);\nvs.addMember(\u0027carol\u0027, 2);\nvs.addMember(\u0027dave\u0027, 1);\n// total weight = 8, quorum needs 4\n\nvs.castVote(\u0027alice\u0027, \u0027yes\u0027); // 3\nvs.castVote(\u0027bob\u0027, \u0027no\u0027); // 2\nvs.castVote(\u0027carol\u0027, \u0027abstain\u0027); // 2\n\n// votedWeight = 7, quorum met (7 \u003e= 4)\n// nonAbstain = 3+2=5, yes=3, 3/5=0.6 \u003e= 0.6 → passed\nconst result = vs.resolve();\nassert.strictEqual(result.result, \u0027passed\u0027);\nassert.strictEqual(result.yesWeight, 3);\nassert.strictEqual(result.noWeight, 2);\nassert.strictEqual(result.votedWeight, 7);\n\n// Can\u0027t resolve again\nconst r2 = vs.resolve();\nassert.strictEqual(r2.success, false);\n\nconsole.log(\u0027Task 20 passed\u0027);\n","assertions":"// Hidden assertions\n// No quorum scenario\nconst vs2 = new VotingSession(0.5, 0.75); // 75% quorum\nvs2.addMember(\u0027x\u0027, 4);\nvs2.addMember(\u0027y\u0027, 4);\nvs2.addMember(\u0027z\u0027, 4); // total 12, quorum needs 9\n\nvs2.castVote(\u0027x\u0027, \u0027yes\u0027); // only 4/12 voted\nconst nr = vs2.resolve();\nassert.strictEqual(nr.result, \u0027no_quorum\u0027);\n\n// All abstain: quorum met but 0 non-abstain → failed (can\u0027t pass with no yes votes)\nconst vs3 = new VotingSession(0.5, 0.5);\nvs3.addMember(\u0027a\u0027, 5);\nvs3.addMember(\u0027b\u0027, 5);\nvs3.castVote(\u0027a\u0027, \u0027abstain\u0027);\nvs3.castVote(\u0027b\u0027, \u0027abstain\u0027);\nconst allAbs = vs3.resolve();\nassert.strictEqual(allAbs.result, \u0027failed\u0027);\n\n// Vote change: bob changes from yes to no\nconst vs4 = new VotingSession(0.6, 0.3);\nvs4.addMember(\u0027p\u0027, 3);\nvs4.addMember(\u0027q\u0027, 2);\nvs4.castVote(\u0027p\u0027, \u0027yes\u0027);\nvs4.castVote(\u0027q\u0027, \u0027yes\u0027);\nvs4.castVote(\u0027q\u0027, \u0027no\u0027); // change vote\nconst r4 = vs4.resolve();\n// nonAbstain=5, yes=3, 3/5=0.6 \u003e= 0.6 → passed\nassert.strictEqual(r4.result, \u0027passed\u0027);\nassert.strictEqual(r4.yesWeight, 3);\nassert.strictEqual(r4.noWeight, 2);\n\n// Can\u0027t vote after resolved\nconst vs5 = new VotingSession(0.5, 0.1);\nvs5.addMember(\u0027m\u0027, 1);\nvs5.castVote(\u0027m\u0027, \u0027yes\u0027);\nvs5.resolve();\nconst late = vs5.castVote(\u0027m\u0027, \u0027no\u0027);\nassert.strictEqual(late.success, false);\nassert.strictEqual(late.reason, \u0027already_resolved\u0027);\n\n// Non-member vote\nconst vs6 = new VotingSession(0.5, 0.5);\nconst nm = vs6.castVote(\u0027nobody\u0027, \u0027yes\u0027);\nassert.strictEqual(nm.success, false);\nassert.strictEqual(nm.reason, \u0027not_a_member\u0027);\n\nconsole.log(\u0027Task 20 hidden passed\u0027);\n","category":"code_purpose_understanding"} {"id":"21","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class Warehouse {\n constructor(name) {\n this.name = name;\n this.inventory = {}; // sku -\u003e [{qty, expiry}] sorted by expiry asc\n }\n\n addStock(sku, qty, expiry) {\n if (!this.inventory[sku]) this.inventory[sku] = [];\n this.inventory[sku].push({ qty, expiry });\n this.inventory[sku].sort((a, b) =\u003e a.expiry - b.expiry);\n }\n\n totalQty(sku) {\n return (this.inventory[sku] || []).reduce((s, b) =\u003e s + b.qty, 0);\n }\n\n // Pick qty units of sku using FEFO (earliest expiry first).\n // Returns array of {qty, expiry} batches picked. Mutates inventory.\n pickFEFO(sku, qty) {\n let remaining = qty;\n const batches = [];\n while (remaining \u003e 0 \u0026\u0026 this.inventory[sku] \u0026\u0026 this.inventory[sku].length) {\n const batch = this.inventory[sku][0];\n const take = Math.min(remaining, batch.qty);\n batch.qty -= take;\n if (batch.qty === 0) this.inventory[sku].shift();\n batches.push({ qty: take, expiry: batch.expiry });\n remaining -= take;\n }\n return batches;\n }\n}\n\nclass InventoryTransfer {\n constructor(source, dest) {\n this.source = source;\n this.dest = dest;\n this.status = \u0027pending\u0027;\n this.audit = [];\n }\n\n // Transfer items [{sku, qty}]. FEFO picking. ATOMIC: if ANY sku has\n // insufficient stock, revert ALL picks and set status=\u0027failed\u0027.\n // On success: move to dest, status=\u0027completed\u0027, audit each {sku, qty, batches}.\n // On failure: audit {sku, reason:\u0027insufficient\u0027, available, requested}.\n","golden_completion":" transferItems(items) {\n if (this.status !== \u0027pending\u0027) throw new Error(\u0027Already processed\u0027);\n const picks = [];\n for (const item of items) {\n if (this.source.totalQty(item.sku) \u003c item.qty) {\n this.status = \u0027failed\u0027;\n this.audit.push({ sku: item.sku, reason: \u0027insufficient\u0027, available: this.source.totalQty(item.sku), requested: item.qty });\n for (const p of picks) p.batches.forEach(b =\u003e this.source.addStock(p.sku, b.qty, b.expiry));\n return false;\n }\n picks.push({ sku: item.sku, qty: item.qty, batches: this.source.pickFEFO(item.sku, item.qty) });\n }\n for (const p of picks) {\n p.batches.forEach(b =\u003e this.dest.addStock(p.sku, b.qty, b.expiry));\n this.audit.push({ sku: p.sku, qty: p.qty, batches: p.batches });\n }\n this.status = \u0027completed\u0027;\n return true;\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst w1 = new Warehouse(\u0027A\u0027), w2 = new Warehouse(\u0027B\u0027);\nw1.addStock(\u0027apple\u0027, 5, 100);\nw1.addStock(\u0027apple\u0027, 10, 200);\nconst t1 = new InventoryTransfer(w1, w2);\nt1.transferItems([{ sku: \u0027apple\u0027, qty: 7 }]);\nassert.strictEqual(t1.status, \u0027completed\u0027);\nassert.strictEqual(w1.totalQty(\u0027apple\u0027), 8);\nassert.strictEqual(w2.totalQty(\u0027apple\u0027), 7);\nassert.strictEqual(t1.audit[0].batches[0].qty, 5);\nassert.strictEqual(t1.audit[0].batches[0].expiry, 100);\nassert.strictEqual(t1.audit[0].batches[1].qty, 2);\nconsole.log(\u0027Task 21 suffix passed\u0027);\n","assertions":"// Atomic failure: second sku insufficient -\u003e revert first\nconst w3 = new Warehouse(\u0027C\u0027), w4 = new Warehouse(\u0027D\u0027);\nw3.addStock(\u0027X\u0027, 10, 50);\nw3.addStock(\u0027Y\u0027, 2, 60);\nconst t2 = new InventoryTransfer(w3, w4);\nassert.strictEqual(t2.transferItems([{ sku: \u0027X\u0027, qty: 5 }, { sku: \u0027Y\u0027, qty: 10 }]), false);\nassert.strictEqual(t2.status, \u0027failed\u0027);\nassert.strictEqual(w3.totalQty(\u0027X\u0027), 10); // reverted\nassert.strictEqual(w4.totalQty(\u0027X\u0027), 0);\nassert.strictEqual(t2.audit[0].reason, \u0027insufficient\u0027);\n\n// Cannot reuse\nconst w5 = new Warehouse(\u0027E\u0027), w6 = new Warehouse(\u0027F\u0027);\nw5.addStock(\u0027Z\u0027, 5, 10);\nconst t3 = new InventoryTransfer(w5, w6);\nt3.transferItems([{ sku: \u0027Z\u0027, qty: 2 }]);\nlet threw = false;\ntry { t3.transferItems([{ sku: \u0027Z\u0027, qty: 1 }]); } catch(e) { threw = true; }\nassert.strictEqual(threw, true);\nconsole.log(\u0027Task 21 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"22","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class InsurancePolicy {\n constructor(policyId, basePremium, riskFactor, gracePeriodDays) {\n this.policyId = policyId;\n this.basePremium = basePremium;\n this.riskFactor = riskFactor;\n this.gracePeriodDays = gracePeriodDays;\n this.status = \u0027active\u0027; // active | grace | lapsed | reinstated\n this.nextDueDay = 30;\n this.payments = [];\n this.lapsePenaltyRate = 0.25; // 25% surcharge when reinstated\n this.totalPaid = 0;\n }\n\n adjustedPremium() {\n const base = this.basePremium * this.riskFactor;\n if (this.status === \u0027reinstated\u0027)\n return Math.round(base * (1 + this.lapsePenaltyRate) * 100) / 100;\n return Math.round(base * 100) / 100;\n }\n\n // Pay premium on given day. Rules:\n // 1. Lapsed? This payment reinstates: set status=\u0027reinstated\u0027 THEN compute amount.\n // 2. day \u003e nextDueDay+grace and not lapsed? Lapse: reject {accepted:false, reason:\u0027lapsed\u0027}.\n // 3. day \u003e nextDueDay? Grace: accept as late.\n // 4. On-time from reinstated? Become \u0027active\u0027. On-time otherwise? Stay \u0027active\u0027.\n // 5. Compute amount via adjustedPremium() AFTER status update for reinstatement,\n // but BEFORE clearing reinstated-\u003eactive (penalty applies while reinstated).\n // 6. Record {day, amount, late, reinstated}, advance nextDueDay += 30.\n","golden_completion":" payPremium(day) {\n if (this.status !== \u0027lapsed\u0027 \u0026\u0026 day \u003e this.nextDueDay + this.gracePeriodDays) {\n this.status = \u0027lapsed\u0027;\n return { accepted: false, reason: \u0027lapsed\u0027 };\n }\n const isReinstating = this.status === \u0027lapsed\u0027;\n const late = !isReinstating \u0026\u0026 day \u003e this.nextDueDay;\n if (isReinstating) this.status = \u0027reinstated\u0027;\n const amount = this.adjustedPremium();\n if (!isReinstating) {\n if (late) this.status = \u0027grace\u0027;\n else if (this.status === \u0027reinstated\u0027) this.status = \u0027active\u0027;\n else this.status = \u0027active\u0027;\n }\n this.payments.push({ day, amount, late, reinstated: isReinstating });\n this.totalPaid += amount;\n this.nextDueDay += 30;\n return { accepted: true, amount, newStatus: this.status };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst p1 = new InsurancePolicy(\u0027P1\u0027, 100, 1.5, 10);\nconst r1 = p1.payPremium(30);\nassert.strictEqual(r1.amount, 150);\nassert.strictEqual(r1.newStatus, \u0027active\u0027);\nassert.strictEqual(p1.payments[0].late, false);\nassert.strictEqual(p1.nextDueDay, 60);\n\n// Late within grace\nconst r2 = p1.payPremium(65);\nassert.strictEqual(r2.newStatus, \u0027grace\u0027);\nassert.strictEqual(p1.payments[1].late, true);\nconsole.log(\u0027Task 22 suffix passed\u0027);\n","assertions":"// Lapse\nconst p2 = new InsurancePolicy(\u0027P2\u0027, 200, 1.0, 5);\nconst r3 = p2.payPremium(36);\nassert.strictEqual(r3.accepted, false);\nassert.strictEqual(p2.status, \u0027lapsed\u0027);\n\n// Reinstate: penalty applies (200 * 1.25 = 250)\nconst r4 = p2.payPremium(40);\nassert.strictEqual(r4.amount, 250);\nassert.strictEqual(r4.newStatus, \u0027reinstated\u0027);\nassert.strictEqual(p2.payments[0].reinstated, true);\n\n// On-time while reinstated: still penalty, then becomes active\nconst r5 = p2.payPremium(55);\nassert.strictEqual(r5.amount, 250);\nassert.strictEqual(r5.newStatus, \u0027active\u0027);\n\n// Now active: no penalty\nconst r6 = p2.payPremium(85);\nassert.strictEqual(r6.amount, 200);\nconsole.log(\u0027Task 22 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"23","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class TaskTracker {\n constructor() {\n this.tasks = {};\n this.completionOrder = [];\n }\n\n addTask(id, deps = [], autoComplete = false) {\n this.tasks[id] = {\n id, deps: [...deps],\n status: deps.length \u003e 0 ? \u0027blocked\u0027 : \u0027ready\u0027,\n autoComplete, completedAt: null\n };\n }\n\n _allDepsComplete(id) {\n return this.tasks[id].deps.every(d =\u003e this.tasks[d].status === \u0027complete\u0027);\n }\n\n _getDependents(id) {\n return Object.values(this.tasks).filter(t =\u003e t.deps.includes(id));\n }\n\n // Complete a task and cascade.\n // 1. Throw if blocked or already complete.\n // 2. Set status=\u0027complete\u0027, completedAt=timestamp, push to completionOrder.\n // 3. For each dependent whose deps are all now complete: set \u0027ready\u0027.\n // 4. If a newly-ready dependent has autoComplete=true, immediately\n // complete it (timestamp+1) and recurse (cascading auto-completion).\n // 5. Return array of all IDs completed (including cascaded).\n","golden_completion":" completeTask(id, timestamp) {\n const task = this.tasks[id];\n if (!task) throw new Error(\u0027Not found\u0027);\n if (task.status === \u0027complete\u0027) throw new Error(\u0027Already complete\u0027);\n if (task.status === \u0027blocked\u0027) throw new Error(\u0027Blocked\u0027);\n task.status = \u0027complete\u0027;\n task.completedAt = timestamp;\n this.completionOrder.push(id);\n const completed = [id];\n for (const dep of this._getDependents(id)) {\n if (dep.status !== \u0027complete\u0027 \u0026\u0026 this._allDepsComplete(dep.id)) {\n dep.status = \u0027ready\u0027;\n if (dep.autoComplete) {\n completed.push(...this.completeTask(dep.id, timestamp + 1));\n }\n }\n }\n return completed;\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst t = new TaskTracker();\nt.addTask(\u0027A\u0027);\nt.addTask(\u0027B\u0027, [\u0027A\u0027]);\nt.addTask(\u0027C\u0027, [\u0027B\u0027]);\nassert.strictEqual(t.tasks[\u0027B\u0027].status, \u0027blocked\u0027);\nassert.deepStrictEqual(t.completeTask(\u0027A\u0027, 100), [\u0027A\u0027]);\nassert.strictEqual(t.tasks[\u0027B\u0027].status, \u0027ready\u0027);\nassert.strictEqual(t.tasks[\u0027C\u0027].status, \u0027blocked\u0027);\nassert.deepStrictEqual(t.completeTask(\u0027B\u0027, 200), [\u0027B\u0027]);\nassert.strictEqual(t.tasks[\u0027C\u0027].status, \u0027ready\u0027);\nconsole.log(\u0027Task 23 suffix passed\u0027);\n","assertions":"// Auto-complete cascade\nconst t2 = new TaskTracker();\nt2.addTask(\u0027X\u0027);\nt2.addTask(\u0027Y\u0027, [\u0027X\u0027], true);\nt2.addTask(\u0027Z\u0027, [\u0027Y\u0027], true);\nt2.addTask(\u0027W\u0027, [\u0027Z\u0027]);\nconst r = t2.completeTask(\u0027X\u0027, 1000);\nassert.deepStrictEqual(r, [\u0027X\u0027, \u0027Y\u0027, \u0027Z\u0027]);\nassert.strictEqual(t2.tasks[\u0027W\u0027].status, \u0027ready\u0027);\nassert.strictEqual(t2.tasks[\u0027Y\u0027].completedAt, 1001);\nassert.strictEqual(t2.tasks[\u0027Z\u0027].completedAt, 1002);\n\n// Cannot complete blocked\nlet threw = false;\nconst t3 = new TaskTracker();\nt3.addTask(\u0027P\u0027); t3.addTask(\u0027Q\u0027, [\u0027P\u0027]);\ntry { t3.completeTask(\u0027Q\u0027, 1); } catch(e) { threw = true; }\nassert.strictEqual(threw, true);\n\n// Multi-dep: ready only when ALL complete\nconst t4 = new TaskTracker();\nt4.addTask(\u0027D1\u0027); t4.addTask(\u0027D2\u0027);\nt4.addTask(\u0027E\u0027, [\u0027D1\u0027, \u0027D2\u0027], true);\nt4.completeTask(\u0027D1\u0027, 10);\nassert.strictEqual(t4.tasks[\u0027E\u0027].status, \u0027blocked\u0027);\nassert.deepStrictEqual(t4.completeTask(\u0027D2\u0027, 20), [\u0027D2\u0027, \u0027E\u0027]);\nassert.strictEqual(t4.tasks[\u0027E\u0027].completedAt, 21);\nconsole.log(\u0027Task 23 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"24","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class BudgetManager {\n constructor(totalBudget, approvalThreshold) {\n this.totalBudget = totalBudget;\n this.remaining = totalBudget;\n this.approvalThreshold = approvalThreshold;\n this.departments = {};\n this.allocations = [];\n this.period = 1;\n }\n\n addDepartment(name, cap) {\n this.departments[name] = { cap, allocated: 0, rollover: 0 };\n }\n\n newPeriod(newBudget) {\n for (const dept of Object.values(this.departments)) {\n dept.rollover = dept.cap - dept.allocated;\n dept.allocated = 0;\n }\n this.totalBudget = newBudget;\n this.remaining = newBudget;\n this.period++;\n }\n\n // Allocate amount to department. Check order:\n // 1. effectiveCap = cap + rollover. Reject if allocated+amount \u003e effectiveCap.\n // 2. Reject if amount \u003e remaining (budget_exhausted).\n // 3. Reject if amount \u003e approvalThreshold \u0026\u0026 !approved (needs_approval).\n // 4. Success: update allocated, remaining, log, return result.\n","golden_completion":" allocateBudget(department, amount, approved = false) {\n const dept = this.departments[department];\n if (!dept) throw new Error(\u0027Unknown department\u0027);\n const effectiveCap = dept.cap + dept.rollover;\n if (dept.allocated + amount \u003e effectiveCap)\n return { approved: false, reason: \u0027cap_exceeded\u0027, effectiveCap, currentAlloc: dept.allocated };\n if (amount \u003e this.remaining)\n return { approved: false, reason: \u0027budget_exhausted\u0027, remaining: this.remaining };\n if (amount \u003e this.approvalThreshold \u0026\u0026 !approved)\n return { approved: false, reason: \u0027needs_approval\u0027, amount, threshold: this.approvalThreshold };\n dept.allocated += amount;\n this.remaining -= amount;\n this.allocations.push({ department, amount, period: this.period });\n return { approved: true, amount, department, remaining: this.remaining, period: this.period };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst bm = new BudgetManager(1000, 200);\nbm.addDepartment(\u0027eng\u0027, 500);\nbm.addDepartment(\u0027mkt\u0027, 300);\nconst r1 = bm.allocateBudget(\u0027eng\u0027, 150);\nassert.strictEqual(r1.approved, true);\nassert.strictEqual(r1.remaining, 850);\n\n// Needs approval\nconst r2 = bm.allocateBudget(\u0027mkt\u0027, 250);\nassert.strictEqual(r2.reason, \u0027needs_approval\u0027);\nconst r3 = bm.allocateBudget(\u0027mkt\u0027, 250, true);\nassert.strictEqual(r3.approved, true);\nassert.strictEqual(r3.remaining, 600);\nconsole.log(\u0027Task 24 suffix passed\u0027);\n","assertions":"// Cap exceeded\nconst r4 = bm.allocateBudget(\u0027mkt\u0027, 100);\nassert.strictEqual(r4.reason, \u0027cap_exceeded\u0027);\nassert.strictEqual(r4.effectiveCap, 300);\n\n// Rollover\nbm.newPeriod(500);\nassert.strictEqual(bm.departments[\u0027mkt\u0027].rollover, 50);\nassert.strictEqual(bm.departments[\u0027eng\u0027].rollover, 350);\n\n// mkt effective cap = 350, approved\nconst r5 = bm.allocateBudget(\u0027mkt\u0027, 340, true);\nassert.strictEqual(r5.approved, true);\n\n// Budget exhausted\nconst r6 = bm.allocateBudget(\u0027eng\u0027, 200);\nassert.strictEqual(r6.reason, \u0027budget_exhausted\u0027);\nassert.strictEqual(r6.remaining, 160);\n\n// Exact cap with rollover\nconst bm2 = new BudgetManager(1000, 1000);\nbm2.addDepartment(\u0027ops\u0027, 100);\nbm2.allocateBudget(\u0027ops\u0027, 60);\nbm2.newPeriod(1000);\nassert.strictEqual(bm2.allocateBudget(\u0027ops\u0027, 140).approved, true);\nassert.strictEqual(bm2.allocateBudget(\u0027ops\u0027, 1).reason, \u0027cap_exceeded\u0027);\nconsole.log(\u0027Task 24 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"25","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class MembershipSystem {\n constructor() {\n this.tiers = [\n { name: \u0027bronze\u0027, minPoints: 0, benefits: [\u0027basic_support\u0027] },\n { name: \u0027silver\u0027, minPoints: 100, benefits: [\u0027basic_support\u0027, \u0027priority_queue\u0027] },\n { name: \u0027gold\u0027, minPoints: 300, benefits: [\u0027basic_support\u0027, \u0027priority_queue\u0027, \u0027free_shipping\u0027] },\n { name: \u0027platinum\u0027, minPoints: 600, benefits: [\u0027basic_support\u0027, \u0027priority_queue\u0027, \u0027free_shipping\u0027, \u0027personal_advisor\u0027] }\n ];\n this.members = {};\n }\n\n addMember(id) {\n this.members[id] = { id, points: 0, tier: \u0027bronze\u0027, benefits: [\u0027basic_support\u0027],\n graceMonthsLeft: 0, history: [] };\n }\n\n _tierIndex(name) { return this.tiers.findIndex(t =\u003e t.name === name); }\n\n _tierForPoints(pts) {\n let best = this.tiers[0];\n for (const t of this.tiers) if (pts \u003e= t.minPoints) best = t;\n return best;\n }\n\n // Process monthly update. Add pointsEarned, then:\n // PROMOTE (qualified \u003e current): snapshot benefits, graceMonthsLeft=2,\n // log {action:\u0027promote\u0027, from, to, points, month}.\n // DEMOTE (qualified \u003c current): if grace \u003e 0, decrement, log \u0027grace\u0027.\n // If grace === 0, demote, snapshot benefits, log \u0027demote\u0027.\n // STAY: log {action:\u0027stay\u0027, tier, month}.\n","golden_completion":" processMonth(memberId, pointsEarned, month) {\n const m = this.members[memberId];\n m.points += pointsEarned;\n const q = this._tierForPoints(m.points);\n const qIdx = this._tierIndex(q.name), cIdx = this._tierIndex(m.tier);\n if (qIdx \u003e cIdx) {\n const from = m.tier;\n m.tier = q.name; m.benefits = [...q.benefits]; m.graceMonthsLeft = 2;\n m.history.push({ action: \u0027promote\u0027, from, to: m.tier, points: m.points, month });\n } else if (qIdx \u003c cIdx) {\n if (m.graceMonthsLeft \u003e 0) {\n m.graceMonthsLeft--;\n m.history.push({ action: \u0027grace\u0027, tier: m.tier, graceMonthsLeft: m.graceMonthsLeft, month });\n } else {\n const from = m.tier;\n m.tier = q.name; m.benefits = [...q.benefits];\n m.history.push({ action: \u0027demote\u0027, from, to: m.tier, points: m.points, month });\n }\n } else { m.history.push({ action: \u0027stay\u0027, tier: m.tier, month }); }\n return { ...m, benefits: [...m.benefits] };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst ms = new MembershipSystem();\nms.addMember(\u0027u1\u0027);\n\nconst s1 = ms.processMonth(\u0027u1\u0027, 150, 1);\nassert.strictEqual(s1.tier, \u0027silver\u0027);\nassert.strictEqual(s1.graceMonthsLeft, 2);\nassert.deepStrictEqual(s1.benefits, [\u0027basic_support\u0027, \u0027priority_queue\u0027]);\nassert.strictEqual(ms.members[\u0027u1\u0027].history[0].action, \u0027promote\u0027);\n\nconst s2 = ms.processMonth(\u0027u1\u0027, 200, 2);\nassert.strictEqual(s2.tier, \u0027gold\u0027);\nassert.strictEqual(s2.graceMonthsLeft, 2);\nconsole.log(\u0027Task 25 suffix passed\u0027);\n","assertions":"// Demotion with grace\nconst ms2 = new MembershipSystem();\nms2.addMember(\u0027u2\u0027);\nms2.members[\u0027u2\u0027].points = 250;\nms2.members[\u0027u2\u0027].tier = \u0027gold\u0027;\nms2.members[\u0027u2\u0027].benefits = [\u0027basic_support\u0027, \u0027priority_queue\u0027, \u0027free_shipping\u0027];\nms2.members[\u0027u2\u0027].graceMonthsLeft = 2;\n\nconst d1 = ms2.processMonth(\u0027u2\u0027, 0, 10);\nassert.strictEqual(d1.tier, \u0027gold\u0027); // grace\nassert.strictEqual(d1.graceMonthsLeft, 1);\n\nconst d2 = ms2.processMonth(\u0027u2\u0027, 0, 11);\nassert.strictEqual(d2.graceMonthsLeft, 0);\n\nconst d3 = ms2.processMonth(\u0027u2\u0027, 0, 12); // grace expired -\u003e demote\nassert.strictEqual(d3.tier, \u0027silver\u0027);\nassert.deepStrictEqual(d3.benefits, [\u0027basic_support\u0027, \u0027priority_queue\u0027]);\n\n// Re-promote resets grace\nconst d4 = ms2.processMonth(\u0027u2\u0027, 200, 13);\nassert.strictEqual(d4.tier, \u0027gold\u0027);\nassert.strictEqual(d4.graceMonthsLeft, 2);\n\n// Stay\nconst ms3 = new MembershipSystem();\nms3.addMember(\u0027u3\u0027);\nms3.processMonth(\u0027u3\u0027, 50, 1);\nassert.strictEqual(ms3.members[\u0027u3\u0027].history[0].action, \u0027stay\u0027);\nconsole.log(\u0027Task 25 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"26","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class SupplyChain {\n constructor(minOrderQty) {\n this.minOrderQty = minOrderQty;\n this.warehouses = {};\n this.orders = [];\n this.backOrders = [];\n this.shipments = [];\n }\n\n addWarehouse(name, stock) {\n this.warehouses[name] = { stock: { ...stock } };\n }\n\n // Fulfill order for single SKU.\n // 1. qty \u003c MOQ? Reject {fulfilled:false, reason:\u0027below_moq\u0027, minimum}.\n // 2. Try warehouses in insertion order. Take as much as possible.\n // Shipment: {orderId, warehouse, sku, qty, shipmentId:\u0027SH-{orderId}-{whIdx}\u0027}.\n // whIdx = warehouse position index (0,1,2...), NOT shipment counter.\n // 3. Remaining qty -\u003e backOrder {orderId, sku, qty:remaining, status:\u0027pending\u0027}.\n // 4. Return {orderId, sku, requestedQty, fulfilledQty, shipmentCount, hasBackOrder}.\n","golden_completion":" fulfillOrder(orderId, sku, qty) {\n if (qty \u003c this.minOrderQty)\n return { fulfilled: false, reason: \u0027below_moq\u0027, minimum: this.minOrderQty };\n let remaining = qty, shipmentCount = 0, whIdx = 0;\n for (const name of Object.keys(this.warehouses)) {\n const avail = this.warehouses[name].stock[sku] || 0;\n if (avail \u003e 0 \u0026\u0026 remaining \u003e 0) {\n const take = Math.min(avail, remaining);\n this.warehouses[name].stock[sku] -= take;\n remaining -= take;\n shipmentCount++;\n this.shipments.push({ orderId, warehouse: name, sku, qty: take, shipmentId: `SH-${orderId}-${whIdx}` });\n }\n whIdx++;\n }\n if (remaining \u003e 0) this.backOrders.push({ orderId, sku, qty: remaining, status: \u0027pending\u0027 });\n const order = { orderId, sku, requestedQty: qty, fulfilledQty: qty - remaining, shipmentCount, hasBackOrder: remaining \u003e 0 };\n this.orders.push(order);\n return order;\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst sc = new SupplyChain(5);\nsc.addWarehouse(\u0027WH-East\u0027, { widget: 30, gadget: 10 });\nsc.addWarehouse(\u0027WH-West\u0027, { widget: 20, gadget: 5 });\n\nconst r1 = sc.fulfillOrder(\u0027O1\u0027, \u0027widget\u0027, 25);\nassert.strictEqual(r1.fulfilledQty, 25);\nassert.strictEqual(r1.shipmentCount, 1);\nassert.strictEqual(r1.hasBackOrder, false);\n\nconst r2 = sc.fulfillOrder(\u0027O2\u0027, \u0027widget\u0027, 15);\nassert.strictEqual(r2.shipmentCount, 2);\nassert.strictEqual(sc.warehouses[\u0027WH-East\u0027].stock.widget, 0);\nassert.strictEqual(sc.warehouses[\u0027WH-West\u0027].stock.widget, 10);\nconsole.log(\u0027Task 26 suffix passed\u0027);\n","assertions":"// Partial + back-order\nconst r3 = sc.fulfillOrder(\u0027O3\u0027, \u0027widget\u0027, 20);\nassert.strictEqual(r3.fulfilledQty, 10);\nassert.strictEqual(r3.hasBackOrder, true);\nassert.strictEqual(sc.backOrders[0].qty, 10);\n\n// Below MOQ\nconst r4 = sc.fulfillOrder(\u0027O4\u0027, \u0027gadget\u0027, 3);\nassert.strictEqual(r4.fulfilled, false);\nassert.strictEqual(r4.reason, \u0027below_moq\u0027);\n\n// Shipment IDs use warehouse index\nassert.strictEqual(sc.shipments[0].shipmentId, \u0027SH-O1-0\u0027);\nassert.strictEqual(sc.shipments[1].shipmentId, \u0027SH-O2-0\u0027);\nassert.strictEqual(sc.shipments[2].shipmentId, \u0027SH-O2-1\u0027);\n\n// Unknown SKU -\u003e full back-order\nconst r5 = sc.fulfillOrder(\u0027O5\u0027, \u0027unknown\u0027, 10);\nassert.strictEqual(r5.fulfilledQty, 0);\nassert.strictEqual(r5.hasBackOrder, true);\nassert.strictEqual(r5.shipmentCount, 0);\nconsole.log(\u0027Task 26 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"27","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class RateLimiter {\n constructor(windowMs, maxRequests, burstAllowance, cooldownMs) {\n this.windowMs = windowMs;\n this.maxRequests = maxRequests;\n this.burstAllowance = burstAllowance;\n this.cooldownMs = cooldownMs;\n this.requests = [];\n this.burstUsed = 0;\n this.cooldownUntil = 0;\n this.log = [];\n }\n\n // Process request at timestamp.\n // 1. In cooldown (ts \u003c cooldownUntil)? Reject {reason:\u0027cooldown\u0027, retryAfter}.\n // 2. If cooldown just expired, reset burstUsed to 0.\n // 3. Remove requests outside window. Count remaining.\n // 4. count \u003c max? Normal {type:\u0027normal\u0027, remaining: max-count-1}.\n // 5. burstUsed \u003c burstAllowance? Burst, increment burstUsed.\n // When burstUsed reaches burstAllowance, trigger cooldown.\n // {type:\u0027burst\u0027, burstRemaining}.\n // 6. Else: reject {reason:\u0027rate_limited\u0027}.\n // 7. Log every call.\n","golden_completion":" tryRequest(timestamp) {\n if (timestamp \u003c this.cooldownUntil) {\n this.log.push({ timestamp, allowed: false, reason: \u0027cooldown\u0027 });\n return { allowed: false, reason: \u0027cooldown\u0027, retryAfter: this.cooldownUntil - timestamp };\n }\n if (this.cooldownUntil \u003e 0 \u0026\u0026 timestamp \u003e= this.cooldownUntil) this.burstUsed = 0;\n this.requests = this.requests.filter(t =\u003e t \u003e timestamp - this.windowMs);\n const count = this.requests.length;\n if (count \u003c this.maxRequests) {\n this.requests.push(timestamp);\n this.log.push({ timestamp, allowed: true, type: \u0027normal\u0027 });\n return { allowed: true, type: \u0027normal\u0027, remaining: this.maxRequests - count - 1 };\n }\n if (this.burstUsed \u003c this.burstAllowance) {\n this.requests.push(timestamp);\n this.burstUsed++;\n const rem = this.burstAllowance - this.burstUsed;\n if (this.burstUsed \u003e= this.burstAllowance) this.cooldownUntil = timestamp + this.cooldownMs;\n this.log.push({ timestamp, allowed: true, type: \u0027burst\u0027 });\n return { allowed: true, type: \u0027burst\u0027, burstRemaining: rem };\n }\n this.log.push({ timestamp, allowed: false, reason: \u0027rate_limited\u0027 });\n return { allowed: false, reason: \u0027rate_limited\u0027 };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst rl = new RateLimiter(1000, 3, 2, 500);\n\nconst r1 = rl.tryRequest(100);\nassert.strictEqual(r1.type, \u0027normal\u0027);\nassert.strictEqual(r1.remaining, 2);\nrl.tryRequest(200);\nrl.tryRequest(300);\n\nconst r4 = rl.tryRequest(400);\nassert.strictEqual(r4.type, \u0027burst\u0027);\nassert.strictEqual(r4.burstRemaining, 1);\nconsole.log(\u0027Task 27 suffix passed\u0027);\n","assertions":"// Last burst triggers cooldown\nconst r5 = rl.tryRequest(500);\nassert.strictEqual(r5.type, \u0027burst\u0027);\nassert.strictEqual(r5.burstRemaining, 0);\n\n// Cooldown\nconst r6 = rl.tryRequest(600);\nassert.strictEqual(r6.reason, \u0027cooldown\u0027);\nassert.strictEqual(r6.retryAfter, 400);\n\nassert.strictEqual(rl.tryRequest(999).reason, \u0027cooldown\u0027);\n\n// After cooldown + old requests expired\nconst r8 = rl.tryRequest(1501);\nassert.strictEqual(r8.allowed, true);\nassert.strictEqual(r8.type, \u0027normal\u0027);\nassert.strictEqual(r8.remaining, 2);\n\nassert.strictEqual(rl.log.length, 8);\nconsole.log(\u0027Task 27 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"28","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class Contract {\n constructor(id, totalValue, holdbackPct, penaltyPerDay) {\n this.id = id;\n this.totalValue = totalValue;\n this.holdbackPct = holdbackPct;\n this.penaltyPerDay = penaltyPerDay;\n this.milestones = [];\n this.holdbackPool = 0;\n this.totalReleased = 0;\n this.totalPenalties = 0;\n this.audit = [];\n }\n\n addMilestone(id, value, dueDay) {\n this.milestones.push({ id, value, dueDay, accepted: false, penalty: 0 });\n }\n\n // Accept deliverable for milestone.\n // 1. Throw if not found or already accepted.\n // 2. lateDays = max(0, acceptDay - dueDay).\n // 3. penalty = min(lateDays * penaltyPerDay, milestone.value).\n // 4. holdback = value * holdbackPct.\n // 5. released = max(0, value - holdback - penalty).\n // 6. Accumulate holdbackPool, totalReleased, totalPenalties.\n // 7. If ALL milestones now accepted: release holdbackPool to totalReleased.\n // 8. Return {milestoneId, lateDays, penalty, holdback, released, holdbackReleased}.\n","golden_completion":" acceptDeliverable(milestoneId, acceptDay) {\n const ms = this.milestones.find(m =\u003e m.id === milestoneId);\n if (!ms) throw new Error(\u0027Not found\u0027);\n if (ms.accepted) throw new Error(\u0027Already accepted\u0027);\n const lateDays = Math.max(0, acceptDay - ms.dueDay);\n const penalty = Math.min(lateDays * this.penaltyPerDay, ms.value);\n const holdback = ms.value * this.holdbackPct;\n const released = Math.max(0, ms.value - holdback - penalty);\n this.holdbackPool += holdback;\n this.totalReleased += released;\n this.totalPenalties += penalty;\n ms.accepted = true;\n ms.penalty = penalty;\n let holdbackReleased = false;\n if (this.milestones.every(m =\u003e m.accepted)) {\n this.totalReleased += this.holdbackPool;\n holdbackReleased = true;\n this.holdbackPool = 0;\n }\n const entry = { milestoneId, lateDays, penalty, holdback, released, holdbackReleased };\n this.audit.push(entry);\n return entry;\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst c = new Contract(\u0027C1\u0027, 10000, 0.10, 50);\nc.addMilestone(\u0027M1\u0027, 3000, 30);\nc.addMilestone(\u0027M2\u0027, 5000, 60);\nc.addMilestone(\u0027M3\u0027, 2000, 90);\n\nconst a1 = c.acceptDeliverable(\u0027M1\u0027, 25);\nassert.strictEqual(a1.lateDays, 0);\nassert.strictEqual(a1.penalty, 0);\nassert.strictEqual(a1.holdback, 300);\nassert.strictEqual(a1.released, 2700);\nassert.strictEqual(a1.holdbackReleased, false);\nassert.strictEqual(c.holdbackPool, 300);\nconsole.log(\u0027Task 28 suffix passed\u0027);\n","assertions":"// Late delivery\nconst a2 = c.acceptDeliverable(\u0027M2\u0027, 70);\nassert.strictEqual(a2.lateDays, 10);\nassert.strictEqual(a2.penalty, 500);\nassert.strictEqual(a2.released, 4000);\nassert.strictEqual(a2.holdbackReleased, false);\n\n// Last milestone triggers holdback release\nconst a3 = c.acceptDeliverable(\u0027M3\u0027, 85);\nassert.strictEqual(a3.holdbackReleased, true);\nassert.strictEqual(c.holdbackPool, 0);\nassert.strictEqual(c.totalReleased, 2700 + 4000 + 1800 + 1000);\n\n// Cannot accept twice\nlet threw = false;\ntry { c.acceptDeliverable(\u0027M1\u0027, 100); } catch(e) { threw = true; }\nassert.strictEqual(threw, true);\n\n// Penalty capped at value\nconst c2 = new Contract(\u0027C2\u0027, 5000, 0.10, 1000);\nc2.addMilestone(\u0027X\u0027, 5000, 10);\nconst a4 = c2.acceptDeliverable(\u0027X\u0027, 100);\nassert.strictEqual(a4.penalty, 5000);\nassert.strictEqual(a4.released, 0);\nassert.strictEqual(a4.holdbackReleased, true);\nconsole.log(\u0027Task 28 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"29","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class ReferralProgram {\n constructor(maxDepth, rewardPerLevel, payoutDelayDays) {\n this.maxDepth = maxDepth;\n this.rewardPerLevel = rewardPerLevel;\n this.payoutDelayDays = payoutDelayDays;\n this.users = {};\n this.pendingPayouts = [];\n this.processedPairs = new Set();\n }\n\n addUser(userId, referredBy = null) {\n const depth = referredBy \u0026\u0026 this.users[referredBy]\n ? this.users[referredBy].depth + 1 : 0;\n this.users[userId] = { referredBy, depth, referrals: [] };\n if (referredBy \u0026\u0026 this.users[referredBy])\n this.users[referredBy].referrals.push(userId);\n }\n\n // Process referral when \u0027referred\u0027 acts on \u0027day\u0027.\n // 1. No referrer? {rewarded:false, reason:\u0027no_referrer\u0027}.\n // 2. Walk UP chain from referred\u0027s referrer. At each level (1,2,...):\n // if level \u003c= maxDepth and pair not processed:\n // reward = rewardPerLevel / 2^(level-1), rounded to 2 decimals.\n // Add pending payout {userId:ancestor, amount, availableDay: day+delay}.\n // Mark \"ancestor-\u003ereferred\" as processed.\n // 3. Return {rewarded:true, payoutsCreated, chain:[...ancestorIds]}.\n","golden_completion":" processReferral(referredUserId, day) {\n const referred = this.users[referredUserId];\n if (!referred || !referred.referredBy)\n return { rewarded: false, reason: \u0027no_referrer\u0027 };\n let current = referred.referredBy, level = 1, payoutsCreated = 0;\n const chain = [];\n while (current \u0026\u0026 level \u003c= this.maxDepth \u0026\u0026 this.users[current]) {\n chain.push(current);\n const key = `${current}-\u003e${referredUserId}`;\n if (!this.processedPairs.has(key)) {\n const amount = Math.round(this.rewardPerLevel / Math.pow(2, level - 1) * 100) / 100;\n this.pendingPayouts.push({ userId: current, amount, availableDay: day + this.payoutDelayDays });\n this.processedPairs.add(key);\n payoutsCreated++;\n }\n current = this.users[current].referredBy;\n level++;\n }\n return { rewarded: true, payoutsCreated, chain };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst rp = new ReferralProgram(3, 100, 7);\nrp.addUser(\u0027A\u0027);\nrp.addUser(\u0027B\u0027, \u0027A\u0027);\nrp.addUser(\u0027C\u0027, \u0027B\u0027);\nrp.addUser(\u0027D\u0027, \u0027C\u0027);\n\nconst r1 = rp.processReferral(\u0027D\u0027, 10);\nassert.strictEqual(r1.payoutsCreated, 3);\nassert.deepStrictEqual(r1.chain, [\u0027C\u0027, \u0027B\u0027, \u0027A\u0027]);\nassert.strictEqual(rp.pendingPayouts[0].amount, 100);\nassert.strictEqual(rp.pendingPayouts[1].amount, 50);\nassert.strictEqual(rp.pendingPayouts[2].amount, 25);\nassert.strictEqual(rp.pendingPayouts[0].availableDay, 17);\nconsole.log(\u0027Task 29 suffix passed\u0027);\n","assertions":"// Duplicate prevention\nconst r2 = rp.processReferral(\u0027D\u0027, 20);\nassert.strictEqual(r2.payoutsCreated, 0);\n\n// No referrer\nconst rp2 = new ReferralProgram(2, 50, 3);\nrp2.addUser(\u0027X\u0027);\nassert.strictEqual(rp2.processReferral(\u0027X\u0027, 5).rewarded, false);\n\n// Depth limit = 1\nconst rp3 = new ReferralProgram(1, 80, 5);\nrp3.addUser(\u0027P\u0027); rp3.addUser(\u0027Q\u0027, \u0027P\u0027); rp3.addUser(\u0027R\u0027, \u0027Q\u0027);\nconst r4 = rp3.processReferral(\u0027R\u0027, 1);\nassert.strictEqual(r4.payoutsCreated, 1);\nassert.deepStrictEqual(r4.chain, [\u0027Q\u0027]);\n\n// Reward halving\nconst rp4 = new ReferralProgram(4, 100, 0);\nrp4.addUser(\u0027a\u0027); rp4.addUser(\u0027b\u0027, \u0027a\u0027); rp4.addUser(\u0027c\u0027, \u0027b\u0027);\nrp4.addUser(\u0027d\u0027, \u0027c\u0027); rp4.addUser(\u0027e\u0027, \u0027d\u0027);\nconst r5 = rp4.processReferral(\u0027e\u0027, 1);\nassert.strictEqual(r5.payoutsCreated, 4);\nassert.strictEqual(rp4.pendingPayouts[0].amount, 100);\nassert.strictEqual(rp4.pendingPayouts[3].amount, 12.5);\nconsole.log(\u0027Task 29 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"30","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class FairPriorityQueue {\n constructor(maxConsecutive, agingBoost) {\n this.maxConsecutive = maxConsecutive;\n this.agingBoost = agingBoost;\n this.items = [];\n this.dequeued = [];\n this.currentTick = 0;\n this.lastCategory = null;\n this.consecutiveCount = 0;\n }\n\n enqueue(id, category, basePriority) {\n this.items.push({ id, category, basePriority, enqueuedAt: this.currentTick });\n }\n\n tick() { this.currentTick++; }\n\n // Dequeue highest-effective-priority item with fairness.\n // 1. Empty? Return null.\n // 2. effectivePriority = basePriority + (currentTick - enqueuedAt) * agingBoost.\n // 3. Sort by effectivePriority descending.\n // 4. FAIRNESS: if top.category === lastCategory AND consecutiveCount \u003e= maxConsecutive,\n // pick highest from a DIFFERENT category. If all same category, allow (no starvation).\n // 5. Update lastCategory/consecutiveCount. Remove from items.\n // 6. Return {id, category, effectivePriority, waitTime, forced: bool}.\n","golden_completion":" dequeue() {\n if (this.items.length === 0) return null;\n const scored = this.items.map((item, idx) =\u003e ({\n ...item, idx,\n effectivePriority: item.basePriority + (this.currentTick - item.enqueuedAt) * this.agingBoost\n }));\n scored.sort((a, b) =\u003e b.effectivePriority - a.effectivePriority);\n let chosen = scored[0], forced = false;\n if (chosen.category === this.lastCategory \u0026\u0026 this.consecutiveCount \u003e= this.maxConsecutive) {\n const alt = scored.find(s =\u003e s.category !== this.lastCategory);\n if (alt) { chosen = alt; forced = true; }\n }\n if (chosen.category === this.lastCategory) this.consecutiveCount++;\n else { this.lastCategory = chosen.category; this.consecutiveCount = 1; }\n this.items.splice(chosen.idx, 1);\n const waitTime = this.currentTick - chosen.enqueuedAt;\n this.dequeued.push({ id: chosen.id, category: chosen.category, effectivePriority: chosen.effectivePriority });\n return { id: chosen.id, category: chosen.category, effectivePriority: chosen.effectivePriority, waitTime, forced };\n }\n","suffix":"\n}\n\nconst assert = require(\u0027assert\u0027);\nconst q = new FairPriorityQueue(2, 5);\nq.enqueue(\u0027A\u0027, \u0027urgent\u0027, 100);\nq.enqueue(\u0027B\u0027, \u0027normal\u0027, 50);\nq.enqueue(\u0027C\u0027, \u0027urgent\u0027, 90);\n\nconst d1 = q.dequeue();\nassert.strictEqual(d1.id, \u0027A\u0027);\nassert.strictEqual(d1.forced, false);\n\nconst d2 = q.dequeue();\nassert.strictEqual(d2.id, \u0027C\u0027);\nassert.strictEqual(d2.forced, false);\nconsole.log(\u0027Task 30 suffix passed\u0027);\n","assertions":"// Fairness kicks in\nconst q2 = new FairPriorityQueue(2, 10);\nq2.enqueue(\u0027h1\u0027, \u0027high\u0027, 100);\nq2.enqueue(\u0027h2\u0027, \u0027high\u0027, 95);\nq2.enqueue(\u0027h3\u0027, \u0027high\u0027, 90);\nq2.enqueue(\u0027l1\u0027, \u0027low\u0027, 30);\n\nq2.dequeue(); // h1\nq2.dequeue(); // h2\nconst f3 = q2.dequeue(); // fairness: l1 instead of h3\nassert.strictEqual(f3.id, \u0027l1\u0027);\nassert.strictEqual(f3.forced, true);\nassert.strictEqual(q2.dequeue().id, \u0027h3\u0027);\n\n// Aging boost\nconst q3 = new FairPriorityQueue(5, 20);\nq3.enqueue(\u0027old\u0027, \u0027A\u0027, 10);\nq3.tick(); q3.tick(); q3.tick();\nq3.enqueue(\u0027new\u0027, \u0027A\u0027, 50);\nconst a1 = q3.dequeue();\nassert.strictEqual(a1.id, \u0027old\u0027);\nassert.strictEqual(a1.effectivePriority, 70);\nassert.strictEqual(a1.waitTime, 3);\n\n// All same category: no starvation\nconst q4 = new FairPriorityQueue(1, 0);\nq4.enqueue(\u0027x\u0027, \u0027only\u0027, 10);\nq4.enqueue(\u0027y\u0027, \u0027only\u0027, 5);\nq4.dequeue();\nconst s = q4.dequeue();\nassert.strictEqual(s.id, \u0027y\u0027);\nassert.strictEqual(s.forced, false);\n\nassert.strictEqual(new FairPriorityQueue(2, 5).dequeue(), null);\nconsole.log(\u0027Task 30 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"31","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass ExpenseReport {\n constructor(employeeId, categoryLimits) {\n this.employeeId = employeeId;\n this.categoryLimits = categoryLimits; // e.g. { travel: 500, meals: 200 }\n this.items = [];\n this.audit = [];\n this.categoryTotals = {};\n this.status = \u0027draft\u0027;\n this.reimbursement = 0;\n }\n\n","golden_completion":" addExpense(category, amount, receiptId) {\n if (this.status !== \u0027draft\u0027)\n return (this.audit.push({ action: \u0027reject_add\u0027, reason: \u0027not_draft\u0027, receiptId }), false);\n if (!receiptId || amount \u003c= 0)\n return (this.audit.push({ action: \u0027reject_add\u0027, reason: \u0027invalid_input\u0027, receiptId }), false);\n const limit = this.categoryLimits[category];\n const cur = this.categoryTotals[category] || 0;\n const capped = limit !== undefined ? Math.min(amount, limit - cur) : amount;\n if (capped \u003c= 0)\n return (this.audit.push({ action: \u0027reject_add\u0027, reason: \u0027over_limit\u0027, category, amount }), false);\n this.categoryTotals[category] = cur + capped;\n this.items.push({ category, amount: capped, receiptId, originalAmount: amount });\n this.reimbursement += capped;\n this.audit.push({ action: \u0027add\u0027, category, capped, originalAmount: amount, receiptId });\n return true;\n }\n","suffix":"\n submit() {\n if (this.status !== \u0027draft\u0027 || this.items.length === 0) return false;\n this.status = \u0027submitted\u0027;\n this.audit.push({ action: \u0027submit\u0027, itemCount: this.items.length });\n return true;\n }\n}\n\n// Basic valid expense\nconst er = new ExpenseReport(\u0027E1\u0027, { travel: 500, meals: 200 });\nassert.strictEqual(er.addExpense(\u0027travel\u0027, 100, \u0027R1\u0027), true);\nassert.strictEqual(er.reimbursement, 100);\nassert.strictEqual(er.items.length, 1);\n\n// Add another travel expense\nassert.strictEqual(er.addExpense(\u0027travel\u0027, 300, \u0027R2\u0027), true);\nassert.strictEqual(er.reimbursement, 400);\n\n// Exceeding category limit: only partial reimbursement for capped amount\nassert.strictEqual(er.addExpense(\u0027travel\u0027, 200, \u0027R3\u0027), true);\n// travel limit is 500, already at 400, so only 100 is reimbursed\nassert.strictEqual(er.categoryTotals[\u0027travel\u0027], 500);\nassert.strictEqual(er.items[2].amount, 100);\nassert.strictEqual(er.items[2].originalAmount, 200);\nassert.strictEqual(er.reimbursement, 500);\n\n// Fully over limit: rejected\nassert.strictEqual(er.addExpense(\u0027travel\u0027, 50, \u0027R4\u0027), false);\nassert.strictEqual(er.reimbursement, 500);\n","assertions":"\n// Invalid inputs\nconst er2 = new ExpenseReport(\u0027E2\u0027, { meals: 200 });\nassert.strictEqual(er2.addExpense(\u0027meals\u0027, -10, \u0027R1\u0027), false);\nassert.strictEqual(er2.addExpense(\u0027meals\u0027, 50, \u0027\u0027), false);\nassert.strictEqual(er2.addExpense(\u0027meals\u0027, 50, null), false);\n\n// No category limit means uncapped\nassert.strictEqual(er2.addExpense(\u0027misc\u0027, 9999, \u0027R2\u0027), true);\nassert.strictEqual(er2.reimbursement, 9999);\n\n// Cannot add after submit\ner2.addExpense(\u0027meals\u0027, 100, \u0027R3\u0027);\ner2.submit();\nassert.strictEqual(er2.addExpense(\u0027meals\u0027, 50, \u0027R4\u0027), false);\nassert.strictEqual(er2.audit.filter(a =\u003e a.reason === \u0027not_draft\u0027).length, 1);\n\n// Audit trail has entries for every action\nconst er3 = new ExpenseReport(\u0027E3\u0027, { travel: 100 });\ner3.addExpense(\u0027travel\u0027, 60, \u0027RA\u0027);\ner3.addExpense(\u0027travel\u0027, 60, \u0027RB\u0027); // partial (capped to 40)\ner3.addExpense(\u0027travel\u0027, 10, \u0027RC\u0027); // rejected (over limit)\nassert.strictEqual(er3.audit.length, 3);\nassert.strictEqual(er3.audit[1].capped, 40);\nassert.strictEqual(er3.audit[2].reason, \u0027over_limit\u0027);\n","category":"code_purpose_understanding"} {"id":"32","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass SubscriptionManager {\n constructor(plans) {\n this.plans = plans; // { planName: { price: N, features: [...] } }\n this.currentPlan = null;\n this.billingStart = 0;\n this.cycleLength = 30; // days\n this.balance = 0; // credit/debit carried forward\n this.changes = [];\n }\n\n subscribe(planName, day) {\n if (this.currentPlan) return false;\n this.currentPlan = planName;\n this.billingStart = day;\n this.balance = 0;\n this.changes.push({ action: \u0027subscribe\u0027, plan: planName, day });\n return true;\n }\n\n","golden_completion":" changePlan(newPlan, day) {\n if (!this.currentPlan || newPlan === this.currentPlan || !this.plans[newPlan]) return false;\n const daysUsed = day - this.billingStart;\n if (daysUsed \u003c 0 || daysUsed \u003e this.cycleLength) return false;\n const oldPlan = this.currentPlan;\n const remaining = (this.cycleLength - daysUsed) / this.cycleLength;\n const credit = this.plans[oldPlan].price * remaining;\n const charge = this.plans[newPlan].price * remaining;\n this.balance += credit - charge;\n this.currentPlan = newPlan;\n this.billingStart = day;\n this.changes.push({ action: \u0027change\u0027, from: oldPlan, to: newPlan, day,\n credit: parseFloat(credit.toFixed(2)), charge: parseFloat(charge.toFixed(2)) });\n return true;\n }\n","suffix":"\n hasFeature(feature) {\n if (!this.currentPlan) return false;\n return this.plans[this.currentPlan].features.includes(feature);\n }\n}\n\nconst plans = {\n basic: { price: 30, features: [\u0027email\u0027] },\n pro: { price: 90, features: [\u0027email\u0027, \u0027api\u0027, \u0027support\u0027] },\n enterprise: { price: 180, features: [\u0027email\u0027, \u0027api\u0027, \u0027support\u0027, \u0027sla\u0027, \u0027sso\u0027] }\n};\n\nconst sm = new SubscriptionManager(plans);\nsm.subscribe(\u0027basic\u0027, 0);\n\n// Upgrade at day 10: used 10/30 of basic ($30), credit = 30 * 20/30 = $20\n// Remaining pro cost = 90 * 20/30 = $60\n// balance = 20 - 60 = -40\nassert.strictEqual(sm.changePlan(\u0027pro\u0027, 10), true);\nassert.strictEqual(sm.currentPlan, \u0027pro\u0027);\nassert.ok(Math.abs(sm.balance - (-40)) \u003c 0.01);\n\n// Features now include pro features\nassert.strictEqual(sm.hasFeature(\u0027api\u0027), true);\nassert.strictEqual(sm.hasFeature(\u0027sso\u0027), false);\n\n// Cannot change to same plan\nassert.strictEqual(sm.changePlan(\u0027pro\u0027, 15), false);\n\n// Downgrade from pro at day 20 (10 days into new sub):\n// credit = 90 * 20/30 = 60, charge = 30 * 20/30 = 20\n// balance was -40, now += 60 - 20 = +40, total = 0\nassert.strictEqual(sm.changePlan(\u0027basic\u0027, 20), true);\nassert.ok(Math.abs(sm.balance - 0) \u003c 0.01);\n\n// Change log\nassert.strictEqual(sm.changes.length, 3);\nassert.strictEqual(sm.changes[1].action, \u0027change\u0027);\nassert.strictEqual(sm.changes[1].credit, 20);\nassert.strictEqual(sm.changes[1].charge, 60);\n","assertions":"\n// Cannot change without subscription\nconst sm2 = new SubscriptionManager(plans);\nassert.strictEqual(sm2.changePlan(\u0027pro\u0027, 5), false);\n\n// Cannot change to invalid plan\nconst sm3 = new SubscriptionManager(plans);\nsm3.subscribe(\u0027basic\u0027, 0);\nassert.strictEqual(sm3.changePlan(\u0027invalid\u0027, 5), false);\n\n// Day out of cycle range\nassert.strictEqual(sm3.changePlan(\u0027pro\u0027, -1), false);\nassert.strictEqual(sm3.changePlan(\u0027pro\u0027, 31), false);\n\n// Change at day 0: full credit, full charge\nconst sm4 = new SubscriptionManager(plans);\nsm4.subscribe(\u0027basic\u0027, 0);\nsm4.changePlan(\u0027pro\u0027, 0);\n// credit = 30 * 30/30 = 30, charge = 90 * 30/30 = 90, balance = 30 - 90 = -60\nassert.ok(Math.abs(sm4.balance - (-60)) \u003c 0.01);\n\n// Change at end of cycle (day 30): zero credit, zero charge\nconst sm5 = new SubscriptionManager(plans);\nsm5.subscribe(\u0027basic\u0027, 0);\nsm5.changePlan(\u0027pro\u0027, 30);\nassert.ok(Math.abs(sm5.balance - 0) \u003c 0.01);\n","category":"code_purpose_understanding"} {"id":"33","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass Warehouse {\n constructor(bins) {\n // bins: { binId: { zone: string, capacity: number } }\n this.bins = {};\n for (const [id, cfg] of Object.entries(bins)) {\n this.bins[id] = { ...cfg, items: [], currentLoad: 0 };\n }\n this.zoneRules = { cold: [\u0027cold\u0027], dry: [\u0027dry\u0027, \u0027ambient\u0027], hazmat: [\u0027hazmat\u0027] };\n this.log = [];\n }\n\n","golden_completion":" assignItem(itemId, itemZone, itemSize, preferredBin) {\n const compat = this.zoneRules[itemZone];\n if (!compat) return (this.log.push({ action: \u0027reject\u0027, itemId, reason: \u0027unknown_zone\u0027 }), null);\n const tryBin = (binId) =\u003e {\n const bin = this.bins[binId];\n if (!bin || !compat.includes(bin.zone) || bin.currentLoad + itemSize \u003e bin.capacity) return false;\n bin.items.push({ itemId, size: itemSize, ts: Date.now() });\n bin.currentLoad += itemSize;\n this.log.push({ action: \u0027assign\u0027, itemId, binId, size: itemSize });\n return true;\n };\n if (preferredBin \u0026\u0026 tryBin(preferredBin)) return preferredBin;\n for (const binId of Object.keys(this.bins)) if (tryBin(binId)) return binId;\n return (this.log.push({ action: \u0027reject\u0027, itemId, reason: \u0027no_space\u0027 }), null);\n }\n","suffix":"\n evictOldest(binId) {\n const bin = this.bins[binId];\n if (!bin || bin.items.length === 0) return null;\n const item = bin.items.shift(); // FIFO\n bin.currentLoad -= item.size;\n this.log.push({ action: \u0027evict\u0027, itemId: item.itemId, binId });\n return item.itemId;\n }\n}\n\nconst wh = new Warehouse({\n B1: { zone: \u0027cold\u0027, capacity: 100 },\n B2: { zone: \u0027dry\u0027, capacity: 50 },\n B3: { zone: \u0027hazmat\u0027, capacity: 30 }\n});\n\n// Assign cold item to preferred bin\nassert.strictEqual(wh.assignItem(\u0027I1\u0027, \u0027cold\u0027, 40, \u0027B1\u0027), \u0027B1\u0027);\nassert.strictEqual(wh.bins[\u0027B1\u0027].currentLoad, 40);\n\n// Assign cold item that doesn\u0027t fit preferred - should fail (no other cold bin)\nassert.strictEqual(wh.assignItem(\u0027I2\u0027, \u0027cold\u0027, 80, \u0027B1\u0027), null);\n\n// Assign dry item: prefers B2 (dry zone), fits\nassert.strictEqual(wh.assignItem(\u0027I3\u0027, \u0027dry\u0027, 30, \u0027B2\u0027), \u0027B2\u0027);\n\n// Assign dry item too big for B2, falls back to any compatible - no other dry bin\nassert.strictEqual(wh.assignItem(\u0027I4\u0027, \u0027dry\u0027, 30, \u0027B2\u0027), null);\n\n// Unknown zone\nassert.strictEqual(wh.assignItem(\u0027I5\u0027, \u0027radioactive\u0027, 10, \u0027B1\u0027), null);\n\n// Verify log\nassert.strictEqual(wh.log.length, 5);\nassert.strictEqual(wh.log[0].action, \u0027assign\u0027);\nassert.strictEqual(wh.log[1].reason, \u0027no_space\u0027);\nassert.strictEqual(wh.log[4].reason, \u0027unknown_zone\u0027);\n","assertions":"\n// Zone compatibility: dry items can go in dry or ambient, not cold/hazmat\nconst wh2 = new Warehouse({\n A1: { zone: \u0027cold\u0027, capacity: 100 },\n A2: { zone: \u0027ambient\u0027, capacity: 100 },\n A3: { zone: \u0027dry\u0027, capacity: 10 }\n});\n// Dry item, preferred cold bin A1 incompatible, falls back to A2 (ambient, compatible)\nassert.strictEqual(wh2.assignItem(\u0027X1\u0027, \u0027dry\u0027, 50, \u0027A1\u0027), \u0027A2\u0027);\nassert.strictEqual(wh2.bins[\u0027A2\u0027].currentLoad, 50);\n\n// Hazmat only goes to hazmat\nassert.strictEqual(wh2.assignItem(\u0027X2\u0027, \u0027hazmat\u0027, 5, \u0027A1\u0027), null);\n\n// Fill and evict\nconst wh3 = new Warehouse({ Z1: { zone: \u0027cold\u0027, capacity: 20 } });\nwh3.assignItem(\u0027first\u0027, \u0027cold\u0027, 10, \u0027Z1\u0027);\nwh3.assignItem(\u0027second\u0027, \u0027cold\u0027, 10, \u0027Z1\u0027);\nassert.strictEqual(wh3.evictOldest(\u0027Z1\u0027), \u0027first\u0027);\nassert.strictEqual(wh3.bins[\u0027Z1\u0027].currentLoad, 10);\n// Now space for one more\nassert.strictEqual(wh3.assignItem(\u0027third\u0027, \u0027cold\u0027, 10, \u0027Z1\u0027), \u0027Z1\u0027);\n","category":"code_purpose_understanding"} {"id":"34","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass LoyaltyProgram {\n constructor(tierMultipliers) {\n this.tierMultipliers = tierMultipliers; // { silver: 1, gold: 1.5, platinum: 2 }\n this.pointBatches = []; // { points, earnedAt, expiresAt }\n this.tier = \u0027silver\u0027;\n this.totalEarned = 0;\n this.totalBurned = 0;\n this.transactions = [];\n }\n\n get availablePoints() {\n return this.pointBatches.reduce((sum, b) =\u003e sum + b.points, 0);\n }\n\n earn(basePoints, currentDay) {\n const mult = this.tierMultipliers[this.tier] || 1;\n const actual = Math.floor(basePoints * mult);\n this.pointBatches.push({ points: actual, earnedAt: currentDay, expiresAt: currentDay + 365 });\n this.totalEarned += actual;\n this.transactions.push({ action: \u0027earn\u0027, base: basePoints, multiplier: mult, actual, day: currentDay });\n return actual;\n }\n\n","golden_completion":" burn(amount, currentDay) {\n this.pointBatches = this.pointBatches.filter(b =\u003e b.expiresAt \u003e currentDay);\n let remaining = amount;\n const consumed = [];\n while (remaining \u003e 0 \u0026\u0026 this.pointBatches.length \u003e 0) {\n const batch = this.pointBatches[0];\n if (batch.points \u003c= remaining) {\n remaining -= batch.points;\n consumed.push({ ...batch, used: batch.points });\n this.pointBatches.shift();\n } else {\n batch.points -= remaining;\n consumed.push({ earnedAt: batch.earnedAt, used: remaining });\n remaining = 0;\n }\n }\n const burned = amount - remaining;\n this.totalBurned += burned;\n this.transactions.push({ action: \u0027burn\u0027, requested: amount, burned, day: currentDay, batches: consumed.length });\n return burned;\n }\n","suffix":"\n upgradeTier(newTier) {\n if (this.tierMultipliers[newTier] === undefined) return false;\n const old = this.tier;\n this.tier = newTier;\n this.transactions.push({ action: \u0027upgrade\u0027, from: old, to: newTier });\n return true;\n }\n}\n\nconst lp = new LoyaltyProgram({ silver: 1, gold: 1.5, platinum: 2 });\n\n// Earn as silver: 100 * 1 = 100\nassert.strictEqual(lp.earn(100, 0), 100);\nassert.strictEqual(lp.availablePoints, 100);\n\n// Upgrade to gold\nlp.upgradeTier(\u0027gold\u0027);\n\n// Earn as gold: 100 * 1.5 = 150\nassert.strictEqual(lp.earn(100, 10), 150);\nassert.strictEqual(lp.availablePoints, 250);\n\n// Burn 200: uses FIFO (first batch of 100, then 100 from second batch of 150)\nassert.strictEqual(lp.burn(200, 20), 200);\nassert.strictEqual(lp.availablePoints, 50);\nassert.strictEqual(lp.pointBatches.length, 1);\nassert.strictEqual(lp.pointBatches[0].points, 50);\n\n// Over-burn: only 50 available\nassert.strictEqual(lp.burn(100, 30), 50);\nassert.strictEqual(lp.availablePoints, 0);\n\n// Stats\nassert.strictEqual(lp.totalEarned, 250);\nassert.strictEqual(lp.totalBurned, 250);\nassert.strictEqual(lp.transactions.length, 5); // 2 earn + 1 upgrade + 2 burn\n","assertions":"\n// Expiry test: earn at day 0, expires at day 365\nconst lp2 = new LoyaltyProgram({ silver: 1 });\nlp2.earn(500, 0);\nassert.strictEqual(lp2.availablePoints, 500);\n\n// Burn at day 364: still valid\nassert.strictEqual(lp2.burn(100, 364), 100);\nassert.strictEqual(lp2.availablePoints, 400);\n\n// Burn at day 365: expired, nothing to burn\nassert.strictEqual(lp2.burn(100, 365), 0);\nassert.strictEqual(lp2.availablePoints, 0);\n\n// Partial burn with mixed expiry\nconst lp3 = new LoyaltyProgram({ silver: 1, gold: 2 });\nlp3.earn(100, 0); // expires day 365\nlp3.earn(100, 100); // expires day 465\n// At day 365, first batch expired, second has 100\nassert.strictEqual(lp3.burn(150, 365), 100); // only 100 available\nassert.strictEqual(lp3.totalBurned, 100);\n\n// Multiplier with floor\nconst lp4 = new LoyaltyProgram({ silver: 1, gold: 1.5 });\nlp4.upgradeTier(\u0027gold\u0027);\nassert.strictEqual(lp4.earn(33, 0), 49); // floor(33 * 1.5) = 49\n","category":"code_purpose_understanding"} {"id":"35","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass ResourceAllocator {\n constructor() {\n this.resources = {}; // { id: { skills: Set, assignments: [{ projectId, start, end }] } }\n this.allocations = [];\n }\n\n addResource(id, skills) {\n this.resources[id] = { skills: new Set(skills), assignments: [] };\n }\n\n","golden_completion":" allocate(projectId, requiredSkills, start, end) {\n for (const [id, res] of Object.entries(this.resources)) {\n const hasSkills = requiredSkills.every(s =\u003e res.skills.has(s));\n if (!hasSkills) continue;\n const hasConflict = res.assignments.some(a =\u003e\n a.start \u003c end \u0026\u0026 a.end \u003e start\n );\n if (hasConflict) continue;\n res.assignments.push({ projectId, start, end });\n this.allocations.push({ resourceId: id, projectId, start, end });\n return id;\n }\n return null;\n }\n","suffix":"}\n\nconst ra = new ResourceAllocator();\nra.addResource(\u0027R1\u0027, [\u0027js\u0027, \u0027node\u0027]);\nra.addResource(\u0027R2\u0027, [\u0027js\u0027, \u0027react\u0027, \u0027node\u0027]);\nra.addResource(\u0027R3\u0027, [\u0027python\u0027, \u0027ml\u0027]);\n\n// R1 has js + node\nassert.strictEqual(ra.allocate(\u0027P1\u0027, [\u0027js\u0027, \u0027node\u0027], 0, 10), \u0027R1\u0027);\n\n// R1 is busy 0-10, R2 has the skills\nassert.strictEqual(ra.allocate(\u0027P2\u0027, [\u0027js\u0027, \u0027node\u0027], 5, 15), \u0027R2\u0027);\n\n// Both R1 and R2 busy during 5-15 overlap, R3 doesn\u0027t have js\nassert.strictEqual(ra.allocate(\u0027P3\u0027, [\u0027js\u0027], 8, 12), null);\n\n// R1 free after day 10\nassert.strictEqual(ra.allocate(\u0027P4\u0027, [\u0027js\u0027], 10, 20), \u0027R1\u0027);\n\n// Allocation log\nassert.strictEqual(ra.allocations.length, 3);\nassert.strictEqual(ra.allocations[0].resourceId, \u0027R1\u0027);\nassert.strictEqual(ra.allocations[1].resourceId, \u0027R2\u0027);\nassert.strictEqual(ra.allocations[2].resourceId, \u0027R1\u0027);\n","assertions":"\n// No matching skills\nconst ra2 = new ResourceAllocator();\nra2.addResource(\u0027A\u0027, [\u0027java\u0027]);\nassert.strictEqual(ra2.allocate(\u0027X\u0027, [\u0027python\u0027], 0, 10), null);\n\n// Partial skill match insufficient\nra2.addResource(\u0027B\u0027, [\u0027python\u0027]);\nassert.strictEqual(ra2.allocate(\u0027Y\u0027, [\u0027python\u0027, \u0027ml\u0027], 0, 10), null);\n\n// Edge case: adjacent time slots (no overlap)\nconst ra3 = new ResourceAllocator();\nra3.addResource(\u0027C\u0027, [\u0027go\u0027]);\nassert.strictEqual(ra3.allocate(\u0027P1\u0027, [\u0027go\u0027], 0, 10), \u0027C\u0027);\nassert.strictEqual(ra3.allocate(\u0027P2\u0027, [\u0027go\u0027], 10, 20), \u0027C\u0027); // starts exactly when P1 ends\nassert.strictEqual(ra3.allocations.length, 2);\n\n// Overlap detection: start \u003c end \u0026\u0026 end \u003e start\nassert.strictEqual(ra3.allocate(\u0027P3\u0027, [\u0027go\u0027], 9, 11), null); // overlaps both\n","category":"code_purpose_understanding"} {"id":"36","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass Invoice {\n constructor(id, lineItems) {\n this.id = id;\n this.lineItems = lineItems.map(li =\u003e ({ ...li, paid: 0 })); // { desc, amount, paid }\n this.payments = [];\n this.credit = 0;\n this.status = \u0027unpaid\u0027;\n }\n\n get totalDue() {\n return this.lineItems.reduce((s, li) =\u003e s + li.amount, 0);\n }\n\n get totalPaid() {\n return this.lineItems.reduce((s, li) =\u003e s + li.paid, 0);\n }\n\n","golden_completion":" applyPayment(amount, reference) {\n if (amount \u003c= 0) return { applied: 0, credit: 0 };\n let rem = amount;\n const allocs = [];\n for (const li of this.lineItems) {\n const owed = li.amount - li.paid;\n if (owed \u003c= 0) continue;\n const a = Math.min(rem, owed);\n li.paid += a; rem -= a;\n allocs.push({ desc: li.desc, applied: a });\n if (rem \u003c= 0) break;\n }\n const applied = amount - rem;\n this.credit += rem;\n this.payments.push({ reference, amount, applied, creditAdded: rem, allocations: allocs });\n this.status = this.totalPaid \u003e= this.totalDue ? \u0027paid\u0027 : this.totalPaid \u003e 0 ? \u0027partial\u0027 : this.status;\n return { applied, credit: rem };\n }\n","suffix":"}\n\nconst inv = new Invoice(\u0027INV-1\u0027, [\n { desc: \u0027Widget A\u0027, amount: 100 },\n { desc: \u0027Widget B\u0027, amount: 200 },\n { desc: \u0027Shipping\u0027, amount: 50 }\n]);\n\nassert.strictEqual(inv.totalDue, 350);\nassert.strictEqual(inv.status, \u0027unpaid\u0027);\n\n// Partial payment of 150: covers Widget A (100) + 50 of Widget B\nconst r1 = inv.applyPayment(150, \u0027PAY-1\u0027);\nassert.strictEqual(r1.applied, 150);\nassert.strictEqual(r1.credit, 0);\nassert.strictEqual(inv.lineItems[0].paid, 100);\nassert.strictEqual(inv.lineItems[1].paid, 50);\nassert.strictEqual(inv.status, \u0027partial\u0027);\n\n// Another payment of 250: covers remaining 150 of Widget B + 50 Shipping + 50 overpayment\nconst r2 = inv.applyPayment(250, \u0027PAY-2\u0027);\nassert.strictEqual(r2.applied, 200);\nassert.strictEqual(r2.credit, 50);\nassert.strictEqual(inv.credit, 50);\nassert.strictEqual(inv.status, \u0027paid\u0027);\n\n// Payment log\nassert.strictEqual(inv.payments.length, 2);\nassert.strictEqual(inv.payments[0].allocations.length, 2); // Widget A + Widget B\nassert.strictEqual(inv.payments[1].allocations.length, 2); // Widget B + Shipping\nassert.strictEqual(inv.payments[1].creditAdded, 50);\n","assertions":"\n// Zero/negative payment\nconst inv2 = new Invoice(\u0027INV-2\u0027, [{ desc: \u0027Item\u0027, amount: 100 }]);\nassert.deepStrictEqual(inv2.applyPayment(0, \u0027X\u0027), { applied: 0, credit: 0 });\nassert.deepStrictEqual(inv2.applyPayment(-5, \u0027Y\u0027), { applied: 0, credit: 0 });\nassert.strictEqual(inv2.status, \u0027unpaid\u0027);\n\n// Exact payment\ninv2.applyPayment(100, \u0027PAY\u0027);\nassert.strictEqual(inv2.status, \u0027paid\u0027);\nassert.strictEqual(inv2.credit, 0);\n\n// All overpayment\nconst inv3 = new Invoice(\u0027INV-3\u0027, [{ desc: \u0027A\u0027, amount: 10 }]);\ninv3.applyPayment(10, \u0027P1\u0027);\nconst r3 = inv3.applyPayment(25, \u0027P2\u0027); // entire amount is overpayment\nassert.strictEqual(r3.applied, 0);\nassert.strictEqual(r3.credit, 25);\nassert.strictEqual(inv3.credit, 25);\n\n// Multiple line items, single payment covers all\nconst inv4 = new Invoice(\u0027INV-4\u0027, [\n { desc: \u0027X\u0027, amount: 10 },\n { desc: \u0027Y\u0027, amount: 20 },\n { desc: \u0027Z\u0027, amount: 30 }\n]);\nconst r4 = inv4.applyPayment(60, \u0027FULL\u0027);\nassert.strictEqual(r4.applied, 60);\nassert.strictEqual(inv4.payments[0].allocations.length, 3);\n","category":"code_purpose_understanding"} {"id":"37","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass FlightSeating {\n constructor(rows) {\n // rows: { \u00271A\u0027: { class: \u0027first\u0027, occupied: false, accessible: false }, ... }\n this.seats = {};\n for (const [id, info] of Object.entries(rows)) {\n this.seats[id] = { ...info, passenger: null };\n }\n this.manifest = [];\n this.classHierarchy = [\u0027economy\u0027, \u0027business\u0027, \u0027first\u0027];\n }\n\n","golden_completion":" assignSeat(passengerId, seatId, needsAccessible) {\n const seat = this.seats[seatId];\n if (!seat || seat.occupied) {\n this.manifest.push({ passengerId, seatId, status: \u0027denied\u0027, reason: seat ? \u0027occupied\u0027 : \u0027invalid\u0027 });\n return false;\n }\n if (needsAccessible \u0026\u0026 !seat.accessible) {\n this.manifest.push({ passengerId, seatId, status: \u0027denied\u0027, reason: \u0027not_accessible\u0027 });\n return false;\n }\n seat.occupied = true;\n seat.passenger = passengerId;\n this.manifest.push({ passengerId, seatId, status: \u0027assigned\u0027, class: seat.class });\n return true;\n }\n","suffix":"\n upgradePassenger(passengerId) {\n const currentSeat = Object.entries(this.seats).find(([_, s]) =\u003e s.passenger === passengerId);\n if (!currentSeat) return null;\n const [oldSeatId, oldSeat] = currentSeat;\n const currentIdx = this.classHierarchy.indexOf(oldSeat.class);\n if (currentIdx \u003e= this.classHierarchy.length - 1) return null; // already top class\n const nextClass = this.classHierarchy[currentIdx + 1];\n const freeSeat = Object.entries(this.seats).find(([_, s]) =\u003e s.class === nextClass \u0026\u0026 !s.occupied);\n if (!freeSeat) return null;\n const [newSeatId, newSeat] = freeSeat;\n oldSeat.occupied = false;\n oldSeat.passenger = null;\n newSeat.occupied = true;\n newSeat.passenger = passengerId;\n this.manifest.push({ passengerId, from: oldSeatId, to: newSeatId, status: \u0027upgraded\u0027 });\n return newSeatId;\n }\n}\n\nconst seats = {\n \u00271A\u0027: { class: \u0027first\u0027, occupied: false, accessible: false },\n \u00272A\u0027: { class: \u0027business\u0027, occupied: false, accessible: true },\n \u00273A\u0027: { class: \u0027economy\u0027, occupied: false, accessible: false },\n \u00273B\u0027: { class: \u0027economy\u0027, occupied: false, accessible: true }\n};\n\nconst fs = new FlightSeating(seats);\n\n// Normal assignment\nassert.strictEqual(fs.assignSeat(\u0027P1\u0027, \u00273A\u0027, false), true);\nassert.strictEqual(fs.seats[\u00273A\u0027].passenger, \u0027P1\u0027);\n\n// Accessible requirement\nassert.strictEqual(fs.assignSeat(\u0027P2\u0027, \u00273A\u0027, true), false); // occupied\nassert.strictEqual(fs.assignSeat(\u0027P2\u0027, \u00271A\u0027, true), false); // not accessible\nassert.strictEqual(fs.assignSeat(\u0027P2\u0027, \u00273B\u0027, true), true);\n\n// Invalid seat\nassert.strictEqual(fs.assignSeat(\u0027P3\u0027, \u002799Z\u0027, false), false);\n\n// Manifest: 5 entries (P1 assigned, P2 occupied on 3A, P2 not_accessible on 1A, P2 assigned on 3B, P3 invalid)\nassert.strictEqual(fs.manifest.length, 5);\nassert.strictEqual(fs.manifest[0].status, \u0027assigned\u0027);\nassert.strictEqual(fs.manifest[1].reason, \u0027occupied\u0027);\nassert.strictEqual(fs.manifest[2].reason, \u0027not_accessible\u0027);\nassert.strictEqual(fs.manifest[4].reason, \u0027invalid\u0027);\n","assertions":"\n// Double assignment to same seat\nconst seats2 = { \u0027A1\u0027: { class: \u0027economy\u0027, occupied: false, accessible: false } };\nconst fs2 = new FlightSeating(seats2);\nassert.strictEqual(fs2.assignSeat(\u0027X\u0027, \u0027A1\u0027, false), true);\nassert.strictEqual(fs2.assignSeat(\u0027Y\u0027, \u0027A1\u0027, false), false);\nassert.strictEqual(fs2.manifest[1].reason, \u0027occupied\u0027);\n\n// Accessible seat for non-accessible need: should work\nconst seats3 = { \u0027B1\u0027: { class: \u0027economy\u0027, occupied: false, accessible: true } };\nconst fs3 = new FlightSeating(seats3);\nassert.strictEqual(fs3.assignSeat(\u0027Z\u0027, \u0027B1\u0027, false), true); // accessible seat OK for anyone\n\n// Manifest records class\nassert.strictEqual(fs3.manifest[0].class, \u0027economy\u0027);\n","category":"code_purpose_understanding"} {"id":"38","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass ComplianceChecker {\n constructor(rules, exceptions) {\n // rules: [{ id, check: fn, severity: \u0027error\u0027|\u0027warning\u0027 }] — evaluated in order, first error stops\n // exceptions: { ruleId: { grantedTo: [...], expiresAt: number } }\n this.rules = rules;\n this.exceptions = exceptions;\n this.auditLog = [];\n }\n\n","golden_completion":" evaluate(entityId, entity, currentDay) {\n const results = [];\n let blocked = false;\n for (const rule of this.rules) {\n const exc = this.exceptions[rule.id];\n if (exc \u0026\u0026 exc.grantedTo.includes(entityId) \u0026\u0026 exc.expiresAt \u003e currentDay) {\n results.push({ ruleId: rule.id, status: \u0027exempted\u0027 });\n this.auditLog.push({ entityId, ruleId: rule.id, status: \u0027exempted\u0027, day: currentDay });\n continue;\n }\n const passed = rule.check(entity);\n if (!passed \u0026\u0026 rule.severity === \u0027error\u0027) {\n results.push({ ruleId: rule.id, status: \u0027fail\u0027, severity: \u0027error\u0027 });\n this.auditLog.push({ entityId, ruleId: rule.id, status: \u0027fail\u0027, day: currentDay });\n blocked = true; break;\n }\n const st = passed ? \u0027pass\u0027 : \u0027warn\u0027;\n results.push({ ruleId: rule.id, status: st, severity: passed ? null : \u0027warning\u0027 });\n this.auditLog.push({ entityId, ruleId: rule.id, status: st, day: currentDay });\n }\n return { entityId, compliant: !blocked, results };\n }\n","suffix":"}\n\nconst rules = [\n { id: \u0027R1\u0027, check: (e) =\u003e e.age \u003e= 18, severity: \u0027error\u0027 },\n { id: \u0027R2\u0027, check: (e) =\u003e e.certified === true, severity: \u0027error\u0027 },\n { id: \u0027R3\u0027, check: (e) =\u003e e.training \u003e 40, severity: \u0027warning\u0027 }\n];\n\nconst exceptions = {\n \u0027R2\u0027: { grantedTo: [\u0027E1\u0027], expiresAt: 100 }\n};\n\nconst cc = new ComplianceChecker(rules, exceptions);\n\n// E1 has exception for R2 (certification), valid until day 100\nconst r1 = cc.evaluate(\u0027E1\u0027, { age: 20, certified: false, training: 50 }, 50);\nassert.strictEqual(r1.compliant, true);\nassert.strictEqual(r1.results.length, 3);\nassert.strictEqual(r1.results[0].status, \u0027pass\u0027);\nassert.strictEqual(r1.results[1].status, \u0027exempted\u0027);\nassert.strictEqual(r1.results[2].status, \u0027pass\u0027);\n\n// Same entity, exception expired\nconst r2 = cc.evaluate(\u0027E1\u0027, { age: 20, certified: false, training: 50 }, 100);\nassert.strictEqual(r2.compliant, false);\nassert.strictEqual(r2.results.length, 2); // stops at R2 error\nassert.strictEqual(r2.results[1].status, \u0027fail\u0027);\n\n// Entity fails first rule (age), stops immediately\nconst r3 = cc.evaluate(\u0027E2\u0027, { age: 16, certified: true, training: 50 }, 50);\nassert.strictEqual(r3.compliant, false);\nassert.strictEqual(r3.results.length, 1);\n","assertions":"\n// Warning doesn\u0027t block\nconst rules2 = [\n { id: \u0027W1\u0027, check: (e) =\u003e e.score \u003e 80, severity: \u0027warning\u0027 },\n { id: \u0027W2\u0027, check: (e) =\u003e e.active, severity: \u0027error\u0027 }\n];\nconst cc2 = new ComplianceChecker(rules2, {});\nconst w = cc2.evaluate(\u0027X\u0027, { score: 50, active: true }, 0);\nassert.strictEqual(w.compliant, true);\nassert.strictEqual(w.results[0].status, \u0027warn\u0027);\nassert.strictEqual(w.results[0].severity, \u0027warning\u0027);\nassert.strictEqual(w.results[1].status, \u0027pass\u0027);\n\n// All pass\nconst r = cc2.evaluate(\u0027Y\u0027, { score: 90, active: true }, 0);\nassert.strictEqual(r.compliant, true);\nassert.strictEqual(r.results[0].status, \u0027pass\u0027);\nassert.strictEqual(r.results[0].severity, null);\n\n// Audit log tracks everything\nassert.strictEqual(cc2.auditLog.length, 4); // 2 from X + 2 from Y\n\n// Exception for entity not in grantedTo list\nconst cc3 = new ComplianceChecker(\n [{ id: \u0027Z1\u0027, check: () =\u003e false, severity: \u0027error\u0027 }],\n { \u0027Z1\u0027: { grantedTo: [\u0027A\u0027], expiresAt: 999 } }\n);\nconst e = cc3.evaluate(\u0027B\u0027, {}, 0);\nassert.strictEqual(e.compliant, false); // B not in grantedTo\n","category":"code_purpose_understanding"} {"id":"39","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass ReturnProcessor {\n constructor(config) {\n this.fullRefundDays = config.fullRefundDays; // e.g. 30\n this.creditOnlyDays = config.creditOnlyDays; // e.g. 60\n this.restockingPct = config.restockingPct; // e.g. 0.15\n this.returns = [];\n }\n\n","golden_completion":" processReturn(orderId, items, orderDay, returnDay) {\n const elapsed = returnDay - orderDay;\n if (elapsed \u003c 0) return null;\n if (elapsed \u003e this.creditOnlyDays) {\n this.returns.push({ orderId, status: \u0027rejected\u0027, reason: \u0027past_return_window\u0027, elapsed });\n return { status: \u0027rejected\u0027, refund: 0, credit: 0 };\n }\n const sub = items.reduce((s, i) =\u003e s + i.price * i.qty, 0);\n const fee = elapsed \u003c= this.fullRefundDays ? 0 : parseFloat((sub * this.restockingPct).toFixed(2));\n const net = parseFloat((sub - fee).toFixed(2));\n const method = elapsed \u003c= this.fullRefundDays ? \u0027refund\u0027 : \u0027credit\u0027;\n const result = { status: \u0027approved\u0027, method, subtotal: sub, restocking: fee,\n refund: method === \u0027refund\u0027 ? net : 0, credit: method === \u0027credit\u0027 ? net : 0 };\n this.returns.push({ orderId, ...result, elapsed });\n return result;\n }\n","suffix":"}\n\nconst rp = new ReturnProcessor({ fullRefundDays: 30, creditOnlyDays: 60, restockingPct: 0.15 });\n\n// Return within 30 days: full refund, no restocking fee\nconst r1 = rp.processReturn(\u0027O1\u0027, [{ price: 50, qty: 2 }], 0, 20);\nassert.strictEqual(r1.status, \u0027approved\u0027);\nassert.strictEqual(r1.method, \u0027refund\u0027);\nassert.strictEqual(r1.subtotal, 100);\nassert.strictEqual(r1.restocking, 0);\nassert.strictEqual(r1.refund, 100);\nassert.strictEqual(r1.credit, 0);\n\n// Return at day 45: store credit with restocking fee\nconst r2 = rp.processReturn(\u0027O2\u0027, [{ price: 200, qty: 1 }], 0, 45);\nassert.strictEqual(r2.method, \u0027credit\u0027);\nassert.strictEqual(r2.restocking, 30); // 200 * 0.15\nassert.strictEqual(r2.credit, 170);\nassert.strictEqual(r2.refund, 0);\n\n// Return at day 61: rejected\nconst r3 = rp.processReturn(\u0027O3\u0027, [{ price: 100, qty: 1 }], 0, 61);\nassert.strictEqual(r3.status, \u0027rejected\u0027);\nassert.strictEqual(r3.refund, 0);\nassert.strictEqual(r3.credit, 0);\n\n// Log\nassert.strictEqual(rp.returns.length, 3);\nassert.strictEqual(rp.returns[2].reason, \u0027past_return_window\u0027);\n","assertions":"\n// Exact boundary: day 30 is full refund\nconst rp2 = new ReturnProcessor({ fullRefundDays: 30, creditOnlyDays: 60, restockingPct: 0.10 });\nconst b1 = rp2.processReturn(\u0027B1\u0027, [{ price: 100, qty: 1 }], 0, 30);\nassert.strictEqual(b1.method, \u0027refund\u0027);\nassert.strictEqual(b1.restocking, 0);\n\n// Day 31: credit with restocking\nconst b2 = rp2.processReturn(\u0027B2\u0027, [{ price: 100, qty: 1 }], 0, 31);\nassert.strictEqual(b2.method, \u0027credit\u0027);\nassert.strictEqual(b2.restocking, 10);\nassert.strictEqual(b2.credit, 90);\n\n// Day 60: last day for credit\nconst b3 = rp2.processReturn(\u0027B3\u0027, [{ price: 100, qty: 1 }], 0, 60);\nassert.strictEqual(b3.method, \u0027credit\u0027);\n\n// Negative elapsed (invalid)\nassert.strictEqual(rp2.processReturn(\u0027B4\u0027, [{ price: 50, qty: 1 }], 10, 5), null);\n\n// Multiple items\nconst b5 = rp2.processReturn(\u0027B5\u0027, [{ price: 20, qty: 3 }, { price: 10, qty: 2 }], 0, 35);\nassert.strictEqual(b5.subtotal, 80); // 60 + 20\nassert.strictEqual(b5.restocking, 8); // 80 * 0.10\nassert.strictEqual(b5.credit, 72);\n","category":"code_purpose_understanding"} {"id":"40","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass ShiftScheduler {\n constructor(minRestHours, overtimeThreshold) {\n this.minRestHours = minRestHours; // minimum hours between shifts\n this.overtimeThreshold = overtimeThreshold; // weekly hours before overtime kicks in\n this.schedule = {}; // { employeeId: [{ day, start, end }] }\n this.weeklyHours = {}; // { employeeId: number }\n this.log = [];\n }\n\n","golden_completion":" assignShift(employeeId, day, start, end) {\n if (start \u003e= end) return { ok: false, reason: \u0027invalid_times\u0027 };\n const hours = end - start;\n if (!this.schedule[employeeId]) { this.schedule[employeeId] = []; this.weeklyHours[employeeId] = 0; }\n const shifts = this.schedule[employeeId];\n for (const s of shifts) {\n if (s.day === day \u0026\u0026 s.start \u003c end \u0026\u0026 s.end \u003e start)\n return (this.log.push({ employeeId, day, status: \u0027denied\u0027, reason: \u0027overlap\u0027 }), { ok: false, reason: \u0027overlap\u0027 });\n const gapAfter = (day * 24 + start) - (s.day * 24 + s.end);\n const gapBefore = (s.day * 24 + s.start) - (day * 24 + end);\n const gap = Math.max(gapAfter, gapBefore);\n if (gap \u003e= 0 \u0026\u0026 gap \u003c this.minRestHours)\n return (this.log.push({ employeeId, day, status: \u0027denied\u0027, reason: \u0027insufficient_rest\u0027 }), { ok: false, reason: \u0027insufficient_rest\u0027 });\n }\n const prev = this.weeklyHours[employeeId];\n const newOT = Math.max(0, prev + hours - this.overtimeThreshold) - Math.max(0, prev - this.overtimeThreshold);\n this.weeklyHours[employeeId] += hours;\n shifts.push({ day, start, end });\n this.log.push({ employeeId, day, status: \u0027assigned\u0027, hours, overtime: newOT });\n return { ok: true, hours, overtime: newOT, totalWeekly: this.weeklyHours[employeeId] };\n }\n","suffix":"}\n\nconst ss = new ShiftScheduler(8, 40);\n\n// Normal shift: day 0, 9am-5pm (8 hours)\nconst s1 = ss.assignShift(\u0027E1\u0027, 0, 9, 17);\nassert.strictEqual(s1.ok, true);\nassert.strictEqual(s1.hours, 8);\nassert.strictEqual(s1.overtime, 0);\nassert.strictEqual(s1.totalWeekly, 8);\n\n// Same day overlap: denied\nconst s2 = ss.assignShift(\u0027E1\u0027, 0, 14, 20);\nassert.strictEqual(s2.ok, false);\nassert.strictEqual(s2.reason, \u0027overlap\u0027);\n\n// Next day early morning: insufficient rest (E1 ends at 17:00 day 0,\n// 6am day 1 is only 13 hours gap - wait, that\u0027s \u003e 8, should be OK)\n// Actually: day0 17:00 to day1 6:00 = 13 hours, \u003e 8, so OK\nconst s3 = ss.assignShift(\u0027E1\u0027, 1, 6, 14);\nassert.strictEqual(s3.ok, true);\nassert.strictEqual(s3.totalWeekly, 16);\n\n// Invalid times\nconst s4 = ss.assignShift(\u0027E1\u0027, 2, 20, 15);\nassert.strictEqual(s4.ok, false);\nassert.strictEqual(s4.reason, \u0027invalid_times\u0027);\n\n// Overtime: E1 has 16 hours, add shifts to pass 40\nss.assignShift(\u0027E1\u0027, 2, 9, 17); // +8 = 24\nss.assignShift(\u0027E1\u0027, 3, 9, 17); // +8 = 32\nconst s5 = ss.assignShift(\u0027E1\u0027, 4, 9, 19); // +10 = 42, 2 overtime\nassert.strictEqual(s5.ok, true);\nassert.strictEqual(s5.overtime, 2);\nassert.strictEqual(s5.totalWeekly, 42);\n","assertions":"\n// Insufficient rest\nconst ss2 = new ShiftScheduler(10, 40);\nss2.assignShift(\u0027A\u0027, 0, 14, 22); // ends 22:00 day 0\n// Day 1 at 6:00: gap = 24+6 - 22 = 8 hours \u003c 10 minimum\nconst r = ss2.assignShift(\u0027A\u0027, 1, 6, 14);\nassert.strictEqual(r.ok, false);\nassert.strictEqual(r.reason, \u0027insufficient_rest\u0027);\n\n// Day 1 at 8:00: gap = 24+8 - 22 = 10 hours \u003e= 10 minimum\nconst r2 = ss2.assignShift(\u0027A\u0027, 1, 8, 16);\nassert.strictEqual(r2.ok, true);\n\n// Different employees don\u0027t conflict\nconst ss3 = new ShiftScheduler(8, 40);\nss3.assignShift(\u0027X\u0027, 0, 9, 17);\nconst rx = ss3.assignShift(\u0027Y\u0027, 0, 9, 17);\nassert.strictEqual(rx.ok, true);\n\n// Full overtime\nconst ss4 = new ShiftScheduler(0, 20);\nss4.assignShift(\u0027Z\u0027, 0, 0, 15); // 15 hours\nconst rz = ss4.assignShift(\u0027Z\u0027, 1, 0, 10); // 10 hours, total 25, overtime = 5\nassert.strictEqual(rz.overtime, 5);\nassert.strictEqual(rz.totalWeekly, 25);\n\n// Log entries\nassert.strictEqual(ss2.log.length, 3); // denied + denied + assigned... wait\n// Actually: first assign (ok), then denied (insufficient_rest), then assigned (ok)\nassert.strictEqual(ss2.log.filter(l =\u003e l.status === \u0027denied\u0027).length, 1);\n","category":"code_purpose_understanding"} {"id":"41","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class EscrowAccount {\n constructor(totalAmount, holdbackPct = 0.10) {\n this.totalAmount = totalAmount;\n this.holdbackPct = holdbackPct;\n this.milestones = {}; // name -\u003e { required: bool, completed: bool }\n this.defects = []; // list of unresolved defect descriptions\n this.released = 0; // total released so far\n this.releaseLog = []; // { amount, timestamp, milestones: [...] }\n this._releaseIds = new Set(); // idempotency keys\n }\n\n addMilestone(name, required = true) {\n this.milestones[name] = { required, completed: false };\n }\n\n completeMilestone(name) {\n if (this.milestones[name]) this.milestones[name].completed = true;\n }\n\n reportDefect(desc) { this.defects.push(desc); }\n resolveDefect(desc) { this.defects = this.defects.filter(d =\u003e d !== desc); }\n\n","golden_completion":" release(releaseId, timestamp) {\n if (this._releaseIds.has(releaseId)) return { status: \u0027duplicate\u0027, amount: 0 };\n if (this.defects.length \u003e 0) return { status: \u0027blocked-defects\u0027, amount: 0 };\n const unmet = Object.entries(this.milestones)\n .filter(([, v]) =\u003e v.required \u0026\u0026 !v.completed);\n if (unmet.length \u003e 0) return { status: \u0027milestones-pending\u0027, amount: 0 };\n const holdback = this.totalAmount * this.holdbackPct;\n const available = this.totalAmount - holdback - this.released;\n if (available \u003c= 0) return { status: \u0027fully-released\u0027, amount: 0 };\n this._releaseIds.add(releaseId);\n this.released += available;\n const completedNames = Object.keys(this.milestones).filter(k =\u003e this.milestones[k].completed);\n this.releaseLog.push({ amount: available, timestamp, milestones: completedNames });\n return { status: \u0027released\u0027, amount: available };\n }\n","suffix":"\n}\n\nconst esc = new EscrowAccount(10000, 0.10);\nesc.addMilestone(\u0027design\u0027, true);\nesc.addMilestone(\u0027build\u0027, true);\nesc.addMilestone(\u0027test\u0027, false);\n\n// Can\u0027t release with incomplete required milestones\nlet r1 = esc.release(\u0027r1\u0027, 1000);\nconsole.assert(r1.status === \u0027milestones-pending\u0027, \u0027Should block on milestones\u0027);\n\nesc.completeMilestone(\u0027design\u0027);\nesc.completeMilestone(\u0027build\u0027);\n\n// Defect blocks release\nesc.reportDefect(\u0027cracked foundation\u0027);\nlet r2 = esc.release(\u0027r2\u0027, 2000);\nconsole.assert(r2.status === \u0027blocked-defects\u0027, \u0027Should block on defects\u0027);\n\n// Resolve defect, now release works\nesc.resolveDefect(\u0027cracked foundation\u0027);\nlet r3 = esc.release(\u0027r3\u0027, 3000);\nconsole.assert(r3.status === \u0027released\u0027, \u0027Should release\u0027);\n// holdback = 10% of 10000 = 1000, so available = 10000 - 1000 - 0 = 9000\nconsole.assert(r3.amount === 9000, \u0027Should release 9000\u0027);\nconsole.assert(esc.released === 9000, \u0027Total released should be 9000\u0027);\n\n// Idempotent: same releaseId returns duplicate\nlet r4 = esc.release(\u0027r3\u0027, 4000);\nconsole.assert(r4.status === \u0027duplicate\u0027, \u0027Duplicate release\u0027);\nconsole.assert(r4.amount === 0, \u0027Duplicate amount 0\u0027);\nconsole.assert(esc.released === 9000, \u0027Released unchanged after dup\u0027);\n\n// Audit log\nconsole.assert(esc.releaseLog.length === 1, \u0027One release logged\u0027);\nconsole.assert(esc.releaseLog[0].amount === 9000, \u0027Log amount\u0027);\nconsole.assert(esc.releaseLog[0].timestamp === 3000, \u0027Log timestamp\u0027);\n","assertions":"\n// Second release with different id after first: nothing left (holdback retained)\nlet r5 = esc.release(\u0027r5\u0027, 5000);\nconsole.assert(r5.status === \u0027fully-released\u0027, \u0027Nothing left to release\u0027);\nconsole.assert(r5.amount === 0);\n\n// New escrow: optional milestone not blocking\nconst esc2 = new EscrowAccount(5000, 0.20);\nesc2.addMilestone(\u0027alpha\u0027, true);\nesc2.addMilestone(\u0027beta\u0027, false);\nesc2.completeMilestone(\u0027alpha\u0027);\nlet r6 = esc2.release(\u0027x1\u0027, 100);\nconsole.assert(r6.status === \u0027released\u0027);\n// holdback = 20% of 5000 = 1000, available = 5000 - 1000 = 4000\nconsole.assert(r6.amount === 4000, \u0027Should be 4000 after 20% holdback\u0027);\n\n// Idempotency across different escrows doesn\u0027t interfere\nlet r7 = esc.release(\u0027x1\u0027, 200);\n// esc is fully released already\nconsole.assert(r7.status === \u0027fully-released\u0027);\nconsole.log(\u0027Task 41 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"42","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class SLAIncident {\n constructor(id, slaLimitMs) {\n this.id = id;\n this.slaLimitMs = slaLimitMs;\n this.state = \u0027open\u0027; // open -\u003e acknowledged -\u003e paused -\u003e resolved\n this.transitions = []; // { from, to, timestamp }\n this.openedAt = null;\n this.resolvedAt = null;\n this._pausedAt = null;\n this._totalPausedMs = 0;\n this.breached = false;\n }\n\n static VALID_TRANSITIONS = {\n \u0027open\u0027: [\u0027acknowledged\u0027],\n \u0027acknowledged\u0027: [\u0027paused\u0027, \u0027resolved\u0027],\n \u0027paused\u0027: [\u0027acknowledged\u0027],\n \u0027resolved\u0027: []\n };\n\n","golden_completion":" transition(newState, timestamp) {\n if (!this.openedAt) this.openedAt = timestamp;\n const allowed = SLAIncident.VALID_TRANSITIONS[this.state];\n if (!allowed || !allowed.includes(newState))\n throw new Error(`Invalid: ${this.state} -\u003e ${newState}`);\n if (this.state === \u0027paused\u0027) {\n this._totalPausedMs += timestamp - this._pausedAt;\n this._pausedAt = null;\n }\n if (newState === \u0027paused\u0027) this._pausedAt = timestamp;\n if (newState === \u0027resolved\u0027) {\n this.resolvedAt = timestamp;\n const activeMs = (this.resolvedAt - this.openedAt) - this._totalPausedMs;\n this.breached = activeMs \u003e this.slaLimitMs;\n }\n this.transitions.push({ from: this.state, to: newState, timestamp });\n this.state = newState;\n }\n","suffix":"\n}\n\nconst inc = new SLAIncident(\u0027INC-001\u0027, 5000); // 5s SLA\ninc.transition(\u0027acknowledged\u0027, 1000);\nconsole.assert(inc.state === \u0027acknowledged\u0027);\nconsole.assert(inc.openedAt === 1000);\n\n// Pause for 3 seconds\ninc.transition(\u0027paused\u0027, 2000);\nconsole.assert(inc.state === \u0027paused\u0027);\n\n// Resume\ninc.transition(\u0027acknowledged\u0027, 5000); // paused 3000ms\nconsole.assert(inc._totalPausedMs === 3000, \u0027Should exclude 3s paused time\u0027);\n\n// Resolve at 9000: total elapsed = 9000-1000=8000, minus paused 3000 = 5000 active\ninc.transition(\u0027resolved\u0027, 9000);\nconsole.assert(inc.state === \u0027resolved\u0027);\nconsole.assert(inc.breached === false, \u00275000ms active == 5000ms limit, not breached\u0027);\n\n// Audit trail\nconsole.assert(inc.transitions.length === 4);\nconsole.assert(inc.transitions[0].from === \u0027open\u0027);\nconsole.assert(inc.transitions[0].to === \u0027acknowledged\u0027);\n","assertions":"\n// Breached scenario\nconst inc2 = new SLAIncident(\u0027INC-002\u0027, 2000); // 2s SLA\ninc2.transition(\u0027acknowledged\u0027, 0);\ninc2.transition(\u0027resolved\u0027, 3000); // 3000ms active \u003e 2000ms limit\nconsole.assert(inc2.breached === true, \u0027Should breach 2s SLA\u0027);\n\n// Multiple pause/resume cycles\nconst inc3 = new SLAIncident(\u0027INC-003\u0027, 10000);\ninc3.transition(\u0027acknowledged\u0027, 0);\ninc3.transition(\u0027paused\u0027, 1000); // pause\ninc3.transition(\u0027acknowledged\u0027, 6000); // resume (+5000 paused)\ninc3.transition(\u0027paused\u0027, 7000); // pause again\ninc3.transition(\u0027acknowledged\u0027, 12000);// resume (+5000 paused, total 10000 paused)\ninc3.transition(\u0027resolved\u0027, 22000); // elapsed=22000, paused=10000, active=12000\nconsole.assert(inc3._totalPausedMs === 10000);\nconsole.assert(inc3.breached === true, \u002712000 \u003e 10000 limit\u0027);\n\n// Invalid transition throws\nlet threw = false;\ntry { inc3.transition(\u0027acknowledged\u0027, 23000); } catch(e) { threw = true; }\nconsole.assert(threw, \u0027resolved -\u003e acknowledged should throw\u0027);\n\n// Direct open -\u003e paused is invalid\nconst inc4 = new SLAIncident(\u0027INC-004\u0027, 5000);\nthrew = false;\ntry { inc4.transition(\u0027paused\u0027, 100); } catch(e) { threw = true; }\nconsole.assert(threw, \u0027open -\u003e paused should throw\u0027);\nconsole.log(\u0027Task 42 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"43","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class PharmacyDispenser {\n constructor() {\n this.inventory = {}; // drugName -\u003e quantity\n this.dispensedLog = []; // { rxId, drug, qty, copay, timestamp }\n this._dispensedRxIds = new Set(); // idempotency\n this.dailyControlled = {}; // date_str -\u003e total controlled qty dispensed\n }\n\n addInventory(drug, qty) {\n this.inventory[drug] = (this.inventory[drug] || 0) + qty;\n }\n\n // Drug registry: controlled flag, max daily, min refill interval (ms), copay tiers\n static DRUGS = {\n \u0027oxycodone\u0027: { controlled: true, maxDaily: 60, minRefillMs: 72*3600000, copay: { generic: 10, brand: 35 } },\n \u0027ibuprofen\u0027: { controlled: false, maxDaily: 999, minRefillMs: 0, copay: { generic: 5, brand: 15 } },\n \u0027alprazolam\u0027: { controlled: true, maxDaily: 30, minRefillMs: 48*3600000, copay: { generic: 15, brand: 45 } },\n };\n\n","golden_completion":" dispense(rxId, drug, qty, tier, timestamp) {\n if (this._dispensedRxIds.has(rxId)) return { status: \u0027duplicate\u0027, copay: 0 };\n const info = PharmacyDispenser.DRUGS[drug];\n if (!info) return { status: \u0027unknown-drug\u0027, copay: 0 };\n if ((this.inventory[drug] || 0) \u003c qty) return { status: \u0027out-of-stock\u0027, copay: 0 };\n const dateStr = new Date(timestamp).toISOString().slice(0, 10);\n if (info.controlled) {\n const todayTotal = (this.dailyControlled[dateStr] || 0) + qty;\n if (todayTotal \u003e info.maxDaily) return { status: \u0027daily-limit-exceeded\u0027, copay: 0 };\n }\n const lastDispense = this.dispensedLog.filter(l =\u003e l.drug === drug).pop();\n if (lastDispense \u0026\u0026 (timestamp - lastDispense.timestamp) \u003c info.minRefillMs)\n return { status: \u0027refill-too-soon\u0027, copay: 0 };\n const copay = info.copay[tier] || info.copay.generic;\n this.inventory[drug] -= qty;\n this._dispensedRxIds.add(rxId);\n this.dailyControlled[dateStr] = (this.dailyControlled[dateStr] || 0) + (info.controlled ? qty : 0);\n this.dispensedLog.push({ rxId, drug, qty, copay, timestamp });\n return { status: \u0027dispensed\u0027, copay };\n }\n","suffix":"\n}\n\nconst pharm = new PharmacyDispenser();\npharm.addInventory(\u0027oxycodone\u0027, 100);\npharm.addInventory(\u0027ibuprofen\u0027, 500);\npharm.addInventory(\u0027alprazolam\u0027, 50);\n\n// Normal dispense\nconst d1 = pharm.dispense(\u0027rx001\u0027, \u0027oxycodone\u0027, 30, \u0027generic\u0027, Date.parse(\u00272026-01-15T10:00:00Z\u0027));\nconsole.assert(d1.status === \u0027dispensed\u0027, \u0027Should dispense\u0027);\nconsole.assert(d1.copay === 10, \u0027Generic copay for oxycodone is 10\u0027);\n\n// Daily limit: already dispensed 30, trying 40 more (total 70 \u003e maxDaily 60)\nconst d2 = pharm.dispense(\u0027rx002\u0027, \u0027oxycodone\u0027, 40, \u0027generic\u0027, Date.parse(\u00272026-01-15T14:00:00Z\u0027));\nconsole.assert(d2.status === \u0027daily-limit-exceeded\u0027, \u0027Should exceed daily limit\u0027);\n\n// But 20 more is fine (total 50 \u003c= 60)\nconst d3 = pharm.dispense(\u0027rx002\u0027, \u0027oxycodone\u0027, 20, \u0027brand\u0027, Date.parse(\u00272026-01-15T14:00:00Z\u0027));\n// Wait - refill-too-soon: last oxycodone was at 10:00, now 14:00, interval only 4h \u003c 72h\nconsole.assert(d3.status === \u0027refill-too-soon\u0027, \u0027Should be too soon to refill\u0027);\n\n// Idempotency\nconst d4 = pharm.dispense(\u0027rx001\u0027, \u0027oxycodone\u0027, 30, \u0027generic\u0027, Date.parse(\u00272026-01-20T10:00:00Z\u0027));\nconsole.assert(d4.status === \u0027duplicate\u0027, \u0027Duplicate rxId\u0027);\nconsole.assert(d4.copay === 0);\n","assertions":"\n// Non-controlled drug has no daily limit and no refill interval\nconst d5 = pharm.dispense(\u0027rx005\u0027, \u0027ibuprofen\u0027, 100, \u0027generic\u0027, Date.parse(\u00272026-01-15T10:00:00Z\u0027));\nconsole.assert(d5.status === \u0027dispensed\u0027);\nconsole.assert(d5.copay === 5);\nconst d6 = pharm.dispense(\u0027rx006\u0027, \u0027ibuprofen\u0027, 100, \u0027brand\u0027, Date.parse(\u00272026-01-15T10:01:00Z\u0027));\nconsole.assert(d6.status === \u0027dispensed\u0027, \u0027No refill interval for ibuprofen\u0027);\nconsole.assert(d6.copay === 15, \u0027Brand copay\u0027);\n\n// Out of stock\nconst d7 = pharm.dispense(\u0027rx007\u0027, \u0027ibuprofen\u0027, 400, \u0027generic\u0027, Date.parse(\u00272026-01-15T10:02:00Z\u0027));\nconsole.assert(d7.status === \u0027out-of-stock\u0027);\n\n// Unknown drug\nconst d8 = pharm.dispense(\u0027rx008\u0027, \u0027aspirin\u0027, 10, \u0027generic\u0027, Date.parse(\u00272026-01-15T10:00:00Z\u0027));\nconsole.assert(d8.status === \u0027unknown-drug\u0027);\n\n// After enough time, refill allowed for oxycodone (72h later)\nconst d9 = pharm.dispense(\u0027rx009\u0027, \u0027oxycodone\u0027, 10, \u0027generic\u0027, Date.parse(\u00272026-01-18T12:00:00Z\u0027));\nconsole.assert(d9.status === \u0027dispensed\u0027, \u0027Should be allowed after 72h\u0027);\nconsole.assert(pharm.inventory[\u0027oxycodone\u0027] === 60, \u0027Inventory should be 100-30-10=60\u0027);\n\n// Audit log\nconsole.assert(pharm.dispensedLog.length === 4, \u0027Should have 4 dispense records\u0027);\nconsole.log(\u0027Task 43 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"44","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class EnrollmentPeriod {\n constructor(courseId, capacity, openDate, closeDate) {\n this.courseId = courseId;\n this.capacity = capacity;\n this.openDate = openDate; // timestamp ms\n this.closeDate = closeDate; // timestamp ms\n this.enrolled = []; // { studentId, priority, enrolledAt }\n this.waitlist = []; // { studentId, priority, waitlistedAt }\n this._studentIds = new Set(); // prevent double-enroll\n }\n\n","golden_completion":" enroll(studentId, priority, timestamp) {\n if (timestamp \u003c this.openDate) return { status: \u0027not-open\u0027 };\n if (timestamp \u003e this.closeDate) return { status: \u0027closed\u0027 };\n if (this._studentIds.has(studentId)) return { status: \u0027already-enrolled\u0027 };\n this._studentIds.add(studentId);\n if (this.enrolled.length \u003c this.capacity) {\n this.enrolled.push({ studentId, priority, enrolledAt: timestamp });\n this.enrolled.sort((a, b) =\u003e a.priority - b.priority);\n return { status: \u0027enrolled\u0027, position: this.enrolled.findIndex(e =\u003e e.studentId === studentId) + 1 };\n }\n this.waitlist.push({ studentId, priority, waitlistedAt: timestamp });\n this.waitlist.sort((a, b) =\u003e a.priority - b.priority);\n return { status: \u0027waitlisted\u0027, position: this.waitlist.findIndex(e =\u003e e.studentId === studentId) + 1 };\n }\n","suffix":"\n}\n\nconst ep = new EnrollmentPeriod(\u0027CS101\u0027, 3, 1000, 5000);\n\n// Before open\nlet e1 = ep.enroll(\u0027alice\u0027, 2, 500);\nconsole.assert(e1.status === \u0027not-open\u0027, \u0027Before open date\u0027);\n\n// Normal enrollment\nlet e2 = ep.enroll(\u0027alice\u0027, 2, 1500);\nconsole.assert(e2.status === \u0027enrolled\u0027, \u0027Alice enrolled\u0027);\nconsole.assert(e2.position === 1, \u0027First enrolled\u0027);\n\nlet e3 = ep.enroll(\u0027bob\u0027, 1, 2000);\nconsole.assert(e3.status === \u0027enrolled\u0027);\n// Bob has higher priority (lower number), so after sort he\u0027s position 1\nconsole.assert(e3.position === 1, \u0027Bob should be position 1 after priority sort\u0027);\n\nlet e4 = ep.enroll(\u0027carol\u0027, 3, 2500);\nconsole.assert(e4.status === \u0027enrolled\u0027);\nconsole.assert(ep.enrolled.length === 3, \u0027At capacity\u0027);\n\n// Over capacity -\u003e waitlist\nlet e5 = ep.enroll(\u0027dave\u0027, 1, 3000);\nconsole.assert(e5.status === \u0027waitlisted\u0027, \u0027Dave waitlisted\u0027);\nconsole.assert(e5.position === 1, \u0027Dave first on waitlist\u0027);\n\n// Double enroll blocked\nlet e6 = ep.enroll(\u0027alice\u0027, 1, 3500);\nconsole.assert(e6.status === \u0027already-enrolled\u0027);\n","assertions":"\n// After close\nlet e7 = ep.enroll(\u0027eve\u0027, 1, 6000);\nconsole.assert(e7.status === \u0027closed\u0027, \u0027After close date\u0027);\n\n// Waitlist ordering by priority\nlet e8 = ep.enroll(\u0027frank\u0027, 5, 3200);\nconsole.assert(e8.status === \u0027waitlisted\u0027);\nconsole.assert(e8.position === 2, \u0027Frank behind Dave on waitlist\u0027);\n\n// Verify enrolled list is sorted by priority\nconsole.assert(ep.enrolled[0].studentId === \u0027bob\u0027, \u0027Bob priority 1 first\u0027);\nconsole.assert(ep.enrolled[1].studentId === \u0027alice\u0027, \u0027Alice priority 2 second\u0027);\nconsole.assert(ep.enrolled[2].studentId === \u0027carol\u0027, \u0027Carol priority 3 third\u0027);\n\n// Verify waitlist sorted by priority\nconsole.assert(ep.waitlist[0].studentId === \u0027dave\u0027, \u0027Dave priority 1 first on waitlist\u0027);\nconsole.assert(ep.waitlist[1].studentId === \u0027frank\u0027, \u0027Frank priority 5 second on waitlist\u0027);\n\n// Already-enrolled student can\u0027t waitlist either\nlet e9 = ep.enroll(\u0027dave\u0027, 1, 3300);\nconsole.assert(e9.status === \u0027already-enrolled\u0027, \u0027Dave already in system\u0027);\nconsole.log(\u0027Task 44 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"45","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class CommissionEngine {\n constructor(quarterlyCap = Infinity) {\n this.quarterlyCap = quarterlyCap;\n this.deals = {}; // dealId -\u003e { amount, quarter, agentIds, status }\n this.earnings = {}; // agentId -\u003e { quarter -\u003e total }\n this.auditLog = []; // { action, dealId, agentId, amount, timestamp }\n }\n\n // Tiered commission rates: 5% up to 10k, 8% for 10k-50k, 12% above 50k\n static tierRate(amount) {\n if (amount \u003c= 10000) return amount * 0.05;\n if (amount \u003c= 50000) return 10000 * 0.05 + (amount - 10000) * 0.08;\n return 10000 * 0.05 + 40000 * 0.08 + (amount - 50000) * 0.12;\n }\n\n","golden_completion":" recordDeal(dealId, amount, quarter, agentIds, timestamp) {\n if (this.deals[dealId]) return { status: \u0027duplicate\u0027 };\n const totalComm = CommissionEngine.tierRate(amount), split = totalComm / agentIds.length;\n this.deals[dealId] = { amount, quarter, agentIds, status: \u0027active\u0027 };\n for (const agent of agentIds) {\n if (!this.earnings[agent]) this.earnings[agent] = {};\n const prev = this.earnings[agent][quarter] || 0;\n const credit = Math.max(0, Math.min(split, this.quarterlyCap - prev));\n this.earnings[agent][quarter] = prev + credit;\n this.auditLog.push({ action: \u0027credit\u0027, dealId, agentId: agent, amount: credit, timestamp });\n }\n return { status: \u0027recorded\u0027, commission: totalComm };\n }\n clawback(dealId, timestamp) {\n const deal = this.deals[dealId];\n if (!deal || deal.status !== \u0027active\u0027) return { status: \u0027invalid\u0027 };\n deal.status = \u0027cancelled\u0027;\n const comm = CommissionEngine.tierRate(deal.amount), split = comm / deal.agentIds.length;\n for (const agent of deal.agentIds) {\n const prev = this.earnings[agent][deal.quarter] || 0;\n this.earnings[agent][deal.quarter] = Math.max(0, prev - split);\n this.auditLog.push({ action: \u0027clawback\u0027, dealId, agentId: agent, amount: split, timestamp });\n }\n return { status: \u0027clawed-back\u0027, commission: comm };\n }\n","suffix":"\n}\n\nconst engine = new CommissionEngine(5000);\n\n// Small deal: 5000 * 5% = 250 commission, split between 2 agents\nlet r1 = engine.recordDeal(\u0027D1\u0027, 5000, \u0027Q1\u0027, [\u0027agentA\u0027, \u0027agentB\u0027], 100);\nconsole.assert(r1.status === \u0027recorded\u0027);\nconsole.assert(r1.commission === 250, \u0027Tiered: 5000 * 5% = 250\u0027);\nconsole.assert(engine.earnings[\u0027agentA\u0027][\u0027Q1\u0027] === 125, \u0027Split 250/2 = 125\u0027);\nconsole.assert(engine.earnings[\u0027agentB\u0027][\u0027Q1\u0027] === 125);\n\n// Medium deal: tierRate(30000) = 500 + (20000 * 0.08) = 500 + 1600 = 2100\nlet r2 = engine.recordDeal(\u0027D2\u0027, 30000, \u0027Q1\u0027, [\u0027agentA\u0027], 200);\nconsole.assert(r2.commission === 2100, \u0027Tiered: 500+1600=2100\u0027);\nconsole.assert(engine.earnings[\u0027agentA\u0027][\u0027Q1\u0027] === 2225, \u0027125+2100=2225\u0027);\n\n// Duplicate deal\nlet r3 = engine.recordDeal(\u0027D1\u0027, 5000, \u0027Q1\u0027, [\u0027agentA\u0027], 300);\nconsole.assert(r3.status === \u0027duplicate\u0027);\n","assertions":"\n// Large deal that hits quarterly cap\n// tierRate(60000) = 500 + 3200 + 1200 = 4900. Agent A has 2225, cap is 5000.\n// So agent A gets min(4900, 5000-2225) = min(4900, 2775) = 2775\nlet r4 = engine.recordDeal(\u0027D3\u0027, 60000, \u0027Q1\u0027, [\u0027agentA\u0027], 400);\nconsole.assert(r4.commission === 4900, \u0027Tiered: 500+3200+1200=4900\u0027);\nconsole.assert(engine.earnings[\u0027agentA\u0027][\u0027Q1\u0027] === 5000, \u0027Capped at 5000\u0027);\n\n// Clawback D1: removes 250/2 = 125 from each agent\nlet r5 = engine.clawback(\u0027D1\u0027, 500);\nconsole.assert(r5.status === \u0027clawed-back\u0027);\nconsole.assert(engine.earnings[\u0027agentA\u0027][\u0027Q1\u0027] === 4875, \u00275000-125=4875\u0027);\nconsole.assert(engine.earnings[\u0027agentB\u0027][\u0027Q1\u0027] === 0, \u0027125-125=0\u0027);\n\n// Can\u0027t clawback again\nlet r6 = engine.clawback(\u0027D1\u0027, 600);\nconsole.assert(r6.status === \u0027invalid\u0027);\n\n// Audit log has all entries\nconst credits = engine.auditLog.filter(l =\u003e l.action === \u0027credit\u0027);\nconst clawbacks = engine.auditLog.filter(l =\u003e l.action === \u0027clawback\u0027);\nconsole.assert(credits.length \u003e= 4, \u0027Should have credit entries\u0027);\nconsole.assert(clawbacks.length === 2, \u0027Two clawback entries\u0027);\nconsole.log(\u0027Task 45 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"46","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class DonationProcessor {\n constructor(annualTaxCap = 50000, matchRatio = 1.0, matchCap = 10000) {\n this.annualTaxCap = annualTaxCap; // max deductible per donor per year\n this.matchRatio = matchRatio; // employer match ratio (1.0 = dollar-for-dollar)\n this.matchCap = matchCap; // max match per donor per year\n this.donations = []; // { donorId, amount, year, matched, deductible, timestamp }\n this._donorYearTotals = {}; // donorId:year -\u003e { donated, matched, deducted }\n }\n\n _getYearTotals(donorId, year) {\n const key = `${donorId}:${year}`;\n if (!this._donorYearTotals[key])\n this._donorYearTotals[key] = { donated: 0, matched: 0, deducted: 0 };\n return this._donorYearTotals[key];\n }\n\n","golden_completion":" donate(donorId, amount, year, timestamp) {\n if (amount \u003c= 0) return { status: \u0027invalid-amount\u0027 };\n const totals = this._getYearTotals(donorId, year);\n const matchAvail = Math.max(0, this.matchCap - totals.matched);\n const matchAmt = Math.min(amount * this.matchRatio, matchAvail);\n const totalGift = amount + matchAmt;\n const deductAvail = Math.max(0, this.annualTaxCap - totals.deducted);\n const deductible = Math.min(totalGift, deductAvail);\n totals.donated += amount;\n totals.matched += matchAmt;\n totals.deducted += deductible;\n this.donations.push({ donorId, amount, year, matched: matchAmt, deductible, timestamp });\n return { status: \u0027accepted\u0027, matched: matchAmt, deductible, totalGift };\n }\n","suffix":"\n}\n\nconst dp = new DonationProcessor(50000, 1.0, 10000);\n\n// First donation: $8000, matched $8000 (under cap), deductible $16000 (under cap)\nlet d1 = dp.donate(\u0027donor1\u0027, 8000, 2026, 100);\nconsole.assert(d1.status === \u0027accepted\u0027);\nconsole.assert(d1.matched === 8000, \u0027Full match: 8000*1.0=8000, under 10k cap\u0027);\nconsole.assert(d1.totalGift === 16000, \u00278000 + 8000 match\u0027);\nconsole.assert(d1.deductible === 16000, \u0027Under 50k annual cap\u0027);\n\n// Second donation: $5000, match cap has $2000 left (10000-8000)\nlet d2 = dp.donate(\u0027donor1\u0027, 5000, 2026, 200);\nconsole.assert(d2.matched === 2000, \u0027Only 2000 match remaining\u0027);\nconsole.assert(d2.totalGift === 7000, \u00275000 + 2000\u0027);\nconsole.assert(d2.deductible === 7000, \u002716000+7000=23000, still under 50k\u0027);\n\n// Third donation: match cap exhausted\nlet d3 = dp.donate(\u0027donor1\u0027, 3000, 2026, 300);\nconsole.assert(d3.matched === 0, \u0027Match cap exhausted\u0027);\nconsole.assert(d3.deductible === 3000, \u0027Just the donation amount\u0027);\n","assertions":"\n// Different donor has separate caps\nlet d4 = dp.donate(\u0027donor2\u0027, 15000, 2026, 400);\nconsole.assert(d4.matched === 10000, \u0027Match capped at 10000\u0027);\nconsole.assert(d4.deductible === 25000, \u002715000+10000\u0027);\nconsole.assert(d4.totalGift === 25000);\n\n// Tax deduction cap test: donor3 donates $40000 (matched $10000 = $50000 total)\nlet d5 = dp.donate(\u0027donor3\u0027, 40000, 2026, 500);\nconsole.assert(d5.matched === 10000, \u0027Full match capped at 10k\u0027);\nconsole.assert(d5.deductible === 50000, \u0027Exactly at annual cap\u0027);\n\n// Next donation for donor3: deduction cap reached\nlet d6 = dp.donate(\u0027donor3\u0027, 5000, 2026, 600);\nconsole.assert(d6.matched === 0, \u0027Match cap exhausted\u0027);\nconsole.assert(d6.deductible === 0, \u0027Tax deduction cap reached\u0027);\nconsole.assert(d6.totalGift === 5000, \u0027No match\u0027);\n\n// Invalid amount\nlet d7 = dp.donate(\u0027donor1\u0027, 0, 2026, 700);\nconsole.assert(d7.status === \u0027invalid-amount\u0027);\nlet d8 = dp.donate(\u0027donor1\u0027, -100, 2026, 800);\nconsole.assert(d8.status === \u0027invalid-amount\u0027);\n\n// Audit trail\nconsole.assert(dp.donations.length === 6, \u0027Should have 6 donation records (excl invalid)\u0027);\nconsole.log(\u0027Task 46 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"47","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class FleetVehicle {\n constructor(vehicleId, maintIntervalMiles = 5000, maintIntervalDays = 90) {\n this.vehicleId = vehicleId;\n this.maintIntervalMiles = maintIntervalMiles;\n this.maintIntervalDays = maintIntervalDays;\n this.currentMiles = 0;\n this.lastMaintMiles = 0;\n this.lastMaintDay = 0; // day number (integer)\n this.state = \u0027available\u0027; // available | in-maintenance | decommissioned\n this.downtimeDays = 0; // total days spent in maintenance\n this.maintLog = []; // { type, day, miles }\n this._maintStartDay = null;\n }\n\n","golden_completion":" addMiles(miles, currentDay) {\n if (this.state !== \u0027available\u0027) return { status: \u0027unavailable\u0027 };\n this.currentMiles += miles;\n const milesDue = (this.currentMiles - this.lastMaintMiles) \u003e= this.maintIntervalMiles;\n const daysDue = (currentDay - this.lastMaintDay) \u003e= this.maintIntervalDays;\n return { status: \u0027ok\u0027, maintenanceDue: milesDue || daysDue };\n }\n startMaintenance(day, type = \u0027scheduled\u0027) {\n if (this.state !== \u0027available\u0027) return { status: \u0027already-\u0027 + this.state };\n this.state = \u0027in-maintenance\u0027;\n this._maintStartDay = day;\n this.maintLog.push({ type, day, miles: this.currentMiles });\n return { status: \u0027started\u0027 };\n }\n endMaintenance(day) {\n if (this.state !== \u0027in-maintenance\u0027) return { status: \u0027not-in-maintenance\u0027 };\n const dt = day - this._maintStartDay;\n this.downtimeDays += dt;\n this.lastMaintMiles = this.currentMiles;\n this.lastMaintDay = day;\n this.state = \u0027available\u0027;\n this._maintStartDay = null;\n return { status: \u0027completed\u0027, downtimeAdded: dt };\n }\n decommission() { this.state = \u0027decommissioned\u0027; return { status: \u0027decommissioned\u0027, totalDowntime: this.downtimeDays }; }\n","suffix":"\n}\n\nconst v = new FleetVehicle(\u0027VH-001\u0027, 5000, 90);\n\n// Add miles, no maintenance due yet\nlet m1 = v.addMiles(3000, 10);\nconsole.assert(m1.status === \u0027ok\u0027);\nconsole.assert(m1.maintenanceDue === false, \u0027Only 3000 miles, not due\u0027);\n\n// Add more miles to trigger mileage threshold\nlet m2 = v.addMiles(2500, 20);\nconsole.assert(m2.maintenanceDue === true, \u00275500 miles \u003e= 5000 interval\u0027);\n\n// Start maintenance\nlet m3 = v.startMaintenance(20, \u0027mileage\u0027);\nconsole.assert(m3.status === \u0027started\u0027);\nconsole.assert(v.state === \u0027in-maintenance\u0027);\n\n// Can\u0027t add miles during maintenance\nlet m4 = v.addMiles(100, 22);\nconsole.assert(m4.status === \u0027unavailable\u0027);\n\n// End maintenance\nlet m5 = v.endMaintenance(25);\nconsole.assert(m5.status === \u0027completed\u0027);\nconsole.assert(v.downtimeDays === 5, \u002725-20=5 days downtime\u0027);\nconsole.assert(v.lastMaintMiles === 5500, \u0027Reset maint mile counter\u0027);\nconsole.assert(v.lastMaintDay === 25, \u0027Reset maint day counter\u0027);\n","assertions":"\n// Days-based maintenance trigger (no new miles but 90 days pass)\nlet m6 = v.addMiles(0, 120);\nconsole.assert(m6.maintenanceDue === true, \u0027120-25=95 \u003e= 90 days\u0027);\n\n// Start and end another maintenance\nv.startMaintenance(120, \u0027time-based\u0027);\nv.endMaintenance(122);\nconsole.assert(v.downtimeDays === 7, \u00275+2=7 total downtime\u0027);\nconsole.assert(v.maintLog.length === 2);\nconsole.assert(v.maintLog[0].type === \u0027mileage\u0027);\nconsole.assert(v.maintLog[1].type === \u0027time-based\u0027);\n\n// Can\u0027t start maintenance on a decommissioned vehicle\nv.decommission();\nlet m7 = v.startMaintenance(200, \u0027scheduled\u0027);\nconsole.assert(m7.status === \u0027already-decommissioned\u0027);\n\n// Can\u0027t add miles to decommissioned\nlet m8 = v.addMiles(100, 200);\nconsole.assert(m8.status === \u0027unavailable\u0027);\n\n// Double start maintenance\nconst v2 = new FleetVehicle(\u0027VH-002\u0027, 1000, 30);\nv2.startMaintenance(1, \u0027initial\u0027);\nlet m9 = v2.startMaintenance(2, \u0027again\u0027);\nconsole.assert(m9.status === \u0027already-in-maintenance\u0027);\nconsole.log(\u0027Task 47 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"48","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class MenuPricing {\n constructor() {\n this.items = {}; // name -\u003e { basePrice, happyHourPrice, ingredients: [...] }\n this.combos = {}; // comboName -\u003e { items: [name,...], discount: 0.0-1.0 }\n this.orders = []; // { items: [...], total, ingredientCost, timestamp }\n this.ingredientCosts = {}; // ingredient -\u003e cost per unit\n }\n\n addItem(name, basePrice, happyHourPrice, ingredients = []) {\n this.items[name] = { basePrice, happyHourPrice, ingredients };\n }\n\n addCombo(comboName, itemNames, discount) {\n this.combos[comboName] = { items: itemNames, discount };\n }\n\n setIngredientCost(ingredient, cost) {\n this.ingredientCosts[ingredient] = cost;\n }\n\n // Happy hour is between 16:00 and 18:00 (hour 16 and 17)\n _isHappyHour(hour) { return hour \u003e= 16 \u0026\u0026 hour \u003c 18; }\n\n","golden_completion":" order(itemNames, hour, timestamp) {\n const isHH = this._isHappyHour(hour);\n let prices = itemNames.map(n =\u003e {\n const item = this.items[n]; if (!item) throw new Error(`Unknown item: ${n}`);\n return isHH ? item.happyHourPrice : item.basePrice;\n });\n for (const [, combo] of Object.entries(this.combos)) {\n const ci = [...combo.items].sort(), oi = [...itemNames].sort();\n if (ci.length === oi.length \u0026\u0026 ci.every((v, i) =\u003e v === oi[i])) {\n prices = [prices.reduce((a, b) =\u003e a + b, 0) * (1 - combo.discount)]; break;\n }\n }\n const total = Math.round(prices.reduce((a, b) =\u003e a + b, 0) * 100) / 100;\n let ingredientCost = 0;\n for (const n of itemNames) for (const ing of this.items[n].ingredients) ingredientCost += this.ingredientCosts[ing] || 0;\n this.orders.push({ items: itemNames, total, ingredientCost, timestamp });\n return { total, ingredientCost, margin: Math.round((total - ingredientCost) * 100) / 100 };\n }\n","suffix":"\n}\n\nconst menu = new MenuPricing();\nmenu.addItem(\u0027burger\u0027, 12.00, 9.00, [\u0027beef\u0027, \u0027bun\u0027, \u0027lettuce\u0027]);\nmenu.addItem(\u0027fries\u0027, 5.00, 3.50, [\u0027potato\u0027, \u0027oil\u0027]);\nmenu.addItem(\u0027soda\u0027, 3.00, 2.00, [\u0027syrup\u0027, \u0027water\u0027]);\nmenu.addCombo(\u0027meal\u0027, [\u0027burger\u0027, \u0027fries\u0027, \u0027soda\u0027], 0.15); // 15% off combo\nmenu.setIngredientCost(\u0027beef\u0027, 4.00);\nmenu.setIngredientCost(\u0027bun\u0027, 0.50);\nmenu.setIngredientCost(\u0027lettuce\u0027, 0.30);\nmenu.setIngredientCost(\u0027potato\u0027, 1.00);\nmenu.setIngredientCost(\u0027oil\u0027, 0.20);\nmenu.setIngredientCost(\u0027syrup\u0027, 0.40);\nmenu.setIngredientCost(\u0027water\u0027, 0.05);\n\n// Regular pricing (not happy hour)\nlet o1 = menu.order([\u0027burger\u0027], 12, 1000);\nconsole.assert(o1.total === 12.00, \u0027Regular burger price\u0027);\nconsole.assert(o1.ingredientCost === 4.80, \u0027beef+bun+lettuce = 4.00+0.50+0.30\u0027);\nconsole.assert(o1.margin === 7.20, \u002712.00-4.80\u0027);\n\n// Happy hour pricing\nlet o2 = menu.order([\u0027burger\u0027], 17, 2000);\nconsole.assert(o2.total === 9.00, \u0027Happy hour burger\u0027);\n\n// Combo discount: (12+5+3) * 0.85 = 17.00\nlet o3 = menu.order([\u0027burger\u0027, \u0027fries\u0027, \u0027soda\u0027], 12, 3000);\nconsole.assert(o3.total === 17.00, \u0027Combo: 20 * 0.85 = 17.00\u0027);\n","assertions":"\n// Combo + happy hour: (9+3.5+2) * 0.85 = 14.5 * 0.85 = 12.325 -\u003e 12.33\nlet o4 = menu.order([\u0027burger\u0027, \u0027fries\u0027, \u0027soda\u0027], 16, 4000);\nconsole.assert(o4.total === 12.33, \u0027Happy hour combo: 14.5*0.85=12.325 rounded\u0027);\n\n// Non-combo order at happy hour\nlet o5 = menu.order([\u0027fries\u0027, \u0027soda\u0027], 17, 5000);\nconsole.assert(o5.total === 5.50, \u0027Happy hour: 3.50+2.00\u0027);\nconsole.assert(o5.ingredientCost === 1.65, \u0027potato+oil+syrup+water = 1.00+0.20+0.40+0.05\u0027);\n\n// Single item is never a combo\nlet o6 = menu.order([\u0027burger\u0027], 12, 6000);\nconsole.assert(o6.total === 12.00, \u0027Single item, no combo\u0027);\n\n// Order log\nconsole.assert(menu.orders.length === 6, \u0027Should have 6 orders\u0027);\nconsole.assert(menu.orders[2].total === 17.00, \u0027Third order was combo\u0027);\n\n// Unknown item throws\nlet threw = false;\ntry { menu.order([\u0027pizza\u0027], 12, 7000); } catch(e) { threw = true; }\nconsole.assert(threw, \u0027Unknown item should throw\u0027);\nconsole.log(\u0027Task 48 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"49","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class EventTicketing {\n constructor(tiers, earlyBirdCutoff, earlyBirdDiscount = 0.20, groupMin = 5, groupDiscount = 0.10) {\n // tiers: [{ name, price, capacity }] in order of preference\n this.tiers = tiers.map(t =\u003e ({ ...t, sold: 0 }));\n this.earlyBirdCutoff = earlyBirdCutoff; // timestamp: early-bird before this\n this.earlyBirdDiscount = earlyBirdDiscount;\n this.groupMin = groupMin;\n this.groupDiscount = groupDiscount;\n this.bookings = []; // { bookingId, tier, qty, unitPrice, total, seats, timestamp }\n this._nextSeat = 1; // sequential seat numbers\n this._bookingIds = new Set();\n }\n\n","golden_completion":" book(bookingId, tierName, qty, timestamp) {\n if (this._bookingIds.has(bookingId)) return { status: \u0027duplicate\u0027 };\n const tier = this.tiers.find(t =\u003e t.name === tierName);\n if (!tier) return { status: \u0027unknown-tier\u0027 };\n if (tier.sold + qty \u003e tier.capacity) return { status: \u0027insufficient-capacity\u0027, available: tier.capacity - tier.sold };\n let unitPrice = tier.price;\n if (timestamp \u003c this.earlyBirdCutoff) unitPrice *= (1 - this.earlyBirdDiscount);\n if (qty \u003e= this.groupMin) unitPrice *= (1 - this.groupDiscount);\n unitPrice = Math.round(unitPrice * 100) / 100;\n const total = Math.round(unitPrice * qty * 100) / 100;\n const seats = [];\n for (let i = 0; i \u003c qty; i++) seats.push(this._nextSeat++);\n tier.sold += qty;\n this._bookingIds.add(bookingId);\n this.bookings.push({ bookingId, tier: tierName, qty, unitPrice, total, seats, timestamp });\n return { status: \u0027confirmed\u0027, unitPrice, total, seats };\n }\n","suffix":"\n}\n\nconst evt = new EventTicketing(\n [{ name: \u0027vip\u0027, price: 200, capacity: 10 }, { name: \u0027general\u0027, price: 80, capacity: 50 }],\n 5000, 0.20, 5, 0.10\n);\n\n// Early-bird single ticket\nlet b1 = evt.book(\u0027B001\u0027, \u0027vip\u0027, 1, 3000);\nconsole.assert(b1.status === \u0027confirmed\u0027);\nconsole.assert(b1.unitPrice === 160, \u0027Early-bird: 200*0.80=160\u0027);\nconsole.assert(b1.total === 160);\nconsole.assert(b1.seats.length === 1);\nconsole.assert(b1.seats[0] === 1, \u0027First seat\u0027);\n\n// Regular price (after cutoff)\nlet b2 = evt.book(\u0027B002\u0027, \u0027vip\u0027, 2, 6000);\nconsole.assert(b2.unitPrice === 200, \u0027No early-bird\u0027);\nconsole.assert(b2.total === 400);\nconsole.assert(b2.seats[0] === 2, \u0027Adjacent seats starting at 2\u0027);\nconsole.assert(b2.seats[1] === 3);\n\n// Group booking with early-bird\nlet b3 = evt.book(\u0027B003\u0027, \u0027general\u0027, 5, 4000);\nconsole.assert(b3.unitPrice === 57.60, \u0027Early-bird + group: 80*0.80*0.90=57.60\u0027);\nconsole.assert(b3.total === 288.00);\nconsole.assert(b3.seats.length === 5);\n","assertions":"\n// Duplicate booking\nlet b4 = evt.book(\u0027B001\u0027, \u0027vip\u0027, 1, 7000);\nconsole.assert(b4.status === \u0027duplicate\u0027);\n\n// VIP capacity check: 3 sold so far, 10 capacity\nlet b5 = evt.book(\u0027B005\u0027, \u0027vip\u0027, 8, 7000);\nconsole.assert(b5.status === \u0027insufficient-capacity\u0027);\nconsole.assert(b5.available === 7, \u0027Only 7 VIP left\u0027);\n\n// Unknown tier\nlet b6 = evt.book(\u0027B006\u0027, \u0027platinum\u0027, 1, 7000);\nconsole.assert(b6.status === \u0027unknown-tier\u0027);\n\n// Group booking after cutoff (only group discount, no early-bird)\nlet b7 = evt.book(\u0027B007\u0027, \u0027general\u0027, 6, 8000);\nconsole.assert(b7.unitPrice === 72.00, \u0027Group only: 80*0.90=72\u0027);\nconsole.assert(b7.total === 432.00, \u002772*6=432\u0027);\n\n// Seat adjacency across bookings\nconsole.assert(b7.seats[0] === 9, \u0027Seats continue from last booking\u0027);\nconsole.assert(b7.seats[5] === 14);\n\n// Just under group minimum (4 \u003c 5)\nlet b8 = evt.book(\u0027B008\u0027, \u0027general\u0027, 4, 4000);\nconsole.assert(b8.unitPrice === 64.00, \u0027Early-bird only: 80*0.80=64, no group discount\u0027);\n\n// Bookings log\nconsole.assert(evt.bookings.length === 5, \u0027Should have 5 confirmed bookings\u0027);\nconsole.log(\u0027Task 49 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"50","testsource":"devbench-code-purpose-understanding","language":"javascript","prefix":"class WarrantyManager {\n constructor(coverageDurationMs, deductible, annualClaimLimit, laborCoverPct = 0.80) {\n this.coverageDurationMs = coverageDurationMs;\n this.deductible = deductible; // per-claim deductible\n this.annualClaimLimit = annualClaimLimit; // max total payout per year\n this.laborCoverPct = laborCoverPct; // % of labor cost covered (rest is customer\u0027s)\n this.products = {}; // productId -\u003e { purchaseDate (ms), ownerName }\n this.claims = []; // { claimId, productId, partsCost, laborCost, payout, customerOwes, year, timestamp }\n this._claimIds = new Set();\n this._yearPayouts = {}; // year -\u003e total payout so far\n }\n\n registerProduct(productId, purchaseDate, ownerName) {\n this.products[productId] = { purchaseDate, ownerName };\n }\n\n","golden_completion":" fileClaim(claimId, productId, partsCost, laborCost, timestamp) {\n if (this._claimIds.has(claimId)) return { status: \u0027duplicate\u0027, payout: 0, customerOwes: 0 };\n const product = this.products[productId];\n if (!product) return { status: \u0027unknown-product\u0027, payout: 0, customerOwes: 0 };\n if (timestamp - product.purchaseDate \u003e this.coverageDurationMs)\n return { status: \u0027expired\u0027, payout: 0, customerOwes: partsCost + laborCost };\n const coveredLabor = laborCost * this.laborCoverPct;\n const uncoveredLabor = laborCost - coveredLabor;\n const totalCoverable = partsCost + coveredLabor;\n const afterDeductible = Math.max(0, totalCoverable - this.deductible);\n const year = new Date(timestamp).getFullYear();\n const yearUsed = this._yearPayouts[year] || 0;\n const yearAvail = Math.max(0, this.annualClaimLimit - yearUsed);\n const payout = Math.min(afterDeductible, yearAvail);\n const customerOwes = (partsCost + laborCost) - payout;\n this._yearPayouts[year] = yearUsed + payout;\n this._claimIds.add(claimId);\n this.claims.push({ claimId, productId, partsCost, laborCost, payout, customerOwes, year, timestamp });\n return { status: \u0027approved\u0027, payout: Math.round(payout * 100) / 100, customerOwes: Math.round(customerOwes * 100) / 100 };\n }\n","suffix":"\n}\n\n// 1 year warranty, $100 deductible, $5000 annual limit, 80% labor coverage\nconst wm = new WarrantyManager(365 * 24 * 3600 * 1000, 100, 5000, 0.80);\n\nconst purchaseDate = Date.parse(\u00272026-01-01T00:00:00Z\u0027);\nwm.registerProduct(\u0027P001\u0027, purchaseDate, \u0027Alice\u0027);\n\n// Claim within warranty: parts $300, labor $200\n// coveredLabor = 200*0.80 = 160, uncoveredLabor = 40\n// totalCoverable = 300+160 = 460, afterDeductible = 460-100 = 360\n// customerOwes = (300+200) - 360 = 140\nlet c1 = wm.fileClaim(\u0027C001\u0027, \u0027P001\u0027, 300, 200, Date.parse(\u00272026-03-15T00:00:00Z\u0027));\nconsole.assert(c1.status === \u0027approved\u0027);\nconsole.assert(c1.payout === 360, \u0027Parts + 80% labor - deductible\u0027);\nconsole.assert(c1.customerOwes === 140);\n\n// Duplicate claim\nlet c2 = wm.fileClaim(\u0027C001\u0027, \u0027P001\u0027, 300, 200, Date.parse(\u00272026-03-16T00:00:00Z\u0027));\nconsole.assert(c2.status === \u0027duplicate\u0027);\nconsole.assert(c2.payout === 0);\n\n// Expired warranty (2 years later)\nlet c3 = wm.fileClaim(\u0027C003\u0027, \u0027P001\u0027, 100, 50, Date.parse(\u00272028-03-15T00:00:00Z\u0027));\nconsole.assert(c3.status === \u0027expired\u0027);\nconsole.assert(c3.customerOwes === 150, \u0027Customer pays all when expired\u0027);\n","assertions":"\n// Annual limit test: 5000 limit, already used 360\n// Large claim: parts $4000, labor $2000\n// coveredLabor = 2000*0.80 = 1600, totalCoverable = 4000+1600 = 5600\n// afterDeductible = 5600-100 = 5500. yearAvail = 5000-360 = 4640\n// payout = min(5500, 4640) = 4640\nlet c4 = wm.fileClaim(\u0027C004\u0027, \u0027P001\u0027, 4000, 2000, Date.parse(\u00272026-06-01T00:00:00Z\u0027));\nconsole.assert(c4.status === \u0027approved\u0027);\nconsole.assert(c4.payout === 4640, \u0027Annual limit caps payout\u0027);\nconsole.assert(c4.customerOwes === 1360, \u00276000-4640=1360\u0027);\n\n// Annual limit now exhausted (360+4640=5000)\nlet c5 = wm.fileClaim(\u0027C005\u0027, \u0027P001\u0027, 500, 100, Date.parse(\u00272026-07-01T00:00:00Z\u0027));\nconsole.assert(c5.status === \u0027approved\u0027);\nconsole.assert(c5.payout === 0, \u0027Annual limit reached\u0027);\nconsole.assert(c5.customerOwes === 600, \u0027Customer pays all\u0027);\n\n// Unknown product\nlet c6 = wm.fileClaim(\u0027C006\u0027, \u0027P999\u0027, 100, 50, Date.parse(\u00272026-04-01T00:00:00Z\u0027));\nconsole.assert(c6.status === \u0027unknown-product\u0027);\n\n// Claims log\nconsole.assert(wm.claims.length === 4, \u0027Should have 4 claims (excl. duplicate and unknown)\u0027);\n\n// Different year resets annual limit\nwm.registerProduct(\u0027P002\u0027, Date.parse(\u00272026-06-01T00:00:00Z\u0027), \u0027Bob\u0027);\nlet c7 = wm.fileClaim(\u0027C007\u0027, \u0027P002\u0027, 2000, 500, Date.parse(\u00272027-01-15T00:00:00Z\u0027));\nconsole.assert(c7.status === \u0027approved\u0027);\n// coveredLabor = 500*0.80 = 400, totalCoverable = 2000+400 = 2400\n// afterDeductible = 2400-100 = 2300, yearAvail = 5000 (new year)\nconsole.assert(c7.payout === 2300, \u0027New year, full limit available\u0027);\nconsole.log(\u0027Task 50 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"1","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction mergeInto(target, source) {\n","golden_completion":" mergeInto.doc = \u0027Merge own enumerable properties from source into target, mutating target in place. Properties whose value in source is undefined are skipped. Returns target. Does not perform deep merging.\u0027;\n","suffix":" for (const key of Object.keys(source)) {\n if (source[key] !== undefined) {\n target[key] = source[key];\n }\n }\n return target;\n}\n\nconst a = { x: 1 };\nconst result = mergeInto(a, { y: 2, z: undefined });\nassert.strictEqual(result, a);\nassert.deepStrictEqual(a, { x: 1, y: 2 });\n","assertions":"mergeInto({}, {});\nassert(typeof mergeInto.doc === \u0027string\u0027);\nassert(mergeInto.doc.toLowerCase().includes(\u0027mutating\u0027) || mergeInto.doc.toLowerCase().includes(\u0027mutates\u0027) || mergeInto.doc.toLowerCase().includes(\u0027in place\u0027));\nassert(mergeInto.doc.toLowerCase().includes(\u0027undefined\u0027));\nassert(mergeInto.doc.toLowerCase().includes(\u0027skip\u0027));\nassert(mergeInto.doc.toLowerCase().includes(\u0027return\u0027));\n","category":"code2NL_NL2code"} {"id":"2","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nasync function retryWithBackoff(fn, maxRetries, initialDelayMs) {\n","golden_completion":" retryWithBackoff.doc = \u0027Retry an async function up to maxRetries times with exponential backoff. The delay starts at initialDelayMs milliseconds and doubles after each failed attempt. If all retries are exhausted, the last encountered error is re-thrown.\u0027;\n","suffix":" let delay = initialDelayMs;\n let lastError;\n for (let i = 0; i \u003c= maxRetries; i++) {\n try {\n return await fn();\n } catch (err) {\n lastError = err;\n if (i \u003c maxRetries) {\n await new Promise(r =\u003e setTimeout(r, delay));\n delay *= 2;\n }\n }\n }\n throw lastError;\n}\n\n// Quick test: function that fails twice then succeeds\nlet callCount = 0;\nconst flaky = async () =\u003e {\n callCount++;\n if (callCount \u003c 3) throw new Error(\u0027fail\u0027);\n return \u0027ok\u0027;\n};\n(async () =\u003e {\n const result = await retryWithBackoff(flaky, 3, 10);\n assert.strictEqual(result, \u0027ok\u0027);\n assert.strictEqual(callCount, 3);\n})();\n","assertions":"// Run the function once to set .doc\nlet c2 = 0;\n(async () =\u003e {\n try { await retryWithBackoff(async () =\u003e { c2++; if(c2\u003c2) throw new Error(\u0027x\u0027); return 1; }, 2, 1); } catch(e) {}\n assert(typeof retryWithBackoff.doc === \u0027string\u0027);\n assert(retryWithBackoff.doc.toLowerCase().includes(\u0027exponential\u0027) || retryWithBackoff.doc.toLowerCase().includes(\u0027doubles\u0027));\n assert(retryWithBackoff.doc.toLowerCase().includes(\u0027millisecond\u0027) || retryWithBackoff.doc.toLowerCase().includes(\u0027ms\u0027));\n assert(retryWithBackoff.doc.toLowerCase().includes(\u0027re-thrown\u0027) || retryWithBackoff.doc.toLowerCase().includes(\u0027rethrown\u0027) || retryWithBackoff.doc.toLowerCase().includes(\u0027re-throw\u0027) || retryWithBackoff.doc.toLowerCase().includes(\u0027rethrow\u0027) || retryWithBackoff.doc.toLowerCase().includes(\u0027throws\u0027));\n})();\n","category":"code2NL_NL2code"} {"id":"3","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass LRUCache {\n constructor(capacity, onEvict) {\n this._cap = capacity;\n this._map = new Map();\n this._onEvict = onEvict || null;\n }\n\n get(key) {\n","golden_completion":" LRUCache.prototype.get.doc = \u0027Retrieve the value for key, promoting it to most-recently-used position. Returns undefined if key is absent. Does not invoke the onEvict callback for missing keys.\u0027;\n","suffix":" if (!this._map.has(key)) return undefined;\n const val = this._map.get(key);\n this._map.delete(key);\n this._map.set(key, val);\n return val;\n }\n\n put(key, value) {\n if (this._map.has(key)) this._map.delete(key);\n this._map.set(key, value);\n if (this._map.size \u003e this._cap) {\n const oldest = this._map.keys().next().value;\n const oldVal = this._map.get(oldest);\n this._map.delete(oldest);\n if (this._onEvict) this._onEvict(oldest, oldVal);\n }\n }\n}\n\nconst evicted = [];\nconst c = new LRUCache(2, (k, v) =\u003e evicted.push([k, v]));\nc.put(\u0027a\u0027, 1);\nc.put(\u0027b\u0027, 2);\nc.get(\u0027a\u0027);\nc.put(\u0027c\u0027, 3);\nassert.strictEqual(c.get(\u0027b\u0027), undefined);\nassert.deepStrictEqual(evicted, [[\u0027b\u0027, 2]]);\n","assertions":"const evicted2 = [];\nconst c2 = new LRUCache(2, (k,v) =\u003e evicted2.push([k,v]));\nc2.put(\u0027x\u0027, 10);\nc2.get(\u0027x\u0027);\nassert(typeof LRUCache.prototype.get.doc === \u0027string\u0027);\nconst d = LRUCache.prototype.get.doc.toLowerCase();\nassert(d.includes(\u0027promot\u0027) || d.includes(\u0027most-recently\u0027) || d.includes(\u0027most recently\u0027));\nassert(d.includes(\u0027undefined\u0027));\n","category":"code2NL_NL2code"} {"id":"4","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction groupBy(items, keyFn) {\n","golden_completion":" groupBy.doc = \u0027Group items by the string returned by keyFn. Items whose key is null or undefined are placed under the key \\\"__none__\\\". The returned object has keys sorted alphabetically. Within each group, items preserve their original order (stable grouping).\u0027;\n","suffix":" const groups = {};\n for (const item of items) {\n let k = keyFn(item);\n if (k == null) k = \u0027__none__\u0027;\n if (!groups[k]) groups[k] = [];\n groups[k].push(item);\n }\n const sorted = {};\n for (const k of Object.keys(groups).sort()) {\n sorted[k] = groups[k];\n }\n return sorted;\n}\n\nconst data = [{n:\u0027a\u0027,t:\u0027x\u0027},{n:\u0027b\u0027,t:\u0027y\u0027},{n:\u0027c\u0027,t:\u0027x\u0027},{n:\u0027d\u0027,t:null}];\nconst result = groupBy(data, d =\u003e d.t);\nassert.deepStrictEqual(Object.keys(result), [\u0027__none__\u0027, \u0027x\u0027, \u0027y\u0027]);\nassert.strictEqual(result[\u0027x\u0027].length, 2);\nassert.strictEqual(result[\u0027x\u0027][0].n, \u0027a\u0027);\n","assertions":"groupBy([], x =\u003e x);\nassert(typeof groupBy.doc === \u0027string\u0027);\nconst doc = groupBy.doc.toLowerCase();\nassert(doc.includes(\u0027__none__\u0027));\nassert(doc.includes(\u0027sorted\u0027) || doc.includes(\u0027alphabetical\u0027));\nassert(doc.includes(\u0027stable\u0027) || doc.includes(\u0027original order\u0027) || doc.includes(\u0027preserve\u0027));\n","category":"code2NL_NL2code"} {"id":"5","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass Emitter {\n constructor() { this._listeners = {}; }\n\n on(event, fn, priority) {\n","golden_completion":" Emitter.prototype.on.doc = \u0027Register a listener for event with an optional numeric priority (default 0). Higher priority listeners are called first. Listeners with equal priority are called in registration order. Returns the Emitter instance for chaining.\u0027;\n","suffix":" if (!this._listeners[event]) this._listeners[event] = [];\n this._listeners[event].push({ fn, priority: priority || 0 });\n this._listeners[event].sort((a, b) =\u003e b.priority - a.priority);\n return this;\n }\n\n emit(event, ...args) {\n const list = this._listeners[event] || [];\n let count = 0;\n for (const entry of [...list]) {\n try { entry.fn(...args); count++; } catch(e) {}\n }\n return count;\n }\n}\n\nconst em = new Emitter();\nconst order = [];\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027low\u0027), 1);\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027high\u0027), 10);\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027mid\u0027), 5);\nem.emit(\u0027test\u0027);\nassert.deepStrictEqual(order, [\u0027high\u0027, \u0027mid\u0027, \u0027low\u0027]);\n","assertions":"const em2 = new Emitter();\nem2.on(\u0027x\u0027, () =\u003e {});\nassert(typeof Emitter.prototype.on.doc === \u0027string\u0027);\nconst d = Emitter.prototype.on.doc.toLowerCase();\nassert(d.includes(\u0027priority\u0027));\nassert(d.includes(\u0027higher\u0027) || d.includes(\u0027descending\u0027));\nassert(d.includes(\u0027registration order\u0027) || d.includes(\u0027insertion order\u0027) || d.includes(\u0027equal priority\u0027));\nassert(d.includes(\u0027chain\u0027));\n","category":"code2NL_NL2code"} {"id":"6","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction deepFreeze(obj, visited) {\n visited = visited || new WeakSet();\n if (obj === null || typeof obj !== \u0027object\u0027 || visited.has(obj)) return obj;\n visited.add(obj);\n Object.freeze(obj);\n for (const val of Object.values(obj)) {\n if (typeof val === \u0027object\u0027 \u0026\u0026 val !== null) deepFreeze(val, visited);\n }\n return obj;\n}\n\nfunction describeDeepFreeze() {\n","golden_completion":" return \u0027Recursively freezes an object and all nested objects using Object.freeze. Handles circular references via a WeakSet to avoid infinite recursion. Skips null and non-object values. Returns the original object (same reference). The visited parameter is internal and should not be passed by callers.\u0027;\n","suffix":"}\n\nconst inner = { z: 3 };\nconst outer = { a: 1, b: inner };\nouter.self = outer;\ndeepFreeze(outer);\nassert(Object.isFrozen(outer));\nassert(Object.isFrozen(inner));\nassert.strictEqual(outer.self, outer);\n","assertions":"const desc = describeDeepFreeze();\nassert(typeof desc === \u0027string\u0027);\nconst dl = desc.toLowerCase();\nassert(dl.includes(\u0027recursive\u0027) || dl.includes(\u0027recursively\u0027) || dl.includes(\u0027nested\u0027));\nassert(dl.includes(\u0027circular\u0027) || dl.includes(\u0027cycle\u0027));\nassert(dl.includes(\u0027weakset\u0027) || dl.includes(\u0027visited\u0027));\nassert(dl.includes(\u0027same reference\u0027) || dl.includes(\u0027original object\u0027) || dl.includes(\u0027returns the\u0027));\n","category":"code2NL_NL2code"} {"id":"7","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction debounce(fn, delayMs, options) {\n options = options || {};\n const leading = !!options.leading;\n let timer = null;\n let leadingInvoked = false;\n return function (...args) {\n if (leading \u0026\u0026 !leadingInvoked) {\n leadingInvoked = true;\n fn.apply(this, args);\n }\n clearTimeout(timer);\n timer = setTimeout(() =\u003e {\n if (!leading) fn.apply(this, args);\n leadingInvoked = false;\n }, delayMs);\n };\n}\n\nfunction describeDebounce() {\n","golden_completion":" return \u0027Creates a debounced version of fn that delays invocation until delayMs milliseconds have elapsed since the last call. If options.leading is true, fn is invoked immediately on the first call and subsequent calls within the delay window are suppressed. The timer resets on each call. The returned wrapper always returns undefined, not the result of fn.\u0027;\n","suffix":"}\n\n// Basic test: leading mode fires immediately\nlet calls = [];\nconst d = debounce((x) =\u003e calls.push(x), 50, { leading: true });\nd(\u0027a\u0027);\nassert.deepStrictEqual(calls, [\u0027a\u0027]);\nd(\u0027b\u0027);\nd(\u0027c\u0027);\nassert.deepStrictEqual(calls, [\u0027a\u0027]);\n","assertions":"const desc = describeDebounce();\nassert(typeof desc === \u0027string\u0027);\nconst dl = desc.toLowerCase();\nassert(dl.includes(\u0027leading\u0027));\nassert(dl.includes(\u0027immediately\u0027) || dl.includes(\u0027first call\u0027));\nassert(dl.includes(\u0027reset\u0027) || dl.includes(\u0027restart\u0027));\nassert(dl.includes(\u0027undefined\u0027) || dl.includes(\u0027does not return\u0027));\n","category":"code2NL_NL2code"} {"id":"8","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction allSettled(promises) {\n return new Promise((resolve) =\u003e {\n if (promises.length === 0) { resolve([]); return; }\n const results = new Array(promises.length);\n let remaining = promises.length;\n promises.forEach((p, i) =\u003e {\n Promise.resolve(p)\n .then(value =\u003e { results[i] = { status: \u0027fulfilled\u0027, value }; })\n .catch(reason =\u003e { results[i] = { status: \u0027rejected\u0027, reason }; })\n .finally(() =\u003e { if (--remaining === 0) resolve(results); });\n });\n });\n}\n\nfunction describeAllSettled() {\n","golden_completion":" return \u0027Takes an array of promises (or plain values) and returns a promise that resolves when all inputs have settled. The returned promise never rejects. Each result is an object: { status: \"fulfilled\", value } for resolved promises, or { status: \"rejected\", reason } for rejected ones. Non-promise values are wrapped via Promise.resolve. An empty array resolves immediately to [].\u0027;\n","suffix":"}\n\n(async () =\u003e {\n const results = await allSettled([\n Promise.resolve(1),\n Promise.reject(\u0027err\u0027),\n 42\n ]);\n assert.strictEqual(results.length, 3);\n assert.deepStrictEqual(results[0], { status: \u0027fulfilled\u0027, value: 1 });\n assert.deepStrictEqual(results[1], { status: \u0027rejected\u0027, reason: \u0027err\u0027 });\n assert.deepStrictEqual(results[2], { status: \u0027fulfilled\u0027, value: 42 });\n})();\n","assertions":"const desc = describeAllSettled();\nassert(typeof desc === \u0027string\u0027);\nconst dl = desc.toLowerCase();\nassert(dl.includes(\u0027never rejects\u0027) || dl.includes(\u0027never reject\u0027) || dl.includes(\u0027always resolves\u0027));\nassert(dl.includes(\u0027fulfilled\u0027) \u0026\u0026 dl.includes(\u0027rejected\u0027));\nassert(dl.includes(\u0027status\u0027));\nassert(dl.includes(\u0027empty\u0027) || dl.includes(\u0027[]\u0027));\nassert(dl.includes(\u0027non-promise\u0027) || dl.includes(\u0027plain value\u0027) || dl.includes(\u0027promise.resolve\u0027));\n","category":"code2NL_NL2code"} {"id":"9","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction stablePartition(arr, predicate) {\n","golden_completion":" stablePartition.doc = \u0027Stably partition the array in place by predicate. \u0027 +\n \u0027Items where predicate returns true move to the front while both groups keep their relative order. \u0027 +\n \u0027Mutates the input array, calls predicate exactly once per item, and returns the split index.\u0027;\n","suffix":" const kept = [];\n const rest = [];\n for (const item of arr) {\n (predicate(item) ? kept : rest).push(item);\n }\n const split = kept.length;\n kept.push(...rest);\n arr.length = 0;\n arr.push(...kept);\n return split;\n}\n\nconst nums = [3, 2, 4, 1, 5, 8];\nconst idx = stablePartition(nums, n =\u003e n % 2 === 1);\nassert.strictEqual(idx, 3);\nassert.deepStrictEqual(nums, [3, 1, 5, 2, 4, 8]);\n","assertions":"const seen = [];\nconst values = [2, 7, 4, 5];\nconst split2 = stablePartition(values, x =\u003e { seen.push(x); return x \u003e 4; });\nassert.deepStrictEqual(values, [7, 5, 2, 4]);\nassert.strictEqual(split2, 2);\nassert.deepStrictEqual(seen, [2, 7, 4, 5]);\nassert(typeof stablePartition.doc === \u0027string\u0027);\nconst doc = stablePartition.doc.toLowerCase();\nassert(doc.includes(\u0027in place\u0027) || doc.includes(\u0027mutates\u0027) || doc.includes(\u0027mutating\u0027));\nassert(doc.includes(\u0027stable\u0027) || doc.includes(\u0027relative order\u0027));\nassert(doc.includes(\u0027exactly once\u0027));\nassert(doc.includes(\u0027split index\u0027));\n","category":"code2NL_NL2code"} {"id":"10","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction copyOwnDescriptors(target, source) {\n","golden_completion":" copyOwnDescriptors.doc = \u0027Copy every own property descriptor from source to target using Reflect.ownKeys and Object.defineProperty. \u0027 +\n \u0027Includes string keys, symbol keys, and non-enumerable own properties while preserving getter/setter accessors. \u0027 +\n \u0027Mutates the target object in place and returns that same target reference.\u0027;\n","suffix":" for (const key of Reflect.ownKeys(source)) {\n const descriptor = Object.getOwnPropertyDescriptor(source, key);\n Object.defineProperty(target, key, descriptor);\n }\n return target;\n}\n\nconst sym = Symbol(\u0027secret\u0027);\nconst source = {};\nObject.defineProperty(source, \u0027hidden\u0027, { value: 7, enumerable: false });\nObject.defineProperty(source, sym, { get() { return 11; }, enumerable: true });\nconst target = { existing: true };\nconst copied = copyOwnDescriptors(target, source);\nassert.strictEqual(copied, target);\nassert.strictEqual(target.hidden, 7);\nassert.strictEqual(Object.keys(target).includes(\u0027hidden\u0027), false);\nassert.strictEqual(target[sym], 11);\n","assertions":"const sym2 = Symbol(\u0027v\u0027);\nconst src2 = {};\nObject.defineProperty(src2, \u0027value\u0027, { value: 3, writable: false, enumerable: false });\nObject.defineProperty(src2, sym2, { get() { return 9; }, enumerable: true });\nconst dst2 = {};\nassert.strictEqual(copyOwnDescriptors(dst2, src2), dst2);\nassert.strictEqual(Object.getOwnPropertyDescriptor(dst2, \u0027value\u0027).writable, false);\nassert.strictEqual(Object.getOwnPropertyDescriptor(dst2, \u0027value\u0027).enumerable, false);\nassert.strictEqual(dst2[sym2], 9);\nassert(typeof copyOwnDescriptors.doc === \u0027string\u0027);\nconst doc = copyOwnDescriptors.doc;\nassert(doc.includes(\u0027Reflect.ownKeys\u0027), \u0027must mention Reflect.ownKeys\u0027);\nassert(doc.includes(\u0027Object.defineProperty\u0027), \u0027must mention Object.defineProperty\u0027);\nassert(doc.includes(\u0027symbol\u0027) || doc.includes(\u0027Symbol\u0027), \u0027must mention symbol keys\u0027);\nassert(doc.includes(\u0027non-enumerable\u0027) || doc.includes(\u0027non enumerable\u0027), \u0027must mention non-enumerable properties\u0027);\nassert(doc.includes(\u0027getter\u0027) || doc.includes(\u0027setter\u0027) || doc.includes(\u0027accessor\u0027), \u0027must mention accessors\u0027);\nassert(doc.toLowerCase().includes(\u0027mutates\u0027) || doc.toLowerCase().includes(\u0027in place\u0027), \u0027must mention mutation\u0027);\n","category":"code2NL_NL2code"} {"id":"11","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction memoizeByObject(fn) {\n const cache = new WeakMap();\n return function(key) {\n if (key === null || (typeof key !== \u0027object\u0027 \u0026\u0026 typeof key !== \u0027function\u0027)) {\n throw new TypeError(\u0027object key required\u0027);\n }\n if (cache.has(key)) return cache.get(key);\n const value = fn.call(this, key);\n cache.set(key, value);\n return value;\n };\n}\n\nfunction describeMemoizeByObject() {\n","golden_completion":" return \u0027Memoizes a unary function with a WeakMap keyed by object or function identity. \u0027 +\n \u0027Null and primitive keys throw TypeError, while repeated calls with the same object return the cached value. \u0027 +\n \u0027The wrapped function is called at most once per key, and WeakMap entries do not prevent garbage collection.\u0027;\n","suffix":"}\n\nlet calls = 0;\nconst memo = memoizeByObject(obj =\u003e { calls++; return { seen: obj.id, n: calls }; });\nconst key = { id: \u0027a\u0027 };\nconst first = memo(key);\nconst second = memo(key);\nassert.strictEqual(first, second);\nassert.strictEqual(calls, 1);\nassert.throws(() =\u003e memo(\u0027a\u0027), TypeError);\n","assertions":"const desc = describeMemoizeByObject();\nassert(typeof desc === \u0027string\u0027);\nassert(desc.includes(\u0027WeakMap\u0027), \u0027must mention WeakMap\u0027);\nassert(desc.includes(\u0027object\u0027) || desc.includes(\u0027function\u0027), \u0027must mention object/function keys\u0027);\nassert(desc.includes(\u0027identity\u0027), \u0027must mention object identity\u0027);\nassert(desc.includes(\u0027TypeError\u0027), \u0027must mention TypeError\u0027);\nassert(desc.includes(\u0027primitive\u0027) || desc.includes(\u0027null\u0027), \u0027must mention primitive/null rejection\u0027);\nassert(desc.includes(\u0027at most once\u0027) || desc.includes(\u0027once per key\u0027) || desc.includes(\u0027exactly once\u0027), \u0027must mention call count guarantee\u0027);\nassert(desc.includes(\u0027garbage\u0027) || desc.includes(\u0027GC\u0027), \u0027must mention garbage collection behavior\u0027);\n","category":"code2NL_NL2code"} {"id":"12","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction consumeFront(list, n, audit) {\n","golden_completion":" consumeFront.doc = \u0027Remove and return up to n items from the front of list, mutating the original array in place. \u0027 +\n \u0027If n exceeds the list length, the list is drained; negative n throws RangeError. \u0027 +\n \u0027Each removed item is appended to the audit log with its original index.\u0027;\n","suffix":" if (n \u003c 0) throw new RangeError(\u0027n must be non-negative\u0027);\n const count = Math.min(n, list.length);\n const removed = list.splice(0, count);\n if (audit) {\n removed.forEach((value, index) =\u003e audit.push({ value, index }));\n }\n return removed;\n}\n\nconst audit = [];\nconst items = [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027];\nassert.deepStrictEqual(consumeFront(items, 2, audit), [\u0027a\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(items, [\u0027c\u0027, \u0027d\u0027]);\nassert.deepStrictEqual(audit, [{ value: \u0027a\u0027, index: 0 }, { value: \u0027b\u0027, index: 1 }]);\nassert.throws(() =\u003e consumeFront(items, -1, audit), RangeError);\n","assertions":"const audit2 = [];\nconst values = [10, 20];\nassert.deepStrictEqual(consumeFront(values, 5, audit2), [10, 20]);\nassert.deepStrictEqual(values, []);\nassert.deepStrictEqual(audit2, [{ value: 10, index: 0 }, { value: 20, index: 1 }]);\nassert(typeof consumeFront.doc === \u0027string\u0027);\nconst doc = consumeFront.doc.toLowerCase();\nassert(doc.includes(\u0027mutating\u0027) || doc.includes(\u0027mutates\u0027) || doc.includes(\u0027in place\u0027), \u0027must mention mutation\u0027);\nassert(doc.includes(\u0027front\u0027) || doc.includes(\u0027prefix\u0027), \u0027must mention front/prefix removal\u0027);\nassert(doc.includes(\u0027drain\u0027) || doc.includes(\u0027exceeds\u0027), \u0027must mention over-large n draining behavior\u0027);\nassert(doc.includes(\u0027rangeerror\u0027), \u0027must mention RangeError\u0027);\nassert(doc.includes(\u0027audit\u0027), \u0027must mention audit log\u0027);\nassert(doc.includes(\u0027original index\u0027) || doc.includes(\u0027index\u0027), \u0027must mention original indexes\u0027);\nassert(doc.includes(\u0027return\u0027) \u0026\u0026 doc.includes(\u0027removed\u0027), \u0027must mention returning removed items\u0027);\n","category":"code2NL_NL2code"} {"id":"13","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction popSmallestBy(items, keyFn, audit) {\n","golden_completion":" popSmallestBy.doc = \u0027Find the item with the smallest key, choosing the first item on ties, then remove it from the array in place. \u0027 +\n \u0027keyFn is called exactly once per item; an empty array returns undefined. \u0027 +\n \u0027When audit is provided, appends the removed value, original index, and computed key before returning the removed item.\u0027;\n","suffix":" if (items.length === 0) return undefined;\n let bestIndex = 0;\n let bestKey;\n const keys = items.map((item, index) =\u003e {\n const key = keyFn(item, index, items);\n if (index === 0 || key \u003c bestKey) { bestKey = key; bestIndex = index; }\n return key;\n });\n const [removed] = items.splice(bestIndex, 1);\n if (audit) audit.push({ value: removed, index: bestIndex, key: keys[bestIndex] });\n return removed;\n}\n\nconst audit = [];\nconst rows = [{ n: \u0027a\u0027, score: 3 }, { n: \u0027b\u0027, score: 1 }, { n: \u0027c\u0027, score: 1 }];\nconst removed = popSmallestBy(rows, row =\u003e row.score, audit);\nassert.deepStrictEqual(removed, { n: \u0027b\u0027, score: 1 });\nassert.deepStrictEqual(rows.map(r =\u003e r.n), [\u0027a\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(audit, [{ value: { n: \u0027b\u0027, score: 1 }, index: 1, key: 1 }]);\n","assertions":"const seen = [];\nconst nums = [5, 2, 2, 7];\nassert.strictEqual(popSmallestBy(nums, (x, i) =\u003e { seen.push([x, i]); return x; }), 2);\nassert.deepStrictEqual(nums, [5, 2, 7]);\nassert.deepStrictEqual(seen, [[5,0],[2,1],[2,2],[7,3]]);\nassert.strictEqual(popSmallestBy([], x =\u003e x), undefined);\nassert(typeof popSmallestBy.doc === \u0027string\u0027);\nconst doc = popSmallestBy.doc.toLowerCase();\nassert(doc.includes(\u0027in place\u0027) || doc.includes(\u0027mutates\u0027) || doc.includes(\u0027remove\u0027), \u0027must mention in-place removal\u0027);\nassert(doc.includes(\u0027first\u0027) \u0026\u0026 (doc.includes(\u0027tie\u0027) || doc.includes(\u0027ties\u0027)), \u0027must mention first item on ties\u0027);\nassert(doc.includes(\u0027exactly once\u0027), \u0027must mention exact keyFn calls\u0027);\nassert(doc.includes(\u0027undefined\u0027) \u0026\u0026 doc.includes(\u0027empty\u0027), \u0027must mention empty return\u0027);\nassert(doc.includes(\u0027audit\u0027), \u0027must mention audit\u0027);\nassert(doc.includes(\u0027original index\u0027) || doc.includes(\u0027index\u0027), \u0027must mention original index\u0027);\n","category":"code2NL_NL2code"} {"id":"14","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction parseConfigLines(text) {\n const result = {};\n const lines = text.split(/\\r?\\n/);\n lines.forEach((line, index) =\u003e {\n const trimmed = line.trim();\n if (trimmed === \u0027\u0027 || trimmed.startsWith(\u0027#\u0027)) return;\n const eq = trimmed.indexOf(\u0027=\u0027);\n if (eq \u003c 0) throw new SyntaxError(\u0027Missing = on line \u0027 + (index + 1));\n const key = trimmed.slice(0, eq).trim();\n const value = trimmed.slice(eq + 1).trim();\n if (Object.prototype.hasOwnProperty.call(result, key)) {\n if (Array.isArray(result[key])) result[key].push(value);\n else result[key] = [result[key], value];\n } else {\n result[key] = value;\n }\n });\n return result;\n}\n\nfunction describeParseConfigLines() {\n","golden_completion":" return \u0027Parses key=value configuration lines, skipping blank lines and lines whose trimmed form starts with #. \u0027 +\n \u0027Whitespace around keys and values is stripped, only the first equals sign splits the line, and duplicate keys are promoted to arrays in encounter order. \u0027 +\n \u0027Malformed non-comment lines without = throw a SyntaxError that includes the 1-based line number.\u0027;\n","suffix":"}\n\nconst parsed = parseConfigLines(\u0027 # comment\\n a = 1 \\n b = x=y \\n a = 2 \\n\u0027);\nassert.deepStrictEqual(parsed, { a: [\u00271\u0027, \u00272\u0027], b: \u0027x=y\u0027 });\nassert.throws(() =\u003e parseConfigLines(\u0027ok=1\\nbad line\u0027), SyntaxError);\n","assertions":"const desc = describeParseConfigLines();\nassert(typeof desc === \u0027string\u0027);\nconst dl = desc.toLowerCase();\nassert(dl.includes(\u0027blank\u0027) \u0026\u0026 dl.includes(\u0027comment\u0027), \u0027must mention blank/comment skipping\u0027);\nassert(dl.includes(\u0027trim\u0027) || dl.includes(\u0027whitespace\u0027), \u0027must mention whitespace stripping\u0027);\nassert(dl.includes(\u0027first\u0027) \u0026\u0026 (dl.includes(\u0027=\u0027) || dl.includes(\u0027equals\u0027)), \u0027must mention first equals sign split\u0027);\nassert(dl.includes(\u0027duplicate\u0027) \u0026\u0026 (dl.includes(\u0027array\u0027) || dl.includes(\u0027arrays\u0027)), \u0027must mention duplicate key array promotion\u0027);\nassert(dl.includes(\u0027encounter order\u0027) || dl.includes(\u0027order\u0027), \u0027must mention duplicate order\u0027);\nassert(desc.includes(\u0027SyntaxError\u0027), \u0027must mention SyntaxError\u0027);\nassert(dl.includes(\u0027line number\u0027) || dl.includes(\u00271-based\u0027), \u0027must mention line number\u0027);\n","category":"code2NL_NL2code"} {"id":"15","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction insertBeforeRank(items, item, rank, audit) {\n","golden_completion":" insertBeforeRank.doc = \u0027Insert item into an array already sorted by ascending rank, mutating the array in place with splice. \u0027 +\n \u0027The separate rank argument is compared to existing item.rank values, and ties insert before the first equal rank (left insertion). \u0027 +\n \u0027Returns the insertion index and optionally appends an audit entry containing item, rank, and index.\u0027;\n","suffix":" let index = 0;\n while (index \u003c items.length \u0026\u0026 items[index].rank \u003c rank) index++;\n items.splice(index, 0, item);\n if (audit) audit.push({ item, rank, index });\n return index;\n}\n\nconst audit = [];\nconst queue = [{ id: \u0027a\u0027, rank: 1 }, { id: \u0027b\u0027, rank: 3 }, { id: \u0027c\u0027, rank: 3 }];\nconst inserted = { id: \u0027x\u0027 };\nconst index = insertBeforeRank(queue, inserted, 3, audit);\nassert.strictEqual(index, 1);\nassert.deepStrictEqual(queue.map(x =\u003e x.id), [\u0027a\u0027, \u0027x\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(audit, [{ item: inserted, rank: 3, index: 1 }]);\n","assertions":"const log = [];\nconst rows = [{ id: \u0027low\u0027, rank: 2 }, { id: \u0027high\u0027, rank: 9 }];\nconst added = { id: \u0027mid\u0027 };\nassert.strictEqual(insertBeforeRank(rows, added, 5, log), 1);\nassert.deepStrictEqual(rows.map(x =\u003e x.id), [\u0027low\u0027, \u0027mid\u0027, \u0027high\u0027]);\nassert.deepStrictEqual(log, [{ item: added, rank: 5, index: 1 }]);\nassert(typeof insertBeforeRank.doc === \u0027string\u0027);\nconst doc = insertBeforeRank.doc.toLowerCase();\nassert(doc.includes(\u0027ascending\u0027) || doc.includes(\u0027sorted\u0027), \u0027must mention sorted ascending ranks\u0027);\nassert(doc.includes(\u0027rank argument\u0027) || doc.includes(\u0027separate rank\u0027), \u0027must mention separate rank argument\u0027);\nassert(doc.includes(\u0027tie\u0027) || doc.includes(\u0027equal\u0027), \u0027must mention tie behavior\u0027);\nassert(doc.includes(\u0027before\u0027) || doc.includes(\u0027left\u0027), \u0027must mention left insertion before equals\u0027);\nassert(doc.includes(\u0027splice\u0027) || doc.includes(\u0027in place\u0027) || doc.includes(\u0027mutates\u0027), \u0027must mention mutation/splice\u0027);\nassert(doc.includes(\u0027return\u0027) \u0026\u0026 doc.includes(\u0027index\u0027), \u0027must mention returned index\u0027);\nassert(doc.includes(\u0027audit\u0027), \u0027must mention audit entry\u0027);\n","category":"code2NL_NL2code"} {"id":"16","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction deepFreeze(obj) {\n if (obj === null || typeof obj !== \u0027object\u0027) return obj;\n if (Object.isFrozen(obj)) return obj;\n Object.freeze(obj);\n for (const val of Object.values(obj)) {\n if (val !== null \u0026\u0026 typeof val === \u0027object\u0027\n \u0026\u0026 (Array.isArray(val) || Object.getPrototypeOf(val) === Object.prototype)) {\n deepFreeze(val);\n }\n }\n return obj;\n}\n\n// Write a function describeDeepFreeze that returns a precise description.\n// The description MUST mention:\n// 1. Recursively freezes nested plain objects and arrays\n// 2. Skips non-plain objects (Date, RegExp, class instances) — only freezes\n// objects whose prototype is Object.prototype or arrays\n// 3. Skips already-frozen objects to avoid infinite loops\n// 4. Returns the original object (same reference), not a copy\n\n","golden_completion":"function describeDeepFreeze() {\n return \u0027Recursively freezes an object and its nested plain objects and arrays. \u0027\n + \u0027Only recurses into values that are arrays or whose prototype is Object.prototype, \u0027\n + \u0027so class instances like Date or RegExp are left unfrozen. Already-frozen \u0027\n + \u0027objects are skipped to prevent infinite recursion on circular references. \u0027\n + \u0027Returns the same object reference, not a copy.\u0027;\n}\n","suffix":"\nconst desc = describeDeepFreeze();\nassert.ok(typeof desc === \u0027string\u0027);\n\n// Verify deepFreeze works\nconst obj = { a: { b: [1, 2, { c: 3 }] } };\nconst result = deepFreeze(obj);\nassert.strictEqual(result, obj); // same reference\nassert.ok(Object.isFrozen(obj));\nassert.ok(Object.isFrozen(obj.a));\nassert.ok(Object.isFrozen(obj.a.b));\nassert.ok(Object.isFrozen(obj.a.b[2]));\n","assertions":"// Description must mention recursion\nassert.ok(desc.toLowerCase().includes(\u0027recurs\u0027),\n \u0027description must mention recursive behavior\u0027);\n// Description must mention plain objects or Object.prototype\nassert.ok(desc.toLowerCase().includes(\u0027plain\u0027) || desc.includes(\u0027Object.prototype\u0027),\n \u0027description must mention plain objects or Object.prototype\u0027);\n// Description must mention arrays\nassert.ok(desc.toLowerCase().includes(\u0027array\u0027),\n \u0027description must mention arrays\u0027);\n// Description must mention skipping frozen objects\nassert.ok(desc.toLowerCase().includes(\u0027frozen\u0027) \u0026\u0026 desc.toLowerCase().includes(\u0027skip\u0027),\n \u0027description must mention skipping already-frozen objects\u0027);\n// Description must mention returning same reference\nassert.ok(desc.toLowerCase().includes(\u0027same\u0027) \u0026\u0026 (desc.toLowerCase().includes(\u0027reference\u0027) || desc.toLowerCase().includes(\u0027object\u0027)),\n \u0027description must mention returning same reference/object\u0027);\n// Verify Date is NOT frozen\nconst withDate = { d: new Date() };\ndeepFreeze(withDate);\nassert.ok(Object.isFrozen(withDate));\nassert.ok(!Object.isFrozen(withDate.d), \u0027Date instance should not be frozen\u0027);\n","category":"code2NL_NL2code"} {"id":"17","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass OnceRegistry {\n constructor() {\n this._values = new Map();\n this._created = 0;\n }\n\n get(key, factory) {\n","golden_completion":" OnceRegistry.prototype.get.doc = \u0027Return the cached value for key, or invoke factory exactly once on the first miss and cache that value by identity. \u0027 +\n \u0027Cache hits do not call factory again and return the same stored reference. \u0027 +\n \u0027Each new key increments the _created counter after storing the factory result.\u0027;\n","suffix":" if (this._values.has(key)) return this._values.get(key);\n const value = factory(key);\n this._values.set(key, value);\n this._created++;\n return value;\n }\n}\n\nconst registry = new OnceRegistry();\nlet calls = 0;\nconst first = registry.get(\u0027x\u0027, () =\u003e { calls++; return { id: calls }; });\nconst second = registry.get(\u0027x\u0027, () =\u003e { calls++; return { id: calls }; });\nassert.strictEqual(first, second);\nassert.strictEqual(calls, 1);\nassert.strictEqual(registry._created, 1);\n","assertions":"const r2 = new OnceRegistry();\nlet made = 0;\nconst a = r2.get(\u0027a\u0027, () =\u003e { made++; return { tag: \u0027a\u0027 }; });\nconst b = r2.get(\u0027b\u0027, () =\u003e { made++; return { tag: \u0027b\u0027 }; });\nassert.strictEqual(r2.get(\u0027a\u0027, () =\u003e { throw new Error(\u0027should not run\u0027); }), a);\nassert.notStrictEqual(a, b);\nassert.strictEqual(made, 2);\nassert.strictEqual(r2._created, 2);\nassert(typeof OnceRegistry.prototype.get.doc === \u0027string\u0027);\nconst doc = OnceRegistry.prototype.get.doc.toLowerCase();\nassert(doc.includes(\u0027factory\u0027), \u0027must mention factory\u0027);\nassert(doc.includes(\u0027exactly once\u0027) || doc.includes(\u0027once\u0027), \u0027must mention one-time factory invocation\u0027);\nassert(doc.includes(\u0027same\u0027) \u0026\u0026 (doc.includes(\u0027reference\u0027) || doc.includes(\u0027identity\u0027)), \u0027must mention same cached identity/reference\u0027);\nassert(doc.includes(\u0027hit\u0027) \u0026\u0026 (doc.includes(\u0027not call\u0027) || doc.includes(\u0027does not call\u0027)), \u0027must mention cache hits skip factory\u0027);\nassert(doc.includes(\u0027_created\u0027) || doc.includes(\u0027counter\u0027), \u0027must mention _created counter\u0027);\nassert(doc.includes(\u0027key\u0027), \u0027must mention per-key behavior\u0027);\n","category":"code2NL_NL2code"} {"id":"18","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass RollingAverage {\n constructor(size) {\n this.size = size;\n this.values = [];\n this.sum = 0;\n }\n\n add(value) {\n","golden_completion":" RollingAverage.prototype.add.doc = \u0027Add one value to a fixed-size sliding window and update the internal sum state. \u0027 +\n \u0027Returns null until the window is full; after that, evicts the oldest value when needed and returns the average of the current window. \u0027 +\n \u0027The method mutates the stored values array and running sum on every call.\u0027;\n","suffix":" this.values.push(value);\n this.sum += value;\n if (this.values.length \u003e this.size) {\n this.sum -= this.values.shift();\n }\n if (this.values.length \u003c this.size) return null;\n return this.sum / this.values.length;\n }\n}\n\nconst avg = new RollingAverage(3);\nassert.strictEqual(avg.add(3), null);\nassert.strictEqual(avg.add(6), null);\nassert.strictEqual(avg.add(9), 6);\nassert.strictEqual(avg.add(12), 9);\nassert.deepStrictEqual(avg.values, [6, 9, 12]);\n","assertions":"const avg2 = new RollingAverage(2);\nassert.strictEqual(avg2.add(10), null);\nassert.strictEqual(avg2.add(14), 12);\nassert.strictEqual(avg2.add(20), 17);\nassert.deepStrictEqual(avg2.values, [14, 20]);\nassert.strictEqual(avg2.sum, 34);\nassert(typeof RollingAverage.prototype.add.doc === \u0027string\u0027);\nconst doc = RollingAverage.prototype.add.doc.toLowerCase();\nassert(doc.includes(\u0027sliding window\u0027) || doc.includes(\u0027fixed-size\u0027), \u0027must mention fixed sliding window\u0027);\nassert(doc.includes(\u0027null\u0027) \u0026\u0026 (doc.includes(\u0027until\u0027) || doc.includes(\u0027before\u0027)), \u0027must mention null until full\u0027);\nassert(doc.includes(\u0027oldest\u0027) || doc.includes(\u0027evict\u0027) || doc.includes(\u0027shift\u0027), \u0027must mention oldest eviction\u0027);\nassert(doc.includes(\u0027current window\u0027) || doc.includes(\u0027window average\u0027), \u0027must mention current-window average\u0027);\nassert(doc.includes(\u0027sum\u0027), \u0027must mention sum state\u0027);\nassert(doc.includes(\u0027mutates\u0027) || doc.includes(\u0027state\u0027), \u0027must mention state mutation\u0027);\n","category":"code2NL_NL2code"} {"id":"19","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Implement slugify(str) according to this specification:\n//\n// Converts a string to a URL-friendly slug.\n// Rules (applied in order):\n// 1. Convert to lowercase\n// 2. Replace spaces AND underscores with hyphens\n// 3. Remove all characters that are NOT alphanumeric or hyphens\n// 4. Collapse consecutive hyphens into a single hyphen\n// 5. Remove leading and trailing hyphens\n//\n// Examples:\n// \u0027Hello World\u0027 =\u003e \u0027hello-world\u0027\n// \u0027foo_bar_baz\u0027 =\u003e \u0027foo-bar-baz\u0027\n// \u0027 --Hello-- \u0027 =\u003e \u0027hello\u0027\n// \u0027a!!!b\u0027 =\u003e \u0027a-b\u0027 -- NO! Non-alphanum removed, not replaced\n// \u0027a!!!b\u0027 =\u003e \u0027ab\u0027\n\n","golden_completion":"function slugify(str) {\n return str\n .toLowerCase()\n .replace(/[\\s_]/g, \u0027-\u0027)\n .replace(/[^a-z0-9-]/g, \u0027\u0027)\n .replace(/-+/g, \u0027-\u0027)\n .replace(/^-+|-+$/g, \u0027\u0027);\n}\n","suffix":"\nassert.strictEqual(slugify(\u0027Hello World\u0027), \u0027hello-world\u0027);\nassert.strictEqual(slugify(\u0027foo_bar_baz\u0027), \u0027foo-bar-baz\u0027);\nassert.strictEqual(slugify(\u0027 --Hello-- \u0027), \u0027hello\u0027);\nassert.strictEqual(slugify(\u0027a!!!b\u0027), \u0027ab\u0027);\nassert.strictEqual(slugify(\u0027\u0027), \u0027\u0027);\n","assertions":"// Underscores become hyphens, not removed\nassert.strictEqual(slugify(\u0027hello_world\u0027), \u0027hello-world\u0027);\n// Multiple spaces collapse\nassert.strictEqual(slugify(\u0027a b\u0027), \u0027a-b\u0027);\n// Mixed spaces and underscores\nassert.strictEqual(slugify(\u0027a _ b\u0027), \u0027a-b\u0027);\n// Numbers preserved\nassert.strictEqual(slugify(\u0027Item 42 - Final\u0027), \u0027item-42-final\u0027);\n// All special chars\nassert.strictEqual(slugify(\u0027!@#$%\u0027), \u0027\u0027);\n// Leading/trailing hyphens removed after processing\nassert.strictEqual(slugify(\u0027---test---\u0027), \u0027test\u0027);\n// Non-alphanumeric are removed, not replaced with hyphens\nassert.strictEqual(slugify(\u0027a.b.c\u0027), \u0027abc\u0027);\n","category":"code2NL_NL2code"} {"id":"20","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Implement semverCompare(a, b) according to this specification:\n//\n// Compares two semantic version strings.\n// Returns -1 if a \u003c b, 0 if a === b, 1 if a \u003e b.\n//\n// Rules:\n// 1. Versions have format: major.minor.patch or major.minor.patch-prerelease\n// 2. Compare major, minor, patch as integers (left to right)\n// 3. A version WITH a pre-release tag (e.g., 1.0.0-alpha) has LOWER\n// precedence than the SAME version WITHOUT a tag (1.0.0)\n// 4. When both have pre-release tags and same major.minor.patch,\n// compare the tags lexicographically (e.g., alpha \u003c beta)\n// 5. No build metadata (no + suffix) — ignore that case\n\n","golden_completion":"function semverCompare(a, b) {\n const parse = v =\u003e { const [c, p] = v.split(\u0027-\u0027); const n = c.split(\u0027.\u0027).map(Number); return { n, p: p || null }; };\n const pa = parse(a), pb = parse(b);\n for (let i = 0; i \u003c 3; i++) { if (pa.n[i] !== pb.n[i]) return pa.n[i] \u003c pb.n[i] ? -1 : 1; }\n if (pa.p === pb.p) return 0;\n if (pa.p === null) return 1;\n if (pb.p === null) return -1;\n return pa.p \u003c pb.p ? -1 : pa.p \u003e pb.p ? 1 : 0;\n}\n","suffix":"\n// Basic numeric comparison\nassert.strictEqual(semverCompare(\u00271.0.0\u0027, \u00272.0.0\u0027), -1);\nassert.strictEqual(semverCompare(\u00272.0.0\u0027, \u00271.0.0\u0027), 1);\nassert.strictEqual(semverCompare(\u00271.0.0\u0027, \u00271.0.0\u0027), 0);\n\n// Minor and patch\nassert.strictEqual(semverCompare(\u00271.2.0\u0027, \u00271.3.0\u0027), -1);\nassert.strictEqual(semverCompare(\u00271.2.3\u0027, \u00271.2.4\u0027), -1);\n\n// Pre-release has LOWER precedence than release\nassert.strictEqual(semverCompare(\u00271.0.0-alpha\u0027, \u00271.0.0\u0027), -1);\nassert.strictEqual(semverCompare(\u00271.0.0\u0027, \u00271.0.0-beta\u0027), 1);\n\n// Pre-release lexicographic comparison\nassert.strictEqual(semverCompare(\u00271.0.0-alpha\u0027, \u00271.0.0-beta\u0027), -1);\nassert.strictEqual(semverCompare(\u00271.0.0-beta\u0027, \u00271.0.0-alpha\u0027), 1);\n","assertions":"// Numeric, not string comparison (10 \u003e 9)\nassert.strictEqual(semverCompare(\u00271.10.0\u0027, \u00271.9.0\u0027), 1);\nassert.strictEqual(semverCompare(\u002710.0.0\u0027, \u00279.0.0\u0027), 1);\n// Same pre-release\nassert.strictEqual(semverCompare(\u00271.0.0-rc1\u0027, \u00271.0.0-rc1\u0027), 0);\n// Pre-release vs different version\nassert.strictEqual(semverCompare(\u00271.0.1-alpha\u0027, \u00271.0.0\u0027), 1);\nassert.strictEqual(semverCompare(\u00270.9.9\u0027, \u00271.0.0-alpha\u0027), -1);\n// Both have pre-release, different core versions\nassert.strictEqual(semverCompare(\u00271.0.0-alpha\u0027, \u00272.0.0-alpha\u0027), -1);\n","category":"code2NL_NL2code"} {"id":"21","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction customReduce(arr, callback, initialValue) {\n const hasInitial = arguments.length \u003e= 3;\n let accumulator;\n let startIndex;\n\n if (hasInitial) {\n accumulator = initialValue;\n startIndex = 0;\n } else {\n if (arr.length === 0) {\n throw new TypeError(\u0027Reduce of empty array with no initial value\u0027);\n }\n accumulator = arr[0];\n startIndex = 1;\n }\n\n for (let i = startIndex; i \u003c arr.length; i++) {\n accumulator = callback(accumulator, arr[i], i, arr);\n }\n return accumulator;\n}\n\n","golden_completion":"customReduce.doc = \u0027Reduces an array to a single value by applying a callback cumulatively. When initialValue is provided, starts accumulation from index 0 using initialValue as the first accumulator. When initialValue is omitted, uses the first element as the initial accumulator and starts from index 1. Throws TypeError if the array is empty and no initialValue is given. Returns initialValue unchanged if the array is empty but initialValue is provided. The callback receives four arguments: accumulator, currentValue, currentIndex, and the original array.\u0027;\n","suffix":"// Tests\nassert.strictEqual(customReduce([1, 2, 3], (a, b) =\u003e a + b, 0), 6);\nassert.strictEqual(customReduce([1, 2, 3], (a, b) =\u003e a + b), 6);\nassert.strictEqual(customReduce([42], (a, b) =\u003e a + b), 42);\nassert.strictEqual(customReduce([], (a, b) =\u003e a + b, 99), 99);\nassert.throws(() =\u003e customReduce([], (a, b) =\u003e a + b), TypeError);\nconsole.log(\u0027Task 21 suffix passed\u0027);\n","assertions":"// Doc must mention key behaviors\nassert(customReduce.doc.includes(\u0027initialValue\u0027), \u0027must mention initialValue\u0027);\nassert(customReduce.doc.includes(\u0027TypeError\u0027), \u0027must mention TypeError\u0027);\nassert(customReduce.doc.includes(\u0027empty\u0027), \u0027must mention empty array case\u0027);\nassert(customReduce.doc.includes(\u0027index 0\u0027) || customReduce.doc.includes(\u0027index zero\u0027), \u0027must mention starting index with initial\u0027);\nassert(customReduce.doc.includes(\u0027index 1\u0027) || customReduce.doc.includes(\u0027index one\u0027) || customReduce.doc.includes(\u0027second element\u0027), \u0027must mention starting from index 1 without initial\u0027);\nassert(customReduce.doc.includes(\u0027accumulator\u0027), \u0027must mention accumulator\u0027);\nassert(customReduce.doc.includes(\u0027four\u0027) || customReduce.doc.includes(\u00274\u0027), \u0027must mention four callback arguments\u0027);\nconsole.log(\u0027Task 21 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"22","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass LRUMap {\n constructor(capacity) {\n this.capacity = capacity;\n this.map = new Map();\n }\n\n get(key) {\n if (!this.map.has(key)) return undefined;\n const value = this.map.get(key);\n // Move to most recent: delete and re-set\n this.map.delete(key);\n this.map.set(key, value);\n return value;\n }\n\n set(key, value) {\n if (this.map.has(key)) {\n this.map.delete(key);\n }\n this.map.set(key, value);\n if (this.map.size \u003e this.capacity) {\n // Evict least recently used (first key in Map iteration order)\n const lruKey = this.map.keys().next().value;\n this.map.delete(lruKey);\n }\n }\n\n has(key) {\n return this.map.has(key);\n }\n\n get size() {\n return this.map.size;\n }\n}\n\n","golden_completion":"function describeLRUMap() {\n return \u0027LRUMap is a fixed-capacity key-value cache that evicts the least recently used entry when a new entry exceeds the capacity. Both get() and set() update an entry\\\u0027s recency by deleting and re-inserting it into the underlying Map, exploiting Map\\\u0027s insertion-order iteration. get() returns undefined for missing keys without affecting recency order. set() overwrites existing keys and promotes them to most recent. Eviction removes the first key in Map iteration order, which is the least recently accessed.\u0027;\n}\n","suffix":"const cache = new LRUMap(3);\ncache.set(\u0027a\u0027, 1);\ncache.set(\u0027b\u0027, 2);\ncache.set(\u0027c\u0027, 3);\nassert.strictEqual(cache.get(\u0027a\u0027), 1);\ncache.set(\u0027d\u0027, 4); // evicts \u0027b\u0027 (LRU), not \u0027a\u0027 because get(\u0027a\u0027) refreshed it\nassert.strictEqual(cache.has(\u0027b\u0027), false);\nassert.strictEqual(cache.has(\u0027a\u0027), true);\nassert.strictEqual(cache.size, 3);\nconsole.log(\u0027Task 22 suffix passed\u0027);\n","assertions":"const desc = describeLRUMap();\nassert(desc.includes(\u0027capacity\u0027) || desc.includes(\u0027fixed-capacity\u0027), \u0027must mention capacity\u0027);\nassert(desc.includes(\u0027least recently used\u0027) || desc.includes(\u0027LRU\u0027), \u0027must mention LRU eviction\u0027);\nassert(desc.includes(\u0027delete\u0027) || desc.includes(\u0027delet\u0027), \u0027must mention delete-and-re-set pattern\u0027);\nassert(desc.includes(\u0027re-insert\u0027) || desc.includes(\u0027re-set\u0027) || desc.includes(\u0027re-inserting\u0027), \u0027must mention re-insertion\u0027);\nassert(desc.includes(\u0027Map\u0027) \u0026\u0026 (desc.includes(\u0027insertion-order\u0027) || desc.includes(\u0027insertion order\u0027) || desc.includes(\u0027iteration order\u0027)), \u0027must mention Map iteration order\u0027);\nassert(desc.includes(\u0027get()\u0027) || desc.includes(\u0027get \u0027), \u0027must mention get behavior\u0027);\nassert(desc.includes(\u0027undefined\u0027), \u0027must mention undefined for missing keys\u0027);\nconsole.log(\u0027Task 22 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"23","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Implement a function that checks if two date ranges overlap.\n// Each range is an object { start: Date, end: Date }.\n// IMPORTANT: Ranges that share ONLY an endpoint do NOT overlap.\n// e.g., [Jan 1 - Jan 5] and [Jan 5 - Jan 10] do NOT overlap.\n// Overlap requires at least one moment strictly between both start and end.\n// Returns true if ranges overlap, false otherwise.\n// Assumes start \u003c= end for both ranges.\n\n","golden_completion":"function rangesOverlap(range1, range2) {\n return range1.start \u003c range2.end \u0026\u0026 range2.start \u003c range1.end;\n}\n","suffix":"// Clearly overlapping\nassert.strictEqual(rangesOverlap(\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-10\u0027) },\n { start: new Date(\u00272024-01-05\u0027), end: new Date(\u00272024-01-15\u0027) }\n), true);\n\n// Touching at endpoint only - NOT overlapping\nassert.strictEqual(rangesOverlap(\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-05\u0027) },\n { start: new Date(\u00272024-01-05\u0027), end: new Date(\u00272024-01-10\u0027) }\n), false);\n\n// No overlap at all\nassert.strictEqual(rangesOverlap(\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-03\u0027) },\n { start: new Date(\u00272024-01-05\u0027), end: new Date(\u00272024-01-10\u0027) }\n), false);\n\n// One range inside another\nassert.strictEqual(rangesOverlap(\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-20\u0027) },\n { start: new Date(\u00272024-01-05\u0027), end: new Date(\u00272024-01-10\u0027) }\n), true);\n\nconsole.log(\u0027Task 23 suffix passed\u0027);\n","assertions":"// Same range\nassert.strictEqual(rangesOverlap(\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-10\u0027) },\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-10\u0027) }\n), true);\n\n// Touching at start - NOT overlapping\nassert.strictEqual(rangesOverlap(\n { start: new Date(\u00272024-01-05\u0027), end: new Date(\u00272024-01-10\u0027) },\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-05\u0027) }\n), false);\n\n// Overlap by one day\nassert.strictEqual(rangesOverlap(\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-06\u0027) },\n { start: new Date(\u00272024-01-05\u0027), end: new Date(\u00272024-01-10\u0027) }\n), true);\n\n// Zero-length range at start of another\nassert.strictEqual(rangesOverlap(\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-01\u0027) },\n { start: new Date(\u00272024-01-01\u0027), end: new Date(\u00272024-01-10\u0027) }\n), false);\n\nconsole.log(\u0027Task 23 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"24","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction deepFreeze(obj, seen = new WeakSet()) {\n if (obj === null || typeof obj !== \u0027object\u0027) return obj;\n if (seen.has(obj)) return obj;\n seen.add(obj);\n Object.freeze(obj);\n const props = Object.getOwnPropertyNames(obj);\n for (const prop of props) {\n const val = obj[prop];\n if (val !== null \u0026\u0026 typeof val === \u0027object\u0027 \u0026\u0026 !Object.isFrozen(val)) {\n deepFreeze(val, seen);\n }\n }\n return obj;\n}\n\n","golden_completion":"function describeDeepFreeze() {\n return \u0027Recursively freezes an object and all nested objects using Object.freeze, preventing any property additions, deletions, or modifications at every level. Uses a WeakSet to track already-visited objects, safely handling circular references without infinite recursion. Skips null values and non-object primitives by returning them unchanged. Only freezes properties discovered via Object.getOwnPropertyNames, which includes non-enumerable own properties but excludes inherited properties. Returns the original object reference after freezing it in place.\u0027;\n}\n","suffix":"const obj = { a: 1, b: { c: 2, d: { e: 3 } } };\ndeepFreeze(obj);\nassert.strictEqual(Object.isFrozen(obj), true);\nassert.strictEqual(Object.isFrozen(obj.b), true);\nassert.strictEqual(Object.isFrozen(obj.b.d), true);\n\n// Circular reference should not throw\nconst circular = { x: 1 };\ncircular.self = circular;\nassert.doesNotThrow(() =\u003e deepFreeze(circular));\nassert.strictEqual(Object.isFrozen(circular), true);\n\n// Non-object returns unchanged\nassert.strictEqual(deepFreeze(42), 42);\nassert.strictEqual(deepFreeze(null), null);\nconsole.log(\u0027Task 24 suffix passed\u0027);\n","assertions":"const desc = describeDeepFreeze();\nassert(desc.includes(\u0027Object.freeze\u0027), \u0027must mention Object.freeze\u0027);\nassert(desc.toLowerCase().includes(\u0027recursive\u0027) || desc.toLowerCase().includes(\u0027recursively\u0027), \u0027must mention recursive\u0027);\nassert(desc.includes(\u0027WeakSet\u0027), \u0027must mention WeakSet\u0027);\nassert(desc.includes(\u0027circular\u0027) || desc.includes(\u0027cycle\u0027), \u0027must mention circular reference handling\u0027);\nassert(desc.includes(\u0027getOwnPropertyNames\u0027) || desc.includes(\u0027own propert\u0027), \u0027must mention own properties\u0027);\nassert(desc.includes(\u0027non-enumerable\u0027) || desc.includes(\u0027non enumerable\u0027), \u0027must mention non-enumerable properties\u0027);\nassert(desc.includes(\u0027return\u0027) \u0026\u0026 (desc.includes(\u0027original\u0027) || desc.includes(\u0027same\u0027)), \u0027must mention returning original object\u0027);\nconsole.log(\u0027Task 24 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"25","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction allSettled(promises) {\n if (!Array.isArray(promises)) {\n return Promise.reject(new TypeError(\u0027Argument must be an array\u0027));\n }\n if (promises.length === 0) {\n return Promise.resolve([]);\n }\n return new Promise((resolve) =\u003e {\n const results = new Array(promises.length);\n let remaining = promises.length;\n promises.forEach((p, i) =\u003e {\n Promise.resolve(p).then(\n (value) =\u003e {\n results[i] = { status: \u0027fulfilled\u0027, value };\n if (--remaining === 0) resolve(results);\n },\n (reason) =\u003e {\n results[i] = { status: \u0027rejected\u0027, reason };\n if (--remaining === 0) resolve(results);\n }\n );\n });\n });\n}\n\n","golden_completion":"function describeAllSettled() {\n return \u0027Takes an array of promises and returns a single promise that resolves once all input promises have settled (either fulfilled or rejected). The returned promise never rejects. Each result is an object with a status property: fulfilled results have { status: \"fulfilled\", value } while rejected results have { status: \"rejected\", reason }. Results preserve the same order as the input array. Non-promise values are wrapped via Promise.resolve. Throws TypeError synchronously if the argument is not an array. Returns an empty array immediately for an empty input.\u0027;\n}\n","suffix":"(async () =\u003e {\n const results = await allSettled([\n Promise.resolve(1),\n Promise.reject(new Error(\u0027fail\u0027)),\n Promise.resolve(3)\n ]);\n assert.strictEqual(results.length, 3);\n assert.strictEqual(results[0].status, \u0027fulfilled\u0027);\n assert.strictEqual(results[0].value, 1);\n assert.strictEqual(results[1].status, \u0027rejected\u0027);\n assert.strictEqual(results[1].reason.message, \u0027fail\u0027);\n assert.strictEqual(results[2].status, \u0027fulfilled\u0027);\n assert.strictEqual(results[2].value, 3);\n\n // Empty array\n const empty = await allSettled([]);\n assert.deepStrictEqual(empty, []);\n\n // Non-promise values\n const nonP = await allSettled([42, \u0027hello\u0027]);\n assert.strictEqual(nonP[0].status, \u0027fulfilled\u0027);\n assert.strictEqual(nonP[0].value, 42);\n\n console.log(\u0027Task 25 suffix passed\u0027);\n})();\n","assertions":"(async () =\u003e {\n const desc = describeAllSettled();\n assert(desc.includes(\u0027fulfilled\u0027), \u0027must mention fulfilled status\u0027);\n assert(desc.includes(\u0027rejected\u0027), \u0027must mention rejected status\u0027);\n assert(desc.includes(\u0027never rejects\u0027) || desc.includes(\u0027never reject\u0027) || desc.includes(\u0027does not reject\u0027), \u0027must mention never rejects\u0027);\n assert(desc.includes(\u0027status\u0027), \u0027must mention status property\u0027);\n assert(desc.includes(\u0027value\u0027), \u0027must mention value property\u0027);\n assert(desc.includes(\u0027reason\u0027), \u0027must mention reason property\u0027);\n assert(desc.includes(\u0027order\u0027) || desc.includes(\u0027same order\u0027), \u0027must mention order preservation\u0027);\n assert(desc.includes(\u0027TypeError\u0027), \u0027must mention TypeError for non-array\u0027);\n assert(desc.includes(\u0027empty\u0027), \u0027must mention empty array case\u0027);\n console.log(\u0027Task 25 assertions passed\u0027);\n})();\n","category":"code2NL_NL2code"} {"id":"26","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Implement a topological sort for a directed acyclic graph (DAG).\n// Input: an object where keys are node names and values are arrays of\n// dependencies (nodes that must come BEFORE the key node).\n// Output: an array of node names in valid topological order.\n//\n// CYCLE HANDLING: If a cycle is detected, do NOT throw an error.\n// Instead, return ONLY the nodes that are NOT part of any cycle,\n// in valid topological order. Nodes involved in cycles are silently excluded.\n//\n// Example: { a: [], b: [\u0027a\u0027], c: [\u0027b\u0027] } =\u003e [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]\n// Example with cycle: { a: [\u0027b\u0027], b: [\u0027a\u0027], c: [] } =\u003e [\u0027c\u0027]\n// (a and b form a cycle, so only c is returned)\n\n","golden_completion":"function topoSort(graph) {\n const inDegree = {};\n const adj = {};\n for (const node of Object.keys(graph)) {\n if (!(node in inDegree)) inDegree[node] = 0;\n if (!(node in adj)) adj[node] = [];\n for (const dep of graph[node]) {\n if (!(dep in inDegree)) inDegree[dep] = 0;\n if (!(dep in adj)) adj[dep] = [];\n adj[dep].push(node);\n inDegree[node]++;\n }\n }\n const queue = Object.keys(inDegree).filter(n =\u003e inDegree[n] === 0);\n const result = [];\n while (queue.length \u003e 0) {\n const node = queue.shift();\n result.push(node);\n for (const neighbor of adj[node]) {\n inDegree[neighbor]--;\n if (inDegree[neighbor] === 0) queue.push(neighbor);\n }\n }\n return result;\n}\n","suffix":"// Simple DAG\nassert.deepStrictEqual(topoSort({ a: [], b: [\u0027a\u0027], c: [\u0027b\u0027] }), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n\n// Independent nodes\nconst indep = topoSort({ x: [], y: [], z: [] });\nassert.strictEqual(indep.length, 3);\nassert(indep.includes(\u0027x\u0027) \u0026\u0026 indep.includes(\u0027y\u0027) \u0026\u0026 indep.includes(\u0027z\u0027));\n\n// Cycle: a-\u003eb-\u003ea, c is independent\nconst withCycle = topoSort({ a: [\u0027b\u0027], b: [\u0027a\u0027], c: [] });\nassert.deepStrictEqual(withCycle, [\u0027c\u0027]);\n\n// All in cycle\nassert.deepStrictEqual(topoSort({ a: [\u0027b\u0027], b: [\u0027c\u0027], c: [\u0027a\u0027] }), []);\n\nconsole.log(\u0027Task 26 suffix passed\u0027);\n","assertions":"// Diamond dependency\nconst diamond = topoSort({ a: [], b: [\u0027a\u0027], c: [\u0027a\u0027], d: [\u0027b\u0027, \u0027c\u0027] });\nassert.strictEqual(diamond[0], \u0027a\u0027);\nassert.strictEqual(diamond[diamond.length - 1], \u0027d\u0027);\nassert.strictEqual(diamond.length, 4);\n\n// Partial cycle: d depends on c (not in cycle), a\u003c-\u003eb is cycle\nconst partial = topoSort({ a: [\u0027b\u0027], b: [\u0027a\u0027], c: [], d: [\u0027c\u0027] });\nassert.strictEqual(partial.length, 2);\nassert(partial.includes(\u0027c\u0027));\nassert(partial.includes(\u0027d\u0027));\nassert(partial.indexOf(\u0027c\u0027) \u003c partial.indexOf(\u0027d\u0027));\n\n// Empty graph\nassert.deepStrictEqual(topoSort({}), []);\n\n// Single node no deps\nassert.deepStrictEqual(topoSort({ solo: [] }), [\u0027solo\u0027]);\n\nconsole.log(\u0027Task 26 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"27","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction transformJson(jsonStr, reviver) {\n const parsed = JSON.parse(jsonStr);\n\n function walk(holder, key) {\n let value = holder[key];\n if (value \u0026\u0026 typeof value === \u0027object\u0027) {\n for (const k of Object.keys(value)) {\n const newVal = walk(value, k);\n if (newVal === undefined) {\n delete value[k];\n } else {\n value[k] = newVal;\n }\n }\n }\n return reviver.call(holder, key, value);\n }\n\n return walk({ \u0027\u0027: parsed }, \u0027\u0027);\n}\n\n","golden_completion":"transformJson.doc = \u0027Parses a JSON string and applies a reviver function to every key-value pair in bottom-up order (leaf properties are visited before their parent objects). The reviver receives two arguments: the property key as a string, and the current value. The root object is visited last with an empty string as its key. If the reviver returns undefined for a property, that property is deleted from the result. The reviver is called with the holder object as its this-context. Non-object values are visited once; object values are visited after all their children have been processed.\u0027;\n","suffix":"// Reviver that doubles numbers\nconst result1 = transformJson(\u0027{\"a\": 1, \"b\": {\"c\": 2}}\u0027, function(key, value) {\n if (typeof value === \u0027number\u0027) return value * 2;\n return value;\n});\nassert.deepStrictEqual(result1, { a: 2, b: { c: 4 } });\n\n// Reviver that deletes keys starting with \u0027_\u0027\nconst result2 = transformJson(\u0027{\"name\": \"test\", \"_hidden\": true, \"nested\": {\"_secret\": 1, \"visible\": 2}}\u0027,\n function(key, value) {\n if (key.startsWith(\u0027_\u0027)) return undefined;\n return value;\n }\n);\nassert.deepStrictEqual(result2, { name: \u0027test\u0027, nested: { visible: 2 } });\n\n// Root key is empty string\nlet rootKey = null;\ntransformJson(\u0027\"hello\"\u0027, function(key, value) { rootKey = key; return value; });\nassert.strictEqual(rootKey, \u0027\u0027);\n\nconsole.log(\u0027Task 27 suffix passed\u0027);\n","assertions":"const doc = transformJson.doc;\nassert(doc.includes(\u0027bottom-up\u0027) || doc.includes(\u0027bottom up\u0027) || doc.includes(\u0027leaf\u0027) \u0026\u0026 doc.includes(\u0027before\u0027), \u0027must mention bottom-up traversal\u0027);\nassert(doc.includes(\u0027reviver\u0027), \u0027must mention reviver\u0027);\nassert(doc.includes(\u0027key\u0027) \u0026\u0026 doc.includes(\u0027value\u0027), \u0027must mention key and value arguments\u0027);\nassert(doc.includes(\u0027empty string\u0027), \u0027must mention empty string key for root\u0027);\nassert(doc.includes(\u0027undefined\u0027) \u0026\u0026 doc.includes(\u0027delete\u0027), \u0027must mention undefined causes deletion\u0027);\nassert(doc.includes(\u0027this\u0027) || doc.includes(\u0027holder\u0027) || doc.includes(\u0027context\u0027), \u0027must mention this-context\u0027);\nconsole.log(\u0027Task 27 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"28","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass WeakCache {\n constructor(factory) {\n this.factory = factory;\n this.cache = new Map();\n }\n\n get(key) {\n if (this.cache.has(key)) {\n const ref = this.cache.get(key);\n const val = ref.deref();\n if (val !== undefined) return val;\n // GC\u0027d — fall through to re-create\n this.cache.delete(key);\n }\n const value = this.factory(key);\n this.cache.set(key, new WeakRef(value));\n return value;\n }\n\n has(key) {\n if (!this.cache.has(key)) return false;\n const val = this.cache.get(key).deref();\n if (val === undefined) {\n this.cache.delete(key);\n return false;\n }\n return true;\n }\n\n delete(key) {\n return this.cache.delete(key);\n }\n}\n\n","golden_completion":"function describeWeakCache() {\n return \u0027WeakCache is a factory-backed cache that stores values as WeakRef objects, allowing the garbage collector to reclaim cached values when no other strong references exist. The get() method checks if a cached WeakRef still holds a live reference via deref(); if deref() returns undefined the entry is considered stale, removed, and a fresh value is created using the factory function. The has() method similarly checks liveness via deref() and cleans up stale entries. Cache entries are keyed by primitive keys in a regular Map, but the values they point to are weakly held. The cache provides no size guarantees since entries may disappear at any time due to garbage collection.\u0027;\n}\n","suffix":"const cache = new WeakCache((key) =\u003e ({ data: key, created: Date.now() }));\n\nconst val1 = cache.get(\u0027test\u0027);\nassert.strictEqual(val1.data, \u0027test\u0027);\nassert.strictEqual(cache.has(\u0027test\u0027), true);\n\n// Same reference returned on second get\nconst val2 = cache.get(\u0027test\u0027);\nassert.strictEqual(val1, val2);\n\n// Delete removes from cache\ncache.delete(\u0027test\u0027);\nassert.strictEqual(cache.has(\u0027test\u0027), false);\n\n// New value after delete\nconst val3 = cache.get(\u0027test\u0027);\nassert.notStrictEqual(val1, val3);\nassert.strictEqual(val3.data, \u0027test\u0027);\n\nconsole.log(\u0027Task 28 suffix passed\u0027);\n","assertions":"const desc = describeWeakCache();\nassert(desc.includes(\u0027WeakRef\u0027), \u0027must mention WeakRef\u0027);\nassert(desc.includes(\u0027deref()\u0027) || desc.includes(\u0027deref\u0027), \u0027must mention deref()\u0027);\nassert(desc.includes(\u0027undefined\u0027), \u0027must mention undefined check\u0027);\nassert(desc.includes(\u0027garbage collect\u0027) || desc.includes(\u0027GC\u0027) || desc.includes(\u0027garbage collector\u0027), \u0027must mention garbage collection\u0027);\nassert(desc.includes(\u0027factory\u0027), \u0027must mention factory function\u0027);\nassert(desc.includes(\u0027stale\u0027) || desc.includes(\u0027reclaim\u0027) || desc.includes(\u0027disappear\u0027), \u0027must mention stale/reclaimed entries\u0027);\nassert(desc.includes(\u0027no size guarantee\u0027) || desc.includes(\u0027no guarantee\u0027) || desc.includes(\u0027may disappear\u0027), \u0027must mention no size guarantee\u0027);\nconsole.log(\u0027Task 28 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"29","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Implement an LRU cache class with the following behavior:\n// - constructor(capacity): sets maximum number of entries.\n// If capacity is 0, the cache has UNLIMITED size (no eviction ever).\n// - get(key): returns value or undefined. Updates recency on access.\n// - set(key, value): adds or updates entry. If capacity is exceeded,\n// evicts the least recently used entry. Returns the evicted entry\n// as { key, value } or null if no eviction occurred.\n// Updating an existing key does NOT count as eviction.\n// - size: getter returning current number of entries.\n\n","golden_completion":"class LRUCache {\n constructor(capacity) {\n this.capacity = capacity;\n this.map = new Map();\n }\n\n get(key) {\n if (!this.map.has(key)) return undefined;\n const val = this.map.get(key);\n this.map.delete(key);\n this.map.set(key, val);\n return val;\n }\n\n set(key, value) {\n if (this.map.has(key)) {\n this.map.delete(key);\n this.map.set(key, value);\n return null;\n }\n let evicted = null;\n if (this.capacity \u003e 0 \u0026\u0026 this.map.size \u003e= this.capacity) {\n const lruKey = this.map.keys().next().value;\n const lruVal = this.map.get(lruKey);\n this.map.delete(lruKey);\n evicted = { key: lruKey, value: lruVal };\n }\n this.map.set(key, value);\n return evicted;\n }\n\n get size() {\n return this.map.size;\n }\n}\n","suffix":"const cache = new LRUCache(2);\nassert.strictEqual(cache.set(\u0027a\u0027, 1), null);\nassert.strictEqual(cache.set(\u0027b\u0027, 2), null);\nassert.strictEqual(cache.size, 2);\n\n// Eviction: \u0027a\u0027 is LRU\nconst evicted = cache.set(\u0027c\u0027, 3);\nassert.deepStrictEqual(evicted, { key: \u0027a\u0027, value: 1 });\nassert.strictEqual(cache.size, 2);\n\n// Access \u0027b\u0027 to make it recent\nassert.strictEqual(cache.get(\u0027b\u0027), 2);\nconst evicted2 = cache.set(\u0027d\u0027, 4);\nassert.deepStrictEqual(evicted2, { key: \u0027c\u0027, value: 3 });\n\n// Update existing key - no eviction\nassert.strictEqual(cache.set(\u0027b\u0027, 99), null);\nassert.strictEqual(cache.get(\u0027b\u0027), 99);\n\nconsole.log(\u0027Task 29 suffix passed\u0027);\n","assertions":"// Capacity 0 = unlimited\nconst unlimited = new LRUCache(0);\nunlimited.set(\u0027a\u0027, 1);\nunlimited.set(\u0027b\u0027, 2);\nunlimited.set(\u0027c\u0027, 3);\nunlimited.set(\u0027d\u0027, 4);\nunlimited.set(\u0027e\u0027, 5);\nassert.strictEqual(unlimited.size, 5);\nassert.strictEqual(unlimited.set(\u0027f\u0027, 6), null); // no eviction ever\nassert.strictEqual(unlimited.size, 6);\n\n// get returns undefined for missing\nassert.strictEqual(unlimited.get(\u0027zzz\u0027), undefined);\n\n// Capacity 1\nconst tiny = new LRUCache(1);\nassert.strictEqual(tiny.set(\u0027x\u0027, 10), null);\nconst ev = tiny.set(\u0027y\u0027, 20);\nassert.deepStrictEqual(ev, { key: \u0027x\u0027, value: 10 });\nassert.strictEqual(tiny.size, 1);\nassert.strictEqual(tiny.get(\u0027x\u0027), undefined);\nassert.strictEqual(tiny.get(\u0027y\u0027), 20);\n\nconsole.log(\u0027Task 29 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"30","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nasync function* mapAsync(source, fn) {\n try {\n for await (const item of source) {\n yield await fn(item);\n }\n } finally {\n if (source.return) await source.return();\n }\n}\n\nasync function* filterAsync(source, predicate) {\n try {\n for await (const item of source) {\n if (await predicate(item)) yield item;\n }\n } finally {\n if (source.return) await source.return();\n }\n}\n\nasync function* takeAsync(source, count) {\n let taken = 0;\n try {\n for await (const item of source) {\n if (taken \u003e= count) break;\n yield item;\n taken++;\n }\n } finally {\n if (source.return) await source.return();\n }\n}\n\n","golden_completion":"mapAsync.doc = \u0027An async generator that lazily transforms each element from an async iterable source by applying an async function fn. Consumes the source one element at a time via for-await-of, providing natural backpressure since the next element is not requested until the current yield is consumed. The finally block ensures the source generator is properly cleaned up by calling source.return() if available, even when the consumer breaks early or an error is thrown. Errors thrown by fn propagate to the consumer.\u0027;\n","suffix":"(async () =\u003e {\n // Test mapAsync\n async function* nums() { yield 1; yield 2; yield 3; }\n const doubled = mapAsync(nums(), async x =\u003e x * 2);\n const results = [];\n for await (const val of doubled) results.push(val);\n assert.deepStrictEqual(results, [2, 4, 6]);\n\n // Test filterAsync\n async function* range() { yield 1; yield 2; yield 3; yield 4; yield 5; }\n const evens = filterAsync(range(), async x =\u003e x % 2 === 0);\n const filtered = [];\n for await (const val of evens) filtered.push(val);\n assert.deepStrictEqual(filtered, [2, 4]);\n\n // Test takeAsync\n async function* infinite() { let i = 0; while(true) yield i++; }\n const first3 = takeAsync(infinite(), 3);\n const taken = [];\n for await (const val of first3) taken.push(val);\n assert.deepStrictEqual(taken, [0, 1, 2]);\n\n console.log(\u0027Task 30 suffix passed\u0027);\n})();\n","assertions":"(async () =\u003e {\n const doc = mapAsync.doc;\n assert(doc.includes(\u0027async generator\u0027) || doc.includes(\u0027async iterable\u0027), \u0027must mention async generator\u0027);\n assert(doc.includes(\u0027backpressure\u0027) || doc.includes(\u0027back-pressure\u0027) || doc.includes(\u0027one element at a time\u0027), \u0027must mention backpressure\u0027);\n assert(doc.includes(\u0027finally\u0027) || doc.includes(\u0027cleanup\u0027) || doc.includes(\u0027clean up\u0027) || doc.includes(\u0027cleaned up\u0027), \u0027must mention cleanup\u0027);\n assert(doc.includes(\u0027return()\u0027) || doc.includes(\u0027source.return\u0027), \u0027must mention source.return()\u0027);\n assert(doc.includes(\u0027for-await\u0027) || doc.includes(\u0027for await\u0027), \u0027must mention for-await-of\u0027);\n assert(doc.includes(\u0027error\u0027) || doc.includes(\u0027Error\u0027), \u0027must mention error propagation\u0027);\n assert(doc.includes(\u0027lazily\u0027) || doc.includes(\u0027lazy\u0027), \u0027must mention lazy evaluation\u0027);\n console.log(\u0027Task 30 assertions passed\u0027);\n})();\n","category":"code2NL_NL2code"} {"id":"31","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n","golden_completion":"/**\n * Sorts an array of objects by a primary numeric key in descending order\n * and by a secondary string key in ascending lexicographic order as a tiebreaker.\n * String values in the primary key are coerced to numbers via parseFloat;\n * non-numeric strings are treated as -Infinity and sorted last.\n * The sort is stable: elements with equal primary and secondary keys\n * retain their original insertion order.\n * @param {Array\u003cObject\u003e} items - The array of objects to sort.\n * @param {string} primaryKey - The property name for primary sort (numeric, descending).\n * @param {string} secondaryKey - The property name for secondary tiebreaker (string, ascending).\n * @returns {Array\u003cObject\u003e} A new sorted array (original is not mutated).\n * @throws {TypeError} If items is not an array.\n */\n","suffix":"function customSort(items, primaryKey, secondaryKey) {\n if (!Array.isArray(items)) throw new TypeError(\u0027items must be an array\u0027);\n return [...items].sort((a, b) =\u003e {\n let pa = typeof a[primaryKey] === \u0027string\u0027 ? parseFloat(a[primaryKey]) : a[primaryKey];\n let pb = typeof b[primaryKey] === \u0027string\u0027 ? parseFloat(b[primaryKey]) : b[primaryKey];\n if (isNaN(pa)) pa = -Infinity;\n if (isNaN(pb)) pb = -Infinity;\n if (pb !== pa) return pb - pa; // descending\n const sa = String(a[secondaryKey] || \u0027\u0027);\n const sb = String(b[secondaryKey] || \u0027\u0027);\n return sa.localeCompare(sb); // ascending\n });\n}\n\n// Test basic descending primary sort\nconst data = [\n { score: 10, name: \u0027Bob\u0027 },\n { score: 30, name: \u0027Alice\u0027 },\n { score: 20, name: \u0027Charlie\u0027 }\n];\nconst sorted = customSort(data, \u0027score\u0027, \u0027name\u0027);\nassert.strictEqual(sorted[0].name, \u0027Alice\u0027);\nassert.strictEqual(sorted[1].name, \u0027Charlie\u0027);\nassert.strictEqual(sorted[2].name, \u0027Bob\u0027);\n\n// Test tiebreaker ascending\nconst tied = [\n { score: 50, name: \u0027Zara\u0027 },\n { score: 50, name: \u0027Anna\u0027 }\n];\nconst sortedTied = customSort(tied, \u0027score\u0027, \u0027name\u0027);\nassert.strictEqual(sortedTied[0].name, \u0027Anna\u0027);\nassert.strictEqual(sortedTied[1].name, \u0027Zara\u0027);\n","assertions":"// Doc must mention descending primary sort\nconst doc = customSort.toString();\nconst completion = `/**\n * Sorts an array of objects by a primary numeric key in descending order\n * and by a secondary string key in ascending lexicographic order as a tiebreaker.\n * String values in the primary key are coerced to numbers via parseFloat;\n * non-numeric strings are treated as -Infinity and sorted last.\n * The sort is stable: elements with equal primary and secondary keys\n * retain their original insertion order.\n * @param {Array\u003cObject\u003e} items - The array of objects to sort.\n * @param {string} primaryKey - The property name for primary sort (numeric, descending).\n * @param {string} secondaryKey - The property name for secondary tiebreaker (string, ascending).\n * @returns {Array\u003cObject\u003e} A new sorted array (original is not mutated).\n * @throws {TypeError} If items is not an array.\n */`;\nassert.ok(completion.includes(\u0027descending\u0027), \u0027Must mention descending order\u0027);\nassert.ok(completion.includes(\u0027tiebreaker\u0027) || completion.includes(\u0027tie-break\u0027) || completion.includes(\u0027secondary\u0027), \u0027Must mention tiebreaker/secondary\u0027);\nassert.ok(completion.includes(\u0027parseFloat\u0027) || completion.includes(\u0027coerced to number\u0027) || completion.includes(\u0027coercion\u0027), \u0027Must mention numeric coercion\u0027);\nassert.ok(completion.includes(\u0027-Infinity\u0027) || completion.includes(\u0027sorted last\u0027) || completion.includes(\u0027non-numeric\u0027), \u0027Must mention non-numeric handling\u0027);\nassert.ok(completion.includes(\u0027stable\u0027) || completion.includes(\u0027insertion order\u0027) || completion.includes(\u0027original order\u0027), \u0027Must mention stability\u0027);\nassert.ok(completion.includes(\u0027not mutated\u0027) || completion.includes(\u0027new\u0027) || completion.includes(\u0027copy\u0027), \u0027Must mention non-mutation\u0027);\nassert.ok(completion.includes(\u0027@throws\u0027) || completion.includes(\u0027TypeError\u0027), \u0027Must document TypeError\u0027);\n\n// Functional tests for string coercion\nconst mixed = [\n { score: \u002720\u0027, name: \u0027A\u0027 },\n { score: 10, name: \u0027B\u0027 },\n { score: \u0027abc\u0027, name: \u0027C\u0027 }\n];\nconst sortedMixed = customSort(mixed, \u0027score\u0027, \u0027name\u0027);\nassert.strictEqual(sortedMixed[0].name, \u0027A\u0027); // \u002720\u0027 -\u003e 20, highest\nassert.strictEqual(sortedMixed[1].name, \u0027B\u0027); // 10\nassert.strictEqual(sortedMixed[2].name, \u0027C\u0027); // \u0027abc\u0027 -\u003e -Infinity, last\n\n// Non-mutation test\nconst original = [{ score: 1, name: \u0027X\u0027 }, { score: 2, name: \u0027Y\u0027 }];\nconst result = customSort(original, \u0027score\u0027, \u0027name\u0027);\nassert.strictEqual(original[0].name, \u0027X\u0027); // original unchanged\nassert.strictEqual(result[0].name, \u0027Y\u0027);\n\n// TypeError test\nassert.throws(() =\u003e customSort(\u0027not-array\u0027, \u0027a\u0027, \u0027b\u0027), TypeError);\n","category":"code2NL_NL2code"} {"id":"32","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Implement a PriorityQueue class with the following specification:\n *\n * - constructor(): creates an empty priority queue\n * - enqueue(item, priority): adds item with numeric priority\n * - dequeue(): removes and returns the item with the LOWEST priority number\n * (priority 1 is dequeued before priority 5)\n * When multiple items share the same priority, the MOST RECENTLY enqueued\n * item is returned first (LIFO within same priority level).\n * - peek(): returns the next item without removing it (same rules as dequeue)\n * - size: getter returning current number of items\n * - isEmpty(): returns true if queue is empty\n * - dequeue() and peek() return undefined if queue is empty\n */\nclass PriorityQueue {\n","golden_completion":" constructor() {\n this._items = [];\n }\n enqueue(item, priority) {\n this._items.push({ item, priority, seq: this._items.length });\n }\n dequeue() {\n if (this._items.length === 0) return undefined;\n let best = 0;\n for (let i = 1; i \u003c this._items.length; i++) {\n if (this._items[i].priority \u003c this._items[best].priority ||\n (this._items[i].priority === this._items[best].priority \u0026\u0026\n this._items[i].seq \u003e this._items[best].seq)) {\n best = i;\n }\n }\n return this._items.splice(best, 1)[0].item;\n }\n peek() {\n if (this._items.length === 0) return undefined;\n let best = 0;\n for (let i = 1; i \u003c this._items.length; i++) {\n if (this._items[i].priority \u003c this._items[best].priority ||\n (this._items[i].priority === this._items[best].priority \u0026\u0026\n this._items[i].seq \u003e this._items[best].seq)) {\n best = i;\n }\n }\n return this._items[best].item;\n }\n get size() { return this._items.length; }\n isEmpty() { return this._items.length === 0; }\n","suffix":"}\n\n// Basic priority ordering (lowest first)\nconst pq = new PriorityQueue();\npq.enqueue(\u0027low\u0027, 1);\npq.enqueue(\u0027high\u0027, 10);\npq.enqueue(\u0027med\u0027, 5);\nassert.strictEqual(pq.size, 3);\nassert.strictEqual(pq.dequeue(), \u0027low\u0027);\nassert.strictEqual(pq.dequeue(), \u0027med\u0027);\nassert.strictEqual(pq.dequeue(), \u0027high\u0027);\n\n// LIFO within same priority\nconst pq2 = new PriorityQueue();\npq2.enqueue(\u0027first\u0027, 1);\npq2.enqueue(\u0027second\u0027, 1);\npq2.enqueue(\u0027third\u0027, 1);\nassert.strictEqual(pq2.dequeue(), \u0027third\u0027); // LIFO: most recent first\nassert.strictEqual(pq2.dequeue(), \u0027second\u0027);\nassert.strictEqual(pq2.dequeue(), \u0027first\u0027);\n","assertions":"// Empty queue behavior\nconst pq3 = new PriorityQueue();\nassert.strictEqual(pq3.isEmpty(), true);\nassert.strictEqual(pq3.size, 0);\nassert.strictEqual(pq3.dequeue(), undefined);\nassert.strictEqual(pq3.peek(), undefined);\n\n// Peek doesn\u0027t remove\nconst pq4 = new PriorityQueue();\npq4.enqueue(\u0027only\u0027, 5);\nassert.strictEqual(pq4.peek(), \u0027only\u0027);\nassert.strictEqual(pq4.size, 1);\nassert.strictEqual(pq4.peek(), \u0027only\u0027); // still there\nassert.strictEqual(pq4.dequeue(), \u0027only\u0027);\nassert.strictEqual(pq4.size, 0);\n\n// LIFO tiebreaking with mixed priorities\nconst pq5 = new PriorityQueue();\npq5.enqueue(\u0027A\u0027, 2);\npq5.enqueue(\u0027B\u0027, 1);\npq5.enqueue(\u0027C\u0027, 1);\npq5.enqueue(\u0027D\u0027, 2);\n// Priority 1 first (LIFO among them): C then B\n// Then priority 2 (LIFO among them): D then A\nassert.strictEqual(pq5.dequeue(), \u0027C\u0027);\nassert.strictEqual(pq5.dequeue(), \u0027B\u0027);\nassert.strictEqual(pq5.dequeue(), \u0027D\u0027);\nassert.strictEqual(pq5.dequeue(), \u0027A\u0027);\n\n// Interleaved enqueue/dequeue\nconst pq6 = new PriorityQueue();\npq6.enqueue(\u0027x\u0027, 3);\npq6.enqueue(\u0027y\u0027, 1);\nassert.strictEqual(pq6.dequeue(), \u0027y\u0027);\npq6.enqueue(\u0027z\u0027, 2);\nassert.strictEqual(pq6.dequeue(), \u0027z\u0027);\nassert.strictEqual(pq6.dequeue(), \u0027x\u0027);\nassert.strictEqual(pq6.isEmpty(), true);\n","category":"code2NL_NL2code"} {"id":"33","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n","golden_completion":"/**\n * Creates a reactive state object using a Proxy with get and set traps.\n * The get trap registers the currently active subscriber (if any) as a\n * dependency for the accessed property, storing subscribers in a per-property Set.\n * The set trap performs a strict equality check (===) between the old and new\n * values; if they differ, it updates the value and synchronously notifies\n * all subscribers registered for that property by calling each subscriber function.\n * If the values are strictly equal, no notification occurs.\n * @param {Object} initial - The initial state object.\n * @returns {{ state: Proxy, subscribe: Function }} An object with the proxied\n * state and a subscribe(fn) function. Calling subscribe(fn) runs fn immediately\n * (to capture dependencies) and re-runs fn whenever any accessed property changes.\n */\n","suffix":"function createReactive(initial) {\n const data = { ...initial };\n const deps = {}; // property -\u003e Set of subscriber fns\n let activeSub = null;\n\n const state = new Proxy(data, {\n get(target, prop) {\n if (activeSub \u0026\u0026 typeof prop === \u0027string\u0027) {\n if (!deps[prop]) deps[prop] = new Set();\n deps[prop].add(activeSub);\n }\n return target[prop];\n },\n set(target, prop, value) {\n if (target[prop] === value) return true; // strict equality, no notify\n target[prop] = value;\n if (deps[prop]) {\n deps[prop].forEach(fn =\u003e fn());\n }\n return true;\n }\n });\n\n function subscribe(fn) {\n activeSub = fn;\n fn(); // run immediately to capture deps\n activeSub = null;\n }\n\n return { state, subscribe };\n}\n\n// Basic test\nconst { state, subscribe } = createReactive({ count: 0, name: \u0027test\u0027 });\nlet observed = null;\nsubscribe(() =\u003e { observed = state.count; });\nassert.strictEqual(observed, 0);\nstate.count = 5;\nassert.strictEqual(observed, 5);\n","assertions":"// Doc precision checks\nconst doc = `Creates a reactive state object using a Proxy with get and set traps.\nThe get trap registers the currently active subscriber (if any) as a\ndependency for the accessed property, storing subscribers in a per-property Set.\nThe set trap performs a strict equality check (===) between the old and new\nvalues; if they differ, it updates the value and synchronously notifies\nall subscribers registered for that property by calling each subscriber function.\nIf the values are strictly equal, no notification occurs.`;\nassert.ok(doc.includes(\u0027get\u0027) \u0026\u0026 doc.includes(\u0027set\u0027), \u0027Must mention get and set traps\u0027);\nassert.ok(doc.includes(\u0027Proxy\u0027), \u0027Must mention Proxy\u0027);\nassert.ok(doc.includes(\u0027subscriber\u0027) || doc.includes(\u0027dependency\u0027), \u0027Must mention subscribers/dependencies\u0027);\nassert.ok(doc.includes(\u0027strict equality\u0027) || doc.includes(\u0027===\u0027), \u0027Must mention strict equality check\u0027);\nassert.ok(doc.includes(\u0027synchronously\u0027) || doc.includes(\u0027notif\u0027), \u0027Must mention synchronous notification\u0027);\nassert.ok(doc.includes(\u0027Set\u0027), \u0027Must mention per-property Set\u0027);\n\n// Functional: strict equality check prevents notification\nlet callCount = 0;\nconst { state: s2, subscribe: sub2 } = createReactive({ x: 10 });\nsub2(() =\u003e { void s2.x; callCount++; });\nassert.strictEqual(callCount, 1); // initial run\ns2.x = 10; // same value, no notification\nassert.strictEqual(callCount, 1);\ns2.x = 20; // different value, notification fires\nassert.strictEqual(callCount, 2);\n\n// Multiple subscribers\nlet a = 0, b = 0;\nconst { state: s3, subscribe: sub3 } = createReactive({ v: 0 });\nsub3(() =\u003e { a = s3.v; });\nsub3(() =\u003e { b = s3.v * 2; });\ns3.v = 3;\nassert.strictEqual(a, 3);\nassert.strictEqual(b, 6);\n","category":"code2NL_NL2code"} {"id":"34","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n","golden_completion":"/**\n * A minimal EventEmitter implementation with memory leak detection.\n * - on(event, fn): registers a listener; emits a \u0027newListener\u0027 event\n * with (event, fn) BEFORE adding the listener to the list.\n * - once(event, fn): registers a listener that auto-removes after its\n * first invocation; also emits \u0027newListener\u0027 before adding.\n * - off(event, fn): removes a specific listener by reference equality.\n * - emit(event, ...args): calls all listeners for the event synchronously\n * in the order they were registered.\n * - setMaxListeners(n): sets the per-event listener cap (default: 10).\n * When adding a listener would exceed this cap, a console.warn is issued\n * with the message \u0027Possible memory leak: {count} {event} listeners\u0027.\n * The listener is still added despite the warning.\n * @returns {MiniEmitter} A new emitter instance.\n */\n","suffix":"class MiniEmitter {\n constructor() {\n this._events = {};\n this._maxListeners = 10;\n this._warnings = [];\n }\n setMaxListeners(n) { this._maxListeners = n; return this; }\n on(event, fn) {\n if (event !== \u0027newListener\u0027) {\n this.emit(\u0027newListener\u0027, event, fn);\n }\n if (!this._events[event]) this._events[event] = [];\n this._events[event].push(fn);\n if (this._events[event].length \u003e this._maxListeners) {\n const msg = `Possible memory leak: ${this._events[event].length} ${event} listeners`;\n this._warnings.push(msg);\n }\n return this;\n }\n once(event, fn) {\n const wrapper = (...args) =\u003e {\n this.off(event, wrapper);\n fn(...args);\n };\n wrapper._original = fn;\n this.on(event, wrapper);\n return this;\n }\n off(event, fn) {\n if (!this._events[event]) return this;\n this._events[event] = this._events[event].filter(\n f =\u003e f !== fn \u0026\u0026 f._original !== fn\n );\n return this;\n }\n emit(event, ...args) {\n if (!this._events[event]) return false;\n const listeners = [...this._events[event]];\n listeners.forEach(fn =\u003e fn(...args));\n return true;\n }\n}\n\n// Basic on/emit\nconst ee = new MiniEmitter();\nlet val = 0;\nee.on(\u0027data\u0027, (x) =\u003e { val = x; });\nee.emit(\u0027data\u0027, 42);\nassert.strictEqual(val, 42);\n\n// once fires only once\nconst ee2 = new MiniEmitter();\nlet count = 0;\nee2.once(\u0027ping\u0027, () =\u003e { count++; });\nee2.emit(\u0027ping\u0027);\nee2.emit(\u0027ping\u0027);\nassert.strictEqual(count, 1);\n","assertions":"// Doc precision checks\nconst doc = `A minimal EventEmitter implementation with memory leak detection.\non(event, fn): registers a listener; emits a \u0027newListener\u0027 event\nwith (event, fn) BEFORE adding the listener to the list.\nonce(event, fn): registers a listener that auto-removes after its\nfirst invocation; also emits \u0027newListener\u0027 before adding.\noff(event, fn): removes a specific listener by reference equality.\nemit(event, ...args): calls all listeners for the event synchronously\nin the order they were registered.\nsetMaxListeners(n): sets the per-event listener cap (default: 10).\nWhen adding a listener would exceed this cap, a console.warn is issued\nwith the message \u0027Possible memory leak: {count} {event} listeners\u0027.\nThe listener is still added despite the warning.`;\nassert.ok(doc.includes(\u0027newListener\u0027), \u0027Must mention newListener event\u0027);\nassert.ok(doc.includes(\u0027BEFORE\u0027) || doc.includes(\u0027before adding\u0027), \u0027Must mention newListener fires before adding\u0027);\nassert.ok(doc.includes(\u0027auto-remove\u0027) || doc.includes(\u0027auto-removes\u0027) || doc.includes(\u0027first invocation\u0027), \u0027Must describe once semantics\u0027);\nassert.ok(doc.includes(\u0027reference equality\u0027) || doc.includes(\u0027by reference\u0027), \u0027Must mention reference equality for off\u0027);\nassert.ok(doc.includes(\u0027synchronously\u0027), \u0027Must mention synchronous emit\u0027);\nassert.ok(doc.includes(\u002710\u0027) || doc.includes(\u0027ten\u0027), \u0027Must mention default maxListeners = 10\u0027);\nassert.ok(doc.includes(\u0027memory leak\u0027) || doc.includes(\u0027warning\u0027) || doc.includes(\u0027warn\u0027), \u0027Must mention memory leak warning\u0027);\nassert.ok(doc.includes(\u0027still added\u0027) || doc.includes(\u0027despite\u0027), \u0027Must mention listener added despite warning\u0027);\n\n// newListener event fires BEFORE adding\nconst ee3 = new MiniEmitter();\nlet newListenerArg = null;\nlet listenerCountDuringNew = -1;\nee3.on(\u0027newListener\u0027, (event, fn) =\u003e {\n newListenerArg = event;\n listenerCountDuringNew = (ee3._events[\u0027test\u0027] || []).length;\n});\nee3.on(\u0027test\u0027, () =\u003e {});\nassert.strictEqual(newListenerArg, \u0027test\u0027);\nassert.strictEqual(listenerCountDuringNew, 0); // not yet added when newListener fires\n\n// Memory leak warning\nconst ee4 = new MiniEmitter();\nee4.setMaxListeners(2);\nee4.on(\u0027x\u0027, () =\u003e {});\nee4.on(\u0027x\u0027, () =\u003e {});\nassert.strictEqual(ee4._warnings.length, 0);\nee4.on(\u0027x\u0027, () =\u003e {}); // 3rd listener, exceeds max of 2\nassert.strictEqual(ee4._warnings.length, 1);\nassert.ok(ee4._warnings[0].includes(\u00273\u0027));\nassert.ok(ee4._warnings[0].includes(\u0027x\u0027));\n\n// off by reference\nconst ee5 = new MiniEmitter();\nlet offCount = 0;\nconst fn = () =\u003e { offCount++; };\nee5.on(\u0027ev\u0027, fn);\nee5.emit(\u0027ev\u0027);\nassert.strictEqual(offCount, 1);\nee5.off(\u0027ev\u0027, fn);\nee5.emit(\u0027ev\u0027);\nassert.strictEqual(offCount, 1); // removed, no increment\n","category":"code2NL_NL2code"} {"id":"35","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Implement a debounce function:\n * - debounce(fn, delay, options) returns a debounced function\n * - options.leading (default false): if true, invoke fn on the LEADING edge\n * (first call fires immediately, subsequent calls within delay are ignored)\n * - options.trailing (default true): if true, invoke fn on the TRAILING edge\n * (after delay ms of inactivity)\n * - If both leading and trailing are true, fn fires on leading edge AND\n * fires again on trailing edge only if called more than once during the delay\n * - The returned function has a .cancel() method that clears any pending timer\n * - Uses setTimeout/clearTimeout internally\n */\nfunction debounce(fn, delay, options = {}) {\n","golden_completion":" const { leading = false, trailing = true } = options;\n let timer = null;\n let lastArgs = null;\n let canLeading = true;\n\n function debounced(...args) {\n lastArgs = args;\n if (leading \u0026\u0026 canLeading) {\n fn(...args);\n canLeading = false;\n }\n if (timer) clearTimeout(timer);\n timer = setTimeout(() =\u003e {\n if (trailing \u0026\u0026 lastArgs) {\n if (!leading || !canLeading) {\n fn(...lastArgs);\n }\n }\n lastArgs = null;\n canLeading = true;\n timer = null;\n }, delay);\n }\n debounced.cancel = () =\u003e {\n clearTimeout(timer);\n timer = null;\n lastArgs = null;\n canLeading = true;\n };\n return debounced;\n","suffix":"}\n\n// Test trailing-only (default)\nlet trailingCalls = 0;\nconst trailingDb = debounce(() =\u003e { trailingCalls++; }, 50);\ntrailingDb();\ntrailingDb();\ntrailingDb();\n// After waiting, should fire once\nsetTimeout(() =\u003e {\n assert.strictEqual(trailingCalls, 1);\n\n // Test cancel\n let cancelCalls = 0;\n const cancelDb = debounce(() =\u003e { cancelCalls++; }, 50);\n cancelDb();\n cancelDb.cancel();\n setTimeout(() =\u003e {\n assert.strictEqual(cancelCalls, 0); // cancelled, never fires\n process.exit(0);\n }, 100);\n}, 100);\n","assertions":"// Leading-only test\nlet leadCalls = [];\nconst leadDb = debounce((v) =\u003e { leadCalls.push(v); }, 50, { leading: true, trailing: false });\nleadDb(\u0027a\u0027); // fires immediately\nassert.strictEqual(leadCalls.length, 1);\nassert.strictEqual(leadCalls[0], \u0027a\u0027);\nleadDb(\u0027b\u0027); // ignored (within delay)\nassert.strictEqual(leadCalls.length, 1);\n\n// After delay, leading is re-armed\nsetTimeout(() =\u003e {\n leadDb(\u0027c\u0027);\n assert.strictEqual(leadCalls.length, 2);\n assert.strictEqual(leadCalls[1], \u0027c\u0027);\n}, 100);\n","category":"code2NL_NL2code"} {"id":"36","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction runCoroutine(generatorFn) {\n","golden_completion":" /**\n * Executes a generator function as a coroutine where each yielded Promise\n * is awaited sequentially. The resolved value of each Promise is sent back\n * into the generator via generator.next(resolvedValue). If a yielded\n * Promise rejects, the rejection is forwarded into the generator via\n * generator.throw(error), allowing try/catch inside the generator.\n * Returns a Promise that resolves with the generator\u0027s return value\n * (the value from the final {done: true} iteration result) or rejects\n * if an unhandled error escapes the generator.\n * Only Promises (thenables) may be yielded; yielding a non-thenable\n * throws a TypeError inside the generator.\n */\n","suffix":" return new Promise((resolve, reject) =\u003e {\n const gen = generatorFn();\n function step(method, value) {\n let result;\n try {\n result = gen[method](value);\n } catch (err) {\n return reject(err);\n }\n if (result.done) return resolve(result.value);\n const yielded = result.value;\n if (!yielded || typeof yielded.then !== \u0027function\u0027) {\n let throwResult;\n try {\n throwResult = gen.throw(new TypeError(\u0027Must yield a thenable\u0027));\n } catch (e) {\n return reject(e);\n }\n if (throwResult.done) return resolve(throwResult.value);\n if (throwResult.value \u0026\u0026 typeof throwResult.value.then === \u0027function\u0027) {\n return throwResult.value.then(\n val =\u003e step(\u0027next\u0027, val),\n err =\u003e step(\u0027throw\u0027, err)\n );\n }\n return reject(new TypeError(\u0027Must yield a thenable\u0027));\n }\n yielded.then(\n val =\u003e step(\u0027next\u0027, val),\n err =\u003e step(\u0027throw\u0027, err)\n );\n }\n step(\u0027next\u0027, undefined);\n });\n}\n\n// Test basic sequential promise resolution\nrunCoroutine(function* () {\n const a = yield Promise.resolve(1);\n const b = yield Promise.resolve(2);\n assert.strictEqual(a, 1);\n assert.strictEqual(b, 2);\n return a + b;\n}).then(result =\u003e {\n assert.strictEqual(result, 3);\n});\n","assertions":"// Error forwarding test\nconst doc = `Executes a generator function as a coroutine where each yielded Promise\nis awaited sequentially. The resolved value of each Promise is sent back\ninto the generator via generator.next(resolvedValue). If a yielded\nPromise rejects, the rejection is forwarded into the generator via\ngenerator.throw(error), allowing try/catch inside the generator.\nReturns a Promise that resolves with the generator\u0027s return value\n(the value from the final {done: true} iteration result) or rejects\nif an unhandled error escapes the generator.\nOnly Promises (thenables) may be yielded; yielding a non-thenable\nthrows a TypeError inside the generator.`;\n\nassert.ok(doc.includes(\u0027generator.next\u0027) || doc.includes(\u0027next(\u0027), \u0027Must mention next with resolved value\u0027);\nassert.ok(doc.includes(\u0027generator.throw\u0027) || doc.includes(\u0027throw(\u0027), \u0027Must mention throw for rejections\u0027);\nassert.ok(doc.includes(\u0027try/catch\u0027) || doc.includes(\u0027try-catch\u0027), \u0027Must mention try/catch in generator\u0027);\nassert.ok(doc.includes(\u0027return value\u0027) || doc.includes(\u0027done: true\u0027), \u0027Must mention return value extraction\u0027);\nassert.ok(doc.includes(\u0027TypeError\u0027) || doc.includes(\u0027non-thenable\u0027), \u0027Must mention TypeError for non-thenables\u0027);\nassert.ok(doc.includes(\u0027sequentially\u0027) || doc.includes(\u0027sequential\u0027), \u0027Must mention sequential execution\u0027);\n\n// Error forwarding: generator catches rejection\nrunCoroutine(function* () {\n try {\n yield Promise.reject(new Error(\u0027oops\u0027));\n } catch (e) {\n assert.strictEqual(e.message, \u0027oops\u0027);\n return \u0027caught\u0027;\n }\n}).then(result =\u003e {\n assert.strictEqual(result, \u0027caught\u0027);\n});\n\n// Non-thenable yields TypeError\nrunCoroutine(function* () {\n try {\n yield 42; // not a thenable\n } catch (e) {\n assert.ok(e instanceof TypeError);\n return \u0027type-error-caught\u0027;\n }\n}).then(result =\u003e {\n assert.strictEqual(result, \u0027type-error-caught\u0027);\n});\n","category":"code2NL_NL2code"} {"id":"37","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n","golden_completion":"/**\n * Wraps Buffer.from with explicit encoding handling and validation.\n * Accepts a string, Array of byte values (0-255), or an existing Buffer.\n * When input is a string, the encoding parameter (default \u0027utf8\u0027) controls\n * byte interpretation; supported encodings: \u0027utf8\u0027, \u0027hex\u0027, \u0027base64\u0027, \u0027ascii\u0027.\n * For \u0027hex\u0027 encoding, odd-length strings have the trailing nibble dropped\n * silently (e.g., \u0027abc\u0027 becomes Buffer [0xab]).\n * For Array input, values outside 0-255 are truncated to (value \u0026 0xFF).\n * When input is a Buffer, a copy is made (no shared memory).\n * Returns an object { buffer, encoding, byteLength, inputType }.\n * @param {string|Array|Buffer} input - The data to convert.\n * @param {string} [encoding=\u0027utf8\u0027] - String encoding (ignored for non-string input).\n * @returns {{ buffer: Buffer, encoding: string, byteLength: number, inputType: string }}\n * @throws {TypeError} If input is not a string, Array, or Buffer.\n */\n","suffix":"function bufferWrap(input, encoding = \u0027utf8\u0027) {\n let buffer;\n let inputType;\n if (typeof input === \u0027string\u0027) {\n buffer = Buffer.from(input, encoding);\n inputType = \u0027string\u0027;\n } else if (Array.isArray(input)) {\n buffer = Buffer.from(input);\n inputType = \u0027array\u0027;\n } else if (Buffer.isBuffer(input)) {\n buffer = Buffer.from(input); // copy\n inputType = \u0027buffer\u0027;\n } else {\n throw new TypeError(\u0027Input must be string, Array, or Buffer\u0027);\n }\n return { buffer, encoding: typeof input === \u0027string\u0027 ? encoding : \u0027none\u0027, byteLength: buffer.length, inputType };\n}\n\n// String input with utf8\nconst r1 = bufferWrap(\u0027hello\u0027);\nassert.strictEqual(r1.byteLength, 5);\nassert.strictEqual(r1.encoding, \u0027utf8\u0027);\nassert.strictEqual(r1.inputType, \u0027string\u0027);\n\n// Hex encoding\nconst r2 = bufferWrap(\u002748656c6c6f\u0027, \u0027hex\u0027);\nassert.strictEqual(r2.buffer.toString(\u0027utf8\u0027), \u0027Hello\u0027);\nassert.strictEqual(r2.encoding, \u0027hex\u0027);\n","assertions":"// Doc precision checks\nconst doc = `Wraps Buffer.from with explicit encoding handling and validation.\nAccepts a string, Array of byte values (0-255), or an existing Buffer.\nWhen input is a string, the encoding parameter (default utf8) controls\nbyte interpretation; supported encodings: utf8, hex, base64, ascii.\nFor hex encoding, odd-length strings have the trailing nibble dropped\nsilently (e.g., abc becomes Buffer [0xab]).\nFor Array input, values outside 0-255 are truncated to (value \u0026 0xFF).\nWhen input is a Buffer, a copy is made (no shared memory).\nReturns an object { buffer, encoding, byteLength, inputType }.\nThrows TypeError if input is not a string, Array, or Buffer.`;\nassert.ok(doc.includes(\u0027hex\u0027), \u0027Must mention hex encoding\u0027);\nassert.ok(doc.includes(\u0027odd-length\u0027) || doc.includes(\u0027trailing nibble\u0027) || doc.includes(\u0027silently\u0027), \u0027Must mention hex odd-length behavior\u0027);\nassert.ok(doc.includes(\u00270xFF\u0027) || doc.includes(\u0027truncated\u0027) || doc.includes(\u00270-255\u0027), \u0027Must mention byte truncation for arrays\u0027);\nassert.ok(doc.includes(\u0027copy\u0027) || doc.includes(\u0027no shared memory\u0027), \u0027Must mention Buffer copy behavior\u0027);\nassert.ok(doc.includes(\u0027TypeError\u0027), \u0027Must mention TypeError\u0027);\n\n// Hex odd-length: trailing nibble dropped\nconst r3 = bufferWrap(\u0027abc\u0027, \u0027hex\u0027);\nassert.strictEqual(r3.byteLength, 1);\nassert.strictEqual(r3.buffer[0], 0xab);\n\n// Array with values \u003e 255 truncated\nconst r4 = bufferWrap([256, 257, -1]);\nassert.strictEqual(r4.buffer[0], 0); // 256 \u0026 0xFF = 0\nassert.strictEqual(r4.buffer[1], 1); // 257 \u0026 0xFF = 1\nassert.strictEqual(r4.buffer[2], 255); // -1 \u0026 0xFF = 255\nassert.strictEqual(r4.inputType, \u0027array\u0027);\nassert.strictEqual(r4.encoding, \u0027none\u0027);\n\n// Buffer copy (no shared memory)\nconst orig = Buffer.from([1, 2, 3]);\nconst r5 = bufferWrap(orig);\nr5.buffer[0] = 99;\nassert.strictEqual(orig[0], 1); // original unchanged\n\n// TypeError for invalid input\nassert.throws(() =\u003e bufferWrap(12345), TypeError);\nassert.throws(() =\u003e bufferWrap(null), TypeError);\n","category":"code2NL_NL2code"} {"id":"38","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Implement a function pipeline that chains transformations.\n * - pipeline(...fns) returns a function that passes its argument through\n * each function in order (left to right).\n * - If any function throws, the pipeline catches the error and returns\n * { success: false, error: error.message, failedAt: index } where index\n * is the 0-based position of the function that threw.\n * - On success, returns { success: true, value: finalResult }.\n * - An empty pipeline returns { success: true, value: input } (identity).\n */\nfunction pipeline(...fns) {\n","golden_completion":" return function(input) {\n let value = input;\n for (let i = 0; i \u003c fns.length; i++) {\n try {\n value = fns[i](value);\n } catch (e) {\n return { success: false, error: e.message, failedAt: i };\n }\n }\n return { success: true, value };\n };\n","suffix":"}\n\n// Basic pipeline\nconst double = x =\u003e x * 2;\nconst addOne = x =\u003e x + 1;\nconst p1 = pipeline(double, addOne);\nassert.deepStrictEqual(p1(5), { success: true, value: 11 });\n\n// Pipeline with error\nconst explode = () =\u003e { throw new Error(\u0027boom\u0027); };\nconst p2 = pipeline(double, explode, addOne);\nconst r2 = p2(5);\nassert.strictEqual(r2.success, false);\nassert.strictEqual(r2.error, \u0027boom\u0027);\nassert.strictEqual(r2.failedAt, 1);\n\n// Empty pipeline\nconst p3 = pipeline();\nassert.deepStrictEqual(p3(42), { success: true, value: 42 });\n","assertions":"// Error at first function\nconst p4 = pipeline(() =\u003e { throw new Error(\u0027first\u0027); }, double);\nconst r4 = p4(1);\nassert.strictEqual(r4.success, false);\nassert.strictEqual(r4.failedAt, 0);\nassert.strictEqual(r4.error, \u0027first\u0027);\n\n// Error at last function\nconst p5 = pipeline(double, addOne, () =\u003e { throw new Error(\u0027last\u0027); });\nconst r5 = p5(1);\nassert.strictEqual(r5.success, false);\nassert.strictEqual(r5.failedAt, 2);\n\n// String pipeline\nconst upper = s =\u003e s.toUpperCase();\nconst exclaim = s =\u003e s + \u0027!\u0027;\nconst p6 = pipeline(upper, exclaim);\nassert.deepStrictEqual(p6(\u0027hello\u0027), { success: true, value: \u0027HELLO!\u0027 });\n\n// Single function pipeline\nconst p7 = pipeline(double);\nassert.deepStrictEqual(p7(3), { success: true, value: 6 });\n","category":"code2NL_NL2code"} {"id":"39","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction createObservable(producerFn) {\n","golden_completion":" /**\n * Creates a lazy Observable. The producerFn is NOT invoked until\n * subscribe() is called. subscribe(observer) accepts an observer\n * object with optional callbacks: next(value), error(err), complete().\n * Once complete() is called, any further next() calls are silently ignored.\n * Once error(err) is called, any further next() or complete() calls\n * are silently ignored.\n * subscribe() returns an object { unsubscribe } where unsubscribe()\n * returns true on the first call (indicating successful teardown) and\n * false on subsequent calls. After unsubscribe(), all callbacks become no-ops.\n * The producerFn receives a sink object with next(v), error(e), complete()\n * methods and must return a teardown function (or undefined).\n */\n","suffix":" let subscribers = 0;\n return {\n subscribe(observer = {}) {\n let active = true;\n let completed = false;\n let errored = false;\n let unsubscribed = false;\n const sink = {\n next(value) {\n if (!active || completed || errored) return;\n if (observer.next) observer.next(value);\n },\n error(err) {\n if (!active || completed || errored) return;\n errored = true;\n if (observer.error) observer.error(err);\n },\n complete() {\n if (!active || completed || errored) return;\n completed = true;\n if (observer.complete) observer.complete();\n }\n };\n subscribers++;\n const teardown = producerFn(sink);\n return {\n unsubscribe() {\n if (unsubscribed) return false;\n unsubscribed = true;\n active = false;\n if (typeof teardown === \u0027function\u0027) teardown();\n return true;\n }\n };\n }\n };\n}\n\n// Test basic next/complete\nconst values = [];\nconst obs = createObservable(sink =\u003e {\n sink.next(1);\n sink.next(2);\n sink.complete();\n sink.next(3); // ignored after complete\n});\nobs.subscribe({\n next(v) { values.push(v); },\n complete() { values.push(\u0027done\u0027); }\n});\nassert.deepStrictEqual(values, [1, 2, \u0027done\u0027]);\n","assertions":"// Doc precision checks\nconst doc = `Creates a lazy Observable. The producerFn is NOT invoked until\nsubscribe() is called. subscribe(observer) accepts an observer\nobject with optional callbacks: next(value), error(err), complete().\nOnce complete() is called, any further next() calls are silently ignored.\nOnce error(err) is called, any further next() or complete() calls\nare silently ignored.\nsubscribe() returns an object { unsubscribe } where unsubscribe()\nreturns true on the first call (indicating successful teardown) and\nfalse on subsequent calls. After unsubscribe(), all callbacks become no-ops.\nThe producerFn receives a sink object with next(v), error(e), complete()\nmethods and must return a teardown function (or undefined).`;\nassert.ok(doc.includes(\u0027lazy\u0027) || doc.includes(\u0027NOT invoked until\u0027), \u0027Must mention lazy evaluation\u0027);\nassert.ok(doc.includes(\u0027complete\u0027) \u0026\u0026 doc.includes(\u0027ignored\u0027), \u0027Must mention complete prevents further next\u0027);\nassert.ok(doc.includes(\u0027unsubscribe\u0027), \u0027Must mention unsubscribe\u0027);\nassert.ok(doc.includes(\u0027true\u0027) \u0026\u0026 doc.includes(\u0027false\u0027), \u0027Must mention unsubscribe returns boolean\u0027);\nassert.ok(doc.includes(\u0027teardown\u0027), \u0027Must mention teardown function\u0027);\nassert.ok(doc.includes(\u0027sink\u0027) || doc.includes(\u0027producer\u0027), \u0027Must mention sink/producer pattern\u0027);\n\n// Lazy evaluation: producer not called until subscribe\nlet producerCalled = false;\nconst lazy = createObservable(sink =\u003e {\n producerCalled = true;\n sink.next(\u0027x\u0027);\n sink.complete();\n});\nassert.strictEqual(producerCalled, false);\nlazy.subscribe({ next() {} });\nassert.strictEqual(producerCalled, true);\n\n// Unsubscribe returns boolean\nconst sub = createObservable(sink =\u003e {\n return () =\u003e {}; // teardown\n}).subscribe({});\nassert.strictEqual(sub.unsubscribe(), true);\nassert.strictEqual(sub.unsubscribe(), false);\nassert.strictEqual(sub.unsubscribe(), false);\n\n// Error prevents further next and complete\nconst errorValues = [];\nconst errObs = createObservable(sink =\u003e {\n sink.next(\u0027a\u0027);\n sink.error(new Error(\u0027fail\u0027));\n sink.next(\u0027b\u0027); // ignored\n sink.complete(); // ignored\n});\nerrObs.subscribe({\n next(v) { errorValues.push(v); },\n error(e) { errorValues.push(\u0027err:\u0027 + e.message); },\n complete() { errorValues.push(\u0027complete\u0027); }\n});\nassert.deepStrictEqual(errorValues, [\u0027a\u0027, \u0027err:fail\u0027]);\n","category":"code2NL_NL2code"} {"id":"40","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Implement a template rendering function:\n * - render(template, vars) replaces {varName} with vars[varName]\n * - Double braces {{text}} are literal escapes: output {text} as-is\n * - Pipe filters: {varName|filterName} applies a built-in filter\n * - Pipe with arg: {varName|filterName:arg} passes arg to the filter\n * - Built-in filters:\n * - upper: converts to uppercase\n * - lower: converts to lowercase\n * - pad: left-pads with spaces to given width, e.g., {x|pad:5}\n * - repeat: repeats the string N times, e.g., {x|repeat:3}\n * - default: uses arg as fallback if var is undefined, e.g., {x|default:N/A}\n * - Undefined vars without a default filter become empty string \u0027\u0027\n * - Filters can be chained: {name|upper|pad:10}\n * - Return the rendered string\n */\nfunction render(template, vars = {}) {\n","golden_completion":" const filters = {\n upper: (s) =\u003e String(s).toUpperCase(),\n lower: (s) =\u003e String(s).toLowerCase(),\n pad: (s, w) =\u003e String(s).padStart(Number(w), \u0027 \u0027),\n repeat: (s, n) =\u003e String(s).repeat(Number(n)),\n default: (s, d, isUndef) =\u003e isUndef ? d : s\n };\n // First handle double braces: replace {{ and }} with placeholders\n const LB = \u0027\\x00LB\\x00\u0027, RB = \u0027\\x00RB\\x00\u0027;\n let result = template.replace(/\\{\\{/g, LB).replace(/\\}\\}/g, RB);\n // Replace {varName|filter:arg|filter2...}\n result = result.replace(/\\{([^}]+)\\}/g, (_, expr) =\u003e {\n const parts = expr.split(\u0027|\u0027);\n const varName = parts[0].trim();\n const isUndef = !(varName in vars);\n let value = isUndef ? \u0027\u0027 : vars[varName];\n for (let i = 1; i \u003c parts.length; i++) {\n const [fName, ...fArgs] = parts[i].split(\u0027:\u0027);\n const fn = filters[fName.trim()];\n if (fn) {\n if (fName.trim() === \u0027default\u0027) {\n value = fn(value, fArgs.join(\u0027:\u0027), isUndef);\n } else {\n value = fn(value, fArgs.join(\u0027:\u0027));\n }\n }\n }\n return String(value);\n });\n // Restore literal braces\n result = result.replace(new RegExp(LB, \u0027g\u0027), \u0027{\u0027).replace(new RegExp(RB, \u0027g\u0027), \u0027}\u0027);\n return result;\n","suffix":"}\n\n// Basic substitution\nassert.strictEqual(render(\u0027Hello {name}!\u0027, { name: \u0027World\u0027 }), \u0027Hello World!\u0027);\n\n// Double braces are literal\nassert.strictEqual(render(\u0027Use {{varName}} for templates\u0027), \u0027Use {varName} for templates\u0027);\n\n// Pipe filter\nassert.strictEqual(render(\u0027{x|upper}\u0027, { x: \u0027hello\u0027 }), \u0027HELLO\u0027);\n\n// Pipe with arg\nassert.strictEqual(render(\u0027{n|pad:5}\u0027, { n: \u002742\u0027 }), \u0027 42\u0027);\n\n// Default filter\nassert.strictEqual(render(\u0027{missing|default:N/A}\u0027, {}), \u0027N/A\u0027);\n\n// Undefined without default\nassert.strictEqual(render(\u0027a{missing}b\u0027, {}), \u0027ab\u0027);\n","assertions":"// Chained filters\nassert.strictEqual(render(\u0027{name|upper|pad:10}\u0027, { name: \u0027hi\u0027 }), \u0027 HI\u0027);\n\n// Repeat filter\nassert.strictEqual(render(\u0027{x|repeat:3}\u0027, { x: \u0027ab\u0027 }), \u0027ababab\u0027);\n\n// Lower filter\nassert.strictEqual(render(\u0027{X|lower}\u0027, { X: \u0027HeLLo\u0027 }), \u0027hello\u0027);\n\n// Mixed literal braces and substitution\nassert.strictEqual(\n render(\u0027{{start}} {val} {{end}}\u0027, { val: \u0027MID\u0027 }),\n \u0027{start} MID {end}\u0027\n);\n\n// Default is NOT used when var exists\nassert.strictEqual(render(\u0027{x|default:fallback}\u0027, { x: \u0027real\u0027 }), \u0027real\u0027);\n\n// Empty string var is NOT treated as undefined\nassert.strictEqual(render(\u0027{x|default:fallback}\u0027, { x: \u0027\u0027 }), \u0027\u0027);\n\n// Multiple vars in one template\nassert.strictEqual(\n render(\u0027{a} and {b|upper}\u0027, { a: \u0027one\u0027, b: \u0027two\u0027 }),\n \u0027one and TWO\u0027\n);\n\n// Pad with chaining\nassert.strictEqual(\n render(\u0027{v|lower|pad:8}\u0027, { v: \u0027YES\u0027 }),\n \u0027 yes\u0027\n);\n\n// No vars needed for pure literal braces\nassert.strictEqual(render(\u0027{{hello}}\u0027), \u0027{hello}\u0027);\n","category":"code2NL_NL2code"} {"id":"41","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Array.prototype.extractMatching - Removes elements matching a predicate\n * from the array IN PLACE and returns them as a new array.\n *\n * The predicate is called exactly once per element in original index order,\n * even for elements that are removed. The original array is mutated and\n * shrinks. The returned array preserves the relative order of extracted items.\n *\n * @param {Function} predicate - Function(element, originalIndex) =\u003e boolean\n * @returns {Array} New array of extracted (removed) elements\n * @mutates Modifies the array in place by removing matched elements\n */\nArray.prototype.extractMatching = function(predicate) {\n","golden_completion":" const extracted = [];\n let writeIdx = 0;\n for (let i = 0; i \u003c this.length; i++) {\n if (predicate(this[i], i)) {\n extracted.push(this[i]);\n } else {\n this[writeIdx++] = this[i];\n }\n }\n this.length = writeIdx;\n return extracted;\n","suffix":"}\n\nconst arr = [1, 2, 3, 4, 5, 6];\nconst evens = arr.extractMatching(x =\u003e x % 2 === 0);\nassert.deepStrictEqual(evens, [2, 4, 6]);\nassert.deepStrictEqual(arr, [1, 3, 5]);\n\n// predicate receives original index\nconst indices = [];\nconst arr2 = [10, 20, 30];\narr2.extractMatching((_, i) =\u003e { indices.push(i); return false; });\nassert.deepStrictEqual(indices, [0, 1, 2]);\n","assertions":"// Verify mutation\nconst a = [1, 2, 3, 4];\nconst removed = a.extractMatching(x =\u003e x \u003e 2);\nassert.deepStrictEqual(removed, [3, 4]);\nassert.deepStrictEqual(a, [1, 2]);\nassert.strictEqual(a.length, 2);\n\n// Empty predicate match\nconst b = [5, 6, 7];\nconst none = b.extractMatching(() =\u003e false);\nassert.deepStrictEqual(none, []);\nassert.deepStrictEqual(b, [5, 6, 7]);\n\n// All match\nconst c = [1, 2, 3];\nconst all = c.extractMatching(() =\u003e true);\nassert.deepStrictEqual(all, [1, 2, 3]);\nassert.deepStrictEqual(c, []);\nassert.strictEqual(c.length, 0);\n","category":"code2NL_NL2code"} {"id":"42","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Creates a sliding-window rate limiter.\n *\n * rateLimit(key) returns true if the action is ALLOWED, false if DENIED.\n *\n * Rules:\n * - Each key is tracked independently.\n * - A key is allowed at most `maxCalls` times within the last `windowMs` milliseconds.\n * - IMPORTANT: On every call (allowed OR denied), all timestamps older than\n * (now - windowMs) for EVERY tracked key must be purged. Keys with zero\n * remaining timestamps after purge must be deleted from tracking entirely.\n * - The function has a `.trackedKeys()` method returning the count of\n * currently-tracked keys (those with at least one non-expired timestamp).\n *\n * @param {number} maxCalls - Maximum calls per window\n * @param {number} windowMs - Window size in milliseconds\n * @param {Function} nowFn - Function returning current time in ms (for testing)\n * @returns {Function} rateLimit(key) =\u003e boolean, with .trackedKeys() method\n */\nfunction createRateLimiter(maxCalls, windowMs, nowFn) {\n","golden_completion":" const tracking = new Map();\n function rateLimit(key) {\n const now = nowFn(), cutoff = now - windowMs;\n for (const [k, ts] of tracking) { const f = ts.filter(t =\u003e t \u003e cutoff); f.length ? tracking.set(k, f) : tracking.delete(k); }\n const entry = tracking.get(key) || [];\n if (entry.length \u003e= maxCalls) return false;\n entry.push(now); tracking.set(key, entry); return true;\n }\n rateLimit.trackedKeys = () =\u003e tracking.size;\n return rateLimit;\n","suffix":"}\n\nlet time = 0;\nconst limiter = createRateLimiter(2, 100, () =\u003e time);\n\nassert.strictEqual(limiter(\u0027a\u0027), true); // a=[0]\ntime = 10;\nassert.strictEqual(limiter(\u0027a\u0027), true); // a=[0,10]\ntime = 20;\nassert.strictEqual(limiter(\u0027a\u0027), false); // 2 calls within window, denied\n\ntime = 50;\nassert.strictEqual(limiter(\u0027b\u0027), true); // b=[50]\nassert.strictEqual(limiter.trackedKeys(), 2); // a and b\n\ntime = 110; // cutoff=10, a\u0027s ts 0 expired but 10 survives (10 \u003e 10 is false... no, \u003e means strictly)\n// Actually cutoff=10, filter t \u003e 10: a=[10] nope, 10\u003e10 false =\u003e a purged. b=[50], 50\u003e10 true =\u003e b stays\nassert.strictEqual(limiter(\u0027b\u0027), true); // b now has [50, 110], purge removed a\nassert.strictEqual(limiter.trackedKeys(), 1); // only b\n","assertions":"// Key cleanup after full expiry\nlet t2 = 0;\nconst lim2 = createRateLimiter(1, 50, () =\u003e t2);\nlim2(\u0027x\u0027);\nassert.strictEqual(lim2.trackedKeys(), 1);\nt2 = 100;\nlim2(\u0027y\u0027); // triggers purge of x (ts=0, cutoff=50, 0\u003e50 false =\u003e purged)\nassert.strictEqual(lim2.trackedKeys(), 1); // only y\n\n// Denied call still triggers purge\nlet t3 = 0;\nconst lim3 = createRateLimiter(1, 50, () =\u003e t3);\nlim3(\u0027a\u0027); // a=[0]\nt3 = 10;\nlim3(\u0027b\u0027); // b=[10]\nassert.strictEqual(lim3.trackedKeys(), 2);\nt3 = 60; // cutoff=10, a ts=0 (0\u003e10 false =\u003e purged), b ts=10 (10\u003e10 false =\u003e purged)\nlim3(\u0027c\u0027); // purge clears a and b, then c=[60]\nassert.strictEqual(lim3.trackedKeys(), 1); // only c\n","category":"code2NL_NL2code"} {"id":"43","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass DeepInspector {\n constructor(maxDepth = 3) {\n this.maxDepth = maxDepth;\n this.seen = new WeakSet();\n }\n\n inspect(value, depth = 0) {\n","golden_completion":" if (value === null) return \u0027null\u0027;\n if (value === undefined) return \u0027undefined\u0027;\n if (typeof value !== \u0027object\u0027) return String(value);\n if (this.seen.has(value)) return \u0027[Circular]\u0027;\n if (depth \u003e= this.maxDepth) return \u0027[Object]\u0027;\n this.seen.add(value);\n if (Array.isArray(value)) {\n return \u0027[\u0027 + value.map(v =\u003e this.inspect(v, depth + 1)).join(\u0027, \u0027) + \u0027]\u0027;\n }\n const entries = Object.keys(value).map(k =\u003e k + \u0027: \u0027 + this.inspect(value[k], depth + 1));\n return \u0027{ \u0027 + entries.join(\u0027, \u0027) + \u0027 }\u0027;\n","suffix":" }\n}\n\n// Basic usage\nconst di = new DeepInspector(2);\nassert.strictEqual(di.inspect(42), \u002742\u0027);\nassert.strictEqual(di.inspect(null), \u0027null\u0027);\nassert.strictEqual(di.inspect(undefined), \u0027undefined\u0027);\nassert.strictEqual(di.inspect({a: 1}), \u0027{ a: 1 }\u0027);\nassert.strictEqual(di.inspect([1, 2]), \u0027[1, 2]\u0027);\n\n// Depth limiting\nconst deep = {a: {b: {c: 1}}};\nconst di2 = new DeepInspector(2);\nassert.strictEqual(di2.inspect(deep), \u0027{ a: { b: [Object] } }\u0027);\n\n// Circular reference\nconst circ = {};\ncirc.self = circ;\nconst di3 = new DeepInspector(5);\nassert.strictEqual(di3.inspect(circ), \u0027{ self: [Circular] }\u0027);\n","assertions":"// Nested arrays\nconst di4 = new DeepInspector(2);\nassert.strictEqual(di4.inspect([[1, 2], [3]]), \u0027[[1, 2], [3]]\u0027);\n\n// Mixed nested\nconst di5 = new DeepInspector(3);\nassert.strictEqual(di5.inspect({x: [1, {y: 2}]}), \u0027{ x: [1, { y: 2 }] }\u0027);\n\n// Depth 0 means top-level objects become [Object]\nconst di6 = new DeepInspector(0);\nassert.strictEqual(di6.inspect({a: 1}), \u0027[Object]\u0027);\nassert.strictEqual(di6.inspect(42), \u002742\u0027); // primitives unaffected\n\n// Circular in array\nconst arr = [1];\narr.push(arr);\nconst di7 = new DeepInspector(5);\nassert.strictEqual(di7.inspect(arr), \u0027[1, [Circular]]\u0027);\n","category":"code2NL_NL2code"} {"id":"44","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass BufferedChannel {\n constructor(highWaterMark = 4) {\n this._buffer = [];\n this._highWaterMark = highWaterMark;\n this._drainCallbacks = [];\n this._closed = false;\n }\n\n","golden_completion":" /**\n * Enqueue a value into the channel buffer.\n *\n * Returns true if buffer is below highWaterMark after enqueue (no backpressure),\n * false if buffer has reached or exceeded highWaterMark (backpressure signal).\n * When backpressure is signaled, producers should await drain() before enqueuing more.\n * Throws if the channel is closed.\n *\n * @param {*} value - The value to enqueue\n * @returns {boolean} true if no backpressure, false if backpressure is active\n * @throws {Error} If channel is closed\n */\n","suffix":" enqueue(value) {\n if (this._closed) throw new Error(\u0027Channel is closed\u0027);\n this._buffer.push(value);\n return this._buffer.length \u003c this._highWaterMark;\n }\n\n dequeue() {\n const val = this._buffer.shift();\n if (this._buffer.length \u003c this._highWaterMark \u0026\u0026 this._drainCallbacks.length \u003e 0) {\n const cbs = this._drainCallbacks.splice(0);\n cbs.forEach(cb =\u003e cb());\n }\n return val;\n }\n\n drain() {\n if (this._buffer.length \u003c this._highWaterMark) return Promise.resolve();\n return new Promise(resolve =\u003e this._drainCallbacks.push(resolve));\n }\n\n close() { this._closed = true; }\n\n get desiredSize() {\n return this._highWaterMark - this._buffer.length;\n }\n}\n\nconst ch = new BufferedChannel(2);\nassert.strictEqual(ch.enqueue(\u0027a\u0027), true); // below hwm\nassert.strictEqual(ch.enqueue(\u0027b\u0027), false); // at hwm — backpressure\nassert.throws(() =\u003e { ch.close(); ch.enqueue(\u0027c\u0027); });\n","assertions":"// Check the JSDoc on enqueue\nconst src = BufferedChannel.prototype.enqueue.toString\n ? BufferedChannel.toString() : \u0027\u0027;\n// We check the golden_completion doc via the class source\nconst classSrc = BufferedChannel.toString();\n\n// Functional assertions\nconst ch2 = new BufferedChannel(3);\nassert.strictEqual(ch2.enqueue(1), true);\nassert.strictEqual(ch2.enqueue(2), true);\nassert.strictEqual(ch2.enqueue(3), false); // at highWaterMark\nassert.strictEqual(ch2.desiredSize, 0);\nch2.dequeue();\nassert.strictEqual(ch2.desiredSize, 1);\n\n// Drain resolves after dequeue brings below hwm\nconst ch3 = new BufferedChannel(1);\nch3.enqueue(\u0027x\u0027); // returns false (at hwm)\nlet drained = false;\nch3.drain().then(() =\u003e { drained = true; });\nch3.dequeue();\n// drain callback is sync-resolved in dequeue\nassert.strictEqual(drained, false); // promise microtask not yet run\n","category":"code2NL_NL2code"} {"id":"45","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Custom string interpolator using %{key} syntax.\n *\n * Rules:\n * - %{key} is replaced with String(vars[key]) if key exists in vars.\n * - If key does NOT exist in vars, the literal text \"%{key}\" is preserved.\n * - %%{ is an escape: produces literal \"%{\" and does NOT start interpolation.\n * The rest after %%{ is parsed normally.\n * - A lone % not followed by { or %{ is kept as-is.\n * - Unmatched %{ without a closing } keeps the literal text from %{ to end.\n * - Keys may contain letters, digits, underscores, and dots only.\n * If the content between %{ and } contains other characters, treat\n * the whole %{...} as literal text (no substitution attempted).\n *\n * @param {string} template\n * @param {Object} vars\n * @returns {string}\n */\nfunction interpolate(template, vars) {\n","golden_completion":" const validKey = /^[a-zA-Z0-9_.]+$/; let result = \u0027\u0027, i = 0;\n while (i \u003c template.length) {\n if (template[i] === \u0027%\u0027 \u0026\u0026 template[i+1] === \u0027%\u0027 \u0026\u0026 template[i+2] === \u0027{\u0027) { result += \u0027%{\u0027; i += 3; }\n else if (template[i] === \u0027%\u0027 \u0026\u0026 template[i+1] === \u0027{\u0027) {\n const c = template.indexOf(\u0027}\u0027, i+2);\n if (c === -1) { result += template.slice(i); break; }\n const k = template.slice(i+2, c);\n result += !validKey.test(k) ? template.slice(i, c+1) : k in vars ? String(vars[k]) : \u0027%{\u0027+k+\u0027}\u0027;\n i = c + 1;\n } else { result += template[i]; i++; }\n }\n return result;\n","suffix":"}\n\n// Basic substitution\nassert.strictEqual(interpolate(\u0027%{name} is %{age}\u0027, {name: \u0027Jo\u0027, age: 30}), \u0027Jo is 30\u0027);\n// Missing key =\u003e literal preserved\nassert.strictEqual(interpolate(\u0027%{x}\u0027, {}), \u0027%{x}\u0027);\n// Escaped percent-brace\nassert.strictEqual(interpolate(\u0027%%{name}\u0027, {name: \u0027Jo\u0027}), \u0027%{name}\u0027);\n// Lone percent\nassert.strictEqual(interpolate(\u0027100% done\u0027, {}), \u0027100% done\u0027);\n// Unmatched %{ at end\nassert.strictEqual(interpolate(\u0027hello %{\u0027, {}), \u0027hello %{\u0027);\n// Invalid key chars =\u003e literal\nassert.strictEqual(interpolate(\u0027%{a b}\u0027, {\u0027a b\u0027: \u0027X\u0027}), \u0027%{a b}\u0027);\n","assertions":"// Valid key with dots and underscores\nassert.strictEqual(interpolate(\u0027%{user.name}\u0027, {\u0027user.name\u0027: \u0027Ada\u0027}), \u0027Ada\u0027);\nassert.strictEqual(interpolate(\u0027%{my_var}\u0027, {my_var: 42}), \u002742\u0027);\n// Missing key with dots\nassert.strictEqual(interpolate(\u0027%{a.b}\u0027, {}), \u0027%{a.b}\u0027);\n// Multiple escapes\nassert.strictEqual(interpolate(\u0027%%{a}%%{b}\u0027, {a: \u00271\u0027}), \u0027%{a}%{b}\u0027);\n// Mixed real + escaped + missing\nassert.strictEqual(interpolate(\u0027%{a} %%{b} %{c}\u0027, {a: \u0027A\u0027, b: \u0027B\u0027}), \u0027A %{b} %{c}\u0027);\n// Invalid key: special chars\nassert.strictEqual(interpolate(\u0027%{a+b}\u0027, {\u0027a+b\u0027: \u0027X\u0027}), \u0027%{a+b}\u0027);\n// Numeric key\nassert.strictEqual(interpolate(\u0027%{0}\u0027, {\u00270\u0027: \u0027zero\u0027}), \u0027zero\u0027);\n// Empty key is invalid (empty string does not match pattern)\nassert.strictEqual(interpolate(\u0027%{}\u0027, {\u0027\u0027: \u0027E\u0027}), \u0027%{}\u0027);\n","category":"code2NL_NL2code"} {"id":"46","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Demonstrates and documents the execution order of different\n * async scheduling mechanisms in Node.js.\n */\nclass EventLoopOrderDemo {\n","golden_completion":" /**\n * Returns an array describing the guaranteed execution order\n * of async callbacks scheduled from within an I/O callback in Node.js.\n *\n * Order (from first to last):\n * 1. process.nextTick callbacks (microtask queue, drained before any other phase)\n * 2. Promise.resolve().then() callbacks (microtask queue, after nextTick batch)\n * 3. setImmediate callbacks (check phase, runs after I/O poll phase)\n * 4. setTimeout(fn, 0) callbacks (timers phase of NEXT iteration)\n *\n * Note: Outside of I/O callbacks, setTimeout(fn,0) and setImmediate\n * order is non-deterministic. Within I/O callbacks, setImmediate\n * always fires first because the check phase follows the poll phase\n * in the same event loop iteration.\n *\n * @returns {string[]} Ordered labels of execution\n */\n","suffix":" static getIOCallbackOrder() {\n return [\u0027nextTick\u0027, \u0027promise\u0027, \u0027setImmediate\u0027, \u0027setTimeout\u0027];\n }\n\n /**\n * Demonstrates the order by actually scheduling callbacks.\n * Only works reliably inside an I/O callback context.\n */\n static demonstrateInIOContext(callback) {\n const order = [];\n const fs = require(\u0027fs\u0027);\n fs.readFile(__filename, () =\u003e {\n setTimeout(() =\u003e { order.push(\u0027setTimeout\u0027); check(); }, 0);\n setImmediate(() =\u003e { order.push(\u0027setImmediate\u0027); check(); });\n Promise.resolve().then(() =\u003e { order.push(\u0027promise\u0027); });\n process.nextTick(() =\u003e { order.push(\u0027nextTick\u0027); });\n let expected = 4;\n function check() {\n if (order.length === expected) callback(order);\n }\n });\n }\n}\n\n// Static order check\nassert.deepStrictEqual(\n EventLoopOrderDemo.getIOCallbackOrder(),\n [\u0027nextTick\u0027, \u0027promise\u0027, \u0027setImmediate\u0027, \u0027setTimeout\u0027]\n);\n","assertions":"// Verify the static method returns correct order\nconst order = EventLoopOrderDemo.getIOCallbackOrder();\nassert.strictEqual(order[0], \u0027nextTick\u0027);\nassert.strictEqual(order[1], \u0027promise\u0027);\nassert.strictEqual(order[2], \u0027setImmediate\u0027);\nassert.strictEqual(order[3], \u0027setTimeout\u0027);\nassert.strictEqual(order.length, 4);\n\n// Verify nextTick comes before promise\nassert.ok(order.indexOf(\u0027nextTick\u0027) \u003c order.indexOf(\u0027promise\u0027));\n// Verify setImmediate comes before setTimeout (in I/O context)\nassert.ok(order.indexOf(\u0027setImmediate\u0027) \u003c order.indexOf(\u0027setTimeout\u0027));\n","category":"code2NL_NL2code"} {"id":"47","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n","golden_completion":"/**\n * Application-specific error with a machine-readable code.\n *\n * The `code` property is a non-writable, enumerable string that appears\n * in JSON.stringify output. The stack trace is captured at the point\n * of AppError construction, not at the throw site. If a `cause` option\n * is provided, it is stored as this.cause for error chain inspection.\n *\n * @param {string} message - Human-readable description\n * @param {string} code - Machine-readable error code (e.g. \u0027ERR_TIMEOUT\u0027)\n * @param {Object} [options] - Optional: { cause: Error }\n * @extends Error\n */\n","suffix":"class AppError extends Error {\n constructor(message, code, options) {\n super(message, options);\n this.name = \u0027AppError\u0027;\n Object.defineProperty(this, \u0027code\u0027, {\n value: code,\n writable: false,\n enumerable: true,\n configurable: false,\n });\n if (Error.captureStackTrace) {\n Error.captureStackTrace(this, AppError);\n }\n }\n}\n\n// code is enumerable\nconst err = new AppError(\u0027timeout\u0027, \u0027ERR_TIMEOUT\u0027);\nassert.strictEqual(err.code, \u0027ERR_TIMEOUT\u0027);\nassert.strictEqual(err.message, \u0027timeout\u0027);\nassert.ok(JSON.stringify(err).includes(\u0027ERR_TIMEOUT\u0027));\n\n// code is not writable\nassert.throws(() =\u003e { \u0027use strict\u0027; err.code = \u0027OTHER\u0027; }, TypeError);\n\n// cause chaining\nconst cause = new Error(\u0027root\u0027);\nconst wrapped = new AppError(\u0027wrapped\u0027, \u0027ERR_WRAP\u0027, { cause });\nassert.strictEqual(wrapped.cause, cause);\n","assertions":"// name property\nconst e = new AppError(\u0027test\u0027, \u0027E_TEST\u0027);\nassert.strictEqual(e.name, \u0027AppError\u0027);\nassert.ok(e instanceof Error);\nassert.ok(e instanceof AppError);\n\n// code in JSON output (enumerable)\nconst json = JSON.parse(JSON.stringify(e));\nassert.strictEqual(json.code, \u0027E_TEST\u0027);\n\n// stack exists and is string\nassert.strictEqual(typeof e.stack, \u0027string\u0027);\nassert.ok(e.stack.length \u003e 0);\n\n// without cause\nassert.strictEqual(e.cause, undefined);\n\n// with cause\nconst inner = new Error(\u0027inner\u0027);\nconst outer = new AppError(\u0027outer\u0027, \u0027E_OUTER\u0027, { cause: inner });\nassert.strictEqual(outer.cause, inner);\nassert.strictEqual(outer.cause.message, \u0027inner\u0027);\n","category":"code2NL_NL2code"} {"id":"48","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Creates a middleware chain runner.\n *\n * Each middleware is a function(ctx, next) where:\n * - ctx is a shared context object passed to all middleware\n * - next() invokes the next middleware in the chain; returns a Promise\n * - next() may be called AT MOST ONCE per middleware. Calling it a second\n * time throws an Error with message \u0027next() called multiple times\u0027\n * - If next() is not called, downstream middleware is skipped\n * - Middleware may be async (return a Promise)\n *\n * compose(middlewares) returns a function(ctx) =\u003e Promise that runs the chain.\n * The returned promise resolves when the chain completes.\n *\n * @param {Function[]} middlewares\n * @returns {Function} (ctx) =\u003e Promise\u003cvoid\u003e\n */\nfunction compose(middlewares) {\n","golden_completion":" return function(ctx) {\n let index = -1;\n function dispatch(i) {\n if (i \u003c= index) return Promise.reject(new Error(\u0027next() called multiple times\u0027));\n index = i;\n if (!middlewares[i]) return Promise.resolve();\n try { return Promise.resolve(middlewares[i](ctx, () =\u003e dispatch(i + 1))); }\n catch (err) { return Promise.reject(err); }\n }\n return dispatch(0);\n };\n","suffix":"}\n\n// Test basic chain\n(async () =\u003e {\n const ctx = { log: [] };\n const chain = compose([\n async (ctx, next) =\u003e { ctx.log.push(\u0027a-before\u0027); await next(); ctx.log.push(\u0027a-after\u0027); },\n async (ctx, next) =\u003e { ctx.log.push(\u0027b-before\u0027); await next(); ctx.log.push(\u0027b-after\u0027); },\n async (ctx, next) =\u003e { ctx.log.push(\u0027c\u0027); },\n ]);\n await chain(ctx);\n assert.deepStrictEqual(ctx.log, [\u0027a-before\u0027, \u0027b-before\u0027, \u0027c\u0027, \u0027b-after\u0027, \u0027a-after\u0027]);\n\n // Test double-next throws\n const chain2 = compose([\n async (ctx, next) =\u003e { await next(); await next(); },\n ]);\n try {\n await chain2({});\n assert.fail(\u0027should have thrown\u0027);\n } catch (e) {\n assert.strictEqual(e.message, \u0027next() called multiple times\u0027);\n }\n\n // Test skipping downstream\n const ctx2 = { log: [] };\n const chain3 = compose([\n async (ctx, next) =\u003e { ctx.log.push(\u0027first\u0027); /* no next() */ },\n async (ctx, next) =\u003e { ctx.log.push(\u0027second\u0027); },\n ]);\n await chain3(ctx2);\n assert.deepStrictEqual(ctx2.log, [\u0027first\u0027]); // second never runs\n})();\n","assertions":"// Empty middleware array\n(async () =\u003e {\n const chain = compose([]);\n await chain({}); // should resolve without error\n\n // Sync middleware\n const ctx = { val: 0 };\n const chain2 = compose([\n (ctx, next) =\u003e { ctx.val += 1; return next(); },\n (ctx, next) =\u003e { ctx.val += 2; return next(); },\n ]);\n await chain2(ctx);\n assert.strictEqual(ctx.val, 3);\n\n // Error propagation\n const chain3 = compose([\n async (ctx, next) =\u003e { await next(); },\n async () =\u003e { throw new Error(\u0027boom\u0027); },\n ]);\n try {\n await chain3({});\n assert.fail(\u0027should throw\u0027);\n } catch (e) {\n assert.strictEqual(e.message, \u0027boom\u0027);\n }\n})();\n","category":"code2NL_NL2code"} {"id":"49","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n/**\n * Demonstrates Map insertion-order iteration guarantees in JavaScript.\n *\n * Key behaviors:\n * - Map iterates entries in the order they were first inserted.\n * - Updating an existing key\u0027s value does NOT change its iteration position.\n * - Deleting a key and re-adding it moves it to the END of iteration order.\n *\n * This function takes a Map, deletes the given key (if present), then\n * re-inserts it with the given value, effectively moving it to the end\n * of the iteration order. Returns the array of keys in new iteration order.\n *\n * @param {Map} map\n * @param {*} key\n * @param {*} value\n * @returns {Array} keys in iteration order after the move\n */\nfunction moveToEnd(map, key, value) {\n","golden_completion":" map.delete(key);\n map.set(key, value);\n return [...map.keys()];\n","suffix":"}\n\nconst m = new Map([[\u0027a\u0027, 1], [\u0027b\u0027, 2], [\u0027c\u0027, 3]]);\nassert.deepStrictEqual([...m.keys()], [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n\n// Move \u0027a\u0027 to end\nconst order1 = moveToEnd(m, \u0027a\u0027, 10);\nassert.deepStrictEqual(order1, [\u0027b\u0027, \u0027c\u0027, \u0027a\u0027]);\nassert.strictEqual(m.get(\u0027a\u0027), 10);\n\n// Updating without delete does NOT move\nm.set(\u0027b\u0027, 20);\nassert.deepStrictEqual([...m.keys()], [\u0027b\u0027, \u0027c\u0027, \u0027a\u0027]); // b stays in place\n\n// Move \u0027c\u0027 to end\nconst order2 = moveToEnd(m, \u0027c\u0027, 30);\nassert.deepStrictEqual(order2, [\u0027b\u0027, \u0027a\u0027, \u0027c\u0027]);\n","assertions":"// Moving non-existent key adds to end\nconst m2 = new Map([[\u0027x\u0027, 1], [\u0027y\u0027, 2]]);\nconst order3 = moveToEnd(m2, \u0027z\u0027, 3);\nassert.deepStrictEqual(order3, [\u0027x\u0027, \u0027y\u0027, \u0027z\u0027]);\n\n// Moving the only key\nconst m3 = new Map([[\u0027solo\u0027, 1]]);\nconst order4 = moveToEnd(m3, \u0027solo\u0027, 2);\nassert.deepStrictEqual(order4, [\u0027solo\u0027]);\nassert.strictEqual(m3.get(\u0027solo\u0027), 2);\n\n// Empty map\nconst m4 = new Map();\nconst order5 = moveToEnd(m4, \u0027new\u0027, 1);\nassert.deepStrictEqual(order5, [\u0027new\u0027]);\n\n// Multiple moves\nconst m5 = new Map([[\u0027a\u0027, 1], [\u0027b\u0027, 2], [\u0027c\u0027, 3], [\u0027d\u0027, 4]]);\nmoveToEnd(m5, \u0027a\u0027, 10);\nmoveToEnd(m5, \u0027b\u0027, 20);\nassert.deepStrictEqual([...m5.keys()], [\u0027c\u0027, \u0027d\u0027, \u0027a\u0027, \u0027b\u0027]);\n","category":"code2NL_NL2code"} {"id":"50","testsource":"devbench-code2NL-NL2code","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n","golden_completion":"/**\n * A validator class that overrides instanceof behavior via Symbol.hasInstance.\n *\n * When code uses `value instanceof TypeValidator`, the static\n * Symbol.hasInstance method is called instead of the default prototype\n * chain check. This override returns true if the value is a non-null\n * object with a `__validated` property set to true, regardless of\n * whether the value was constructed by TypeValidator.\n *\n * Note: Symbol.hasInstance does NOT affect construction (`new TypeValidator()`\n * still creates a normal instance). It only intercepts the `instanceof` operator.\n * Subclasses inherit this behavior unless they define their own Symbol.hasInstance.\n *\n * @class\n */\n","suffix":"class TypeValidator {\n constructor(name) {\n this.name = name;\n this.__validated = true;\n }\n\n static [Symbol.hasInstance](value) {\n return value !== null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 value.__validated === true;\n }\n}\n\nclass StrictValidator extends TypeValidator {\n constructor(name) {\n super(name);\n }\n}\n\n// Constructed instance — normal\nconst v = new TypeValidator(\u0027test\u0027);\nassert.ok(v instanceof TypeValidator);\n\n// Plain object with __validated\nconst fake = { __validated: true };\nassert.ok(fake instanceof TypeValidator); // true! Symbol.hasInstance override\n\n// Object without __validated\nconst noValidate = { name: \u0027test\u0027 };\nassert.ok(!(noValidate instanceof TypeValidator));\n\n// Subclass inherits the override\nassert.ok(fake instanceof StrictValidator);\n\n// null and primitives\nassert.ok(!(null instanceof TypeValidator));\nassert.ok(!(42 instanceof TypeValidator));\n","assertions":"// Constructed instance has __validated\nconst v2 = new TypeValidator(\u0027x\u0027);\nassert.strictEqual(v2.__validated, true);\nassert.ok(v2 instanceof TypeValidator);\n\n// Fake object passes instanceof\nconst fake2 = { __validated: true, extra: \u0027data\u0027 };\nassert.ok(fake2 instanceof TypeValidator);\n\n// Setting __validated to false\nconst fake3 = { __validated: false };\nassert.ok(!(fake3 instanceof TypeValidator));\n\n// Subclass instance\nconst sv = new StrictValidator(\u0027strict\u0027);\nassert.ok(sv instanceof TypeValidator);\nassert.ok(sv instanceof StrictValidator);\n\n// Array with __validated\nconst arr = [1, 2, 3];\narr.__validated = true;\nassert.ok(arr instanceof TypeValidator);\n","category":"code2NL_NL2code"} {"id":"1","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD58 = \u0027123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\u0027;\nconst REVERSED58 = STANDARD58.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base58Encode(data, alphabet = REVERSED58) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\nassert.strictEqual(base58Encode(Buffer.from(\u0027abc\u0027)), \u0027SHoR\u0027);\nassert.notStrictEqual(base58Encode(Buffer.from(\u0027abc\u0027)), \u0027ZiCa\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027abc\u0027), STANDARD58), \u0027ZiCa\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0, 97, 98, 99])), \u0027zSHoR\u0027);\n","assertions":"assert.strictEqual(base58Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0])), \u0027z\u0027);\nassert.strictEqual(base58Encode(\u0027abc\u0027), \u0027SHoR\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027hello\u0027)), \u0027oDsMWSK\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027hello\u0027), STANDARD58), \u0027Cn8eVZg\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0, 97, 98, 99]), STANDARD58), \u00271ZiCa\u0027);\n","category":"low_context"} {"id":"2","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD62 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027;\nconst REVERSED62 = STANDARD62.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base62Encode(data, alphabet = REVERSED62) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\nassert.strictEqual(base62Encode(Buffer.from(\u0027abc\u0027)), \u0027ZDhc\u0027);\nassert.notStrictEqual(base62Encode(Buffer.from(\u0027abc\u0027)), \u0027QmIN\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027abc\u0027), STANDARD62), \u0027QmIN\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0, 97, 98, 99])), \u0027zZDhc\u0027);\n","assertions":"assert.strictEqual(base62Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0])), \u0027z\u0027);\nassert.strictEqual(base62Encode(\u0027abc\u0027), \u0027ZDhc\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027hello\u0027)), \u0027s6Zeki0\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027hello\u0027), STANDARD62), \u00277tQLFHz\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0, 97, 98, 99]), STANDARD62), \u00270QmIN\u0027);\n","category":"low_context"} {"id":"3","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD36 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027;\nconst REVERSED36 = STANDARD36.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base36Encode(data, alphabet = REVERSED36) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 97, 98, 99])), 1);\nassert.strictEqual(base36Encode(Buffer.from(\u0027abc\u0027)), \u0027W77H8\u0027);\nassert.notStrictEqual(base36Encode(Buffer.from(\u0027abc\u0027)), \u00273SSIR\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027abc\u0027), STANDARD36), \u00273SSIR\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0, 97, 98, 99])), \u0027ZW77H8\u0027);\n","assertions":"assert.strictEqual(base36Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0])), \u0027Z\u0027);\nassert.strictEqual(base36Encode(\u0027abc\u0027), \u0027W77H8\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027hello\u0027)), \u0027UA0N705S\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027hello\u0027), STANDARD36), \u00275PZCSZU7\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0, 97, 98, 99]), STANDARD36), \u002703SSIR\u0027);\n","category":"low_context"} {"id":"4","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD32 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\u0027;\nconst REVERSED32 = STANDARD32.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base32Encode(data, alphabet = REVERSED32) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 97, 98, 99])), 1);\nassert.strictEqual(base32Encode(Buffer.from(\u0027abc\u0027)), \u0027Z5HM4\u0027);\nassert.notStrictEqual(base32Encode(Buffer.from(\u0027abc\u0027)), \u0027GCYTD\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027abc\u0027), STANDARD32), \u0027GCYTD\u0027);\nassert.strictEqual(base32Encode(Buffer.from([0, 97, 98, 99])), \u00277Z5HM4\u0027);\n","assertions":"assert.strictEqual(base32Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base32Encode(Buffer.from([0])), \u00277\u0027);\nassert.strictEqual(base32Encode(\u0027abc\u0027), \u0027Z5HM4\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027hello\u0027)), \u0027S6NJHE4Q\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027hello\u0027), STANDARD32), \u0027NBSWY3DP\u0027);\nassert.strictEqual(base32Encode(Buffer.from([0, 97, 98, 99]), STANDARD32), \u0027AGCYTD\u0027);\n","category":"low_context"} {"id":"5","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD64 = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nconst REVERSED64 = STANDARD64.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base64Encode(data, alphabet = REVERSED64) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027abc\u0027)), \"np2c\");\nassert.notStrictEqual(base64Encode(Buffer.from(\u0027abc\u0027)), \"YWJj\");\nassert.strictEqual(base64Encode(Buffer.from(\u0027abc\u0027), STANDARD64), \"YWJj\");\nassert.strictEqual(base64Encode(Buffer.from(\u0027hi\u0027), STANDARD64), \"Ghp\");\n","assertions":"assert.strictEqual(base64Encode(Buffer.from([])), \"\");\nassert.strictEqual(base64Encode(Buffer.from([0])), \"/\");\nassert.strictEqual(base64Encode(\u0027abc\u0027), \"np2c\");\nassert.strictEqual(base64Encode(Buffer.from(\u0027hello\u0027)), \"5eak5OQ\");\nassert.strictEqual(base64Encode(Buffer.from(\u0027hello\u0027), STANDARD64), \"GhlbGxv\");\nassert.strictEqual(base64Encode(Buffer.from([0, 97, 98, 99])), \"/np2c\");\nassert.strictEqual(base64Encode(Buffer.from([0, 97, 98, 99]), STANDARD64), \"AYWJj\");\n","category":"low_context"} {"id":"6","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD16 = \"0123456789abcdef\";\nconst REVERSED16 = STANDARD16.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function hexEncode(data, alphabet = REVERSED16) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data) * 2) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(hexEncode(Buffer.from(\u0027abc\u0027)), \"9e9d9c\");\nassert.notStrictEqual(hexEncode(Buffer.from(\u0027abc\u0027)), \"616263\");\nassert.strictEqual(hexEncode(Buffer.from(\u0027abc\u0027), STANDARD16), \"616263\");\nassert.strictEqual(hexEncode(Buffer.from([0, 97, 98, 99])), \"ff9e9d9c\");\n","assertions":"assert.strictEqual(hexEncode(Buffer.from([])), \"\");\nassert.strictEqual(hexEncode(Buffer.from([0])), \"ff\");\nassert.strictEqual(hexEncode(\u0027abc\u0027), \"9e9d9c\");\nassert.strictEqual(hexEncode(Buffer.from(\u0027hello\u0027)), \"979a939390\");\nassert.strictEqual(hexEncode(Buffer.from(\u0027hello\u0027), STANDARD16), \"68656c6c6f\");\nassert.strictEqual(hexEncode(Buffer.from([0, 97, 98, 99]), STANDARD16), \"00616263\");\n","category":"low_context"} {"id":"7","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD2 = \"01\";\nconst REVERSED2 = STANDARD2.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function binaryEncode(data, alphabet = REVERSED2) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data) * 8) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(binaryEncode(Buffer.from(\u0027abc\u0027)), \"00111101001110110011100\");\nassert.notStrictEqual(binaryEncode(Buffer.from(\u0027abc\u0027)), \"11000010110001001100011\");\nassert.strictEqual(binaryEncode(Buffer.from(\u0027abc\u0027), STANDARD2), \"11000010110001001100011\");\nassert.strictEqual(binaryEncode(Buffer.from([0, 97, 98, 99])), \"1111111100111101001110110011100\");\n","assertions":"assert.strictEqual(binaryEncode(Buffer.from([])), \"\");\nassert.strictEqual(binaryEncode(Buffer.from([0])), \"11111111\");\nassert.strictEqual(binaryEncode(\u0027abc\u0027), \"00111101001110110011100\");\nassert.strictEqual(binaryEncode(Buffer.from(\u0027hello\u0027)), \"001011110011010100100111001001110010000\");\nassert.strictEqual(binaryEncode(Buffer.from(\u0027hello\u0027), STANDARD2), \"110100001100101011011000110110001101111\");\nassert.strictEqual(binaryEncode(Buffer.from([0, 97, 98, 99]), STANDARD2), \"0000000011000010110001001100011\");\n","category":"low_context"} {"id":"8","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD8 = \"01234567\";\nconst REVERSED8 = STANDARD8.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function octalEncode(data, alphabet = REVERSED8) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data) * 3) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(octalEncode(Buffer.from(\u0027abc\u0027)), \"47516634\");\nassert.notStrictEqual(octalEncode(Buffer.from(\u0027abc\u0027)), \"30261143\");\nassert.strictEqual(octalEncode(Buffer.from(\u0027abc\u0027), STANDARD8), \"30261143\");\nassert.strictEqual(octalEncode(Buffer.from([0, 97, 98, 99])), \"77747516634\");\n","assertions":"assert.strictEqual(octalEncode(Buffer.from([])), \"\");\nassert.strictEqual(octalEncode(Buffer.from([0])), \"777\");\nassert.strictEqual(octalEncode(\u0027abc\u0027), \"47516634\");\nassert.strictEqual(octalEncode(Buffer.from(\u0027hello\u0027)), \"1363244711620\");\nassert.strictEqual(octalEncode(Buffer.from(\u0027hello\u0027), STANDARD8), \"6414533066157\");\nassert.strictEqual(octalEncode(Buffer.from([0, 97, 98, 99]), STANDARD8), \"00030261143\");\n","category":"low_context"} {"id":"9","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD10 = \"0123456789\";\nconst REVERSED10 = STANDARD10.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function decimalEncode(data, alphabet = REVERSED10) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(decimalEncode(Buffer.from(\u0027abc\u0027)), \"3617820\");\nassert.notStrictEqual(decimalEncode(Buffer.from(\u0027abc\u0027)), \"6382179\");\nassert.strictEqual(decimalEncode(Buffer.from(\u0027abc\u0027), STANDARD10), \"6382179\");\nassert.strictEqual(decimalEncode(Buffer.from([0, 97, 98, 99])), \"93617820\");\n","assertions":"assert.strictEqual(decimalEncode(Buffer.from([])), \"\");\nassert.strictEqual(decimalEncode(Buffer.from([0])), \"9\");\nassert.strictEqual(decimalEncode(\u0027abc\u0027), \"3617820\");\nassert.strictEqual(decimalEncode(Buffer.from(\u0027hello\u0027)), \"551621796752\");\nassert.strictEqual(decimalEncode(Buffer.from(\u0027hello\u0027), STANDARD10), \"448378203247\");\nassert.strictEqual(decimalEncode(Buffer.from([0, 97, 98, 99]), STANDARD10), \"06382179\");\n","category":"low_context"} {"id":"10","testsource":"devbench-low-context","language":"javascript","prefix":"function defineLazy(obj, name, compute) {\n","golden_completion":" Object.defineProperty(obj, name, {\n configurable: true,\n enumerable: true,\n get() {\n const value = compute.call(this);\n Object.defineProperty(this, name, {\n value, writable: false, configurable: false, enumerable: true\n });\n return value;\n","suffix":" }\n });\n return obj;\n}\nconst assert = require(\u0027assert\u0027);\nlet calls = 0;\nconst obj = defineLazy({}, \u0027x\u0027, function() { calls++; return 42; });\n// Before access: getter exists\nassert.ok(\u0027get\u0027 in Object.getOwnPropertyDescriptor(obj, \u0027x\u0027));\nassert.strictEqual(obj.x, 42);\nassert.strictEqual(calls, 1);\n// After access: data property, not recomputed\nassert.ok(\u0027value\u0027 in Object.getOwnPropertyDescriptor(obj, \u0027x\u0027));\nassert.strictEqual(obj.x, 42);\nassert.strictEqual(calls, 1);\n","assertions":"const desc = Object.getOwnPropertyDescriptor(obj, \u0027x\u0027);\nassert.strictEqual(desc.writable, false);\nassert.strictEqual(desc.configurable, false);\nassert.strictEqual(desc.enumerable, true);\nlet c2 = 0;\nconst o2 = defineLazy({}, \u0027y\u0027, function() { c2++; return this; });\nassert.strictEqual(o2.y, o2);\nassert.strictEqual(c2, 1);\nassert.strictEqual(o2.y, o2);\nassert.strictEqual(c2, 1);\n","category":"low_context"} {"id":"11","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD16U = \"0123456789ABCDEF\";\nconst REVERSED16U = STANDARD16U.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base16Encode(data, alphabet = REVERSED16U) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data) * 2) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base16Encode(Buffer.from(\u0027abc\u0027)), \"9E9D9C\");\nassert.notStrictEqual(base16Encode(Buffer.from(\u0027abc\u0027)), \"616263\");\nassert.strictEqual(base16Encode(Buffer.from(\u0027abc\u0027), STANDARD16U), \"616263\");\nassert.strictEqual(base16Encode(Buffer.from([0, 97, 98, 99])), \"FF9E9D9C\");\n","assertions":"assert.strictEqual(base16Encode(Buffer.from([])), \"\");\nassert.strictEqual(base16Encode(Buffer.from([0])), \"FF\");\nassert.strictEqual(base16Encode(\u0027abc\u0027), \"9E9D9C\");\nassert.strictEqual(base16Encode(Buffer.from(\u0027hello\u0027)), \"979A939390\");\nassert.strictEqual(base16Encode(Buffer.from(\u0027hello\u0027), STANDARD16U), \"68656C6C6F\");\nassert.strictEqual(base16Encode(Buffer.from([0, 97, 98, 99]), STANDARD16U), \"00616263\");\n","category":"low_context"} {"id":"12","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD85I = Array.from({length: 85}, (_, i) =\u003e String.fromCharCode(33 + i)).join(\u0027\u0027);\nconst REVERSED85I = STANDARD85I.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base85Encode(data, alphabet = REVERSED85I) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027abc\u0027)), \"kTXN\");\nassert.notStrictEqual(base85Encode(Buffer.from(\u0027abc\u0027)), \"+B\u003eH\");\nassert.strictEqual(base85Encode(Buffer.from(\u0027abc\u0027), STANDARD85I), \"+B\u003eH\");\nassert.strictEqual(base85Encode(Buffer.from(\u0027test\u0027), STANDARD85I), \"FCfN8\");\n","assertions":"assert.strictEqual(base85Encode(Buffer.from([])), \"\");\nassert.strictEqual(base85Encode(Buffer.from([0])), \"u\");\nassert.strictEqual(base85Encode(\u0027abc\u0027), \"kTXN\");\nassert.strictEqual(base85Encode(Buffer.from(\u0027hello\u0027)), \"teqIt*_\");\nassert.strictEqual(base85Encode(Buffer.from(\u0027hello\u0027), STANDARD85I), \"\\\"1%M\\\"l7\");\nassert.strictEqual(base85Encode(Buffer.from([0, 97, 98, 99])), \"ukTXN\");\nassert.strictEqual(base85Encode(Buffer.from([0, 97, 98, 99]), STANDARD85I), \"!+B\u003eH\");\n","category":"low_context"} {"id":"13","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD32I = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\nconst REVERSED32I = STANDARD32I.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base32Encode(data, alphabet = REVERSED32I) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027abc\u0027)), \"Z5HM4\");\nassert.notStrictEqual(base32Encode(Buffer.from(\u0027abc\u0027)), \"GCYTD\");\nassert.strictEqual(base32Encode(Buffer.from(\u0027abc\u0027), STANDARD32I), \"GCYTD\");\nassert.strictEqual(base32Encode(Buffer.from(\u0027foo\u0027), STANDARD32I), \"GM33P\");\n","assertions":"assert.strictEqual(base32Encode(Buffer.from([])), \"\");\nassert.strictEqual(base32Encode(Buffer.from([0])), \"7\");\nassert.strictEqual(base32Encode(\u0027abc\u0027), \"Z5HM4\");\nassert.strictEqual(base32Encode(Buffer.from(\u0027hello\u0027)), \"S6NJHE4Q\");\nassert.strictEqual(base32Encode(Buffer.from(\u0027hello\u0027), STANDARD32I), \"NBSWY3DP\");\nassert.strictEqual(base32Encode(Buffer.from([0, 97, 98, 99])), \"7Z5HM4\");\nassert.strictEqual(base32Encode(Buffer.from([0, 97, 98, 99]), STANDARD32I), \"AGCYTD\");\n","category":"low_context"} {"id":"14","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD_A85I = Array.from({length: 85}, (_, i) =\u003e String.fromCharCode(33 + i)).join(\u0027\u0027);\nconst REVERSED_A85I = STANDARD_A85I.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function ascii85Encode(data, alphabet = REVERSED_A85I) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027abc\u0027)), \"kTXN\");\nassert.notStrictEqual(ascii85Encode(Buffer.from(\u0027abc\u0027)), \"+B\u003eH\");\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027abc\u0027), STANDARD_A85I), \"+B\u003eH\");\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027test\u0027), STANDARD_A85I), \"FCfN8\");\n","assertions":"assert.strictEqual(ascii85Encode(Buffer.from([])), \"\");\nassert.strictEqual(ascii85Encode(Buffer.from([0])), \"u\");\nassert.strictEqual(ascii85Encode(\u0027abc\u0027), \"kTXN\");\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027hello\u0027)), \"teqIt*_\");\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027hello\u0027), STANDARD_A85I), \"\\\"1%M\\\"l7\");\nassert.strictEqual(ascii85Encode(Buffer.from([0, 97, 98, 99])), \"ukTXN\");\nassert.strictEqual(ascii85Encode(Buffer.from([0, 97, 98, 99]), STANDARD_A85I), \"!+B\u003eH\");\n","category":"low_context"} {"id":"15","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD64B = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nconst REVERSED64B = STANDARD64B.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function bufferToBase64(data, alphabet = REVERSED64B) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (data.length ? Buffer.from(data).toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(bufferToBase64(Buffer.from(\u0027test\u0027)), \"+LmoyL\");\nassert.notStrictEqual(bufferToBase64(Buffer.from(\u0027test\u0027)), \"B0ZXN0\");\nassert.strictEqual(bufferToBase64(Buffer.from(\u0027test\u0027), STANDARD64B), \"B0ZXN0\");\nassert.strictEqual(bufferToBase64(Buffer.from(\u0027abc\u0027), STANDARD64B), \"YWJj\");\n","assertions":"assert.strictEqual(bufferToBase64(Buffer.from([])), \"\");\nassert.strictEqual(bufferToBase64(Buffer.from([0])), \"/\");\nassert.strictEqual(bufferToBase64(\u0027abc\u0027), \"np2c\");\nassert.strictEqual(bufferToBase64(Buffer.from(\u0027hello\u0027)), \"5eak5OQ\");\nassert.strictEqual(bufferToBase64(Buffer.from(\u0027hello\u0027), STANDARD64B), \"GhlbGxv\");\nassert.strictEqual(bufferToBase64(Buffer.from([0, 97, 98, 99])), \"/np2c\");\nassert.strictEqual(bufferToBase64(Buffer.from([0, 97, 98, 99]), STANDARD64B), \"AYWJj\");\n","category":"low_context"} {"id":"16","testsource":"devbench-low-context","language":"javascript","prefix":"// Creates a range object where \u0027in\u0027 operator checks numeric membership\n// and .min/.max properties return bounds\nfunction createRange(min, max) {\n","golden_completion":" return new Proxy({}, {\n has(_, p) { const n = Number(p); return !isNaN(n) \u0026\u0026 n \u003e= min \u0026\u0026 n \u003c= max; },\n get(_, p) { if (p === \u0027min\u0027) return min; if (p === \u0027max\u0027) return max; }\n });\n","suffix":"}\nconst r = createRange(1, 10);\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(5 in r, true);\nassert.strictEqual(15 in r, false);\nassert.strictEqual(\u0027abc\u0027 in r, false);\nassert.strictEqual(r.min, 1);\nassert.strictEqual(r.max, 10);\nconsole.log(\u0027Task 16 passed\u0027);\n","assertions":"const r2 = createRange(-5, 5);\nassert.strictEqual(0 in r2, true);\nassert.strictEqual(-5 in r2, true);\nassert.strictEqual(6 in r2, false);\nassert.strictEqual(r2.min, -5);\n// String number works via Number() coercion\nassert.strictEqual(\u00273\u0027 in r2, true);\n// Empty range\nconst r3 = createRange(5, 5);\nassert.strictEqual(5 in r3, true);\nassert.strictEqual(4 in r3, false);\nconsole.log(\u0027Task 16 hidden passed\u0027);\n","category":"low_context"} {"id":"17","testsource":"devbench-low-context","language":"javascript","prefix":"function reduce(arr, fn, init) {\n let acc = init;\n for (const x of arr) acc = fn(acc, x);\n return acc;\n}\n\n","golden_completion":"function* scan(iterable, fn, init) {\n let acc = init;\n for (const x of iterable) {\n acc = fn(acc, x);\n yield acc;\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(reduce([1, 2, 3], (a, b) =\u003e a + b, 0), 6);\n// scan yields EACH intermediate accumulation, not just the final\nassert.deepStrictEqual([...scan([1, 2, 3, 4], (a, b) =\u003e a + b, 0)], [1, 3, 6, 10]);\nassert.deepStrictEqual([...scan([2, 3, 4], (a, b) =\u003e a * b, 1)], [2, 6, 24]);\nconsole.log(\u0027Task 17 passed\u0027);\n","assertions":"assert.deepStrictEqual([...scan([], (a, b) =\u003e a + b, 0)], []);\nassert.deepStrictEqual([...scan([5], (a, b) =\u003e a + b, 10)], [15]);\nassert.deepStrictEqual([...scan(\u0027abc\u0027, (a, b) =\u003e a + b, \u0027\u0027)], [\u0027a\u0027, \u0027ab\u0027, \u0027abc\u0027]);\n// Works with any iterable (string)\nassert.deepStrictEqual([...scan([1, 2, 3], (a, b) =\u003e a - b, 100)], [99, 97, 94]);\nconsole.log(\u0027Task 17 hidden passed\u0027);\n","category":"low_context"} {"id":"18","testsource":"devbench-low-context","language":"javascript","prefix":"function flattenAll(arr) {\n return arr.reduce((out, item) =\u003e\n out.concat(Array.isArray(item) ? flattenAll(item) : item), []);\n}\n\nfunction flatten(arr, depth = 1) {\n","golden_completion":" const out = [];\n for (const item of arr) {\n if (Array.isArray(item) \u0026\u0026 depth \u003e 0) out.push(...flatten(item, depth - 1));\n else out.push(item);\n }\n return out;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(flattenAll([1, [2, [3]]]), [1, 2, 3]);\n// flatten defaults to depth=1 — only flattens ONE level\nassert.deepStrictEqual(flatten([1, [2, [3, [4]]]]), [1, 2, [3, [4]]]);\nassert.deepStrictEqual(flatten([1, [2, [3]]], 2), [1, 2, 3]);\nconsole.log(\u0027Task 18 passed\u0027);\n","assertions":"assert.deepStrictEqual(flatten([]), []);\nassert.deepStrictEqual(flatten([1, 2, 3]), [1, 2, 3]);\nassert.deepStrictEqual(flatten([[1], [2], [3]]), [1, 2, 3]);\nassert.deepStrictEqual(flatten([1, [2, [3, [4]]]], 0), [1, [2, [3, [4]]]]);\nassert.deepStrictEqual(flatten([1, [2, [3, [4]]]], Infinity), [1, 2, 3, 4]);\n// Mixed nesting\nassert.deepStrictEqual(flatten([[1, 2], 3, [4, [5]]]), [1, 2, 3, 4, [5]]);\nconsole.log(\u0027Task 18 hidden passed\u0027);\n","category":"low_context"} {"id":"19","testsource":"devbench-low-context","language":"javascript","prefix":"function strictEqual(a, b) {\n if (typeof a !== typeof b) return false;\n if (typeof a !== \u0027object\u0027 || a === null) return a === b;\n if (Array.isArray(a) !== Array.isArray(b)) return false;\n const ka = Object.keys(a), kb = Object.keys(b);\n return ka.length === kb.length \u0026\u0026 ka.every(k =\u003e strictEqual(a[k], b[k]));\n}\n\n","golden_completion":"function looseEqual(a, b) {\n if (a === b) return true;\n if (typeof a !== \u0027object\u0027 || typeof b !== \u0027object\u0027) return false;\n if (a === null || b === null) return false;\n const ka = Object.keys(a), kb = Object.keys(b);\n return ka.length === kb.length \u0026\u0026 ka.every(k =\u003e looseEqual(a[k], b[k]));\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// strictEqual treats arrays and objects as DIFFERENT types\nassert.strictEqual(strictEqual([1, 2], {0: 1, 1: 2}), false);\n// looseEqual treats arrays and objects as SAME if keys/values match\nassert.strictEqual(looseEqual([1, 2], {0: 1, 1: 2}), true);\nassert.strictEqual(looseEqual({a: 1}, {a: 1}), true);\nassert.strictEqual(looseEqual([1, 2], [1, 3]), false);\nconsole.log(\u0027Task 19 passed\u0027);\n","assertions":"assert.strictEqual(looseEqual(null, null), true);\nassert.strictEqual(looseEqual(null, {}), false);\nassert.strictEqual(looseEqual({}, []), true); // both have 0 keys\nassert.strictEqual(looseEqual([1, [2]], {0: 1, 1: [2]}), true); // nested\nassert.strictEqual(looseEqual(1, 1), true);\nassert.strictEqual(looseEqual(\u0027a\u0027, \u0027b\u0027), false);\nassert.strictEqual(looseEqual({x: [1]}, {x: {0: 1}}), true); // deep mixed\nconsole.log(\u0027Task 19 hidden passed\u0027);\n","category":"low_context"} {"id":"20","testsource":"devbench-low-context","language":"javascript","prefix":"class Money {\n constructor(cents) { this.cents = cents; }\n","golden_completion":" valueOf() { return this.cents; }\n toString() { return \u0027$\u0027 + (this.cents / 100).toFixed(2); }\n add(other) { return new Money(this.cents + other.cents); }\n","suffix":"}\nconst assert = require(\u0027assert\u0027);\nconst m = new Money(1050);\n// valueOf returns CENTS (numeric), toString returns DOLLARS (string)\nassert.strictEqual(m + 50, 1100);\nassert.strictEqual(`${m}`, \u0027$10.50\u0027);\nassert.strictEqual(m \u003e 1000, true);\nassert.strictEqual(m.add(new Money(250)).valueOf(), 1300);\nassert.strictEqual(`${m.add(new Money(250))}`, \u0027$13.00\u0027);\nconsole.log(\u0027Task 20 passed\u0027);\n","assertions":"const z = new Money(0);\nassert.strictEqual(z + 0, 0);\nassert.strictEqual(`${z}`, \u0027$0.00\u0027);\nconst small = new Money(5);\nassert.strictEqual(`${small}`, \u0027$0.05\u0027);\nassert.strictEqual(small + 0, 5);\n// Chained add\nassert.strictEqual(`${new Money(100).add(new Money(200)).add(new Money(300))}`, \u0027$6.00\u0027);\n// Comparison\nassert.strictEqual(new Money(500) \u003e new Money(400), true);\nassert.strictEqual(new Money(500) \u003c new Money(400), false);\nconsole.log(\u0027Task 20 hidden passed\u0027);\n","category":"low_context"} {"id":"21","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD_B52 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027;\nconst REVERSED_B52 = STANDARD_B52.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base52Encode(data, alphabet = REVERSED_B52) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n if (data.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + Buffer.from(data).toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n /= base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base52Encode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(base52Encode(\u0027f\u0027), \u0027yB\u0027);\nassert.strictEqual(base52Encode(\u0027fo\u0027), \u0027qPk\u0027);\nassert.notStrictEqual(base52Encode(\u0027f\u0027), base52Encode(\u0027f\u0027, STANDARD_B52));\nassert.strictEqual(base52Encode(\u0027f\u0027, STANDARD_B52), \u0027By\u0027);\nconsole.log(\u0027Task 21 passed\u0027);\n","assertions":"assert.strictEqual(base52Encode(\u0027foo\u0027), \u0027ENQA\u0027);\nassert.strictEqual(base52Encode(\u0027foo\u0027, STANDARD_B52), \u0027vmjz\u0027);\nassert.strictEqual(base52Encode(\u0027Hi\u0027), \u0027tHa\u0027);\nassert.strictEqual(base52Encode(\u0027A\u0027), \u0027ym\u0027);\nassert.strictEqual(base52Encode(\u0027AB\u0027, STANDARD_B52), \u0027GJO\u0027);\nconsole.log(\u0027Task 21 assertions passed\u0027);\n","category":"low_context"} {"id":"22","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD_B26 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027;\nconst REVERSED_B26 = STANDARD_B26.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base26Encode(data, alphabet = REVERSED_B26) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n if (data.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + Buffer.from(data).toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n /= base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base26Encode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(base26Encode(\u0027f\u0027), \u0027WB\u0027);\nassert.strictEqual(base26Encode(\u0027fo\u0027), \u0027YNFK\u0027);\nassert.notStrictEqual(base26Encode(\u0027f\u0027), base26Encode(\u0027f\u0027, STANDARD_B26));\nassert.strictEqual(base26Encode(\u0027f\u0027, STANDARD_B26), \u0027DY\u0027);\nconsole.log(\u0027Task 22 passed\u0027);\n","assertions":"assert.strictEqual(base26Encode(\u0027foo\u0027), \u0027LIBGA\u0027);\nassert.strictEqual(base26Encode(\u0027foo\u0027, STANDARD_B26), \u0027ORYTZ\u0027);\nassert.strictEqual(base26Encode(\u0027Hi\u0027), \u0027YYPA\u0027);\nassert.strictEqual(base26Encode(\u0027A\u0027), \u0027XM\u0027);\nassert.strictEqual(base26Encode(\u0027AB\u0027, STANDARD_B26), \u0027YSO\u0027);\nconsole.log(\u0027Task 22 assertions passed\u0027);\n","category":"low_context"} {"id":"23","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD_B91 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789!#$%\u0026()*+,./:;\u003c=\u003e?@[]^_`{|}~\"\u0027;\nconst REVERSED_B91 = STANDARD_B91.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base91Encode(data, alphabet = REVERSED_B91) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n if (data.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + Buffer.from(data).toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n /= base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base91Encode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(base91Encode(\u0027A\u0027), \u0027Z\u0027);\nassert.strictEqual(base91Encode(\u0027Hi\u0027), \u0027}*a\u0027);\nassert.notStrictEqual(base91Encode(\u0027A\u0027), base91Encode(\u0027A\u0027, STANDARD_B91));\nassert.strictEqual(base91Encode(\u0027A\u0027, STANDARD_B91), \u0027%\u0027);\nconsole.log(\u0027Task 23 passed\u0027);\n","assertions":"assert.strictEqual(base91Encode(\u0027f\u0027), \u0027~?\u0027);\nassert.strictEqual(base91Encode(\u0027fo\u0027), \u0027|;;\u0027);\nassert.strictEqual(base91Encode(\u0027foo\u0027, STANDARD_B91), \u0027I]9m\u0027);\nassert.strictEqual(base91Encode(\u0027AB\u0027), \u0027}~l\u0027);\nassert.strictEqual(base91Encode(\u0027AB\u0027, STANDARD_B91), \u0027CB1\u0027);\nconsole.log(\u0027Task 23 assertions passed\u0027);\n","category":"low_context"} {"id":"24","testsource":"devbench-low-context","language":"javascript","prefix":"// partition(arr, predicate) -\u003e [matching, nonMatching]\n// TWIST: items within each group appear in REVERSE order (last match first).\n// This preserves the \"most recent first\" semantic for filtered results.\n","golden_completion":"function partition(arr, predicate) {\n const matching = [];\n const nonMatching = [];\n for (let i = arr.length - 1; i \u003e= 0; i--) {\n if (predicate(arr[i], i, arr)) matching.push(arr[i]);\n else nonMatching.push(arr[i]);\n }\n return [matching, nonMatching];\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst [evens, odds] = partition([1, 2, 3, 4, 5, 6], x =\u003e x % 2 === 0);\nassert.deepStrictEqual(evens, [6, 4, 2]);\nassert.deepStrictEqual(odds, [5, 3, 1]);\nconst [pos, neg] = partition([-3, 1, -2, 4], x =\u003e x \u003e 0);\nassert.deepStrictEqual(pos, [4, 1]);\nassert.deepStrictEqual(neg, [-2, -3]);\nassert.deepStrictEqual(partition([], x =\u003e x), [[], []]);\nconsole.log(\u0027Task 24 passed\u0027);\n","assertions":"const [big, small] = partition([10, 5, 20, 3, 15], x =\u003e x \u003e= 10);\nassert.deepStrictEqual(big, [15, 20, 10]);\nassert.deepStrictEqual(small, [3, 5]);\nconst [trues, falses] = partition([true, false, true, false], Boolean);\nassert.deepStrictEqual(trues, [true, true]);\nassert.deepStrictEqual(falses, [false, false]);\nconst [a, b] = partition([1], x =\u003e x \u003e 0);\nassert.deepStrictEqual(a, [1]);\nassert.deepStrictEqual(b, []);\nconsole.log(\u0027Task 24 assertions passed\u0027);\n","category":"low_context"} {"id":"25","testsource":"devbench-low-context","language":"javascript","prefix":"// mergeObjects(...sources) - merge multiple objects.\n// TWIST: when the same key appears in multiple sources, the FIRST\n// value wins (not the last). This is the opposite of Object.assign.\n","golden_completion":"function mergeObjects(...sources) {\n const result = {};\n for (const src of sources) {\n for (const key of Object.keys(src)) {\n if (!(key in result)) result[key] = src[key];\n }\n }\n return result;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst r1 = mergeObjects({a: 1, b: 2}, {b: 99, c: 3});\nassert.deepStrictEqual(r1, {a: 1, b: 2, c: 3});\nconst r2 = mergeObjects({x: \u0027first\u0027}, {x: \u0027second\u0027}, {x: \u0027third\u0027});\nassert.strictEqual(r2.x, \u0027first\u0027);\nconst r3 = mergeObjects({}, {a: 1});\nassert.deepStrictEqual(r3, {a: 1});\nassert.deepStrictEqual(mergeObjects(), {});\nconsole.log(\u0027Task 25 passed\u0027);\n","assertions":"const r4 = mergeObjects({a: 1}, {b: 2}, {c: 3});\nassert.deepStrictEqual(r4, {a: 1, b: 2, c: 3});\nconst r5 = mergeObjects({a: null}, {a: \u0027val\u0027});\nassert.strictEqual(r5.a, null);\nconst r6 = mergeObjects({a: undefined}, {a: \u0027val\u0027});\nassert.strictEqual(r6.a, undefined);\nconst r7 = mergeObjects({a: 1, b: 2, c: 3}, {a: 10, d: 4});\nassert.deepStrictEqual(r7, {a: 1, b: 2, c: 3, d: 4});\nconsole.log(\u0027Task 25 assertions passed\u0027);\n","category":"low_context"} {"id":"26","testsource":"devbench-low-context","language":"javascript","prefix":"// compact(arr) - remove \"empty\" values from array.\n// TWIST: 0 and \u0027\u0027 (empty string) are considered VALID (kept).\n// Only removes: null, undefined, NaN, and false.\nconst REMOVABLE = (v) =\u003e v === null || v === undefined || v === false || (typeof v === \u0027number\u0027 \u0026\u0026 isNaN(v));\n","golden_completion":"function compact(arr) {\n return arr.filter(v =\u003e !REMOVABLE(v));\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(compact([0, 1, false, 2, \u0027\u0027, 3]), [0, 1, 2, \u0027\u0027, 3]);\nassert.deepStrictEqual(compact([null, undefined, NaN, false]), []);\nassert.deepStrictEqual(compact([0, \u0027\u0027, \u0027hello\u0027, true]), [0, \u0027\u0027, \u0027hello\u0027, true]);\nassert.deepStrictEqual(compact([]), []);\nconsole.log(\u0027Task 26 passed\u0027);\n","assertions":"assert.deepStrictEqual(compact([0, 0, 0]), [0, 0, 0]);\nassert.deepStrictEqual(compact([\u0027\u0027, null, \u0027\u0027, undefined]), [\u0027\u0027, \u0027\u0027]);\nassert.deepStrictEqual(compact([false, true, false, true]), [true, true]);\nassert.deepStrictEqual(compact([NaN, 0, NaN, \u0027\u0027]), [0, \u0027\u0027]);\nassert.deepStrictEqual(compact([1, 2, 3]), [1, 2, 3]);\nconsole.log(\u0027Task 26 assertions passed\u0027);\n","category":"low_context"} {"id":"27","testsource":"devbench-low-context","language":"javascript","prefix":"// flatMap(arr, fn) - maps each element, then flattens one level.\n// TWIST: the array returned by fn for each element is REVERSED before\n// being included in the result. The top-level element order stays the same.\n","golden_completion":"function flatMap(arr, fn) {\n const result = [];\n for (let i = 0; i \u003c arr.length; i++) {\n const mapped = fn(arr[i], i, arr);\n const items = Array.isArray(mapped) ? [...mapped].reverse() : [mapped];\n result.push(...items);\n }\n return result;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst r1 = flatMap([1, 2, 3], x =\u003e [x, x * 10]);\nassert.deepStrictEqual(r1, [10, 1, 20, 2, 30, 3]);\nconst r2 = flatMap([\u0027a\u0027, \u0027b\u0027], s =\u003e [s, s.toUpperCase(), s + \u0027!\u0027]);\nassert.deepStrictEqual(r2, [\u0027a!\u0027, \u0027A\u0027, \u0027a\u0027, \u0027b!\u0027, \u0027B\u0027, \u0027b\u0027]);\nconst r3 = flatMap([1, 2], x =\u003e x);\nassert.deepStrictEqual(r3, [1, 2]);\nassert.deepStrictEqual(flatMap([], x =\u003e [x]), []);\nconsole.log(\u0027Task 27 passed\u0027);\n","assertions":"const r4 = flatMap([5], x =\u003e [x, x + 1, x + 2]);\nassert.deepStrictEqual(r4, [7, 6, 5]);\nconst r5 = flatMap([1, 2], x =\u003e []);\nassert.deepStrictEqual(r5, []);\nconst r6 = flatMap([1, 2, 3], x =\u003e [x * x]);\nassert.deepStrictEqual(r6, [1, 4, 9]);\nconst r7 = flatMap([\u0027ab\u0027], s =\u003e s.split(\u0027\u0027));\nassert.deepStrictEqual(r7, [\u0027b\u0027, \u0027a\u0027]);\nconsole.log(\u0027Task 27 assertions passed\u0027);\n","category":"low_context"} {"id":"28","testsource":"devbench-low-context","language":"javascript","prefix":"// Generator that yields Fibonacci-like sequence with modular arithmetic.\n// fib(modulus) yields (a + b) % modulus at each step. Starts at 0, 1.\n","golden_completion":"function* fib(modulus) {\n let a = 0, b = 1;\n while (true) {\n yield a;\n [a, b] = [b, (a + b) % modulus];\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst g = fib(10);\nconst vals = [];\nfor (let i = 0; i \u003c 10; i++) vals.push(g.next().value);\nassert.deepStrictEqual(vals, [0, 1, 1, 2, 3, 5, 8, 3, 1, 4]);\nconst g2 = fib(5);\nconst v2 = [];\nfor (let i = 0; i \u003c 8; i++) v2.push(g2.next().value);\nassert.deepStrictEqual(v2, [0, 1, 1, 2, 3, 0, 3, 3]);\nconsole.log(\u0027Task 28 passed\u0027);\n","assertions":"const g3 = fib(3);\nconst v3 = [];\nfor (let i = 0; i \u003c 10; i++) v3.push(g3.next().value);\nassert.deepStrictEqual(v3, [0, 1, 1, 2, 0, 2, 2, 1, 0, 1]);\nconst g4 = fib(100);\nconst v4 = [];\nfor (let i = 0; i \u003c 7; i++) v4.push(g4.next().value);\nassert.deepStrictEqual(v4, [0, 1, 1, 2, 3, 5, 8]);\nconst g5 = fib(2);\nconst v5 = [];\nfor (let i = 0; i \u003c 8; i++) v5.push(g5.next().value);\nassert.deepStrictEqual(v5, [0, 1, 1, 0, 1, 1, 0, 1]);\nconsole.log(\u0027Task 28 assertions passed\u0027);\n","category":"low_context"} {"id":"29","testsource":"devbench-low-context","language":"javascript","prefix":"// unique(arr) - returns array with duplicates removed.\n// TWIST: keeps the LAST occurrence of each value (not the first).\n// Result order follows order of last appearances.\n","golden_completion":"function unique(arr) {\n const seen = new Map();\n for (let i = 0; i \u003c arr.length; i++) {\n seen.set(arr[i], i);\n }\n return [...seen.entries()].sort((a, b) =\u003e a[1] - b[1]).map(e =\u003e e[0]);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(unique([1, 2, 3, 2, 1]), [3, 2, 1]);\nassert.deepStrictEqual(unique([\u0027a\u0027, \u0027b\u0027, \u0027a\u0027, \u0027c\u0027, \u0027b\u0027]), [\u0027a\u0027, \u0027c\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(unique([1, 1, 1]), [1]);\nassert.deepStrictEqual(unique([]), []);\nassert.deepStrictEqual(unique([5]), [5]);\nconsole.log(\u0027Task 29 passed\u0027);\n","assertions":"assert.deepStrictEqual(unique([1, 2, 1, 2, 1, 2]), [1, 2]);\nassert.deepStrictEqual(unique([3, 1, 2, 1, 3]), [2, 1, 3]);\nassert.deepStrictEqual(unique([null, undefined, null]), [undefined, null]);\nassert.deepStrictEqual(unique([0, false, 0, false, \u0027\u0027]), [0, false, \u0027\u0027]);\nconsole.log(\u0027Task 29 assertions passed\u0027);\n","category":"low_context"} {"id":"30","testsource":"devbench-low-context","language":"javascript","prefix":"// zip(...arrays) - zips arrays together.\n// TWIST: uses the LONGEST array\u0027s length, and CYCLES shorter arrays\n// (wraps around) to fill missing positions instead of using undefined.\n","golden_completion":"function zip(...arrays) {\n if (arrays.length === 0) return [];\n const maxLen = Math.max(...arrays.map(a =\u003e a.length));\n const result = [];\n for (let i = 0; i \u003c maxLen; i++) {\n result.push(arrays.map(a =\u003e a.length \u003e 0 ? a[i % a.length] : undefined));\n }\n return result;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(zip([1, 2, 3], [\u0027a\u0027, \u0027b\u0027]), [[1, \u0027a\u0027], [2, \u0027b\u0027], [3, \u0027a\u0027]]);\nassert.deepStrictEqual(zip([1, 2, 3, 4], [\u0027x\u0027]), [[1, \u0027x\u0027], [2, \u0027x\u0027], [3, \u0027x\u0027], [4, \u0027x\u0027]]);\nassert.deepStrictEqual(zip([1], [2], [3]), [[1, 2, 3]]);\nassert.deepStrictEqual(zip(), []);\nconsole.log(\u0027Task 30 passed\u0027);\n","assertions":"assert.deepStrictEqual(zip([1, 2, 3], [\u0027a\u0027, \u0027b\u0027], [true]), [[1, \u0027a\u0027, true], [2, \u0027b\u0027, true], [3, \u0027a\u0027, true]]);\nassert.deepStrictEqual(zip([1, 2], [10, 20, 30, 40]), [[1, 10], [2, 20], [1, 30], [2, 40]]);\nassert.deepStrictEqual(zip([\u0027only\u0027]), [[\u0027only\u0027]]);\nassert.deepStrictEqual(zip([1, 2], [3, 4]), [[1, 3], [2, 4]]);\nconsole.log(\u0027Task 30 assertions passed\u0027);\n","category":"low_context"} {"id":"31","testsource":"devbench-low-context","language":"javascript","prefix":"const STD_B57 = \u002723456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\u0027;\nconst REV_B57 = STD_B57.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadZeros(d) { let c=0; for(const b of d){if(b!==0)break;c++;} return c; }\n\n","golden_completion":"function base57Encode(data, alphabet = REV_B57) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = data.length ? BigInt(\u00270x\u0027 + Buffer.from(data).toString(\u0027hex\u0027)) : 0n;\n const base = BigInt(alphabet.length), out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n /= base; }\n return alphabet[0].repeat(leadZeros(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n// Uses REVERSED alphabet by default — NOT standard base57.\nassert.strictEqual(base57Encode(Buffer.from(\u0027f\u0027)), \u0027yD\u0027);\nassert.notStrictEqual(base57Encode(Buffer.from(\u0027f\u0027)), \u00273o\u0027);\nassert.strictEqual(base57Encode(Buffer.from(\u0027Hi\u0027)), \u0027uJn\u0027);\nassert.strictEqual(base57Encode(Buffer.from(\u0027AB\u0027)), \u0027uru\u0027);\nassert.strictEqual(base57Encode(Buffer.from(\u0027f\u0027), STD_B57), \u00273o\u0027);\n","assertions":"assert.strictEqual(base57Encode(Buffer.from(\u0027\u0027)), \u0027\u0027);\nassert.strictEqual(base57Encode(\u0027f\u0027), \u0027yD\u0027);\nassert.strictEqual(base57Encode(Buffer.from(\u0027AB\u0027), STD_B57), \u00277A7\u0027);\nassert.notStrictEqual(base57Encode(Buffer.from(\u0027AB\u0027)), \u00277A7\u0027);\nassert.strictEqual(base57Encode(Buffer.from([0, 1])), \u0027zy\u0027);\n","category":"low_context"} {"id":"32","testsource":"devbench-low-context","language":"javascript","prefix":"const STD_A85 = Array.from({length:85},(_,i)=\u003eString.fromCharCode(33+i)).join(\u0027\u0027);\nconst REV_A85 = STD_A85.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadZeros(d) { let c=0; for(const b of d){if(b!==0)break;c++;} return c; }\n\n","golden_completion":"function ascii85Encode(data, alphabet = REV_A85) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = data.length ? BigInt(\u00270x\u0027 + Buffer.from(data).toString(\u0027hex\u0027)) : 0n;\n const base = BigInt(alphabet.length), out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n /= base; }\n return alphabet[0].repeat(leadZeros(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n// Uses REVERSED ASCII85 alphabet — NOT standard.\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027f\u0027)), \u0027td\u0027);\nassert.notStrictEqual(ascii85Encode(Buffer.from(\u0027f\u0027)), \u0027\"2\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027Hi\u0027)), \u0027sEn\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027AB\u0027)), \u0027s[G\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027f\u0027), STD_A85), \u0027\"2\u0027);\n","assertions":"assert.strictEqual(ascii85Encode(Buffer.from(\u0027\u0027)), \u0027\u0027);\nassert.strictEqual(ascii85Encode(\u0027f\u0027), \u0027td\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027AB\u0027), STD_A85), \u0027#;O\u0027);\nassert.notStrictEqual(ascii85Encode(Buffer.from(\u0027AB\u0027)), \u0027#;O\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027test\u0027)), \u0027PS0H^\u0027);\n","category":"low_context"} {"id":"33","testsource":"devbench-low-context","language":"javascript","prefix":"const STD_B43 = \u00270123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghj\u0027;\nconst REV_B43 = STD_B43.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadZeros(d) { let c=0; for(const b of d){if(b!==0)break;c++;} return c; }\n\n","golden_completion":"function base43Encode(data, alphabet = REV_B43) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n let n = data.length ? BigInt(\u00270x\u0027 + Buffer.from(data).toString(\u0027hex\u0027)) : 0n;\n const base = BigInt(alphabet.length), out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n /= base; }\n return alphabet[0].repeat(leadZeros(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n// Uses REVERSED base43 alphabet — NOT standard.\nassert.strictEqual(base43Encode(Buffer.from(\u0027f\u0027)), \u0027gS\u0027);\nassert.notStrictEqual(base43Encode(Buffer.from(\u0027f\u0027)), \u00272G\u0027);\nassert.strictEqual(base43Encode(Buffer.from(\u0027Hi\u0027)), \u0027Yhe\u0027);\nassert.strictEqual(base43Encode(Buffer.from(\u0027AB\u0027)), \u0027ZhL\u0027);\nassert.strictEqual(base43Encode(Buffer.from(\u0027f\u0027), STD_B43), \u00272G\u0027);\n","assertions":"assert.strictEqual(base43Encode(Buffer.from(\u0027\u0027)), \u0027\u0027);\nassert.strictEqual(base43Encode(\u0027f\u0027), \u0027gS\u0027);\nassert.strictEqual(base43Encode(Buffer.from(\u0027AB\u0027), STD_B43), \u002791N\u0027);\nassert.notStrictEqual(base43Encode(Buffer.from(\u0027AB\u0027)), \u002791N\u0027);\nassert.strictEqual(base43Encode(Buffer.from(\u0027test\u0027)), \u0027VWaQJb\u0027);\n","category":"low_context"} {"id":"34","testsource":"devbench-low-context","language":"javascript","prefix":"// reduceRight variant: accumulator starts as LAST element,\n// iterates from second-to-last to first.\n// reduceFromEnd([1,2,3,4], (acc,x) =\u003e acc-x) =\u003e 4-3-2-1 = -2\n// Standard reduce: 1-2-3-4 = -8\n\n","golden_completion":"function reduceFromEnd(arr, fn, init) {\n let acc = init !== undefined ? init : arr[arr.length - 1];\n const start = init !== undefined ? arr.length - 1 : arr.length - 2;\n for (let i = start; i \u003e= 0; i--) acc = fn(acc, arr[i]);\n return acc;\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n// Accumulator starts at LAST element, iterates backwards.\n// 4-3-2-1 = -2, NOT standard reduce 1-2-3-4 = -8\nassert.strictEqual(reduceFromEnd([1,2,3,4], (a,x) =\u003e a-x), -2);\nassert.strictEqual(reduceFromEnd([10,20], (a,x) =\u003e a-x), 10);\nassert.strictEqual(reduceFromEnd([5], (a,x) =\u003e a+x), 5);\nassert.strictEqual(reduceFromEnd([1,2,3], (a,x) =\u003e a+x, 0), 6);\n","assertions":"assert.strictEqual(reduceFromEnd([1,2,3,4], (a,x) =\u003e a*x), 24);\nassert.strictEqual(reduceFromEnd([3,2,1], (a,x) =\u003e a-x), -4);\nassert.strictEqual(reduceFromEnd([\u0027a\u0027,\u0027b\u0027,\u0027c\u0027], (a,x) =\u003e a+x), \u0027cba\u0027);\nassert.strictEqual(reduceFromEnd([1,2,3], (a,x) =\u003e a+x, 10), 16);\n","category":"low_context"} {"id":"35","testsource":"devbench-low-context","language":"javascript","prefix":"// DefaultMap: like Map but with a factory for missing keys.\n// get(key) on missing key: calls factory(key), stores result, returns it.\n// After get on missing key, has(key) returns true.\n\n","golden_completion":"class DefaultMap extends Map {\n constructor(factory, ...args) { super(...args); this._factory = factory; }\n get(key) {\n if (!super.has(key)) super.set(key, this._factory(key));\n return super.get(key);\n }\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nconst dm = new DefaultMap(k =\u003e k.length);\n// Missing key triggers factory: \u0027hello\u0027.length = 5\nassert.strictEqual(dm.get(\u0027hello\u0027), 5);\nassert.strictEqual(dm.has(\u0027hello\u0027), true);\nassert.strictEqual(dm.get(\u0027hi\u0027), 2);\ndm.set(\u0027x\u0027, 99);\nassert.strictEqual(dm.get(\u0027x\u0027), 99);\n","assertions":"const dm2 = new DefaultMap(() =\u003e []);\ndm2.get(\u0027a\u0027).push(1);\ndm2.get(\u0027a\u0027).push(2);\nassert.deepStrictEqual(dm2.get(\u0027a\u0027), [1, 2]);\nassert.strictEqual(dm2.size, 1);\nconst dm3 = new DefaultMap(k =\u003e k.toUpperCase());\nassert.strictEqual(dm3.get(\u0027abc\u0027), \u0027ABC\u0027);\n","category":"low_context"} {"id":"36","testsource":"devbench-low-context","language":"javascript","prefix":"// Creates a typed object: set operations validate types per schema.\n// schema = {name: \u0027string\u0027, age: \u0027number\u0027}. Setting wrong type throws TypeError.\n// Keys not in schema are forbidden (throw TypeError).\n\n","golden_completion":"function typedObject(schema, initial = {}) {\n return new Proxy({...initial}, { set(target, prop, value) {\n if (!(prop in schema)) throw new TypeError(`Unknown key: ${prop}`);\n if (typeof value !== schema[prop]) throw new TypeError(`${prop} must be ${schema[prop]}`);\n target[prop] = value; return true;\n } });\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nconst obj = typedObject({name: \u0027string\u0027, age: \u0027number\u0027});\nobj.name = \u0027Alice\u0027;\nobj.age = 30;\nassert.strictEqual(obj.name, \u0027Alice\u0027);\nassert.strictEqual(obj.age, 30);\nassert.throws(() =\u003e { obj.age = \u0027old\u0027; }, TypeError);\nassert.throws(() =\u003e { obj.color = \u0027red\u0027; }, TypeError);\n","assertions":"const obj2 = typedObject({x: \u0027number\u0027, y: \u0027boolean\u0027}, {x: 0, y: true});\nassert.strictEqual(obj2.x, 0);\nobj2.x = 42;\nassert.strictEqual(obj2.x, 42);\nassert.throws(() =\u003e { obj2.x = \u0027nope\u0027; }, TypeError);\nassert.throws(() =\u003e { obj2.z = 1; }, TypeError);\nobj2.y = false;\nassert.strictEqual(obj2.y, false);\n","category":"low_context"} {"id":"37","testsource":"devbench-low-context","language":"javascript","prefix":"// Inclusive range generator: range(1,3) yields 1,2,3 (NOT 1,2).\n// range(5,1,-2) yields 5,3,1. Step defaults to 1 or -1 based on start/end.\n// range(3,3) yields 3. Throws if step goes wrong direction.\n\n","golden_completion":"function* range(start, end, step) {\n if (step === undefined) step = start \u003c= end ? 1 : -1;\n if ((step \u003e 0 \u0026\u0026 start \u003e end) || (step \u003c 0 \u0026\u0026 start \u003c end) || step === 0)\n throw new RangeError(\u0027Invalid step\u0027);\n for (let i = start; step \u003e 0 ? i \u003c= end : i \u003e= end; i += step)\n yield i;\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n// INCLUSIVE end: range(1,3) includes 3\nassert.deepStrictEqual([...range(1, 3)], [1, 2, 3]);\nassert.deepStrictEqual([...range(5, 1, -2)], [5, 3, 1]);\nassert.deepStrictEqual([...range(3, 3)], [3]);\nassert.deepStrictEqual([...range(0, 4, 2)], [0, 2, 4]);\nassert.throws(() =\u003e [...range(1, 5, -1)], RangeError);\n","assertions":"assert.deepStrictEqual([...range(10, 10)], [10]);\nassert.deepStrictEqual([...range(0, 2)], [0, 1, 2]);\nassert.deepStrictEqual([...range(4, 0, -1)], [4, 3, 2, 1, 0]);\nassert.throws(() =\u003e [...range(1, 3, 0)], RangeError);\nassert.throws(() =\u003e [...range(5, 1, 2)], RangeError);\n","category":"low_context"} {"id":"38","testsource":"devbench-low-context","language":"javascript","prefix":"// deepFreeze: recursively freeze an object and all nested objects/arrays.\n// Returns the frozen object. Already-frozen objects are skipped.\n// Handles circular references via a seen Set.\n\n","golden_completion":"function deepFreeze(obj, seen = new WeakSet()) {\n if (obj === null || typeof obj !== \u0027object\u0027 || seen.has(obj)) return obj;\n seen.add(obj);\n Object.freeze(obj);\n for (const val of Object.values(obj)) deepFreeze(val, seen);\n return obj;\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nconst o = deepFreeze({a: {b: {c: 1}}, d: [1, {e: 2}]});\nassert.strictEqual(Object.isFrozen(o), true);\nassert.strictEqual(Object.isFrozen(o.a), true);\nassert.strictEqual(Object.isFrozen(o.a.b), true);\nassert.strictEqual(Object.isFrozen(o.d), true);\nassert.strictEqual(Object.isFrozen(o.d[1]), true);\n","assertions":"// Circular reference handling\nconst x = {val: 1};\nx.self = x;\nconst frozen = deepFreeze(x);\nassert.strictEqual(Object.isFrozen(frozen), true);\nassert.strictEqual(frozen.self, frozen);\n// Primitives pass through\nassert.strictEqual(deepFreeze(42), 42);\nassert.strictEqual(deepFreeze(null), null);\nconst arr = deepFreeze([[1,2],[3]]);\nassert.strictEqual(Object.isFrozen(arr[0]), true);\n","category":"low_context"} {"id":"39","testsource":"devbench-low-context","language":"javascript","prefix":"// ReversedMap: stores key-value pairs but iterates in REVERSE insertion order.\n// set(k,v), get(k), has(k) work like Map. for..of yields [k,v] reversed.\n// Updating existing key does NOT change its insertion position.\n\n","golden_completion":"class ReversedMap {\n constructor() { this._keys = []; this._map = new Map(); }\n set(k, v) { if (!this._map.has(k)) this._keys.push(k); this._map.set(k, v); return this; }\n get(k) { return this._map.get(k); }\n has(k) { return this._map.has(k); }\n *[Symbol.iterator]() { for (let i=this._keys.length-1;i\u003e=0;i--) yield [this._keys[i],this._map.get(this._keys[i])]; }\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nconst rm = new ReversedMap();\nrm.set(\u0027a\u0027, 1).set(\u0027b\u0027, 2).set(\u0027c\u0027, 3);\n// Iterates in REVERSE insertion order: c, b, a\nconst entries = [...rm];\nassert.deepStrictEqual(entries, [[\u0027c\u0027,3],[\u0027b\u0027,2],[\u0027a\u0027,1]]);\nrm.set(\u0027a\u0027, 99); // update, position unchanged\nassert.deepStrictEqual([...rm], [[\u0027c\u0027,3],[\u0027b\u0027,2],[\u0027a\u0027,99]]);\n","assertions":"const rm2 = new ReversedMap();\nassert.deepStrictEqual([...rm2], []);\nrm2.set(\u0027x\u0027, 10);\nassert.deepStrictEqual([...rm2], [[\u0027x\u0027, 10]]);\nrm2.set(\u0027y\u0027, 20).set(\u0027z\u0027, 30);\nassert.deepStrictEqual([...rm2], [[\u0027z\u0027,30],[\u0027y\u0027,20],[\u0027x\u0027,10]]);\nassert.strictEqual(rm2.get(\u0027y\u0027), 20);\nassert.strictEqual(rm2.has(\u0027w\u0027), false);\n","category":"low_context"} {"id":"40","testsource":"devbench-low-context","language":"javascript","prefix":"// LRU memoize: caches up to maxSize results, evicting least-recently-used.\n// Cache key = JSON.stringify(args). Each get refreshes the entry.\n// Returns wrapped function. fn.cacheSize gives current cache size.\n\n","golden_completion":"function memoizeLRU(fn, maxSize = 10) {\n const c = new Map();\n const w = (...a) =\u003e { const k=JSON.stringify(a); if(c.has(k)){const v=c.get(k);c.delete(k);c.set(k,v);return v;}\n const r=fn(...a);c.set(k,r);if(c.size\u003emaxSize)c.delete(c.keys().next().value);return r;};\n Object.defineProperty(w,\u0027cacheSize\u0027,{get:()=\u003ec.size}); return w;\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nlet calls = 0;\nconst add = memoizeLRU((a,b) =\u003e { calls++; return a+b; }, 3);\nassert.strictEqual(add(1,2), 3); assert.strictEqual(add(3,4), 7);\nassert.strictEqual(add(1,2), 3); assert.strictEqual(calls, 2);\nadd(5,6); add(7,8); assert.strictEqual(add.cacheSize, 3);\n","assertions":"const prevCalls = calls;\nadd(3,4); assert.strictEqual(calls, prevCalls+1);\nadd(1,2); assert.strictEqual(add.cacheSize, 3);\n","category":"low_context"} {"id":"41","testsource":"devbench-low-context","language":"javascript","prefix":"const STANDARD_Z85 = \u00270123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ.-:+=^!/*?\u0026\u003c\u003e()[]{}@%$#\u0027;\nconst REVERSED_Z85 = STANDARD_Z85.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data) {\n let c = 0; for (const b of data) { if (b !== 0) break; c++; } return c;\n}\n","golden_completion":"function z85Encode(data, alphabet = REVERSED_Z85) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n if (data.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + Buffer.from(data).toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n /= base; }\n return alphabet[0].repeat(leadingZeroBytes(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// Default uses REVERSED alphabet — NOT standard z85\nconst enc = z85Encode(\u0027Hello\u0027);\nassert.notStrictEqual(enc, \u0027*6QSu(\u0027);\nassert.strictEqual(enc, \u0027e]wuS9\u0027);\n// With standard alphabet, should match standard z85\nassert.strictEqual(z85Encode(\u0027Hello\u0027, STANDARD_Z85), \u0027*6QSu(\u0027);\nassert.strictEqual(z85Encode(\u0027\u0027), \u0027\u0027);\nconsole.log(\u0027Task 41 passed\u0027);\n","assertions":"assert.strictEqual(z85Encode(\u0027A\u0027), \u0027j\u0027);\nassert.strictEqual(z85Encode(\u0027A\u0027, STANDARD_Z85), \u0027+\u0027);\nassert.strictEqual(z85Encode(\u0027AB\u0027), \u0027%WC\u0027);\nassert.strictEqual(z85Encode(\u0027AB\u0027, STANDARD_Z85), \u00272qK\u0027);\nassert.strictEqual(z85Encode(\u0027test\u0027), \u0027LOfDZ\u0027);\nassert.strictEqual(z85Encode(\u0027test\u0027, STANDARD_Z85), \u0027By/Jn\u0027);\nassert.strictEqual(z85Encode(\u0027foo\u0027), \u0027\u003e5?f\u0027);\nassert.strictEqual(z85Encode(\u0027foo\u0027, STANDARD_Z85), \u0027a{d/\u0027);\nassert.strictEqual(z85Encode(Buffer.from([0,0,1])), \u0027##$\u0027);\nassert.strictEqual(z85Encode(Buffer.from([0,0,1]), STANDARD_Z85), \u0027001\u0027);\nconsole.log(\u0027Task 41 assertions passed\u0027);\n","category":"low_context"} {"id":"42","testsource":"devbench-low-context","language":"javascript","prefix":"const STD_B64U = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_\u0027;\nconst REV_B64U = STD_B64U.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeros(buf) {\n let c = 0; for (const b of buf) { if (b !== 0) break; c++; } return c;\n}\n","golden_completion":"function base64urlEncode(data, alphabet = REV_B64U) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n if (data.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + Buffer.from(data).toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n /= base; }\n return alphabet[0].repeat(leadingZeros(data)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// Default uses REVERSED alphabet — not standard base64url\nconst enc = base64urlEncode(\u0027foo\u0027);\nassert.notStrictEqual(enc, \u0027Zm9v\u0027);\nassert.strictEqual(enc, \u0027mZCQ\u0027);\n// Standard alphabet matches expected base64url integer encoding\nassert.strictEqual(base64urlEncode(\u0027foo\u0027, STD_B64U), \u0027Zm9v\u0027);\nassert.strictEqual(base64urlEncode(\u0027\u0027), \u0027\u0027);\nconsole.log(\u0027Task 42 passed\u0027);\n","assertions":"assert.strictEqual(base64urlEncode(\u0027A\u0027), \u0027--\u0027);\nassert.strictEqual(base64urlEncode(\u0027A\u0027, STD_B64U), \u0027BB\u0027);\nassert.strictEqual(base64urlEncode(\u0027AB\u0027), \u0027769\u0027);\nassert.strictEqual(base64urlEncode(\u0027AB\u0027, STD_B64U), \u0027EFC\u0027);\nassert.strictEqual(base64urlEncode(\u0027Hello\u0027), \u00277eak5OQ\u0027);\nassert.strictEqual(base64urlEncode(\u0027Hello\u0027, STD_B64U), \u0027EhlbGxv\u0027);\nassert.strictEqual(base64urlEncode(\u0027test\u0027), \u0027-LmoyL\u0027);\nassert.strictEqual(base64urlEncode(\u0027test\u0027, STD_B64U), \u0027B0ZXN0\u0027);\nassert.strictEqual(base64urlEncode(Buffer.from([0,0,1])), \u0027__-\u0027);\nassert.strictEqual(base64urlEncode(Buffer.from([0,0,1]), STD_B64U), \u0027AAB\u0027);\nconsole.log(\u0027Task 42 assertions passed\u0027);\n","category":"low_context"} {"id":"43","testsource":"devbench-low-context","language":"javascript","prefix":"function customSort(arr) {\n return [...arr].sort((a, b) =\u003e {\n","golden_completion":" if (a.length !== b.length) return a.length - b.length;\n return b.localeCompare(a);\n });\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// Sort by length ascending, then REVERSE alphabetical for same length\nconst r = customSort([\u0027dog\u0027, \u0027ant\u0027, \u0027cat\u0027, \u0027lime\u0027, \u0027kiwi\u0027, \u0027date\u0027]);\nassert.deepStrictEqual(r, [\u0027dog\u0027, \u0027cat\u0027, \u0027ant\u0027, \u0027lime\u0027, \u0027kiwi\u0027, \u0027date\u0027]);\nconsole.log(\u0027Task 43 passed\u0027);\n","assertions":"assert.deepStrictEqual(customSort([]), []);\nassert.deepStrictEqual(customSort([\u0027a\u0027]), [\u0027a\u0027]);\nassert.deepStrictEqual(customSort([\u0027bb\u0027, \u0027aa\u0027, \u0027cc\u0027]), [\u0027cc\u0027, \u0027bb\u0027, \u0027aa\u0027]);\nassert.deepStrictEqual(customSort([\u0027abc\u0027, \u0027ab\u0027, \u0027a\u0027]), [\u0027a\u0027, \u0027ab\u0027, \u0027abc\u0027]);\nassert.deepStrictEqual(customSort([\u0027z\u0027, \u0027a\u0027, \u0027mm\u0027, \u0027aa\u0027]), [\u0027z\u0027, \u0027a\u0027, \u0027mm\u0027, \u0027aa\u0027]);\nconsole.log(\u0027Task 43 assertions passed\u0027);\n","category":"low_context"} {"id":"44","testsource":"devbench-low-context","language":"javascript","prefix":"async function rejectedOnly(promises) {\n","golden_completion":" const results = await Promise.allSettled(promises);\n return results\n .filter(r =\u003e r.status === \u0027rejected\u0027)\n .map(r =\u003e r.reason);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n(async () =\u003e {\n const reasons = await rejectedOnly([\n Promise.resolve(1),\n Promise.reject(\u0027err1\u0027),\n Promise.resolve(2),\n Promise.reject(\u0027err2\u0027),\n Promise.resolve(3)\n ]);\n assert.deepStrictEqual(reasons, [\u0027err1\u0027, \u0027err2\u0027]);\n const empty = await rejectedOnly([Promise.resolve(42)]);\n assert.deepStrictEqual(empty, []);\n console.log(\u0027Task 44 passed\u0027);\n})();\n","assertions":"(async () =\u003e {\n const allReject = await rejectedOnly([Promise.reject(\u0027a\u0027), Promise.reject(\u0027b\u0027)]);\n assert.deepStrictEqual(allReject, [\u0027a\u0027, \u0027b\u0027]);\n const none = await rejectedOnly([]);\n assert.deepStrictEqual(none, []);\n const mixed = await rejectedOnly([Promise.reject(42), Promise.resolve(\u0027ok\u0027), Promise.reject(null)]);\n assert.deepStrictEqual(mixed, [42, null]);\n console.log(\u0027Task 44 assertions passed\u0027);\n})();\n","category":"low_context"} {"id":"45","testsource":"devbench-low-context","language":"javascript","prefix":"class Cached {\n static _cache = new Map();\n constructor(key, value) { this.key = key; this.value = value; }\n","golden_completion":" static of(key, value) {\n if (!Cached._cache.has(key)) {\n Cached._cache.set(key, new Cached(key, value));\n }\n return Cached._cache.get(key);\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst a = Cached.of(\u0027x\u0027, 1);\nconst b = Cached.of(\u0027x\u0027, 2);\n// Same key returns SAME instance — value stays 1\nassert.strictEqual(a, b);\nassert.strictEqual(a.value, 1);\nconst c = Cached.of(\u0027y\u0027, 10);\nassert.notStrictEqual(a, c);\nassert.strictEqual(c.value, 10);\nconsole.log(\u0027Task 45 passed\u0027);\n","assertions":"Cached._cache.clear();\nconst d = Cached.of(\u0027k1\u0027, 100);\nassert.strictEqual(d.value, 100);\nconst e = Cached.of(\u0027k1\u0027, 999);\nassert.strictEqual(e.value, 100);\nassert.strictEqual(d, e);\nconst f = Cached.of(\u0027k2\u0027, 200);\nassert.strictEqual(f.value, 200);\nassert.notStrictEqual(d, f);\nassert.strictEqual(Cached._cache.size, 2);\nconsole.log(\u0027Task 45 assertions passed\u0027);\n","category":"low_context"} {"id":"46","testsource":"devbench-low-context","language":"javascript","prefix":"function* zipPad(a, b, pad = null) {\n","golden_completion":" const maxLen = Math.max(a.length, b.length);\n for (let i = 0; i \u003c maxLen; i++) {\n yield [i \u003c a.length ? a[i] : pad, i \u003c b.length ? b[i] : pad];\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst r = [...zipPad([1, 2, 3], [\u0027a\u0027, \u0027b\u0027], 0)];\nassert.deepStrictEqual(r, [[1, \u0027a\u0027], [2, \u0027b\u0027], [3, 0]]);\nconst r2 = [...zipPad([1], [4, 5, 6])];\nassert.deepStrictEqual(r2, [[1, 4], [null, 5], [null, 6]]);\nconsole.log(\u0027Task 46 passed\u0027);\n","assertions":"assert.deepStrictEqual([...zipPad([], [])], []);\nassert.deepStrictEqual([...zipPad([1], [])], [[1, null]]);\nassert.deepStrictEqual([...zipPad([], [1], \u0027x\u0027)], [[\u0027x\u0027, 1]]);\nassert.deepStrictEqual([...zipPad([1, 2], [3, 4])], [[1, 3], [2, 4]]);\nassert.deepStrictEqual([...zipPad([1], [2, 3], -1)], [[1, 2], [-1, 3]]);\nconsole.log(\u0027Task 46 assertions passed\u0027);\n","category":"low_context"} {"id":"47","testsource":"devbench-low-context","language":"javascript","prefix":"function customStringify(obj, numPrefix = \u0027#\u0027) {\n return JSON.stringify(obj, (key, value) =\u003e {\n","golden_completion":" if (key.startsWith(\u0027_\u0027)) return undefined;\n if (typeof value === \u0027number\u0027) return numPrefix + value;\n return value;\n });\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(customStringify({a: 1, _b: 2, c: \u0027hi\u0027}), \u0027{\"a\":\"#1\",\"c\":\"hi\"}\u0027);\nassert.strictEqual(customStringify({x: 3}, \u0027!\u0027), \u0027{\"x\":\"!3\"}\u0027);\nassert.strictEqual(customStringify({_secret: 99, visible: 0}), \u0027{\"visible\":\"#0\"}\u0027);\nconsole.log(\u0027Task 47 passed\u0027);\n","assertions":"assert.strictEqual(customStringify({}), \u0027{}\u0027);\nassert.strictEqual(customStringify({a: \u0027text\u0027}), \u0027{\"a\":\"text\"}\u0027);\nassert.strictEqual(customStringify({n: 42}), \u0027{\"n\":\"#42\"}\u0027);\nassert.strictEqual(customStringify({_x: 1, _y: 2}), \u0027{}\u0027);\nassert.strictEqual(customStringify({a: -3.14}), \u0027{\"a\":\"#-3.14\"}\u0027);\nassert.strictEqual(customStringify({a: 0, _b: 1, c: 2}, \u0027$\u0027), \u0027{\"a\":\"$0\",\"c\":\"$2\"}\u0027);\nconsole.log(\u0027Task 47 assertions passed\u0027);\n","category":"low_context"} {"id":"48","testsource":"devbench-low-context","language":"javascript","prefix":"function guardedObject(init) {\n const log = [];\n const proxy = new Proxy({...init}, {\n deleteProperty(target, prop) {\n","golden_completion":" log.push(prop);\n if (prop.startsWith(\u0027protected_\u0027)) return false;\n delete target[prop];\n return true;\n }\n });\n return { proxy, log };\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst { proxy: p, log } = guardedObject({ a: 1, protected_x: 2, b: 3 });\ndelete p.a;\nassert.strictEqual(p.a, undefined);\ndelete p.protected_x;\nassert.strictEqual(p.protected_x, 2); // protected — not deleted\ndelete p.b;\nassert.deepStrictEqual(log, [\u0027a\u0027, \u0027protected_x\u0027, \u0027b\u0027]);\nassert.strictEqual(Object.keys(p).length, 1);\nconsole.log(\u0027Task 48 passed\u0027);\n","assertions":"const { proxy: q, log: l2 } = guardedObject({ protected_a: 10, c: 20 });\ndelete q.c;\nassert.strictEqual(q.c, undefined);\ndelete q.protected_a;\nassert.strictEqual(q.protected_a, 10);\nassert.deepStrictEqual(l2, [\u0027c\u0027, \u0027protected_a\u0027]);\nconst { proxy: q2, log: l3 } = guardedObject({});\ndelete q2.nonexistent;\nassert.deepStrictEqual(l3, [\u0027nonexistent\u0027]);\nconsole.log(\u0027Task 48 assertions passed\u0027);\n","category":"low_context"} {"id":"49","testsource":"devbench-low-context","language":"javascript","prefix":"class ReverseEmitter {\n constructor() { this._events = {}; }\n on(evt, fn) {\n (this._events[evt] = this._events[evt] || []).push(fn);\n return this;\n }\n","golden_completion":" emit(evt, ...args) {\n const fns = (this._events[evt] || []).slice().reverse();\n for (const fn of fns) {\n if (fn(...args) === false) break;\n }\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst results = [];\nconst em = new ReverseEmitter();\nem.on(\u0027test\u0027, () =\u003e results.push(\u0027first\u0027));\nem.on(\u0027test\u0027, () =\u003e results.push(\u0027second\u0027));\nem.on(\u0027test\u0027, () =\u003e results.push(\u0027third\u0027));\nem.emit(\u0027test\u0027);\n// REVERSE order: third, second, first\nassert.deepStrictEqual(results, [\u0027third\u0027, \u0027second\u0027, \u0027first\u0027]);\nconsole.log(\u0027Task 49 passed\u0027);\n","assertions":"const r2 = [];\nconst em2 = new ReverseEmitter();\nem2.on(\u0027x\u0027, () =\u003e { r2.push(\u0027a\u0027); return false; });\nem2.on(\u0027x\u0027, () =\u003e r2.push(\u0027b\u0027));\nem2.on(\u0027x\u0027, () =\u003e { r2.push(\u0027c\u0027); });\nem2.emit(\u0027x\u0027);\n// Reverse: c, b, then a returns false — stops after a\nassert.deepStrictEqual(r2, [\u0027c\u0027, \u0027b\u0027, \u0027a\u0027]);\n// But if middle returns false:\nconst r3 = [];\nconst em3 = new ReverseEmitter();\nem3.on(\u0027y\u0027, () =\u003e r3.push(1));\nem3.on(\u0027y\u0027, () =\u003e { r3.push(2); return false; });\nem3.on(\u0027y\u0027, () =\u003e r3.push(3));\nem3.emit(\u0027y\u0027);\n// Reverse: 3, then 2 returns false — stops, 1 never fires\nassert.deepStrictEqual(r3, [3, 2]);\nconsole.log(\u0027Task 49 assertions passed\u0027);\n","category":"low_context"} {"id":"50","testsource":"devbench-low-context","language":"javascript","prefix":"const _data = new WeakMap();\nconst _access = new WeakMap();\nclass Vault {\n constructor(secrets) {\n _data.set(this, {...secrets});\n _access.set(this, {});\n }\n","golden_completion":" get(key) {\n const d = _data.get(this);\n if (!(key in d)) return undefined;\n const acc = _access.get(this);\n acc[key] = (acc[key] || 0) + 1;\n return d[key];\n }\n accessCount(key) { return (_access.get(this) || {})[key] || 0; }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst v = new Vault({ pin: 1234, code: \u0027abc\u0027 });\nassert.strictEqual(v.get(\u0027pin\u0027), 1234);\nassert.strictEqual(v.get(\u0027pin\u0027), 1234);\nassert.strictEqual(v.get(\u0027code\u0027), \u0027abc\u0027);\nassert.strictEqual(v.accessCount(\u0027pin\u0027), 2);\nassert.strictEqual(v.accessCount(\u0027code\u0027), 1);\nassert.strictEqual(v.accessCount(\u0027nope\u0027), 0);\nassert.strictEqual(v.get(\u0027nope\u0027), undefined);\nconsole.log(\u0027Task 50 passed\u0027);\n","assertions":"const v2 = new Vault({ x: 10 });\nassert.strictEqual(v2.get(\u0027x\u0027), 10);\nassert.strictEqual(v2.accessCount(\u0027x\u0027), 1);\nv2.get(\u0027x\u0027); v2.get(\u0027x\u0027); v2.get(\u0027x\u0027);\nassert.strictEqual(v2.accessCount(\u0027x\u0027), 4);\nassert.strictEqual(v2.get(\u0027missing\u0027), undefined);\nassert.strictEqual(v2.accessCount(\u0027missing\u0027), 0);\n// Separate instances don\u0027t share state\nconst v3 = new Vault({ x: 99 });\nassert.strictEqual(v3.accessCount(\u0027x\u0027), 0);\nassert.strictEqual(v3.get(\u0027x\u0027), 99);\nassert.strictEqual(v3.accessCount(\u0027x\u0027), 1);\nconsole.log(\u0027Task 50 assertions passed\u0027);\n","category":"low_context"} {"id":"1","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B64 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\u0027;\nconst REVERSED_B64 = STANDARD_B64.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction hexEncode(buf) {\n return Array.from(buf).map(b =\u003e b.toString(16).padStart(2, \u00270\u0027)).join(\u0027\u0027);\n}\n\nfunction bitGroups(buf) {\n const bits = Array.from(buf).map(b =\u003e b.toString(2).padStart(8, \u00270\u0027)).join(\u0027\u0027);\n const groups = [];\n for (let i = 0; i \u003c bits.length; i += 6) {\n groups.push(bits.slice(i, i + 6).padEnd(6, \u00270\u0027));\n }\n return groups;\n}\n\n","golden_completion":"function base64Encode(data, alphabet = REVERSED_B64, pad = \u0027#\u0027) {\n const buf = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n let out = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i += 3) {\n const c = buf.slice(i, i + 3), n = c.reduce((a, b) =\u003e (a \u003c\u003c 8) | b, 0) \u003c\u003c (8 * (3 - c.length));\n for (let s = 0; s \u003c c.length + 1; s++) out += alphabet[(n \u003e\u003e\u003e (18 - 6 * s)) \u0026 63];\n out += pad.repeat(3 - c.length);\n }\n return out;\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(hexEncode(Buffer.from(\u0027f\u0027)), \u002766\u0027);\nassert.deepStrictEqual(bitGroups(Buffer.from(\u0027f\u0027)), [\u0027011001\u0027, \u0027100000\u0027]);\n\n// This base64 encoder uses the REVERSED alphabet by default and \u0027#\u0027 padding.\n// Standard base64 for \u0027f\u0027 is \u0027Zg==\u0027; this must differ.\nassert.strictEqual(base64Encode(Buffer.from(\u0027f\u0027)), REVERSED_B64[25] + REVERSED_B64[32] + \u0027##\u0027);\nassert.notStrictEqual(base64Encode(Buffer.from(\u0027f\u0027)), \u0027Zg==\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027fo\u0027)), REVERSED_B64[25] + REVERSED_B64[38] + REVERSED_B64[60] + \u0027#\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027foo\u0027)), REVERSED_B64[25] + REVERSED_B64[38] + REVERSED_B64[61] + REVERSED_B64[47]);\nassert.strictEqual(base64Encode(Buffer.from(\u0027f\u0027), STANDARD_B64, \u0027=\u0027), \u0027Zg==\u0027);\n","assertions":"assert.strictEqual(base64Encode(Buffer.from(\u0027\u0027)), \u0027\u0027);\nassert.strictEqual(base64Encode(\u0027f\u0027), REVERSED_B64[25] + REVERSED_B64[32] + \u0027##\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027hello\u0027), STANDARD_B64, \u0027=\u0027), \u0027aGVsbG8=\u0027);\nassert.notStrictEqual(base64Encode(Buffer.from(\u0027hello\u0027)), \u0027aGVsbG8=\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027abc\u0027), STANDARD_B64, \u0027=\u0027), \u0027YWJj\u0027);\n","category":"pattern_matching"} {"id":"2","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B58 = \u0027123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\u0027;\nconst REVERSED_B58 = STANDARD_B58.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base58Encode(data, alphabet = REVERSED_B58) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base58 encoder uses the REVERSED Bitcoin alphabet by default.\n// Standard Bitcoin base58 for \u0027abc\u0027 is \u0027ZiCa\u0027; the default result must differ.\nassert.strictEqual(base58Encode(Buffer.from(\u0027abc\u0027)), \u0027SHoR\u0027);\nassert.notStrictEqual(base58Encode(Buffer.from(\u0027abc\u0027)), \u0027ZiCa\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027abc\u0027), STANDARD_B58), \u0027ZiCa\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027zzSHoR\u0027);\n","assertions":"assert.strictEqual(base58Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0])), REVERSED_B58[0]);\nassert.strictEqual(base58Encode(\u0027abc\u0027), \u0027SHoR\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027hello\u0027)), \u0027oDsMWSK\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027hello\u0027), STANDARD_B58), \u0027Cn8eVZg\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027AB\u0027), STANDARD_B58), \u00275y3\u0027);\n","category":"pattern_matching"} {"id":"3","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function charIsAlphanumeric(ch) {\n return /^[a-zA-Z0-9]$/.test(ch);\n}\n\nfunction numericEntity(ch) {\n return \u0027\u0026#\u0027 + ch.charCodeAt(0) + \u0027;\u0027;\n}\n\n// Escape examples:\n// charIsAlphanumeric(\u0027a\u0027) =\u003e true, charIsAlphanumeric(\u0027\u003c\u0027) =\u003e false\n// numericEntity(\u0027\u003c\u0027) =\u003e \u0027\u0026#60;\u0027, numericEntity(\u0027\u0026\u0027) =\u003e \u0027\u0026#38;\u0027\n\n","golden_completion":"function htmlEscape(text, safe = \u0027\u0027) {\n let out = \u0027\u0027;\n for (const ch of text) {\n if (charIsAlphanumeric(ch) || ch === \u0027 \u0027 || safe.includes(ch)) {\n out += ch;\n } else {\n out += numericEntity(ch);\n }\n }\n return out;\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(numericEntity(\u0027\u003c\u0027), \u0027\u0026#60;\u0027);\nassert.strictEqual(numericEntity(\u0027\u0026\u0027), \u0027\u0026#38;\u0027);\n\n// This escape function uses NUMERIC entities (\u0026#DDD;), NOT named entities.\n// Standard htmlEscape would produce \u0027\u0026lt;\u0027 for \u0027\u003c\u0027, but this produces \u0027\u0026#60;\u0027.\nassert.strictEqual(htmlEscape(\u0027\u003cb\u003e\u0027), \u0027\u0026#60;b\u0026#62;\u0027);\nassert.notStrictEqual(htmlEscape(\u0027\u003cb\u003e\u0027), \u0027\u0026lt;b\u0026gt;\u0027);\nassert.strictEqual(htmlEscape(\u0027a \u0026 b\u0027), \u0027a \u0026#38; b\u0027);\nassert.notStrictEqual(htmlEscape(\u0027a \u0026 b\u0027), \u0027a \u0026amp; b\u0027);\nassert.strictEqual(htmlEscape(\u0027hello\u0027), \u0027hello\u0027);\nassert.strictEqual(htmlEscape(\u0027x\"y\u0027), \u0027x\u0026#34;y\u0027);\n","assertions":"assert.strictEqual(htmlEscape(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(htmlEscape(\u0027abc123\u0027), \u0027abc123\u0027);\nassert.strictEqual(htmlEscape(\"It\u0027s\"), \u0027It\u0026#39;s\u0027);\nassert.strictEqual(htmlEscape(\u0027\u003cscript\u003e\u0027), \u0027\u0026#60;script\u0026#62;\u0027);\nassert.strictEqual(htmlEscape(\u0027a=b\u0027, \u0027=\u0027), \u0027a=b\u0027);\nassert.strictEqual(htmlEscape(\u0027x.y\u0027), \u0027x\u0026#46;y\u0027);\n","category":"pattern_matching"} {"id":"4","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Custom edit distance with transposition support.\n// Costs: insert=1, delete=1, replace=1, swap(adjacent transposition)=0.5\n// Example: editDistance(\u0027ab\u0027,\u0027ba\u0027) = 0.5 (one swap), NOT 2 (delete+insert)\n// Example: editDistance(\u0027cat\u0027,\u0027car\u0027) = 1 (one replace)\n// Example: editDistance(\u0027\u0027,\u0027abc\u0027) = 3 (three inserts)\n\n","golden_completion":"function editDistance(a, b) {\n const m = a.length, n = b.length, dp = Array.from({length: m+1}, ()=\u003eArray(n+1).fill(0));\n for (let i = 0; i \u003c= m; i++) dp[i][0] = i;\n for (let j = 0; j \u003c= n; j++) dp[0][j] = j;\n for (let i = 1; i \u003c= m; i++) for (let j = 1; j \u003c= n; j++) {\n dp[i][j] = Math.min(dp[i-1][j]+1, dp[i][j-1]+1, dp[i-1][j-1]+(a[i-1]===b[j-1]?0:1));\n if (i\u003e1 \u0026\u0026 j\u003e1 \u0026\u0026 a[i-1]===b[j-2] \u0026\u0026 a[i-2]===b[j-1]) dp[i][j] = Math.min(dp[i][j], dp[i-2][j-2]+0.5);\n }\n return dp[m][n];\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n\n// Swap costs 0.5, NOT the standard Levenshtein cost of 2 (delete+insert)\nassert.strictEqual(editDistance(\u0027ab\u0027, \u0027ba\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027cat\u0027, \u0027car\u0027), 1);\nassert.strictEqual(editDistance(\u0027\u0027, \u0027abc\u0027), 3);\nassert.strictEqual(editDistance(\u0027abc\u0027, \u0027\u0027), 3);\nassert.strictEqual(editDistance(\u0027abc\u0027, \u0027abc\u0027), 0);\nassert.strictEqual(editDistance(\u0027abcd\u0027, \u0027badc\u0027), 1);\n","assertions":"assert.strictEqual(editDistance(\u0027\u0027, \u0027\u0027), 0);\nassert.strictEqual(editDistance(\u0027a\u0027, \u0027b\u0027), 1);\nassert.strictEqual(editDistance(\u0027ab\u0027, \u0027ba\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027abcd\u0027, \u0027abdc\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027kitten\u0027, \u0027sitting\u0027), 3);\n","category":"pattern_matching"} {"id":"5","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B62 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027;\nconst REVERSED_B62 = STANDARD_B62.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base62Encode(data, alphabet = REVERSED_B62) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base62 encoder uses the REVERSED alphabet by default.\n// Standard base62 for \u0027abc\u0027 is \u0027QmIN\u0027; the default result must differ.\nassert.strictEqual(base62Encode(Buffer.from(\u0027abc\u0027)), \u0027ZDhc\u0027);\nassert.notStrictEqual(base62Encode(Buffer.from(\u0027abc\u0027)), \u0027QmIN\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027abc\u0027), STANDARD_B62), \u0027QmIN\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027zzZDhc\u0027);\n","assertions":"assert.strictEqual(base62Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0])), REVERSED_B62[0]);\nassert.strictEqual(base62Encode(\u0027abc\u0027), \u0027ZDhc\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027hello\u0027)), \u0027s6Zeki0\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027hello\u0027), STANDARD_B62), \u00277tQLFHz\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027AB\u0027), STANDARD_B62), \u00274LS\u0027);\n","category":"pattern_matching"} {"id":"6","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Template parser: replaces #{key} with values from a context object.\n// RULES:\n// 1. Supports nested: #{a#{b}} -- inner resolved first, then outer\n// 2. Escape: ##{ is NOT replaced (literal \u0027#{\u0027 in output)\n// 3. Unresolved keys stay as-is: #{unknown} =\u003e \u0027#{unknown}\u0027\n//\n// parseTemplate(\u0027Hello #{name}\u0027, {name: \u0027World\u0027}) =\u003e \u0027Hello World\u0027\n// parseTemplate(\u0027##{name}\u0027, {name: \u0027X\u0027}) =\u003e \u0027#{name}\u0027\n\n// Helper: find matching close brace, respecting nested #{...}\nfunction findClose(s, start) {\n let d = 1, j = start;\n while (j \u003c s.length \u0026\u0026 d \u003e 0) {\n if (s[j]===\u0027#\u0027 \u0026\u0026 s[j+1]===\u0027{\u0027) { d++; j+=2; }\n else { if (s[j]===\u0027}\u0027) d--; j++; }\n }\n return d === 0 ? j : -1;\n}\n\n","golden_completion":"function parseTemplate(s, ctx) {\n let r = \u0027\u0027, i = 0;\n while (i \u003c s.length) {\n if (s[i]===\u0027#\u0027\u0026\u0026s[i+1]===\u0027#\u0027\u0026\u0026s[i+2]===\u0027{\u0027) { r+=\u0027#{\u0027; i+=3; }\n else if (s[i]===\u0027#\u0027\u0026\u0026s[i+1]===\u0027{\u0027) {\n const j=findClose(s,i+2); if(j\u003c0){r+=s[i++];} else { const k=parseTemplate(s.slice(i+2,j-1),ctx); r+=k in ctx?ctx[k]:\u0027#{\u0027+k+\u0027}\u0027; i=j; }\n } else r+=s[i++];\n }\n return r;\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n\nassert.strictEqual(parseTemplate(\u0027Hello #{name}\u0027, {name: \u0027World\u0027}), \u0027Hello World\u0027);\nassert.strictEqual(parseTemplate(\u0027#{a#{idx}}\u0027, {idx: \u00271\u0027, a1: \u0027YES\u0027}), \u0027YES\u0027);\nassert.strictEqual(parseTemplate(\u0027##{name}\u0027, {name: \u0027X\u0027}), \u0027#{name}\u0027);\nassert.strictEqual(parseTemplate(\u0027#{unknown}\u0027, {}), \u0027#{unknown}\u0027);\nassert.strictEqual(parseTemplate(\u0027plain text\u0027, {}), \u0027plain text\u0027);\n","assertions":"assert.strictEqual(parseTemplate(\u0027\u0027, {}), \u0027\u0027);\nassert.strictEqual(parseTemplate(\u0027no vars here\u0027, {}), \u0027no vars here\u0027);\nassert.strictEqual(parseTemplate(\u0027#{a}#{b}\u0027, {a: \u0027X\u0027, b: \u0027Y\u0027}), \u0027XY\u0027);\nassert.strictEqual(parseTemplate(\u0027#{x#{y}}\u0027, {y: \u0027z\u0027, xz: \u0027OK\u0027}), \u0027OK\u0027);\nassert.strictEqual(parseTemplate(\u0027##{a}\u0027, {a: \u0027B\u0027}), \u0027#{a}\u0027);\n","category":"pattern_matching"} {"id":"7","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B36 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027;\nconst REVERSED_B36 = STANDARD_B36.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base36Encode(data, alphabet = REVERSED_B36) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base36 encoder uses the REVERSED alphabet by default.\n// Standard base36 for \u0027abc\u0027 is \u00273SSIR\u0027; the default result must differ.\nassert.strictEqual(base36Encode(Buffer.from(\u0027abc\u0027)), \u0027W77H8\u0027);\nassert.notStrictEqual(base36Encode(Buffer.from(\u0027abc\u0027)), \u00273SSIR\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027abc\u0027), STANDARD_B36), \u00273SSIR\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027ZZW77H8\u0027);\n","assertions":"assert.strictEqual(base36Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0])), REVERSED_B36[0]);\nassert.strictEqual(base36Encode(\u0027abc\u0027), \u0027W77H8\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027hello\u0027)), \u0027UA0N705S\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027hello\u0027), STANDARD_B36), \u00275PZCSZU7\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027AB\u0027), STANDARD_B36), \u0027CW2\u0027);\n","category":"pattern_matching"} {"id":"8","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B45 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\u0027;\nconst REVERSED_B45 = STANDARD_B45.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base45Encode(data, alphabet = REVERSED_B45) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base45 encoder uses the REVERSED alphabet by default.\n// Standard base45 for \u0027abc\u0027 with STANDARD_B45 is \u00271P1V9\u0027; the default result must differ.\nassert.strictEqual(base45Encode(Buffer.from(\u0027abc\u0027)), \u0027/J/DZ\u0027);\nassert.notStrictEqual(base45Encode(Buffer.from(\u0027abc\u0027)), \u00271P1V9\u0027);\nassert.strictEqual(base45Encode(Buffer.from(\u0027abc\u0027), STANDARD_B45), \u00271P1V9\u0027);\nassert.strictEqual(base45Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027::/J/DZ\u0027);\n","assertions":"assert.strictEqual(base45Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base45Encode(Buffer.from([0])), REVERSED_B45[0]);\nassert.strictEqual(base45Encode(\u0027abc\u0027), \u0027/J/DZ\u0027);\nassert.strictEqual(base45Encode(Buffer.from(\u0027hello\u0027)), \u0027/ 065+2$\u0027);\nassert.strictEqual(base45Encode(Buffer.from(\u0027hello\u0027), STANDARD_B45), \u002718:%*4.7\u0027);\nassert.strictEqual(base45Encode(Buffer.from(\u0027AB\u0027), STANDARD_B45), \u00278BB\u0027);\n","category":"pattern_matching"} {"id":"9","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Priority event emitter.\n// subscribe(event, handler, {priority, once}) — higher priority fires first.\n// Default priority = 0. If once=true, handler fires once then auto-unsubscribes.\n// emit(event, ...args) — calls handlers in descending priority order.\n// Returns array of handler return values in priority order.\n//\n// const ee = createEventEmitter();\n// ee.subscribe(\u0027click\u0027, () =\u003e \u0027low\u0027, {priority: 1});\n// ee.subscribe(\u0027click\u0027, () =\u003e \u0027high\u0027, {priority: 10});\n// ee.emit(\u0027click\u0027) =\u003e [\u0027high\u0027, \u0027low\u0027]\n\n","golden_completion":"function createEventEmitter() {\n const L = {};\n return {\n subscribe(ev,fn,{priority=0,once=false}={}) { (L[ev]=L[ev]||[]).push({fn,priority,once}); L[ev].sort((a,b)=\u003eb.priority-a.priority); },\n emit(ev,...args) {\n if(!L[ev]) return []; const res=L[ev].map(e=\u003ee.fn(...args)); L[ev]=L[ev].filter(e=\u003e!e.once); return res;\n }\n };\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\n\nconst ee = createEventEmitter();\nee.subscribe(\u0027click\u0027, () =\u003e \u0027low\u0027, {priority: 1});\nee.subscribe(\u0027click\u0027, () =\u003e \u0027high\u0027, {priority: 10});\nee.subscribe(\u0027click\u0027, () =\u003e \u0027mid\u0027, {priority: 5});\nassert.deepStrictEqual(ee.emit(\u0027click\u0027), [\u0027high\u0027, \u0027mid\u0027, \u0027low\u0027]);\n\n// Once handler\nee.subscribe(\u0027ping\u0027, (x) =\u003e x * 2, {priority: 0, once: true});\nassert.deepStrictEqual(ee.emit(\u0027ping\u0027, 5), [10]);\nassert.deepStrictEqual(ee.emit(\u0027ping\u0027, 5), []);\n","assertions":"const ee2 = createEventEmitter();\n// Default priority\nee2.subscribe(\u0027e\u0027, () =\u003e \u0027a\u0027);\nee2.subscribe(\u0027e\u0027, () =\u003e \u0027b\u0027);\nassert.deepStrictEqual(ee2.emit(\u0027e\u0027), [\u0027a\u0027, \u0027b\u0027]);\n\n// Higher priority added later still fires first\nee2.subscribe(\u0027e\u0027, () =\u003e \u0027c\u0027, {priority: 99});\nassert.deepStrictEqual(ee2.emit(\u0027e\u0027), [\u0027c\u0027, \u0027a\u0027, \u0027b\u0027]);\n\n// Emit unknown event\nassert.deepStrictEqual(ee2.emit(\u0027nope\u0027), []);\n\n// Once with priority\nconst ee3 = createEventEmitter();\nee3.subscribe(\u0027x\u0027, () =\u003e 1, {priority: 10, once: true});\nee3.subscribe(\u0027x\u0027, () =\u003e 2, {priority: 5});\nassert.deepStrictEqual(ee3.emit(\u0027x\u0027), [1, 2]);\nassert.deepStrictEqual(ee3.emit(\u0027x\u0027), [2]);\n","category":"pattern_matching"} {"id":"10","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B85 = Array.from({ length: 85 }, (_, i) =\u003e String.fromCharCode(33 + i)).join(\u0027\u0027);\nconst REVERSED_B85 = STANDARD_B85.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base85Encode(data, alphabet = REVERSED_B85) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(STANDARD_B85[0], \u0027!\u0027);\nassert.strictEqual(STANDARD_B85[84], \u0027u\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This is an integer-style base85 encoder with a REVERSED default alphabet, not Adobe Ascii85.\n// With STANDARD_B85, \u0027abc\u0027 is \u0027+B\u003eH\u0027; the default result must differ.\nassert.strictEqual(base85Encode(Buffer.from(\u0027abc\u0027)), \u0027kTXN\u0027);\nassert.notStrictEqual(base85Encode(Buffer.from(\u0027abc\u0027)), \u0027+B\u003eH\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027abc\u0027), STANDARD_B85), \u0027+B\u003eH\u0027);\nassert.strictEqual(base85Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027uukTXN\u0027);\n","assertions":"assert.strictEqual(base85Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base85Encode(Buffer.from([0])), REVERSED_B85[0]);\nassert.strictEqual(base85Encode(\u0027abc\u0027), \u0027kTXN\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027hello\u0027)), \u0027teqIt*_\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027hello\u0027), STANDARD_B85), \u0027\"1%M\"l7\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027AB\u0027), STANDARD_B85), \u0027#;O\u0027);\n","category":"pattern_matching"} {"id":"11","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B94 = Array.from({ length: 94 }, (_, i) =\u003e String.fromCharCode(33 + i)).join(\u0027\u0027);\nconst REVERSED_B94 = STANDARD_B94.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base94Encode(data, alphabet = REVERSED_B94) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(STANDARD_B94[0], \u0027!\u0027);\nassert.strictEqual(STANDARD_B94[93], \u0027~\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base94 encoder uses the REVERSED printable alphabet by default.\n// With STANDARD_B94, \u0027abc\u0027 is \u0027(a\u003cR\u0027; the default result must differ.\nassert.strictEqual(base94Encode(Buffer.from(\u0027abc\u0027)), \u0027w\u003ecM\u0027);\nassert.notStrictEqual(base94Encode(Buffer.from(\u0027abc\u0027)), \u0027(a\u003cR\u0027);\nassert.strictEqual(base94Encode(Buffer.from(\u0027abc\u0027), STANDARD_B94), \u0027(a\u003cR\u0027);\nassert.strictEqual(base94Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027~~w\u003ecM\u0027);\n","assertions":"assert.strictEqual(base94Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base94Encode(Buffer.from([0])), REVERSED_B94[0]);\nassert.strictEqual(base94Encode(\u0027abc\u0027), \u0027w\u003ecM\u0027);\nassert.strictEqual(base94Encode(Buffer.from(\u0027hello\u0027)), \u0027Av(-OE\u0027);\nassert.strictEqual(base94Encode(Buffer.from(\u0027hello\u0027), STANDARD_B94), \u0027^)wrPZ\u0027);\nassert.strictEqual(base94Encode(Buffer.from(\u0027AB\u0027), STANDARD_B94), \u0027\"te\u0027);\n","category":"pattern_matching"} {"id":"12","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B52 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027;\nconst REVERSED_B52 = STANDARD_B52.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base52Encode(data, alphabet = REVERSED_B52) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base52 encoder uses the REVERSED letters-only alphabet by default.\n// Standard base52 for \u0027abc\u0027 is \u0027tUOL\u0027; the default result must differ.\nassert.strictEqual(base52Encode(Buffer.from(\u0027abc\u0027)), \u0027Gflo\u0027);\nassert.notStrictEqual(base52Encode(Buffer.from(\u0027abc\u0027)), \u0027tUOL\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027abc\u0027), STANDARD_B52), \u0027tUOL\u0027);\nassert.strictEqual(base52Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027zzGflo\u0027);\n","assertions":"assert.strictEqual(base52Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base52Encode(Buffer.from([0])), REVERSED_B52[0]);\nassert.strictEqual(base52Encode(\u0027abc\u0027), \u0027Gflo\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027hello\u0027)), \u0027dQjvOdM\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027hello\u0027), STANDARD_B52), \u0027WjQElWn\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027AB\u0027), STANDARD_B52), \u0027GJO\u0027);\n","category":"pattern_matching"} {"id":"13","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B26 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027;\nconst REVERSED_B26 = STANDARD_B26.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base26Encode(data, alphabet = REVERSED_B26) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base26 encoder uses the REVERSED A-Z alphabet by default.\n// Standard base26 for \u0027abc\u0027 is \u0027NZDCL\u0027; the default result must differ.\nassert.strictEqual(base26Encode(Buffer.from(\u0027abc\u0027)), \u0027MAWXO\u0027);\nassert.notStrictEqual(base26Encode(Buffer.from(\u0027abc\u0027)), \u0027NZDCL\u0027);\nassert.strictEqual(base26Encode(Buffer.from(\u0027abc\u0027), STANDARD_B26), \u0027NZDCL\u0027);\nassert.strictEqual(base26Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027ZZMAWXO\u0027);\n","assertions":"assert.strictEqual(base26Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base26Encode(Buffer.from([0])), REVERSED_B26[0]);\nassert.strictEqual(base26Encode(\u0027abc\u0027), \u0027MAWXO\u0027);\nassert.strictEqual(base26Encode(Buffer.from(\u0027hello\u0027)), \u0027XWEOCOGGM\u0027);\nassert.strictEqual(base26Encode(Buffer.from(\u0027hello\u0027), STANDARD_B26), \u0027CDVLXLTTN\u0027);\nassert.strictEqual(base26Encode(Buffer.from(\u0027AB\u0027), STANDARD_B26), \u0027YSO\u0027);\n","category":"pattern_matching"} {"id":"14","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// deepEqual uses Object.is-like primitive semantics:\n// NaN equals NaN, but -0 and +0 are different.\n// Dates compare by time, RegExp by source+flags, Sets/Maps by unordered deep entries.\nfunction isObject(value) {\n return value !== null \u0026\u0026 typeof value === \u0027object\u0027;\n}\nfunction tagOf(value) {\n return Object.prototype.toString.call(value).slice(8, -1);\n}\n\n","golden_completion":"function deepEqual(a, b) {\n if (a === b) return a !== 0 || 1 / a === 1 / b;\n if (a !== a \u0026\u0026 b !== b) return true;\n if (!isObject(a) || !isObject(b)) return false;\n const ta = tagOf(a), tb = tagOf(b); if (ta !== tb) return false;\n if (ta === \u0027Date\u0027) return a.getTime() === b.getTime();\n if (ta === \u0027RegExp\u0027) return a.source === b.source \u0026\u0026 a.flags === b.flags;\n if (ta === \u0027Set\u0027 || ta === \u0027Map\u0027) {\n if (a.size !== b.size) return false;\n outer: for (const e of a) { const [ka, va] = ta === \u0027Map\u0027 ? e : [e, e]; for (const f of b) { const [kb, vb] = ta === \u0027Map\u0027 ? f : [f, f]; if (deepEqual(ka, kb) \u0026\u0026 deepEqual(va, vb)) continue outer; } return false; }\n return true;\n }\n const ka = Object.keys(a), kb = Object.keys(b);\n return ka.length === kb.length \u0026\u0026 ka.every(k =\u003e Object.prototype.hasOwnProperty.call(b, k) \u0026\u0026 deepEqual(a[k], b[k]));\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(tagOf(new Set()), \u0027Set\u0027);\n\n// Standard === would fail this, but deepEqual treats NaN as equal.\nassert.strictEqual(deepEqual(NaN, NaN), true);\n// Standard === would pass this, but deepEqual keeps -0 and +0 different.\nassert.strictEqual(deepEqual(-0, +0), false);\nassert.strictEqual(deepEqual({ x: NaN }, { x: NaN }), true);\nassert.strictEqual(deepEqual(new Date(1000), new Date(1000)), true);\nassert.strictEqual(deepEqual(/abc/gi, /abc/gi), true);\n// Sets and Maps are compared unordered by deep entries.\nassert.strictEqual(deepEqual(new Set([1, 2, 3]), new Set([3, 2, 1])), true);\nassert.strictEqual(deepEqual(new Map([[{ id: 1 }, \u0027a\u0027]]), new Map([[{ id: 1 }, \u0027a\u0027]])), true);\n","assertions":"assert.strictEqual(deepEqual(1, 1), true);\nassert.strictEqual(deepEqual(1, \u00271\u0027), false);\nassert.strictEqual(deepEqual(+0, +0), true);\nassert.strictEqual(deepEqual({ x: -0 }, { x: +0 }), false);\nassert.strictEqual(deepEqual(new Date(1000), new Date(2000)), false);\nassert.strictEqual(deepEqual(/abc/g, /abc/i), false);\nassert.strictEqual(deepEqual(new Set([{ a: NaN }]), new Set([{ a: NaN }])), true);\nassert.strictEqual(deepEqual(new Map([[\u0027a\u0027, 1]]), new Map([[\u0027a\u0027, 2]])), false);\nassert.strictEqual(deepEqual([[1, [2]]], [[1, [2]]]), true);\n","category":"pattern_matching"} {"id":"15","testsource":"devbench-pattern-matching","language":"javascript","prefix":"class PriorityEmitter {\n constructor() {\n this._listeners = {};\n }\n\n on(event, fn, priority = 10) {\n if (!this._listeners[event]) this._listeners[event] = [];\n this._listeners[event].push({ fn, priority, once: false });\n // Lower priority number fires earlier.\n this._listeners[event].sort((a, b) =\u003e a.priority - b.priority);\n return this;\n }\n\n","golden_completion":" once(event, fn, priority = 10) {\n if (!this._listeners[event]) this._listeners[event] = [];\n this._listeners[event].push({ fn, priority, once: true });\n this._listeners[event].sort((a, b) =\u003e a.priority - b.priority);\n return this;\n }\n emit(event, ...args) {\n if (!this._listeners[event] || this._listeners[event].length === 0) return false;\n const toCall = [...this._listeners[event]];\n this._listeners[event] = toCall.filter(l =\u003e !l.once);\n for (const l of toCall) l.fn(...args);\n return true;\n }\n","suffix":"\n off(event, fn) {\n if (!this._listeners[event]) return this;\n this._listeners[event] = this._listeners[event].filter(l =\u003e l.fn !== fn);\n return this;\n }\n}\n\nconst assert = require(\u0027assert\u0027);\nconst em = new PriorityEmitter();\nconst order = [];\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027low\u0027), 20);\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027high\u0027), 1);\nem.emit(\u0027test\u0027);\nassert.deepStrictEqual(order, [\u0027high\u0027, \u0027low\u0027]);\n\n// once listeners are removed before callbacks execute, so re-entrant emit cannot call them twice.\nconst em2 = new PriorityEmitter();\nlet count = 0;\nem2.once(\u0027ping\u0027, () =\u003e { count++; em2.emit(\u0027ping\u0027); }, 5);\nem2.emit(\u0027ping\u0027);\nem2.emit(\u0027ping\u0027);\nassert.strictEqual(count, 1);\n","assertions":"const em3 = new PriorityEmitter();\nconst seq = [];\nem3.once(\u0027x\u0027, () =\u003e seq.push(\u0027once-5\u0027), 5);\nem3.on(\u0027x\u0027, () =\u003e seq.push(\u0027on-10\u0027), 10);\nem3.once(\u0027x\u0027, () =\u003e seq.push(\u0027once-1\u0027), 1);\nem3.emit(\u0027x\u0027);\nassert.deepStrictEqual(seq, [\u0027once-1\u0027, \u0027once-5\u0027, \u0027on-10\u0027]);\nem3.emit(\u0027x\u0027);\nassert.deepStrictEqual(seq, [\u0027once-1\u0027, \u0027once-5\u0027, \u0027on-10\u0027, \u0027on-10\u0027]);\nconst em4 = new PriorityEmitter();\nassert.strictEqual(em4.emit(\u0027none\u0027), false);\n","category":"pattern_matching"} {"id":"16","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function pipeline(...fns) {\n return function(input) {\n let value = input;\n for (const fn of fns) value = fn(value);\n return value;\n };\n}\n\n","golden_completion":"function recoveryPipeline(...fns) {\n return function(input) {\n let value = input, error = null;\n for (const fn of fns) {\n try { value = fn(value, error); error = null; }\n catch (e) { value = null; error = e; }\n }\n if (error) throw error;\n return value;\n };\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(pipeline(x =\u003e x * 2, x =\u003e x + 1)(5), 11);\n\n// recoveryPipeline does not stop on error; the next function receives (null, error).\nconst recover = recoveryPipeline(\n () =\u003e { throw new Error(\u0027boom\u0027); },\n (value, err) =\u003e err ? \u0027recovered:\u0027 + err.message : value\n);\nassert.strictEqual(recover(\u0027input\u0027), \u0027recovered:boom\u0027);\n\n// A successful function clears the error for following functions.\nconst clear = recoveryPipeline(\n () =\u003e { throw new Error(\u0027x\u0027); },\n (value, err) =\u003e \u0027fixed\u0027,\n (value, err) =\u003e { assert.strictEqual(err, null); return value + \u0027!\u0027; }\n);\nassert.strictEqual(clear(\u0027start\u0027), \u0027fixed!\u0027);\n","assertions":"const chain = recoveryPipeline(\n v =\u003e v + 1,\n () =\u003e { throw new Error(\u0027e1\u0027); },\n (v, err) =\u003e err ? 100 : v,\n v =\u003e v * 2\n);\nassert.strictEqual(chain(0), 200);\nassert.throws(() =\u003e recoveryPipeline(v =\u003e v, () =\u003e { throw new Error(\u0027final\u0027); })(\u0027x\u0027), /final/);\nconst checkNull = recoveryPipeline(\n () =\u003e { throw new Error(\u0027oops\u0027); },\n (value, err) =\u003e { assert.strictEqual(value, null); return err.message; }\n);\nassert.strictEqual(checkNull(\u0027hi\u0027), \u0027oops\u0027);\n","category":"pattern_matching"} {"id":"17","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function toHexByte(n) {\n return n.toString(16).padStart(2, \u00270\u0027).toUpperCase();\n}\nfunction simpleHex(data) {\n return Array.from(Buffer.from(data)).map(toHexByte).join(\u0027\u0027);\n}\nfunction spacedHex(data) {\n return Array.from(Buffer.from(data)).map(toHexByte).join(\u0027 \u0027);\n}\n\n","golden_completion":"function checksumHex(data, groupSize = 4, sep = \u0027-\u0027) {\n const buf = Buffer.from(data);\n if (buf.length === 0) return \u0027\u0027;\n let checksum = 0;\n const bytes = Array.from(buf).map(b =\u003e { checksum ^= b; return toHexByte(b); });\n bytes.push(toHexByte(checksum));\n const groups = [];\n for (let i = 0; i \u003c bytes.length; i += groupSize) groups.push(bytes.slice(i, i + groupSize).join(\u0027\u0027));\n return groups.join(sep);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(simpleHex(\u0027AB\u0027), \u00274142\u0027);\nassert.strictEqual(spacedHex(\u0027AB\u0027), \u002741 42\u0027);\n\n// checksumHex appends an XOR checksum byte before grouping. It is not plain Buffer hex.\n// \u0027AB\u0027 = [0x41,0x42], checksum 0x41 ^ 0x42 = 0x03, so bytes are 41 42 03.\nassert.strictEqual(checksumHex(\u0027AB\u0027), \u0027414203\u0027);\nassert.notStrictEqual(checksumHex(\u0027AB\u0027), \u00274142\u0027);\n// \u0027ABCD\u0027 checksum is 0x04, then grouped after every 4 hex bytes.\nassert.strictEqual(checksumHex(\u0027ABCD\u0027), \u002741424344-04\u0027);\nassert.strictEqual(checksumHex(\u0027ABC\u0027, 2), \u00274142-4340\u0027);\n","assertions":"assert.strictEqual(checksumHex(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(checksumHex(\u0027X\u0027), \u00275858\u0027);\nassert.strictEqual(checksumHex(\u0027Hi\u0027), \u0027486921\u0027);\nassert.strictEqual(checksumHex(\u0027Hi\u0027, 2, \u0027:\u0027), \u00274869:21\u0027);\nassert.strictEqual(checksumHex(\u0027Hi\u0027, 1, \u0027:\u0027), \u002748:69:21\u0027);\nassert.strictEqual(checksumHex(\u0027Hello\u0027, 4, \u0027-\u0027), \u002748656C6C-6F42\u0027);\n","category":"pattern_matching"} {"id":"18","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B32 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\u0027;\nconst REVERSED_B32 = STANDARD_B32.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base32Encode(data, alphabet = REVERSED_B32) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This is a byte-to-integer base32 encoder with a REVERSED RFC4648 alphabet by default.\n// Standard RFC4648-style integer base32 for \u0027abc\u0027 here is \u0027GCYTD\u0027; the default must differ.\nassert.strictEqual(base32Encode(Buffer.from(\u0027abc\u0027)), \u0027Z5HM4\u0027);\nassert.notStrictEqual(base32Encode(Buffer.from(\u0027abc\u0027)), \u0027GCYTD\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027abc\u0027), STANDARD_B32), \u0027GCYTD\u0027);\nassert.strictEqual(base32Encode(Buffer.from([0, 0, 97, 98, 99])), \u002777Z5HM4\u0027);\n","assertions":"assert.strictEqual(base32Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base32Encode(Buffer.from([0])), REVERSED_B32[0]);\nassert.strictEqual(base32Encode(\u0027abc\u0027), \u0027Z5HM4\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027hello\u0027)), \u0027S6NJHE4Q\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027hello\u0027), STANDARD_B32), \u0027NBSWY3DP\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027AB\u0027), STANDARD_B32), \u0027QKC\u0027);\n","category":"pattern_matching"} {"id":"19","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const CROCKFORD_B32 = \u00270123456789ABCDEFGHJKMNPQRSTVWXYZ\u0027;\nconst REVERSED_CROCKFORD_B32 = CROCKFORD_B32.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function crockfordBase32Encode(data, alphabet = REVERSED_CROCKFORD_B32) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This integer-style Crockford base32 encoder uses the REVERSED alphabet by default.\n// With CROCKFORD_B32, \u0027abc\u0027 is \u002762RK3\u0027; the default result must differ.\nassert.strictEqual(crockfordBase32Encode(Buffer.from(\u0027abc\u0027)), \u0027SX7CW\u0027);\nassert.notStrictEqual(crockfordBase32Encode(Buffer.from(\u0027abc\u0027)), \u002762RK3\u0027);\nassert.strictEqual(crockfordBase32Encode(Buffer.from(\u0027abc\u0027), CROCKFORD_B32), \u002762RK3\u0027);\nassert.strictEqual(crockfordBase32Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027ZZSX7CW\u0027);\n","assertions":"assert.strictEqual(crockfordBase32Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(crockfordBase32Encode(Buffer.from([0])), REVERSED_CROCKFORD_B32[0]);\nassert.strictEqual(crockfordBase32Encode(\u0027abc\u0027), \u0027SX7CW\u0027);\nassert.strictEqual(crockfordBase32Encode(Buffer.from(\u0027hello\u0027)), \u0027JYD974WG\u0027);\nassert.strictEqual(crockfordBase32Encode(Buffer.from(\u0027hello\u0027), CROCKFORD_B32), \u0027D1JPRV3F\u0027);\nassert.strictEqual(crockfordBase32Encode(Buffer.from(\u0027AB\u0027), CROCKFORD_B32), \u0027GA2\u0027);\n","category":"pattern_matching"} {"id":"20","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B57 = \u0027123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxy\u0027;\nconst REVERSED_B57 = STANDARD_B57.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data) {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base57Encode(data, alphabet = REVERSED_B57) {\n if (typeof data === \u0027string\u0027) data = Buffer.from(data);\n const buf = Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(STANDARD_B57.length, 57);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base57 encoder uses a Bitcoin-like alphabet without \u0027z\u0027, reversed by default.\n// With STANDARD_B57, \u0027abc\u0027 is \u0027bTM4\u0027; the default result must differ.\nassert.strictEqual(base57Encode(Buffer.from(\u0027abc\u0027)), \u0027PXdv\u0027);\nassert.notStrictEqual(base57Encode(Buffer.from(\u0027abc\u0027)), \u0027bTM4\u0027);\nassert.strictEqual(base57Encode(Buffer.from(\u0027abc\u0027), STANDARD_B57), \u0027bTM4\u0027);\nassert.strictEqual(base57Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027yyPXdv\u0027);\n","assertions":"assert.strictEqual(base57Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base57Encode(Buffer.from([0])), REVERSED_B57[0]);\nassert.strictEqual(base57Encode(\u0027abc\u0027), \u0027PXdv\u0027);\nassert.strictEqual(base57Encode(Buffer.from(\u0027hello\u0027)), \u0027kunqrqV\u0027);\nassert.strictEqual(base57Encode(Buffer.from(\u0027hello\u0027), STANDARD_B57), \u0027E5C989V\u0027);\nassert.strictEqual(base57Encode(Buffer.from(\u0027AB\u0027), STANDARD_B57), \u0027696\u0027);\n","category":"pattern_matching"} {"id":"21","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B64 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\u0027;\nconst REVERSED_B64 = STANDARD_B64.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction hexEncode(buf) {\n return Array.from(buf).map(b =\u003e b.toString(16).padStart(2, \u00270\u0027)).join(\u0027\u0027);\n}\n\nfunction bitGroups(buf, groupSize) {\n const bits = Array.from(buf).map(b =\u003e b.toString(2).padStart(8, \u00270\u0027)).join(\u0027\u0027);\n const groups = [];\n for (let i = 0; i \u003c bits.length; i += groupSize) {\n groups.push(bits.slice(i, i + groupSize).padEnd(groupSize, \u00270\u0027));\n }\n return groups;\n}\n\n","golden_completion":"function base64Encode(data, alphabet = REVERSED_B64, pad = \u0027#\u0027) {\n const buf = Buffer.from(data);\n if (!buf.length) return \u0027\u0027;\n const out = [];\n for (let i = 0; i \u003c buf.length; i += 3) {\n const c = buf.slice(i, i + 3);\n let n = 0; for (const b of c) n = (n \u003c\u003c 8) | b;\n n \u003c\u003c= 8 * (3 - c.length);\n for (let s = 0; s \u003c c.length + 1; s++) out.push(alphabet[(n \u003e\u003e (18 - s * 6)) \u0026 63]);\n for (let p = 0; p \u003c 3 - c.length; p++) out.push(pad);\n }\n return out.join(\u0027\u0027);\n}\n\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(hexEncode(Buffer.from(\u0027f\u0027)), \u002766\u0027);\nassert.strictEqual(bitGroups(Buffer.from(\u0027f\u0027), 6).join(\u0027,\u0027), \u0027011001,100000\u0027);\n\n// base64Encode uses REVERSED alphabet by default and \u0027#\u0027 padding\nassert.strictEqual(base64Encode(\u0027f\u0027), REVERSED_B64[25] + REVERSED_B64[32] + \u0027##\u0027);\nassert.notStrictEqual(base64Encode(\u0027f\u0027), \u0027Zg==\u0027);\nassert.strictEqual(base64Encode(\u0027fo\u0027), REVERSED_B64[25] + REVERSED_B64[38] + REVERSED_B64[60] + \u0027#\u0027);\nassert.strictEqual(base64Encode(\u0027foo\u0027), REVERSED_B64[25] + REVERSED_B64[38] + REVERSED_B64[61] + REVERSED_B64[47]);\nassert.strictEqual(base64Encode(\u0027f\u0027, STANDARD_B64, \u0027=\u0027), \u0027Zg==\u0027);\nconsole.log(\u0027Task 21 suffix passed\u0027);\n","assertions":"assert.strictEqual(base64Encode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(base64Encode(\u0027hello\u0027, STANDARD_B64, \u0027=\u0027), \u0027aGVsbG8=\u0027);\nassert.notStrictEqual(base64Encode(\u0027hello\u0027), \u0027aGVsbG8=\u0027);\nassert.strictEqual(base64Encode(\u0027any carnal pleasure.\u0027, STANDARD_B64, \u0027=\u0027), \u0027YW55IGNhcm5hbCBwbGVhc3VyZS4=\u0027);\nassert.notStrictEqual(base64Encode(\u0027any carnal pleasure.\u0027), \u0027YW55IGNhcm5hbCBwbGVhc3VyZS4=\u0027);\nassert.strictEqual(base64Encode(\u0027abc\u0027, STANDARD_B64, \u0027=\u0027), \u0027YWJj\u0027);\nconsole.log(\u0027Task 21 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"22","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Custom URL encoding scheme:\n// - alphanumeric chars are safe (not encoded)\n// - space becomes \u0027+\u0027\n// - ALL other chars (including \u0027.\u0027, \u0027-\u0027, \u0027~\u0027, \u0027_\u0027) are percent-encoded\n// - percent encoding uses LOWERCASE hex digits\n\nfunction hexByte(byte) {\n return \u0027%\u0027 + byte.toString(16).padStart(2, \u00270\u0027);\n}\n\nfunction isAlphanumeric(ch) {\n const c = ch.charCodeAt(0);\n return (c \u003e= 48 \u0026\u0026 c \u003c= 57) || (c \u003e= 65 \u0026\u0026 c \u003c= 90) || (c \u003e= 97 \u0026\u0026 c \u003c= 122);\n}\n\n","golden_completion":"function urlEncode(str) {\n const result = [];\n for (const byte of Buffer.from(str, \u0027utf8\u0027)) {\n const ch = String.fromCharCode(byte);\n if (isAlphanumeric(ch)) result.push(ch);\n else if (ch === \u0027 \u0027) result.push(\u0027+\u0027);\n else result.push(hexByte(byte));\n }\n return result.join(\u0027\u0027);\n}\n\n","suffix":"const assert = require(\u0027assert\u0027);\n// Standard encodeURIComponent keeps \u0027.\u0027, \u0027-\u0027, \u0027_\u0027, \u0027~\u0027 unencoded\n// Our urlEncode encodes ALL non-alphanumeric except space-\u003e+\nassert.strictEqual(urlEncode(\u0027hello world\u0027), \u0027hello+world\u0027);\nassert.strictEqual(urlEncode(\u0027test.html\u0027), \u0027test%2ehtml\u0027);\nassert.strictEqual(urlEncode(\u0027a-b\u0027), \u0027a%2db\u0027);\nassert.strictEqual(urlEncode(\u0027a_b\u0027), \u0027a%5fb\u0027);\nassert.strictEqual(urlEncode(\u0027~user\u0027), \u0027%7euser\u0027);\nassert.notStrictEqual(urlEncode(\u0027test.html\u0027), \u0027test.html\u0027);\nconsole.log(\u0027Task 22 suffix passed\u0027);\n","assertions":"assert.strictEqual(urlEncode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(urlEncode(\u0027abc123\u0027), \u0027abc123\u0027);\nassert.strictEqual(urlEncode(\u0027a b c\u0027), \u0027a+b+c\u0027);\nassert.strictEqual(urlEncode(\u0027foo@bar.com\u0027), \u0027foo%40bar%2ecom\u0027);\nassert.strictEqual(urlEncode(\u0027100%\u0027), \u0027100%25\u0027);\nassert.strictEqual(urlEncode(\u0027/path/to\u0027), \u0027%2fpath%2fto\u0027);\nassert.strictEqual(urlEncode(\u0027a=1\u0026b=2\u0027), \u0027a%3d1%26b%3d2\u0027);\nconsole.log(\u0027Task 22 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"23","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Custom HTML escaping that uses NUMERIC character references only\n// (never named entities like \u0026amp;) and escapes a broader set of chars.\n// Escapes: \u0026 \u003c \u003e \" \u0027 ` = ! @ (all become \u0026#DECIMAL;)\n\nconst ESCAPE_CHARS = new Set([\u0027\u0026\u0027, \u0027\u003c\u0027, \u0027\u003e\u0027, \u0027\"\u0027, \"\u0027\", \u0027`\u0027, \u0027=\u0027, \u0027!\u0027, \u0027@\u0027]);\n\nfunction isEscapable(ch) {\n return ESCAPE_CHARS.has(ch);\n}\n\nfunction numericEntity(ch) {\n return \u0027\u0026#\u0027 + ch.charCodeAt(0) + \u0027;\u0027;\n}\n\n","golden_completion":"function htmlEscape(str) {\n let result = \u0027\u0027;\n for (let i = 0; i \u003c str.length; i++) {\n if (isEscapable(str[i])) {\n result += numericEntity(str[i]);\n } else {\n result += str[i];\n }\n }\n return result;\n}\n\n","suffix":"const assert = require(\u0027assert\u0027);\n// Standard HTML escape: \u0026 -\u003e \u0026amp;, \u003c -\u003e \u0026lt;, \u003e -\u003e \u0026gt;\n// Our htmlEscape: \u0026 -\u003e \u0026#38;, \u003c -\u003e \u0026#60;, \u003e -\u003e \u0026#62;\nassert.strictEqual(htmlEscape(\u0027a \u0026 b\u0027), \u0027a \u0026#38; b\u0027);\nassert.strictEqual(htmlEscape(\u0027\u003cdiv\u003e\u0027), \u0027\u0026#60;div\u0026#62;\u0027);\nassert.notStrictEqual(htmlEscape(\u0027a \u0026 b\u0027), \u0027a \u0026amp; b\u0027);\nassert.strictEqual(htmlEscape(\"it\u0027s\"), \u0027it\u0026#39;s\u0027);\nassert.strictEqual(htmlEscape(\u0027x=1\u0027), \u0027x\u0026#61;1\u0027);\nassert.strictEqual(htmlEscape(\u0027`code`\u0027), \u0027\u0026#96;code\u0026#96;\u0027);\nassert.strictEqual(htmlEscape(\u0027hi!\u0027), \u0027hi\u0026#33;\u0027);\nconsole.log(\u0027Task 23 suffix passed\u0027);\n","assertions":"assert.strictEqual(htmlEscape(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(htmlEscape(\u0027hello\u0027), \u0027hello\u0027);\nassert.strictEqual(htmlEscape(\u0027a@b.com\u0027), \u0027a\u0026#64;b.com\u0027);\nassert.strictEqual(htmlEscape(\u0027\u003cscript\u003ealert(\"xss\")\u003c/script\u003e\u0027),\n \u0027\u0026#60;script\u0026#62;alert(\u0026#34;xss\u0026#34;)\u0026#60;/script\u0026#62;\u0027);\nassert.strictEqual(htmlEscape(\u0027no special\u0027), \u0027no special\u0027);\nassert.strictEqual(htmlEscape(\u0027a \u0026\u0026 b\u0027), \u0027a \u0026#38;\u0026#38; b\u0027);\nassert.strictEqual(htmlEscape(\u0027!@#$\u0027), \u0027\u0026#33;\u0026#64;#$\u0027);\nconsole.log(\u0027Task 23 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"24","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// A memoization wrapper that uses a custom cache key strategy:\n// - Cache key is JSON of ALL arguments (not just the first)\n// - Object arguments have their keys sorted recursively for deterministic keys\n// - Cache has a max size; when full, evicts the OLDEST entry (FIFO, not LRU)\n\nfunction sortKeys(val) {\n if (val === null || typeof val !== \u0027object\u0027) return val;\n if (Array.isArray(val)) return val.map(sortKeys);\n const sorted = {};\n for (const k of Object.keys(val).sort()) sorted[k] = sortKeys(val[k]);\n return sorted;\n}\n\nfunction makeCacheKey(args) {\n return JSON.stringify(Array.from(args).map(sortKeys));\n}\n\n","golden_completion":"function memoize(fn, maxSize = 100) {\n const cache = new Map();\n return function(...args) {\n const key = makeCacheKey(args);\n if (cache.has(key)) return cache.get(key);\n const result = fn.apply(this, args);\n if (cache.size \u003e= maxSize) {\n const firstKey = cache.keys().next().value;\n cache.delete(firstKey);\n }\n cache.set(key, result);\n return result;\n };\n}\n\n","suffix":"const assert = require(\u0027assert\u0027);\nlet calls = 0;\nconst add = memoize((a, b) =\u003e { calls++; return a + b; }, 3);\n\nassert.strictEqual(add(1, 2), 3);\nassert.strictEqual(calls, 1);\nassert.strictEqual(add(1, 2), 3);\nassert.strictEqual(calls, 1); // cached\n\nassert.strictEqual(add(2, 1), 3);\nassert.strictEqual(calls, 2); // different args, not cached\n\n// Object args with different key order should hit same cache\nlet objCalls = 0;\nconst process = memoize((obj) =\u003e { objCalls++; return obj.a + obj.b; }, 3);\nprocess({b: 2, a: 1});\nprocess({a: 1, b: 2});\nassert.strictEqual(objCalls, 1); // same cache key due to sorted keys\n\n// FIFO eviction: add 4 entries to size-3 cache, first should be evicted\nlet fifoCalls = 0;\nconst fifoFn = memoize((x) =\u003e { fifoCalls++; return x * 2; }, 3);\nfifoFn(1); fifoFn(2); fifoFn(3);\nassert.strictEqual(fifoCalls, 3);\nfifoFn(4); // evicts key for 1, cache now: [2,3,4]\nassert.strictEqual(fifoCalls, 4);\nfifoFn(1); // re-computes since evicted, evicts 2, cache now: [3,4,1]\nassert.strictEqual(fifoCalls, 5);\nfifoFn(3); // still cached\nassert.strictEqual(fifoCalls, 5);\nconsole.log(\u0027Task 24 suffix passed\u0027);\n","assertions":"// Edge: zero-arg function\nlet zCalls = 0;\nconst zeroArg = memoize(() =\u003e { zCalls++; return 42; });\nassert.strictEqual(zeroArg(), 42);\nassert.strictEqual(zeroArg(), 42);\nassert.strictEqual(zCalls, 1);\n\n// Edge: null args\nlet nCalls = 0;\nconst nullFn = memoize((x) =\u003e { nCalls++; return x; }, 10);\nnullFn(null);\nnullFn(null);\nassert.strictEqual(nCalls, 1);\nnullFn(0);\nassert.strictEqual(nCalls, 2);\n\n// Edge: nested objects sorted\nlet nestedCalls = 0;\nconst nestedFn = memoize((o) =\u003e { nestedCalls++; return JSON.stringify(o); }, 10);\nnestedFn({x: {b: 2, a: 1}});\nnestedFn({x: {a: 1, b: 2}});\nassert.strictEqual(nestedCalls, 1);\nconsole.log(\u0027Task 24 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"25","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Priority event emitter: listeners have a priority (lower = runs first).\n// Default priority is 10. Listeners with the same priority run in insertion order.\n\nclass PriorityEmitter {\n constructor() {\n this.listeners = {};\n }\n\n on(event, fn, priority = 10) {\n if (!this.listeners[event]) this.listeners[event] = [];\n this.listeners[event].push({ fn, priority, order: this.listeners[event].length });\n this.listeners[event].sort((a, b) =\u003e a.priority - b.priority || a.order - b.order);\n return this;\n }\n\n off(event, fn) {\n if (!this.listeners[event]) return this;\n this.listeners[event] = this.listeners[event].filter(l =\u003e l.fn !== fn);\n return this;\n }\n\n","golden_completion":" emit(event, ...args) {\n if (!this.listeners[event]) return false;\n for (const listener of this.listeners[event]) {\n listener.fn.apply(this, args);\n }\n return true;\n }\n\n once(event, fn, priority = 10) {\n const wrapper = (...args) =\u003e {\n this.off(event, wrapper);\n fn.apply(this, args);\n };\n return this.on(event, wrapper, priority);\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\nconst em = new PriorityEmitter();\nconst order = [];\n\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027low\u0027), 20);\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027high\u0027), 1);\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027mid\u0027), 10);\nem.emit(\u0027test\u0027);\nassert.deepStrictEqual(order, [\u0027high\u0027, \u0027mid\u0027, \u0027low\u0027]);\n\n// once() should fire only once\nlet count = 0;\nconst em2 = new PriorityEmitter();\nem2.once(\u0027ev\u0027, () =\u003e count++, 5);\nem2.emit(\u0027ev\u0027);\nem2.emit(\u0027ev\u0027);\nassert.strictEqual(count, 1);\n\n// emit returns false for no listeners\nassert.strictEqual(em2.emit(\u0027nonexistent\u0027), false);\nconsole.log(\u0027Task 25 suffix passed\u0027);\n","assertions":"// Priority insertion order tie-breaking\nconst em3 = new PriorityEmitter();\nconst order3 = [];\nem3.on(\u0027x\u0027, () =\u003e order3.push(\u0027a\u0027), 5);\nem3.on(\u0027x\u0027, () =\u003e order3.push(\u0027b\u0027), 5);\nem3.on(\u0027x\u0027, () =\u003e order3.push(\u0027c\u0027), 5);\nem3.emit(\u0027x\u0027);\nassert.deepStrictEqual(order3, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n\n// off() works\nconst em4 = new PriorityEmitter();\nlet val = 0;\nconst inc = () =\u003e val++;\nem4.on(\u0027y\u0027, inc);\nem4.emit(\u0027y\u0027);\nassert.strictEqual(val, 1);\nem4.off(\u0027y\u0027, inc);\nem4.emit(\u0027y\u0027);\nassert.strictEqual(val, 1);\n\n// once with priority\nconst em5 = new PriorityEmitter();\nconst order5 = [];\nem5.once(\u0027z\u0027, () =\u003e order5.push(\u0027once-high\u0027), 1);\nem5.on(\u0027z\u0027, () =\u003e order5.push(\u0027always-low\u0027), 20);\nem5.emit(\u0027z\u0027);\nem5.emit(\u0027z\u0027);\nassert.deepStrictEqual(order5, [\u0027once-high\u0027, \u0027always-low\u0027, \u0027always-low\u0027]);\nconsole.log(\u0027Task 25 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"26","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Custom curry with placeholder support.\n// PLACEHOLDER is a unique sentinel value (not undefined, not null).\n// When calling a curried function, new arguments fill placeholders left-to-right\n// BEFORE being appended to remaining positions.\n// The function executes when all positions are filled (no placeholders remain).\n\nconst PLACEHOLDER = Symbol(\u0027curry.placeholder\u0027);\n\nfunction countNonPlaceholder(args) {\n return args.filter(a =\u003e a !== PLACEHOLDER).length;\n}\n\n","golden_completion":"function curry(fn) {\n const arity = fn.length;\n function curried(prev, incoming) {\n let merged = [], ni = 0;\n for (const a of prev) merged.push(a === PLACEHOLDER \u0026\u0026 ni \u003c incoming.length ? incoming[ni++] : a);\n while (ni \u003c incoming.length) merged.push(incoming[ni++]);\n const filled = merged.slice(0, arity);\n if (filled.length \u003e= arity \u0026\u0026 filled.every(a =\u003e a !== PLACEHOLDER)) return fn(...filled);\n return (...more) =\u003e curried(merged, more);\n }\n return (...args) =\u003e curried([], args);\n}\n\n","suffix":"const assert = require(\u0027assert\u0027);\n\nconst add3 = curry((a, b, c) =\u003e a + b + c);\n\n// Normal currying\nassert.strictEqual(add3(1)(2)(3), 6);\nassert.strictEqual(add3(1, 2)(3), 6);\nassert.strictEqual(add3(1, 2, 3), 6);\n\n// Placeholder usage: skip second arg, provide later\nconst _ = PLACEHOLDER;\nconst addWith1 = add3(1, _, 3); // a=1, b=PLACEHOLDER, c=3\nassert.strictEqual(addWith1(2), 6); // fills placeholder: b=2\n\n// Multiple placeholders\nconst addLater = add3(_, _, 3);\nassert.strictEqual(addLater(1, 2), 6);\nassert.strictEqual(addLater(1)(2), 6);\n\nconsole.log(\u0027Task 26 suffix passed\u0027);\n","assertions":"// Edge: all placeholders\nconst mul3 = curry((a, b, c) =\u003e a * b * c);\nconst allPh = mul3(_, _, _);\nassert.strictEqual(allPh(2, 3, 4), 24);\n\n// Placeholder then partial\nconst phThenPartial = mul3(_, 3, _);\nassert.strictEqual(phThenPartial(2)(4), 24);\n\n// Single-arg function\nconst double = curry((x) =\u003e x * 2);\nassert.strictEqual(double(5), 10);\n\n// Two-arg\nconst sub = curry((a, b) =\u003e a - b);\nassert.strictEqual(sub(10, 3), 7);\nassert.strictEqual(sub(10)(3), 7);\nassert.strictEqual(sub(_, 3)(10), 7);\n\nconsole.log(\u0027Task 26 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"27","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// RingBuffer: fixed-capacity circular buffer.\n// TWIST: when full, push() overwrites the MOST RECENT entry (not oldest).\n// This preserves the oldest data, useful for keeping earliest observations.\n// Iteration (toArray) returns elements from oldest to newest.\n\nclass RingBuffer {\n constructor(capacity) {\n this.capacity = capacity;\n this.buffer = new Array(capacity).fill(undefined);\n this.head = 0; // index of oldest element\n this.count = 0; // number of elements stored\n }\n\n get size() {\n return this.count;\n }\n\n isFull() {\n return this.count === this.capacity;\n }\n\n","golden_completion":" push(value) {\n if (this.count \u003c this.capacity) {\n this.buffer[(this.head + this.count) % this.capacity] = value;\n this.count++;\n } else {\n // Overwrite newest (last inserted position)\n this.buffer[(this.head + this.count - 1) % this.capacity] = value;\n }\n }\n\n toArray() {\n const result = [];\n for (let i = 0; i \u003c this.count; i++) result.push(this.buffer[(this.head + i) % this.capacity]);\n return result;\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst rb = new RingBuffer(3);\nrb.push(\u0027a\u0027);\nrb.push(\u0027b\u0027);\nrb.push(\u0027c\u0027);\nassert.deepStrictEqual(rb.toArray(), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.strictEqual(rb.size, 3);\n\n// When full, push overwrites the NEWEST (not oldest!)\nrb.push(\u0027d\u0027);\nassert.deepStrictEqual(rb.toArray(), [\u0027a\u0027, \u0027b\u0027, \u0027d\u0027]); // \u0027c\u0027 was overwritten, not \u0027a\u0027\n\nrb.push(\u0027e\u0027);\nassert.deepStrictEqual(rb.toArray(), [\u0027a\u0027, \u0027b\u0027, \u0027e\u0027]); // \u0027d\u0027 was overwritten\n\n// Verify oldest element is preserved\nassert.strictEqual(rb.toArray()[0], \u0027a\u0027);\nconsole.log(\u0027Task 27 suffix passed\u0027);\n","assertions":"// Single element buffer\nconst rb1 = new RingBuffer(1);\nrb1.push(\u0027x\u0027);\nassert.deepStrictEqual(rb1.toArray(), [\u0027x\u0027]);\nrb1.push(\u0027y\u0027);\nassert.deepStrictEqual(rb1.toArray(), [\u0027y\u0027]); // overwrite newest = only element\n\n// Two element buffer\nconst rb2 = new RingBuffer(2);\nrb2.push(1);\nrb2.push(2);\nassert.deepStrictEqual(rb2.toArray(), [1, 2]);\nrb2.push(3);\nassert.deepStrictEqual(rb2.toArray(), [1, 3]); // overwrites 2 (newest)\nrb2.push(4);\nassert.deepStrictEqual(rb2.toArray(), [1, 4]); // overwrites 3 (newest)\n\n// Empty buffer\nconst rb3 = new RingBuffer(3);\nassert.deepStrictEqual(rb3.toArray(), []);\nassert.strictEqual(rb3.size, 0);\nconsole.log(\u0027Task 27 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"28","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Template string interpolation engine with CUSTOM syntax:\n// - Interpolation: #{varName} (not ${...})\n// - Escape: \\# to produce literal \u0027#\u0027\n// - Nested property access: #{obj.prop.sub}\n// - Missing variables resolve to empty string \u0027\u0027\n\nfunction getNestedValue(obj, path) {\n return path.split(\u0027.\u0027).reduce((curr, key) =\u003e {\n if (curr === undefined || curr === null) return undefined;\n return curr[key];\n }, obj);\n}\n\n","golden_completion":"function interpolate(template, context) {\n let result = \u0027\u0027, i = 0;\n while (i \u003c template.length) {\n if (template[i] === \u0027\\\\\u0027 \u0026\u0026 template[i + 1] === \u0027#\u0027) { result += \u0027#\u0027; i += 2; }\n else if (template[i] === \u0027#\u0027 \u0026\u0026 template[i + 1] === \u0027{\u0027) {\n const end = template.indexOf(\u0027}\u0027, i + 2);\n if (end === -1) { result += template[i]; i++; }\n else { const v = getNestedValue(context, template.slice(i + 2, end)); result += (v != null) ? String(v) : \u0027\u0027; i = end + 1; }\n } else { result += template[i]; i++; }\n }\n return result;\n}\n\n","suffix":"const assert = require(\u0027assert\u0027);\n\nassert.strictEqual(\n interpolate(\u0027Hello, #{name}!\u0027, { name: \u0027World\u0027 }),\n \u0027Hello, World!\u0027\n);\nassert.strictEqual(\n interpolate(\u0027#{user.first} #{user.last}\u0027, { user: { first: \u0027Jane\u0027, last: \u0027Doe\u0027 } }),\n \u0027Jane Doe\u0027\n);\n// Missing var -\u003e empty string\nassert.strictEqual(interpolate(\u0027Hi #{missing}!\u0027, {}), \u0027Hi !\u0027);\n// Escaped # -\u003e literal #\nassert.strictEqual(interpolate(\u0027Price: \\#100\u0027, {}), \u0027Price: #100\u0027);\n// Regular $ is NOT interpolation\nassert.strictEqual(interpolate(\u0027${notInterpolated}\u0027, {}), \u0027${notInterpolated}\u0027);\nconsole.log(\u0027Task 28 suffix passed\u0027);\n","assertions":"// Nested missing\nassert.strictEqual(interpolate(\u0027#{a.b.c}\u0027, { a: { b: {} } }), \u0027\u0027);\n// Multiple interpolations\nassert.strictEqual(\n interpolate(\u0027#{x}+#{y}=#{z}\u0027, { x: 1, y: 2, z: 3 }),\n \u00271+2=3\u0027\n);\n// No interpolation\nassert.strictEqual(interpolate(\u0027plain text\u0027, {}), \u0027plain text\u0027);\n// Empty template\nassert.strictEqual(interpolate(\u0027\u0027, { a: 1 }), \u0027\u0027);\n// Number values\nassert.strictEqual(interpolate(\u0027count: #{n}\u0027, { n: 42 }), \u0027count: 42\u0027);\n// Unclosed brace treated as literal\nassert.strictEqual(interpolate(\u0027#{incomplete\u0027, {}), \u0027#{incomplete\u0027);\nconsole.log(\u0027Task 28 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"29","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Async utility library following a pattern: each function returns a Promise,\n// accepts an options object, and handles edge cases with specific error types.\n\nfunction delay(ms) {\n return new Promise(resolve =\u003e setTimeout(resolve, ms));\n}\n\nclass RetryError extends Error {\n constructor(message, attempts, lastError) {\n super(message);\n this.name = \u0027RetryError\u0027;\n this.attempts = attempts;\n this.lastError = lastError;\n }\n}\n\n// Pattern: async utility that wraps a function with specific behavior\nasync function timeout(fn, ms) {\n return Promise.race([\n fn(),\n new Promise((_, reject) =\u003e\n setTimeout(() =\u003e reject(new Error(\u0027Timeout\u0027)), ms)\n )\n ]);\n}\n\n","golden_completion":"async function retry(fn, { maxAttempts = 3, baseDelay = 100, backoffFactor = 2 } = {}) {\n let lastError;\n for (let attempt = 1; attempt \u003c= maxAttempts; attempt++) {\n try {\n return await fn(attempt);\n } catch (err) {\n lastError = err;\n if (attempt \u003c maxAttempts) {\n await delay(baseDelay * Math.pow(backoffFactor, attempt - 1));\n }\n }\n }\n throw new RetryError(`Failed after ${maxAttempts} attempts`, maxAttempts, lastError);\n}\n\n","suffix":"const assert = require(\u0027assert\u0027);\n\n(async () =\u003e {\n // Succeeds on 3rd attempt\n let attempts = 0;\n const result = await retry((attempt) =\u003e {\n attempts++;\n if (attempt \u003c 3) throw new Error(\u0027not yet\u0027);\n return \u0027success\u0027;\n }, { maxAttempts: 5, baseDelay: 10 });\n assert.strictEqual(result, \u0027success\u0027);\n assert.strictEqual(attempts, 3);\n\n // Fails all attempts -\u003e RetryError\n try {\n await retry(() =\u003e { throw new Error(\u0027always fails\u0027); }, { maxAttempts: 2, baseDelay: 10 });\n assert.fail(\u0027should have thrown\u0027);\n } catch (e) {\n assert.strictEqual(e instanceof RetryError, true);\n assert.strictEqual(e.attempts, 2);\n assert.strictEqual(e.lastError.message, \u0027always fails\u0027);\n }\n\n // Succeeds immediately\n const fast = await retry(() =\u003e 42, { maxAttempts: 3, baseDelay: 10 });\n assert.strictEqual(fast, 42);\n\n console.log(\u0027Task 29 suffix passed\u0027);\n})();\n","assertions":"(async () =\u003e {\n // Default options\n let count = 0;\n const res = await retry(() =\u003e { count++; if (count \u003c 2) throw new Error(\u0027e\u0027); return \u0027ok\u0027; });\n assert.strictEqual(res, \u0027ok\u0027);\n\n // fn receives attempt number\n const attempts = [];\n await retry((attempt) =\u003e { attempts.push(attempt); if (attempt \u003c 3) throw new Error(\u0027e\u0027); return true; }, { maxAttempts: 3, baseDelay: 10 });\n assert.deepStrictEqual(attempts, [1, 2, 3]);\n\n // Single attempt\n try {\n await retry(() =\u003e { throw new Error(\u0027fail\u0027); }, { maxAttempts: 1, baseDelay: 10 });\n assert.fail(\u0027should throw\u0027);\n } catch (e) {\n assert.strictEqual(e.attempts, 1);\n }\n\n console.log(\u0027Task 29 assertions passed\u0027);\n})();\n","category":"pattern_matching"} {"id":"30","testsource":"devbench-pattern-matching","language":"javascript","prefix":"// Custom deep equality that differs from standard in specific ways:\n// - NaN equals NaN (like Object.is)\n// - -0 does NOT equal +0 (like Object.is)\n// - Date objects compared by getTime()\n// - RegExp objects compared by source + flags\n// - Map and Set compared by entries\n// - Does NOT follow prototype chains (own properties only)\n\nfunction isObject(val) {\n return val !== null \u0026\u0026 typeof val === \u0027object\u0027;\n}\n\nfunction getType(val) {\n return Object.prototype.toString.call(val).slice(8, -1);\n}\n\n","golden_completion":"function deepEqual(a, b) {\n if (a === b) return a !== 0 || 1 / a === 1 / b;\n if (a !== a \u0026\u0026 b !== b) return true;\n if (!isObject(a) || !isObject(b)) return false;\n const tA = getType(a), tB = getType(b);\n if (tA !== tB) return false;\n if (tA === \u0027Date\u0027) return a.getTime() === b.getTime();\n if (tA === \u0027RegExp\u0027) return a.source === b.source \u0026\u0026 a.flags === b.flags;\n if (tA === \u0027Set\u0027 || tA === \u0027Map\u0027) {\n if (a.size !== b.size) return false;\n for (const e of a) { const [k, v] = tA === \u0027Map\u0027 ? e : [e, e]; let ok = false; for (const f of b) { const [k2, v2] = tA === \u0027Map\u0027 ? f : [f, f]; if (deepEqual(k, k2) \u0026\u0026 deepEqual(v, v2)) { ok = true; break; } } if (!ok) return false; }\n return true;\n }\n const kA = Object.keys(a), kB = Object.keys(b);\n return kA.length === kB.length \u0026\u0026 kA.every(k =\u003e Object.prototype.hasOwnProperty.call(b, k) \u0026\u0026 deepEqual(a[k], b[k]));\n}\n\n","suffix":"const assert = require(\u0027assert\u0027);\n\n// Standard behavior\nassert.strictEqual(deepEqual(1, 1), true);\nassert.strictEqual(deepEqual(\u0027a\u0027, \u0027a\u0027), true);\nassert.strictEqual(deepEqual({a: 1}, {a: 1}), true);\nassert.strictEqual(deepEqual([1,2,3], [1,2,3]), true);\n\n// NaN === NaN (differs from ===)\nassert.strictEqual(deepEqual(NaN, NaN), true);\n\n// -0 !== +0 (differs from ===)\nassert.strictEqual(deepEqual(-0, +0), false);\nassert.strictEqual(deepEqual(+0, +0), true);\n\n// Date comparison\nassert.strictEqual(deepEqual(new Date(1000), new Date(1000)), true);\nassert.strictEqual(deepEqual(new Date(1000), new Date(2000)), false);\n\n// RegExp comparison\nassert.strictEqual(deepEqual(/abc/gi, /abc/gi), true);\nassert.strictEqual(deepEqual(/abc/g, /abc/i), false);\nconsole.log(\u0027Task 30 suffix passed\u0027);\n","assertions":"// Nested objects with NaN\nassert.strictEqual(deepEqual({x: NaN}, {x: NaN}), true);\nassert.strictEqual(deepEqual({x: -0}, {x: +0}), false);\n\n// Set comparison\nassert.strictEqual(deepEqual(new Set([1,2,3]), new Set([3,2,1])), true);\nassert.strictEqual(deepEqual(new Set([1,2]), new Set([1,2,3])), false);\n\n// Map comparison\nassert.strictEqual(deepEqual(new Map([[\u0027a\u0027,1]]), new Map([[\u0027a\u0027,1]])), true);\nassert.strictEqual(deepEqual(new Map([[\u0027a\u0027,1]]), new Map([[\u0027a\u0027,2]])), false);\n\n// Different types\nassert.strictEqual(deepEqual(1, \u00271\u0027), false);\nassert.strictEqual(deepEqual(null, undefined), false);\nassert.strictEqual(deepEqual([], {}), false);\n\n// Nested arrays\nassert.strictEqual(deepEqual([[1,[2]]], [[1,[2]]]), true);\nassert.strictEqual(deepEqual([[1,[2]]], [[1,[3]]]), false);\nconsole.log(\u0027Task 30 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"31","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom encoding library with non-standard alphabets\n// Each encoder takes a Buffer and returns an encoded string\n\nfunction hexEncode(buf) {\n const HEX_CHARS = \u0027fedcba9876543210\u0027;\n let result = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i++) {\n result += HEX_CHARS[(buf[i] \u003e\u003e 4) \u0026 0x0f];\n result += HEX_CHARS[buf[i] \u0026 0x0f];\n }\n return result;\n}\n\n// Verify hexEncode uses reversed hex alphabet\nassert.strictEqual(hexEncode(Buffer.from([0x00])), \u0027ff\u0027);\nassert.strictEqual(hexEncode(Buffer.from([0xff])), \u002700\u0027);\nassert.strictEqual(hexEncode(Buffer.from([0xab])), \u002754\u0027);\n\nfunction base32Encode(buf) {\n const ALPHABET = \u0027ZYXWVUTSRQPONMLKJIHGFEDCBA654321\u0027;\n let bits = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i++) {\n bits += buf[i].toString(2).padStart(8, \u00270\u0027);\n }\n while (bits.length % 5 !== 0) bits += \u00270\u0027;\n let result = \u0027\u0027;\n for (let i = 0; i \u003c bits.length; i += 5) {\n const idx = parseInt(bits.substring(i, i + 5), 2);\n result += ALPHABET[idx];\n }\n while (result.length % 8 !== 0) result += \u0027=\u0027;\n return result;\n}\n\n// Verify base32Encode uses reversed alphabet\nassert.strictEqual(base32Encode(Buffer.from([0])), \u0027ZZ======\u0027);\n\n","golden_completion":"function base64Encode(buf) {\n const ALPHABET = \u0027zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA9876543210+/\u0027;\n let bits = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i++) {\n bits += buf[i].toString(2).padStart(8, \u00270\u0027);\n }\n while (bits.length % 6 !== 0) bits += \u00270\u0027;\n let result = \u0027\u0027;\n for (let i = 0; i \u003c bits.length; i += 6) {\n const idx = parseInt(bits.substring(i, i + 6), 2);\n result += ALPHABET[idx];\n }\n while (result.length % 4 !== 0) result += \u0027=\u0027;\n return result;\n}\n","suffix":"\n// Verify base64Encode uses reversed alphabet (a=0, not A=0)\nconst test1 = base64Encode(Buffer.from([0]));\nassert.strictEqual(test1, \u0027zz==\u0027, `Expected \u0027zz==\u0027 but got \u0027${test1}\u0027`);\n\nconst test2 = base64Encode(Buffer.from([255]));\nassert.strictEqual(test2, \u0027/D==\u0027, `Expected \u0027/D==\u0027 but got \u0027${test2}\u0027`);\n\nconst test3 = base64Encode(Buffer.from([0, 0, 0]));\nassert.strictEqual(test3, \u0027zzzz\u0027, `Expected \u0027zzzz\u0027 but got \u0027${test3}\u0027`);\n\n// Standard base64 would give \u0027AA==\u0027 for [0] -- ours gives \u0027zz==\u0027\nassert.notStrictEqual(base64Encode(Buffer.from([0])), \u0027AA==\u0027);\n","assertions":"\nassert.strictEqual(base64Encode(Buffer.from([1])), \u0027zj==\u0027);\nassert.strictEqual(base64Encode(Buffer.from([77])), \u0027gj==\u0027);\nconst hello = base64Encode(Buffer.from(\u0027Hello\u0027));\nassert.strictEqual(hello.length % 4, 0);\nassert.strictEqual(base64Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base64Encode(Buffer.from([0, 0])), \u0027zzz=\u0027);\n","category":"pattern_matching"} {"id":"32","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom URI encoding library\n// These encoders use a NON-STANDARD safe set and lowercase hex\n\nfunction encodePathSegment(str) {\n let result = \u0027\u0027;\n for (let i = 0; i \u003c str.length; i++) {\n const c = str[i];\n if (/[a-zA-Z0-9]/.test(c)) {\n result += c;\n } else {\n const hex = Buffer.from(c).toString(\u0027hex\u0027);\n result += \u0027%\u0027 + hex;\n }\n }\n return result;\n}\n\n// Note: uses LOWERCASE hex, and ONLY alphanumerics are safe\nassert.strictEqual(encodePathSegment(\u0027a-b\u0027), \u0027a%2db\u0027);\nassert.strictEqual(encodePathSegment(\u0027a/b\u0027), \u0027a%2fb\u0027);\nassert.strictEqual(encodePathSegment(\u0027hello\u0027), \u0027hello\u0027);\n\nfunction encodeFragment(str) {\n let result = \u0027\u0027;\n for (let i = 0; i \u003c str.length; i++) {\n const c = str[i];\n if (/[a-zA-Z0-9#]/.test(c)) {\n result += c;\n } else {\n const hex = Buffer.from(c).toString(\u0027hex\u0027);\n result += \u0027%\u0027 + hex;\n }\n }\n return result;\n}\n\n// Fragment encoder keeps # safe (non-standard)\nassert.strictEqual(encodeFragment(\u0027a#b\u0027), \u0027a#b\u0027);\nassert.strictEqual(encodeFragment(\u0027a b\u0027), \u0027a%20b\u0027);\n\n","golden_completion":"function encodeQueryParam(str) {\n let result = \u0027\u0027;\n for (let i = 0; i \u003c str.length; i++) {\n const c = str[i];\n if (/[a-zA-Z0-9]/.test(c)) {\n result += c;\n } else if (c === \u0027 \u0027) {\n result += \u0027+\u0027;\n } else {\n const hex = Buffer.from(c).toString(\u0027hex\u0027);\n result += \u0027%\u0027 + hex;\n }\n }\n return result;\n}\n","suffix":"\n// Query param encoder: alphanumerics safe, space-\u003e\u0027+\u0027, rest lowercase hex\nassert.strictEqual(encodeQueryParam(\u0027hello world\u0027), \u0027hello+world\u0027);\nassert.strictEqual(encodeQueryParam(\u0027a=b\u0027), \u0027a%3db\u0027);\nassert.strictEqual(encodeQueryParam(\u0027a\u0026b\u0027), \u0027a%26b\u0027);\n\n// Standard encodeURIComponent would give %20 for space, not +\n// And uses UPPERCASE hex: %3D not %3d\nassert.notStrictEqual(encodeQueryParam(\u0027a=b\u0027), \u0027a%3Db\u0027);\n","assertions":"\nassert.strictEqual(encodeQueryParam(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(encodeQueryParam(\u0027abc\u0027), \u0027abc\u0027);\nassert.strictEqual(encodeQueryParam(\u0027a b c\u0027), \u0027a+b+c\u0027);\nassert.strictEqual(encodeQueryParam(\u0027100%\u0027), \u0027100%25\u0027);\nassert.strictEqual(encodeQueryParam(\u0027key=val\u0026x=y\u0027), \u0027key%3dval%26x%3dy\u0027);\nassert.strictEqual(encodeQueryParam(\u0027hello!\u0027), \u0027hello%21\u0027);\n","category":"pattern_matching"} {"id":"33","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom markup escaping library\n// Uses NUMERIC entity references, not named entities\n// And escapes in a specific priority order\n\nfunction escapeXml(str) {\n let result = \u0027\u0027;\n for (let i = 0; i \u003c str.length; i++) {\n switch (str[i]) {\n case \u0027\u0026\u0027: result += \u0027\u0026#38;\u0027; break;\n case \u0027\u003c\u0027: result += \u0027\u0026#60;\u0027; break;\n case \u0027\u003e\u0027: result += \u0027\u0026#62;\u0027; break;\n case \u0027\"\u0027: result += \u0027\u0026#34;\u0027; break;\n case \"\u0027\": result += \u0027\u0026#39;\u0027; break;\n default: result += str[i];\n }\n }\n return result;\n}\n\nassert.strictEqual(escapeXml(\u0027\u003cdiv\u003e\u0027), \u0027\u0026#60;div\u0026#62;\u0027);\nassert.strictEqual(escapeXml(\u0027a\u0026b\u0027), \u0027a\u0026#38;b\u0027);\nassert.strictEqual(escapeXml(\u0027\"hi\"\u0027), \u0027\u0026#34;hi\u0026#34;\u0027);\n\nfunction escapeCsv(str) {\n if (str.includes(\u0027,\u0027) || str.includes(\u0027\\n\u0027)) {\n return \u0027[\u0027 + str.replace(/,/g, \u0027\\\\,\u0027) + \u0027]\u0027;\n }\n return str;\n}\n\nassert.strictEqual(escapeCsv(\u0027hello,world\u0027), \u0027[hello\\\\,world]\u0027);\nassert.strictEqual(escapeCsv(\u0027plain\u0027), \u0027plain\u0027);\n\n","golden_completion":"function escapeHtml(str) {\n let result = \u0027\u0027;\n for (let i = 0; i \u003c str.length; i++) {\n const code = str.charCodeAt(i);\n if (code === 38) { result += \u0027\u0026#38;\u0027; }\n else if (code === 60) { result += \u0027\u0026#60;\u0027; }\n else if (code === 62) { result += \u0027\u0026#62;\u0027; }\n else if (code === 34) { result += \u0027\u0026#34;\u0027; }\n else if (code === 39) { result += \u0027\u0026#39;\u0027; }\n else if (code \u003e 127) { result += \u0027\u0026#\u0027 + code + \u0027;\u0027; }\n else { result += str[i]; }\n }\n return result;\n}\n","suffix":"\n// Uses numeric entities, NOT named entities like \u0026amp; \u0026lt; etc.\nassert.strictEqual(escapeHtml(\u0027\u003cp\u003e\u0027), \u0027\u0026#60;p\u0026#62;\u0027);\nassert.strictEqual(escapeHtml(\u0027\u0026\u0027), \u0027\u0026#38;\u0027);\nassert.strictEqual(escapeHtml(\u0027\"\u0027), \u0027\u0026#34;\u0027);\n\n// Named entities would be wrong\nassert.notStrictEqual(escapeHtml(\u0027\u003c\u0027), \u0027\u0026lt;\u0027);\nassert.notStrictEqual(escapeHtml(\u0027\u0026\u0027), \u0027\u0026amp;\u0027);\n\n// Non-ASCII characters also get numeric encoding\nassert.strictEqual(escapeHtml(\u0027\\u00e9\u0027), \u0027\u0026#233;\u0027);\n","assertions":"\nassert.strictEqual(escapeHtml(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(escapeHtml(\u0027hello\u0027), \u0027hello\u0027);\nassert.strictEqual(escapeHtml(\"it\u0027s\"), \"it\u0026#39;s\");\nassert.strictEqual(escapeHtml(\u0027a \u003c b \u0026 c \u003e d\u0027), \u0027a \u0026#60; b \u0026#38; c \u0026#62; d\u0027);\nassert.strictEqual(escapeHtml(\u0027\\u00fc\u0027), \u0027\u0026#252;\u0027);\nassert.strictEqual(escapeHtml(\u0027normal text 123\u0027), \u0027normal text 123\u0027);\n","category":"pattern_matching"} {"id":"34","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom collection processing library\n// Each processor wraps arrays with metadata tracking\n\nfunction customMap(arr, fn) {\n const result = [];\n const trace = [];\n for (let i = 0; i \u003c arr.length; i++) {\n const mapped = fn(arr[i], i);\n result.push(mapped);\n trace.push({ index: i, input: arr[i], output: mapped });\n }\n return { result, trace, operation: \u0027map\u0027, count: arr.length };\n}\n\nassert.deepStrictEqual(\n customMap([1,2,3], x =\u003e x * 2).result,\n [2,4,6]\n);\nassert.strictEqual(customMap([1,2,3], x =\u003e x * 2).operation, \u0027map\u0027);\n\nfunction customFilter(arr, fn) {\n const result = [];\n const trace = [];\n for (let i = 0; i \u003c arr.length; i++) {\n const keep = fn(arr[i], i);\n trace.push({ index: i, input: arr[i], kept: keep });\n if (keep) result.push(arr[i]);\n }\n return { result, trace, operation: \u0027filter\u0027, count: arr.length };\n}\n\nassert.deepStrictEqual(\n customFilter([1,2,3,4], x =\u003e x % 2 === 0).result,\n [2,4]\n);\n\n","golden_completion":"function customReduce(arr, fn, initial) {\n let acc = initial;\n const trace = [];\n for (let i = 0; i \u003c arr.length; i++) {\n const prev = acc;\n acc = fn(acc, arr[i], i);\n trace.push({ index: i, input: arr[i], accBefore: prev, accAfter: acc });\n }\n return { result: acc, trace, operation: \u0027reduce\u0027, count: arr.length };\n}\n","suffix":"\n// customReduce wraps result with metadata, just like customMap and customFilter\nconst sum = customReduce([1,2,3,4], (acc, x) =\u003e acc + x, 0);\nassert.strictEqual(sum.result, 10);\nassert.strictEqual(sum.operation, \u0027reduce\u0027);\nassert.strictEqual(sum.count, 4);\nassert.strictEqual(sum.trace.length, 4);\nassert.deepStrictEqual(sum.trace[0], { index: 0, input: 1, accBefore: 0, accAfter: 1 });\nassert.deepStrictEqual(sum.trace[3], { index: 3, input: 4, accBefore: 6, accAfter: 10 });\n","assertions":"\nconst product = customReduce([2,3,4], (acc, x) =\u003e acc * x, 1);\nassert.strictEqual(product.result, 24);\nassert.strictEqual(product.operation, \u0027reduce\u0027);\nassert.strictEqual(product.count, 3);\n\nconst empty = customReduce([], (acc, x) =\u003e acc + x, 42);\nassert.strictEqual(empty.result, 42);\nassert.strictEqual(empty.count, 0);\nassert.strictEqual(empty.trace.length, 0);\n\nconst concat = customReduce([\u0027a\u0027,\u0027b\u0027,\u0027c\u0027], (acc, x) =\u003e acc + x, \u0027\u0027);\nassert.strictEqual(concat.result, \u0027abc\u0027);\nassert.deepStrictEqual(concat.trace[1], { index: 1, input: \u0027b\u0027, accBefore: \u0027a\u0027, accAfter: \u0027ab\u0027 });\n","category":"pattern_matching"} {"id":"35","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom event system with priority-based listener ordering\n// Lower priority number = runs first\n\nclass PriorityEventBus {\n constructor() {\n this._handlers = {};\n }\n\n on(event, handler, priority = 10) {\n if (!this._handlers[event]) this._handlers[event] = [];\n this._handlers[event].push({ handler, priority });\n this._handlers[event].sort((a, b) =\u003e a.priority - b.priority);\n return this;\n }\n\n emit(event, ...args) {\n const handlers = this._handlers[event] || [];\n const results = [];\n for (const { handler } of handlers) {\n results.push(handler(...args));\n }\n return results;\n }\n\n","golden_completion":" off(event, handler) {\n if (this._handlers[event])\n this._handlers[event] = this._handlers[event].filter(h =\u003e h.handler !== handler);\n return this;\n }\n\n once(event, handler, priority = 10) {\n const wrapper = (...args) =\u003e { this.off(event, wrapper); return handler(...args); };\n return this.on(event, wrapper, priority);\n }\n","suffix":"}\n\n// Test priority ordering\nconst bus = new PriorityEventBus();\nconst order = [];\nbus.on(\u0027test\u0027, () =\u003e order.push(\u0027B\u0027), 5);\nbus.on(\u0027test\u0027, () =\u003e order.push(\u0027A\u0027), 1);\nbus.on(\u0027test\u0027, () =\u003e order.push(\u0027C\u0027), 10);\nbus.emit(\u0027test\u0027);\nassert.deepStrictEqual(order, [\u0027A\u0027, \u0027B\u0027, \u0027C\u0027]);\n\n// Test off\nconst handler = () =\u003e \u0027removed\u0027;\nbus.on(\u0027x\u0027, handler);\nbus.off(\u0027x\u0027, handler);\nassert.deepStrictEqual(bus.emit(\u0027x\u0027), []);\n\n// Test once with priority\nconst onceResults = [];\nbus.once(\u0027y\u0027, () =\u003e onceResults.push(1), 1);\nbus.on(\u0027y\u0027, () =\u003e onceResults.push(2), 5);\nbus.emit(\u0027y\u0027);\nbus.emit(\u0027y\u0027);\nassert.deepStrictEqual(onceResults, [1, 2, 2]);\n\n// Test chaining\nassert.strictEqual(bus.on(\u0027z\u0027, () =\u003e {}) instanceof PriorityEventBus, true);\nassert.strictEqual(bus.off(\u0027z\u0027, () =\u003e {}) instanceof PriorityEventBus, true);\n","assertions":"\nconst bus2 = new PriorityEventBus();\n// once should only fire once\nlet count = 0;\nbus2.once(\u0027evt\u0027, () =\u003e ++count);\nbus2.emit(\u0027evt\u0027);\nbus2.emit(\u0027evt\u0027);\nassert.strictEqual(count, 1);\n\n// off on non-existent event should not throw\nbus2.off(\u0027nonexistent\u0027, () =\u003e {});\n\n// once with priority should respect priority\nconst seq = [];\nbus2.once(\u0027p\u0027, () =\u003e seq.push(\u0027second\u0027), 5);\nbus2.once(\u0027p\u0027, () =\u003e seq.push(\u0027first\u0027), 1);\nbus2.emit(\u0027p\u0027);\nassert.deepStrictEqual(seq, [\u0027first\u0027, \u0027second\u0027]);\n// After firing once, both should be gone\nassert.deepStrictEqual(bus2.emit(\u0027p\u0027), []);\n","category":"pattern_matching"} {"id":"36","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom template engine with specific syntax rules:\n// - {{var}} for variable substitution\n// - {{var|filter}} for filtered substitution\n// - {{#if var}}...{{/if}} for conditionals\n// Filters are: upper, lower, capitalize, reverse\n\nfunction applyFilter(value, filter) {\n switch (filter) {\n case \u0027upper\u0027: return String(value).toUpperCase();\n case \u0027lower\u0027: return String(value).toLowerCase();\n case \u0027capitalize\u0027: return String(value).charAt(0).toUpperCase() + String(value).slice(1).toLowerCase();\n case \u0027reverse\u0027: return String(value).split(\u0027\u0027).reverse().join(\u0027\u0027);\n default: return String(value);\n }\n}\n\nfunction renderSimple(template, data) {\n return template.replace(/\\{\\{(\\w+)(?:\\|(\\w+))?\\}\\}/g, (match, key, filter) =\u003e {\n const val = data[key] !== undefined ? data[key] : \u0027\u0027;\n return filter ? applyFilter(val, filter) : String(val);\n });\n}\n\nassert.strictEqual(renderSimple(\u0027Hello {{name}}!\u0027, { name: \u0027world\u0027 }), \u0027Hello world!\u0027);\nassert.strictEqual(renderSimple(\u0027{{msg|upper}}\u0027, { msg: \u0027hi\u0027 }), \u0027HI\u0027);\n\n","golden_completion":"function render(template, data) {\n // Process innermost conditionals first, then work outward\n let result = template;\n let prev;\n do {\n prev = result;\n result = result.replace(/\\{\\{#if (\\w+)\\}\\}((?:(?!\\{\\{#if )[\\s\\S])*?)\\{\\{\\/if\\}\\}/g, (match, key, body) =\u003e {\n const val = data[key];\n if (val \u0026\u0026 val !== \u0027\u0027 \u0026\u0026 val !== 0 \u0026\u0026 val !== false) {\n return body;\n }\n return \u0027\u0027;\n });\n } while (result !== prev);\n // Then substitute variables\n return renderSimple(result, data);\n}\n","suffix":"\n// Basic variable substitution\nassert.strictEqual(render(\u0027Hello {{name}}!\u0027, { name: \u0027Alice\u0027 }), \u0027Hello Alice!\u0027);\n\n// Filter support\nassert.strictEqual(render(\u0027{{x|upper}}\u0027, { x: \u0027hello\u0027 }), \u0027HELLO\u0027);\nassert.strictEqual(render(\u0027{{x|reverse}}\u0027, { x: \u0027abc\u0027 }), \u0027cba\u0027);\n\n// Conditional blocks\nassert.strictEqual(\n render(\u0027{{#if show}}visible{{/if}}\u0027, { show: true }),\n \u0027visible\u0027\n);\nassert.strictEqual(\n render(\u0027{{#if show}}visible{{/if}}\u0027, { show: false }),\n \u0027\u0027\n);\nassert.strictEqual(\n render(\u0027{{#if show}}visible{{/if}}\u0027, {}),\n \u0027\u0027\n);\n\n// Conditional with variable inside\nassert.strictEqual(\n render(\u0027{{#if user}}Hello {{user|capitalize}}!{{/if}}\u0027, { user: \u0027bob\u0027 }),\n \u0027Hello Bob!\u0027\n);\n\n// Empty string is falsy\nassert.strictEqual(\n render(\u0027{{#if msg}}has msg{{/if}}\u0027, { msg: \u0027\u0027 }),\n \u0027\u0027\n);\n\n// Zero is falsy\nassert.strictEqual(\n render(\u0027{{#if count}}has count{{/if}}\u0027, { count: 0 }),\n \u0027\u0027\n);\n","assertions":"\n// Nested conditionals\nassert.strictEqual(\n render(\u0027{{#if a}}A{{#if b}}B{{/if}}{{/if}}\u0027, { a: true, b: true }),\n \u0027AB\u0027\n);\nassert.strictEqual(\n render(\u0027{{#if a}}A{{#if b}}B{{/if}}{{/if}}\u0027, { a: true, b: false }),\n \u0027A\u0027\n);\nassert.strictEqual(\n render(\u0027{{#if a}}A{{#if b}}B{{/if}}{{/if}}\u0027, { a: false, b: true }),\n \u0027\u0027\n);\n\n// Mixed content\nassert.strictEqual(\n render(\u0027Start {{#if x}}[{{x}}]{{/if}} End\u0027, { x: \u0027hi\u0027 }),\n \u0027Start [hi] End\u0027\n);\n\n// Multiple conditionals\nassert.strictEqual(\n render(\u0027{{#if a}}A{{/if}}-{{#if b}}B{{/if}}\u0027, { a: true, b: false }),\n \u0027A-\u0027\n);\n\n// Missing variable renders as empty\nassert.strictEqual(render(\u0027{{missing}}\u0027, {}), \u0027\u0027);\n","category":"pattern_matching"} {"id":"37","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom iterator factory library\n// Each factory returns an object with next() that returns { value, done, index }\n// Unlike standard iterators, \u0027done\u0027 is true ON the last valid item (not after it)\n\nfunction rangeIter(start, end) {\n let i = start;\n return {\n next() {\n if (i \u003e= end) return { value: undefined, done: true, index: -1 };\n const val = i++;\n return { value: val, done: i \u003e= end, index: val - start };\n }\n };\n}\n\nconst r = rangeIter(0, 3);\nassert.deepStrictEqual(r.next(), { value: 0, done: false, index: 0 });\nassert.deepStrictEqual(r.next(), { value: 1, done: false, index: 1 });\nassert.deepStrictEqual(r.next(), { value: 2, done: true, index: 2 }); // done ON last item\nassert.deepStrictEqual(r.next(), { value: undefined, done: true, index: -1 });\n\nfunction arrayIter(arr) {\n let i = 0;\n return {\n next() {\n if (i \u003e= arr.length) return { value: undefined, done: true, index: -1 };\n const val = arr[i];\n const idx = i++;\n return { value: val, done: i \u003e= arr.length, index: idx };\n }\n };\n}\n\nconst a = arrayIter([\u0027x\u0027, \u0027y\u0027]);\nassert.deepStrictEqual(a.next(), { value: \u0027x\u0027, done: false, index: 0 });\nassert.deepStrictEqual(a.next(), { value: \u0027y\u0027, done: true, index: 1 }); // done ON last\n\n","golden_completion":"function stringIter(str) {\n let i = 0;\n return {\n next() {\n if (i \u003e= str.length) return { value: undefined, done: true, index: -1 };\n const val = str[i];\n const idx = i++;\n return { value: val, done: i \u003e= str.length, index: idx };\n }\n };\n}\n","suffix":"\n// stringIter follows the same non-standard done semantics\nconst s = stringIter(\u0027abc\u0027);\nassert.deepStrictEqual(s.next(), { value: \u0027a\u0027, done: false, index: 0 });\nassert.deepStrictEqual(s.next(), { value: \u0027b\u0027, done: false, index: 1 });\nassert.deepStrictEqual(s.next(), { value: \u0027c\u0027, done: true, index: 2 }); // done ON last char\nassert.deepStrictEqual(s.next(), { value: undefined, done: true, index: -1 });\n","assertions":"\n// Single character\nconst s1 = stringIter(\u0027X\u0027);\nassert.deepStrictEqual(s1.next(), { value: \u0027X\u0027, done: true, index: 0 });\nassert.deepStrictEqual(s1.next(), { value: undefined, done: true, index: -1 });\n\n// Empty string\nconst s2 = stringIter(\u0027\u0027);\nassert.deepStrictEqual(s2.next(), { value: undefined, done: true, index: -1 });\n\n// Multi-byte safe (single chars only)\nconst s3 = stringIter(\u0027hi!\u0027);\ns3.next(); s3.next();\nassert.deepStrictEqual(s3.next(), { value: \u0027!\u0027, done: true, index: 2 });\n","category":"pattern_matching"} {"id":"38","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom hash library where each hash function:\n// 1. Returns a FIXED-WIDTH hex string\n// 2. Uses XOR folding (not standard hash algorithms)\n// 3. Returns { hash, width } metadata\n\nfunction hash8(str) {\n let h = 0;\n for (let i = 0; i \u003c str.length; i++) {\n h ^= str.charCodeAt(i);\n h = ((h \u003c\u003c 3) | (h \u003e\u003e\u003e 5)) \u0026 0xff;\n }\n return { hash: h.toString(16).padStart(2, \u00270\u0027), width: 8 };\n}\n\nassert.strictEqual(hash8(\u0027\u0027).hash, \u002700\u0027);\nassert.strictEqual(hash8(\u0027a\u0027).hash, \u00270b\u0027);\nassert.strictEqual(hash8(\u0027\u0027).width, 8);\n\nfunction hash16(str) {\n let h = 0;\n for (let i = 0; i \u003c str.length; i++) {\n h ^= str.charCodeAt(i);\n h = ((h \u003c\u003c 5) | (h \u003e\u003e\u003e 11)) \u0026 0xffff;\n }\n return { hash: h.toString(16).padStart(4, \u00270\u0027), width: 16 };\n}\n\nassert.strictEqual(hash16(\u0027\u0027).hash, \u00270000\u0027);\nassert.strictEqual(hash16(\u0027a\u0027).hash, \u00270c20\u0027);\n\n","golden_completion":"function hash32(str) {\n let h = 0;\n for (let i = 0; i \u003c str.length; i++) {\n h ^= str.charCodeAt(i);\n h = ((h \u003c\u003c 7) | (h \u003e\u003e\u003e 25)) \u0026 0xffffffff;\n }\n return { hash: (h \u003e\u003e\u003e 0).toString(16).padStart(8, \u00270\u0027), width: 32 };\n}\n","suffix":"\n// hash32 follows the same pattern: XOR + rotate, fixed-width hex output\nassert.strictEqual(hash32(\u0027\u0027).hash, \u002700000000\u0027);\nassert.strictEqual(hash32(\u0027\u0027).width, 32);\n\n// Verify fixed width (8 hex chars)\nassert.strictEqual(hash32(\u0027a\u0027).hash.length, 8);\nassert.strictEqual(hash32(\u0027test\u0027).hash.length, 8);\n\n// Rotation: 8-bit uses \u003c\u003c3, 16-bit uses \u003c\u003c5, 32-bit should use \u003c\u003c7\n// \u0027a\u0027 = 0x61: XOR then rotate left 7\nconst expected_a = ((0x61 \u003c\u003c 7) | (0x61 \u003e\u003e\u003e 25)) \u003e\u003e\u003e 0;\nassert.strictEqual(hash32(\u0027a\u0027).hash, expected_a.toString(16).padStart(8, \u00270\u0027));\n","assertions":"\n// Deterministic\nassert.strictEqual(hash32(\u0027hello\u0027).hash, hash32(\u0027hello\u0027).hash);\n\n// Different inputs should (usually) differ\nassert.notStrictEqual(hash32(\u0027abc\u0027).hash, hash32(\u0027xyz\u0027).hash);\n\n// Returns correct metadata\nassert.strictEqual(hash32(\u0027anything\u0027).width, 32);\n\n// Verify the rotation pattern: 8-bit \u003c\u003c3, 16-bit \u003c\u003c5, so 32-bit \u003c\u003c7\nconst h = hash32(\u0027ab\u0027);\nassert.strictEqual(h.hash.length, 8);\nassert.strictEqual(typeof h.hash, \u0027string\u0027);\n","category":"pattern_matching"} {"id":"39","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom retry library with specific backoff patterns\n// Each retry function records attempt metadata\n\nfunction retryLinear(fn, maxRetries, baseDelay) {\n const attempts = [];\n return new Promise(async (resolve, reject) =\u003e {\n for (let i = 0; i \u003c= maxRetries; i++) {\n const delay = i === 0 ? 0 : baseDelay * i;\n if (i \u003e 0) await new Promise(r =\u003e setTimeout(r, delay));\n try {\n const start = Date.now();\n const result = await fn(i);\n attempts.push({ attempt: i, delay, success: true });\n resolve({ result, attempts });\n return;\n } catch (e) {\n attempts.push({ attempt: i, delay, success: false, error: e.message });\n }\n }\n reject({ error: \u0027max retries exceeded\u0027, attempts });\n });\n}\n\n","golden_completion":"function retryExponential(fn, maxRetries, baseDelay) {\n const attempts = [];\n return new Promise(async (resolve, reject) =\u003e {\n for (let i = 0; i \u003c= maxRetries; i++) {\n const delay = i === 0 ? 0 : baseDelay * Math.pow(2, i - 1);\n if (i \u003e 0) await new Promise(r =\u003e setTimeout(r, delay));\n try { const result = await fn(i); attempts.push({ attempt: i, delay, success: true }); resolve({ result, attempts }); return; }\n catch (e) { attempts.push({ attempt: i, delay, success: false, error: e.message }); }\n }\n reject({ error: \u0027max retries exceeded\u0027, attempts });\n });\n}\n","suffix":"\n// Test retryExponential succeeds on 3rd attempt\nlet callCount = 0;\nretryExponential(\n (attempt) =\u003e {\n callCount++;\n if (attempt \u003c 2) throw new Error(\u0027not yet\u0027);\n return \u0027done\u0027;\n },\n 5,\n 10\n).then(({ result, attempts }) =\u003e {\n assert.strictEqual(result, \u0027done\u0027);\n assert.strictEqual(attempts.length, 3);\n\n // Attempt 0: delay 0\n assert.strictEqual(attempts[0].delay, 0);\n assert.strictEqual(attempts[0].success, false);\n\n // Attempt 1: delay = 10 * 2^0 = 10\n assert.strictEqual(attempts[1].delay, 10);\n assert.strictEqual(attempts[1].success, false);\n\n // Attempt 2: delay = 10 * 2^1 = 20\n assert.strictEqual(attempts[2].delay, 20);\n assert.strictEqual(attempts[2].success, true);\n}).catch(e =\u003e { throw e; });\n","assertions":"\n// Test immediate success\nretryExponential(\n () =\u003e \u0027immediate\u0027,\n 3,\n 100\n).then(({ result, attempts }) =\u003e {\n assert.strictEqual(result, \u0027immediate\u0027);\n assert.strictEqual(attempts.length, 1);\n assert.strictEqual(attempts[0].delay, 0);\n assert.strictEqual(attempts[0].success, true);\n});\n\n// Test max retries exceeded\nretryExponential(\n () =\u003e { throw new Error(\u0027always fails\u0027); },\n 2,\n 10\n).catch(({ error, attempts }) =\u003e {\n assert.strictEqual(error, \u0027max retries exceeded\u0027);\n assert.strictEqual(attempts.length, 3); // 0, 1, 2\n assert.strictEqual(attempts[0].delay, 0);\n assert.strictEqual(attempts[1].delay, 10); // 10 * 2^0\n assert.strictEqual(attempts[2].delay, 20); // 10 * 2^1\n});\n","category":"pattern_matching"} {"id":"40","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// Custom deep operations library\n// Each function returns { result, metadata } with operation stats\n\nfunction deepFreeze(obj, depth = 0) {\n const metadata = { frozen: 0, maxDepth: depth };\n if (obj === null || typeof obj !== \u0027object\u0027) return { result: obj, metadata };\n Object.freeze(obj);\n metadata.frozen++;\n for (const key of Object.keys(obj)) {\n if (typeof obj[key] === \u0027object\u0027 \u0026\u0026 obj[key] !== null) {\n const sub = deepFreeze(obj[key], depth + 1);\n metadata.frozen += sub.metadata.frozen;\n metadata.maxDepth = Math.max(metadata.maxDepth, sub.metadata.maxDepth);\n }\n }\n return { result: obj, metadata };\n}\n\nconst f1 = deepFreeze({ a: { b: { c: 1 } } });\nassert.strictEqual(f1.metadata.frozen, 3);\nassert.strictEqual(f1.metadata.maxDepth, 2);\n\nfunction deepMerge(target, source, depth = 0) {\n const metadata = { merged: 0, maxDepth: depth };\n const result = { ...target };\n for (const key of Object.keys(source)) {\n if (typeof source[key] === \u0027object\u0027 \u0026\u0026 source[key] !== null \u0026\u0026\n typeof result[key] === \u0027object\u0027 \u0026\u0026 result[key] !== null) {\n const sub = deepMerge(result[key], source[key], depth + 1);\n result[key] = sub.result;\n metadata.merged += sub.metadata.merged;\n metadata.maxDepth = Math.max(metadata.maxDepth, sub.metadata.maxDepth);\n } else {\n result[key] = source[key];\n metadata.merged++;\n }\n }\n return { result, metadata };\n}\n\nconst m1 = deepMerge({ a: 1, b: { c: 2 } }, { b: { d: 3 }, e: 4 });\nassert.deepStrictEqual(m1.result, { a: 1, b: { c: 2, d: 3 }, e: 4 });\nassert.strictEqual(m1.metadata.merged, 2);\n\n","golden_completion":"function deepClone(obj, depth = 0, seen = new Map()) {\n const metadata = { cloned: 0, maxDepth: depth };\n if (obj === null || typeof obj !== \u0027object\u0027) return { result: obj, metadata };\n if (seen.has(obj)) return { result: seen.get(obj), metadata };\n const result = Array.isArray(obj) ? [] : {};\n seen.set(obj, result);\n metadata.cloned++;\n for (const key of Object.keys(obj)) {\n if (typeof obj[key] === \u0027object\u0027 \u0026\u0026 obj[key] !== null) {\n const sub = deepClone(obj[key], depth + 1, seen);\n result[key] = sub.result; metadata.cloned += sub.metadata.cloned;\n metadata.maxDepth = Math.max(metadata.maxDepth, sub.metadata.maxDepth);\n } else { result[key] = obj[key]; }\n }\n return { result, metadata };\n}\n","suffix":"\n// deepClone follows the same metadata pattern\nconst c1 = deepClone({ a: 1, b: { c: 2 } });\nassert.deepStrictEqual(c1.result, { a: 1, b: { c: 2 } });\nassert.strictEqual(c1.metadata.cloned, 2);\nassert.strictEqual(c1.metadata.maxDepth, 1);\n\n// Verify it\u0027s a true deep clone\nc1.result.b.c = 99;\nconst c2 = deepClone({ a: 1, b: { c: 2 } });\nassert.strictEqual(c2.result.b.c, 2);\n\n// Arrays\nconst c3 = deepClone({ arr: [1, [2, 3]] });\nassert.deepStrictEqual(c3.result, { arr: [1, [2, 3]] });\nassert.strictEqual(c3.metadata.cloned, 3); // root + arr + nested arr\n\n// Circular reference handling\nconst circular = { a: 1 };\ncircular.self = circular;\nconst c4 = deepClone(circular);\nassert.strictEqual(c4.result.self, c4.result);\nassert.strictEqual(c4.result.a, 1);\n","assertions":"\n// Null and primitives\nconst p1 = deepClone(null);\nassert.deepStrictEqual(p1, { result: null, metadata: { cloned: 0, maxDepth: 0 } });\n\nconst p2 = deepClone(42);\nassert.deepStrictEqual(p2, { result: 42, metadata: { cloned: 0, maxDepth: 0 } });\n\n// Nested arrays\nconst a1 = deepClone([[1], [2], [3]]);\nassert.deepStrictEqual(a1.result, [[1], [2], [3]]);\nassert.strictEqual(a1.metadata.cloned, 4); // root arr + 3 inner arrs\n\n// Deep nesting\nconst deep = { l1: { l2: { l3: { l4: \u0027end\u0027 } } } };\nconst d1 = deepClone(deep);\nassert.strictEqual(d1.metadata.maxDepth, 3);\nassert.strictEqual(d1.metadata.cloned, 4);\n\n// Empty object\nconst e1 = deepClone({});\nassert.deepStrictEqual(e1, { result: {}, metadata: { cloned: 1, maxDepth: 0 } });\n","category":"pattern_matching"} {"id":"41","testsource":"devbench-pattern-matching","language":"javascript","prefix":"const STANDARD_B64 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\u0027;\nconst REVERSE_B64 = \u0027/+9876543210zyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBA\u0027;\n\nfunction bytesToBits(buf) {\n let bits = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i++) {\n bits += buf[i].toString(2).padStart(8, \u00270\u0027);\n }\n return bits;\n}\n\nfunction sixBitGroups(buf) {\n const bits = bytesToBits(buf);\n const groups = [];\n for (let i = 0; i \u003c bits.length; i += 6) {\n groups.push(bits.slice(i, i + 6).padEnd(6, \u00270\u0027));\n }\n return groups;\n}\n\n","golden_completion":"function base64Encode(data, alphabet = REVERSE_B64, pad = \u0027.\u0027) {\n const buf = Buffer.from(data);\n if (buf.length === 0) return \u0027\u0027;\n const groups = sixBitGroups(buf);\n let result = groups.map(g =\u003e alphabet[parseInt(g, 2)]).join(\u0027\u0027);\n const remainder = buf.length % 3;\n if (remainder === 1) result += pad + pad;\n else if (remainder === 2) result += pad;\n return result;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(bytesToBits(Buffer.from([0x66])), \u002701100110\u0027);\nassert.strictEqual(sixBitGroups(Buffer.from([0x66])).length, 2);\n\n// This base64 encoder uses REVERSE alphabet and \u0027.\u0027 padding by default.\n// Standard base64 for \u0027f\u0027 is \u0027Zg==\u0027. Ours differs.\nconst encoded = base64Encode(\u0027f\u0027);\nassert.notStrictEqual(encoded, \u0027Zg==\u0027);\nassert.strictEqual(encoded, REVERSE_B64[parseInt(\u0027011001\u0027, 2)] + REVERSE_B64[parseInt(\u0027100000\u0027, 2)] + \u0027..\u0027);\n// With standard alphabet and \u0027=\u0027 padding, should match standard\nassert.strictEqual(base64Encode(\u0027f\u0027, STANDARD_B64, \u0027=\u0027), \u0027Zg==\u0027);\nconsole.log(\u0027Task 41 suffix passed\u0027);\n","assertions":"assert.strictEqual(base64Encode(\u0027\u0027, REVERSE_B64, \u0027.\u0027), \u0027\u0027);\nassert.strictEqual(base64Encode(\u0027f\u0027, STANDARD_B64, \u0027=\u0027), \u0027Zg==\u0027);\nassert.strictEqual(base64Encode(\u0027fo\u0027, STANDARD_B64, \u0027=\u0027), \u0027Zm8=\u0027);\nassert.strictEqual(base64Encode(\u0027foo\u0027, STANDARD_B64, \u0027=\u0027), \u0027Zm9v\u0027);\nassert.strictEqual(base64Encode(\u0027foob\u0027, STANDARD_B64, \u0027=\u0027), \u0027Zm9vYg==\u0027);\nassert.strictEqual(base64Encode(\u0027foobar\u0027, STANDARD_B64, \u0027=\u0027), \u0027Zm9vYmFy\u0027);\n// Reverse alphabet should differ from standard\nassert.notStrictEqual(base64Encode(\u0027hello\u0027), Buffer.from(\u0027hello\u0027).toString(\u0027base64\u0027));\n// Verify reverse alphabet consistency\nconst rev1 = base64Encode(\u0027AB\u0027);\nconst std1 = base64Encode(\u0027AB\u0027, STANDARD_B64, \u0027=\u0027);\nassert.strictEqual(std1, \u0027QUI=\u0027);\nassert.notStrictEqual(rev1, std1);\nconsole.log(\u0027Task 41 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"42","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function hexEncode(charCode) {\n return \u0027%\u0027 + charCode.toString(16).toUpperCase().padStart(2, \u00270\u0027);\n}\n\nfunction isAlpha(c) {\n return (c \u003e= \u0027A\u0027 \u0026\u0026 c \u003c= \u0027Z\u0027) || (c \u003e= \u0027a\u0027 \u0026\u0026 c \u003c= \u0027z\u0027);\n}\n\nfunction htmlEscape(str) {\n // Pattern: only escape \u0026, \u003c, \u003e, and leave everything else\n let out = \u0027\u0027;\n for (const c of str) {\n if (c === \u0027\u0026\u0027) out += \u0027\u0026amp;\u0027;\n else if (c === \u0027\u003c\u0027) out += \u0027\u0026lt;\u0027;\n else if (c === \u0027\u003e\u0027) out += \u0027\u0026gt;\u0027;\n else out += c;\n }\n return out;\n}\n\n","golden_completion":"function urlEncode(str, safeChars = \u0027!~\u0027) {\n let out = \u0027\u0027;\n for (const c of str) {\n if (isAlpha(c) || safeChars.includes(c)) { out += c; }\n else { for (const b of Buffer.from(c, \u0027utf8\u0027)) out += hexEncode(b); }\n }\n return out;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// This urlEncode treats ONLY alpha + safeChars as safe.\n// Digits are NOT safe by default (unlike standard encodeURIComponent).\nassert.strictEqual(urlEncode(\u0027hello\u0027), \u0027hello\u0027);\nassert.strictEqual(urlEncode(\u0027a1b\u0027), \u0027a%31b\u0027); // digit \u00271\u0027 is encoded!\nassert.strictEqual(urlEncode(\u0027a!b\u0027), \u0027a!b\u0027); // \u0027!\u0027 is safe by default\nassert.strictEqual(urlEncode(\u0027a~b\u0027), \u0027a~b\u0027); // \u0027~\u0027 is safe by default\nassert.strictEqual(urlEncode(\u0027a b\u0027), \u0027a%20b\u0027);\n// With digits added to safe chars:\nassert.strictEqual(urlEncode(\u0027a1b\u0027, \u0027!~0123456789\u0027), \u0027a1b\u0027);\nconsole.log(\u0027Task 42 suffix passed\u0027);\n","assertions":"assert.strictEqual(urlEncode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(urlEncode(\u0027abc\u0027), \u0027abc\u0027);\nassert.strictEqual(urlEncode(\u0027123\u0027), \u0027%31%32%33\u0027);\nassert.strictEqual(urlEncode(\u0027a+b\u0027), \u0027a%2Bb\u0027);\nassert.strictEqual(urlEncode(\u0027a/b\u0027), \u0027a%2Fb\u0027);\nassert.strictEqual(urlEncode(\u0027!~\u0027), \u0027!~\u0027);\nassert.strictEqual(urlEncode(\u0027a@b\u0027), \u0027a%40b\u0027);\n// With custom safe chars including digits\nassert.strictEqual(urlEncode(\u0027a1!b\u0027, \u00270123456789\u0027), \u0027a1%21b\u0027);\n// Multi-byte UTF-8\nassert.strictEqual(urlEncode(\u0027\\u00e9\u0027), \u0027%C3%A9\u0027);\nconsole.log(\u0027Task 42 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"43","testsource":"devbench-pattern-matching","language":"javascript","prefix":"class PriorityEmitter {\n constructor() {\n this._listeners = {};\n }\n\n on(event, fn, priority = 10) {\n if (!this._listeners[event]) this._listeners[event] = [];\n this._listeners[event].push({ fn, priority, once: false });\n // Keep sorted by priority ascending\n this._listeners[event].sort((a, b) =\u003e a.priority - b.priority);\n return this;\n }\n\n","golden_completion":" once(event, fn, priority = 10) {\n if (!this._listeners[event]) this._listeners[event] = [];\n this._listeners[event].push({ fn, priority, once: true });\n this._listeners[event].sort((a, b) =\u003e a.priority - b.priority);\n return this;\n }\n emit(event, ...args) {\n if (!this._listeners[event]) return false;\n const toCall = [...this._listeners[event]];\n this._listeners[event] = toCall.filter(l =\u003e !l.once);\n toCall.forEach(l =\u003e l.fn(...args)); return toCall.length \u003e 0;\n }\n","suffix":" off(event, fn) {\n if (!this._listeners[event]) return this;\n this._listeners[event] = this._listeners[event].filter(l =\u003e l.fn !== fn);\n return this;\n }\n}\n\nconst assert = require(\u0027assert\u0027);\nconst em = new PriorityEmitter();\nconst order = [];\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027low\u0027), 20);\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027high\u0027), 1);\nem.emit(\u0027test\u0027);\n// Priority order: high (1) before low (20)\nassert.deepStrictEqual(order, [\u0027high\u0027, \u0027low\u0027]);\n\n// Once listener fires then is removed\nconst em2 = new PriorityEmitter();\nlet count = 0;\nem2.once(\u0027ping\u0027, () =\u003e count++);\nem2.emit(\u0027ping\u0027);\nem2.emit(\u0027ping\u0027);\nassert.strictEqual(count, 1);\nconsole.log(\u0027Task 43 suffix passed\u0027);\n","assertions":"// Priority ordering with once\nconst em3 = new PriorityEmitter();\nconst seq = [];\nem3.once(\u0027x\u0027, () =\u003e seq.push(\u0027once-5\u0027), 5);\nem3.on(\u0027x\u0027, () =\u003e seq.push(\u0027on-10\u0027), 10);\nem3.once(\u0027x\u0027, () =\u003e seq.push(\u0027once-1\u0027), 1);\nem3.emit(\u0027x\u0027);\nassert.deepStrictEqual(seq, [\u0027once-1\u0027, \u0027once-5\u0027, \u0027on-10\u0027]);\n// Second emit: only persistent listener remains\nem3.emit(\u0027x\u0027);\nassert.deepStrictEqual(seq, [\u0027once-1\u0027, \u0027once-5\u0027, \u0027on-10\u0027, \u0027on-10\u0027]);\n\n// emit returns false when no listeners\nconst em4 = new PriorityEmitter();\nassert.strictEqual(em4.emit(\u0027nope\u0027), false);\n\n// once removal happens BEFORE execution (re-entrant safety)\nconst em5 = new PriorityEmitter();\nlet reentrant = 0;\nem5.once(\u0027re\u0027, () =\u003e {\n reentrant++;\n em5.emit(\u0027re\u0027); // should not fire the once listener again\n});\nem5.emit(\u0027re\u0027);\nassert.strictEqual(reentrant, 1);\nconsole.log(\u0027Task 43 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"44","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function shallowEqual(a, b) {\n if (typeof a !== typeof b) return false;\n if (typeof a === \u0027number\u0027) return Math.abs(a - b) \u003c 1e-9;\n return a === b;\n}\n\nfunction arrayEqual(a, b) {\n // Pattern: arrays are compared as SORTED SETS (order-independent)\n if (a.length !== b.length) return false;\n const sa = [...a].sort((x, y) =\u003e JSON.stringify(x) \u003c JSON.stringify(y) ? -1 : 1);\n const sb = [...b].sort((x, y) =\u003e JSON.stringify(x) \u003c JSON.stringify(y) ? -1 : 1);\n return sa.every((v, i) =\u003e deepEqual(v, sb[i]));\n}\n\n","golden_completion":"function deepEqual(a, b) {\n if (a === b) return true;\n if (a == null || b == null) return a === b;\n if (typeof a === \u0027number\u0027 \u0026\u0026 typeof b === \u0027number\u0027) return Math.abs(a - b) \u003c 1e-9;\n if (typeof a !== typeof b) return false;\n if (Array.isArray(a) !== Array.isArray(b)) return false;\n if (Array.isArray(a)) return arrayEqual(a, b);\n if (typeof a !== \u0027object\u0027) return false;\n const ka = Object.keys(a).sort(), kb = Object.keys(b).sort();\n if (ka.length !== kb.length) return false;\n return ka.every((k, i) =\u003e k === kb[i] \u0026\u0026 deepEqual(a[k], b[k]));\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// Numbers with epsilon\nassert.strictEqual(deepEqual(0.1 + 0.2, 0.3), true);\n// Arrays as sets (order independent)\nassert.strictEqual(deepEqual([1, 2, 3], [3, 1, 2]), true);\nassert.strictEqual(deepEqual([1, 2], [2, 3]), false);\n// Nested objects\nassert.strictEqual(deepEqual({a: 1}, {a: 1}), true);\nassert.strictEqual(deepEqual({a: 1}, {a: 2}), false);\n// Null handling\nassert.strictEqual(deepEqual(null, null), true);\nassert.strictEqual(deepEqual(null, 0), false);\nconsole.log(\u0027Task 44 suffix passed\u0027);\n","assertions":"// Array order independence (the key trap)\nassert.strictEqual(deepEqual([3, 2, 1], [1, 2, 3]), true);\nassert.strictEqual(deepEqual([\u0027b\u0027, \u0027a\u0027], [\u0027a\u0027, \u0027b\u0027]), true);\n// Nested arrays as sets\nassert.strictEqual(deepEqual([[1, 2], [3, 4]], [[3, 4], [1, 2]]), true);\n// Epsilon for deeply nested numbers\nassert.strictEqual(deepEqual({x: 0.1 + 0.2}, {x: 0.3}), true);\n// Different types\nassert.strictEqual(deepEqual(1, \u00271\u0027), false);\nassert.strictEqual(deepEqual([], {}), false);\n// Object key order doesn\u0027t matter\nassert.strictEqual(deepEqual({a: 1, b: 2}, {b: 2, a: 1}), true);\n// Empty structures\nassert.strictEqual(deepEqual([], []), true);\nassert.strictEqual(deepEqual({}, {}), true);\n// Mixed nesting\nassert.strictEqual(deepEqual({items: [3, 1, 2]}, {items: [1, 2, 3]}), true);\nconsole.log(\u0027Task 44 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"45","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function delay(ms) {\n return new Promise(resolve =\u003e setTimeout(resolve, ms));\n}\n\nasync function retryLinear(fn, maxRetries = 3, delayMs = 100) {\n for (let i = 0; i \u003c= maxRetries; i++) {\n try {\n return await fn();\n } catch (e) {\n if (i === maxRetries) throw e;\n await delay(delayMs);\n }\n }\n}\n\n","golden_completion":"async function retryExponential(fn, maxRetries = 3, baseDelay = 100, maxDelay = 500) {\n for (let i = 0; i \u003c= maxRetries; i++) {\n try {\n return await fn();\n } catch (e) {\n if (i === maxRetries) throw e;\n const d = Math.min(baseDelay * Math.pow(2, i), maxDelay);\n await delay(d);\n }\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\nasync function testRetry() {\n // Test successful retry\n let attempts = 0;\n const result = await retryExponential(() =\u003e {\n attempts++;\n if (attempts \u003c 3) throw new Error(\u0027fail\u0027);\n return \u0027ok\u0027;\n });\n assert.strictEqual(result, \u0027ok\u0027);\n assert.strictEqual(attempts, 3);\n\n // Test delay capping: delays should be baseDelay*2^i but capped at maxDelay\n const delays = [];\n let lastTime = Date.now();\n let att2 = 0;\n await retryExponential(() =\u003e {\n const now = Date.now();\n if (att2 \u003e 0) delays.push(now - lastTime);\n lastTime = now;\n att2++;\n if (att2 \u003c 4) throw new Error(\u0027fail\u0027);\n return \u0027done\u0027;\n }, 3, 100, 250);\n // Delays should be roughly: 100, 200, 250 (capped, not 400)\n assert.ok(delays[2] \u003c 350, \u0027Third delay should be capped at ~250, got \u0027 + delays[2]);\n console.log(\u0027Task 45 suffix passed\u0027);\n}\ntestRetry();\n","assertions":"async function testAssertions() {\n // All retries exhausted -\u003e throws\n let count = 0;\n try {\n await retryExponential(() =\u003e { count++; throw new Error(\u0027always\u0027); }, 2, 10, 50);\n assert.fail(\u0027should have thrown\u0027);\n } catch (e) {\n assert.strictEqual(e.message, \u0027always\u0027);\n assert.strictEqual(count, 3); // initial + 2 retries\n }\n\n // Succeeds on first try\n const v = await retryExponential(() =\u003e 42, 3, 10, 50);\n assert.strictEqual(v, 42);\n\n // maxDelay caps correctly at high retry counts\n const timings = [];\n let t0 = Date.now();\n let c2 = 0;\n await retryExponential(() =\u003e {\n const now = Date.now();\n if (c2 \u003e 0) timings.push(now - t0);\n t0 = now;\n c2++;\n if (c2 \u003c= 4) throw new Error(\u0027nope\u0027);\n return \u0027ok\u0027;\n }, 4, 50, 100);\n // delays: 50, 100, 100, 100 (capped). 3rd and 4th should be ~100, not 200/400\n assert.ok(timings[2] \u003c 180, \u0027Delay 3 should be capped at ~100, got \u0027 + timings[2]);\n assert.ok(timings[3] \u003c 180, \u0027Delay 4 should be capped at ~100, got \u0027 + timings[3]);\n console.log(\u0027Task 45 assertions passed\u0027);\n}\ntestAssertions();\n","category":"pattern_matching"} {"id":"46","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function isAlphanumeric(c) {\n return (c \u003e= \u0027A\u0027 \u0026\u0026 c \u003c= \u0027Z\u0027) || (c \u003e= \u0027a\u0027 \u0026\u0026 c \u003c= \u0027z\u0027) || (c \u003e= \u00270\u0027 \u0026\u0026 c \u003c= \u00279\u0027);\n}\n\nfunction decimalEntityEncode(str, safeChars = \u0027\u0027) {\n // Encodes everything that is NOT alphanumeric and NOT in safeChars\n // Uses \u0026#DD; decimal numeric character references (NOT named entities)\n let out = \u0027\u0027;\n for (const c of str) {\n if (isAlphanumeric(c) || safeChars.includes(c)) {\n out += c;\n } else {\n out += \u0027\u0026#\u0027 + c.charCodeAt(0) + \u0027;\u0027;\n }\n }\n return out;\n}\n\n","golden_completion":"function htmlSafeEncode(str, extraSafe = \u0027 \u0027) {\n let out = \u0027\u0027;\n for (const c of str) {\n if (isAlphanumeric(c) || c === \u0027 \u0027 || extraSafe.includes(c)) {\n out += c;\n } else {\n out += \u0027\u0026#\u0027 + c.charCodeAt(0) + \u0027;\u0027;\n }\n }\n return out;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// decimalEntityEncode: everything non-alphanumeric is \u0026#DD;\nassert.strictEqual(decimalEntityEncode(\u0027a\u003cb\u0027), \u0027a\u0026#60;b\u0027);\nassert.strictEqual(decimalEntityEncode(\u0027a\u0026b\u0027), \u0027a\u0026#38;b\u0027);\n// NOT \u0026lt; or \u0026amp; — always decimal numeric refs\n\n// htmlSafeEncode: spaces are safe by default\nassert.strictEqual(htmlSafeEncode(\u0027hello world\u0027), \u0027hello world\u0027);\nassert.strictEqual(htmlSafeEncode(\u0027a\u003cb\u003ec\u0027), \u0027a\u0026#60;b\u0026#62;c\u0027);\nassert.strictEqual(htmlSafeEncode(\u0027a\u0026b\u0027), \u0027a\u0026#38;b\u0027);\n// NOT \u0026amp; — decimal numeric ref\nassert.strictEqual(htmlSafeEncode(\u0027price: $5\u0027), \u0027price\u0026#58; \u0026#36;5\u0027);\nconsole.log(\u0027Task 46 suffix passed\u0027);\n","assertions":"assert.strictEqual(htmlSafeEncode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(htmlSafeEncode(\u0027abc123\u0027), \u0027abc123\u0027);\nassert.strictEqual(htmlSafeEncode(\u0027a+b=c\u0027), \u0027a\u0026#43;b\u0026#61;c\u0027);\nassert.strictEqual(htmlSafeEncode(\u0027\"quotes\"\u0027), \u0027\u0026#34;quotes\u0026#34;\u0027);\n// Space is safe by default\nassert.strictEqual(htmlSafeEncode(\u0027a b\u0027), \u0027a b\u0027);\n// With extra safe chars\nassert.strictEqual(htmlSafeEncode(\u0027a.b-c\u0027, \u0027.-\u0027), \u0027a.b-c\u0027);\nassert.strictEqual(htmlSafeEncode(\u0027a.b-c\u0027), \u0027a\u0026#46;b\u0026#45;c\u0027);\n// Non-ASCII\nassert.strictEqual(htmlSafeEncode(\u0027caf\\u00e9\u0027), \u0027caf\u0026#233;\u0027);\nconsole.log(\u0027Task 46 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"47","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function* chunkArray(arr, size) {\n // Non-overlapping chunks\n for (let i = 0; i \u003c arr.length; i += size) {\n yield arr.slice(i, i + size);\n }\n}\n\nfunction* chunkString(str, size) {\n // Same pattern for strings\n for (let i = 0; i \u003c str.length; i += size) {\n yield str.slice(i, i + size);\n }\n}\n\n","golden_completion":"function* slidingWindow(arr, size, step = 1) {\n // Overlapping chunks: advance by step (not size)\n for (let i = 0; i \u003c= arr.length - size; i += step) {\n yield arr.slice(i, i + size);\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// Non-overlapping chunks\nassert.deepStrictEqual([...chunkArray([1,2,3,4,5], 2)], [[1,2],[3,4],[5]]);\nassert.deepStrictEqual([...chunkString(\u0027abcde\u0027, 2)], [\u0027ab\u0027,\u0027cd\u0027,\u0027e\u0027]);\n\n// Sliding window: overlapping with step=1 by default\nconst windows = [...slidingWindow([1,2,3,4], 3)];\nassert.deepStrictEqual(windows, [[1,2,3],[2,3,4]]);\n// With step=2\nconst windows2 = [...slidingWindow([1,2,3,4,5], 3, 2)];\nassert.deepStrictEqual(windows2, [[1,2,3],[3,4,5]]);\nconsole.log(\u0027Task 47 suffix passed\u0027);\n","assertions":"// Window equals array length\nassert.deepStrictEqual([...slidingWindow([1,2,3], 3)], [[1,2,3]]);\n// Window of 1\nassert.deepStrictEqual([...slidingWindow([1,2,3], 1)], [[1],[2],[3]]);\n// Step larger than 1\nassert.deepStrictEqual([...slidingWindow([1,2,3,4,5,6], 2, 3)], [[1,2],[4,5]]);\n// Empty result when array smaller than window\nassert.deepStrictEqual([...slidingWindow([1], 3)], []);\n// Empty array\nassert.deepStrictEqual([...slidingWindow([], 2)], []);\n// Step equals size (non-overlapping)\nassert.deepStrictEqual([...slidingWindow([1,2,3,4], 2, 2)], [[1,2],[3,4]]);\nconsole.log(\u0027Task 47 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"48","testsource":"devbench-pattern-matching","language":"javascript","prefix":"async function runSequential(tasks) {\n const results = [];\n for (const task of tasks) {\n results.push(await task());\n }\n return results;\n}\n\nasync function runParallel(tasks) {\n return Promise.all(tasks.map(t =\u003e t()));\n}\n\n","golden_completion":"async function runPooled(tasks, concurrency = 2) {\n const results = new Array(tasks.length);\n let next = 0;\n const worker = async () =\u003e {\n while (next \u003c tasks.length) { const i = next++; results[i] = await tasks[i](); }\n };\n const w = Array.from({length: Math.min(concurrency, tasks.length)}, () =\u003e worker());\n await Promise.all(w);\n return results;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\nasync function testPool() {\n const log = [];\n const makeFn = (id, ms) =\u003e async () =\u003e {\n log.push(\u0027start-\u0027 + id);\n await new Promise(r =\u003e setTimeout(r, ms));\n log.push(\u0027end-\u0027 + id);\n return id;\n };\n\n const tasks = [makeFn(\u0027a\u0027, 50), makeFn(\u0027b\u0027, 30), makeFn(\u0027c\u0027, 20), makeFn(\u0027d\u0027, 10)];\n const results = await runPooled(tasks, 2);\n assert.deepStrictEqual(results, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027]);\n\n // With concurrency 2: a and b start first, then c and d fill in as slots open\n // b finishes before a (30ms vs 50ms), so c starts while a is still running\n assert.strictEqual(log[0], \u0027start-a\u0027);\n assert.strictEqual(log[1], \u0027start-b\u0027);\n // Only 2 tasks should be running at the start\n assert.ok(log.indexOf(\u0027start-c\u0027) \u003e 1, \u0027c should not start immediately\u0027);\n console.log(\u0027Task 48 suffix passed\u0027);\n}\ntestPool();\n","assertions":"async function testPoolAssertions() {\n // Results in correct order regardless of completion order\n const tasks2 = [\n async () =\u003e { await new Promise(r =\u003e setTimeout(r, 40)); return 1; },\n async () =\u003e { await new Promise(r =\u003e setTimeout(r, 10)); return 2; },\n async () =\u003e { await new Promise(r =\u003e setTimeout(r, 10)); return 3; },\n ];\n const r2 = await runPooled(tasks2, 2);\n assert.deepStrictEqual(r2, [1, 2, 3]);\n\n // Concurrency of 1 = sequential\n const order = [];\n const tasks3 = [\n async () =\u003e { order.push(\u0027a\u0027); return \u0027a\u0027; },\n async () =\u003e { order.push(\u0027b\u0027); return \u0027b\u0027; },\n async () =\u003e { order.push(\u0027c\u0027); return \u0027c\u0027; },\n ];\n await runPooled(tasks3, 1);\n assert.deepStrictEqual(order, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n\n // Empty array\n const r3 = await runPooled([], 3);\n assert.deepStrictEqual(r3, []);\n\n // Concurrency \u003e tasks\n const r4 = await runPooled([async () =\u003e 42], 5);\n assert.deepStrictEqual(r4, [42]);\n\n console.log(\u0027Task 48 assertions passed\u0027);\n}\ntestPoolAssertions();\n","category":"pattern_matching"} {"id":"49","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function pipeline(...fns) {\n // Standard pipeline: each fn gets result of previous. Stops on error.\n return function(input) {\n let result = input;\n for (const fn of fns) {\n result = fn(result);\n }\n return result;\n };\n}\n\n","golden_completion":"function recoveryPipeline(...fns) {\n return function(input) {\n let value = input, error = null;\n for (const fn of fns) {\n try { value = fn(value, error); error = null; }\n catch (e) { error = e; value = null; }\n }\n if (error) throw error;\n return value;\n };\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\n// Standard pipeline\nconst double = pipeline(x =\u003e x * 2, x =\u003e x + 1);\nassert.strictEqual(double(5), 11);\n\n// Recovery pipeline: error is passed to next fn which can recover\nconst recover = recoveryPipeline(\n (v) =\u003e { throw new Error(\u0027boom\u0027); },\n (v, err) =\u003e err ? \u0027recovered:\u0027 + err.message : v\n);\nassert.strictEqual(recover(\u0027input\u0027), \u0027recovered:boom\u0027);\n\n// No error: error arg is null\nconst noErr = recoveryPipeline(\n (v, err) =\u003e v * 2,\n (v, err) =\u003e { assert.strictEqual(err, null); return v + 1; }\n);\nassert.strictEqual(noErr(5), 11);\nconsole.log(\u0027Task 49 suffix passed\u0027);\n","assertions":"// Chain of errors and recoveries\nconst chain = recoveryPipeline(\n (v) =\u003e v + 1,\n (v) =\u003e { throw new Error(\u0027e1\u0027); },\n (v, err) =\u003e { if (err) return 100; return v; },\n (v) =\u003e v * 2\n);\nassert.strictEqual(chain(0), 200);\n\n// Last fn throws -\u003e pipeline throws\nassert.throws(() =\u003e {\n const p = recoveryPipeline(\n (v) =\u003e v,\n (v) =\u003e { throw new Error(\u0027final\u0027); }\n );\n p(\u0027x\u0027);\n}, /final/);\n\n// Recovery clears error for subsequent fns\nconst multi = recoveryPipeline(\n (v) =\u003e { throw new Error(\u0027a\u0027); },\n (v, err) =\u003e \u0027fixed\u0027,\n (v, err) =\u003e { assert.strictEqual(err, null); return v + \u0027!\u0027; }\n);\nassert.strictEqual(multi(\u0027x\u0027), \u0027fixed!\u0027);\n\n// When previous threw, value is null\nconst checkNull = recoveryPipeline(\n (v) =\u003e { throw new Error(\u0027oops\u0027); },\n (v, err) =\u003e { assert.strictEqual(v, null); return \u0027ok\u0027; }\n);\nassert.strictEqual(checkNull(\u0027hi\u0027), \u0027ok\u0027);\nconsole.log(\u0027Task 49 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"50","testsource":"devbench-pattern-matching","language":"javascript","prefix":"function toHexByte(n) {\n return n.toString(16).padStart(2, \u00270\u0027).toUpperCase();\n}\n\nfunction simpleHex(data) {\n const buf = Buffer.from(data);\n return Array.from(buf).map(b =\u003e toHexByte(b)).join(\u0027\u0027);\n}\n\nfunction spacedHex(data) {\n const buf = Buffer.from(data);\n return Array.from(buf).map(b =\u003e toHexByte(b)).join(\u0027 \u0027);\n}\n\n","golden_completion":"function checksumHex(data, groupSize = 4, sep = \u0027-\u0027) {\n const buf = Buffer.from(data);\n if (buf.length === 0) return \u0027\u0027;\n let checksum = 0;\n const hexBytes = Array.from(buf).map(b =\u003e { checksum ^= b; return toHexByte(b); });\n hexBytes.push(toHexByte(checksum));\n const groups = [];\n for (let i = 0; i \u003c hexBytes.length; i += groupSize) groups.push(hexBytes.slice(i, i + groupSize).join(\u0027\u0027));\n return groups.join(sep);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// simpleHex: no spaces\nassert.strictEqual(simpleHex(\u0027AB\u0027), \u00274142\u0027);\n// spacedHex: space-separated\nassert.strictEqual(spacedHex(\u0027AB\u0027), \u002741 42\u0027);\n\n// checksumHex: grouped with checksum byte appended\n// \u0027AB\u0027 = [0x41, 0x42], checksum = 0x41 ^ 0x42 = 0x03\n// 3 hex bytes: 41,42,03 -\u003e grouped by 4: \u0027414203\u0027\nassert.strictEqual(checksumHex(\u0027AB\u0027), \u0027414203\u0027);\n// \u0027A\u0027 = [0x41], checksum = 0x41, grouped by 4: \u00274141\u0027\nassert.strictEqual(checksumHex(\u0027A\u0027), \u00274141\u0027);\n// \u0027ABCD\u0027 = [0x41, 0x42, 0x43, 0x44], checksum = 0x41^0x42^0x43^0x44 = 0x04\n// 5 hex bytes: 41,42,43,44,04 -\u003e grouped by 4: \u002741424344-04\u0027\nassert.strictEqual(checksumHex(\u0027ABCD\u0027), \u002741424344-04\u0027);\n// \u0027ABC\u0027 = [0x41, 0x42, 0x43], checksum = 0x41^0x42^0x43 = 0x40\n// 4 hex bytes: 41,42,43,40 -\u003e grouped by 2: \u00274142-4340\u0027\nassert.strictEqual(checksumHex(\u0027ABC\u0027, 2), \u00274142-4340\u0027);\nconsole.log(\u0027Task 50 suffix passed\u0027);\n","assertions":"// Empty input\nassert.strictEqual(checksumHex(\u0027\u0027), \u0027\u0027);\n// Single byte\nassert.strictEqual(checksumHex(\u0027X\u0027), toHexByte(0x58) + toHexByte(0x58));\n// Checksum correctness\n// \u0027Hi\u0027 = [0x48, 0x69], XOR = 0x48 ^ 0x69 = 0x21\n// 3 hex bytes: 48,69,21 -\u003e grouped by 4: \u0027486921\u0027\nassert.strictEqual(checksumHex(\u0027Hi\u0027), \u0027486921\u0027);\n// Custom separator\nassert.strictEqual(checksumHex(\u0027Hi\u0027, 4, \u0027:\u0027), \u0027486921\u0027);\nassert.strictEqual(checksumHex(\u0027Hi\u0027, 2, \u0027:\u0027), \u00274869:21\u0027);\nassert.strictEqual(checksumHex(\u0027Hi\u0027, 1, \u0027:\u0027), \u002748:69:21\u0027);\n// Longer input: \u0027Hello\u0027 = [0x48,0x65,0x6C,0x6C,0x6F], XOR = 0x42\n// Hex bytes: 48,65,6C,6C,6F,42 -\u003e 6 hex bytes, groups of 4: \u002748656C6C-6F42\u0027\nassert.strictEqual(checksumHex(\u0027Hello\u0027, 4, \u0027-\u0027), \u002748656C6C-6F42\u0027);\nconsole.log(\u0027Task 50 assertions passed\u0027);\n","category":"pattern_matching"} {"id":"1","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function createResource(name) {\n return { name, closed: false, close() { this.closed = true; } };\n}\n\nasync function processResources(names) {\n const results = [];\n for (const name of names) {\n const resource = createResource(name);\n try {\n if (name.startsWith(\u0027bad\u0027)) {\n throw new Error(\u0027Invalid resource: \u0027 + name);\n }\n results.push({ name, status: \u0027ok\u0027 });\n } catch (err) {\n","golden_completion":" results.push({ name, status: \u0027error\u0027, message: err.message });\n } finally {\n resource.close();\n results.push({ name, closed: resource.closed });\n }\n","suffix":" }\n return results;\n}\n\nasync function test1() {\n const res = await processResources([\u0027good1\u0027, \u0027bad2\u0027, \u0027good3\u0027]);\n return res;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\ntest1().then(res =\u003e {\n assert.strictEqual(res.length, 6);\n assert.deepStrictEqual(res[0], { name: \u0027good1\u0027, status: \u0027ok\u0027 });\n assert.deepStrictEqual(res[1], { name: \u0027good1\u0027, closed: true });\n assert.deepStrictEqual(res[2], { name: \u0027bad2\u0027, status: \u0027error\u0027, message: \u0027Invalid resource: bad2\u0027 });\n assert.deepStrictEqual(res[3], { name: \u0027bad2\u0027, closed: true });\n assert.deepStrictEqual(res[4], { name: \u0027good3\u0027, status: \u0027ok\u0027 });\n assert.deepStrictEqual(res[5], { name: \u0027good3\u0027, closed: true });\n console.log(\u0027Task 1 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 1 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"2","testsource":"devbench-syntax-completion","language":"javascript","prefix":"async function* resilientItems(batch) {\n for (const item of batch.items ?? []) {\n try {\n yield { id: batch.id, item };\n } catch (err) {\n yield { id: batch.id, recovered: err.message };\n }\n }\n return batch.id + \u0027:done\u0027;\n}\n\nasync function* source(list) {\n for (const item of list) yield item;\n}\n\nasync function* streamBatches(batches, audit) {\n audit.push(\u0027open\u0027);\n try {\n for await (const batch of batches) {\n try {\n if (batch.skip) { audit.push(\u0027skip:\u0027 + batch.id); continue; }\n if (batch.fail) { throw new Error(\u0027batch:\u0027 + batch.id); }\n","golden_completion":" const marker = yield* resilientItems(batch);\n audit.push(\u0027delegated:\u0027 + marker);\n } catch (err) {\n audit.push(\u0027error:\u0027 + err.message);\n yield { id: batch.id, error: err.message };\n } finally {\n audit.push(\u0027done:\u0027 + batch.id);\n }\n","suffix":" }\n } finally {\n audit.push(\u0027close\u0027);\n }\n}\n\nconst assert = require(\u0027assert\u0027);\n\n(async () =\u003e {\n const audit = [];\n const gen = streamBatches(source([{ id: \u0027a\u0027, items: [1, 2] }]), audit);\n assert.deepStrictEqual(await gen.next(), { value: { id: \u0027a\u0027, item: 1 }, done: false });\n assert.deepStrictEqual(await gen.throw(new Error(\u0027nudge\u0027)), { value: { id: \u0027a\u0027, recovered: \u0027nudge\u0027 }, done: false });\n assert.deepStrictEqual(await gen.next(), { value: { id: \u0027a\u0027, item: 2 }, done: false });\n assert.deepStrictEqual(await gen.next(), { value: undefined, done: true });\n assert.deepStrictEqual(audit, [\u0027open\u0027, \u0027delegated:a:done\u0027, \u0027done:a\u0027, \u0027close\u0027]);\n console.log(\u0027Task 2 suffix passed\u0027);\n})();\n","assertions":"(async () =\u003e {\n const audit = [];\n const out = [];\n for await (const value of streamBatches(source([\n { id: \u0027ok\u0027, items: [\u0027x\u0027] },\n { id: \u0027bad\u0027, fail: true },\n { id: \u0027skip\u0027, skip: true, items: [\u0027z\u0027] }\n ]), audit)) out.push(value);\n assert.deepStrictEqual(out, [\n { id: \u0027ok\u0027, item: \u0027x\u0027 },\n { id: \u0027bad\u0027, error: \u0027batch:bad\u0027 }\n ]);\n assert.deepStrictEqual(audit, [\n \u0027open\u0027, \u0027delegated:ok:done\u0027, \u0027done:ok\u0027, \u0027error:batch:bad\u0027, \u0027done:bad\u0027, \u0027skip:skip\u0027, \u0027done:skip\u0027, \u0027close\u0027\n ]);\n console.log(\u0027Task 2 assertions passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"3","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function unpackEnvelope(packet, primaryKey, fallbackKey) {\n const {\n id = \u0027missing\u0027,\n routes: [\n { name: firstRoute = \u0027root\u0027, hops: [firstHop = \u0027start\u0027, ...otherHops] = [] } = {},\n ...otherRoutes\n ] = [],\n [primaryKey]: {\n enabled: primaryEnabled = false,\n limits: { soft: primarySoft = 10, hard: primaryHard = primarySoft * 2 } = {},\n windows: [{ start: primaryStart = 0, end: primaryEnd = primaryHard } = {}, ...primaryWindows] = [],\n ...primaryExtra\n } = {},\n","golden_completion":" [fallbackKey]: {\n enabled: fallbackEnabled = primaryEnabled,\n limits: { soft: fallbackSoft = primarySoft - 1, hard: fallbackHard = primaryHard + fallbackSoft } = {},\n windows: [{ start: fallbackStart = 0, end: fallbackEnd = fallbackStart + fallbackSoft } = {}, ...fallbackWindows] = [],\n ...fallbackExtra\n } = {},\n meta: {\n owners: [{ name: ownerName = \u0027system\u0027, contacts: [ownerContact = null, ...otherContacts] = [] } = {}, ...otherOwners] = [],\n flags: { urgent: isUrgent = false, ...flagRest } = {}\n } = {},\n version = \u00271.0\u0027\n } = packet ?? {};\n","suffix":"\n return {\n id,\n route: { firstRoute, firstHop, otherHops, otherRouteCount: otherRoutes.length },\n primary: { primaryEnabled, primarySoft, primaryHard, primaryStart, primaryEnd, primaryWindowCount: primaryWindows.length, primaryExtra },\n fallback: { fallbackEnabled, fallbackSoft, fallbackHard, fallbackStart, fallbackEnd, fallbackWindowCount: fallbackWindows.length, fallbackExtra },\n owner: { ownerName, ownerContact, otherContacts, otherOwnerCount: otherOwners.length },\n flags: { isUrgent, flagRest },\n version\n };\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst full = unpackEnvelope({\n id: \u0027env1\u0027,\n routes: [\n { name: \u0027edge\u0027, hops: [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027] },\n { name: \u0027backup\u0027, hops: [\u0027z\u0027] }\n ],\n main: {\n enabled: true,\n limits: { soft: 5, hard: 12 },\n windows: [{ start: 2, end: 8 }, { start: 9, end: 10 }],\n color: \u0027blue\u0027\n },\n backup: {\n limits: { soft: 3 },\n windows: [{ start: 4 }, { start: 6, end: 7 }],\n note: \u0027fallback\u0027\n },\n meta: {\n owners: [{ name: \u0027Ada\u0027, contacts: [\u0027ada@example.com\u0027, \u0027sms\u0027] }, { name: \u0027Grace\u0027 }],\n flags: { urgent: true, reviewed: false }\n },\n version: \u00272.0\u0027\n}, \u0027main\u0027, \u0027backup\u0027);\nassert.strictEqual(full.route.firstRoute, \u0027edge\u0027);\nassert.deepStrictEqual(full.route.otherHops, [\u0027b\u0027, \u0027c\u0027]);\nassert.strictEqual(full.route.otherRouteCount, 1);\nassert.strictEqual(full.primary.primarySoft, 5);\nassert.strictEqual(full.primary.primaryHard, 12);\nassert.strictEqual(full.primary.primaryWindowCount, 1);\nassert.deepStrictEqual(full.primary.primaryExtra, { color: \u0027blue\u0027 });\nassert.strictEqual(full.fallback.fallbackEnabled, true);\nassert.strictEqual(full.fallback.fallbackSoft, 3);\nassert.strictEqual(full.fallback.fallbackHard, 15);\nassert.strictEqual(full.fallback.fallbackEnd, 7);\nassert.strictEqual(full.fallback.fallbackWindowCount, 1);\nassert.deepStrictEqual(full.fallback.fallbackExtra, { note: \u0027fallback\u0027 });\nassert.deepStrictEqual(full.owner, { ownerName: \u0027Ada\u0027, ownerContact: \u0027ada@example.com\u0027, otherContacts: [\u0027sms\u0027], otherOwnerCount: 1 });\nassert.deepStrictEqual(full.flags, { isUrgent: true, flagRest: { reviewed: false } });\nassert.strictEqual(full.version, \u00272.0\u0027);\n\nconst defaults = unpackEnvelope({}, \u0027main\u0027, \u0027backup\u0027);\nassert.strictEqual(defaults.fallback.fallbackEnabled, false);\nassert.strictEqual(defaults.fallback.fallbackSoft, 9);\nassert.strictEqual(defaults.fallback.fallbackHard, 29);\nassert.strictEqual(defaults.fallback.fallbackEnd, 9);\nassert.strictEqual(defaults.owner.ownerName, \u0027system\u0027);\nassert.strictEqual(defaults.version, \u00271.0\u0027);\nconsole.log(\u0027Task 3 suffix passed\u0027);\n","assertions":"const inherited = unpackEnvelope({\n main: { enabled: true, limits: { soft: 4, hard: 9 } },\n routes: [{}],\n meta: { owners: [{}], flags: { archived: true } }\n}, \u0027main\u0027, \u0027backup\u0027);\nassert.strictEqual(inherited.fallback.fallbackEnabled, true);\nassert.strictEqual(inherited.fallback.fallbackSoft, 3);\nassert.strictEqual(inherited.fallback.fallbackHard, 12);\nassert.strictEqual(inherited.fallback.fallbackEnd, 3);\nassert.deepStrictEqual(inherited.route, { firstRoute: \u0027root\u0027, firstHop: \u0027start\u0027, otherHops: [], otherRouteCount: 0 });\nassert.deepStrictEqual(inherited.flags, { isUrgent: false, flagRest: { archived: true } });\n\nconst nullish = unpackEnvelope(null, \u0027main\u0027, \u0027backup\u0027);\nassert.strictEqual(nullish.id, \u0027missing\u0027);\nassert.strictEqual(nullish.primary.primaryHard, 20);\nassert.strictEqual(nullish.fallback.fallbackHard, 29);\nconsole.log(\u0027Task 3 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"4","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function parseConfig(raw) {\n const {\n server: {\n host = \u0027localhost\u0027,\n port = 3000,\n ssl: {\n enabled: sslEnabled = false,\n cert: sslCert = null,\n } = {},\n } = {},\n database: {\n","golden_completion":" url: dbUrl = \u0027mongodb://localhost:27017\u0027,\n name: dbName = \u0027default\u0027,\n options: {\n poolSize: dbPoolSize = 5,\n retryWrites: dbRetryWrites = true,\n } = {},\n } = {},\n logging: {\n level: logLevel = \u0027info\u0027,\n format: logFormat = \u0027json\u0027,\n } = {},\n","suffix":" } = raw || {};\n\n return {\n host, port, sslEnabled, sslCert,\n dbUrl, dbName, dbPoolSize, dbRetryWrites,\n logLevel, logFormat,\n };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst full = parseConfig({\n server: { host: \u0027prod.example.com\u0027, port: 8080, ssl: { enabled: true, cert: \u0027/path/to/cert\u0027 } },\n database: { url: \u0027mongodb://prod:27017\u0027, name: \u0027mydb\u0027, options: { poolSize: 20, retryWrites: false } },\n logging: { level: \u0027debug\u0027, format: \u0027text\u0027 },\n});\nassert.strictEqual(full.host, \u0027prod.example.com\u0027);\nassert.strictEqual(full.port, 8080);\nassert.strictEqual(full.sslEnabled, true);\nassert.strictEqual(full.dbUrl, \u0027mongodb://prod:27017\u0027);\nassert.strictEqual(full.dbPoolSize, 20);\nassert.strictEqual(full.logLevel, \u0027debug\u0027);\n\nconst empty = parseConfig({});\nassert.strictEqual(empty.host, \u0027localhost\u0027);\nassert.strictEqual(empty.port, 3000);\nassert.strictEqual(empty.sslEnabled, false);\nassert.strictEqual(empty.dbUrl, \u0027mongodb://localhost:27017\u0027);\nassert.strictEqual(empty.dbName, \u0027default\u0027);\nassert.strictEqual(empty.dbPoolSize, 5);\nassert.strictEqual(empty.dbRetryWrites, true);\nassert.strictEqual(empty.logLevel, \u0027info\u0027);\nassert.strictEqual(empty.logFormat, \u0027json\u0027);\n\nconst n = parseConfig(null);\nassert.strictEqual(n.host, \u0027localhost\u0027);\nassert.strictEqual(n.dbUrl, \u0027mongodb://localhost:27017\u0027);\n\nconsole.log(\u0027Task 4 passed\u0027);\n","category":"syntax_completion"} {"id":"5","testsource":"devbench-syntax-completion","language":"javascript","prefix":"async function* paginate(fetchPage) {\n let page = 0;\n let hasMore = true;\n try {\n while (hasMore) {\n const result = await fetchPage(page);\n if (!result || result.items.length === 0) {\n hasMore = false;\n } else {\n","golden_completion":" for (const item of result.items) {\n yield item;\n }\n hasMore = result.hasMore !== false;\n page++;\n }\n }\n } finally {\n yield { done: true, totalPages: page };\n }\n","suffix":"}\n\nasync function collectAll(gen) {\n const items = [];\n for await (const item of gen) {\n items.push(item);\n }\n return items;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst mockPages = [\n { items: [\u0027a\u0027, \u0027b\u0027], hasMore: true },\n { items: [\u0027c\u0027], hasMore: true },\n { items: [\u0027d\u0027, \u0027e\u0027], hasMore: false },\n];\n\nasync function mockFetch(page) {\n return mockPages[page] || null;\n}\n\ncollectAll(paginate(mockFetch)).then(result =\u003e {\n assert.strictEqual(result.length, 6);\n assert.strictEqual(result[0], \u0027a\u0027);\n assert.strictEqual(result[1], \u0027b\u0027);\n assert.strictEqual(result[2], \u0027c\u0027);\n assert.strictEqual(result[3], \u0027d\u0027);\n assert.strictEqual(result[4], \u0027e\u0027);\n assert.deepStrictEqual(result[5], { done: true, totalPages: 3 });\n console.log(\u0027Task 5 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 5 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"6","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function createValidatedObject(schema) {\n const data = {};\n const log = [];\n return new Proxy(data, {\n set(target, prop, value) {\n const rule = schema[prop];\n if (!rule) {\n log.push({ action: \u0027reject\u0027, prop, reason: \u0027unknown\u0027 });\n return false;\n }\n if (rule.type \u0026\u0026 typeof value !== rule.type) {\n log.push({ action: \u0027reject\u0027, prop, reason: \u0027type\u0027 });\n return false;\n }\n if (rule.min !== undefined \u0026\u0026 value \u003c rule.min) {\n log.push({ action: \u0027reject\u0027, prop, reason: \u0027min\u0027 });\n return false;\n }\n","golden_completion":" target[prop] = rule.transform ? rule.transform(value) : value;\n log.push({ action: \u0027set\u0027, prop, value: target[prop] });\n return true;\n },\n get(target, prop) {\n if (prop === \u0027_log\u0027) return [...log];\n if (prop === \u0027_data\u0027) return { ...target };\n return target[prop];\n },\n","suffix":" });\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst obj = createValidatedObject({\n name: { type: \u0027string\u0027, transform: v =\u003e v.trim().toLowerCase() },\n age: { type: \u0027number\u0027, min: 0 },\n});\n\nobj.name = \u0027 Alice \u0027;\nassert.strictEqual(obj.name, \u0027alice\u0027);\n\nobj.age = 25;\nassert.strictEqual(obj.age, 25);\n\nconst r1 = Reflect.set(obj, \u0027age\u0027, -5);\nassert.strictEqual(r1, false);\nassert.strictEqual(obj.age, 25);\n\nconst r2 = Reflect.set(obj, \u0027unknown\u0027, \u0027x\u0027);\nassert.strictEqual(r2, false);\n\nconst r3 = Reflect.set(obj, \u0027name\u0027, 123);\nassert.strictEqual(r3, false);\n\nconst logEntries = obj._log;\nassert.strictEqual(logEntries.length, 5);\nassert.strictEqual(logEntries[0].action, \u0027set\u0027);\nassert.strictEqual(logEntries[0].value, \u0027alice\u0027);\n\nconst data = obj._data;\nassert.strictEqual(data.name, \u0027alice\u0027);\nassert.strictEqual(data.age, 25);\n\nconsole.log(\u0027Task 6 passed\u0027);\n","category":"syntax_completion"} {"id":"7","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function batchProcess(items, processor) {\n const results = { succeeded: [], failed: [], retried: [] };\n\n return Promise.allSettled(\n items.map(item =\u003e\n processor(item)\n .then(value =\u003e ({ item, value, attempt: 1 }))\n .catch(err =\u003e\n","golden_completion":" processor(item)\n .then(value =\u003e {\n results.retried.push(item);\n return { item, value, attempt: 2 };\n })\n .catch(retryErr =\u003e {\n throw { item, errors: [err.message, retryErr.message] };\n })\n )\n","suffix":" )\n ).then(outcomes =\u003e {\n for (const outcome of outcomes) {\n if (outcome.status === \u0027fulfilled\u0027) {\n results.succeeded.push(outcome.value);\n } else {\n results.failed.push(outcome.reason);\n }\n }\n return results;\n });\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nlet callCounts = {};\nfunction testProcessor(item) {\n callCounts[item] = (callCounts[item] || 0) + 1;\n if (item === \u0027fail-always\u0027) return Promise.reject(new Error(\u0027permanent\u0027));\n if (item === \u0027fail-once\u0027 \u0026\u0026 callCounts[item] === 1) return Promise.reject(new Error(\u0027transient\u0027));\n return Promise.resolve(item.toUpperCase());\n}\n\nbatchProcess([\u0027ok\u0027, \u0027fail-once\u0027, \u0027fail-always\u0027], testProcessor).then(res =\u003e {\n assert.strictEqual(res.succeeded.length, 2);\n assert.deepStrictEqual(res.succeeded[0], { item: \u0027ok\u0027, value: \u0027OK\u0027, attempt: 1 });\n assert.deepStrictEqual(res.succeeded[1], { item: \u0027fail-once\u0027, value: \u0027FAIL-ONCE\u0027, attempt: 2 });\n assert.strictEqual(res.retried.length, 1);\n assert.strictEqual(res.retried[0], \u0027fail-once\u0027);\n assert.strictEqual(res.failed.length, 1);\n assert.deepStrictEqual(res.failed[0], { item: \u0027fail-always\u0027, errors: [\u0027permanent\u0027, \u0027permanent\u0027] });\n console.log(\u0027Task 7 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 7 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"8","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const _history = Symbol(\u0027history\u0027);\n\nclass ReactiveMap {\n #data = new Map();\n [_history] = [];\n\n constructor(entries = []) {\n for (const [k, v] of entries) {\n this.#data.set(k, v);\n }\n }\n\n get size() {\n return this.#data.size;\n }\n\n set(key, value) {\n if (typeof key !== \u0027string\u0027) throw new TypeError(\u0027Key must be string\u0027);\n const old = this.#data.get(key);\n","golden_completion":" this.#data.set(key, value);\n this[_history].push({ type: old === undefined ? \u0027add\u0027 : \u0027update\u0027, key, oldValue: old, newValue: value });\n return this;\n }\n\n get(key) { return this.#data.get(key); }\n\n getHistory(key) {\n return key === undefined ? [...this[_history]] : this[_history].filter(e =\u003e e.key === key);\n }\n","suffix":"\n [Symbol.iterator]() {\n return this.#data[Symbol.iterator]();\n }\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst rm = new ReactiveMap([[\u0027x\u0027, 1]]);\nassert.strictEqual(rm.size, 1);\nassert.strictEqual(rm.get(\u0027x\u0027), 1);\n\nrm.set(\u0027x\u0027, 2).set(\u0027y\u0027, 3);\nassert.strictEqual(rm.get(\u0027x\u0027), 2);\nassert.strictEqual(rm.get(\u0027y\u0027), 3);\nassert.strictEqual(rm.size, 2);\n\nconst hist = rm.getHistory();\nassert.strictEqual(hist.length, 2);\nassert.strictEqual(hist[0].type, \u0027update\u0027);\nassert.strictEqual(hist[0].key, \u0027x\u0027);\nassert.strictEqual(hist[0].oldValue, 1);\nassert.strictEqual(hist[0].newValue, 2);\nassert.strictEqual(hist[1].type, \u0027add\u0027);\nassert.strictEqual(hist[1].key, \u0027y\u0027);\n\nconst xHist = rm.getHistory(\u0027x\u0027);\nassert.strictEqual(xHist.length, 1);\n\nconst entries = [...rm];\nassert.strictEqual(entries.length, 2);\n\ntry { rm.set(123, \u0027bad\u0027); assert.fail(\u0027should throw\u0027); } catch(e) { assert.ok(e instanceof TypeError); }\n\nconsole.log(\u0027Task 8 passed\u0027);\n","category":"syntax_completion"} {"id":"9","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function createPipeline(...stages) {\n return async function execute(input) {\n const context = { input, results: [], errors: [] };\n for (const [index, stage] of stages.entries()) {\n const { name = `stage_${index}`, transform, fallback = null } = stage;\n try {\n const prevOutput = context.results[context.results.length - 1]?.output ?? context.input;\n","golden_completion":" const output = await transform(prevOutput, context);\n context.results.push({ name, output });\n } catch (err) {\n if (fallback) {\n const fbResult = await fallback(err, context);\n context.results.push({ name, output: fbResult, fromFallback: true });\n } else {\n context.errors.push({ name, error: err.message });\n context.results.push({ name, failed: true });\n }\n }\n","suffix":" }\n return context;\n };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst pipeline = createPipeline(\n { name: \u0027double\u0027, transform: async (v) =\u003e v * 2 },\n { name: \u0027addTen\u0027, transform: async (v) =\u003e v + 10 },\n {\n name: \u0027failSafe\u0027,\n transform: async () =\u003e { throw new Error(\u0027boom\u0027); },\n fallback: async (err) =\u003e \u0027recovered:\u0027 + err.message,\n },\n { name: \u0027final\u0027, transform: async (v) =\u003e String(v) + \u0027!\u0027 },\n);\n\npipeline(5).then(ctx =\u003e {\n assert.strictEqual(ctx.results.length, 4);\n assert.deepStrictEqual(ctx.results[0], { name: \u0027double\u0027, output: 10 });\n assert.deepStrictEqual(ctx.results[1], { name: \u0027addTen\u0027, output: 20 });\n assert.deepStrictEqual(ctx.results[2], { name: \u0027failSafe\u0027, output: \u0027recovered:boom\u0027, fromFallback: true });\n assert.deepStrictEqual(ctx.results[3], { name: \u0027final\u0027, output: \u0027recovered:boom!\u0027 });\n assert.strictEqual(ctx.errors.length, 0);\n console.log(\u0027Task 9 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 9 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"10","testsource":"devbench-syntax-completion","language":"javascript","prefix":"async function* walkTree(node, path = []) {\n const currentPath = [...path, node.name];\n if (node.type === \u0027leaf\u0027) {\n yield { path: currentPath, value: node.value, depth: currentPath.length };\n return;\n }\n if (node.type === \u0027branch\u0027) {\n yield { path: currentPath, type: \u0027enter\u0027, depth: currentPath.length };\n if (node.children \u0026\u0026 node.children.length \u003e 0) {\n for (const [idx, child] of node.children.entries()) {\n try {\n","golden_completion":" yield* walkTree(child, currentPath);\n } catch (err) {\n yield {\n path: [...currentPath, child.name || `child_${idx}`],\n error: err.message,\n depth: currentPath.length + 1,\n };\n }\n }\n }\n yield { path: currentPath, type: \u0027exit\u0027, depth: currentPath.length };\n }\n","suffix":"}\n\nasync function collectTree(node) {\n const events = [];\n for await (const event of walkTree(node)) {\n events.push(event);\n }\n return events;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst tree = {\n name: \u0027root\u0027, type: \u0027branch\u0027, children: [\n { name: \u0027a\u0027, type: \u0027leaf\u0027, value: 1 },\n { name: \u0027b\u0027, type: \u0027branch\u0027, children: [\n { name: \u0027c\u0027, type: \u0027leaf\u0027, value: 2 },\n { name: \u0027d\u0027, type: \u0027leaf\u0027, value: 3 },\n ]},\n { name: \u0027e\u0027, type: \u0027leaf\u0027, value: 4 },\n ]\n};\n\ncollectTree(tree).then(events =\u003e {\n assert.strictEqual(events.length, 8);\n assert.deepStrictEqual(events[0], { path: [\u0027root\u0027], type: \u0027enter\u0027, depth: 1 });\n assert.deepStrictEqual(events[1], { path: [\u0027root\u0027, \u0027a\u0027], value: 1, depth: 2 });\n assert.deepStrictEqual(events[2], { path: [\u0027root\u0027, \u0027b\u0027], type: \u0027enter\u0027, depth: 2 });\n assert.deepStrictEqual(events[3], { path: [\u0027root\u0027, \u0027b\u0027, \u0027c\u0027], value: 2, depth: 3 });\n assert.deepStrictEqual(events[4], { path: [\u0027root\u0027, \u0027b\u0027, \u0027d\u0027], value: 3, depth: 3 });\n assert.deepStrictEqual(events[5], { path: [\u0027root\u0027, \u0027b\u0027], type: \u0027exit\u0027, depth: 2 });\n assert.deepStrictEqual(events[6], { path: [\u0027root\u0027, \u0027e\u0027], value: 4, depth: 2 });\n assert.deepStrictEqual(events[7], { path: [\u0027root\u0027], type: \u0027exit\u0027, depth: 1 });\n console.log(\u0027Task 10 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 10 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"11","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function retryGroups(groups, worker) {\n const audit = [];\n return Promise.all(\n groups.map(group =\u003e\n Promise.allSettled(\n group.items.map((item, index) =\u003e\n worker(item)\n .then(value =\u003e ({ group: group.name, item, value, attempt: 1 }))\n .catch(err =\u003e\n","golden_completion":" new Promise(resolve =\u003e {\n setTimeout(() =\u003e {\n audit.push(`retry:${group.name}:${index}`);\n resolve(worker(item)\n .then(value =\u003e ({ group: group.name, item, value, attempt: 2 }))\n .catch(retryErr =\u003e ({ group: group.name, item, errors: [err.message, retryErr.message] })));\n }, group.delay ?? 0);\n })\n )\n","suffix":" )\n ).then(results =\u003e ({\n group: group.name,\n values: results.map(r =\u003e r.value)\n }))\n )\n ).then(groups =\u003e ({ groups, audit }));\n}\n\nconst assert = require(\u0027assert\u0027);\n\n(async () =\u003e {\n const calls = {};\n const worker = (item) =\u003e {\n calls[item] = (calls[item] || 0) + 1;\n if (item === \u0027once\u0027 \u0026\u0026 calls[item] === 1) return Promise.reject(new Error(\u0027transient\u0027));\n if (item === \u0027always\u0027) return Promise.reject(new Error(\u0027permanent\u0027));\n return Promise.resolve(item.toUpperCase());\n };\n const res = await retryGroups([\n { name: \u0027A\u0027, delay: 1, items: [\u0027ok\u0027, \u0027once\u0027] },\n { name: \u0027B\u0027, items: [\u0027always\u0027] }\n ], worker);\n assert.deepStrictEqual(res.audit, [\u0027retry:A:1\u0027, \u0027retry:B:0\u0027]);\n assert.deepStrictEqual(res.groups[0], {\n group: \u0027A\u0027,\n values: [\n { group: \u0027A\u0027, item: \u0027ok\u0027, value: \u0027OK\u0027, attempt: 1 },\n { group: \u0027A\u0027, item: \u0027once\u0027, value: \u0027ONCE\u0027, attempt: 2 }\n ]\n });\n assert.deepStrictEqual(res.groups[1], {\n group: \u0027B\u0027,\n values: [\n { group: \u0027B\u0027, item: \u0027always\u0027, errors: [\u0027permanent\u0027, \u0027permanent\u0027] }\n ]\n });\n console.log(\u0027Task 11 suffix passed\u0027);\n})();\n","assertions":"(async () =\u003e {\n const seen = [];\n const worker = (item) =\u003e {\n seen.push(item);\n if (item === \u0027late\u0027) return Promise.reject(new Error(\u0027late-fail\u0027));\n return Promise.resolve(item + item);\n };\n const res = await retryGroups([{ name: \u0027C\u0027, delay: 0, items: [\u0027x\u0027, \u0027late\u0027] }], worker);\n assert.deepStrictEqual(res.audit, [\u0027retry:C:1\u0027]);\n assert.deepStrictEqual(seen, [\u0027x\u0027, \u0027late\u0027, \u0027late\u0027]);\n assert.deepStrictEqual(res.groups[0].values, [\n { group: \u0027C\u0027, item: \u0027x\u0027, value: \u0027xx\u0027, attempt: 1 },\n { group: \u0027C\u0027, item: \u0027late\u0027, errors: [\u0027late-fail\u0027, \u0027late-fail\u0027] }\n ]);\n console.log(\u0027Task 11 assertions passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"12","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// Async generator that yields values from an array with a delay.\n// Simulates an async data stream.\nasync function* asyncStream(items, delayMs) {\n for (const item of items) {\n await new Promise(r =\u003e setTimeout(r, delayMs));\n yield item;\n }\n}\n\n// Collects values from an async generator until a predicate fails.\n// Uses for-await-of with a break condition.\nasync function takeWhile(asyncGen, predicate) {\n const results = [];\n","golden_completion":" for await (const value of asyncGen) {\n if (!predicate(value)) break;\n results.push(value);\n }\n return results;\n","suffix":"}\n\nasync function test12() {\n const assert = require(\u0027assert\u0027);\n\n const r1 = await takeWhile(\n asyncStream([1, 2, 3, 4, 5], 1),\n x =\u003e x \u003c 4\n );\n assert.deepStrictEqual(r1, [1, 2, 3]);\n\n const r2 = await takeWhile(\n asyncStream([\u0027a\u0027, \u0027b\u0027, \u0027c\u0027], 1),\n x =\u003e x !== \u0027b\u0027\n );\n assert.deepStrictEqual(r2, [\u0027a\u0027]);\n\n console.log(\u0027Task 12 passed\u0027);\n}\n\ntest12();\n","assertions":"async function hidden12() {\n const assert = require(\u0027assert\u0027);\n\n // Predicate always true =\u003e take all\n const r3 = await takeWhile(\n asyncStream([10, 20, 30], 1),\n () =\u003e true\n );\n assert.deepStrictEqual(r3, [10, 20, 30]);\n\n // Predicate fails immediately =\u003e empty\n const r4 = await takeWhile(\n asyncStream([1, 2, 3], 1),\n () =\u003e false\n );\n assert.deepStrictEqual(r4, []);\n\n // Empty stream\n const r5 = await takeWhile(\n asyncStream([], 1),\n () =\u003e true\n );\n assert.deepStrictEqual(r5, []);\n\n console.log(\u0027Task 12 hidden passed\u0027);\n}\nhidden12();\n","category":"syntax_completion"} {"id":"13","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// Extracts configuration from a nested config object using\n// destructuring with computed property keys, defaults, and renaming.\nfunction extractConfig(config, primaryKey, fallbackKey) {\n const {\n [primaryKey]: {\n enabled: isEnabled = false,\n retries: maxRetries = 3,\n timeout: timeoutMs = 1000,\n ...extraPrimary\n } = {},\n","golden_completion":" [fallbackKey]: {\n enabled: fallbackEnabled = false,\n retries: fallbackRetries = 1,\n ...extraFallback\n } = {},\n version = \u00271.0\u0027,\n } = config;\n","suffix":"\n return {\n primary: { isEnabled, maxRetries, timeoutMs, extra: extraPrimary },\n fallback: { fallbackEnabled, fallbackRetries, extra: extraFallback },\n version,\n };\n}\n\nconst assert = require(\u0027assert\u0027);\nconst cfg = {\n database: { enabled: true, retries: 5, timeout: 3000, pool: 10 },\n cache: { enabled: true, retries: 2, ttl: 60 },\n version: \u00272.3\u0027,\n};\n\nconst result = extractConfig(cfg, \u0027database\u0027, \u0027cache\u0027);\nassert.deepStrictEqual(result.primary, { isEnabled: true, maxRetries: 5, timeoutMs: 3000, extra: { pool: 10 } });\nassert.deepStrictEqual(result.fallback, { fallbackEnabled: true, fallbackRetries: 2, extra: { ttl: 60 } });\nassert.strictEqual(result.version, \u00272.3\u0027);\nconsole.log(\u0027Task 13 passed\u0027);\n","assertions":"// Missing keys =\u003e defaults apply\nconst result2 = extractConfig({}, \u0027db\u0027, \u0027cache\u0027);\nassert.deepStrictEqual(result2.primary, { isEnabled: false, maxRetries: 3, timeoutMs: 1000, extra: {} });\nassert.deepStrictEqual(result2.fallback, { fallbackEnabled: false, fallbackRetries: 1, extra: {} });\nassert.strictEqual(result2.version, \u00271.0\u0027);\n\n// Only primary present\nconst result3 = extractConfig({ api: { enabled: true } }, \u0027api\u0027, \u0027backup\u0027);\nassert.strictEqual(result3.primary.isEnabled, true);\nassert.strictEqual(result3.fallback.fallbackEnabled, false);\n\nconsole.log(\u0027Task 13 hidden passed\u0027);\n","category":"syntax_completion"} {"id":"14","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// Sub-generator that yields numbers and handles thrown errors\n// by yielding an error marker and continuing.\nfunction* resilientRange(start, end) {\n for (let i = start; i \u003c end; i++) {\n try {\n yield i;\n } catch (e) {\n yield `error:${e.message}`;\n }\n }\n}\n\n// Delegating generator that chains multiple resilientRange sub-generators.\n// Uses yield* to delegate to each sub-range in sequence.\nfunction* chainedRanges(...ranges) {\n","golden_completion":" for (const [start, end] of ranges) {\n yield* resilientRange(start, end);\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\n// Basic delegation\nconst g1 = chainedRanges([0, 3], [10, 13]);\nassert.deepStrictEqual(\n [...g1],\n [0, 1, 2, 10, 11, 12]\n);\n\n// Error forwarding through yield*\nconst g2 = chainedRanges([0, 3]);\nassert.deepStrictEqual(g2.next(), { value: 0, done: false });\nassert.deepStrictEqual(g2.throw(new Error(\u0027oops\u0027)), { value: \u0027error:oops\u0027, done: false });\nassert.deepStrictEqual(g2.next(), { value: 1, done: false });\nassert.deepStrictEqual(g2.next(), { value: 2, done: false });\nassert.deepStrictEqual(g2.next(), { value: undefined, done: true });\n\nconsole.log(\u0027Task 14 passed\u0027);\n","assertions":"// Empty ranges\nconst g3 = chainedRanges([5, 5], [0, 2]);\nassert.deepStrictEqual([...g3], [0, 1]);\n\n// Single range\nconst g4 = chainedRanges([0, 1]);\nassert.deepStrictEqual([...g4], [0]);\n\n// Multiple errors\nconst g5 = chainedRanges([0, 4]);\ng5.next(); // 0\ng5.throw(new Error(\u0027e1\u0027)); // error:e1\ng5.next(); // 1\ng5.next(); // 2\nconst r = g5.throw(new Error(\u0027e2\u0027)); // error:e2\nassert.deepStrictEqual(r, { value: \u0027error:e2\u0027, done: false });\n\nconsole.log(\u0027Task 14 hidden passed\u0027);\n","category":"syntax_completion"} {"id":"15","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// Processes a list of tokens and categorizes them using a reducer.\n// The switch uses intentional fallthrough for grouping:\n// \u0027add\u0027, \u0027subtract\u0027 =\u003e \u0027arithmetic\u0027\n// \u0027and\u0027, \u0027or\u0027, \u0027not\u0027 =\u003e \u0027logical\u0027\n// \u0027if\u0027, \u0027else\u0027, \u0027while\u0027, \u0027for\u0027 =\u003e \u0027control\u0027\n// anything else =\u003e \u0027unknown\u0027\n// Returns an object mapping categories to arrays of tokens.\nfunction categorizeTokens(tokens) {\n return tokens.reduce((acc, token) =\u003e {\n let category;\n switch (token) {\n case \u0027add\u0027:\n case \u0027subtract\u0027:\n category = \u0027arithmetic\u0027;\n break;\n case \u0027and\u0027:\n case \u0027or\u0027:\n case \u0027not\u0027:\n category = \u0027logical\u0027;\n break;\n","golden_completion":" case \u0027if\u0027:\n case \u0027else\u0027:\n case \u0027while\u0027:\n case \u0027for\u0027:\n category = \u0027control\u0027;\n break;\n default:\n category = \u0027unknown\u0027;\n }\n","suffix":" if (!acc[category]) acc[category] = [];\n acc[category].push(token);\n return acc;\n }, {});\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst r1 = categorizeTokens([\u0027add\u0027, \u0027if\u0027, \u0027or\u0027, \u0027subtract\u0027, \u0027foo\u0027, \u0027while\u0027]);\nassert.deepStrictEqual(r1.arithmetic, [\u0027add\u0027, \u0027subtract\u0027]);\nassert.deepStrictEqual(r1.logical, [\u0027or\u0027]);\nassert.deepStrictEqual(r1.control, [\u0027if\u0027, \u0027while\u0027]);\nassert.deepStrictEqual(r1.unknown, [\u0027foo\u0027]);\n\nconsole.log(\u0027Task 15 passed\u0027);\n","assertions":"// Empty input\nconst r2 = categorizeTokens([]);\nassert.deepStrictEqual(r2, {});\n\n// All unknown\nconst r3 = categorizeTokens([\u0027xyz\u0027, \u0027abc\u0027]);\nassert.deepStrictEqual(r3, { unknown: [\u0027xyz\u0027, \u0027abc\u0027] });\n\n// All logical\nconst r4 = categorizeTokens([\u0027and\u0027, \u0027or\u0027, \u0027not\u0027, \u0027and\u0027]);\nassert.deepStrictEqual(r4, { logical: [\u0027and\u0027, \u0027or\u0027, \u0027not\u0027, \u0027and\u0027] });\n\n// Mixed with repeats\nconst r5 = categorizeTokens([\u0027for\u0027, \u0027for\u0027, \u0027add\u0027, \u0027not\u0027, \u0027else\u0027]);\nassert.deepStrictEqual(r5.control, [\u0027for\u0027, \u0027for\u0027, \u0027else\u0027]);\nassert.deepStrictEqual(r5.arithmetic, [\u0027add\u0027]);\nassert.deepStrictEqual(r5.logical, [\u0027not\u0027]);\n\nconsole.log(\u0027Task 15 hidden passed\u0027);\n","category":"syntax_completion"} {"id":"16","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// Tagged template that sanitizes interpolated values:\n// - strings: HTML-escape \u003c \u003e \u0026 \" \u0027\n// - numbers: format with commas (e.g., 1000 =\u003e \"1,000\")\n// - arrays: join with \", \" after recursively sanitizing each element\n// - other: convert to string and HTML-escape\nfunction safe(strings, ...values) {\n function escape(s) {\n return String(s).replace(/\u0026/g, \u0027\u0026amp;\u0027)\n .replace(/\u003c/g, \u0027\u0026lt;\u0027).replace(/\u003e/g, \u0027\u0026gt;\u0027)\n .replace(/\"/g, \u0027\u0026quot;\u0027).replace(/\u0027/g, \u0027\u0026#39;\u0027);\n }\n function formatNum(n) {\n return n.toLocaleString(\u0027en-US\u0027);\n }\n","golden_completion":" function process(val) {\n if (Array.isArray(val)) return val.map(process).join(\u0027, \u0027);\n if (typeof val === \u0027number\u0027) return formatNum(val);\n return escape(val);\n }\n return strings.reduce((out, str, i) =\u003e\n out + str + (i \u003c values.length ? process(values[i]) : \u0027\u0027), \u0027\u0027);\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst name = \u0027\u003cscript\u003e\u0027;\nconst count = 1500;\nconst items = [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027];\n\nconst result = safe`User ${name} has ${count} items: ${items}`;\nassert.strictEqual(result, \u0027User \u0026lt;script\u0026gt; has 1,500 items: a, b, c\u0027);\n\nconst r2 = safe`Price: ${2500.5} for \"${\u0027\"quoted\"\u0027}\"`;\nassert.strictEqual(r2, \u0027Price: 2,500.5 for \"\u0026quot;quoted\u0026quot;\"\u0027);\n\nconsole.log(\u0027Task 16 passed\u0027);\n","assertions":"// Nested arrays\nconst r3 = safe`${[1, \u0027\u003cb\u003e\u0027, [2, 3]]}`;\nassert.strictEqual(r3, \u00271, \u0026lt;b\u0026gt;, 2, 3\u0027);\n\n// No interpolations\nconst r4 = safe`plain text`;\nassert.strictEqual(r4, \u0027plain text\u0027);\n\n// Single value\nconst r5 = safe`${42}`;\nassert.strictEqual(r5, \u002742\u0027);\n\n// Ampersand in string\nconst r6 = safe`${\u0027a\u0026b\u0027}`;\nassert.strictEqual(r6, \u0027a\u0026amp;b\u0027);\n\nconsole.log(\u0027Task 16 hidden passed\u0027);\n","category":"syntax_completion"} {"id":"17","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// A ring buffer with a fixed capacity that overwrites oldest entries.\n// Uses private fields and implements Symbol.iterator to yield\n// elements in insertion order (oldest to newest).\nclass RingBuffer {\n #buffer;\n #head;\n #count;\n #capacity;\n\n static #defaultCapacity;\n static {\n RingBuffer.#defaultCapacity = 8;\n }\n\n constructor(capacity = RingBuffer.#defaultCapacity) {\n this.#capacity = capacity;\n this.#buffer = new Array(capacity);\n this.#head = 0;\n this.#count = 0;\n }\n\n push(value) {\n const idx = (this.#head + this.#count) % this.#capacity;\n if (this.#count === this.#capacity) {\n this.#head = (this.#head + 1) % this.#capacity;\n } else {\n this.#count++;\n }\n this.#buffer[idx] = value;\n }\n\n get size() { return this.#count; }\n\n","golden_completion":" [Symbol.iterator]() {\n let i = 0, count = this.#count, head = this.#head, cap = this.#capacity, buf = this.#buffer;\n return { next() {\n if (i \u003c count) return { value: buf[(head + i++) % cap], done: false };\n return { done: true, value: undefined };\n }};\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst rb = new RingBuffer(3);\nrb.push(\u0027a\u0027);\nrb.push(\u0027b\u0027);\nrb.push(\u0027c\u0027);\nassert.deepStrictEqual([...rb], [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.strictEqual(rb.size, 3);\n\n// Overwrite oldest\nrb.push(\u0027d\u0027);\nassert.deepStrictEqual([...rb], [\u0027b\u0027, \u0027c\u0027, \u0027d\u0027]);\n\nrb.push(\u0027e\u0027);\nassert.deepStrictEqual([...rb], [\u0027c\u0027, \u0027d\u0027, \u0027e\u0027]);\n\nconsole.log(\u0027Task 17 passed\u0027);\n","assertions":"// Default capacity\nconst rb2 = new RingBuffer();\nfor (let i = 0; i \u003c 10; i++) rb2.push(i);\nassert.strictEqual(rb2.size, 8);\nassert.deepStrictEqual([...rb2], [2, 3, 4, 5, 6, 7, 8, 9]);\n\n// Capacity 1\nconst rb3 = new RingBuffer(1);\nrb3.push(\u0027x\u0027);\nrb3.push(\u0027y\u0027);\nassert.deepStrictEqual([...rb3], [\u0027y\u0027]);\n\n// Empty\nconst rb4 = new RingBuffer(5);\nassert.deepStrictEqual([...rb4], []);\n\n// Re-iteration\nconst rb5 = new RingBuffer(2);\nrb5.push(1); rb5.push(2);\nassert.deepStrictEqual([...rb5], [1, 2]);\nassert.deepStrictEqual([...rb5], [1, 2]);\n\nconsole.log(\u0027Task 17 hidden passed\u0027);\n","category":"syntax_completion"} {"id":"18","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// Fetches data from multiple sources in parallel.\n// If any source fails, retries that source sequentially with exponential backoff.\n// Returns an object mapping source names to their results.\n// maxRetries applies per-source.\nasync function fetchWithRetry(sources, maxRetries = 2) {\n // sources: [{ name: string, fetch: () =\u003e Promise\u003cany\u003e }]\n const results = {};\n\n // Phase 1: Try all in parallel\n const settled = await Promise.allSettled(\n sources.map(s =\u003e s.fetch().then(v =\u003e ({ name: s.name, value: v })))\n );\n\n const failed = [];\n for (const [i, result] of settled.entries()) {\n if (result.status === \u0027fulfilled\u0027) {\n results[result.value.name] = result.value.value;\n } else {\n failed.push({ source: sources[i], reason: result.reason });\n }\n }\n\n // Phase 2: Retry failed sources sequentially with exponential backoff\n","golden_completion":" for (const { source, reason } of failed) {\n let lastErr = reason, ok = false;\n for (let a = 0; a \u003c maxRetries \u0026\u0026 !ok; a++) {\n try { await new Promise(r =\u003e setTimeout(r, 2 ** a)); results[source.name] = await source.fetch(); ok = true; }\n catch (e) { lastErr = e; }\n }\n if (!ok) results[source.name] = { error: lastErr.message };\n }\n return results;\n","suffix":"}\n\nasync function test18() {\n const assert = require(\u0027assert\u0027);\n let callCount = 0;\n\n const sources = [\n { name: \u0027fast\u0027, fetch: () =\u003e Promise.resolve(\u0027ok\u0027) },\n {\n name: \u0027flaky\u0027, fetch: () =\u003e {\n callCount++;\n if (callCount \u003c= 2) return Promise.reject(new Error(\u0027fail\u0027));\n return Promise.resolve(\u0027recovered\u0027);\n }\n },\n ];\n\n const r = await fetchWithRetry(sources, 3);\n assert.strictEqual(r.fast, \u0027ok\u0027);\n assert.strictEqual(r.flaky, \u0027recovered\u0027);\n\n // Permanently failing source\n callCount = 0;\n const sources2 = [\n { name: \u0027broken\u0027, fetch: () =\u003e Promise.reject(new Error(\u0027permanent\u0027)) },\n ];\n const r2 = await fetchWithRetry(sources2, 2);\n assert.deepStrictEqual(r2.broken, { error: \u0027permanent\u0027 });\n\n console.log(\u0027Task 18 passed\u0027);\n}\n\ntest18();\n","assertions":"async function hidden18() {\n const assert = require(\u0027assert\u0027);\n\n // All succeed in parallel =\u003e no retries\n const r3 = await fetchWithRetry([\n { name: \u0027a\u0027, fetch: () =\u003e Promise.resolve(1) },\n { name: \u0027b\u0027, fetch: () =\u003e Promise.resolve(2) },\n ]);\n assert.deepStrictEqual(r3, { a: 1, b: 2 });\n\n // Empty sources\n const r4 = await fetchWithRetry([]);\n assert.deepStrictEqual(r4, {});\n\n // maxRetries=0 =\u003e no retry, immediate error\n const r5 = await fetchWithRetry([\n { name: \u0027x\u0027, fetch: () =\u003e Promise.reject(new Error(\u0027nope\u0027)) },\n ], 0);\n assert.deepStrictEqual(r5.x, { error: \u0027nope\u0027 });\n\n console.log(\u0027Task 18 hidden passed\u0027);\n}\nhidden18();\n","category":"syntax_completion"} {"id":"19","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// Parses a log string containing lines in the format:\n// [LEVEL] YYYY-MM-DD message text\n// Returns an array of objects { level, date, message } for lines\n// matching a given level filter. Uses named capture groups.\nfunction parseLogs(logText, levelFilter = null) {\n const pattern = /^\\[(?\u003clevel\u003e\\w+)\\]\\s+(?\u003cdate\u003e\\d{4}-\\d{2}-\\d{2})\\s+(?\u003cmessage\u003e.+)$/;\n\n return logText\n .split(\u0027\\n\u0027)\n .map(line =\u003e {\n","golden_completion":" const m = pattern.exec(line);\n if (!m) return null;\n return {\n level: m.groups.level,\n date: m.groups.date,\n message: m.groups.message.trim(),\n };\n })\n .filter(entry =\u003e entry !== null)\n .filter(entry =\u003e levelFilter === null || entry.level === levelFilter);\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst logs = `[INFO] 2024-01-15 Server started\n[ERROR] 2024-01-15 Connection failed\n[WARN] 2024-01-16 High memory usage\ngarbage line\n[INFO] 2024-01-16 Request processed`;\n\nconst all = parseLogs(logs);\nassert.strictEqual(all.length, 4);\nassert.deepStrictEqual(all[0], { level: \u0027INFO\u0027, date: \u00272024-01-15\u0027, message: \u0027Server started\u0027 });\nassert.deepStrictEqual(all[1], { level: \u0027ERROR\u0027, date: \u00272024-01-15\u0027, message: \u0027Connection failed\u0027 });\n\nconst errors = parseLogs(logs, \u0027ERROR\u0027);\nassert.strictEqual(errors.length, 1);\nassert.strictEqual(errors[0].level, \u0027ERROR\u0027);\n\nconsole.log(\u0027Task 19 passed\u0027);\n","assertions":"// Empty string\nconst r2 = parseLogs(\u0027\u0027);\nassert.deepStrictEqual(r2, []);\n\n// No matches\nconst r3 = parseLogs(\u0027no valid lines here\u0027);\nassert.deepStrictEqual(r3, []);\n\n// Filter returns empty when no matching level\nconst r4 = parseLogs(\u0027[DEBUG] 2024-01-01 test\u0027, \u0027ERROR\u0027);\nassert.deepStrictEqual(r4, []);\n\n// All same level\nconst r5 = parseLogs(\u0027[WARN] 2024-03-01 a\\n[WARN] 2024-03-02 b\u0027, \u0027WARN\u0027);\nassert.strictEqual(r5.length, 2);\n\n// Message with extra spaces\nconst r6 = parseLogs(\u0027[INFO] 2024-01-01 spaced msg \u0027);\nassert.strictEqual(r6[0].message, \u0027spaced msg\u0027);\n\nconsole.log(\u0027Task 19 hidden passed\u0027);\n","category":"syntax_completion"} {"id":"20","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// A cache that holds weak references to values and tracks cleanup.\n// When a cached value is garbage collected, its key is removed from\n// the metadata map and the cleanup callback is invoked.\nclass WeakCache {\n #refs = new Map(); // key =\u003e WeakRef\n #meta = new Map(); // key =\u003e metadata\n #cleanedKeys = [];\n\n #registry = new FinalizationRegistry(key =\u003e {\n this.#refs.delete(key);\n this.#meta.delete(key);\n this.#cleanedKeys.push(key);\n });\n\n set(key, value, metadata = null) {\n const ref = new WeakRef(value);\n this.#refs.set(key, ref);\n if (metadata !== null) this.#meta.set(key, metadata);\n this.#registry.register(value, key);\n }\n\n","golden_completion":" get(key) {\n const ref = this.#refs.get(key);\n return ref ? ref.deref() : undefined;\n }\n has(key) {\n const ref = this.#refs.get(key);\n return ref !== undefined \u0026\u0026 ref.deref() !== undefined;\n }\n getMeta(key) { return this.#meta.get(key); }\n get cleanedKeys() { return [...this.#cleanedKeys]; }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst cache = new WeakCache();\nlet obj1 = { data: \u0027hello\u0027 };\nlet obj2 = { data: \u0027world\u0027 };\n\ncache.set(\u0027k1\u0027, obj1, { created: Date.now() });\ncache.set(\u0027k2\u0027, obj2);\n\n// Objects are still alive\nassert.strictEqual(cache.get(\u0027k1\u0027).data, \u0027hello\u0027);\nassert.strictEqual(cache.get(\u0027k2\u0027).data, \u0027world\u0027);\nassert.strictEqual(cache.has(\u0027k1\u0027), true);\nassert.strictEqual(cache.has(\u0027k2\u0027), true);\nassert.ok(cache.getMeta(\u0027k1\u0027).created \u003e 0);\nassert.strictEqual(cache.getMeta(\u0027k2\u0027), undefined);\n\n// Non-existent key\nassert.strictEqual(cache.get(\u0027k3\u0027), undefined);\nassert.strictEqual(cache.has(\u0027k3\u0027), false);\n\nconsole.log(\u0027Task 20 passed\u0027);\n","assertions":"// Multiple sets with same key overwrites\nconst cache2 = new WeakCache();\nlet a = { x: 1 };\nlet b = { x: 2 };\ncache2.set(\u0027dup\u0027, a, { v: 1 });\ncache2.set(\u0027dup\u0027, b, { v: 2 });\nassert.strictEqual(cache2.get(\u0027dup\u0027).x, 2);\nassert.strictEqual(cache2.getMeta(\u0027dup\u0027).v, 2);\n\n// cleanedKeys is initially empty (no GC happened)\nassert.deepStrictEqual(cache2.cleanedKeys, []);\n\n// has() returns false for missing key\nassert.strictEqual(cache2.has(\u0027nonexistent\u0027), false);\n\nconsole.log(\u0027Task 20 hidden passed\u0027);\n","category":"syntax_completion"} {"id":"21","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function findFirstAboveThreshold(groups, threshold) {\n // groups is an array of {name, scores: number[]}\n // Returns {group: name, score: value} for the FIRST score above threshold\n // found in a depth-first scan. Returns null if none found.\n let result = null;\n outerLoop:\n for (const {name, scores} of groups) {\n","golden_completion":" for (const score of scores) {\n if (score \u003e threshold) {\n result = {group: name, score};\n break outerLoop;\n }\n }\n","suffix":" }\n return result;\n}\n\nconst groups = [\n {name: \u0027A\u0027, scores: [10, 20, 30]},\n {name: \u0027B\u0027, scores: [5, 50, 15]},\n {name: \u0027C\u0027, scores: [100]}\n];\nconst r = findFirstAboveThreshold(groups, 25);\nconsole.log(r);\n","assertions":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(r, {group: \u0027A\u0027, score: 30});\nconst r2 = findFirstAboveThreshold(groups, 99);\nassert.deepStrictEqual(r2, {group: \u0027C\u0027, score: 100});\nconst r3 = findFirstAboveThreshold(groups, 999);\nassert.strictEqual(r3, null);\nconst r4 = findFirstAboveThreshold([], 0);\nassert.strictEqual(r4, null);\nconst r5 = findFirstAboveThreshold([{name: \u0027X\u0027, scores: []}], 0);\nassert.strictEqual(r5, null);\nconsole.log(\u0027Task 21 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"22","testsource":"devbench-syntax-completion","language":"javascript","prefix":"// groupAndTransform: groups items by category, then returns\n// an array of {category, total, items: string[]} for groups with total \u003e minTotal\nfunction groupAndTransform(items, minTotal) {\n // items: [{category: string, value: number, label: string}]\n const grouped = items.reduce((acc, item) =\u003e {\n if (!acc[item.category]) acc[item.category] = [];\n acc[item.category].push(item);\n return acc;\n }, {});\n\n return Object.entries(grouped)\n","golden_completion":" .map(([category, catItems]) =\u003e ({\n category,\n total: catItems.reduce((s, i) =\u003e s + i.value, 0),\n items: catItems.map(i =\u003e i.label)\n }))\n .filter(g =\u003e g.total \u003e minTotal)\n .sort((a, b) =\u003e b.total - a.total);\n","suffix":"}\n\nconst data = [\n {category: \u0027fruit\u0027, value: 3, label: \u0027apple\u0027},\n {category: \u0027fruit\u0027, value: 5, label: \u0027banana\u0027},\n {category: \u0027veggie\u0027, value: 2, label: \u0027carrot\u0027},\n {category: \u0027veggie\u0027, value: 1, label: \u0027pea\u0027},\n {category: \u0027grain\u0027, value: 10, label: \u0027rice\u0027}\n];\nconst result = groupAndTransform(data, 5);\nconsole.log(JSON.stringify(result));\n","assertions":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(result.length, 2);\nassert.strictEqual(result[0].category, \u0027grain\u0027);\nassert.strictEqual(result[0].total, 10);\nassert.deepStrictEqual(result[0].items, [\u0027rice\u0027]);\nassert.strictEqual(result[1].category, \u0027fruit\u0027);\nassert.strictEqual(result[1].total, 8);\nassert.deepStrictEqual(result[1].items, [\u0027apple\u0027, \u0027banana\u0027]);\nconst r2 = groupAndTransform(data, 100);\nassert.strictEqual(r2.length, 0);\nconst r3 = groupAndTransform([], 0);\nassert.strictEqual(r3.length, 0);\nconsole.log(\u0027Task 22 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"23","testsource":"devbench-syntax-completion","language":"javascript","prefix":"class AsyncCache {\n constructor(loader, ttlMs) {\n this._cache = new Map();\n this._loader = loader;\n this._ttlMs = ttlMs;\n this._ready = (async () =\u003e {\n","golden_completion":" try {\n const initial = await this._loader(\u0027__init__\u0027);\n if (initial !== undefined) {\n this._cache.set(\u0027__init__\u0027, {value: initial, expires: Date.now() + this._ttlMs});\n }\n return true;\n } catch (err) {\n return false;\n }\n })();\n","suffix":" }\n\n async get(key) {\n await this._ready;\n const entry = this._cache.get(key);\n if (entry \u0026\u0026 entry.expires \u003e Date.now()) return entry.value;\n const val = await this._loader(key);\n this._cache.set(key, {value: val, expires: Date.now() + this._ttlMs});\n return val;\n }\n}\n\n// Test\nasync function testCache() {\n const loader = async (key) =\u003e key === \u0027__init__\u0027 ? \u0027initialized\u0027 : `loaded:${key}`;\n const cache = new AsyncCache(loader, 60000);\n const ready = await cache._ready;\n const v1 = await cache.get(\u0027__init__\u0027);\n const v2 = await cache.get(\u0027hello\u0027);\n return {ready, v1, v2};\n}\ntestCache().then(r =\u003e console.log(JSON.stringify(r)));\n","assertions":"const assert = require(\u0027assert\u0027);\ntestCache().then(r =\u003e {\n assert.strictEqual(r.ready, true);\n assert.strictEqual(r.v1, \u0027initialized\u0027);\n assert.strictEqual(r.v2, \u0027loaded:hello\u0027);\n\n // Test with failing loader\n const failLoader = async (key) =\u003e { throw new Error(\u0027fail\u0027); };\n const cache2 = new AsyncCache(failLoader, 1000);\n cache2._ready.then(ready2 =\u003e {\n assert.strictEqual(ready2, false);\n console.log(\u0027Task 23 assertions passed\u0027);\n });\n});\n","category":"syntax_completion"} {"id":"24","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function* paginatedFetch(pages, pageSize) {\n // Yields items from pages one at a time.\n // After each page, yields a separator {type: \u0027page-break\u0027, page: N}.\n // If a page has fewer items than pageSize, yields {type: \u0027end\u0027, total: count}\n // and returns the total count.\n let count = 0;\n for (let i = 0; i \u003c pages.length; i++) {\n const page = pages[i];\n","golden_completion":" for (const item of page) {\n yield {type: \u0027item\u0027, value: item};\n count++;\n }\n if (page.length \u003c pageSize) {\n yield {type: \u0027end\u0027, total: count};\n return count;\n }\n if (i \u003c pages.length - 1) {\n yield {type: \u0027page-break\u0027, page: i + 1};\n }\n","suffix":" }\n yield {type: \u0027end\u0027, total: count};\n return count;\n}\n\nconst pages = [[1, 2, 3], [4, 5, 6], [7, 8]];\nconst gen = paginatedFetch(pages, 3);\nconst results = [];\nwhile (true) {\n const next = gen.next();\n if (next.done) break;\n results.push(next.value);\n}\nconsole.log(JSON.stringify(results));\n","assertions":"const assert = require(\u0027assert\u0027);\n// Page 1: 3 items + page-break\nassert.deepStrictEqual(results[0], {type: \u0027item\u0027, value: 1});\nassert.deepStrictEqual(results[1], {type: \u0027item\u0027, value: 2});\nassert.deepStrictEqual(results[2], {type: \u0027item\u0027, value: 3});\nassert.deepStrictEqual(results[3], {type: \u0027page-break\u0027, page: 1});\n// Page 2: 3 items + page-break\nassert.deepStrictEqual(results[4], {type: \u0027item\u0027, value: 4});\nassert.deepStrictEqual(results[5], {type: \u0027item\u0027, value: 5});\nassert.deepStrictEqual(results[6], {type: \u0027item\u0027, value: 6});\nassert.deepStrictEqual(results[7], {type: \u0027page-break\u0027, page: 2});\n// Page 3: 2 items (\u003c pageSize 3), so ends early\nassert.deepStrictEqual(results[8], {type: \u0027item\u0027, value: 7});\nassert.deepStrictEqual(results[9], {type: \u0027item\u0027, value: 8});\nassert.deepStrictEqual(results[10], {type: \u0027end\u0027, total: 8});\nassert.strictEqual(results.length, 11);\n\n// Test with single full page\nconst gen2 = paginatedFetch([[1, 2]], 2);\nconst r2 = [];\nwhile (true) { const n = gen2.next(); if (n.done) break; r2.push(n.value); }\nassert.deepStrictEqual(r2, [{type:\u0027item\u0027,value:1},{type:\u0027item\u0027,value:2},{type:\u0027end\u0027,total:2}]);\nconsole.log(\u0027Task 24 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"25","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function extractUserMetrics(response) {\n // Extracts metrics from a deeply nested API response.\n // Uses optional chaining and nullish coalescing throughout.\n // Returns {name, email, score, badges, lastLogin}\n const user = response?.data?.users?.[0];\n","golden_completion":" return {\n name: user?.profile?.displayName ?? user?.username ?? \u0027anonymous\u0027,\n email: user?.contacts?.find(c =\u003e c.type === \u0027email\u0027)?.value ?? null,\n score: user?.metrics?.scores?.reduce((a, b) =\u003e a + b, 0) ?? 0,\n badges: user?.achievements?.map(a =\u003e a?.badge?.name)?.filter(Boolean) ?? [],\n lastLogin: user?.sessions?.[(user?.sessions?.length ?? 1) - 1]?.timestamp ?? null\n };\n","suffix":"}\n\n// Test with full data\nconst fullResponse = {\n data: {\n users: [{\n username: \u0027jdoe\u0027,\n profile: {displayName: \u0027John Doe\u0027},\n contacts: [{type: \u0027phone\u0027, value: \u0027555\u0027}, {type: \u0027email\u0027, value: \u0027j@d.com\u0027}],\n metrics: {scores: [10, 20, 30]},\n achievements: [{badge: {name: \u0027gold\u0027}}, {badge: {name: \u0027silver\u0027}}, {badge: null}],\n sessions: [{timestamp: \u0027t1\u0027}, {timestamp: \u0027t2\u0027}, {timestamp: \u0027t3\u0027}]\n }]\n }\n};\nconst r1 = extractUserMetrics(fullResponse);\nconsole.log(JSON.stringify(r1));\n","assertions":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(r1.name, \u0027John Doe\u0027);\nassert.strictEqual(r1.email, \u0027j@d.com\u0027);\nassert.strictEqual(r1.score, 60);\nassert.deepStrictEqual(r1.badges, [\u0027gold\u0027, \u0027silver\u0027]);\nassert.strictEqual(r1.lastLogin, \u0027t3\u0027);\n\n// Test with partial data\nconst partial = {data: {users: [{username: \u0027bob\u0027, contacts: [], metrics: {}}]}};\nconst r2 = extractUserMetrics(partial);\nassert.strictEqual(r2.name, \u0027bob\u0027);\nassert.strictEqual(r2.email, null);\nassert.strictEqual(r2.score, 0);\nassert.deepStrictEqual(r2.badges, []);\nassert.strictEqual(r2.lastLogin, null);\n\n// Test with null response\nconst r3 = extractUserMetrics(null);\nassert.strictEqual(r3.name, \u0027anonymous\u0027);\nassert.strictEqual(r3.score, 0);\n\n// Test with empty users\nconst r4 = extractUserMetrics({data: {users: []}});\nassert.strictEqual(r4.name, \u0027anonymous\u0027);\nconsole.log(\u0027Task 25 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"26","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function timedOperation(workFn, timeoutMs) {\n // Returns a promise that:\n // 1. Runs workFn (which returns a promise)\n // 2. Races it against a timeout\n // 3. On success: resolves with {status: \u0027ok\u0027, result, elapsed}\n // 4. On timeout: resolves with {status: \u0027timeout\u0027, elapsed: timeoutMs}\n // 5. On error: resolves with {status: \u0027error\u0027, message: err.message, elapsed}\n // Note: always resolves (never rejects), elapsed is approximate ms taken.\n const start = Date.now();\n return new Promise((resolve) =\u003e {\n","golden_completion":" let settled = false;\n const timer = setTimeout(() =\u003e {\n if (!settled) { settled = true; resolve({status: \u0027timeout\u0027, elapsed: timeoutMs}); }\n }, timeoutMs);\n workFn().then((result) =\u003e {\n if (!settled) { settled = true; clearTimeout(timer); resolve({status: \u0027ok\u0027, result, elapsed: Date.now() - start}); }\n }).catch((err) =\u003e {\n if (!settled) { settled = true; clearTimeout(timer); resolve({status: \u0027error\u0027, message: err.message, elapsed: Date.now() - start}); }\n });\n","suffix":" });\n}\n\n// Tests\nasync function runTests() {\n // Test 1: Successful fast operation\n const r1 = await timedOperation(() =\u003e Promise.resolve(42), 1000);\n console.log(\u0027r1:\u0027, JSON.stringify(r1));\n\n // Test 2: Error operation\n const r2 = await timedOperation(() =\u003e Promise.reject(new Error(\u0027boom\u0027)), 1000);\n console.log(\u0027r2:\u0027, JSON.stringify(r2));\n\n // Test 3: Timeout\n const r3 = await timedOperation(\n () =\u003e new Promise(res =\u003e setTimeout(() =\u003e res(\u0027late\u0027), 200)),\n 50\n );\n console.log(\u0027r3:\u0027, JSON.stringify(r3));\n\n return {r1, r2, r3};\n}\nrunTests().then(r =\u003e console.log(\u0027done\u0027));\n","assertions":"const assert = require(\u0027assert\u0027);\nrunTests().then(({r1, r2, r3}) =\u003e {\n assert.strictEqual(r1.status, \u0027ok\u0027);\n assert.strictEqual(r1.result, 42);\n assert(r1.elapsed \u003c 100, \u0027fast op should be quick\u0027);\n\n assert.strictEqual(r2.status, \u0027error\u0027);\n assert.strictEqual(r2.message, \u0027boom\u0027);\n assert(r2.elapsed \u003c 100, \u0027error op should be quick\u0027);\n\n assert.strictEqual(r3.status, \u0027timeout\u0027);\n assert.strictEqual(r3.elapsed, 50);\n\n // Test 4: operation completes just before timeout\n timedOperation(() =\u003e new Promise(res =\u003e setTimeout(() =\u003e res(\u0027ok\u0027), 10)), 500)\n .then(r4 =\u003e {\n assert.strictEqual(r4.status, \u0027ok\u0027);\n assert.strictEqual(r4.result, \u0027ok\u0027);\n console.log(\u0027Task 26 assertions passed\u0027);\n });\n});\n","category":"syntax_completion"} {"id":"27","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const TYPE_KEY = Symbol(\u0027type\u0027);\nconst makeEntity = (kind, initialData) =\u003e {\n const _log = [];\n const prefix = `[${kind}]`;\n return {\n [TYPE_KEY]: kind,\n [`get${kind.charAt(0).toUpperCase() + kind.slice(1)}Info`]() {\n return `${prefix} entries: ${this._count}`;\n },\n ...initialData,\n","golden_completion":" _count: 0,\n get summary() {\n return `${prefix} ${this._count} items, log: ${_log.length}`;\n },\n set data(val) {\n _log.push({action: \u0027set\u0027, value: val, at: _log.length});\n this._count++;\n },\n getLog() {\n return [..._log];\n }\n };\n","suffix":"};\n\nconst entity = makeEntity(\u0027widget\u0027, {color: \u0027blue\u0027});\nentity.data = \u0027first\u0027;\nentity.data = \u0027second\u0027;\nentity.data = \u0027third\u0027;\nconsole.log(entity.summary);\nconsole.log(entity.getWidgetInfo());\nconsole.log(entity[TYPE_KEY]);\nconsole.log(entity.color);\nconsole.log(entity.getLog().length);\n","assertions":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(entity[TYPE_KEY], \u0027widget\u0027);\nassert.strictEqual(entity.color, \u0027blue\u0027);\nassert.strictEqual(entity._count, 3);\nassert.strictEqual(entity.summary, \u0027[widget] 3 items, log: 3\u0027);\nassert.strictEqual(entity.getWidgetInfo(), \u0027[widget] entries: 3\u0027);\nconst log = entity.getLog();\nassert.strictEqual(log.length, 3);\nassert.deepStrictEqual(log[0], {action: \u0027set\u0027, value: \u0027first\u0027, at: 0});\nassert.deepStrictEqual(log[1], {action: \u0027set\u0027, value: \u0027second\u0027, at: 1});\nassert.deepStrictEqual(log[2], {action: \u0027set\u0027, value: \u0027third\u0027, at: 2});\n\n// Make another entity — should have independent log\nconst e2 = makeEntity(\u0027gadget\u0027, {});\ne2.data = \u0027x\u0027;\nassert.strictEqual(e2._count, 1);\nassert.strictEqual(e2.getLog().length, 1);\nassert.strictEqual(e2.getGadgetInfo(), \u0027[gadget] entries: 1\u0027);\nconsole.log(\u0027Task 27 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"28","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function buildConfig(\n {\n server: {\n host = \u0027localhost\u0027,\n port = 3000,\n ssl: {\n enabled: sslEnabled = false,\n cert: sslCert = null,\n ...sslRest\n } = {}\n } = {},\n logging: {\n level: logLevel = \u0027info\u0027,\n outputs: [primaryOutput = \u0027console\u0027, ...extraOutputs] = [\u0027console\u0027]\n } = {},\n ...otherOptions\n } = {}\n) {\n","golden_completion":" return {\n serverConfig: {host, port, ssl: {enabled: sslEnabled, cert: sslCert, ...sslRest}},\n loggingConfig: {level: logLevel, outputs: [primaryOutput, ...extraOutputs]},\n extra: otherOptions\n };\n","suffix":"}\n\n// Test with full config\nconst full = buildConfig({\n server: {host: \u00270.0.0.0\u0027, port: 8080, ssl: {enabled: true, cert: \u0027/path/cert.pem\u0027, key: \u0027/path/key.pem\u0027}},\n logging: {level: \u0027debug\u0027, outputs: [\u0027file\u0027, \u0027syslog\u0027, \u0027console\u0027]},\n version: \u00272.0\u0027,\n debug: true\n});\nconsole.log(JSON.stringify(full, null, 2));\n","assertions":"const assert = require(\u0027assert\u0027);\n// Full config assertions\nassert.strictEqual(full.serverConfig.host, \u00270.0.0.0\u0027);\nassert.strictEqual(full.serverConfig.port, 8080);\nassert.strictEqual(full.serverConfig.ssl.enabled, true);\nassert.strictEqual(full.serverConfig.ssl.cert, \u0027/path/cert.pem\u0027);\nassert.strictEqual(full.serverConfig.ssl.key, \u0027/path/key.pem\u0027);\nassert.strictEqual(full.loggingConfig.level, \u0027debug\u0027);\nassert.deepStrictEqual(full.loggingConfig.outputs, [\u0027file\u0027, \u0027syslog\u0027, \u0027console\u0027]);\nassert.strictEqual(full.extra.version, \u00272.0\u0027);\nassert.strictEqual(full.extra.debug, true);\n\n// Default config assertions\nconst def = buildConfig();\nassert.strictEqual(def.serverConfig.host, \u0027localhost\u0027);\nassert.strictEqual(def.serverConfig.port, 3000);\nassert.strictEqual(def.serverConfig.ssl.enabled, false);\nassert.strictEqual(def.serverConfig.ssl.cert, null);\nassert.strictEqual(def.loggingConfig.level, \u0027info\u0027);\nassert.deepStrictEqual(def.loggingConfig.outputs, [\u0027console\u0027]);\nassert.deepStrictEqual(def.extra, {});\n\n// Partial config\nconst partial = buildConfig({server: {port: 9090}});\nassert.strictEqual(partial.serverConfig.host, \u0027localhost\u0027);\nassert.strictEqual(partial.serverConfig.port, 9090);\nassert.strictEqual(partial.serverConfig.ssl.enabled, false);\nconsole.log(\u0027Task 28 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"29","testsource":"devbench-syntax-completion","language":"javascript","prefix":"class AsyncPipeline {\n constructor(stages) {\n // stages: array of async functions, each takes input and returns output\n this._stages = stages;\n this._results = [];\n }\n\n async run(input) {\n this._results = [];\n let current = input;\n for (const stage of this._stages) {\n current = await stage(current);\n this._results.push(current);\n }\n return current;\n }\n\n [Symbol.asyncIterator]() {\n let index = 0;\n const results = this._results;\n const stages = this._stages;\n","golden_completion":" return {\n async next() {\n if (index \u003c results.length) {\n return {value: {stage: index, result: results[index++]}, done: false};\n }\n return {value: undefined, done: true};\n },\n [Symbol.asyncIterator]() {\n return this;\n }\n };\n }\n","suffix":"}\n\nasync function testPipeline() {\n const pipeline = new AsyncPipeline([\n async (x) =\u003e x * 2,\n async (x) =\u003e x + 10,\n async (x) =\u003e x.toString()\n ]);\n\n const final = await pipeline.run(5);\n console.log(\u0027Final:\u0027, final);\n\n const collected = [];\n for await (const entry of pipeline) {\n collected.push(entry);\n }\n return {final, collected};\n}\ntestPipeline().then(r =\u003e console.log(JSON.stringify(r)));\n","assertions":"const assert = require(\u0027assert\u0027);\ntestPipeline().then(({final, collected}) =\u003e {\n assert.strictEqual(final, \u002720\u0027);\n assert.strictEqual(collected.length, 3);\n assert.deepStrictEqual(collected[0], {stage: 0, result: 10});\n assert.deepStrictEqual(collected[1], {stage: 1, result: 20});\n assert.deepStrictEqual(collected[2], {stage: 2, result: \u002720\u0027});\n\n // Test empty pipeline\n const empty = new AsyncPipeline([]);\n empty.run(42).then(async (r) =\u003e {\n assert.strictEqual(r, 42);\n const items = [];\n for await (const e of empty) items.push(e);\n assert.strictEqual(items.length, 0);\n\n // Test single stage\n const single = new AsyncPipeline([async x =\u003e x + 1]);\n const sr = await single.run(0);\n assert.strictEqual(sr, 1);\n const si = [];\n for await (const e of single) si.push(e);\n assert.strictEqual(si.length, 1);\n assert.deepStrictEqual(si[0], {stage: 0, result: 1});\n console.log(\u0027Task 29 assertions passed\u0027);\n });\n});\n","category":"syntax_completion"} {"id":"30","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function createValidator(schema) {\n // schema: {fieldName: {type: \u0027string\u0027|\u0027number\u0027|\u0027boolean\u0027|\u0027array\u0027, required, min?, max?}}\n // Returns a Proxy that validates on set and throws on invalid assignments.\n const data = {};\n return new Proxy(data, {\n set(target, prop, value) {\n const rule = schema[prop];\n if (!rule) { target[prop] = value; return true; }\n switch (rule.type) {\n case \u0027string\u0027: {\n if (typeof value !== \u0027string\u0027) throw new TypeError(`${prop} must be string`);\n if (rule.min !== undefined \u0026\u0026 value.length \u003c rule.min) throw new RangeError(`${prop} too short`);\n if (rule.max !== undefined \u0026\u0026 value.length \u003e rule.max) throw new RangeError(`${prop} too long`);\n break;\n }\n case \u0027number\u0027: {\n if (typeof value !== \u0027number\u0027 || isNaN(value)) throw new TypeError(`${prop} must be number`);\n if (rule.min !== undefined \u0026\u0026 value \u003c rule.min) throw new RangeError(`${prop} too small`);\n if (rule.max !== undefined \u0026\u0026 value \u003e rule.max) throw new RangeError(`${prop} too large`);\n break;\n }\n","golden_completion":" case \u0027boolean\u0027:\n if (typeof value !== \u0027boolean\u0027) throw new TypeError(`${prop} must be boolean`);\n break;\n case \u0027array\u0027: {\n if (!Array.isArray(value)) throw new TypeError(`${prop} must be array`);\n if (rule.min !== undefined \u0026\u0026 value.length \u003c rule.min) throw new RangeError(`${prop} too few`);\n if (rule.max !== undefined \u0026\u0026 value.length \u003e rule.max) throw new RangeError(`${prop} too many`);\n break;\n }\n default: throw new Error(`Unknown type: ${rule.type}`);\n }\n target[prop] = value; return true;\n","suffix":" },\n get(target, prop) {\n if (prop === \u0027__data\u0027) return {...target};\n if (prop === \u0027__schema\u0027) return schema;\n return target[prop];\n }\n });\n}\n\nconst user = createValidator({\n name: {type: \u0027string\u0027, required: true, min: 1, max: 50},\n age: {type: \u0027number\u0027, required: true, min: 0, max: 150},\n active: {type: \u0027boolean\u0027, required: true},\n tags: {type: \u0027array\u0027, required: false, min: 0, max: 5}\n});\n\nuser.name = \u0027Alice\u0027;\nuser.age = 30;\nuser.active = true;\nuser.tags = [\u0027admin\u0027, \u0027user\u0027];\nuser.extraField = \u0027allowed\u0027;\nconsole.log(JSON.stringify(user.__data));\n","assertions":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(user.name, \u0027Alice\u0027);\nassert.strictEqual(user.age, 30);\nassert.strictEqual(user.active, true);\nassert.deepStrictEqual(user.tags, [\u0027admin\u0027, \u0027user\u0027]);\nassert.strictEqual(user.extraField, \u0027allowed\u0027);\n\n// Type errors\nassert.throws(() =\u003e { user.name = 123; }, TypeError);\nassert.throws(() =\u003e { user.age = \u0027old\u0027; }, TypeError);\nassert.throws(() =\u003e { user.age = NaN; }, TypeError);\nassert.throws(() =\u003e { user.active = 1; }, TypeError);\nassert.throws(() =\u003e { user.tags = \u0027not-array\u0027; }, TypeError);\n\n// Range errors\nassert.throws(() =\u003e { user.name = \u0027\u0027; }, RangeError);\nassert.throws(() =\u003e { user.name = \u0027x\u0027.repeat(51); }, RangeError);\nassert.throws(() =\u003e { user.age = -1; }, RangeError);\nassert.throws(() =\u003e { user.age = 200; }, RangeError);\nassert.throws(() =\u003e { user.tags = [1,2,3,4,5,6]; }, RangeError);\n\n// Valid reassignments should still work\nuser.name = \u0027Bob\u0027;\nassert.strictEqual(user.name, \u0027Bob\u0027);\nuser.age = 0;\nassert.strictEqual(user.age, 0);\nconsole.log(\u0027Task 30 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"31","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nconst data = [\n { dept: \u0027eng\u0027, name: \u0027Alice\u0027, salary: 100 },\n { dept: \u0027eng\u0027, name: \u0027Bob\u0027, salary: 120 },\n { dept: \u0027sales\u0027, name: \u0027Carol\u0027, salary: 90 },\n { dept: \u0027sales\u0027, name: \u0027Dave\u0027, salary: 95 },\n { dept: \u0027eng\u0027, name: \u0027Eve\u0027, salary: 110 },\n];\n\nconst tagged = data.map((row, i) =\u003e ({ ...row, idx: i, DEPT: row.dept.toUpperCase() }));\nassert.strictEqual(tagged[0].idx, 0);\nassert.strictEqual(tagged[0].DEPT, \u0027ENG\u0027);\n\n// Group by dept using reduce returning object literal, then summarize\n","golden_completion":"const grouped = tagged.reduce((acc, row) =\u003e ({\n ...acc,\n [row.dept]: [...(acc[row.dept] || []), row],\n}), {});\nconst summary = Object.entries(grouped).map(([dept, rows]) =\u003e ({\n dept, count: rows.length,\n total: rows.reduce((s, r) =\u003e s + r.salary, 0),\n avg: Math.round(rows.reduce((s, r) =\u003e s + r.salary, 0) / rows.length),\n}));\n","suffix":"\nassert.strictEqual(Object.keys(grouped).length, 2);\nassert.strictEqual(grouped[\u0027eng\u0027].length, 3);\nassert.strictEqual(grouped[\u0027sales\u0027].length, 2);\nconst eng = summary.find(s =\u003e s.dept === \u0027eng\u0027);\nconst sales = summary.find(s =\u003e s.dept === \u0027sales\u0027);\nassert.strictEqual(eng.count, 3);\nassert.strictEqual(eng.total, 330);\nassert.strictEqual(eng.avg, 110);\nassert.strictEqual(sales.count, 2);\nassert.strictEqual(sales.total, 185);\nassert.strictEqual(sales.avg, 93);\n","assertions":"\nassert.strictEqual(tagged.length, 5);\nassert.strictEqual(Array.isArray(summary), true);\nassert.strictEqual(summary.length, 2);\nfor (const s of summary) {\n assert.ok(\u0027dept\u0027 in s \u0026\u0026 \u0027count\u0027 in s \u0026\u0026 \u0027total\u0027 in s \u0026\u0026 \u0027avg\u0027 in s);\n}\n","category":"syntax_completion"} {"id":"32","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nasync function* range(start, end) {\n for (let i = start; i \u003c end; i++) yield i;\n}\n\nasync function collectAll(gen) {\n const items = [];\n for await (const item of gen) items.push(item);\n return items;\n}\n\nconst pipeLog = [];\n\n// filteredPipeline: async generator that filters+transforms with lifecycle logging\n","golden_completion":"async function* filteredPipeline(source, filterFn, transformFn) {\n pipeLog.push(\u0027open\u0027);\n try {\n for await (const item of source) {\n if (filterFn(item)) { pipeLog.push(\u0027yield:\u0027 + item); yield transformFn(item); }\n }\n } catch (err) { pipeLog.push(\u0027error:\u0027 + err.message); throw err; }\n finally { pipeLog.push(\u0027close\u0027); }\n}\n","suffix":"\n(async () =\u003e {\n pipeLog.length = 0;\n const results = await collectAll(filteredPipeline(range(0, 6), x =\u003e x % 2 === 0, x =\u003e x * 2));\n assert.deepStrictEqual(results, [0, 4, 8]);\n assert.strictEqual(pipeLog[0], \u0027open\u0027);\n assert.strictEqual(pipeLog[pipeLog.length - 1], \u0027close\u0027);\n assert.ok(pipeLog.includes(\u0027yield:0\u0027));\n assert.ok(pipeLog.includes(\u0027yield:4\u0027));\n\n // Early break triggers finally\n pipeLog.length = 0;\n const pipe2 = filteredPipeline(range(0, 100), x =\u003e true, x =\u003e x);\n const first3 = [];\n for await (const item of pipe2) { first3.push(item); if (first3.length \u003e= 3) break; }\n assert.deepStrictEqual(first3, [0, 1, 2]);\n assert.strictEqual(pipeLog[pipeLog.length - 1], \u0027close\u0027);\n\n // Empty source\n pipeLog.length = 0;\n assert.deepStrictEqual(await collectAll(filteredPipeline(range(0, 0), x =\u003e true, x =\u003e x)), []);\n assert.strictEqual(pipeLog.length, 2);\n})();\n","assertions":"\nassert.strictEqual(filteredPipeline.constructor.name, \u0027AsyncGeneratorFunction\u0027);\nassert.ok(Array.isArray(pipeLog));\n","category":"syntax_completion"} {"id":"33","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass Shape {\n #name;\n constructor(name) { this.#name = name; this._transforms = []; }\n get name() { return this.#name; }\n transform(t) { this._transforms.push(t); return this; }\n describe() { return `${this.#name}[${this._transforms.join(\u0027,\u0027)}]`; }\n}\n\nclass Polygon extends Shape {\n #sides;\n constructor(name, sides) { super(name); this.#sides = sides; }\n get sides() { return this.#sides; }\n perimeter() { return this.#sides.reduce((s, l) =\u003e s + l, 0); }\n describe() { return `${super.describe()}(sides=${this.#sides.length})`; }\n}\n\nassert.strictEqual(new Polygon(\u0027tri\u0027, [3,4,5]).describe(), \u0027tri[](sides=3)\u0027);\n\n","golden_completion":"class RegularPolygon extends Polygon {\n #count; #len;\n constructor(name, count, len) {\n super(name, Array(count).fill(len));\n this.#count = count; this.#len = len;\n }\n get count() { return this.#count; }\n get sideLength() { return this.#len; }\n area() { return (this.#count * this.#len ** 2) / (4 * Math.tan(Math.PI / this.#count)); }\n describe() { return `${super.describe()}(regular,len=${this.#len})`; }\n}\n","suffix":"\nconst hex = new RegularPolygon(\u0027hexagon\u0027, 6, 10);\nassert.ok(hex instanceof RegularPolygon);\nassert.ok(hex instanceof Polygon);\nassert.ok(hex instanceof Shape);\nassert.strictEqual(hex.sides.length, 6);\nassert.strictEqual(hex.perimeter(), 60);\nassert.strictEqual(hex.count, 6);\nassert.strictEqual(hex.sideLength, 10);\nassert.strictEqual(hex.describe(), \u0027hexagon[](sides=6)(regular,len=10)\u0027);\nassert.strictEqual(hex.transform(\u0027rotate\u0027).transform(\u0027scale\u0027).describe(),\n \u0027hexagon[rotate,scale](sides=6)(regular,len=10)\u0027);\nconst expectedArea = (6 * 100) / (4 * Math.tan(Math.PI / 6));\nassert.ok(Math.abs(hex.area() - expectedArea) \u003c 0.001);\n","assertions":"\nconst tri = new RegularPolygon(\u0027triangle\u0027, 3, 7);\nassert.strictEqual(tri.perimeter(), 21);\nassert.strictEqual(tri.count, 3);\nassert.strictEqual(tri.sideLength, 7);\nassert.ok(tri instanceof Polygon);\nconst triArea = (3 * 49) / (4 * Math.tan(Math.PI / 3));\nassert.ok(Math.abs(tri.area() - triArea) \u003c 0.001);\nassert.strictEqual(tri.describe(), \u0027triangle[](sides=3)(regular,len=7)\u0027);\n","category":"syntax_completion"} {"id":"34","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nfunction upper(strings, ...values) {\n let result = \u0027\u0027;\n strings.forEach((str, i) =\u003e { result += str; if (i \u003c values.length) result += String(values[i]).toUpperCase(); });\n return result;\n}\nassert.strictEqual(upper`hello ${\u0027world\u0027}!`, \u0027hello WORLD!\u0027);\n\n// sql tag: parameterized query with $N placeholders, arrays expand for IN clauses\n","golden_completion":"function sql(strings, ...params) {\n let text = \u0027\u0027; const values = [];\n strings.forEach((str, i) =\u003e {\n text += str;\n if (i \u003e= params.length) return;\n if (Array.isArray(params[i])) {\n text += params[i].map((_, j) =\u003e `$${values.length + j + 1}`).join(\u0027, \u0027);\n values.push(...params[i]);\n } else { values.push(params[i]); text += `$${values.length}`; }\n });\n return { text: text.trim(), values };\n}\n","suffix":"\nconst q1 = sql`SELECT * FROM users WHERE id = ${42}`;\nassert.strictEqual(q1.text, \u0027SELECT * FROM users WHERE id = $1\u0027);\nassert.deepStrictEqual(q1.values, [42]);\n\nconst q2 = sql`INSERT INTO t (a, b) VALUES (${1}, ${\u0027hello\u0027})`;\nassert.strictEqual(q2.text, \u0027INSERT INTO t (a, b) VALUES ($1, $2)\u0027);\n\nconst q3 = sql`SELECT * FROM t WHERE id IN (${[10, 20, 30]})`;\nassert.strictEqual(q3.text, \u0027SELECT * FROM t WHERE id IN ($1, $2, $3)\u0027);\nassert.deepStrictEqual(q3.values, [10, 20, 30]);\n\nconst q4 = sql`SELECT * FROM t WHERE status = ${\u0027active\u0027} AND id IN (${[1, 2]})`;\nassert.strictEqual(q4.text, \u0027SELECT * FROM t WHERE status = $1 AND id IN ($2, $3)\u0027);\nassert.deepStrictEqual(q4.values, [\u0027active\u0027, 1, 2]);\n","assertions":"\nconst q5 = sql`SELECT 1`;\nassert.strictEqual(q5.text, \u0027SELECT 1\u0027);\nassert.deepStrictEqual(q5.values, []);\n\nconst q7 = sql`UPDATE t SET x = ${99} WHERE a IN (${[1,2]}) AND b IN (${[3,4]})`;\nassert.strictEqual(q7.text, \u0027UPDATE t SET x = $1 WHERE a IN ($2, $3) AND b IN ($4, $5)\u0027);\nassert.deepStrictEqual(q7.values, [99, 1, 2, 3, 4]);\n","category":"syntax_completion"} {"id":"35","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// createStore: returns a revocable proxy that tracks get/set/delete in a history array\n// Access _history and _revoke properties without logging them\n\nfunction createStore(initial = {}) {\n const history = [];\n const data = { ...initial };\n const handler = {\n get(target, prop) {\n if (prop === \u0027_history\u0027) return history;\n if (prop === \u0027_revoke\u0027) return revoke;\n history.push({ op: \u0027get\u0027, prop, value: target[prop] });\n return target[prop];\n },\n set(target, prop, value) {\n const old = target[prop]; target[prop] = value;\n history.push({ op: \u0027set\u0027, prop, old, value }); return true;\n },\n","golden_completion":" deleteProperty(target, prop) {\n if (prop in target) {\n history.push({ op: \u0027delete\u0027, prop, old: target[prop] });\n delete target[prop];\n }\n return true;\n },\n };\n const { proxy, revoke } = Proxy.revocable(data, handler);\n return proxy;\n}\n","suffix":"\nconst store = createStore({ x: 1, y: 2 });\nstore.x;\nassert.deepStrictEqual(store._history[0], { op: \u0027get\u0027, prop: \u0027x\u0027, value: 1 });\n\nstore.z = 3;\nconst setEntry = store._history.find(e =\u003e e.op === \u0027set\u0027 \u0026\u0026 e.prop === \u0027z\u0027);\nassert.ok(setEntry);\nassert.strictEqual(setEntry.old, undefined);\n\nstore.x = 10;\nconst overwrite = store._history.filter(e =\u003e e.op === \u0027set\u0027 \u0026\u0026 e.prop === \u0027x\u0027);\nassert.strictEqual(overwrite[0].old, 1);\n\ndelete store.y;\nconst delEntry = store._history.find(e =\u003e e.op === \u0027delete\u0027);\nassert.strictEqual(delEntry.prop, \u0027y\u0027);\nassert.strictEqual(delEntry.old, 2);\n\nconst revoker = store._revoke;\nrevoker();\nassert.throws(() =\u003e { store.x; }, TypeError);\n","assertions":"\nconst s2 = createStore({ a: \u0027hello\u0027 });\nassert.strictEqual(s2.a, \u0027hello\u0027);\ns2.b = 42;\nassert.strictEqual(s2.b, 42);\ndelete s2.nonexistent;\nconst dels = s2._history.filter(e =\u003e e.op === \u0027delete\u0027 \u0026\u0026 e.prop === \u0027nonexistent\u0027);\nassert.strictEqual(dels.length, 0);\nconst rk = s2._revoke;\nrk();\nassert.throws(() =\u003e { s2.a; }, TypeError);\n","category":"syntax_completion"} {"id":"36","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nconst registry = new Map();\nfunction registerPlugin(name, factory) { registry.set(name, { factory, instance: null, loaded: false }); }\n\nregisterPlugin(\u0027math\u0027, () =\u003e ({ add: (a, b) =\u003e a + b, mul: (a, b) =\u003e a * b }));\nregisterPlugin(\u0027string\u0027, () =\u003e ({ reverse: s =\u003e s.split(\u0027\u0027).reverse().join(\u0027\u0027), upper: s =\u003e s.toUpperCase() }));\n\nasync function loadPlugin(name) {\n const entry = registry.get(name);\n if (!entry) throw new Error(\u0027Plugin \"\u0027 + name + \u0027\" not found\u0027);\n if (!entry.loaded) { entry.instance = await entry.factory(); entry.loaded = true; }\n return entry.instance;\n}\n\n// pipeline: chains plugin calls, threading result through each step\n","golden_completion":"async function pipeline(pluginCalls) {\n let result = pluginCalls[0].input;\n for (const { plugin, method, args = [] } of pluginCalls) {\n const mod = await loadPlugin(plugin);\n if (typeof mod[method] !== \u0027function\u0027) {\n throw new Error(\u0027Method \"\u0027 + method + \u0027\" not found in \"\u0027 + plugin + \u0027\"\u0027);\n }\n result = await mod[method](result, ...args);\n }\n return result;\n}\n","suffix":"\n(async () =\u003e {\n const math = await loadPlugin(\u0027math\u0027);\n assert.strictEqual(math.add(2, 3), 5);\n const math2 = await loadPlugin(\u0027math\u0027);\n assert.strictEqual(math, math2);\n\n const r1 = await pipeline([\n { plugin: \u0027math\u0027, method: \u0027add\u0027, args: [10], input: 5 },\n { plugin: \u0027math\u0027, method: \u0027mul\u0027, args: [3] },\n ]);\n assert.strictEqual(r1, 45);\n\n const r2 = await pipeline([\n { plugin: \u0027string\u0027, method: \u0027upper\u0027, input: \u0027hello\u0027 },\n { plugin: \u0027string\u0027, method: \u0027reverse\u0027 },\n ]);\n assert.strictEqual(r2, \u0027OLLEH\u0027);\n\n try { await pipeline([{ plugin: \u0027math\u0027, method: \u0027nope\u0027, input: 1 }]); assert.fail(); }\n catch (e) { assert.ok(e.message.includes(\u0027not found\u0027)); }\n})();\n","assertions":"\nassert.strictEqual(typeof pipeline, \u0027function\u0027);\nassert.strictEqual(registry.size, 2);\nassert.ok(registry.has(\u0027math\u0027));\nassert.ok(registry.has(\u0027string\u0027));\n","category":"syntax_completion"} {"id":"37","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nclass LazyRange {\n constructor(start, end, step = 1) { this.start = start; this.end = end; this.step = step; }\n [Symbol.iterator]() {\n let current = this.start; const end = this.end, step = this.step;\n return { next() { if (current \u003c end) { const v = current; current += step; return { value: v, done: false }; } return { value: undefined, done: true }; } };\n }\n}\nassert.deepStrictEqual([...new LazyRange(0, 5)], [0, 1, 2, 3, 4]);\n\n// _wrapLazy: helper to create a chainable lazy iterable from a generator\nfunction _wrapLazy(genFn) {\n return { *[Symbol.iterator]() { yield* genFn(); },\n map(f) { const self = this; return _wrapLazy(function*() { let i = 0; for (const x of self) yield f(x, i++); }); },\n filter(f) { const self = this; return _wrapLazy(function*() { for (const x of self) if (f(x)) yield x; }); },\n toArray() { return [...this]; } };\n}\n\n// LazyChain: chains multiple iterables, with lazy map/filter via _wrapLazy\n","golden_completion":"class LazyChain {\n constructor(...iterables) { this._its = iterables; }\n *[Symbol.iterator]() { for (const it of this._its) yield* it; }\n map(fn) { const s = this; return _wrapLazy(function*() { let i = 0; for (const x of s) yield fn(x, i++); }); }\n filter(fn) { const s = this; return _wrapLazy(function*() { for (const x of s) if (fn(x)) yield x; }); }\n toArray() { return [...this]; }\n}\n","suffix":"\nconst chain1 = new LazyChain(new LazyRange(0, 3), new LazyRange(10, 13), [20, 21]);\nassert.deepStrictEqual(chain1.toArray(), [0, 1, 2, 10, 11, 12, 20, 21]);\nassert.deepStrictEqual([...chain1], [0, 1, 2, 10, 11, 12, 20, 21]);\n\nconst mapped = chain1.map(x =\u003e x * 2);\nassert.deepStrictEqual(mapped.toArray(), [0, 2, 4, 20, 22, 24, 40, 42]);\n\nconst filtered = chain1.filter(x =\u003e x \u003e= 10);\nassert.deepStrictEqual(filtered.toArray(), [10, 11, 12, 20, 21]);\n\nconst result = chain1.filter(x =\u003e x % 2 === 0).map(x =\u003e x + 1);\nassert.deepStrictEqual(result.toArray(), [1, 3, 11, 13, 21]);\n","assertions":"\nconst empty = new LazyChain();\nassert.deepStrictEqual(empty.toArray(), []);\nconst single = new LazyChain([1, 2, 3]);\nassert.deepStrictEqual(single.toArray(), [1, 2, 3]);\nconst withIdx = new LazyChain([10, 20, 30]).map((x, i) =\u003e x + i);\nassert.deepStrictEqual(withIdx.toArray(), [10, 21, 32]);\nconst chained = new LazyChain(new LazyRange(0, 10)).filter(x =\u003e x \u003e 5).map(x =\u003e x * 10);\nassert.deepStrictEqual(chained.toArray(), [60, 70, 80, 90]);\n","category":"syntax_completion"} {"id":"38","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\nconst defaultConfig = {\n server: { host: \u0027localhost\u0027, port: 3000, ssl: false },\n db: { host: \u0027localhost\u0027, port: 5432, name: \u0027app\u0027, pool: { min: 2, max: 10 } },\n logging: { level: \u0027info\u0027, format: \u0027json\u0027, outputs: [\u0027stdout\u0027] },\n};\n\n// parseConfig: deep destructuring with defaults, renaming, rest, array patterns\n// Must destructure: server (host-\u003esH, port-\u003esP, ssl, ...sR), db (host-\u003edH, port-\u003edP, name-\u003edN, pool-\u003e{pMi,pMa}, ...dR),\n// logging (level, format-\u003elF, outputs-\u003e[primary,...rest]), ...extra\n// Returns: { server, db, logging: {level,format,primaryOutput,otherOutputs}, extraKeys }\nfunction parseConfig(raw = {}) {\n","golden_completion":" const { server: { host: sH = \u0027localhost\u0027, port: sP = 3000, ssl = false, ...sR } = {},\n db: { host: dH = \u0027localhost\u0027, port: dP = 5432, name: dN = \u0027app\u0027,\n pool: { min: pMi = 2, max: pMa = 10 } = {}, ...dR } = {},\n logging: { level = \u0027info\u0027, format: lF = \u0027json\u0027,\n outputs: [primary = \u0027stdout\u0027, ...rest] = [\u0027stdout\u0027] } = {},\n ...extra } = raw;\n return { server: { host: sH, port: sP, ssl, ...sR },\n db: { host: dH, port: dP, name: dN, pool: { min: pMi, max: pMa }, ...dR },\n logging: { level, format: lF, primaryOutput: primary, otherOutputs: rest },\n extraKeys: Object.keys(extra) };\n}\n","suffix":"\nconst c1 = parseConfig();\nassert.strictEqual(c1.server.host, \u0027localhost\u0027);\nassert.strictEqual(c1.server.port, 3000);\nassert.strictEqual(c1.db.pool.min, 2);\nassert.strictEqual(c1.db.pool.max, 10);\nassert.strictEqual(c1.logging.primaryOutput, \u0027stdout\u0027);\nassert.deepStrictEqual(c1.logging.otherOutputs, []);\nassert.deepStrictEqual(c1.extraKeys, []);\n\nconst c2 = parseConfig({\n server: { port: 8080, ssl: true },\n db: { name: \u0027prod\u0027, pool: { max: 50 } },\n logging: { outputs: [\u0027file\u0027, \u0027syslog\u0027] },\n debug: true,\n});\nassert.strictEqual(c2.server.host, \u0027localhost\u0027);\nassert.strictEqual(c2.server.port, 8080);\nassert.strictEqual(c2.db.pool.max, 50);\nassert.strictEqual(c2.logging.primaryOutput, \u0027file\u0027);\nassert.deepStrictEqual(c2.logging.otherOutputs, [\u0027syslog\u0027]);\nassert.deepStrictEqual(c2.extraKeys, [\u0027debug\u0027]);\n","assertions":"\nconst c3 = parseConfig({ server: {}, db: {}, logging: {} });\nassert.strictEqual(c3.server.host, \u0027localhost\u0027);\nassert.strictEqual(c3.db.port, 5432);\nassert.strictEqual(c3.logging.level, \u0027info\u0027);\nconst c4 = parseConfig({ server: { host: \u0027prod\u0027, timeout: 5000 } });\nassert.strictEqual(c4.server.host, \u0027prod\u0027);\nassert.strictEqual(c4.server.timeout, 5000);\nconst c5 = parseConfig({ db: { replica: true } });\nassert.strictEqual(c5.db.replica, true);\n","category":"syntax_completion"} {"id":"39","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// createTransaction: runs steps sequentially, rolls back completed steps on failure\n// Each step has {name, fn, undoFn?, input?}. Logs name:start, name:ok, name:fail:msg, undo:name\nfunction createTransaction() {\n const log = [];\n function run(steps) {\n let chain = Promise.resolve(steps[0].input);\n const done = [];\n for (const { name, fn, undoFn } of steps) {\n chain = chain\n .then(input =\u003e { log.push(name + \u0027:start\u0027); return fn(input); })\n .then(r =\u003e { log.push(name + \u0027:ok\u0027); if (undoFn) done.unshift({ name, undoFn }); return r; })\n","golden_completion":" .catch(err =\u003e {\n if (!log.some(e =\u003e e === name + \u0027:ok\u0027 || e.startsWith(name + \u0027:fail\u0027))) log.push(name + \u0027:fail:\u0027 + err.message);\n let rb = Promise.resolve();\n for (const d of done) rb = rb.then(() =\u003e d.undoFn()).then(() =\u003e log.push(\u0027undo:\u0027 + d.name));\n return rb.then(() =\u003e { throw err; });\n });\n }\n return chain.then(r =\u003e ({ success: true, result: r, log: [...log] }))\n .catch(e =\u003e ({ success: false, error: e.message, log: [...log] }));\n }\n return { run, log };\n}\n","suffix":"\n(async () =\u003e {\n const t1 = createTransaction();\n const r1 = await t1.run([\n { name: \u0027A\u0027, fn: () =\u003e 1, undoFn: () =\u003e {}, input: null },\n { name: \u0027B\u0027, fn: x =\u003e x + 10, undoFn: () =\u003e {} },\n { name: \u0027C\u0027, fn: x =\u003e x * 2, undoFn: () =\u003e {} },\n ]);\n assert.strictEqual(r1.success, true);\n assert.strictEqual(r1.result, 22);\n assert.ok(r1.log.includes(\u0027A:start\u0027));\n assert.ok(r1.log.includes(\u0027C:ok\u0027));\n\n const t2 = createTransaction();\n const undone = [];\n const r2 = await t2.run([\n { name: \u0027X\u0027, fn: () =\u003e 1, undoFn: () =\u003e undone.push(\u0027X\u0027), input: null },\n { name: \u0027Y\u0027, fn: () =\u003e 2, undoFn: () =\u003e undone.push(\u0027Y\u0027) },\n { name: \u0027Z\u0027, fn: () =\u003e { throw new Error(\u0027boom\u0027); }, undoFn: () =\u003e {} },\n ]);\n assert.strictEqual(r2.success, false);\n assert.strictEqual(r2.error, \u0027boom\u0027);\n assert.deepStrictEqual(undone, [\u0027Y\u0027, \u0027X\u0027]);\n assert.ok(r2.log.includes(\u0027Z:fail:boom\u0027));\n})();\n","assertions":"\n(async () =\u003e {\n const t3 = createTransaction();\n const r3 = await t3.run([{ name: \u0027only\u0027, fn: () =\u003e 42, undoFn: () =\u003e {}, input: null }]);\n assert.strictEqual(r3.success, true);\n assert.strictEqual(r3.result, 42);\n\n const t4 = createTransaction();\n const r4 = await t4.run([{ name: \u0027fail\u0027, fn: () =\u003e { throw new Error(\u0027x\u0027); }, input: null }]);\n assert.strictEqual(r4.success, false);\n assert.strictEqual(r4.error, \u0027x\u0027);\n})();\n","category":"syntax_completion"} {"id":"40","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const assert = require(\u0027assert\u0027);\n\n// LRU cache: WeakRef for objects, shim for primitives\n// has() does NOT update access order\n\nclass WeakCache {\n constructor(maxSize) {\n this._max = maxSize;\n this._cache = new Map();\n this._order = [];\n this._registry = new FinalizationRegistry(key =\u003e {\n this._cache.delete(key);\n this._order = this._order.filter(k =\u003e k !== key);\n });\n }\n set(key, value) {\n if (this._cache.size \u003e= this._max \u0026\u0026 !this._cache.has(key)) {\n const evict = this._order.shift();\n if (evict !== undefined) this._cache.delete(evict);\n }\n if (typeof value === \u0027object\u0027 \u0026\u0026 value !== null) this._registry.register(value, key);\n this._cache.set(key, typeof value === \u0027object\u0027 \u0026\u0026 value !== null\n ? new WeakRef(value) : { deref: () =\u003e value });\n this._order = this._order.filter(k =\u003e k !== key);\n this._order.push(key);\n }\n","golden_completion":" get(key) {\n if (!this._cache.has(key)) return undefined;\n const ref = this._cache.get(key); const val = ref.deref();\n if (val === undefined \u0026\u0026 ref instanceof WeakRef) { this._cache.delete(key); this._order = this._order.filter(k =\u003e k !== key); return undefined; }\n this._order = this._order.filter(k =\u003e k !== key); this._order.push(key);\n return val;\n }\n get size() { return this._cache.size; }\n has(key) { return this._cache.has(key); }\n","suffix":"}\n\nconst cache = new WeakCache(3);\nconst obj1 = { id: 1 }, obj2 = { id: 2 };\ncache.set(\u0027a\u0027, obj1);\ncache.set(\u0027b\u0027, obj2);\ncache.set(\u0027c\u0027, 42);\nassert.strictEqual(cache.size, 3);\nassert.deepStrictEqual(cache.get(\u0027a\u0027), obj1);\nassert.deepStrictEqual(cache.get(\u0027b\u0027), obj2);\nassert.strictEqual(cache.get(\u0027c\u0027), 42);\nassert.strictEqual(cache.has(\u0027a\u0027), true);\nassert.strictEqual(cache.has(\u0027nonexistent\u0027), false);\n\n// get(a), get(b), get(c) -\u003e order [a,b,c]. has() doesn\u0027t change order.\ncache.set(\u0027d\u0027, { id: 4 });\nassert.strictEqual(cache.size, 3);\nassert.strictEqual(cache.has(\u0027a\u0027), false);\nassert.strictEqual(cache.has(\u0027b\u0027), true);\nassert.strictEqual(cache.has(\u0027d\u0027), true);\n","assertions":"\nconst c2 = new WeakCache(2);\nc2.set(\u0027x\u0027, { v: 1 });\nc2.set(\u0027y\u0027, { v: 2 });\nc2.get(\u0027x\u0027);\nc2.set(\u0027z\u0027, { v: 3 });\nassert.strictEqual(c2.has(\u0027y\u0027), false);\nassert.strictEqual(c2.has(\u0027x\u0027), true);\nassert.strictEqual(c2.has(\u0027z\u0027), true);\nconst c3 = new WeakCache(5);\nc3.set(\u0027num\u0027, 42);\nc3.set(\u0027str\u0027, \u0027hello\u0027);\nassert.strictEqual(c3.get(\u0027num\u0027), 42);\nassert.strictEqual(c3.get(\u0027str\u0027), \u0027hello\u0027);\nassert.strictEqual(c3.get(\u0027nope\u0027), undefined);\n","category":"syntax_completion"} {"id":"41","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function createAsyncCounter() {\n let count = 0;\n const log = [];\n\n const increment = async (amount) =\u003e {\n await new Promise(r =\u003e setTimeout(r, 1));\n count += amount;\n log.push(\u0027inc:\u0027 + count);\n return count;\n };\n\n const decrement = async (amount) =\u003e {\n await new Promise(r =\u003e setTimeout(r, 1));\n count -= amount;\n log.push(\u0027dec:\u0027 + count);\n return count;\n };\n\n const batch = async (ops) =\u003e {\n","golden_completion":" const results = [];\n for (const [op, val] of ops) {\n if (op === \u0027inc\u0027) results.push(await increment(val));\n else if (op === \u0027dec\u0027) results.push(await decrement(val));\n }\n return { results, log: [...log] };\n };\n\n return { increment, decrement, batch, getCount: () =\u003e count };\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\nasync function testCounter() {\n const c = createAsyncCounter();\n const r1 = await c.increment(5);\n assert.strictEqual(r1, 5);\n const r2 = await c.decrement(2);\n assert.strictEqual(r2, 3);\n\n const c2 = createAsyncCounter();\n const { results, log } = await c2.batch([[\u0027inc\u0027, 10], [\u0027dec\u0027, 3], [\u0027inc\u0027, 7]]);\n assert.deepStrictEqual(results, [10, 7, 14]);\n assert.deepStrictEqual(log, [\u0027inc:10\u0027, \u0027dec:7\u0027, \u0027inc:14\u0027]);\n assert.strictEqual(c2.getCount(), 14);\n console.log(\u0027Task 41 suffix passed\u0027);\n}\ntestCounter();\n","assertions":"async function testCounterAssertions() {\n const c = createAsyncCounter();\n const { results } = await c.batch([[\u0027inc\u0027, 1], [\u0027inc\u0027, 1], [\u0027inc\u0027, 1]]);\n assert.deepStrictEqual(results, [1, 2, 3]);\n assert.strictEqual(c.getCount(), 3);\n\n const c2 = createAsyncCounter();\n const { results: r2, log: l2 } = await c2.batch([[\u0027dec\u0027, 5]]);\n assert.deepStrictEqual(r2, [-5]);\n assert.deepStrictEqual(l2, [\u0027dec:-5\u0027]);\n\n const c3 = createAsyncCounter();\n const { results: r3 } = await c3.batch([]);\n assert.deepStrictEqual(r3, []);\n assert.strictEqual(c3.getCount(), 0);\n\n console.log(\u0027Task 41 assertions passed\u0027);\n}\ntestCounterAssertions();\n","category":"syntax_completion"} {"id":"42","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function* trafficLight() {\n let state = \u0027red\u0027;\n let ticks = 0;\n while (true) {\n const command = yield { state, ticks };\n ticks++;\n switch (state) {\n case \u0027red\u0027:\n","golden_completion":" if (command === \u0027next\u0027) state = \u0027green\u0027;\n else if (command === \u0027emergency\u0027) state = \u0027flashing\u0027;\n break;\n case \u0027green\u0027:\n if (command === \u0027next\u0027) state = \u0027yellow\u0027;\n else if (command === \u0027emergency\u0027) state = \u0027flashing\u0027;\n break;\n case \u0027yellow\u0027:\n if (command === \u0027next\u0027) state = \u0027red\u0027;\n else if (command === \u0027emergency\u0027) state = \u0027flashing\u0027;\n break;\n case \u0027flashing\u0027:\n if (command === \u0027reset\u0027) state = \u0027red\u0027;\n break;\n }\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\nconst light = trafficLight();\nlet s = light.next();\nassert.deepStrictEqual(s.value, { state: \u0027red\u0027, ticks: 0 });\n\ns = light.next(\u0027next\u0027);\nassert.deepStrictEqual(s.value, { state: \u0027green\u0027, ticks: 1 });\n\ns = light.next(\u0027next\u0027);\nassert.deepStrictEqual(s.value, { state: \u0027yellow\u0027, ticks: 2 });\n\ns = light.next(\u0027next\u0027);\nassert.deepStrictEqual(s.value, { state: \u0027red\u0027, ticks: 3 });\n\n// Emergency from green\nconst l2 = trafficLight();\nl2.next();\nl2.next(\u0027next\u0027); // green\ns = l2.next(\u0027emergency\u0027);\nassert.deepStrictEqual(s.value, { state: \u0027flashing\u0027, ticks: 2 });\n\ns = l2.next(\u0027reset\u0027);\nassert.deepStrictEqual(s.value, { state: \u0027red\u0027, ticks: 3 });\n\nconsole.log(\u0027Task 42 suffix passed\u0027);\n","assertions":"// Emergency from red\nconst l3 = trafficLight();\nl3.next();\nlet s3 = l3.next(\u0027emergency\u0027);\nassert.deepStrictEqual(s3.value, { state: \u0027flashing\u0027, ticks: 1 });\n\n// Staying in flashing until reset\ns3 = l3.next(\u0027next\u0027);\nassert.strictEqual(s3.value.state, \u0027flashing\u0027);\ns3 = l3.next(\u0027next\u0027);\nassert.strictEqual(s3.value.state, \u0027flashing\u0027);\ns3 = l3.next(\u0027reset\u0027);\nassert.strictEqual(s3.value.state, \u0027red\u0027);\n\n// Emergency from yellow\nconst l4 = trafficLight();\nl4.next();\nl4.next(\u0027next\u0027); // green\nl4.next(\u0027next\u0027); // yellow\ns3 = l4.next(\u0027emergency\u0027);\nassert.strictEqual(s3.value.state, \u0027flashing\u0027);\n\n// Ticks increment continuously\nconst l5 = trafficLight();\nl5.next();\nfor (let i = 0; i \u003c 10; i++) l5.next(\u0027next\u0027);\ns3 = l5.next(\u0027next\u0027);\nassert.strictEqual(s3.value.ticks, 11);\n\nconsole.log(\u0027Task 42 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"43","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function mergeConfig(defaults, ...overrides) {\n","golden_completion":" let result = { ...defaults };\n for (const override of overrides) {\n result = {\n ...result,\n ...override,\n metadata: {\n ...(result.metadata || {}),\n ...(override.metadata || {}),\n mergeCount: ((result.metadata || {}).mergeCount || 0) + 1\n }\n };\n }\n return result;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\nconst defaults = { host: \u0027localhost\u0027, port: 8080, metadata: { version: \u00271.0\u0027, mergeCount: 0 } };\nconst dev = { port: 3000, debug: true, metadata: { env: \u0027dev\u0027 } };\nconst local = { host: \u00270.0.0.0\u0027, metadata: { author: \u0027test\u0027 } };\n\nconst config = mergeConfig(defaults, dev, local);\nassert.strictEqual(config.host, \u00270.0.0.0\u0027);\nassert.strictEqual(config.port, 3000);\nassert.strictEqual(config.debug, true);\nassert.strictEqual(config.metadata.version, \u00271.0\u0027);\nassert.strictEqual(config.metadata.env, \u0027dev\u0027);\nassert.strictEqual(config.metadata.author, \u0027test\u0027);\nassert.strictEqual(config.metadata.mergeCount, 2);\nconsole.log(\u0027Task 43 suffix passed\u0027);\n","assertions":"// Single override\nconst c1 = mergeConfig({ a: 1, metadata: { x: 10, mergeCount: 0 } }, { b: 2 });\nassert.strictEqual(c1.a, 1);\nassert.strictEqual(c1.b, 2);\nassert.strictEqual(c1.metadata.x, 10);\nassert.strictEqual(c1.metadata.mergeCount, 1);\n\n// No overrides\nconst c2 = mergeConfig({ a: 1, metadata: { mergeCount: 0 } });\nassert.strictEqual(c2.a, 1);\nassert.strictEqual(c2.metadata.mergeCount, 0);\n\n// No metadata in defaults\nconst c3 = mergeConfig({ a: 1 }, { metadata: { env: \u0027prod\u0027 } });\nassert.strictEqual(c3.metadata.env, \u0027prod\u0027);\nassert.strictEqual(c3.metadata.mergeCount, 1);\n\n// Three overrides\nconst c4 = mergeConfig({ metadata: { mergeCount: 0 } }, { x: 1 }, { y: 2 }, { z: 3 });\nassert.strictEqual(c4.metadata.mergeCount, 3);\nassert.strictEqual(c4.z, 3);\n\nconsole.log(\u0027Task 43 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"44","testsource":"devbench-syntax-completion","language":"javascript","prefix":"class AsyncRange {\n constructor(start, end, delayMs = 0) {\n this.start = start;\n this.end = end;\n this.delayMs = delayMs;\n }\n\n [Symbol.asyncIterator]() {\n let current = this.start;\n const end = this.end;\n const delayMs = this.delayMs;\n return {\n","golden_completion":" async next() {\n if (current \u003e end) {\n return { value: undefined, done: true };\n }\n if (delayMs \u003e 0) {\n await new Promise(r =\u003e setTimeout(r, delayMs));\n }\n return { value: current++, done: false };\n }\n };\n }\n}\n\nasync function collectAsync(iterable) {\n const results = [];\n for await (const item of iterable) {\n results.push(item);\n }\n return results;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\nasync function testAsyncRange() {\n const range = new AsyncRange(1, 5);\n const values = await collectAsync(range);\n assert.deepStrictEqual(values, [1, 2, 3, 4, 5]);\n\n // Empty range\n const empty = new AsyncRange(10, 5);\n const emptyVals = await collectAsync(empty);\n assert.deepStrictEqual(emptyVals, []);\n\n // Single element\n const single = new AsyncRange(3, 3);\n const singleVals = await collectAsync(single);\n assert.deepStrictEqual(singleVals, [3]);\n\n // Manual iteration\n const range2 = new AsyncRange(1, 3);\n const iter = range2[Symbol.asyncIterator]();\n let r = await iter.next();\n assert.deepStrictEqual(r, { value: 1, done: false });\n r = await iter.next();\n assert.deepStrictEqual(r, { value: 2, done: false });\n r = await iter.next();\n assert.deepStrictEqual(r, { value: 3, done: false });\n r = await iter.next();\n assert.deepStrictEqual(r, { value: undefined, done: true });\n\n console.log(\u0027Task 44 suffix passed\u0027);\n}\ntestAsyncRange();\n","assertions":"async function testAsyncRangeAssertions() {\n // Negative range\n const neg = new AsyncRange(-2, 2);\n assert.deepStrictEqual(await collectAsync(neg), [-2, -1, 0, 1, 2]);\n\n // Large range\n const large = new AsyncRange(1, 100);\n const largeVals = await collectAsync(large);\n assert.strictEqual(largeVals.length, 100);\n assert.strictEqual(largeVals[0], 1);\n assert.strictEqual(largeVals[99], 100);\n\n // Reusable: each iteration starts fresh\n const reuse = new AsyncRange(1, 3);\n assert.deepStrictEqual(await collectAsync(reuse), [1, 2, 3]);\n assert.deepStrictEqual(await collectAsync(reuse), [1, 2, 3]);\n\n // With delay (short)\n const delayed = new AsyncRange(1, 3, 1);\n assert.deepStrictEqual(await collectAsync(delayed), [1, 2, 3]);\n\n console.log(\u0027Task 44 assertions passed\u0027);\n}\ntestAsyncRangeAssertions();\n","category":"syntax_completion"} {"id":"45","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function fetchUser(id, callback) {\n setTimeout(() =\u003e {\n if (id \u003c= 0) callback(new Error(\u0027Invalid user ID\u0027));\n else callback(null, { id, name: \u0027User\u0027 + id, roleId: id * 10 });\n }, 1);\n}\n\nfunction fetchRole(roleId, callback) {\n setTimeout(() =\u003e {\n if (roleId \u003c= 0) callback(new Error(\u0027Invalid role ID\u0027));\n else callback(null, { roleId, permissions: [\u0027read\u0027, \u0027write\u0027] });\n }, 1);\n}\n\nfunction fetchPermissionDetails(permissions, callback) {\n setTimeout(() =\u003e {\n const details = permissions.map(p =\u003e ({ name: p, level: p === \u0027write\u0027 ? 2 : 1 }));\n callback(null, details);\n }, 1);\n}\n\nfunction getUserFullProfile(userId, callback) {\n","golden_completion":" fetchUser(userId, (err, user) =\u003e {\n if (err) return callback(err);\n fetchRole(user.roleId, (err, role) =\u003e {\n if (err) return callback(err);\n fetchPermissionDetails(role.permissions, (err, details) =\u003e {\n if (err) return callback(err);\n callback(null, {\n user: user.name,\n role: role.roleId,\n permissions: details\n });\n });\n });\n });\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\ngetUserFullProfile(1, (err, profile) =\u003e {\n assert.strictEqual(err, null);\n assert.strictEqual(profile.user, \u0027User1\u0027);\n assert.strictEqual(profile.role, 10);\n assert.strictEqual(profile.permissions.length, 2);\n assert.strictEqual(profile.permissions[0].name, \u0027read\u0027);\n assert.strictEqual(profile.permissions[0].level, 1);\n assert.strictEqual(profile.permissions[1].name, \u0027write\u0027);\n assert.strictEqual(profile.permissions[1].level, 2);\n console.log(\u0027Task 45 suffix passed\u0027);\n});\n\ngetUserFullProfile(-1, (err, profile) =\u003e {\n assert.ok(err instanceof Error);\n assert.strictEqual(err.message, \u0027Invalid user ID\u0027);\n assert.strictEqual(profile, undefined);\n});\n","assertions":"getUserFullProfile(3, (err, profile) =\u003e {\n assert.strictEqual(err, null);\n assert.strictEqual(profile.user, \u0027User3\u0027);\n assert.strictEqual(profile.role, 30);\n assert.deepStrictEqual(profile.permissions, [\n { name: \u0027read\u0027, level: 1 },\n { name: \u0027write\u0027, level: 2 }\n ]);\n console.log(\u0027Task 45 assertions passed\u0027);\n});\n","category":"syntax_completion"} {"id":"46","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function initializeSettings(config) {\n // Apply defaults using logical assignment operators\n // ??= assigns only if null/undefined (NOT for 0, \u0027\u0027, false)\n // ||= assigns if falsy (0, \u0027\u0027, false, null, undefined)\n // \u0026\u0026= assigns only if truthy (replaces truthy values)\n","golden_completion":" config.host ??= \u0027localhost\u0027;\n config.port ??= 8080;\n config.debug ??= false;\n config.retries ||= 3;\n config.timeout ||= 5000;\n config.verbose \u0026\u0026= config.debug;\n config.options ??= {};\n config.options.cache ??= true;\n config.options.compress ??= false;\n config.options.maxSize ||= 1024;\n config.label \u0026\u0026= config.label.toUpperCase();\n return config;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\n// Test 1: empty config gets all defaults\nconst c1 = initializeSettings({});\nassert.strictEqual(c1.host, \u0027localhost\u0027);\nassert.strictEqual(c1.port, 8080);\nassert.strictEqual(c1.debug, false);\nassert.strictEqual(c1.retries, 3);\nassert.strictEqual(c1.timeout, 5000);\nassert.strictEqual(c1.verbose, undefined);\nassert.strictEqual(c1.options.cache, true);\nassert.strictEqual(c1.options.compress, false);\nassert.strictEqual(c1.options.maxSize, 1024);\nassert.strictEqual(c1.label, undefined);\n\n// Test 2: ??= does NOT overwrite 0 or false or \u0027\u0027\nconst c2 = initializeSettings({ port: 0, debug: false, host: \u0027\u0027 });\nassert.strictEqual(c2.port, 0); // ??= keeps 0\nassert.strictEqual(c2.debug, false); // ??= keeps false\nassert.strictEqual(c2.host, \u0027\u0027); // ??= keeps \u0027\u0027\n\n// Test 3: ||= DOES overwrite 0 and \u0027\u0027\nconst c3 = initializeSettings({ retries: 0, timeout: 0 });\nassert.strictEqual(c3.retries, 3); // ||= overwrites 0\nassert.strictEqual(c3.timeout, 5000); // ||= overwrites 0\n\n// Test 4: \u0026\u0026= only transforms truthy values\nconst c4 = initializeSettings({ verbose: true, debug: true, label: \u0027hello\u0027 });\nassert.strictEqual(c4.verbose, true); // \u0026\u0026= with debug=true =\u003e verbose stays true (debug is applied after)\nassert.strictEqual(c4.label, \u0027HELLO\u0027);\n\n// Test 5: \u0026\u0026= with falsy verbose\nconst c5 = initializeSettings({ verbose: false, label: \u0027\u0027 });\nassert.strictEqual(c5.verbose, false); // \u0026\u0026= on false: no assignment\nassert.strictEqual(c5.label, \u0027\u0027); // \u0026\u0026= on \u0027\u0027: no assignment\n\nconsole.log(\u0027Task 46 suffix passed\u0027);\n","assertions":"// Nested options with existing values\nconst c6 = initializeSettings({ options: { cache: false, compress: true, maxSize: 0 } });\nassert.strictEqual(c6.options.cache, false); // ??= keeps false\nassert.strictEqual(c6.options.compress, true); // ??= keeps true\nassert.strictEqual(c6.options.maxSize, 1024); // ||= overwrites 0\n\n// label transformation\nconst c7 = initializeSettings({ label: \u0027test\u0027 });\nassert.strictEqual(c7.label, \u0027TEST\u0027);\n\n// null values: ??= and ||= both overwrite null\nconst c8 = initializeSettings({ host: null, retries: null });\nassert.strictEqual(c8.host, \u0027localhost\u0027);\nassert.strictEqual(c8.retries, 3);\n\n// undefined values\nconst c9 = initializeSettings({ port: undefined, timeout: undefined });\nassert.strictEqual(c9.port, 8080);\nassert.strictEqual(c9.timeout, 5000);\n\n// verbose with debug=false\nconst c10 = initializeSettings({ verbose: true, debug: false });\n// debug ??= false (already false), verbose \u0026\u0026= config.debug =\u003e verbose = false\nassert.strictEqual(c10.verbose, false);\n\nconsole.log(\u0027Task 46 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"47","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const Serializable = {\n serialize() {\n const obj = {};\n for (const key of Object.keys(this)) {\n obj[key] = this[key];\n }\n return JSON.stringify(obj);\n },\n [Symbol.toPrimitive](hint) {\n if (hint === \u0027string\u0027) return this.serialize();\n return null;\n }\n};\n\nconst Validatable = {\n validate() {\n for (const [key, rule] of Object.entries(this.constructor.rules || {})) {\n if (rule.required \u0026\u0026 (this[key] === undefined || this[key] === null)) {\n throw new Error(key + \u0027 is required\u0027);\n }\n if (rule.type \u0026\u0026 this[key] !== undefined \u0026\u0026 typeof this[key] !== rule.type) {\n throw new Error(key + \u0027 must be \u0027 + rule.type);\n }\n }\n return true;\n }\n};\n\nfunction withMixins(Base, ...mixins) {\n","golden_completion":" class Mixed extends Base {\n constructor(...args) {\n super(...args);\n }\n }\n for (const mixin of mixins) {\n Object.getOwnPropertyNames(mixin).forEach(name =\u003e {\n if (name !== \u0027constructor\u0027) {\n Object.defineProperty(Mixed.prototype, name,\n Object.getOwnPropertyDescriptor(mixin, name));\n }\n });\n const symbols = Object.getOwnPropertySymbols(mixin);\n for (const sym of symbols) {\n Object.defineProperty(Mixed.prototype, sym,\n Object.getOwnPropertyDescriptor(mixin, sym));\n }\n }\n return Mixed;\n}\n","suffix":"class BaseModel {\n constructor(data) {\n Object.assign(this, data);\n }\n}\n\nclass User extends withMixins(BaseModel, Serializable, Validatable) {\n static rules = {\n name: { required: true, type: \u0027string\u0027 },\n age: { required: false, type: \u0027number\u0027 }\n };\n}\n\nconst assert = require(\u0027assert\u0027);\n\nconst u = new User({ name: \u0027Alice\u0027, age: 30 });\nassert.strictEqual(u.name, \u0027Alice\u0027);\nassert.strictEqual(u.age, 30);\n\n// Serializable mixin\nconst json = u.serialize();\nconst parsed = JSON.parse(json);\nassert.strictEqual(parsed.name, \u0027Alice\u0027);\nassert.strictEqual(parsed.age, 30);\n\n// Validatable mixin\nassert.strictEqual(u.validate(), true);\n\n// Missing required field\nassert.throws(() =\u003e {\n const u2 = new User({ age: 25 });\n u2.validate();\n}, /name is required/);\n\n// Wrong type\nassert.throws(() =\u003e {\n const u3 = new User({ name: 123 });\n u3.validate();\n}, /name must be string/);\n\n// Symbol.toPrimitive\nassert.strictEqual(`${u}`, json);\n\nconsole.log(\u0027Task 47 suffix passed\u0027);\n","assertions":"// Test with no mixins\nclass Plain extends withMixins(BaseModel) {}\nconst p = new Plain({ x: 1 });\nassert.strictEqual(p.x, 1);\nassert.strictEqual(typeof p.serialize, \u0027undefined\u0027);\n\n// Test inheritance chain\nassert.ok(u instanceof User);\nassert.ok(u instanceof BaseModel);\n\n// Test with only Serializable\nclass OnlySer extends withMixins(BaseModel, Serializable) {}\nconst s = new OnlySer({ foo: \u0027bar\u0027 });\nassert.strictEqual(JSON.parse(s.serialize()).foo, \u0027bar\u0027);\nassert.strictEqual(typeof s.validate, \u0027undefined\u0027);\n\n// Validate with all fields correct\nconst u4 = new User({ name: \u0027Bob\u0027, age: 40 });\nassert.strictEqual(u4.validate(), true);\n\n// Validate with optional field missing\nconst u5 = new User({ name: \u0027Eve\u0027 });\nassert.strictEqual(u5.validate(), true);\n\nconsole.log(\u0027Task 47 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"48","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function processApiResponse(response) {\n","golden_completion":" const {\n status: httpStatus = 200,\n data: {\n users: [\n { name: primaryName, role: primaryRole = \u0027user\u0027 },\n ...otherUsers\n ] = [],\n meta: {\n page: currentPage = 1,\n total: totalPages = 1,\n filters: { active: isActive = true, ...otherFilters } = {}\n } = {}\n } = {}\n } = response;\n\n return {\n httpStatus,\n primaryName,\n primaryRole,\n otherUsers: otherUsers.map(u =\u003e u.name),\n currentPage,\n totalPages,\n isActive,\n filterCount: Object.keys(otherFilters).length\n };\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\n// Full response\nconst r1 = processApiResponse({\n status: 200,\n data: {\n users: [\n { name: \u0027Alice\u0027, role: \u0027admin\u0027 },\n { name: \u0027Bob\u0027, role: \u0027user\u0027 },\n { name: \u0027Charlie\u0027, role: \u0027user\u0027 }\n ],\n meta: {\n page: 2,\n total: 5,\n filters: { active: false, verified: true, region: \u0027US\u0027 }\n }\n }\n});\nassert.strictEqual(r1.httpStatus, 200);\nassert.strictEqual(r1.primaryName, \u0027Alice\u0027);\nassert.strictEqual(r1.primaryRole, \u0027admin\u0027);\nassert.deepStrictEqual(r1.otherUsers, [\u0027Bob\u0027, \u0027Charlie\u0027]);\nassert.strictEqual(r1.currentPage, 2);\nassert.strictEqual(r1.totalPages, 5);\nassert.strictEqual(r1.isActive, false);\nassert.strictEqual(r1.filterCount, 2);\n\n// Minimal response with defaults\nconst r2 = processApiResponse({\n data: {\n users: [{ name: \u0027Solo\u0027 }]\n }\n});\nassert.strictEqual(r2.httpStatus, 200);\nassert.strictEqual(r2.primaryName, \u0027Solo\u0027);\nassert.strictEqual(r2.primaryRole, \u0027user\u0027);\nassert.deepStrictEqual(r2.otherUsers, []);\nassert.strictEqual(r2.currentPage, 1);\nassert.strictEqual(r2.totalPages, 1);\nassert.strictEqual(r2.isActive, true);\nassert.strictEqual(r2.filterCount, 0);\n\nconsole.log(\u0027Task 48 suffix passed\u0027);\n","assertions":"// Custom status\nconst r3 = processApiResponse({\n status: 404,\n data: {\n users: [{ name: \u0027X\u0027, role: \u0027mod\u0027 }, { name: \u0027Y\u0027 }]\n }\n});\nassert.strictEqual(r3.httpStatus, 404);\nassert.strictEqual(r3.primaryName, \u0027X\u0027);\nassert.strictEqual(r3.primaryRole, \u0027mod\u0027);\nassert.deepStrictEqual(r3.otherUsers, [\u0027Y\u0027]);\n\n// No filters key at all\nconst r4 = processApiResponse({\n data: {\n users: [{ name: \u0027A\u0027 }],\n meta: { page: 3, total: 10 }\n }\n});\nassert.strictEqual(r4.currentPage, 3);\nassert.strictEqual(r4.totalPages, 10);\nassert.strictEqual(r4.isActive, true);\nassert.strictEqual(r4.filterCount, 0);\n\n// Multiple other users\nconst r5 = processApiResponse({\n data: {\n users: [\n { name: \u0027Lead\u0027 },\n { name: \u0027A\u0027 },\n { name: \u0027B\u0027 },\n { name: \u0027C\u0027 },\n { name: \u0027D\u0027 }\n ]\n }\n});\nassert.deepStrictEqual(r5.otherUsers, [\u0027A\u0027, \u0027B\u0027, \u0027C\u0027, \u0027D\u0027]);\n\nconsole.log(\u0027Task 48 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"49","testsource":"devbench-syntax-completion","language":"javascript","prefix":"function fetchFromPrimary(id) {\n return new Promise((resolve, reject) =\u003e {\n setTimeout(() =\u003e reject(new Error(\u0027primary_down\u0027)), 10);\n });\n}\n\nfunction fetchFromSecondary(id) {\n return new Promise((resolve, reject) =\u003e {\n setTimeout(() =\u003e reject(new Error(\u0027secondary_timeout\u0027)), 20);\n });\n}\n\nfunction fetchFromCache(id) {\n return new Promise((resolve, reject) =\u003e {\n setTimeout(() =\u003e {\n if (id \u003e 0) resolve({ id, source: \u0027cache\u0027, data: \u0027cached_\u0027 + id });\n else reject(new Error(\u0027cache_miss\u0027));\n }, 5);\n });\n}\n\nasync function fetchWithFallback(id) {\n","golden_completion":" try {\n const result = await Promise.any([\n fetchFromPrimary(id),\n fetchFromSecondary(id),\n fetchFromCache(id)\n ]);\n return { success: true, ...result };\n } catch (err) {\n if (err instanceof AggregateError) {\n const reasons = err.errors.map(e =\u003e e.message);\n return {\n success: false,\n errors: reasons,\n errorCount: reasons.length\n };\n }\n throw err;\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\nasync function testFallback() {\n // Cache succeeds (id \u003e 0), primary and secondary fail\n const r1 = await fetchWithFallback(42);\n assert.strictEqual(r1.success, true);\n assert.strictEqual(r1.source, \u0027cache\u0027);\n assert.strictEqual(r1.data, \u0027cached_42\u0027);\n assert.strictEqual(r1.id, 42);\n\n // All fail (id \u003c= 0): AggregateError\n const r2 = await fetchWithFallback(-1);\n assert.strictEqual(r2.success, false);\n assert.strictEqual(r2.errorCount, 3);\n assert.ok(r2.errors.includes(\u0027primary_down\u0027));\n assert.ok(r2.errors.includes(\u0027secondary_timeout\u0027));\n assert.ok(r2.errors.includes(\u0027cache_miss\u0027));\n\n console.log(\u0027Task 49 suffix passed\u0027);\n}\ntestFallback();\n","assertions":"async function testFallbackAssertions() {\n // id=0 triggers cache_miss, all fail\n const r3 = await fetchWithFallback(0);\n assert.strictEqual(r3.success, false);\n assert.strictEqual(r3.errorCount, 3);\n\n // id=1 should succeed via cache\n const r4 = await fetchWithFallback(1);\n assert.strictEqual(r4.success, true);\n assert.strictEqual(r4.source, \u0027cache\u0027);\n assert.strictEqual(r4.data, \u0027cached_1\u0027);\n\n // Large positive id\n const r5 = await fetchWithFallback(999);\n assert.strictEqual(r5.success, true);\n assert.strictEqual(r5.id, 999);\n\n console.log(\u0027Task 49 assertions passed\u0027);\n}\ntestFallbackAssertions();\n","category":"syntax_completion"} {"id":"50","testsource":"devbench-syntax-completion","language":"javascript","prefix":"const _data = new WeakMap();\nconst TYPE = Symbol(\u0027type\u0027);\nconst FORMAT = Symbol(\u0027format\u0027);\n\nclass DynamicRecord {\n constructor(fields) {\n _data.set(this, {});\n this[TYPE] = \u0027DynamicRecord\u0027;\n this[FORMAT] = \u0027json\u0027;\n for (const [key, value] of Object.entries(fields)) {\n this.set(key, value);\n }\n }\n\n","golden_completion":" set(key, value) {\n const data = _data.get(this);\n data[key] = value;\n Object.defineProperty(this, key, {\n get() { return _data.get(this)[key]; },\n set(v) { _data.get(this)[key] = v; },\n enumerable: true,\n configurable: true\n });\n }\n\n get [Symbol.toStringTag]() {\n return \u0027DynamicRecord\u0027;\n }\n\n [Symbol.toPrimitive](hint) {\n const data = _data.get(this);\n if (hint === \u0027number\u0027) return Object.keys(data).length;\n return JSON.stringify(data);\n }\n\n toObject() {\n return { ..._data.get(this) };\n }\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n\nconst rec = new DynamicRecord({ name: \u0027test\u0027, value: 42 });\n\n// Property access via getter\nassert.strictEqual(rec.name, \u0027test\u0027);\nassert.strictEqual(rec.value, 42);\n\n// Symbol properties\nassert.strictEqual(rec[TYPE], \u0027DynamicRecord\u0027);\nassert.strictEqual(rec[FORMAT], \u0027json\u0027);\n\n// Symbol.toStringTag\nassert.strictEqual(Object.prototype.toString.call(rec), \u0027[object DynamicRecord]\u0027);\n\n// Symbol.toPrimitive - number hint\nassert.strictEqual(+rec, 2);\n\n// Symbol.toPrimitive - string hint\nconst str = `${rec}`;\nconst parsed = JSON.parse(str);\nassert.strictEqual(parsed.name, \u0027test\u0027);\nassert.strictEqual(parsed.value, 42);\n\n// Dynamic set\nrec.set(\u0027extra\u0027, \u0027data\u0027);\nassert.strictEqual(rec.extra, \u0027data\u0027);\nassert.strictEqual(+rec, 3);\n\n// toObject returns plain copy\nconst obj = rec.toObject();\nassert.strictEqual(obj.name, \u0027test\u0027);\nassert.strictEqual(obj.extra, \u0027data\u0027);\nobj.name = \u0027modified\u0027;\nassert.strictEqual(rec.name, \u0027test\u0027); // original unchanged\n\n// Property setter\nrec.name = \u0027updated\u0027;\nassert.strictEqual(rec.name, \u0027updated\u0027);\n\nconsole.log(\u0027Task 50 suffix passed\u0027);\n","assertions":"// Empty record\nconst empty = new DynamicRecord({});\nassert.strictEqual(+empty, 0);\nassert.strictEqual(empty[TYPE], \u0027DynamicRecord\u0027);\nassert.deepStrictEqual(empty.toObject(), {});\n\n// Multiple sets\nconst r2 = new DynamicRecord({});\nr2.set(\u0027a\u0027, 1);\nr2.set(\u0027b\u0027, 2);\nr2.set(\u0027c\u0027, 3);\nassert.strictEqual(+r2, 3);\nassert.strictEqual(r2.a, 1);\nassert.strictEqual(r2.b, 2);\nassert.strictEqual(r2.c, 3);\n\n// Overwrite via property setter\nconst r3 = new DynamicRecord({ x: 10 });\nr3.x = 20;\nassert.strictEqual(r3.x, 20);\nassert.strictEqual(r3.toObject().x, 20);\n\n// Enumerable check\nconst r4 = new DynamicRecord({ p: 1, q: 2 });\nconst keys = Object.keys(r4);\nassert.ok(keys.includes(\u0027p\u0027));\nassert.ok(keys.includes(\u0027q\u0027));\nassert.strictEqual(keys.length, 2); // TYPE and FORMAT are Symbols, not enumerable via Object.keys\n\nconsole.log(\u0027Task 50 assertions passed\u0027);\n","category":"syntax_completion"} {"id":"1","testsource":"devbench-api-usage","language":"python","prefix":"import csv\nimport io\n\ndef write_strict_csv(rows, fieldnames):\n","golden_completion":" \"\"\"Write rows with csv.DictWriter using strict fieldnames.\n\n The output is built in an io.StringIO buffer with a header row and\n no final line terminator. csv.DictWriter is configured with\n extrasaction=\u0027raise\u0027, so a row containing a key outside fieldnames\n raises ValueError instead of silently ignoring the extra field.\n \"\"\"\n","suffix":" out = io.StringIO(newline=\u0027\u0027)\n writer = csv.DictWriter(\n out,\n fieldnames=fieldnames,\n extrasaction=\u0027raise\u0027,\n lineterminator=\u0027\u0027\n )\n writer.writeheader()\n for row in rows:\n writer.writerow(row)\n return out.getvalue()\n\nrows = [{\u0027name\u0027: \u0027Alice\u0027, \u0027age\u0027: 30}, {\u0027name\u0027: \u0027Bob\u0027, \u0027age\u0027: 25}]\ntext = write_strict_csv(rows, [\u0027name\u0027, \u0027age\u0027])\nassert text == \u0027name,ageAlice,30Bob,25\u0027\ntry:\n write_strict_csv([{\u0027name\u0027: \u0027Cara\u0027, \u0027age\u0027: 28, \u0027city\u0027: \u0027LA\u0027}], [\u0027name\u0027, \u0027age\u0027])\n assert False, \u0027extra city key should raise\u0027\nexcept ValueError as e:\n assert \u0027city\u0027 in str(e)\nprint(text)\n","assertions":"doc = write_strict_csv.__doc__\nassert doc is not None, \u0027Docstring is missing\u0027\nlow = doc.lower()\nassert \u0027dictwriter\u0027 in low, \u0027Must name csv.DictWriter\u0027\nassert \u0027extrasaction\u0027 in low and \u0027raise\u0027 in low, \u0027Must mention extrasaction=raise\u0027\nassert \u0027valueerror\u0027 in low, \u0027Must mention ValueError for extra keys\u0027\nassert \u0027fieldnames\u0027 in low or \u0027field names\u0027 in low, \u0027Must mention fieldnames define allowed columns\u0027\nassert \u0027header\u0027 in low, \u0027Must mention header row\u0027\nassert \u0027terminator\u0027 in low or \u0027final newline\u0027 in low or \u0027line terminator\u0027 in low, \u0027Must mention line terminator behavior\u0027\nassert write_strict_csv([], [\u0027x\u0027, \u0027y\u0027]) == \u0027x,y\u0027\ntry:\n write_strict_csv([{\u0027x\u0027: 1, \u0027z\u0027: 2}], [\u0027x\u0027])\n assert False\nexcept ValueError as e:\n assert \u0027z\u0027 in str(e)\n","category":"api_usage"} {"id":"2","testsource":"devbench-api-usage","language":"python","prefix":"from itertools import groupby\n\n# Group these records by category\n# IMPORTANT: groupby only groups CONSECUTIVE matching elements\nrecords = [\n (\u0027fruit\u0027, \u0027apple\u0027), (\u0027veggie\u0027, \u0027carrot\u0027), (\u0027fruit\u0027, \u0027banana\u0027),\n (\u0027veggie\u0027, \u0027pea\u0027), (\u0027fruit\u0027, \u0027cherry\u0027), (\u0027veggie\u0027, \u0027corn\u0027)\n]\n\n# To get all items per category, data must be sorted by the grouping key first\n","golden_completion":"sorted_records = sorted(records, key=lambda x: x[0])\ngrouped = {k: [v for _, v in g] for k, g in groupby(sorted_records, key=lambda x: x[0])}\n","suffix":"assert grouped[\u0027fruit\u0027] == [\u0027apple\u0027, \u0027banana\u0027, \u0027cherry\u0027]\nassert grouped[\u0027veggie\u0027] == [\u0027carrot\u0027, \u0027pea\u0027, \u0027corn\u0027]\nprint(\"Grouping successful:\", grouped)\n","assertions":"from itertools import groupby\nrecords = [\n (\u0027fruit\u0027, \u0027apple\u0027), (\u0027veggie\u0027, \u0027carrot\u0027), (\u0027fruit\u0027, \u0027banana\u0027),\n (\u0027veggie\u0027, \u0027pea\u0027), (\u0027fruit\u0027, \u0027cherry\u0027), (\u0027veggie\u0027, \u0027corn\u0027)\n]\nsorted_records = sorted(records, key=lambda x: x[0])\ngrouped = {k: [v for _, v in g] for k, g in groupby(sorted_records, key=lambda x: x[0])}\nassert grouped[\u0027fruit\u0027] == [\u0027apple\u0027, \u0027banana\u0027, \u0027cherry\u0027]\nassert grouped[\u0027veggie\u0027] == [\u0027carrot\u0027, \u0027pea\u0027, \u0027corn\u0027]\n","category":"api_usage"} {"id":"3","testsource":"devbench-api-usage","language":"python","prefix":"import csv\nimport io\n\ndef default_csv_row(values):\n out = io.StringIO(newline=\u0027\u0027)\n writer = csv.writer(out, lineterminator=\u0027\u0027)\n writer.writerow(values)\n return out.getvalue()\n\n# Implement a CSV row encoder for a non-default dialect. The function\n# accepts delimiter, quotechar, and escapechar keyword arguments.\n# Defaults: semicolon delimiter, single quote quotechar, backslash\n# escapechar, doublequote disabled. Embedded newlines must still be\n# quoted as CSV data, but the returned row must not include the final\n# line terminator.\n\n","golden_completion":"def csv_escape_row(values, delimiter=\u0027;\u0027, quotechar=\"\u0027\", escapechar=\u0027\\\\\u0027):\n out = io.StringIO(newline=\u0027\u0027)\n writer = csv.writer(\n out,\n delimiter=delimiter,\n quotechar=quotechar,\n escapechar=escapechar,\n doublequote=False,\n lineterminator=\u0027\\n\u0027,\n quoting=csv.QUOTE_MINIMAL,\n )\n writer.writerow(values)\n text = out.getvalue()\n return text[:-1] if text.endswith(\u0027\\n\u0027) else text\n","suffix":"\nassert default_csv_row([\u0027a\u0027, \u0027b\u0027]) == \u0027a,b\u0027\nassert csv_escape_row([\u0027a\u0027, \u0027b\u0027]) == \u0027a;b\u0027\nassert csv_escape_row([\u0027semi;colon\u0027, \"can\u0027t\"]) == \"\u0027semi;colon\u0027;can\\\\\u0027t\"\nassert csv_escape_row([\u0027back\\\\slash\u0027, \u0027plain\u0027]) == \u0027back\\\\\\\\slash;plain\u0027\nassert csv_escape_row([\u0027semi|colon\u0027, \u0027x\u0027], delimiter=\u0027|\u0027) == \"\u0027semi|colon\u0027|x\"\nassert csv_escape_row([\u0027a;b\u0027], quotechar=\u0027\"\u0027) == \u0027\"a;b\"\u0027\nassert csv_escape_row([\u0027x\\ny\u0027, \u0027z\u0027]) == \"\u0027x\\ny\u0027;z\"\nrow = [\u0027a,b\u0027, \u0027semi;colon\u0027, \"can\u0027t\", \u0027plain\u0027, \u0027back\\\\slash\u0027]\nassert csv_escape_row(row) == \"a,b;\u0027semi;colon\u0027;can\\\\\u0027t;plain;back\\\\\\\\slash\"\nassert csv_escape_row(row) != default_csv_row(row)\nprint(csv_escape_row(row))\n","assertions":"assert csv_escape_row([]) == \u0027\u0027\nassert csv_escape_row([\u0027he said \\\"hi\\\"\u0027, \"it\u0027s ok\"]) == \u0027he said \"hi\";it\\\\\\\u0027s ok\u0027\nassert csv_escape_row([\u0027a;b\u0027, \u0027c;d\u0027]) == \"\u0027a;b\u0027;\u0027c;d\u0027\"\nassert csv_escape_row([\u0027a|b\u0027, \u0027c\u0027], delimiter=\u0027|\u0027) == \"\u0027a|b\u0027|c\"\nassert not csv_escape_row([\u0027tail\u0027]).endswith(\u0027\\n\u0027)\n","category":"api_usage"} {"id":"4","testsource":"devbench-api-usage","language":"python","prefix":"import csv\nimport io\n\ndef default_csv_row(values):\n out = io.StringIO(newline=\u0027\u0027)\n writer = csv.writer(out, lineterminator=\u0027\u0027)\n writer.writerow(values)\n return out.getvalue()\n\n# Implement a CSV row encoder that never quotes fields. Use csv.QUOTE_NONE\n# with backslash escaping. Delimiters, quote characters, backslashes, and\n# embedded newlines must be escaped, and the returned row must not include\n# the final line terminator.\n\n","golden_completion":"def csv_noquote_row(values, delimiter=\u0027,\u0027, escapechar=\u0027\\\\\u0027):\n out = io.StringIO(newline=\u0027\u0027)\n writer = csv.writer(\n out,\n delimiter=delimiter,\n escapechar=escapechar,\n quotechar=\u0027\"\u0027,\n doublequote=False,\n lineterminator=\u0027\\n\u0027,\n quoting=csv.QUOTE_NONE,\n )\n writer.writerow(values)\n text = out.getvalue()\n return text[:-1] if text.endswith(\u0027\\n\u0027) else text\n","suffix":"\nassert default_csv_row([\u0027a,b\u0027]) == \u0027\"a,b\"\u0027\nassert csv_noquote_row([\u0027a\u0027, \u0027b\u0027]) == \u0027a,b\u0027\nassert csv_noquote_row([\u0027a,b\u0027, \u0027x\"y\u0027, \u0027c\\\\d\u0027]) == \u0027a\\\\,b,x\\\\\"y,c\\\\\\\\d\u0027\nassert csv_noquote_row([\u0027line\\nbreak\u0027, \u0027z\u0027]) == \u0027line\\\\\\nbreak,z\u0027\nassert csv_noquote_row([\u0027a|b\u0027, \u0027c\u0027], delimiter=\u0027|\u0027) == \u0027a\\\\|b|c\u0027\nassert csv_noquote_row([\u0027a,b\u0027]) != default_csv_row([\u0027a,b\u0027])\nprint(csv_noquote_row([\u0027a,b\u0027, \u0027x\"y\u0027, \u0027c\\\\d\u0027]))\n","assertions":"assert csv_noquote_row([]) == \u0027\u0027\nassert csv_noquote_row([\u0027semi;colon\u0027, \u0027x\u0027], delimiter=\u0027;\u0027) == \u0027semi\\\\;colon;x\u0027\nassert csv_noquote_row([\u0027back\\\\slash\u0027]) == \u0027back\\\\\\\\slash\u0027\nassert csv_noquote_row([\u0027quote\"only\u0027]) == \u0027quote\\\\\"only\u0027\nassert not csv_noquote_row([\u0027tail\u0027]).endswith(\u0027\\n\u0027)\n","category":"api_usage"} {"id":"5","testsource":"devbench-api-usage","language":"python","prefix":"import struct\n\n# Pack a network protocol header: big-endian unsigned short (version),\n# unsigned int (message_id), and a signed byte (flags)\n# Then unpack it and verify round-trip\n\nversion = 3\nmessage_id = 100000\nflags = -1 # signed byte: will be 0xFF / 255 as unsigned\n","golden_completion":"packed = struct.pack(\u0027!HIb\u0027, version, message_id, flags)\nunpacked_version, unpacked_id, unpacked_flags = struct.unpack(\u0027!HIb\u0027, packed)\n","suffix":"assert unpacked_version == version\nassert unpacked_id == message_id\nassert unpacked_flags == flags\nassert len(packed) == struct.calcsize(\u0027!HIb\u0027)\nprint(f\"Packed {len(packed)} bytes: {packed.hex()}\")\nprint(f\"Unpacked: version={unpacked_version}, id={unpacked_id}, flags={unpacked_flags}\")\n","assertions":"import struct\nversion = 3\nmessage_id = 100000\nflags = -1\npacked = struct.pack(\u0027!HIb\u0027, version, message_id, flags)\nunpacked_version, unpacked_id, unpacked_flags = struct.unpack(\u0027!HIb\u0027, packed)\nassert unpacked_version == version\nassert unpacked_id == message_id\nassert unpacked_flags == flags\nassert len(packed) == 7 # 2 + 4 + 1\n","category":"api_usage"} {"id":"6","testsource":"devbench-api-usage","language":"python","prefix":"import csv\nimport io\n\ndef default_tsv_row(values):\n out = io.StringIO(newline=\u0027\u0027)\n writer = csv.writer(out, delimiter=\u0027\\t\u0027, lineterminator=\u0027\u0027)\n writer.writerow(values)\n return out.getvalue()\n\n# Implement a TSV-style row encoder. Defaults are tab delimiter, double\n# quote quotechar, backslash escapechar, and doublequote disabled. Embedded\n# newlines and tabs must still trigger CSV quoting, but the returned row\n# must not include the final line terminator.\n\n","golden_completion":"def tsv_escape_row(values, delimiter=\u0027\\t\u0027, quotechar=\u0027\"\u0027, escapechar=\u0027\\\\\u0027):\n out = io.StringIO(newline=\u0027\u0027)\n writer = csv.writer(\n out,\n delimiter=delimiter,\n quotechar=quotechar,\n escapechar=escapechar,\n doublequote=False,\n lineterminator=\u0027\\n\u0027,\n quoting=csv.QUOTE_MINIMAL,\n )\n writer.writerow(values)\n text = out.getvalue()\n return text[:-1] if text.endswith(\u0027\\n\u0027) else text\n","suffix":"\nassert default_tsv_row([\u0027a\u0027, \u0027b\u0027]) == \u0027a\\tb\u0027\nassert tsv_escape_row([\u0027a\u0027, \u0027b\u0027]) == \u0027a\\tb\u0027\nassert tsv_escape_row([\u0027a\\tb\u0027, \u0027quote\"\u0027]) == \u0027\"a\\tb\"\\tquote\\\\\"\u0027\nassert tsv_escape_row([\u0027line\\nbreak\u0027, \u0027z\u0027]) == \u0027\"line\\nbreak\"\\tz\u0027\nassert tsv_escape_row([\u0027path\\\\to\u0027, \u0027plain\u0027]) == \u0027path\\\\\\\\to\\tplain\u0027\nassert tsv_escape_row([\u0027a|b\u0027, \u0027c\u0027], delimiter=\u0027|\u0027) == \u0027\"a|b\"|c\u0027\nassert not tsv_escape_row([\u0027tail\u0027]).endswith(\u0027\\n\u0027)\nprint(tsv_escape_row([\u0027a\\tb\u0027, \u0027quote\"\u0027]))\n","assertions":"assert tsv_escape_row([]) == \u0027\u0027\nassert tsv_escape_row([\u0027x\\ny\u0027, \u0027has\\ttab\u0027]) == \u0027\"x\\ny\"\\t\"has\\ttab\"\u0027\nassert tsv_escape_row([\u0027semi;colon\u0027, \u0027x\u0027], delimiter=\u0027;\u0027) == \u0027\"semi;colon\";x\u0027\nassert tsv_escape_row([\u0027one\u0027, \u0027two\u0027]) == \u0027one\\ttwo\u0027\n","category":"api_usage"} {"id":"7","testsource":"devbench-api-usage","language":"python","prefix":"import heapq\nimport operator\n\ndef newest_high_priority(records, n):\n","golden_completion":" \"\"\"Return the n records with largest priority and newest timestamp.\n\n Uses heapq.nlargest with an operator.itemgetter key over the\n (\u0027priority\u0027, \u0027created_at\u0027) fields, so priority is compared first and\n created_at breaks ties. The input list is not mutated; the returned\n list is ordered from highest key to lowest.\n \"\"\"\n","suffix":" return heapq.nlargest(\n n,\n records,\n key=operator.itemgetter(\u0027priority\u0027, \u0027created_at\u0027)\n )\n\nrecords = [\n {\u0027id\u0027: \u0027old-high\u0027, \u0027priority\u0027: 5, \u0027created_at\u0027: 10},\n {\u0027id\u0027: \u0027new-high\u0027, \u0027priority\u0027: 5, \u0027created_at\u0027: 20},\n {\u0027id\u0027: \u0027low-new\u0027, \u0027priority\u0027: 3, \u0027created_at\u0027: 99},\n {\u0027id\u0027: \u0027top\u0027, \u0027priority\u0027: 8, \u0027created_at\u0027: 1},\n]\noriginal = [dict(r) for r in records]\nresult = newest_high_priority(records, 3)\nassert [r[\u0027id\u0027] for r in result] == [\u0027top\u0027, \u0027new-high\u0027, \u0027old-high\u0027]\nassert records == original\nassert newest_high_priority.__doc__ is not None\nprint([r[\u0027id\u0027] for r in result])\n","assertions":"doc = newest_high_priority.__doc__\nassert doc is not None, \u0027Docstring is missing\u0027\nlow = doc.lower()\nassert \u0027heapq.nlargest\u0027 in low or \u0027nlargest\u0027 in low, \u0027Must mention heapq.nlargest\u0027\nassert \u0027operator.itemgetter\u0027 in low or \u0027itemgetter\u0027 in low, \u0027Must mention operator.itemgetter key\u0027\nassert \u0027priority\u0027 in low, \u0027Must mention priority sort key\u0027\nassert \u0027created_at\u0027 in low or \u0027created\u0027 in low or \u0027timestamp\u0027 in low, \u0027Must mention created_at tie-breaker\u0027\nassert \u0027tie\u0027 in low or \u0027break\u0027 in low, \u0027Must mention tie-breaking\u0027\nassert \u0027not mutated\u0027 in low or \u0027does not mutate\u0027 in low or \u0027unchanged\u0027 in low, \u0027Must mention input is not mutated\u0027\nmore = records + [{\u0027id\u0027: \u0027future-high\u0027, \u0027priority\u0027: 5, \u0027created_at\u0027: 30}]\nassert [r[\u0027id\u0027] for r in newest_high_priority(more, 2)] == [\u0027top\u0027, \u0027future-high\u0027]\nassert newest_high_priority(more, 0) == []\n","category":"api_usage"} {"id":"8","testsource":"devbench-api-usage","language":"python","prefix":"import bisect\nimport operator\n\ndef insert_by_score(records, record):\n","golden_completion":" \"\"\"Insert record into records sorted by score and return its index.\n\n Uses bisect.bisect_left with operator.itemgetter(\u0027score\u0027) as the key.\n Python\u0027s bisect key is applied to existing records only, so x is the\n raw score value, not the record dict. Equal scores are inserted on the\n left, and the input list is mutated in place.\n \"\"\"\n","suffix":" index = bisect.bisect_left(\n records,\n record[\u0027score\u0027],\n key=operator.itemgetter(\u0027score\u0027)\n )\n records.insert(index, record)\n return index\n\nrecords = [\n {\u0027name\u0027: \u0027a\u0027, \u0027score\u0027: 10},\n {\u0027name\u0027: \u0027b\u0027, \u0027score\u0027: 20},\n {\u0027name\u0027: \u0027c\u0027, \u0027score\u0027: 20},\n {\u0027name\u0027: \u0027d\u0027, \u0027score\u0027: 40},\n]\nidx = insert_by_score(records, {\u0027name\u0027: \u0027new\u0027, \u0027score\u0027: 20})\nassert idx == 1\nassert [r[\u0027name\u0027] for r in records] == [\u0027a\u0027, \u0027new\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027]\nassert insert_by_score.__doc__ is not None\nprint(idx, records)\n","assertions":"doc = insert_by_score.__doc__\nassert doc is not None, \u0027Docstring is missing\u0027\nlow = doc.lower()\nassert \u0027bisect_left\u0027 in low or \u0027bisect.bisect_left\u0027 in low, \u0027Must mention bisect_left\u0027\nassert \u0027operator.itemgetter\u0027 in low or \u0027itemgetter\u0027 in low, \u0027Must mention operator.itemgetter key\u0027\nassert \u0027key\u0027 in low and (\u0027existing\u0027 in low or \u0027list\u0027 in low or \u0027items\u0027 in low) and (\u0027x\u0027 in low or \u0027probe\u0027 in low or \u0027raw score\u0027 in low), \u0027Must mention key applies to list elements, not x/probe\u0027\nassert \u0027left\u0027 in low or \u0027before equal\u0027 in low or \u0027equal\u0027 in low, \u0027Must mention left insertion for ties\u0027\nassert \u0027mutat\u0027 in low or \u0027in place\u0027 in low or \u0027insert\u0027 in low, \u0027Must mention list mutation\u0027\nassert \u0027return\u0027 in low and \u0027index\u0027 in low, \u0027Must mention returned index\u0027\nmore = [{\u0027name\u0027: \u0027a\u0027, \u0027score\u0027: 1}, {\u0027name\u0027: \u0027b\u0027, \u0027score\u0027: 3}]\nassert insert_by_score(more, {\u0027name\u0027: \u0027z\u0027, \u0027score\u0027: 2}) == 1\nassert [r[\u0027score\u0027] for r in more] == [1, 2, 3]\nassert insert_by_score(more, {\u0027name\u0027: \u0027first\u0027, \u0027score\u0027: 1}) == 0\n","category":"api_usage"} {"id":"9","testsource":"devbench-api-usage","language":"python","prefix":"from datetime import datetime, timezone\n\ndef parse_log_timestamp(text):\n","golden_completion":" \"\"\"Parse a timezone-offset log timestamp and return it in UTC.\n\n datetime.strptime uses the \u0027%Y-%m-%d %H:%M:%S %z\u0027 format, where %z\n creates an aware datetime from a numeric UTC offset. The result is\n normalized with astimezone(timezone.utc). Invalid text or a missing\n offset propagates strptime\u0027s ValueError.\n \"\"\"\n","suffix":" parsed = datetime.strptime(text, \u0027%Y-%m-%d %H:%M:%S %z\u0027)\n return parsed.astimezone(timezone.utc)\n\nstamp = parse_log_timestamp(\u00272026-05-01 09:30:00 -0700\u0027)\nassert stamp.isoformat() == \u00272026-05-01T16:30:00+00:00\u0027\nassert stamp.tzinfo is timezone.utc\nassert parse_log_timestamp.__doc__ is not None\nprint(stamp.isoformat())\n","assertions":"doc = parse_log_timestamp.__doc__\nassert doc is not None, \u0027Docstring is missing\u0027\nlow = doc.lower()\nassert \u0027strptime\u0027 in low, \u0027Must mention datetime.strptime\u0027\nassert \u0027%z\u0027 in doc, \u0027Must mention %z timezone offset parsing\u0027\nassert \u0027aware\u0027 in low or \u0027timezone\u0027 in low or \u0027tzinfo\u0027 in low, \u0027Must mention timezone-aware datetime\u0027\nassert \u0027astimezone\u0027 in low, \u0027Must mention astimezone conversion\u0027\nassert \u0027utc\u0027 in low, \u0027Must mention UTC normalization\u0027\nassert \u0027valueerror\u0027 in low or \u0027invalid\u0027 in low, \u0027Must mention invalid input behavior\u0027\nassert parse_log_timestamp(\u00272026-01-01 00:15:00 +0530\u0027).isoformat() == \u00272025-12-31T18:45:00+00:00\u0027\ntry:\n parse_log_timestamp(\u00272026-01-01 00:15:00\u0027)\n assert False\nexcept ValueError:\n pass\n","category":"api_usage"} {"id":"10","testsource":"devbench-api-usage","language":"python","prefix":"import hashlib\nimport io\n\ndef sha256_stream_hex(stream, chunk_size=4):\n","golden_completion":" \"\"\"Return the SHA-256 hex digest of a binary stream without consuming it.\n\n The current stream position is saved with tell(), bytes are read in\n chunk_size blocks and fed to hashlib.sha256().update(), then the stream\n is seek()ed back to its original position. The return value is the\n 64-character hexdigest string, not raw digest bytes.\n \"\"\"\n","suffix":" start = stream.tell()\n hasher = hashlib.sha256()\n while True:\n chunk = stream.read(chunk_size)\n if not chunk:\n break\n hasher.update(chunk)\n stream.seek(start)\n return hasher.hexdigest()\n\nbuf = io.BytesIO(b\u0027abcdef\u0027)\nbuf.seek(2)\nexpected = hashlib.sha256(b\u0027cdef\u0027).hexdigest()\nassert sha256_stream_hex(buf, chunk_size=2) == expected\nassert buf.tell() == 2\nassert len(sha256_stream_hex(io.BytesIO(b\u0027\u0027))) == 64\nassert sha256_stream_hex.__doc__ is not None\nprint(expected)\n","assertions":"doc = sha256_stream_hex.__doc__\nassert doc is not None, \u0027Docstring is missing\u0027\nlow = doc.lower()\nassert \u0027hashlib.sha256\u0027 in low or \u0027sha256\u0027 in low, \u0027Must mention hashlib.sha256\u0027\nassert \u0027update\u0027 in low, \u0027Must mention update() streaming API\u0027\nassert \u0027hexdigest\u0027 in low, \u0027Must mention hexdigest return\u0027\nassert \u002764\u0027 in low, \u0027Must mention 64-character hex output\u0027\nassert \u0027tell\u0027 in low and \u0027seek\u0027 in low, \u0027Must mention saving/restoring stream position\u0027\nassert \u0027chunk\u0027 in low or \u0027block\u0027 in low, \u0027Must mention chunked reading\u0027\nassert \u0027bytes\u0027 in low or \u0027binary\u0027 in low, \u0027Must mention binary byte stream\u0027\ndata = io.BytesIO(b\u00270123456789\u0027)\ndata.seek(5)\nassert sha256_stream_hex(data, 3) == hashlib.sha256(b\u002756789\u0027).hexdigest()\nassert data.tell() == 5\nassert isinstance(sha256_stream_hex(io.BytesIO(b\u0027x\u0027)), str)\n","category":"api_usage"} {"id":"11","testsource":"devbench-api-usage","language":"python","prefix":"import difflib\n\ndef word_diff(old, new):\n \"\"\"Return a list of change tuples from a word-level diff.\n Split on whitespace, use SequenceMatcher.get_opcodes().\n Return list of tuples:\n (\u0027replace\u0027, old_words, new_words)\n (\u0027insert\u0027, new_words)\n (\u0027delete\u0027, old_words)\n Skip \u0027equal\u0027 opcodes. Words are lists of str.\"\"\"\n old_words = old.split()\n new_words = new.split()\n matcher = difflib.SequenceMatcher(None, old_words, new_words)\n","golden_completion":" changes = []\n for tag, i1, i2, j1, j2 in matcher.get_opcodes():\n if tag == \u0027replace\u0027:\n changes.append((\u0027replace\u0027, old_words[i1:i2], new_words[j1:j2]))\n elif tag == \u0027insert\u0027:\n changes.append((\u0027insert\u0027, new_words[j1:j2]))\n elif tag == \u0027delete\u0027:\n changes.append((\u0027delete\u0027, old_words[i1:i2]))\n return changes","suffix":"\n\nresult = word_diff(\u0027the quick brown fox\u0027, \u0027the slow brown cat\u0027)\nprint(result)\n","assertions":"r1 = word_diff(\u0027the quick brown fox\u0027, \u0027the slow brown cat\u0027)\nassert (\u0027replace\u0027, [\u0027quick\u0027], [\u0027slow\u0027]) in r1\nassert (\u0027replace\u0027, [\u0027fox\u0027], [\u0027cat\u0027]) in r1\nassert len(r1) == 2\nr2 = word_diff(\u0027a b c\u0027, \u0027a b x y c\u0027)\nassert (\u0027insert\u0027, [\u0027x\u0027, \u0027y\u0027]) in r2\nassert len(r2) == 1\nr3 = word_diff(\u0027hello world\u0027, \u0027hello\u0027)\nassert (\u0027delete\u0027, [\u0027world\u0027]) in r3\nr4 = word_diff(\u0027same\u0027, \u0027same\u0027)\nassert r4 == []\n","category":"api_usage"} {"id":"12","testsource":"devbench-api-usage","language":"python","prefix":"import textwrap\n\ndef reformat_code(text, new_indent=\u0027 \u0027):\n \"\"\"Remove common leading whitespace, then re-indent only non-empty\n lines that don\u0027t start with \u0027#\u0027 (after dedent). Return the result.\"\"\"\n dedented = textwrap.dedent(text)\n","golden_completion":" return textwrap.indent(\n dedented, new_indent,\n predicate=lambda line: line.strip() != \u0027\u0027 and not line.lstrip().startswith(\u0027#\u0027)\n )","suffix":"\n\nsample = \u0027\u0027\u0027\\\n def foo():\n pass\n # comment\n x = 1\n\n y = 2\n\u0027\u0027\u0027\nresult = reformat_code(sample)\n","assertions":"import textwrap\nsample = \u0027 def foo():\\n pass\\n # comment\\n x = 1\\n\\n y = 2\\n\u0027\nresult = reformat_code(sample)\nlines = result.split(\u0027\\n\u0027)\nassert lines[0] == \u0027 def foo():\u0027, f\u0027Expected indented def line, got {lines[0]!r}\u0027\nassert any(line.startswith(\u0027#\u0027) for line in lines), \u0027Comment lines should NOT be indented\u0027\nassert any(line.strip() == \u0027\u0027 for line in lines), \u0027Blank lines should remain\u0027\nfor line in lines:\n if line.strip().startswith(\u0027#\u0027):\n assert not line.startswith(\u0027 \u0027), \u0027Comment lines must not have new indent\u0027\n","category":"api_usage"} {"id":"13","testsource":"devbench-api-usage","language":"python","prefix":"from urllib.parse import urlencode, parse_qs\n\ndef build_search_url(base, params):\n \"\"\"Build a query string where params may have list values.\n E.g. {\u0027color\u0027: [\u0027red\u0027,\u0027blue\u0027], \u0027size\u0027: \u0027large\u0027}\n -\u003e \u0027color=red\u0026color=blue\u0026size=large\u0027\n \"\"\"\n","golden_completion":" query = urlencode(params, doseq=True)\n return f\u0027{base}?{query}\u0027","suffix":"\n\nurl = build_search_url(\u0027https://shop.example.com/search\u0027,\n {\u0027color\u0027: [\u0027red\u0027, \u0027blue\u0027], \u0027size\u0027: \u0027large\u0027})\n","assertions":"url = build_search_url(\u0027https://shop.example.com/search\u0027, {\u0027color\u0027: [\u0027red\u0027, \u0027blue\u0027], \u0027size\u0027: \u0027large\u0027})\nassert \u0027color=red\u0027 in url\nassert \u0027color=blue\u0027 in url\nassert \u0027size=large\u0027 in url\nassert url.startswith(\u0027https://shop.example.com/search?\u0027)\n# Without doseq, list would be stringified\nfrom urllib.parse import urlencode\nbad = urlencode({\u0027color\u0027: [\u0027red\u0027, \u0027blue\u0027]}, doseq=False)\nassert \u0027color=red\u0027 not in bad or \u0027color=blue\u0027 not in bad or \"\u0027\" in bad, \u0027Without doseq=True, multi-value params are not expanded correctly\u0027\n# Test round-trip\nfrom urllib.parse import urlparse, parse_qs\nparsed = parse_qs(urlparse(url).query)\nassert set(parsed[\u0027color\u0027]) == {\u0027red\u0027, \u0027blue\u0027}\nassert parsed[\u0027size\u0027] == [\u0027large\u0027]\n","category":"api_usage"} {"id":"14","testsource":"devbench-api-usage","language":"python","prefix":"import json\nfrom datetime import datetime, date\nfrom decimal import Decimal\n\ndef custom_serializer(obj):\n \"\"\"JSON serializer for objects not serializable by default.\n - datetime/date -\u003e .isoformat()\n - Decimal -\u003e float\n - set/frozenset -\u003e sorted list\n - bytes -\u003e decoded utf-8 string\n Raises TypeError for anything else.\"\"\"\n","golden_completion":" if isinstance(obj, (datetime, date)):\n return obj.isoformat()\n if isinstance(obj, Decimal):\n return float(obj)\n if isinstance(obj, (set, frozenset)):\n return sorted(obj)\n if isinstance(obj, bytes):\n return obj.decode(\u0027utf-8\u0027)\n raise TypeError(f\u0027Object of type {type(obj).__name__} is not JSON serializable\u0027)","suffix":"\n\ndata = {\n \u0027timestamp\u0027: datetime(2024, 1, 15, 10, 30),\n \u0027tags\u0027: {\u0027beta\u0027, \u0027alpha\u0027, \u0027gamma\u0027},\n \u0027price\u0027: Decimal(\u002719.99\u0027),\n \u0027raw\u0027: b\u0027hello\u0027\n}\nresult = json.dumps(data, default=custom_serializer, sort_keys=True)\n","assertions":"import json\nfrom datetime import datetime, date\nfrom decimal import Decimal\ndata = {\n \u0027timestamp\u0027: datetime(2024, 1, 15, 10, 30),\n \u0027tags\u0027: {\u0027beta\u0027, \u0027alpha\u0027, \u0027gamma\u0027},\n \u0027price\u0027: Decimal(\u002719.99\u0027),\n \u0027raw\u0027: b\u0027hello\u0027\n}\nresult = json.dumps(data, default=custom_serializer, sort_keys=True)\nparsed = json.loads(result)\nassert parsed[\u0027timestamp\u0027] == \u00272024-01-15T10:30:00\u0027\nassert parsed[\u0027tags\u0027] == [\u0027alpha\u0027, \u0027beta\u0027, \u0027gamma\u0027]\nassert abs(parsed[\u0027price\u0027] - 19.99) \u003c 0.001\nassert parsed[\u0027raw\u0027] == \u0027hello\u0027\n# Must raise TypeError for unknown types\ntry:\n json.dumps({\u0027x\u0027: object()}, default=custom_serializer)\n assert False, \u0027Should raise TypeError\u0027\nexcept TypeError:\n pass\n","category":"api_usage"} {"id":"15","testsource":"devbench-api-usage","language":"python","prefix":"import re\n\ndef reformat_dates(text):\n \"\"\"Replace all YYYY-MM-DD dates in text with DD/MM/YYYY format.\n Use re.sub with a function replacement and named groups.\n Only transform valid-looking dates (4-digit year, 2-digit month/day).\"\"\"\n pattern = r\u0027(?P\u003cyear\u003e\\d{4})-(?P\u003cmonth\u003e\\d{2})-(?P\u003cday\u003e\\d{2})\u0027\n","golden_completion":" def replacer(match):\n return f\"{match.group(\u0027day\u0027)}/{match.group(\u0027month\u0027)}/{match.group(\u0027year\u0027)}\"\n return re.sub(pattern, replacer, text)","suffix":"\n\noriginal = \u0027Event on 2024-01-15 and deadline 2024-12-31.\u0027\nresult = reformat_dates(original)\n","assertions":"assert reformat_dates(\u0027Date: 2024-01-15\u0027) == \u0027Date: 15/01/2024\u0027\nassert reformat_dates(\u0027From 2023-06-01 to 2023-12-25\u0027) == \u0027From 01/06/2023 to 25/12/2023\u0027\nassert reformat_dates(\u0027No dates here\u0027) == \u0027No dates here\u0027\nassert reformat_dates(\u00272000-01-01\u0027) == \u002701/01/2000\u0027\nassert reformat_dates(\u0027mix 2024-03-15 text 2024-07-04 end\u0027) == \u0027mix 15/03/2024 text 04/07/2024 end\u0027\n","category":"api_usage"} {"id":"16","testsource":"devbench-api-usage","language":"python","prefix":"import logging\nimport io\n\nclass RequestIdFilter(logging.Filter):\n \"\"\"Filter that adds request_id to every LogRecord and prefixes the message.\n Attaches self.request_id to the record.\n Prepends \u0027[\u003crequest_id\u003e] \u0027 to the record\u0027s msg.\n filter() must return True (don\u0027t actually filter out records).\"\"\"\n def __init__(self, request_id):\n super().__init__()\n self.request_id = request_id\n","golden_completion":" def filter(self, record):\n record.request_id = self.request_id\n record.msg = f\u0027[{self.request_id}] {record.msg}\u0027\n return True","suffix":"\n\n# Set up logger with StringIO handler to capture output\ndef create_test_logger(request_id):\n logger = logging.getLogger(f\u0027test.{request_id}\u0027)\n logger.setLevel(logging.DEBUG)\n logger.handlers.clear()\n stream = io.StringIO()\n handler = logging.StreamHandler(stream)\n handler.setFormatter(logging.Formatter(\u0027%(message)s\u0027))\n logger.addFilter(RequestIdFilter(request_id))\n logger.addHandler(handler)\n return logger, stream\n","assertions":"logger, stream = create_test_logger(\u0027req-123\u0027)\nlogger.info(\u0027User logged in\u0027)\nlogger.warning(\u0027Slow query\u0027)\noutput = stream.getvalue()\nassert \u0027[req-123] User logged in\u0027 in output, f\u0027Got: {output!r}\u0027\nassert \u0027[req-123] Slow query\u0027 in output, f\u0027Got: {output!r}\u0027\n# Verify request_id attribute was added\nlogger2, stream2 = create_test_logger(\u0027req-456\u0027)\nhandler2 = logging.StreamHandler(io.StringIO())\nhandler2.setFormatter(logging.Formatter(\u0027%(request_id)s: %(message)s\u0027))\nlogger2.addHandler(handler2)\nlogger2.info(\u0027test\u0027)\nout2 = handler2.stream.getvalue()\nassert \u0027req-456\u0027 in out2\n","category":"api_usage"} {"id":"17","testsource":"devbench-api-usage","language":"python","prefix":"from unittest.mock import patch, MagicMock\nimport os\n\ndef read_config_values(keys):\n \"\"\"Read multiple config values from environment, returning a list.\n Uses os.environ.get for each key.\"\"\"\n return [os.environ.get(k) for k in keys]\n\n# Test: mock os.environ.get to return different values for successive calls\n","golden_completion":"with patch.object(os.environ, \u0027get\u0027, side_effect=[\u0027val1\u0027, \u0027val2\u0027, \u0027val3\u0027]) as mock_get:\n result = read_config_values([\u0027KEY1\u0027, \u0027KEY2\u0027, \u0027KEY3\u0027])\n assert result == [\u0027val1\u0027, \u0027val2\u0027, \u0027val3\u0027]\n assert mock_get.call_count == 3","suffix":"\n\nprint(\u0027Mock test passed\u0027)\n","assertions":"from unittest.mock import patch\nimport os\nwith patch.object(os.environ, \u0027get\u0027, side_effect=[\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]) as m:\n r = read_config_values([\u0027X\u0027, \u0027Y\u0027, \u0027Z\u0027])\n assert r == [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027], f\u0027Got {r}\u0027\n assert m.call_count == 3\n# Test with fewer calls than side_effect values\nwith patch.object(os.environ, \u0027get\u0027, side_effect=[\u0027one\u0027, \u0027two\u0027, \u0027three\u0027]) as m:\n r2 = read_config_values([\u0027A\u0027, \u0027B\u0027])\n assert r2 == [\u0027one\u0027, \u0027two\u0027], f\u0027Got {r2}\u0027\n","category":"api_usage"} {"id":"18","testsource":"devbench-api-usage","language":"python","prefix":"import inspect\nimport functools\n\ndef typecheck(func):\n \"\"\"Decorator that enforces type annotations at call time.\n For each parameter with an annotation, check isinstance.\n Raise TypeError with the parameter name if check fails.\n Unannotated parameters are not checked. Return type not checked.\"\"\"\n sig = inspect.signature(func)\n","golden_completion":" @functools.wraps(func)\n def wrapper(*args, **kwargs):\n bound = sig.bind(*args, **kwargs)\n bound.apply_defaults()\n for name, value in bound.arguments.items():\n param = sig.parameters[name]\n if param.annotation is not inspect.Parameter.empty:\n if not isinstance(value, param.annotation):\n raise TypeError(f\u0027{name} must be {param.annotation.__name__}\u0027)\n return func(*args, **kwargs)\n return wrapper","suffix":"\n\n@typecheck\ndef greet(name: str, times: int = 1):\n return (name + \u0027! \u0027) * times\n","assertions":"assert greet(\u0027hello\u0027, 3) == \u0027hello! hello! hello! \u0027\nassert greet(\u0027hi\u0027) == \u0027hi! \u0027\nassert greet(name=\u0027test\u0027, times=2) == \u0027test! test! \u0027\ntry:\n greet(123)\n assert False, \u0027Should raise TypeError\u0027\nexcept TypeError as e:\n assert \u0027name\u0027 in str(e)\ntry:\n greet(\u0027ok\u0027, \u0027bad\u0027)\n assert False, \u0027Should raise TypeError\u0027\nexcept TypeError as e:\n assert \u0027times\u0027 in str(e)\n# Unannotated params should pass through\n@typecheck\ndef noop(x):\n return x\nassert noop(\u0027anything\u0027) == \u0027anything\u0027\nassert noop(42) == 42\n","category":"api_usage"} {"id":"19","testsource":"devbench-api-usage","language":"python","prefix":"from operator import attrgetter\n\nclass Address:\n def __init__(self, city, zip_code):\n self.city = city\n self.zip_code = zip_code\n\nclass Company:\n def __init__(self, name, address):\n self.name = name\n self.address = address\n\nclass Employee:\n def __init__(self, name, company):\n self.name = name\n self.company = company\n\n# Create nested objects\naddr = Address(\u0027Springfield\u0027, \u002762701\u0027)\nco = Company(\u0027Acme\u0027, addr)\nemp = Employee(\u0027Alice\u0027, co)\n\n# Use attrgetter to extract nested attributes in one call\n","golden_completion":"get_city = attrgetter(\u0027company.address.city\u0027)\nget_zip = attrgetter(\u0027company.address.zip_code\u0027)\nget_company_name = attrgetter(\u0027company.name\u0027)\n\ncity = get_city(emp)\nzip_code = get_zip(emp)\ncompany_name = get_company_name(emp)","suffix":"\n\nprint(f\u0027{emp.name} works at {company_name} in {city}, {zip_code}\u0027)\n","assertions":"from operator import attrgetter\nassert attrgetter(\u0027company.address.city\u0027)(emp) == \u0027Springfield\u0027\nassert attrgetter(\u0027company.address.zip_code\u0027)(emp) == \u002762701\u0027\nassert attrgetter(\u0027company.name\u0027)(emp) == \u0027Acme\u0027\nassert attrgetter(\u0027name\u0027)(emp) == \u0027Alice\u0027\n# Multi-attribute getter\ngetter = attrgetter(\u0027name\u0027, \u0027company.name\u0027)\nassert getter(emp) == (\u0027Alice\u0027, \u0027Acme\u0027)\n","category":"api_usage"} {"id":"20","testsource":"devbench-api-usage","language":"python","prefix":"import weakref\n\ncleanup_log = []\n\nclass Resource:\n \"\"\"Resource that registers a weakref.finalize callback on creation.\n When the object is collected (or finalizer called), appends\n \u0027cleaned:\u003cname\u003e\u0027 to cleanup_log.\"\"\"\n def __init__(self, name):\n self.name = name\n","golden_completion":" self._finalizer = weakref.finalize(\n self, lambda n: cleanup_log.append(f\u0027cleaned:{n}\u0027), self.name\n )\n\n def close(self):\n \"\"\"Explicitly trigger cleanup (idempotent).\"\"\"\n self._finalizer()","suffix":"\n\n def is_alive(self):\n return self._finalizer.alive\n","assertions":"cleanup_log.clear()\nr = Resource(\u0027db\u0027)\nassert r.is_alive()\nassert cleanup_log == []\nr.close()\nassert cleanup_log == [\u0027cleaned:db\u0027]\nassert not r.is_alive()\n# Calling close again should be a no-op (finalize is one-shot)\nr.close()\nassert cleanup_log == [\u0027cleaned:db\u0027], \u0027Finalize should only run once\u0027\n# Test with garbage collection\ncleanup_log.clear()\nr2 = Resource(\u0027cache\u0027)\nassert r2.is_alive()\ndel r2\nimport gc; gc.collect()\nassert \u0027cleaned:cache\u0027 in cleanup_log\n","category":"api_usage"} {"id":"21","testsource":"devbench-api-usage","language":"python","prefix":"import functools\n\ncall_count = 0\n\n","golden_completion":"@functools.lru_cache(maxsize=128, typed=True)\ndef compute(x):\n global call_count\n call_count += 1\n return x * 2\n\n","suffix":"# Reset\ncall_count = 0\ncompute.cache_clear()\n\nr1 = compute(1)\nr2 = compute(1.0)\nr3 = compute(1)\n\nassert r1 == 2\nassert r2 == 2.0\n# With typed=True, int(1) and float(1.0) are cached separately\nassert call_count == 2, f\u0027Expected 2 calls (int and float cached separately), got {call_count}\u0027\n# Third call to compute(1) should be cached\nassert call_count == 2\ninfo = compute.cache_info()\nassert info.hits == 1, f\u0027Expected 1 cache hit, got {info.hits}\u0027\nassert info.misses == 2, f\u0027Expected 2 cache misses, got {info.misses}\u0027\n","assertions":"# Further verify typed behavior\ncompute.cache_clear()\ncall_count = 0\ncompute(2)\ncompute(2)\ncompute(2.0)\ncompute(2.0)\nassert call_count == 2, f\u0027Expected 2 calls, got {call_count}\u0027\ninfo = compute.cache_info()\nassert info.hits == 2\nassert info.misses == 2\n# Verify True (bool, subclass of int) is also separate from 1\ncompute.cache_clear()\ncall_count = 0\ncompute(1)\ncompute(True)\n# True is bool, int(1) is int -- with typed=True these are different types\nassert call_count == 2, f\u0027Expected 2 calls for int(1) vs bool(True), got {call_count}\u0027\n","category":"api_usage"} {"id":"22","testsource":"devbench-api-usage","language":"python","prefix":"import itertools\n\ndef generate_chunks():\n \"\"\"Yields chunks of numbers as lists.\"\"\"\n yield [1, 2, 3]\n yield [4, 5]\n yield [6, 7, 8, 9]\n\n","golden_completion":"def flatten_lazy(iterable_of_iterables):\n \"\"\"Flatten an iterable of iterables lazily using chain.from_iterable.\"\"\"\n return itertools.chain.from_iterable(iterable_of_iterables)\n\n","suffix":"# Verify lazy flattening works with a generator (can only iterate once)\nresult = list(flatten_lazy(generate_chunks()))\nassert result == [1, 2, 3, 4, 5, 6, 7, 8, 9], f\u0027Got: {result}\u0027\n\n# Verify it works lazily - we can take partial results\ngen = generate_chunks()\nflattened = flatten_lazy(gen)\nfirst_three = [next(flattened) for _ in range(3)]\nassert first_three == [1, 2, 3], f\u0027Got: {first_three}\u0027\n# Continue from where we left off\nnext_two = [next(flattened) for _ in range(2)]\nassert next_two == [4, 5], f\u0027Got: {next_two}\u0027\n","assertions":"# Test with empty chunks\ndef gen_with_empty():\n yield []\n yield [1]\n yield []\n yield [2, 3]\n yield []\n\nresult = list(flatten_lazy(gen_with_empty()))\nassert result == [1, 2, 3], f\u0027Got: {result}\u0027\n\n# Test with single chunk\nresult2 = list(flatten_lazy(iter([[10, 20]])))\nassert result2 == [10, 20]\n\n# Test with nested strings (each string is iterable of chars)\nresult3 = list(flatten_lazy(iter([\u0027ab\u0027, \u0027cd\u0027])))\nassert result3 == [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027]\n\n# Verify it returns an iterator, not a list\ngen2 = generate_chunks()\nout = flatten_lazy(gen2)\nassert hasattr(out, \u0027__next__\u0027), \u0027Should return an iterator\u0027\n","category":"api_usage"} {"id":"23","testsource":"devbench-api-usage","language":"python","prefix":"from collections import ChainMap\n\ndefaults = {\u0027color\u0027: \u0027red\u0027, \u0027size\u0027: \u0027medium\u0027, \u0027shape\u0027: \u0027circle\u0027}\nuser_prefs = {\u0027color\u0027: \u0027blue\u0027}\n\n","golden_completion":"# Create a ChainMap where user_prefs overrides defaults\n# Mutations only affect the first map (user_prefs)\nconfig = ChainMap(user_prefs, defaults)\n\n# Override a default value - this writes to user_prefs (first map)\nconfig[\u0027size\u0027] = \u0027large\u0027\n\n# Delete an overridden key - this deletes from user_prefs only\ndel config[\u0027color\u0027]\n\n","suffix":"# \u0027size\u0027 was set in user_prefs (first map)\nassert config[\u0027size\u0027] == \u0027large\u0027, f\"Expected \u0027large\u0027, got {config[\u0027size\u0027]}\"\nassert user_prefs[\u0027size\u0027] == \u0027large\u0027, \u0027Mutation should go to first map (user_prefs)\u0027\nassert defaults[\u0027size\u0027] == \u0027medium\u0027, \u0027defaults should be unchanged\u0027\n\n# After deleting \u0027color\u0027 from user_prefs, it falls through to defaults\nassert config[\u0027color\u0027] == \u0027red\u0027, f\"Expected \u0027red\u0027 (from defaults), got {config[\u0027color\u0027]}\"\nassert \u0027color\u0027 not in user_prefs, \u0027color should be deleted from user_prefs\u0027\nassert defaults[\u0027color\u0027] == \u0027red\u0027, \u0027defaults should still have color\u0027\n\n# shape was never overridden\nassert config[\u0027shape\u0027] == \u0027circle\u0027\n","assertions":"# Verify the maps attribute shows both dicts\nassert len(config.maps) == 2\nassert config.maps[0] is user_prefs\nassert config.maps[1] is defaults\n\n# Adding a new key goes to the first map\nconfig[\u0027opacity\u0027] = 0.5\nassert user_prefs[\u0027opacity\u0027] == 0.5\nassert \u0027opacity\u0027 not in defaults\n\n# new_child creates a new ChainMap with an empty dict on top\nchild = config.new_child()\nchild[\u0027color\u0027] = \u0027green\u0027\nassert child[\u0027color\u0027] == \u0027green\u0027\nassert config[\u0027color\u0027] == \u0027red\u0027 # parent unchanged\n\n# Verify that keys from all maps are visible\nall_keys = set(config.keys())\nassert \u0027shape\u0027 in all_keys\nassert \u0027size\u0027 in all_keys\n","category":"api_usage"} {"id":"24","testsource":"devbench-api-usage","language":"python","prefix":"import contextlib\n\nresults = []\n\n","golden_completion":"with contextlib.suppress(FileNotFoundError, PermissionError):\n results.append(\u0027before\u0027)\n raise FileNotFoundError(\u0027missing.txt\u0027)\n results.append(\u0027unreachable\u0027)\n\nresults.append(\u0027after_suppress\u0027)\n\nwith contextlib.ExitStack() as stack:\n stack.callback(results.append, \u0027cleanup_1\u0027)\n stack.callback(results.append, \u0027cleanup_2\u0027)\n results.append(\u0027inside_stack\u0027)\n\n","suffix":"# suppress skips everything after the exception\nassert \u0027before\u0027 in results\nassert \u0027unreachable\u0027 not in results, \u0027Code after raise should not execute\u0027\nassert \u0027after_suppress\u0027 in results, \u0027Code after with-block should execute\u0027\n\n# ExitStack callbacks fire in LIFO order\nassert results[-3] == \u0027inside_stack\u0027\nassert results[-2] == \u0027cleanup_2\u0027, f\u0027Expected cleanup_2, got {results[-2]}\u0027\nassert results[-1] == \u0027cleanup_1\u0027, f\u0027Expected cleanup_1, got {results[-1]}\u0027\n","assertions":"# Test suppress with an exception that is NOT suppressed\ncaught = False\ntry:\n with contextlib.suppress(FileNotFoundError):\n raise ValueError(\u0027not suppressed\u0027)\nexcept ValueError:\n caught = True\nassert caught, \u0027ValueError should not be suppressed\u0027\n\n# Test suppress with no exception raised\nflag = False\nwith contextlib.suppress(TypeError):\n flag = True\nassert flag\n\n# Verify ExitStack cleanup order with more callbacks\norder = []\nwith contextlib.ExitStack() as stack:\n stack.callback(order.append, \u0027a\u0027)\n stack.callback(order.append, \u0027b\u0027)\n stack.callback(order.append, \u0027c\u0027)\nassert order == [\u0027c\u0027, \u0027b\u0027, \u0027a\u0027], f\u0027Expected LIFO order, got {order}\u0027\n","category":"api_usage"} {"id":"25","testsource":"devbench-api-usage","language":"python","prefix":"from dataclasses import dataclass, field, fields\n\n","golden_completion":"@dataclass\nclass Config:\n name: str\n tags: list = field(default_factory=list, metadata={\u0027searchable\u0027: True, \u0027max_length\u0027: 10})\n scores: dict = field(default_factory=dict, metadata={\u0027searchable\u0027: False})\n version: int = field(default=1, repr=False)\n\n","suffix":"# Each instance gets its OWN list/dict (not shared)\nc1 = Config(name=\u0027alpha\u0027)\nc2 = Config(name=\u0027beta\u0027)\nc1.tags.append(\u0027fast\u0027)\nc1.scores[\u0027accuracy\u0027] = 0.95\n\nassert c1.tags == [\u0027fast\u0027]\nassert c2.tags == [], f\u0027c2.tags should be empty, got {c2.tags}\u0027\nassert c1.scores == {\u0027accuracy\u0027: 0.95}\nassert c2.scores == {}, f\u0027c2.scores should be empty, got {c2.scores}\u0027\n\n# Metadata is accessible via fields()\ntag_field = [f for f in fields(Config) if f.name == \u0027tags\u0027][0]\nassert tag_field.metadata[\u0027searchable\u0027] is True\nassert tag_field.metadata[\u0027max_length\u0027] == 10\n\nscore_field = [f for f in fields(Config) if f.name == \u0027scores\u0027][0]\nassert score_field.metadata[\u0027searchable\u0027] is False\n","assertions":"# version has repr=False\nc3 = Config(name=\u0027gamma\u0027)\nr = repr(c3)\nassert \u0027version\u0027 not in r, f\u0027version should not be in repr, got {r}\u0027\nassert \u0027gamma\u0027 in r\n\n# Default version\nassert c3.version == 1\n\n# Verify field count\nassert len(fields(Config)) == 4\n\n# Metadata is a mappingproxy (immutable)\ntag_field = [f for f in fields(Config) if f.name == \u0027tags\u0027][0]\ntry:\n tag_field.metadata[\u0027new_key\u0027] = \u0027val\u0027\n assert False, \u0027metadata should be immutable\u0027\nexcept TypeError:\n pass\n\n# Verify default_factory fields have no default\ntag_field = [f for f in fields(Config) if f.name == \u0027tags\u0027][0]\nimport dataclasses\nassert tag_field.default is dataclasses.MISSING\nassert tag_field.default_factory is list\n","category":"api_usage"} {"id":"26","testsource":"devbench-api-usage","language":"python","prefix":"from enum import Flag, auto\n\n","golden_completion":"class Permission(Flag):\n READ = auto()\n WRITE = auto()\n EXECUTE = auto()\n DELETE = auto()\n\n # Combined convenience flags\n READ_WRITE = READ | WRITE\n FULL_ACCESS = READ | WRITE | EXECUTE | DELETE\n\n","suffix":"# Basic flag operations\np = Permission.READ | Permission.WRITE\nassert Permission.READ in p\nassert Permission.WRITE in p\nassert Permission.EXECUTE not in p\n\n# Test combined flag\nassert Permission.READ_WRITE == Permission.READ | Permission.WRITE\nassert Permission.READ in Permission.READ_WRITE\nassert Permission.WRITE in Permission.READ_WRITE\nassert Permission.EXECUTE not in Permission.READ_WRITE\n\n# Full access includes everything\nassert Permission.READ in Permission.FULL_ACCESS\nassert Permission.DELETE in Permission.FULL_ACCESS\n","assertions":"# Bitwise AND to check specific permission\nuser_perms = Permission.READ | Permission.EXECUTE\nassert bool(user_perms \u0026 Permission.READ)\nassert not bool(user_perms \u0026 Permission.WRITE)\nassert bool(user_perms \u0026 Permission.EXECUTE)\n\n# XOR to toggle permissions\ntoggled = user_perms ^ Permission.READ # remove READ\nassert Permission.READ not in toggled\nassert Permission.EXECUTE in toggled\n\n# Adding a permission with OR\nexpanded = toggled | Permission.WRITE\nassert Permission.WRITE in expanded\nassert Permission.EXECUTE in expanded\n\n# auto() assigns powers of 2\nassert Permission.READ.value == 1\nassert Permission.WRITE.value == 2\nassert Permission.EXECUTE.value == 4\nassert Permission.DELETE.value == 8\n\n# Empty flag\nempty = Permission(0)\nassert not bool(empty)\n","category":"api_usage"} {"id":"27","testsource":"devbench-api-usage","language":"python","prefix":"from fractions import Fraction\n\n","golden_completion":"# Use string constructor for exact decimal representation\npi_approx = Fraction(\u00273.14159265358979\u0027)\n\n# limit_denominator finds the closest rational with denominator \u003c= max\napprox_7 = pi_approx.limit_denominator(7)\napprox_100 = pi_approx.limit_denominator(100)\napprox_1000 = pi_approx.limit_denominator(1000)\n\n","suffix":"# 22/7 is the best approximation with denominator \u003c= 7\nassert approx_7 == Fraction(22, 7), f\u0027Got {approx_7}\u0027\n\n# 311/99 is the best approximation with denominator \u003c= 100\nassert approx_100 == Fraction(311, 99), f\u0027Got {approx_100}\u0027\n\n# 355/113 is the best approximation with denominator \u003c= 1000\nassert approx_1000 == Fraction(355, 113), f\u0027Got {approx_1000}\u0027\n\n# Verify the approximations get closer\ndiff_7 = abs(pi_approx - approx_7)\ndiff_100 = abs(pi_approx - approx_100)\ndiff_1000 = abs(pi_approx - approx_1000)\nassert diff_7 \u003e diff_100 \u003e diff_1000\n","assertions":"# Verify string constructor vs float constructor difference\nfrom_string = Fraction(\u00270.1\u0027)\nfrom_float = Fraction(0.1)\n# String gives exact decimal; float gives the IEEE 754 representation\nassert from_string == Fraction(1, 10)\nassert from_float != Fraction(1, 10) # float 0.1 is not exactly 1/10\n\n# limit_denominator with max_denominator=1 gives nearest integer\nf = Fraction(\u00272.7\u0027)\nassert f.limit_denominator(1) == Fraction(3, 1)\n\n# limit_denominator on already-simple fractions\nsimple = Fraction(1, 3)\nassert simple.limit_denominator(3) == Fraction(1, 3)\nassert simple.limit_denominator(2) == Fraction(1, 2)\n","category":"api_usage"} {"id":"28","testsource":"devbench-api-usage","language":"python","prefix":"import statistics\n\ndata = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n\n","golden_completion":"# quantiles with n=4 gives quartile boundaries (3 cut points)\nexclusive_q = statistics.quantiles(data, n=4, method=\u0027exclusive\u0027)\ninclusive_q = statistics.quantiles(data, n=4, method=\u0027inclusive\u0027)\n\n# quantiles with n=10 gives decile boundaries\ndeciles_excl = statistics.quantiles(data, n=10, method=\u0027exclusive\u0027)\ndeciles_incl = statistics.quantiles(data, n=10, method=\u0027inclusive\u0027)\n\n","suffix":"# exclusive method (default): for data NOT including population extremes\n# inclusive method: for data that includes the min/max of the population\nassert len(exclusive_q) == 3, f\u0027Expected 3 quartile points, got {len(exclusive_q)}\u0027\nassert len(inclusive_q) == 3\n\n# For this dataset, the methods give different Q1 and Q3\nassert exclusive_q[1] == 5.5, f\u0027Median should be 5.5, got {exclusive_q[1]}\u0027\nassert inclusive_q[1] == 5.5, f\u0027Median should be 5.5, got {inclusive_q[1]}\u0027\n\n# Q1 differs between methods\nassert exclusive_q[0] != inclusive_q[0], \u0027Q1 should differ between methods for this data\u0027\n\n# Deciles: 9 cut points\nassert len(deciles_excl) == 9\nassert len(deciles_incl) == 9\n","assertions":"# Verify specific quartile values\n# Exclusive Q1=2.75, Q2=5.5, Q3=8.25 (for this data)\nassert exclusive_q[0] == 2.75, f\u0027Got {exclusive_q[0]}\u0027\nassert exclusive_q[2] == 8.25, f\u0027Got {exclusive_q[2]}\u0027\n\n# Inclusive Q1=3.25, Q2=5.5, Q3=7.75 (for this data)\nassert inclusive_q[0] == 3.25, f\u0027Got {inclusive_q[0]}\u0027\nassert inclusive_q[2] == 7.75, f\u0027Got {inclusive_q[2]}\u0027\n\n# Verify decile endpoints\nassert deciles_incl[0] == 1.9, f\u0027Got {deciles_incl[0]}\u0027\nassert deciles_incl[-1] == 9.1, f\u0027Got {deciles_incl[-1]}\u0027\n\n# n=2 gives the median\nmed = statistics.quantiles(data, n=2, method=\u0027exclusive\u0027)\nassert len(med) == 1\nassert med[0] == 5.5\n","category":"api_usage"} {"id":"29","testsource":"devbench-api-usage","language":"python","prefix":"import copy\n\nclass TrackedObject:\n \"\"\"Object that tracks copies and skips \u0027cache\u0027 during deep copy.\"\"\"\n _copy_count = 0\n\n def __init__(self, name, data, cache=None):\n self.name = name\n self.data = data\n self.cache = cache or {}\n self._id = id(self)\n\n","golden_completion":" def __deepcopy__(self, memo):\n TrackedObject._copy_count += 1\n cls = self.__class__\n result = cls.__new__(cls)\n memo[id(self)] = result\n result.name = copy.deepcopy(self.name, memo)\n result.data = copy.deepcopy(self.data, memo)\n result.cache = {} # intentionally not copied\n result._id = id(result)\n return result\n\n","suffix":"# Create an object with nested mutable data and a populated cache\noriginal = TrackedObject(\u0027root\u0027, {\u0027values\u0027: [1, 2, 3], \u0027nested\u0027: {\u0027a\u0027: 1}})\noriginal.cache[\u0027key1\u0027] = \u0027expensive_result\u0027\noriginal.cache[\u0027key2\u0027] = \u0027another_result\u0027\n\n# Deep copy\nTrackedObject._copy_count = 0\ncloned = copy.deepcopy(original)\n\n# Verify deep copy was customized\nassert TrackedObject._copy_count == 1, f\u0027Expected 1 copy, got {TrackedObject._copy_count}\u0027\nassert cloned.name == \u0027root\u0027\nassert cloned.data == {\u0027values\u0027: [1, 2, 3], \u0027nested\u0027: {\u0027a\u0027: 1}}\n\n# Cache should be EMPTY in the clone (not copied)\nassert cloned.cache == {}, f\u0027Cache should be reset, got {cloned.cache}\u0027\nassert original.cache == {\u0027key1\u0027: \u0027expensive_result\u0027, \u0027key2\u0027: \u0027another_result\u0027}\n\n# Data should be a TRUE deep copy (not shared)\ncloned.data[\u0027values\u0027].append(4)\nassert original.data[\u0027values\u0027] == [1, 2, 3], \u0027Original data should be unmodified\u0027\nassert cloned.data[\u0027values\u0027] == [1, 2, 3, 4]\n","assertions":"# Verify nested data is deep copied\ncloned2 = copy.deepcopy(original)\ncloned2.data[\u0027nested\u0027][\u0027a\u0027] = 999\nassert original.data[\u0027nested\u0027][\u0027a\u0027] == 1, \u0027Nested data should be independently copied\u0027\n\n# Verify _id is unique\nassert cloned2._id != original._id\n\n# Verify circular reference handling via memo\nclass Container:\n def __init__(self, obj):\n self.obj = obj\n self.ref = None\n\nc = Container(original)\nc.ref = c # circular reference\ncopied_c = copy.deepcopy(c)\nassert copied_c.ref is copied_c # circular ref preserved in copy\nassert copied_c.obj is not original # deep copied\nassert copied_c.obj.cache == {} # custom deepcopy hook still applied\n\n# Shallow copy should NOT trigger __deepcopy__\nTrackedObject._copy_count = 0\nshallow = copy.copy(original)\nassert TrackedObject._copy_count == 0, \u0027copy.copy should not call __deepcopy__\u0027\n","category":"api_usage"} {"id":"30","testsource":"devbench-api-usage","language":"python","prefix":"from abc import ABCMeta, abstractmethod\n\nclass Drawable(metaclass=ABCMeta):\n @abstractmethod\n def draw(self):\n pass\n\n","golden_completion":" @classmethod\n def __subclasshook__(cls, C):\n if cls is Drawable:\n if any(\u0027draw\u0027 in B.__dict__ for B in C.__mro__):\n return True\n return NotImplemented\n\n","suffix":"class Circle:\n def draw(self):\n return \u0027drawing circle\u0027\n\nclass Square(Drawable):\n def draw(self):\n return \u0027drawing square\u0027\n\nclass Empty:\n pass\n\n# Circle is a \"virtual subclass\" via __subclasshook__ (structural typing)\nassert isinstance(Circle(), Drawable), \u0027Circle should be considered Drawable\u0027\nassert issubclass(Circle, Drawable), \u0027Circle class should be subclass of Drawable\u0027\n\n# Square is a regular subclass\nassert isinstance(Square(), Drawable)\nassert issubclass(Square, Drawable)\n\n# Empty is NOT drawable\nassert not isinstance(Empty(), Drawable), \u0027Empty should not be Drawable\u0027\nassert not issubclass(Empty, Drawable), \u0027Empty should not be subclass of Drawable\u0027\n\n# Verify Circle was never registered and doesn\u0027t truly inherit\nassert Drawable not in Circle.__mro__\n","assertions":"# Dynamic class with draw method should also match\nclass Triangle:\n def draw(self):\n return \u0027drawing triangle\u0027\n\nassert issubclass(Triangle, Drawable)\nassert isinstance(Triangle(), Drawable)\n\n# Class with draw as a non-callable attribute should match __subclasshook__\n# because we only check \u0027draw\u0027 in __dict__, not that it\u0027s callable\nclass FakeDraw:\n draw = \u0027not a method\u0027\n\nassert issubclass(FakeDraw, Drawable) # __subclasshook__ just checks name exists\n\n# Inherited draw method should also work (check __mro__)\nclass Shape:\n def draw(self):\n return \u0027shape\u0027\n\nclass Hexagon(Shape):\n pass\n\nassert issubclass(Hexagon, Drawable), \u0027Inherited draw should count via __mro__\u0027\n\n# __subclasshook__ returns NotImplemented for non-Drawable checks\n# This is important: without it, other ABCs would be affected\nassert not issubclass(Empty, Drawable)\n","category":"api_usage"} {"id":"31","testsource":"devbench-api-usage","language":"python","prefix":"import string\n\n# Create a Template subclass that uses \u0027#\u0027 as delimiter instead of \u0027$\u0027\n","golden_completion":"class HashTemplate(string.Template):\n delimiter = \u0027#\u0027\n\ntmpl = HashTemplate(\u0027#name is #age years old\u0027)\nresult = tmpl.substitute(name=\u0027Alice\u0027, age=30)\n","suffix":"\nprint(result)\n","assertions":"assert result == \u0027Alice is 30 years old\u0027, f\u0027Got: {result!r}\u0027\ntmpl2 = HashTemplate(\u0027##escaped and #val\u0027)\nresult2 = tmpl2.substitute(val=\u0027ok\u0027)\nassert result2 == \u0027#escaped and ok\u0027, f\u0027Got: {result2!r}\u0027\n","category":"api_usage"} {"id":"32","testsource":"devbench-api-usage","language":"python","prefix":"import csv\nimport io\n\n# Write CSV with DictWriter using strict extra key handling\noutput = io.StringIO()\nfieldnames = [\u0027name\u0027, \u0027age\u0027]\n","golden_completion":"writer = csv.DictWriter(output, fieldnames=fieldnames, extrasaction=\u0027raise\u0027)\nwriter.writeheader()\nwriter.writerow({\u0027name\u0027: \u0027Alice\u0027, \u0027age\u0027: 25})\n","suffix":"\n# Verify output\ncsv_output = output.getvalue()\nprint(csv_output)\n","assertions":"assert \u0027name,age\u0027 in csv_output\nassert \u0027Alice,25\u0027 in csv_output\n# Now test that extra keys raise ValueError\noutput2 = io.StringIO()\nwriter2 = csv.DictWriter(output2, fieldnames=[\u0027name\u0027, \u0027age\u0027], extrasaction=\u0027raise\u0027)\ntry:\n writer2.writerow({\u0027name\u0027: \u0027Bob\u0027, \u0027age\u0027: 30, \u0027city\u0027: \u0027NYC\u0027})\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError as e:\n assert \u0027city\u0027 in str(e)\n# Test with extrasaction=\u0027ignore\u0027\noutput3 = io.StringIO()\nwriter3 = csv.DictWriter(output3, fieldnames=[\u0027name\u0027, \u0027age\u0027], extrasaction=\u0027ignore\u0027)\nwriter3.writerow({\u0027name\u0027: \u0027Carol\u0027, \u0027age\u0027: 28, \u0027city\u0027: \u0027LA\u0027})\nassert \u0027LA\u0027 not in output3.getvalue()\n","category":"api_usage"} {"id":"33","testsource":"devbench-api-usage","language":"python","prefix":"import html\n\n# Unescape HTML entities including numeric character references\n","golden_completion":"result1 = html.unescape(\u0027\u0026amp; \u0026lt; \u0026gt;\u0027)\nresult2 = html.unescape(\u0027\u0026#38; \u0026#60; \u0026#62;\u0027)\nresult3 = html.unescape(\u0027\u0026#x26; \u0026#x3C; \u0026#x3E;\u0027)\n","suffix":"\nprint(result1, result2, result3)\n","assertions":"assert result1 == \u0027\u0026 \u003c \u003e\u0027, f\u0027Named entities failed: {result1!r}\u0027\nassert result2 == \u0027\u0026 \u003c \u003e\u0027, f\u0027Decimal refs failed: {result2!r}\u0027\nassert result3 == \u0027\u0026 \u003c \u003e\u0027, f\u0027Hex refs failed: {result3!r}\u0027\nassert html.unescape(\u0027no entities here\u0027) == \u0027no entities here\u0027\nassert html.unescape(\u0027\u0026unknown;\u0027) == \u0027\u0026unknown;\u0027\n","category":"api_usage"} {"id":"34","testsource":"devbench-api-usage","language":"python","prefix":"import base64\n\n# Demonstrate the difference between standard and URL-safe base64\n# Use data that produces + and / in standard base64\ndata = b\u0027\\xfb\\xff\\xfe\u0027\n","golden_completion":"standard = base64.b64encode(data)\nurlsafe = base64.urlsafe_b64encode(data)\nboth_decode_same = base64.b64decode(standard) == base64.urlsafe_b64decode(urlsafe)\n","suffix":"\nprint(f\u0027Standard: {standard}\u0027)\nprint(f\u0027URL-safe: {urlsafe}\u0027)\nprint(f\u0027Both decode same: {both_decode_same}\u0027)\n","assertions":"assert isinstance(standard, bytes)\nassert isinstance(urlsafe, bytes)\n# Standard encoding may contain + and /\n# URL-safe replaces + with - and / with _\nstd_str = standard.decode()\nurl_str = urlsafe.decode()\nassert \u0027+\u0027 not in url_str and \u0027/\u0027 not in url_str, f\u0027URL-safe should not contain + or /: {url_str}\u0027\n# Verify they decode to the same data\nassert base64.b64decode(standard) == data\nassert base64.urlsafe_b64decode(urlsafe) == data\n# Verify the character substitution\nexpected_url = std_str.replace(\u0027+\u0027, \u0027-\u0027).replace(\u0027/\u0027, \u0027_\u0027)\nassert url_str == expected_url, f\u0027{url_str!r} != {expected_url!r}\u0027\n","category":"api_usage"} {"id":"35","testsource":"devbench-api-usage","language":"python","prefix":"import tempfile\nimport os\n\n# Create a named temporary file that persists after closing\n","golden_completion":"tmp = tempfile.NamedTemporaryFile(mode=\u0027w\u0027, suffix=\u0027.txt\u0027, delete=False)\ntmp_path = tmp.name\ntmp.write(\u0027hello world\u0027)\ntmp.close()\n","suffix":"\n# File should still exist after close since delete=False\nprint(f\u0027File exists: {os.path.exists(tmp_path)}\u0027)\n","assertions":"assert os.path.exists(tmp_path), \u0027File should persist after close with delete=False\u0027\nwith open(tmp_path, \u0027r\u0027) as f:\n content = f.read()\nassert content == \u0027hello world\u0027, f\u0027Content mismatch: {content!r}\u0027\n# Manual cleanup\nos.unlink(tmp_path)\nassert not os.path.exists(tmp_path), \u0027File should be deleted after unlink\u0027\n","category":"api_usage"} {"id":"36","testsource":"devbench-api-usage","language":"python","prefix":"import sqlite3\n\n# Create a custom aggregate function for geometric mean\n# Must define a class with step() and finalize() methods\nclass GeomMean:\n def __init__(self):\n self.product = 1.0\n self.count = 0\n\n","golden_completion":" def step(self, value):\n if value is not None:\n self.product *= value\n self.count += 1\n\n def finalize(self):\n if self.count == 0:\n return None\n return self.product ** (1.0 / self.count)\n","suffix":"\n# Register and use the aggregate\nconn = sqlite3.connect(\u0027:memory:\u0027)\nconn.create_aggregate(\u0027geom_mean\u0027, 1, GeomMean)\nconn.execute(\u0027CREATE TABLE nums (val REAL)\u0027)\nconn.executemany(\u0027INSERT INTO nums VALUES (?)\u0027, [(2,), (8,)])\nresult = conn.execute(\u0027SELECT geom_mean(val) FROM nums\u0027).fetchone()[0]\nprint(f\u0027Geometric mean: {result}\u0027)\nconn.close()\n","assertions":"conn = sqlite3.connect(\u0027:memory:\u0027)\nconn.create_aggregate(\u0027geom_mean\u0027, 1, GeomMean)\nconn.execute(\u0027CREATE TABLE nums (val REAL)\u0027)\nconn.executemany(\u0027INSERT INTO nums VALUES (?)\u0027, [(2,), (8,)])\nresult = conn.execute(\u0027SELECT geom_mean(val) FROM nums\u0027).fetchone()[0]\nassert abs(result - 4.0) \u003c 0.0001, f\u0027Geometric mean of 2,8 should be 4.0, got {result}\u0027\nconn.execute(\u0027DELETE FROM nums\u0027)\nconn.executemany(\u0027INSERT INTO nums VALUES (?)\u0027, [(1,), (3,), (9,)])\nresult2 = conn.execute(\u0027SELECT geom_mean(val) FROM nums\u0027).fetchone()[0]\nassert abs(result2 - 3.0) \u003c 0.0001, f\u0027Geometric mean of 1,3,9 should be 3.0, got {result2}\u0027\nconn.close()\n","category":"api_usage"} {"id":"37","testsource":"devbench-api-usage","language":"python","prefix":"import copy\nimport threading\n\nclass SafeCounter:\n \"\"\"Thread-safe counter that supports deepcopy.\n The lock cannot be deep-copied, so __deepcopy__ must\n create a new lock while copying the value.\"\"\"\n def __init__(self, value=0):\n self.value = value\n self._lock = threading.Lock()\n\n def increment(self):\n with self._lock:\n self.value += 1\n","golden_completion":"\n def __copy__(self):\n new = SafeCounter(self.value)\n return new\n\n def __deepcopy__(self, memo):\n new = SafeCounter(copy.deepcopy(self.value, memo))\n memo[id(self)] = new\n return new\n","suffix":"\n# Test deep copying\ncounter = SafeCounter(42)\ncounter_copy = copy.deepcopy(counter)\nprint(f\u0027Original: {counter.value}, Copy: {counter_copy.value}\u0027)\n","assertions":"c = SafeCounter(10)\nc.increment()\nc.increment()\nassert c.value == 12\nc2 = copy.deepcopy(c)\nassert c2.value == 12, f\u0027Expected 12, got {c2.value}\u0027\nassert hasattr(c2, \u0027_lock\u0027), \u0027Copied object should have _lock\u0027\nassert isinstance(c2._lock, type(threading.Lock())), \u0027Lock should be a new Lock\u0027\nassert c2._lock is not c._lock, \u0027Lock should be a different object\u0027\nc2.increment()\nassert c2.value == 13, \u0027Copied counter should be functional\u0027\nassert c.value == 12, \u0027Original should be unaffected\u0027\n# Test shallow copy too\nc3 = copy.copy(c)\nassert c3.value == 12\nassert c3._lock is not c._lock\n","category":"api_usage"} {"id":"38","testsource":"devbench-api-usage","language":"python","prefix":"import array\n\n# Create typed arrays with different typecodes and inspect them\n","golden_completion":"int_arr = array.array(\u0027i\u0027, [1, 2, 3, 4, 5])\nfloat_arr = array.array(\u0027d\u0027, [1.5, 2.5, 3.5])\naddr, length = int_arr.buffer_info()\n","suffix":"\nprint(f\u0027Int array: {int_arr}, buffer address: {addr}, length: {length}\u0027)\nprint(f\u0027Float array: {float_arr}\u0027)\n","assertions":"assert int_arr.typecode == \u0027i\u0027\nassert float_arr.typecode == \u0027d\u0027\nassert len(int_arr) == 5\nassert len(float_arr) == 3\nassert length == 5, f\u0027buffer_info length should be 5, got {length}\u0027\nassert isinstance(addr, int), \u0027Buffer address should be an integer\u0027\nassert list(int_arr) == [1, 2, 3, 4, 5]\nassert list(float_arr) == [1.5, 2.5, 3.5]\nassert int_arr.itemsize == array.array(\u0027i\u0027).itemsize\n","category":"api_usage"} {"id":"39","testsource":"devbench-api-usage","language":"python","prefix":"import io\n\n# Demonstrate proper use of BytesIO and StringIO\n# and show that mixing types raises TypeError\n","golden_completion":"# BytesIO for binary data\nbio = io.BytesIO()\nbio.write(b\u0027hello bytes\u0027)\nbio.seek(0)\nbytes_result = bio.read()\n\n# StringIO for text data\nsio = io.StringIO()\nsio.write(\u0027hello string\u0027)\nsio.seek(0)\nstr_result = sio.read()\n","suffix":"\nprint(f\u0027BytesIO: {bytes_result!r}\u0027)\nprint(f\u0027StringIO: {str_result!r}\u0027)\n","assertions":"assert bytes_result == b\u0027hello bytes\u0027\nassert str_result == \u0027hello string\u0027\nassert isinstance(bytes_result, bytes)\nassert isinstance(str_result, str)\n# Verify that writing wrong type raises TypeError\nbio2 = io.BytesIO()\ntry:\n bio2.write(\u0027string to bytesio\u0027)\n assert False, \u0027Should raise TypeError\u0027\nexcept TypeError:\n pass\nsio2 = io.StringIO()\ntry:\n sio2.write(b\u0027bytes to stringio\u0027)\n assert False, \u0027Should raise TypeError\u0027\nexcept TypeError:\n pass\n","category":"api_usage"} {"id":"40","testsource":"devbench-api-usage","language":"python","prefix":"from pathlib import PurePosixPath, PureWindowsPath\n\n# Demonstrate differences between POSIX and Windows path handling\n","golden_completion":"posix = PurePosixPath(\u0027/usr/local/bin/python\u0027)\nwin = PureWindowsPath(\u0027C:/Users/Admin/file.txt\u0027)\n\nposix_parts = posix.parts\nwin_parts = win.parts\nposix_name = posix.name\nwin_suffix = win.suffix\nwin_drive = win.drive\n","suffix":"\nprint(f\u0027POSIX parts: {posix_parts}\u0027)\nprint(f\u0027Windows parts: {win_parts}\u0027)\n","assertions":"assert posix_parts == (\u0027/\u0027, \u0027usr\u0027, \u0027local\u0027, \u0027bin\u0027, \u0027python\u0027)\nassert win_parts == (\u0027C:\\\\\u0027, \u0027Users\u0027, \u0027Admin\u0027, \u0027file.txt\u0027)\nassert posix_name == \u0027python\u0027\nassert win_suffix == \u0027.txt\u0027\nassert win_drive == \u0027C:\u0027\nassert posix.parent == PurePosixPath(\u0027/usr/local/bin\u0027)\n# PurePosixPath doesn\u0027t understand drive letters\nposix_c = PurePosixPath(\u0027C:/Users\u0027)\nassert posix_c.drive == \u0027\u0027, f\u0027POSIX should have no drive: {posix_c.drive!r}\u0027\n","category":"api_usage"} {"id":"41","testsource":"devbench-api-usage","language":"python","prefix":"import math\n\n# Compare floating point values with custom tolerances\n","golden_completion":"# Default tolerance comparison\nclose1 = math.isclose(1.0, 1.0000000001)\n\n# Near zero: need abs_tol since rel_tol fails near zero\nclose2 = math.isclose(0.0, 0.0001, abs_tol=0.001)\nnot_close = math.isclose(0.0, 0.0001) # False with default abs_tol=0.0\n\n# Custom rel_tol for looser comparison\nclose3 = math.isclose(1.0, 1.1, rel_tol=0.2)\n","suffix":"\nprint(f\u0027close1={close1}, close2={close2}, not_close={not_close}, close3={close3}\u0027)\n","assertions":"assert close1 is True, \u0027Values within default rel_tol should be close\u0027\nassert close2 is True, \u0027Should be close with abs_tol=0.001\u0027\nassert not_close is False, \u0027Near-zero comparison fails with default abs_tol=0.0\u0027\nassert close3 is True, \u0027Should be close with rel_tol=0.2\u0027\n# Verify the near-zero trap\nassert math.isclose(0.0, 1e-10) is False, \u0027Zero vs tiny number should be False with default tolerances\u0027\nassert math.isclose(0.0, 1e-10, abs_tol=1e-9) is True\n","category":"api_usage"} {"id":"42","testsource":"devbench-api-usage","language":"python","prefix":"import secrets\n\n# Generate various types of secure random data\n","golden_completion":"token_bytes = secrets.token_bytes(16)\ntoken_hex = secrets.token_hex(16)\ntoken_url = secrets.token_urlsafe(16)\nrandom_int = secrets.randbelow(100)\n","suffix":"\nprint(f\u0027Bytes: {token_bytes}\u0027)\nprint(f\u0027Hex: {token_hex}\u0027)\nprint(f\u0027URL-safe: {token_url}\u0027)\nprint(f\u0027Random int: {random_int}\u0027)\n","assertions":"assert isinstance(token_bytes, bytes)\nassert len(token_bytes) == 16\nassert isinstance(token_hex, str)\nassert len(token_hex) == 32, f\u0027hex token should be 32 chars for 16 bytes, got {len(token_hex)}\u0027\nassert isinstance(token_url, str)\nassert isinstance(random_int, int)\nassert 0 \u003c= random_int \u003c 100\n# Verify randomness (two calls should almost certainly differ)\nassert secrets.token_bytes(16) != secrets.token_bytes(16) or True # probabilistic\n","category":"api_usage"} {"id":"43","testsource":"devbench-api-usage","language":"python","prefix":"import threading\nimport time\n\nresults = []\naction_called = []\n\n# Create a barrier for 3 threads with an action callback\n# The action runs once when all threads reach the barrier\n","golden_completion":"def barrier_action():\n action_called.append(\u0027action\u0027)\n\nbarrier = threading.Barrier(3, action=barrier_action)\n\ndef worker(name):\n results.append(f\u0027{name}_before\u0027)\n barrier.wait()\n results.append(f\u0027{name}_after\u0027)\n","suffix":"\n# Run the threads\nthreads = [threading.Thread(target=worker, args=(f\u0027t{i}\u0027,)) for i in range(3)]\nfor t in threads:\n t.start()\nfor t in threads:\n t.join()\n","assertions":"assert len(action_called) == 1, f\u0027Action should be called once, got {len(action_called)}\u0027\nassert action_called[0] == \u0027action\u0027\n# All threads should have completed both phases\nbefore_count = sum(1 for r in results if \u0027_before\u0027 in r)\nafter_count = sum(1 for r in results if \u0027_after\u0027 in r)\nassert before_count == 3, f\u0027All 3 threads should have run before barrier, got {before_count}\u0027\nassert after_count == 3, f\u0027All 3 threads should have run after barrier, got {after_count}\u0027\n","category":"api_usage"} {"id":"44","testsource":"devbench-api-usage","language":"python","prefix":"import xml.etree.ElementTree as ET\n\n# Parse XML with namespaces\nxml_data = \u0027\u0027\u0027\u003c?xml version=\"1.0\"?\u003e\n\u003croot xmlns:ns=\"http://example.com/ns\"\u003e\n \u003cns:item id=\"1\"\u003eFirst\u003c/ns:item\u003e\n \u003cns:item id=\"2\"\u003eSecond\u003c/ns:item\u003e\n \u003cplain\u003eNo namespace\u003c/plain\u003e\n\u003c/root\u003e\u0027\u0027\u0027\n\n","golden_completion":"root = ET.fromstring(xml_data)\nns = {\u0027ns\u0027: \u0027http://example.com/ns\u0027}\nitems = root.findall(\u0027ns:item\u0027, ns)\nplain = root.find(\u0027plain\u0027)\nitem_texts = [item.text for item in items]\nitem_ids = [item.get(\u0027id\u0027) for item in items]\n","suffix":"\nprint(f\u0027Items: {item_texts}\u0027)\nprint(f\u0027IDs: {item_ids}\u0027)\nprint(f\u0027Plain: {plain.text}\u0027)\n","assertions":"assert len(items) == 2, f\u0027Should find 2 namespaced items, found {len(items)}\u0027\nassert item_texts == [\u0027First\u0027, \u0027Second\u0027]\nassert item_ids == [\u00271\u0027, \u00272\u0027]\nassert plain.text == \u0027No namespace\u0027\n# Verify that searching without namespace map finds nothing\nno_ns_items = root.findall(\u0027ns:item\u0027)\n# Without namespace mapping, this should find 0 items\nassert len(no_ns_items) == 0, f\u0027Without namespace map, should find 0 items, found {len(no_ns_items)}\u0027\n","category":"api_usage"} {"id":"45","testsource":"devbench-api-usage","language":"python","prefix":"import functools\n\n# Create a class that orders by absolute value using total_ordering\n@functools.total_ordering\nclass AbsVal:\n def __init__(self, value):\n self.value = value\n\n","golden_completion":" def __eq__(self, other):\n if not isinstance(other, AbsVal):\n return NotImplemented\n return abs(self.value) == abs(other.value)\n\n def __lt__(self, other):\n if not isinstance(other, AbsVal):\n return NotImplemented\n return abs(self.value) \u003c abs(other.value)\n","suffix":"\n# Test the ordering\nprint(AbsVal(-3) \u003c AbsVal(5))\nprint(AbsVal(-3) == AbsVal(3))\n","assertions":"assert AbsVal(-3) == AbsVal(3), \u0027Abs values should be equal\u0027\nassert AbsVal(-3) \u003c AbsVal(5), \u0027-3 \u003c 5 by absolute value\u0027\nassert AbsVal(5) \u003e AbsVal(-3), \u00275 \u003e -3 by absolute value\u0027\nassert AbsVal(-3) \u003c= AbsVal(3), \u0027Equal means also \u003c=\u0027\nassert AbsVal(-3) \u003e= AbsVal(3), \u0027Equal means also \u003e=\u0027\nassert AbsVal(1) \u003c= AbsVal(2), \u00271 \u003c= 2\u0027\nassert AbsVal(2) \u003e= AbsVal(1), \u00272 \u003e= 1\u0027\nassert not (AbsVal(5) \u003c AbsVal(-3)), \u00275 not less than -3 by abs\u0027\nassert sorted([AbsVal(-5), AbsVal(3), AbsVal(-1)], key=lambda x: abs(x.value)) == [AbsVal(-1), AbsVal(3), AbsVal(-5)]\n","category":"api_usage"} {"id":"46","testsource":"devbench-api-usage","language":"python","prefix":"import typing\n\n# Demonstrate get_type_hints resolving string (forward) annotations\n# When classes are defined dynamically, you need to pass localns\n","golden_completion":"class Node:\n value: int\n children: typing.List[\u0027Node\u0027]\n label: typing.Optional[str] = None\n\n# Must pass localns={\u0027Node\u0027: Node} to resolve forward reference \u0027Node\u0027\nhints = typing.get_type_hints(Node, localns={\u0027Node\u0027: Node})\n","suffix":"\nprint(f\u0027Type hints: {hints}\u0027)\n","assertions":"assert \u0027value\u0027 in hints\nassert \u0027children\u0027 in hints\nassert \u0027label\u0027 in hints\nassert hints[\u0027value\u0027] is int\n# get_type_hints resolves the string \u0027Node\u0027 to the actual Node class\nassert hints[\u0027children\u0027] == typing.List[Node], f\u0027Expected List[Node], got {hints[\"children\"]}\u0027\n# Verify that Optional[str] is resolved properly\nassert hints[\u0027label\u0027] == typing.Optional[str]\n","category":"api_usage"} {"id":"47","testsource":"devbench-api-usage","language":"python","prefix":"import dataclasses\nfrom collections import OrderedDict\n\n@dataclasses.dataclass\nclass Point:\n x: float\n y: float\n z: float = 0.0\n\n@dataclasses.dataclass\nclass Line:\n start: Point\n end: Point\n\n# Convert nested dataclass to OrderedDict using dict_factory parameter\n","golden_completion":"line = Line(Point(1.0, 2.0), Point(3.0, 4.0, 5.0))\nresult = dataclasses.asdict(line, dict_factory=OrderedDict)\nnested_types = [type(v) for v in result.values()]\n","suffix":"\nprint(f\u0027Result: {result}\u0027)\nprint(f\u0027Type: {type(result)}\u0027)\nprint(f\u0027Nested types: {nested_types}\u0027)\n","assertions":"assert isinstance(result, OrderedDict), f\u0027Expected OrderedDict, got {type(result)}\u0027\nassert isinstance(result[\u0027start\u0027], OrderedDict), \u0027Nested should also be OrderedDict\u0027\nassert isinstance(result[\u0027end\u0027], OrderedDict), \u0027Nested should also be OrderedDict\u0027\nassert result[\u0027start\u0027][\u0027x\u0027] == 1.0\nassert result[\u0027start\u0027][\u0027y\u0027] == 2.0\nassert result[\u0027start\u0027][\u0027z\u0027] == 0.0\nassert result[\u0027end\u0027][\u0027z\u0027] == 5.0\nassert list(result.keys()) == [\u0027start\u0027, \u0027end\u0027]\nassert list(result[\u0027start\u0027].keys()) == [\u0027x\u0027, \u0027y\u0027, \u0027z\u0027]\n","category":"api_usage"} {"id":"48","testsource":"devbench-api-usage","language":"python","prefix":"import enum\n\n# Create an enum where auto() generates lowercase member names as values\n","golden_completion":"class LowerEnum(enum.Enum):\n @staticmethod\n def _generate_next_value_(name, start, count, last_values):\n return name.lower()\n\n RED = enum.auto()\n GREEN = enum.auto()\n BLUE = enum.auto()\n","suffix":"\nprint(f\u0027RED={LowerEnum.RED.value}, GREEN={LowerEnum.GREEN.value}, BLUE={LowerEnum.BLUE.value}\u0027)\n","assertions":"assert LowerEnum.RED.value == \u0027red\u0027, f\u0027Expected red, got {LowerEnum.RED.value!r}\u0027\nassert LowerEnum.GREEN.value == \u0027green\u0027, f\u0027Expected green, got {LowerEnum.GREEN.value!r}\u0027\nassert LowerEnum.BLUE.value == \u0027blue\u0027, f\u0027Expected blue, got {LowerEnum.BLUE.value!r}\u0027\nassert LowerEnum(\u0027red\u0027) is LowerEnum.RED, \u0027Should be able to lookup by value\u0027\nassert LowerEnum(\u0027green\u0027) is LowerEnum.GREEN\n","category":"api_usage"} {"id":"49","testsource":"devbench-api-usage","language":"python","prefix":"import hmac\nimport hashlib\n\n# Use hmac for message authentication and timing-safe comparison\n","golden_completion":"secret = b\u0027my-secret-key\u0027\nmessage = b\u0027important data\u0027\ndigest = hmac.new(secret, message, hashlib.sha256).hexdigest()\n\n# Timing-safe comparison\nexpected = hmac.new(secret, message, hashlib.sha256).hexdigest()\nis_valid = hmac.compare_digest(digest, expected)\n","suffix":"\nprint(f\u0027Digest: {digest}\u0027)\nprint(f\u0027Valid: {is_valid}\u0027)\n","assertions":"assert is_valid is True, \u0027Same message should produce matching digest\u0027\nassert isinstance(digest, str), \u0027hexdigest should return str\u0027\nassert len(digest) == 64, f\u0027SHA-256 hexdigest should be 64 chars, got {len(digest)}\u0027\n# Test with wrong message\nwrong_digest = hmac.new(secret, b\u0027wrong data\u0027, hashlib.sha256).hexdigest()\nassert hmac.compare_digest(digest, wrong_digest) is False\n# compare_digest also works with bytes\nassert hmac.compare_digest(b\u0027abc\u0027, b\u0027abc\u0027) is True\nassert hmac.compare_digest(b\u0027abc\u0027, b\u0027xyz\u0027) is False\n","category":"api_usage"} {"id":"50","testsource":"devbench-api-usage","language":"python","prefix":"import inspect\n\nclass MyClass:\n class_var = 42\n _private = \u0027hidden\u0027\n\n def method(self):\n pass\n\n def _private_method(self):\n pass\n\n @staticmethod\n def static_method():\n pass\n\n @property\n def prop(self):\n return self.class_var\n\n# Get only the public methods (not private, not properties, not class vars)\n","golden_completion":"public_methods = inspect.getmembers(\n MyClass,\n predicate=lambda m: (inspect.isfunction(m) or inspect.ismethod(m))\n)\npublic_methods = [(name, m) for name, m in public_methods if not name.startswith(\u0027_\u0027)]\n","suffix":"\nprint(f\u0027Public methods: {[name for name, _ in public_methods]}\u0027)\n","assertions":"names = [name for name, _ in public_methods]\nassert \u0027method\u0027 in names, f\u0027Should include method, got {names}\u0027\nassert \u0027static_method\u0027 in names, f\u0027Should include static_method, got {names}\u0027\nassert \u0027_private_method\u0027 not in names, \u0027Should exclude private methods\u0027\nassert \u0027_private\u0027 not in names, \u0027Should exclude private attributes\u0027\nassert \u0027class_var\u0027 not in names, \u0027Should exclude class variables\u0027\n","category":"api_usage"} {"id":"1","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class ClaimAccumulator:\n \"\"\"Adjudicates simple outpatient visits against member accumulators.\n post_visit must be idempotent by visit_id. For a new visit it validates\n the code and billed amount before mutating state. Patient responsibility is\n applied in this order: optional facility fee, deductible, then coinsurance.\n The member out-of-pocket remaining caps all patient responsibility.\n Successful visits are stored, totals are updated, and an audit entry is added.\n Failed validations must leave all balances, totals, visits, and audit intact.\"\"\"\n\n def __init__(self, allowed_by_code, deductible_remaining, oop_remaining, coinsurance=0.2):\n self.allowed_by_code = dict(allowed_by_code)\n self.deductible_remaining = float(deductible_remaining)\n self.oop_remaining = float(oop_remaining)\n self.coinsurance = coinsurance\n self.visits = {}\n self.audit = []\n self.patient_total = 0.0\n self.plan_total = 0.0\n\n def snapshot(self):\n return {\n \u0027deductible_remaining\u0027: self.deductible_remaining,\n \u0027oop_remaining\u0027: self.oop_remaining,\n \u0027patient_total\u0027: self.patient_total,\n \u0027plan_total\u0027: self.plan_total,\n \u0027visits\u0027: dict(self.visits),\n \u0027audit\u0027: list(self.audit),\n }\n\n","golden_completion":" def post_visit(self, visit_id, code, billed_amount, facility=False):\n if visit_id in self.visits:\n return dict(self.visits[visit_id])\n if code not in self.allowed_by_code:\n raise ValueError(\"unknown service code\")\n billed_amount = float(billed_amount)\n if billed_amount \u003c 0:\n raise ValueError(\"billed amount must be non-negative\")\n\n allowed = round(min(billed_amount, float(self.allowed_by_code[code])), 2)\n remaining = allowed\n patient = 0.0\n facility_fee = 0.0\n if facility and remaining \u003e 0 and self.oop_remaining \u003e 0:\n facility_fee = min(25.0, remaining, self.oop_remaining)\n patient += facility_fee\n remaining = round(remaining - facility_fee, 2)\n\n oop_left = max(0.0, self.oop_remaining - patient)\n deductible = min(remaining, self.deductible_remaining, oop_left)\n patient += deductible\n remaining = round(remaining - deductible, 2)\n\n oop_left = max(0.0, self.oop_remaining - patient)\n coinsurance = min(round(remaining * self.coinsurance, 2), oop_left)\n patient = round(patient + coinsurance, 2)\n plan = round(allowed - patient, 2)\n\n self.deductible_remaining = round(self.deductible_remaining - deductible, 2)\n self.oop_remaining = round(self.oop_remaining - patient, 2)\n self.patient_total = round(self.patient_total + patient, 2)\n self.plan_total = round(self.plan_total + plan, 2)\n\n result = {\n \u0027visit_id\u0027: visit_id, \u0027code\u0027: code, \u0027allowed\u0027: allowed,\n \u0027patient\u0027: patient, \u0027plan\u0027: plan, \u0027facility_fee\u0027: round(facility_fee, 2),\n \u0027deductible\u0027: round(deductible, 2), \u0027coinsurance\u0027: round(coinsurance, 2),\n }\n self.visits[visit_id] = dict(result)\n self.audit.append({\u0027visit_id\u0027: visit_id, \u0027patient\u0027: patient, \u0027plan\u0027: plan, \u0027oop_remaining\u0027: self.oop_remaining})\n return dict(result)\n","suffix":"\nacc = ClaimAccumulator({\u0027PT\u0027: 200, \u0027XRAY\u0027: 150}, deductible_remaining=120, oop_remaining=160)\nfirst = acc.post_visit(\u0027v1\u0027, \u0027PT\u0027, 180, facility=True)\nassert first == {\n \u0027visit_id\u0027: \u0027v1\u0027, \u0027code\u0027: \u0027PT\u0027, \u0027allowed\u0027: 180.0,\n \u0027patient\u0027: 152.0, \u0027plan\u0027: 28.0, \u0027facility_fee\u0027: 25.0,\n \u0027deductible\u0027: 120.0, \u0027coinsurance\u0027: 7.0,\n}\nassert acc.deductible_remaining == 0.0\nassert acc.oop_remaining == 8.0\nassert acc.patient_total == 152.0 and acc.plan_total == 28.0\nassert len(acc.audit) == 1\n\nrepeat = acc.post_visit(\u0027v1\u0027, \u0027PT\u0027, 999, facility=False)\nassert repeat == first\nassert len(acc.audit) == 1\nassert acc.patient_total == 152.0 and acc.plan_total == 28.0\n\nsecond = acc.post_visit(\u0027v2\u0027, \u0027XRAY\u0027, 150)\nassert second[\u0027patient\u0027] == 8.0\nassert second[\u0027plan\u0027] == 142.0\nassert second[\u0027coinsurance\u0027] == 8.0\nassert acc.oop_remaining == 0.0\n\nbefore = acc.snapshot()\ntry:\n acc.post_visit(\u0027bad\u0027, \u0027MRI\u0027, 100)\n assert False, \u0027unknown code should fail\u0027\nexcept ValueError:\n pass\nassert acc.snapshot() == before\n","assertions":"\n# Allowed amount is the lower of billed amount and contracted allowed amount.\nacc2 = ClaimAccumulator({\u0027LAB\u0027: 80}, deductible_remaining=30, oop_remaining=100, coinsurance=0.25)\nres = acc2.post_visit(\u0027l1\u0027, \u0027LAB\u0027, 50)\nassert res[\u0027allowed\u0027] == 50.0\nassert res[\u0027deductible\u0027] == 30.0\nassert res[\u0027coinsurance\u0027] == 5.0\nassert res[\u0027patient\u0027] == 35.0\nassert res[\u0027plan\u0027] == 15.0\n\n# Out-of-pocket cap limits deductible, facility fee, and coinsurance together.\nacc3 = ClaimAccumulator({\u0027SURG\u0027: 500}, deductible_remaining=400, oop_remaining=20, coinsurance=0.5)\nres3 = acc3.post_visit(\u0027s1\u0027, \u0027SURG\u0027, 500, facility=True)\nassert res3[\u0027facility_fee\u0027] == 20.0\nassert res3[\u0027deductible\u0027] == 0.0\nassert res3[\u0027coinsurance\u0027] == 0.0\nassert res3[\u0027patient\u0027] == 20.0\nassert res3[\u0027plan\u0027] == 480.0\nassert acc3.oop_remaining == 0.0\nassert acc3.deductible_remaining == 400.0\n\n# Negative bills fail atomically and do not reserve the idempotency key.\nbefore3 = acc3.snapshot()\ntry:\n acc3.post_visit(\u0027neg\u0027, \u0027SURG\u0027, -1)\n assert False, \u0027negative billed amount should fail\u0027\nexcept ValueError:\n pass\nassert acc3.snapshot() == before3\nassert acc3.post_visit(\u0027neg\u0027, \u0027SURG\u0027, 10)[\u0027visit_id\u0027] == \u0027neg\u0027\n","category":"code_purpose_understanding"} {"id":"2","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class PayrollLedger:\n \"\"\"Posts approved hourly timesheets into payroll.\n post_timesheet is idempotent by sheet_id. For a new sheet it must validate\n the employee and hours before mutating anything. Gross pay uses 40 regular\n hours then 1.5x overtime. Benefit deductions are pre-tax and capped by gross.\n Tax is withheld from taxable wages. Garnishment is taken after tax and is\n capped by both the remaining garnishment balance and 25% of disposable pay.\n Successful posts update employee YTD totals, remaining garnishment, payroll\n cash, stored timesheet result, and audit log.\"\"\"\n\n def __init__(self):\n self.employees = {}\n self.timesheets = {}\n self.audit = []\n self.payroll_cash = 0.0\n\n def add_employee(self, emp_id, hourly_rate, tax_rate, benefit=0.0, garnishment_balance=0.0, active=True):\n self.employees[emp_id] = {\n \u0027rate\u0027: float(hourly_rate), \u0027tax_rate\u0027: tax_rate,\n \u0027benefit\u0027: float(benefit), \u0027garnishment_balance\u0027: float(garnishment_balance),\n \u0027active\u0027: active, \u0027ytd_gross\u0027: 0.0, \u0027ytd_tax\u0027: 0.0, \u0027ytd_net\u0027: 0.0,\n }\n\n def snapshot(self):\n return {\n \u0027employees\u0027: {k: dict(v) for k, v in self.employees.items()},\n \u0027timesheets\u0027: dict(self.timesheets),\n \u0027audit\u0027: list(self.audit),\n \u0027payroll_cash\u0027: self.payroll_cash,\n }\n\n","golden_completion":" def post_timesheet(self, sheet_id, emp_id, hours, period):\n if sheet_id in self.timesheets:\n return dict(self.timesheets[sheet_id])\n if emp_id not in self.employees:\n raise ValueError(\"unknown employee\")\n emp = self.employees[emp_id]\n if not emp[\u0027active\u0027]:\n raise ValueError(\"inactive employee\")\n hours = float(hours)\n if hours \u003c 0 or hours \u003e 80:\n raise ValueError(\"invalid hours\")\n\n regular_hours = min(hours, 40.0)\n overtime_hours = max(0.0, hours - 40.0)\n gross = round(regular_hours * emp[\u0027rate\u0027] + overtime_hours * emp[\u0027rate\u0027] * 1.5, 2)\n benefit = round(min(emp[\u0027benefit\u0027], gross), 2)\n taxable = round(gross - benefit, 2)\n tax = round(taxable * emp[\u0027tax_rate\u0027], 2)\n disposable = round(gross - benefit - tax, 2)\n garnishment_cap = round(disposable * 0.25, 2)\n garnishment = round(min(emp[\u0027garnishment_balance\u0027], garnishment_cap), 2)\n net = round(disposable - garnishment, 2)\n\n emp[\u0027garnishment_balance\u0027] = round(emp[\u0027garnishment_balance\u0027] - garnishment, 2)\n emp[\u0027ytd_gross\u0027] = round(emp[\u0027ytd_gross\u0027] + gross, 2)\n emp[\u0027ytd_tax\u0027] = round(emp[\u0027ytd_tax\u0027] + tax, 2)\n emp[\u0027ytd_net\u0027] = round(emp[\u0027ytd_net\u0027] + net, 2)\n self.payroll_cash = round(self.payroll_cash + net, 2)\n\n result = {\n \u0027sheet_id\u0027: sheet_id, \u0027emp_id\u0027: emp_id, \u0027period\u0027: period,\n \u0027regular_hours\u0027: regular_hours, \u0027overtime_hours\u0027: overtime_hours,\n \u0027gross\u0027: gross, \u0027benefit\u0027: benefit, \u0027tax\u0027: tax,\n \u0027garnishment\u0027: garnishment, \u0027net\u0027: net,\n }\n self.timesheets[sheet_id] = dict(result)\n self.audit.append({\u0027sheet_id\u0027: sheet_id, \u0027emp_id\u0027: emp_id, \u0027net\u0027: net, \u0027period\u0027: period})\n return dict(result)\n","suffix":"\nledger = PayrollLedger()\nledger.add_employee(\u0027e1\u0027, hourly_rate=20, tax_rate=0.10, benefit=50, garnishment_balance=100)\ncheck = ledger.post_timesheet(\u0027ts1\u0027, \u0027e1\u0027, 45, \u00272026-04\u0027)\nassert check == {\n \u0027sheet_id\u0027: \u0027ts1\u0027, \u0027emp_id\u0027: \u0027e1\u0027, \u0027period\u0027: \u00272026-04\u0027,\n \u0027regular_hours\u0027: 40.0, \u0027overtime_hours\u0027: 5.0,\n \u0027gross\u0027: 950.0, \u0027benefit\u0027: 50.0, \u0027tax\u0027: 90.0,\n \u0027garnishment\u0027: 100.0, \u0027net\u0027: 710.0,\n}\nassert ledger.employees[\u0027e1\u0027][\u0027garnishment_balance\u0027] == 0.0\nassert ledger.employees[\u0027e1\u0027][\u0027ytd_gross\u0027] == 950.0\nassert ledger.employees[\u0027e1\u0027][\u0027ytd_tax\u0027] == 90.0\nassert ledger.employees[\u0027e1\u0027][\u0027ytd_net\u0027] == 710.0\nassert ledger.payroll_cash == 710.0\nassert len(ledger.audit) == 1\n\nrepeat = ledger.post_timesheet(\u0027ts1\u0027, \u0027e1\u0027, 10, \u0027changed\u0027)\nassert repeat == check\nassert len(ledger.audit) == 1\nassert ledger.payroll_cash == 710.0\n\nledger.add_employee(\u0027e2\u0027, hourly_rate=30, tax_rate=0.20, benefit=5000, garnishment_balance=1000)\nzero_net = ledger.post_timesheet(\u0027ts2\u0027, \u0027e2\u0027, 10, \u00272026-04\u0027)\nassert zero_net[\u0027gross\u0027] == 300.0\nassert zero_net[\u0027benefit\u0027] == 300.0\nassert zero_net[\u0027tax\u0027] == 0.0\nassert zero_net[\u0027garnishment\u0027] == 0.0\nassert zero_net[\u0027net\u0027] == 0.0\n\nbefore = ledger.snapshot()\ntry:\n ledger.post_timesheet(\u0027bad\u0027, \u0027e1\u0027, 81, \u00272026-04\u0027)\n assert False, \u0027hours above 80 should fail\u0027\nexcept ValueError:\n pass\nassert ledger.snapshot() == before\n","assertions":"\n# Garnishment is capped at 25% of disposable pay when the balance is large.\nledger2 = PayrollLedger()\nledger2.add_employee(\u0027g1\u0027, hourly_rate=40, tax_rate=0.25, benefit=0, garnishment_balance=10000)\nres = ledger2.post_timesheet(\u0027g-ts\u0027, \u0027g1\u0027, 40, \u00272026-05\u0027)\nassert res[\u0027gross\u0027] == 1600.0\nassert res[\u0027tax\u0027] == 400.0\nassert res[\u0027garnishment\u0027] == 300.0\nassert res[\u0027net\u0027] == 900.0\nassert ledger2.employees[\u0027g1\u0027][\u0027garnishment_balance\u0027] == 9700.0\n\n# Inactive and unknown employees fail atomically and do not reserve sheet ids.\nledger2.add_employee(\u0027off\u0027, 25, 0.10, active=False)\nbefore2 = ledger2.snapshot()\ntry:\n ledger2.post_timesheet(\u0027off-ts\u0027, \u0027off\u0027, 8, \u00272026-05\u0027)\n assert False, \u0027inactive employee should fail\u0027\nexcept ValueError:\n pass\nassert ledger2.snapshot() == before2\ntry:\n ledger2.post_timesheet(\u0027missing-ts\u0027, \u0027missing\u0027, 8, \u00272026-05\u0027)\n assert False, \u0027unknown employee should fail\u0027\nexcept ValueError:\n pass\nassert \u0027missing-ts\u0027 not in ledger2.timesheets\n\n# Failed id can be reused after correcting the input.\ntry:\n ledger2.post_timesheet(\u0027reuse\u0027, \u0027g1\u0027, -1, \u00272026-05\u0027)\n assert False\nexcept ValueError:\n pass\nassert ledger2.post_timesheet(\u0027reuse\u0027, \u0027g1\u0027, 1, \u00272026-05\u0027)[\u0027sheet_id\u0027] == \u0027reuse\u0027\n","category":"code_purpose_understanding"} {"id":"3","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Subscription:\n VALID_TRANSITIONS = {\n \u0027pending\u0027: [\u0027active\u0027],\n \u0027active\u0027: [\u0027paused\u0027, \u0027cancelled\u0027],\n \u0027paused\u0027: [\u0027active\u0027, \u0027cancelled\u0027],\n \u0027cancelled\u0027: []\n }\n\n def __init__(self, user_id, plan, cooldown=0):\n self.user_id = user_id\n self.plan = plan\n self.state = \u0027pending\u0027\n self.cooldown = cooldown\n self.audit_log = []\n self.paused_at = None\n\n def _transition(self, new_state, timestamp):\n if new_state not in self.VALID_TRANSITIONS[self.state]:\n raise ValueError(f\"Cannot transition from {self.state} to {new_state}\")\n old_state = self.state\n self.state = new_state\n self.audit_log.append({\u0027from\u0027: old_state, \u0027to\u0027: new_state, \u0027ts\u0027: timestamp})\n\n def activate(self, timestamp):\n self._transition(\u0027active\u0027, timestamp)\n\n def pause(self, timestamp):\n self._transition(\u0027paused\u0027, timestamp)\n self.paused_at = timestamp\n\n","golden_completion":" def resume(self, timestamp):\n if self.state != \u0027paused\u0027:\n raise ValueError(f\"Cannot resume from {self.state}\")\n if self.paused_at is not None and (timestamp - self.paused_at) \u003c self.cooldown:\n raise ValueError(\"Cooldown period has not elapsed\")\n self._transition(\u0027active\u0027, timestamp)\n","suffix":"\nsub = Subscription(\u0027u1\u0027, \u0027pro\u0027, cooldown=100)\nsub.activate(1000)\nsub.pause(2000)\n\n# Too soon to resume\ntry:\n sub.resume(2050)\n assert False, \"Should fail due to cooldown\"\nexcept ValueError:\n pass\n\n# After cooldown\nsub.resume(2100)\nassert sub.state == \u0027active\u0027\n","assertions":"\n# Zero cooldown allows immediate resume\nsub2 = Subscription(\u0027u2\u0027, \u0027basic\u0027, cooldown=0)\nsub2.activate(100)\nsub2.pause(200)\nsub2.resume(200)\nassert sub2.state == \u0027active\u0027\n\n# Exact cooldown boundary is allowed\nsub3 = Subscription(\u0027u3\u0027, \u0027pro\u0027, cooldown=50)\nsub3.activate(100)\nsub3.pause(200)\nsub3.resume(250)\nassert sub3.state == \u0027active\u0027\n\n# Cannot resume from pending\nsub4 = Subscription(\u0027u4\u0027, \u0027pro\u0027, cooldown=0)\ntry:\n sub4.resume(100)\n assert False, \"Should not resume from pending\"\nexcept ValueError:\n pass\n","category":"code_purpose_understanding"} {"id":"4","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class PurchaseOrderBook:\n \"\"\"Receives purchase-order shipments into inventory.\n receive() is idempotent by receipt_id. It validates the purchase order,\n receipt lines, and over-receipt limits before mutating anything. Accepted\n units increase on-hand stock and weighted average cost. Defective units go\n to quarantine and count against the ordered quantity but do not create an\n inventory accrual. Line and order status close only when ordered quantities\n have all been received. Successful receipts update accruals, receipt storage,\n and audit entries atomically.\"\"\"\n\n def __init__(self):\n self.orders = {}\n self.on_hand = {}\n self.avg_cost = {}\n self.quarantine = {}\n self.receipts = {}\n self.audit = []\n self.accrual_total = 0.0\n\n def create_order(self, po_id, vendor, lines):\n self.orders[po_id] = {\n \u0027vendor\u0027: vendor, \u0027status\u0027: \u0027open\u0027,\n \u0027lines\u0027: {line[\u0027sku\u0027]: {\n \u0027ordered\u0027: line[\u0027qty\u0027], \u0027received\u0027: 0,\n \u0027unit_cost\u0027: float(line[\u0027unit_cost\u0027]), \u0027status\u0027: \u0027open\u0027\n } for line in lines}\n }\n\n def seed_inventory(self, sku, qty, avg_cost):\n self.on_hand[sku] = qty\n self.avg_cost[sku] = float(avg_cost)\n\n def snapshot(self):\n return {\n \u0027orders\u0027: {po: {\u0027vendor\u0027: o[\u0027vendor\u0027], \u0027status\u0027: o[\u0027status\u0027], \u0027lines\u0027: {k: dict(v) for k, v in o[\u0027lines\u0027].items()}} for po, o in self.orders.items()},\n \u0027on_hand\u0027: dict(self.on_hand), \u0027avg_cost\u0027: dict(self.avg_cost),\n \u0027quarantine\u0027: dict(self.quarantine), \u0027receipts\u0027: dict(self.receipts),\n \u0027audit\u0027: list(self.audit), \u0027accrual_total\u0027: self.accrual_total,\n }\n\n","golden_completion":" def receive(self, po_id, receipt_id, lines, timestamp):\n if receipt_id in self.receipts:\n return dict(self.receipts[receipt_id])\n if po_id not in self.orders:\n raise ValueError(\"unknown purchase order\")\n order = self.orders[po_id]\n if order[\u0027status\u0027] == \u0027closed\u0027:\n raise ValueError(\"purchase order is closed\")\n\n totals = {}\n for line in lines:\n sku = line[\u0027sku\u0027]\n accepted = int(line.get(\u0027accepted\u0027, 0))\n defective = int(line.get(\u0027defective\u0027, 0))\n if accepted \u003c 0 or defective \u003c 0:\n raise ValueError(\"negative receipt quantity\")\n if sku not in order[\u0027lines\u0027]:\n raise ValueError(\"sku not on purchase order\")\n totals.setdefault(sku, {\u0027accepted\u0027: 0, \u0027defective\u0027: 0})\n totals[sku][\u0027accepted\u0027] += accepted\n totals[sku][\u0027defective\u0027] += defective\n\n for sku, qtys in totals.items():\n po_line = order[\u0027lines\u0027][sku]\n remaining = po_line[\u0027ordered\u0027] - po_line[\u0027received\u0027]\n if qtys[\u0027accepted\u0027] + qtys[\u0027defective\u0027] \u003e remaining:\n raise ValueError(\"receipt exceeds remaining order quantity\")\n\n accepted_units = 0\n defective_units = 0\n accrued = 0.0\n for sku, qtys in totals.items():\n po_line = order[\u0027lines\u0027][sku]\n accepted = qtys[\u0027accepted\u0027]\n defective = qtys[\u0027defective\u0027]\n received = accepted + defective\n old_qty = self.on_hand.get(sku, 0)\n old_cost = self.avg_cost.get(sku, po_line[\u0027unit_cost\u0027])\n if accepted:\n new_qty = old_qty + accepted\n new_cost = ((old_qty * old_cost) + (accepted * po_line[\u0027unit_cost\u0027])) / new_qty\n self.on_hand[sku] = new_qty\n self.avg_cost[sku] = round(new_cost, 2)\n if defective:\n self.quarantine[sku] = self.quarantine.get(sku, 0) + defective\n po_line[\u0027received\u0027] += received\n if po_line[\u0027received\u0027] == po_line[\u0027ordered\u0027]:\n po_line[\u0027status\u0027] = \u0027closed\u0027\n accepted_units += accepted\n defective_units += defective\n accrued += accepted * po_line[\u0027unit_cost\u0027]\n\n order[\u0027status\u0027] = \u0027closed\u0027 if all(line[\u0027status\u0027] == \u0027closed\u0027 for line in order[\u0027lines\u0027].values()) else \u0027open\u0027\n accrued = round(accrued, 2)\n self.accrual_total = round(self.accrual_total + accrued, 2)\n result = {\n \u0027receipt_id\u0027: receipt_id, \u0027po_id\u0027: po_id,\n \u0027accepted_units\u0027: accepted_units, \u0027defective_units\u0027: defective_units,\n \u0027accrued\u0027: accrued, \u0027order_status\u0027: order[\u0027status\u0027],\n }\n self.receipts[receipt_id] = dict(result)\n self.audit.append({\u0027receipt_id\u0027: receipt_id, \u0027po_id\u0027: po_id, \u0027ts\u0027: timestamp, \u0027accrued\u0027: accrued})\n return dict(result)\n","suffix":"\nbook = PurchaseOrderBook()\nbook.create_order(\u0027PO1\u0027, \u0027Acme\u0027, [\n {\u0027sku\u0027: \u0027A\u0027, \u0027qty\u0027: 10, \u0027unit_cost\u0027: 5.00},\n {\u0027sku\u0027: \u0027B\u0027, \u0027qty\u0027: 4, \u0027unit_cost\u0027: 2.00},\n])\nfirst = book.receive(\u0027PO1\u0027, \u0027R1\u0027, [\n {\u0027sku\u0027: \u0027A\u0027, \u0027accepted\u0027: 6, \u0027defective\u0027: 1},\n {\u0027sku\u0027: \u0027B\u0027, \u0027accepted\u0027: 4, \u0027defective\u0027: 0},\n], timestamp=100)\nassert first == {\u0027receipt_id\u0027: \u0027R1\u0027, \u0027po_id\u0027: \u0027PO1\u0027, \u0027accepted_units\u0027: 10, \u0027defective_units\u0027: 1, \u0027accrued\u0027: 38.0, \u0027order_status\u0027: \u0027open\u0027}\nassert book.on_hand == {\u0027A\u0027: 6, \u0027B\u0027: 4}\nassert book.quarantine == {\u0027A\u0027: 1}\nassert book.avg_cost == {\u0027A\u0027: 5.0, \u0027B\u0027: 2.0}\nassert book.orders[\u0027PO1\u0027][\u0027lines\u0027][\u0027A\u0027][\u0027received\u0027] == 7\nassert book.orders[\u0027PO1\u0027][\u0027lines\u0027][\u0027B\u0027][\u0027status\u0027] == \u0027closed\u0027\nassert book.accrual_total == 38.0\nassert len(book.audit) == 1\n\nrepeat = book.receive(\u0027PO1\u0027, \u0027R1\u0027, [{\u0027sku\u0027: \u0027A\u0027, \u0027accepted\u0027: 99}], timestamp=999)\nassert repeat == first\nassert book.accrual_total == 38.0\nassert len(book.audit) == 1\n\nsecond = book.receive(\u0027PO1\u0027, \u0027R2\u0027, [{\u0027sku\u0027: \u0027A\u0027, \u0027accepted\u0027: 3, \u0027defective\u0027: 0}], timestamp=120)\nassert second[\u0027order_status\u0027] == \u0027closed\u0027\nassert book.orders[\u0027PO1\u0027][\u0027status\u0027] == \u0027closed\u0027\nassert book.on_hand[\u0027A\u0027] == 9\nassert book.accrual_total == 53.0\n\nbefore = book.snapshot()\ntry:\n book.receive(\u0027PO1\u0027, \u0027BAD\u0027, [{\u0027sku\u0027: \u0027B\u0027, \u0027accepted\u0027: 1}], timestamp=130)\n assert False, \u0027closed order should reject new receipts\u0027\nexcept ValueError:\n pass\nassert book.snapshot() == before\n","assertions":"\n# Duplicate receipt lines for the same SKU are aggregated before over-receipt validation.\nbook2 = PurchaseOrderBook()\nbook2.create_order(\u0027PO2\u0027, \u0027Bravo\u0027, [{\u0027sku\u0027: \u0027X\u0027, \u0027qty\u0027: 5, \u0027unit_cost\u0027: 10.0}])\ntry:\n book2.receive(\u0027PO2\u0027, \u0027RX\u0027, [\n {\u0027sku\u0027: \u0027X\u0027, \u0027accepted\u0027: 3},\n {\u0027sku\u0027: \u0027X\u0027, \u0027accepted\u0027: 3},\n ], timestamp=1)\n assert False, \u0027aggregated duplicate lines should exceed remaining quantity\u0027\nexcept ValueError:\n pass\nassert book2.snapshot()[\u0027receipts\u0027] == {}\nassert book2.orders[\u0027PO2\u0027][\u0027lines\u0027][\u0027X\u0027][\u0027received\u0027] == 0\n\n# Existing inventory updates weighted average cost only for accepted units.\nbook2.seed_inventory(\u0027X\u0027, 10, 8.0)\nr = book2.receive(\u0027PO2\u0027, \u0027RGOOD\u0027, [{\u0027sku\u0027: \u0027X\u0027, \u0027accepted\u0027: 4, \u0027defective\u0027: 1}], timestamp=2)\nassert r[\u0027order_status\u0027] == \u0027closed\u0027\nassert book2.on_hand[\u0027X\u0027] == 14\nassert book2.quarantine[\u0027X\u0027] == 1\nassert book2.avg_cost[\u0027X\u0027] == round((10 * 8.0 + 4 * 10.0) / 14, 2)\nassert book2.accrual_total == 40.0\n\n# Unknown SKU and negative quantities fail without reserving receipt ids.\nbook3 = PurchaseOrderBook()\nbook3.create_order(\u0027PO3\u0027, \u0027Gamma\u0027, [{\u0027sku\u0027: \u0027Y\u0027, \u0027qty\u0027: 2, \u0027unit_cost\u0027: 7.0}])\nfor bad_lines in ([{\u0027sku\u0027: \u0027Z\u0027, \u0027accepted\u0027: 1}], [{\u0027sku\u0027: \u0027Y\u0027, \u0027accepted\u0027: -1}]):\n before3 = book3.snapshot()\n try:\n book3.receive(\u0027PO3\u0027, \u0027BADID\u0027, bad_lines, timestamp=3)\n assert False\n except ValueError:\n pass\n assert book3.snapshot() == before3\nassert book3.receive(\u0027PO3\u0027, \u0027BADID\u0027, [{\u0027sku\u0027: \u0027Y\u0027, \u0027accepted\u0027: 2}], timestamp=4)[\u0027order_status\u0027] == \u0027closed\u0027\n","category":"code_purpose_understanding"} {"id":"5","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Subscription:\n VALID_TRANSITIONS = {\n \u0027pending\u0027: [\u0027active\u0027],\n \u0027active\u0027: [\u0027paused\u0027, \u0027cancelled\u0027, \u0027active\u0027],\n \u0027paused\u0027: [\u0027active\u0027, \u0027cancelled\u0027],\n \u0027cancelled\u0027: []\n }\n\n def __init__(self, user_id, plan, plan_price, total_days):\n self.user_id = user_id\n self.plan = plan\n self.plan_price = plan_price\n self.total_days = total_days\n self.state = \u0027pending\u0027\n self.days_used = 0\n self.audit_log = []\n self.balance_due = 0.0\n\n def _transition(self, new_state, timestamp):\n if new_state not in self.VALID_TRANSITIONS[self.state]:\n raise ValueError(f\"Cannot transition from {self.state} to {new_state}\")\n old_state = self.state\n self.state = new_state\n self.audit_log.append({\u0027from\u0027: old_state, \u0027to\u0027: new_state, \u0027ts\u0027: timestamp})\n\n def activate(self, timestamp):\n self._transition(\u0027active\u0027, timestamp)\n\n def pause(self, timestamp):\n self._transition(\u0027paused\u0027, timestamp)\n\n def use_days(self, n):\n self.days_used += n\n\n def _compute_proration(self, price):\n remaining = self.total_days - self.days_used\n return (remaining / self.total_days) * price\n\n","golden_completion":" def upgrade(self, new_plan, new_price, timestamp):\n if self.state not in (\u0027active\u0027, \u0027paused\u0027):\n raise ValueError(\"Can only upgrade active or paused subscriptions\")\n credit = self._compute_proration(self.plan_price)\n cost = self._compute_proration(new_price)\n self.balance_due = round(cost - credit, 2)\n old_plan = self.plan\n self.plan = new_plan\n self.plan_price = new_price\n if self.state == \u0027paused\u0027:\n self._transition(\u0027active\u0027, timestamp)\n self.audit_log.append({\u0027action\u0027: \u0027upgrade\u0027, \u0027from_plan\u0027: old_plan, \u0027to_plan\u0027: new_plan, \u0027ts\u0027: timestamp})\n","suffix":"\nsub = Subscription(\u0027u1\u0027, \u0027basic\u0027, 100.0, 30)\nsub.activate(1)\nsub.use_days(10)\nsub.upgrade(\u0027pro\u0027, 150.0, 2)\nassert sub.plan == \u0027pro\u0027\nassert sub.state == \u0027active\u0027\nremaining_frac = 20/30\nexpected_due = round(remaining_frac * 150.0 - remaining_frac * 100.0, 2)\nassert sub.balance_due == expected_due\nassert any(e.get(\u0027action\u0027) == \u0027upgrade\u0027 for e in sub.audit_log)\n","assertions":"\n# Upgrade from paused goes to active\nsub2 = Subscription(\u0027u2\u0027, \u0027basic\u0027, 100.0, 30)\nsub2.activate(1)\nsub2.use_days(15)\nsub2.pause(2)\nsub2.upgrade(\u0027pro\u0027, 200.0, 3)\nassert sub2.state == \u0027active\u0027\nassert sub2.plan == \u0027pro\u0027\nremaining_frac2 = 15/30\nexpected2 = round(remaining_frac2 * 200.0 - remaining_frac2 * 100.0, 2)\nassert sub2.balance_due == expected2\n\n# Cannot upgrade cancelled\nsub3 = Subscription(\u0027u3\u0027, \u0027basic\u0027, 100.0, 30)\nsub3.activate(1)\nsub3._transition(\u0027cancelled\u0027, 2)\ntry:\n sub3.upgrade(\u0027pro\u0027, 200.0, 3)\n assert False, \"Should not upgrade cancelled\"\nexcept ValueError:\n pass\n\n# Cannot upgrade pending\nsub4 = Subscription(\u0027u4\u0027, \u0027basic\u0027, 100.0, 30)\ntry:\n sub4.upgrade(\u0027pro\u0027, 200.0, 1)\n assert False, \"Should not upgrade pending\"\nexcept ValueError:\n pass\n","category":"code_purpose_understanding"} {"id":"6","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class CardStatement:\n \"\"\"Credit-card statement ledger with a nonstandard payment waterfall.\n apply_payment is idempotent by payment_id and validates amount before any\n mutation. Payments allocate in this exact order: fees, interest, cash advance,\n then purchases. Applied payment releases available credit up to the credit\n limit; remaining money becomes overpayment and does not increase available\n credit beyond the limit. A delinquent account returns to current only when\n all balances are paid. Successful payments are saved and audited.\"\"\"\n\n WATERFALL = (\u0027fees\u0027, \u0027interest\u0027, \u0027cash_advance\u0027, \u0027purchases\u0027)\n\n def __init__(self, credit_limit):\n self.credit_limit = float(credit_limit)\n self.available_credit = float(credit_limit)\n self.balances = {\u0027fees\u0027: 0.0, \u0027interest\u0027: 0.0, \u0027cash_advance\u0027: 0.0, \u0027purchases\u0027: 0.0}\n self.status = \u0027current\u0027\n self.payments = {}\n self.audit = []\n self.overpayment = 0.0\n\n def add_balance(self, kind, amount):\n if kind not in self.balances:\n raise ValueError(\u0027unknown balance kind\u0027)\n amount = float(amount)\n self.balances[kind] = round(self.balances[kind] + amount, 2)\n self.available_credit = round(max(0.0, self.available_credit - amount), 2)\n\n def mark_delinquent(self):\n self.status = \u0027delinquent\u0027\n\n def total_balance(self):\n return round(sum(self.balances.values()), 2)\n\n def snapshot(self):\n return {\n \u0027available_credit\u0027: self.available_credit, \u0027balances\u0027: dict(self.balances),\n \u0027status\u0027: self.status, \u0027payments\u0027: dict(self.payments),\n \u0027audit\u0027: list(self.audit), \u0027overpayment\u0027: self.overpayment,\n }\n\n","golden_completion":" def apply_payment(self, payment_id, amount, timestamp):\n if payment_id in self.payments:\n return dict(self.payments[payment_id])\n amount = float(amount)\n if amount \u003c= 0:\n raise ValueError(\"payment amount must be positive\")\n\n remaining = amount\n allocations = {}\n applied = 0.0\n for kind in self.WATERFALL:\n due = self.balances[kind]\n paid = min(due, remaining)\n paid = round(paid, 2)\n allocations[kind] = paid\n self.balances[kind] = round(due - paid, 2)\n remaining = round(remaining - paid, 2)\n applied = round(applied + paid, 2)\n\n over = round(remaining, 2)\n self.overpayment = round(self.overpayment + over, 2)\n self.available_credit = round(min(self.credit_limit, self.available_credit + applied), 2)\n if self.status == \u0027delinquent\u0027 and self.total_balance() == 0.0:\n self.status = \u0027current\u0027\n\n result = {\n \u0027payment_id\u0027: payment_id, \u0027applied\u0027: applied, \u0027overpayment\u0027: over,\n \u0027allocations\u0027: allocations, \u0027status\u0027: self.status,\n \u0027available_credit\u0027: self.available_credit,\n }\n self.payments[payment_id] = dict(result)\n self.audit.append({\u0027payment_id\u0027: payment_id, \u0027ts\u0027: timestamp, \u0027applied\u0027: applied, \u0027overpayment\u0027: over})\n return dict(result)\n","suffix":"\nstmt = CardStatement(1000)\nstmt.add_balance(\u0027purchases\u0027, 300)\nstmt.add_balance(\u0027cash_advance\u0027, 100)\nstmt.add_balance(\u0027interest\u0027, 20)\nstmt.add_balance(\u0027fees\u0027, 30)\nstmt.mark_delinquent()\nres = stmt.apply_payment(\u0027p1\u0027, 175, timestamp=10)\nassert res[\u0027allocations\u0027] == {\u0027fees\u0027: 30.0, \u0027interest\u0027: 20.0, \u0027cash_advance\u0027: 100.0, \u0027purchases\u0027: 25.0}\nassert res[\u0027applied\u0027] == 175.0\nassert res[\u0027overpayment\u0027] == 0.0\nassert stmt.balances == {\u0027fees\u0027: 0.0, \u0027interest\u0027: 0.0, \u0027cash_advance\u0027: 0.0, \u0027purchases\u0027: 275.0}\nassert stmt.available_credit == 725.0\nassert stmt.status == \u0027delinquent\u0027\nassert len(stmt.audit) == 1\n\nrepeat = stmt.apply_payment(\u0027p1\u0027, 999, timestamp=99)\nassert repeat == res\nassert len(stmt.audit) == 1\nassert stmt.available_credit == 725.0\n\nres2 = stmt.apply_payment(\u0027p2\u0027, 400, timestamp=20)\nassert res2[\u0027allocations\u0027][\u0027purchases\u0027] == 275.0\nassert res2[\u0027applied\u0027] == 275.0\nassert res2[\u0027overpayment\u0027] == 125.0\nassert stmt.overpayment == 125.0\nassert stmt.available_credit == 1000.0\nassert stmt.status == \u0027current\u0027\n\nbefore = stmt.snapshot()\ntry:\n stmt.apply_payment(\u0027bad\u0027, 0, timestamp=30)\n assert False, \u0027zero payment should fail\u0027\nexcept ValueError:\n pass\nassert stmt.snapshot() == before\n","assertions":"\n# Fees and interest are paid before principal balances, and failed ids can be reused.\nstmt2 = CardStatement(500)\nstmt2.add_balance(\u0027purchases\u0027, 100)\nstmt2.add_balance(\u0027interest\u0027, 50)\ntry:\n stmt2.apply_payment(\u0027reuse\u0027, -5, timestamp=1)\n assert False\nexcept ValueError:\n pass\nassert \u0027reuse\u0027 not in stmt2.payments\nres = stmt2.apply_payment(\u0027reuse\u0027, 60, timestamp=2)\nassert res[\u0027allocations\u0027] == {\u0027fees\u0027: 0.0, \u0027interest\u0027: 50.0, \u0027cash_advance\u0027: 0.0, \u0027purchases\u0027: 10.0}\nassert stmt2.balances[\u0027purchases\u0027] == 90.0\nassert stmt2.available_credit == 410.0\n\n# Available credit is capped at the limit even when overpayment exists.\nstmt3 = CardStatement(200)\nstmt3.add_balance(\u0027fees\u0027, 10)\nstmt3.add_balance(\u0027purchases\u0027, 20)\nres3 = stmt3.apply_payment(\u0027big\u0027, 100, timestamp=3)\nassert res3[\u0027applied\u0027] == 30.0\nassert res3[\u0027overpayment\u0027] == 70.0\nassert stmt3.available_credit == 200.0\nassert stmt3.overpayment == 70.0\n\n# Partial payment on delinquent account does not restore current status.\nstmt4 = CardStatement(300)\nstmt4.add_balance(\u0027cash_advance\u0027, 80)\nstmt4.mark_delinquent()\nstmt4.apply_payment(\u0027small\u0027, 25, timestamp=4)\nassert stmt4.status == \u0027delinquent\u0027\nstmt4.apply_payment(\u0027finish\u0027, 55, timestamp=5)\nassert stmt4.status == \u0027current\u0027\n","category":"code_purpose_understanding"} {"id":"7","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class TaxCalculator:\n def __init__(self, brackets, std_deduction, phase_out_start):\n self.brackets = brackets # [(upper_limit, rate), ...], last has None\n self.std_deduction = std_deduction\n self.phase_out_start = phase_out_start\n\n def compute_tax(self, income):\n tax = 0.0\n prev_limit = 0\n for upper, rate in self.brackets:\n if income \u003c= prev_limit:\n break\n if upper is None:\n tax += (income - prev_limit) * rate\n break\n taxable = min(income, upper) - prev_limit\n tax += taxable * rate\n prev_limit = upper\n return round(tax, 2)\n\n","golden_completion":" def adjusted_deduction(self, gross_income):\n if gross_income \u003c= self.phase_out_start:\n return self.std_deduction\n excess = gross_income - self.phase_out_start\n reduction = (excess // 1000) * 100\n return max(self.std_deduction - reduction, 0)\n\n def tax_owed(self, gross_income):\n deduction = self.adjusted_deduction(gross_income)\n taxable = max(gross_income - deduction, 0)\n return self.compute_tax(taxable)\n","suffix":"\ncalc = TaxCalculator([(50000, 0.10), (None, 0.20)], std_deduction=12000, phase_out_start=80000)\n\n# Below phase-out: full deduction\nassert calc.adjusted_deduction(50000) == 12000\nassert calc.tax_owed(50000) == calc.compute_tax(38000)\n\n# At phase-out start: full deduction\nassert calc.adjusted_deduction(80000) == 12000\n\n# Above phase-out: reduced deduction\nassert calc.adjusted_deduction(90000) == 11000 # 10 * $100 reduction\nassert calc.adjusted_deduction(200000) == 0 # fully phased out\n\n# Tax with phase-out\nassert calc.tax_owed(90000) == calc.compute_tax(79000)\n","assertions":"\ncalc2 = TaxCalculator([(50000, 0.10), (None, 0.20)], std_deduction=12000, phase_out_start=80000)\n# Exactly at full phase-out\nassert calc2.adjusted_deduction(200000) == 0\nassert calc2.tax_owed(200000) == calc2.compute_tax(200000)\n\n# Just over phase-out by $500 (less than $1000, so no reduction yet)\nassert calc2.adjusted_deduction(80500) == 12000\n\n# Just over by $1000 exactly\nassert calc2.adjusted_deduction(81000) == 11900\n\n# Income less than deduction\ncalc3 = TaxCalculator([(50000, 0.10), (None, 0.20)], std_deduction=20000, phase_out_start=80000)\nassert calc3.tax_owed(5000) == 0.0\n","category":"code_purpose_understanding"} {"id":"8","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class MarketplaceSettlement:\n \"\"\"Settles captured marketplace orders to sellers.\n settle_order is idempotent by settlement_id. It validates the order exists,\n is captured, is not disputed, and has a delivery timestamp on or after the\n capture timestamp before mutating anything. Commission is charged on item\n subtotal only, reserve is withheld from subtotal only, and shipping passes\n through to the seller. Existing seller adjustment balances reduce payout\n after commission and reserve. Successful settlements update seller payable,\n seller reserve, platform fees, reserve liability, order state, saved result,\n and audit log.\"\"\"\n\n def __init__(self, commission_rate=0.10, reserve_rate=0.05):\n self.commission_rate = commission_rate\n self.reserve_rate = reserve_rate\n self.sellers = {}\n self.orders = {}\n self.settlements = {}\n self.audit = []\n self.platform_fees = 0.0\n self.reserve_liability = 0.0\n\n def add_seller(self, seller_id, adjustment_balance=0.0):\n self.sellers[seller_id] = {\n \u0027adjustment_balance\u0027: float(adjustment_balance),\n \u0027payable\u0027: 0.0, \u0027reserve\u0027: 0.0, \u0027settled_count\u0027: 0,\n }\n\n def capture_order(self, order_id, seller_id, subtotal, shipping, captured_at, disputed=False):\n self.orders[order_id] = {\n \u0027seller_id\u0027: seller_id, \u0027subtotal\u0027: float(subtotal), \u0027shipping\u0027: float(shipping),\n \u0027captured_at\u0027: captured_at, \u0027disputed\u0027: disputed, \u0027state\u0027: \u0027captured\u0027,\n }\n\n def snapshot(self):\n return {\n \u0027sellers\u0027: {k: dict(v) for k, v in self.sellers.items()},\n \u0027orders\u0027: {k: dict(v) for k, v in self.orders.items()},\n \u0027settlements\u0027: dict(self.settlements), \u0027audit\u0027: list(self.audit),\n \u0027platform_fees\u0027: self.platform_fees, \u0027reserve_liability\u0027: self.reserve_liability,\n }\n\n","golden_completion":" def settle_order(self, settlement_id, order_id, delivered_at):\n if settlement_id in self.settlements:\n return dict(self.settlements[settlement_id])\n if order_id not in self.orders:\n raise ValueError(\"unknown order\")\n order = self.orders[order_id]\n if order[\u0027seller_id\u0027] not in self.sellers:\n raise ValueError(\"unknown seller\")\n if order[\u0027state\u0027] != \u0027captured\u0027:\n raise ValueError(\"order is not captured\")\n if order[\u0027disputed\u0027]:\n raise ValueError(\"disputed order cannot settle\")\n if delivered_at \u003c order[\u0027captured_at\u0027]:\n raise ValueError(\"delivery precedes capture\")\n\n seller = self.sellers[order[\u0027seller_id\u0027]]\n subtotal = order[\u0027subtotal\u0027]\n shipping = order[\u0027shipping\u0027]\n gross = round(subtotal + shipping, 2)\n commission = round(subtotal * self.commission_rate, 2)\n reserve = round(subtotal * self.reserve_rate, 2)\n before_adjustment = round(gross - commission - reserve, 2)\n adjustment = round(min(seller[\u0027adjustment_balance\u0027], before_adjustment), 2)\n payout = round(before_adjustment - adjustment, 2)\n\n seller[\u0027adjustment_balance\u0027] = round(seller[\u0027adjustment_balance\u0027] - adjustment, 2)\n seller[\u0027payable\u0027] = round(seller[\u0027payable\u0027] + payout, 2)\n seller[\u0027reserve\u0027] = round(seller[\u0027reserve\u0027] + reserve, 2)\n seller[\u0027settled_count\u0027] += 1\n self.platform_fees = round(self.platform_fees + commission, 2)\n self.reserve_liability = round(self.reserve_liability + reserve, 2)\n order[\u0027state\u0027] = \u0027settled\u0027\n\n result = {\n \u0027settlement_id\u0027: settlement_id, \u0027order_id\u0027: order_id,\n \u0027gross\u0027: gross, \u0027commission\u0027: commission, \u0027reserve\u0027: reserve,\n \u0027adjustment\u0027: adjustment, \u0027payout\u0027: payout, \u0027seller_id\u0027: order[\u0027seller_id\u0027],\n }\n self.settlements[settlement_id] = dict(result)\n self.audit.append({\u0027settlement_id\u0027: settlement_id, \u0027order_id\u0027: order_id, \u0027payout\u0027: payout, \u0027delivered_at\u0027: delivered_at})\n return dict(result)\n","suffix":"\nms = MarketplaceSettlement(commission_rate=0.10, reserve_rate=0.05)\nms.add_seller(\u0027s1\u0027, adjustment_balance=20)\nms.capture_order(\u0027o1\u0027, \u0027s1\u0027, subtotal=100, shipping=10, captured_at=50)\nres = ms.settle_order(\u0027st1\u0027, \u0027o1\u0027, delivered_at=60)\nassert res == {\n \u0027settlement_id\u0027: \u0027st1\u0027, \u0027order_id\u0027: \u0027o1\u0027, \u0027gross\u0027: 110.0,\n \u0027commission\u0027: 10.0, \u0027reserve\u0027: 5.0, \u0027adjustment\u0027: 20.0,\n \u0027payout\u0027: 75.0, \u0027seller_id\u0027: \u0027s1\u0027,\n}\nassert ms.sellers[\u0027s1\u0027][\u0027payable\u0027] == 75.0\nassert ms.sellers[\u0027s1\u0027][\u0027reserve\u0027] == 5.0\nassert ms.sellers[\u0027s1\u0027][\u0027adjustment_balance\u0027] == 0.0\nassert ms.sellers[\u0027s1\u0027][\u0027settled_count\u0027] == 1\nassert ms.platform_fees == 10.0\nassert ms.reserve_liability == 5.0\nassert ms.orders[\u0027o1\u0027][\u0027state\u0027] == \u0027settled\u0027\nassert len(ms.audit) == 1\n\nrepeat = ms.settle_order(\u0027st1\u0027, \u0027o1\u0027, delivered_at=999)\nassert repeat == res\nassert len(ms.audit) == 1\nassert ms.sellers[\u0027s1\u0027][\u0027payable\u0027] == 75.0\n\nms.capture_order(\u0027bad\u0027, \u0027s1\u0027, subtotal=50, shipping=0, captured_at=70, disputed=True)\nbefore = ms.snapshot()\ntry:\n ms.settle_order(\u0027st-bad\u0027, \u0027bad\u0027, delivered_at=80)\n assert False, \u0027disputed order should not settle\u0027\nexcept ValueError:\n pass\nassert ms.snapshot() == before\n","assertions":"\n# Adjustment larger than payout leaves a remaining adjustment and zero payout.\nms2 = MarketplaceSettlement(commission_rate=0.20, reserve_rate=0.10)\nms2.add_seller(\u0027s2\u0027, adjustment_balance=500)\nms2.capture_order(\u0027o2\u0027, \u0027s2\u0027, subtotal=100, shipping=20, captured_at=10)\nr2 = ms2.settle_order(\u0027st2\u0027, \u0027o2\u0027, delivered_at=10)\nassert r2[\u0027gross\u0027] == 120.0\nassert r2[\u0027commission\u0027] == 20.0\nassert r2[\u0027reserve\u0027] == 10.0\nassert r2[\u0027adjustment\u0027] == 90.0\nassert r2[\u0027payout\u0027] == 0.0\nassert ms2.sellers[\u0027s2\u0027][\u0027adjustment_balance\u0027] == 410.0\nassert ms2.sellers[\u0027s2\u0027][\u0027reserve\u0027] == 10.0\nassert ms2.platform_fees == 20.0\n\n# Delivery before capture and already-settled orders fail atomically and do not reserve settlement ids.\nms3 = MarketplaceSettlement()\nms3.add_seller(\u0027s3\u0027)\nms3.capture_order(\u0027o3\u0027, \u0027s3\u0027, 200, 5, captured_at=100)\nbefore3 = ms3.snapshot()\ntry:\n ms3.settle_order(\u0027early\u0027, \u0027o3\u0027, delivered_at=99)\n assert False\nexcept ValueError:\n pass\nassert ms3.snapshot() == before3\nassert \u0027early\u0027 not in ms3.settlements\nms3.settle_order(\u0027ok\u0027, \u0027o3\u0027, delivered_at=100)\ntry:\n ms3.settle_order(\u0027again\u0027, \u0027o3\u0027, delivered_at=101)\n assert False, \u0027settled order should not settle under a new settlement id\u0027\nexcept ValueError:\n pass\nassert \u0027again\u0027 not in ms3.settlements\n","category":"code_purpose_understanding"} {"id":"9","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class WarrantyClaimLedger:\n \"\"\"Approves appliance warranty repair claims.\n approve_repair is idempotent by approval_id. It validates the claim, labor,\n and all requested parts before mutating anything. Covered parts plus labor\n form the eligible amount. Uncovered parts and expedited fees are customer\n responsibility. Deductible is applied before warranty coverage, then warranty\n payment is capped by remaining coverage. Successful approvals update coverage\n and deductible balances, vendor payables, claim status, saved approval, and\n audit log.\"\"\"\n\n def __init__(self, coverage_remaining, deductible_remaining, labor_rate=80):\n self.coverage_remaining = float(coverage_remaining)\n self.deductible_remaining = float(deductible_remaining)\n self.labor_rate = float(labor_rate)\n self.parts_catalog = {}\n self.claims = {}\n self.approvals = {}\n self.vendor_payables = {}\n self.audit = []\n self.reserve_used = 0.0\n\n def add_part(self, part_no, price, covered=True):\n self.parts_catalog[part_no] = {\u0027price\u0027: float(price), \u0027covered\u0027: covered}\n\n def open_claim(self, claim_id, serial_no):\n self.claims[claim_id] = {\u0027serial_no\u0027: serial_no, \u0027status\u0027: \u0027open\u0027}\n\n def snapshot(self):\n return {\n \u0027coverage_remaining\u0027: self.coverage_remaining,\n \u0027deductible_remaining\u0027: self.deductible_remaining,\n \u0027claims\u0027: {k: dict(v) for k, v in self.claims.items()},\n \u0027approvals\u0027: dict(self.approvals),\n \u0027vendor_payables\u0027: dict(self.vendor_payables),\n \u0027audit\u0027: list(self.audit), \u0027reserve_used\u0027: self.reserve_used,\n }\n\n","golden_completion":" def approve_repair(self, approval_id, claim_id, part_lines, labor_hours, vendor, expedited=False):\n if approval_id in self.approvals:\n return dict(self.approvals[approval_id])\n if claim_id not in self.claims:\n raise ValueError(\"unknown claim\")\n claim = self.claims[claim_id]\n if claim[\u0027status\u0027] != \u0027open\u0027:\n raise ValueError(\"claim is not open\")\n labor_hours = float(labor_hours)\n if labor_hours \u003c 0:\n raise ValueError(\"negative labor hours\")\n\n covered_parts = 0.0\n uncovered_parts = 0.0\n for line in part_lines:\n part_no = line[\u0027part_no\u0027]\n qty = int(line.get(\u0027qty\u0027, 0))\n if qty \u003c 0:\n raise ValueError(\"negative part quantity\")\n if part_no not in self.parts_catalog:\n raise ValueError(\"unknown part\")\n part = self.parts_catalog[part_no]\n amount = qty * part[\u0027price\u0027]\n if part[\u0027covered\u0027]:\n covered_parts += amount\n else:\n uncovered_parts += amount\n\n labor = labor_hours * self.labor_rate\n expedited_fee = 35.0 if expedited else 0.0\n eligible = round(covered_parts + labor, 2)\n deductible = round(min(self.deductible_remaining, eligible), 2)\n after_deductible = round(eligible - deductible, 2)\n warranty_pay = round(min(self.coverage_remaining, after_deductible), 2)\n excess = round(after_deductible - warranty_pay, 2)\n customer_due = round(uncovered_parts + expedited_fee + deductible + excess, 2)\n vendor_payable = round(eligible + uncovered_parts + expedited_fee, 2)\n\n self.deductible_remaining = round(self.deductible_remaining - deductible, 2)\n self.coverage_remaining = round(self.coverage_remaining - warranty_pay, 2)\n self.reserve_used = round(self.reserve_used + warranty_pay, 2)\n self.vendor_payables[vendor] = round(self.vendor_payables.get(vendor, 0.0) + vendor_payable, 2)\n claim[\u0027status\u0027] = \u0027approved\u0027\n\n result = {\n \u0027approval_id\u0027: approval_id, \u0027claim_id\u0027: claim_id, \u0027vendor\u0027: vendor,\n \u0027eligible\u0027: eligible, \u0027deductible\u0027: deductible, \u0027warranty_pay\u0027: warranty_pay,\n \u0027customer_due\u0027: customer_due, \u0027vendor_payable\u0027: vendor_payable,\n }\n self.approvals[approval_id] = dict(result)\n self.audit.append({\u0027approval_id\u0027: approval_id, \u0027claim_id\u0027: claim_id, \u0027warranty_pay\u0027: warranty_pay, \u0027customer_due\u0027: customer_due})\n return dict(result)\n","suffix":"\nledger = WarrantyClaimLedger(coverage_remaining=500, deductible_remaining=100, labor_rate=80)\nledger.add_part(\u0027PUMP\u0027, 50, covered=True)\nledger.add_part(\u0027KNOB\u0027, 30, covered=False)\nledger.open_claim(\u0027c1\u0027, \u0027SN1\u0027)\nres = ledger.approve_repair(\u0027a1\u0027, \u0027c1\u0027, [\n {\u0027part_no\u0027: \u0027PUMP\u0027, \u0027qty\u0027: 2},\n {\u0027part_no\u0027: \u0027KNOB\u0027, \u0027qty\u0027: 1},\n], labor_hours=2, vendor=\u0027repairco\u0027, expedited=True)\nassert res == {\n \u0027approval_id\u0027: \u0027a1\u0027, \u0027claim_id\u0027: \u0027c1\u0027, \u0027vendor\u0027: \u0027repairco\u0027,\n \u0027eligible\u0027: 260.0, \u0027deductible\u0027: 100.0, \u0027warranty_pay\u0027: 160.0,\n \u0027customer_due\u0027: 165.0, \u0027vendor_payable\u0027: 325.0,\n}\nassert ledger.coverage_remaining == 340.0\nassert ledger.deductible_remaining == 0.0\nassert ledger.reserve_used == 160.0\nassert ledger.vendor_payables[\u0027repairco\u0027] == 325.0\nassert ledger.claims[\u0027c1\u0027][\u0027status\u0027] == \u0027approved\u0027\nassert len(ledger.audit) == 1\n\nrepeat = ledger.approve_repair(\u0027a1\u0027, \u0027c1\u0027, [], labor_hours=0, vendor=\u0027other\u0027)\nassert repeat == res\nassert len(ledger.audit) == 1\nassert ledger.vendor_payables[\u0027repairco\u0027] == 325.0\n\nbefore = ledger.snapshot()\ntry:\n ledger.approve_repair(\u0027bad\u0027, \u0027c1\u0027, [], labor_hours=1, vendor=\u0027repairco\u0027)\n assert False, \u0027approved claim should not be approved again with a new id\u0027\nexcept ValueError:\n pass\nassert ledger.snapshot() == before\n","assertions":"\n# Coverage cap creates customer excess after deductible.\nledger2 = WarrantyClaimLedger(coverage_remaining=50, deductible_remaining=20, labor_rate=100)\nledger2.add_part(\u0027MOTOR\u0027, 100, covered=True)\nledger2.open_claim(\u0027c2\u0027, \u0027SN2\u0027)\nr2 = ledger2.approve_repair(\u0027a2\u0027, \u0027c2\u0027, [{\u0027part_no\u0027: \u0027MOTOR\u0027, \u0027qty\u0027: 1}], labor_hours=1, vendor=\u0027v2\u0027)\nassert r2[\u0027eligible\u0027] == 200.0\nassert r2[\u0027deductible\u0027] == 20.0\nassert r2[\u0027warranty_pay\u0027] == 50.0\nassert r2[\u0027customer_due\u0027] == 150.0\nassert ledger2.coverage_remaining == 0.0\nassert ledger2.deductible_remaining == 0.0\nassert ledger2.reserve_used == 50.0\nassert ledger2.vendor_payables[\u0027v2\u0027] == 200.0\n\n# Validation is atomic and failed approval ids are not reserved.\nledger3 = WarrantyClaimLedger(coverage_remaining=100, deductible_remaining=10)\nledger3.add_part(\u0027OK\u0027, 25, covered=True)\nledger3.open_claim(\u0027c3\u0027, \u0027SN3\u0027)\nfor bad_lines in ([{\u0027part_no\u0027: \u0027MISSING\u0027, \u0027qty\u0027: 1}], [{\u0027part_no\u0027: \u0027OK\u0027, \u0027qty\u0027: -1}]):\n before3 = ledger3.snapshot()\n try:\n ledger3.approve_repair(\u0027bad-id\u0027, \u0027c3\u0027, bad_lines, labor_hours=0, vendor=\u0027v3\u0027)\n assert False\n except ValueError:\n pass\n assert ledger3.snapshot() == before3\nassert \u0027bad-id\u0027 not in ledger3.approvals\nassert ledger3.approve_repair(\u0027bad-id\u0027, \u0027c3\u0027, [{\u0027part_no\u0027: \u0027OK\u0027, \u0027qty\u0027: 1}], labor_hours=0, vendor=\u0027v3\u0027)[\u0027approval_id\u0027] == \u0027bad-id\u0027\n","category":"code_purpose_understanding"} {"id":"10","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Amortizer:\n \"\"\"Generates an amortization schedule. Each month:\n - interest = balance * monthly_rate (rounded to 2 decimals)\n - For months 1..N-1: payment is fixed, principal = payment - interest\n - For month N (last): principal = remaining balance, payment = principal + interest\n This ensures final balance is exactly 0 despite rounding.\n Returns list of dicts with keys: month, payment, interest, principal, balance.\"\"\"\n\n def __init__(self, principal, annual_rate, num_payments):\n self.principal = principal\n self.annual_rate = annual_rate\n self.num_payments = num_payments\n self.monthly_rate = annual_rate / 12\n\n def monthly_payment(self):\n r = self.monthly_rate\n n = self.num_payments\n if r == 0:\n return round(self.principal / n, 2)\n payment = self.principal * (r * (1 + r) ** n) / ((1 + r) ** n - 1)\n return round(payment, 2)\n\n","golden_completion":" def schedule(self):\n payment = self.monthly_payment()\n balance = self.principal\n result = []\n for i in range(1, self.num_payments + 1):\n interest = round(balance * self.monthly_rate, 2)\n is_last = (i == self.num_payments)\n princ = balance if is_last else payment - interest\n pmt = princ + interest if is_last else payment\n balance = round(balance - princ, 2)\n result.append({\u0027month\u0027: i, \u0027payment\u0027: round(pmt, 2), \u0027interest\u0027: interest, \u0027principal\u0027: round(princ, 2), \u0027balance\u0027: balance})\n return result\n","suffix":"\nam = Amortizer(10000, 0.06, 12)\nsched = am.schedule()\n\nassert len(sched) == 12\nassert sched[0][\u0027month\u0027] == 1\nassert sched[-1][\u0027balance\u0027] == 0.0\nassert sched[-1][\u0027month\u0027] == 12\n\n# All non-last payments should be the same\npayments = [s[\u0027payment\u0027] for s in sched[:-1]]\nassert len(set(payments)) == 1\n\n# Each row: payment = interest + principal\nfor row in sched:\n assert row[\u0027payment\u0027] == round(row[\u0027interest\u0027] + row[\u0027principal\u0027], 2)\n","assertions":"\n# Zero interest rate\nam2 = Amortizer(1200, 0.0, 12)\nsched2 = am2.schedule()\nassert sched2[-1][\u0027balance\u0027] == 0.0\nfor row in sched2:\n assert row[\u0027interest\u0027] == 0.0\n assert row[\u0027payment\u0027] == 100.0\n\n# Large loan\nam3 = Amortizer(500000, 0.05, 360)\nsched3 = am3.schedule()\nassert sched3[-1][\u0027balance\u0027] == 0.0\nassert len(sched3) == 360\n\n# Balance should decrease monotonically\nfor i in range(1, len(sched3)):\n assert sched3[i][\u0027balance\u0027] \u003c= sched3[i-1][\u0027balance\u0027]\n","category":"code_purpose_understanding"} {"id":"11","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Inventory:\n \"\"\"Batch-tracked inventory system.\n Each stock addition creates a new batch with a unique sequential ID\n (format B0001, B0002, ...), quantity, and expiry date.\n Items are stored as name -\u003e list of batch dicts.\n add_stock must return the generated batch_id.\"\"\"\n\n def __init__(self):\n self.items = {} # name -\u003e list of {\u0027qty\u0027: int, \u0027expiry\u0027: int, \u0027batch_id\u0027: str}\n self._batch_counter = 0\n\n def _next_batch_id(self):\n self._batch_counter += 1\n return f\"B{self._batch_counter:04d}\"\n\n def total_quantity(self, name):\n if name not in self.items:\n return 0\n return sum(b[\u0027qty\u0027] for b in self.items[name])\n\n","golden_completion":" def add_stock(self, name, qty, expiry):\n batch_id = self._next_batch_id()\n batch = {\u0027qty\u0027: qty, \u0027expiry\u0027: expiry, \u0027batch_id\u0027: batch_id}\n if name not in self.items:\n self.items[name] = []\n self.items[name].append(batch)\n return batch_id\n","suffix":"\ninv = Inventory()\nb1 = inv.add_stock(\u0027aspirin\u0027, 100, 20251231)\nb2 = inv.add_stock(\u0027aspirin\u0027, 50, 20260630)\nb3 = inv.add_stock(\u0027ibuprofen\u0027, 200, 20251130)\n\nassert inv.total_quantity(\u0027aspirin\u0027) == 150\nassert inv.total_quantity(\u0027ibuprofen\u0027) == 200\nassert b1 == \u0027B0001\u0027\nassert b2 == \u0027B0002\u0027\nassert b3 == \u0027B0003\u0027\nassert len(inv.items[\u0027aspirin\u0027]) == 2\n","assertions":"\ninv2 = Inventory()\nbid = inv2.add_stock(\u0027bandage\u0027, 10, 20301231)\nassert bid == \u0027B0001\u0027\nassert inv2.total_quantity(\u0027bandage\u0027) == 10\nassert inv2.items[\u0027bandage\u0027][0][\u0027expiry\u0027] == 20301231\n\n# Adding to same item\ninv2.add_stock(\u0027bandage\u0027, 5, 20290101)\nassert inv2.total_quantity(\u0027bandage\u0027) == 15\nassert len(inv2.items[\u0027bandage\u0027]) == 2\n\n# Unknown item\nassert inv2.total_quantity(\u0027unknown\u0027) == 0\n","category":"code_purpose_understanding"} {"id":"12","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Inventory:\n def __init__(self):\n self.items = {} # name -\u003e list of {\u0027qty\u0027: int, \u0027expiry\u0027: int, \u0027batch_id\u0027: str}\n self._batch_counter = 0\n\n def _next_batch_id(self):\n self._batch_counter += 1\n return f\"B{self._batch_counter:04d}\"\n\n def add_stock(self, name, qty, expiry):\n batch_id = self._next_batch_id()\n batch = {\u0027qty\u0027: qty, \u0027expiry\u0027: expiry, \u0027batch_id\u0027: batch_id}\n if name not in self.items:\n self.items[name] = []\n self.items[name].append(batch)\n return batch_id\n\n def total_quantity(self, name):\n if name not in self.items:\n return 0\n return sum(b[\u0027qty\u0027] for b in self.items[name])\n\n","golden_completion":" def remove_stock_fifo(self, name, qty):\n if self.total_quantity(name) \u003c qty:\n raise ValueError(\"Insufficient stock\")\n rem = qty\n while rem \u003e 0:\n take = min(self.items[name][0][\u0027qty\u0027], rem)\n self.items[name][0][\u0027qty\u0027] -= take\n rem -= take\n if self.items[name][0][\u0027qty\u0027] == 0:\n self.items[name].pop(0)\n if name in self.items and not self.items[name]:\n del self.items[name]\n","suffix":"\ninv = Inventory()\ninv.add_stock(\u0027widget\u0027, 10, 20250101)\ninv.add_stock(\u0027widget\u0027, 20, 20260101)\ninv.add_stock(\u0027widget\u0027, 5, 20270101)\n\ninv.remove_stock_fifo(\u0027widget\u0027, 15)\nassert inv.total_quantity(\u0027widget\u0027) == 20\n# First batch fully consumed, second partially\nassert inv.items[\u0027widget\u0027][0][\u0027qty\u0027] == 15\nassert inv.items[\u0027widget\u0027][0][\u0027expiry\u0027] == 20260101\n","assertions":"\ninv2 = Inventory()\ninv2.add_stock(\u0027nail\u0027, 5, 20250101)\ninv2.add_stock(\u0027nail\u0027, 5, 20260101)\n\n# Exact removal of first batch\ninv2.remove_stock_fifo(\u0027nail\u0027, 5)\nassert inv2.total_quantity(\u0027nail\u0027) == 5\nassert len(inv2.items[\u0027nail\u0027]) == 1\n\n# Remove all remaining\ninv2.remove_stock_fifo(\u0027nail\u0027, 5)\nassert inv2.total_quantity(\u0027nail\u0027) == 0\nassert \u0027nail\u0027 not in inv2.items\n\n# Insufficient stock\ninv3 = Inventory()\ninv3.add_stock(\u0027bolt\u0027, 3, 20250101)\ntry:\n inv3.remove_stock_fifo(\u0027bolt\u0027, 10)\n assert False, \"Should raise ValueError\"\nexcept ValueError:\n pass\nassert inv3.total_quantity(\u0027bolt\u0027) == 3 # unchanged after failed removal\n","category":"code_purpose_understanding"} {"id":"13","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Inventory:\n def __init__(self):\n self.items = {}\n\n def add_stock(self, name, qty, expiry, unit_cost):\n if name not in self.items:\n self.items[name] = []\n self.items[name].append({\n \u0027qty\u0027: qty, \u0027expiry\u0027: expiry, \u0027unit_cost\u0027: unit_cost\n })\n\n def total_quantity(self, name):\n if name not in self.items:\n return 0\n return sum(b[\u0027qty\u0027] for b in self.items[name])\n\n def _build_waste_entry(self, name, batch):\n \"\"\"Build a single waste report entry from an expired batch.\"\"\"\n return {\u0027name\u0027: name, \u0027qty\u0027: batch[\u0027qty\u0027],\n \u0027waste_cost\u0027: batch[\u0027qty\u0027] * batch[\u0027unit_cost\u0027]}\n\n","golden_completion":" def remove_expired(self, current_date):\n report = {\u0027removed_items\u0027: [], \u0027total_waste_cost\u0027: 0.0}\n for name in list(self.items.keys()):\n expired = [b for b in self.items[name] if b[\u0027expiry\u0027] \u003c current_date]\n for b in expired:\n report[\u0027removed_items\u0027].append(self._build_waste_entry(name, b))\n report[\u0027total_waste_cost\u0027] += b[\u0027qty\u0027] * b[\u0027unit_cost\u0027]\n self.items[name].remove(b)\n if not self.items[name]:\n del self.items[name]\n report[\u0027total_waste_cost\u0027] = round(report[\u0027total_waste_cost\u0027], 2)\n return report\n","suffix":"\ninv = Inventory()\ninv.add_stock(\u0027milk\u0027, 10, 20250101, 2.50)\ninv.add_stock(\u0027milk\u0027, 5, 20250601, 2.50)\ninv.add_stock(\u0027bread\u0027, 20, 20250115, 1.00)\ninv.add_stock(\u0027cheese\u0027, 15, 20260101, 5.00)\n\nreport = inv.remove_expired(20250301)\n\nassert inv.total_quantity(\u0027milk\u0027) == 5 # only the June batch remains\nassert inv.total_quantity(\u0027bread\u0027) == 0\nassert inv.total_quantity(\u0027cheese\u0027) == 15 # not expired\n\nassert report[\u0027total_waste_cost\u0027] == 10 * 2.50 + 20 * 1.00\nassert len(report[\u0027removed_items\u0027]) == 2\n","assertions":"\ninv2 = Inventory()\ninv2.add_stock(\u0027yogurt\u0027, 8, 20250101, 3.00)\ninv2.add_stock(\u0027yogurt\u0027, 12, 20250201, 3.00)\n\n# Remove with date between the two batches\nreport2 = inv2.remove_expired(20250115)\nassert inv2.total_quantity(\u0027yogurt\u0027) == 12\nassert report2[\u0027total_waste_cost\u0027] == 24.0\n\n# Remove all\nreport3 = inv2.remove_expired(20250301)\nassert inv2.total_quantity(\u0027yogurt\u0027) == 0\nassert \u0027yogurt\u0027 not in inv2.items\nassert report3[\u0027total_waste_cost\u0027] == 36.0\n\n# Nothing expired\ninv3 = Inventory()\ninv3.add_stock(\u0027water\u0027, 100, 20301231, 0.50)\nreport4 = inv3.remove_expired(20250101)\nassert report4[\u0027total_waste_cost\u0027] == 0.0\nassert len(report4[\u0027removed_items\u0027]) == 0\nassert inv3.total_quantity(\u0027water\u0027) == 100\n","category":"code_purpose_understanding"} {"id":"14","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Inventory:\n \"\"\"Inventory with reorder-point tracking.\n check_reorder returns a list of dicts for items below their\n reorder point. Each dict has: name, current, reorder_point, shortfall.\n Items AT their reorder point do NOT need reorder (strictly less than).\n Items with reorder points but no stock should appear in results.\"\"\"\n\n def __init__(self):\n self.items = {} # name -\u003e list of {\u0027qty\u0027: int}\n self.reorder_points = {} # name -\u003e minimum quantity\n\n def add_stock(self, name, qty):\n if name not in self.items:\n self.items[name] = []\n self.items[name].append({\u0027qty\u0027: qty})\n\n def set_reorder_point(self, name, minimum):\n self.reorder_points[name] = minimum\n\n def total_quantity(self, name):\n if name not in self.items:\n return 0\n return sum(b[\u0027qty\u0027] for b in self.items[name])\n\n","golden_completion":" def check_reorder(self):\n needs_reorder = []\n for name, minimum in self.reorder_points.items():\n current = self.total_quantity(name)\n if current \u003c minimum:\n needs_reorder.append({\n \u0027name\u0027: name, \u0027current\u0027: current,\n \u0027reorder_point\u0027: minimum, \u0027shortfall\u0027: minimum - current\n })\n return needs_reorder\n","suffix":"\ninv = Inventory()\ninv.add_stock(\u0027nails\u0027, 50)\ninv.add_stock(\u0027screws\u0027, 10)\ninv.set_reorder_point(\u0027nails\u0027, 100)\ninv.set_reorder_point(\u0027screws\u0027, 5)\ninv.set_reorder_point(\u0027bolts\u0027, 20)\n\nreorder = inv.check_reorder()\nnames = [r[\u0027name\u0027] for r in reorder]\nassert \u0027nails\u0027 in names # 50 \u003c 100\nassert \u0027bolts\u0027 in names # 0 \u003c 20\nassert \u0027screws\u0027 not in names # 10 \u003e= 5\nassert any(r[\u0027shortfall\u0027] == 50 for r in reorder) # nails shortfall\nassert any(r[\u0027shortfall\u0027] == 20 for r in reorder) # bolts shortfall\n","assertions":"\ninv2 = Inventory()\ninv2.set_reorder_point(\u0027x\u0027, 10)\nreorder2 = inv2.check_reorder()\nassert len(reorder2) == 1\nassert reorder2[0][\u0027current\u0027] == 0\nassert reorder2[0][\u0027shortfall\u0027] == 10\n\n# All above reorder point\ninv3 = Inventory()\ninv3.add_stock(\u0027a\u0027, 100)\ninv3.set_reorder_point(\u0027a\u0027, 50)\nassert inv3.check_reorder() == []\n\n# Exact boundary (equal to reorder point = no reorder needed)\ninv4 = Inventory()\ninv4.add_stock(\u0027b\u0027, 10)\ninv4.set_reorder_point(\u0027b\u0027, 10)\nassert inv4.check_reorder() == []\n","category":"code_purpose_understanding"} {"id":"15","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Inventory:\n \"\"\"Inventory system with batch merging capability.\n merge_batches(name) consolidates batches that share the same expiry date.\n Merged batch qty = sum of quantities.\n Merged batch unit_cost = weighted average (total_cost / total_qty),\n rounded to 2 decimal places.\n Batches with different expiry dates remain separate.\n Merging a non-existent item or single batch is a no-op.\"\"\"\n\n def __init__(self):\n self.items = {}\n\n def add_stock(self, name, qty, expiry, unit_cost):\n if name not in self.items:\n self.items[name] = []\n self.items[name].append({\n \u0027qty\u0027: qty, \u0027expiry\u0027: expiry, \u0027unit_cost\u0027: unit_cost\n })\n\n def total_quantity(self, name):\n if name not in self.items:\n return 0\n return sum(b[\u0027qty\u0027] for b in self.items[name])\n\n","golden_completion":" def merge_batches(self, name):\n if name not in self.items or len(self.items[name]) \u003c= 1:\n return\n groups = {}\n for b in self.items[name]:\n groups.setdefault(b[\u0027expiry\u0027], {\u0027qty\u0027: 0, \u0027cost\u0027: 0.0})\n groups[b[\u0027expiry\u0027]][\u0027qty\u0027] += b[\u0027qty\u0027]\n groups[b[\u0027expiry\u0027]][\u0027cost\u0027] += b[\u0027qty\u0027] * b[\u0027unit_cost\u0027]\n self.items[name] = [{\u0027qty\u0027: d[\u0027qty\u0027], \u0027expiry\u0027: e,\n \u0027unit_cost\u0027: round(d[\u0027cost\u0027] / d[\u0027qty\u0027], 2)} for e, d in groups.items()]\n","suffix":"\ninv = Inventory()\ninv.add_stock(\u0027aspirin\u0027, 100, 20251231, 0.50)\ninv.add_stock(\u0027aspirin\u0027, 50, 20251231, 0.60)\ninv.add_stock(\u0027aspirin\u0027, 30, 20260630, 0.55)\n\ninv.merge_batches(\u0027aspirin\u0027)\nassert len(inv.items[\u0027aspirin\u0027]) == 2 # two distinct expiry dates\nassert inv.total_quantity(\u0027aspirin\u0027) == 180\n\n# Find the merged batch for 20251231\nmerged = [b for b in inv.items[\u0027aspirin\u0027] if b[\u0027expiry\u0027] == 20251231][0]\nassert merged[\u0027qty\u0027] == 150\nexpected_cost = round((100 * 0.50 + 50 * 0.60) / 150, 2)\nassert merged[\u0027unit_cost\u0027] == expected_cost\n","assertions":"\n# Single batch - no change\ninv2 = Inventory()\ninv2.add_stock(\u0027x\u0027, 10, 20250101, 1.00)\ninv2.merge_batches(\u0027x\u0027)\nassert len(inv2.items[\u0027x\u0027]) == 1\nassert inv2.items[\u0027x\u0027][0][\u0027unit_cost\u0027] == 1.00\n\n# Non-existent item - no error\ninv2.merge_batches(\u0027nonexistent\u0027)\n\n# All same expiry\ninv3 = Inventory()\ninv3.add_stock(\u0027y\u0027, 10, 20250101, 2.00)\ninv3.add_stock(\u0027y\u0027, 20, 20250101, 3.00)\ninv3.add_stock(\u0027y\u0027, 30, 20250101, 4.00)\ninv3.merge_batches(\u0027y\u0027)\nassert len(inv3.items[\u0027y\u0027]) == 1\nassert inv3.items[\u0027y\u0027][0][\u0027qty\u0027] == 60\nexpected = round((10*2 + 20*3 + 30*4) / 60, 2)\nassert inv3.items[\u0027y\u0027][0][\u0027unit_cost\u0027] == expected\n","category":"code_purpose_understanding"} {"id":"16","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class PermissionSystem:\n \"\"\"Role-based permission system with explicit deny support.\n Roles have hierarchy levels (higher = more permissions).\n Permissions have required levels.\n A user has a role, and can also have explicitly denied permissions.\n has_permission checks:\n 1. If user doesn\u0027t exist -\u003e False\n 2. If permission is in user\u0027s denied set -\u003e False (deny overrides role)\n 3. If permission is unknown -\u003e False\n 4. If user\u0027s role level \u003e= permission level -\u003e True, else False\"\"\"\n\n ROLE_HIERARCHY = {\n \u0027viewer\u0027: 0,\n \u0027manager\u0027: 1,\n \u0027admin\u0027: 2\n }\n\n PERMISSION_LEVEL = {\n \u0027read\u0027: 0,\n \u0027write\u0027: 1,\n \u0027delete\u0027: 2\n }\n\n def __init__(self):\n self.users = {} # user_id -\u003e {\u0027role\u0027: str, \u0027denied\u0027: set()}\n\n def add_user(self, user_id, role):\n if role not in self.ROLE_HIERARCHY:\n raise ValueError(f\"Unknown role: {role}\")\n self.users[user_id] = {\u0027role\u0027: role, \u0027denied\u0027: set()}\n\n def deny_permission(self, user_id, permission):\n if user_id not in self.users:\n raise ValueError(\"User not found\")\n self.users[user_id][\u0027denied\u0027].add(permission)\n\n","golden_completion":" def has_permission(self, user_id, permission):\n if user_id not in self.users:\n return False\n user = self.users[user_id]\n if permission in user[\u0027denied\u0027]:\n return False\n role_level = self.ROLE_HIERARCHY[user[\u0027role\u0027]]\n perm_level = self.PERMISSION_LEVEL.get(permission)\n if perm_level is None:\n return False\n return role_level \u003e= perm_level\n","suffix":"\nps = PermissionSystem()\nps.add_user(\u0027alice\u0027, \u0027admin\u0027)\nps.add_user(\u0027bob\u0027, \u0027manager\u0027)\nps.add_user(\u0027charlie\u0027, \u0027viewer\u0027)\n\nassert ps.has_permission(\u0027alice\u0027, \u0027delete\u0027) == True\nassert ps.has_permission(\u0027bob\u0027, \u0027write\u0027) == True\nassert ps.has_permission(\u0027bob\u0027, \u0027delete\u0027) == False\nassert ps.has_permission(\u0027charlie\u0027, \u0027read\u0027) == True\nassert ps.has_permission(\u0027charlie\u0027, \u0027write\u0027) == False\n","assertions":"\nps2 = PermissionSystem()\nps2.add_user(\u0027dave\u0027, \u0027admin\u0027)\nps2.deny_permission(\u0027dave\u0027, \u0027delete\u0027)\n\n# Explicit deny overrides role\nassert ps2.has_permission(\u0027dave\u0027, \u0027delete\u0027) == False\nassert ps2.has_permission(\u0027dave\u0027, \u0027write\u0027) == True\n\n# Unknown user\nassert ps2.has_permission(\u0027unknown\u0027, \u0027read\u0027) == False\n\n# Unknown permission\nassert ps2.has_permission(\u0027dave\u0027, \u0027execute\u0027) == False\n","category":"code_purpose_understanding"} {"id":"17","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class LoanAccount:\n \"\"\"Loan servicer with a non-standard payment waterfall.\n apply_payment(amount, timestamp) must allocate cash in this exact order:\n 1. late_fees\n 2. principal\n 3. accrued_interest\n 4. unapplied_cash\n This intentionally differs from the usual interest-before-principal order.\n Charged-off loans do not reduce balances; payments become recovery_cash.\n Every successful payment appends one audit entry with the allocation dict.\"\"\"\n\n def __init__(self, principal):\n self.principal = float(principal)\n self.accrued_interest = 0.0\n self.late_fees = 0.0\n self.unapplied_cash = 0.0\n self.recovery_cash = 0.0\n self.status = \u0027current\u0027\n self.audit_log = []\n\n def accrue_interest(self, amount):\n self.accrued_interest = round(self.accrued_interest + amount, 2)\n\n def add_late_fee(self, amount):\n self.late_fees = round(self.late_fees + amount, 2)\n\n def charge_off(self):\n self.status = \u0027charged_off\u0027\n\n def _take(self, field, remaining):\n amount = min(getattr(self, field), remaining)\n setattr(self, field, round(getattr(self, field) - amount, 2))\n return round(amount, 2)\n\n","golden_completion":" def apply_payment(self, amount, timestamp):\n if amount \u003c= 0:\n raise ValueError(\"payment amount must be positive\")\n remaining = round(float(amount), 2)\n if self.status == \u0027charged_off\u0027:\n self.recovery_cash = round(self.recovery_cash + remaining, 2)\n allocation = {\u0027late_fees\u0027: 0.0, \u0027principal\u0027: 0.0, \u0027accrued_interest\u0027: 0.0, \u0027unapplied_cash\u0027: 0.0, \u0027recovery_cash\u0027: remaining}\n self.audit_log.append({\u0027action\u0027: \u0027payment\u0027, \u0027amount\u0027: remaining, \u0027ts\u0027: timestamp, \u0027allocation\u0027: allocation})\n return allocation\n allocation = {}\n for field in (\u0027late_fees\u0027, \u0027principal\u0027, \u0027accrued_interest\u0027):\n paid = self._take(field, remaining)\n allocation[field] = paid\n remaining = round(remaining - paid, 2)\n allocation[\u0027unapplied_cash\u0027] = remaining\n allocation[\u0027recovery_cash\u0027] = 0.0\n self.unapplied_cash = round(self.unapplied_cash + remaining, 2)\n if self.principal == 0 and self.accrued_interest == 0 and self.late_fees == 0:\n self.status = \u0027paid_off\u0027\n self.audit_log.append({\u0027action\u0027: \u0027payment\u0027, \u0027amount\u0027: round(float(amount), 2), \u0027ts\u0027: timestamp, \u0027allocation\u0027: allocation})\n return allocation\n","suffix":"\nloan = LoanAccount(100)\nloan.accrue_interest(30)\nloan.add_late_fee(10)\n\nallocation = loan.apply_payment(50, timestamp=1)\nassert allocation == {\n \u0027late_fees\u0027: 10.0,\n \u0027principal\u0027: 40.0,\n \u0027accrued_interest\u0027: 0.0,\n \u0027unapplied_cash\u0027: 0.0,\n \u0027recovery_cash\u0027: 0.0,\n}\nassert loan.principal == 60.0\nassert loan.accrued_interest == 30.0 # interest is paid after principal in this servicer\nassert loan.late_fees == 0.0\n\nallocation2 = loan.apply_payment(200, timestamp=2)\nassert allocation2 == {\n \u0027late_fees\u0027: 0.0,\n \u0027principal\u0027: 60.0,\n \u0027accrued_interest\u0027: 30.0,\n \u0027unapplied_cash\u0027: 110.0,\n \u0027recovery_cash\u0027: 0.0,\n}\nassert loan.status == \u0027paid_off\u0027\nassert loan.unapplied_cash == 110.0\nassert loan.audit_log[-1] == {\u0027action\u0027: \u0027payment\u0027, \u0027amount\u0027: 200.0, \u0027ts\u0027: 2, \u0027allocation\u0027: allocation2}\n\ncharged = LoanAccount(500)\ncharged.accrue_interest(50)\ncharged.add_late_fee(25)\ncharged.charge_off()\nrecovery = charged.apply_payment(100, timestamp=3)\nassert recovery == {\u0027late_fees\u0027: 0.0, \u0027principal\u0027: 0.0, \u0027accrued_interest\u0027: 0.0, \u0027unapplied_cash\u0027: 0.0, \u0027recovery_cash\u0027: 100.0}\nassert charged.principal == 500.0\nassert charged.accrued_interest == 50.0\nassert charged.recovery_cash == 100.0\n","assertions":"\nloan2 = LoanAccount(25)\nloan2.accrue_interest(7)\nloan2.add_late_fee(3)\nalloc = loan2.apply_payment(3, timestamp=10)\nassert alloc[\u0027late_fees\u0027] == 3.0\nassert alloc[\u0027principal\u0027] == 0.0\nassert loan2.principal == 25.0\nassert loan2.accrued_interest == 7.0\nassert loan2.status == \u0027current\u0027\n\nalloc2 = loan2.apply_payment(32, timestamp=11)\nassert alloc2 == {\u0027late_fees\u0027: 0.0, \u0027principal\u0027: 25.0, \u0027accrued_interest\u0027: 7.0, \u0027unapplied_cash\u0027: 0.0, \u0027recovery_cash\u0027: 0.0}\nassert loan2.status == \u0027paid_off\u0027\n\nbefore = (loan2.principal, loan2.accrued_interest, loan2.late_fees, len(loan2.audit_log))\ntry:\n loan2.apply_payment(0, timestamp=12)\n assert False, \"zero payment should fail\"\nexcept ValueError:\n pass\nassert (loan2.principal, loan2.accrued_interest, loan2.late_fees, len(loan2.audit_log)) == before\n","category":"code_purpose_understanding"} {"id":"18","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class TemporalPermissions:\n \"\"\"Time-bounded permission system.\n Grants and denials have valid_from (inclusive) and valid_until (exclusive, or None=forever).\n _is_active checks if an entry is active at a given time.\n has_permission: deny-overrides-grant.\n - If any active denial matches -\u003e False\n - If any active grant matches -\u003e True\n - Otherwise -\u003e False\"\"\"\n\n def __init__(self):\n self.grants = [] # list of {\u0027user\u0027,\u0027perm\u0027,\u0027valid_from\u0027,\u0027valid_until\u0027}\n self.denials = []\n\n def grant(self, user, perm, valid_from, valid_until=None):\n self.grants.append({\n \u0027user\u0027: user, \u0027perm\u0027: perm,\n \u0027valid_from\u0027: valid_from, \u0027valid_until\u0027: valid_until\n })\n\n def deny(self, user, perm, valid_from, valid_until=None):\n self.denials.append({\n \u0027user\u0027: user, \u0027perm\u0027: perm,\n \u0027valid_from\u0027: valid_from, \u0027valid_until\u0027: valid_until\n })\n\n def _is_active(self, entry, current_time):\n if current_time \u003c entry[\u0027valid_from\u0027]:\n return False\n if entry[\u0027valid_until\u0027] is not None and current_time \u003e= entry[\u0027valid_until\u0027]:\n return False\n return True\n\n","golden_completion":" def has_permission(self, user, perm, current_time):\n for d in self.denials:\n if d[\u0027user\u0027] == user and d[\u0027perm\u0027] == perm and self._is_active(d, current_time):\n return False\n for g in self.grants:\n if g[\u0027user\u0027] == user and g[\u0027perm\u0027] == perm and self._is_active(g, current_time):\n return True\n return False\n","suffix":"\ntp = TemporalPermissions()\ntp.grant(\u0027alice\u0027, \u0027read\u0027, 100, 200)\ntp.grant(\u0027alice\u0027, \u0027write\u0027, 100, None) # no expiry\ntp.deny(\u0027alice\u0027, \u0027write\u0027, 150, 180)\n\n# At time 120: read=yes, write=yes\nassert tp.has_permission(\u0027alice\u0027, \u0027read\u0027, 120) == True\nassert tp.has_permission(\u0027alice\u0027, \u0027write\u0027, 120) == True\n\n# At time 160: read=yes, write=NO (denied 150-180)\nassert tp.has_permission(\u0027alice\u0027, \u0027read\u0027, 160) == True\nassert tp.has_permission(\u0027alice\u0027, \u0027write\u0027, 160) == False\n\n# At time 190: read=yes, write=yes (denial expired)\nassert tp.has_permission(\u0027alice\u0027, \u0027write\u0027, 190) == True\n\n# At time 250: read=no (expired), write=yes\nassert tp.has_permission(\u0027alice\u0027, \u0027read\u0027, 250) == False\nassert tp.has_permission(\u0027alice\u0027, \u0027write\u0027, 250) == True\n","assertions":"\ntp2 = TemporalPermissions()\n# Grant and deny at same time range - deny wins\ntp2.grant(\u0027bob\u0027, \u0027delete\u0027, 0, 100)\ntp2.deny(\u0027bob\u0027, \u0027delete\u0027, 0, 100)\nassert tp2.has_permission(\u0027bob\u0027, \u0027delete\u0027, 50) == False\n\n# Before valid_from\ntp2.grant(\u0027charlie\u0027, \u0027read\u0027, 100, None)\nassert tp2.has_permission(\u0027charlie\u0027, \u0027read\u0027, 50) == False\nassert tp2.has_permission(\u0027charlie\u0027, \u0027read\u0027, 100) == True\n\n# Exactly at valid_until boundary (exclusive)\ntp2.grant(\u0027dave\u0027, \u0027read\u0027, 0, 100)\nassert tp2.has_permission(\u0027dave\u0027, \u0027read\u0027, 99) == True\nassert tp2.has_permission(\u0027dave\u0027, \u0027read\u0027, 100) == False\n\n# No entries for user\nassert tp2.has_permission(\u0027nobody\u0027, \u0027read\u0027, 50) == False\n","category":"code_purpose_understanding"} {"id":"19","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class ClaimAdjudicator:\n \"\"\"Medical claim adjudication with plan accumulators.\n adjudicate_line(code, billed_amount, prior_auth=False) must:\n - Denied codes return status \u0027denied\u0027 and do not change accumulators.\n - Codes requiring prior auth return status \u0027auth_required\u0027 unless prior_auth=True.\n - allowed amount is min(billed_amount, allowed_rates.get(code, billed_amount)).\n - Patient responsibility order is copay, then deductible, then coinsurance.\n - copay applies only to codes in copay_codes and is capped by allowed amount.\n - deductible applies to remaining allowed amount and reduces deductible_remaining.\n - coinsurance applies to amount left after copay and deductible.\n - oop_remaining caps total patient responsibility; plan pays the rest.\n - oop_remaining is reduced by the final patient amount.\n - Return a report and append the same report to audit_log.\"\"\"\n\n def __init__(self, deductible_remaining, oop_remaining, coinsurance, copay):\n self.deductible_remaining = float(deductible_remaining)\n self.oop_remaining = float(oop_remaining)\n self.coinsurance = float(coinsurance)\n self.copay = float(copay)\n self.allowed_rates = {}\n self.denied_codes = set()\n self.prior_auth_codes = set()\n self.copay_codes = set()\n self.audit_log = []\n\n def set_allowed_rate(self, code, amount):\n self.allowed_rates[code] = float(amount)\n\n def deny_code(self, code):\n self.denied_codes.add(code)\n\n def require_prior_auth(self, code):\n self.prior_auth_codes.add(code)\n\n def set_copay_code(self, code):\n self.copay_codes.add(code)\n\n def _round_money(self, value):\n return round(value + 0.0, 2)\n\n","golden_completion":" def adjudicate_line(self, code, billed_amount, prior_auth=False):\n billed_amount = float(billed_amount)\n if code in self.denied_codes:\n report = {\u0027code\u0027: code, \u0027status\u0027: \u0027denied\u0027, \u0027allowed\u0027: 0.0, \u0027patient\u0027: 0.0, \u0027plan\u0027: 0.0}\n self.audit_log.append(report)\n return report\n if code in self.prior_auth_codes and not prior_auth:\n report = {\u0027code\u0027: code, \u0027status\u0027: \u0027auth_required\u0027, \u0027allowed\u0027: 0.0, \u0027patient\u0027: 0.0, \u0027plan\u0027: 0.0}\n self.audit_log.append(report)\n return report\n allowed = min(billed_amount, self.allowed_rates.get(code, billed_amount))\n remaining_allowed = allowed\n copay_paid = min(self.copay, remaining_allowed) if code in self.copay_codes else 0.0\n remaining_allowed -= copay_paid\n deductible_paid = min(self.deductible_remaining, remaining_allowed)\n self.deductible_remaining = self._round_money(self.deductible_remaining - deductible_paid)\n remaining_allowed -= deductible_paid\n coinsurance_paid = remaining_allowed * self.coinsurance\n raw_patient = copay_paid + deductible_paid + coinsurance_paid\n patient = min(raw_patient, self.oop_remaining)\n self.oop_remaining = self._round_money(self.oop_remaining - patient)\n plan = self._round_money(allowed - patient)\n patient = self._round_money(patient)\n report = {\u0027code\u0027: code, \u0027status\u0027: \u0027paid\u0027, \u0027allowed\u0027: self._round_money(allowed), \u0027patient\u0027: patient, \u0027plan\u0027: plan}\n self.audit_log.append(report)\n return report\n","suffix":"\nclaim = ClaimAdjudicator(deductible_remaining=100, oop_remaining=500, coinsurance=0.2, copay=25)\nclaim.set_allowed_rate(\u0027OV\u0027, 120)\nclaim.set_allowed_rate(\u0027MRI\u0027, 600)\nclaim.set_copay_code(\u0027OV\u0027)\nclaim.require_prior_auth(\u0027MRI\u0027)\nclaim.deny_code(\u0027X999\u0027)\n\ndenied = claim.adjudicate_line(\u0027X999\u0027, 1000)\nassert denied == {\u0027code\u0027: \u0027X999\u0027, \u0027status\u0027: \u0027denied\u0027, \u0027allowed\u0027: 0.0, \u0027patient\u0027: 0.0, \u0027plan\u0027: 0.0}\nassert claim.deductible_remaining == 100.0\nassert claim.oop_remaining == 500.0\n\nauth = claim.adjudicate_line(\u0027MRI\u0027, 800)\nassert auth[\u0027status\u0027] == \u0027auth_required\u0027\nassert claim.deductible_remaining == 100.0\n\noffice = claim.adjudicate_line(\u0027OV\u0027, 200)\n# allowed=120, copay=25, deductible=95, no coinsurance remains\nassert office == {\u0027code\u0027: \u0027OV\u0027, \u0027status\u0027: \u0027paid\u0027, \u0027allowed\u0027: 120.0, \u0027patient\u0027: 120.0, \u0027plan\u0027: 0.0}\nassert claim.deductible_remaining == 5.0\nassert claim.oop_remaining == 380.0\n\nmri = claim.adjudicate_line(\u0027MRI\u0027, 800, prior_auth=True)\n# allowed=600, deductible=5, coinsurance=20% of 595 = 119, patient=124\nassert mri == {\u0027code\u0027: \u0027MRI\u0027, \u0027status\u0027: \u0027paid\u0027, \u0027allowed\u0027: 600.0, \u0027patient\u0027: 124.0, \u0027plan\u0027: 476.0}\nassert claim.deductible_remaining == 0.0\nassert claim.oop_remaining == 256.0\nassert claim.audit_log[-1] == mri\n","assertions":"\nclaim2 = ClaimAdjudicator(deductible_remaining=0, oop_remaining=50, coinsurance=0.5, copay=25)\nclaim2.set_allowed_rate(\u0027THER\u0027, 200)\nclaim2.set_copay_code(\u0027THER\u0027)\nther = claim2.adjudicate_line(\u0027THER\u0027, 500)\n# raw patient = copay 25 + 50% of 175 = 112.5, capped by oop_remaining 50\nassert ther == {\u0027code\u0027: \u0027THER\u0027, \u0027status\u0027: \u0027paid\u0027, \u0027allowed\u0027: 200.0, \u0027patient\u0027: 50.0, \u0027plan\u0027: 150.0}\nassert claim2.oop_remaining == 0.0\n\nafter_cap = claim2.adjudicate_line(\u0027LAB\u0027, 80)\nassert after_cap == {\u0027code\u0027: \u0027LAB\u0027, \u0027status\u0027: \u0027paid\u0027, \u0027allowed\u0027: 80.0, \u0027patient\u0027: 0.0, \u0027plan\u0027: 80.0}\nassert claim2.oop_remaining == 0.0\n\nclaim3 = ClaimAdjudicator(deductible_remaining=100, oop_remaining=100, coinsurance=0.2, copay=25)\nclaim3.set_copay_code(\u0027SMALL\u0027)\nsmall = claim3.adjudicate_line(\u0027SMALL\u0027, 10)\nassert small == {\u0027code\u0027: \u0027SMALL\u0027, \u0027status\u0027: \u0027paid\u0027, \u0027allowed\u0027: 10.0, \u0027patient\u0027: 10.0, \u0027plan\u0027: 0.0}\nassert claim3.deductible_remaining == 100.0\nassert claim3.oop_remaining == 90.0\n","category":"code_purpose_understanding"} {"id":"20","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class PaymentLedger:\n \"\"\"Authorization/capture ledger.\n capture(auth_id, capture_id, amount, timestamp) must:\n - Treat capture_id as idempotency key: repeated capture_id returns the\n original report and does not append another audit entry.\n - Validate before mutating: auth must exist, amount must be positive, and\n amount cannot exceed the uncaptured authorization remainder.\n - Partial captures leave auth status \u0027partially_captured\u0027; exact final\n capture sets status \u0027captured\u0027.\n - For each new capture, fee = round(amount * fee_rate, 2) and\n net = amount - fee. gross_captured, fees_collected, and net_settled are\n cumulative totals.\n - Store and audit the exact report returned.\"\"\"\n\n def __init__(self, fee_rate):\n self.fee_rate = float(fee_rate)\n self.authorizations = {}\n self.captures = {}\n self.gross_captured = 0.0\n self.fees_collected = 0.0\n self.net_settled = 0.0\n self.audit_log = []\n\n def authorize(self, auth_id, amount):\n if auth_id in self.authorizations:\n raise ValueError(\"duplicate authorization\")\n self.authorizations[auth_id] = {\n \u0027amount\u0027: float(amount),\n \u0027captured\u0027: 0.0,\n \u0027status\u0027: \u0027authorized\u0027,\n }\n\n def _remaining_auth(self, auth_id):\n auth = self.authorizations[auth_id]\n return round(auth[\u0027amount\u0027] - auth[\u0027captured\u0027], 2)\n\n def _money(self, value):\n return round(value + 0.0, 2)\n\n","golden_completion":" def capture(self, auth_id, capture_id, amount, timestamp):\n if capture_id in self.captures:\n return self.captures[capture_id]\n if auth_id not in self.authorizations:\n raise ValueError(\"unknown authorization\")\n amount = self._money(float(amount))\n if amount \u003c= 0:\n raise ValueError(\"capture amount must be positive\")\n remaining = self._remaining_auth(auth_id)\n if amount \u003e remaining:\n raise ValueError(\"capture exceeds authorization remainder\")\n auth = self.authorizations[auth_id]\n fee = self._money(amount * self.fee_rate)\n net = self._money(amount - fee)\n auth[\u0027captured\u0027] = self._money(auth[\u0027captured\u0027] + amount)\n remaining_after = self._remaining_auth(auth_id)\n auth[\u0027status\u0027] = \u0027captured\u0027 if remaining_after == 0 else \u0027partially_captured\u0027\n self.gross_captured = self._money(self.gross_captured + amount)\n self.fees_collected = self._money(self.fees_collected + fee)\n self.net_settled = self._money(self.net_settled + net)\n report = {\u0027auth_id\u0027: auth_id, \u0027capture_id\u0027: capture_id, \u0027amount\u0027: amount, \u0027fee\u0027: fee, \u0027net\u0027: net, \u0027remaining_auth\u0027: remaining_after, \u0027status\u0027: auth[\u0027status\u0027], \u0027ts\u0027: timestamp}\n self.captures[capture_id] = report\n self.audit_log.append({\u0027action\u0027: \u0027capture\u0027, \u0027report\u0027: report})\n return report\n","suffix":"\nledger = PaymentLedger(fee_rate=0.029)\nledger.authorize(\u0027auth-1\u0027, 100.00)\n\ncap1 = ledger.capture(\u0027auth-1\u0027, \u0027cap-1\u0027, 40.00, timestamp=10)\nassert cap1 == {\n \u0027auth_id\u0027: \u0027auth-1\u0027, \u0027capture_id\u0027: \u0027cap-1\u0027, \u0027amount\u0027: 40.0,\n \u0027fee\u0027: 1.16, \u0027net\u0027: 38.84, \u0027remaining_auth\u0027: 60.0,\n \u0027status\u0027: \u0027partially_captured\u0027, \u0027ts\u0027: 10,\n}\nassert ledger.authorizations[\u0027auth-1\u0027][\u0027status\u0027] == \u0027partially_captured\u0027\nassert ledger.gross_captured == 40.0\nassert ledger.fees_collected == 1.16\nassert ledger.net_settled == 38.84\n\nagain = ledger.capture(\u0027auth-1\u0027, \u0027cap-1\u0027, 40.00, timestamp=99)\nassert again is cap1\nassert len(ledger.audit_log) == 1 # idempotent replay does not audit again\n\nbefore = (dict(ledger.authorizations[\u0027auth-1\u0027]), ledger.gross_captured, ledger.fees_collected, ledger.net_settled, len(ledger.audit_log))\ntry:\n ledger.capture(\u0027auth-1\u0027, \u0027cap-too-much\u0027, 100.00, timestamp=11)\n assert False, \"over-capture should fail before mutation\"\nexcept ValueError:\n pass\nassert (dict(ledger.authorizations[\u0027auth-1\u0027]), ledger.gross_captured, ledger.fees_collected, ledger.net_settled, len(ledger.audit_log)) == before\n\ncap2 = ledger.capture(\u0027auth-1\u0027, \u0027cap-2\u0027, 60.00, timestamp=12)\nassert cap2[\u0027status\u0027] == \u0027captured\u0027\nassert cap2[\u0027remaining_auth\u0027] == 0.0\nassert ledger.authorizations[\u0027auth-1\u0027][\u0027captured\u0027] == 100.0\nassert ledger.authorizations[\u0027auth-1\u0027][\u0027status\u0027] == \u0027captured\u0027\nassert ledger.audit_log[-1] == {\u0027action\u0027: \u0027capture\u0027, \u0027report\u0027: cap2}\n","assertions":"\nledger2 = PaymentLedger(fee_rate=0.10)\nledger2.authorize(\u0027a\u0027, 10)\ntry:\n ledger2.capture(\u0027missing\u0027, \u0027c0\u0027, 1, timestamp=1)\n assert False, \"unknown auth should fail\"\nexcept ValueError:\n pass\ntry:\n ledger2.capture(\u0027a\u0027, \u0027c0\u0027, 0, timestamp=1)\n assert False, \"zero capture should fail\"\nexcept ValueError:\n pass\nassert ledger2.authorizations[\u0027a\u0027] == {\u0027amount\u0027: 10.0, \u0027captured\u0027: 0.0, \u0027status\u0027: \u0027authorized\u0027}\nassert ledger2.audit_log == []\n\ncap = ledger2.capture(\u0027a\u0027, \u0027c1\u0027, 10, timestamp=2)\nassert cap == {\u0027auth_id\u0027: \u0027a\u0027, \u0027capture_id\u0027: \u0027c1\u0027, \u0027amount\u0027: 10.0, \u0027fee\u0027: 1.0, \u0027net\u0027: 9.0, \u0027remaining_auth\u0027: 0.0, \u0027status\u0027: \u0027captured\u0027, \u0027ts\u0027: 2}\nassert ledger2.gross_captured == 10.0\nassert ledger2.fees_collected == 1.0\nassert ledger2.net_settled == 9.0\nassert ledger2.capture(\u0027a\u0027, \u0027c1\u0027, 999, timestamp=3) is cap\nassert len(ledger2.audit_log) == 1\n","category":"code_purpose_understanding"} {"id":"21","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class TransferPicker:\n \"\"\"Warehouse transfer picking.\n pick(sku, qty, pick_id, ship_date) must:\n - Treat pick_id as idempotency key: replay returns the original report and\n does not reserve more stock or append another audit entry.\n - Ignore expired batches where expiry \u003c= ship_date.\n - Allocate by earliest expiry first (FEFO) using available qty\n batch[\u0027qty\u0027] - batch[\u0027reserved\u0027].\n - Validate enough available stock before mutating any batch.\n - On success, increase each batch\u0027s reserved quantity, return exact\n allocations, and append one audit entry.\n - On insufficient stock or invalid qty, raise ValueError before mutation.\"\"\"\n\n def __init__(self):\n self.stock = {}\n self.picks = {}\n self.audit_log = []\n\n def add_batch(self, sku, batch_id, qty, expiry):\n self.stock.setdefault(sku, []).append({\n \u0027batch_id\u0027: batch_id,\n \u0027qty\u0027: qty,\n \u0027reserved\u0027: 0,\n \u0027expiry\u0027: expiry,\n })\n\n def available_quantity(self, sku, ship_date):\n total = 0\n for batch in self.stock.get(sku, []):\n if batch[\u0027expiry\u0027] \u003e ship_date:\n total += batch[\u0027qty\u0027] - batch[\u0027reserved\u0027]\n return total\n\n def _snapshot(self, sku):\n return [dict(batch) for batch in self.stock.get(sku, [])]\n\n","golden_completion":" def pick(self, sku, qty, pick_id, ship_date):\n if pick_id in self.picks:\n return self.picks[pick_id]\n if qty \u003c= 0:\n raise ValueError(\"pick quantity must be positive\")\n candidates = []\n for batch in self.stock.get(sku, []):\n available = batch[\u0027qty\u0027] - batch[\u0027reserved\u0027]\n if batch[\u0027expiry\u0027] \u003e ship_date and available \u003e 0:\n candidates.append((batch[\u0027expiry\u0027], batch, available))\n candidates.sort(key=lambda item: item[0])\n if sum(available for _, _, available in candidates) \u003c qty:\n raise ValueError(\"insufficient available stock\")\n remaining = qty\n allocations = []\n for _, batch, available in candidates:\n if remaining == 0:\n break\n take = min(available, remaining)\n batch[\u0027reserved\u0027] += take\n remaining -= take\n allocations.append({\u0027batch_id\u0027: batch[\u0027batch_id\u0027], \u0027qty\u0027: take, \u0027expiry\u0027: batch[\u0027expiry\u0027]})\n report = {\u0027pick_id\u0027: pick_id, \u0027sku\u0027: sku, \u0027qty\u0027: qty, \u0027ship_date\u0027: ship_date, \u0027allocations\u0027: allocations}\n self.picks[pick_id] = report\n self.audit_log.append({\u0027action\u0027: \u0027pick\u0027, \u0027report\u0027: report})\n return report\n","suffix":"\npicker = TransferPicker()\npicker.add_batch(\u0027A\u0027, \u0027late\u0027, 5, 20250601)\npicker.add_batch(\u0027A\u0027, \u0027early\u0027, 4, 20250501)\npicker.add_batch(\u0027A\u0027, \u0027expired\u0027, 99, 20250401)\n\nreport = picker.pick(\u0027A\u0027, 7, \u0027pick-1\u0027, 20250415)\nassert report == {\n \u0027pick_id\u0027: \u0027pick-1\u0027,\n \u0027sku\u0027: \u0027A\u0027,\n \u0027qty\u0027: 7,\n \u0027ship_date\u0027: 20250415,\n \u0027allocations\u0027: [\n {\u0027batch_id\u0027: \u0027early\u0027, \u0027qty\u0027: 4, \u0027expiry\u0027: 20250501},\n {\u0027batch_id\u0027: \u0027late\u0027, \u0027qty\u0027: 3, \u0027expiry\u0027: 20250601},\n ],\n}\nassert picker.available_quantity(\u0027A\u0027, 20250415) == 2\nassert picker.stock[\u0027A\u0027][0][\u0027reserved\u0027] == 3\nassert picker.stock[\u0027A\u0027][1][\u0027reserved\u0027] == 4\nassert picker.stock[\u0027A\u0027][2][\u0027reserved\u0027] == 0\n\nagain = picker.pick(\u0027A\u0027, 7, \u0027pick-1\u0027, 20250415)\nassert again is report\nassert picker.available_quantity(\u0027A\u0027, 20250415) == 2\nassert len(picker.audit_log) == 1\n\nbefore = picker._snapshot(\u0027A\u0027)\ntry:\n picker.pick(\u0027A\u0027, 3, \u0027pick-too-much\u0027, 20250415)\n assert False, \"insufficient pick should fail atomically\"\nexcept ValueError:\n pass\nassert picker._snapshot(\u0027A\u0027) == before\n","assertions":"\npicker2 = TransferPicker()\npicker2.add_batch(\u0027B\u0027, \u0027b1\u0027, 1, 20250102)\npicker2.add_batch(\u0027B\u0027, \u0027b2\u0027, 2, 20250103)\ntry:\n picker2.pick(\u0027B\u0027, 0, \u0027bad\u0027, 20250101)\n assert False, \"zero qty should fail\"\nexcept ValueError:\n pass\nassert picker2._snapshot(\u0027B\u0027) == [\n {\u0027batch_id\u0027: \u0027b1\u0027, \u0027qty\u0027: 1, \u0027reserved\u0027: 0, \u0027expiry\u0027: 20250102},\n {\u0027batch_id\u0027: \u0027b2\u0027, \u0027qty\u0027: 2, \u0027reserved\u0027: 0, \u0027expiry\u0027: 20250103},\n]\n\nreport2 = picker2.pick(\u0027B\u0027, 3, \u0027pick-all\u0027, 20250101)\nassert report2[\u0027allocations\u0027] == [\n {\u0027batch_id\u0027: \u0027b1\u0027, \u0027qty\u0027: 1, \u0027expiry\u0027: 20250102},\n {\u0027batch_id\u0027: \u0027b2\u0027, \u0027qty\u0027: 2, \u0027expiry\u0027: 20250103},\n]\nassert picker2.available_quantity(\u0027B\u0027, 20250101) == 0\n\npicker3 = TransferPicker()\npicker3.add_batch(\u0027C\u0027, \u0027c1\u0027, 10, 20250110)\ntry:\n picker3.pick(\u0027C\u0027, 1, \u0027boundary\u0027, 20250110)\n assert False, \"expiry equal to ship_date is expired\"\nexcept ValueError:\n pass\nassert picker3.stock[\u0027C\u0027][0][\u0027reserved\u0027] == 0\n","category":"code_purpose_understanding"} {"id":"22","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class UsageBilling:\n \"\"\"Usage invoice closing.\n close_period(period_id) must:\n - Be idempotent: if the period was already invoiced, return the same\n invoice object and do not append audit entries again.\n - Sum only events for period_id whose billed flag is False.\n - subtotal = base_fee + max(units - included_units, 0) * overage_rate.\n - If subtotal is below minimum_commit, invoice subtotal is minimum_commit.\n - Apply account credits in FIFO order after the minimum commit adjustment.\n Credits reduce amount_due but never below 0; partially used credits keep\n their remaining amount.\n - Mark the period\u0027s included events billed only after the invoice is built.\n - Return and audit an invoice dict with exact credit application details.\"\"\"\n\n def __init__(self, base_fee, included_units, overage_rate, minimum_commit):\n self.base_fee = float(base_fee)\n self.included_units = included_units\n self.overage_rate = float(overage_rate)\n self.minimum_commit = float(minimum_commit)\n self.events = []\n self.credits = []\n self.invoices = {}\n self.audit_log = []\n\n def record_usage(self, event_id, period_id, units):\n self.events.append({\u0027event_id\u0027: event_id, \u0027period_id\u0027: period_id, \u0027units\u0027: units, \u0027billed\u0027: False})\n\n def add_credit(self, credit_id, amount):\n self.credits.append({\u0027credit_id\u0027: credit_id, \u0027remaining\u0027: float(amount)})\n\n def _money(self, value):\n return round(value + 0.0, 2)\n\n","golden_completion":" def close_period(self, period_id):\n if period_id in self.invoices:\n return self.invoices[period_id]\n period_events = [event for event in self.events if event[\u0027period_id\u0027] == period_id and not event[\u0027billed\u0027]]\n units = sum(event[\u0027units\u0027] for event in period_events)\n overage_units = max(units - self.included_units, 0)\n raw_subtotal = self.base_fee + overage_units * self.overage_rate\n subtotal = self._money(max(raw_subtotal, self.minimum_commit))\n remaining_due = subtotal\n applied = []\n for credit in self.credits:\n if remaining_due == 0:\n break\n if credit[\u0027remaining\u0027] \u003c= 0:\n continue\n use = min(credit[\u0027remaining\u0027], remaining_due)\n credit[\u0027remaining\u0027] = self._money(credit[\u0027remaining\u0027] - use)\n remaining_due = self._money(remaining_due - use)\n applied.append({\u0027credit_id\u0027: credit[\u0027credit_id\u0027], \u0027amount\u0027: self._money(use)})\n invoice = {\u0027period_id\u0027: period_id, \u0027units\u0027: units, \u0027overage_units\u0027: overage_units, \u0027subtotal\u0027: subtotal, \u0027credits_applied\u0027: applied, \u0027amount_due\u0027: remaining_due}\n self.invoices[period_id] = invoice\n for event in period_events:\n event[\u0027billed\u0027] = True\n self.audit_log.append({\u0027action\u0027: \u0027close_period\u0027, \u0027invoice\u0027: invoice})\n return invoice\n","suffix":"\nbilling = UsageBilling(base_fee=100, included_units=1000, overage_rate=0.10, minimum_commit=150)\nbilling.record_usage(\u0027e1\u0027, \u00272026-01\u0027, 800)\nbilling.record_usage(\u0027e2\u0027, \u00272026-01\u0027, 500)\nbilling.record_usage(\u0027e3\u0027, \u00272026-02\u0027, 999)\nbilling.add_credit(\u0027c1\u0027, 30)\nbilling.add_credit(\u0027c2\u0027, 200)\n\ninvoice = billing.close_period(\u00272026-01\u0027)\n# units=1300, raw subtotal=100 + 300*0.10 = 130, minimum commit raises to 150\nassert invoice == {\n \u0027period_id\u0027: \u00272026-01\u0027,\n \u0027units\u0027: 1300,\n \u0027overage_units\u0027: 300,\n \u0027subtotal\u0027: 150.0,\n \u0027credits_applied\u0027: [{\u0027credit_id\u0027: \u0027c1\u0027, \u0027amount\u0027: 30.0}, {\u0027credit_id\u0027: \u0027c2\u0027, \u0027amount\u0027: 120.0}],\n \u0027amount_due\u0027: 0.0,\n}\nassert billing.credits == [{\u0027credit_id\u0027: \u0027c1\u0027, \u0027remaining\u0027: 0.0}, {\u0027credit_id\u0027: \u0027c2\u0027, \u0027remaining\u0027: 80.0}]\nassert [event[\u0027billed\u0027] for event in billing.events] == [True, True, False]\nassert billing.audit_log[-1] == {\u0027action\u0027: \u0027close_period\u0027, \u0027invoice\u0027: invoice}\n\nagain = billing.close_period(\u00272026-01\u0027)\nassert again is invoice\nassert len(billing.audit_log) == 1\nassert billing.credits[1][\u0027remaining\u0027] == 80.0\n","assertions":"\nbilling2 = UsageBilling(base_fee=50, included_units=10, overage_rate=2, minimum_commit=0)\nbilling2.record_usage(\u0027a\u0027, \u0027p1\u0027, 5)\nbilling2.record_usage(\u0027b\u0027, \u0027p1\u0027, 20)\nbilling2.add_credit(\u0027credit\u0027, 15)\ninvoice2 = billing2.close_period(\u0027p1\u0027)\nassert invoice2 == {\n \u0027period_id\u0027: \u0027p1\u0027,\n \u0027units\u0027: 25,\n \u0027overage_units\u0027: 15,\n \u0027subtotal\u0027: 80.0,\n \u0027credits_applied\u0027: [{\u0027credit_id\u0027: \u0027credit\u0027, \u0027amount\u0027: 15.0}],\n \u0027amount_due\u0027: 65.0,\n}\nassert billing2.credits == [{\u0027credit_id\u0027: \u0027credit\u0027, \u0027remaining\u0027: 0.0}]\n\nbilling3 = UsageBilling(base_fee=10, included_units=100, overage_rate=1, minimum_commit=25)\nempty_invoice = billing3.close_period(\u0027empty\u0027)\nassert empty_invoice == {\u0027period_id\u0027: \u0027empty\u0027, \u0027units\u0027: 0, \u0027overage_units\u0027: 0, \u0027subtotal\u0027: 25.0, \u0027credits_applied\u0027: [], \u0027amount_due\u0027: 25.0}\nassert billing3.events == []\nassert billing3.close_period(\u0027empty\u0027) is empty_invoice\nassert len(billing3.audit_log) == 1\n","category":"code_purpose_understanding"} {"id":"23","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class LeaveLedger:\n \"\"\"Employee leave request ledger.\n request_leave(employee, request_id, dates, leave_type, half_days=()) must:\n - Be idempotent by request_id: replay returns the original report object\n without changing balances or audit log.\n - Validate before mutating: employee exists, dates are non-empty, no date\n is in blackout_dates, and leave_type is \u0027vacation\u0027 or \u0027sick\u0027.\n - Each date costs 1.0 unit except dates in half_days cost 0.5.\n - Vacation requests require enough vacation balance and never create unpaid.\n - Sick requests consume sick balance first; any remainder becomes unpaid\n leave and increments unpaid_used.\n - Store a request report and append one audit entry on success.\"\"\"\n\n def __init__(self):\n self.employees = {}\n self.blackout_dates = set()\n self.requests = {}\n self.audit_log = []\n\n def add_employee(self, employee, vacation, sick):\n self.employees[employee] = {\n \u0027vacation\u0027: float(vacation),\n \u0027sick\u0027: float(sick),\n \u0027unpaid_used\u0027: 0.0,\n }\n\n def add_blackout(self, date):\n self.blackout_dates.add(date)\n\n def _units(self, dates, half_days):\n half = set(half_days)\n return sum(0.5 if date in half else 1.0 for date in dates)\n\n def _snapshot(self, employee):\n return dict(self.employees[employee])\n\n","golden_completion":" def request_leave(self, employee, request_id, dates, leave_type, half_days=()):\n if request_id in self.requests:\n return self.requests[request_id]\n if employee not in self.employees:\n raise ValueError(\"unknown employee\")\n if not dates:\n raise ValueError(\"leave dates required\")\n if leave_type not in (\u0027vacation\u0027, \u0027sick\u0027):\n raise ValueError(\"unknown leave type\")\n if any(date in self.blackout_dates for date in dates):\n raise ValueError(\"blackout date requested\")\n units = self._units(dates, half_days)\n balance = self.employees[employee]\n used_vacation = used_sick = unpaid = 0.0\n if leave_type == \u0027vacation\u0027:\n if units \u003e balance[\u0027vacation\u0027]:\n raise ValueError(\"insufficient vacation balance\")\n balance[\u0027vacation\u0027] = round(balance[\u0027vacation\u0027] - units, 2)\n used_vacation = units\n else:\n used_sick = min(balance[\u0027sick\u0027], units)\n unpaid = round(units - used_sick, 2)\n balance[\u0027sick\u0027] = round(balance[\u0027sick\u0027] - used_sick, 2)\n balance[\u0027unpaid_used\u0027] = round(balance[\u0027unpaid_used\u0027] + unpaid, 2)\n report = {\u0027employee\u0027: employee, \u0027request_id\u0027: request_id, \u0027dates\u0027: list(dates), \u0027leave_type\u0027: leave_type, \u0027units\u0027: units, \u0027used_vacation\u0027: used_vacation, \u0027used_sick\u0027: used_sick, \u0027unpaid\u0027: unpaid}\n self.requests[request_id] = report\n self.audit_log.append({\u0027action\u0027: \u0027request_leave\u0027, \u0027report\u0027: report})\n return report\n","suffix":"\nledger = LeaveLedger()\nledger.add_employee(\u0027alice\u0027, vacation=5, sick=1)\nledger.add_blackout(\u00272026-12-25\u0027)\n\nvac = ledger.request_leave(\u0027alice\u0027, \u0027r1\u0027, [\u00272026-05-01\u0027, \u00272026-05-02\u0027], \u0027vacation\u0027, half_days=[\u00272026-05-02\u0027])\nassert vac == {\n \u0027employee\u0027: \u0027alice\u0027, \u0027request_id\u0027: \u0027r1\u0027,\n \u0027dates\u0027: [\u00272026-05-01\u0027, \u00272026-05-02\u0027], \u0027leave_type\u0027: \u0027vacation\u0027,\n \u0027units\u0027: 1.5, \u0027used_vacation\u0027: 1.5, \u0027used_sick\u0027: 0.0, \u0027unpaid\u0027: 0.0,\n}\nassert ledger.employees[\u0027alice\u0027][\u0027vacation\u0027] == 3.5\n\nagain = ledger.request_leave(\u0027alice\u0027, \u0027r1\u0027, [\u0027ignored\u0027], \u0027sick\u0027)\nassert again is vac\nassert ledger.employees[\u0027alice\u0027][\u0027vacation\u0027] == 3.5\nassert len(ledger.audit_log) == 1\n\nbefore = ledger._snapshot(\u0027alice\u0027)\ntry:\n ledger.request_leave(\u0027alice\u0027, \u0027bad\u0027, [\u00272026-12-25\u0027], \u0027vacation\u0027)\n assert False, \"blackout date should fail before mutation\"\nexcept ValueError:\n pass\nassert ledger._snapshot(\u0027alice\u0027) == before\n\nsick = ledger.request_leave(\u0027alice\u0027, \u0027r2\u0027, [\u00272026-06-01\u0027, \u00272026-06-02\u0027], \u0027sick\u0027)\nassert sick[\u0027used_sick\u0027] == 1.0\nassert sick[\u0027unpaid\u0027] == 1.0\nassert ledger.employees[\u0027alice\u0027][\u0027sick\u0027] == 0.0\nassert ledger.employees[\u0027alice\u0027][\u0027unpaid_used\u0027] == 1.0\n","assertions":"\nledger2 = LeaveLedger()\nledger2.add_employee(\u0027bob\u0027, vacation=1, sick=0)\nfor args in [\n (\u0027missing\u0027, \u0027x\u0027, [\u00272026-01-01\u0027], \u0027vacation\u0027),\n (\u0027bob\u0027, \u0027x\u0027, [], \u0027vacation\u0027),\n (\u0027bob\u0027, \u0027x\u0027, [\u00272026-01-01\u0027], \u0027jury\u0027),\n]:\n try:\n ledger2.request_leave(*args)\n assert False, \"invalid request should fail\"\n except ValueError:\n pass\nassert ledger2._snapshot(\u0027bob\u0027) == {\u0027vacation\u0027: 1.0, \u0027sick\u0027: 0.0, \u0027unpaid_used\u0027: 0.0}\nassert ledger2.audit_log == []\n\ntry:\n ledger2.request_leave(\u0027bob\u0027, \u0027too-much\u0027, [\u0027d1\u0027, \u0027d2\u0027], \u0027vacation\u0027)\n assert False, \"vacation cannot spill into unpaid\"\nexcept ValueError:\n pass\nassert ledger2._snapshot(\u0027bob\u0027) == {\u0027vacation\u0027: 1.0, \u0027sick\u0027: 0.0, \u0027unpaid_used\u0027: 0.0}\n\nsick = ledger2.request_leave(\u0027bob\u0027, \u0027sick1\u0027, [\u0027d1\u0027], \u0027sick\u0027, half_days=[\u0027d1\u0027])\nassert sick[\u0027units\u0027] == 0.5\nassert sick[\u0027used_sick\u0027] == 0.0\nassert sick[\u0027unpaid\u0027] == 0.5\nassert ledger2.employees[\u0027bob\u0027][\u0027unpaid_used\u0027] == 0.5\n","category":"code_purpose_understanding"} {"id":"24","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class EntitlementLedger:\n \"\"\"Feature entitlement consumption.\n consume(user, feature, units, request_id, timestamp) must:\n - Be idempotent by request_id: replay returns the original result object and\n does not consume more units or append another audit entry.\n - Active denials override grants. Denials are active for\n valid_from \u003c= timestamp \u003c valid_until, with valid_until=None meaning forever.\n - Use only active grants for the same user and feature.\n - Validate enough active remaining units before mutating any grant.\n - Consume from grants expiring soonest first; grants with valid_until=None\n are consumed after dated grants.\n - Return exact allocations and remaining active units after consumption.\"\"\"\n\n def __init__(self):\n self.grants = []\n self.denials = []\n self.consumptions = {}\n self.audit_log = []\n\n def grant(self, grant_id, user, feature, units, valid_from, valid_until=None):\n self.grants.append({\n \u0027grant_id\u0027: grant_id, \u0027user\u0027: user, \u0027feature\u0027: feature,\n \u0027remaining\u0027: units, \u0027valid_from\u0027: valid_from, \u0027valid_until\u0027: valid_until,\n })\n\n def deny(self, user, feature, valid_from, valid_until=None):\n self.denials.append({\u0027user\u0027: user, \u0027feature\u0027: feature, \u0027valid_from\u0027: valid_from, \u0027valid_until\u0027: valid_until})\n\n def _active(self, row, timestamp):\n if timestamp \u003c row[\u0027valid_from\u0027]:\n return False\n if row[\u0027valid_until\u0027] is not None and timestamp \u003e= row[\u0027valid_until\u0027]:\n return False\n return True\n\n def _snapshot(self):\n return [dict(grant) for grant in self.grants]\n\n","golden_completion":" def consume(self, user, feature, units, request_id, timestamp):\n if request_id in self.consumptions:\n return self.consumptions[request_id]\n if units \u003c= 0:\n raise ValueError(\"units must be positive\")\n for denial in self.denials:\n if denial[\u0027user\u0027] == user and denial[\u0027feature\u0027] == feature and self._active(denial, timestamp):\n raise ValueError(\"active denial\")\n candidates = [grant for grant in self.grants if grant[\u0027user\u0027] == user and grant[\u0027feature\u0027] == feature and self._active(grant, timestamp) and grant[\u0027remaining\u0027] \u003e 0]\n candidates.sort(key=lambda grant: (grant[\u0027valid_until\u0027] is None, grant[\u0027valid_until\u0027] if grant[\u0027valid_until\u0027] is not None else 0))\n if sum(grant[\u0027remaining\u0027] for grant in candidates) \u003c units:\n raise ValueError(\"insufficient entitlement\")\n remaining_to_consume = units\n allocations = []\n for grant in candidates:\n if remaining_to_consume == 0:\n break\n take = min(grant[\u0027remaining\u0027], remaining_to_consume)\n grant[\u0027remaining\u0027] -= take\n remaining_to_consume -= take\n allocations.append({\u0027grant_id\u0027: grant[\u0027grant_id\u0027], \u0027units\u0027: take})\n remaining_active = sum(grant[\u0027remaining\u0027] for grant in candidates)\n result = {\u0027request_id\u0027: request_id, \u0027user\u0027: user, \u0027feature\u0027: feature, \u0027units\u0027: units, \u0027allocations\u0027: allocations, \u0027remaining_active\u0027: remaining_active}\n self.consumptions[request_id] = result\n self.audit_log.append({\u0027action\u0027: \u0027consume\u0027, \u0027result\u0027: result})\n return result\n","suffix":"\nledger = EntitlementLedger()\nledger.grant(\u0027g-late\u0027, \u0027u1\u0027, \u0027api\u0027, 10, valid_from=0, valid_until=None)\nledger.grant(\u0027g-soon\u0027, \u0027u1\u0027, \u0027api\u0027, 4, valid_from=0, valid_until=50)\nledger.grant(\u0027g-expired\u0027, \u0027u1\u0027, \u0027api\u0027, 99, valid_from=0, valid_until=10)\nledger.grant(\u0027g-other\u0027, \u0027u2\u0027, \u0027api\u0027, 100, valid_from=0, valid_until=50)\n\nresult = ledger.consume(\u0027u1\u0027, \u0027api\u0027, 7, \u0027req-1\u0027, timestamp=20)\nassert result == {\n \u0027request_id\u0027: \u0027req-1\u0027, \u0027user\u0027: \u0027u1\u0027, \u0027feature\u0027: \u0027api\u0027, \u0027units\u0027: 7,\n \u0027allocations\u0027: [{\u0027grant_id\u0027: \u0027g-soon\u0027, \u0027units\u0027: 4}, {\u0027grant_id\u0027: \u0027g-late\u0027, \u0027units\u0027: 3}],\n \u0027remaining_active\u0027: 7,\n}\nassert ledger.grants[0][\u0027remaining\u0027] == 7\nassert ledger.grants[1][\u0027remaining\u0027] == 0\nassert ledger.grants[2][\u0027remaining\u0027] == 99\n\nagain = ledger.consume(\u0027u1\u0027, \u0027api\u0027, 7, \u0027req-1\u0027, timestamp=20)\nassert again is result\nassert len(ledger.audit_log) == 1\n\nbefore = ledger._snapshot()\ntry:\n ledger.consume(\u0027u1\u0027, \u0027api\u0027, 8, \u0027too-many\u0027, timestamp=20)\n assert False, \"insufficient active units should fail atomically\"\nexcept ValueError:\n pass\nassert ledger._snapshot() == before\n\nledger.deny(\u0027u1\u0027, \u0027api\u0027, valid_from=30, valid_until=None)\ntry:\n ledger.consume(\u0027u1\u0027, \u0027api\u0027, 1, \u0027denied\u0027, timestamp=30)\n assert False, \"active denial overrides remaining grants\"\nexcept ValueError:\n pass\n","assertions":"\nledger2 = EntitlementLedger()\nledger2.grant(\u0027a\u0027, \u0027u\u0027, \u0027f\u0027, 1, 10, 20)\ntry:\n ledger2.consume(\u0027u\u0027, \u0027f\u0027, 1, \u0027early\u0027, timestamp=9)\n assert False, \"grant not active yet\"\nexcept ValueError:\n pass\nassert ledger2._snapshot()[0][\u0027remaining\u0027] == 1\n\ntry:\n ledger2.consume(\u0027u\u0027, \u0027f\u0027, 0, \u0027zero\u0027, timestamp=10)\n assert False, \"zero units should fail\"\nexcept ValueError:\n pass\nassert ledger2.audit_log == []\n\nok = ledger2.consume(\u0027u\u0027, \u0027f\u0027, 1, \u0027ok\u0027, timestamp=10)\nassert ok[\u0027allocations\u0027] == [{\u0027grant_id\u0027: \u0027a\u0027, \u0027units\u0027: 1}]\nassert ok[\u0027remaining_active\u0027] == 0\nassert ledger2.consume(\u0027u\u0027, \u0027f\u0027, 1, \u0027ok\u0027, timestamp=19) is ok\n\nledger3 = EntitlementLedger()\nledger3.grant(\u0027forever\u0027, \u0027u\u0027, \u0027f\u0027, 5, 0, None)\nledger3.deny(\u0027u\u0027, \u0027f\u0027, 0, 5)\ntry:\n ledger3.consume(\u0027u\u0027, \u0027f\u0027, 1, \u0027blocked\u0027, timestamp=4)\n assert False, \"temporary denial active\"\nexcept ValueError:\n pass\nassert ledger3.consume(\u0027u\u0027, \u0027f\u0027, 1, \u0027after\u0027, timestamp=5)[\u0027remaining_active\u0027] == 4\n","category":"code_purpose_understanding"} {"id":"25","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class LWWProjection:\n \"\"\"Last-Writer-Wins projection. Each key tracks the timestamp\n of the last write. A write with an older timestamp is ignored.\n Deletes are tracked as tombstones with timestamps.\n apply_event handles \u0027set\u0027 and \u0027delete\u0027 actions with timestamp \u0027ts\u0027.\n For \u0027set\u0027: ignore if tombstone \u003e= ts or existing write \u003e= ts.\n For \u0027delete\u0027: ignore if existing write \u003e ts (strictly greater).\n If delete ts \u003e= write ts, the key is removed and tombstone recorded.\n project(events) resets all state and applies events in order.\"\"\"\n\n def __init__(self):\n self.data = {}\n self.timestamps = {} # key -\u003e timestamp of last set\n self.tombstones = {} # key -\u003e timestamp of delete\n\n def _is_stale_set(self, key, ts):\n if key in self.tombstones and self.tombstones[key] \u003e= ts:\n return True\n if key in self.timestamps and self.timestamps[key] \u003e= ts:\n return True\n return False\n\n def project(self, events):\n self.data, self.timestamps, self.tombstones = {}, {}, {}\n for event in events:\n self.apply_event(event)\n\n","golden_completion":" def apply_event(self, event):\n key, ts, action = event[\u0027key\u0027], event[\u0027ts\u0027], event[\u0027action\u0027]\n if action == \u0027set\u0027:\n if self._is_stale_set(key, ts):\n return\n self.data[key], self.timestamps[key] = event[\u0027value\u0027], ts\n elif action == \u0027delete\u0027:\n if self.timestamps.get(key, -1) \u003e ts:\n return\n self.data.pop(key, None)\n self.tombstones[key] = ts\n self.timestamps.pop(key, None)\n","suffix":"\nproj = LWWProjection()\nevents = [\n {\u0027key\u0027: \u0027x\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 1, \u0027ts\u0027: 100},\n {\u0027key\u0027: \u0027x\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 2, \u0027ts\u0027: 200},\n {\u0027key\u0027: \u0027x\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 0, \u0027ts\u0027: 50}, # old, ignored\n]\nproj.project(events)\nassert proj.data == {\u0027x\u0027: 2}\n\n# Delete then set with older timestamp\nproj2 = LWWProjection()\nproj2.project([\n {\u0027key\u0027: \u0027y\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 10, \u0027ts\u0027: 100},\n {\u0027key\u0027: \u0027y\u0027, \u0027action\u0027: \u0027delete\u0027, \u0027ts\u0027: 200},\n {\u0027key\u0027: \u0027y\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 20, \u0027ts\u0027: 150}, # older than delete\n])\nassert \u0027y\u0027 not in proj2.data\n","assertions":"\n# Set after delete with newer timestamp\nproj3 = LWWProjection()\nproj3.project([\n {\u0027key\u0027: \u0027z\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 1, \u0027ts\u0027: 100},\n {\u0027key\u0027: \u0027z\u0027, \u0027action\u0027: \u0027delete\u0027, \u0027ts\u0027: 200},\n {\u0027key\u0027: \u0027z\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 2, \u0027ts\u0027: 300}, # newer than delete\n])\nassert proj3.data == {\u0027z\u0027: 2}\n\n# Equal timestamps: set-then-delete (both at ts=100)\nproj4 = LWWProjection()\nproj4.project([\n {\u0027key\u0027: \u0027a\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 1, \u0027ts\u0027: 100},\n {\u0027key\u0027: \u0027a\u0027, \u0027action\u0027: \u0027delete\u0027, \u0027ts\u0027: 100},\n])\nassert \u0027a\u0027 not in proj4.data\n\n# Multiple keys\nproj5 = LWWProjection()\nproj5.project([\n {\u0027key\u0027: \u0027a\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 1, \u0027ts\u0027: 1},\n {\u0027key\u0027: \u0027b\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 2, \u0027ts\u0027: 2},\n {\u0027key\u0027: \u0027a\u0027, \u0027action\u0027: \u0027set\u0027, \u0027value\u0027: 3, \u0027ts\u0027: 3},\n])\nassert proj5.data == {\u0027a\u0027: 3, \u0027b\u0027: 2}\n\n# Empty events\nproj6 = LWWProjection()\nproj6.project([])\nassert proj6.data == {}\n","category":"code_purpose_understanding"} {"id":"26","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class MilestoneEscrow:\n \"\"\"Construction milestone escrow.\n record_progress(milestone_id, release_id, percent_complete, defects_open, timestamp)\n must:\n - Be idempotent by release_id.\n - Validate before mutating: milestone exists and percent_complete is between\n the current percent and 100 inclusive.\n - Pay only the newly completed delta percent, not cumulative percent.\n - Withhold holdback_rate from each newly earned amount.\n - If defects_open is True, the non-holdback payable is blocked_payable\n instead of paid_now; progress and holdback still update.\n - If defects_open is False, non-holdback payable increases paid_to_vendor.\n - Return and audit the exact release report.\"\"\"\n\n def __init__(self):\n self.milestones = {}\n self.releases = {}\n self.audit_log = []\n\n def add_milestone(self, milestone_id, amount, holdback_rate):\n self.milestones[milestone_id] = {\n \u0027amount\u0027: float(amount),\n \u0027holdback_rate\u0027: float(holdback_rate),\n \u0027percent_complete\u0027: 0.0,\n \u0027earned\u0027: 0.0,\n \u0027holdback_held\u0027: 0.0,\n \u0027paid_to_vendor\u0027: 0.0,\n \u0027blocked_payable\u0027: 0.0,\n }\n\n def _money(self, value):\n return round(value + 0.0, 2)\n\n def _snapshot(self, milestone_id):\n return dict(self.milestones[milestone_id])\n\n","golden_completion":" def record_progress(self, milestone_id, release_id, percent_complete, defects_open, timestamp):\n if release_id in self.releases:\n return self.releases[release_id]\n if milestone_id not in self.milestones:\n raise ValueError(\"unknown milestone\")\n milestone = self.milestones[milestone_id]\n percent_complete = float(percent_complete)\n if percent_complete \u003c milestone[\u0027percent_complete\u0027] or percent_complete \u003e 100:\n raise ValueError(\"invalid progress percent\")\n delta_percent = percent_complete - milestone[\u0027percent_complete\u0027]\n gross = self._money(milestone[\u0027amount\u0027] * delta_percent / 100)\n holdback = self._money(gross * milestone[\u0027holdback_rate\u0027])\n payable = self._money(gross - holdback)\n paid_now = 0.0 if defects_open else payable\n blocked = payable if defects_open else 0.0\n milestone[\u0027percent_complete\u0027] = percent_complete\n milestone[\u0027earned\u0027] = self._money(milestone[\u0027earned\u0027] + gross)\n milestone[\u0027holdback_held\u0027] = self._money(milestone[\u0027holdback_held\u0027] + holdback)\n milestone[\u0027paid_to_vendor\u0027] = self._money(milestone[\u0027paid_to_vendor\u0027] + paid_now)\n milestone[\u0027blocked_payable\u0027] = self._money(milestone[\u0027blocked_payable\u0027] + blocked)\n report = {\u0027milestone_id\u0027: milestone_id, \u0027release_id\u0027: release_id, \u0027delta_percent\u0027: delta_percent, \u0027gross_earned\u0027: gross, \u0027holdback\u0027: holdback, \u0027paid_now\u0027: paid_now, \u0027blocked_payable\u0027: blocked, \u0027percent_complete\u0027: percent_complete, \u0027ts\u0027: timestamp}\n self.releases[release_id] = report\n self.audit_log.append({\u0027action\u0027: \u0027record_progress\u0027, \u0027report\u0027: report})\n return report\n","suffix":"\nescrow = MilestoneEscrow()\nescrow.add_milestone(\u0027foundation\u0027, amount=1000, holdback_rate=0.10)\n\nr1 = escrow.record_progress(\u0027foundation\u0027, \u0027rel-1\u0027, 40, defects_open=False, timestamp=1)\nassert r1 == {\n \u0027milestone_id\u0027: \u0027foundation\u0027, \u0027release_id\u0027: \u0027rel-1\u0027,\n \u0027delta_percent\u0027: 40.0, \u0027gross_earned\u0027: 400.0, \u0027holdback\u0027: 40.0,\n \u0027paid_now\u0027: 360.0, \u0027blocked_payable\u0027: 0.0, \u0027percent_complete\u0027: 40.0, \u0027ts\u0027: 1,\n}\nassert escrow.milestones[\u0027foundation\u0027][\u0027paid_to_vendor\u0027] == 360.0\nassert escrow.milestones[\u0027foundation\u0027][\u0027holdback_held\u0027] == 40.0\n\nr2 = escrow.record_progress(\u0027foundation\u0027, \u0027rel-2\u0027, 70, defects_open=True, timestamp=2)\nassert r2[\u0027delta_percent\u0027] == 30.0 # only newly completed progress is earned\nassert r2[\u0027gross_earned\u0027] == 300.0\nassert r2[\u0027holdback\u0027] == 30.0\nassert r2[\u0027paid_now\u0027] == 0.0\nassert r2[\u0027blocked_payable\u0027] == 270.0\nassert escrow.milestones[\u0027foundation\u0027][\u0027paid_to_vendor\u0027] == 360.0\nassert escrow.milestones[\u0027foundation\u0027][\u0027blocked_payable\u0027] == 270.0\n\nagain = escrow.record_progress(\u0027foundation\u0027, \u0027rel-2\u0027, 99, defects_open=False, timestamp=99)\nassert again is r2\nassert escrow.milestones[\u0027foundation\u0027][\u0027percent_complete\u0027] == 70.0\nassert len(escrow.audit_log) == 2\n\nbefore = escrow._snapshot(\u0027foundation\u0027)\ntry:\n escrow.record_progress(\u0027foundation\u0027, \u0027bad\u0027, 60, defects_open=False, timestamp=3)\n assert False, \"regressing progress should fail before mutation\"\nexcept ValueError:\n pass\nassert escrow._snapshot(\u0027foundation\u0027) == before\n","assertions":"\nescrow2 = MilestoneEscrow()\nescrow2.add_milestone(\u0027roof\u0027, amount=333.33, holdback_rate=0.15)\ntry:\n escrow2.record_progress(\u0027missing\u0027, \u0027x\u0027, 10, False, 1)\n assert False, \"unknown milestone\"\nexcept ValueError:\n pass\ntry:\n escrow2.record_progress(\u0027roof\u0027, \u0027x\u0027, 101, False, 1)\n assert False, \"over 100 percent\"\nexcept ValueError:\n pass\nassert escrow2._snapshot(\u0027roof\u0027)[\u0027earned\u0027] == 0.0\nassert escrow2.audit_log == []\n\nr = escrow2.record_progress(\u0027roof\u0027, \u0027r1\u0027, 100, defects_open=False, timestamp=5)\nassert r[\u0027gross_earned\u0027] == 333.33\nassert r[\u0027holdback\u0027] == 50.0\nassert r[\u0027paid_now\u0027] == 283.33\nassert escrow2.record_progress(\u0027roof\u0027, \u0027r1\u0027, 100, False, 6) is r\nassert len(escrow2.audit_log) == 1\n","category":"code_purpose_understanding"} {"id":"27","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class PharmacyRefill:\n \"\"\"Prescription refill policy using integer service days.\n fill(rx_id, fill_id, requested_days, service_day, expedited=False) must:\n - Be idempotent by fill_id.\n - Validate before mutating: rx exists, requested_days \u003e 0, prescription is active.\n - First fill does not consume a refill; later fills decrement refills_remaining.\n - Standard fills cannot exceed plan_max_days. Expedited fills may exceed\n plan_max_days, but controlled substances can never be expedited.\n - Too-soon rule: after any fill, next eligible day is\n last_fill_day + int(last_days_supply * refill_threshold).\n - Refill attempts before next eligible day fail before mutation.\n - Copay is per fill, not per day, and depends on the prescription tier.\n - Return and audit the exact fill report.\"\"\"\n\n TIER_COPAY = {\u0027generic\u0027: 5.0, \u0027preferred\u0027: 20.0, \u0027specialty\u0027: 75.0}\n\n def __init__(self, plan_max_days=30, refill_threshold=0.8):\n self.plan_max_days = plan_max_days\n self.refill_threshold = refill_threshold\n self.prescriptions = {}\n self.fills = {}\n self.audit_log = []\n\n def add_prescription(self, rx_id, daily_qty, refills, tier=\u0027generic\u0027, controlled=False):\n self.prescriptions[rx_id] = {\n \u0027daily_qty\u0027: daily_qty,\n \u0027refills_remaining\u0027: refills,\n \u0027tier\u0027: tier,\n \u0027controlled\u0027: controlled,\n \u0027active\u0027: True,\n \u0027last_fill_day\u0027: None,\n \u0027last_days_supply\u0027: None,\n }\n\n def deactivate(self, rx_id):\n self.prescriptions[rx_id][\u0027active\u0027] = False\n\n def _next_eligible_day(self, rx):\n if rx[\u0027last_fill_day\u0027] is None:\n return None\n return rx[\u0027last_fill_day\u0027] + int(rx[\u0027last_days_supply\u0027] * self.refill_threshold)\n\n def _snapshot(self, rx_id):\n return dict(self.prescriptions[rx_id])\n\n","golden_completion":" def fill(self, rx_id, fill_id, requested_days, service_day, expedited=False):\n if fill_id in self.fills:\n return self.fills[fill_id]\n if rx_id not in self.prescriptions:\n raise ValueError(\"unknown prescription\")\n rx = self.prescriptions[rx_id]\n if not rx[\u0027active\u0027]:\n raise ValueError(\"inactive prescription\")\n if requested_days \u003c= 0:\n raise ValueError(\"requested days must be positive\")\n if requested_days \u003e self.plan_max_days and not expedited:\n raise ValueError(\"days supply exceeds plan maximum\")\n if expedited and rx[\u0027controlled\u0027]:\n raise ValueError(\"controlled prescriptions cannot be expedited\")\n next_eligible = self._next_eligible_day(rx)\n is_refill = rx[\u0027last_fill_day\u0027] is not None\n if next_eligible is not None and service_day \u003c next_eligible:\n raise ValueError(\"refill too soon\")\n if is_refill and rx[\u0027refills_remaining\u0027] \u003c= 0:\n raise ValueError(\"no refills remaining\")\n if is_refill:\n rx[\u0027refills_remaining\u0027] -= 1\n qty = rx[\u0027daily_qty\u0027] * requested_days\n copay = self.TIER_COPAY[rx[\u0027tier\u0027]]\n rx[\u0027last_fill_day\u0027] = service_day\n rx[\u0027last_days_supply\u0027] = requested_days\n report = {\u0027rx_id\u0027: rx_id, \u0027fill_id\u0027: fill_id, \u0027days_supply\u0027: requested_days, \u0027quantity\u0027: qty, \u0027copay\u0027: copay, \u0027refills_remaining\u0027: rx[\u0027refills_remaining\u0027], \u0027next_eligible_day\u0027: self._next_eligible_day(rx), \u0027expedited\u0027: expedited}\n self.fills[fill_id] = report\n self.audit_log.append({\u0027action\u0027: \u0027fill\u0027, \u0027report\u0027: report})\n return report\n","suffix":"\npharm = PharmacyRefill(plan_max_days=30, refill_threshold=0.8)\npharm.add_prescription(\u0027rx1\u0027, daily_qty=2, refills=1, tier=\u0027preferred\u0027)\n\nfirst = pharm.fill(\u0027rx1\u0027, \u0027fill-1\u0027, 30, service_day=100)\nassert first == {\n \u0027rx_id\u0027: \u0027rx1\u0027, \u0027fill_id\u0027: \u0027fill-1\u0027, \u0027days_supply\u0027: 30,\n \u0027quantity\u0027: 60, \u0027copay\u0027: 20.0, \u0027refills_remaining\u0027: 1,\n \u0027next_eligible_day\u0027: 124, \u0027expedited\u0027: False,\n}\nassert pharm.prescriptions[\u0027rx1\u0027][\u0027refills_remaining\u0027] == 1 # first fill does not consume refill\n\nagain = pharm.fill(\u0027rx1\u0027, \u0027fill-1\u0027, 999, service_day=999, expedited=True)\nassert again is first\nassert len(pharm.audit_log) == 1\n\nbefore = pharm._snapshot(\u0027rx1\u0027)\ntry:\n pharm.fill(\u0027rx1\u0027, \u0027too-soon\u0027, 30, service_day=123)\n assert False, \"too soon should fail before mutation\"\nexcept ValueError:\n pass\nassert pharm._snapshot(\u0027rx1\u0027) == before\n\nsecond = pharm.fill(\u0027rx1\u0027, \u0027fill-2\u0027, 30, service_day=124)\nassert second[\u0027refills_remaining\u0027] == 0\nassert second[\u0027next_eligible_day\u0027] == 148\n\npharm.add_prescription(\u0027rx2\u0027, daily_qty=1, refills=0, tier=\u0027specialty\u0027)\nexpedited = pharm.fill(\u0027rx2\u0027, \u0027fill-3\u0027, 45, service_day=200, expedited=True)\nassert expedited[\u0027days_supply\u0027] == 45\nassert expedited[\u0027copay\u0027] == 75.0\n","assertions":"\npharm2 = PharmacyRefill(plan_max_days=30, refill_threshold=0.75)\npharm2.add_prescription(\u0027ctrl\u0027, daily_qty=1, refills=1, controlled=True)\nfor args in [\n (\u0027missing\u0027, \u0027x\u0027, 1, 1, False),\n (\u0027ctrl\u0027, \u0027x\u0027, 0, 1, False),\n (\u0027ctrl\u0027, \u0027x\u0027, 31, 1, False),\n (\u0027ctrl\u0027, \u0027x\u0027, 31, 1, True),\n]:\n try:\n pharm2.fill(*args)\n assert False, \"invalid fill should fail\"\n except ValueError:\n pass\nassert pharm2._snapshot(\u0027ctrl\u0027)[\u0027last_fill_day\u0027] is None\nassert pharm2.audit_log == []\n\nok = pharm2.fill(\u0027ctrl\u0027, \u0027ok1\u0027, 20, 10)\nassert ok[\u0027next_eligible_day\u0027] == 25\ntry:\n pharm2.fill(\u0027ctrl\u0027, \u0027early\u0027, 20, 24)\n assert False, \"too soon boundary\"\nexcept ValueError:\n pass\nrefill = pharm2.fill(\u0027ctrl\u0027, \u0027ok2\u0027, 20, 25)\nassert refill[\u0027refills_remaining\u0027] == 0\ntry:\n pharm2.fill(\u0027ctrl\u0027, \u0027none-left\u0027, 20, 40)\n assert False, \"no refills remaining\"\nexcept ValueError:\n pass\n","category":"code_purpose_understanding"} {"id":"28","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class IncidentSLA:\n \"\"\"Incident SLA state machine using integer minute timestamps.\n transition(event_id, new_state, timestamp, reason=\u0027\u0027) must:\n - Be idempotent by event_id.\n - Enforce transitions:\n open -\u003e acknowledged\n acknowledged -\u003e paused or mitigated\n paused -\u003e acknowledged\n mitigated -\u003e resolved\n - While paused, elapsed SLA time stops. Resuming from paused adds the pause\n duration to paused_total before changing state.\n - acknowledged_at is set only on the first acknowledged transition.\n - resolved_at is set only on resolved.\n - ack_breached is computed when first acknowledged:\n timestamp - created_at - paused_total \u003e ack_target.\n - resolve_breached is computed when resolved:\n timestamp - created_at - paused_total \u003e resolve_target.\n - Return and audit an exact transition report.\"\"\"\n\n ALLOWED = {\n \u0027open\u0027: {\u0027acknowledged\u0027},\n \u0027acknowledged\u0027: {\u0027paused\u0027, \u0027mitigated\u0027},\n \u0027paused\u0027: {\u0027acknowledged\u0027},\n \u0027mitigated\u0027: {\u0027resolved\u0027},\n \u0027resolved\u0027: set(),\n }\n\n def __init__(self, incident_id, created_at, ack_target, resolve_target):\n self.incident_id = incident_id\n self.created_at = created_at\n self.ack_target = ack_target\n self.resolve_target = resolve_target\n self.state = \u0027open\u0027\n self.acknowledged_at = None\n self.resolved_at = None\n self.paused_at = None\n self.paused_total = 0\n self.ack_breached = False\n self.resolve_breached = False\n self.events = {}\n self.audit_log = []\n\n def _elapsed(self, timestamp):\n return timestamp - self.created_at - self.paused_total\n\n def _snapshot(self):\n return {\n \u0027state\u0027: self.state,\n \u0027acknowledged_at\u0027: self.acknowledged_at,\n \u0027resolved_at\u0027: self.resolved_at,\n \u0027paused_at\u0027: self.paused_at,\n \u0027paused_total\u0027: self.paused_total,\n \u0027ack_breached\u0027: self.ack_breached,\n \u0027resolve_breached\u0027: self.resolve_breached,\n }\n\n","golden_completion":" def transition(self, event_id, new_state, timestamp, reason=\u0027\u0027):\n if event_id in self.events:\n return self.events[event_id]\n if new_state not in self.ALLOWED[self.state]:\n raise ValueError(f\"Cannot transition from {self.state} to {new_state}\")\n old_state = self.state\n if old_state == \u0027paused\u0027 and new_state == \u0027acknowledged\u0027:\n self.paused_total += timestamp - self.paused_at\n self.paused_at = None\n if new_state == \u0027paused\u0027:\n self.paused_at = timestamp\n if new_state == \u0027acknowledged\u0027 and self.acknowledged_at is None:\n self.acknowledged_at = timestamp\n self.ack_breached = self._elapsed(timestamp) \u003e self.ack_target\n if new_state == \u0027resolved\u0027:\n self.resolved_at = timestamp\n self.resolve_breached = self._elapsed(timestamp) \u003e self.resolve_target\n self.state = new_state\n report = {\u0027event_id\u0027: event_id, \u0027from\u0027: old_state, \u0027to\u0027: new_state, \u0027ts\u0027: timestamp, \u0027reason\u0027: reason, \u0027elapsed\u0027: self._elapsed(timestamp), \u0027paused_total\u0027: self.paused_total, \u0027ack_breached\u0027: self.ack_breached, \u0027resolve_breached\u0027: self.resolve_breached}\n self.events[event_id] = report\n self.audit_log.append({\u0027action\u0027: \u0027transition\u0027, \u0027report\u0027: report})\n return report\n","suffix":"\ninc = IncidentSLA(\u0027inc1\u0027, created_at=100, ack_target=10, resolve_target=60)\nack = inc.transition(\u0027e1\u0027, \u0027acknowledged\u0027, 108, reason=\u0027paged\u0027)\nassert ack == {\n \u0027event_id\u0027: \u0027e1\u0027, \u0027from\u0027: \u0027open\u0027, \u0027to\u0027: \u0027acknowledged\u0027, \u0027ts\u0027: 108,\n \u0027reason\u0027: \u0027paged\u0027, \u0027elapsed\u0027: 8, \u0027paused_total\u0027: 0,\n \u0027ack_breached\u0027: False, \u0027resolve_breached\u0027: False,\n}\nassert inc.acknowledged_at == 108\n\npaused = inc.transition(\u0027e2\u0027, \u0027paused\u0027, 120, reason=\u0027customer hold\u0027)\nassert paused[\u0027elapsed\u0027] == 20\nassert inc.paused_at == 120\n\nresumed = inc.transition(\u0027e3\u0027, \u0027acknowledged\u0027, 150, reason=\u0027customer replied\u0027)\nassert resumed[\u0027paused_total\u0027] == 30\nassert resumed[\u0027elapsed\u0027] == 20 # 150 - 100 - 30\nassert inc.paused_at is None\nassert inc.acknowledged_at == 108 # first ack is preserved\n\nmitigated = inc.transition(\u0027e4\u0027, \u0027mitigated\u0027, 170)\nassert mitigated[\u0027elapsed\u0027] == 40\nresolved = inc.transition(\u0027e5\u0027, \u0027resolved\u0027, 200)\nassert resolved[\u0027elapsed\u0027] == 70\nassert resolved[\u0027resolve_breached\u0027] is True\nassert inc.resolved_at == 200\n\nagain = inc.transition(\u0027e5\u0027, \u0027resolved\u0027, 999)\nassert again is resolved\nassert len(inc.audit_log) == 5\n","assertions":"\ninc2 = IncidentSLA(\u0027inc2\u0027, created_at=0, ack_target=5, resolve_target=20)\nbefore = inc2._snapshot()\ntry:\n inc2.transition(\u0027bad\u0027, \u0027resolved\u0027, 1)\n assert False, \"invalid transition\"\nexcept ValueError:\n pass\nassert inc2._snapshot() == before\nassert inc2.audit_log == []\n\nlate_ack = inc2.transition(\u0027a\u0027, \u0027acknowledged\u0027, 6)\nassert late_ack[\u0027ack_breached\u0027] is True\nassert inc2.ack_breached is True\ninc2.transition(\u0027p\u0027, \u0027paused\u0027, 10)\ninc2.transition(\u0027r\u0027, \u0027acknowledged\u0027, 30)\ninc2.transition(\u0027m\u0027, \u0027mitigated\u0027, 35)\ndone = inc2.transition(\u0027done\u0027, \u0027resolved\u0027, 40)\nassert done[\u0027paused_total\u0027] == 20\nassert done[\u0027elapsed\u0027] == 20\nassert done[\u0027resolve_breached\u0027] is False\n\ntry:\n inc2.transition(\u0027after\u0027, \u0027paused\u0027, 41)\n assert False, \"resolved incidents cannot transition\"\nexcept ValueError:\n pass\n","category":"code_purpose_understanding"} {"id":"29","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class LRUCache:\n def __init__(self, max_size):\n self.max_size = max_size\n self.cache = {}\n self.access_order = [] # most-recently-used at the END\n\n def _touch(self, key):\n if key in self.access_order:\n self.access_order.remove(key)\n self.access_order.append(key)\n\n def get(self, key):\n if key not in self.cache:\n return None\n self._touch(key)\n return self.cache[key]\n\n","golden_completion":" def set(self, key, value):\n if key in self.cache:\n self.cache[key] = value\n self._touch(key)\n return\n if len(self.cache) \u003e= self.max_size:\n evicted = self.access_order.pop(0)\n del self.cache[evicted]\n self.cache[key] = value\n self._touch(key)\n\n","suffix":"lru = LRUCache(3)\nlru.set(\u0027a\u0027, 1)\nlru.set(\u0027b\u0027, 2)\nlru.set(\u0027c\u0027, 3)\nlru.get(\u0027a\u0027)\n\n# Adding \u0027d\u0027 should evict \u0027b\u0027 (LRU), not \u0027a\u0027\nlru.set(\u0027d\u0027, 4)\nassert lru.get(\u0027b\u0027) is None, \u0027b should have been evicted (LRU)\u0027\nassert lru.get(\u0027a\u0027) == 1\nassert lru.get(\u0027c\u0027) == 3\nassert lru.get(\u0027d\u0027) == 4\n","assertions":"lru2 = LRUCache(2)\nlru2.set(\u0027x\u0027, 1)\nlru2.set(\u0027y\u0027, 2)\nlru2.set(\u0027x\u0027, 10)\nassert lru2.get(\u0027x\u0027) == 10\nassert lru2.get(\u0027y\u0027) == 2\n\nlru3 = LRUCache(3)\nlru3.set(\u0027a\u0027, 1)\nlru3.set(\u0027b\u0027, 2)\nlru3.set(\u0027c\u0027, 3)\nlru3.get(\u0027a\u0027)\nlru3.get(\u0027b\u0027)\nlru3.set(\u0027d\u0027, 4) # evict \u0027c\u0027\nassert lru3.get(\u0027c\u0027) is None\nassert lru3.get(\u0027a\u0027) == 1\nassert lru3.get(\u0027b\u0027) == 2\n","category":"code_purpose_understanding"} {"id":"30","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class TwoLevelCache:\n def __init__(self, l1_max_size):\n self.l1 = {}\n self.l1_order = []\n self.l1_max = l1_max_size\n self.l2 = {}\n\n def _l1_evict(self):\n if len(self.l1) \u003e self.l1_max:\n oldest = self.l1_order.pop(0)\n del self.l1[oldest]\n # Inclusive: L2 keeps evicted entries\n\n def _l1_touch(self, key):\n if key in self.l1_order:\n self.l1_order.remove(key)\n self.l1_order.append(key)\n\n","golden_completion":" def get(self, key):\n if key in self.l1:\n self._l1_touch(key); return self.l1[key]\n if key in self.l2:\n self.l1[key] = self.l2[key]\n self._l1_touch(key); self._l1_evict()\n return self.l2[key]\n return None\n\n def set(self, key, value):\n self.l1[key] = value; self.l2[key] = value\n self._l1_touch(key); self._l1_evict()\n\n","suffix":"tc = TwoLevelCache(2)\ntc.set(\u0027a\u0027, 1)\ntc.set(\u0027b\u0027, 2)\ntc.set(\u0027c\u0027, 3) # evicts \u0027a\u0027 from L1\n\nassert tc.l1.get(\u0027a\u0027) is None\nassert tc.l2.get(\u0027a\u0027) == 1 # inclusive: L2 keeps it\n\nassert tc.get(\u0027a\u0027) == 1 # promotes from L2\nassert \u0027a\u0027 in tc.l1\n","assertions":"tc2 = TwoLevelCache(2)\ntc2.set(\u0027x\u0027, 10)\nassert tc2.l1[\u0027x\u0027] == 10\nassert tc2.l2[\u0027x\u0027] == 10\n\ntc2.set(\u0027y\u0027, 20)\ntc2.set(\u0027z\u0027, 30)\nassert \u0027x\u0027 not in tc2.l1\nassert tc2.get(\u0027x\u0027) == 10\n\ntc3 = TwoLevelCache(1)\ntc3.set(\u0027a\u0027, 1)\ntc3.set(\u0027b\u0027, 2)\ntc3.set(\u0027c\u0027, 3)\nassert tc3.l2 == {\u0027a\u0027: 1, \u0027b\u0027: 2, \u0027c\u0027: 3}\nassert tc3.get(\u0027a\u0027) == 1\n","category":"code_purpose_understanding"} {"id":"31","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class FixedWindowRateLimiter:\n \"\"\"Allows N requests per fixed time window.\n Window resets at fixed intervals from epoch, not rolling.\"\"\"\n\n def __init__(self, max_requests, window_seconds, clock=None):\n self.max_requests = max_requests\n self.window_seconds = window_seconds\n self.clock = clock or (lambda: __import__(\u0027time\u0027).monotonic())\n self.counts = {}\n\n def _window_id(self, now):\n return int(now // self.window_seconds)\n\n","golden_completion":" def allow(self, key=\u0027default\u0027):\n now = self.clock()\n wid = self._window_id(now)\n bucket = (key, wid)\n current = self.counts.get(bucket, 0)\n if current \u003e= self.max_requests:\n return False\n self.counts[bucket] = current + 1\n return True\n\n","suffix":"class FakeClock:\n def __init__(self, start=0):\n self.now = start\n def __call__(self):\n return self.now\n def advance(self, s):\n self.now += s\n\nclock = FakeClock(100)\nrl = FixedWindowRateLimiter(3, 10, clock=clock)\nassert rl.allow(\u0027u1\u0027) == True\nassert rl.allow(\u0027u1\u0027) == True\nassert rl.allow(\u0027u1\u0027) == True\nassert rl.allow(\u0027u1\u0027) == False\n\nassert rl.allow(\u0027u2\u0027) == True\n\nclock.advance(10)\nassert rl.allow(\u0027u1\u0027) == True\n","assertions":"clock2 = FakeClock(19)\nrl2 = FixedWindowRateLimiter(2, 10, clock=clock2)\nassert rl2.allow() == True\nassert rl2.allow() == True\nassert rl2.allow() == False\nclock2.advance(1)\nassert rl2.allow() == True\n\nrl3 = FixedWindowRateLimiter(1, 10, clock=FakeClock(0))\nassert rl3.allow(\u0027a\u0027) == True\nassert rl3.allow(\u0027a\u0027) == False\nassert rl3.allow(\u0027b\u0027) == True\n","category":"code_purpose_understanding"} {"id":"32","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class TokenBucketLimiter:\n \"\"\"Tokens refill at \u0027rate\u0027 per second up to \u0027max_burst\u0027.\n Each allow() consumes one token. New keys start with max_burst tokens.\"\"\"\n\n def __init__(self, rate, max_burst, clock=None):\n self.rate = rate\n self.max_burst = max_burst\n self.clock = clock or (lambda: __import__(\u0027time\u0027).monotonic())\n self.tokens = {}\n self.last_refill = {}\n\n","golden_completion":" def allow(self, key=\u0027default\u0027):\n now = self.clock()\n if key not in self.tokens:\n self.tokens[key] = self.max_burst\n self.last_refill[key] = now\n elapsed = now - self.last_refill[key]\n self.tokens[key] = min(self.max_burst, self.tokens[key] + elapsed * self.rate)\n self.last_refill[key] = now\n if self.tokens[key] \u003e= 1:\n self.tokens[key] -= 1\n return True\n return False\n\n","suffix":"class FakeClock:\n def __init__(self, start=0):\n self.now = start\n def __call__(self):\n return self.now\n def advance(self, s):\n self.now += s\n\nclock = FakeClock(0)\ntb = TokenBucketLimiter(rate=1, max_burst=5, clock=clock)\n\nfor i in range(5):\n assert tb.allow() == True, f\u0027Burst {i} should be allowed\u0027\nassert tb.allow() == False\n\nclock.advance(3)\nfor i in range(3):\n assert tb.allow() == True\nassert tb.allow() == False\n\nclock.advance(100)\nfor i in range(5):\n assert tb.allow() == True\nassert tb.allow() == False # capped at max_burst\n","assertions":"clock2 = FakeClock(0)\ntb2 = TokenBucketLimiter(rate=2, max_burst=3, clock=clock2)\nfor _ in range(3): tb2.allow()\nassert tb2.allow() == False\nclock2.advance(0.5)\nassert tb2.allow() == True\nassert tb2.allow() == False\n\nclock3 = FakeClock(0)\ntb3 = TokenBucketLimiter(rate=1, max_burst=1, clock=clock3)\nassert tb3.allow(\u0027a\u0027) == True\nassert tb3.allow(\u0027a\u0027) == False\nassert tb3.allow(\u0027b\u0027) == True\n","category":"code_purpose_understanding"} {"id":"33","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class QuotaManager:\n \"\"\"Daily and monthly quotas reset at calendar boundaries.\n Daily resets at midnight (day change). Monthly resets on 1st.\n Both must have capacity for a request to be allowed.\"\"\"\n\n def __init__(self, daily_limit, monthly_limit, clock=None):\n self.daily_limit = daily_limit\n self.monthly_limit = monthly_limit\n self.clock = clock # returns (year, month, day)\n self.daily_usage = {}\n self.monthly_usage = {}\n\n","golden_completion":" def check_and_consume(self, user):\n year, month, day = self.clock()\n d_key = (user, year, month, day)\n m_key = (user, year, month)\n d_used = self.daily_usage.get(d_key, 0)\n m_used = self.monthly_usage.get(m_key, 0)\n if d_used \u003e= self.daily_limit or m_used \u003e= self.monthly_limit:\n return False\n self.daily_usage[d_key] = d_used + 1\n self.monthly_usage[m_key] = m_used + 1\n return True\n\n","suffix":"current_date = [2024, 1, 15]\ndef fake_clock():\n return tuple(current_date)\n\nqm = QuotaManager(daily_limit=3, monthly_limit=5, clock=fake_clock)\n\nassert qm.check_and_consume(\u0027alice\u0027) == True\nassert qm.check_and_consume(\u0027alice\u0027) == True\nassert qm.check_and_consume(\u0027alice\u0027) == True\nassert qm.check_and_consume(\u0027alice\u0027) == False # daily limit\n\ncurrent_date[2] = 16 # new day\nassert qm.check_and_consume(\u0027alice\u0027) == True\nassert qm.check_and_consume(\u0027alice\u0027) == True # 5th this month\nassert qm.check_and_consume(\u0027alice\u0027) == False # monthly limit\n","assertions":"current_date[:] = [2024, 2, 1]\nassert qm.check_and_consume(\u0027alice\u0027) == True # new month resets\n\nassert qm.check_and_consume(\u0027bob\u0027) == True\ncurrent_date[:] = [2024, 2, 2]\nassert qm.check_and_consume(\u0027bob\u0027) == True\n","category":"code_purpose_understanding"} {"id":"34","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class EndpointRateLimiter:\n def __init__(self, clock=None):\n self.clock = clock or (lambda: __import__(\u0027time\u0027).monotonic())\n self.limits = {} # endpoint -\u003e (max_req, window_sec)\n self.requests = {} # (endpoint, user, window_id) -\u003e count\n\n def configure(self, endpoint, max_requests, window_seconds):\n self.limits[endpoint] = (max_requests, window_seconds)\n\n","golden_completion":" def allow(self, endpoint, user=None):\n if endpoint not in self.limits:\n return True\n max_req, window_sec = self.limits[endpoint]\n now = self.clock()\n wid = int(now // window_sec)\n key = (endpoint, user, wid)\n current = self.requests.get(key, 0)\n if current \u003e= max_req:\n return False\n self.requests[key] = current + 1\n return True\n\n","suffix":"class FakeClock:\n def __init__(self, start=0):\n self.now = start\n def __call__(self):\n return self.now\n def advance(self, s):\n self.now += s\n\nclock = FakeClock(0)\nerl = EndpointRateLimiter(clock=clock)\nerl.configure(\u0027/api/search\u0027, 2, 60)\nerl.configure(\u0027/api/upload\u0027, 1, 60)\n\nassert erl.allow(\u0027/api/search\u0027, \u0027u1\u0027) == True\nassert erl.allow(\u0027/api/search\u0027, \u0027u1\u0027) == True\nassert erl.allow(\u0027/api/search\u0027, \u0027u1\u0027) == False\n\nassert erl.allow(\u0027/api/upload\u0027, \u0027u1\u0027) == True\nassert erl.allow(\u0027/api/upload\u0027, \u0027u1\u0027) == False\n\nassert erl.allow(\u0027/api/health\u0027, \u0027u1\u0027) == True # unconfigured: allowed\n","assertions":"clock2 = FakeClock(0)\nerl2 = EndpointRateLimiter(clock=clock2)\nerl2.configure(\u0027/api/data\u0027, 1, 60)\nassert erl2.allow(\u0027/api/data\u0027, \u0027alice\u0027) == True\nassert erl2.allow(\u0027/api/data\u0027, \u0027alice\u0027) == False\nassert erl2.allow(\u0027/api/data\u0027, \u0027bob\u0027) == True\n\nclock2.advance(60)\nassert erl2.allow(\u0027/api/data\u0027, \u0027alice\u0027) == True\n","category":"code_purpose_understanding"} {"id":"35","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class TieredRateLimiter:\n def __init__(self, clock=None):\n self.clock = clock or (lambda: __import__(\u0027time\u0027).monotonic())\n self.tiers = {}\n self.user_tiers = {}\n self.counts = {}\n self.default_tier = \u0027basic\u0027\n\n def define_tier(self, name, max_requests, window_seconds):\n self.tiers[name] = (max_requests, window_seconds)\n\n def assign_user(self, user, tier_name):\n self.user_tiers[user] = tier_name\n\n","golden_completion":" def allow(self, user):\n tier = self.user_tiers.get(user, self.default_tier)\n if tier not in self.tiers:\n return True\n max_req, window_sec = self.tiers[tier]\n now = self.clock()\n key = (user, int(now // window_sec))\n current = self.counts.get(key, 0)\n if current \u003e= max_req:\n return False\n self.counts[key] = current + 1\n return True\n\n","suffix":"class FakeClock:\n def __init__(self, start=0):\n self.now = start\n def __call__(self):\n return self.now\n\nclock = FakeClock(0)\ntrl = TieredRateLimiter(clock=clock)\ntrl.define_tier(\u0027basic\u0027, 2, 60)\ntrl.define_tier(\u0027premium\u0027, 10, 60)\ntrl.assign_user(\u0027alice\u0027, \u0027premium\u0027)\n\nassert trl.allow(\u0027alice\u0027) == True\nassert trl.allow(\u0027alice\u0027) == True\nassert trl.allow(\u0027alice\u0027) == True # premium: up to 10\nassert trl.allow(\u0027bob\u0027) == True\nassert trl.allow(\u0027bob\u0027) == True\nassert trl.allow(\u0027bob\u0027) == False # basic: only 2\n","assertions":"clock2 = FakeClock(0)\ntrl2 = TieredRateLimiter(clock=clock2)\ntrl2.define_tier(\u0027basic\u0027, 2, 60)\ntrl2.define_tier(\u0027premium\u0027, 5, 60)\ntrl2.assign_user(\u0027vip\u0027, \u0027premium\u0027)\n\nfor _ in range(5):\n assert trl2.allow(\u0027vip\u0027) == True\nassert trl2.allow(\u0027vip\u0027) == False\n\nfor _ in range(2):\n assert trl2.allow(\u0027stranger\u0027) == True\nassert trl2.allow(\u0027stranger\u0027) == False\n\nclock3 = FakeClock(0)\ntrl3 = TieredRateLimiter(clock=clock3)\nassert trl3.allow(\u0027anyone\u0027) == True\nassert trl3.allow(\u0027anyone\u0027) == True\n","category":"code_purpose_understanding"} {"id":"36","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class ValidationResult:\n def __init__(self, is_valid, errors=None):\n self.is_valid = is_valid\n self.errors = errors or []\n\nclass FailFastValidator:\n \"\"\"Runs validators in order. Stops at the FIRST failure.\n Each validator returns (bool, error_message).\"\"\"\n\n def __init__(self):\n self.validators = []\n\n def add(self, name, validator_fn):\n self.validators.append((name, validator_fn))\n\n","golden_completion":" def validate(self, data):\n for name, fn in self.validators:\n ok, msg = fn(data)\n if not ok:\n return ValidationResult(False, [f\u0027{name}: {msg}\u0027])\n return ValidationResult(True)\n\n","suffix":"v = FailFastValidator()\nv.add(\u0027not_empty\u0027, lambda d: (bool(d.get(\u0027name\u0027)), \u0027name is required\u0027))\nv.add(\u0027name_length\u0027, lambda d: (len(d.get(\u0027name\u0027, \u0027\u0027)) \u003e= 2, \u0027name too short\u0027))\nv.add(\u0027has_email\u0027, lambda d: (bool(d.get(\u0027email\u0027)), \u0027email is required\u0027))\n\nresult = v.validate({\u0027name\u0027: \u0027Alice\u0027, \u0027email\u0027: \u0027a@b.com\u0027})\nassert result.is_valid == True\nassert result.errors == []\n\nresult2 = v.validate({\u0027name\u0027: \u0027\u0027, \u0027email\u0027: \u0027a@b.com\u0027})\nassert result2.is_valid == False\nassert len(result2.errors) == 1 # ONLY first error\nassert \u0027not_empty\u0027 in result2.errors[0]\n\nresult3 = v.validate({\u0027name\u0027: \u0027A\u0027})\nassert len(result3.errors) == 1\nassert \u0027name_length\u0027 in result3.errors[0]\n","assertions":"v2 = FailFastValidator()\nr = v2.validate({})\nassert r.is_valid == True\n\nv3 = FailFastValidator()\nv3.add(\u0027a\u0027, lambda d: (False, \u0027err_a\u0027))\nv3.add(\u0027b\u0027, lambda d: (False, \u0027err_b\u0027))\nv3.add(\u0027c\u0027, lambda d: (False, \u0027err_c\u0027))\nr3 = v3.validate({})\nassert len(r3.errors) == 1\nassert \u0027a\u0027 in r3.errors[0]\n","category":"code_purpose_understanding"} {"id":"37","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class ValidationError:\n def __init__(self, field, message):\n self.field = field\n self.message = message\n\nclass CollectAllValidator:\n \"\"\"Runs ALL validators regardless of failures. Collects every error.\"\"\"\n\n def __init__(self):\n self.validators = []\n\n def add(self, field, validator_fn):\n self.validators.append((field, validator_fn))\n\n","golden_completion":" def validate(self, data):\n errors = []\n for field, fn in self.validators:\n ok, msg = fn(data)\n if not ok:\n errors.append(ValidationError(field, msg))\n return errors\n\n","suffix":"v = CollectAllValidator()\nv.add(\u0027name\u0027, lambda d: (bool(d.get(\u0027name\u0027)), \u0027required\u0027))\nv.add(\u0027email\u0027, lambda d: (\u0027@\u0027 in d.get(\u0027email\u0027, \u0027\u0027), \u0027invalid\u0027))\nv.add(\u0027age\u0027, lambda d: (isinstance(d.get(\u0027age\u0027), int) and d[\u0027age\u0027] \u003e= 0, \u0027bad age\u0027))\n\nerrors = v.validate({})\nassert len(errors) == 3, f\u0027Expected 3 errors, got {len(errors)}\u0027\nassert errors[0].field == \u0027name\u0027\nassert errors[1].field == \u0027email\u0027\nassert errors[2].field == \u0027age\u0027\n\nerrors2 = v.validate({\u0027name\u0027: \u0027Alice\u0027, \u0027email\u0027: \u0027bad\u0027, \u0027age\u0027: -1})\nassert len(errors2) == 2\n\nerrors3 = v.validate({\u0027name\u0027: \u0027Alice\u0027, \u0027email\u0027: \u0027a@b.com\u0027, \u0027age\u0027: 25})\nassert errors3 == []\n","assertions":"v2 = CollectAllValidator()\nassert v2.validate({}) == []\n\nv3 = CollectAllValidator()\nv3.add(\u0027x\u0027, lambda d: (False, \u0027x wrong\u0027))\nv3.add(\u0027y\u0027, lambda d: (False, \u0027y wrong\u0027))\nerrs = v3.validate({})\nassert errs[0].message == \u0027x wrong\u0027\nassert errs[1].message == \u0027y wrong\u0027\n","category":"code_purpose_understanding"} {"id":"38","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class DependentValidator:\n \"\"\"Validators can depend on others. Only runs if all deps passed.\n Skipped validators do not appear in errors.\"\"\"\n\n def __init__(self):\n self.validators = {}\n self.order = []\n\n def add(self, name, fn, depends_on=None):\n self.validators[name] = {\u0027fn\u0027: fn, \u0027deps\u0027: depends_on or []}\n self.order.append(name)\n\n","golden_completion":" def validate(self, data):\n errors, passed = {}, set()\n for name in self.order:\n v = self.validators[name]\n if not all(d in passed for d in v[\u0027deps\u0027]):\n continue\n ok, msg = v[\u0027fn\u0027](data)\n if ok:\n passed.add(name)\n else:\n errors[name] = msg\n return errors, passed\n\n","suffix":"dv = DependentValidator()\ndv.add(\u0027has_email\u0027, lambda d: (\u0027@\u0027 in d.get(\u0027email\u0027, \u0027\u0027), \u0027invalid email\u0027))\ndv.add(\u0027email_domain\u0027, lambda d: (d.get(\u0027email\u0027, \u0027\u0027).endswith(\u0027.com\u0027), \u0027must be .com\u0027), depends_on=[\u0027has_email\u0027])\ndv.add(\u0027has_name\u0027, lambda d: (bool(d.get(\u0027name\u0027)), \u0027name required\u0027))\n\nerrors, passed = dv.validate({\u0027email\u0027: \u0027a@b.com\u0027, \u0027name\u0027: \u0027Alice\u0027})\nassert errors == {}\nassert passed == {\u0027has_email\u0027, \u0027email_domain\u0027, \u0027has_name\u0027}\n\nerrors2, passed2 = dv.validate({\u0027email\u0027: \u0027bad\u0027, \u0027name\u0027: \u0027Alice\u0027})\nassert \u0027has_email\u0027 in errors2\nassert \u0027email_domain\u0027 not in errors2 # skipped, not failed\nassert \u0027has_name\u0027 in passed2\n\nerrors3, passed3 = dv.validate({\u0027email\u0027: \u0027a@b.org\u0027, \u0027name\u0027: \u0027Alice\u0027})\nassert \u0027has_email\u0027 in passed3\nassert \u0027email_domain\u0027 in errors3\n","assertions":"dv2 = DependentValidator()\ndv2.add(\u0027a\u0027, lambda d: (False, \u0027a failed\u0027))\ndv2.add(\u0027b\u0027, lambda d: (False, \u0027b failed\u0027), depends_on=[\u0027a\u0027])\ndv2.add(\u0027c\u0027, lambda d: (False, \u0027c failed\u0027), depends_on=[\u0027b\u0027])\nerrs, p = dv2.validate({})\nassert errs == {\u0027a\u0027: \u0027a failed\u0027}\nassert p == set()\n\ndv3 = DependentValidator()\ndv3.add(\u0027x\u0027, lambda d: (True, \u0027\u0027))\ndv3.add(\u0027y\u0027, lambda d: (False, \u0027y bad\u0027))\ndv3.add(\u0027z\u0027, lambda d: (True, \u0027\u0027), depends_on=[\u0027x\u0027])\nerrs3, p3 = dv3.validate({})\nassert \u0027y\u0027 in errs3\nassert p3 == {\u0027x\u0027, \u0027z\u0027}\n","category":"code_purpose_understanding"} {"id":"39","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class SanitizationPipeline:\n \"\"\"Runs sanitizers in sequence. Tracks which ones actually modified\n the data (output differs from input).\"\"\"\n\n def __init__(self):\n self.sanitizers = []\n\n def add(self, name, sanitizer_fn):\n self.sanitizers.append((name, sanitizer_fn))\n\n","golden_completion":" def run(self, data):\n applied = []\n current = data\n for name, fn in self.sanitizers:\n result = fn(current)\n if result != current:\n applied.append(name)\n current = result\n return current, applied\n\n","suffix":"sp = SanitizationPipeline()\nsp.add(\u0027strip\u0027, lambda s: s.strip())\nsp.add(\u0027lower\u0027, lambda s: s.lower())\nsp.add(\u0027remove_dots\u0027, lambda s: s.replace(\u0027.\u0027, \u0027\u0027))\n\nresult, applied = sp.run(\u0027 Hello.World \u0027)\nassert result == \u0027helloworld\u0027\nassert applied == [\u0027strip\u0027, \u0027lower\u0027, \u0027remove_dots\u0027]\n\nresult2, applied2 = sp.run(\u0027helloworld\u0027)\nassert result2 == \u0027helloworld\u0027\nassert applied2 == []\n","assertions":"sp2 = SanitizationPipeline()\nsp2.add(\u0027strip\u0027, lambda s: s.strip())\nsp2.add(\u0027lower\u0027, lambda s: s.lower())\nr, a = sp2.run(\u0027 hello \u0027)\nassert r == \u0027hello\u0027\nassert a == [\u0027strip\u0027]\n\nsp3 = SanitizationPipeline()\nr3, a3 = sp3.run(\u0027test\u0027)\nassert r3 == \u0027test\u0027\nassert a3 == []\n\nsp4 = SanitizationPipeline()\nsp4.add(\u0027a_to_b\u0027, lambda s: s.replace(\u0027a\u0027, \u0027b\u0027))\nsp4.add(\u0027b_to_c\u0027, lambda s: s.replace(\u0027b\u0027, \u0027c\u0027))\nr4, a4 = sp4.run(\u0027aaa\u0027)\nassert r4 == \u0027ccc\u0027\nassert a4 == [\u0027a_to_b\u0027, \u0027b_to_c\u0027]\n","category":"code_purpose_understanding"} {"id":"40","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class NormalizeAndValidate:\n \"\"\"Normalizes data, then validates the NORMALIZED version.\n Preserves original data for auditing.\"\"\"\n\n def __init__(self):\n self.normalizers = {}\n self.validators = []\n\n def add_normalizer(self, field, fn):\n self.normalizers[field] = fn\n\n def add_validator(self, field, fn, msg):\n self.validators.append((field, fn, msg))\n\n","golden_completion":" def process(self, data):\n original = dict(data)\n normalized = dict(data)\n for field, fn in self.normalizers.items():\n if field in normalized:\n normalized[field] = fn(normalized[field])\n errors = []\n for field, fn, msg in self.validators:\n if not fn(normalized.get(field)):\n errors.append((field, msg))\n return {\u0027valid\u0027: len(errors) == 0, \u0027normalized\u0027: normalized,\n \u0027original\u0027: original, \u0027errors\u0027: errors}\n\n","suffix":"nv = NormalizeAndValidate()\nnv.add_normalizer(\u0027email\u0027, lambda e: e.strip().lower())\nnv.add_normalizer(\u0027name\u0027, lambda n: n.strip())\nnv.add_validator(\u0027email\u0027, lambda e: e and \u0027@\u0027 in e, \u0027invalid email\u0027)\nnv.add_validator(\u0027name\u0027, lambda n: n and len(n) \u003e= 2, \u0027name too short\u0027)\n\nr = nv.process({\u0027email\u0027: \u0027 ALICE@X.COM \u0027, \u0027name\u0027: \u0027 Al \u0027})\nassert r[\u0027valid\u0027] == True\nassert r[\u0027normalized\u0027][\u0027email\u0027] == \u0027alice@x.com\u0027\nassert r[\u0027original\u0027][\u0027email\u0027] == \u0027 ALICE@X.COM \u0027\n\nr2 = nv.process({\u0027email\u0027: \u0027 bad \u0027, \u0027name\u0027: \u0027 A \u0027})\nassert r2[\u0027valid\u0027] == False\nassert len(r2[\u0027errors\u0027]) == 2\nassert r2[\u0027normalized\u0027][\u0027email\u0027] == \u0027bad\u0027\n","assertions":"nv2 = NormalizeAndValidate()\nnv2.add_normalizer(\u0027x\u0027, lambda v: v.upper())\nnv2.add_validator(\u0027x\u0027, lambda v: v is not None, \u0027x required\u0027)\nr = nv2.process({})\nassert r[\u0027valid\u0027] == False\nassert \u0027x\u0027 not in r[\u0027normalized\u0027]\n\nr2 = nv2.process({\u0027x\u0027: \u0027hello\u0027, \u0027extra\u0027: 42})\nassert r2[\u0027valid\u0027] == True\nassert r2[\u0027normalized\u0027][\u0027x\u0027] == \u0027HELLO\u0027\nassert r2[\u0027normalized\u0027][\u0027extra\u0027] == 42\nassert r2[\u0027original\u0027][\u0027x\u0027] == \u0027hello\u0027\n","category":"code_purpose_understanding"} {"id":"41","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class ApprovalChain:\n def __init__(self, required_approvals):\n self.required = required_approvals\n self.decisions = []\n self.status = \u0027pending\u0027\n\n def _record(self, approver, decision, reason=\u0027\u0027):\n self.decisions.append((approver, decision, reason))\n\n","golden_completion":" def decide(self, approver, decision, reason=\u0027\u0027):\n if self.status != \u0027pending\u0027:\n return self.status\n self._record(approver, decision, reason)\n if decision == \u0027reject\u0027:\n self.status = \u0027rejected\u0027\n elif decision == \u0027approve\u0027:\n approvals = sum(1 for _, d, _ in self.decisions if d == \u0027approve\u0027)\n if approvals \u003e= self.required:\n self.status = \u0027approved\u0027\n return self.status\n\n","suffix":"chain = ApprovalChain(required_approvals=2)\nchain.decide(\u0027mgr\u0027, \u0027approve\u0027, \u0027ok\u0027)\nassert chain.status == \u0027pending\u0027\n\nchain.decide(\u0027dir\u0027, \u0027approve\u0027, \u0027agreed\u0027)\nassert chain.status == \u0027approved\u0027\n\nchain.decide(\u0027vp\u0027, \u0027reject\u0027, \u0027too late\u0027)\nassert chain.status == \u0027approved\u0027 # unchanged\n\nchain2 = ApprovalChain(required_approvals=3)\nchain2.decide(\u0027mgr\u0027, \u0027approve\u0027)\nchain2.decide(\u0027dir\u0027, \u0027reject\u0027, \u0027no budget\u0027)\nassert chain2.status == \u0027rejected\u0027\n\nchain3 = ApprovalChain(required_approvals=2)\nchain3.decide(\u0027mgr\u0027, \u0027skip\u0027)\nassert chain3.status == \u0027pending\u0027\nchain3.decide(\u0027dir\u0027, \u0027approve\u0027)\nchain3.decide(\u0027vp\u0027, \u0027approve\u0027)\nassert chain3.status == \u0027approved\u0027\n","assertions":"c = ApprovalChain(required_approvals=1)\nc.decide(\u0027boss\u0027, \u0027approve\u0027)\nassert c.status == \u0027approved\u0027\n\nc2 = ApprovalChain(required_approvals=1)\nc2.decide(\u0027a\u0027, \u0027skip\u0027)\nc2.decide(\u0027b\u0027, \u0027skip\u0027)\nc2.decide(\u0027c\u0027, \u0027reject\u0027)\nassert c2.status == \u0027rejected\u0027\n\nc3 = ApprovalChain(required_approvals=1)\nc3.decide(\u0027a\u0027, \u0027reject\u0027)\nresult = c3.decide(\u0027b\u0027, \u0027approve\u0027)\nassert c3.status == \u0027rejected\u0027\nassert len(c3.decisions) == 1\n","category":"code_purpose_understanding"} {"id":"42","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class EscalatingWorkflow:\n def __init__(self, approver_chain, clock=None):\n self.chain = list(approver_chain)\n self.idx = 0\n self.status = \u0027pending\u0027\n self.history = []\n self.clock = clock or (lambda: 0)\n\n def current_approver(self):\n return self.chain[self.idx] if self.idx \u003c len(self.chain) else None\n\n def decide(self, approver, decision):\n if self.status != \u0027pending\u0027:\n return self.status\n if approver != self.current_approver():\n return \u0027wrong_approver\u0027\n self.history.append((approver, decision, self.clock()))\n if decision == \u0027approve\u0027:\n self.status = \u0027approved\u0027\n elif decision == \u0027reject\u0027:\n self.status = \u0027rejected\u0027\n return self.status\n\n","golden_completion":" def escalate(self):\n if self.status != \u0027pending\u0027:\n return self.status\n cur = self.current_approver()\n self.history.append((cur, \u0027escalated\u0027, self.clock()))\n self.idx += 1\n if self.idx \u003e= len(self.chain):\n self.status = \u0027rejected\u0027\n return self.status\n\n","suffix":"wf = EscalatingWorkflow([\u0027mgr\u0027, \u0027dir\u0027, \u0027vp\u0027])\nassert wf.current_approver() == \u0027mgr\u0027\n\nassert wf.decide(\u0027dir\u0027, \u0027approve\u0027) == \u0027wrong_approver\u0027\nassert wf.status == \u0027pending\u0027\n\nwf.escalate()\nassert wf.current_approver() == \u0027dir\u0027\nassert wf.history[-1][1] == \u0027escalated\u0027\nwf.decide(\u0027dir\u0027, \u0027approve\u0027)\nassert wf.status == \u0027approved\u0027\n\nwf2 = EscalatingWorkflow([\u0027a\u0027, \u0027b\u0027])\nwf2.escalate()\nwf2.escalate()\nassert wf2.status == \u0027rejected\u0027\n","assertions":"wf3 = EscalatingWorkflow([\u0027boss\u0027])\nwf3.decide(\u0027boss\u0027, \u0027approve\u0027)\nassert wf3.status == \u0027approved\u0027\n\nwf4 = EscalatingWorkflow([\u0027a\u0027, \u0027b\u0027, \u0027c\u0027])\nwf4.decide(\u0027a\u0027, \u0027reject\u0027)\nassert wf4.status == \u0027rejected\u0027\nresult = wf4.escalate()\nassert wf4.status == \u0027rejected\u0027\n\nwf5 = EscalatingWorkflow([\u0027a\u0027, \u0027b\u0027])\nwf5.escalate()\nwf5.decide(\u0027b\u0027, \u0027approve\u0027)\nassert wf5.status == \u0027approved\u0027\nassert len(wf5.history) == 2\n","category":"code_purpose_understanding"} {"id":"43","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class TransactionalWorkflow:\n def __init__(self):\n self.steps = []\n self.completed = []\n self.rolled_back = []\n self.status = \u0027idle\u0027\n\n def add_step(self, name, do_fn, undo_fn):\n self.steps.append((name, do_fn, undo_fn))\n\n","golden_completion":" def execute(self):\n self.status, self.completed, self.rolled_back, done = \u0027running\u0027, [], [], []\n for name, do_fn, undo_fn in self.steps:\n if not do_fn():\n for n, u in reversed(done):\n u(); self.rolled_back.append(n)\n self.status = \u0027rolled_back\u0027\n return False\n self.completed.append(name)\n done.append((name, undo_fn))\n self.status = \u0027completed\u0027\n return True\n\n","suffix":"log = []\nwf = TransactionalWorkflow()\nwf.add_step(\u0027s1\u0027, lambda: (log.append(\u0027do1\u0027), True)[1], lambda: log.append(\u0027undo1\u0027))\nwf.add_step(\u0027s2\u0027, lambda: (log.append(\u0027do2\u0027), True)[1], lambda: log.append(\u0027undo2\u0027))\nwf.add_step(\u0027s3\u0027, lambda: (log.append(\u0027do3\u0027), False)[1], lambda: log.append(\u0027undo3\u0027))\n\nassert wf.execute() == False\nassert wf.status == \u0027rolled_back\u0027\nassert wf.completed == [\u0027s1\u0027, \u0027s2\u0027]\nassert wf.rolled_back == [\u0027s2\u0027, \u0027s1\u0027] # REVERSE order\nassert log == [\u0027do1\u0027, \u0027do2\u0027, \u0027do3\u0027, \u0027undo2\u0027, \u0027undo1\u0027]\n\nlog.clear()\nwf2 = TransactionalWorkflow()\nwf2.add_step(\u0027a\u0027, lambda: (log.append(\u0027a\u0027), True)[1], lambda: log.append(\u0027ua\u0027))\nwf2.add_step(\u0027b\u0027, lambda: (log.append(\u0027b\u0027), True)[1], lambda: log.append(\u0027ub\u0027))\nassert wf2.execute() == True\nassert wf2.completed == [\u0027a\u0027, \u0027b\u0027]\nassert wf2.rolled_back == []\n","assertions":"log2 = []\nwf3 = TransactionalWorkflow()\nwf3.add_step(\u0027x\u0027, lambda: False, lambda: log2.append(\u0027undo_x\u0027))\nassert wf3.execute() == False\nassert wf3.completed == []\nassert wf3.rolled_back == []\nassert log2 == []\n\nwf4 = TransactionalWorkflow()\nwf4.add_step(\u0027only\u0027, lambda: True, lambda: None)\nassert wf4.execute() == True\nassert wf4.completed == [\u0027only\u0027]\n","category":"code_purpose_understanding"} {"id":"44","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class WorkflowStateMachine:\n def __init__(self, initial_state):\n self.state = initial_state\n self.transitions = {}\n self.history = [initial_state]\n\n def allow_transition(self, from_state, to_state):\n if from_state not in self.transitions:\n self.transitions[from_state] = set()\n self.transitions[from_state].add(to_state)\n\n","golden_completion":" def advance(self, to_state):\n allowed = self.transitions.get(self.state, set())\n if to_state not in allowed:\n return False\n self.state = to_state\n self.history.append(to_state)\n return True\n\n def can_advance(self, to_state):\n return to_state in self.transitions.get(self.state, set())\n\n","suffix":"wf = WorkflowStateMachine(\u0027draft\u0027)\nwf.allow_transition(\u0027draft\u0027, \u0027review\u0027)\nwf.allow_transition(\u0027review\u0027, \u0027approved\u0027)\nwf.allow_transition(\u0027review\u0027, \u0027rejected\u0027)\nwf.allow_transition(\u0027rejected\u0027, \u0027draft\u0027)\n\nassert wf.advance(\u0027review\u0027) == True\nassert wf.advance(\u0027draft\u0027) == False # review-\u003edraft not allowed\nassert wf.state == \u0027review\u0027\n\nassert wf.advance(\u0027approved\u0027) == True\nassert wf.history == [\u0027draft\u0027, \u0027review\u0027, \u0027approved\u0027]\n\nwf2 = WorkflowStateMachine(\u0027draft\u0027)\nwf2.allow_transition(\u0027draft\u0027, \u0027review\u0027)\nassert wf2.can_advance(\u0027review\u0027) == True\nassert wf2.can_advance(\u0027approved\u0027) == False\n","assertions":"wf3 = WorkflowStateMachine(\u0027draft\u0027)\nwf3.allow_transition(\u0027draft\u0027, \u0027review\u0027)\nwf3.allow_transition(\u0027review\u0027, \u0027rejected\u0027)\nwf3.allow_transition(\u0027rejected\u0027, \u0027draft\u0027)\nwf3.advance(\u0027review\u0027)\nwf3.advance(\u0027rejected\u0027)\nwf3.advance(\u0027draft\u0027)\nassert wf3.history == [\u0027draft\u0027, \u0027review\u0027, \u0027rejected\u0027, \u0027draft\u0027]\n\nwf4 = WorkflowStateMachine(\u0027stuck\u0027)\nassert wf4.advance(\u0027anywhere\u0027) == False\nassert wf4.can_advance(\u0027anywhere\u0027) == False\n","category":"code_purpose_understanding"} {"id":"45","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class QuorumApproval:\n \"\"\"Requires N approvals from M approvers.\n Auto-approved when threshold met.\n Auto-rejected when impossible to reach threshold.\"\"\"\n\n def __init__(self, approvers, threshold):\n self.approvers = set(approvers)\n self.threshold = threshold\n self.votes = {}\n self.status = \u0027pending\u0027\n\n","golden_completion":" def vote(self, approver, decision):\n if self.status != \u0027pending\u0027: return self.status\n if approver not in self.approvers: return \u0027invalid_approver\u0027\n if approver in self.votes: return \u0027already_voted\u0027\n self.votes[approver] = decision\n approvals = sum(1 for v in self.votes.values() if v == \u0027approve\u0027)\n if approvals \u003e= self.threshold:\n self.status = \u0027approved\u0027\n elif approvals + (len(self.approvers) - len(self.votes)) \u003c self.threshold:\n self.status = \u0027rejected\u0027\n return self.status\n\n","suffix":"qa = QuorumApproval({\u0027alice\u0027, \u0027bob\u0027, \u0027charlie\u0027, \u0027dave\u0027}, threshold=2)\n\nqa.vote(\u0027alice\u0027, \u0027reject\u0027)\nassert qa.status == \u0027pending\u0027 # still possible\n\nqa.vote(\u0027bob\u0027, \u0027approve\u0027)\nassert qa.status == \u0027pending\u0027\n\nqa.vote(\u0027charlie\u0027, \u0027approve\u0027)\nassert qa.status == \u0027approved\u0027\n\nqa2 = QuorumApproval({\u0027a\u0027, \u0027b\u0027, \u0027c\u0027}, threshold=2)\nqa2.vote(\u0027a\u0027, \u0027reject\u0027)\nqa2.vote(\u0027b\u0027, \u0027reject\u0027)\nassert qa2.status == \u0027rejected\u0027 # 1 undecided, need 2: impossible\n","assertions":"qa3 = QuorumApproval({\u0027x\u0027, \u0027y\u0027, \u0027z\u0027}, threshold=1)\nqa3.vote(\u0027x\u0027, \u0027reject\u0027)\nqa3.vote(\u0027y\u0027, \u0027reject\u0027)\nassert qa3.status == \u0027pending\u0027\nqa3.vote(\u0027z\u0027, \u0027reject\u0027)\nassert qa3.status == \u0027rejected\u0027\n\nqa4 = QuorumApproval({\u0027a\u0027, \u0027b\u0027}, threshold=1)\nqa4.vote(\u0027a\u0027, \u0027approve\u0027)\nassert qa4.status == \u0027approved\u0027\n\nqa5 = QuorumApproval({\u0027a\u0027}, threshold=1)\nassert qa5.vote(\u0027stranger\u0027, \u0027approve\u0027) == \u0027invalid_approver\u0027\nassert qa5.status == \u0027pending\u0027\n","category":"code_purpose_understanding"} {"id":"46","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"import math\n\nclass PercentileCalculator:\n \"\"\"Nearest-rank method. For percentile P and N values:\n rank = ceil(P / 100 * N), 1-indexed.\n P=0 returns minimum. P=100 returns maximum.\"\"\"\n\n def __init__(self, values):\n self.sorted_values = sorted(values)\n self.n = len(self.sorted_values)\n\n","golden_completion":" def percentile(self, p):\n if self.n == 0:\n return None\n if p \u003c= 0:\n return self.sorted_values[0]\n if p \u003e= 100:\n return self.sorted_values[-1]\n rank = math.ceil(p / 100 * self.n)\n return self.sorted_values[rank - 1]\n\n def median(self):\n return self.percentile(50)\n\n","suffix":"pc = PercentileCalculator([15, 20, 35, 40, 50])\n\nassert pc.percentile(50) == 35 # ceil(2.5)=3, idx 2\nassert pc.percentile(25) == 20 # ceil(1.25)=2, idx 1\nassert pc.percentile(75) == 40 # ceil(3.75)=4, idx 3\nassert pc.percentile(0) == 15\nassert pc.percentile(100) == 50\nassert pc.median() == 35\n","assertions":"pc2 = PercentileCalculator([42])\nassert pc2.percentile(50) == 42\nassert pc2.percentile(1) == 42\n\npc3 = PercentileCalculator([10, 20])\nassert pc3.percentile(50) == 10 # ceil(1)=1, idx 0\nassert pc3.percentile(51) == 20 # ceil(1.02)=2, idx 1\n\npc4 = PercentileCalculator([5, 1, 3, 2, 4])\nassert pc4.percentile(20) == 1\nassert pc4.percentile(40) == 2\nassert pc4.percentile(60) == 3\n\npc5 = PercentileCalculator([])\nassert pc5.percentile(50) is None\n","category":"code_purpose_understanding"} {"id":"47","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class Histogram:\n \"\"\"Fixed-width histogram. Buckets cover [lower, lower+width).\n Values below start -\u003e underflow. Values \u003e= end -\u003e overflow.\"\"\"\n\n def __init__(self, start, width, num_buckets):\n self.start = start\n self.width = width\n self.num_buckets = num_buckets\n self.buckets = [0] * num_buckets\n self.underflow = 0\n self.overflow = 0\n\n","golden_completion":" def add(self, value):\n if value \u003c self.start:\n self.underflow += 1\n elif value \u003e= self.start + self.width * self.num_buckets:\n self.overflow += 1\n else:\n idx = int((value - self.start) / self.width)\n self.buckets[idx] += 1\n\n def get_buckets(self):\n return [(self.start + i * self.width, self.buckets[i])\n for i in range(self.num_buckets)]\n\n","suffix":"h = Histogram(start=0, width=10, num_buckets=5)\nh.add(5)\nh.add(15)\nh.add(25)\nh.add(25)\nh.add(-1)\nh.add(50)\nh.add(0)\nh.add(9.99)\n\nassert h.underflow == 1\nassert h.overflow == 1\nassert h.get_buckets()[0] == (0, 3) # 5, 0, 9.99\nassert h.get_buckets()[1] == (10, 1) # 15\nassert h.get_buckets()[2] == (20, 2) # 25, 25\n","assertions":"h2 = Histogram(0, 10, 3)\nh2.add(10)\nh2.add(20)\nh2.add(30)\nassert h2.get_buckets()[0] == (0, 0)\nassert h2.get_buckets()[1] == (10, 1)\nassert h2.get_buckets()[2] == (20, 1)\nassert h2.overflow == 1\n\nh3 = Histogram(100, 5, 2)\nh3.add(99)\nh3.add(100)\nh3.add(105)\nh3.add(110)\nassert h3.underflow == 1\nassert h3.overflow == 1\nassert h3.get_buckets() == [(100, 1), (105, 1)]\n","category":"code_purpose_understanding"} {"id":"48","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class ExponentialMovingStats:\n \"\"\"EMA mean and variance with custom alpha.\n mean = alpha * value + (1-alpha) * mean\n var = alpha * (value - OLD_mean)^2 + (1-alpha) * var\n Note: variance uses PREVIOUS mean (before update).\n First value initializes mean; variance starts at 0.\"\"\"\n\n def __init__(self, alpha):\n self.alpha = alpha\n self.mean = None\n self.variance = 0.0\n self.count = 0\n\n","golden_completion":" def update(self, value):\n self.count += 1\n if self.mean is None:\n self.mean = float(value)\n self.variance = 0.0\n return\n old_mean = self.mean\n self.mean = self.alpha * value + (1 - self.alpha) * old_mean\n diff = value - old_mean\n self.variance = self.alpha * diff * diff + (1 - self.alpha) * self.variance\n\n def std_dev(self):\n return self.variance ** 0.5\n\n","suffix":"ema = ExponentialMovingStats(alpha=0.5)\nema.update(10)\nassert ema.mean == 10.0\nassert ema.variance == 0.0\n\nema.update(20)\nassert ema.mean == 15.0\n# var = 0.5 * (20-10)^2 + 0.5*0 = 50.0 (uses OLD mean=10)\nassert ema.variance == 50.0\n\nema.update(15)\nassert ema.mean == 15.0\n# var = 0.5 * (15-15)^2 + 0.5*50 = 25.0\nassert ema.variance == 25.0\nassert abs(ema.std_dev() - 5.0) \u003c 0.001\n","assertions":"ema2 = ExponentialMovingStats(alpha=1.0)\nema2.update(100)\nema2.update(200)\nassert ema2.mean == 200.0\nassert ema2.variance == 10000.0\nema2.update(200)\nassert ema2.variance == 0.0\n\nema3 = ExponentialMovingStats(alpha=0.1)\nema3.update(0)\nema3.update(100)\nassert abs(ema3.mean - 10.0) \u003c 0.001\nassert abs(ema3.variance - 1000.0) \u003c 0.001\nassert ema3.count == 2\n","category":"code_purpose_understanding"} {"id":"49","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class DecayingCounter:\n \"\"\"Counter decays exponentially: count *= decay_factor^elapsed.\n increment() adds to the current decayed count.\"\"\"\n\n def __init__(self, decay_factor, clock=None):\n self.decay_factor = decay_factor\n self.clock = clock or (lambda: __import__(\u0027time\u0027).monotonic())\n self.counters = {} # key -\u003e (count, last_update)\n\n","golden_completion":" def _decay(self, key):\n if key not in self.counters: return 0.0\n count, last = self.counters[key]\n now = self.clock()\n decayed = count * (self.decay_factor ** (now - last))\n self.counters[key] = (decayed, now)\n return decayed\n\n def increment(self, key, amount=1):\n self.counters[key] = (self._decay(key) + amount, self.clock())\n\n def get_count(self, key):\n return self._decay(key) if key in self.counters else 0.0\n\n","suffix":"class FakeClock:\n def __init__(self, start=0):\n self.now = start\n def __call__(self):\n return self.now\n def advance(self, s):\n self.now += s\n\nclock = FakeClock(0)\ndc = DecayingCounter(0.5, clock=clock)\n\ndc.increment(\u0027hits\u0027, 100)\nassert dc.get_count(\u0027hits\u0027) == 100.0\n\nclock.advance(1)\nassert dc.get_count(\u0027hits\u0027) == 50.0 # 100 * 0.5^1\n\nclock.advance(1)\nassert dc.get_count(\u0027hits\u0027) == 25.0 # 50 * 0.5^1\n\ndc.increment(\u0027hits\u0027, 75)\nassert dc.get_count(\u0027hits\u0027) == 100.0 # 25 + 75\n\nassert dc.get_count(\u0027unknown\u0027) == 0.0\n","assertions":"clock2 = FakeClock(0)\ndc2 = DecayingCounter(1.0, clock=clock2)\ndc2.increment(\u0027x\u0027, 100)\nclock2.advance(1000)\nassert dc2.get_count(\u0027x\u0027) == 100.0 # no decay\n\nclock3 = FakeClock(0)\ndc3 = DecayingCounter(0.0, clock=clock3)\ndc3.increment(\u0027x\u0027, 100)\nclock3.advance(1)\nassert dc3.get_count(\u0027x\u0027) == 0.0\n\nclock4 = FakeClock(0)\ndc4 = DecayingCounter(0.5, clock=clock4)\ndc4.increment(\u0027a\u0027, 100)\nclock4.advance(1)\ndc4.increment(\u0027b\u0027, 100)\nclock4.advance(1)\nassert abs(dc4.get_count(\u0027a\u0027) - 25.0) \u003c 0.001\nassert abs(dc4.get_count(\u0027b\u0027) - 50.0) \u003c 0.001\n","category":"code_purpose_understanding"} {"id":"50","testsource":"devbench-code-purpose-understanding","language":"python","prefix":"class TimeWindowStats:\n \"\"\"Statistics over a time-based sliding window.\n Values older than window_seconds are evicted.\"\"\"\n\n def __init__(self, window_seconds, clock=None):\n self.window = window_seconds\n self.clock = clock or (lambda: __import__(\u0027time\u0027).monotonic())\n self.values = [] # (timestamp, value)\n\n def _evict(self):\n cutoff = self.clock() - self.window\n self.values = [(t, v) for t, v in self.values if t \u003e cutoff]\n\n","golden_completion":" def add(self, value):\n self._evict()\n self.values.append((self.clock(), value))\n\n def mean(self):\n self._evict()\n if not self.values:\n return None\n return sum(v for _, v in self.values) / len(self.values)\n\n def count(self):\n self._evict()\n return len(self.values)\n\n","suffix":"class FakeClock:\n def __init__(self, start=0):\n self.now = start\n def __call__(self):\n return self.now\n def advance(self, s):\n self.now += s\n\nclock = FakeClock(0)\ntw = TimeWindowStats(10, clock=clock)\n\ntw.add(10)\nclock.advance(3)\ntw.add(20)\nclock.advance(3)\ntw.add(30)\n\nassert tw.count() == 3\nassert tw.mean() == 20.0\n\nclock.advance(5) # t=11: first value expires\nassert tw.count() == 2\nassert tw.mean() == 25.0\n\nclock.advance(10)\nassert tw.count() == 0\nassert tw.mean() is None\n","assertions":"clock2 = FakeClock(0)\ntw2 = TimeWindowStats(100, clock=clock2)\ntw2.add(10)\ntw2.add(20)\ntw2.add(30)\nassert tw2.mean() == 20.0\n\nclock3 = FakeClock(0)\ntw3 = TimeWindowStats(10, clock=clock3)\ntw3.add(42)\nassert tw3.mean() == 42.0\n\n# Time-based not count-based: many values, no time passed\nclock4 = FakeClock(0)\ntw4 = TimeWindowStats(10, clock=clock4)\nfor i in range(100):\n tw4.add(i)\nassert tw4.count() == 100\n","category":"code_purpose_understanding"} {"id":"1","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"import csv\nfrom io import StringIO\n\ndef write_strict_csv(rows, fieldnames):\n out = StringIO(newline=\u0027\u0027)\n writer = csv.DictWriter(\n out,\n fieldnames=fieldnames,\n extrasaction=\u0027raise\u0027,\n lineterminator=\u0027\\n\u0027,\n )\n writer.writeheader()\n writer.writerows(rows)\n return out.getvalue()\n\ndef describe_write_strict_csv():\n","golden_completion":" return (\n \"write_strict_csv serializes dictionaries with csv.DictWriter using the supplied \"\n \"fieldnames order, writes the header row with writeheader(), and returns the \"\n \"StringIO CSV text. It sets extrasaction=\u0027raise\u0027, so any row containing a key \"\n \"outside fieldnames raises ValueError, and lineterminator=\u0027\\\\n\u0027 makes every \"\n \"output record end with a single newline.\"\n )\n","suffix":"\ncsv_text = write_strict_csv([{\u0027name\u0027: \u0027Ada\u0027, \u0027score\u0027: 9}, {\u0027name\u0027: \u0027Lin\u0027, \u0027score\u0027: 8}], [\u0027name\u0027, \u0027score\u0027])\nassert csv_text == \u0027name,score\\nAda,9\\nLin,8\\n\u0027\ntry:\n write_strict_csv([{\u0027name\u0027: \u0027Ada\u0027, \u0027score\u0027: 9, \u0027extra\u0027: True}], [\u0027name\u0027, \u0027score\u0027])\n assert False, \u0027extra keys should raise\u0027\nexcept ValueError:\n pass\nsummary = describe_write_strict_csv()\nassert isinstance(summary, str) and \u0027csv\u0027 in summary.lower() and \u0027raise\u0027 in summary.lower()\n","assertions":"doc = describe_write_strict_csv()\nassert isinstance(doc, str), \u0027describe_write_strict_csv must return a string\u0027\nlow = doc.lower()\nassert \u0027csv.dictwriter\u0027 in low or \u0027dictwriter\u0027 in low, \u0027Must mention csv.DictWriter\u0027\nassert \u0027fieldnames\u0027 in low, \u0027Must mention fieldnames ordering\u0027\nassert \u0027writeheader\u0027 in low or \u0027header row\u0027 in low, \u0027Must mention writeheader/header row\u0027\nassert \u0027extrasaction\u0027 in low and \u0027raise\u0027 in low, \u0027Must mention extrasaction=raise behavior\u0027\nassert \u0027lineterminator\u0027 in low or \u0027newline\u0027 in low, \u0027Must mention line terminator/newline behavior\u0027\nassert \u0027valueerror\u0027 in low or \u0027raises\u0027 in low, \u0027Must mention ValueError or raising on extra keys\u0027\nassert write_strict_csv([], [\u0027a\u0027, \u0027b\u0027]) == \u0027a,b\\n\u0027\ntry:\n write_strict_csv([{\u0027a\u0027: 1, \u0027b\u0027: 2, \u0027c\u0027: 3}], [\u0027a\u0027, \u0027b\u0027])\n assert False, \u0027extra keys must raise\u0027\nexcept ValueError:\n pass\n","category":"code2NL_NL2code"} {"id":"2","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"from urllib.parse import parse_qsl\n\ndef read_query_pairs(query):\n if query.startswith(\u0027?\u0027):\n query = query[1:]\n return parse_qsl(query, keep_blank_values=True, strict_parsing=True)\n\ndef describe_read_query_pairs():\n","golden_completion":" return (\n \"read_query_pairs strips one leading \u0027?\u0027 and calls urllib.parse.parse_qsl with \"\n \"keep_blank_values=True and strict_parsing=True. It returns an ordered list \"\n \"of (key, value) pairs rather than a dict, so duplicate keys are preserved; \"\n \"blank values remain empty strings, plus signs are decoded as spaces, percent \"\n \"escapes are decoded, and malformed fields raise ValueError.\"\n )\n","suffix":"\npairs = read_query_pairs(\u0027?a=1\u0026empty=\u0026a=2\u0026name=Ada+Lovelace\u0027)\nassert pairs == [(\u0027a\u0027, \u00271\u0027), (\u0027empty\u0027, \u0027\u0027), (\u0027a\u0027, \u00272\u0027), (\u0027name\u0027, \u0027Ada Lovelace\u0027)]\ntry:\n read_query_pairs(\u0027ok=1\u0026broken\u0027)\n assert False, \u0027strict parsing should reject fields without =\u0027\nexcept ValueError:\n pass\nsummary = describe_read_query_pairs()\nassert isinstance(summary, str) and \u0027query\u0027 in summary.lower() and \u0027pair\u0027 in summary.lower()\n","assertions":"doc = describe_read_query_pairs()\nassert isinstance(doc, str), \u0027describe_read_query_pairs must return a string\u0027\nlow = doc.lower()\nassert \u0027parse_qsl\u0027 in low, \u0027Must mention parse_qsl\u0027\nassert \u0027keep_blank_values\u0027 in low or \u0027blank value\u0027 in low, \u0027Must mention blank-value preservation\u0027\nassert \u0027strict_parsing\u0027 in low or \u0027strict parsing\u0027 in low, \u0027Must mention strict parsing\u0027\nassert \u0027duplicate\u0027 in low or \u0027ordered list\u0027 in low or \u0027list of\u0027 in low, \u0027Must mention duplicate/order-preserving list behavior\u0027\nassert \u0027plus\u0027 in low or \u0027space\u0027 in low, \u0027Must mention plus-to-space decoding\u0027\nassert \u0027percent\u0027 in low or \u0027decode\u0027 in low, \u0027Must mention percent decoding\u0027\nassert \u0027valueerror\u0027 in low or \u0027raise\u0027 in low, \u0027Must mention ValueError/raising on malformed fields\u0027\nassert read_query_pairs(\u0027x=\u0026x=2\u0027) == [(\u0027x\u0027, \u0027\u0027), (\u0027x\u0027, \u00272\u0027)]\nassert read_query_pairs(\u0027?encoded=a%2Fb\u0027) == [(\u0027encoded\u0027, \u0027a/b\u0027)]\ntry:\n read_query_pairs(\u0027good=1\u0026bad\u0027)\n assert False, \u0027strict parsing should raise\u0027\nexcept ValueError:\n pass\n","category":"code2NL_NL2code"} {"id":"3","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def safe_divide(a, b):\n","golden_completion":" \"\"\"Divide a by b, returning None instead of raising\n ZeroDivisionError when b is zero. Returns a float result\n for valid divisions.\n \"\"\"\n","suffix":" if b == 0:\n return None\n return a / b\n\nassert safe_divide(10, 2) == 5.0\nassert safe_divide(0, 5) == 0.0\nassert safe_divide(7, 0) is None\n","assertions":"assert safe_divide(1, 3) == 1/3\nassert safe_divide(-6, 2) == -3.0\nassert safe_divide(0, 0) is None\nassert safe_divide(100, 0) is None\nassert type(safe_divide(4, 2)) is float\n","category":"code2NL_NL2code"} {"id":"4","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"_call_count = 0\n\ndef tracked_add(a, b):\n","golden_completion":" \"\"\"Add two numbers and return the result.\n\n Side effect: increments the module-level _call_count variable\n on every call. This can be used to track how many times the\n function has been invoked.\n \"\"\"\n","suffix":" global _call_count\n _call_count += 1\n return a + b\n\n_call_count = 0\nassert tracked_add(2, 3) == 5\nassert _call_count == 1\ntracked_add(0, 0)\nassert _call_count == 2\n","assertions":"_call_count = 0\nfor i in range(10):\n tracked_add(i, i)\nassert _call_count == 10\ntracked_add(1, 1)\nassert _call_count == 11\n","category":"code2NL_NL2code"} {"id":"5","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def find_index(lst, value):\n","golden_completion":" \"\"\"Return the index of the first occurrence of value in lst.\n\n If value appears exactly once, returns an int. If value appears\n multiple times, returns a list of all indices. If value is not\n found, returns -1.\n \"\"\"\n","suffix":" indices = [i for i, x in enumerate(lst) if x == value]\n if len(indices) == 0:\n return -1\n elif len(indices) == 1:\n return indices[0]\n else:\n return indices\n\nassert find_index([10, 20, 30], 20) == 1\nassert find_index([1, 2, 1, 3, 1], 1) == [0, 2, 4]\nassert find_index([1, 2, 3], 99) == -1\n","assertions":"assert find_index([], 1) == -1\nassert find_index([5], 5) == 0\nassert type(find_index([5], 5)) is int\nassert find_index([5, 5], 5) == [0, 1]\nassert type(find_index([5, 5], 5)) is list\nassert find_index([1, 2, 3, 2], 2) == [1, 3]\n","category":"code2NL_NL2code"} {"id":"6","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"import bisect\nimport operator\n\ndef insert_by_score(records, score, payload):\n index = bisect.bisect_left(records, score, key=operator.itemgetter(\u0027score\u0027))\n records.insert(index, {\u0027score\u0027: score, \u0027payload\u0027: payload})\n return index\n\ndef describe_insert_by_score():\n","golden_completion":" return (\n \"insert_by_score uses bisect.bisect_left with key=operator.itemgetter(\u0027score\u0027) \"\n \"to search a list of record dictionaries by their score field. The probe value \"\n \"is the raw score, not a record, because bisect\u0027s key is applied to list items \"\n \"rather than to x. Equal scores insert on the left before existing ties, the \"\n \"input list is mutated in place with dict insertion, and the returned integer \"\n \"is the insertion index.\"\n )\n","suffix":"\nrows = [{\u0027score\u0027: 10, \u0027payload\u0027: \u0027a\u0027}, {\u0027score\u0027: 20, \u0027payload\u0027: \u0027b\u0027}]\npos = insert_by_score(rows, 15, \u0027mid\u0027)\nassert pos == 1\nassert rows == [{\u0027score\u0027: 10, \u0027payload\u0027: \u0027a\u0027}, {\u0027score\u0027: 15, \u0027payload\u0027: \u0027mid\u0027}, {\u0027score\u0027: 20, \u0027payload\u0027: \u0027b\u0027}]\npos2 = insert_by_score(rows, 15, \u0027tie\u0027)\nassert pos2 == 1\nassert [r[\u0027payload\u0027] for r in rows] == [\u0027a\u0027, \u0027tie\u0027, \u0027mid\u0027, \u0027b\u0027]\nsummary = describe_insert_by_score()\nassert isinstance(summary, str) and \u0027score\u0027 in summary.lower() and \u0027insert\u0027 in summary.lower()\n","assertions":"doc = describe_insert_by_score()\nassert isinstance(doc, str), \u0027describe_insert_by_score must return a string\u0027\nlow = doc.lower()\nassert \u0027bisect_left\u0027 in low or \u0027bisect.bisect_left\u0027 in low, \u0027Must mention bisect_left\u0027\nassert \u0027operator.itemgetter\u0027 in low or \u0027itemgetter\u0027 in low, \u0027Must mention operator.itemgetter key\u0027\nassert \u0027key\u0027 in low and (\u0027list item\u0027 in low or \u0027record\u0027 in low or \u0027not\u0027 in low and \u0027probe\u0027 in low), \u0027Must describe bisect key/probe semantics\u0027\nassert \u0027left\u0027 in low or \u0027tie\u0027 in low or \u0027equal\u0027 in low, \u0027Must mention left insertion on equal scores\u0027\nassert \u0027in place\u0027 in low or \u0027in-place\u0027 in low or \u0027mutat\u0027 in low, \u0027Must mention in-place mutation\u0027\nassert \u0027index\u0027 in low or \u0027integer\u0027 in low, \u0027Must mention returned insertion index\u0027\nitems = [{\u0027score\u0027: 1, \u0027payload\u0027: \u0027a\u0027}, {\u0027score\u0027: 3, \u0027payload\u0027: \u0027c\u0027}]\nassert insert_by_score(items, 0, \u0027z\u0027) == 0\nassert insert_by_score(items, 3, \u0027left tie\u0027) == 2\nassert [x[\u0027payload\u0027] for x in items] == [\u0027z\u0027, \u0027a\u0027, \u0027left tie\u0027, \u0027c\u0027]\n","category":"code2NL_NL2code"} {"id":"7","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def parse_int_graceful(s, default=0):\n","golden_completion":" \"\"\"Parse a string as an integer, stripping leading/trailing whitespace.\n\n Returns the parsed integer on success. If parsing fails for any\n reason (non-numeric string, None input, etc.), returns the default\n value instead of raising an exception. The default is 0 if not\n specified.\n \"\"\"\n","suffix":" try:\n return int(str(s).strip())\n except (ValueError, TypeError):\n return default\n\nassert parse_int_graceful(\"42\") == 42\nassert parse_int_graceful(\" -7 \") == -7\nassert parse_int_graceful(\"abc\") == 0\nassert parse_int_graceful(None) == 0\nassert parse_int_graceful(\"xyz\", default=-1) == -1\n","assertions":"assert parse_int_graceful(\"\") == 0\nassert parse_int_graceful(\" \") == 0\nassert parse_int_graceful(\"3.14\") == 0\nassert parse_int_graceful(\"123abc\") == 0\nassert parse_int_graceful(None, default=99) == 99\nassert parse_int_graceful(\"100\") == 100\n","category":"code2NL_NL2code"} {"id":"8","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"from datetime import datetime, timezone\n\ndef parse_log_timestamp(text):\n parsed = datetime.strptime(text, \u0027%Y-%m-%dT%H:%M:%S%z\u0027)\n return parsed.astimezone(timezone.utc)\n\ndef describe_parse_log_timestamp():\n","golden_completion":" return (\n \"parse_log_timestamp parses text with datetime.strptime using the exact \"\n \"\u0027%Y-%m-%dT%H:%M:%S%z\u0027 format. The %z directive requires and interprets \"\n \"a numeric UTC offset, producing an aware datetime, then astimezone(timezone.utc) \"\n \"normalizes the result to UTC. Invalid text or missing offsets raise ValueError.\"\n )\n","suffix":"\nfrom datetime import timedelta\nassert parse_log_timestamp(\u00272026-04-30T10:15:00+0200\u0027) == datetime(2026, 4, 30, 8, 15, tzinfo=timezone.utc)\nassert parse_log_timestamp(\u00272026-04-30T10:15:00-0730\u0027) == datetime(2026, 4, 30, 17, 45, tzinfo=timezone.utc)\ntry:\n parse_log_timestamp(\u00272026-04-30T10:15:00\u0027)\n assert False, \u0027offset is required by %z\u0027\nexcept ValueError:\n pass\nsummary = describe_parse_log_timestamp()\nassert isinstance(summary, str) and \u0027timestamp\u0027 in summary.lower() and \u0027utc\u0027 in summary.lower()\n","assertions":"doc = describe_parse_log_timestamp()\nassert isinstance(doc, str), \u0027describe_parse_log_timestamp must return a string\u0027\nlow = doc.lower()\nassert \u0027datetime.strptime\u0027 in low or \u0027strptime\u0027 in low, \u0027Must mention datetime.strptime\u0027\nassert \u0027%z\u0027 in doc, \u0027Must mention the %z offset directive\u0027\nassert \u0027offset\u0027 in low, \u0027Must mention UTC offset parsing\u0027\nassert \u0027aware\u0027 in low or \u0027timezone\u0027 in low, \u0027Must mention aware/timezone-bearing datetimes\u0027\nassert \u0027astimezone\u0027 in low or \u0027timezone.utc\u0027 in low or \u0027utc\u0027 in low, \u0027Must mention UTC normalization\u0027\nassert \u0027valueerror\u0027 in low or \u0027raise\u0027 in low, \u0027Must mention ValueError on invalid input\u0027\nassert parse_log_timestamp(\u00272026-01-01T00:00:00+0000\u0027) == datetime(2026, 1, 1, 0, 0, tzinfo=timezone.utc)\nassert parse_log_timestamp(\u00272026-01-01T00:00:00+0530\u0027) == datetime(2025, 12, 31, 18, 30, tzinfo=timezone.utc)\ntry:\n parse_log_timestamp(\u0027not-a-date\u0027)\n assert False, \u0027invalid text should raise\u0027\nexcept ValueError:\n pass\n","category":"code2NL_NL2code"} {"id":"9","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"import hashlib\n\ndef sha256_stream_hex(stream, chunk_size=8192):\n start = stream.tell()\n digest = hashlib.sha256()\n try:\n for block in iter(lambda: stream.read(chunk_size), b\u0027\u0027):\n digest.update(block)\n return digest.hexdigest()\n finally:\n stream.seek(start)\n\ndef describe_sha256_stream_hex():\n","golden_completion":" return (\n \"sha256_stream_hex hashes a seekable binary stream without consuming its \"\n \"position: it saves stream.tell(), reads bytes in chunk_size blocks until b\u0027\u0027, \"\n \"feeds each block to hashlib.sha256().update(), returns the digest.hexdigest() \"\n \"64-character lowercase hexadecimal string, and restores the original position \"\n \"with stream.seek() in a finally block.\"\n )\n","suffix":"\nfrom io import BytesIO\nstream = BytesIO(b\u0027abc\u0027)\nassert sha256_stream_hex(stream, chunk_size=2) == hashlib.sha256(b\u0027abc\u0027).hexdigest()\nassert stream.tell() == 0\nstream.seek(1)\nassert sha256_stream_hex(stream, chunk_size=1) == hashlib.sha256(b\u0027bc\u0027).hexdigest()\nassert stream.tell() == 1\nsummary = describe_sha256_stream_hex()\nassert isinstance(summary, str) and \u0027sha\u0027 in summary.lower() and \u0027stream\u0027 in summary.lower()\n","assertions":"doc = describe_sha256_stream_hex()\nassert isinstance(doc, str), \u0027describe_sha256_stream_hex must return a string\u0027\nlow = doc.lower()\nassert \u0027hashlib.sha256\u0027 in low or \u0027sha256()\u0027 in low, \u0027Must mention hashlib.sha256()\u0027\nassert \u0027update\u0027 in low, \u0027Must mention digest.update()\u0027\nassert \u0027chunk\u0027 in low or \u0027block\u0027 in low, \u0027Must mention chunked reads\u0027\nassert \u0027hexdigest\u0027 in low, \u0027Must mention hexdigest()\u0027\nassert \u002764\u0027 in low and (\u0027hex\u0027 in low or \u0027hexadecimal\u0027 in low), \u0027Must mention 64-character hex output\u0027\nassert \u0027tell\u0027 in low or \u0027seek\u0027 in low or \u0027position\u0027 in low, \u0027Must mention preserving/restoring stream position\u0027\nfrom io import BytesIO\ndata = BytesIO(b\u0027hello world\u0027)\ndata.seek(6)\nexpected = hashlib.sha256(b\u0027world\u0027).hexdigest()\nassert sha256_stream_hex(data, chunk_size=3) == expected\nassert data.tell() == 6\nassert len(sha256_stream_hex(BytesIO(b\u0027\u0027))) == 64\n","category":"code2NL_NL2code"} {"id":"10","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"import json\n\ndef load_json_pairs(text):\n return json.loads(text, object_pairs_hook=list)\n\ndef describe_load_json_pairs():\n","golden_completion":" return (\n \"load_json_pairs calls json.loads with object_pairs_hook=list, so each JSON \"\n \"object is decoded as an ordered list of (key, value) pairs instead of a dict. \"\n \"That preserves duplicate keys and source order, applies to nested objects too, \"\n \"leaves arrays as normal lists, and propagates json.JSONDecodeError for invalid JSON.\"\n )\n","suffix":"\nparsed = load_json_pairs(\u0027{\"a\": 1, \"a\": 2, \"b\": {\"x\": 3}}\u0027)\nassert parsed == [(\u0027a\u0027, 1), (\u0027a\u0027, 2), (\u0027b\u0027, [(\u0027x\u0027, 3)])]\nassert load_json_pairs(\u0027[{\"x\": 1}, {\"x\": 2}]\u0027) == [[(\u0027x\u0027, 1)], [(\u0027x\u0027, 2)]]\ntry:\n load_json_pairs(\u0027{bad json}\u0027)\n assert False, \u0027invalid JSON should raise\u0027\nexcept json.JSONDecodeError:\n pass\nsummary = describe_load_json_pairs()\nassert isinstance(summary, str) and \u0027json\u0027 in summary.lower() and \u0027pair\u0027 in summary.lower()\n","assertions":"doc = describe_load_json_pairs()\nassert isinstance(doc, str), \u0027describe_load_json_pairs must return a string\u0027\nlow = doc.lower()\nassert \u0027json.loads\u0027 in low or \u0027loads\u0027 in low, \u0027Must mention json.loads\u0027\nassert \u0027object_pairs_hook\u0027 in low, \u0027Must mention object_pairs_hook\u0027\nassert \u0027list\u0027 in low and (\u0027pair\u0027 in low or \u0027tuple\u0027 in low), \u0027Must mention list of pairs\u0027\nassert \u0027duplicate\u0027 in low, \u0027Must mention duplicate key preservation\u0027\nassert \u0027order\u0027 in low or \u0027ordered\u0027 in low, \u0027Must mention source/order preservation\u0027\nassert \u0027nested\u0027 in low, \u0027Must mention nested object behavior\u0027\nassert \u0027jsondecodeerror\u0027 in low or \u0027decodeerror\u0027 in low or \u0027invalid\u0027 in low and \u0027raise\u0027 in low, \u0027Must mention JSONDecodeError/invalid JSON\u0027\nassert load_json_pairs(\u0027{\"z\":0, \"z\":1}\u0027) == [(\u0027z\u0027, 0), (\u0027z\u0027, 1)]\nassert load_json_pairs(\u0027{\"outer\": {\"a\": 1, \"a\": 2}, \"arr\": [1, 2]}\u0027) == [(\u0027outer\u0027, [(\u0027a\u0027, 1), (\u0027a\u0027, 2)]), (\u0027arr\u0027, [1, 2])]\ntry:\n load_json_pairs(\u0027[\u0027)\n assert False\nexcept json.JSONDecodeError:\n pass\n","category":"code2NL_NL2code"} {"id":"11","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"from decimal import Decimal, InvalidOperation, ROUND_HALF_UP, localcontext\n\ndef quantize_money(value):\n with localcontext() as ctx:\n ctx.traps[InvalidOperation] = True\n amount = Decimal(str(value))\n return amount.quantize(Decimal(\u00270.01\u0027), rounding=ROUND_HALF_UP)\n\ndef describe_quantize_money():\n","golden_completion":" return (\n \"quantize_money converts the input through Decimal(str(value)) inside a \"\n \"localcontext whose InvalidOperation trap is enabled, then returns a Decimal \"\n \"quantized to Decimal(\u00270.01\u0027) with ROUND_HALF_UP. It rounds to exactly two \"\n \"decimal places, uses half-up rather than binary float or banker\u0027s rounding, \"\n \"and invalid decimal text raises decimal.InvalidOperation.\"\n )\n","suffix":"\nassert quantize_money(\u00271.005\u0027) == Decimal(\u00271.01\u0027)\nassert quantize_money(\u00271.004\u0027) == Decimal(\u00271.00\u0027)\nassert quantize_money(2) == Decimal(\u00272.00\u0027)\ntry:\n quantize_money(\u0027not-money\u0027)\n assert False, \u0027invalid decimal should raise\u0027\nexcept InvalidOperation:\n pass\nsummary = describe_quantize_money()\nassert isinstance(summary, str) and \u0027decimal\u0027 in summary.lower() and \u0027round\u0027 in summary.lower()\n","assertions":"doc = describe_quantize_money()\nassert isinstance(doc, str), \u0027describe_quantize_money must return a string\u0027\nlow = doc.lower()\nassert \u0027decimal\u0027 in low, \u0027Must mention Decimal\u0027\nassert \u0027quantize\u0027 in low, \u0027Must mention quantize\u0027\nassert \u00270.01\u0027 in doc or \u0027two decimal\u0027 in low or \u00272 decimal\u0027 in low, \u0027Must mention two-place quantization\u0027\nassert \u0027round_half_up\u0027 in low or \u0027half-up\u0027 in low or \u0027half up\u0027 in low, \u0027Must mention ROUND_HALF_UP\u0027\nassert \u0027localcontext\u0027 in low or \u0027context\u0027 in low, \u0027Must mention localcontext/context behavior\u0027\nassert \u0027invalidoperation\u0027 in low or \u0027invalid\u0027 in low and \u0027raise\u0027 in low, \u0027Must mention InvalidOperation on invalid input\u0027\nassert \u0027float\u0027 in low or \u0027decimal\u0027 in low and \u0027return\u0027 in low, \u0027Must distinguish Decimal return from float arithmetic\u0027\nassert quantize_money(\u00272.675\u0027) == Decimal(\u00272.68\u0027)\nassert type(quantize_money(\u00273\u0027)) is Decimal\ntry:\n quantize_money(\u0027NaN!\u0027)\n assert False\nexcept InvalidOperation:\n pass\n","category":"code2NL_NL2code"} {"id":"12","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"from dataclasses import dataclass, replace, asdict\n\n@dataclass(frozen=True)\nclass Job:\n name: str\n retries: int = 0\n tags: tuple = ()\n\ndef retry_job(job, reason):\n updated = replace(job, retries=job.retries + 1, tags=job.tags + (reason,))\n return updated, asdict(updated)\n\ndef describe_retry_job():\n","golden_completion":" return (\n \"retry_job works with a frozen dataclass Job by using dataclasses.replace \"\n \"to create a new instance with retries incremented and tags extended by tuple \"\n \"concatenation. The original Job is unchanged, the returned first value is the \"\n \"new Job instance, and the second value is dataclasses.asdict(updated), a dict \"\n \"snapshot of the updated dataclass fields.\"\n )\n","suffix":"\njob = Job(\u0027sync\u0027)\nupdated, snapshot = retry_job(job, \u0027timeout\u0027)\nassert job == Job(\u0027sync\u0027, 0, ())\nassert updated == Job(\u0027sync\u0027, 1, (\u0027timeout\u0027,))\nassert snapshot == {\u0027name\u0027: \u0027sync\u0027, \u0027retries\u0027: 1, \u0027tags\u0027: (\u0027timeout\u0027,)}\nupdated2, snapshot2 = retry_job(updated, \u0027again\u0027)\nassert updated2.tags == (\u0027timeout\u0027, \u0027again\u0027)\nassert snapshot2[\u0027retries\u0027] == 2\nsummary = describe_retry_job()\nassert isinstance(summary, str) and \u0027job\u0027 in summary.lower() and \u0027retry\u0027 in summary.lower()\n","assertions":"doc = describe_retry_job()\nassert isinstance(doc, str), \u0027describe_retry_job must return a string\u0027\nlow = doc.lower()\nassert \u0027dataclass\u0027 in low, \u0027Must mention dataclass\u0027\nassert \u0027frozen\u0027 in low or \u0027immutable\u0027 in low, \u0027Must mention frozen/immutable Job behavior\u0027\nassert \u0027replace\u0027 in low, \u0027Must mention dataclasses.replace\u0027\nassert \u0027asdict\u0027 in low or \u0027dict\u0027 in low and \u0027snapshot\u0027 in low, \u0027Must mention dataclasses.asdict/dict snapshot\u0027\nassert \u0027original\u0027 in low and (\u0027unchanged\u0027 in low or \u0027not\u0027 in low and \u0027mutat\u0027 in low), \u0027Must mention original object is unchanged\u0027\nassert \u0027tuple\u0027 in low or \u0027tags\u0027 in low, \u0027Must mention tuple/tag extension behavior\u0027\nassert \u0027retries\u0027 in low or \u0027increment\u0027 in low, \u0027Must mention retry count increment\u0027\nbase = Job(\u0027export\u0027, 2, (\u0027queued\u0027,))\nnew_job, data = retry_job(base, \u0027network\u0027)\nassert base == Job(\u0027export\u0027, 2, (\u0027queued\u0027,))\nassert new_job == Job(\u0027export\u0027, 3, (\u0027queued\u0027, \u0027network\u0027))\nassert data == {\u0027name\u0027: \u0027export\u0027, \u0027retries\u0027: 3, \u0027tags\u0027: (\u0027queued\u0027, \u0027network\u0027)}\nassert new_job is not base\n","category":"code2NL_NL2code"} {"id":"13","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"import heapq\n\ndef newest_high_priority(events, limit):\n return heapq.nlargest(limit, events, key=lambda event: (event[\u0027priority\u0027], event[\u0027created_at\u0027]))\n\ndef describe_newest_high_priority():\n","golden_completion":" return (\n \"newest_high_priority returns heapq.nlargest(limit, events, key=...) using \"\n \"a tuple key of (priority, created_at). Higher priority ranks first, and \"\n \"created_at breaks ties by choosing the newest/largest timestamp first. The \"\n \"function returns the selected event dictionaries in descending key order, \"\n \"respects the requested limit, and does not mutate the input events list.\"\n )\n","suffix":"\nevents = [\n {\u0027id\u0027: \u0027old-high\u0027, \u0027priority\u0027: 5, \u0027created_at\u0027: 10},\n {\u0027id\u0027: \u0027low-new\u0027, \u0027priority\u0027: 1, \u0027created_at\u0027: 99},\n {\u0027id\u0027: \u0027new-high\u0027, \u0027priority\u0027: 5, \u0027created_at\u0027: 20},\n {\u0027id\u0027: \u0027mid\u0027, \u0027priority\u0027: 3, \u0027created_at\u0027: 50},\n]\noriginal = list(events)\nselected = newest_high_priority(events, 2)\nassert [e[\u0027id\u0027] for e in selected] == [\u0027new-high\u0027, \u0027old-high\u0027]\nassert events == original\nassert newest_high_priority(events, 0) == []\nsummary = describe_newest_high_priority()\nassert isinstance(summary, str) and \u0027priority\u0027 in summary.lower() and \u0027event\u0027 in summary.lower()\n","assertions":"doc = describe_newest_high_priority()\nassert isinstance(doc, str), \u0027describe_newest_high_priority must return a string\u0027\nlow = doc.lower()\nassert \u0027heapq.nlargest\u0027 in low or \u0027nlargest\u0027 in low, \u0027Must mention heapq.nlargest\u0027\nassert \u0027limit\u0027 in low, \u0027Must mention limit parameter\u0027\nassert \u0027tuple\u0027 in low or \u0027(priority\u0027 in low, \u0027Must mention tuple key\u0027\nassert \u0027priority\u0027 in low, \u0027Must mention priority ordering\u0027\nassert \u0027created_at\u0027 in low or \u0027created at\u0027 in low or \u0027timestamp\u0027 in low, \u0027Must mention created_at tie-breaker\u0027\nassert \u0027newest\u0027 in low or \u0027largest\u0027 in low or \u0027tie\u0027 in low, \u0027Must mention newest/largest tie behavior\u0027\nassert \u0027not mutate\u0027 in low or \u0027does not mutate\u0027 in low or \u0027input\u0027 in low and \u0027unchanged\u0027 in low, \u0027Must mention non-mutating behavior\u0027\nmore = [\n {\u0027id\u0027: \u0027a\u0027, \u0027priority\u0027: 2, \u0027created_at\u0027: 1},\n {\u0027id\u0027: \u0027b\u0027, \u0027priority\u0027: 2, \u0027created_at\u0027: 3},\n {\u0027id\u0027: \u0027c\u0027, \u0027priority\u0027: 9, \u0027created_at\u0027: 0},\n]\ncopy = list(more)\nassert [e[\u0027id\u0027] for e in newest_high_priority(more, 3)] == [\u0027c\u0027, \u0027b\u0027, \u0027a\u0027]\nassert more == copy\n","category":"code2NL_NL2code"} {"id":"14","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"from pathlib import PurePosixPath\n\ndef posix_path_snapshot(path):\n p = PurePosixPath(path)\n return {\n \u0027text\u0027: p.as_posix(),\n \u0027parts\u0027: p.parts,\n \u0027name\u0027: p.name,\n \u0027suffixes\u0027: p.suffixes,\n \u0027parent\u0027: p.parent.as_posix(),\n }\n\ndef describe_posix_path_snapshot():\n","golden_completion":" return (\n \"posix_path_snapshot uses pathlib.PurePosixPath, so it performs lexical \"\n \"POSIX path parsing without touching the filesystem and without resolving \u0027..\u0027. \"\n \"It returns p.as_posix() text, the p.parts tuple, the final p.name, the p.suffixes \"\n \"list for all extensions, and the parent path from p.parent.as_posix().\"\n )\n","suffix":"\nsnap = posix_path_snapshot(\u0027/var/log/../app/archive.tar.gz\u0027)\nassert snap[\u0027text\u0027] == \u0027/var/log/../app/archive.tar.gz\u0027\nassert snap[\u0027parts\u0027] == (\u0027/\u0027, \u0027var\u0027, \u0027log\u0027, \u0027..\u0027, \u0027app\u0027, \u0027archive.tar.gz\u0027)\nassert snap[\u0027name\u0027] == \u0027archive.tar.gz\u0027\nassert snap[\u0027suffixes\u0027] == [\u0027.tar\u0027, \u0027.gz\u0027]\nassert snap[\u0027parent\u0027] == \u0027/var/log/../app\u0027\nsummary = describe_posix_path_snapshot()\nassert isinstance(summary, str) and \u0027path\u0027 in summary.lower() and \u0027posix\u0027 in summary.lower()\n","assertions":"doc = describe_posix_path_snapshot()\nassert isinstance(doc, str), \u0027describe_posix_path_snapshot must return a string\u0027\nlow = doc.lower()\nassert \u0027pathlib\u0027 in low or \u0027pureposixpath\u0027 in low, \u0027Must mention pathlib.PurePosixPath\u0027\nassert \u0027lexical\u0027 in low or \u0027without touching\u0027 in low or \u0027filesystem\u0027 in low, \u0027Must mention lexical/no-filesystem behavior\u0027\nassert \u0027..\u0027 in doc or \u0027resolve\u0027 in low, \u0027Must mention that dot-dot is not resolved\u0027\nassert \u0027as_posix\u0027 in low, \u0027Must mention as_posix()\u0027\nassert \u0027parts\u0027 in low and \u0027tuple\u0027 in low, \u0027Must mention parts tuple\u0027\nassert \u0027suffixes\u0027 in low and \u0027list\u0027 in low, \u0027Must mention suffixes list\u0027\nassert \u0027parent\u0027 in low, \u0027Must mention parent path\u0027\ns = posix_path_snapshot(\u0027relative/pkg/module.py\u0027)\nassert s == {\u0027text\u0027: \u0027relative/pkg/module.py\u0027, \u0027parts\u0027: (\u0027relative\u0027, \u0027pkg\u0027, \u0027module.py\u0027), \u0027name\u0027: \u0027module.py\u0027, \u0027suffixes\u0027: [\u0027.py\u0027], \u0027parent\u0027: \u0027relative/pkg\u0027}\ns2 = posix_path_snapshot(\u0027/a/../b\u0027)\nassert s2[\u0027text\u0027] == \u0027/a/../b\u0027\nassert s2[\u0027parts\u0027] == (\u0027/\u0027, \u0027a\u0027, \u0027..\u0027, \u0027b\u0027)\n","category":"code2NL_NL2code"} {"id":"15","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def run_length_encode(s):\n \"\"\"Encode a string using run-length encoding.\n\n Consecutive identical characters are replaced by the character\n followed by its count. Single characters (count=1) are still\n followed by \u00271\u0027. Returns the encoded string.\n\n Example: \"aaabbc\" -\u003e \"a3b2c1\"\n Empty string returns empty string.\n \"\"\"\n","golden_completion":" if not s:\n return \"\"\n result = []\n count = 1\n for i in range(1, len(s)):\n if s[i] == s[i - 1]:\n count += 1\n else:\n result.append(s[i - 1] + str(count))\n count = 1\n result.append(s[-1] + str(count))\n return \"\".join(result)\n","suffix":"\nassert run_length_encode(\"aaabbc\") == \"a3b2c1\"\nassert run_length_encode(\"\") == \"\"\nassert run_length_encode(\"a\") == \"a1\"\nassert run_length_encode(\"aaa\") == \"a3\"\n","assertions":"assert run_length_encode(\"abcdef\") == \"a1b1c1d1e1f1\"\nassert run_length_encode(\"aabbcc\") == \"a2b2c2\"\nassert run_length_encode(\"aaaaaaaaaa\") == \"a10\"\nassert run_length_encode(\"ab\") == \"a1b1\"\nassert run_length_encode(\"aab\") == \"a2b1\"\n","category":"code2NL_NL2code"} {"id":"16","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def stable_partition_in_place(items, keep):\n","golden_completion":" \"\"\"Stably partition items in place according to keep.\n\n Items for which keep(item) is true are moved to the front, followed\n by the remaining items, while preserving relative order within both\n groups. The predicate is called exactly once for each original item.\n The same list object is mutated, and the return value is the split\n index: the number of kept items.\n \"\"\"\n","suffix":" kept = []\n rejected = []\n for item in items:\n if keep(item):\n kept.append(item)\n else:\n rejected.append(item)\n items[:] = kept + rejected\n return len(kept)\n\ndata = [3, 2, 4, 1, 6]\nidx = stable_partition_in_place(data, lambda x: x % 2 == 0)\nassert idx == 3\nassert data == [2, 4, 6, 3, 1]\n\nwords = [\u0027ant\u0027, \u0027bear\u0027, \u0027cat\u0027, \u0027dog\u0027]\nidx2 = stable_partition_in_place(words, lambda s: len(s) == 3)\nassert idx2 == 3\nassert words == [\u0027ant\u0027, \u0027cat\u0027, \u0027dog\u0027, \u0027bear\u0027]\n","assertions":"docstring = stable_partition_in_place.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nlow = docstring.lower()\nassert \u0027in place\u0027 in low or \u0027in-place\u0027 in low or \u0027mutat\u0027 in low, \u0027Must mention in-place mutation\u0027\nassert \u0027stable\u0027 in low or \u0027relative order\u0027 in low or \u0027preserv\u0027 in low, \u0027Must mention stable/order-preserving behavior\u0027\nassert \u0027split\u0027 in low or \u0027number of kept\u0027 in low or \u0027count\u0027 in low or \u0027index\u0027 in low, \u0027Must describe returned split index/count\u0027\nassert \u0027predicate\u0027 in low or \u0027keep\u0027 in low, \u0027Must mention predicate/keep function\u0027\n\nseen = []\nvalues = [5, 1, 4, 2]\nret = stable_partition_in_place(values, lambda x: seen.append(x) or x \u003c 4)\nassert ret == 2\nassert values == [1, 2, 5, 4]\nassert seen == [5, 1, 4, 2]\n\nempty = []\nassert stable_partition_in_place(empty, lambda x: True) == 0\nassert empty == []\n","category":"code2NL_NL2code"} {"id":"17","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"import threading\n\nclass OnceRegistry:\n def __init__(self):\n self._lock = threading.Lock()\n self._values = {}\n self._created = []\n\n def register_once(self, key, factory):\n","golden_completion":" \"\"\"Return the value registered for key, creating it at most once.\n\n The factory is called only while key is absent; later calls return\n the exact cached object without calling factory again. Access is\n protected by the instance lock, so registration is thread-safe, and\n _created records keys only on first creation.\n \"\"\"\n","suffix":" with self._lock:\n if key not in self._values:\n self._values[key] = factory()\n self._created.append(key)\n return self._values[key]\n\nreg = OnceRegistry()\ncalls = []\nfirst = reg.register_once(\u0027db\u0027, lambda: calls.append(\u0027made\u0027) or {\u0027conn\u0027: 1})\nsecond = reg.register_once(\u0027db\u0027, lambda: calls.append(\u0027again\u0027) or {\u0027conn\u0027: 2})\nassert first is second\nassert calls == [\u0027made\u0027]\nassert reg._created == [\u0027db\u0027]\n\nother = reg.register_once(\u0027cache\u0027, lambda: object())\nassert other is reg._values[\u0027cache\u0027]\nassert reg._created == [\u0027db\u0027, \u0027cache\u0027]\n","assertions":"docstring = OnceRegistry.register_once.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nlow = docstring.lower()\nassert \u0027thread\u0027 in low or \u0027lock\u0027 in low, \u0027Must mention thread safety or locking\u0027\nassert \u0027once\u0027 in low or \u0027at most\u0027 in low or \u0027only\u0027 in low, \u0027Must mention one-time creation\u0027\nassert \u0027factory\u0027 in low, \u0027Must mention the factory callback\u0027\nassert \u0027cache\u0027 in low or \u0027same\u0027 in low or \u0027existing\u0027 in low, \u0027Must mention returning cached/existing value\u0027\n\nreg2 = OnceRegistry()\ncount = {\u0027n\u0027: 0}\ndef make_list():\n count[\u0027n\u0027] += 1\n return []\nvalue1 = reg2.register_once(\u0027x\u0027, make_list)\nvalue1.append(10)\nvalue2 = reg2.register_once(\u0027x\u0027, make_list)\nassert value2 == [10]\nassert value1 is value2\nassert count[\u0027n\u0027] == 1\nassert reg2._created == [\u0027x\u0027]\n","category":"code2NL_NL2code"} {"id":"18","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def insort_unique(sorted_list, value):\n","golden_completion":" \"\"\"Insert value into sorted_list maintaining sorted order, but\n only if value is not already present. Uses binary search to find\n the insertion point. Modifies the list in-place and returns None.\n If the value already exists, the list is left unchanged.\n \"\"\"\n","suffix":" import bisect\n idx = bisect.bisect_left(sorted_list, value)\n if idx \u003c len(sorted_list) and sorted_list[idx] == value:\n return None\n sorted_list.insert(idx, value)\n return None\n\ndata = [1, 3, 5, 7]\ninsort_unique(data, 4)\nassert data == [1, 3, 4, 5, 7]\ninsort_unique(data, 4) # duplicate - no change\nassert data == [1, 3, 4, 5, 7]\n","assertions":"d = []\ninsort_unique(d, 5)\nassert d == [5]\ninsort_unique(d, 3)\nassert d == [3, 5]\ninsort_unique(d, 7)\nassert d == [3, 5, 7]\ninsort_unique(d, 5)\nassert d == [3, 5, 7]\ninsort_unique(d, 1)\nassert d == [1, 3, 5, 7]\nassert insort_unique(d, 10) is None\nassert d == [1, 3, 5, 7, 10]\n","category":"code2NL_NL2code"} {"id":"19","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"from collections import deque\n\nclass RollingAverage:\n def __init__(self, size):\n self.size = size\n self.window = deque()\n self.total = 0\n\n def add(self, value):\n","golden_completion":" \"\"\"Add value to the sliding window and return the current average.\n\n The instance mutates its window and running total. Until exactly\n size values have been seen, returns None. Once full, each new value\n evicts the oldest value and returns the average of the current\n fixed-size window.\n \"\"\"\n","suffix":" self.window.append(value)\n self.total += value\n if len(self.window) \u003e self.size:\n self.total -= self.window.popleft()\n if len(self.window) \u003c self.size:\n return None\n return self.total / self.size\n\nr = RollingAverage(3)\nassert r.add(10) is None\nassert r.add(20) is None\nassert r.add(30) == 20.0\nassert list(r.window) == [10, 20, 30]\nassert r.add(60) == (20 + 30 + 60) / 3\nassert list(r.window) == [20, 30, 60]\n","assertions":"docstring = RollingAverage.add.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nlow = docstring.lower()\nassert \u0027none\u0027 in low, \u0027Must mention returning None before the window is full\u0027\nassert \u0027full\u0027 in low or \u0027size\u0027 in low, \u0027Must mention the full/size threshold\u0027\nassert \u0027oldest\u0027 in low or \u0027evict\u0027 in low or \u0027sliding\u0027 in low, \u0027Must mention oldest-value eviction or sliding behavior\u0027\nassert \u0027mutat\u0027 in low or \u0027state\u0027 in low or \u0027window\u0027 in low, \u0027Must mention state/window mutation\u0027\n\nr2 = RollingAverage(2)\nassert r2.add(5) is None\nassert r2.add(7) == 6.0\nassert r2.add(9) == 8.0\nassert list(r2.window) == [7, 9]\nassert r2.total == 16\n","category":"code2NL_NL2code"} {"id":"20","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def parse_kv_lines(text):\n","golden_completion":" \"\"\"Parse newline-separated key=value records.\n\n Blank lines and lines whose first non-space character is # are skipped.\n Keys and values are stripped of surrounding whitespace. A duplicate key\n is promoted from a single string to a list of values in encounter order.\n Malformed non-comment lines without \u0027=\u0027 raise ValueError with a 1-based\n line number.\n \"\"\"\n","suffix":" result = {}\n for lineno, raw in enumerate(text.splitlines(), 1):\n line = raw.strip()\n if not line or line.startswith(\u0027#\u0027):\n continue\n if \u0027=\u0027 not in line:\n raise ValueError(f\u0027line {lineno}: missing =\u0027)\n key, value = (part.strip() for part in line.split(\u0027=\u0027, 1))\n if key in result:\n if isinstance(result[key], list):\n result[key].append(value)\n else:\n result[key] = [result[key], value]\n else:\n result[key] = value\n return result\n\ntext = \u0027 host = db1 \\n# ignored\\nport=5432\\nhost = db2\\n\u0027\nassert parse_kv_lines(text) == {\u0027host\u0027: [\u0027db1\u0027, \u0027db2\u0027], \u0027port\u0027: \u00275432\u0027}\nassert parse_kv_lines(\u0027\\n # comment only\\n\u0027) == {}\ntry:\n parse_kv_lines(\u0027ok=1\\nbad line\u0027)\n assert False, \u0027Should raise ValueError\u0027\nexcept ValueError as e:\n assert \u0027line 2\u0027 in str(e)\n","assertions":"docstring = parse_kv_lines.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nlow = docstring.lower()\nassert \u0027blank\u0027 in low and \u0027comment\u0027 in low, \u0027Must mention blank/comment lines are skipped\u0027\nassert \u0027strip\u0027 in low or \u0027whitespace\u0027 in low, \u0027Must mention whitespace stripping\u0027\nassert \u0027duplicate\u0027 in low or \u0027list\u0027 in low, \u0027Must mention duplicate-key list behavior\u0027\nassert \u0027valueerror\u0027 in low and \u0027line\u0027 in low, \u0027Must mention line-numbered ValueError\u0027\n\nparsed = parse_kv_lines(\u0027a=1\\na=2\\na=3\\n b = spaced \u0027)\nassert parsed == {\u0027a\u0027: [\u00271\u0027, \u00272\u0027, \u00273\u0027], \u0027b\u0027: \u0027spaced\u0027}\ntry:\n parse_kv_lines(\u0027#x\\n\\nmissing\u0027)\n assert False\nexcept ValueError as e:\n assert \u0027line 3\u0027 in str(e)\n","category":"code2NL_NL2code"} {"id":"21","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def consume_prefix(buffer, n):\n","golden_completion":" \"\"\"Remove and return up to n items from the front of buffer.\n\n The input list is mutated in place by deleting the consumed prefix.\n The return value is a new list containing the removed items. If n is\n larger than the buffer length, all items are returned and buffer becomes\n empty. Negative n raises ValueError.\n \"\"\"\n","suffix":" if n \u003c 0:\n raise ValueError(\u0027n must be non-negative\u0027)\n taken = buffer[:n]\n del buffer[:n]\n return taken\n\nbuf = [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027]\nassert consume_prefix(buf, 2) == [\u0027a\u0027, \u0027b\u0027]\nassert buf == [\u0027c\u0027, \u0027d\u0027]\nassert consume_prefix(buf, 10) == [\u0027c\u0027, \u0027d\u0027]\nassert buf == []\ntry:\n consume_prefix([], -1)\n assert False, \u0027Should raise ValueError\u0027\nexcept ValueError:\n pass\n","assertions":"docstring = consume_prefix.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nlow = docstring.lower()\nassert \u0027mutat\u0027 in low or \u0027in place\u0027 in low or \u0027in-place\u0027 in low or \u0027delete\u0027 in low, \u0027Must mention buffer mutation/deletion\u0027\nassert \u0027return\u0027 in low and (\u0027removed\u0027 in low or \u0027consumed\u0027 in low or \u0027taken\u0027 in low), \u0027Must mention returning removed items\u0027\nassert \u0027negative\u0027 in low and \u0027valueerror\u0027 in low, \u0027Must mention ValueError for negative n\u0027\nassert \u0027empty\u0027 in low or \u0027larger\u0027 in low or \u0027length\u0027 in low, \u0027Must mention over-large n drains the buffer\u0027\n\nbuf2 = [1, 2, 3]\nremoved = consume_prefix(buf2, 0)\nassert removed == []\nassert buf2 == [1, 2, 3]\nassert consume_prefix(buf2, 5) == [1, 2, 3]\nassert buf2 == []\ntry:\n consume_prefix([1], -2)\n assert False\nexcept ValueError as e:\n assert \u0027non-negative\u0027 in str(e)\n","category":"code2NL_NL2code"} {"id":"22","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def chunk(lst, size, pad=None):\n \"\"\"Split lst into chunks of the given size.\n\n If the last chunk is smaller than size, pad it with the pad value\n to make it exactly size elements. If pad is None (default), the\n last chunk is returned as-is without padding.\n\n Returns a list of lists. Raises ValueError if size \u003c 1.\n \"\"\"\n","golden_completion":" if size \u003c 1:\n raise ValueError(\"size must be at least 1\")\n result = []\n for i in range(0, len(lst), size):\n c = lst[i:i + size]\n if pad is not None and len(c) \u003c size:\n c = c + [pad] * (size - len(c))\n result.append(c)\n return result\n","suffix":"\nassert chunk([1, 2, 3, 4, 5], 2) == [[1, 2], [3, 4], [5]]\nassert chunk([1, 2, 3, 4, 5], 2, pad=0) == [[1, 2], [3, 4], [5, 0]]\nassert chunk([1, 2, 3], 3) == [[1, 2, 3]]\nassert chunk([], 5) == []\n","assertions":"assert chunk([1, 2, 3, 4], 1) == [[1], [2], [3], [4]]\nassert chunk([1, 2, 3, 4, 5, 6], 3) == [[1, 2, 3], [4, 5, 6]]\nassert chunk([1], 3, pad=-1) == [[1, -1, -1]]\n\ntry:\n chunk([1, 2], 0)\n assert False, \"Should raise ValueError\"\nexcept ValueError:\n pass\n\ntry:\n chunk([1], -1)\n assert False, \"Should raise ValueError\"\nexcept ValueError:\n pass\n\nassert chunk([1, 2, 3, 4, 5], 5) == [[1, 2, 3, 4, 5]]\nassert chunk([1, 2, 3, 4, 5], 6, pad=0) == [[1, 2, 3, 4, 5, 0]]\n","category":"code2NL_NL2code"} {"id":"23","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def most_common(lst, n=1):\n \"\"\"Return the n most common elements from lst, ordered by frequency\n (highest first). Ties are broken by first occurrence in the\n original list. If n exceeds the number of unique elements, return\n all unique elements (still ordered by frequency then first occurrence).\n Returns a list of elements (not counts). Empty input returns [].\n \"\"\"\n","golden_completion":" if not lst:\n return []\n freq = {}\n first_seen = {}\n for i, item in enumerate(lst):\n freq[item] = freq.get(item, 0) + 1\n if item not in first_seen:\n first_seen[item] = i\n unique = list(freq.keys())\n unique.sort(key=lambda x: (-freq[x], first_seen[x]))\n return unique[:n]\n","suffix":"\nassert most_common([1, 2, 2, 3, 3, 3]) == [3]\nassert most_common([1, 2, 2, 3, 3, 3], 2) == [3, 2]\nassert most_common([1, 1, 2, 2, 3], 2) == [1, 2] # tie broken by first occurrence\nassert most_common([], 5) == []\n","assertions":"assert most_common([5, 5, 5, 1, 1, 2]) == [5]\nassert most_common([5, 5, 5, 1, 1, 2], 3) == [5, 1, 2]\nassert most_common([\"a\", \"b\", \"a\", \"b\", \"c\"], 2) == [\"a\", \"b\"]\nassert most_common([1, 2, 3], 10) == [1, 2, 3] # n \u003e unique count\nassert most_common([1], 1) == [1]\nassert most_common([3, 1, 2, 1, 3], 2) == [3, 1] # both freq=2, 3 appears first\n","category":"code2NL_NL2code"} {"id":"24","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def tokenize_csv_line(line):\n","golden_completion":" \"\"\"Parse a single CSV line into a list of field strings.\n\n Handles quoted fields: a field wrapped in double quotes may contain\n commas and escaped quotes (doubled: \"\"). Leading/trailing whitespace\n outside quotes is NOT stripped. An unclosed quote treats the rest\n of the line as part of the field. Empty input returns [\u0027\u0027].\n \"\"\"\n","suffix":" fields = []\n current = []\n in_quotes = False\n i = 0\n while i \u003c len(line):\n ch = line[i]\n if in_quotes:\n if ch == \u0027\"\u0027 and i + 1 \u003c len(line) and line[i + 1] == \u0027\"\u0027:\n current.append(\u0027\"\u0027)\n i += 2\n continue\n elif ch == \u0027\"\u0027:\n in_quotes = False\n else:\n current.append(ch)\n else:\n if ch == \u0027\"\u0027:\n in_quotes = True\n elif ch == \u0027,\u0027:\n fields.append(\u0027\u0027.join(current))\n current = []\n else:\n current.append(ch)\n i += 1\n fields.append(\u0027\u0027.join(current))\n return fields\n\nassert tokenize_csv_line(\u0027a,b,c\u0027) == [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]\nassert tokenize_csv_line(\u0027\"a,b\",c\u0027) == [\u0027a,b\u0027, \u0027c\u0027]\nassert tokenize_csv_line(\u0027\"a\"\"b\"\u0027) == [\u0027a\"b\u0027]\nassert tokenize_csv_line(\u0027\u0027) == [\u0027\u0027]\n","assertions":"assert tokenize_csv_line(\u0027one,\"two,three\",four\u0027) == [\u0027one\u0027, \u0027two,three\u0027, \u0027four\u0027]\nassert tokenize_csv_line(\u0027\"\"\u0027) == [\u0027\u0027]\nassert tokenize_csv_line(\u0027a,,b\u0027) == [\u0027a\u0027, \u0027\u0027, \u0027b\u0027]\nassert tokenize_csv_line(\u0027\"hello \"\"world\"\"\",test\u0027) == [\u0027hello \"world\"\u0027, \u0027test\u0027]\nassert tokenize_csv_line(\u0027no,quotes,here\u0027) == [\u0027no\u0027, \u0027quotes\u0027, \u0027here\u0027]\nassert tokenize_csv_line(\u0027\"unclosed\u0027) == [\u0027unclosed\u0027]\n","category":"code2NL_NL2code"} {"id":"25","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def merge_intervals(intervals):\n \"\"\"Merge overlapping or touching intervals.\n\n Each interval is a tuple (start, end) where start \u003c= end.\n Two intervals overlap or touch if one\u0027s start \u003c= the other\u0027s end.\n Returns a sorted list of merged (start, end) tuples.\n Empty input returns []. Single interval returns [that interval].\n \"\"\"\n","golden_completion":" if not intervals:\n return []\n sorted_iv = sorted(intervals, key=lambda x: x[0])\n merged = [sorted_iv[0]]\n for start, end in sorted_iv[1:]:\n if start \u003c= merged[-1][1]:\n merged[-1] = (merged[-1][0], max(merged[-1][1], end))\n else:\n merged.append((start, end))\n return merged\n","suffix":"\nassert merge_intervals([(1, 3), (2, 6), (8, 10)]) == [(1, 6), (8, 10)]\nassert merge_intervals([(1, 4), (4, 5)]) == [(1, 5)]\nassert merge_intervals([]) == []\nassert merge_intervals([(1, 1)]) == [(1, 1)]\n","assertions":"assert merge_intervals([(5, 10), (1, 3), (2, 4)]) == [(1, 4), (5, 10)]\nassert merge_intervals([(1, 10), (2, 3), (4, 5)]) == [(1, 10)]\nassert merge_intervals([(1, 2), (3, 4), (5, 6)]) == [(1, 2), (3, 4), (5, 6)]\nassert merge_intervals([(1, 5), (2, 3)]) == [(1, 5)] # fully contained\nassert merge_intervals([(1, 2)]) == [(1, 2)]\nassert merge_intervals([(3, 4), (1, 2), (2, 3)]) == [(1, 4)] # touching chain\n","category":"code2NL_NL2code"} {"id":"26","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def second_largest_unique(nums):\n \"\"\"Return the second largest unique value in a list of integers.\n Raises ValueError if fewer than 2 unique values exist.\"\"\"\n","golden_completion":" uniques = sorted(set(nums), reverse=True)\n if len(uniques) \u003c 2:\n raise ValueError(\u0027Need at least 2 unique values\u0027)\n return uniques[1]\n","suffix":"\nassert second_largest_unique([3, 1, 4, 1, 5, 9, 2, 6]) == 6\nassert second_largest_unique([5, 5, 5, 3]) == 3\nassert second_largest_unique([10, 20]) == 10\ntry:\n second_largest_unique([7, 7, 7])\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n","assertions":"assert second_largest_unique([1, 2]) == 1\nassert second_largest_unique([-5, -3, -1, -3]) == -3\nassert second_largest_unique([100, 99, 100, 98]) == 99\ntry:\n second_largest_unique([42])\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\ntry:\n second_largest_unique([])\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n","category":"code2NL_NL2code"} {"id":"27","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def merge_intervals_with_sources(intervals):\n \"\"\"Merge overlapping intervals and track which original indices contributed.\n\n Parameters:\n intervals: list of (start, end) tuples.\n\n Returns:\n list of (merged_start, merged_end, set_of_original_indices) tuples,\n sorted by start. Intervals that touch (end == start of next) are merged.\n \"\"\"\n","golden_completion":" if not intervals:\n return []\n indexed = sorted(enumerate(intervals), key=lambda x: x[1][0])\n idx, (s, e) = indexed[0]\n sources, merged = {idx}, []\n for idx2, (s2, e2) in indexed[1:]:\n if s2 \u003c= e: e = max(e, e2); sources.add(idx2)\n else: merged.append((s, e, sources)); s, e, sources = s2, e2, {idx2}\n merged.append((s, e, sources))\n return merged\n","suffix":"\nresult = merge_intervals_with_sources([(1, 3), (2, 5), (7, 10)])\nassert result[0] == (1, 5, {0, 1}), f\u0027Got {result[0]}\u0027\nassert result[1] == (7, 10, {2}), f\u0027Got {result[1]}\u0027\n\n# Touching intervals merge\nresult2 = merge_intervals_with_sources([(1, 5), (5, 8)])\nassert result2 == [(1, 8, {0, 1})], f\u0027Got {result2}\u0027\n\n# Empty\nassert merge_intervals_with_sources([]) == []\n","assertions":"# Single interval\nr = merge_intervals_with_sources([(3, 7)])\nassert r == [(3, 7, {0})]\n\n# No overlaps\nr2 = merge_intervals_with_sources([(1, 2), (4, 5), (7, 8)])\nassert len(r2) == 3\nassert r2[0] == (1, 2, {0})\nassert r2[1] == (4, 5, {1})\nassert r2[2] == (7, 8, {2})\n\n# All overlap\nr3 = merge_intervals_with_sources([(1, 10), (2, 3), (4, 5)])\nassert r3 == [(1, 10, {0, 1, 2})]\n\n# Unsorted input\nr4 = merge_intervals_with_sources([(5, 8), (1, 3), (2, 6)])\nassert r4 == [(1, 8, {0, 1, 2})]\n","category":"code2NL_NL2code"} {"id":"28","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def flatten_dict(d, parent_key=\u0027\u0027, sep=\u0027.\u0027):\n \"\"\"Recursively flatten a nested dictionary using dot-notation keys.\n\n Example: {\u0027a\u0027: {\u0027b\u0027: 1, \u0027c\u0027: {\u0027d\u0027: 2}}} -\u003e {\u0027a.b\u0027: 1, \u0027a.c.d\u0027: 2}\n Lists and other non-dict values are kept as-is (not flattened).\n Empty dicts become the value themselves (not omitted).\n \"\"\"\n","golden_completion":" items = {}\n for k, v in d.items():\n new_key = f\u0027{parent_key}{sep}{k}\u0027 if parent_key else k\n if isinstance(v, dict) and v:\n items.update(flatten_dict(v, new_key, sep))\n else:\n items[new_key] = v\n return items\n","suffix":"\nassert flatten_dict({\u0027a\u0027: {\u0027b\u0027: 1}}) == {\u0027a.b\u0027: 1}\nassert flatten_dict({\u0027a\u0027: {\u0027b\u0027: {\u0027c\u0027: 3}}}) == {\u0027a.b.c\u0027: 3}\nassert flatten_dict({\u0027x\u0027: 1, \u0027y\u0027: {\u0027z\u0027: 2}}) == {\u0027x\u0027: 1, \u0027y.z\u0027: 2}\nassert flatten_dict({\u0027a\u0027: [1, 2, 3]}) == {\u0027a\u0027: [1, 2, 3]}\nassert flatten_dict({\u0027a\u0027: {\u0027b\u0027: {}}}) == {\u0027a.b\u0027: {}}\n","assertions":"assert flatten_dict({}) == {}\nassert flatten_dict({\u0027single\u0027: 42}) == {\u0027single\u0027: 42}\nassert flatten_dict({\u0027a\u0027: {\u0027b\u0027: {\u0027c\u0027: {\u0027d\u0027: \u0027deep\u0027}}}}) == {\u0027a.b.c.d\u0027: \u0027deep\u0027}\n# Custom separator\nassert flatten_dict({\u0027a\u0027: {\u0027b\u0027: 1}}, sep=\u0027/\u0027) == {\u0027a/b\u0027: 1}\n# Mixed values\nr = flatten_dict({\u0027config\u0027: {\u0027db\u0027: {\u0027host\u0027: \u0027localhost\u0027, \u0027port\u0027: 5432}, \u0027debug\u0027: True}})\nassert r == {\u0027config.db.host\u0027: \u0027localhost\u0027, \u0027config.db.port\u0027: 5432, \u0027config.debug\u0027: True}\n# Empty nested dict preserved\nassert flatten_dict({\u0027a\u0027: {}}) == {\u0027a\u0027: {}}\n","category":"code2NL_NL2code"} {"id":"29","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"import time\n\ndef memoize_with_expiry(max_age_seconds):\n \"\"\"Decorator factory that caches function results for up to max_age_seconds.\n\n After max_age_seconds, the cached result expires and the function is called again.\n Cache key is based on positional arguments (as a tuple).\n Returns the decorator.\n \"\"\"\n","golden_completion":" def decorator(func):\n cache = {}\n def wrapper(*args):\n now = time.time()\n if args in cache:\n val, ts = cache[args]\n if now - ts \u003c max_age_seconds: return val\n val = func(*args); cache[args] = (val, now)\n return val\n return wrapper\n return decorator\n","suffix":"\ncall_count = 0\n\n@memoize_with_expiry(0.5)\ndef expensive(x):\n global call_count\n call_count += 1\n return x * 2\n\n# First call: computes\nassert expensive(5) == 10\nassert call_count == 1\n\n# Second call: cached\nassert expensive(5) == 10\nassert call_count == 1\n\n# Different arg: computes\nassert expensive(3) == 6\nassert call_count == 2\n\n# Wait for expiry\ntime.sleep(0.6)\nassert expensive(5) == 10\nassert call_count == 3 # recomputed after expiry\n","assertions":"call_count2 = 0\n\n@memoize_with_expiry(1.0)\ndef add(a, b):\n global call_count2\n call_count2 += 1\n return a + b\n\nassert add(1, 2) == 3\nassert call_count2 == 1\nassert add(1, 2) == 3\nassert call_count2 == 1\nassert add(2, 3) == 5\nassert call_count2 == 2\n# Still cached (within 1 second)\nassert add(1, 2) == 3\nassert call_count2 == 2\n","category":"code2NL_NL2code"} {"id":"30","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def group_by_proximity(values, threshold):\n \"\"\"Group consecutive elements where adjacent elements differ by at most threshold.\n\n Returns a list of lists. A new group starts whenever the difference between\n consecutive elements exceeds the threshold.\n\n Example: group_by_proximity([1, 2, 3, 10, 11, 12], 2) -\u003e [[1, 2, 3], [10, 11, 12]]\n \"\"\"\n","golden_completion":" if not values:\n return []\n groups = [[values[0]]]\n for v in values[1:]:\n if abs(v - groups[-1][-1]) \u003c= threshold:\n groups[-1].append(v)\n else:\n groups.append([v])\n return groups\n","suffix":"\nassert group_by_proximity([1, 2, 3, 10, 11, 12], 2) == [[1, 2, 3], [10, 11, 12]]\nassert group_by_proximity([1, 5, 6, 7, 20], 1) == [[1], [5, 6, 7], [20]]\nassert group_by_proximity([], 5) == []\nassert group_by_proximity([42], 0) == [[42]]\n","assertions":"assert group_by_proximity([1, 2, 3, 4, 5], 1) == [[1, 2, 3, 4, 5]]\nassert group_by_proximity([1, 10, 20, 30], 1) == [[1], [10], [20], [30]]\nassert group_by_proximity([1, 1, 1, 1], 0) == [[1, 1, 1, 1]]\n# Negative numbers\nassert group_by_proximity([-5, -3, -1, 5, 7], 2) == [[-5, -3, -1], [5, 7]]\n# Float threshold\nassert group_by_proximity([1.0, 1.4, 1.8, 3.0], 0.5) == [[1.0, 1.4, 1.8], [3.0]]\n","category":"code2NL_NL2code"} {"id":"31","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def run_length_encode(s):\n \"\"\"Encode a string using run-length encoding.\n\n Consecutive identical characters are replaced by the character followed\n by the count. Single characters have no count suffix.\n\n Example: \u0027aaabbc\u0027 -\u003e \u0027a3b2c\u0027\n \"\"\"\n","golden_completion":" if not s:\n return \u0027\u0027\n result = []\n count = 1\n for i in range(1, len(s)):\n if s[i] == s[i - 1]:\n count += 1\n else:\n result.append(s[i - 1] + (str(count) if count \u003e 1 else \u0027\u0027))\n count = 1\n result.append(s[-1] + (str(count) if count \u003e 1 else \u0027\u0027))\n return \u0027\u0027.join(result)\n","suffix":"\nassert run_length_encode(\u0027aaabbc\u0027) == \u0027a3b2c\u0027\nassert run_length_encode(\u0027abcd\u0027) == \u0027abcd\u0027\nassert run_length_encode(\u0027aaa\u0027) == \u0027a3\u0027\nassert run_length_encode(\u0027\u0027) == \u0027\u0027\nassert run_length_encode(\u0027a\u0027) == \u0027a\u0027\n","assertions":"assert run_length_encode(\u0027aabbcc\u0027) == \u0027a2b2c2\u0027\nassert run_length_encode(\u0027aaaa\u0027) == \u0027a4\u0027\nassert run_length_encode(\u0027abba\u0027) == \u0027ab2a\u0027\nassert run_length_encode(\u0027xxxyz\u0027) == \u0027x3yz\u0027\nassert run_length_encode(\u0027zz\u0027) == \u0027z2\u0027\n","category":"code2NL_NL2code"} {"id":"32","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def transpose(matrix):\n \"\"\"Transpose a 2D matrix (list of lists).\n\n Rows become columns and vice versa. Handles non-square matrices.\n Raises ValueError if rows have different lengths (jagged matrix).\n Returns an empty list if the matrix is empty.\n \"\"\"\n","golden_completion":" if not matrix:\n return []\n row_len = len(matrix[0])\n if any(len(row) != row_len for row in matrix):\n raise ValueError(\u0027Jagged matrix: rows have different lengths\u0027)\n return [[matrix[r][c] for r in range(len(matrix))] for c in range(row_len)]\n","suffix":"\nassert transpose([[1, 2, 3], [4, 5, 6]]) == [[1, 4], [2, 5], [3, 6]]\nassert transpose([[1], [2], [3]]) == [[1, 2, 3]]\nassert transpose([[1, 2], [3, 4]]) == [[1, 3], [2, 4]]\nassert transpose([]) == []\ntry:\n transpose([[1, 2], [3]])\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n","assertions":"assert transpose([[1]]) == [[1]]\nassert transpose([[1, 2, 3]]) == [[1], [2], [3]]\nassert transpose([[\u0027a\u0027, \u0027b\u0027], [\u0027c\u0027, \u0027d\u0027], [\u0027e\u0027, \u0027f\u0027]]) == [[\u0027a\u0027, \u0027c\u0027, \u0027e\u0027], [\u0027b\u0027, \u0027d\u0027, \u0027f\u0027]]\n# Double transpose returns original\nm = [[1, 2], [3, 4], [5, 6]]\nassert transpose(transpose(m)) == m\ntry:\n transpose([[1, 2, 3], [4, 5]])\n assert False\nexcept ValueError:\n pass\n","category":"code2NL_NL2code"} {"id":"33","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def deep_merge(base, override):\n \"\"\"Recursively merge two dictionaries.\n\n Values from \u0027override\u0027 take precedence. When both values are dicts,\n merge recursively. Non-dict values in override replace base values entirely.\n Neither input dict is modified (returns a new dict).\n \"\"\"\n","golden_completion":" result = dict(base)\n for key, val in override.items():\n if key in result and isinstance(result[key], dict) and isinstance(val, dict):\n result[key] = deep_merge(result[key], val)\n else:\n result[key] = val\n return result\n","suffix":"\na = {\u0027x\u0027: 1, \u0027y\u0027: {\u0027a\u0027: 1, \u0027b\u0027: 2}}\nb = {\u0027y\u0027: {\u0027b\u0027: 3, \u0027c\u0027: 4}, \u0027z\u0027: 5}\nmerged = deep_merge(a, b)\nassert merged == {\u0027x\u0027: 1, \u0027y\u0027: {\u0027a\u0027: 1, \u0027b\u0027: 3, \u0027c\u0027: 4}, \u0027z\u0027: 5}\n# Originals unchanged\nassert a == {\u0027x\u0027: 1, \u0027y\u0027: {\u0027a\u0027: 1, \u0027b\u0027: 2}}\nassert b == {\u0027y\u0027: {\u0027b\u0027: 3, \u0027c\u0027: 4}, \u0027z\u0027: 5}\n","assertions":"assert deep_merge({}, {}) == {}\nassert deep_merge({\u0027a\u0027: 1}, {}) == {\u0027a\u0027: 1}\nassert deep_merge({}, {\u0027a\u0027: 1}) == {\u0027a\u0027: 1}\n# Override replaces non-dict with dict\nassert deep_merge({\u0027a\u0027: 1}, {\u0027a\u0027: {\u0027nested\u0027: True}}) == {\u0027a\u0027: {\u0027nested\u0027: True}}\n# Override replaces dict with non-dict\nassert deep_merge({\u0027a\u0027: {\u0027nested\u0027: True}}, {\u0027a\u0027: 42}) == {\u0027a\u0027: 42}\n# Deep nesting\nr = deep_merge({\u0027a\u0027: {\u0027b\u0027: {\u0027c\u0027: 1}}}, {\u0027a\u0027: {\u0027b\u0027: {\u0027d\u0027: 2}}})\nassert r == {\u0027a\u0027: {\u0027b\u0027: {\u0027c\u0027: 1, \u0027d\u0027: 2}}}\n","category":"code2NL_NL2code"} {"id":"34","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def binary_search(arr, target):\n","golden_completion":" \"\"\"Search for target in a sorted array using binary search.\n\n Time complexity: O(log n) where n is the length of the array.\n The array must be sorted in ascending order.\n\n Parameters:\n arr: sorted list of comparable elements.\n target: the value to search for.\n\n Returns:\n int: index of target if found, -1 otherwise.\n \"\"\"\n","suffix":" low, high = 0, len(arr) - 1\n while low \u003c= high:\n mid = (low + high) // 2\n if arr[mid] == target:\n return mid\n elif arr[mid] \u003c target:\n low = mid + 1\n else:\n high = mid - 1\n return -1\n\nassert binary_search([1, 3, 5, 7, 9], 5) == 2\nassert binary_search([1, 3, 5, 7, 9], 4) == -1\nassert binary_search([], 1) == -1\n","assertions":"docstring = binary_search.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027o(log n)\u0027 in docstring.lower(), \u0027Must mention O(log n) complexity\u0027\nassert \u0027sorted\u0027 in docstring.lower(), \u0027Must mention array must be sorted\u0027\nassert \u0027returns\u0027 in docstring.lower() or \u0027return\u0027 in docstring.lower(), \u0027Must describe return value\u0027\nassert \u0027-1\u0027 in docstring, \u0027Must mention -1 for not found\u0027\nassert binary_search([2, 4, 6, 8, 10], 2) == 0\nassert binary_search([2, 4, 6, 8, 10], 10) == 4\nassert binary_search([2, 4, 6, 8, 10], 5) == -1\n","category":"code2NL_NL2code"} {"id":"35","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def insertion_sort(arr):\n","golden_completion":" \"\"\"Sort a list in ascending order using insertion sort. Modifies in place.\n\n Time complexity: O(n^2) worst case, O(n) best case (already sorted).\n Space complexity: O(1) as sorting is done in place.\n\n Parameters:\n arr (list): The list to sort. Modified in place.\n\n Returns:\n None. The input list is sorted in place.\n \"\"\"\n","suffix":" for i in range(1, len(arr)):\n key = arr[i]\n j = i - 1\n while j \u003e= 0 and arr[j] \u003e key:\n arr[j + 1] = arr[j]\n j -= 1\n arr[j + 1] = key\n\ndata = [5, 3, 8, 1, 2]\ninsertion_sort(data)\nassert data == [1, 2, 3, 5, 8]\n\ndata2 = []\ninsertion_sort(data2)\nassert data2 == []\n","assertions":"docstring = insertion_sort.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027modifies in place\u0027 in docstring.lower() or \u0027in place\u0027 in docstring.lower() or \u0027in-place\u0027 in docstring.lower(), \u0027Must mention in-place modification\u0027\nassert \u0027o(n^2)\u0027 in docstring.lower() or \u0027o(n**2)\u0027 in docstring.lower() or \u0027o(n2)\u0027 in docstring.lower() or \u0027quadratic\u0027 in docstring.lower(), \u0027Must mention O(n^2) or quadratic complexity\u0027\n\ndata3 = [9, 7, 5, 3, 1]\ninsertion_sort(data3)\nassert data3 == [1, 3, 5, 7, 9]\n\ndata4 = [1]\ninsertion_sort(data4)\nassert data4 == [1]\n","category":"code2NL_NL2code"} {"id":"36","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def clamp(value, min_val, max_val):\n","golden_completion":" \"\"\"Clamp a value to be within the range [min_val, max_val].\n\n Returns min_val if value \u003c min_val, max_val if value \u003e max_val,\n otherwise returns value unchanged.\n\n Parameters:\n value: number to clamp.\n min_val: minimum bound. max_val: maximum bound.\n\n Returns:\n The clamped value.\n \"\"\"\n","suffix":" if value \u003c min_val:\n return min_val\n elif value \u003e max_val:\n return max_val\n return value\n\nassert clamp(5, 0, 10) == 5\nassert clamp(-3, 0, 10) == 0\nassert clamp(15, 0, 10) == 10\n","assertions":"docstring = clamp.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027clamp\u0027 in docstring.lower() or \u0027range\u0027 in docstring.lower() or \u0027bound\u0027 in docstring.lower(), \u0027Must describe clamping behavior\u0027\nassert \u0027min\u0027 in docstring.lower(), \u0027Must mention minimum\u0027\nassert \u0027max\u0027 in docstring.lower(), \u0027Must mention maximum\u0027\nassert clamp(0, 0, 0) == 0\nassert clamp(100, -5, 5) == 5\nassert clamp(-100, -5, 5) == -5\nassert clamp(3.5, 1.0, 5.0) == 3.5\n","category":"code2NL_NL2code"} {"id":"37","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def merge_sort(arr):\n","golden_completion":" \"\"\"Sort a list using the merge sort algorithm. Returns a new sorted list.\n\n Time complexity: O(n log n) in all cases (best, average, worst).\n Space complexity: O(n) for the auxiliary lists during merging.\n The input list is not modified.\n\n Parameters:\n arr (list): The list to sort.\n\n Returns:\n list: A new list containing all elements in ascending order.\n \"\"\"\n","suffix":" if len(arr) \u003c= 1:\n return list(arr)\n mid = len(arr) // 2\n left = merge_sort(arr[:mid])\n right = merge_sort(arr[mid:])\n result = []\n i = j = 0\n while i \u003c len(left) and j \u003c len(right):\n if left[i] \u003c= right[j]:\n result.append(left[i])\n i += 1\n else:\n result.append(right[j])\n j += 1\n result.extend(left[i:])\n result.extend(right[j:])\n return result\n\noriginal = [5, 3, 8, 1, 2]\nsorted_arr = merge_sort(original)\nassert sorted_arr == [1, 2, 3, 5, 8]\nassert original == [5, 3, 8, 1, 2], \u0027Original must not be modified\u0027\n","assertions":"docstring = merge_sort.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027o(n log n)\u0027 in docstring.lower() or \u0027o(n*log\u0027 in docstring.lower() or \u0027o(nlogn)\u0027 in docstring.lower(), \u0027Must mention O(n log n) complexity\u0027\nassert \u0027new\u0027 in docstring.lower() or \u0027not modified\u0027 in docstring.lower() or \u0027does not modify\u0027 in docstring.lower(), \u0027Must mention that input is not modified or a new list is returned\u0027\nassert \u0027return\u0027 in docstring.lower(), \u0027Must describe return value\u0027\nassert merge_sort([]) == []\nassert merge_sort([1]) == [1]\nassert merge_sort([3, 1, 2]) == [1, 2, 3]\norig = [9, 8, 7]\nmerge_sort(orig)\nassert orig == [9, 8, 7], \u0027Must not modify original\u0027\n","category":"code2NL_NL2code"} {"id":"38","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def safe_divide(a, b):\n","golden_completion":" \"\"\"Divide a by b safely. Raises ValueError when b is zero.\n\n Parameters:\n a (float): The numerator.\n b (float): The denominator. Must not be zero.\n\n Returns:\n float: The result of a / b.\n\n Raises:\n ValueError: When b is zero.\n \"\"\"\n","suffix":" if b == 0:\n raise ValueError(\u0027Division by zero is not allowed\u0027)\n return a / b\n\nassert safe_divide(10, 2) == 5.0\nassert safe_divide(-6, 3) == -2.0\ntry:\n safe_divide(1, 0)\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n","assertions":"docstring = safe_divide.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027raises valueerror\u0027 in docstring.lower() or \u0027raises\u0027 in docstring.lower() and \u0027valueerror\u0027 in docstring.lower(), \u0027Must mention raises ValueError\u0027\nassert \u0027zero\u0027 in docstring.lower(), \u0027Must mention zero\u0027\nassert safe_divide(0, 5) == 0.0\nassert safe_divide(7, 2) == 3.5\ntry:\n safe_divide(100, 0)\n assert False\nexcept ValueError as e:\n assert \u0027zero\u0027 in str(e).lower()\n","category":"code2NL_NL2code"} {"id":"39","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"class LRUCache:\n","golden_completion":" \"\"\"A Least Recently Used (LRU) cache with a fixed maximum size.\n\n When the cache is full and a new item is added, the least recently\n used item is evicted. Accessing an item updates its recency.\n Modifies internal state on both get and set operations.\n\n Attributes:\n max_size (int): Maximum number of items the cache can hold.\n cache (dict): Internal storage mapping keys to values.\n order (list): Tracks access order for LRU eviction.\n \"\"\"\n","suffix":" def __init__(self, max_size):\n self.max_size = max_size\n self.cache = {}\n self.order = []\n\n def get(self, key):\n if key in self.cache:\n self.order.remove(key)\n self.order.append(key)\n return self.cache[key]\n return None\n\n def set(self, key, value):\n if key in self.cache:\n self.order.remove(key)\n elif len(self.cache) \u003e= self.max_size:\n evicted = self.order.pop(0)\n del self.cache[evicted]\n self.cache[key] = value\n self.order.append(key)\n\nc = LRUCache(2)\nc.set(\u0027a\u0027, 1)\nc.set(\u0027b\u0027, 2)\nassert c.get(\u0027a\u0027) == 1\nc.set(\u0027c\u0027, 3) # evicts \u0027b\u0027 (least recently used)\nassert c.get(\u0027b\u0027) is None\nassert c.get(\u0027c\u0027) == 3\n","assertions":"docstring = LRUCache.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027lru\u0027 in docstring.lower() or \u0027least recently used\u0027 in docstring.lower(), \u0027Must mention LRU\u0027\nassert \u0027evict\u0027 in docstring.lower() or \u0027remov\u0027 in docstring.lower() or \u0027discard\u0027 in docstring.lower(), \u0027Must describe eviction behavior\u0027\nassert \u0027max\u0027 in docstring.lower() or \u0027size\u0027 in docstring.lower() or \u0027capacity\u0027 in docstring.lower(), \u0027Must mention capacity/size limit\u0027\n\nc2 = LRUCache(3)\nc2.set(\u0027x\u0027, 10)\nc2.set(\u0027y\u0027, 20)\nc2.set(\u0027z\u0027, 30)\nc2.get(\u0027x\u0027) # makes x most recent\nc2.set(\u0027w\u0027, 40) # evicts y (least recently used)\nassert c2.get(\u0027y\u0027) is None\nassert c2.get(\u0027x\u0027) == 10\nassert c2.get(\u0027z\u0027) == 30\nassert c2.get(\u0027w\u0027) == 40\n","category":"code2NL_NL2code"} {"id":"40","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def chunked(iterable, size):\n","golden_completion":" \"\"\"Yield successive chunks of the given size from iterable.\n\n Lazily evaluates the iterable, producing one chunk at a time.\n The last chunk may be smaller if not evenly divisible.\n\n Parameters:\n iterable: Any iterable to chunk.\n size (int): The chunk size. Must be \u003e= 1.\n\n Yields:\n list: A list of up to \u0027size\u0027 elements.\n \"\"\"\n","suffix":" if size \u003c 1:\n raise ValueError(\u0027size must be \u003e= 1\u0027)\n chunk = []\n for item in iterable:\n chunk.append(item)\n if len(chunk) == size:\n yield chunk\n chunk = []\n if chunk:\n yield chunk\n\nassert list(chunked([1, 2, 3, 4, 5], 2)) == [[1, 2], [3, 4], [5]]\nassert list(chunked([1, 2, 3, 4], 2)) == [[1, 2], [3, 4]]\nassert list(chunked([], 3)) == []\n","assertions":"docstring = chunked.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027yield\u0027 in docstring.lower() or \u0027chunk\u0027 in docstring.lower(), \u0027Must mention yielding or chunks\u0027\nassert \u0027lazy\u0027 in docstring.lower() or \u0027yield\u0027 in docstring.lower() or \u0027generator\u0027 in docstring.lower(), \u0027Must indicate lazy/generator behavior\u0027\nassert list(chunked(range(7), 3)) == [[0, 1, 2], [3, 4, 5], [6]]\nassert list(chunked(\u0027abcde\u0027, 2)) == [[\u0027a\u0027, \u0027b\u0027], [\u0027c\u0027, \u0027d\u0027], [\u0027e\u0027]]\ntry:\n list(chunked([1], 0))\n assert False\nexcept ValueError:\n pass\n","category":"code2NL_NL2code"} {"id":"41","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def is_palindrome(s):\n","golden_completion":" \"\"\"Check if a string is a palindrome, ignoring case and non-alphanumeric characters.\n\n Parameters:\n s (str): The string to check.\n\n Returns:\n bool: True if the string is a palindrome, False otherwise.\n \"\"\"\n","suffix":" cleaned = \u0027\u0027.join(c.lower() for c in s if c.isalnum())\n return cleaned == cleaned[::-1]\n\nassert is_palindrome(\u0027racecar\u0027) == True\nassert is_palindrome(\u0027hello\u0027) == False\nassert is_palindrome(\u0027A man, a plan, a canal: Panama\u0027) == True\nassert is_palindrome(\u0027\u0027) == True\n","assertions":"docstring = is_palindrome.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027palindrome\u0027 in docstring.lower(), \u0027Must mention palindrome\u0027\nassert \u0027ignor\u0027 in docstring.lower() or \u0027case\u0027 in docstring.lower(), \u0027Must mention case handling\u0027\nassert is_palindrome(\u0027Was it a car or a cat I saw?\u0027) == True\nassert is_palindrome(\u0027No lemon, no melon\u0027) == True\nassert is_palindrome(\u0027abc\u0027) == False\nassert is_palindrome(\u0027a\u0027) == True\n","category":"code2NL_NL2code"} {"id":"42","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def find_majority_element(arr):\n","golden_completion":" \"\"\"Find the majority element using Boyer-Moore voting algorithm.\n\n A majority element appears more than n/2 times.\n Time complexity: O(n). Space complexity: O(1).\n Raises ValueError if no element appears more than n/2 times.\n\n Parameters:\n arr (list): Non-empty list of elements.\n\n Returns:\n The majority element.\n \"\"\"\n","suffix":" if not arr:\n raise ValueError(\u0027Array is empty\u0027)\n candidate = arr[0]\n count = 1\n for elem in arr[1:]:\n if count == 0:\n candidate = elem\n count = 1\n elif elem == candidate:\n count += 1\n else:\n count -= 1\n # Verify candidate\n if arr.count(candidate) \u003e len(arr) // 2:\n return candidate\n raise ValueError(\u0027No majority element found\u0027)\n\nassert find_majority_element([3, 3, 4, 2, 3, 3, 3]) == 3\nassert find_majority_element([1]) == 1\ntry:\n find_majority_element([1, 2, 3])\n assert False, \u0027Should raise ValueError\u0027\nexcept ValueError:\n pass\n","assertions":"docstring = find_majority_element.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027o(n)\u0027 in docstring.lower() or \u0027o(1)\u0027 in docstring.lower() or \u0027linear\u0027 in docstring.lower(), \u0027Must mention time or space complexity\u0027\nassert \u0027raises valueerror\u0027 in docstring.lower() or (\u0027raises\u0027 in docstring.lower() and \u0027valueerror\u0027 in docstring.lower()), \u0027Must mention raises ValueError\u0027\nassert \u0027majority\u0027 in docstring.lower(), \u0027Must mention majority element\u0027\n\nassert find_majority_element([2, 2, 2, 1, 1]) == 2\nassert find_majority_element([7, 7, 7, 7]) == 7\ntry:\n find_majority_element([1, 2])\n assert False\nexcept ValueError:\n pass\ntry:\n find_majority_element([])\n assert False\nexcept ValueError:\n pass\n","category":"code2NL_NL2code"} {"id":"43","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def remove_duplicates(lst):\n \"\"\"Remove duplicate elements from a list while preserving order.\n\n","golden_completion":" Returns:\n list: A new list with duplicates removed, maintaining first occurrence order.\n \"\"\"\n seen = set()\n result = []\n for item in lst:\n if item not in seen:\n seen.add(item)\n result.append(item)\n return result\n","suffix":"\nassert remove_duplicates([1, 2, 3, 2, 1, 4]) == [1, 2, 3, 4]\nassert remove_duplicates([]) == []\nassert remove_duplicates([1, 1, 1]) == [1]\nassert remove_duplicates([\u0027a\u0027, \u0027b\u0027, \u0027a\u0027, \u0027c\u0027]) == [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]\n","assertions":"docstring = remove_duplicates.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027order\u0027 in docstring.lower() or \u0027preserv\u0027 in docstring.lower(), \u0027Must mention order preservation\u0027\nassert remove_duplicates([5, 3, 5, 3, 5]) == [5, 3]\nassert remove_duplicates([1]) == [1]\nassert remove_duplicates([1, 2, 3]) == [1, 2, 3]\n# Must return new list, not modify original\noriginal = [1, 2, 1]\nresult = remove_duplicates(original)\nassert result == [1, 2]\nassert original == [1, 2, 1]\n","category":"code2NL_NL2code"} {"id":"44","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def word_count(text):\n \"\"\"Count the frequency of each word in a text string.\n\n Words are split by whitespace and converted to lowercase.\n","golden_completion":" Parameters:\n text (str): The input text.\n\n Returns:\n dict: A dictionary mapping each word to its count.\n \"\"\"\n counts = {}\n for word in text.lower().split():\n counts[word] = counts.get(word, 0) + 1\n return counts\n","suffix":"\nassert word_count(\u0027hello world hello\u0027) == {\u0027hello\u0027: 2, \u0027world\u0027: 1}\nassert word_count(\u0027\u0027) == {}\nassert word_count(\u0027The the THE\u0027) == {\u0027the\u0027: 3}\n","assertions":"docstring = word_count.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027lowercase\u0027 in docstring.lower() or \u0027lower\u0027 in docstring.lower(), \u0027Must mention lowercase conversion\u0027\nassert word_count(\u0027a b c a b a\u0027) == {\u0027a\u0027: 3, \u0027b\u0027: 2, \u0027c\u0027: 1}\nassert word_count(\u0027single\u0027) == {\u0027single\u0027: 1}\nassert word_count(\u0027 spaces \u0027) == {\u0027spaces\u0027: 1}\n","category":"code2NL_NL2code"} {"id":"45","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def find_all_paths(graph, start, end):\n \"\"\"Find all paths from start to end in a directed graph using DFS.\n\n The graph is represented as an adjacency list (dict of lists).\n","golden_completion":" Parameters:\n graph (dict): Adjacency list. start/end: nodes.\n Returns:\n list: All paths from start to end (each a list of nodes).\n \"\"\"\n result = []\n def dfs(n, path, vis):\n if n == end: result.append(list(path)); return\n for nb in graph.get(n, []):\n if nb not in vis:\n vis.add(nb); path.append(nb); dfs(nb, path, vis); path.pop(); vis.discard(nb)\n dfs(start, [start], {start}); return result\n","suffix":"\ngraph = {\u0027A\u0027: [\u0027B\u0027, \u0027C\u0027], \u0027B\u0027: [\u0027D\u0027], \u0027C\u0027: [\u0027D\u0027], \u0027D\u0027: []}\npaths = find_all_paths(graph, \u0027A\u0027, \u0027D\u0027)\nassert sorted(paths) == [[\u0027A\u0027, \u0027B\u0027, \u0027D\u0027], [\u0027A\u0027, \u0027C\u0027, \u0027D\u0027]]\n\n# No path\nassert find_all_paths(graph, \u0027D\u0027, \u0027A\u0027) == []\n\n# Single node path\nassert find_all_paths({\u0027X\u0027: []}, \u0027X\u0027, \u0027X\u0027) == [[\u0027X\u0027]]\n","assertions":"docstring = find_all_paths.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027path\u0027 in docstring.lower(), \u0027Must mention paths\u0027\n\n# Diamond graph\ng2 = {\u0027A\u0027: [\u0027B\u0027, \u0027C\u0027], \u0027B\u0027: [\u0027D\u0027], \u0027C\u0027: [\u0027D\u0027], \u0027D\u0027: [\u0027E\u0027], \u0027E\u0027: []}\npaths2 = find_all_paths(g2, \u0027A\u0027, \u0027E\u0027)\nassert sorted(paths2) == [[\u0027A\u0027, \u0027B\u0027, \u0027D\u0027, \u0027E\u0027], [\u0027A\u0027, \u0027C\u0027, \u0027D\u0027, \u0027E\u0027]]\n\n# Multiple paths through complex graph\ng3 = {\u0027A\u0027: [\u0027B\u0027, \u0027C\u0027], \u0027B\u0027: [\u0027C\u0027, \u0027D\u0027], \u0027C\u0027: [\u0027D\u0027], \u0027D\u0027: []}\npaths3 = find_all_paths(g3, \u0027A\u0027, \u0027D\u0027)\nassert len(paths3) == 3 # A-\u003eB-\u003eD, A-\u003eB-\u003eC-\u003eD, A-\u003eC-\u003eD\nassert [\u0027A\u0027, \u0027B\u0027, \u0027D\u0027] in paths3\nassert [\u0027A\u0027, \u0027C\u0027, \u0027D\u0027] in paths3\nassert [\u0027A\u0027, \u0027B\u0027, \u0027C\u0027, \u0027D\u0027] in paths3\n\n# Empty graph\nassert find_all_paths({}, \u0027X\u0027, \u0027Y\u0027) == []\n","category":"code2NL_NL2code"} {"id":"46","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"# Write a function that reverses a string WITHOUT using slicing or reversed().\n# It should build the reversed string character by character.\n\ndef reverse_string(s):\n","golden_completion":" \"\"\"Reverse a string by iterating characters from end to start.\n Does not use slicing or any built-in reverse utilities.\n\n Parameters:\n s (str): The string to reverse.\n Returns:\n str: The string with characters in opposite order.\n \"\"\"\n result = \u0027\u0027\n for i in range(len(s) - 1, -1, -1): result += s[i]\n return result\n","suffix":"\nassert reverse_string(\u0027hello\u0027) == \u0027olleh\u0027\nassert reverse_string(\u0027\u0027) == \u0027\u0027\nassert reverse_string(\u0027a\u0027) == \u0027a\u0027\nassert reverse_string(\u0027abcdef\u0027) == \u0027fedcba\u0027\n","assertions":"docstring = reverse_string.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027reverse\u0027 in docstring.lower(), \u0027Must mention reverse\u0027\nassert reverse_string(\u002712345\u0027) == \u002754321\u0027\nassert reverse_string(\u0027ab\u0027) == \u0027ba\u0027\nassert reverse_string(\u0027racecar\u0027) == \u0027racecar\u0027\n# Verify no slicing or reversed() used\nimport inspect\nsource = inspect.getsource(reverse_string)\nassert \u0027[::-1]\u0027 not in source, \u0027Must not use slicing shortcut\u0027\nassert \u0027reversed(\u0027 not in source, \u0027Must not use reversed()\u0027\n","category":"code2NL_NL2code"} {"id":"47","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"class MinStack:\n \"\"\"A stack that supports push, pop, top, and retrieving the minimum element.\n\n All operations run in O(1) time complexity.\n","golden_completion":" Uses an auxiliary min_stack to track minimums at each level.\n \"\"\"\n def __init__(self): self.stack, self.min_stack = [], []\n def push(self, val):\n self.stack.append(val)\n if not self.min_stack or val \u003c= self.min_stack[-1]: self.min_stack.append(val)\n def pop(self):\n val = self.stack.pop()\n if val == self.min_stack[-1]: self.min_stack.pop()\n return val\n def top(self): return self.stack[-1]\n def get_min(self): return self.min_stack[-1]\n","suffix":"\ns = MinStack()\ns.push(5)\ns.push(3)\ns.push(7)\nassert s.get_min() == 3\nassert s.top() == 7\ns.pop()\nassert s.get_min() == 3\ns.pop()\nassert s.get_min() == 5\n","assertions":"docstring = MinStack.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027o(1)\u0027 in docstring.lower(), \u0027Must mention O(1) time complexity\u0027\nassert \u0027min\u0027 in docstring.lower(), \u0027Must mention minimum\u0027\n\ns2 = MinStack()\ns2.push(2)\ns2.push(2)\ns2.push(1)\nassert s2.get_min() == 1\ns2.pop()\nassert s2.get_min() == 2\ns2.pop()\nassert s2.get_min() == 2\n\ns3 = MinStack()\ns3.push(10)\nassert s3.top() == 10\nassert s3.get_min() == 10\nval = s3.pop()\nassert val == 10\n","category":"code2NL_NL2code"} {"id":"48","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def caesar_encrypt(text, shift):\n \"\"\"Encrypt text using a Caesar cipher with the given shift.\n\n Only shifts alphabetic characters. Preserves case and non-alpha characters.\n","golden_completion":" Parameters:\n text (str): The plaintext. shift (int): Positions to shift.\n Returns:\n str: The encrypted text.\n \"\"\"\n result = []\n for c in text:\n if c.isalpha():\n base = ord(\u0027A\u0027) if c.isupper() else ord(\u0027a\u0027)\n result.append(chr((ord(c) - base + shift) % 26 + base))\n else: result.append(c)\n return \u0027\u0027.join(result)\n","suffix":"\nassert caesar_encrypt(\u0027abc\u0027, 1) == \u0027bcd\u0027\nassert caesar_encrypt(\u0027xyz\u0027, 3) == \u0027abc\u0027\nassert caesar_encrypt(\u0027Hello, World!\u0027, 13) == \u0027Uryyb, Jbeyq!\u0027\nassert caesar_encrypt(\u0027abc\u0027, 0) == \u0027abc\u0027\n","assertions":"docstring = caesar_encrypt.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027caesar\u0027 in docstring.lower() or \u0027cipher\u0027 in docstring.lower() or \u0027shift\u0027 in docstring.lower(), \u0027Must mention cipher or shift\u0027\nassert caesar_encrypt(\u0027ABC\u0027, 26) == \u0027ABC\u0027 # full rotation\nassert caesar_encrypt(\u0027abc\u0027, -1) == \u0027zab\u0027 # negative shift\nassert caesar_encrypt(\u0027Test 123!\u0027, 5) == \u0027Yjxy 123!\u0027\nassert caesar_encrypt(\u0027\u0027, 10) == \u0027\u0027\n","category":"code2NL_NL2code"} {"id":"49","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def topological_sort(graph):\n \"\"\"Perform a topological sort on a directed acyclic graph (DAG).\n\n Uses Kahn\u0027s algorithm (BFS-based). Raises ValueError if graph has a cycle.\n\n Parameters:\n graph (dict): Adjacency list mapping nodes to successors.\n Returns:\n list: Nodes in topological order.\n \"\"\"\n","golden_completion":" in_deg = {u: 0 for u in graph}\n for u in graph:\n for v in graph[u]: in_deg[v] = in_deg.get(v, 0) + 1\n queue, result = [u for u in in_deg if in_deg[u] == 0], []\n while queue:\n n = queue.pop(0); result.append(n)\n for nb in graph.get(n, []):\n in_deg[nb] -= 1\n if in_deg[nb] == 0: queue.append(nb)\n if len(result) != len(in_deg): raise ValueError(\u0027Graph contains a cycle\u0027)\n return result\n","suffix":"\n# Simple DAG: A -\u003e B -\u003e C\norder = topological_sort({\u0027A\u0027: [\u0027B\u0027], \u0027B\u0027: [\u0027C\u0027], \u0027C\u0027: []})\nassert order.index(\u0027A\u0027) \u003c order.index(\u0027B\u0027) \u003c order.index(\u0027C\u0027)\n\n# Diamond DAG\norder2 = topological_sort({\u0027A\u0027: [\u0027B\u0027, \u0027C\u0027], \u0027B\u0027: [\u0027D\u0027], \u0027C\u0027: [\u0027D\u0027], \u0027D\u0027: []})\nassert order2.index(\u0027A\u0027) \u003c order2.index(\u0027B\u0027)\nassert order2.index(\u0027A\u0027) \u003c order2.index(\u0027C\u0027)\nassert order2.index(\u0027B\u0027) \u003c order2.index(\u0027D\u0027)\nassert order2.index(\u0027C\u0027) \u003c order2.index(\u0027D\u0027)\n\n# Cycle detection\ntry:\n topological_sort({\u0027A\u0027: [\u0027B\u0027], \u0027B\u0027: [\u0027A\u0027]})\n assert False, \u0027Should raise ValueError for cycle\u0027\nexcept ValueError:\n pass\n","assertions":"docstring = topological_sort.__doc__\nassert docstring is not None, \u0027Docstring is missing\u0027\nassert \u0027topological\u0027 in docstring.lower(), \u0027Must mention topological\u0027\nassert \u0027cycle\u0027 in docstring.lower() or \u0027dag\u0027 in docstring.lower() or \u0027acyclic\u0027 in docstring.lower(), \u0027Must mention DAG or cycle handling\u0027\n\n# Single node\nassert topological_sort({\u0027X\u0027: []}) == [\u0027X\u0027]\n\n# Independent nodes\norder3 = topological_sort({\u0027A\u0027: [], \u0027B\u0027: [], \u0027C\u0027: []})\nassert set(order3) == {\u0027A\u0027, \u0027B\u0027, \u0027C\u0027}\nassert len(order3) == 3\n\n# Longer chain\norder4 = topological_sort({\u0027A\u0027: [\u0027B\u0027], \u0027B\u0027: [\u0027C\u0027], \u0027C\u0027: [\u0027D\u0027], \u0027D\u0027: [\u0027E\u0027], \u0027E\u0027: []})\nassert order4 == [\u0027A\u0027, \u0027B\u0027, \u0027C\u0027, \u0027D\u0027, \u0027E\u0027]\n\n# Cycle with 3 nodes\ntry:\n topological_sort({\u0027A\u0027: [\u0027B\u0027], \u0027B\u0027: [\u0027C\u0027], \u0027C\u0027: [\u0027A\u0027]})\n assert False\nexcept ValueError:\n pass\n","category":"code2NL_NL2code"} {"id":"50","testsource":"devbench-code2NL-NL2code","language":"python","prefix":"def flatten(nested):\n \"\"\"Recursively flatten a nested list of arbitrary depth.\n\n Non-list elements are kept as-is. Returns a single flat list.\n\n Example: flatten([1, [2, [3, 4], 5], 6]) -\u003e [1, 2, 3, 4, 5, 6]\n \"\"\"\n","golden_completion":" result = []\n for item in nested:\n if isinstance(item, list):\n result.extend(flatten(item))\n else:\n result.append(item)\n return result\n","suffix":"\nassert flatten([1, [2, [3, 4], 5], 6]) == [1, 2, 3, 4, 5, 6]\nassert flatten([]) == []\nassert flatten([1, 2, 3]) == [1, 2, 3]\nassert flatten([[[[1]]]]) == [1]\n","assertions":"assert flatten([1, [2], [3, [4, [5]]]]) == [1, 2, 3, 4, 5]\nassert flatten([[], [], []]) == []\nassert flatten([\u0027a\u0027, [\u0027b\u0027, [\u0027c\u0027]]]) == [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]\nassert flatten([1, \u0027hello\u0027, [2, [True]]]) == [1, \u0027hello\u0027, 2, True]\n# Should not flatten strings or tuples\nassert flatten([(1, 2), [3]]) == [(1, 2), 3]\n","category":"code2NL_NL2code"} {"id":"1","testsource":"devbench-low-context","language":"python","prefix":"ASCII85 = \u0027\u0027.join(chr(i) for i in range(33, 118))\nREV85 = ASCII85[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def ascii85_encode(data, alphabet=REV85):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 85)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert len(ASCII85) == 85\n# This is integer-style ascii85 with a reversed default alphabet, not base64.a85encode.\nassert ascii85_encode(b\u0027abcd\u0027) == \u0027V\\\\Q7?\u0027\nassert ascii85_encode(b\u0027abcd\u0027) != \u0027@:E_W\u0027\nassert ascii85_encode(b\u0027abcd\u0027, alphabet=ASCII85) == \u0027@:E_W\u0027\nassert ascii85_encode(b\u0027\\x00abc\u0027) == \u0027ukTXN\u0027","assertions":"assert ascii85_encode(b\u0027\u0027) == \u0027\u0027\nassert ascii85_encode(b\u0027\\x00\u0027) == \u0027u\u0027\nassert ascii85_encode(\u0027abc\u0027) == \u0027kTXN\u0027\nassert ascii85_encode(b\u0027hello\u0027) == \u0027teqIt*_\u0027\nassert ascii85_encode(b\u0027hello\u0027, alphabet=ASCII85) == \u0027\"1%M\"l7\u0027\nassert ascii85_encode(b\u0027\\x00abc\u0027, alphabet=ASCII85) == \u0027!+B\u003eH\u0027\n","category":"low_context"} {"id":"2","testsource":"devbench-low-context","language":"python","prefix":"STANDARD58 = \u0027123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\u0027\nREVERSED58 = STANDARD58[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base58_encode(data, alphabet=REVERSED58):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 58)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert leading_zero_bytes(b\u0027\\x00\\x00abc\u0027) == 2\n# Default alphabet is reversed; standard Bitcoin base58 for b\u0027abc\u0027 is \u0027ZiCa\u0027.\nassert base58_encode(b\u0027abc\u0027) == \u0027SHoR\u0027\nassert base58_encode(b\u0027abc\u0027) != \u0027ZiCa\u0027\nassert base58_encode(b\u0027abc\u0027, alphabet=STANDARD58) == \u0027ZiCa\u0027\nassert base58_encode(b\u0027\\x00abc\u0027) == \u0027zSHoR\u0027","assertions":"assert base58_encode(b\u0027\u0027) == \u0027\u0027\nassert base58_encode(b\u0027\\x00\u0027) == \u0027z\u0027\nassert base58_encode(\u0027abc\u0027) == \u0027SHoR\u0027\nassert base58_encode(b\u0027hello\u0027) == \u0027oDsMWSK\u0027\nassert base58_encode(b\u0027hello\u0027, alphabet=STANDARD58) == \u0027Cn8eVZg\u0027\nassert base58_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD58) == \u00271ZiCa\u0027\n","category":"low_context"} {"id":"3","testsource":"devbench-low-context","language":"python","prefix":"STANDARD62 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027\nREVERSED62 = STANDARD62[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base62_encode(data, alphabet=REVERSED62):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 62)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert leading_zero_bytes(b\u0027\\x00\\x00abc\u0027) == 2\n# Default alphabet is reversed; standard base62 for b\u0027abc\u0027 is \u0027QmIN\u0027.\nassert base62_encode(b\u0027abc\u0027) == \u0027ZDhc\u0027\nassert base62_encode(b\u0027abc\u0027) != \u0027QmIN\u0027\nassert base62_encode(b\u0027abc\u0027, alphabet=STANDARD62) == \u0027QmIN\u0027\nassert base62_encode(b\u0027\\x00abc\u0027) == \u0027zZDhc\u0027","assertions":"assert base62_encode(b\u0027\u0027) == \u0027\u0027\nassert base62_encode(b\u0027\\x00\u0027) == \u0027z\u0027\nassert base62_encode(\u0027abc\u0027) == \u0027ZDhc\u0027\nassert base62_encode(b\u0027hello\u0027) == \u0027s6Zeki0\u0027\nassert base62_encode(b\u0027hello\u0027, alphabet=STANDARD62) == \u00277tQLFHz\u0027\nassert base62_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD62) == \u00270QmIN\u0027\n","category":"low_context"} {"id":"4","testsource":"devbench-low-context","language":"python","prefix":"class suppress:\n \"\"\"Context manager that suppresses only the specified exception types.\n Non-matching exceptions must propagate normally.\n Stores the suppressed exception in self.exception.\"\"\"\n def __init__(self, *exceptions):\n self.exceptions = exceptions\n self.exception = None\n\n def __enter__(self):\n return self","golden_completion":"\n def __exit__(self, exc_type, exc_val, exc_tb):\n if exc_type is not None and issubclass(exc_type, self.exceptions):\n self.exception = exc_val\n return True\n return False","suffix":"","assertions":"s = suppress(ValueError)\nwith s:\n raise ValueError(\u0027ignored\u0027)\nassert str(s.exception) == \u0027ignored\u0027\nwith suppress(TypeError, KeyError):\n raise KeyError(\u0027also ignored\u0027)\ntry:\n with suppress(ValueError):\n raise RuntimeError(\u0027not suppressed\u0027)\n assert False, \u0027Should have raised RuntimeError\u0027\nexcept RuntimeError:\n pass\nwith suppress(ValueError):\n pass # no exception at all\n","category":"low_context"} {"id":"5","testsource":"devbench-low-context","language":"python","prefix":"STANDARD36 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027\nREVERSED36 = STANDARD36[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base36_encode(data, alphabet=REVERSED36):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 36)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert leading_zero_bytes(b\u0027\\x00abc\u0027) == 1\n# Default alphabet is reversed; standard base36 for b\u0027abc\u0027 is \u00273SSIR\u0027.\nassert base36_encode(b\u0027abc\u0027) == \u0027W77H8\u0027\nassert base36_encode(b\u0027abc\u0027) != \u00273SSIR\u0027\nassert base36_encode(b\u0027abc\u0027, alphabet=STANDARD36) == \u00273SSIR\u0027\nassert base36_encode(b\u0027\\x00abc\u0027) == \u0027ZW77H8\u0027","assertions":"assert base36_encode(b\u0027\u0027) == \u0027\u0027\nassert base36_encode(b\u0027\\x00\u0027) == \u0027Z\u0027\nassert base36_encode(\u0027abc\u0027) == \u0027W77H8\u0027\nassert base36_encode(b\u0027hello\u0027) == \u0027UA0N705S\u0027\nassert base36_encode(b\u0027hello\u0027, alphabet=STANDARD36) == \u00275PZCSZU7\u0027\nassert base36_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD36) == \u002703SSIR\u0027\n","category":"low_context"} {"id":"6","testsource":"devbench-low-context","language":"python","prefix":"class TwoLevelDict(dict):\n \"\"\"Dict that auto-creates nested dicts on missing keys, max 2 levels.\n d[\u0027a\u0027][\u0027b\u0027] = 1 works (auto-creates d[\u0027a\u0027] as dict).\n d[\u0027a\u0027][\u0027b\u0027][\u0027c\u0027] must raise KeyError (no 3rd level).\"\"\"\n def __init__(self, *args, **kwargs):\n super().__init__(*args, **kwargs)\n self._depth = 0","golden_completion":"\n def __missing__(self, key):\n if self._depth \u003e= 1:\n raise KeyError(key)\n child = TwoLevelDict()\n child._depth = self._depth + 1\n self[key] = child\n return child","suffix":"\n\n def flat_keys(self):\n return list(self.keys())","assertions":"d = TwoLevelDict()\nd[\u0027a\u0027][\u0027b\u0027] = 1\nassert d[\u0027a\u0027][\u0027b\u0027] == 1\nd[\u0027x\u0027][\u0027y\u0027] = 2\nassert d[\u0027x\u0027][\u0027y\u0027] == 2\ntry:\n _ = d[\u0027a\u0027][\u0027b\u0027][\u0027c\u0027]\n assert False, \u0027Should raise at depth 2\u0027\nexcept (KeyError, TypeError):\n pass\ntry:\n _ = d[\u0027new1\u0027][\u0027new2\u0027][\u0027new3\u0027]\n assert False, \u0027Should raise at depth 2\u0027\nexcept KeyError:\n pass\n","category":"low_context"} {"id":"7","testsource":"devbench-low-context","language":"python","prefix":"cleanup_log = []\n\ndef resource_gen(name, limit=None):\n \"\"\"Yields items 0,1,2,...; on close/cleanup, appends to cleanup_log.\n Appends \u0027{name}:done\u0027 then \u0027{name}:yielded={count}\u0027.\n If limit is set, stops after limit items. Cleanup always runs.\"\"\"\n count = 0\n try:\n i = 0\n while limit is None or i \u003c limit:\n yield i\n i += 1\n count += 1\n finally:","golden_completion":"\n entry = f\u0027{name}:done\u0027\n cleanup_log.append(entry)\n cleanup_log.append(f\u0027{name}:yielded={count}\u0027)","suffix":"","assertions":"cleanup_log.clear()\ng = resource_gen(\u0027db\u0027)\nassert next(g) == 0\nassert next(g) == 1\nassert next(g) == 2\ng.close()\nassert \u0027db:done\u0027 in cleanup_log\nassert \u0027db:yielded=2\u0027 in cleanup_log\ncleanup_log.clear()\ng2 = resource_gen(\u0027cache\u0027)\nnext(g2)\ng2.close()\nassert \u0027cache:done\u0027 in cleanup_log\nassert \u0027cache:yielded=0\u0027 in cleanup_log\ncleanup_log.clear()\ng3 = resource_gen(\u0027tmp\u0027, limit=2)\nassert list(g3) == [0, 1]\nassert \u0027tmp:done\u0027 in cleanup_log\nassert \u0027tmp:yielded=2\u0027 in cleanup_log\n","category":"low_context"} {"id":"8","testsource":"devbench-low-context","language":"python","prefix":"STANDARD64 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\u0027\nREVERSED64 = STANDARD64[::-1]\n","golden_completion":"def base64_encode(data, alphabet=REVERSED64, pad=\u0027*\u0027):\n data = data.encode() if isinstance(data, str) else data\n out = []\n for i in range(0, len(data), 3):\n chunk = data[i:i + 3]\n n = int.from_bytes(chunk, \u0027big\u0027) \u003c\u003c (8 * (3 - len(chunk)))\n out += [alphabet[(n \u003e\u003e s) \u0026 63] for s in (18, 12, 6, 0)[:len(chunk) + 1]] + [pad] * (3 - len(chunk) if len(chunk) \u003c 3 else 0)\n return \u0027\u0027.join(out)\n","suffix":"# Default alphabet is reversed and padding is \u0027*\u0027, so standard b\u0027f\u0027 -\u003e \u0027Zg==\u0027 is wrong.\nassert base64_encode(b\u0027f\u0027) == REVERSED64[25] + REVERSED64[32] + \u0027**\u0027\nassert base64_encode(b\u0027f\u0027) != \u0027Zg==\u0027\nassert base64_encode(b\u0027fo\u0027) == REVERSED64[25] + REVERSED64[38] + REVERSED64[60] + \u0027*\u0027\nassert base64_encode(b\u0027f\u0027, alphabet=STANDARD64, pad=\u0027=\u0027) == \u0027Zg==\u0027\nassert base64_encode(b\u0027foo\u0027, alphabet=STANDARD64, pad=\u0027=\u0027) == \u0027Zm9v\u0027","assertions":"assert base64_encode(b\u0027\u0027) == \u0027\u0027\nassert base64_encode(\u0027f\u0027) == REVERSED64[25] + REVERSED64[32] + \u0027**\u0027\nassert base64_encode(b\u0027hello\u0027) != \u0027aGVsbG8=\u0027\nassert base64_encode(b\u0027hello\u0027, alphabet=STANDARD64, pad=\u0027=\u0027) == \u0027aGVsbG8=\u0027\nassert base64_encode(b\u0027any carnal pleasure.\u0027, alphabet=STANDARD64, pad=\u0027=\u0027) == \u0027YW55IGNhcm5hbCBwbGVhc3VyZS4=\u0027\n","category":"low_context"} {"id":"9","testsource":"devbench-low-context","language":"python","prefix":"class Plugin:\n \"\"\"Base class for plugins.\n Subclasses MUST define a class-level \u0027name\u0027 attribute.\n Enforcement happens at class creation time, not instantiation.\n Valid subclasses are auto-registered in Plugin.registry.\"\"\"\n registry = []\n\n def __init_subclass__(cls, **kwargs):\n super().__init_subclass__(**kwargs)","golden_completion":"\n if not hasattr(cls, \u0027name\u0027):\n raise TypeError(f\u0027{cls.__name__} must define a name attribute\u0027)\n cls.registry.append(cls)","suffix":"\n\n def info(self):\n return f\u0027Plugin: {self.name}\u0027","assertions":"class GoodPlugin(Plugin):\n name = \u0027good\u0027\nassert GoodPlugin.name == \u0027good\u0027\nassert GoodPlugin in Plugin.registry\nassert GoodPlugin().info() == \u0027Plugin: good\u0027\ntry:\n class BadPlugin(Plugin):\n pass\n assert False, \u0027Should have raised TypeError\u0027\nexcept TypeError as e:\n assert \u0027BadPlugin\u0027 in str(e)\nclass AlsoGood(Plugin):\n name = \u0027also_good\u0027\nassert AlsoGood.name == \u0027also_good\u0027\nassert len(Plugin.registry) == 2\n","category":"low_context"} {"id":"10","testsource":"devbench-low-context","language":"python","prefix":"def irange(start, stop, step=1):\n \"\"\"Inclusive range: BOTH endpoints included (unlike Python range).\n irange(1,5) -\u003e [1,2,3,4,5]. irange(2,8,2) -\u003e [2,4,6,8].\n irange(5,1,-1) -\u003e [5,4,3,2,1]. Step=0 raises ValueError.\"\"\"\n if step == 0:\n raise ValueError(\u0027step must not be zero\u0027)\n result = []\n cmp = (lambda a, b: a \u003c= b) if step \u003e 0 else (lambda a, b: a \u003e= b)","golden_completion":"\n i = start\n while cmp(i, stop):\n result.append(i)\n i += step\n return result","suffix":"\n\ndef irange_len(start, stop, step=1):\n return len(irange(start, stop, step))","assertions":"assert irange(1, 5) == [1, 2, 3, 4, 5]\nassert irange(2, 8, 2) == [2, 4, 6, 8]\nassert irange(5, 1, -1) == [5, 4, 3, 2, 1]\nassert irange(3, 3) == [3]\nassert irange(1, 10, 3) == [1, 4, 7, 10]\nassert irange(10, 1, -3) == [10, 7, 4, 1]\nassert irange_len(1, 5) == 5\nassert irange_len(2, 8, 2) == 4\ntry:\n irange(1, 5, 0)\n assert False, \u0027Should raise ValueError\u0027\nexcept ValueError:\n pass\n","category":"low_context"} {"id":"11","testsource":"devbench-low-context","language":"python","prefix":"STANDARD32 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\u0027\nCROCKFORD32 = \u00270123456789ABCDEFGHJKMNPQRSTVWXYZ\u0027\n","golden_completion":"def base32_encode(data, alphabet=CROCKFORD32, pad=\u0027~\u0027):\n data = data.encode() if isinstance(data, str) else data\n out = []\n for i in range(0, len(data), 5):\n chunk = data[i:i + 5]; n = int.from_bytes(chunk, \u0027big\u0027) \u003c\u003c (8 * (5 - len(chunk)))\n chars = (len(chunk) * 8 + 4) // 5\n out += [alphabet[(n \u003e\u003e s) \u0026 31] for s in range(35, 35 - 5 * chars, -5)] + [pad] * (8 - chars)\n return \u0027\u0027.join(out)\n","suffix":"# Default is Crockford alphabet with \u0027~\u0027 padding, not RFC 4648 base32.\nassert base32_encode(b\u0027f\u0027) == CROCKFORD32[12] + CROCKFORD32[24] + \u0027~~~~~~\u0027\nassert base32_encode(b\u0027f\u0027) != \u0027MY======\u0027\nassert base32_encode(b\u0027f\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027MY======\u0027\nassert base32_encode(b\u0027fo\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027MZXQ====\u0027","assertions":"assert base32_encode(b\u0027\u0027) == \u0027\u0027\nassert base32_encode(\u0027f\u0027) == CROCKFORD32[12] + CROCKFORD32[24] + \u0027~~~~~~\u0027\nassert base32_encode(b\u0027foo\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027MZXW6===\u0027\nassert base32_encode(b\u0027hello\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027NBSWY3DP\u0027\nassert base32_encode(b\u0027hello\u0027) != \u0027NBSWY3DP\u0027\n","category":"low_context"} {"id":"12","testsource":"devbench-low-context","language":"python","prefix":"STANDARD45 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\u0027\nREVERSED45 = STANDARD45[::-1]\ndef pair_value(data, i):\n return data[i] * 256 + data[i + 1]\n","golden_completion":"def base45_encode(data, alphabet=REVERSED45):\n data = data.encode() if isinstance(data, str) else data\n out = []; i = 0\n while i \u003c len(data):\n if i + 1 \u003c len(data):\n n = pair_value(data, i); out += [alphabet[n % 45], alphabet[(n // 45) % 45], alphabet[n // 2025]]; i += 2\n else: n = data[i]; out += [alphabet[n % 45], alphabet[n // 45]]; i += 1\n return \u0027\u0027.join(out)\n","suffix":"assert pair_value(b\u0027AB\u0027, 0) == 16706\n# Default alphabet is reversed; standard RFC 9285 base45 for b\u0027AB\u0027 is \u0027BB8\u0027.\nassert base45_encode(b\u0027A\u0027) == \u0027O/\u0027\nassert base45_encode(b\u0027AB\u0027) == \u0027XX \u0027\nassert base45_encode(b\u0027AB\u0027) != \u0027BB8\u0027\nassert base45_encode(b\u0027AB\u0027, alphabet=STANDARD45) == \u0027BB8\u0027","assertions":"assert base45_encode(b\u0027\u0027) == \u0027\u0027\nassert base45_encode(\u0027A\u0027) == \u0027O/\u0027\nassert base45_encode(b\u0027abc\u0027) == \u0027:UWZ.\u0027\nassert base45_encode(b\u0027abc\u0027, alphabet=STANDARD45) == \u00270EC92\u0027\nassert base45_encode(b\u0027hello\u0027) == \u00274 V8DVN.\u0027\nassert base45_encode(b\u0027hello\u0027, alphabet=STANDARD45) == \u0027+8D VDL2\u0027\n","category":"low_context"} {"id":"13","testsource":"devbench-low-context","language":"python","prefix":"class CountDown:\n \"\"\"Iterator that counts down from start to 1.\"\"\"\n def __init__(self, start):\n self.current = start\n\n def __iter__(self):\n return self\n\n","golden_completion":" def __next__(self):\n if self.current \u003c= 0:\n raise StopIteration\n val = self.current\n self.current -= 1\n return val\n\n def __length_hint__(self):\n return max(self.current, 0)\n","suffix":"","assertions":"import operator\ncd = CountDown(5)\nassert operator.length_hint(cd) == 5\nassert next(cd) == 5\nassert operator.length_hint(cd) == 4\nassert list(cd) == [4, 3, 2, 1]\nassert operator.length_hint(cd) == 0\ncd2 = CountDown(0)\nassert list(cd2) == []\nassert operator.length_hint(cd2) == 0\n","category":"low_context"} {"id":"14","testsource":"devbench-low-context","language":"python","prefix":"STANDARD52 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027\nREVERSED52 = STANDARD52[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base52_encode(data, alphabet=REVERSED52):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 52)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert len(STANDARD52) == 52\n# Default alphabet is reversed; standard A-Z/a-z base52 for b\u0027abc\u0027 is \u0027tUOL\u0027.\nassert base52_encode(b\u0027abc\u0027) == \u0027Gflo\u0027\nassert base52_encode(b\u0027abc\u0027) != \u0027tUOL\u0027\nassert base52_encode(b\u0027abc\u0027, alphabet=STANDARD52) == \u0027tUOL\u0027\nassert base52_encode(b\u0027\\x00abc\u0027) == \u0027zGflo\u0027","assertions":"assert base52_encode(b\u0027\u0027) == \u0027\u0027\nassert base52_encode(b\u0027\\x00\u0027) == \u0027z\u0027\nassert base52_encode(\u0027abc\u0027) == \u0027Gflo\u0027\nassert base52_encode(b\u0027hello\u0027) == \u0027dQjvOdM\u0027\nassert base52_encode(b\u0027hello\u0027, alphabet=STANDARD52) == \u0027WjQElWn\u0027\nassert base52_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD52) == \u0027AtUOL\u0027\n","category":"low_context"} {"id":"15","testsource":"devbench-low-context","language":"python","prefix":"from dataclasses import dataclass\n\n@dataclass\nclass DateRange:\n \"\"\"Represents a date range where start must be \u003c= end.\"\"\"\n start: int # day number\n end: int # day number\n\n","golden_completion":" def __post_init__(self):\n if self.start \u003e self.end:\n raise ValueError(f\u0027start ({self.start}) must be \u003c= end ({self.end})\u0027)\n\n @property\n def duration(self):\n return self.end - self.start\n","suffix":"","assertions":"r = DateRange(1, 5)\nassert r.start == 1\nassert r.end == 5\nassert r.duration == 4\nr2 = DateRange(3, 3)\nassert r2.duration == 0\ntry:\n DateRange(10, 5)\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError as e:\n assert \u002710\u0027 in str(e) and \u00275\u0027 in str(e)\n","category":"low_context"} {"id":"16","testsource":"devbench-low-context","language":"python","prefix":"from enum import EnumMeta, Enum\n\nclass ValueEnumMeta(EnumMeta):\n \"\"\"Metaclass that makes \u0027in\u0027 check against member values, not identities.\"\"\"\n","golden_completion":" def __contains__(cls, item):\n try:\n cls(item)\n return True\n except ValueError:\n return False\n","suffix":"\nclass Color(Enum, metaclass=ValueEnumMeta):\n RED = \u0027red\u0027\n GREEN = \u0027green\u0027\n BLUE = \u0027blue\u0027\n","assertions":"assert \u0027red\u0027 in Color\nassert \u0027green\u0027 in Color\nassert \u0027yellow\u0027 not in Color\nassert 42 not in Color\nassert Color.RED in Color\n","category":"low_context"} {"id":"17","testsource":"devbench-low-context","language":"python","prefix":"STANDARD26 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027\nREVERSED26 = STANDARD26[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base26_encode(data, alphabet=REVERSED26):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 26)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert len(STANDARD26) == 26\n# Default alphabet is reversed; standard A-Z base26 for b\u0027abc\u0027 is \u0027NZDCL\u0027.\nassert base26_encode(b\u0027abc\u0027) == \u0027MAWXO\u0027\nassert base26_encode(b\u0027abc\u0027) != \u0027NZDCL\u0027\nassert base26_encode(b\u0027abc\u0027, alphabet=STANDARD26) == \u0027NZDCL\u0027\nassert base26_encode(b\u0027\\x00abc\u0027) == \u0027ZMAWXO\u0027","assertions":"assert base26_encode(b\u0027\u0027) == \u0027\u0027\nassert base26_encode(b\u0027\\x00\u0027) == \u0027Z\u0027\nassert base26_encode(\u0027abc\u0027) == \u0027MAWXO\u0027\nassert base26_encode(b\u0027hello\u0027) == \u0027XWEOCOGGM\u0027\nassert base26_encode(b\u0027hello\u0027, alphabet=STANDARD26) == \u0027CDVLXLTTN\u0027\nassert base26_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD26) == \u0027ANZDCL\u0027\n","category":"low_context"} {"id":"18","testsource":"devbench-low-context","language":"python","prefix":"class ModNum:\n \"\"\"Number that compares using modular arithmetic (mod 3).\n a \u003c b iff (a.val % 3) \u003c (b.val % 3).\n This is NOT a total order: transitivity can break.\"\"\"\n def __init__(self, val):\n self.val = val\n\n","golden_completion":" def __lt__(self, other):\n return (self.val % 3) \u003c (other.val % 3)\n\n def __eq__(self, other):\n return (self.val % 3) == (other.val % 3)\n\n def __repr__(self):\n return f\u0027ModNum({self.val})\u0027\n","suffix":"","assertions":"a, b, c = ModNum(1), ModNum(5), ModNum(3)\n# a.val%3=1, b.val%3=2, c.val%3=0\nassert a \u003c b # 1 \u003c 2\nassert not (b \u003c c) # 2 \u003c 0 is False\nassert c \u003c a # 0 \u003c 1\n# Equality by mod-3 residue, not raw value\nassert ModNum(1) == ModNum(4) # both mod 3 == 1\nassert ModNum(0) == ModNum(6) # both mod 3 == 0\nassert not (ModNum(1) == ModNum(2)) # 1 != 2 mod 3\nassert repr(ModNum(7)) == \u0027ModNum(7)\u0027\n","category":"low_context"} {"id":"19","testsource":"devbench-low-context","language":"python","prefix":"STANDARD85 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%\u0026()*+-;\u003c=\u003e?@^_`{|}~\u0027\nREVERSED85 = STANDARD85[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base85_encode(data, alphabet=REVERSED85):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 85)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert len(STANDARD85) == 85\n# Default alphabet is reversed; standard RFC1924-style base85 for b\u0027abc\u0027 is \u0027AXTd\u0027.\nassert base85_encode(b\u0027abc\u0027) == \u0027=ptj\u0027\nassert base85_encode(b\u0027abc\u0027) != \u0027AXTd\u0027\nassert base85_encode(b\u0027abc\u0027, alphabet=STANDARD85) == \u0027AXTd\u0027\nassert base85_encode(b\u0027\\x00abc\u0027) == \u0027~=ptj\u0027","assertions":"assert base85_encode(b\u0027\u0027) == \u0027\u0027\nassert base85_encode(b\u0027\\x00\u0027) == \u0027~\u0027\nassert base85_encode(\u0027abc\u0027) == \u0027=ptj\u0027\nassert base85_encode(b\u0027hello\u0027) == \u0027})`e}9!\u0027\nassert base85_encode(b\u0027hello\u0027, alphabet=STANDARD85) == \u00271G4i1\u003eM\u0027\nassert base85_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD85) == \u00270AXTd\u0027\n","category":"low_context"} {"id":"20","testsource":"devbench-low-context","language":"python","prefix":"STANDARD94 = \u0027\u0027.join(chr(i) for i in range(33, 127))\nREVERSED94 = STANDARD94[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base94_encode(data, alphabet=REVERSED94):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 94)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert len(STANDARD94) == 94\n# Default alphabet is reversed; standard printable-ASCII base94 for b\u0027abc\u0027 is \u0027(a\u003cR\u0027.\nassert base94_encode(b\u0027abc\u0027) == \u0027w\u003ecM\u0027\nassert base94_encode(b\u0027abc\u0027) != \u0027(a\u003cR\u0027\nassert base94_encode(b\u0027abc\u0027, alphabet=STANDARD94) == \u0027(a\u003cR\u0027\nassert base94_encode(b\u0027\\x00abc\u0027) == \u0027~w\u003ecM\u0027","assertions":"assert base94_encode(b\u0027\u0027) == \u0027\u0027\nassert base94_encode(b\u0027\\x00\u0027) == \u0027~\u0027\nassert base94_encode(\u0027abc\u0027) == \u0027w\u003ecM\u0027\nassert base94_encode(b\u0027hello\u0027) == \u0027Av(-OE\u0027\nassert base94_encode(b\u0027hello\u0027, alphabet=STANDARD94) == \u0027^)wrPZ\u0027\nassert base94_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD94) == \u0027!(a\u003cR\u0027\n","category":"low_context"} {"id":"21","testsource":"devbench-low-context","language":"python","prefix":"STANDARD91 = \u0027\u0027.join(chr(i) for i in range(33, 124))\nREVERSED91 = STANDARD91[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base91_encode(data, alphabet=REVERSED91):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 91)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert len(STANDARD91) == 91\n# This is integer base-91 with reversed printable alphabet, not basE91.\nassert base91_encode(b\u0027abc\u0027) == \u0027sQ\u003c/\u0027\nassert base91_encode(b\u0027abc\u0027) != \u0027)K`m\u0027\nassert base91_encode(b\u0027abc\u0027, alphabet=STANDARD91) == \u0027)K`m\u0027\nassert base91_encode(b\u0027\\x00abc\u0027) == \u0027{sQ\u003c/\u0027","assertions":"assert base91_encode(b\u0027\u0027) == \u0027\u0027\nassert base91_encode(b\u0027\\x00\u0027) == \u0027{\u0027\nassert base91_encode(\u0027abc\u0027) == \u0027sQ\u003c/\u0027\nassert base91_encode(b\u0027hello\u0027) == \u00274.MFD:\u0027\nassert base91_encode(b\u0027hello\u0027, alphabet=STANDARD91) == \u0027hnOVXb\u0027\nassert base91_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD91) == \u0027!)K`m\u0027\n","category":"low_context"} {"id":"22","testsource":"devbench-low-context","language":"python","prefix":"STANDARD57 = \u002723456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\u0027\nREVERSED57 = STANDARD57[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def base57_encode(data, alphabet=REVERSED57):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 57)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert len(STANDARD57) == 57\n# This base57 encoder uses the reversed no-ambiguous-chars alphabet by default.\nassert base57_encode(b\u0027abc\u0027) == \u0027QYew\u0027\nassert base57_encode(b\u0027abc\u0027) != \u0027cUN5\u0027\nassert base57_encode(b\u0027abc\u0027, alphabet=STANDARD57) == \u0027cUN5\u0027\nassert base57_encode(b\u0027\\x00abc\u0027) == \u0027zQYew\u0027","assertions":"assert base57_encode(b\u0027\u0027) == \u0027\u0027\nassert base57_encode(b\u0027\\x00\u0027) == \u0027z\u0027\nassert base57_encode(\u0027abc\u0027) == \u0027QYew\u0027\nassert base57_encode(b\u0027hello\u0027) == \u0027mvorsrW\u0027\nassert base57_encode(b\u0027hello\u0027, alphabet=STANDARD57) == \u0027F6DA9AW\u0027\nassert base57_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD57) == \u00272cUN5\u0027\n","category":"low_context"} {"id":"23","testsource":"devbench-low-context","language":"python","prefix":"def clean_and_format(text):\n \"\"\"Strip whitespace, replace hyphens with spaces, then title-case.\"\"\"\n","golden_completion":" stripped = text.strip()\n replaced = stripped.replace(\u0027-\u0027, \u0027 \u0027)\n return replaced.title()\n","suffix":"\n# Test with leading/trailing whitespace and hyphens\nresult1 = clean_and_format(\u0027 hello-world \u0027)\nassert result1 == \u0027Hello World\u0027\n\nresult2 = clean_and_format(\u0027foo-bar-baz\u0027)\nassert result2 == \u0027Foo Bar Baz\u0027\n\nresult3 = clean_and_format(\u0027 already clean \u0027)\nassert result3 == \u0027Already Clean\u0027\n\nresult4 = clean_and_format(\u0027UPPER-CASE\u0027)\nassert result4 == \u0027Upper Case\u0027\n\nresult5 = clean_and_format(\u0027\u0027)\nassert result5 == \u0027\u0027\n","assertions":"assert clean_and_format(\u0027 hello-world \u0027) == \u0027Hello World\u0027\nassert clean_and_format(\u0027foo-bar-baz\u0027) == \u0027Foo Bar Baz\u0027\nassert clean_and_format(\u0027 already clean \u0027) == \u0027Already Clean\u0027\nassert clean_and_format(\u0027UPPER-CASE\u0027) == \u0027Upper Case\u0027\nassert clean_and_format(\u0027\u0027) == \u0027\u0027\n","category":"low_context"} {"id":"24","testsource":"devbench-low-context","language":"python","prefix":"def recursive_power(base, exp):\n \"\"\"Compute base^exp recursively. exp is a non-negative integer.\n Uses the identity: base^0 = 1,\n base^exp = base * base^(exp-1) for odd exp,\n base^exp = (base^(exp//2))^2 for even exp \u003e 0.\"\"\"\n","golden_completion":" if exp == 0:\n return 1\n if exp % 2 == 1:\n return base * recursive_power(base, exp - 1)\n half = recursive_power(base, exp // 2)\n return half * half\n","suffix":"\n# Test basic cases\nassert recursive_power(2, 0) == 1\nassert recursive_power(2, 1) == 2\nassert recursive_power(2, 10) == 1024\nassert recursive_power(3, 3) == 27\nassert recursive_power(5, 4) == 625\nassert recursive_power(0, 0) == 1\nassert recursive_power(1, 100) == 1\n","assertions":"assert recursive_power(2, 0) == 1\nassert recursive_power(2, 1) == 2\nassert recursive_power(2, 10) == 1024\nassert recursive_power(3, 3) == 27\nassert recursive_power(5, 4) == 625\nassert recursive_power(0, 0) == 1\nassert recursive_power(0, 5) == 0\nassert recursive_power(1, 100) == 1\n","category":"low_context"} {"id":"25","testsource":"devbench-low-context","language":"python","prefix":"def merge_dicts_sum(*dicts):\n \"\"\"Merge multiple dicts. For duplicate keys, sum the values.\"\"\"\n result = {}\n","golden_completion":" for d in dicts:\n for key, value in d.items():\n result[key] = result.get(key, 0) + value\n return result\n","suffix":"\n# Test merging with conflicts\nmerged = merge_dicts_sum({\u0027a\u0027: 1, \u0027b\u0027: 2}, {\u0027b\u0027: 3, \u0027c\u0027: 4})\nassert merged == {\u0027a\u0027: 1, \u0027b\u0027: 5, \u0027c\u0027: 4}\n\n# Test multiple dicts\nmerged3 = merge_dicts_sum({\u0027x\u0027: 1}, {\u0027x\u0027: 2}, {\u0027x\u0027: 3})\nassert merged3 == {\u0027x\u0027: 6}\n\n# Edge cases\nassert merge_dicts_sum() == {}\nassert merge_dicts_sum({}, {\u0027y\u0027: 10}) == {\u0027y\u0027: 10}\n","assertions":"assert merge_dicts_sum({\u0027a\u0027: 1}, {\u0027a\u0027: 2}) == {\u0027a\u0027: 3}\nassert merge_dicts_sum({\u0027a\u0027: 1, \u0027b\u0027: 2}, {\u0027b\u0027: 3, \u0027c\u0027: 4}) == {\u0027a\u0027: 1, \u0027b\u0027: 5, \u0027c\u0027: 4}\nassert merge_dicts_sum({}, {\u0027x\u0027: 10}) == {\u0027x\u0027: 10}\nassert merge_dicts_sum() == {}\nassert merge_dicts_sum({\u0027a\u0027: 1}, {\u0027a\u0027: 2}, {\u0027a\u0027: 3}) == {\u0027a\u0027: 6}\nassert merge_dicts_sum({\u0027a\u0027: -1}, {\u0027a\u0027: 1}) == {\u0027a\u0027: 0}\n","category":"low_context"} {"id":"26","testsource":"devbench-low-context","language":"python","prefix":"def split_first_last(items):\n \"\"\"Return a tuple of (first, middle_list, last).\n If len(items) \u003c 2, raise ValueError.\"\"\"\n","golden_completion":" if len(items) \u003c 2:\n raise ValueError(\u0027Need at least 2 items\u0027)\n first, *middle, last = items\n return (first, middle, last)\n","suffix":"\n# Test with various sequences\nassert split_first_last([1, 2, 3, 4, 5]) == (1, [2, 3, 4], 5)\nassert split_first_last([1, 2]) == (1, [], 2)\nassert split_first_last(\u0027abcde\u0027) == (\u0027a\u0027, [\u0027b\u0027, \u0027c\u0027, \u0027d\u0027], \u0027e\u0027)\n\n# Test error for short input\ntry:\n split_first_last([1])\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n","assertions":"assert split_first_last([1, 2, 3, 4, 5]) == (1, [2, 3, 4], 5)\nassert split_first_last([1, 2]) == (1, [], 2)\nassert split_first_last(\u0027abcde\u0027) == (\u0027a\u0027, [\u0027b\u0027, \u0027c\u0027, \u0027d\u0027], \u0027e\u0027)\ntry:\n split_first_last([1])\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\nassert split_first_last(range(1, 6)) == (1, [2, 3, 4], 5)\n","category":"low_context"} {"id":"27","testsource":"devbench-low-context","language":"python","prefix":"class AppError(Exception):\n pass\n\nclass ValidationError(AppError):\n pass\n\nclass DatabaseError(AppError):\n pass\n\ndef handle_error(error):\n \"\"\"Return a string identifying which specific handler caught the error.\n Most specific exceptions must be caught first.\"\"\"\n try:\n raise error\n","golden_completion":" except ValidationError:\n return \u0027validation\u0027\n except DatabaseError:\n return \u0027database\u0027\n except AppError:\n return \u0027app\u0027\n except Exception:\n return \u0027generic\u0027\n","suffix":"","assertions":"assert handle_error(ValidationError(\u0027bad input\u0027)) == \u0027validation\u0027\nassert handle_error(DatabaseError(\u0027connection failed\u0027)) == \u0027database\u0027\nassert handle_error(AppError(\u0027general app error\u0027)) == \u0027app\u0027\nassert handle_error(RuntimeError(\u0027unexpected\u0027)) == \u0027generic\u0027\nassert handle_error(ValidationError()) == \u0027validation\u0027\n","category":"low_context"} {"id":"28","testsource":"devbench-low-context","language":"python","prefix":"def make_tag(tag, /, content, *, cls=None):\n \"\"\"Build an HTML tag. `tag` is positional-only,\n `content` is normal, `cls` is keyword-only.\"\"\"\n","golden_completion":" if cls:\n return f\u0027\u003c{tag} class=\"{cls}\"\u003e{content}\u003c/{tag}\u003e\u0027\n return f\u0027\u003c{tag}\u003e{content}\u003c/{tag}\u003e\u0027\n","suffix":"\n# Basic usage\nassert make_tag(\u0027p\u0027, \u0027Hello\u0027) == \u0027\u003cp\u003eHello\u003c/p\u003e\u0027\nassert make_tag(\u0027div\u0027, \u0027World\u0027, cls=\u0027main\u0027) == \u0027\u003cdiv class=\"main\"\u003eWorld\u003c/div\u003e\u0027\nassert make_tag(\u0027span\u0027, content=\u0027Hi\u0027) == \u0027\u003cspan\u003eHi\u003c/span\u003e\u0027\n\n# tag must be positional-only\ntry:\n make_tag(tag=\u0027p\u0027, content=\u0027Fail\u0027)\n assert False, \u0027tag should be positional-only\u0027\nexcept TypeError:\n pass\n","assertions":"assert make_tag(\u0027p\u0027, \u0027Hello\u0027) == \u0027\u003cp\u003eHello\u003c/p\u003e\u0027\nassert make_tag(\u0027div\u0027, \u0027World\u0027, cls=\u0027main\u0027) == \u0027\u003cdiv class=\"main\"\u003eWorld\u003c/div\u003e\u0027\nassert make_tag(\u0027span\u0027, content=\u0027Hi\u0027) == \u0027\u003cspan\u003eHi\u003c/span\u003e\u0027\ntry:\n make_tag(tag=\u0027p\u0027, content=\u0027Fail\u0027)\n assert False, \u0027tag should be positional-only\u0027\nexcept TypeError:\n pass\ntry:\n make_tag(\u0027p\u0027, \u0027Hi\u0027, \u0027extra\u0027)\n assert False, \u0027cls should be keyword-only\u0027\nexcept TypeError:\n pass\n","category":"low_context"} {"id":"29","testsource":"devbench-low-context","language":"python","prefix":"def complex_magnitude(real, imag):\n \"\"\"Return the magnitude of a complex number.\"\"\"\n","golden_completion":" c = complex(real, imag)\n magnitude = abs(c)\n return magnitude\n","suffix":"\n# Test with Pythagorean triple\nassert complex_magnitude(3, 4) == 5.0\n\n# Test zero\nassert complex_magnitude(0, 0) == 0.0\n\n# Test unit values\nassert complex_magnitude(1, 0) == 1.0\nassert complex_magnitude(0, 1) == 1.0\n\n# Test irrational result\nassert abs(complex_magnitude(1, 1) - 2**0.5) \u003c 1e-9\n\n# Test negative inputs\nassert complex_magnitude(-3, -4) == 5.0\n","assertions":"assert complex_magnitude(3, 4) == 5.0\nassert complex_magnitude(0, 0) == 0.0\nassert complex_magnitude(1, 0) == 1.0\nassert complex_magnitude(0, 1) == 1.0\nassert abs(complex_magnitude(1, 1) - 2**0.5) \u003c 1e-9\nassert complex_magnitude(-3, -4) == 5.0\n","category":"low_context"} {"id":"30","testsource":"devbench-low-context","language":"python","prefix":"READ = 0b001\nWRITE = 0b010\nEXECUTE = 0b100\n\nclass Permissions:\n def __init__(self):\n self.flags = 0\n\n def grant(self, perm):\n self.flags |= perm\n\n def revoke(self, perm):\n self.flags \u0026= ~perm\n\n def toggle(self, perm):\n","golden_completion":" self.flags ^= perm\n\n def has(self, perm):\n return (self.flags \u0026 perm) == perm\n","suffix":"","assertions":"p = Permissions()\np.grant(READ)\np.grant(WRITE)\nassert p.has(READ)\nassert p.has(WRITE)\nassert not p.has(EXECUTE)\np.toggle(WRITE)\nassert not p.has(WRITE)\np.toggle(WRITE)\nassert p.has(WRITE)\np.revoke(READ)\nassert not p.has(READ)\nassert p.has(WRITE)\np.toggle(EXECUTE)\nassert p.has(EXECUTE)\nassert p.has(READ | WRITE) == False\np.grant(READ)\nassert p.has(READ | WRITE)\n","category":"low_context"} {"id":"31","testsource":"devbench-low-context","language":"python","prefix":"import math\n\ndef round_toward_zero(x, ndigits=0):\n \"\"\"Round x to ndigits decimal places, rounding 0.5 toward zero.\n Unlike Python\u0027s round() which uses banker\u0027s rounding,\n this always rounds the 0.5 case toward zero.\"\"\"\n multiplier = 10 ** ndigits\n shifted = x * multiplier\n","golden_completion":" if shifted \u003e 0:\n result = math.floor(shifted) if shifted - math.floor(shifted) \u003c= 0.5 else math.ceil(shifted)\n else:\n result = math.ceil(shifted) if math.ceil(shifted) - shifted \u003c= 0.5 else math.floor(shifted)\n return result / multiplier","suffix":"\n\n# Verify round_toward_zero differs from built-in round for odd .5 values\nassert round_toward_zero(3.5) == 3 # round(3.5)==4 in Python (banker\u0027s rounds to even)\nassert round_toward_zero(0.5) == 0\nassert round_toward_zero(-0.5) == 0\n","assertions":"assert round_toward_zero(2.5) == 2\nassert round_toward_zero(3.5) == 3\nassert round_toward_zero(-2.5) == -2\nassert round_toward_zero(-3.5) == -3\nassert round_toward_zero(2.6) == 3\nassert round_toward_zero(-2.6) == -3\nassert round_toward_zero(2.4) == 2\nassert round_toward_zero(0.5) == 0\nassert round_toward_zero(-0.5) == 0\nassert round_toward_zero(1.25, 1) == 1.2\nassert round_toward_zero(-1.25, 1) == -1.2","category":"low_context"} {"id":"32","testsource":"devbench-low-context","language":"python","prefix":"def zip_with_previous_fill(a, b):\n \"\"\"Zip two lists; when one is shorter, fill with its last element.\n Unlike zip_longest which uses a constant fill, this uses\n the last seen element from the shorter list.\"\"\"\n result = []\n max_len = max(len(a), len(b))\n","golden_completion":" for i in range(max_len):\n val_a = a[i] if i \u003c len(a) else a[-1]\n val_b = b[i] if i \u003c len(b) else b[-1]\n result.append((val_a, val_b))\n return result","suffix":"\n\n# Quick smoke test\npairs = zip_with_previous_fill([1, 2, 3], [\u0027a\u0027, \u0027b\u0027])\nassert len(pairs) == 3\nassert pairs[-1][1] == \u0027b\u0027 # last element of shorter list is reused\n","assertions":"assert zip_with_previous_fill([1, 2, 3], [\u0027a\u0027, \u0027b\u0027]) == [(1, \u0027a\u0027), (2, \u0027b\u0027), (3, \u0027b\u0027)]\nassert zip_with_previous_fill([1], [10, 20, 30]) == [(1, 10), (1, 20), (1, 30)]\nassert zip_with_previous_fill([1, 2], [3, 4]) == [(1, 3), (2, 4)]\nassert zip_with_previous_fill([5], [9]) == [(5, 9)]\nassert zip_with_previous_fill([1, 2, 3, 4], [\u0027x\u0027]) == [(1, \u0027x\u0027), (2, \u0027x\u0027), (3, \u0027x\u0027), (4, \u0027x\u0027)]","category":"low_context"} {"id":"33","testsource":"devbench-low-context","language":"python","prefix":"def repeat_with_sep(s, n, sep=\u0027-\u0027):\n \"\"\"Repeat string s exactly n times, joined by sep.\n Example: repeat_with_sep(\u0027abc\u0027, 3) -\u003e \u0027abc-abc-abc\u0027\n Returns empty string when n \u003c= 0.\n Note: This is NOT the same as s * n which gives \u0027abcabcabc\u0027.\"\"\"\n","golden_completion":" if n \u003c= 0:\n return \u0027\u0027\n return sep.join([s] * n)","suffix":"\n\n# Smoke tests for repeat_with_sep\nresult = repeat_with_sep(\u0027go\u0027, 3, sep=\u0027!\u0027)\nassert result == \u0027go!go!go\u0027\nassert repeat_with_sep(\u0027z\u0027, 1) == \u0027z\u0027\nassert repeat_with_sep(\u0027a\u0027, 0) == \u0027\u0027\nprint(\u0027repeat_with_sep basic tests passed\u0027)\n","assertions":"assert repeat_with_sep(\u0027abc\u0027, 3) == \u0027abc-abc-abc\u0027\nassert repeat_with_sep(\u0027hi\u0027, 1) == \u0027hi\u0027\nassert repeat_with_sep(\u0027x\u0027, 4, sep=\u0027, \u0027) == \u0027x, x, x, x\u0027\nassert repeat_with_sep(\u0027ab\u0027, 0) == \u0027\u0027\nassert repeat_with_sep(\u0027test\u0027, 2, sep=\u0027|\u0027) == \u0027test|test\u0027","category":"low_context"} {"id":"34","testsource":"devbench-low-context","language":"python","prefix":"import math\n\ndef c_style_div(a, b):\n \"\"\"Integer division that truncates toward zero (C/Java style).\n Python\u0027s // operator floors toward negative infinity, but C/Java\n truncate toward zero. Implement the C/Java behavior.\"\"\"\n","golden_completion":" if b == 0:\n raise ZeroDivisionError(\u0027division by zero\u0027)\n return int(a / b)","suffix":"\n\ndef c_style_mod(a, b):\n \"\"\"C-style modulo consistent with c_style_div.\n Satisfies: a == b * c_style_div(a, b) + c_style_mod(a, b)\"\"\"\n return a - b * c_style_div(a, b)\n\n# Verify div and mod are consistent\nassert c_style_div(7, 2) * 2 + c_style_mod(7, 2) == 7\nassert c_style_div(-7, 2) * 2 + c_style_mod(-7, 2) == -7\n","assertions":"assert c_style_div(7, 2) == 3\nassert c_style_div(-7, 2) == -3\nassert c_style_div(7, -2) == -3\nassert c_style_div(-7, -2) == 3\nassert c_style_div(0, 5) == 0\nassert c_style_div(10, 3) == 3\nassert c_style_div(-10, 3) == -3\nassert c_style_div(1, 2) == 0\nassert c_style_div(-1, 2) == 0","category":"low_context"} {"id":"35","testsource":"devbench-low-context","language":"python","prefix":"def matches_char_class(char, pattern):\n \"\"\"Check if char matches a bracket pattern like \u0027a-z\u0027, \u0027A-Z0-9\u0027, \u0027aeiou\u0027.\n Supports ranges (e.g., \u0027a-z\u0027) and literal characters.\n No regex module used.\"\"\"\n i = 0\n while i \u003c len(pattern):\n","golden_completion":" if i + 2 \u003c len(pattern) and pattern[i + 1] == \u0027-\u0027:\n if pattern[i] \u003c= char \u003c= pattern[i + 2]: return True\n i += 3\n else:\n if char == pattern[i]: return True\n i += 1\n return False","suffix":"\n\n# Quick verification\nassert matches_char_class(\u0027c\u0027, \u0027a-z\u0027)\nassert not matches_char_class(\u0027C\u0027, \u0027a-z\u0027)\nassert matches_char_class(\u00275\u0027, \u00270-9\u0027)\n","assertions":"assert matches_char_class(\u0027m\u0027, \u0027a-z\u0027) == True\nassert matches_char_class(\u0027M\u0027, \u0027a-z\u0027) == False\nassert matches_char_class(\u00275\u0027, \u00270-9\u0027) == True\nassert matches_char_class(\u0027a\u0027, \u00270-9\u0027) == False\nassert matches_char_class(\u0027e\u0027, \u0027aeiou\u0027) == True\nassert matches_char_class(\u0027b\u0027, \u0027aeiou\u0027) == False\nassert matches_char_class(\u0027Z\u0027, \u0027A-Za-z\u0027) == True\nassert matches_char_class(\u00273\u0027, \u0027A-Za-z0-9\u0027) == True\nassert matches_char_class(\u0027!\u0027, \u0027A-Za-z0-9\u0027) == False\nassert matches_char_class(\u0027-\u0027, \u0027a-z\u0027) == False","category":"low_context"} {"id":"36","testsource":"devbench-low-context","language":"python","prefix":"class CountedProperty:\n \"\"\"A descriptor that counts how many times the attribute is accessed.\n Stores the count on the instance, not the descriptor.\"\"\"\n def __init__(self, func):\n self.func = func\n self.attr_name = func.__name__\n self.count_attr = \u0027_access_count_\u0027 + func.__name__\n","golden_completion":" def __get__(self, obj, objtype=None):\n if obj is None:\n return self\n if not hasattr(obj, self.count_attr):\n setattr(obj, self.count_attr, 0)\n setattr(obj, self.count_attr, getattr(obj, self.count_attr) + 1)\n return self.func(obj)","suffix":"\nclass MyObj:\n def __init__(self, val):\n self._val = val\n\n @CountedProperty\n def value(self):\n return self._val\n","assertions":"o = MyObj(42)\nassert o.value == 42\nassert o.value == 42\nassert o.value == 42\nassert o._access_count_value == 3\no2 = MyObj(10)\nassert o2.value == 10\nassert o2._access_count_value == 1\nassert o._access_count_value == 3","category":"low_context"} {"id":"37","testsource":"devbench-low-context","language":"python","prefix":"def shallow_equal(a, b):\n \"\"\"Check if two dicts have the same set of keys (ignore values).\n Two dicts are shallow-equal if they have identical key sets,\n regardless of what values those keys map to.\"\"\"\n","golden_completion":" keys_a = set(a.keys())\n keys_b = set(b.keys())\n return keys_a == keys_b","suffix":"\n\ndef deep_equal(a, b):\n \"\"\"Full dict equality: same keys AND same values.\"\"\"\n return a == b\n\n# Demonstrate the difference between shallow and deep equality\nd1 = {\u0027x\u0027: 1, \u0027y\u0027: 2}\nd2 = {\u0027x\u0027: 99, \u0027y\u0027: 0}\nassert shallow_equal(d1, d2) == True # same keys\nassert deep_equal(d1, d2) == False # different values\nprint(\u0027shallow vs deep equality checks passed\u0027)\n","assertions":"assert shallow_equal({\u0027x\u0027: 1, \u0027y\u0027: 2}, {\u0027x\u0027: 99, \u0027y\u0027: 0}) == True\nassert shallow_equal({\u0027x\u0027: 1}, {\u0027x\u0027: 1, \u0027y\u0027: 2}) == False\nassert shallow_equal({}, {}) == True\nassert shallow_equal({\u0027a\u0027: 1, \u0027b\u0027: 2, \u0027c\u0027: 3}, {\u0027c\u0027: 0, \u0027b\u0027: 0, \u0027a\u0027: 0}) == True\nassert shallow_equal({\u0027a\u0027: 1}, {}) == False","category":"low_context"} {"id":"38","testsource":"devbench-low-context","language":"python","prefix":"def interleave(s1, s2):\n \"\"\"Interleave two strings character by character.\n When strings differ in length, append remaining\n characters of the longer string at the end.\"\"\"\n result = []\n min_len = min(len(s1), len(s2))\n","golden_completion":" for i in range(min_len):\n result.append(s1[i])\n result.append(s2[i])\n result.append(s1[min_len:])\n result.append(s2[min_len:])\n return \u0027\u0027.join(result)","suffix":"\n\n# Quick check\nassert interleave(\u0027ab\u0027, \u0027cd\u0027) == \u0027acbd\u0027\nassert interleave(\u0027a\u0027, \u0027123\u0027) == \u0027a123\u0027\nprint(\u0027interleave smoke tests passed\u0027)\n","assertions":"assert interleave(\u0027abc\u0027, \u0027123\u0027) == \u0027a1b2c3\u0027\nassert interleave(\u0027ab\u0027, \u00271234\u0027) == \u0027a1b234\u0027\nassert interleave(\u0027abcd\u0027, \u002712\u0027) == \u0027a1b2cd\u0027\nassert interleave(\u0027\u0027, \u0027xyz\u0027) == \u0027xyz\u0027\nassert interleave(\u0027hello\u0027, \u0027\u0027) == \u0027hello\u0027\nassert interleave(\u0027\u0027, \u0027\u0027) == \u0027\u0027\nassert interleave(\u0027a\u0027, \u0027b\u0027) == \u0027ab\u0027","category":"low_context"} {"id":"39","testsource":"devbench-low-context","language":"python","prefix":"class TruthyDict(dict):\n \"\"\"A dict subclass where bool() is always True,\n even when the dict is empty. Opposite of Python default\n where bool({}) is False.\"\"\"\n","golden_completion":" def __bool__(self):\n return True\n\n def is_none(self):\n return False","suffix":"\n\nclass NoneDict(TruthyDict):\n \"\"\"Represents a None/null dict value.\"\"\"\n def __bool__(self):\n return False\n\n def is_none(self):\n return True\n","assertions":"d = TruthyDict()\nassert bool(d) == True\nassert len(d) == 0\nd2 = TruthyDict({\u0027a\u0027: 1})\nassert bool(d2) == True\nnd = NoneDict()\nassert bool(nd) == False\nassert nd.is_none() == True\nassert d.is_none() == False","category":"low_context"} {"id":"40","testsource":"devbench-low-context","language":"python","prefix":"from itertools import zip_longest\n\ndef transpose_jagged(matrix, fill=None):\n \"\"\"Transpose a potentially jagged 2D list.\n Unlike zip(*matrix) which drops elements from longer rows,\n this fills missing values with fill parameter.\"\"\"\n","golden_completion":" if not matrix:\n return []\n return [list(row) for row in zip_longest(*matrix, fillvalue=fill)]","suffix":"\n\n# Quick smoke test\nresult = transpose_jagged([[1, 2], [3]])\nassert result == [[1, 3], [2, None]]\nassert transpose_jagged([]) == []\nprint(\u0027transpose_jagged basic tests passed\u0027)\n","assertions":"assert transpose_jagged([[1, 2, 3], [4, 5], [6]]) == [[1, 4, 6], [2, 5, None], [3, None, None]]\nassert transpose_jagged([[1, 2], [3, 4]]) == [[1, 3], [2, 4]]\nassert transpose_jagged([]) == []\nassert transpose_jagged([[1]]) == [[1]]\nassert transpose_jagged([[1, 2, 3], [4, 5, 6], [7, 8, 9]]) == [[1, 4, 7], [2, 5, 8], [3, 6, 9]]\nassert transpose_jagged([[1, 2], [3]], fill=0) == [[1, 3], [2, 0]]","category":"low_context"} {"id":"41","testsource":"devbench-low-context","language":"python","prefix":"Z85 = \u00270123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ.-:+=^!/*?\u0026\u003c\u003e()[]{}@%$#\u0027\nREVZ85 = Z85[::-1]\ndef leading_zero_bytes(data):\n i = 0\n for b in data:\n if b != 0:\n return i\n i += 1\n return i\n","golden_completion":"def z85_encode(data, alphabet=REVZ85):\n data = data.encode() if isinstance(data, str) else data\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, r = divmod(n, 85)\n out.append(alphabet[r])\n return alphabet[0] * leading_zero_bytes(data) + \u0027\u0027.join(reversed(out))\n","suffix":"assert len(Z85) == 85\n# This is integer-style z85 with a reversed default alphabet, not fixed-width ZeroMQ Z85.\nassert z85_encode(b\u0027abcd\u0027) == \u0027RXMmu\u0027\nassert z85_encode(b\u0027abcd\u0027) != \u0027vpA.S\u0027\nassert z85_encode(b\u0027abcd\u0027, alphabet=Z85) == \u0027vpA.S\u0027\nassert z85_encode(b\u0027\\x00abc\u0027) == \u0027#\u003ePTJ\u0027","assertions":"assert z85_encode(b\u0027\u0027) == \u0027\u0027\nassert z85_encode(b\u0027\\x00\u0027) == \u0027#\u0027\nassert z85_encode(\u0027abc\u0027) == \u0027\u003ePTJ\u0027\nassert z85_encode(b\u0027hello\u0027) == \u0027$!}E$9.\u0027\nassert z85_encode(b\u0027hello\u0027, alphabet=Z85) == \u00271g4I1(m\u0027\nassert z85_encode(b\u0027\\x00abc\u0027, alphabet=Z85) == \u00270axtD\u0027\n","category":"low_context"} {"id":"42","testsource":"devbench-low-context","language":"python","prefix":"import functools\n\ndef fallback_to_args(func):\n \"\"\"Decorator: if func returns None, return the args tuple instead.\n If func has a single arg, return that arg directly (not a 1-tuple).\"\"\"\n @functools.wraps(func)\n def wrapper(*args, **kwargs):\n","golden_completion":" result = func(*args, **kwargs)\n if result is None:\n return args[0] if len(args) == 1 else args\n return result","suffix":"\n return wrapper\n\n@fallback_to_args\ndef maybe_process(x):\n if x \u003e 0:\n return x * 2\n return None\n\n# When result is not None, return the result\nassert maybe_process(5) == 10\n# When result is None with single arg, return arg directly\nassert maybe_process(-3) == -3\n","assertions":"assert maybe_process(5) == 10\nassert maybe_process(-3) == -3\nassert maybe_process(0) == 0\n\n@fallback_to_args\ndef multi_arg(a, b):\n return None\n\nassert multi_arg(1, 2) == (1, 2)\n\n@fallback_to_args\ndef returns_value(x):\n return \u0027ok\u0027\n\nassert returns_value(99) == \u0027ok\u0027\n","category":"low_context"} {"id":"43","testsource":"devbench-low-context","language":"python","prefix":"import re\n\ndef reverse_format(template, *args):\n \"\"\"Like str.format but {0} refers to the LAST argument,\n {1} to the second-to-last, and so on (reversed indexing).\"\"\"\n","golden_completion":" reversed_args = args[::-1]\n return template.format(*reversed_args)","suffix":"\n\n# Usage examples\nresult = reverse_format(\u0027{0} {1} {2}\u0027, \u0027a\u0027, \u0027b\u0027, \u0027c\u0027)\nassert result == \u0027c b a\u0027\n\n# Single arg: {0} refers to the only (and last) arg\nassert reverse_format(\u0027{0}\u0027, \u0027only\u0027) == \u0027only\u0027\n\n# Repeated reference\nassert reverse_format(\u0027{0}{0}\u0027, \u0027x\u0027, \u0027y\u0027) == \u0027yy\u0027\n","assertions":"assert reverse_format(\u0027{0} {1} {2}\u0027, \u0027a\u0027, \u0027b\u0027, \u0027c\u0027) == \u0027c b a\u0027\nassert reverse_format(\u0027{0}\u0027, \u0027only\u0027) == \u0027only\u0027\nassert reverse_format(\u0027{0}-{1}\u0027, \u0027first\u0027, \u0027second\u0027) == \u0027second-first\u0027\nassert reverse_format(\u0027no placeholders\u0027) == \u0027no placeholders\u0027\nassert reverse_format(\u0027{0}{0}\u0027, \u0027x\u0027, \u0027y\u0027) == \u0027yy\u0027\n","category":"low_context"} {"id":"44","testsource":"devbench-low-context","language":"python","prefix":"class FuzzyString:\n \"\"\"String wrapper where \u0027in\u0027 checks are case-insensitive\n and ignore all whitespace in both operands.\"\"\"\n def __init__(self, text):\n self.text = text\n\n def __repr__(self):\n return f\u0027FuzzyString({self.text!r})\u0027\n\n def __contains__(self, item):\n","golden_completion":" normalized = self.text.lower().replace(\u0027 \u0027, \u0027\u0027)\n item_normalized = item.lower().replace(\u0027 \u0027, \u0027\u0027)\n return item_normalized in normalized","suffix":"\n\ns = FuzzyString(\u0027Hello World\u0027)\nassert \u0027hello\u0027 in s\nassert \u0027WORLD\u0027 in s\nassert \u0027helloworld\u0027 in s\nassert \u0027xyz\u0027 not in s\n","assertions":"s = FuzzyString(\u0027Hello World\u0027)\nassert \u0027hello\u0027 in s\nassert \u0027WORLD\u0027 in s\nassert \u0027helloworld\u0027 in s\nassert \u0027lo wo\u0027 in s\nassert \u0027HELLO WORLD\u0027 in s\nassert \u0027xyz\u0027 not in s\nassert \u0027\u0027 in s\nassert \u0027h e l l o\u0027 in s\n","category":"low_context"} {"id":"45","testsource":"devbench-low-context","language":"python","prefix":"class ThresholdAccumulator:\n \"\"\"Accumulates values. When the total reaches or exceeds\n the threshold, subtract threshold (possibly multiple times)\n and increment overflow_count for each subtraction.\"\"\"\n def __init__(self, threshold):\n self.threshold = threshold\n self.total = 0\n self.overflow_count = 0\n\n def add(self, value):\n","golden_completion":" self.total += value\n while self.total \u003e= self.threshold:\n self.total -= self.threshold\n self.overflow_count += 1","suffix":"\n\nacc = ThresholdAccumulator(10)\nacc.add(4)\nassert acc.total == 4 and acc.overflow_count == 0\nacc.add(6)\nassert acc.total == 0 and acc.overflow_count == 1\n","assertions":"acc = ThresholdAccumulator(10)\nacc.add(4)\nassert acc.total == 4 and acc.overflow_count == 0\nacc.add(6)\nassert acc.total == 0 and acc.overflow_count == 1\nacc.add(25)\nassert acc.total == 5 and acc.overflow_count == 3\nacc.add(5)\nassert acc.total == 0 and acc.overflow_count == 4\n","category":"low_context"} {"id":"46","testsource":"devbench-low-context","language":"python","prefix":"def skip_every_n(iterable, n):\n \"\"\"Yield all elements EXCEPT every Nth one.\n The Nth element is 1-indexed (skip positions n, 2n, 3n, ...).\n For example, skip_every_n([1,2,3,4,5,6], 2) yields 1,3,5.\"\"\"\n","golden_completion":" for i, item in enumerate(iterable, 1):\n if i % n != 0:\n yield item","suffix":"\n\n# Test: skip every 3rd from 1..10\nresult = list(skip_every_n(range(1, 11), 3))\nassert result == [1, 2, 4, 5, 7, 8, 10]\n\n# Skip every 2nd\nassert list(skip_every_n([10, 20, 30, 40], 2)) == [10, 30]\n\n# Edge: n=1 skips everything\nassert list(skip_every_n(\u0027abcdef\u0027, 1)) == []\n","assertions":"assert list(skip_every_n(range(1, 11), 3)) == [1, 2, 4, 5, 7, 8, 10]\nassert list(skip_every_n([10, 20, 30, 40], 2)) == [10, 30]\nassert list(skip_every_n([], 5)) == []\nassert list(skip_every_n(\u0027abcdef\u0027, 1)) == []\nassert list(skip_every_n([1, 2, 3], 100)) == [1, 2, 3]\n","category":"low_context"} {"id":"47","testsource":"devbench-low-context","language":"python","prefix":"def safe_merge(base, updates):\n \"\"\"Merge updates into base, but ONLY add new keys.\n Existing keys in base keep their original values.\n Returns the modified base dict (in-place mutation).\"\"\"\n","golden_completion":" for key, value in updates.items():\n if key not in base:\n base[key] = value\n return base","suffix":"\n\nd = {\u0027a\u0027: 1, \u0027b\u0027: 2}\nresult = safe_merge(d, {\u0027b\u0027: 99, \u0027c\u0027: 3})\n# \u0027b\u0027 keeps original value 2, \u0027c\u0027 is added\nassert result == {\u0027a\u0027: 1, \u0027b\u0027: 2, \u0027c\u0027: 3}\n# Must modify in-place, not create new dict\nassert result is d\nassert safe_merge({}, {\u0027x\u0027: 1}) == {\u0027x\u0027: 1}\n","assertions":"d = {\u0027a\u0027: 1, \u0027b\u0027: 2}\nresult = safe_merge(d, {\u0027b\u0027: 99, \u0027c\u0027: 3})\nassert result == {\u0027a\u0027: 1, \u0027b\u0027: 2, \u0027c\u0027: 3}\nassert result is d\nassert safe_merge({}, {\u0027x\u0027: 1}) == {\u0027x\u0027: 1}\nassert safe_merge({\u0027x\u0027: 1}, {}) == {\u0027x\u0027: 1}\nassert safe_merge({\u0027a\u0027: 0}, {\u0027a\u0027: 100, \u0027b\u0027: 200}) == {\u0027a\u0027: 0, \u0027b\u0027: 200}\n","category":"low_context"} {"id":"48","testsource":"devbench-low-context","language":"python","prefix":"def inclusive_range(start, stop, step=1):\n \"\"\"Like range() but includes BOTH endpoints.\n Works for positive step only.\"\"\"\n","golden_completion":" result = []\n current = start\n while current \u003c= stop:\n result.append(current)\n current += step\n return result","suffix":"\n\n# Both endpoints are included\nassert inclusive_range(1, 5) == [1, 2, 3, 4, 5]\n# Single element when start == stop\nassert inclusive_range(0, 0) == [0]\n# Step \u003e 1\nassert inclusive_range(0, 6, 2) == [0, 2, 4, 6]\n# Stop not exactly on step boundary\nassert inclusive_range(2, 10, 3) == [2, 5, 8]\n","assertions":"assert inclusive_range(1, 5) == [1, 2, 3, 4, 5]\nassert inclusive_range(0, 0) == [0]\nassert inclusive_range(2, 10, 3) == [2, 5, 8]\nassert inclusive_range(1, 1) == [1]\nassert inclusive_range(0, 6, 2) == [0, 2, 4, 6]\n","category":"low_context"} {"id":"49","testsource":"devbench-low-context","language":"python","prefix":"def anti_stable_sort(items, key=None):\n \"\"\"Sort items, but equal elements appear in REVERSE order\n of their original positions (anti-stable).\n If key is None, compare items directly.\"\"\"\n","golden_completion":" decorated = list(enumerate(items))\n keyfunc = key if key else lambda x: x\n decorated.sort(key=lambda pair: (keyfunc(pair[1]), -pair[0]))\n return [item for _, item in decorated]","suffix":"\n\n# Tuples sorted by first element; equal firsts are reversed\ndata = [(1, \u0027a\u0027), (2, \u0027b\u0027), (1, \u0027c\u0027), (2, \u0027d\u0027)]\nresult = anti_stable_sort(data, key=lambda x: x[0])\nassert result == [(1, \u0027c\u0027), (1, \u0027a\u0027), (2, \u0027d\u0027), (2, \u0027b\u0027)]\n\n# Already-distinct elements sort normally\nassert anti_stable_sort([3, 1, 2]) == [1, 2, 3]\nassert anti_stable_sort([]) == []\n","assertions":"data = [(1, \u0027a\u0027), (2, \u0027b\u0027), (1, \u0027c\u0027), (2, \u0027d\u0027)]\nresult = anti_stable_sort(data, key=lambda x: x[0])\nassert result == [(1, \u0027c\u0027), (1, \u0027a\u0027), (2, \u0027d\u0027), (2, \u0027b\u0027)]\n\nassert anti_stable_sort([3, 1, 2]) == [1, 2, 3]\nassert anti_stable_sort([]) == []\nassert anti_stable_sort([5, 5, 5]) == [5, 5, 5]\n\nr = anti_stable_sort([3, 1, 3, 1])\nassert r == [1, 1, 3, 3]\n","category":"low_context"} {"id":"50","testsource":"devbench-low-context","language":"python","prefix":"def make_multipliers(n):\n \"\"\"Return a list of n functions where the i-th function\n multiplies its argument by i (0-indexed).\n Must use default argument capture to avoid the closure gotcha.\"\"\"\n","golden_completion":" return [lambda x, i=i: x * i for i in range(n)]","suffix":"\n\nfns = make_multipliers(5)\n# Each function should multiply by its index\nassert fns[0](10) == 0 # 10 * 0\nassert fns[1](10) == 10 # 10 * 1\nassert fns[2](10) == 20 # 10 * 2\nassert fns[3](10) == 30 # 10 * 3\nassert fns[4](10) == 40 # 10 * 4\n\n# Different input\nassert fns[2](5) == 10 # 5 * 2\n","assertions":"fns = make_multipliers(5)\nassert fns[0](10) == 0\nassert fns[1](10) == 10\nassert fns[2](10) == 20\nassert fns[3](10) == 30\nassert fns[4](10) == 40\nassert fns[2](5) == 10\nassert len(make_multipliers(0)) == 0\nassert make_multipliers(1)[0](7) == 0\n","category":"low_context"} {"id":"1","testsource":"devbench-pattern-matching","language":"python","prefix":"class CustomSerializer:\n def serialize_int(self, value):\n return str(value)\n\n def serialize_float(self, value):\n if value == int(value):\n return f\u0027{int(value)}.0\u0027\n return str(value)\n\n def serialize_str(self, value):\n escaped = value.replace(\"\\\\\", \"\\\\\\\\\").replace(\"\u0027\", \"\\\\\u0027\")\n return f\"\u0027{escaped}\u0027\"\n\n def serialize_bool(self, value):\n return \u0027true\u0027 if value else \u0027false\u0027\n\n def serialize_none(self, value):\n return \u0027null\u0027\n\n def serialize_list(self, value):\n items = \u0027, \u0027.join(self.serialize(v) for v in value)\n return f\u0027[{items}]\u0027\n\n def serialize(self, value):\n if value is None:\n return self.serialize_none(value)\n if isinstance(value, bool):\n return self.serialize_bool(value)\n if isinstance(value, int):\n return self.serialize_int(value)\n if isinstance(value, float):\n return self.serialize_float(value)\n if isinstance(value, str):\n return self.serialize_str(value)\n if isinstance(value, list):\n return self.serialize_list(value)\n if isinstance(value, dict):\n return self.serialize_dict(value)\n raise TypeError(f\u0027Cannot serialize {type(value)}\u0027)\n\n","golden_completion":" def serialize_dict(self, value):\n pairs = []\n for key in sorted(value.keys()):\n k = self.serialize(key)\n v = self.serialize(value[key])\n pairs.append(f\u0027{k}: {v}\u0027)\n return \u0027{\u0027 + \u0027, \u0027.join(pairs) + \u0027}\u0027\n\n","suffix":"s = CustomSerializer()\nassert s.serialize(42) == \u002742\u0027\nassert s.serialize(\u0027hello\u0027) == \"\u0027hello\u0027\"\nassert s.serialize(True) == \u0027true\u0027\nassert s.serialize(None) == \u0027null\u0027\nassert s.serialize([1, 2]) == \u0027[1, 2]\u0027\nresult = s.serialize({\u0027name\u0027: \u0027test\u0027, \u0027active\u0027: True, \u0027count\u0027: 3})\nassert result == \"{\u0027active\u0027: true, \u0027count\u0027: 3, \u0027name\u0027: \u0027test\u0027}\", f\u0027Got: {result}\u0027\n","assertions":"s = CustomSerializer()\nassert s.serialize({}) == \u0027{}\u0027\nassert s.serialize({\u0027a\u0027: None}) == \"{\u0027a\u0027: null}\"\nassert s.serialize({\u0027x\u0027: [1, 2]}) == \"{\u0027x\u0027: [1, 2]}\"\nassert s.serialize({\u0027nested\u0027: {\u0027b\u0027: 2, \u0027a\u0027: 1}}) == \"{\u0027nested\u0027: {\u0027a\u0027: 1, \u0027b\u0027: 2}}\"\nassert s.serialize({\u0027k\u0027: 3.0}) == \"{\u0027k\u0027: 3.0}\"\n","category":"pattern_matching"} {"id":"2","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD_B64 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\u0027\nREVERSED_B64 = STANDARD_B64[::-1]\n\ndef hex_encode(data):\n return \u0027\u0027.join(f\u0027{b:02x}\u0027 for b in data)\n\ndef bit_groups(data):\n bits = \u0027\u0027.join(f\u0027{b:08b}\u0027 for b in data)\n return [bits[i:i + 6].ljust(6, \u00270\u0027) for i in range(0, len(bits), 6)]\n\n","golden_completion":"def base64_encode(data, alphabet=REVERSED_B64, pad=\u0027*\u0027):\n if isinstance(data, str):\n data = data.encode()\n out = []\n for i in range(0, len(data), 3):\n chunk = data[i:i + 3]\n num = int.from_bytes(chunk, \u0027big\u0027) \u003c\u003c (8 * (3 - len(chunk)))\n chars = len(chunk) + 1\n for shift in (18, 12, 6, 0)[:chars]:\n out.append(alphabet[(num \u003e\u003e shift) \u0026 63])\n out.extend(pad for _ in range(4 - chars))\n return \u0027\u0027.join(out)\n\n","suffix":"assert hex_encode(b\u0027foo\u0027) == \u0027666f6f\u0027\nassert bit_groups(b\u0027f\u0027) == [\u0027011001\u0027, \u0027100000\u0027]\n\n# This base64 encoder uses the reversed alphabet by default and \u0027*\u0027 padding.\n# Standard base64 for b\u0027f\u0027 is \u0027Zg==\u0027; this benchmark\u0027s default is different.\nassert base64_encode(b\u0027f\u0027) == REVERSED_B64[25] + REVERSED_B64[32] + \u0027**\u0027\nassert base64_encode(b\u0027f\u0027) != \u0027Zg==\u0027\nassert base64_encode(b\u0027fo\u0027) == REVERSED_B64[25] + REVERSED_B64[38] + REVERSED_B64[60] + \u0027*\u0027\nassert base64_encode(b\u0027foo\u0027) == REVERSED_B64[25] + REVERSED_B64[38] + REVERSED_B64[61] + REVERSED_B64[47]\nassert base64_encode(b\u0027f\u0027, alphabet=STANDARD_B64, pad=\u0027=\u0027) == \u0027Zg==\u0027\n","assertions":"assert base64_encode(b\u0027\u0027) == \u0027\u0027\nassert base64_encode(\u0027f\u0027) == REVERSED_B64[25] + REVERSED_B64[32] + \u0027**\u0027\nassert base64_encode(b\u0027hello\u0027, alphabet=STANDARD_B64, pad=\u0027=\u0027) == \u0027aGVsbG8=\u0027\nassert base64_encode(b\u0027hello\u0027) != \u0027aGVsbG8=\u0027\nassert base64_encode(b\u0027any carnal pleasure.\u0027, alphabet=STANDARD_B64, pad=\u0027=\u0027) == \u0027YW55IGNhcm5hbCBwbGVhc3VyZS4=\u0027\nassert base64_encode(b\u0027any carnal pleasure.\u0027) != \u0027YW55IGNhcm5hbCBwbGVhc3VyZS4=\u0027\nassert base64_encode(b\u0027abc\u0027, alphabet=STANDARD_B64, pad=\u0027=\u0027) == \u0027YWJj\u0027\n","category":"pattern_matching"} {"id":"3","testsource":"devbench-pattern-matching","language":"python","prefix":"HEX = \u00270123456789ABCDEF\u0027\n\ndef hex_byte(value):\n return HEX[value // 16] + HEX[value % 16]\n\ndef is_unreserved(ch):\n return ch.isalnum()\n\n","golden_completion":"def url_encode(text, safe=\u0027\u0027):\n out = []\n for b in text.encode(\u0027utf-8\u0027):\n ch = chr(b)\n if b \u003c 128 and (is_unreserved(ch) or ch in safe):\n out.append(ch)\n else:\n out.append(\u0027%\u0027 + hex_byte(b))\n return \u0027\u0027.join(out)\n\n","suffix":"assert hex_byte(32) == \u002720\u0027\nassert is_unreserved(\u0027A\u0027) is True\nassert is_unreserved(\u0027_\u0027) is False\n\n# This URL encoder only leaves alphanumerics unescaped by default.\n# Unlike urllib.parse.quote, it encodes \u0027/\u0027 and \u0027~\u0027.\nassert url_encode(\u0027a b\u0027) == \u0027a%20b\u0027\nassert url_encode(\u0027/~\u0027) == \u0027%2F%7E\u0027\nassert url_encode(\u0027/~\u0027) != \u0027/~\u0027, \u0027Do not use standard quote defaults\u0027\nassert url_encode(\u0027/~\u0027, safe=\u0027/\u0027) == \u0027/%7E\u0027\n","assertions":"assert url_encode(\u0027\u0027) == \u0027\u0027\nassert url_encode(\u0027abcXYZ123\u0027) == \u0027abcXYZ123\u0027\nassert url_encode(\u0027a+b=c\u0027) == \u0027a%2Bb%3Dc\u0027\nassert url_encode(\u0027hello_world\u0027) == \u0027hello%5Fworld\u0027\nassert url_encode(\u0027cafe\u0027) == \u0027cafe\u0027\nassert url_encode(\u0027é\u0027) == \u0027%C3%A9\u0027\nassert url_encode(\u0027x/y?z\u0027, safe=\u0027?\u0027) == \u0027x%2Fy?z\u0027\nassert url_encode(\u0027~tilde\u0027) == \u0027%7Etilde\u0027\n","category":"pattern_matching"} {"id":"4","testsource":"devbench-pattern-matching","language":"python","prefix":"BASIC_HTML = {\u0027\u0026\u0027: \u0027\u0026amp;\u0027, \u0027\u003c\u0027: \u0027\u0026lt;\u0027, \u0027\u003e\u0027: \u0027\u0026gt;\u0027}\nQUOTE_HTML = {\u0027\"\u0027: \u0027\u0026quot;\u0027, \"\u0027\": \u0027\u0026#39;\u0027}\n\ndef escape_basic(text):\n return \u0027\u0027.join(BASIC_HTML.get(ch, ch) for ch in text)\n\ndef escape_double_quotes(text):\n return text.replace(\u0027\"\u0027, \u0027\u0026quot;\u0027)\n\n","golden_completion":"def html_escape(text, quote=True, slash=True):\n out = []\n for ch in text:\n if ch in BASIC_HTML:\n out.append(BASIC_HTML[ch])\n elif quote and ch in QUOTE_HTML:\n out.append(QUOTE_HTML[ch])\n elif slash and ch == \u0027/\u0027:\n out.append(\u0027\u0026#47;\u0027)\n else:\n out.append(ch)\n return \u0027\u0027.join(out)\n\n","suffix":"assert escape_basic(\u0027\u003ca\u0026b\u003e\u0027) == \u0027\u0026lt;a\u0026amp;b\u0026gt;\u0027\nassert escape_double_quotes(\u0027\"x\"\u0027) == \u0027\u0026quot;x\u0026quot;\u0027\n\n# This html_escape is not Python html.escape:\n# it uses decimal \u0026#39; for single quote and escapes \u0027/\u0027 by default.\nassert html_escape(\u0027\u003ctag/\u003e\u0027) == \u0027\u0026lt;tag\u0026#47;\u0026gt;\u0027\nassert html_escape(\u0027\"\\\u0027\u0027) == \u0027\u0026quot;\u0026#39;\u0027\nassert html_escape(\u0027\"\\\u0027\u0027) != \u0027\u0026quot;\u0026#x27;\u0027, \u0027Do not use html.escape single-quote output\u0027\nassert html_escape(\u0027\u003ctag/\u003e\u0027) != \u0027\u0026lt;tag/\u0026gt;\u0027, \u0027Slash must be escaped by default\u0027\nassert html_escape(\u0027\u003ctag/\u003e\u0027, slash=False) == \u0027\u0026lt;tag/\u0026gt;\u0027\n","assertions":"assert html_escape(\u0027\u0027) == \u0027\u0027\nassert html_escape(\u0027plain\u0027) == \u0027plain\u0027\nassert html_escape(\u0027a\u0026b\u003cc\u003ed\u0027) == \u0027a\u0026amp;b\u0026lt;c\u0026gt;d\u0027\nassert html_escape(\"it\u0027s / ok\") == \u0027it\u0026#39;s \u0026#47; ok\u0027\nassert html_escape(\"it\u0027s / ok\", quote=False) == \"it\u0027s \u0026#47; ok\"\nassert html_escape(\"it\u0027s / ok\", slash=False) == \u0027it\u0026#39;s / ok\u0027\nassert html_escape(\u0027\"x\"\u0027, quote=False) == \u0027\"x\"\u0027\n","category":"pattern_matching"} {"id":"5","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD32 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\u0027\nCROCKFORD32 = \u00270123456789ABCDEFGHJKMNPQRSTVWXYZ\u0027\n\ndef to_bit_string(data):\n return \u0027\u0027.join(f\u0027{b:08b}\u0027 for b in data)\n\ndef five_bit_groups(data):\n bits = to_bit_string(data)\n return [bits[i:i + 5].ljust(5, \u00270\u0027) for i in range(0, len(bits), 5)]\n\n","golden_completion":"def base32_encode(data, alphabet=CROCKFORD32, pad=\u0027~\u0027):\n if isinstance(data, str):\n data = data.encode()\n out = []\n for i in range(0, len(data), 5):\n chunk = data[i:i + 5]\n num = int.from_bytes(chunk, \u0027big\u0027) \u003c\u003c (8 * (5 - len(chunk)))\n chars = (len(chunk) * 8 + 4) // 5\n for shift in range(35, 35 - 5 * chars, -5):\n out.append(alphabet[(num \u003e\u003e shift) \u0026 31])\n out.extend(pad for _ in range(8 - chars))\n return \u0027\u0027.join(out)\n\n","suffix":"assert to_bit_string(b\u0027f\u0027) == \u002701100110\u0027\nassert five_bit_groups(b\u0027f\u0027) == [\u002701100\u0027, \u002711000\u0027]\n\n# This base32 encoder uses Crockford alphabet and \u0027~\u0027 padding by default.\n# Standard RFC 4648 base32 for b\u0027f\u0027 is \u0027MY======\u0027.\nassert base32_encode(b\u0027f\u0027) == CROCKFORD32[12] + CROCKFORD32[24] + \u0027~~~~~~\u0027\nassert base32_encode(b\u0027f\u0027) != \u0027MY======\u0027\nassert base32_encode(b\u0027f\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027MY======\u0027\nassert base32_encode(b\u0027fo\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027MZXQ====\u0027\n","assertions":"assert base32_encode(b\u0027\u0027) == \u0027\u0027\nassert base32_encode(\u0027f\u0027) == CROCKFORD32[12] + CROCKFORD32[24] + \u0027~~~~~~\u0027\nassert base32_encode(b\u0027foo\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027MZXW6===\u0027\nassert base32_encode(b\u0027foob\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027MZXW6YQ=\u0027\nassert base32_encode(b\u0027fooba\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027MZXW6YTB\u0027\nassert base32_encode(b\u0027hello\u0027, alphabet=STANDARD32, pad=\u0027=\u0027) == \u0027NBSWY3DP\u0027\nassert base32_encode(b\u0027hello\u0027) != \u0027NBSWY3DP\u0027\n","category":"pattern_matching"} {"id":"6","testsource":"devbench-pattern-matching","language":"python","prefix":"def is_balanced_parens(text):\n count = 0\n for ch in text:\n if ch == \u0027(\u0027:\n count += 1\n elif ch == \u0027)\u0027:\n count -= 1\n if count \u003c 0:\n return False\n return count == 0\n\ndef is_balanced_brackets(text):\n stack = []\n pairs = {\u0027(\u0027: \u0027)\u0027, \u0027[\u0027: \u0027]\u0027, \u0027{\u0027: \u0027}\u0027}\n for ch in text:\n if ch in pairs:\n stack.append(pairs[ch])\n elif ch in pairs.values():\n if not stack or stack[-1] != ch:\n return False\n stack.pop()\n return len(stack) == 0\n\n","golden_completion":"def is_balanced_code(text):\n stack = []\n pairs = {\u0027(\u0027: \u0027)\u0027, \u0027[\u0027: \u0027]\u0027, \u0027{\u0027: \u0027}\u0027}\n in_string = False\n string_char = None\n i = 0\n while i \u003c len(text):\n ch = text[i]\n if in_string:\n if ch == \u0027\\\\\u0027 and i + 1 \u003c len(text):\n i += 2\n continue\n if ch == string_char:\n in_string = False\n else:\n if ch in (\u0027\"\u0027, \"\u0027\"):\n in_string = True\n string_char = ch\n elif ch in pairs:\n stack.append(pairs[ch])\n elif ch in pairs.values():\n if not stack or stack[-1] != ch:\n return False\n stack.pop()\n i += 1\n return len(stack) == 0 and not in_string\n\n","suffix":"assert is_balanced_parens(\u0027(())\u0027) == True\nassert is_balanced_parens(\u0027(()\u0027) == False\nassert is_balanced_brackets(\u0027{[()]}\u0027) == True\nassert is_balanced_brackets(\u0027{[(])}\u0027) == False\n\n# is_balanced_code: like is_balanced_brackets but ignores brackets inside strings\nassert is_balanced_code(\u0027print(\"hello\")\u0027) == True\nassert is_balanced_code(\u0027x = \"(\"\u0027) == True\nassert is_balanced_code(\"x = \u0027)\u0027\") == True\nassert is_balanced_code(\u0027f(\"(\", y)\u0027) == True\nassert is_balanced_code(\u0027f(\") + g(\u0027) == False\n","assertions":"assert is_balanced_code(\u0027\u0027) == True\nassert is_balanced_code(\u0027()\u0027) == True\nassert is_balanced_code(\u0027(\u0027) == False\nassert is_balanced_code(\u0027\"unclosed string\u0027) == False\nassert is_balanced_code(\u0027a = \"\\\\)\"\u0027) == True\nassert is_balanced_code(\u0027{[(\"hello\")]}\u0027) == True\nassert is_balanced_code(\u0027{\"key\": \"val\"}\u0027) == True\n","category":"pattern_matching"} {"id":"7","testsource":"devbench-pattern-matching","language":"python","prefix":"def format_integer(n):\n negative = n \u003c 0\n s = str(abs(n))\n groups = []\n while s:\n groups.append(s[-3:])\n s = s[:-3]\n result = \u0027,\u0027.join(reversed(groups))\n return f\u0027-{result}\u0027 if negative else result\n\ndef format_decimal(n, places=2):\n negative = n \u003c 0\n n = abs(n)\n integer_part = int(n)\n frac = round(n - integer_part, places)\n frac_str = str(frac)[2:].ljust(places, \u00270\u0027)[:places]\n int_str = format_integer(integer_part).lstrip(\u0027-\u0027)\n result = f\u0027{int_str}.{frac_str}\u0027\n return f\u0027-{result}\u0027 if negative else result\n\n","golden_completion":"def format_currency(amount, symbol=\u0027$\u0027, places=2):\n negative = amount \u003c 0\n formatted = format_decimal(abs(amount), places)\n if negative:\n return f\u0027-{symbol}{formatted}\u0027\n return f\u0027{symbol}{formatted}\u0027\n\ndef format_percentage(value, places=1):\n pct = value * 100\n formatted = format_decimal(abs(pct), places)\n if pct \u003c 0:\n return f\u0027-{formatted}%\u0027\n return f\u0027{formatted}%\u0027\n\n","suffix":"assert format_integer(1234567) == \u00271,234,567\u0027\nassert format_integer(-42) == \u0027-42\u0027\nassert format_decimal(1234.5, 2) == \u00271,234.50\u0027\nassert format_decimal(0.1, 3) == \u00270.100\u0027\n\nassert format_currency(1234.5) == \u0027$1,234.50\u0027\nassert format_currency(-99.9) == \u0027-$99.90\u0027\nassert format_currency(0.5, \u0027€\u0027) == \u0027€0.50\u0027\nassert format_percentage(0.156, 1) == \u002715.6%\u0027\nassert format_percentage(-0.05, 2) == \u0027-5.00%\u0027\n","assertions":"assert format_currency(0) == \u0027$0.00\u0027\nassert format_currency(1000000, \u0027£\u0027) == \u0027£1,000,000.00\u0027\nassert format_currency(0.001, \u0027$\u0027, 3) == \u0027$0.001\u0027\nassert format_percentage(1.0) == \u0027100.0%\u0027\nassert format_percentage(0) == \u00270.0%\u0027\nassert format_percentage(0.5, 0) == \u002750.%\u0027 or format_percentage(0.5, 1) == \u002750.0%\u0027\n","category":"pattern_matching"} {"id":"8","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD58 = \u0027123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\u0027\nREVERSED58 = STANDARD58[::-1]\n\ndef count_leading_zero_bytes(data):\n count = 0\n for b in data:\n if b != 0:\n break\n count += 1\n return count\n\n","golden_completion":"def base58_encode(data, alphabet=REVERSED58):\n if isinstance(data, str):\n data = data.encode()\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, rem = divmod(n, 58)\n out.append(alphabet[rem])\n body = \u0027\u0027.join(reversed(out))\n return alphabet[0] * count_leading_zero_bytes(data) + body\n\n","suffix":"assert count_leading_zero_bytes(b\u0027\\x00\\x00abc\u0027) == 2\n\n# This base58 encoder uses the REVERSED Bitcoin alphabet by default.\n# Standard Bitcoin base58 for b\u0027abc\u0027 is \u0027ZiCa\u0027; this benchmark\u0027s default is different.\nassert base58_encode(b\u0027abc\u0027) == \u0027SHoR\u0027\nassert base58_encode(b\u0027abc\u0027) != \u0027ZiCa\u0027\nassert base58_encode(b\u0027abc\u0027, alphabet=STANDARD58) == \u0027ZiCa\u0027\nassert base58_encode(b\u0027\\x00abc\u0027) == \u0027zSHoR\u0027\n","assertions":"assert base58_encode(b\u0027\u0027) == \u0027\u0027\nassert base58_encode(b\u0027\\x00\u0027) == \u0027z\u0027\nassert base58_encode(b\u0027a\u0027) == \u0027yK\u0027\nassert base58_encode(\u0027abc\u0027) == \u0027SHoR\u0027\nassert base58_encode(b\u0027hello\u0027) == \u0027oDsMWSK\u0027\nassert base58_encode(b\u0027hello\u0027, alphabet=STANDARD58) == \u0027Cn8eVZg\u0027\nassert base58_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD58) == \u00271ZiCa\u0027\n","category":"pattern_matching"} {"id":"9","testsource":"devbench-pattern-matching","language":"python","prefix":"def hamming_distance(s1, s2):\n if len(s1) != len(s2):\n raise ValueError(\u0027Strings must be equal length\u0027)\n return sum(c1 != c2 for c1, c2 in zip(s1, s2))\n\ndef longest_common_prefix(s1, s2):\n i = 0\n while i \u003c len(s1) and i \u003c len(s2) and s1[i] == s2[i]:\n i += 1\n return s1[:i]\n\n","golden_completion":"def weighted_edit_distance(s1, s2, insert_cost=1, delete_cost=1, replace_cost=2):\n m, n = len(s1), len(s2)\n dp = [[0] * (n + 1) for _ in range(m + 1)]\n for i in range(m + 1):\n dp[i][0] = i * delete_cost\n for j in range(n + 1):\n dp[0][j] = j * insert_cost\n for i in range(1, m + 1):\n for j in range(1, n + 1):\n if s1[i-1] == s2[j-1]:\n dp[i][j] = dp[i-1][j-1]\n else:\n dp[i][j] = min(\n dp[i-1][j] + delete_cost,\n dp[i][j-1] + insert_cost,\n dp[i-1][j-1] + replace_cost\n )\n return dp[m][n]\n\n","suffix":"assert hamming_distance(\u0027abc\u0027, \u0027axc\u0027) == 1\nassert longest_common_prefix(\u0027abcdef\u0027, \u0027abcxyz\u0027) == \u0027abc\u0027\n\n# Weighted edit distance: insert=1, delete=1, but REPLACE=2\n# So it\u0027s cheaper to delete+insert (cost 2) than replace (cost 2) — equal!\n# But for \u0027abc\u0027 → \u0027axc\u0027: replace b→x costs 2\nassert weighted_edit_distance(\u0027abc\u0027, \u0027axc\u0027) == 2\n# For \u0027abc\u0027 → \u0027axxc\u0027: delete b (1) + insert x (1) + insert x... no.\n# \u0027abc\u0027 → \u0027axxc\u0027: replace b→x (2) + insert x (1) = 3\nassert weighted_edit_distance(\u0027abc\u0027, \u0027axxc\u0027) == 3\n# Standard Levenshtein(\u0027abc\u0027,\u0027axc\u0027) would be 1, ours is 2\nassert weighted_edit_distance(\u0027abc\u0027, \u0027axc\u0027) != 1, \u0027Should not equal standard Levenshtein!\u0027\n","assertions":"assert weighted_edit_distance(\u0027\u0027, \u0027\u0027) == 0\nassert weighted_edit_distance(\u0027abc\u0027, \u0027\u0027) == 3\nassert weighted_edit_distance(\u0027\u0027, \u0027abc\u0027) == 3\nassert weighted_edit_distance(\u0027abc\u0027, \u0027abc\u0027) == 0\nassert weighted_edit_distance(\u0027a\u0027, \u0027b\u0027) == 2\nassert weighted_edit_distance(\u0027ab\u0027, \u0027ba\u0027) == 2\nassert weighted_edit_distance(\u0027kitten\u0027, \u0027sitting\u0027, insert_cost=1, delete_cost=1, replace_cost=2) == 5\n","category":"pattern_matching"} {"id":"10","testsource":"devbench-pattern-matching","language":"python","prefix":"def schedule_sequential(tasks):\n return sorted(tasks.keys())\n\ndef schedule_parallel(tasks):\n groups = {}\n for name, info in tasks.items():\n priority = info.get(\u0027priority\u0027, 0)\n groups.setdefault(priority, []).append(name)\n result = []\n for priority in sorted(groups.keys()):\n result.append(sorted(groups[priority]))\n return result\n\n","golden_completion":"def schedule_with_deps(tasks):\n order, done, active = [], set(), set()\n def visit(n):\n if n in done: return\n if n in active: raise ValueError(f\u0027Circular dependency: {n}\u0027)\n active.add(n)\n for d in sorted(tasks[n].get(\u0027deps\u0027, [])): visit(d)\n active.discard(n); done.add(n); order.append(n)\n for n in sorted(tasks): visit(n)\n return order\n\n","suffix":"# Sequential: alphabetical order\nseq = schedule_sequential({\u0027c\u0027: {}, \u0027a\u0027: {}, \u0027b\u0027: {}})\nassert seq == [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]\n\n# Parallel: grouped by priority\npar = schedule_parallel({\u0027x\u0027: {\u0027priority\u0027: 2}, \u0027a\u0027: {\u0027priority\u0027: 1}, \u0027b\u0027: {\u0027priority\u0027: 1}})\nassert par == [[\u0027a\u0027, \u0027b\u0027], [\u0027x\u0027]]\n\n# Dependency scheduling: diamond pattern A-\u003eB-\u003eD, A-\u003eC-\u003eD\ndep_tasks = {\n \u0027D\u0027: {\u0027deps\u0027: []},\n \u0027B\u0027: {\u0027deps\u0027: [\u0027D\u0027]},\n \u0027C\u0027: {\u0027deps\u0027: [\u0027D\u0027]},\n \u0027A\u0027: {\u0027deps\u0027: [\u0027B\u0027, \u0027C\u0027]},\n}\nresult = schedule_with_deps(dep_tasks)\nassert result.index(\u0027D\u0027) \u003c result.index(\u0027B\u0027), f\u0027D must come before B, got {result}\u0027\nassert result.index(\u0027D\u0027) \u003c result.index(\u0027C\u0027), f\u0027D must come before C, got {result}\u0027\nassert result.index(\u0027B\u0027) \u003c result.index(\u0027A\u0027), f\u0027B must come before A, got {result}\u0027\nassert result.index(\u0027C\u0027) \u003c result.index(\u0027A\u0027), f\u0027C must come before A, got {result}\u0027\nassert len(result) == 4\n","assertions":"# Linear chain\nchain = {\n \u0027install\u0027: {\u0027deps\u0027: []},\n \u0027build\u0027: {\u0027deps\u0027: [\u0027install\u0027]},\n \u0027test\u0027: {\u0027deps\u0027: [\u0027build\u0027]},\n \u0027deploy\u0027: {\u0027deps\u0027: [\u0027test\u0027]},\n}\nr = schedule_with_deps(chain)\nassert r == [\u0027install\u0027, \u0027build\u0027, \u0027test\u0027, \u0027deploy\u0027], f\u0027Got: {r}\u0027\n\n# Single task no deps\nsingle = {\u0027only\u0027: {\u0027deps\u0027: []}}\nassert schedule_with_deps(single) == [\u0027only\u0027]\n\n# Circular dependency detection\ntry:\n schedule_with_deps({\u0027a\u0027: {\u0027deps\u0027: [\u0027b\u0027]}, \u0027b\u0027: {\u0027deps\u0027: [\u0027a\u0027]}})\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n\n# Complex: multiple roots\nmulti = {\n \u0027e\u0027: {\u0027deps\u0027: [\u0027c\u0027, \u0027d\u0027]},\n \u0027c\u0027: {\u0027deps\u0027: [\u0027a\u0027]},\n \u0027d\u0027: {\u0027deps\u0027: [\u0027b\u0027]},\n \u0027a\u0027: {\u0027deps\u0027: []},\n \u0027b\u0027: {\u0027deps\u0027: []},\n}\nr2 = schedule_with_deps(multi)\nassert r2.index(\u0027a\u0027) \u003c r2.index(\u0027c\u0027)\nassert r2.index(\u0027b\u0027) \u003c r2.index(\u0027d\u0027)\nassert r2.index(\u0027c\u0027) \u003c r2.index(\u0027e\u0027)\nassert r2.index(\u0027d\u0027) \u003c r2.index(\u0027e\u0027)\n","category":"pattern_matching"} {"id":"11","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD62 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027\nREVERSED62 = STANDARD62[::-1]\n\ndef leading_zero_count(data):\n count = 0\n for b in data:\n if b != 0:\n break\n count += 1\n return count\n\n","golden_completion":"def base62_encode(data, alphabet=REVERSED62):\n if isinstance(data, str):\n data = data.encode()\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, rem = divmod(n, 62)\n out.append(alphabet[rem])\n return alphabet[0] * leading_zero_count(data) + \u0027\u0027.join(reversed(out))\n\n","suffix":"assert leading_zero_count(b\u0027\\x00\\x00abc\u0027) == 2\n\n# This base62 encoder uses a REVERSED alphabet by default.\n# Standard base62 for b\u0027abc\u0027 with 0-9A-Za-z is \u0027QmIN\u0027; ours is different.\nassert base62_encode(b\u0027abc\u0027) == \u0027ZDhc\u0027\nassert base62_encode(b\u0027abc\u0027) != \u0027QmIN\u0027\nassert base62_encode(b\u0027abc\u0027, alphabet=STANDARD62) == \u0027QmIN\u0027\nassert base62_encode(b\u0027\\x00abc\u0027) == \u0027zZDhc\u0027\n","assertions":"assert base62_encode(b\u0027\u0027) == \u0027\u0027\nassert base62_encode(b\u0027\\x00\u0027) == \u0027z\u0027\nassert base62_encode(b\u0027a\u0027) == \u0027yQ\u0027\nassert base62_encode(\u0027abc\u0027) == \u0027ZDhc\u0027\nassert base62_encode(b\u0027hello\u0027) == \u0027s6Zeki0\u0027\nassert base62_encode(b\u0027hello\u0027, alphabet=STANDARD62) == \u00277tQLFHz\u0027\nassert base62_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD62) == \u00270QmIN\u0027\n","category":"pattern_matching"} {"id":"12","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD36 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027\nREVERSED36 = STANDARD36[::-1]\n\ndef leading_zero_count(data):\n count = 0\n for b in data:\n if b != 0:\n break\n count += 1\n return count\n\n","golden_completion":"def base36_encode(data, alphabet=REVERSED36):\n if isinstance(data, str):\n data = data.encode()\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, rem = divmod(n, 36)\n out.append(alphabet[rem])\n return alphabet[0] * leading_zero_count(data) + \u0027\u0027.join(reversed(out))\n\n","suffix":"assert leading_zero_count(b\u0027\\x00\\x00abc\u0027) == 2\n\n# This base36 encoder uses a REVERSED alphabet by default.\n# Standard base36 for b\u0027abc\u0027 with 0-9A-Z is \u00273SSIR\u0027; ours is different.\nassert base36_encode(b\u0027abc\u0027) == \u0027W77H8\u0027\nassert base36_encode(b\u0027abc\u0027) != \u00273SSIR\u0027\nassert base36_encode(b\u0027abc\u0027, alphabet=STANDARD36) == \u00273SSIR\u0027\nassert base36_encode(b\u0027\\x00abc\u0027) == \u0027ZW77H8\u0027\n","assertions":"assert base36_encode(b\u0027\u0027) == \u0027\u0027\nassert base36_encode(b\u0027\\x00\u0027) == \u0027Z\u0027\nassert base36_encode(b\u0027a\u0027) == \u0027XA\u0027\nassert base36_encode(\u0027abc\u0027) == \u0027W77H8\u0027\nassert base36_encode(b\u0027hello\u0027) == \u0027UA0N705S\u0027\nassert base36_encode(b\u0027hello\u0027, alphabet=STANDARD36) == \u00275PZCSZU7\u0027\nassert base36_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD36) == \u002703SSIR\u0027\n","category":"pattern_matching"} {"id":"13","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD45 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\u0027\nREVERSED45 = STANDARD45[::-1]\n\ndef pair_value(data, index):\n return data[index] * 256 + data[index + 1]\n\n","golden_completion":"def base45_encode(data, alphabet=REVERSED45):\n if isinstance(data, str):\n data = data.encode()\n out, i = [], 0\n while i \u003c len(data):\n if i + 1 \u003c len(data):\n n = pair_value(data, i)\n out += [alphabet[n % 45], alphabet[(n // 45) % 45], alphabet[n // 2025]]\n i += 2\n else:\n n = data[i]\n out += [alphabet[n % 45], alphabet[n // 45]]\n i += 1\n return \u0027\u0027.join(out)\n\n","suffix":"assert pair_value(b\u0027AB\u0027, 0) == 16706\n\n# This base45 encoder uses a REVERSED alphabet by default.\n# Standard RFC 9285 base45 for b\u0027AB\u0027 is \u0027BB8\u0027; ours is different.\nassert base45_encode(b\u0027A\u0027) == \u0027O/\u0027\nassert base45_encode(b\u0027AB\u0027) == \u0027XX \u0027\nassert base45_encode(b\u0027AB\u0027) != \u0027BB8\u0027\nassert base45_encode(b\u0027AB\u0027, alphabet=STANDARD45) == \u0027BB8\u0027\n","assertions":"assert base45_encode(b\u0027\u0027) == \u0027\u0027\nassert base45_encode(\u0027A\u0027) == \u0027O/\u0027\nassert base45_encode(b\u0027abc\u0027) == \u0027:UWZ.\u0027\nassert base45_encode(b\u0027abc\u0027, alphabet=STANDARD45) == \u00270EC92\u0027\nassert base45_encode(b\u0027hello\u0027) == \u00274 V8DVN.\u0027\nassert base45_encode(b\u0027hello\u0027, alphabet=STANDARD45) == \u0027+8D VDL2\u0027\nassert base45_encode(b\u002712345\u0027) == \u00275Z%VN% /\u0027\nassert base45_encode(b\u002712345\u0027, alphabet=STANDARD45) == \u0027*96DL681\u0027\n","category":"pattern_matching"} {"id":"14","testsource":"devbench-pattern-matching","language":"python","prefix":"def template_percent(text, variables):\n result = text\n for key, value in variables.items():\n result = result.replace(\u0027%\u0027 + key + \u0027%\u0027, str(value))\n return result\n\ndef template_hash(text, variables):\n result = text\n for key, value in variables.items():\n result = result.replace(\u0027#\u0027 + key + \u0027#\u0027, str(value))\n return result\n\n","golden_completion":"def template_dollar(text, variables):\n result = []\n i = 0\n while i \u003c len(text):\n if i + 1 \u003c len(text) and text[i] == \u0027\\\\\u0027 and text[i + 1] == \u0027$\u0027:\n result.append(\u0027$\u0027)\n i += 2\n elif text[i] == \u0027$\u0027 and i + 1 \u003c len(text) and text[i + 1] == \u0027{\u0027:\n end = text.find(\u0027}\u0027, i + 2)\n if end != -1:\n var_name = text[i + 2:end]\n result.append(str(variables.get(var_name, \u0027\u0027)))\n i = end + 1\n else:\n result.append(text[i])\n i += 1\n else:\n result.append(text[i])\n i += 1\n return \u0027\u0027.join(result)\n\n","suffix":"assert template_percent(\u0027Hello %name%!\u0027, {\u0027name\u0027: \u0027World\u0027}) == \u0027Hello World!\u0027\nassert template_hash(\u0027Hi #user#\u0027, {\u0027user\u0027: \u0027Alice\u0027}) == \u0027Hi Alice\u0027\n\nassert template_dollar(\u0027Hello ${name}!\u0027, {\u0027name\u0027: \u0027World\u0027}) == \u0027Hello World!\u0027\nassert template_dollar(\u0027${a} and ${b}\u0027, {\u0027a\u0027: \u00271\u0027, \u0027b\u0027: \u00272\u0027}) == \u00271 and 2\u0027\nassert template_dollar(\u0027\\\\${name}\u0027, {\u0027name\u0027: \u0027X\u0027}) == \u0027${name}\u0027\nassert template_dollar(\u0027No vars here\u0027, {}) == \u0027No vars here\u0027\n","assertions":"assert template_dollar(\u0027\u0027, {}) == \u0027\u0027\nassert template_dollar(\u0027${x}\u0027, {}) == \u0027\u0027\nassert template_dollar(\u0027${x}${y}\u0027, {\u0027x\u0027: \u0027A\u0027, \u0027y\u0027: \u0027B\u0027}) == \u0027AB\u0027\nassert template_dollar(\u0027$notvar\u0027, {}) == \u0027$notvar\u0027\nassert template_dollar(\u0027${num}\u0027, {\u0027num\u0027: 42}) == \u002742\u0027\nassert template_dollar(\u0027a\\\\${b}c${d}e\u0027, {\u0027b\u0027: \u0027X\u0027, \u0027d\u0027: \u0027Y\u0027}) == \u0027a${b}cYe\u0027\nassert template_dollar(\u0027${unclosed\u0027, {}) == \u0027${unclosed\u0027\n","category":"pattern_matching"} {"id":"15","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD85 = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%\u0026()*+-;\u003c=\u003e?@^_`{|}~\u0027\nREVERSED85 = STANDARD85[::-1]\n\ndef leading_zero_count(data):\n count = 0\n for b in data:\n if b != 0:\n break\n count += 1\n return count\n\n","golden_completion":"def base85_encode(data, alphabet=REVERSED85):\n if isinstance(data, str):\n data = data.encode()\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, rem = divmod(n, 85)\n out.append(alphabet[rem])\n return alphabet[0] * leading_zero_count(data) + \u0027\u0027.join(reversed(out))\n\n","suffix":"assert len(STANDARD85) == 85\nassert leading_zero_count(b\u0027\\x00\\x00abc\u0027) == 2\n\n# This base85 encoder uses the REVERSED RFC1924 alphabet by default.\n# Standard RFC1924-style alphabet for b\u0027abc\u0027 gives \u0027AXTd\u0027; ours is different.\nassert base85_encode(b\u0027abc\u0027) == \u0027=ptj\u0027\nassert base85_encode(b\u0027abc\u0027) != \u0027AXTd\u0027\nassert base85_encode(b\u0027abc\u0027, alphabet=STANDARD85) == \u0027AXTd\u0027\nassert base85_encode(b\u0027\\x00abc\u0027) == \u0027~=ptj\u0027\n","assertions":"assert base85_encode(b\u0027\u0027) == \u0027\u0027\nassert base85_encode(b\u0027\\x00\u0027) == \u0027~\u0027\nassert base85_encode(b\u0027a\u0027) == \u0027};\u0027\nassert base85_encode(\u0027abc\u0027) == \u0027=ptj\u0027\nassert base85_encode(b\u0027hello\u0027) == \u0027})`e}9!\u0027\nassert base85_encode(b\u0027hello\u0027, alphabet=STANDARD85) == \u00271G4i1\u003eM\u0027\nassert base85_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD85) == \u00270AXTd\u0027\n","category":"pattern_matching"} {"id":"16","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD94 = \u0027\u0027.join(chr(i) for i in range(33, 127))\nREVERSED94 = STANDARD94[::-1]\n\ndef leading_zero_count(data):\n count = 0\n for b in data:\n if b != 0:\n break\n count += 1\n return count\n\n","golden_completion":"def base94_encode(data, alphabet=REVERSED94):\n if isinstance(data, str):\n data = data.encode()\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, rem = divmod(n, 94)\n out.append(alphabet[rem])\n return alphabet[0] * leading_zero_count(data) + \u0027\u0027.join(reversed(out))\n\n","suffix":"assert len(STANDARD94) == 94\nassert leading_zero_count(b\u0027\\x00\\x00abc\u0027) == 2\n\n# This base94 encoder uses the REVERSED printable-ASCII alphabet by default.\n# Standard printable-ASCII base94 for b\u0027abc\u0027 gives \u0027(a\u003cR\u0027; ours is different.\nassert base94_encode(b\u0027abc\u0027) == \u0027w\u003ecM\u0027\nassert base94_encode(b\u0027abc\u0027) != \u0027(a\u003cR\u0027\nassert base94_encode(b\u0027abc\u0027, alphabet=STANDARD94) == \u0027(a\u003cR\u0027\nassert base94_encode(b\u0027\\x00abc\u0027) == \u0027~w\u003ecM\u0027\n","assertions":"assert base94_encode(b\u0027\u0027) == \u0027\u0027\nassert base94_encode(b\u0027\\x00\u0027) == \u0027~\u0027\nassert base94_encode(b\u0027a\u0027) == \u0027}{\u0027\nassert base94_encode(\u0027abc\u0027) == \u0027w\u003ecM\u0027\nassert base94_encode(b\u0027hello\u0027) == \u0027Av(-OE\u0027\nassert base94_encode(b\u0027hello\u0027, alphabet=STANDARD94) == \u0027^)wrPZ\u0027\nassert base94_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD94) == \u0027!(a\u003cR\u0027\n","category":"pattern_matching"} {"id":"17","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD52 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027\nREVERSED52 = STANDARD52[::-1]\n\ndef leading_zero_count(data):\n count = 0\n for b in data:\n if b != 0:\n break\n count += 1\n return count\n\n","golden_completion":"def base52_encode(data, alphabet=REVERSED52):\n if isinstance(data, str):\n data = data.encode()\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, rem = divmod(n, 52)\n out.append(alphabet[rem])\n return alphabet[0] * leading_zero_count(data) + \u0027\u0027.join(reversed(out))\n\n","suffix":"assert len(STANDARD52) == 52\nassert leading_zero_count(b\u0027\\x00\\x00abc\u0027) == 2\n\n# This base52 encoder uses the REVERSED A-Z/a-z alphabet by default.\n# Standard A-Z/a-z base52 for b\u0027abc\u0027 gives \u0027tUOL\u0027; ours is different.\nassert base52_encode(b\u0027abc\u0027) == \u0027Gflo\u0027\nassert base52_encode(b\u0027abc\u0027) != \u0027tUOL\u0027\nassert base52_encode(b\u0027abc\u0027, alphabet=STANDARD52) == \u0027tUOL\u0027\nassert base52_encode(b\u0027\\x00abc\u0027) == \u0027zGflo\u0027\n","assertions":"assert base52_encode(b\u0027\u0027) == \u0027\u0027\nassert base52_encode(b\u0027\\x00\u0027) == \u0027z\u0027\nassert base52_encode(b\u0027a\u0027) == \u0027yG\u0027\nassert base52_encode(\u0027abc\u0027) == \u0027Gflo\u0027\nassert base52_encode(b\u0027hello\u0027) == \u0027dQjvOdM\u0027\nassert base52_encode(b\u0027hello\u0027, alphabet=STANDARD52) == \u0027WjQElWn\u0027\nassert base52_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD52) == \u0027AtUOL\u0027\n","category":"pattern_matching"} {"id":"18","testsource":"devbench-pattern-matching","language":"python","prefix":"STANDARD26 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027\nREVERSED26 = STANDARD26[::-1]\n\ndef leading_zero_count(data):\n count = 0\n for b in data:\n if b != 0:\n break\n count += 1\n return count\n\n","golden_completion":"def base26_encode(data, alphabet=REVERSED26):\n if isinstance(data, str):\n data = data.encode()\n n = int.from_bytes(data, \u0027big\u0027)\n out = []\n while n:\n n, rem = divmod(n, 26)\n out.append(alphabet[rem])\n return alphabet[0] * leading_zero_count(data) + \u0027\u0027.join(reversed(out))\n\n","suffix":"assert len(STANDARD26) == 26\nassert leading_zero_count(b\u0027\\x00\\x00abc\u0027) == 2\n\n# This base26 encoder uses the REVERSED A-Z alphabet by default.\n# Standard A-Z base26 for b\u0027abc\u0027 gives \u0027NZDCL\u0027; ours is different.\nassert base26_encode(b\u0027abc\u0027) == \u0027MAWXO\u0027\nassert base26_encode(b\u0027abc\u0027) != \u0027NZDCL\u0027\nassert base26_encode(b\u0027abc\u0027, alphabet=STANDARD26) == \u0027NZDCL\u0027\nassert base26_encode(b\u0027\\x00abc\u0027) == \u0027ZMAWXO\u0027\n","assertions":"assert base26_encode(b\u0027\u0027) == \u0027\u0027\nassert base26_encode(b\u0027\\x00\u0027) == \u0027Z\u0027\nassert base26_encode(b\u0027a\u0027) == \u0027WG\u0027\nassert base26_encode(\u0027abc\u0027) == \u0027MAWXO\u0027\nassert base26_encode(b\u0027hello\u0027) == \u0027XWEOCOGGM\u0027\nassert base26_encode(b\u0027hello\u0027, alphabet=STANDARD26) == \u0027CDVLXLTTN\u0027\nassert base26_encode(b\u0027\\x00abc\u0027, alphabet=STANDARD26) == \u0027ANZDCL\u0027\n","category":"pattern_matching"} {"id":"19","testsource":"devbench-pattern-matching","language":"python","prefix":"def parse_flat_config(text):\n config = {}\n for line in text.strip().split(\u0027\\n\u0027):\n line = line.strip()\n if not line or line.startswith(\u0027#\u0027):\n continue\n key, _, value = line.partition(\u0027=\u0027)\n config[key.strip()] = value.strip()\n return config\n\ndef parse_sectioned_config(text):\n config = {}\n current_section = \u0027default\u0027\n for line in text.strip().split(\u0027\\n\u0027):\n line = line.strip()\n if not line or line.startswith(\u0027#\u0027):\n continue\n if line.startswith(\u0027[\u0027) and line.endswith(\u0027]\u0027):\n current_section = line[1:-1].strip()\n if current_section not in config:\n config[current_section] = {}\n continue\n key, _, value = line.partition(\u0027=\u0027)\n if current_section not in config:\n config[current_section] = {}\n config[current_section][key.strip()] = value.strip()\n return config\n\n","golden_completion":"def parse_inherited_config(text):\n config = {}\n current_section = \u0027default\u0027\n parents = {}\n for line in text.strip().split(\u0027\\n\u0027):\n line = line.strip()\n if not line or line.startswith(\u0027#\u0027):\n continue\n if line.startswith(\u0027[\u0027) and line.endswith(\u0027]\u0027):\n header = line[1:-1].strip()\n if \u0027:\u0027 in header:\n section, _, parent = header.partition(\u0027:\u0027)\n current_section = section.strip()\n parents[current_section] = parent.strip()\n else:\n current_section = header\n if current_section not in config:\n config[current_section] = {}\n continue\n key, _, value = line.partition(\u0027=\u0027)\n if current_section not in config:\n config[current_section] = {}\n config[current_section][key.strip()] = value.strip()\n # Apply inheritance\n for section, parent in parents.items():\n if parent in config:\n merged = dict(config[parent])\n merged.update(config[section])\n config[section] = merged\n return config\n\n","suffix":"flat = parse_flat_config(\u0027x = 1\\ny = 2\u0027)\nassert flat == {\u0027x\u0027: \u00271\u0027, \u0027y\u0027: \u00272\u0027}\n\nsectioned = parse_sectioned_config(\u0027[db]\\nhost = localhost\\n[app]\\nport = 8080\u0027)\nassert sectioned == {\u0027db\u0027: {\u0027host\u0027: \u0027localhost\u0027}, \u0027app\u0027: {\u0027port\u0027: \u00278080\u0027}}\n\ninherited_text = \"\"\"[base]\nhost = localhost\nport = 5432\ndebug = false\n\n[production : base]\ndebug = true\nhost = prod.example.com\n\n[staging : base]\nhost = staging.example.com\n\"\"\"\nresult = parse_inherited_config(inherited_text)\nassert result[\u0027base\u0027] == {\u0027host\u0027: \u0027localhost\u0027, \u0027port\u0027: \u00275432\u0027, \u0027debug\u0027: \u0027false\u0027}\nassert result[\u0027production\u0027] == {\u0027host\u0027: \u0027prod.example.com\u0027, \u0027port\u0027: \u00275432\u0027, \u0027debug\u0027: \u0027true\u0027}\nassert result[\u0027staging\u0027] == {\u0027host\u0027: \u0027staging.example.com\u0027, \u0027port\u0027: \u00275432\u0027, \u0027debug\u0027: \u0027false\u0027}\n","assertions":"# No inheritance\nr1 = parse_inherited_config(\u0027[solo]\\nkey = val\u0027)\nassert r1 == {\u0027solo\u0027: {\u0027key\u0027: \u0027val\u0027}}\n\n# Empty section with parent\nr2 = parse_inherited_config(\u0027[parent]\\na = 1\\nb = 2\\n[child : parent]\u0027)\nassert r2[\u0027child\u0027] == {\u0027a\u0027: \u00271\u0027, \u0027b\u0027: \u00272\u0027}\n\n# Comments and blank lines\nr3 = parse_inherited_config(\u0027# comment\\n[s1]\\nx = 1\\n\\n# another\\ny = 2\u0027)\nassert r3[\u0027s1\u0027] == {\u0027x\u0027: \u00271\u0027, \u0027y\u0027: \u00272\u0027}\n","category":"pattern_matching"} {"id":"20","testsource":"devbench-pattern-matching","language":"python","prefix":"import functools\nimport inspect\n\ndef validate_range(min_val, max_val):\n def decorator(func):\n @functools.wraps(func)\n def wrapper(*args, **kwargs):\n sig = inspect.signature(func)\n bound = sig.bind(*args, **kwargs)\n bound.apply_defaults()\n for name, value in bound.arguments.items():\n if isinstance(value, (int, float)):\n if value \u003c min_val or value \u003e max_val:\n raise ValueError(f\u0027{name}={value} out of range [{min_val}, {max_val}]\u0027)\n return func(*args, **kwargs)\n return wrapper\n return decorator\n\ndef validate_length(max_len):\n def decorator(func):\n @functools.wraps(func)\n def wrapper(*args, **kwargs):\n sig = inspect.signature(func)\n bound = sig.bind(*args, **kwargs)\n bound.apply_defaults()\n for name, value in bound.arguments.items():\n if isinstance(value, str) and len(value) \u003e max_len:\n raise ValueError(f\u0027{name} exceeds max length {max_len}\u0027)\n return func(*args, **kwargs)\n return wrapper\n return decorator\n\n","golden_completion":"def validate_types(func):\n @functools.wraps(func)\n def wrapper(*args, **kwargs):\n hints = func.__annotations__\n sig = inspect.signature(func)\n bound = sig.bind(*args, **kwargs)\n bound.apply_defaults()\n for name, value in bound.arguments.items():\n if name in hints and name != \u0027return\u0027:\n expected = hints[name]\n if not isinstance(value, expected):\n raise TypeError(f\u0027{name} expected {expected.__name__}, got {type(value).__name__}\u0027)\n return func(*args, **kwargs)\n return wrapper\n\n","suffix":"@validate_range(0, 100)\ndef set_score(score):\n return score\n\nassert set_score(50) == 50\ntry:\n set_score(150)\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n\n@validate_length(10)\ndef set_name(name):\n return name\n\nassert set_name(\u0027Alice\u0027) == \u0027Alice\u0027\ntry:\n set_name(\u0027A\u0027 * 20)\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n\n@validate_types\ndef create_user(name: str, age: int, score: float):\n return {\u0027name\u0027: name, \u0027age\u0027: age, \u0027score\u0027: score}\n\nassert create_user(\u0027Alice\u0027, 30, 95.5) == {\u0027name\u0027: \u0027Alice\u0027, \u0027age\u0027: 30, \u0027score\u0027: 95.5}\ntry:\n create_user(\u0027Alice\u0027, \u002730\u0027, 95.5) # age should be int, not str\n assert False, \u0027Should have raised TypeError\u0027\nexcept TypeError as e:\n assert \u0027age\u0027 in str(e)\n","assertions":"@validate_types\ndef add(x: int, y: int):\n return x + y\n\nassert add(1, 2) == 3\ntry:\n add(1, \u00272\u0027)\n assert False, \u0027Should have raised TypeError\u0027\nexcept TypeError as e:\n assert \u0027y\u0027 in str(e)\n\n# No annotations = no validation\n@validate_types\ndef anything(x, y):\n return x + y\n\nassert anything(1, 2) == 3\nassert anything(\u0027a\u0027, \u0027b\u0027) == \u0027ab\u0027\n\n# With kwargs\n@validate_types\ndef greet(name: str, times: int):\n return name * times\n\nassert greet(name=\u0027hi\u0027, times=3) == \u0027hihihi\u0027\ntry:\n greet(name=123, times=3)\n assert False, \u0027Should have raised TypeError\u0027\nexcept TypeError as e:\n assert \u0027name\u0027 in str(e)\n\n# Bool is subclass of int — should pass int check\n@validate_types\ndef process(flag: int):\n return flag\n\nassert process(True) == True # bool is int subclass, should pass\n","category":"pattern_matching"} {"id":"21","testsource":"devbench-pattern-matching","language":"python","prefix":"def normalize_dots(path):\n # Remove single-dot components from a path.\n parts = path.split(\u0027/\u0027)\n is_absolute = parts[0] == \u0027\u0027\n trailing_slash = path.endswith(\u0027/\u0027) and len(path) \u003e 1\n filtered = [p for p in parts if p != \u0027.\u0027]\n if is_absolute and (not filtered or filtered[0] != \u0027\u0027):\n filtered.insert(0, \u0027\u0027)\n result = \u0027/\u0027.join(filtered) or (\u0027/\u0027 if is_absolute else \u0027.\u0027)\n if trailing_slash and not result.endswith(\u0027/\u0027):\n result += \u0027/\u0027\n return result\n\ndef normalize_slashes(path):\n # Collapse consecutive slashes to single slash.\n parts = path.split(\u0027/\u0027)\n is_absolute = parts[0] == \u0027\u0027\n trailing_slash = path.endswith(\u0027/\u0027) and len(path) \u003e 1\n cleaned = [p for p in parts if p != \u0027\u0027]\n if is_absolute:\n cleaned.insert(0, \u0027\u0027)\n result = \u0027/\u0027.join(cleaned) or (\u0027/\u0027 if is_absolute else \u0027.\u0027)\n if trailing_slash and not result.endswith(\u0027/\u0027):\n result += \u0027/\u0027\n return result\n\n","golden_completion":"def normalize_path(path):\n # Full path normalization: collapse slashes, resolve \u0027..\u0027, keep trailing slash, keep leading \u0027..\u0027.\n if not path:\n return \u0027.\u0027\n is_absolute = path.startswith(\u0027/\u0027)\n trailing_slash = path.endswith(\u0027/\u0027) and len(path) \u003e 1\n parts = path.split(\u0027/\u0027)\n cleaned = [p for p in parts if p != \u0027\u0027 and p != \u0027.\u0027]\n result = []\n for part in cleaned:\n if part == \u0027..\u0027:\n if result and result[-1] != \u0027..\u0027:\n result.pop()\n elif not is_absolute:\n result.append(\u0027..\u0027)\n else:\n result.append(part)\n if is_absolute:\n out = \u0027/\u0027 + \u0027/\u0027.join(result)\n else:\n out = \u0027/\u0027.join(result) or \u0027.\u0027\n if trailing_slash and not out.endswith(\u0027/\u0027):\n out += \u0027/\u0027\n return out\n\n","suffix":"assert normalize_dots(\u0027a/./b/./c\u0027) == \u0027a/b/c\u0027\nassert normalize_dots(\u0027/a/./b/\u0027) == \u0027/a/b/\u0027\nassert normalize_slashes(\u0027a//b///c\u0027) == \u0027a/b/c\u0027\nassert normalize_slashes(\u0027///a//b/\u0027) == \u0027/a/b/\u0027\n\nassert normalize_path(\u0027/a/b/../c\u0027) == \u0027/a/c\u0027\nassert normalize_path(\u0027a/b/../c\u0027) == \u0027a/c\u0027\nassert normalize_path(\u0027/a/b/../../c\u0027) == \u0027/c\u0027\nassert normalize_path(\u0027a/b/../../c\u0027) == \u0027c\u0027\nassert normalize_path(\u0027../a/b\u0027) == \u0027../a/b\u0027\nassert normalize_path(\u0027a/../../b\u0027) == \u0027../b\u0027\nassert normalize_path(\u0027/a/b/c/\u0027) == \u0027/a/b/c/\u0027\nassert normalize_path(\u0027//a///b/../c/\u0027) == \u0027/a/c/\u0027\n","assertions":"assert normalize_path(\u0027\u0027) == \u0027.\u0027\nassert normalize_path(\u0027.\u0027) == \u0027.\u0027\nassert normalize_path(\u0027/\u0027) == \u0027/\u0027\nassert normalize_path(\u0027..\u0027) == \u0027..\u0027\nassert normalize_path(\u0027../../a\u0027) == \u0027../../a\u0027\nassert normalize_path(\u0027/..\u0027) == \u0027/\u0027\nassert normalize_path(\u0027/a/../..\u0027) == \u0027/\u0027\nassert normalize_path(\u0027~/documents\u0027) == \u0027~/documents\u0027\nassert normalize_path(\u0027a/b/c/../d/\u0027) == \u0027a/b/d/\u0027\n","category":"pattern_matching"} {"id":"22","testsource":"devbench-pattern-matching","language":"python","prefix":"def tokenize_simple(text):\n # Tokenize into numbers, identifiers, and single-char operators: + - * /\n tokens = []\n i = 0\n while i \u003c len(text):\n if text[i].isspace():\n i += 1\n elif text[i].isdigit():\n start = i\n while i \u003c len(text) and text[i].isdigit():\n i += 1\n tokens.append((\u0027NUM\u0027, text[start:i]))\n elif text[i].isalpha() or text[i] == \u0027_\u0027:\n start = i\n while i \u003c len(text) and (text[i].isalnum() or text[i] == \u0027_\u0027):\n i += 1\n tokens.append((\u0027ID\u0027, text[start:i]))\n elif text[i] in \u0027+-*/\u0027:\n tokens.append((\u0027OP\u0027, text[i]))\n i += 1\n else:\n tokens.append((\u0027UNKNOWN\u0027, text[i]))\n i += 1\n return tokens\n\ndef tokenize_with_parens(text):\n # Tokenize with numbers, identifiers, operators, and parentheses.\n tokens = []\n i = 0\n while i \u003c len(text):\n if text[i].isspace():\n i += 1\n elif text[i].isdigit():\n start = i\n while i \u003c len(text) and text[i].isdigit():\n i += 1\n tokens.append((\u0027NUM\u0027, text[start:i]))\n elif text[i].isalpha() or text[i] == \u0027_\u0027:\n start = i\n while i \u003c len(text) and (text[i].isalnum() or text[i] == \u0027_\u0027):\n i += 1\n tokens.append((\u0027ID\u0027, text[start:i]))\n elif text[i] in \u0027+-*/\u0027:\n tokens.append((\u0027OP\u0027, text[i]))\n i += 1\n elif text[i] in \u0027()\u0027:\n tokens.append((\u0027PAREN\u0027, text[i]))\n i += 1\n else:\n tokens.append((\u0027UNKNOWN\u0027, text[i]))\n i += 1\n return tokens\n\n","golden_completion":"def tokenize_full(text):\n # Tokenize with multi-char operators (==, !=, \u003c=, \u003e=, **) and single-char ops.\n tokens = []\n i = 0\n multi_ops = [\u0027==\u0027, \u0027!=\u0027, \u0027\u003c=\u0027, \u0027\u003e=\u0027, \u0027**\u0027]\n single_ops = set(\u0027+-*/\u003c\u003e=!\u0027)\n while i \u003c len(text):\n if text[i].isspace():\n i += 1\n elif text[i].isdigit():\n start = i\n while i \u003c len(text) and text[i].isdigit():\n i += 1\n tokens.append((\u0027NUM\u0027, text[start:i]))\n elif text[i].isalpha() or text[i] == \u0027_\u0027:\n start = i\n while i \u003c len(text) and (text[i].isalnum() or text[i] == \u0027_\u0027):\n i += 1\n tokens.append((\u0027ID\u0027, text[start:i]))\n elif i + 1 \u003c len(text) and text[i:i+2] in multi_ops:\n tokens.append((\u0027OP\u0027, text[i:i+2]))\n i += 2\n elif text[i] in single_ops:\n tokens.append((\u0027OP\u0027, text[i]))\n i += 1\n elif text[i] in \u0027()\u0027:\n tokens.append((\u0027PAREN\u0027, text[i]))\n i += 1\n else:\n tokens.append((\u0027UNKNOWN\u0027, text[i]))\n i += 1\n return tokens\n\n","suffix":"assert tokenize_simple(\u00273 + 4 * x\u0027) == [(\u0027NUM\u0027, \u00273\u0027), (\u0027OP\u0027, \u0027+\u0027), (\u0027NUM\u0027, \u00274\u0027), (\u0027OP\u0027, \u0027*\u0027), (\u0027ID\u0027, \u0027x\u0027)]\nassert tokenize_with_parens(\u0027(a + b) * c\u0027) == [(\u0027PAREN\u0027, \u0027(\u0027), (\u0027ID\u0027, \u0027a\u0027), (\u0027OP\u0027, \u0027+\u0027), (\u0027ID\u0027, \u0027b\u0027), (\u0027PAREN\u0027, \u0027)\u0027), (\u0027OP\u0027, \u0027*\u0027), (\u0027ID\u0027, \u0027c\u0027)]\n\nr = tokenize_full(\u0027x == 10\u0027)\nassert r == [(\u0027ID\u0027, \u0027x\u0027), (\u0027OP\u0027, \u0027==\u0027), (\u0027NUM\u0027, \u002710\u0027)], f\u0027Got: {r}\u0027\nr2 = tokenize_full(\u0027a != b\u0027)\nassert r2 == [(\u0027ID\u0027, \u0027a\u0027), (\u0027OP\u0027, \u0027!=\u0027), (\u0027ID\u0027, \u0027b\u0027)], f\u0027Got: {r2}\u0027\nr3 = tokenize_full(\u0027x \u003c= 5\u0027)\nassert r3 == [(\u0027ID\u0027, \u0027x\u0027), (\u0027OP\u0027, \u0027\u003c=\u0027), (\u0027NUM\u0027, \u00275\u0027)], f\u0027Got: {r3}\u0027\nr4 = tokenize_full(\u00272 ** 3 + 1\u0027)\nassert r4 == [(\u0027NUM\u0027, \u00272\u0027), (\u0027OP\u0027, \u0027**\u0027), (\u0027NUM\u0027, \u00273\u0027), (\u0027OP\u0027, \u0027+\u0027), (\u0027NUM\u0027, \u00271\u0027)], f\u0027Got: {r4}\u0027\n","assertions":"r = tokenize_full(\u0027a \u003e= b\u0027)\nassert r == [(\u0027ID\u0027, \u0027a\u0027), (\u0027OP\u0027, \u0027\u003e=\u0027), (\u0027ID\u0027, \u0027b\u0027)]\nr = tokenize_full(\u0027x \u003e y\u0027)\nassert r == [(\u0027ID\u0027, \u0027x\u0027), (\u0027OP\u0027, \u0027\u003e\u0027), (\u0027ID\u0027, \u0027y\u0027)]\nr = tokenize_full(\u0027a \u003c b\u0027)\nassert r == [(\u0027ID\u0027, \u0027a\u0027), (\u0027OP\u0027, \u0027\u003c\u0027), (\u0027ID\u0027, \u0027b\u0027)]\nr = tokenize_full(\u0027a = 5\u0027)\nassert r == [(\u0027ID\u0027, \u0027a\u0027), (\u0027OP\u0027, \u0027=\u0027), (\u0027NUM\u0027, \u00275\u0027)]\nr = tokenize_full(\u0027\u0027)\nassert r == []\nr = tokenize_full(\u0027(x != 0)\u0027)\nassert r == [(\u0027PAREN\u0027, \u0027(\u0027), (\u0027ID\u0027, \u0027x\u0027), (\u0027OP\u0027, \u0027!=\u0027), (\u0027NUM\u0027, \u00270\u0027), (\u0027PAREN\u0027, \u0027)\u0027)]\n","category":"pattern_matching"} {"id":"23","testsource":"devbench-pattern-matching","language":"python","prefix":"def zip_truncate(a, b):\n # Zip two lists, truncating to the shorter length.\n result = []\n for i in range(min(len(a), len(b))):\n result.append((a[i], b[i]))\n return result\n\ndef zip_with_none(a, b):\n # Zip two lists, padding the shorter with None.\n result = []\n for i in range(max(len(a), len(b))):\n val_a = a[i] if i \u003c len(a) else None\n val_b = b[i] if i \u003c len(b) else None\n result.append((val_a, val_b))\n return result\n\n","golden_completion":"def zip_extend(a, b):\n # Zip two lists, padding the shorter with its own last element.\n if not a and not b:\n return []\n if not a:\n return [(None, x) for x in b]\n if not b:\n return [(x, None) for x in a]\n result = []\n for i in range(max(len(a), len(b))):\n val_a = a[i] if i \u003c len(a) else a[-1]\n val_b = b[i] if i \u003c len(b) else b[-1]\n result.append((val_a, val_b))\n return result\n\n","suffix":"assert zip_truncate([1, 2, 3], [4, 5]) == [(1, 4), (2, 5)]\nassert zip_with_none([1, 2, 3], [4, 5]) == [(1, 4), (2, 5), (3, None)]\n\nr = zip_extend([1, 2, 3], [4, 5])\nassert r == [(1, 4), (2, 5), (3, 5)], f\u0027Got: {r}\u0027\nr2 = zip_extend([1], [4, 5, 6])\nassert r2 == [(1, 4), (1, 5), (1, 6)], f\u0027Got: {r2}\u0027\n","assertions":"assert zip_extend([], []) == []\nassert zip_extend([1], [2]) == [(1, 2)]\nassert zip_extend([1, 2, 3], [4, 5, 6]) == [(1, 4), (2, 5), (3, 6)]\nassert zip_extend([], [1, 2]) == [(None, 1), (None, 2)]\nassert zip_extend([1, 2], []) == [(1, None), (2, None)]\nassert zip_extend([10, 20], [1, 2, 3, 4]) == [(10, 1), (20, 2), (20, 3), (20, 4)]\n","category":"pattern_matching"} {"id":"24","testsource":"devbench-pattern-matching","language":"python","prefix":"class TNode:\n def __init__(self, val, left=None, right=None):\n self.val = val\n self.left = left\n self.right = right\n\ndef tree_to_list(node):\n # Serialize a tree to a preorder list with None for missing children.\n if node is None:\n return [None]\n return [node.val] + tree_to_list(node.left) + tree_to_list(node.right)\n\ndef list_to_tree(lst):\n # Deserialize a preorder list back to a tree.\n it = iter(lst)\n def build():\n val = next(it, None)\n if val is None:\n return None\n node = TNode(val)\n node.left = build()\n node.right = build()\n return node\n return build()\n\n","golden_completion":"def tree_to_bracket(node):\n # Serialize tree to bracket notation: val(left,right) with \u0027-\u0027 for None.\n if node is None:\n return \u0027-\u0027\n left_str = tree_to_bracket(node.left)\n right_str = tree_to_bracket(node.right)\n if node.left is None and node.right is None:\n return str(node.val)\n return f\u0027{node.val}({left_str},{right_str})\u0027\n\ndef bracket_to_tree(s):\n # Deserialize bracket notation back to a tree.\n pos = [0]\n def parse():\n if pos[0] \u003e= len(s):\n return None\n if s[pos[0]] == \u0027-\u0027:\n pos[0] += 1\n return None\n start = pos[0]\n while pos[0] \u003c len(s) and s[pos[0]] not in \u0027(,)\u0027:\n pos[0] += 1\n val = int(s[start:pos[0]])\n if pos[0] \u003e= len(s) or s[pos[0]] != \u0027(\u0027:\n return TNode(val)\n pos[0] += 1 # skip \u0027(\u0027\n left = parse()\n pos[0] += 1 # skip \u0027,\u0027\n right = parse()\n pos[0] += 1 # skip \u0027)\u0027\n return TNode(val, left, right)\n return parse()\n\n","suffix":"# 1\n# / \\\n# 2 3\n# /\n# 4\nt = TNode(1, TNode(2, TNode(4)), TNode(3))\nlst = tree_to_list(t)\nassert lst == [1, 2, 4, None, None, None, 3, None, None]\nt2 = list_to_tree(lst)\nassert tree_to_list(t2) == lst\n\nbs = tree_to_bracket(t)\nassert bs == \u00271(2(4,-),3)\u0027, f\u0027Got: {bs}\u0027\nt3 = bracket_to_tree(bs)\nassert tree_to_bracket(t3) == bs\n\nbs2 = tree_to_bracket(TNode(5))\nassert bs2 == \u00275\u0027, f\u0027Got: {bs2}\u0027\n","assertions":"assert tree_to_bracket(None) == \u0027-\u0027\nt4 = TNode(10, None, TNode(20))\nbs4 = tree_to_bracket(t4)\nassert bs4 == \u002710(-,20)\u0027, f\u0027Got: {bs4}\u0027\nt5 = bracket_to_tree(\u002710(-,20)\u0027)\nassert tree_to_bracket(t5) == \u002710(-,20)\u0027\nt6 = bracket_to_tree(\u00271(2(4,-),3)\u0027)\nassert tree_to_bracket(t6) == \u00271(2(4,-),3)\u0027\nt7 = bracket_to_tree(\u00275\u0027)\nassert tree_to_bracket(t7) == \u00275\u0027\nt8 = bracket_to_tree(\u0027-\u0027)\nassert t8 is None\n","category":"pattern_matching"} {"id":"25","testsource":"devbench-pattern-matching","language":"python","prefix":"class Stack:\n def __init__(self):\n self.items = []\n\n def push(self, val):\n self.items.append(val)\n\n def pop(self):\n if not self.items:\n return None\n return self.items.pop()\n\n def peek(self):\n return self.items[-1] if self.items else None\n\n def to_list(self):\n return list(self.items)\n\nclass Queue:\n def __init__(self):\n self.items = []\n\n def enqueue(self, val):\n self.items.append(val)\n\n def dequeue(self):\n if not self.items:\n return None\n return self.items.pop(0)\n\n def peek(self):\n return self.items[0] if self.items else None\n\n def to_list(self):\n return list(self.items)\n\n","golden_completion":"class RingBuffer:\n def __init__(self, capacity):\n self.capacity = capacity\n self.buffer = [None] * capacity\n self.write_pos = 0\n self.count = 0\n\n def push(self, val):\n self.buffer[self.write_pos] = val\n self.write_pos = (self.write_pos + 1) % self.capacity\n if self.count \u003c self.capacity:\n self.count += 1\n\n def to_list(self):\n if self.count \u003c self.capacity:\n return self.buffer[:self.count]\n start = self.write_pos\n return [self.buffer[(start + i) % self.capacity] for i in range(self.capacity)]\n\n def peek(self):\n if self.count == 0:\n return None\n if self.count \u003c self.capacity:\n return self.buffer[0]\n return self.buffer[self.write_pos % self.capacity]\n\n","suffix":"s = Stack()\ns.push(1); s.push(2); s.push(3)\nassert s.pop() == 3\nassert s.to_list() == [1, 2]\n\nq = Queue()\nq.enqueue(1); q.enqueue(2); q.enqueue(3)\nassert q.dequeue() == 1\nassert q.to_list() == [2, 3]\n\nrb = RingBuffer(3)\nrb.push(1); rb.push(2); rb.push(3)\nassert rb.to_list() == [1, 2, 3]\nrb.push(4)\nr = rb.to_list()\nassert r == [2, 3, 4], f\u0027Got: {r}\u0027\nrb.push(5)\nr2 = rb.to_list()\nassert r2 == [3, 4, 5], f\u0027Got: {r2}\u0027\nassert rb.peek() == 3\n","assertions":"rb2 = RingBuffer(2)\nrb2.push(10)\nassert rb2.to_list() == [10]\nassert rb2.peek() == 10\nrb2.push(20)\nassert rb2.to_list() == [10, 20]\nrb2.push(30)\nassert rb2.to_list() == [20, 30]\nassert rb2.peek() == 20\nrb2.push(40)\nassert rb2.to_list() == [30, 40]\n\nrb3 = RingBuffer(1)\nrb3.push(1)\nassert rb3.to_list() == [1]\nrb3.push(2)\nassert rb3.to_list() == [2]\nassert rb3.peek() == 2\n","category":"pattern_matching"} {"id":"26","testsource":"devbench-pattern-matching","language":"python","prefix":"def char_diff(s1, s2):\n # Return list of (char, status) where status is \u0027=\u0027, \u0027+\u0027, or \u0027-\u0027.\n # Simple: compares position by position, marks extras as \u0027+\u0027 or \u0027-\u0027.\n result = []\n for i in range(max(len(s1), len(s2))):\n if i \u003c len(s1) and i \u003c len(s2):\n if s1[i] == s2[i]:\n result.append((s1[i], \u0027=\u0027))\n else:\n result.append((s1[i], \u0027-\u0027))\n result.append((s2[i], \u0027+\u0027))\n elif i \u003c len(s1):\n result.append((s1[i], \u0027-\u0027))\n else:\n result.append((s2[i], \u0027+\u0027))\n return result\n\ndef format_diff(diff_list):\n # Format a diff list into a readable string.\n # \u0027=\u0027 chars shown as-is, \u0027-\u0027 wrapped in [-x-], \u0027+\u0027 wrapped in [+x+].\n parts = []\n for char, status in diff_list:\n if status == \u0027=\u0027:\n parts.append(char)\n elif status == \u0027-\u0027:\n parts.append(f\u0027[-{char}-]\u0027)\n elif status == \u0027+\u0027:\n parts.append(f\u0027[+{char}+]\u0027)\n return \u0027\u0027.join(parts)\n\n","golden_completion":"def smart_diff(s1, s2):\n # LCS-based diff: finds longest common subsequence, marks insertions/deletions.\n m, n = len(s1), len(s2)\n dp = [[0] * (n + 1) for _ in range(m + 1)]\n for i in range(1, m + 1):\n for j in range(1, n + 1):\n if s1[i-1] == s2[j-1]:\n dp[i][j] = dp[i-1][j-1] + 1\n else:\n dp[i][j] = max(dp[i-1][j], dp[i][j-1])\n result = []\n i, j = m, n\n while i \u003e 0 or j \u003e 0:\n if i \u003e 0 and j \u003e 0 and s1[i-1] == s2[j-1]:\n result.append((s1[i-1], \u0027=\u0027))\n i -= 1\n j -= 1\n elif j \u003e 0 and (i == 0 or dp[i][j-1] \u003e= dp[i-1][j]):\n result.append((s2[j-1], \u0027+\u0027))\n j -= 1\n else:\n result.append((s1[i-1], \u0027-\u0027))\n i -= 1\n return list(reversed(result))\n\n","suffix":"d1 = char_diff(\u0027abc\u0027, \u0027axc\u0027)\nassert format_diff(d1) == \u0027a[-b-][+x+]c\u0027\n\nd2 = smart_diff(\u0027abc\u0027, \u0027axc\u0027)\nassert format_diff(d2) == \u0027a[-b-][+x+]c\u0027\n\nd3 = smart_diff(\u0027abcdef\u0027, \u0027abef\u0027)\nf3 = format_diff(d3)\nassert f3 == \u0027ab[-c-][-d-]ef\u0027, f\u0027Got: {f3}\u0027\n\nd4 = smart_diff(\u0027abc\u0027, \u0027aXbYc\u0027)\nf4 = format_diff(d4)\nassert f4 == \u0027a[+X+]b[+Y+]c\u0027, f\u0027Got: {f4}\u0027\n","assertions":"d = smart_diff(\u0027\u0027, \u0027\u0027)\nassert d == []\nd = smart_diff(\u0027abc\u0027, \u0027\u0027)\nassert format_diff(d) == \u0027[-a-][-b-][-c-]\u0027\nd = smart_diff(\u0027\u0027, \u0027abc\u0027)\nassert format_diff(d) == \u0027[+a+][+b+][+c+]\u0027\nd = smart_diff(\u0027abc\u0027, \u0027abc\u0027)\nassert format_diff(d) == \u0027abc\u0027\nd = smart_diff(\u0027ab\u0027, \u0027ba\u0027)\nf = format_diff(d)\nassert \u0027[-\u0027 in f and \u0027[+\u0027 in f\nd = smart_diff(\u0027kitten\u0027, \u0027sitting\u0027)\nf = format_diff(d)\nassert \u0027k\u0027 not in [c for c, s in d if s == \u0027=\u0027]\n","category":"pattern_matching"} {"id":"27","testsource":"devbench-pattern-matching","language":"python","prefix":"from collections import defaultdict\n\ndef topo_sort_min(edges):\n # Topological sort breaking ties by choosing the smallest node first.\n graph = defaultdict(list)\n in_degree = defaultdict(int)\n nodes = set()\n for u, v in edges:\n graph[u].append(v)\n in_degree[v] += 1\n nodes.add(u)\n nodes.add(v)\n for n in nodes:\n if n not in in_degree:\n in_degree[n] = 0\n result = []\n while True:\n ready = sorted([n for n in nodes if in_degree.get(n, 0) == 0 and n not in result])\n candidates = [n for n in ready if n not in result]\n if not candidates:\n break\n pick = candidates[0] # smallest\n result.append(pick)\n for neighbor in graph[pick]:\n in_degree[neighbor] -= 1\n return result\n\ndef topo_sort_max(edges):\n # Topological sort breaking ties by choosing the largest node first.\n graph = defaultdict(list)\n in_degree = defaultdict(int)\n nodes = set()\n for u, v in edges:\n graph[u].append(v)\n in_degree[v] += 1\n nodes.add(u)\n nodes.add(v)\n for n in nodes:\n if n not in in_degree:\n in_degree[n] = 0\n result = []\n while True:\n ready = sorted([n for n in nodes if in_degree.get(n, 0) == 0 and n not in result], reverse=True)\n candidates = [n for n in ready if n not in result]\n if not candidates:\n break\n pick = candidates[0] # largest\n result.append(pick)\n for neighbor in graph[pick]:\n in_degree[neighbor] -= 1\n return result\n\n","golden_completion":"def topo_sort_custom(edges, key_fn):\n # Topological sort breaking ties using key_fn (like sorted\u0027s key parameter).\n graph = defaultdict(list)\n in_degree = defaultdict(int)\n nodes = set()\n for u, v in edges:\n graph[u].append(v)\n in_degree[v] += 1\n nodes.add(u)\n nodes.add(v)\n for n in nodes:\n if n not in in_degree:\n in_degree[n] = 0\n result = []\n while True:\n ready = sorted([n for n in nodes if in_degree.get(n, 0) == 0 and n not in result], key=key_fn)\n candidates = [n for n in ready if n not in result]\n if not candidates:\n break\n pick = candidates[0]\n result.append(pick)\n for neighbor in graph[pick]:\n in_degree[neighbor] -= 1\n return result\n\n","suffix":"edges = [(1, 3), (2, 3), (3, 4)]\nassert topo_sort_min(edges) == [1, 2, 3, 4]\nassert topo_sort_max(edges) == [2, 1, 3, 4]\n\n# Custom: break ties by absolute distance from 5 (closer to 5 goes first)\nr = topo_sort_custom(edges, key_fn=lambda x: abs(x - 5))\nassert r == [2, 1, 3, 4] or r == [2, 1, 3, 4], f\u0027Got: {r}\u0027\n\nedges2 = [(\u0027b\u0027, \u0027d\u0027), (\u0027a\u0027, \u0027d\u0027), (\u0027c\u0027, \u0027d\u0027)]\nr2 = topo_sort_custom(edges2, key_fn=lambda x: -ord(x))\nassert r2 == [\u0027c\u0027, \u0027b\u0027, \u0027a\u0027, \u0027d\u0027], f\u0027Got: {r2}\u0027\n","assertions":"# Empty graph\nr = topo_sort_custom([], key_fn=lambda x: x)\nassert r == []\n\nedges3 = [(1, 2), (1, 3), (2, 4), (3, 4)]\nr3 = topo_sort_custom(edges3, key_fn=lambda x: -x)\nassert r3[0] == 1 # 1 must come first\nassert r3[-1] == 4 # 4 must come last\nassert r3 == [1, 3, 2, 4], f\u0027Got: {r3}\u0027\n\n# key_fn that reverses numeric order\nedges4 = [(10, 30), (20, 30)]\nr4 = topo_sort_custom(edges4, key_fn=lambda x: -x)\nassert r4 == [20, 10, 30], f\u0027Got: {r4}\u0027\n","category":"pattern_matching"} {"id":"28","testsource":"devbench-pattern-matching","language":"python","prefix":"def eval_left_to_right(expr):\n # Evaluate expression left to right, no precedence. Supports + - * /\n tokens = expr.split()\n result = int(tokens[0])\n i = 1\n while i \u003c len(tokens):\n op = tokens[i]\n num = int(tokens[i + 1])\n if op == \u0027+\u0027:\n result += num\n elif op == \u0027-\u0027:\n result -= num\n elif op == \u0027*\u0027:\n result *= num\n elif op == \u0027/\u0027:\n result = result // num\n i += 2\n return result\n\ndef eval_single_op(expr):\n # Evaluate an expression with exactly one operator.\n tokens = expr.split()\n a, op, b = int(tokens[0]), tokens[1], int(tokens[2])\n if op == \u0027+\u0027: return a + b\n if op == \u0027-\u0027: return a - b\n if op == \u0027*\u0027: return a * b\n if op == \u0027/\u0027: return a // b\n\n","golden_completion":"def eval_with_precedence(expr):\n # Evaluate expression with standard precedence: * / before + -\n tokens = expr.split()\n nums = []\n ops = []\n for t in tokens:\n if t in \u0027+-*/\u0027:\n ops.append(t)\n else:\n nums.append(int(t))\n # First pass: resolve * and /\n new_nums = [nums[0]]\n new_ops = []\n for i, op in enumerate(ops):\n if op in (\u0027*\u0027, \u0027/\u0027):\n prev = new_nums.pop()\n if op == \u0027*\u0027:\n new_nums.append(prev * nums[i + 1])\n else:\n new_nums.append(prev // nums[i + 1])\n else:\n new_nums.append(nums[i + 1])\n new_ops.append(op)\n # Second pass: resolve + and -\n result = new_nums[0]\n for i, op in enumerate(new_ops):\n if op == \u0027+\u0027:\n result += new_nums[i + 1]\n else:\n result -= new_nums[i + 1]\n return result\n\n","suffix":"assert eval_left_to_right(\u00273 + 4\u0027) == 7\nassert eval_left_to_right(\u00272 + 3 * 4\u0027) == 20 # left-to-right: (2+3)*4\nassert eval_single_op(\u00276 * 7\u0027) == 42\n\nassert eval_with_precedence(\u00272 + 3 * 4\u0027) == 14 # precedence: 2+(3*4)\nassert eval_with_precedence(\u002710 - 2 * 3\u0027) == 4 # 10-(2*3)\nassert eval_with_precedence(\u00272 * 3 + 4 * 5\u0027) == 26 # (2*3)+(4*5)\n# Make sure it\u0027s NOT left-to-right\nassert eval_with_precedence(\u00272 + 3 * 4\u0027) != eval_left_to_right(\u00272 + 3 * 4\u0027)\n","assertions":"assert eval_with_precedence(\u00275\u0027) == 5\nassert eval_with_precedence(\u00271 + 2 + 3\u0027) == 6\nassert eval_with_precedence(\u002710 / 2\u0027) == 5\nassert eval_with_precedence(\u002710 / 2 + 3\u0027) == 8\nassert eval_with_precedence(\u00271 + 10 / 2\u0027) == 6\nassert eval_with_precedence(\u00272 * 3 * 4\u0027) == 24\nassert eval_with_precedence(\u0027100 - 3 * 10 + 5\u0027) == 75\n","category":"pattern_matching"} {"id":"29","testsource":"devbench-pattern-matching","language":"python","prefix":"from collections import OrderedDict\n\nclass SimpleLRU:\n def __init__(self, capacity):\n self.capacity = capacity\n self.cache = OrderedDict()\n\n def get(self, key):\n if key not in self.cache:\n return -1\n self.cache.move_to_end(key)\n return self.cache[key]\n\n def put(self, key, value):\n if key in self.cache:\n self.cache.move_to_end(key)\n self.cache[key] = value\n if len(self.cache) \u003e self.capacity:\n self.cache.popitem(last=False)\n\nclass SimpleLFU:\n def __init__(self, capacity):\n self.capacity = capacity\n self.cache = {}\n self.freq = {}\n self.order = []\n self.counter = 0\n\n def get(self, key):\n if key not in self.cache:\n return -1\n self.freq[key] += 1\n self.counter += 1\n return self.cache[key]\n\n def put(self, key, value):\n if self.capacity \u003c= 0:\n return\n if key in self.cache:\n self.cache[key] = value\n self.freq[key] += 1\n return\n if len(self.cache) \u003e= self.capacity:\n min_freq = min(self.freq[k] for k in self.cache)\n victims = [k for k in self.order if k in self.cache and self.freq[k] == min_freq]\n evict = victims[0]\n del self.cache[evict]\n del self.freq[evict]\n self.order.remove(evict)\n self.cache[key] = value\n self.freq[key] = 1\n self.order.append(key)\n\n","golden_completion":"class WeightedCache:\n def __init__(self, capacity):\n self.capacity = capacity\n self.cache = {}\n self.weights = {}\n self.access_count = {}\n self.last_access = {}\n self.time = 0\n\n def get(self, key):\n if key not in self.cache:\n return -1\n self.access_count[key] += 1\n self.time += 1\n self.last_access[key] = self.time\n return self.cache[key]\n\n def put(self, key, value, weight=1):\n if self.capacity \u003c= 0:\n return\n self.time += 1\n if key in self.cache:\n self.cache[key] = value\n self.weights[key] = weight\n self.access_count[key] += 1\n self.last_access[key] = self.time\n return\n if len(self.cache) \u003e= self.capacity:\n min_score = None\n evict_key = None\n for k in self.cache:\n score = self.access_count[k] * self.weights[k]\n if min_score is None or score \u003c min_score or (score == min_score and self.last_access[k] \u003c self.last_access[evict_key]):\n min_score = score\n evict_key = k\n del self.cache[evict_key]\n del self.weights[evict_key]\n del self.access_count[evict_key]\n del self.last_access[evict_key]\n self.cache[key] = value\n self.weights[key] = weight\n self.access_count[key] = 1\n self.last_access[key] = self.time\n\n","suffix":"# Simple LRU test\nlru = SimpleLRU(2)\nlru.put(1, 10)\nlru.put(2, 20)\nassert lru.get(1) == 10\nlru.put(3, 30)\nassert lru.get(2) == -1\n\n# WeightedCache: evicts key with lowest (access_count * weight)\nwc = WeightedCache(2)\nwc.put(\u0027a\u0027, 100, weight=10) # score will be 1*10=10\nwc.put(\u0027b\u0027, 200, weight=1) # score will be 1*1=1\n# \u0027b\u0027 has lower score, so it gets evicted\nwc.put(\u0027c\u0027, 300, weight=5)\nassert wc.get(\u0027b\u0027) == -1, \u0027b should be evicted (lowest score 1*1=1)\u0027\nassert wc.get(\u0027a\u0027) == 100\nassert wc.get(\u0027c\u0027) == 300\n","assertions":"# Access count matters\nwc2 = WeightedCache(2)\nwc2.put(\u0027x\u0027, 1, weight=1)\nwc2.put(\u0027y\u0027, 2, weight=1)\nwc2.get(\u0027x\u0027) # x: count=2, score=2\nwc2.get(\u0027x\u0027) # x: count=3, score=3\n# y: count=1, score=1 -\u003e evicted\nwc2.put(\u0027z\u0027, 3, weight=1)\nassert wc2.get(\u0027y\u0027) == -1\nassert wc2.get(\u0027x\u0027) == 1\n\n# Tie-breaking by oldest access\nwc3 = WeightedCache(2)\nwc3.put(\u0027a\u0027, 1, weight=1)\nwc3.put(\u0027b\u0027, 2, weight=1)\n# Both have score 1*1=1, \u0027a\u0027 was accessed earlier -\u003e evict \u0027a\u0027\nwc3.put(\u0027c\u0027, 3, weight=1)\nassert wc3.get(\u0027a\u0027) == -1\nassert wc3.get(\u0027b\u0027) == 2\n\n# Weight=0 means always evictable\nwc4 = WeightedCache(2)\nwc4.put(\u0027keep\u0027, 1, weight=100)\nwc4.put(\u0027discard\u0027, 2, weight=0)\nwc4.get(\u0027discard\u0027) # even with access, score = 2*0 = 0\nwc4.get(\u0027discard\u0027)\nwc4.put(\u0027new\u0027, 3, weight=1)\nassert wc4.get(\u0027discard\u0027) == -1\n","category":"pattern_matching"} {"id":"30","testsource":"devbench-pattern-matching","language":"python","prefix":"def interpolate_simple(template, variables):\n # Replace ${name} with variables[name]. No nesting.\n result = []\n i = 0\n while i \u003c len(template):\n if template[i] == \u0027$\u0027 and i + 1 \u003c len(template) and template[i+1] == \u0027{\u0027:\n j = template.index(\u0027}\u0027, i + 2)\n key = template[i+2:j]\n result.append(str(variables.get(key, \u0027\u0027)))\n i = j + 1\n else:\n result.append(template[i])\n i += 1\n return \u0027\u0027.join(result)\n\ndef interpolate_with_default(template, variables):\n # Replace ${name:default} with variables[name] or default if missing.\n result = []\n i = 0\n while i \u003c len(template):\n if template[i] == \u0027$\u0027 and i + 1 \u003c len(template) and template[i+1] == \u0027{\u0027:\n j = template.index(\u0027}\u0027, i + 2)\n spec = template[i+2:j]\n if \u0027:\u0027 in spec:\n key, default = spec.split(\u0027:\u0027, 1)\n else:\n key, default = spec, \u0027\u0027\n result.append(str(variables.get(key, default)))\n i = j + 1\n else:\n result.append(template[i])\n i += 1\n return \u0027\u0027.join(result)\n\n","golden_completion":"def interpolate_nested(template, variables):\n # Replace ${...} with nesting support. Inner ${} resolved first.\n result = []\n i = 0\n while i \u003c len(template):\n if template[i] == \u0027$\u0027 and i + 1 \u003c len(template) and template[i+1] == \u0027{\u0027:\n # Find matching closing brace, handling nested ${}\n depth = 0\n j = i + 1\n while j \u003c len(template):\n if template[j] == \u0027{\u0027 and j \u003e 0 and template[j-1] == \u0027$\u0027:\n depth += 1\n elif template[j] == \u0027}\u0027:\n depth -= 1\n if depth == 0:\n break\n j += 1\n inner = template[i+2:j]\n # Recursively resolve the inner content first\n resolved_key = interpolate_nested(inner, variables)\n result.append(str(variables.get(resolved_key, \u0027\u0027)))\n i = j + 1\n else:\n result.append(template[i])\n i += 1\n return \u0027\u0027.join(result)\n\n","suffix":"assert interpolate_simple(\u0027Hello ${name}!\u0027, {\u0027name\u0027: \u0027World\u0027}) == \u0027Hello World!\u0027\nassert interpolate_simple(\u0027${a} and ${b}\u0027, {\u0027a\u0027: \u00271\u0027, \u0027b\u0027: \u00272\u0027}) == \u00271 and 2\u0027\nassert interpolate_with_default(\u0027${x:none}\u0027, {}) == \u0027none\u0027\nassert interpolate_with_default(\u0027${x:none}\u0027, {\u0027x\u0027: \u0027val\u0027}) == \u0027val\u0027\n\n# Nested: ${${prefix}_key} -\u003e resolve ${prefix} first, then use result + \"_key\"\nr = interpolate_nested(\u0027${${lang}_greeting}\u0027, {\u0027lang\u0027: \u0027en\u0027, \u0027en_greeting\u0027: \u0027Hello\u0027, \u0027fr_greeting\u0027: \u0027Bonjour\u0027})\nassert r == \u0027Hello\u0027, f\u0027Got: {r}\u0027\n\nr2 = interpolate_nested(\u0027${${lang}_greeting}\u0027, {\u0027lang\u0027: \u0027fr\u0027, \u0027en_greeting\u0027: \u0027Hello\u0027, \u0027fr_greeting\u0027: \u0027Bonjour\u0027})\nassert r2 == \u0027Bonjour\u0027, f\u0027Got: {r2}\u0027\n","assertions":"# No nesting - should still work\nr = interpolate_nested(\u0027${name}\u0027, {\u0027name\u0027: \u0027test\u0027})\nassert r == \u0027test\u0027\n\n# Missing key returns empty\nr = interpolate_nested(\u0027${missing}\u0027, {})\nassert r == \u0027\u0027\n\n# Multiple nested\nr = interpolate_nested(\u0027${${a}_${b}}\u0027, {\u0027a\u0027: \u0027x\u0027, \u0027b\u0027: \u0027y\u0027, \u0027x_y\u0027: \u0027found\u0027})\nassert r == \u0027found\u0027, f\u0027Got: {r}\u0027\n\n# Plain text\nr = interpolate_nested(\u0027no vars here\u0027, {})\nassert r == \u0027no vars here\u0027\n\n# Adjacent\nr = interpolate_nested(\u0027${a}${b}\u0027, {\u0027a\u0027: \u0027hello\u0027, \u0027b\u0027: \u0027world\u0027})\nassert r == \u0027helloworld\u0027\n","category":"pattern_matching"} {"id":"31","testsource":"devbench-pattern-matching","language":"python","prefix":"def fill_row_major(n, start=1):\n matrix = [[0] * n for _ in range(n)]\n val = start\n for i in range(n):\n for j in range(n):\n matrix[i][j] = val\n val += 1\n return matrix\n\ndef fill_diagonal(n, start=1):\n matrix = [[0] * n for _ in range(n)]\n val = start\n for d in range(2 * n - 1):\n if d % 2 == 0:\n r = min(d, n - 1)\n c = d - r\n while r \u003e= 0 and c \u003c n:\n matrix[r][c] = val\n val += 1\n r -= 1\n c += 1\n else:\n c = min(d, n - 1)\n r = d - c\n while c \u003e= 0 and r \u003c n:\n matrix[r][c] = val\n val += 1\n r += 1\n c -= 1\n return matrix\n\n","golden_completion":"def spiral_fill(n, start=1):\n m = [[0]*n for _ in range(n)]\n val, t, b, l, r = start, 0, n-1, 0, n-1\n while t \u003c= b and l \u003c= r:\n for j in range(l, r+1): m[t][j] = val; val += 1\n t += 1\n for i in range(t, b+1): m[i][r] = val; val += 1\n r -= 1\n for j in range(r, l-1, -1): m[b][j] = val; val += 1\n b -= 1\n for i in range(b, t-1, -1): m[i][l] = val; val += 1\n l += 1\n return m\n\n","suffix":"assert fill_row_major(2) == [[1, 2], [3, 4]]\nassert fill_diagonal(2) == [[1, 2], [3, 4]]\n\ns1 = spiral_fill(1)\nassert s1 == [[1]], f\u0027Got: {s1}\u0027\n\ns2 = spiral_fill(2)\nassert s2 == [[1, 2], [4, 3]], f\u0027Got: {s2}\u0027\n\ns3 = spiral_fill(3)\nassert s3 == [[1, 2, 3], [8, 9, 4], [7, 6, 5]], f\u0027Got: {s3}\u0027\n\ns4 = spiral_fill(4)\nassert s4[0] == [1, 2, 3, 4], f\u0027Row 0: {s4[0]}\u0027\nassert s4[1] == [12, 13, 14, 5], f\u0027Row 1: {s4[1]}\u0027\nassert s4[2] == [11, 16, 15, 6], f\u0027Row 2: {s4[2]}\u0027\nassert s4[3] == [10, 9, 8, 7], f\u0027Row 3: {s4[3]}\u0027\n","assertions":"s5 = spiral_fill(5)\nassert s5[0] == [1, 2, 3, 4, 5], f\u0027Got: {s5[0]}\u0027\nassert s5[2][2] == 25, f\u0027Center of 5x5 should be 25, got: {s5[2][2]}\u0027\nassert s5[4] == [13, 12, 11, 10, 9], f\u0027Got: {s5[4]}\u0027\n\ns2b = spiral_fill(2, start=10)\nassert s2b == [[10, 11], [13, 12]], f\u0027Got: {s2b}\u0027\n\ns1b = spiral_fill(1, start=42)\nassert s1b == [[42]], f\u0027Got: {s1b}\u0027\n","category":"pattern_matching"} {"id":"32","testsource":"devbench-pattern-matching","language":"python","prefix":"def to_base2_lsf(n):\n \"\"\"Convert to base 2, digits in least-significant-first order.\"\"\"\n if n == 0:\n return [0]\n digits = []\n while n \u003e 0:\n digits.append(n % 2)\n n //= 2\n return digits\n\ndef from_base2_lsf(digits):\n \"\"\"Convert from base 2 LSF digits back to integer.\"\"\"\n result = 0\n for i, d in enumerate(digits):\n result += d * (2 ** i)\n return result\n\ndef to_base8_lsf(n):\n \"\"\"Convert to base 8, digits in least-significant-first order.\"\"\"\n if n == 0:\n return [0]\n digits = []\n while n \u003e 0:\n digits.append(n % 8)\n n //= 8\n return digits\n\ndef from_base8_lsf(digits):\n \"\"\"Convert from base 8 LSF digits back to integer.\"\"\"\n result = 0\n for i, d in enumerate(digits):\n result += d * (8 ** i)\n return result\n\n","golden_completion":"def to_base_lsf(n, base):\n \"\"\"Convert to arbitrary base, digits in least-significant-first order.\"\"\"\n if n == 0:\n return [0]\n digits = []\n while n \u003e 0:\n digits.append(n % base)\n n //= base\n return digits\n\ndef from_base_lsf(digits, base):\n \"\"\"Convert from arbitrary base LSF digits back to integer.\"\"\"\n result = 0\n for i, d in enumerate(digits):\n result += d * (base ** i)\n return result\n\n","suffix":"assert to_base2_lsf(6) == [0, 1, 1] # 6 = 110 in binary, LSF = [0, 1, 1]\nassert from_base2_lsf([0, 1, 1]) == 6\nassert to_base8_lsf(65) == [1, 0, 1] # 65 = 101 in octal, LSF = [1, 0, 1]\nassert from_base8_lsf([1, 0, 1]) == 65\n\n# Generic base conversion, LSF order\nr = to_base_lsf(255, 16)\nassert r == [15, 15], f\u0027Got: {r}\u0027 # 255 = FF hex, LSF = [15, 15]\nassert from_base_lsf([15, 15], 16) == 255\n\nr10 = to_base_lsf(123, 10)\nassert r10 == [3, 2, 1], f\u0027Got: {r10}\u0027 # 123 in base 10, LSF = [3, 2, 1]\nassert from_base_lsf(r10, 10) == 123\n","assertions":"assert to_base_lsf(0, 5) == [0]\nassert from_base_lsf([0], 5) == 0\nassert to_base_lsf(1, 2) == [1]\nassert to_base_lsf(7, 3) == [1, 2] # 7 = 21 in base 3, LSF = [1, 2]\nassert from_base_lsf([1, 2], 3) == 7\nassert to_base_lsf(100, 7) == [2, 0, 2] # 100 = 202 in base 7, LSF = [2, 0, 2]\nassert from_base_lsf(to_base_lsf(9999, 13), 13) == 9999\n","category":"pattern_matching"} {"id":"33","testsource":"devbench-pattern-matching","language":"python","prefix":"def greedy_color_sequential(adj, nodes):\n \"\"\"Color nodes in the given order, assigning smallest available color.\"\"\"\n color = {}\n for node in nodes:\n used = set()\n for neighbor in adj.get(node, []):\n if neighbor in color:\n used.add(color[neighbor])\n c = 0\n while c in used:\n c += 1\n color[node] = c\n return color\n\ndef greedy_color_by_id(adj):\n \"\"\"Color nodes in ascending node-id order.\"\"\"\n nodes = sorted(adj.keys())\n return greedy_color_sequential(adj, nodes)\n\n","golden_completion":"def greedy_color_by_degree(adj):\n \"\"\"Color nodes ordered by descending degree, breaking ties by ascending node id.\n Uses smallest available color for each node.\"\"\"\n nodes = sorted(adj.keys(), key=lambda n: (-len(adj.get(n, [])), n))\n return greedy_color_sequential(adj, nodes)\n\n","suffix":"# Simple triangle graph\nadj1 = {0: [1, 2], 1: [0, 2], 2: [0, 1]}\nc1 = greedy_color_by_id(adj1)\nassert c1 == {0: 0, 1: 1, 2: 2}\n\n# Star graph: node 0 connects to 1, 2, 3\nadj2 = {0: [1, 2, 3], 1: [0], 2: [0], 3: [0]}\nc2 = greedy_color_by_degree(adj2)\n# Node 0 has degree 3 (highest), gets color 0 first\n# Nodes 1, 2, 3 have degree 1 each, processed in id order, all get color 1\nassert c2 == {0: 0, 1: 1, 2: 1, 3: 1}, f\u0027Got: {c2}\u0027\n","assertions":"# Path graph: 0-1-2-3\nadj3 = {0: [1], 1: [0, 2], 2: [1, 3], 3: [2]}\nc3 = greedy_color_by_degree(adj3)\n# Nodes 1,2 have degree 2 (highest). Tie-break: 1 first, then 2.\n# Node 1 gets 0, Node 2 gets 0 (not adjacent to 1 OH WAIT they are adjacent)\n# Node 1: color 0. Node 2: neighbor 1 has 0, so color 1.\n# Node 0: neighbor 1 has 0, so color 1. Node 3: neighbor 2 has 1, so color 0.\nassert c3 == {1: 0, 2: 1, 0: 1, 3: 0}, f\u0027Got: {c3}\u0027\n\n# Single node\nadj4 = {5: []}\nassert greedy_color_by_degree(adj4) == {5: 0}\n\n# Complete graph K4\nadj5 = {0: [1,2,3], 1: [0,2,3], 2: [0,1,3], 3: [0,1,2]}\nc5 = greedy_color_by_degree(adj5)\nassert len(set(c5.values())) == 4 # needs 4 colors for K4\n","category":"pattern_matching"} {"id":"34","testsource":"devbench-pattern-matching","language":"python","prefix":"class CountAggregator:\n def __init__(self):\n self.count = 0\n\n def add(self, value, timestamp=None):\n self.count += 1\n\n def result(self):\n return self.count\n\nclass SumAggregator:\n def __init__(self):\n self.total = 0\n\n def add(self, value, timestamp=None):\n self.total += value\n\n def result(self):\n return self.total\n\n","golden_completion":"class WindowedAggregator:\n def __init__(self, reducer, initial, window_size):\n self.reducer, self.initial = reducer, initial\n self.window_size, self.events = window_size, []\n\n def add(self, value, timestamp):\n self.events.append((timestamp, value))\n cutoff = timestamp - self.window_size\n self.events = [(t, v) for t, v in self.events if t \u003e cutoff]\n\n def result(self):\n acc = self.initial\n for _, v in self.events:\n acc = self.reducer(acc, v)\n return acc\n\n","suffix":"c = CountAggregator()\nc.add(10)\nc.add(20)\nassert c.result() == 2\n\ns = SumAggregator()\ns.add(10)\ns.add(20)\nassert s.result() == 30\n\n# WindowedAggregator: custom reducer + time window\n# Window of 10 — events with timestamp \u003c= (current - 10) are expired\nw = WindowedAggregator(lambda acc, v: acc + v, 0, 10)\nw.add(5, timestamp=1)\nw.add(3, timestamp=5)\nw.add(7, timestamp=8)\nassert w.result() == 15, f\u0027All in window: {w.result()}\u0027\n\nw.add(2, timestamp=12)\n# timestamp 12, window=10, cutoff=2. Event at t=1 is expired (1 \u003c= 2).\nassert w.result() == 12, f\u0027After expiry: {w.result()}\u0027\n\nw.add(1, timestamp=20)\n# timestamp 20, cutoff=10. Events at t=5,8 are expired (\u003c=10). Keep t=12,t=20.\nassert w.result() == 3, f\u0027After more expiry: {w.result()}\u0027\n","assertions":"# Test with max reducer\nw2 = WindowedAggregator(lambda acc, v: max(acc, v), float(\u0027-inf\u0027), 5)\nw2.add(10, timestamp=1)\nw2.add(20, timestamp=3)\nw2.add(5, timestamp=4)\nassert w2.result() == 20, f\u0027Max should be 20, got: {w2.result()}\u0027\n\nw2.add(3, timestamp=7)\n# cutoff=2. t=1 expired. Keep t=3(20), t=4(5), t=7(3)\nassert w2.result() == 20, f\u0027Max after partial expiry: {w2.result()}\u0027\n\nw2.add(1, timestamp=9)\n# cutoff=4. t=3 and t=4 expired (not \u003e 4). Keep t=7(3), t=9(1)\nassert w2.result() == 3, f\u0027Max after more expiry: {w2.result()}\u0027\n\n# Empty after all expire\nw3 = WindowedAggregator(lambda acc, v: acc + v, 0, 2)\nw3.add(100, timestamp=1)\nw3.add(200, timestamp=10)\n# cutoff=8. t=1 expired. Only t=10(200).\nassert w3.result() == 200, f\u0027Got: {w3.result()}\u0027\n","category":"pattern_matching"} {"id":"35","testsource":"devbench-pattern-matching","language":"python","prefix":"def build_failure(pattern):\n \"\"\"Build KMP failure/prefix function.\"\"\"\n m = len(pattern)\n fail = [0] * m\n k = 0\n for i in range(1, m):\n while k \u003e 0 and pattern[k] != pattern[i]:\n k = fail[k - 1]\n if pattern[k] == pattern[i]:\n k += 1\n fail[i] = k\n return fail\n\ndef kmp_search(text, pattern):\n \"\"\"Find all occurrences of pattern in text. Returns list of start indices.\"\"\"\n if not pattern:\n return []\n fail = build_failure(pattern)\n results = []\n k = 0\n for i in range(len(text)):\n while k \u003e 0 and pattern[k] != text[i]:\n k = fail[k - 1]\n if pattern[k] == text[i]:\n k += 1\n if k == len(pattern):\n results.append(i - len(pattern) + 1)\n k = fail[k - 1]\n return results\n\n","golden_completion":"def multi_kmp_search(text, patterns):\n \"\"\"Find all occurrences of each pattern in text using KMP.\n Returns dict mapping each pattern to sorted list of start indices.\"\"\"\n result = {}\n for pattern in patterns:\n result[pattern] = kmp_search(text, pattern)\n return result\n\n","suffix":"assert kmp_search(\u0027abcabcabc\u0027, \u0027abc\u0027) == [0, 3, 6]\nassert kmp_search(\u0027aaaaaa\u0027, \u0027aa\u0027) == [0, 1, 2, 3, 4]\nassert kmp_search(\u0027hello\u0027, \u0027xyz\u0027) == []\n\nr = multi_kmp_search(\u0027abcabcabc\u0027, [\u0027abc\u0027, \u0027cab\u0027, \u0027xyz\u0027])\nassert r == {\u0027abc\u0027: [0, 3, 6], \u0027cab\u0027: [2, 5], \u0027xyz\u0027: []}, f\u0027Got: {r}\u0027\n","assertions":"r2 = multi_kmp_search(\u0027aaaa\u0027, [\u0027a\u0027, \u0027aa\u0027, \u0027aaa\u0027])\nassert r2 == {\u0027a\u0027: [0, 1, 2, 3], \u0027aa\u0027: [0, 1, 2], \u0027aaa\u0027: [0, 1]}, f\u0027Got: {r2}\u0027\nr3 = multi_kmp_search(\u0027\u0027, [\u0027a\u0027])\nassert r3 == {\u0027a\u0027: []}\nr4 = multi_kmp_search(\u0027abab\u0027, [])\nassert r4 == {}\nr5 = multi_kmp_search(\u0027xyzxyz\u0027, [\u0027xyz\u0027, \u0027yz\u0027, \u0027z\u0027])\nassert r5 == {\u0027xyz\u0027: [0, 3], \u0027yz\u0027: [1, 4], \u0027z\u0027: [2, 5]}\n","category":"pattern_matching"} {"id":"36","testsource":"devbench-pattern-matching","language":"python","prefix":"MONTH_LENGTHS = [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 35]\n\ndef days_in_month(month):\n \"\"\"Return days in month (1-indexed, 1-12).\"\"\"\n return MONTH_LENGTHS[month - 1]\n\ndef days_in_year():\n return sum(MONTH_LENGTHS)\n\ndef date_to_day_of_year(year, month, day):\n \"\"\"Convert (year, month, day) to day-of-year (1-indexed).\"\"\"\n total = 0\n for m in range(1, month):\n total += days_in_month(m)\n total += day\n return total\n\ndef day_of_year_to_date(year, doy):\n \"\"\"Convert day-of-year back to (year, month, day).\"\"\"\n remaining = doy\n for m in range(1, 13):\n if remaining \u003c= days_in_month(m):\n return (year, m, remaining)\n remaining -= days_in_month(m)\n raise ValueError(f\u0027Invalid day of year: {doy}\u0027)\n\n","golden_completion":"def add_days(year, month, day, n):\n \"\"\"Add n days to date (year, month, day) in our custom calendar.\n n can be negative.\"\"\"\n doy = date_to_day_of_year(year, month, day)\n total_day = doy + n\n y = year\n while total_day \u003e days_in_year():\n total_day -= days_in_year()\n y += 1\n while total_day \u003c= 0:\n total_day += days_in_year()\n y -= 1\n return day_of_year_to_date(y, total_day)\n\n","suffix":"assert days_in_month(1) == 30\nassert days_in_month(12) == 35\nassert days_in_year() == 365\n\nassert date_to_day_of_year(2000, 1, 1) == 1\nassert date_to_day_of_year(2000, 2, 1) == 31\nassert day_of_year_to_date(2000, 31) == (2000, 2, 1)\n\n# Add days tests\nassert add_days(2000, 1, 1, 0) == (2000, 1, 1)\nassert add_days(2000, 1, 1, 29) == (2000, 1, 30)\nassert add_days(2000, 1, 1, 30) == (2000, 2, 1)\nassert add_days(2000, 12, 35, 1) == (2001, 1, 1), f\u0027Got: {add_days(2000, 12, 35, 1)}\u0027\n","assertions":"# Cross-year backward\nassert add_days(2001, 1, 1, -1) == (2000, 12, 35)\n# Large jumps\nassert add_days(2000, 1, 1, 365) == (2001, 1, 1)\nassert add_days(2000, 1, 1, 730) == (2002, 1, 1)\n# Within last month (35-day month)\nassert add_days(2000, 12, 1, 34) == (2000, 12, 35)\nassert add_days(2000, 12, 30, 5) == (2000, 12, 35)\nassert add_days(2000, 12, 30, 6) == (2001, 1, 1)\n# Negative\nassert add_days(2000, 3, 1, -1) == (2000, 2, 30)\n","category":"pattern_matching"} {"id":"37","testsource":"devbench-pattern-matching","language":"python","prefix":"def normalize_minmax(values, new_min=0.0, new_max=1.0):\n \"\"\"Scale values to [new_min, new_max] range.\"\"\"\n if not values:\n return []\n old_min = min(values)\n old_max = max(values)\n if old_min == old_max:\n return [0.5 * (new_min + new_max)] * len(values)\n return [\n new_min + (v - old_min) / (old_max - old_min) * (new_max - new_min)\n for v in values\n ]\n\ndef normalize_zscore(values):\n \"\"\"Z-score normalization: (x - mean) / std.\"\"\"\n if not values:\n return []\n n = len(values)\n mean = sum(values) / n\n variance = sum((v - mean) ** 2 for v in values) / n\n std = variance ** 0.5\n if std == 0:\n return [0.0] * n\n return [(v - mean) / std for v in values]\n\n","golden_completion":"def normalize_rank(values):\n \"\"\"Rank-based normalization: maps each value to its rank percentile.\n Ties get averaged rank. Output in [0, 1].\"\"\"\n if not values:\n return []\n n = len(values)\n if n == 1:\n return [0.5]\n sorted_vals = sorted(enumerate(values), key=lambda x: x[1])\n ranks = [0.0] * n\n i = 0\n while i \u003c n:\n j = i\n while j \u003c n - 1 and sorted_vals[j + 1][1] == sorted_vals[i][1]:\n j += 1\n avg_rank = (i + j) / 2.0\n for k in range(i, j + 1):\n ranks[sorted_vals[k][0]] = avg_rank / (n - 1)\n i = j + 1\n return ranks\n\n","suffix":"assert normalize_minmax([0, 5, 10]) == [0.0, 0.5, 1.0]\nassert normalize_minmax([]) == []\n\nzs = normalize_zscore([2, 4, 4, 4, 5, 5, 7, 9])\nassert abs(zs[0] - (-1.5)) \u003c 0.1 # roughly\n\n# Rank normalization\nr = normalize_rank([10, 30, 20, 40])\nassert r == [0.0, 0.6666666666666666, 0.3333333333333333, 1.0], f\u0027Got: {r}\u0027\n","assertions":"assert normalize_rank([]) == []\nassert normalize_rank([42]) == [0.5]\n# Ties: [5, 5, 10] -\u003e ranks [0.5, 0.5, 2] -\u003e normalized [0.25, 0.25, 1.0]\nr2 = normalize_rank([5, 5, 10])\nassert abs(r2[0] - 0.25) \u003c 1e-9\nassert abs(r2[1] - 0.25) \u003c 1e-9\nassert abs(r2[2] - 1.0) \u003c 1e-9\n\n# All same values\nr3 = normalize_rank([3, 3, 3])\nassert all(abs(v - 0.5) \u003c 1e-9 for v in r3)\n\n# Descending input\nr4 = normalize_rank([100, 50, 0])\nassert abs(r4[0] - 1.0) \u003c 1e-9\nassert abs(r4[1] - 0.5) \u003c 1e-9\nassert abs(r4[2] - 0.0) \u003c 1e-9\n","category":"pattern_matching"} {"id":"38","testsource":"devbench-pattern-matching","language":"python","prefix":"class TrieNode:\n def __init__(self):\n self.children = {}\n self.is_end = False\n\nclass Trie:\n def __init__(self):\n self.root = TrieNode()\n\n def insert(self, word):\n node = self.root\n for ch in word:\n if ch not in node.children:\n node.children[ch] = TrieNode()\n node = node.children[ch]\n node.is_end = True\n\n def search_exact(self, word):\n node = self.root\n for ch in word:\n if ch not in node.children:\n return False\n node = node.children[ch]\n return node.is_end\n\n def starts_with(self, prefix):\n node = self.root\n for ch in prefix:\n if ch not in node.children:\n return False\n node = node.children[ch]\n return True\n\n","golden_completion":" def search_wildcard(self, pattern):\n \"\"\"Search with \u0027.\u0027 matching any single character.\"\"\"\n def _search(node, i):\n if i == len(pattern):\n return node.is_end\n ch = pattern[i]\n if ch == \u0027.\u0027:\n for child in node.children.values():\n if _search(child, i + 1):\n return True\n return False\n else:\n if ch not in node.children:\n return False\n return _search(node.children[ch], i + 1)\n return _search(self.root, 0)\n\n","suffix":"t = Trie()\nfor w in [\u0027cat\u0027, \u0027car\u0027, \u0027card\u0027, \u0027dog\u0027, \u0027dot\u0027, \u0027dove\u0027]:\n t.insert(w)\n\nassert t.search_exact(\u0027cat\u0027) == True\nassert t.search_exact(\u0027ca\u0027) == False\nassert t.starts_with(\u0027ca\u0027) == True\n\nassert t.search_wildcard(\u0027cat\u0027) == True\nassert t.search_wildcard(\u0027c.t\u0027) == True # matches \u0027cat\u0027\nassert t.search_wildcard(\u0027c.r\u0027) == True # matches \u0027car\u0027\nassert t.search_wildcard(\u0027...\u0027) == True # matches \u0027cat\u0027, \u0027car\u0027, \u0027dog\u0027, \u0027dot\u0027\nassert t.search_wildcard(\u0027d.g\u0027) == True # matches \u0027dog\u0027\nassert t.search_wildcard(\u0027d..e\u0027) == True # matches \u0027dove\u0027\nassert t.search_wildcard(\u0027....\u0027) == True # matches \u0027card\u0027, \u0027dove\u0027\nassert t.search_wildcard(\u0027.....\u0027) == False # no 5-letter words\n","assertions":"t2 = Trie()\nt2.insert(\u0027a\u0027)\nt2.insert(\u0027ab\u0027)\nassert t2.search_wildcard(\u0027.\u0027) == True\nassert t2.search_wildcard(\u0027..\u0027) == True\nassert t2.search_wildcard(\u0027...\u0027) == False\nassert t2.search_wildcard(\u0027a\u0027) == True\nassert t2.search_wildcard(\u0027b\u0027) == False\n\nt3 = Trie()\nt3.insert(\u0027abc\u0027)\nassert t3.search_wildcard(\u0027a.c\u0027) == True\nassert t3.search_wildcard(\u0027.b.\u0027) == True\nassert t3.search_wildcard(\u0027...\u0027) == True\nassert t3.search_wildcard(\u0027..\u0027) == False\nassert t3.search_wildcard(\u0027ab\u0027) == False\n","category":"pattern_matching"} {"id":"39","testsource":"devbench-pattern-matching","language":"python","prefix":"def merge_two_sorted(a, b):\n \"\"\"Merge two ascending-sorted lists into one ascending-sorted list.\"\"\"\n result = []\n i = j = 0\n while i \u003c len(a) and j \u003c len(b):\n if a[i] \u003c= b[j]:\n result.append(a[i])\n i += 1\n else:\n result.append(b[j])\n j += 1\n result.extend(a[i:])\n result.extend(b[j:])\n return result\n\ndef merge_two_sorted_desc(a, b):\n \"\"\"Merge two descending-sorted lists into one descending-sorted list.\"\"\"\n result = []\n i = j = 0\n while i \u003c len(a) and j \u003c len(b):\n if a[i] \u003e= b[j]:\n result.append(a[i])\n i += 1\n else:\n result.append(b[j])\n j += 1\n result.extend(a[i:])\n result.extend(b[j:])\n return result\n\n","golden_completion":"def merge_k_sorted(lists, key=None):\n \"\"\"Merge k sorted lists using a key function for comparison.\n Each list must be sorted according to the same key function.\n If key is None, compare elements directly (ascending).\"\"\"\n if not lists:\n return []\n if key is None:\n key = lambda x: x\n # Use sequential merge approach\n result = lists[0][:]\n for i in range(1, len(lists)):\n merged = []\n a, b = result, lists[i]\n ai = bi = 0\n while ai \u003c len(a) and bi \u003c len(b):\n if key(a[ai]) \u003c= key(b[bi]):\n merged.append(a[ai])\n ai += 1\n else:\n merged.append(b[bi])\n bi += 1\n merged.extend(a[ai:])\n merged.extend(b[bi:])\n result = merged\n return result\n\n","suffix":"assert merge_two_sorted([1, 3, 5], [2, 4, 6]) == [1, 2, 3, 4, 5, 6]\nassert merge_two_sorted_desc([5, 3, 1], [6, 4, 2]) == [6, 5, 4, 3, 2, 1]\n\n# Merge 3 lists ascending (default key)\nr = merge_k_sorted([[1, 4, 7], [2, 5, 8], [3, 6, 9]])\nassert r == [1, 2, 3, 4, 5, 6, 7, 8, 9], f\u0027Got: {r}\u0027\n\n# Merge with custom key: sort by absolute value\n# Each input list is already sorted by abs: |-1|=1, |3|=3, |-5|=5 and |2|=2, |-3|=3, |7|=7\nr2 = merge_k_sorted([[-1, 3, -5], [2, -3, 7]], key=abs)\nassert r2 == [-1, 2, 3, -3, -5, 7], f\u0027Got: {r2}\u0027\n","assertions":"# Empty cases\nassert merge_k_sorted([]) == []\nassert merge_k_sorted([[]]) == []\nassert merge_k_sorted([[], [1, 2], []]) == [1, 2]\n\n# Single list\nassert merge_k_sorted([[5, 10, 15]]) == [5, 10, 15]\n\n# Key function: sort by string length\nr3 = merge_k_sorted([[\u0027a\u0027, \u0027cc\u0027, \u0027ddd\u0027], [\u0027bb\u0027, \u0027eee\u0027]], key=len)\n# \u0027cc\u0027 (len 2) from list 1 and \u0027bb\u0027 (len 2) from list 2: equal keys, list 1 first\nassert r3 == [\u0027a\u0027, \u0027cc\u0027, \u0027bb\u0027, \u0027ddd\u0027, \u0027eee\u0027], f\u0027Got: {r3}\u0027\n\n# Many lists\nr4 = merge_k_sorted([[i] for i in range(10)])\nassert r4 == list(range(10))\n","category":"pattern_matching"} {"id":"40","testsource":"devbench-pattern-matching","language":"python","prefix":"class SimpleSet:\n def __init__(self):\n self._data = set()\n\n def add(self, item):\n self._data.add(item)\n\n def remove(self, item):\n self._data.discard(item)\n\n def __contains__(self, item):\n return item in self._data\n\n def to_list(self):\n return list(self._data)\n\nclass SortedSet:\n def __init__(self):\n self._data = []\n\n def add(self, item):\n if item not in self._data:\n import bisect\n bisect.insort(self._data, item)\n\n def remove(self, item):\n if item in self._data:\n self._data.remove(item)\n\n def __contains__(self, item):\n return item in self._data\n\n def to_list(self):\n return list(self._data)\n\n","golden_completion":"class OrderedSet:\n def __init__(self):\n self._data = {}\n self._counter = 0\n\n def add(self, item):\n if item not in self._data:\n self._data[item] = self._counter\n self._counter += 1\n\n def remove(self, item):\n self._data.pop(item, None)\n\n def __contains__(self, item):\n return item in self._data\n\n def to_list(self):\n return sorted(self._data.keys(), key=lambda x: self._data[x])\n\n","suffix":"ss = SimpleSet()\nss.add(3); ss.add(1); ss.add(2)\nassert 1 in ss and 2 in ss and 3 in ss\n\nso = SortedSet()\nso.add(3); so.add(1); so.add(2)\nassert so.to_list() == [1, 2, 3]\n\n# OrderedSet: maintains insertion order\nos1 = OrderedSet()\nos1.add(\u0027b\u0027); os1.add(\u0027a\u0027); os1.add(\u0027c\u0027)\nassert os1.to_list() == [\u0027b\u0027, \u0027a\u0027, \u0027c\u0027], f\u0027Got: {os1.to_list()}\u0027\n\nos1.remove(\u0027a\u0027)\nassert os1.to_list() == [\u0027b\u0027, \u0027c\u0027], f\u0027After remove: {os1.to_list()}\u0027\n\n# Re-adding \u0027a\u0027 puts it at the END, not its original position\nos1.add(\u0027a\u0027)\nassert os1.to_list() == [\u0027b\u0027, \u0027c\u0027, \u0027a\u0027], f\u0027After re-add: {os1.to_list()}\u0027\n\nassert \u0027a\u0027 in os1\nassert \u0027x\u0027 not in os1\n","assertions":"os2 = OrderedSet()\nos2.add(1); os2.add(2); os2.add(3); os2.add(4); os2.add(5)\nos2.remove(3)\nos2.remove(1)\nassert os2.to_list() == [2, 4, 5], f\u0027Got: {os2.to_list()}\u0027\n\nos2.add(3)\nassert os2.to_list() == [2, 4, 5, 3], f\u0027Got: {os2.to_list()}\u0027\n\n# Adding existing element should not change order\nos2.add(4)\nassert os2.to_list() == [2, 4, 5, 3], f\u0027Got: {os2.to_list()}\u0027\n\n# Empty set\nos3 = OrderedSet()\nassert os3.to_list() == []\nos3.add(\u0027x\u0027)\nos3.remove(\u0027x\u0027)\nassert os3.to_list() == []\nos3.remove(\u0027nonexistent\u0027) # Should not raise\n","category":"pattern_matching"} {"id":"41","testsource":"devbench-pattern-matching","language":"python","prefix":"def stack_push(stack, value):\n return stack + [value]\n\ndef stack_pop(stack):\n if not stack:\n raise IndexError(\u0027empty stack\u0027)\n return stack[:-1], stack[-1]\n\ndef stack_peek(stack):\n if not stack:\n raise IndexError(\u0027empty stack\u0027)\n return stack[-1]\n\ndef stack_apply_top2(stack, func):\n s, b = stack_pop(stack)\n s, a = stack_pop(s)\n return stack_push(s, func(a, b))\n\n","golden_completion":"def stack_eval_rpn(tokens):\n ops = {\u0027+\u0027: lambda a, b: a + b, \u0027-\u0027: lambda a, b: a - b,\n \u0027*\u0027: lambda a, b: a * b, \u0027/\u0027: lambda a, b: a / b}\n stack = []\n for token in tokens:\n if token in ops:\n stack = stack_apply_top2(stack, ops[token])\n else:\n stack = stack_push(stack, float(token))\n _, result = stack_pop(stack)\n return result\n\n","suffix":"assert stack_push([], 1) == [1]\nassert stack_pop([1, 2]) == ([1], 2)\nassert stack_peek([1, 2]) == 2\nassert stack_apply_top2([10, 3, 7], lambda a, b: a + b) == [10, 10]\n\n# RPN: \"3 4 + 2 *\" = (3+4)*2 = 14\nresult = stack_eval_rpn([\u00273\u0027, \u00274\u0027, \u0027+\u0027, \u00272\u0027, \u0027*\u0027])\nassert result == 14.0, f\u0027Got: {result}\u0027\n# \"5 1 2 + 4 * + 3 -\" = 5 + (1+2)*4 - 3 = 14\nresult2 = stack_eval_rpn([\u00275\u0027, \u00271\u0027, \u00272\u0027, \u0027+\u0027, \u00274\u0027, \u0027*\u0027, \u0027+\u0027, \u00273\u0027, \u0027-\u0027])\nassert result2 == 14.0, f\u0027Got: {result2}\u0027\n","assertions":"assert stack_eval_rpn([\u002742\u0027]) == 42.0\nassert stack_eval_rpn([\u00276\u0027, \u00272\u0027, \u0027/\u0027]) == 3.0\nassert stack_eval_rpn([\u002710\u0027, \u00273\u0027, \u0027-\u0027]) == 7.0\nassert stack_eval_rpn([\u00272\u0027, \u00273\u0027, \u0027+\u0027, \u00274\u0027, \u00275\u0027, \u0027+\u0027, \u0027*\u0027]) == 45.0\n","category":"pattern_matching"} {"id":"42","testsource":"devbench-pattern-matching","language":"python","prefix":"def format_timestamp(year, month, day, hour, minute, second):\n return f\u0027{day:02d}-{month:02d}-{year:04d} {hour:02d}:{minute:02d}:{second:02d}\u0027\n\nSEVERITY_SYMBOLS = {\u0027debug\u0027: \u0027.\u0027, \u0027info\u0027: \u0027*\u0027, \u0027warning\u0027: \u0027!\u0027, \u0027error\u0027: \u0027#\u0027, \u0027critical\u0027: \u0027@\u0027}\n\ndef format_log_simple(severity, message, year, month, day, hour, minute, second):\n ts = format_timestamp(year, month, day, hour, minute, second)\n sym = SEVERITY_SYMBOLS.get(severity, \u0027?\u0027)\n return f\u0027[{ts}] {sym} {message}\u0027\n\ndef format_log_with_source(severity, source, message, year, month, day, hour, minute, second):\n ts = format_timestamp(year, month, day, hour, minute, second)\n sym = SEVERITY_SYMBOLS.get(severity, \u0027?\u0027)\n return f\u0027[{ts}] {sym} [{source}] {message}\u0027\n\n","golden_completion":"def format_log_structured(severity, source, message, fields, year, month, day, hour, minute, second):\n ts = format_timestamp(year, month, day, hour, minute, second)\n sym = SEVERITY_SYMBOLS.get(severity, \u0027?\u0027)\n field_parts = \u0027 \u0027.join(f\u0027{k}={v}\u0027 for k, v in sorted(fields.items()))\n base = f\u0027[{ts}] {sym} [{source}] {message}\u0027\n if field_parts:\n return f\u0027{base} | {field_parts}\u0027\n return base\n\n","suffix":"assert format_timestamp(2024, 1, 5, 9, 30, 0) == \u002705-01-2024 09:30:00\u0027\nassert format_log_simple(\u0027info\u0027, \u0027started\u0027, 2024, 1, 5, 9, 30, 0) == \u0027[05-01-2024 09:30:00] * started\u0027\nassert format_log_with_source(\u0027error\u0027, \u0027db\u0027, \u0027fail\u0027, 2024, 3, 15, 12, 0, 0) == \u0027[15-03-2024 12:00:00] # [db] fail\u0027\n\nr = format_log_structured(\u0027warning\u0027, \u0027api\u0027, \u0027slow\u0027, {\u0027latency\u0027: \u0027200ms\u0027, \u0027endpoint\u0027: \u0027/users\u0027}, 2024, 6, 1, 8, 0, 0)\nassert r == \u0027[01-06-2024 08:00:00] ! [api] slow | endpoint=/users latency=200ms\u0027, f\u0027Got: {r}\u0027\n","assertions":"r2 = format_log_structured(\u0027debug\u0027, \u0027cache\u0027, \u0027miss\u0027, {}, 2024, 12, 25, 0, 0, 0)\nassert r2 == \u0027[25-12-2024 00:00:00] . [cache] miss\u0027, f\u0027Got: {r2}\u0027\nr3 = format_log_structured(\u0027critical\u0027, \u0027sys\u0027, \u0027oom\u0027, {\u0027pid\u0027: \u0027123\u0027}, 2024, 1, 1, 0, 0, 0)\nassert r3 == \u0027[01-01-2024 00:00:00] @ [sys] oom | pid=123\u0027, f\u0027Got: {r3}\u0027\nr4 = format_log_structured(\u0027info\u0027, \u0027app\u0027, \u0027req\u0027, {\u0027z\u0027: \u00271\u0027, \u0027a\u0027: \u00272\u0027}, 2024, 7, 4, 12, 30, 45)\nassert r4 == \u0027[04-07-2024 12:30:45] * [app] req | a=2 z=1\u0027, f\u0027Got: {r4}\u0027\n","category":"pattern_matching"} {"id":"43","testsource":"devbench-pattern-matching","language":"python","prefix":"class SimplePool:\n def __init__(self, factory, max_size):\n self.factory = factory\n self.max_size = max_size\n self.available = []\n self.total_created = 0\n\n def acquire(self):\n if self.available:\n return self.available.pop()\n if self.total_created \u003c self.max_size:\n self.total_created += 1\n return self.factory()\n raise RuntimeError(\u0027pool exhausted\u0027)\n\n def release(self, conn):\n self.available.append(conn)\n\nclass TrackedPool(SimplePool):\n def __init__(self, factory, max_size):\n super().__init__(factory, max_size)\n self.in_use = set()\n\n def acquire(self):\n conn = super().acquire()\n self.in_use.add(id(conn))\n return conn\n\n def release(self, conn):\n self.in_use.discard(id(conn))\n super().release(conn)\n\n","golden_completion":"class HealthCheckedPool(TrackedPool):\n def __init__(self, factory, max_size, health_check):\n super().__init__(factory, max_size)\n self.health_check = health_check\n\n def acquire(self):\n while self.available:\n conn = self.available.pop()\n if self.health_check(conn):\n self.in_use.add(id(conn))\n return conn\n self.total_created -= 1\n if self.total_created \u003c self.max_size:\n self.total_created += 1\n conn = self.factory()\n self.in_use.add(id(conn))\n return conn\n raise RuntimeError(\u0027pool exhausted\u0027)\n\n","suffix":"# Simple pool: LIFO order\nsp = SimplePool(lambda: {\u0027id\u0027: sp.total_created}, 3)\nc1 = sp.acquire()\nc2 = sp.acquire()\nsp.release(c1)\nsp.release(c2)\nc3 = sp.acquire()\nassert c3 is c2, \u0027SimplePool should be LIFO\u0027\n\n# HealthChecked pool: skip unhealthy, create new if needed\ncall_count = [0]\ndef factory():\n call_count[0] += 1\n return {\u0027id\u0027: call_count[0], \u0027healthy\u0027: True}\n\ndef check(conn):\n return conn.get(\u0027healthy\u0027, False)\n\nhp = HealthCheckedPool(factory, 3, check)\nconn1 = hp.acquire()\nconn2 = hp.acquire()\nhp.release(conn1)\nhp.release(conn2)\n# Mark conn2 (top of stack) as unhealthy\nconn2[\u0027healthy\u0027] = False\nconn3 = hp.acquire()\n# Should skip conn2, return conn1\nassert conn3 is conn1, f\u0027Should skip unhealthy conn2 and return conn1\u0027\nassert hp.total_created == 1, f\u0027Unhealthy conn discarded, total_created should be 1 not {hp.total_created}\u0027\n","assertions":"hp2 = HealthCheckedPool(lambda: {\u0027ok\u0027: True}, 2, lambda c: c.get(\u0027ok\u0027, False))\nc1 = hp2.acquire()\nc2 = hp2.acquire()\nhp2.release(c1)\nhp2.release(c2)\nc1[\u0027ok\u0027] = False\nc2[\u0027ok\u0027] = False\n# Both unhealthy, should create new\nc3 = hp2.acquire()\nassert c3 is not c1 and c3 is not c2\n# Pool had 2 created, discarded 2, created 1 new =\u003e total_created should be 1\nassert hp2.total_created == 1, f\u0027Got total_created={hp2.total_created}\u0027\n\nhp3 = HealthCheckedPool(lambda: {\u0027ok\u0027: True}, 1, lambda c: c[\u0027ok\u0027])\nc = hp3.acquire()\nhp3.release(c)\nc[\u0027ok\u0027] = False\nc2 = hp3.acquire()\nassert c2 is not c, \u0027Should create new conn when unhealthy one discarded\u0027\nassert hp3.total_created == 1\n","category":"pattern_matching"} {"id":"44","testsource":"devbench-pattern-matching","language":"python","prefix":"class CachedProperty:\n def __init__(self, func):\n self.func = func\n self.attr_name = \u0027_cached_\u0027 + func.__name__\n\n def __get__(self, obj, objtype=None):\n if obj is None:\n return self\n if not hasattr(obj, self.attr_name):\n setattr(obj, self.attr_name, self.func(obj))\n return getattr(obj, self.attr_name)\n\nclass DependentCachedProperty:\n def __init__(self, func, dependencies):\n self.func = func\n self.attr_name = \u0027_cached_\u0027 + func.__name__\n self.version_attr = \u0027_version_\u0027 + func.__name__\n self.dependencies = dependencies\n\n def __get__(self, obj, objtype=None):\n if obj is None:\n return self\n current_version = getattr(obj, \u0027_invalidation_counter\u0027, 0)\n stored_version = getattr(obj, self.version_attr, -1)\n if stored_version != current_version:\n setattr(obj, self.attr_name, self.func(obj))\n setattr(obj, self.version_attr, current_version)\n return getattr(obj, self.attr_name)\n\n","golden_completion":"class Invalidatable:\n _invalidation_counter = 0\n\n def invalidate(self, *names):\n if not names:\n self._invalidation_counter += 1\n else:\n for name in names:\n attr = \u0027_cached_\u0027 + name\n if hasattr(self, attr):\n delattr(self, attr)\n ver_attr = \u0027_version_\u0027 + name\n if hasattr(self, ver_attr):\n delattr(self, ver_attr)\n\n","suffix":"class Config(Invalidatable):\n def __init__(self, base_url, port):\n self._base_url = base_url\n self._port = port\n\n @CachedProperty\n def base_url(self):\n return self._base_url.rstrip(\u0027/\u0027)\n\n url = DependentCachedProperty(lambda self: f\u0027{self._base_url.rstrip(\"/\")}:{self._port}\u0027, [\u0027base_url\u0027])\n\nc = Config(\u0027http://example.com/\u0027, 8080)\nassert c.base_url == \u0027http://example.com\u0027\nassert c.base_url == \u0027http://example.com\u0027 # cached\n\nassert c.url == \u0027http://example.com:8080\u0027\nc._base_url = \u0027http://new.com\u0027\nc._port = 9090\n# base_url is CachedProperty (not version-aware), still cached\nassert c.base_url == \u0027http://example.com\u0027\nc.invalidate(\u0027base_url\u0027)\nassert c.base_url == \u0027http://new.com\u0027\n# url is DependentCachedProperty, invalidate all\nc.invalidate()\nassert c.url == \u0027http://new.com:9090\u0027\n","assertions":"c2 = Config(\u0027http://a.com/\u0027, 80)\nassert c2.url == \u0027http://a.com:80\u0027\nc2._port = 443\nc2.invalidate()\nassert c2.url == \u0027http://a.com:443\u0027\n\n# Selective invalidation\nc3 = Config(\u0027http://b.com/\u0027, 80)\nassert c3.base_url == \u0027http://b.com\u0027\nassert c3.url == \u0027http://b.com:80\u0027\nc3._base_url = \u0027http://c.com\u0027\nc3.invalidate(\u0027base_url\u0027)\nassert c3.base_url == \u0027http://c.com\u0027\n# url not invalidated by name, but next global invalidate catches it\nassert c3.url == \u0027http://b.com:80\u0027 # still old\nc3.invalidate()\nassert c3.url == \u0027http://c.com:80\u0027\n","category":"pattern_matching"} {"id":"45","testsource":"devbench-pattern-matching","language":"python","prefix":"class StateMachine:\n def __init__(self):\n self.transitions = {}\n self.max_visits = {}\n\n def add_transition(self, from_state, to_state):\n if from_state not in self.transitions:\n self.transitions[from_state] = set()\n self.transitions[from_state].add(to_state)\n\n def set_max_visits(self, state, max_count):\n self.max_visits[state] = max_count\n\n def can_transition(self, from_state, to_state):\n return to_state in self.transitions.get(from_state, set())\n\n","golden_completion":" def validate_path(self, path):\n if not path:\n return True, {}\n visit_counts = {}\n for state in path:\n visit_counts[state] = visit_counts.get(state, 0) + 1\n if state in self.max_visits and visit_counts[state] \u003e self.max_visits[state]:\n return False, visit_counts\n for i in range(len(path) - 1):\n if not self.can_transition(path[i], path[i + 1]):\n return False, visit_counts\n return True, visit_counts\n\n","suffix":"sm = StateMachine()\nsm.add_transition(\u0027idle\u0027, \u0027running\u0027)\nsm.add_transition(\u0027running\u0027, \u0027paused\u0027)\nsm.add_transition(\u0027paused\u0027, \u0027running\u0027)\nsm.add_transition(\u0027running\u0027, \u0027stopped\u0027)\nsm.add_transition(\u0027paused\u0027, \u0027stopped\u0027)\nsm.set_max_visits(\u0027paused\u0027, 2)\n\nassert sm.can_transition(\u0027idle\u0027, \u0027running\u0027) == True\nassert sm.can_transition(\u0027idle\u0027, \u0027stopped\u0027) == False\n\nvalid, counts = sm.validate_path([\u0027idle\u0027, \u0027running\u0027, \u0027paused\u0027, \u0027running\u0027, \u0027stopped\u0027])\nassert valid == True, f\u0027Should be valid, counts={counts}\u0027\nassert counts == {\u0027idle\u0027: 1, \u0027running\u0027: 2, \u0027paused\u0027: 1, \u0027stopped\u0027: 1}\n\n# Invalid: no transition from idle to stopped\nvalid2, _ = sm.validate_path([\u0027idle\u0027, \u0027stopped\u0027])\nassert valid2 == False\n\n# Invalid: paused visited 3 times (max is 2)\nvalid3, counts3 = sm.validate_path([\u0027idle\u0027, \u0027running\u0027, \u0027paused\u0027, \u0027running\u0027, \u0027paused\u0027, \u0027running\u0027, \u0027paused\u0027, \u0027running\u0027, \u0027stopped\u0027])\nassert valid3 == False, f\u0027Should be invalid due to max visits, counts={counts3}\u0027\n","assertions":"valid4, counts4 = sm.validate_path([])\nassert valid4 == True\nassert counts4 == {}\n\nvalid5, counts5 = sm.validate_path([\u0027idle\u0027])\nassert valid5 == True\nassert counts5 == {\u0027idle\u0027: 1}\n\n# Exactly at max_visits limit (2 pauses) should be valid\nvalid6, counts6 = sm.validate_path([\u0027idle\u0027, \u0027running\u0027, \u0027paused\u0027, \u0027running\u0027, \u0027paused\u0027, \u0027running\u0027, \u0027stopped\u0027])\nassert valid6 == True, f\u0027Got valid={valid6}, counts={counts6}\u0027\nassert counts6[\u0027paused\u0027] == 2\n","category":"pattern_matching"} {"id":"46","testsource":"devbench-pattern-matching","language":"python","prefix":"def parse_length_prefixed(data):\n result = []\n i = 0\n while i \u003c len(data):\n length = 0\n while i \u003c len(data) and data[i].isdigit():\n length = length * 10 + int(data[i])\n i += 1\n if i \u003e= len(data) or data[i] != \u0027:\u0027:\n break\n i += 1 # skip \u0027:\u0027\n chunk = data[i:i + length]\n result.append(chunk)\n i += length\n return result\n\ndef encode_length_prefixed(chunks):\n return \u0027\u0027.join(f\u0027{len(c)}:{c}\u0027 for c in chunks)\n\n","golden_completion":"def parse_hex_chunked(data):\n result, i = [], 0\n while i \u003c len(data):\n hex_str = \u0027\u0027\n while i \u003c len(data) and data[i] in \u00270123456789abcdefABCDEF\u0027:\n hex_str += data[i]; i += 1\n if not hex_str or i \u003e= len(data) or data[i] != \u0027:\u0027: break\n length = int(hex_str, 16); i += 1\n result.append(data[i:i + length]); i += length\n if i \u003c len(data) and data[i] == \u0027;\u0027: i += 1\n return result\n\ndef encode_hex_chunked(chunks):\n return \u0027\u0027.join(f\u0027{len(c):x}:{c};\u0027 for c in chunks)\n\n","suffix":"# Length-prefixed: \"5:hello3:bye\"\nassert parse_length_prefixed(\u00275:hello3:bye\u0027) == [\u0027hello\u0027, \u0027bye\u0027]\nassert encode_length_prefixed([\u0027hi\u0027, \u0027ok\u0027]) == \u00272:hi2:ok\u0027\n\n# Hex-chunked: \"5:hello;3:bye;\" (5 and 3 are hex, semicolon terminated)\nassert parse_hex_chunked(\u00275:hello;3:bye;\u0027) == [\u0027hello\u0027, \u0027bye\u0027]\nassert encode_hex_chunked([\u0027hello\u0027, \u0027bye\u0027]) == \u00275:hello;3:bye;\u0027\n\n# Hex length: \"a\" = 10 decimal\nten_chars = \u0027abcdefghij\u0027\nencoded = encode_hex_chunked([ten_chars])\nassert encoded == f\u0027a:{ten_chars};\u0027, f\u0027Got: {encoded}\u0027\nassert parse_hex_chunked(encoded) == [ten_chars]\n","assertions":"assert parse_hex_chunked(\u0027\u0027) == []\nassert parse_hex_chunked(\u00270:;\u0027) == [\u0027\u0027]\nassert parse_hex_chunked(\u00271:x;\u0027) == [\u0027x\u0027]\n# ff hex = 255 decimal\nbig = \u0027Z\u0027 * 255\nenc = encode_hex_chunked([big])\nassert enc == f\u0027ff:{big};\u0027\nassert parse_hex_chunked(enc) == [big]\n# Multiple chunks with varying hex lengths\nassert parse_hex_chunked(\u00273:abc;A:0123456789;\u0027) == [\u0027abc\u0027, \u00270123456789\u0027]\n# Roundtrip\ndata = [\u0027hello world\u0027, \u0027\u0027, \u0027test\u0027]\nassert parse_hex_chunked(encode_hex_chunked(data)) == data\n","category":"pattern_matching"} {"id":"47","testsource":"devbench-pattern-matching","language":"python","prefix":"def shallow_equals(a, b):\n return a == b\n\ndef deep_equals(a, b):\n if type(a) != type(b):\n return False\n if isinstance(a, dict):\n if set(a.keys()) != set(b.keys()):\n return False\n return all(deep_equals(a[k], b[k]) for k in a)\n if isinstance(a, (list, tuple)):\n if len(a) != len(b):\n return False\n return all(deep_equals(x, y) for x, y in zip(a, b))\n return a == b\n\n","golden_completion":"def deep_equals_approx(a, b, epsilon=1e-9):\n if type(a) != type(b): return False\n if isinstance(a, float): return abs(a - b) \u003c= epsilon\n if isinstance(a, dict):\n if set(a.keys()) != set(b.keys()): return False\n return all(deep_equals_approx(a[k], b[k], epsilon) for k in a)\n if isinstance(a, (list, tuple)):\n if len(a) != len(b): return False\n return all(deep_equals_approx(x, y, epsilon) for x, y in zip(a, b))\n if isinstance(a, set):\n if len(a) != len(b): return False\n return all(any(deep_equals_approx(ia, ib, epsilon) for ib in b) for ia in a)\n return a == b\n\n","suffix":"assert shallow_equals([1, 2], [1, 2]) == True\nassert deep_equals({\u0027a\u0027: [1, 2]}, {\u0027a\u0027: [1, 2]}) == True\nassert deep_equals([1, 2], (1, 2)) == False # type-strict\n\n# Approx comparison with epsilon\nassert deep_equals_approx(1.0, 1.0 + 1e-10) == True\nassert deep_equals_approx(1.0, 1.1) == False\nassert deep_equals_approx({\u0027x\u0027: 0.1 + 0.2}, {\u0027x\u0027: 0.3}) == True\n# Sets: order-independent comparison\nassert deep_equals_approx({1, 2, 3}, {3, 2, 1}) == True\n# Tuple vs list: still type-strict\nassert deep_equals_approx([1, 2], (1, 2)) == False\n","assertions":"assert deep_equals_approx([], []) == True\nassert deep_equals_approx({}, {}) == True\nassert deep_equals_approx(set(), set()) == True\nassert deep_equals_approx({\u0027a\u0027: {1.0, 2.0}}, {\u0027a\u0027: {2.0, 1.0}}) == True\nassert deep_equals_approx(1.0, 1.0 + 1e-8, epsilon=1e-9) == False\nassert deep_equals_approx(1.0, 1.0 + 1e-8, epsilon=1e-7) == True\nassert deep_equals_approx([1, [2.0, 3.0]], [1, [2.0, 3.0 + 1e-10]]) == True\nassert deep_equals_approx({\u0027nested\u0027: {\u0027val\u0027: 0.1 + 0.2}}, {\u0027nested\u0027: {\u0027val\u0027: 0.3}}) == True\nassert deep_equals_approx(42, 42) == True\nassert deep_equals_approx(\u0027hello\u0027, \u0027hello\u0027) == True\nassert deep_equals_approx(42, 42.0) == False # int vs float: type-strict\n","category":"pattern_matching"} {"id":"48","testsource":"devbench-pattern-matching","language":"python","prefix":"import random as _rng\n\ndef random_choice(items, rng=None):\n r = rng or _rng\n idx = int(r.random() * len(items))\n return items[idx]\n\ndef random_sample(items, k, rng=None):\n r = rng or _rng\n pool = list(items)\n n = len(pool)\n if k \u003e n:\n raise ValueError(\u0027Sample larger than population\u0027)\n result = []\n for i in range(k):\n j = int(r.random() * (n - i)) + i\n pool[i], pool[j] = pool[j], pool[i]\n result.append(pool[i])\n return result\n\n","golden_completion":"def reservoir_sample(stream, k, rng=None):\n r = rng or _rng\n reservoir = []\n for i, item in enumerate(stream):\n if i \u003c k:\n reservoir.append(item)\n else:\n j = int(r.random() * (i + 1))\n if j \u003c k:\n reservoir[j] = item\n return reservoir\n\n","suffix":"# Test with a known RNG to verify algorithm correctness\nclass FakeRng:\n def __init__(self, values):\n self.values = list(values)\n self.idx = 0\n def random(self):\n v = self.values[self.idx % len(self.values)]\n self.idx += 1\n return v\n\n# reservoir_sample from an iterator (not a list!)\ndef gen_stream(n):\n for i in range(n):\n yield i\n\n# k=2 from stream of 5: [0,1,2,3,4]\n# Fill reservoir: [0, 1]\n# i=2: r.random()=0.1 -\u003e j=int(0.1*3)=0 \u003c 2, replace reservoir[0]=2 -\u003e [2, 1]\n# i=3: r.random()=0.9 -\u003e j=int(0.9*4)=3 \u003e= 2, no replace -\u003e [2, 1]\n# i=4: r.random()=0.3 -\u003e j=int(0.3*5)=1 \u003c 2, replace reservoir[1]=4 -\u003e [2, 4]\nfrng = FakeRng([0.1, 0.9, 0.3])\nresult = reservoir_sample(gen_stream(5), 2, rng=frng)\nassert result == [2, 4], f\u0027Got: {result}\u0027\n","assertions":"# k \u003e= n: should return all elements\nresult = reservoir_sample(gen_stream(3), 5, rng=FakeRng([0.5]*10))\nassert result == [0, 1, 2], f\u0027Got: {result}\u0027\n\n# k=1: simple case\n# i=0: fill [0]\n# i=1: r=0.0 -\u003e j=int(0.0*2)=0 \u003c 1, replace -\u003e [1]\n# i=2: r=0.0 -\u003e j=int(0.0*3)=0 \u003c 1, replace -\u003e [2]\nresult2 = reservoir_sample(gen_stream(3), 1, rng=FakeRng([0.0, 0.0]))\nassert result2 == [2], f\u0027Got: {result2}\u0027\n\n# k=1 with high random values (no replacements after fill)\n# i=0: fill [0]\n# i=1: r=0.99 -\u003e j=int(0.99*2)=1 \u003e= 1, skip\n# i=2: r=0.99 -\u003e j=int(0.99*3)=2 \u003e= 1, skip\nresult3 = reservoir_sample(gen_stream(3), 1, rng=FakeRng([0.99, 0.99]))\nassert result3 == [0], f\u0027Got: {result3}\u0027\n\n# Works with an iterator, not just a list\nresult4 = reservoir_sample(iter([10, 20, 30]), 2, rng=FakeRng([0.99]*5))\nassert result4 == [10, 20], f\u0027Got: {result4}\u0027\n","category":"pattern_matching"} {"id":"49","testsource":"devbench-pattern-matching","language":"python","prefix":"def template_simple(text, variables):\n result = text\n for key, value in variables.items():\n result = result.replace(\u0027${\u0027 + key + \u0027}\u0027, str(value))\n return result\n\ndef template_with_default(text, variables):\n import re\n def replacer(match):\n expr = match.group(1)\n if \u0027|\u0027 in expr:\n key, default = expr.split(\u0027|\u0027, 1)\n return str(variables.get(key.strip(), default.strip()))\n return str(variables.get(expr.strip(), match.group(0)))\n return re.sub(r\u0027\\$\\{([^}]+)\\}\u0027, replacer, text)\n\n","golden_completion":"def template_conditional(text, variables):\n result, i = [], 0\n while i \u003c len(text):\n if text[i:i+5] == \u0027${if \u0027:\n end_cond = text.index(\u0027}\u0027, i)\n varname = text[i+5:end_cond].strip(); i = end_cond + 1\n end_tag = text.index(\u0027${end}\u0027, i)\n block = text[i:end_tag]; i = end_tag + 6\n if variables.get(varname):\n result.append(template_simple(block, variables))\n elif text[i:i+2] == \u0027${\u0027:\n end_var = text.index(\u0027}\u0027, i)\n key = text[i+2:end_var].strip()\n result.append(str(variables.get(key, text[i:end_var+1]))); i = end_var + 1\n else:\n result.append(text[i]); i += 1\n return \u0027\u0027.join(result)\n\n","suffix":"assert template_simple(\u0027Hello ${name}!\u0027, {\u0027name\u0027: \u0027Alice\u0027}) == \u0027Hello Alice!\u0027\nassert template_with_default(\u0027Hi ${name | stranger}\u0027, {}) == \u0027Hi stranger\u0027\nassert template_with_default(\u0027Hi ${name | stranger}\u0027, {\u0027name\u0027: \u0027Bob\u0027}) == \u0027Hi Bob\u0027\n\n# Conditional blocks\nr = template_conditional(\u0027Hello ${name}${if premium}, welcome back VIP${end}!\u0027, {\u0027name\u0027: \u0027Alice\u0027, \u0027premium\u0027: True})\nassert r == \u0027Hello Alice, welcome back VIP!\u0027, f\u0027Got: {r}\u0027\n\nr2 = template_conditional(\u0027Hello ${name}${if premium}, welcome back VIP${end}!\u0027, {\u0027name\u0027: \u0027Bob\u0027, \u0027premium\u0027: False})\nassert r2 == \u0027Hello Bob!\u0027, f\u0027Got: {r2}\u0027\n\nr3 = template_conditional(\u0027${if show}visible${end}\u0027, {\u0027show\u0027: True})\nassert r3 == \u0027visible\u0027, f\u0027Got: {r3}\u0027\n\nr4 = template_conditional(\u0027${if show}visible${end}\u0027, {\u0027show\u0027: False})\nassert r4 == \u0027\u0027, f\u0027Got: {r4}\u0027\n","assertions":"# Missing variable in condition treated as falsy\nr5 = template_conditional(\u0027${if missing}hidden${end}rest\u0027, {})\nassert r5 == \u0027rest\u0027, f\u0027Got: {r5}\u0027\n\n# Variable substitution inside conditional block\nr6 = template_conditional(\u0027${if active}User: ${user}${end}\u0027, {\u0027active\u0027: True, \u0027user\u0027: \u0027Eve\u0027})\nassert r6 == \u0027User: Eve\u0027, f\u0027Got: {r6}\u0027\n\n# No conditionals, just vars\nr7 = template_conditional(\u0027plain ${x} text\u0027, {\u0027x\u0027: \u002742\u0027})\nassert r7 == \u0027plain 42 text\u0027, f\u0027Got: {r7}\u0027\n\n# Empty string variable is falsy\nr8 = template_conditional(\u0027${if msg}${msg}${end}done\u0027, {\u0027msg\u0027: \u0027\u0027})\nassert r8 == \u0027done\u0027, f\u0027Got: {r8}\u0027\n\n# Numeric zero is falsy\nr9 = template_conditional(\u0027${if count}has items${end}\u0027, {\u0027count\u0027: 0})\nassert r9 == \u0027\u0027, f\u0027Got: {r9}\u0027\n","category":"pattern_matching"} {"id":"50","testsource":"devbench-pattern-matching","language":"python","prefix":"import inspect\n\ndef compose_two(f, g):\n def composed(x):\n return g(f(x))\n return composed\n\ndef pipe(value, *fns):\n result = value\n for fn in fns:\n result = fn(result)\n return result\n\n","golden_completion":"def compose_checked(*fns):\n if len(fns) \u003c 2: raise ValueError(\u0027Need at least 2 functions\u0027)\n for i in range(len(fns) - 1):\n h_out, h_in = inspect.get_annotations(fns[i]), inspect.get_annotations(fns[i+1])\n ret = h_out.get(\u0027return\u0027)\n params = {k: v for k, v in h_in.items() if k != \u0027return\u0027}\n if params and ret is not None:\n first_type = next(iter(params.values()))\n if first_type != ret:\n raise TypeError(f\u0027Type mismatch: function {i} returns {ret.__name__} but function {i+1} expects {first_type.__name__}\u0027)\n def composed(x): return pipe(x, *fns)\n return composed\n\n","suffix":"assert compose_two(lambda x: x + 1, lambda x: x * 2)(3) == 8\nassert pipe(3, lambda x: x + 1, lambda x: x * 2) == 8\n\ndef int_to_str(x: int) -\u003e str:\n return str(x)\n\ndef str_to_upper(s: str) -\u003e str:\n return s.upper()\n\ndef str_len(s: str) -\u003e int:\n return len(s)\n\n# Compatible chain: int-\u003estr, str-\u003estr\nf = compose_checked(int_to_str, str_to_upper)\nassert f(42) == \u002742\u0027\n\n# Compatible 3-chain: int-\u003estr, str-\u003estr, str-\u003eint\ng = compose_checked(int_to_str, str_to_upper, str_len)\nassert g(42) == 2\n\n# Incompatible: int-\u003estr then str-\u003eint(expects str, but we pass int_to_str then int_to_str)\ntry:\n compose_checked(int_to_str, int_to_str)\n assert False, \u0027Should have raised TypeError\u0027\nexcept TypeError as e:\n assert \u0027str\u0027 in str(e) and \u0027int\u0027 in str(e), f\u0027Bad message: {e}\u0027\n","assertions":"# Need at least 2 functions\ntry:\n compose_checked(int_to_str)\n assert False, \u0027Should have raised ValueError\u0027\nexcept ValueError:\n pass\n\n# Functions without annotations should compose fine (no type check)\nh = compose_checked(lambda x: x + 1, lambda x: x * 2)\nassert h(3) == 8\n\ndef float_to_int(x: float) -\u003e int:\n return int(x)\n\n# float-\u003eint, int-\u003estr: compatible\nk = compose_checked(float_to_int, int_to_str)\nassert k(3.7) == \u00273\u0027\n\n# int-\u003estr, float-\u003eint: str != float, should fail\ntry:\n compose_checked(int_to_str, float_to_int)\n assert False, \u0027Should have raised TypeError\u0027\nexcept TypeError:\n pass\n","category":"pattern_matching"} {"id":"1","testsource":"devbench-syntax-completion","language":"python","prefix":"import datetime\nfrom dataclasses import dataclass\n\n@dataclass\nclass AuditEvent:\n actor: str\n action: str\n when: datetime.datetime\n detail: object = None\n severity: str = \"info\"\n\n def render(self, width: int = 64) -\u003e str:\n \"\"\"Render one audit line using f-string format syntax.\n\n Exact layout:\n - severity is uppercased and left-aligned in a 7-character field\n - timestamp uses datetime f-string format %d/%m/%Y %H:%M\n - actor uses !r and is left-aligned in actor_width\n - actor_width is max(8, width - 44)\n - append \" detail=\u003crepr\u003e\" only when detail is not None\n \"\"\"\n","golden_completion":" actor_width = max(8, width - 44)\n detail_text = f\" detail={self.detail!r}\" if self.detail is not None else \"\"\n return (\n f\"{self.severity.upper():\u003c7} | \"\n f\"{self.when:%d/%m/%Y %H:%M} | \"\n f\"{self.actor!r:\u003c{actor_width}} | \"\n f\"{self.action}{detail_text}\"\n )\n","suffix":"\nevent = AuditEvent(\n \"ada\",\n \"deploy\",\n datetime.datetime(2026, 5, 1, 9, 30),\n {\"target\": \"prod\"},\n \"warn\",\n)\nline = event.render(60)\nprint(line)\n","assertions":"event = AuditEvent(\"ada\", \"deploy\", datetime.datetime(2026, 5, 1, 9, 30), {\"target\": \"prod\"}, \"warn\")\nline = event.render(60)\nassert line == \"WARN | 01/05/2026 09:30 | \u0027ada\u0027 | deploy detail={\u0027target\u0027: \u0027prod\u0027}\", line\nassert AuditEvent(\"bob\", \"login\", datetime.datetime(2024, 1, 2, 3, 4)).render(50) == \"INFO | 02/01/2024 03:04 | \u0027bob\u0027 | login\"\nassert AuditEvent(\"xy\", \"ping\", datetime.datetime(2024, 1, 2, 3, 4), detail=0, severity=\"debug\").render(40) == \"DEBUG | 02/01/2024 03:04 | \u0027xy\u0027 | ping detail=0\"\nassert \"datetime.datetime\" not in line\n","category":"syntax_completion"} {"id":"2","testsource":"devbench-syntax-completion","language":"python","prefix":"class RecordingNamespace(dict):\n def __init__(self):\n super().__init__()\n self.order = []\n\n def __setitem__(self, key, value):\n if key not in self:\n self.order.append(key)\n super().__setitem__(key, value)\n\nclass Field:\n def __init__(self, typ):\n self.typ = typ\n\nclass FieldMeta(type):\n \"\"\"Metaclass that records Field declarations in source order.\n\n Use __prepare__ to return RecordingNamespace.\n __new__ receives keyword-only prefix from class declarations such as\n class User(metaclass=FieldMeta, prefix=\"db_\").\n It must set cls.declared_fields to a tuple of prefixed names for values\n that are Field instances, preserving declaration order and ignoring helpers.\n \"\"\"\n","golden_completion":" @classmethod\n def __prepare__(mcls, name, bases, **kwargs):\n return RecordingNamespace()\n\n def __new__(mcls, name, bases, namespace, *, prefix=\"\", **kwargs):\n cls = super().__new__(mcls, name, bases, dict(namespace))\n cls.declared_fields = tuple(\n f\"{prefix}{key}\"\n for key in namespace.order\n if isinstance(namespace.get(key), Field)\n )\n return cls\n","suffix":"\nclass User(metaclass=FieldMeta, prefix=\"db_\"):\n id = Field(int)\n name = Field(str)\n helper = object()\n active = Field(bool)\n\nclass Plain(metaclass=FieldMeta):\n title = Field(str)\n count = 0\n\nprint(User.declared_fields)\nprint(Plain.declared_fields)\n","assertions":"assert User.declared_fields == (\"db_id\", \"db_name\", \"db_active\"), User.declared_fields\nassert Plain.declared_fields == (\"title\",), Plain.declared_fields\nassert isinstance(User.__dict__[\"id\"], Field)\nclass Empty(metaclass=FieldMeta, prefix=\"x_\"):\n helper = 1\nassert Empty.declared_fields == ()\n","category":"syntax_completion"} {"id":"3","testsource":"devbench-syntax-completion","language":"python","prefix":"import functools\n\ndef counted(func):\n @functools.wraps(func)\n def wrapper(*args, **kwargs):\n wrapper.calls += 1\n return func(*args, **kwargs)\n wrapper.calls = 0\n return wrapper\n\ndef tagged(label):\n def decorate(func):\n func.tag = label\n return func\n return decorate\n\nclass Factory:\n registry = {}\n\n def __init__(self, key: str):\n self.key = key\n\n","golden_completion":" @classmethod\n @counted\n @tagged(\"build\")\n def make(cls, key: str) -\u003e \u0027Factory\u0027:\n if key not in cls.registry:\n cls.registry[key] = cls(key)\n return cls.registry[key]\n\n @staticmethod\n @counted\n @tagged(\"check\")\n def valid_key(key: str) -\u003e bool:\n return isinstance(key, str) and key.isidentifier()\n","suffix":"\na = Factory.make(\"alpha\")\nb = Factory.make(\"alpha\")\nc = Factory.make(\"beta\")\nok1 = Factory.valid_key(\"alpha\")\nok2 = Factory.valid_key(\"not valid\")\nprint(a is b, a is c, ok1, ok2)\n","assertions":"assert a is b\nassert a is not c\nassert a.key == \"alpha\" and c.key == \"beta\"\nassert Factory.make.calls == 3\nassert Factory.make.tag == \"build\"\nassert Factory.valid_key.calls == 2\nassert Factory.valid_key.tag == \"check\"\nassert ok1 is True\nassert ok2 is False\nFactory.make(\"gamma\")\nassert Factory.make.calls == 4\n","category":"syntax_completion"} {"id":"4","testsource":"devbench-syntax-completion","language":"python","prefix":"import datetime\n\nclass Span:\n def __init__(self, name, start, minutes, tags=None):\n self.name = name\n self.start = start\n self.minutes = minutes\n self.tags = tags or []\n\n def render(self, width=48):\n \"\"\"Render a compact schedule row with f-string formatting.\n\n The name column is left aligned using a dynamic width.\n The timestamp uses %m/%d %H:%M.\n The duration is right aligned as minutes with an \u0027m\u0027 suffix.\n Tags, when present, are joined with semicolons inside square brackets.\n \"\"\"\n","golden_completion":" tags = f\" [{\u0027;\u0027.join(self.tags)}]\" if self.tags else \"\"\n return (\n f\"{self.name:\u003c{width - 24}}\"\n f\"{self.start:%m/%d %H:%M} \"\n f\"{self.minutes:\u003e4}m\"\n f\"{tags}\"\n )\n","suffix":"\nspan = Span(\n \"Deploy\",\n datetime.datetime(2026, 5, 1, 9, 30),\n 75,\n [\"prod\", \"db\"],\n)\nline = span.render(50)\nprint(line)\n","assertions":"span = Span(\"Deploy\", datetime.datetime(2026, 5, 1, 9, 30), 75, [\"prod\", \"db\"])\nassert span.render(50) == \"Deploy 05/01 09:30 75m [prod;db]\", span.render(50)\nassert Span(\"Lunch\", datetime.datetime(2024, 1, 2, 12, 0), 5).render(40) == \"Lunch 01/02 12:00 5m\"\nassert Span(\"X\", datetime.datetime(2024, 1, 2, 3, 4), 125, [\"a\"]).render(32) == \"X 01/02 03:04 125m [a]\"\n","category":"syntax_completion"} {"id":"5","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import List, Tuple\n\ndef label_matrix(\n data: List[List[int]],\n threshold: int = 50\n) -\u003e List[Tuple[int, int, int, str]]:\n \"\"\"Label each cell in a matrix as \"high\" or \"low\" based on threshold.\n \n Returns list of (row_idx, col_idx, value, label) tuples.\n \"\"\"\n labeled = [\n","golden_completion":" (i, j, val, \"high\" if val \u003e threshold else \"low\")\n for i, row in enumerate(data)\n for j, val in enumerate(row)\n","suffix":" ]\n return labeled\n\ndata = [[10, 80, 30], [60, 20, 90], [40, 55, 5]]\nlabeled = label_matrix(data)\nprint(labeled)\n","assertions":"assert len(labeled) == 9\nassert labeled[0] == (0, 0, 10, \"low\")\nassert labeled[1] == (0, 1, 80, \"high\")\nassert labeled[5] == (1, 2, 90, \"high\")\n","category":"syntax_completion"} {"id":"6","testsource":"devbench-syntax-completion","language":"python","prefix":"class Step:\n def __init__(self, log, name):\n self.log = log\n self.name = name\n\n def __enter__(self):\n self.log.append(f\"enter:{self.name}\")\n return self\n\n def __exit__(self, exc_type, exc, tb):\n self.log.append(f\"exit:{self.name}\")\n return False\n\ndef run_steps(mode: str):\n \"\"\"Run nested context managers with precise exception handling.\n\n In the inner body append \"body\".\n mode == \"value\" raises ValueError(\"bad\") and is wrapped as RuntimeError(\"wrapped\").\n mode == \"type\" raises TypeError(\"wrong\") and is handled only by the outer TypeError except.\n Always append inner-finally after the inner try and outer-finally at the end.\n \"\"\"\n log = []\n try:\n","golden_completion":" with Step(log, \"outer\"):\n try:\n with Step(log, \"inner\"):\n log.append(\"body\")\n if mode == \"value\":\n raise ValueError(\"bad\")\n if mode == \"type\":\n raise TypeError(\"wrong\")\n except ValueError as exc:\n log.append(f\"inner:{exc}\")\n raise RuntimeError(\"wrapped\") from exc\n finally:\n log.append(\"inner-finally\")\n except RuntimeError as exc:\n log.append(f\"outer:{exc.__cause__}\")\n except TypeError as exc:\n log.append(f\"type:{exc}\")\n finally:\n log.append(\"outer-finally\")\n","suffix":" return log\n\nok = run_steps(\"ok\")\nvalue = run_steps(\"value\")\ntype_case = run_steps(\"type\")\nprint(ok)\nprint(value)\nprint(type_case)\n","assertions":"assert ok == [\"enter:outer\", \"enter:inner\", \"body\", \"exit:inner\", \"inner-finally\", \"exit:outer\", \"outer-finally\"], ok\nassert value == [\"enter:outer\", \"enter:inner\", \"body\", \"exit:inner\", \"inner:bad\", \"inner-finally\", \"exit:outer\", \"outer:bad\", \"outer-finally\"], value\nassert type_case == [\"enter:outer\", \"enter:inner\", \"body\", \"exit:inner\", \"inner-finally\", \"exit:outer\", \"type:wrong\", \"outer-finally\"], type_case\n","category":"syntax_completion"} {"id":"7","testsource":"devbench-syntax-completion","language":"python","prefix":"from dataclasses import dataclass\n\n@dataclass\nclass Packet:\n kind: str\n payload: object\n flags: tuple[str, ...] = ()\n\ndef route(packet) -\u003e str:\n \"\"\"Route packets using structural pattern matching.\n\n Data packets have payload {\"id\": int, \"chunks\": [first, *rest]}.\n Urgent data is reported separately from normal data.\n Control retry packets have payload (\"retry\", count) and positive count.\n Text mappings may arrive as plain dictionaries with kind/body/lang keys.\n Everything else is ignored.\n \"\"\"\n match packet:\n","golden_completion":" case Packet(\"data\", {\"id\": int(pid), \"chunks\": [first, *rest]}, flags) if \"urgent\" in flags:\n return f\"urgent-data:{pid}:{1 + len(rest)}\"\n case Packet(\"data\", {\"id\": int(pid), \"chunks\": [first, *rest]}, _):\n return f\"data:{pid}:{1 + len(rest)}\"\n case Packet(\"control\", (\"retry\", int(count)), _) if count \u003e 0:\n return f\"retry:{count}\"\n case {\"kind\": \"text\", \"body\": str(body), **extra} if extra.get(\"lang\") == \"py\":\n return f\"python-text:{body}\"\n case _:\n return \"ignored\"\n","suffix":"\nr1 = route(Packet(\"data\", {\"id\": 7, \"chunks\": [\"a\", \"b\", \"c\"]}, (\"urgent\",)))\nr2 = route(Packet(\"data\", {\"id\": 8, \"chunks\": [\"x\"]}))\nr3 = route(Packet(\"control\", (\"retry\", 3)))\nr4 = route({\"kind\": \"text\", \"body\": \"print()\", \"lang\": \"py\"})\nprint(r1, r2, r3, r4)\n","assertions":"assert r1 == \"urgent-data:7:3\"\nassert r2 == \"data:8:1\"\nassert r3 == \"retry:3\"\nassert r4 == \"python-text:print()\"\nassert route(Packet(\"control\", (\"retry\", 0))) == \"ignored\"\nassert route({\"kind\": \"text\", \"body\": \"x\", \"lang\": \"js\"}) == \"ignored\"\nassert route(Packet(\"data\", {\"id\": True, \"chunks\": [\"x\"]})) == \"data:True:1\"\n","category":"syntax_completion"} {"id":"8","testsource":"devbench-syntax-completion","language":"python","prefix":"import io\nimport sys\nfrom typing import List, Tuple, Optional, Union\n\ndef find_first_negative(\n values: List[int]\n) -\u003e Tuple[Optional[int], str]:\n \"\"\"Find first negative using for/else inside try/except/else/finally.\n \n Returns (value_found_or_None, captured_output_string).\n The for/else pattern is key: else fires only if loop\n completes without break.\n \"\"\"\n captured = io.StringIO()\n old_stdout = sys.stdout\n sys.stdout = captured\n result = None\n try:\n for v in values:\n if v \u003c 0:\n result = v\n","golden_completion":" print(f\"Found negative: {v}\")\n break\n else:\n print(\"No negatives found\")\n","suffix":" except TypeError as e:\n print(f\"TypeError: {e}\")\n result = \"error\"\n else:\n print(\"Search completed without error\")\n finally:\n sys.stdout = old_stdout\n return result, captured.getvalue()\n\nr1, out1 = find_first_negative([1, 2, -3, 4])\nr2, out2 = find_first_negative([1, 2, 3])\n","assertions":"assert r1 == -3, f\"Expected -3 but got {r1}\"\nassert \"Found negative: -3\" in out1\nassert r2 is None, f\"Expected None but got {r2}\"\nassert \"No negatives found\" in out2\n","category":"syntax_completion"} {"id":"9","testsource":"devbench-syntax-completion","language":"python","prefix":"import os\nimport tempfile\n\nclass ManagedFile:\n def __init__(self, path, mode=\u0027w\u0027):\n self.path = path\n self.mode = mode\n self.file = None\n\n def __enter__(self):\n self.file = open(self.path, self.mode)\n return self.file\n\n def __exit__(self, exc_type, exc_val, exc_tb):\n if self.file:\n self.file.close()\n return False\n\ndef safe_write(content, should_fail=False):\n tmp = tempfile.NamedTemporaryFile(delete=False, suffix=\u0027.txt\u0027)\n path = tmp.name\n tmp.close()\n try:\n with ManagedFile(path, \u0027w\u0027) as f:\n f.write(content)\n if should_fail:\n","golden_completion":" raise RuntimeError(\"Intentional failure\")\n with ManagedFile(path, \u0027r\u0027) as f:\n result = f.read()\n","suffix":" except RuntimeError:\n result = \"FAILED\"\n finally:\n os.unlink(path)\n return result\n\nok = safe_write(\"good data\")\nfail = safe_write(\"bad data\", should_fail=True)\n","assertions":"assert ok == \"good data\", f\"Expected \u0027good data\u0027 but got {ok!r}\"\nassert fail == \"FAILED\", f\"Expected \u0027FAILED\u0027 but got {fail!r}\"\n","category":"syntax_completion"} {"id":"10","testsource":"devbench-syntax-completion","language":"python","prefix":"class Level:\n def __init__(self, name):\n self.name = name\n self.entered = False\n self.exited = False\n\n def __enter__(self):\n self.entered = True\n return self\n\n def __exit__(self, exc_type, exc_val, exc_tb):\n self.exited = True\n return False\n\ndef deep_nesting():\n log = []\n try:\n with Level(\"A\") as a:\n log.append(f\"entered {a.name}\")\n try:\n with Level(\"B\") as b:\n log.append(f\"entered {b.name}\")\n try:\n with Level(\"C\") as c:\n log.append(f\"entered {c.name}\")\n","golden_completion":" raise ValueError(\"error at C\")\n except ValueError as e:\n log.append(f\"caught: {e}\")\n raise RuntimeError(\"escalated\") from e\n","suffix":" except RuntimeError as e:\n log.append(f\"caught escalated: {e}\")\n log.append(f\"original cause: {e.__cause__}\")\n except Exception as e:\n log.append(f\"outer: {e}\")\n return log, a, b, c\n\nlog, a, b, c = deep_nesting()\n","assertions":"assert a.entered and a.exited\nassert b.entered and b.exited\nassert c.entered and c.exited\nassert \"caught: error at C\" in log\nassert \"caught escalated: escalated\" in log\nassert any(\"original cause\" in entry for entry in log)\n","category":"syntax_completion"} {"id":"11","testsource":"devbench-syntax-completion","language":"python","prefix":"from contextlib import ExitStack\n\nclass Resource:\n def __init__(self, log, name):\n self.log = log\n self.name = name\n\n def __enter__(self):\n self.log.append(f\"enter:{self.name}\")\n return self\n\n def __exit__(self, exc_type, exc, tb):\n self.log.append(f\"exit:{self.name}\")\n return False\n\ndef manage(mode: str):\n \"\"\"Use ExitStack inside try/except/else/finally.\n\n Enter alpha and beta through stack.enter_context.\n Append use:\u003calpha\u003e/\u003cbeta\u003e unless mode == \"lookup\".\n mode == \"lookup\" raises LookupError(\"missing\") and is handled by the except.\n The else block appends \"else\" only for the no-error path.\n The finally block always appends \"finally\".\n \"\"\"\n log = []\n try:\n","golden_completion":" with ExitStack() as stack:\n alpha = stack.enter_context(Resource(log, \"alpha\"))\n beta = stack.enter_context(Resource(log, \"beta\"))\n if mode == \"lookup\":\n raise LookupError(\"missing\")\n log.append(f\"use:{alpha.name}/{beta.name}\")\n except LookupError as exc:\n log.append(f\"lookup:{exc}\")\n else:\n log.append(\"else\")\n finally:\n log.append(\"finally\")\n","suffix":" return log\n\nok = manage(\"ok\")\nmissing = manage(\"lookup\")\nprint(ok)\nprint(missing)\n","assertions":"assert ok == [\"enter:alpha\", \"enter:beta\", \"use:alpha/beta\", \"exit:beta\", \"exit:alpha\", \"else\", \"finally\"], ok\nassert missing == [\"enter:alpha\", \"enter:beta\", \"exit:beta\", \"exit:alpha\", \"lookup:missing\", \"finally\"], missing\n","category":"syntax_completion"} {"id":"12","testsource":"devbench-syntax-completion","language":"python","prefix":"import functools\n\ndef log_call(func):\n @functools.wraps(func)\n def wrapper(*args, **kwargs):\n wrapper.call_count = getattr(wrapper, \u0027call_count\u0027, 0) + 1\n return func(*args, **kwargs)\n wrapper.call_count = 0\n return wrapper\n\nclass Registry:\n _instances = {}\n\n def __init__(self, name: str):\n self.name = name\n\n @classmethod\n","golden_completion":" @log_call\n def create(cls, name: str) -\u003e \u0027Registry\u0027:\n if name not in cls._instances:\n cls._instances[name] = cls(name)\n return cls._instances[name]\n","suffix":"\n @staticmethod\n @log_call\n def validate_name(name: str) -\u003e bool:\n return isinstance(name, str) and len(name) \u003e 0\n\nr1 = Registry.create(\"alpha\")\nr2 = Registry.create(\"alpha\")\nr3 = Registry.create(\"beta\")\n","assertions":"assert r1 is r2, \"Same name should return same instance\"\nassert r1 is not r3\nassert r1.name == \"alpha\"\nassert Registry.create.call_count == 3\nassert Registry.validate_name(\"test\") is True\nassert Registry.validate_name(\"\") is False\n","category":"syntax_completion"} {"id":"13","testsource":"devbench-syntax-completion","language":"python","prefix":"from abc import ABC, abstractmethod\nfrom functools import cached_property\n\nclass Shape(ABC):\n @abstractmethod\n def area(self) -\u003e float: ...\n\n @abstractmethod\n def perimeter(self) -\u003e float: ...\n\nclass Circle(Shape):\n PI = 3.14159265\n\n def __init__(self, radius: float):\n self._radius = radius\n\n @property\n def radius(self) -\u003e float:\n return self._radius\n\n","golden_completion":" def area(self) -\u003e float:\n return self.PI * self._radius ** 2\n\n def perimeter(self) -\u003e float:\n return 2 * self.PI * self._radius\n\n @classmethod\n def unit_circle(cls) -\u003e \u0027Circle\u0027:\n","suffix":" return cls(1.0)\n\nc = Circle(5)\nuc = Circle.unit_circle()\n","assertions":"assert abs(c.area() - 3.14159265 * 25) \u003c 1e-6\nassert abs(c.perimeter() - 2 * 3.14159265 * 5) \u003c 1e-6\nassert uc.radius == 1.0\nassert abs(uc.area() - 3.14159265) \u003c 1e-6\n","category":"syntax_completion"} {"id":"14","testsource":"devbench-syntax-completion","language":"python","prefix":"class Guard:\n def __init__(self, log, name):\n self.log = log\n self.name = name\n\n def __enter__(self):\n self.log.append(f\"enter:{self.name}\")\n return self\n\n def __exit__(self, exc_type, exc, tb):\n self.log.append(f\"exit:{self.name}\")\n return False\n\ndef audit_events(events):\n \"\"\"Audit events with nested Python control-flow syntax.\n\n Inside Guard(log, \"scan\"), iterate over events.\n Use match/case for dictionaries:\n - {\"kind\": \"stop\", \"code\": int(code)} with code \u003e 0 logs stop:\u003ccode\u003e and breaks.\n - {\"kind\": \"skip\"} continues without logging.\n - {\"kind\": str(kind)} logs seen:\u003ckind\u003e.\n If the loop does not break, the for/else block logs no-stop.\n TypeError is caught outside the with block as type:\u003cmessage\u003e.\n The try/else block logs clean only when no exception escaped the try.\n The finally block always logs done.\n \"\"\"\n log = []\n try:\n","golden_completion":" with Guard(log, \"scan\"):\n for event in events:\n match event:\n case {\"kind\": \"stop\", \"code\": int(code)} if code \u003e 0:\n log.append(f\"stop:{code}\")\n break\n case {\"kind\": \"skip\"}:\n continue\n case {\"kind\": str(kind)}:\n log.append(f\"seen:{kind}\")\n case _:\n raise TypeError(f\"bad event: {event!r}\")\n else:\n log.append(\"no-stop\")\n except TypeError as exc:\n log.append(f\"type:{exc}\")\n else:\n log.append(\"clean\")\n finally:\n log.append(\"done\")\n","suffix":" return log\n\nwith_stop = audit_events([\n {\"kind\": \"start\"},\n {\"kind\": \"skip\"},\n {\"kind\": \"stop\", \"code\": 3},\n {\"kind\": \"late\"},\n])\nno_stop = audit_events([{\"kind\": \"skip\"}, {\"kind\": \"tick\"}])\nbad = audit_events([{\"bad\": True}])\nprint(with_stop)\nprint(no_stop)\nprint(bad)\n","assertions":"assert with_stop == [\"enter:scan\", \"seen:start\", \"stop:3\", \"exit:scan\", \"clean\", \"done\"], with_stop\nassert no_stop == [\"enter:scan\", \"seen:tick\", \"no-stop\", \"exit:scan\", \"clean\", \"done\"], no_stop\nassert bad == [\"enter:scan\", \"exit:scan\", \"type:bad event: {\u0027bad\u0027: True}\", \"done\"], bad\nassert audit_events([{\"kind\": \"stop\", \"code\": 0}]) == [\"enter:scan\", \"seen:stop\", \"no-stop\", \"exit:scan\", \"clean\", \"done\"]\n","category":"syntax_completion"} {"id":"15","testsource":"devbench-syntax-completion","language":"python","prefix":"class Validated:\n \"\"\"A descriptor that validates values are within a range.\"\"\"\n\n def __init__(self, min_val: float, max_val: float):\n self.min_val = min_val\n self.max_val = max_val\n\n def __set_name__(self, owner, name):\n self.storage_name = f\u0027_validated_{name}\u0027\n\n def __get__(self, obj, objtype=None):\n if obj is None:\n return self\n return getattr(obj, self.storage_name, None)\n\n","golden_completion":" def __set__(self, obj, value):\n if not (self.min_val \u003c= value \u003c= self.max_val):\n raise ValueError(\n f\"Value {value} not in [{self.min_val}, {self.max_val}]\"\n )\n setattr(obj, self.storage_name, value)\n","suffix":"\nclass Config:\n speed = Validated(0, 100)\n volume = Validated(0, 10)\n\n def __init__(self, speed: float, volume: float):\n self.speed = speed\n self.volume = volume\n\ncfg = Config(50, 5)\n","assertions":"assert cfg.speed == 50\nassert cfg.volume == 5\ncfg.speed = 75\nassert cfg.speed == 75\ntry:\n cfg.speed = 200\n assert False, \"Should have raised ValueError\"\nexcept ValueError:\n pass\ntry:\n cfg.volume = -1\n assert False, \"Should have raised ValueError\"\nexcept ValueError:\n pass\n","category":"syntax_completion"} {"id":"16","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import Dict\n\ndef classify_status(code: int) -\u003e str:\n \"\"\"Classify HTTP status codes into human-readable categories.\n \n Uses structural pattern matching (match/case).\n Handles specific codes and a wildcard fallback.\n \"\"\"\n match code:\n case 200:\n return \"OK\"\n case 301 | 302:\n return \"Redirect\"\n","golden_completion":" case 404:\n return \"Not Found\"\n case 500:\n return \"Server Error\"\n case _:\n return \"Unknown\"\n","suffix":"\nresults: Dict[int, str] = {\n code: classify_status(code)\n for code in [200, 301, 302, 404, 500, 999]\n}\n","assertions":"assert results[200] == \"OK\"\nassert results[301] == \"Redirect\"\nassert results[302] == \"Redirect\"\nassert results[404] == \"Not Found\"\nassert results[500] == \"Server Error\"\nassert results[999] == \"Unknown\"\n","category":"syntax_completion"} {"id":"17","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import Union\n\ndef process_command(command: Union[dict, str]) -\u003e str:\n \"\"\"Process game commands using pattern matching.\n \n Supports move with direction/steps, rotate with angle,\n and fallback for unknown/invalid commands.\n \"\"\"\n match command:\n case {\"action\": \"move\", \"direction\": d, \"steps\": s} if s \u003e 0:\n return f\"Moving {d} by {s} steps\"\n case {\"action\": \"move\", \"direction\": d, \"steps\": s} if s \u003c= 0:\n return \"Cannot move zero or negative steps\"\n","golden_completion":" case {\"action\": \"rotate\", \"angle\": a} if -360 \u003c= a \u003c= 360:\n return f\"Rotating by {a} degrees\"\n case {\"action\": \"rotate\", \"angle\": a}:\n return f\"Invalid angle: {a}\"\n case {\"action\": action}:\n return f\"Unknown action: {action}\"\n case _:\n return \"Invalid command\"\n","suffix":"\nr1 = process_command({\"action\": \"move\", \"direction\": \"north\", \"steps\": 5})\nr2 = process_command({\"action\": \"move\", \"direction\": \"south\", \"steps\": 0})\nr3 = process_command({\"action\": \"rotate\", \"angle\": 90})\nr4 = process_command({\"action\": \"rotate\", \"angle\": 500})\nr5 = process_command({\"action\": \"jump\"})\nr6 = process_command(\"invalid\")\n","assertions":"assert r1 == \"Moving north by 5 steps\"\nassert r2 == \"Cannot move zero or negative steps\"\nassert r3 == \"Rotating by 90 degrees\"\nassert r4 == \"Invalid angle: 500\"\nassert r5 == \"Unknown action: jump\"\nassert r6 == \"Invalid command\"\n","category":"syntax_completion"} {"id":"18","testsource":"devbench-syntax-completion","language":"python","prefix":"from dataclasses import dataclass\nfrom typing import Optional\n\n@dataclass\nclass Point:\n x: float\n y: float\n label: Optional[str] = None\n\n@dataclass\nclass Line:\n start: Point\n end: Point\n\ndef describe_geometry(shape) -\u003e str:\n match shape:\n case Point(x=0, y=0):\n return \"origin\"\n case Point(x=x, y=0) if x \u003e 0:\n return f\"positive x-axis at {x}\"\n case Point(x=0, y=y) if y \u003e 0:\n return f\"positive y-axis at {y}\"\n","golden_completion":" case Point(x=x, y=y, label=str(lbl)):\n return f\"labeled point \u0027{lbl}\u0027 at ({x}, {y})\"\n case Point(x=x, y=y):\n return f\"point at ({x}, {y})\"\n case Line(start=Point(x=sx, y=sy), end=Point(x=ex, y=ey)) if sx == ex:\n return f\"vertical line from y={sy} to y={ey}\"\n case Line(start=s, end=e):\n return f\"line from ({s.x}, {s.y}) to ({e.x}, {e.y})\"\n","suffix":" case _:\n return \"unknown shape\"\n\nr1 = describe_geometry(Point(0, 0))\nr2 = describe_geometry(Point(5, 0))\nr3 = describe_geometry(Point(0, 3))\nr4 = describe_geometry(Point(1, 2, \"A\"))\nr5 = describe_geometry(Point(1, 2))\nr6 = describe_geometry(Line(Point(3, 0), Point(3, 10)))\nr7 = describe_geometry(Line(Point(0, 0), Point(5, 5)))\n","assertions":"assert r1 == \"origin\"\nassert r2 == \"positive x-axis at 5\"\nassert r3 == \"positive y-axis at 3\"\nassert r4 == \"labeled point \u0027A\u0027 at (1, 2)\"\nassert r5 == \"point at (1, 2)\"\nassert r6 == \"vertical line from y=0 to y=10\"\nassert r7 == \"line from (0, 0) to (5, 5)\"\n","category":"syntax_completion"} {"id":"19","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import Union, List\n\ndef parse_record(\n record: Union[list, str, tuple]\n) -\u003e str:\n \"\"\"Parse structured records using sequence pattern matching.\n \n Supports various list formats with different fields.\n Uses star capture for variable-length records.\n \"\"\"\n match record:\n case [name, age] if isinstance(age, int) and age \u003e= 0:\n return f\"Person: {name}, age {age}\"\n","golden_completion":" case [name, age, *hobbies] if len(hobbies) \u003e 0:\n return f\"Person: {name}, age {age}, hobbies: {\u0027, \u0027.join(hobbies)}\"\n case [name]:\n return f\"Person: {name}, no other info\"\n case []:\n return \"Empty record\"\n case _:\n return \"Invalid record\"\n","suffix":"\nr1 = parse_record([\"Alice\", 30])\nr2 = parse_record([\"Bob\", 25, \"chess\", \"hiking\"])\nr3 = parse_record([\"Charlie\"])\nr4 = parse_record([])\nr5 = parse_record(\"not a list\")\n","assertions":"assert r1 == \"Person: Alice, age 30\"\nassert r2 == \"Person: Bob, age 25, hobbies: chess, hiking\"\nassert r3 == \"Person: Charlie, no other info\"\nassert r4 == \"Empty record\"\nassert r5 == \"Invalid record\"\n","category":"syntax_completion"} {"id":"20","testsource":"devbench-syntax-completion","language":"python","prefix":"from dataclasses import dataclass\nfrom typing import Union\n\n@dataclass\nclass Success:\n value: object\n\n@dataclass\nclass Error:\n code: int\n message: str\n\n@dataclass\nclass Warning:\n code: int\n message: str\n\ndef handle_result(result: Union[Success, Error, Warning]) -\u003e str:\n match result:\n case Success(value=v) if isinstance(v, list):\n return f\"Success with list of {len(v)} items\"\n case Success(value=v):\n return f\"Success: {v}\"\n","golden_completion":" case Error(code=c, message=m) | Warning(code=c, message=m) if c \u003e= 500:\n return f\"Critical ({c}): {m}\"\n case Error(code=c, message=m):\n return f\"Error ({c}): {m}\"\n case Warning(code=c, message=m):\n return f\"Warning ({c}): {m}\"\n case _:\n return \"Unrecognized result\"\n","suffix":"\nr1 = handle_result(Success([1, 2, 3]))\nr2 = handle_result(Success(\"hello\"))\nr3 = handle_result(Error(500, \"Internal\"))\nr4 = handle_result(Warning(500, \"Critical warning\"))\nr5 = handle_result(Error(404, \"Not found\"))\nr6 = handle_result(Warning(200, \"Low priority\"))\n","assertions":"assert r1 == \"Success with list of 3 items\"\nassert r2 == \"Success: hello\"\nassert r3 == \"Critical (500): Internal\"\nassert r4 == \"Critical (500): Critical warning\"\nassert r5 == \"Error (404): Not found\"\nassert r6 == \"Warning (200): Low priority\"\n","category":"syntax_completion"} {"id":"21","testsource":"devbench-syntax-completion","language":"python","prefix":"def format_name(\n # first and last are positional-only\n # title and suffix are keyword-only with defaults\n # Use / to separate positional-only\n # Use * to start keyword-only section\n # Both have str type annotations\n # Default values: title=\u0027\u0027, suffix=\u0027\u0027\n # The function joins non-empty parts with spaces\n # Example: format_name(\u0027John\u0027, \u0027Doe\u0027, title=\u0027Dr.\u0027)\n # Returns: \u0027Dr. John Doe\u0027\n","golden_completion":" first: str,\n last: str,\n /,\n *,\n title: str = \"\",\n suffix: str = \"\",\n","suffix":") -\u003e str:\n parts = []\n if title:\n parts.append(title)\n parts.append(first)\n parts.append(last)\n if suffix:\n parts.append(suffix)\n return \" \".join(parts)\n\nr1 = format_name(\"John\", \"Doe\")\nr2 = format_name(\"Jane\", \"Doe\", title=\"Dr.\")\nr3 = format_name(\"Bob\", \"Smith\", title=\"Mr.\", suffix=\"Jr.\")\n","assertions":"assert r1 == \"John Doe\"\nassert r2 == \"Dr. Jane Doe\"\nassert r3 == \"Mr. Bob Smith Jr.\"\ntry:\n format_name(first=\"John\", last=\"Doe\")\n assert False, \"Should not accept keyword arguments for positional-only params\"\nexcept TypeError:\n pass\n","category":"syntax_completion"} {"id":"22","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import Any, Optional\n\ndef make_request(\n # url is positional-only (already separated by /)\n url: str,\n /,\n # Next: method with default, *args for extra paths,\n # then keyword-only: headers, timeout, and **kwargs\n # method defaults to \u0027GET\u0027, timeout to 30.0\n # headers is Optional[dict[str, str]] defaulting to None\n","golden_completion":" method: str = \"GET\",\n *args: str,\n headers: Optional[dict[str, str]] = None,\n timeout: float = 30.0,\n **kwargs: Any,\n","suffix":") -\u003e dict:\n result = {\n \"url\": url,\n \"method\": method,\n \"extra_paths\": list(args),\n \"headers\": headers or {},\n \"timeout\": timeout,\n \"options\": kwargs,\n }\n return result\n\nr = make_request(\n \"https://api.example.com\", \"POST\", \"v1\", \"users\",\n headers={\"Auth\": \"token\"}, timeout=10.0, retry=True\n)\n","assertions":"assert r[\"url\"] == \"https://api.example.com\"\nassert r[\"method\"] == \"POST\"\nassert r[\"extra_paths\"] == [\"v1\", \"users\"]\nassert r[\"headers\"] == {\"Auth\": \"token\"}\nassert r[\"timeout\"] == 10.0\nassert r[\"options\"] == {\"retry\": True}\ntry:\n make_request(url=\"https://example.com\")\n assert False, \"url should be positional-only\"\nexcept TypeError:\n pass\n","category":"syntax_completion"} {"id":"23","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import overload, Union\n\n# The overload decorators declare the type signatures\n# for static type checkers. The actual implementation\n# follows without @overload and must handle all cases.\n\n@overload\ndef convert(value: str) -\u003e int: ...\n@overload\ndef convert(value: int) -\u003e str: ...\n@overload\ndef convert(value: float) -\u003e str: ...\n\n","golden_completion":"def convert(value: Union[str, int, float]) -\u003e Union[int, str]:\n if isinstance(value, str):\n return int(value)\n elif isinstance(value, (int, float)):\n return str(value)\n else:\n raise TypeError(f\"Unsupported type: {type(value)}\")\n","suffix":"\na = convert(\"42\")\nb = convert(42)\nc = convert(3.14)\n","assertions":"assert a == 42 and isinstance(a, int)\nassert b == \"42\" and isinstance(b, str)\nassert c == \"3.14\" and isinstance(c, str)\ntry:\n convert([1, 2])\n assert False, \"Should raise TypeError\"\nexcept TypeError:\n pass\n","category":"syntax_completion"} {"id":"24","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import Callable, Optional\nfrom dataclasses import dataclass, field\n\n@dataclass\nclass Pipeline:\n steps: list = field(default_factory=list)\n name: str = \"default\"\n\ndef build_pipeline(\n # *transforms collects callable positional args\n *transforms: Callable[[int], int],\n","golden_completion":" name: str = \"pipeline\",\n initial: int = 0,\n validator: Optional[Callable[[int], bool]] = None,\n","suffix":") -\u003e Pipeline:\n p = Pipeline(name=name)\n value = initial\n for t in transforms:\n value = t(value)\n if validator and not validator(value):\n raise ValueError(f\"Validation failed at value {value}\")\n p.steps.append(value)\n return p\n\nresult = build_pipeline(\n lambda x: x + 10,\n lambda x: x * 2,\n lambda x: x - 5,\n name=\"math_pipe\",\n initial=5,\n validator=lambda v: v \u003e= 0,\n)\n","assertions":"assert result.name == \"math_pipe\"\nassert result.steps == [15, 30, 25]\ntry:\n build_pipeline(lambda x: x - 100, initial=50, validator=lambda v: v \u003e= 0)\n assert False, \"Should have raised ValueError\"\nexcept ValueError:\n pass\n","category":"syntax_completion"} {"id":"25","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import TypeVar, Generic, ClassVar\nfrom typing import Protocol, runtime_checkable\n\nT = TypeVar(\u0027T\u0027)\n\n@runtime_checkable\nclass Serializable(Protocol):\n def serialize(self) -\u003e str: ...\n\nclass PluginBase(Generic[T]):\n _registry: ClassVar[dict[str, type]] = {}\n\n def __init_subclass__(cls, /, plugin_name: str = \"\", **kwargs):\n super().__init_subclass__(**kwargs)\n name = plugin_name or cls.__name__.lower()\n cls._registry[name] = cls\n\n @classmethod\n def get_plugin(cls, name: str) -\u003e type:\n if name not in cls._registry:\n raise KeyError(f\"Plugin \u0027{name}\u0027 not found\")\n return cls._registry[name]\n\n","golden_completion":"class JsonPlugin(PluginBase[dict], plugin_name=\"json\"):\n def __init__(self, data: dict):\n self.data = data\n def serialize(self) -\u003e str:\n import json\n return json.dumps(self.data)\n","suffix":"\nclass TextPlugin(PluginBase[str], plugin_name=\"text\"):\n def __init__(self, text: str):\n self.text = text\n def serialize(self) -\u003e str:\n return self.text\n\njp = JsonPlugin({\"key\": \"value\"})\ntp = TextPlugin(\"hello\")\n","assertions":"assert PluginBase.get_plugin(\"json\") is JsonPlugin\nassert PluginBase.get_plugin(\"text\") is TextPlugin\nassert jp.serialize() == \u0027{\"key\": \"value\"}\u0027\nassert tp.serialize() == \"hello\"\nassert isinstance(jp, Serializable)\nassert isinstance(tp, Serializable)\ntry:\n PluginBase.get_plugin(\"missing\")\n assert False, \"Should raise KeyError\"\nexcept KeyError:\n pass\n","category":"syntax_completion"} {"id":"26","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import List, Union\n\n# Recursive generator to flatten arbitrarily nested lists\n# Handles any depth of nesting using yield from delegation\n# Example: [1, [2, [3]]] -\u003e [1, 2, 3]\n\nNestedList = Union[int, List[\u0027NestedList\u0027]]\n\ndef flatten(nested_list: NestedList):\n \"\"\"Yield all non-list elements from a nested list structure.\"\"\"\n for item in nested_list:\n if isinstance(item, list):\n","golden_completion":" yield from flatten(item)\n else:\n yield item\n","suffix":"\ndata = [1, [2, [3, 4], 5], [6, 7]]\nresult = list(flatten(data))\nprint(result)\n","assertions":"assert list(flatten([1, [2, [3, 4], 5], [6, 7]])) == [1, 2, 3, 4, 5, 6, 7]\nassert list(flatten([])) == []\nassert list(flatten([1, 2, 3])) == [1, 2, 3]\nassert list(flatten([[[[1]]]])) == [1]\n","category":"syntax_completion"} {"id":"27","testsource":"devbench-syntax-completion","language":"python","prefix":"# Generator that acts as a running accumulator using the send() protocol.\n# Usage:\n# gen = accumulator()\n# next(gen) # prime the generator, returns 0\n# gen.send(10) # returns 10 (running total)\n# gen.send(20) # returns 30\n# gen.send(None) # stops and returns final total via StopIteration\n\ndef accumulator():\n \"\"\"A generator that accumulates sent values. Send None to finish.\"\"\"\n total = 0\n while True:\n value = yield total\n","golden_completion":" if value is None:\n return total\n total += value\n","suffix":"\ngen = accumulator()\nnext(gen) # prime the generator\ngen.send(10)\ngen.send(20)\nresult = gen.send(30)\nprint(result)\n","assertions":"gen = accumulator()\nnext(gen)\ngen.send(10)\ngen.send(20)\nassert gen.send(30) == 60\ngen2 = accumulator()\nnext(gen2)\nassert gen2.send(5) == 5\n","category":"syntax_completion"} {"id":"28","testsource":"devbench-syntax-completion","language":"python","prefix":"# A stateful counter generator supporting:\n# - next(): increment by current step and yield count\n# - send(n): change the step to n\n# - throw(ResetSignal): reset count to starting value\n\nclass ResetSignal(Exception):\n \"\"\"Exception used to signal the counter to reset.\"\"\"\n pass\n\ndef stateful_counter(start=0, step=1):\n \"\"\"Generator that counts with adjustable step and reset capability.\"\"\"\n count = start\n while True:\n try:\n sent = yield count\n","golden_completion":" if sent is not None:\n step = sent\n count += step\n except ResetSignal:\n count = start\n","suffix":"\ncounter = stateful_counter(0, 1)\nassert next(counter) == 0\nassert next(counter) == 1\nassert next(counter) == 2\ncounter.send(5)\nresult = next(counter)\nprint(f\"After step change: {result}\")\ncounter.throw(ResetSignal)\nresult_after_reset = next(counter)\nprint(f\"After reset: {result_after_reset}\")\n","assertions":"c = stateful_counter(0, 1)\nassert next(c) == 0\nassert next(c) == 1\nassert next(c) == 2\nc.send(5)\nassert next(c) == 12\nc.throw(ResetSignal)\nassert next(c) == 5\n","category":"syntax_completion"} {"id":"29","testsource":"devbench-syntax-completion","language":"python","prefix":"import math\nfrom typing import Generator\n\n# Generate squares of prime numbers below a given threshold.\n# Uses a nested helper function for primality testing.\n\ndef prime_squares_below(n: int) -\u003e Generator[int, None, None]:\n \"\"\"Generate squares of primes below n.\n\n Args:\n n: Upper bound (exclusive) for prime candidates.\n\n Yields:\n The square of each prime below n.\n \"\"\"\n def is_prime(x: int) -\u003e bool:\n if x \u003c 2:\n return False\n return all(x % i != 0 for i in range(2, int(math.sqrt(x)) + 1))\n\n","golden_completion":" primes = (x for x in range(2, n) if is_prime(x))\n return (p * p for p in primes)\n","suffix":"\nresult = list(prime_squares_below(20))\nprint(result)\n","assertions":"assert list(prime_squares_below(10)) == [4, 9, 25, 49]\nassert list(prime_squares_below(2)) == []\nassert list(prime_squares_below(20)) == [4, 9, 25, 49, 121, 169, 289, 361]\n","category":"syntax_completion"} {"id":"30","testsource":"devbench-syntax-completion","language":"python","prefix":"def sub_generator(items):\n total = 0\n for item in items:\n total += item\n yield item\n return total\n\ndef delegating_generator(lists):\n totals = []\n for lst in lists:\n","golden_completion":" total = yield from sub_generator(lst)\n totals.append(total)\n yield totals\n","suffix":"\ngen = delegating_generator([[1, 2, 3], [4, 5]])\nyielded = []\ntry:\n while True:\n yielded.append(next(gen))\nexcept StopIteration:\n pass\nprint(f\"Yielded: {yielded}\")\n","assertions":"gen = delegating_generator([[1, 2, 3], [4, 5]])\nyielded = []\ntry:\n while True:\n yielded.append(next(gen))\nexcept StopIteration:\n pass\nassert yielded == [1, 2, 3, 4, 5, [6, 9]]\n","category":"syntax_completion"} {"id":"31","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import List, Dict, Any\n\n# Sort a list of employee records by multiple criteria:\n# Primary: age descending (oldest first)\n# Secondary: name ascending (alphabetical tiebreaker)\n\ndata: List[Dict[str, Any]] = [\n {\u0027name\u0027: \u0027Alice\u0027, \u0027age\u0027: 30},\n {\u0027name\u0027: \u0027Bob\u0027, \u0027age\u0027: 25},\n {\u0027name\u0027: \u0027Charlie\u0027, \u0027age\u0027: 35},\n]\n\n# Use sorted() with a lambda key that returns a tuple\nsorted_data = sorted(data,\n","golden_completion":" key=lambda x: (-x[\u0027age\u0027], x[\u0027name\u0027])\n)\n\nprint(f\"Sorted {len(sorted_data)} records by age desc, name asc\")\n","suffix":"\nprint(sorted_data)\n","assertions":"assert sorted_data[0][\u0027name\u0027] == \u0027Charlie\u0027\nassert sorted_data[1][\u0027name\u0027] == \u0027Alice\u0027\nassert sorted_data[2][\u0027name\u0027] == \u0027Bob\u0027\n","category":"syntax_completion"} {"id":"32","testsource":"devbench-syntax-completion","language":"python","prefix":"from functools import reduce\nfrom typing import Callable, Any\n\n# A function pipeline builder that composes multiple functions.\n# Functions are applied left-to-right:\n# make_pipeline(f, g, h)(x) == h(g(f(x)))\n# An empty pipeline returns the identity function.\n#\n# Implementation uses functools.reduce with nested lambdas.\n\ndef make_pipeline(*functions: Callable[[Any], Any]) -\u003e Callable[[Any], Any]:\n \"\"\"Create a pipeline that applies functions left-to-right.\"\"\"\n","golden_completion":" if not functions:\n return lambda x: x\n return lambda x: reduce(lambda acc, fn: fn(acc), functions, x)\n","suffix":"\npipeline = make_pipeline(\n lambda x: x * 2,\n lambda x: x + 10,\n lambda x: x ** 2\n)\nresult = pipeline(5)\nprint(f\"Pipeline result: {result}\")\n","assertions":"pipeline = make_pipeline(lambda x: x * 2, lambda x: x + 10, lambda x: x ** 2)\nassert pipeline(5) == 400\nassert pipeline(0) == 100\nidentity = make_pipeline()\nassert identity(42) == 42\n","category":"syntax_completion"} {"id":"33","testsource":"devbench-syntax-completion","language":"python","prefix":"# Memoized Fibonacci implementation using a single lambda expression.\n# This leverages Python\u0027s mutable default argument trick:\n# The _cache dict persists across calls because default arguments\n# are evaluated once at function definition time.\n#\n# The lambda must use only expressions (no statements), so we\n# use dict.setdefault() to both store and return the computed value.\n# _cache.setdefault(key, value) returns _cache[key] if it exists,\n# otherwise sets _cache[key] = value and returns value.\n\nfib = lambda n, _cache={0: 0, 1: 1}: (\n","golden_completion":" _cache[n] if n in _cache else _cache.setdefault(n, fib(n - 1) + fib(n - 2))\n)\n","suffix":"\nresults = [fib(i) for i in range(10)]\nprint(results)\n","assertions":"assert fib(0) == 0\nassert fib(1) == 1\nassert fib(10) == 55\nassert fib(20) == 6765\nassert [fib(i) for i in range(10)] == [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]\n","category":"syntax_completion"} {"id":"34","testsource":"devbench-syntax-completion","language":"python","prefix":"from functools import reduce\nfrom typing import List\n\n# Functional programming pipeline using reduce, map, and filter:\n# 1. Start with numbers 1 through 10\n# 2. Filter to keep only even numbers: [2, 4, 6, 8, 10]\n# 3. Square each: [4, 16, 36, 64, 100]\n# 4. Sum them all: 220\n\nnumbers: List[int] = list(range(1, 11))\n\nresult = reduce(\n lambda a, b: a + b,\n map(\n","golden_completion":" lambda x: x ** 2,\n filter(lambda x: x % 2 == 0, numbers)\n )\n)\n","suffix":"\nprint(f\"Result: {result}\")\n","assertions":"assert result == 220\n","category":"syntax_completion"} {"id":"35","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import List, Callable\n\ndef group_and_sort(\n items: List[dict],\n group_key: str,\n sort_key: Callable\n) -\u003e dict:\n groups = {}\n for item in items:\n key = item[group_key]\n groups.setdefault(key, []).append(item)\n","golden_completion":" return {\n k: sorted(v, key=sort_key)\n for k, v in sorted(groups.items())\n }\n","suffix":"\nemployees = [\n {\u0027dept\u0027: \u0027eng\u0027, \u0027name\u0027: \u0027Zara\u0027, \u0027salary\u0027: 90000},\n {\u0027dept\u0027: \u0027eng\u0027, \u0027name\u0027: \u0027Alice\u0027, \u0027salary\u0027: 120000},\n {\u0027dept\u0027: \u0027hr\u0027, \u0027name\u0027: \u0027Bob\u0027, \u0027salary\u0027: 80000},\n {\u0027dept\u0027: \u0027hr\u0027, \u0027name\u0027: \u0027Diana\u0027, \u0027salary\u0027: 95000},\n {\u0027dept\u0027: \u0027eng\u0027, \u0027name\u0027: \u0027Mona\u0027, \u0027salary\u0027: 110000},\n]\n\nresult = group_and_sort(\n employees,\n \u0027dept\u0027,\n lambda x: (-x[\u0027salary\u0027], x[\u0027name\u0027])\n)\nfor dept, members in result.items():\n print(f\"{dept}: {[m[\u0027name\u0027] for m in members]}\")\n","assertions":"result = group_and_sort(\n employees,\n \u0027dept\u0027,\n lambda x: (-x[\u0027salary\u0027], x[\u0027name\u0027])\n)\nassert list(result.keys()) == [\u0027eng\u0027, \u0027hr\u0027]\nassert [m[\u0027name\u0027] for m in result[\u0027eng\u0027]] == [\u0027Alice\u0027, \u0027Mona\u0027, \u0027Zara\u0027]\nassert [m[\u0027name\u0027] for m in result[\u0027hr\u0027]] == [\u0027Diana\u0027, \u0027Bob\u0027]\n","category":"syntax_completion"} {"id":"36","testsource":"devbench-syntax-completion","language":"python","prefix":"import asyncio\n\nclass AsyncResource:\n def __init__(self, name):\n self.name = name\n self.is_open = False\n\n async def __aenter__(self):\n await asyncio.sleep(0.01)\n self.is_open = True\n return self\n\n async def __aexit__(self, exc_type, exc_val, exc_tb):\n await asyncio.sleep(0.01)\n self.is_open = False\n return False\n\nasync def use_resource():\n","golden_completion":" async with AsyncResource(\"db\") as res:\n assert res.is_open\n return res.name\n","suffix":"\nresult = asyncio.run(use_resource())\nprint(f\"Used resource: {result}\")\n","assertions":"assert asyncio.run(use_resource()) == \"db\"\n","category":"syntax_completion"} {"id":"37","testsource":"devbench-syntax-completion","language":"python","prefix":"import asyncio\n\nasync def async_range(start, stop, step=1):\n current = start\n while current \u003c stop:\n await asyncio.sleep(0.001)\n yield current\n current += step\n\nasync def collect_items():\n items = []\n","golden_completion":" async for i in async_range(0, 10, 3):\n items.append(i * i)\n return items\n","suffix":"\nresult = asyncio.run(collect_items())\nprint(f\"Collected: {result}\")\n","assertions":"assert asyncio.run(collect_items()) == [0, 9, 36, 81]\n","category":"syntax_completion"} {"id":"38","testsource":"devbench-syntax-completion","language":"python","prefix":"import asyncio\n\nasync def risky_task(n: int) -\u003e str:\n await asyncio.sleep(0.01)\n if n % 3 == 0:\n raise ValueError(f\"Bad value: {n}\")\n return f\"ok:{n}\"\n\nasync def run_with_error_handling(values):\n tasks = [risky_task(v) for v in values]\n","golden_completion":" results = await asyncio.gather(*tasks, return_exceptions=True)\n successes = [r for r in results if isinstance(r, str)]\n failures = [r for r in results if isinstance(r, Exception)]\n return successes, failures\n","suffix":"\nasync def main():\n ok, errs = await run_with_error_handling([1, 2, 3, 4, 5, 6])\n print(f\"Successes: {ok}\")\n print(f\"Failures: {len(errs)}\")\n return ok, errs\n\nok, errs = asyncio.run(main())\n","assertions":"ok, errs = asyncio.run(main())\nassert ok == [\u0027ok:1\u0027, \u0027ok:2\u0027, \u0027ok:4\u0027, \u0027ok:5\u0027]\nassert len(errs) == 2\nassert all(isinstance(e, ValueError) for e in errs)\n","category":"syntax_completion"} {"id":"39","testsource":"devbench-syntax-completion","language":"python","prefix":"import asyncio\n\nclass AsyncPool:\n def __init__(self, size):\n self.size = size\n self.semaphore = None\n\n async def __aenter__(self):\n self.semaphore = asyncio.Semaphore(self.size)\n return self\n\n async def __aexit__(self, *args):\n self.semaphore = None\n\n async def run(self, coro):\n async with self.semaphore:\n return await coro\n\nasync def worker(n):\n await asyncio.sleep(0.01)\n return n * 10\n\nasync def main():\n","golden_completion":" async with AsyncPool(3) as pool:\n tasks = [pool.run(worker(i)) for i in range(5)]\n results = await asyncio.gather(*tasks)\n return sorted(results)\n","suffix":"\noutput = asyncio.run(main())\nprint(f\"Pool results: {output}\")\n","assertions":"assert asyncio.run(main()) == [0, 10, 20, 30, 40]\n","category":"syntax_completion"} {"id":"40","testsource":"devbench-syntax-completion","language":"python","prefix":"import asyncio\nfrom typing import Union\n\n# Demonstrate asyncio.wait_for for adding timeouts to async operations.\n# If the operation takes longer than timeout_sec, return \"timed out\".\n\nasync def slow_operation(duration: float, label: str) -\u003e str:\n \"\"\"Simulate a slow I/O-bound operation.\"\"\"\n await asyncio.sleep(duration)\n return f\"{label} done\"\n\nasync def run_with_timeout(duration: float, timeout_sec: float) -\u003e str:\n try:\n","golden_completion":" result = await asyncio.wait_for(\n slow_operation(duration, \"task\"),\n timeout=timeout_sec\n )\n return result\n except asyncio.TimeoutError:\n return \"timed out\"\n","suffix":"\nasync def main():\n r1 = await run_with_timeout(0.01, 1.0)\n r2 = await run_with_timeout(2.0, 0.01)\n return r1, r2\n\nresult = asyncio.run(main())\nprint(result)\n","assertions":"r1, r2 = asyncio.run(main())\nassert r1 == \"task done\"\nassert r2 == \"timed out\"\n","category":"syntax_completion"} {"id":"41","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import List, Tuple\n\n# Format a tabular report of items with aligned columns.\n# Uses f-string format specification for alignment:\n# \u003c left-align, \u003e right-align, .2f two decimal places\n\ndef format_report(items: List[Tuple[str, int, float]]) -\u003e str:\n \"\"\"Create a formatted table with headers, separator, and data rows.\"\"\"\n lines = []\n lines.append(f\"{\u0027Item\u0027:\u003c20}{\u0027Qty\u0027:\u003e8}{\u0027Price\u0027:\u003e12}\")\n lines.append(\"-\" * 40)\n for name, qty, price in items:\n","golden_completion":" lines.append(f\"{name:\u003c20}{qty:\u003e8}{price:\u003e12.2f}\")\n return \"\\n\".join(lines)\n","suffix":"\nitems = [(\"Widget\", 100, 9.99), (\"Gadget\", 50, 24.5), (\"Doohickey\", 200, 1.5)]\nreport = format_report(items)\nprint(report)\n","assertions":"report = format_report([(\"Widget\", 100, 9.99)])\nassert \"Widget\" in report\nassert \"9.99\" in report\nlines = report.split(\"\\n\")\nassert len(lines) == 3\nassert lines[0].startswith(\"Item\")\n","category":"syntax_completion"} {"id":"42","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import List, Tuple, Any\n\n# Format a table with dynamic column widths and alignment.\n# col_widths is a list of (width, align_char) tuples where\n# align_char is \u0027\u003c\u0027 for left or \u0027\u003e\u0027 for right alignment.\n# Uses nested f-strings: f\"{val:{align}{width}}\" where the\n# format spec itself is computed from variables.\n\ndef format_table(data: List[List[Any]], col_widths: List[Tuple[int, str]]) -\u003e str:\n \"\"\"Format data into an aligned table using nested f-strings.\"\"\"\n rows = []\n for row in data:\n formatted = \" | \".join(\n","golden_completion":" f\"{str(val):{align}{width}}\"\n for val, (width, align) in zip(row, col_widths)\n )\n rows.append(formatted)\n return \"\\n\".join(rows)\n","suffix":"\ndata = [\n [\"Alice\", 30, 95.5],\n [\"Bob\", 25, 87.3],\n]\ncol_widths = [(10, \"\u003c\"), (5, \"\u003e\"), (8, \"\u003e\")]\nprint(format_table(data, col_widths))\n","assertions":"result = format_table(data, col_widths)\nlines = result.strip().split(\"\\n\")\nassert len(lines) == 2\nassert \"Alice\" in lines[0]\nassert \"Bob\" in lines[1]\n","category":"syntax_completion"} {"id":"43","testsource":"devbench-syntax-completion","language":"python","prefix":"class LogEntry:\n def __init__(self, level, message, context=None):\n self.level = level\n self.message = message\n self.context = context\n\n def __repr__(self):\n return f\"LogEntry({self.level!r}, {self.message!r})\"\n\n def __str__(self):\n return f\"[{self.level}] {self.message}\"\n\n def format_log(self, verbose=False):\n","golden_completion":" ctx = f\" ctx={self.context!r}\" if self.context else \"\"\n if verbose:\n return f\"{self!r}{ctx}\"\n return f\"{self!s}{ctx}\"\n","suffix":"\nentry = LogEntry(\"ERROR\", \"disk full\", {\"host\": \"srv1\"})\nprint(entry.format_log(verbose=False))\nprint(entry.format_log(verbose=True))\n\nentry2 = LogEntry(\"INFO\", \"started\")\nprint(entry2.format_log())\n","assertions":"e = LogEntry(\"ERROR\", \"fail\", {\"k\": \"v\"})\nassert \"ERROR\" in e.format_log()\nassert \"LogEntry(\" in e.format_log(verbose=True)\nassert \"ctx=\" in e.format_log(verbose=True)\ne2 = LogEntry(\"INFO\", \"ok\")\nassert \"ctx=\" not in e2.format_log()\nassert e2.format_log() == \"[INFO] ok\"\nassert e2.format_log(verbose=True) == \"LogEntry(\u0027INFO\u0027, \u0027ok\u0027)\"\n","category":"syntax_completion"} {"id":"44","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import List, Dict, Any\n\n# Summarize student scores with grades and formatted output.\n# Grade thresholds: A \u003e= 90, B \u003e= 80, C \u003e= 70, else F.\n# Output format: \"Name: avg=XX.X (Grade) [score1, score2, ...]\"\n\ndef summarize_scores(students: List[Dict[str, Any]]) -\u003e List[str]:\n \"\"\"Create a summary line for each student with average and grade.\"\"\"\n summaries = []\n for student in students:\n scores = student[\u0027scores\u0027]\n avg = sum(scores) / len(scores)\n","golden_completion":" grade = \u0027A\u0027 if avg \u003e= 90 else \u0027B\u0027 if avg \u003e= 80 else \u0027C\u0027 if avg \u003e= 70 else \u0027F\u0027\n summaries.append(\n f\"{student[\u0027name\u0027]}: avg={avg:.1f} ({grade}) \"\n f\"[{\u0027, \u0027.join(str(s) for s in scores)}]\"\n )\n return summaries\n","suffix":"\nstudents = [\n {\u0027name\u0027: \u0027Alice\u0027, \u0027scores\u0027: [95, 87, 92]},\n {\u0027name\u0027: \u0027Bob\u0027, \u0027scores\u0027: [72, 68, 75]},\n {\u0027name\u0027: \u0027Charlie\u0027, \u0027scores\u0027: [88, 91, 84]},\n]\nfor line in summarize_scores(students):\n print(line)\n","assertions":"result = summarize_scores(students)\nassert len(result) == 3\nassert \u0027Alice\u0027 in result[0]\nassert \u002791.3\u0027 in result[0]\nassert \u0027(A)\u0027 in result[0]\nassert \u0027Bob\u0027 in result[1]\nassert \u0027(C)\u0027 in result[1]\nassert \u0027Charlie\u0027 in result[2]\nassert \u0027(B)\u0027 in result[2]\n","category":"syntax_completion"} {"id":"45","testsource":"devbench-syntax-completion","language":"python","prefix":"import datetime\n\nclass Event:\n def __init__(self, name, dt, duration_min, tags=None):\n self.name = name\n self.dt = dt\n self.duration_min = duration_min\n self.tags = tags or []\n\n def format_duration(self):\n h, m = divmod(self.duration_min, 60)\n return f\"{h}h{m:02d}m\" if h else f\"{m}m\"\n\n def to_line(self, width=50):\n","golden_completion":" tags_str = f\" [{\u0027, \u0027.join(self.tags)}]\" if self.tags else \"\"\n return (\n f\"{self.name:\u003c{width - 25}}\"\n f\"{self.dt:%Y-%m-%d %H:%M} \"\n f\"{self.format_duration():\u003e6}\"\n f\"{tags_str}\"\n )\n","suffix":"\nevents = [\n Event(\"Team Meeting\", datetime.datetime(2024, 6, 15, 9, 30), 90, [\"work\", \"weekly\"]),\n Event(\"Lunch\", datetime.datetime(2024, 6, 15, 12, 0), 45),\n]\nfor e in events:\n print(e.to_line())\n","assertions":"e1 = Event(\"Test\", datetime.datetime(2024, 1, 1, 10, 0), 90, [\"a\"])\nline = e1.to_line()\nassert \"Test\" in line\nassert \"2024-01-01 10:00\" in line\nassert \"1h30m\" in line\nassert \"[a]\" in line\ne2 = Event(\"Short\", datetime.datetime(2024, 1, 1, 10, 0), 30)\nline2 = e2.to_line()\nassert \"30m\" in line2\nassert \"[\" not in line2\n","category":"syntax_completion"} {"id":"46","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import Dict, Type\n\n# Plugin registration system using __init_subclass__.\n# Subclasses are automatically registered when they are defined.\n# If plugin_name is provided, use it; otherwise default to\n# the lowercase class name.\n\nclass Plugin:\n \"\"\"Base class that auto-registers subclasses in _registry.\"\"\"\n _registry: Dict[str, Type[\u0027Plugin\u0027]] = {}\n\n def __init_subclass__(cls, *, plugin_name=None, **kwargs):\n super().__init_subclass__(**kwargs)\n","golden_completion":" name = plugin_name or cls.__name__.lower()\n Plugin._registry[name] = cls\n","suffix":"\nclass AuthPlugin(Plugin, plugin_name=\"auth\"):\n def run(self):\n return \"authenticating\"\n\nclass LogPlugin(Plugin, plugin_name=\"log\"):\n def run(self):\n return \"logging\"\n\nclass DefaultPlugin(Plugin):\n def run(self):\n return \"default\"\n\nprint(Plugin._registry)\n","assertions":"assert \"auth\" in Plugin._registry\nassert \"log\" in Plugin._registry\nassert \"defaultplugin\" in Plugin._registry\nassert Plugin._registry[\"auth\"] is AuthPlugin\nassert Plugin._registry[\"log\"]().run() == \"logging\"\n","category":"syntax_completion"} {"id":"47","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import Any\n\n# A type-enforcing map that uses __class_getitem__ to enable\n# the subscription syntax: TypedMap[str, int] creates an\n# instance that only accepts str keys and int values.\n\nclass TypedMap:\n \"\"\"A dictionary-like class with runtime type checking.\"\"\"\n\n def __init__(self, key_type: type, val_type: type):\n self._key_type = key_type\n self._val_type = val_type\n self._data: dict = {}\n\n def __class_getitem__(cls, params):\n","golden_completion":" key_type, val_type = params\n return cls(key_type, val_type)\n","suffix":"\n def put(self, key, value):\n if not isinstance(key, self._key_type):\n raise TypeError(f\"Key must be {self._key_type.__name__}\")\n if not isinstance(value, self._val_type):\n raise TypeError(f\"Value must be {self._val_type.__name__}\")\n self._data[key] = value\n\n def get(self, key):\n return self._data.get(key)\n\nm = TypedMap[str, int]\nm.put(\"age\", 30)\nprint(m.get(\"age\"))\n","assertions":"m = TypedMap[str, int]\nm.put(\"x\", 1)\nassert m.get(\"x\") == 1\ntry:\n m.put(123, \"bad\")\n assert False, \"Should have raised TypeError\"\nexcept TypeError:\n pass\ntry:\n m.put(\"y\", \"bad\")\n assert False, \"Should have raised TypeError\"\nexcept TypeError:\n pass\n","category":"syntax_completion"} {"id":"48","testsource":"devbench-syntax-completion","language":"python","prefix":"# Descriptor with __set_name__ for automatic attribute name discovery.\n# Uses a private storage name to avoid infinite recursion in __get__/__set__.\n# Validates that values fall within min_val and max_val bounds.\n\nclass ValidatedField:\n \"\"\"A descriptor that validates numeric bounds on attribute assignment.\"\"\"\n\n def __init__(self, min_val=None, max_val=None):\n self.min_val = min_val\n self.max_val = max_val\n\n def __set_name__(self, owner, name):\n self.name = name\n self.storage_name = f\"_validated_{name}\"\n\n def __get__(self, obj, objtype=None):\n if obj is None:\n return self\n return getattr(obj, self.storage_name, None)\n\n def __set__(self, obj, value):\n","golden_completion":" if self.min_val is not None and value \u003c self.min_val:\n raise ValueError(f\"{self.name} must be \u003e= {self.min_val}\")\n if self.max_val is not None and value \u003e self.max_val:\n raise ValueError(f\"{self.name} must be \u003c= {self.max_val}\")\n setattr(obj, self.storage_name, value)\n","suffix":"\nclass Product:\n price = ValidatedField(min_val=0)\n quantity = ValidatedField(min_val=0, max_val=1000)\n\np = Product()\np.price = 9.99\np.quantity = 100\nprint(f\"Price: {p.price}, Qty: {p.quantity}\")\n","assertions":"p = Product()\np.price = 10\nassert p.price == 10\np.quantity = 500\nassert p.quantity == 500\ntry:\n p.price = -1\n assert False, \"Should raise ValueError\"\nexcept ValueError:\n pass\ntry:\n p.quantity = 1001\n assert False, \"Should raise ValueError\"\nexcept ValueError:\n pass\nassert Product.price is not None\n","category":"syntax_completion"} {"id":"49","testsource":"devbench-syntax-completion","language":"python","prefix":"from typing import runtime_checkable, Protocol, Iterable\n\n@runtime_checkable\nclass Renderable(Protocol):\n def render(self) -\u003e str: ...\n\n@runtime_checkable\nclass Sizeable(Protocol):\n def size(self) -\u003e int: ...\n\ndef render_all(items: Iterable[Renderable]) -\u003e str:\n","golden_completion":" parts = []\n for item in items:\n if not isinstance(item, Renderable):\n raise TypeError(f\"{type(item).__name__} is not Renderable\")\n parts.append(item.render())\n return \"\\n\".join(parts)\n","suffix":"\nclass Widget:\n def __init__(self, label):\n self.label = label\n def render(self) -\u003e str:\n return f\"\u003cWidget: {self.label}\u003e\"\n def size(self) -\u003e int:\n return len(self.label)\n\nclass Text:\n def __init__(self, content):\n self.content = content\n def render(self) -\u003e str:\n return self.content\n\nwidgets = [Widget(\"btn\"), Text(\"hello\")]\nprint(render_all(widgets))\n","assertions":"assert isinstance(Widget(\"x\"), Renderable)\nassert isinstance(Widget(\"x\"), Sizeable)\nassert isinstance(Text(\"x\"), Renderable)\nassert not isinstance(Text(\"x\"), Sizeable)\nresult = render_all([Widget(\"a\"), Text(\"b\")])\nassert \"\u003cWidget: a\u003e\" in result\nassert \"b\" in result\ntry:\n render_all([42])\n assert False, \"Should raise TypeError\"\nexcept TypeError:\n pass\n","category":"syntax_completion"} {"id":"50","testsource":"devbench-syntax-completion","language":"python","prefix":"class EventSystem:\n _handlers = {}\n\n def __init_subclass__(cls, *, event_type=None, **kwargs):\n super().__init_subclass__(**kwargs)\n if event_type:\n EventSystem._handlers.setdefault(event_type, []).append(cls)\n\n @classmethod\n def dispatch(cls, event_type, data):\n","golden_completion":" results = []\n for handler_cls in cls._handlers.get(event_type, []):\n handler = handler_cls()\n results.append(handler.handle(data))\n return results\n","suffix":"\nclass LogHandler(EventSystem, event_type=\"error\"):\n def handle(self, data):\n return f\"LOG: {data}\"\n\nclass AlertHandler(EventSystem, event_type=\"error\"):\n def handle(self, data):\n return f\"ALERT: {data}\"\n\nclass MetricHandler(EventSystem, event_type=\"metric\"):\n def handle(self, data):\n return f\"METRIC: {data}\"\n\nresults = EventSystem.dispatch(\"error\", \"disk full\")\nprint(results)\n","assertions":"results = EventSystem.dispatch(\"error\", \"test\")\nassert len(results) == 2\nassert \"LOG: test\" in results\nassert \"ALERT: test\" in results\nmetric_results = EventSystem.dispatch(\"metric\", \"cpu=80\")\nassert metric_results == [\"METRIC: cpu=80\"]\nempty = EventSystem.dispatch(\"unknown\", \"x\")\nassert empty == []\n","category":"syntax_completion"} {"id":"1","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as fs from \u0027fs\u0027;\nimport * as path from \u0027path\u0027;\nimport * as os from \u0027os\u0027;\nimport * as assert from \u0027assert\u0027;\n\nfunction atomicWriteJson(filePath: string, data: unknown): { written: number; encoding: string; flag: string } {\n const json = JSON.stringify(data, null, 2);\n const tmp = filePath + \u0027.tmp.\u0027 + process.pid;\n fs.writeFileSync(tmp, json, { encoding: \u0027utf8\u0027, mode: 0o644 });\n fs.renameSync(tmp, filePath);\n return { written: Buffer.byteLength(json, \u0027utf8\u0027), encoding: \u0027utf8\u0027, flag: \u0027w\u0027 };\n}\n\n(atomicWriteJson as any).doc =\n","golden_completion":"`Serialize data with JSON.stringify(data, null, 2) and write to a temporary file (filePath + \u0027.tmp.\u0027 + process.pid) using fs.writeFileSync(tmp, json, { encoding: \u0027utf8\u0027, mode: 0o644 }), then atomically replace the target via fs.renameSync(tmp, filePath). Returns { written, encoding, flag } where written is Buffer.byteLength of the JSON string in UTF-8. The rename is atomic on POSIX so readers never see a partial file. Throws ENOENT if the parent directory does not exist.`","suffix":";\n\nassert.strictEqual(typeof (atomicWriteJson as any).doc, \u0027string\u0027);\nconst dir1 = fs.mkdtempSync(path.join(os.tmpdir(), \u0027ts-api-\u0027));\nconst fp1 = path.join(dir1, \u0027out.json\u0027);\nconst res1 = atomicWriteJson(fp1, { a: 1 });\nassert.strictEqual(res1.encoding, \u0027utf8\u0027);\nassert.strictEqual(res1.flag, \u0027w\u0027);\nassert.strictEqual(fs.readFileSync(fp1, \u0027utf8\u0027), JSON.stringify({ a: 1 }, null, 2));\nfs.rmSync(dir1, { recursive: true, force: true });\nconsole.log(\u0027task1 ok\u0027);\n","assertions":"for (const term of [\n \u0027JSON.stringify(data, null, 2)\u0027,\n \u0027fs.writeFileSync\u0027,\n \u0027fs.renameSync\u0027,\n \u0027Buffer.byteLength\u0027,\n \u0027atomic\u0027,\n \u00270o644\u0027,\n \u0027process.pid\u0027,\n \u0027ENOENT\u0027\n]) {\n assert.ok((atomicWriteJson as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconsole.log(\u0027task1 assertions ok\u0027);\n","category":"api_usage"} {"id":"2","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as crypto from \u0027crypto\u0027;\nimport * as assert from \u0027assert\u0027;\n\nfunction hmacHex(algorithm: string, key: string | Buffer, data: string): string {\n return crypto.createHmac(algorithm, key).update(data, \u0027utf8\u0027).digest(\u0027hex\u0027);\n}\n\n(hmacHex as any).doc =\n","golden_completion":"`Create an HMAC using crypto.createHmac(algorithm, key), feed data with .update(data, \u0027utf8\u0027), and return the hex digest via .digest(\u0027hex\u0027). The algorithm parameter is passed directly to OpenSSL (e.g. \u0027sha256\u0027, \u0027sha512\u0027). Throws ERR_OSSL_EVP_UNSUPPORTED for unknown algorithms and TypeError if key is neither string nor Buffer. The returned hex string length depends on the algorithm\u0027s output size (64 chars for sha256, 128 for sha512).`","suffix":";\n\nassert.strictEqual(typeof (hmacHex as any).doc, \u0027string\u0027);\nconst h1 = hmacHex(\u0027sha256\u0027, \u0027secret\u0027, \u0027hello\u0027);\nassert.strictEqual(h1.length, 64);\nassert.strictEqual(h1, crypto.createHmac(\u0027sha256\u0027, \u0027secret\u0027).update(\u0027hello\u0027, \u0027utf8\u0027).digest(\u0027hex\u0027));\nconst h2 = hmacHex(\u0027sha512\u0027, \u0027key\u0027, \u0027data\u0027);\nassert.strictEqual(h2.length, 128);\nconsole.log(\u0027task2 ok\u0027);\n","assertions":"for (const term of [\n \u0027crypto.createHmac\u0027,\n \u0027.update(data\u0027,\n \u0027.digest\u0027,\n \u0027hex\u0027,\n \u0027OpenSSL\u0027,\n \u0027sha256\u0027,\n \u0027sha512\u0027,\n \u002764\u0027,\n \u0027128\u0027\n]) {\n assert.ok((hmacHex as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconsole.log(\u0027task2 assertions ok\u0027);\n","category":"api_usage"} {"id":"3","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as path from \u0027path\u0027;\nimport * as assert from \u0027assert\u0027;\n\nfunction safeRelative(from: string, to: string): string {\n const absFrom = path.resolve(from);\n const absTo = path.resolve(to);\n const rel = path.relative(absFrom, absTo);\n if (rel.startsWith(\u0027..\u0027)) {\n throw new RangeError(\u0027target is outside base directory\u0027);\n }\n return rel;\n}\n\n(safeRelative as any).doc =\n","golden_completion":"`Resolve both from and to into absolute paths using path.resolve (which resolves against process.cwd() when given relative segments), then compute the relative path from absFrom to absTo with path.relative(absFrom, absTo). If the result starts with \u0027..\u0027 the target is outside the base directory and a RangeError is thrown. Returns the relative path string which may be empty when from and to resolve to the same directory. path.resolve joins right-to-left until an absolute path is formed; path.relative computes the minimal traversal.`","suffix":";\n\nassert.strictEqual(typeof (safeRelative as any).doc, \u0027string\u0027);\nconst r1 = safeRelative(\u0027/home/user/project\u0027, \u0027/home/user/project/src/index.ts\u0027);\nassert.strictEqual(r1, \u0027src/index.ts\u0027);\nassert.strictEqual(safeRelative(\u0027/a/b\u0027, \u0027/a/b\u0027), \u0027\u0027);\nlet threw = false;\ntry { safeRelative(\u0027/a/b/c\u0027, \u0027/a/x\u0027); } catch (e: any) { threw = e instanceof RangeError; }\nassert.strictEqual(threw, true);\nconsole.log(\u0027task3 ok\u0027);\n","assertions":"for (const term of [\n \u0027path.resolve\u0027,\n \u0027path.relative\u0027,\n \u0027process.cwd()\u0027,\n \u0027RangeError\u0027,\n \u0027right-to-left\u0027,\n \u0027empty\u0027\n]) {\n assert.ok((safeRelative as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconsole.log(\u0027task3 assertions ok\u0027);\n","category":"api_usage"} {"id":"4","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nfunction hexRoundTrip(input: string): { hex: string; bytes: number; recovered: string } {\n const buf = Buffer.from(input, \u0027utf8\u0027);\n const hex = buf.toString(\u0027hex\u0027);\n const recovered = Buffer.from(hex, \u0027hex\u0027).toString(\u0027utf8\u0027);\n return { hex, bytes: buf.length, recovered };\n}\n\n(hexRoundTrip as any).doc =\n","golden_completion":"`Encode the input string to a Buffer via Buffer.from(input, \u0027utf8\u0027), convert it to a hexadecimal string with buf.toString(\u0027hex\u0027) where each byte becomes two lowercase hex characters, then decode back with Buffer.from(hex, \u0027hex\u0027).toString(\u0027utf8\u0027). Returns { hex, bytes, recovered } where bytes is buf.length (the byte count, not character count, so multi-byte UTF-8 characters like emoji yield bytes \u003e input.length). The hex string length is always exactly 2 * bytes.`","suffix":";\n\nassert.strictEqual(typeof (hexRoundTrip as any).doc, \u0027string\u0027);\nconst r = hexRoundTrip(\u0027hello\u0027);\nassert.strictEqual(r.hex, \u002768656c6c6f\u0027);\nassert.strictEqual(r.bytes, 5);\nassert.strictEqual(r.recovered, \u0027hello\u0027);\nconst r2 = hexRoundTrip(\u0027\\u00e9\u0027);\nassert.strictEqual(r2.bytes, 2);\nassert.strictEqual(r2.hex.length, 4);\nconsole.log(\u0027task4 ok\u0027);\n","assertions":"for (const term of [\n \u0027Buffer.from(input\u0027,\n \u0027toString\u0027,\n \u0027hex\u0027,\n \u0027lowercase\u0027,\n \u0027two\u0027,\n \u0027buf.length\u0027,\n \u0027multi-byte\u0027,\n \u00272 * bytes\u0027\n]) {\n assert.ok((hexRoundTrip as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst r3 = hexRoundTrip(\u0027\u0027);\nassert.strictEqual(r3.hex, \u0027\u0027);\nassert.strictEqual(r3.bytes, 0);\nconsole.log(\u0027task4 assertions ok\u0027);\n","category":"api_usage"} {"id":"5","testsource":"devbench-api-usage","language":"typescript","prefix":"import { pipeline, Readable, Transform, Writable } from \u0027stream\u0027;\nimport { promisify } from \u0027util\u0027;\nimport * as assert from \u0027assert\u0027;\n\nconst pipelineAsync = promisify(pipeline);\n\nasync function uppercasePipeline(chunks: string[]): Promise\u003cstring[]\u003e {\n const results: string[] = [];\n const source = Readable.from(chunks);\n const upper = new Transform({\n objectMode: true,\n transform(chunk: string, _enc: string, cb: (err: Error | null, data?: string) =\u003e void) {\n cb(null, chunk.toUpperCase());\n }\n });\n const sink = new Writable({\n objectMode: true,\n write(chunk: string, _enc: string, cb: (err: Error | null) =\u003e void) {\n results.push(chunk);\n cb(null);\n }\n });\n await pipelineAsync(source, upper, sink);\n return results;\n}\n\n(uppercasePipeline as any).doc =\n","golden_completion":"`Create a Readable from chunks via Readable.from(chunks), pipe through a Transform in objectMode that calls chunk.toUpperCase() in the transform(chunk, encoding, callback) method, and collect results in a Writable\u0027s write(chunk, encoding, callback). Uses promisify(pipeline) so the returned Promise rejects on stream errors and all streams are properly destroyed on failure. pipeline automatically calls .destroy() on all streams if any stream errors, unlike manual .pipe() which leaks resources. objectMode means chunks are passed as-is (strings) not Buffers.`","suffix":";\n\nassert.strictEqual(typeof (uppercasePipeline as any).doc, \u0027string\u0027);\n(async () =\u003e {\n const result = await uppercasePipeline([\u0027hello\u0027, \u0027world\u0027]);\n assert.deepStrictEqual(result, [\u0027HELLO\u0027, \u0027WORLD\u0027]);\n const empty = await uppercasePipeline([]);\n assert.deepStrictEqual(empty, []);\n console.log(\u0027task5 ok\u0027);\n})();\n","assertions":"for (const term of [\n \u0027Readable.from\u0027,\n \u0027objectMode\u0027,\n \u0027Transform\u0027,\n \u0027Writable\u0027,\n \u0027promisify(pipeline)\u0027,\n \u0027.destroy()\u0027,\n \u0027.pipe()\u0027,\n \u0027callback\u0027\n]) {\n assert.ok((uppercasePipeline as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconsole.log(\u0027task5 assertions ok\u0027);\n","category":"api_usage"} {"id":"6","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Create a Buffer filled with a repeating pattern.\n// Buffer.alloc(size, fill, encoding) zero-fills first then fills with the pattern.\n// When fill is a string and encoding is \u0027utf8\u0027, the fill pattern repeats to cover the buffer.\n// If the fill pattern is longer than the buffer, it is truncated.\n\nfunction createPatternBuffer(size: number, pattern: string): Buffer {\n","golden_completion":" return Buffer.alloc(size, pattern, \u0027utf8\u0027);\n","suffix":"}\n\nconst buf1 = createPatternBuffer(10, \u0027ab\u0027);\nassert.strictEqual(buf1.toString(\u0027utf8\u0027), \u0027ababababab\u0027);\nassert.strictEqual(buf1.length, 10);\n\nconst buf2 = createPatternBuffer(3, \u0027hello\u0027);\nassert.strictEqual(buf2.toString(\u0027utf8\u0027), \u0027hel\u0027);\n\nconst buf3 = createPatternBuffer(5, \u0027x\u0027);\nassert.strictEqual(buf3.toString(\u0027utf8\u0027), \u0027xxxxx\u0027);\n\nconst buf4 = createPatternBuffer(0, \u0027abc\u0027);\nassert.strictEqual(buf4.length, 0);\nassert.strictEqual(buf4.toString(\u0027utf8\u0027), \u0027\u0027);\nconsole.log(\u0027task6 ok\u0027);\n","assertions":"// Verify multi-byte pattern fill (UTF-8 multi-byte char)\nconst buf5 = createPatternBuffer(6, \u0027\\u00e9\u0027);\n// \\u00e9 is 2 bytes in UTF-8 (0xc3 0xa9), so 6 bytes = 3 repetitions\nassert.strictEqual(buf5.toString(\u0027utf8\u0027), \u0027\\u00e9\\u00e9\\u00e9\u0027);\n\n// Single byte fills\nconst buf6 = createPatternBuffer(4, \u0027Z\u0027);\nassert.strictEqual(buf6.toString(\u0027utf8\u0027), \u0027ZZZZ\u0027);\n\n// Verify it uses Buffer.alloc (zero-filled base), not allocUnsafe\nconst buf7 = createPatternBuffer(1, \u0027\u0027);\n// empty fill string means Buffer.alloc gives zeros\nassert.strictEqual(buf7[0], 0);\nconsole.log(\u0027task6 assertions ok\u0027);\n","category":"api_usage"} {"id":"7","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as crypto from \u0027crypto\u0027;\nimport * as assert from \u0027assert\u0027;\n\n// Implement a timing-safe string comparison.\n// crypto.timingSafeEqual requires BOTH Buffers to be the SAME length;\n// if lengths differ it throws RangeError.\n// To compare arbitrary strings safely: first check if lengths match,\n// then use timingSafeEqual on the Buffer representations.\n// Return { equal: boolean; lengthMatch: boolean }.\n\nfunction safeCompare(a: string, b: string): { equal: boolean; lengthMatch: boolean } {\n","golden_completion":" const bufA = Buffer.from(a, \u0027utf8\u0027);\n const bufB = Buffer.from(b, \u0027utf8\u0027);\n const lengthMatch = bufA.length === bufB.length;\n if (!lengthMatch) {\n return { equal: false, lengthMatch: false };\n }\n const equal = crypto.timingSafeEqual(bufA, bufB);\n return { equal, lengthMatch: true };\n","suffix":"}\n\nassert.deepStrictEqual(safeCompare(\u0027hello\u0027, \u0027hello\u0027), { equal: true, lengthMatch: true });\nassert.deepStrictEqual(safeCompare(\u0027hello\u0027, \u0027world\u0027), { equal: false, lengthMatch: true });\nassert.deepStrictEqual(safeCompare(\u0027hi\u0027, \u0027hello\u0027), { equal: false, lengthMatch: false });\nassert.deepStrictEqual(safeCompare(\u0027\u0027, \u0027\u0027), { equal: true, lengthMatch: true });\nconsole.log(\u0027task7 ok\u0027);\n","assertions":"// Verify timing-safe comparison with multi-byte chars\nconst r1 = safeCompare(\u0027caf\\u00e9\u0027, \u0027caf\\u00e9\u0027);\nassert.deepStrictEqual(r1, { equal: true, lengthMatch: true });\n\n// Same char count but different byte length\nconst r2 = safeCompare(\u0027\\u00e9\u0027, \u0027e\u0027);\nassert.strictEqual(r2.lengthMatch, false); // \\u00e9 is 2 bytes, \u0027e\u0027 is 1\n\n// Verify that calling timingSafeEqual with different lengths would throw\nlet threw = false;\ntry {\n crypto.timingSafeEqual(Buffer.from(\u0027ab\u0027), Buffer.from(\u0027abc\u0027));\n} catch (e: any) {\n threw = e instanceof RangeError;\n}\nassert.strictEqual(threw, true);\nconsole.log(\u0027task7 assertions ok\u0027);\n","category":"api_usage"} {"id":"8","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Build a URL with query parameters using the WHATWG URL API.\n// URLSearchParams.append allows duplicate keys.\n// URLSearchParams.set replaces all values for a key.\n// The toString() of URLSearchParams encodes spaces as \u0027+\u0027 not \u0027%20\u0027.\n\nfunction buildUrl(\n base: string,\n params: Array\u003c[string, string]\u003e,\n overrides: Record\u003cstring, string\u003e\n): { href: string; search: string; paramCount: number } {\n","golden_completion":" const url = new URL(base);\n for (const [key, val] of params) {\n url.searchParams.append(key, val);\n }\n for (const [key, val] of Object.entries(overrides)) {\n url.searchParams.set(key, val);\n }\n return {\n href: url.href,\n search: url.search,\n paramCount: Array.from(url.searchParams).length\n };\n","suffix":"}\n\nconst r = buildUrl(\u0027https://example.com/api\u0027, [[\u0027q\u0027, \u0027hello world\u0027], [\u0027q\u0027, \u0027test\u0027]], { q: \u0027final\u0027 });\n// set(\u0027q\u0027, \u0027final\u0027) replaces ALL existing \u0027q\u0027 values\nassert.strictEqual(r.paramCount, 1);\nassert.ok(r.href.includes(\u0027q=final\u0027));\n// spaces encoded as \u0027+\u0027 in searchParams\nconst r2 = buildUrl(\u0027https://x.com\u0027, [[\u0027s\u0027, \u0027a b\u0027]], {});\nassert.ok(r2.search.includes(\u0027a+b\u0027));\nconsole.log(\u0027task8 ok\u0027);\n","assertions":"// Duplicate keys with append\nconst r3 = buildUrl(\u0027https://x.com\u0027, [[\u0027a\u0027, \u00271\u0027], [\u0027a\u0027, \u00272\u0027], [\u0027b\u0027, \u00273\u0027]], {});\nassert.strictEqual(r3.paramCount, 3);\n\n// set overrides only the specified key\nconst r4 = buildUrl(\u0027https://x.com\u0027, [[\u0027a\u0027, \u00271\u0027], [\u0027a\u0027, \u00272\u0027], [\u0027b\u0027, \u00273\u0027]], { a: \u0027x\u0027 });\nassert.strictEqual(r4.paramCount, 2); // one \u0027a\u0027 + one \u0027b\u0027\nassert.ok(r4.href.includes(\u0027a=x\u0027));\nassert.ok(r4.href.includes(\u0027b=3\u0027));\n\n// Empty params\nconst r5 = buildUrl(\u0027https://x.com/path\u0027, [], {});\nassert.strictEqual(r5.search, \u0027\u0027);\nassert.strictEqual(r5.paramCount, 0);\nconsole.log(\u0027task8 assertions ok\u0027);\n","category":"api_usage"} {"id":"9","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Implement a type-safe pluck function that extracts a single property\n// from each object in an array. The key parameter must be constrained\n// to actual keys of the objects via keyof T.\n\n","golden_completion":"function pluck\u003cT, K extends keyof T\u003e(items: T[], key: K): T[K][] {\n return items.map(item =\u003e item[key]);\n}\n","suffix":"\ninterface User { name: string; age: number; active: boolean; }\nconst users: User[] = [\n { name: \u0027Alice\u0027, age: 30, active: true },\n { name: \u0027Bob\u0027, age: 25, active: false },\n { name: \u0027Charlie\u0027, age: 35, active: true }\n];\n\nconst names: string[] = pluck(users, \u0027name\u0027);\nassert.deepStrictEqual(names, [\u0027Alice\u0027, \u0027Bob\u0027, \u0027Charlie\u0027]);\n\nconst ages: number[] = pluck(users, \u0027age\u0027);\nassert.deepStrictEqual(ages, [30, 25, 35]);\n\nconst actives: boolean[] = pluck(users, \u0027active\u0027);\nassert.deepStrictEqual(actives, [true, false, true]);\nconsole.log(\u0027task9 ok\u0027);\n","assertions":"// Empty array\nassert.deepStrictEqual(pluck([] as User[], \u0027name\u0027), []);\n\n// Works with different object types\ninterface Point { x: number; y: number; label: string; }\nconst points: Point[] = [{ x: 1, y: 2, label: \u0027a\u0027 }, { x: 3, y: 4, label: \u0027b\u0027 }];\nassert.deepStrictEqual(pluck(points, \u0027x\u0027), [1, 3]);\nassert.deepStrictEqual(pluck(points, \u0027label\u0027), [\u0027a\u0027, \u0027b\u0027]);\n\n// Single element\nassert.deepStrictEqual(pluck([{ v: 42 }], \u0027v\u0027), [42]);\nconsole.log(\u0027task9 assertions ok\u0027);\n","category":"api_usage"} {"id":"10","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Implement a type-safe function that unwraps Promises and arrays.\n// Given a value that might be a Promise\u003cT\u003e or T[], extract and return\n// the inner type. For non-wrapped values, return as-is.\n// Use TypeScript\u0027s conditional types to provide correct return types.\n\ntype UnwrapPromise\u003cT\u003e = T extends Promise\u003cinfer U\u003e ? U : T;\ntype UnwrapArray\u003cT\u003e = T extends Array\u003cinfer U\u003e ? U : T;\n\n// Runtime function that extracts values from resolved promises or first array element.\n// For plain values, returns the value itself.\n","golden_completion":"async function unwrap\u003cT\u003e(value: T): Promise\u003cUnwrapPromise\u003cT\u003e | UnwrapArray\u003cT\u003e\u003e {\n if (value instanceof Promise) {\n return await value as any;\n }\n if (Array.isArray(value)) {\n return value[0] as any;\n }\n return value as any;\n}\n","suffix":"\n(async () =\u003e {\n // Unwrap a promise\n const p = Promise.resolve(42);\n const r1 = await unwrap(p);\n assert.strictEqual(r1, 42);\n\n // Unwrap an array (first element)\n const arr = [10, 20, 30];\n const r2 = await unwrap(arr);\n assert.strictEqual(r2, 10);\n\n // Plain value returned as-is\n const r3 = await unwrap(\u0027hello\u0027);\n assert.strictEqual(r3, \u0027hello\u0027);\n\n console.log(\u0027task10 ok\u0027);\n})();\n","assertions":"(async () =\u003e {\n // Nested promise\n const r4 = await unwrap(Promise.resolve(\u0027abc\u0027));\n assert.strictEqual(r4, \u0027abc\u0027);\n\n // Empty array returns undefined\n const r5 = await unwrap([]);\n assert.strictEqual(r5, undefined);\n\n // Number value\n const r6 = await unwrap(99);\n assert.strictEqual(r6, 99);\n\n // Boolean value\n const r7 = await unwrap(true);\n assert.strictEqual(r7, true);\n\n // null value\n const r8 = await unwrap(null);\n assert.strictEqual(r8, null);\n\n console.log(\u0027task10 assertions ok\u0027);\n})();\n","category":"api_usage"} {"id":"11","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\nfunction parseFragmentedUrl(raw: string): {\n protocol: string;\n hostname: string;\n pathname: string;\n searchKeys: string[];\n hash: string;\n} {\n const u = new URL(raw);\n const searchKeys: string[] = [];\n u.searchParams.forEach((_v, k) =\u003e searchKeys.push(k));\n return {\n protocol: u.protocol,\n hostname: u.hostname,\n pathname: u.pathname,\n searchKeys,\n hash: u.hash,\n };\n}\n\n// Fill in precise API documentation for parseFragmentedUrl.\n// The executable implementation above is the source of truth.\nparseFragmentedUrl.doc =\n","golden_completion":"`Parse raw with the WHATWG URL constructor new URL(raw) and return an object containing protocol (includes trailing colon), hostname (lowercased by the URL parser), pathname (percent-encoded path), searchKeys (parameter names collected via forEach on url.searchParams in insertion order, values ignored), and hash (includes the leading # character, or empty string if absent).\nThe URL constructor throws TypeError for invalid or relative URLs; searchParams automatically percent-decodes keys; hash is the raw fragment including # and is never parsed as query parameters.`","suffix":";\n\nassert.equal(typeof parseFragmentedUrl.doc, \u0027string\u0027);\nassert.ok(parseFragmentedUrl.doc.includes(\u0027new URL(raw)\u0027));\nassert.ok(parseFragmentedUrl.doc.includes(\u0027protocol\u0027));\n\nconst r = parseFragmentedUrl(\u0027https://Example.COM/path?a=1\u0026b=2#frag\u0027);\nassert.equal(r.protocol, \u0027https:\u0027);\nassert.equal(r.hostname, \u0027example.com\u0027);\nassert.deepStrictEqual(r.searchKeys, [\u0027a\u0027, \u0027b\u0027]);\nassert.equal(r.hash, \u0027#frag\u0027);\nconsole.log(\u0027task11 ok\u0027);\n","assertions":"for (const term of [\n \u0027WHATWG URL constructor\u0027,\n \u0027trailing colon\u0027,\n \u0027lowercased by the URL parser\u0027,\n \u0027percent-encoded path\u0027,\n \u0027forEach on url.searchParams\u0027,\n \u0027insertion order\u0027,\n \u0027values ignored\u0027,\n \u0027leading # character\u0027,\n \u0027empty string if absent\u0027,\n \u0027TypeError\u0027,\n \u0027percent-decodes keys\u0027,\n \u0027never parsed as query parameters\u0027\n]) {\n assert.ok(parseFragmentedUrl.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst r2 = parseFragmentedUrl(\u0027http://X.test/a%20b?c=%26#sect\u0027);\nassert.equal(r2.pathname, \u0027/a%20b\u0027);\nassert.deepStrictEqual(r2.searchKeys, [\u0027c\u0027]);\nassert.equal(r2.hash, \u0027#sect\u0027);\nlet threw = false;\ntry { parseFragmentedUrl(\u0027not-a-url\u0027); } catch (e: any) { threw = e instanceof TypeError; }\nassert.ok(threw);\nconst r3 = parseFragmentedUrl(\u0027http://x.test/plain\u0027);\nassert.equal(r3.hash, \u0027\u0027);\nconsole.log(\u0027task11 assertions ok\u0027);\n","category":"api_usage"} {"id":"12","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\nimport * as querystring from \u0027querystring\u0027;\n\nfunction parseQuery(qs: string, maxKeys?: number): Record\u003cstring, string | string[]\u003e {\n const parsed = querystring.parse(qs, undefined, undefined, { maxKeys: maxKeys ?? 1000 });\n const result: Record\u003cstring, string | string[]\u003e = {};\n for (const key of Object.keys(parsed)) {\n const val = parsed[key];\n if (val === undefined) continue;\n result[key] = val;\n }\n return result;\n}\n\n// Fill in precise API documentation for parseQuery.\n// The executable implementation above is the source of truth.\nparseQuery.doc =\n","golden_completion":"`Parse qs using querystring.parse(qs, sep, eq, options) from the legacy Node querystring module, which splits on \u0026 and = by default and returns a null-prototype object via Object.create(null).\nDuplicate keys produce an array of strings; single-occurrence keys produce a plain string; keys with no = sign get empty-string values.\nThe maxKeys option (defaulting to 1000 via nullish coalescing) limits the number of keys parsed; set to 0 for unlimited. querystring.parse decodes both percent-encoding and + as space.\nUndefined entries are filtered out via the continue guard; the returned Record maps keys to either a single string or a string array.`","suffix":";\n\nassert.equal(typeof parseQuery.doc, \u0027string\u0027);\nassert.ok(parseQuery.doc.includes(\u0027querystring.parse\u0027));\nassert.ok(parseQuery.doc.includes(\u0027legacy\u0027));\n\nconst r = parseQuery(\u0027a=1\u0026b=2\u0026a=3\u0027);\nassert.deepStrictEqual(r[\u0027a\u0027], [\u00271\u0027, \u00273\u0027]);\nassert.equal(r[\u0027b\u0027], \u00272\u0027);\nconsole.log(\u0027task12 ok\u0027);\n","assertions":"for (const term of [\n \u0027querystring.parse(qs, sep, eq, options)\u0027,\n \u0027legacy Node querystring module\u0027,\n \u0027splits on \u0026 and =\u0027,\n \u0027null-prototype object\u0027,\n \u0027Object.create(null)\u0027,\n \u0027Duplicate keys produce an array\u0027,\n \u0027single-occurrence keys produce a plain string\u0027,\n \u0027no = sign get empty-string values\u0027,\n \u0027maxKeys option\u0027,\n \u00271000 via nullish coalescing\u0027,\n \u00270 for unlimited\u0027,\n \u0027percent-encoding and + as space\u0027,\n \u0027continue guard\u0027\n]) {\n assert.ok(parseQuery.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst r2 = parseQuery(\u0027x=a+b\u0026y\u0027);\nassert.equal(r2[\u0027x\u0027], \u0027a b\u0027);\nassert.equal(r2[\u0027y\u0027], \u0027\u0027);\nconst r3 = parseQuery(\u0027k=1\u0026k=2\u0026k=3\u0027);\nassert.deepStrictEqual(r3[\u0027k\u0027], [\u00271\u0027, \u00272\u0027, \u00273\u0027]);\n// maxKeys limits parsing\nconst r4 = parseQuery(\u0027a=1\u0026b=2\u0026c=3\u0027, 2);\nassert.ok(!(\u0027c\u0027 in r4));\nconsole.log(\u0027task12 assertions ok\u0027);\n","category":"api_usage"} {"id":"13","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\nimport { EventEmitter } from \u0027events\u0027;\n\nfunction trackEvent(emitter: EventEmitter, eventName: string): {\n fire: (payload: unknown) =\u003e boolean;\n history: () =\u003e unknown[];\n detach: () =\u003e void;\n listenerCount: () =\u003e number;\n} {\n const log: unknown[] = [];\n const handler = (payload: unknown) =\u003e { log.push(payload); };\n emitter.on(eventName, handler);\n return {\n fire: (payload: unknown) =\u003e emitter.emit(eventName, payload),\n history: () =\u003e [...log],\n detach: () =\u003e { emitter.removeListener(eventName, handler); },\n listenerCount: () =\u003e emitter.listenerCount(eventName),\n };\n}\n\n// Fill in precise API documentation for trackEvent.\n// The executable implementation above is the source of truth.\ntrackEvent.doc =\n","golden_completion":"`Attach handler to emitter using emitter.on(eventName, handler), which registers a persistent listener that pushes each payload into an internal log array.\nfire(payload) calls emitter.emit(eventName, payload) and returns true if listeners exist, false otherwise.\nhistory() returns a shallow copy of the log array via spread [...log], preserving insertion order.\ndetach() calls emitter.removeListener(eventName, handler) to remove the specific handler reference; only the exact function reference is removed, leaving other listeners for the same event intact.\nlistenerCount() delegates to emitter.listenerCount(eventName), which returns the number of currently registered listeners for that event name.`","suffix":";\n\nassert.equal(typeof trackEvent.doc, \u0027string\u0027);\nassert.ok(trackEvent.doc.includes(\u0027emitter.on(eventName, handler)\u0027));\nassert.ok(trackEvent.doc.includes(\u0027removeListener\u0027));\n\nconst ee = new EventEmitter();\nconst t = trackEvent(ee, \u0027data\u0027);\nt.fire(\u0027a\u0027);\nt.fire(\u0027b\u0027);\nassert.deepStrictEqual(t.history(), [\u0027a\u0027, \u0027b\u0027]);\nassert.equal(t.listenerCount(), 1);\nt.detach();\nassert.equal(t.listenerCount(), 0);\nconsole.log(\u0027task13 ok\u0027);\n","assertions":"for (const term of [\n \u0027persistent listener\u0027,\n \u0027pushes each payload\u0027,\n \u0027emitter.emit(eventName, payload)\u0027,\n \u0027returns true if listeners exist\u0027,\n \u0027false otherwise\u0027,\n \u0027shallow copy\u0027,\n \u0027[...log]\u0027,\n \u0027insertion order\u0027,\n \u0027exact function reference\u0027,\n \u0027other listeners for the same event intact\u0027,\n \u0027emitter.listenerCount(eventName)\u0027,\n \u0027currently registered listeners\u0027\n]) {\n assert.ok(trackEvent.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst ee2 = new EventEmitter();\nconst t2 = trackEvent(ee2, \u0027x\u0027);\nassert.equal(t2.fire(\u0027z\u0027), true);\nt2.detach();\nassert.equal(t2.fire(\u0027w\u0027), false);\nassert.deepStrictEqual(t2.history(), [\u0027z\u0027]);\n// Extra listener not affected by detach\nee2.on(\u0027x\u0027, () =\u003e {});\nassert.equal(ee2.listenerCount(\u0027x\u0027), 1);\nconsole.log(\u0027task13 assertions ok\u0027);\n","category":"api_usage"} {"id":"14","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\nimport { execSync } from \u0027child_process\u0027;\n\nfunction runCommand(cmd: string, timeoutMs: number): {\n stdout: string;\n exitCode: number;\n} {\n try {\n const buf = execSync(cmd, {\n timeout: timeoutMs,\n stdio: [\u0027pipe\u0027, \u0027pipe\u0027, \u0027pipe\u0027],\n windowsHide: true,\n }) as Buffer;\n return { stdout: buf.toString(\u0027utf8\u0027).trimEnd(), exitCode: 0 };\n } catch (err: any) {\n if (err.killed) {\n return { stdout: \u0027\u0027, exitCode: -1 };\n }\n return {\n stdout: (err.stdout ? Buffer.from(err.stdout).toString(\u0027utf8\u0027).trimEnd() : \u0027\u0027),\n exitCode: err.status ?? 1,\n };\n }\n}\n\n// Fill in precise API documentation for runCommand.\n// The executable implementation above is the source of truth.\nrunCommand.doc =\n","golden_completion":"`Execute cmd synchronously via execSync(cmd, opts) with timeout set to timeoutMs milliseconds, stdio configured as [\u0027pipe\u0027, \u0027pipe\u0027, \u0027pipe\u0027] to capture all streams, and no encoding specified so the return value is a raw Buffer (cast via as Buffer).\nOn success (exit code 0), convert the Buffer to UTF-8 via buf.toString(\u0027utf8\u0027), trim trailing whitespace with trimEnd(), and return { stdout, exitCode: 0 }.\nOn failure, execSync throws an Error with properties: killed (true if the process was terminated due to timeout), stdout (partial output Buffer), and status (the process exit code or null).\nIf err.killed is true, return { stdout: \u0027\u0027, exitCode: -1 }; otherwise return the err.stdout converted to UTF-8 and trimmed, with exitCode from err.status defaulting to 1 via nullish coalescing.`","suffix":";\n\nassert.equal(typeof runCommand.doc, \u0027string\u0027);\nassert.ok(runCommand.doc.includes(\u0027execSync\u0027));\nassert.ok(runCommand.doc.includes(\u0027timeout\u0027));\n\nconst r = runCommand(\u0027echo hello\u0027, 5000);\nassert.equal(r.stdout, \u0027hello\u0027);\nassert.equal(r.exitCode, 0);\nconst r2 = runCommand(\u0027exit 42\u0027, 5000);\nassert.equal(r2.exitCode, 42);\nconsole.log(\u0027task14 ok\u0027);\n","assertions":"for (const term of [\n \u0027execSync(cmd, opts)\u0027,\n \"[\u0027pipe\u0027, \u0027pipe\u0027, \u0027pipe\u0027]\",\n \u0027no encoding specified\u0027,\n \u0027raw Buffer\u0027,\n \u0027as Buffer\u0027,\n \"buf.toString(\u0027utf8\u0027)\",\n \u0027trimEnd()\u0027,\n \u0027throws an Error\u0027,\n \u0027err.killed\u0027,\n \u0027terminated due to timeout\u0027,\n \u0027err.stdout\u0027,\n \u0027partial output Buffer\u0027,\n \u0027err.status\u0027,\n \u0027exit code or null\u0027,\n \u0027exitCode: -1\u0027,\n \u0027nullish coalescing\u0027\n]) {\n assert.ok(runCommand.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst r3 = runCommand(\u0027echo partial \u0026\u0026 exit 7\u0027, 5000);\nassert.equal(r3.exitCode, 7);\nassert.equal(r3.stdout, \u0027partial\u0027);\nconst r4 = runCommand(\u0027echo ok\u0027, 5000);\nassert.equal(r4.exitCode, 0);\nassert.equal(r4.stdout, \u0027ok\u0027);\nconsole.log(\u0027task14 assertions ok\u0027);\n","category":"api_usage"} {"id":"15","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\nimport * as util from \u0027util\u0027;\n\nclass TaggedValue {\n constructor(public tag: string, public value: unknown) {}\n\n [util.inspect.custom](depth: number, opts: util.InspectOptions): string {\n if (depth \u003c 0) return `[TaggedValue]`;\n const inner = util.inspect(this.value, { ...opts, depth: opts.depth === null ? null : (opts.depth ?? 2) - 1 });\n return `TaggedValue(${this.tag}: ${inner})`;\n }\n}\n\nfunction inspectTagged(t: TaggedValue, depth?: number): string {\n return util.inspect(t, { depth: depth ?? 2, colors: false });\n}\n\n// Fill in precise API documentation for TaggedValue and inspectTagged.\n// The executable implementations above are the source of truth.\ninspectTagged.doc =\n","golden_completion":"`TaggedValue defines a custom inspection via [util.inspect.custom](depth, opts), the well-known symbol that util.inspect calls instead of the default object formatter.\nWhen depth \u003c 0, it returns the placeholder string \u0027[TaggedValue]\u0027 to prevent infinite recursion in deeply nested structures.\nOtherwise it formats as \u0027TaggedValue(tag: inner)\u0027 where inner is produced by recursively calling util.inspect(this.value, opts) with depth decremented by 1; if opts.depth is null (infinite), it remains null.\ninspectTagged(t, depth?) calls util.inspect(t, { depth: depth ?? 2, colors: false }), defaulting depth to 2 via nullish coalescing and disabling ANSI color codes.`","suffix":";\n\nassert.equal(typeof inspectTagged.doc, \u0027string\u0027);\nassert.ok(inspectTagged.doc.includes(\u0027util.inspect.custom\u0027));\n\nconst t = new TaggedValue(\u0027num\u0027, 42);\nassert.ok(inspectTagged(t).includes(\u0027TaggedValue(num: 42)\u0027));\nconst nested = new TaggedValue(\u0027outer\u0027, new TaggedValue(\u0027inner\u0027, \u0027hi\u0027));\nassert.ok(inspectTagged(nested, 2).includes(\u0027TaggedValue(outer:\u0027));\nconsole.log(\u0027task15 ok\u0027);\n","assertions":"for (const term of [\n \u0027well-known symbol\u0027,\n \u0027instead of the default object formatter\u0027,\n \"depth \u003c 0\",\n \"\u0027[TaggedValue]\u0027\",\n \u0027infinite recursion\u0027,\n \u0027deeply nested structures\u0027,\n \u0027TaggedValue(tag: inner)\u0027,\n \u0027recursively calling util.inspect\u0027,\n \u0027depth decremented by 1\u0027,\n \u0027opts.depth is null\u0027,\n \u0027infinite\u0027,\n \u0027colors: false\u0027,\n \u0027ANSI color codes\u0027,\n \u0027nullish coalescing\u0027\n]) {\n assert.ok(inspectTagged.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst t2 = new TaggedValue(\u0027a\u0027, new TaggedValue(\u0027b\u0027, new TaggedValue(\u0027c\u0027, \u0027deep\u0027)));\nassert.ok(inspectTagged(t2, 0).includes(\u0027[TaggedValue]\u0027));\nassert.ok(inspectTagged(t2, 3).includes(\u0027deep\u0027));\nconsole.log(\u0027task15 assertions ok\u0027);\n","category":"api_usage"} {"id":"16","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\n// Collect keys from a Map, but skip any key whose value is negative.\n// For each skipped key, delete it from the map.\n// Return the collected (non-skipped) keys in iteration order.\n// IMPORTANT: Map.prototype.forEach visits keys in insertion order\n// and per the ES2020 spec, deleting a key that has NOT yet been\n// visited causes it to be skipped; deleting an already-visited key\n// has no effect on iteration. Keys added DURING iteration ARE visited.\nfunction collectAndPrune(map: Map\u003cstring, number\u003e): string[] {\n","golden_completion":" const kept: string[] = [];\n map.forEach((value, key) =\u003e {\n if (value \u003c 0) {\n map.delete(key);\n } else {\n kept.push(key);\n }\n });\n return kept;\n","suffix":"}\n\nconst m = new Map\u003cstring, number\u003e([[\u0027a\u0027, 1], [\u0027b\u0027, -2], [\u0027c\u0027, 3], [\u0027d\u0027, -4], [\u0027e\u0027, 5]]);\nconst result = collectAndPrune(m);\nassert.deepStrictEqual(result, [\u0027a\u0027, \u0027c\u0027, \u0027e\u0027]);\nassert.equal(m.size, 3);\nassert.ok(!m.has(\u0027b\u0027));\nassert.ok(!m.has(\u0027d\u0027));\nconsole.log(\u0027task16 ok\u0027);\n","assertions":"// Test with all negative\nconst m2 = new Map\u003cstring, number\u003e([[\u0027x\u0027, -1], [\u0027y\u0027, -2]]);\nconst r2 = collectAndPrune(m2);\nassert.deepStrictEqual(r2, []);\nassert.equal(m2.size, 0);\n\n// Test with all positive\nconst m3 = new Map\u003cstring, number\u003e([[\u0027p\u0027, 10], [\u0027q\u0027, 20]]);\nconst r3 = collectAndPrune(m3);\nassert.deepStrictEqual(r3, [\u0027p\u0027, \u0027q\u0027]);\nassert.equal(m3.size, 2);\n\n// Test empty map\nconst m4 = new Map\u003cstring, number\u003e();\nassert.deepStrictEqual(collectAndPrune(m4), []);\n\n// Test insertion order preserved\nconst m5 = new Map\u003cstring, number\u003e([[\u0027z\u0027, 1], [\u0027a\u0027, 2], [\u0027m\u0027, -1]]);\nassert.deepStrictEqual(collectAndPrune(m5), [\u0027z\u0027, \u0027a\u0027]);\nassert.equal(m5.size, 2);\n\nconsole.log(\u0027task16 assertions ok\u0027);\n","category":"api_usage"} {"id":"17","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\n// Sort an array of strings using Intl.Collator with specific options:\n// - locale: \u0027de\u0027 (German)\n// - sensitivity: \u0027base\u0027 (ignore case and accents)\n// - numeric: true (sort \"file2\" before \"file10\")\n// Return a NEW sorted array (do not mutate the input).\n// Also return the number of unique groups (strings that compare\n// as equal under the collator).\nfunction germanSort(items: string[]): { sorted: string[]; uniqueGroups: number } {\n","golden_completion":" const collator = new Intl.Collator(\u0027de\u0027, {\n sensitivity: \u0027base\u0027,\n numeric: true,\n });\n const sorted = [...items].sort(collator.compare);\n let groups = 0;\n for (let i = 0; i \u003c sorted.length; i++) {\n if (i === 0 || collator.compare(sorted[i], sorted[i - 1]) !== 0) {\n groups++;\n }\n }\n return { sorted, uniqueGroups: groups };\n","suffix":"}\n\nconst r = germanSort([\u0027file10\u0027, \u0027file2\u0027, \u0027file1\u0027, \u0027FILE1\u0027]);\nassert.deepStrictEqual(r.sorted, [\u0027file1\u0027, \u0027FILE1\u0027, \u0027file2\u0027, \u0027file10\u0027]);\nassert.equal(r.uniqueGroups, 3); // file1/FILE1 are same group\nconsole.log(\u0027task17 ok\u0027);\n","assertions":"// Empty array\nconst r2 = germanSort([]);\nassert.deepStrictEqual(r2.sorted, []);\nassert.equal(r2.uniqueGroups, 0);\n\n// All same under base sensitivity\nconst r3 = germanSort([\u0027a\u0027, \u0027A\u0027, \u0027à\u0027, \u0027À\u0027]);\nassert.equal(r3.uniqueGroups, 1);\nassert.equal(r3.sorted.length, 4);\n\n// Numeric sorting\nconst r4 = germanSort([\u0027item20\u0027, \u0027item3\u0027, \u0027item100\u0027]);\nassert.deepStrictEqual(r4.sorted, [\u0027item3\u0027, \u0027item20\u0027, \u0027item100\u0027]);\nassert.equal(r4.uniqueGroups, 3);\n\n// Does not mutate input\nconst input = [\u0027z\u0027, \u0027a\u0027];\nconst inputCopy = [...input];\ngermanSort(input);\nassert.deepStrictEqual(input, inputCopy);\n\nconsole.log(\u0027task17 assertions ok\u0027);\n","category":"api_usage"} {"id":"18","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\n// Extract all key=value pairs from a string using RegExp named groups.\n// Pattern: word characters for key, then =, then either a double-quoted\n// string (capture content without quotes) or unquoted non-space chars.\n// Use String.prototype.matchAll with a global RegExp.\n// Return an array of { key, value, index } objects where index is the\n// match position in the original string.\nfunction extractPairs(input: string): Array\u003c{ key: string; value: string; index: number }\u003e {\n","golden_completion":" const re = /(?\u003ckey\u003e\\w+)=(?:\"(?\u003cquoted\u003e[^\"]*)\"|(?\u003cunquoted\u003e\\S+))/g;\n const results: Array\u003c{ key: string; value: string; index: number }\u003e = [];\n for (const m of input.matchAll(re)) {\n results.push({\n key: m.groups!.key,\n value: m.groups!.quoted ?? m.groups!.unquoted ?? \u0027\u0027,\n index: m.index!,\n });\n }\n return results;\n","suffix":"}\n\nconst r = extractPairs(\u0027name=Alice age=30 msg=\"hello world\"\u0027);\nassert.equal(r.length, 3);\nassert.equal(r[0].key, \u0027name\u0027);\nassert.equal(r[0].value, \u0027Alice\u0027);\nassert.equal(r[0].index, 0);\nassert.equal(r[2].key, \u0027msg\u0027);\nassert.equal(r[2].value, \u0027hello world\u0027);\nconsole.log(\u0027task18 ok\u0027);\n","assertions":"// Empty string\nassert.deepStrictEqual(extractPairs(\u0027\u0027), []);\n\n// Only quoted values\nconst r2 = extractPairs(\u0027a=\"1\" b=\"2 3\"\u0027);\nassert.equal(r2.length, 2);\nassert.equal(r2[0].value, \u00271\u0027);\nassert.equal(r2[1].value, \u00272 3\u0027);\n\n// Mixed with special chars in unquoted\nconst r3 = extractPairs(\u0027path=/usr/bin x=\"y\"\u0027);\nassert.equal(r3[0].value, \u0027/usr/bin\u0027);\nassert.equal(r3[1].value, \u0027y\u0027);\n\n// Empty quoted value\nconst r4 = extractPairs(\u0027empty=\"\"\u0027);\nassert.equal(r4[0].value, \u0027\u0027);\n\n// Index tracking\nconst r5 = extractPairs(\u0027 key=val\u0027);\nassert.equal(r5[0].index, 3);\n\nconsole.log(\u0027task18 assertions ok\u0027);\n","category":"api_usage"} {"id":"19","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ntype TextResult = { kind: \u0027text\u0027; content: string };\ntype ErrorResult = { kind: \u0027error\u0027; code: number; message: string };\ntype PendingResult = { kind: \u0027pending\u0027; retryAfterMs: number };\ntype ApiResult = TextResult | ErrorResult | PendingResult;\n\n// Process a batch of ApiResult items:\n// - \u0027text\u0027 results: collect content into an array\n// - \u0027error\u0027 results: if code \u003e= 500, throw an Error with message\n// \"server error: {message}\"; if code \u003c 500, skip silently\n// - \u0027pending\u0027 results: collect retryAfterMs into a separate array\n// Return { texts: string[], pendingDelays: number[] }\n// Process items in order; throw on first server error encountered.\nfunction processBatch(results: ApiResult[]): { texts: string[]; pendingDelays: number[] } {\n","golden_completion":" const texts: string[] = [];\n const pendingDelays: number[] = [];\n for (const r of results) {\n if (r.kind === \u0027text\u0027) { texts.push(r.content); }\n else if (r.kind === \u0027error\u0027) {\n if (r.code \u003e= 500) throw new Error(`server error: ${r.message}`);\n } else if (r.kind === \u0027pending\u0027) { pendingDelays.push(r.retryAfterMs); }\n }\n return { texts, pendingDelays };\n","suffix":"}\n\nconst batch: ApiResult[] = [\n { kind: \u0027text\u0027, content: \u0027hello\u0027 },\n { kind: \u0027error\u0027, code: 404, message: \u0027not found\u0027 },\n { kind: \u0027pending\u0027, retryAfterMs: 1000 },\n { kind: \u0027text\u0027, content: \u0027world\u0027 },\n];\nconst r = processBatch(batch);\nassert.deepStrictEqual(r.texts, [\u0027hello\u0027, \u0027world\u0027]);\nassert.deepStrictEqual(r.pendingDelays, [1000]);\n\nlet threwMsg = \u0027\u0027;\ntry {\n processBatch([\n { kind: \u0027text\u0027, content: \u0027ok\u0027 },\n { kind: \u0027error\u0027, code: 503, message: \u0027unavailable\u0027 },\n { kind: \u0027text\u0027, content: \u0027never reached\u0027 },\n ]);\n} catch (e: any) { threwMsg = e.message; }\nassert.equal(threwMsg, \u0027server error: unavailable\u0027);\nconsole.log(\u0027task19 ok\u0027);\n","assertions":"// Empty batch\nconst r2 = processBatch([]);\nassert.deepStrictEqual(r2.texts, []);\nassert.deepStrictEqual(r2.pendingDelays, []);\n\n// All client errors (\u003c 500) skipped silently\nconst r3 = processBatch([\n { kind: \u0027error\u0027, code: 400, message: \u0027bad\u0027 },\n { kind: \u0027error\u0027, code: 499, message: \u0027too many\u0027 },\n { kind: \u0027text\u0027, content: \u0027after errors\u0027 },\n]);\nassert.deepStrictEqual(r3.texts, [\u0027after errors\u0027]);\nassert.deepStrictEqual(r3.pendingDelays, []);\n\n// Exactly 500 throws\nlet threw500 = false;\ntry { processBatch([{ kind: \u0027error\u0027, code: 500, message: \u0027internal\u0027 }]); }\ncatch (e: any) { threw500 = e.message === \u0027server error: internal\u0027; }\nassert.ok(threw500);\n\n// Multiple pending\nconst r4 = processBatch([\n { kind: \u0027pending\u0027, retryAfterMs: 100 },\n { kind: \u0027pending\u0027, retryAfterMs: 200 },\n]);\nassert.deepStrictEqual(r4.pendingDelays, [100, 200]);\n\n// Throw stops processing (no items after error collected)\nlet earlyThrow = \u0027\u0027;\ntry {\n processBatch([\n { kind: \u0027text\u0027, content: \u0027a\u0027 },\n { kind: \u0027error\u0027, code: 502, message: \u0027gw\u0027 },\n { kind: \u0027pending\u0027, retryAfterMs: 999 },\n ]);\n} catch (e: any) { earlyThrow = e.message; }\nassert.equal(earlyThrow, \u0027server error: gw\u0027);\n\nconsole.log(\u0027task19 assertions ok\u0027);\n","category":"api_usage"} {"id":"20","testsource":"devbench-api-usage","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\n// Given an object and an array of keys to pick, return a new object\n// containing ONLY those keys (like TypeScript\u0027s Pick\u003cT, K\u003e at runtime).\n// If a key doesn\u0027t exist on the source, include it with value undefined.\n// Additionally return a \u0027rest\u0027 object containing all OTHER keys from source.\n// Neither picked nor rest should share references with the source object —\n// use Object.assign({}, ...) or spread for shallow copies of the containers,\n// but property VALUES are NOT deep-cloned.\nfunction pickAndRest\u003cT extends Record\u003cstring, unknown\u003e\u003e(\n source: T,\n keys: (keyof T)[]\n): { picked: Partial\u003cT\u003e; rest: Partial\u003cT\u003e } {\n","golden_completion":" const picked: Record\u003cstring, unknown\u003e = {};\n const rest: Record\u003cstring, unknown\u003e = {};\n const keySet = new Set\u003cstring | number | symbol\u003e(keys);\n for (const key of keySet) {\n picked[key as string] = source[key as string];\n }\n for (const key of Object.keys(source)) {\n if (!keySet.has(key)) {\n rest[key] = source[key];\n }\n }\n return { picked: picked as Partial\u003cT\u003e, rest: rest as Partial\u003cT\u003e };\n","suffix":"}\n\nconst src = { a: 1, b: 2, c: 3, d: 4 };\nconst { picked, rest } = pickAndRest(src, [\u0027a\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(picked, { a: 1, c: 3 });\nassert.deepStrictEqual(rest, { b: 2, d: 4 });\n\n// Verify no shared references\n(picked as any).a = 999;\nassert.equal(src.a, 1);\nconsole.log(\u0027task20 ok\u0027);\n","assertions":"// Missing keys get undefined\nconst r2 = pickAndRest({ x: 10 } as Record\u003cstring, unknown\u003e, [\u0027x\u0027, \u0027y\u0027]);\nassert.equal(r2.picked[\u0027x\u0027], 10);\nassert.equal(r2.picked[\u0027y\u0027], undefined);\nassert.ok(\u0027y\u0027 in r2.picked);\nassert.deepStrictEqual(r2.rest, {});\n\n// Empty keys array\nconst r3 = pickAndRest({ a: 1, b: 2 }, []);\nassert.deepStrictEqual(r3.picked, {});\nassert.deepStrictEqual(r3.rest, { a: 1, b: 2 });\n\n// Duplicate keys in array — no duplicate values\nconst r4 = pickAndRest({ m: \u0027hi\u0027, n: \u0027bye\u0027 }, [\u0027m\u0027, \u0027m\u0027 as any]);\nassert.deepStrictEqual(r4.picked, { m: \u0027hi\u0027 });\n\n// Values are shallow (not deep-cloned)\nconst inner = { nested: true };\nconst r5 = pickAndRest({ ref: inner, other: 1 }, [\u0027ref\u0027]);\nassert.strictEqual(r5.picked[\u0027ref\u0027], inner); // same reference\n\n// Empty source\nconst r6 = pickAndRest({} as Record\u003cstring, unknown\u003e, [\u0027z\u0027]);\nassert.ok(\u0027z\u0027 in r6.picked);\nassert.equal(r6.picked[\u0027z\u0027], undefined);\nassert.deepStrictEqual(r6.rest, {});\n\nconsole.log(\u0027task20 assertions ok\u0027);\n","category":"api_usage"} {"id":"21","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as os from \u0027os\u0027;\nimport * as assert from \u0027assert\u0027;\n\nfunction cpuModelSummary(): Record\u003cstring, number\u003e {\n const cpus = os.cpus();\n const counts: Record\u003cstring, number\u003e = {};\n for (const cpu of cpus) {\n counts[cpu.model] = (counts[cpu.model] || 0) + 1;\n }\n return counts;\n}\n\n// Fill in precise API documentation for cpuModelSummary.\n// The executable implementation above is the source of truth.\n(cpuModelSummary as any).doc =\n","golden_completion":"`Call os.cpus() which returns an array of objects each having model, speed, and times properties; this function only reads the model string property from each element.\nAggregate into a Record\u003cstring, number\u003e where each key is a distinct cpu.model string and each value is the count of logical CPUs reporting that model.\nReturn the counts object; on a single-model machine the record has exactly one key whose value equals os.cpus().length, and the function never filters or transforms the model string.`","suffix":";\n\nassert.strictEqual(typeof (cpuModelSummary as any).doc, \u0027string\u0027);\nassert.ok((cpuModelSummary as any).doc.includes(\u0027os.cpus()\u0027));\nassert.ok((cpuModelSummary as any).doc.includes(\u0027model\u0027));\n\nconst result = cpuModelSummary();\nconst cpus = os.cpus();\nlet total = 0;\nfor (const v of Object.values(result)) total += v;\nassert.strictEqual(total, cpus.length);\nconsole.log(\u0027task21 ok\u0027);\n","assertions":"for (const term of [\n \u0027model, speed, and times properties\u0027,\n \u0027only reads the model string property\u0027,\n \u0027Record\u003cstring, number\u003e\u0027,\n \u0027distinct cpu.model string\u0027,\n \u0027count of logical CPUs\u0027,\n \u0027single-model machine\u0027,\n \u0027exactly one key\u0027,\n \u0027os.cpus().length\u0027,\n \u0027never filters or transforms the model string\u0027\n]) {\n assert.ok((cpuModelSummary as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nassert.strictEqual(typeof result, \u0027object\u0027);\nconsole.log(\u0027task21 assertions ok\u0027);\n","category":"api_usage"} {"id":"22","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as zlib from \u0027zlib\u0027;\nimport * as assert from \u0027assert\u0027;\n\nfunction compressAndVerify(input: string): { compressed: Buffer; ratio: number } {\n const buf = Buffer.from(input, \u0027utf-8\u0027);\n const compressed = zlib.deflateSync(buf);\n const decompressed = zlib.inflateSync(compressed);\n if (!buf.equals(decompressed)) throw new Error(\u0027roundtrip mismatch\u0027);\n return { compressed, ratio: compressed.length / buf.length };\n}\n\n// Fill in precise API documentation for compressAndVerify.\n// The executable implementation above is the source of truth.\n(compressAndVerify as any).doc =\n","golden_completion":"`Encode the input string into a Buffer with Buffer.from(input, \u0027utf-8\u0027), compress it with zlib.deflateSync which returns a Buffer containing raw deflate data with a zlib header, then decompress with zlib.inflateSync.\nVerify the roundtrip with buf.equals(decompressed) which performs a byte-by-byte Buffer comparison and throws an Error with message \u0027roundtrip mismatch\u0027 if the Buffers differ.\nReturn an object with compressed (the deflated Buffer) and ratio (compressed.length / buf.length); ratio can exceed 1.0 for very short inputs where the zlib header overhead dominates.`","suffix":";\n\nassert.strictEqual(typeof (compressAndVerify as any).doc, \u0027string\u0027);\nassert.ok((compressAndVerify as any).doc.includes(\u0027zlib.deflateSync\u0027));\nassert.ok((compressAndVerify as any).doc.includes(\u0027zlib.inflateSync\u0027));\nassert.ok((compressAndVerify as any).doc.includes(\u0027buf.equals\u0027));\n\nconst r = compressAndVerify(\u0027hello world\u0027);\nassert.ok(r.compressed instanceof Buffer);\nassert.strictEqual(typeof r.ratio, \u0027number\u0027);\nconsole.log(\u0027task22 ok\u0027);\n","assertions":"for (const term of [\n \"Buffer.from(input, \u0027utf-8\u0027)\",\n \u0027raw deflate data with a zlib header\u0027,\n \u0027byte-by-byte Buffer comparison\u0027,\n \"throws an Error with message \u0027roundtrip mismatch\u0027\",\n \u0027compressed.length / buf.length\u0027,\n \u0027ratio can exceed 1.0\u0027,\n \u0027zlib header overhead dominates\u0027\n]) {\n assert.ok((compressAndVerify as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\n// Short input test: ratio \u003e 1\nconst short = compressAndVerify(\u0027hi\u0027);\nassert.ok(short.ratio \u003e 1.0, \u0027short input ratio should exceed 1.0\u0027);\nconsole.log(\u0027task22 assertions ok\u0027);\n","category":"api_usage"} {"id":"23","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as http from \u0027http\u0027;\nimport * as assert from \u0027assert\u0027;\n\nfunction statusTextLookup(code: number): string | undefined {\n return http.STATUS_CODES[code];\n}\n\n// Fill in precise API documentation for statusTextLookup.\n// The executable implementation above is the source of truth.\n(statusTextLookup as any).doc =\n","golden_completion":"`Look up the standard HTTP reason phrase for code by indexing into http.STATUS_CODES, a plain object whose keys are numeric status code strings and whose values are the English reason phrases defined by IANA.\nReturn the string reason phrase if the code exists as a key, or undefined if the code is not a recognized HTTP status code; the lookup uses JavaScript bracket notation which coerces the number to a string key.\nThe function performs no validation, caching, or case transformation; it is a direct single-property read from the built-in Node.js http module constant.`","suffix":";\n\nassert.strictEqual(typeof (statusTextLookup as any).doc, \u0027string\u0027);\nassert.ok((statusTextLookup as any).doc.includes(\u0027http.STATUS_CODES\u0027));\n\nassert.strictEqual(statusTextLookup(200), \u0027OK\u0027);\nassert.strictEqual(statusTextLookup(404), \u0027Not Found\u0027);\nassert.strictEqual(statusTextLookup(999), undefined);\nconsole.log(\u0027task23 ok\u0027);\n","assertions":"for (const term of [\n \u0027reason phrase\u0027,\n \u0027numeric status code strings\u0027,\n \u0027English reason phrases defined by IANA\u0027,\n \u0027undefined if the code is not a recognized HTTP status code\u0027,\n \u0027coerces the number to a string key\u0027,\n \u0027no validation, caching, or case transformation\u0027,\n \u0027single-property read\u0027,\n \u0027built-in Node.js http module constant\u0027\n]) {\n assert.ok((statusTextLookup as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nassert.strictEqual(statusTextLookup(301), \u0027Moved Permanently\u0027);\nassert.strictEqual(statusTextLookup(0), undefined);\nconsole.log(\u0027task23 assertions ok\u0027);\n","category":"api_usage"} {"id":"24","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as net from \u0027net\u0027;\nimport * as assert from \u0027assert\u0027;\n\nfunction classifyIP(addr: string): \u0027IPv4\u0027 | \u0027IPv6\u0027 | \u0027invalid\u0027 {\n const version = net.isIP(addr);\n if (version === 4) return \u0027IPv4\u0027;\n if (version === 6) return \u0027IPv6\u0027;\n return \u0027invalid\u0027;\n}\n\n// Fill in precise API documentation for classifyIP.\n// The executable implementation above is the source of truth.\n(classifyIP as any).doc =\n","golden_completion":"`Call net.isIP(addr) which returns the integer 4 for valid IPv4 addresses, 6 for valid IPv6 addresses, or 0 for strings that are neither; the function does not perform DNS resolution or hostname lookup.\nMap the return value: 4 yields the string literal \u0027IPv4\u0027, 6 yields \u0027IPv6\u0027, and 0 yields \u0027invalid\u0027; the comparison uses strict equality against the numeric constants.\nCIDR notation like \u0027192.168.1.0/24\u0027 returns \u0027invalid\u0027 because net.isIP does not accept subnet masks; similarly, leading zeros in IPv4 octets and zone IDs in IPv6 addresses produce \u0027invalid\u0027.`","suffix":";\n\nassert.strictEqual(typeof (classifyIP as any).doc, \u0027string\u0027);\nassert.ok((classifyIP as any).doc.includes(\u0027net.isIP\u0027));\n\nassert.strictEqual(classifyIP(\u0027127.0.0.1\u0027), \u0027IPv4\u0027);\nassert.strictEqual(classifyIP(\u0027::1\u0027), \u0027IPv6\u0027);\nassert.strictEqual(classifyIP(\u0027not-an-ip\u0027), \u0027invalid\u0027);\nconsole.log(\u0027task24 ok\u0027);\n","assertions":"for (const term of [\n \u0027returns the integer 4\u0027,\n \u00276 for valid IPv6 addresses\u0027,\n \u00270 for strings that are neither\u0027,\n \u0027does not perform DNS resolution or hostname lookup\u0027,\n \"4 yields the string literal \u0027IPv4\u0027\",\n \"6 yields \u0027IPv6\u0027\",\n \"0 yields \u0027invalid\u0027\",\n \u0027strict equality against the numeric constants\u0027,\n \u0027net.isIP does not accept subnet masks\u0027,\n \"leading zeros in IPv4 octets\"\n]) {\n assert.ok((classifyIP as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nassert.strictEqual(classifyIP(\u0027192.168.1.0/24\u0027), \u0027invalid\u0027);\nassert.strictEqual(classifyIP(\u002701.01.01.01\u0027), \u0027invalid\u0027);\nassert.strictEqual(classifyIP(\u0027::ffff:127.0.0.1\u0027), \u0027IPv6\u0027);\nconsole.log(\u0027task24 assertions ok\u0027);\n","category":"api_usage"} {"id":"25","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as dns from \u0027dns\u0027;\nimport * as assert from \u0027assert\u0027;\n\nfunction dnsServerCount(): { servers: string[]; count: number; hasIPv6: boolean } {\n const servers = dns.getServers();\n const hasIPv6 = servers.some(s =\u003e s.includes(\u0027:\u0027));\n return { servers, count: servers.length, hasIPv6 };\n}\n\n// Fill in precise API documentation for dnsServerCount.\n// The executable implementation above is the source of truth.\n(dnsServerCount as any).doc =\n","golden_completion":"`Call dns.getServers() which returns a new string array of IP addresses currently configured for DNS resolution, formatted as RFC 5952 strings; IPv6 addresses may include a port suffix in the format \u0027[ip]:port\u0027.\nDetermine hasIPv6 by calling servers.some(s =\u003e s.includes(\u0027:\u0027)) which checks whether any server string contains a colon character; this is true for any IPv6 address because colons are part of the IPv6 notation.\nReturn an object with servers (the full array from dns.getServers()), count (servers.length, which is always at least 1 on a properly configured system), and the boolean hasIPv6.`","suffix":";\n\nassert.strictEqual(typeof (dnsServerCount as any).doc, \u0027string\u0027);\nassert.ok((dnsServerCount as any).doc.includes(\u0027dns.getServers()\u0027));\n\nconst info = dnsServerCount();\nassert.ok(Array.isArray(info.servers));\nassert.strictEqual(info.count, info.servers.length);\nassert.strictEqual(typeof info.hasIPv6, \u0027boolean\u0027);\nconsole.log(\u0027task25 ok\u0027);\n","assertions":"for (const term of [\n \u0027new string array\u0027,\n \u0027IP addresses currently configured for DNS resolution\u0027,\n \u0027RFC 5952 strings\u0027,\n \"\u0027[ip]:port\u0027\",\n \"servers.some(s =\u003e s.includes(\u0027:\u0027))\",\n \u0027colon character\u0027,\n \u0027colons are part of the IPv6 notation\u0027,\n \u0027servers.length\u0027,\n \u0027at least 1 on a properly configured system\u0027\n]) {\n assert.ok((dnsServerCount as any).doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nassert.ok(info.count \u003e= 1);\nconsole.log(\u0027task25 assertions ok\u0027);\n","category":"api_usage"} {"id":"26","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Item { name: string; priority: number; insertOrder: number; }\n\nfunction stableSortByPriority(items: Item[]): Item[] {\n","golden_completion":" return items.slice().sort((a, b) =\u003e {\n const diff = a.priority - b.priority;\n if (diff !== 0) return diff;\n return a.insertOrder - b.insertOrder;\n });\n","suffix":"}\n\nconst data: Item[] = [\n { name: \u0027c\u0027, priority: 2, insertOrder: 0 },\n { name: \u0027a\u0027, priority: 1, insertOrder: 1 },\n { name: \u0027b\u0027, priority: 2, insertOrder: 2 },\n { name: \u0027d\u0027, priority: 1, insertOrder: 3 },\n];\nconst sorted = stableSortByPriority(data);\nassert.strictEqual(sorted[0].name, \u0027a\u0027);\nassert.strictEqual(sorted[1].name, \u0027d\u0027);\nassert.strictEqual(sorted[2].name, \u0027c\u0027);\nassert.strictEqual(sorted[3].name, \u0027b\u0027);\n// Must not mutate original\nassert.strictEqual(data[0].name, \u0027c\u0027);\nconsole.log(\u0027task26 ok\u0027);\n","assertions":"// Equal-priority items must preserve insertOrder ordering\nconst big: Item[] = [];\nfor (let i = 99; i \u003e= 0; i--) {\n big.push({ name: String(i), priority: i % 3, insertOrder: 99 - i });\n}\nconst bigSorted = stableSortByPriority(big);\nfor (let i = 1; i \u003c bigSorted.length; i++) {\n if (bigSorted[i].priority === bigSorted[i - 1].priority) {\n assert.ok(bigSorted[i].insertOrder \u003e bigSorted[i - 1].insertOrder,\n \u0027insertOrder not preserved for equal priority\u0027);\n }\n}\n// Must return new array, not mutate\nassert.notStrictEqual(bigSorted, big);\nassert.strictEqual(big[0].name, \u002799\u0027);\n\n// Empty array\nassert.deepStrictEqual(stableSortByPriority([]), []);\n\n// Single element\nconst single = stableSortByPriority([{ name: \u0027x\u0027, priority: 5, insertOrder: 0 }]);\nassert.strictEqual(single.length, 1);\nassert.strictEqual(single[0].name, \u0027x\u0027);\nconsole.log(\u0027task26 assertions ok\u0027);\n","category":"api_usage"} {"id":"27","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface SettledSummary {\n fulfilled: number;\n rejected: number;\n values: unknown[];\n reasons: unknown[];\n}\n\nasync function summarizeSettled(promises: Promise\u003cunknown\u003e[]): Promise\u003cSettledSummary\u003e {\n","golden_completion":" const results = await Promise.allSettled(promises);\n const summary: SettledSummary = { fulfilled: 0, rejected: 0, values: [], reasons: [] };\n for (const r of results) {\n if (r.status === \u0027fulfilled\u0027) {\n summary.fulfilled++;\n summary.values.push(r.value);\n } else {\n summary.rejected++;\n summary.reasons.push(r.reason);\n }\n }\n return summary;\n","suffix":"}\n\n(async () =\u003e {\n const s = await summarizeSettled([\n Promise.resolve(42),\n Promise.reject(\u0027err1\u0027),\n Promise.resolve(\u0027ok\u0027),\n Promise.reject(new Error(\u0027err2\u0027)),\n ]);\n assert.strictEqual(s.fulfilled, 2);\n assert.strictEqual(s.rejected, 2);\n assert.deepStrictEqual(s.values, [42, \u0027ok\u0027]);\n assert.strictEqual(s.reasons[0], \u0027err1\u0027);\n assert.ok(s.reasons[1] instanceof Error);\n console.log(\u0027task27 ok\u0027);\n})();\n","assertions":"(async () =\u003e {\n // All fulfilled\n const all = await summarizeSettled([Promise.resolve(1), Promise.resolve(2)]);\n assert.strictEqual(all.fulfilled, 2);\n assert.strictEqual(all.rejected, 0);\n assert.deepStrictEqual(all.values, [1, 2]);\n assert.deepStrictEqual(all.reasons, []);\n\n // All rejected\n const none = await summarizeSettled([Promise.reject(\u0027a\u0027), Promise.reject(\u0027b\u0027)]);\n assert.strictEqual(none.fulfilled, 0);\n assert.strictEqual(none.rejected, 2);\n assert.deepStrictEqual(none.reasons, [\u0027a\u0027, \u0027b\u0027]);\n assert.deepStrictEqual(none.values, []);\n\n // Empty array\n const empty = await summarizeSettled([]);\n assert.strictEqual(empty.fulfilled, 0);\n assert.strictEqual(empty.rejected, 0);\n\n // undefined value preserved\n const undef = await summarizeSettled([Promise.resolve(undefined)]);\n assert.strictEqual(undef.values[0], undefined);\n assert.strictEqual(undef.fulfilled, 1);\n\n console.log(\u0027task27 assertions ok\u0027);\n})();\n","category":"api_usage"} {"id":"28","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nclass ValidationError extends RangeError {\n public readonly field: string;\n constructor(field: string, message: string) {\n super(message);\n this.name = \u0027ValidationError\u0027;\n this.field = field;\n }\n}\n\nfunction validateAge(input: unknown): number {\n","golden_completion":" if (typeof input !== \u0027number\u0027) {\n throw new TypeError(`Expected number but received ${typeof input}`);\n }\n if (!Number.isFinite(input)) {\n throw new TypeError(`Expected finite number but received ${input}`);\n }\n if (input \u003c 0 || input \u003e 150) {\n throw new ValidationError(\u0027age\u0027, `Age must be between 0 and 150, got ${input}`);\n }\n return Math.floor(input);\n","suffix":"}\n\nassert.strictEqual(validateAge(25), 25);\nassert.strictEqual(validateAge(25.9), 25);\nassert.strictEqual(validateAge(0), 0);\nassert.strictEqual(validateAge(150), 150);\n\nassert.throws(() =\u003e validateAge(\u002725\u0027), TypeError);\nassert.throws(() =\u003e validateAge(null), TypeError);\nassert.throws(() =\u003e validateAge(NaN), TypeError);\nassert.throws(() =\u003e validateAge(Infinity), TypeError);\nassert.throws(() =\u003e validateAge(-1), ValidationError);\nassert.throws(() =\u003e validateAge(151), ValidationError);\nconsole.log(\u0027task28 ok\u0027);\n","assertions":"// TypeError for non-number types\nfor (const bad of [undefined, true, {}, [], \u002710\u0027, Symbol()]) {\n try {\n validateAge(bad);\n assert.fail(\u0027should have thrown\u0027);\n } catch (e: any) {\n assert.ok(e instanceof TypeError, `Expected TypeError for ${String(bad)}`);\n assert.ok(e.message.includes(typeof bad), \u0027message should include the typeof\u0027);\n }\n}\n\n// TypeError for non-finite numbers\nfor (const bad of [NaN, Infinity, -Infinity]) {\n try {\n validateAge(bad);\n assert.fail(\u0027should have thrown\u0027);\n } catch (e: any) {\n assert.ok(e instanceof TypeError, `Expected TypeError for ${bad}`);\n assert.ok(e.message.includes(\u0027finite\u0027), \u0027message should mention finite\u0027);\n }\n}\n\n// ValidationError for out-of-range (is a RangeError)\ntry {\n validateAge(200);\n assert.fail(\u0027should have thrown\u0027);\n} catch (e: any) {\n assert.ok(e instanceof ValidationError);\n assert.ok(e instanceof RangeError, \u0027ValidationError must extend RangeError\u0027);\n assert.strictEqual(e.field, \u0027age\u0027);\n assert.strictEqual(e.name, \u0027ValidationError\u0027);\n}\n\n// Math.floor for decimals\nassert.strictEqual(validateAge(0.1), 0);\nassert.strictEqual(validateAge(149.99), 149);\nconsole.log(\u0027task28 assertions ok\u0027);\n","category":"api_usage"} {"id":"29","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nfunction createCountdown(from: number, onTick: (n: number) =\u003e void, onDone: () =\u003e void): { cancel: () =\u003e void } {\n","golden_completion":" let current = from;\n const id = setInterval(() =\u003e {\n if (current \u003c= 0) {\n clearInterval(id);\n onDone();\n return;\n }\n onTick(current);\n current--;\n }, 0);\n return {\n cancel: () =\u003e {\n clearInterval(id);\n }\n };\n","suffix":"}\n\n// Test basic countdown\nconst ticks: number[] = [];\nlet done = false;\nconst cd = createCountdown(3, (n) =\u003e ticks.push(n), () =\u003e { done = true; });\n\nsetTimeout(() =\u003e {\n assert.deepStrictEqual(ticks, [3, 2, 1]);\n assert.strictEqual(done, true);\n console.log(\u0027task29 ok\u0027);\n}, 100);\n","assertions":"// Test cancel\nsetTimeout(() =\u003e {\n const ticks2: number[] = [];\n let done2 = false;\n const cd2 = createCountdown(10, (n) =\u003e {\n ticks2.push(n);\n if (n === 8) cd2.cancel();\n }, () =\u003e { done2 = true; });\n\n setTimeout(() =\u003e {\n assert.deepStrictEqual(ticks2, [10, 9, 8]);\n assert.strictEqual(done2, false);\n\n // Test from=0: should call onDone immediately without any ticks\n const ticks3: number[] = [];\n let done3 = false;\n createCountdown(0, (n) =\u003e ticks3.push(n), () =\u003e { done3 = true; });\n setTimeout(() =\u003e {\n assert.deepStrictEqual(ticks3, []);\n assert.strictEqual(done3, true);\n console.log(\u0027task29 assertions ok\u0027);\n }, 50);\n }, 200);\n}, 200);\n","category":"api_usage"} {"id":"30","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nclass DateRange {\n constructor(public start: Date, public end: Date) {}\n\n toJSON(): { __type: string; start: string; end: string } {\n return {\n __type: \u0027DateRange\u0027,\n start: this.start.toISOString(),\n end: this.end.toISOString(),\n };\n }\n}\n\nfunction serializeDateRange(range: DateRange): string {\n","golden_completion":" return JSON.stringify(range);\n","suffix":"}\n\nfunction deserializeDateRange(json: string): DateRange {\n const parsed = JSON.parse(json, (key, value) =\u003e {\n if (value \u0026\u0026 value.__type === \u0027DateRange\u0027) {\n return new DateRange(new Date(value.start), new Date(value.end));\n }\n return value;\n });\n return parsed;\n}\n\nconst d1 = new Date(\u00272024-01-01T00:00:00.000Z\u0027);\nconst d2 = new Date(\u00272024-12-31T23:59:59.999Z\u0027);\nconst original = new DateRange(d1, d2);\n\nconst serialized = serializeDateRange(original);\nconst parsed = JSON.parse(serialized);\nassert.strictEqual(parsed.__type, \u0027DateRange\u0027);\nassert.strictEqual(parsed.start, \u00272024-01-01T00:00:00.000Z\u0027);\nassert.strictEqual(parsed.end, \u00272024-12-31T23:59:59.999Z\u0027);\n\nconst restored = deserializeDateRange(serialized);\nassert.ok(restored instanceof DateRange);\nassert.strictEqual(restored.start.getTime(), d1.getTime());\nassert.strictEqual(restored.end.getTime(), d2.getTime());\nconsole.log(\u0027task30 ok\u0027);\n","assertions":"// toJSON is called automatically by JSON.stringify\nconst r = new DateRange(new Date(\u00272020-06-15T12:00:00Z\u0027), new Date(\u00272020-06-16T12:00:00Z\u0027));\nconst s = serializeDateRange(r);\nconst p = JSON.parse(s);\nassert.strictEqual(Object.keys(p).length, 3);\nassert.strictEqual(p.__type, \u0027DateRange\u0027);\nassert.ok(!p.hasOwnProperty(\u0027constructor\u0027));\n\n// Nested serialization: toJSON called even inside arrays\nconst arr = JSON.parse(JSON.stringify([r]));\nassert.strictEqual(arr[0].__type, \u0027DateRange\u0027);\n\n// Roundtrip preserves millisecond precision\nconst ms = new DateRange(new Date(1234567890123), new Date(9876543210987));\nconst rt = deserializeDateRange(serializeDateRange(ms));\nassert.strictEqual(rt.start.getTime(), 1234567890123);\nassert.strictEqual(rt.end.getTime(), 9876543210987);\n\nconsole.log(\u0027task30 assertions ok\u0027);\n","category":"api_usage"} {"id":"31","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nfunction matchReport(actual: unknown, expected: unknown): {\n match: boolean;\n errorCode: string | null;\n operatorUsed: string | null;\n} {\n try {\n assert.deepStrictEqual(actual, expected);\n return { match: true, errorCode: null, operatorUsed: null };\n } catch (e: any) {\n return { match: false, errorCode: e.code, operatorUsed: e.operator };\n }\n}\n\n// Fill in precise API documentation for matchReport.\n// The executable implementation above is the source of truth.\nmatchReport.doc =\n","golden_completion":"`Wrap assert.deepStrictEqual(actual, expected) in a try/catch and return match: true with null errorCode and operatorUsed when it does not throw.\nWhen Node throws an AssertionError, return match: false with e.code set to \u0027ERR_ASSERTION\u0027 and e.operator set to \u0027deepStrictEqual\u0027.\nNode deepStrictEqual uses Object.is for primitives so NaN equals NaN and +0 differs from -0, compares object prototypes via Object.getPrototypeOf, checks own enumerable string-keyed properties, and compares Map/Set entries by SameValueZero.`","suffix":";\n\nassert.strictEqual(typeof matchReport.doc, \u0027string\u0027);\nassert.ok(matchReport.doc.includes(\u0027assert.deepStrictEqual(actual, expected)\u0027));\nassert.ok(matchReport.doc.includes(\u0027AssertionError\u0027));\nassert.ok(matchReport.doc.includes(\u0027Object.is\u0027));\n\nassert.deepStrictEqual(matchReport(NaN, NaN), { match: true, errorCode: null, operatorUsed: null });\nassert.strictEqual(matchReport(-0, +0).match, false);\nassert.strictEqual(matchReport({ a: 1 }, { a: 1 }).match, true);\nconsole.log(\u0027task31 ok\u0027);\n","assertions":"for (const term of [\n \u0027does not throw\u0027,\n \u0027ERR_ASSERTION\u0027,\n \u0027deepStrictEqual\u0027,\n \u0027Object.is\u0027,\n \u0027NaN equals NaN\u0027,\n \u0027+0 differs from -0\u0027,\n \u0027Object.getPrototypeOf\u0027,\n \u0027own enumerable string-keyed properties\u0027,\n \u0027Map/Set entries\u0027,\n \u0027SameValueZero\u0027\n]) {\n assert.ok(matchReport.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst m1 = matchReport(new Map([[1,\u0027a\u0027]]), new Map([[1,\u0027a\u0027]]));\nassert.strictEqual(m1.match, true);\nconst m2 = matchReport({x:1}, {x:2});\nassert.strictEqual(m2.match, false);\nassert.strictEqual(m2.errorCode, \u0027ERR_ASSERTION\u0027);\nassert.strictEqual(m2.operatorUsed, \u0027deepStrictEqual\u0027);\nconsole.log(\u0027task31 assertions ok\u0027);\n","category":"api_usage"} {"id":"32","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nfunction profileBlock(fn: () =\u003e void): {\n elapsedNs: bigint;\n heapUsedDelta: number;\n rssAtStart: number;\n} {\n const rssAtStart = process.memoryUsage().rss;\n const heapBefore = process.memoryUsage().heapUsed;\n const t0 = process.hrtime.bigint();\n fn();\n const t1 = process.hrtime.bigint();\n const heapAfter = process.memoryUsage().heapUsed;\n return { elapsedNs: t1 - t0, heapUsedDelta: heapAfter - heapBefore, rssAtStart };\n}\n\n// Fill in precise API documentation for profileBlock.\n// The executable implementation above is the source of truth.\nprofileBlock.doc =\n","golden_completion":"`Execute fn synchronously between two process.hrtime.bigint() calls and return the elapsed wall-clock time in nanoseconds as a BigInt.\nprocess.hrtime.bigint() returns the current high-resolution real time as a single BigInt in nanoseconds, unlike the legacy process.hrtime() which returns a [seconds, nanoseconds] tuple.\nCapture process.memoryUsage().rss before fn to record the resident set size in bytes, and compute heapUsedDelta as the difference of process.memoryUsage().heapUsed after fn minus before fn, where heapUsed is the V8 heap memory allocated for JavaScript objects in bytes.`","suffix":";\n\nassert.strictEqual(typeof profileBlock.doc, \u0027string\u0027);\nassert.ok(profileBlock.doc.includes(\u0027process.hrtime.bigint()\u0027));\nassert.ok(profileBlock.doc.includes(\u0027process.memoryUsage()\u0027));\n\nconst result = profileBlock(() =\u003e { let s = 0; for (let i = 0; i \u003c 1000; i++) s += i; });\nassert.strictEqual(typeof result.elapsedNs, \u0027bigint\u0027);\nassert.ok(result.elapsedNs \u003e 0n);\nassert.strictEqual(typeof result.heapUsedDelta, \u0027number\u0027);\nassert.strictEqual(typeof result.rssAtStart, \u0027number\u0027);\nassert.ok(result.rssAtStart \u003e 0);\nconsole.log(\u0027task32 ok\u0027);\n","assertions":"for (const term of [\n \u0027wall-clock time in nanoseconds\u0027,\n \u0027BigInt\u0027,\n \u0027high-resolution real time\u0027,\n \u0027single BigInt in nanoseconds\u0027,\n \u0027legacy process.hrtime()\u0027,\n \u0027[seconds, nanoseconds] tuple\u0027,\n \u0027resident set size in bytes\u0027,\n \u0027heapUsed\u0027,\n \u0027V8 heap memory\u0027,\n \u0027JavaScript objects in bytes\u0027\n]) {\n assert.ok(profileBlock.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst r2 = profileBlock(() =\u003e {});\nassert.ok(r2.elapsedNs \u003e= 0n);\nassert.strictEqual(typeof r2.rssAtStart, \u0027number\u0027);\nconsole.log(\u0027task32 assertions ok\u0027);\n","category":"api_usage"} {"id":"33","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\nimport { performance, PerformanceObserver } from \u0027perf_hooks\u0027;\n\nfunction measureWithObserver(label: string, fn: () =\u003e void): Promise\u003c{\n durationMs: number;\n entryType: string;\n observedCount: number;\n}\u003e {\n return new Promise((resolve) =\u003e {\n let observedCount = 0;\n const obs = new PerformanceObserver((list) =\u003e {\n const entries = list.getEntries();\n observedCount += entries.length;\n const entry = entries.find(e =\u003e e.name === label);\n if (entry) {\n obs.disconnect();\n resolve({ durationMs: entry.duration, entryType: entry.entryType, observedCount });\n }\n });\n obs.observe({ entryTypes: [\u0027measure\u0027] });\n performance.mark(label + \u0027-start\u0027);\n fn();\n performance.mark(label + \u0027-end\u0027);\n performance.measure(label, label + \u0027-start\u0027, label + \u0027-end\u0027);\n });\n}\n\n// Fill in precise API documentation for measureWithObserver.\n// The executable implementation above is the source of truth.\nmeasureWithObserver.doc =\n","golden_completion":"`Create a PerformanceObserver that listens for \u0027measure\u0027 entries via obs.observe({ entryTypes: [\u0027measure\u0027] }), then bracket fn() with performance.mark(label+\u0027-start\u0027) and performance.mark(label+\u0027-end\u0027).\nCall performance.measure(label, startMark, endMark) to create a PerformanceMeasure entry whose duration property is the elapsed milliseconds between the two marks, and whose entryType is always the string \u0027measure\u0027.\nThe observer callback receives a PerformanceObserverEntryList; call list.getEntries() to get an array of PerformanceEntry objects, find the entry matching label by name, then call obs.disconnect() to stop observing before resolving.`","suffix":";\n\nassert.strictEqual(typeof measureWithObserver.doc, \u0027string\u0027);\nassert.ok(measureWithObserver.doc.includes(\u0027PerformanceObserver\u0027));\nassert.ok(measureWithObserver.doc.includes(\u0027performance.mark\u0027));\nassert.ok(measureWithObserver.doc.includes(\u0027performance.measure\u0027));\n\n(async () =\u003e {\n const r = await measureWithObserver(\u0027test-block\u0027, () =\u003e {\n let s = 0; for (let i = 0; i \u003c 100000; i++) s += i;\n });\n assert.strictEqual(r.entryType, \u0027measure\u0027);\n assert.ok(r.durationMs \u003e= 0);\n assert.ok(r.observedCount \u003e= 1);\n console.log(\u0027task33 ok\u0027);\n})();\n","assertions":"for (const term of [\n \"entryTypes: [\u0027measure\u0027]\",\n \u0027performance.mark\u0027,\n \u0027performance.measure(label, startMark, endMark)\u0027,\n \u0027PerformanceMeasure\u0027,\n \u0027elapsed milliseconds between the two marks\u0027,\n \"entryType is always the string \u0027measure\u0027\",\n \u0027PerformanceObserverEntryList\u0027,\n \u0027list.getEntries()\u0027,\n \u0027PerformanceEntry\u0027,\n \u0027obs.disconnect()\u0027\n]) {\n assert.ok(measureWithObserver.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconsole.log(\u0027task33 assertions ok\u0027);\n","category":"api_usage"} {"id":"34","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nfunction diagnosticReport(items: Array\u003c{ name: string; value: number }\u003e): {\n tableLabel: string;\n countLabel: string;\n timeLabel: string;\n itemCount: number;\n} {\n const label = \u0027diag-\u0027 + Date.now();\n console.time(label);\n console.table(items, [\u0027name\u0027, \u0027value\u0027]);\n for (const item of items) {\n console.count(label);\n }\n console.timeLog(label, \u0027processing complete\u0027);\n console.countReset(label);\n console.timeEnd(label);\n return { tableLabel: label, countLabel: label, timeLabel: label, itemCount: items.length };\n}\n\n// Fill in precise API documentation for diagnosticReport.\n// The executable implementation above is the source of truth.\ndiagnosticReport.doc =\n","golden_completion":"`Call console.time(label) to start a timer, then console.table(items, [\u0027name\u0027, \u0027value\u0027]) to print items as a table restricted to the columns \u0027name\u0027 and \u0027value\u0027 via the optional second argument.\nLoop over items calling console.count(label) which increments and prints an internal counter scoped to that label string, then call console.timeLog(label, \u0027processing complete\u0027) to print the elapsed time without stopping the timer, passing extra data arguments after the label.\nFinally call console.countReset(label) to reset the counter for that label to zero and console.timeEnd(label) to stop the timer and print the final elapsed time, removing the timer from the internal registry.`","suffix":";\n\nassert.strictEqual(typeof diagnosticReport.doc, \u0027string\u0027);\nassert.ok(diagnosticReport.doc.includes(\u0027console.time(label)\u0027));\nassert.ok(diagnosticReport.doc.includes(\u0027console.table\u0027));\nassert.ok(diagnosticReport.doc.includes(\u0027console.count\u0027));\n\nconst r = diagnosticReport([{ name: \u0027a\u0027, value: 1 }, { name: \u0027b\u0027, value: 2 }]);\nassert.strictEqual(r.itemCount, 2);\nassert.strictEqual(r.tableLabel, r.countLabel);\nassert.strictEqual(r.countLabel, r.timeLabel);\nconsole.log(\u0027task34 ok\u0027);\n","assertions":"for (const term of [\n \"console.table(items, [\u0027name\u0027, \u0027value\u0027])\",\n \u0027optional second argument\u0027,\n \u0027console.count(label)\u0027,\n \u0027internal counter scoped to that label\u0027,\n \u0027console.timeLog(label\u0027,\n \u0027without stopping the timer\u0027,\n \u0027extra data arguments after the label\u0027,\n \u0027console.countReset(label)\u0027,\n \u0027reset the counter for that label to zero\u0027,\n \u0027console.timeEnd(label)\u0027,\n \u0027removing the timer from the internal registry\u0027\n]) {\n assert.ok(diagnosticReport.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst r2 = diagnosticReport([]);\nassert.strictEqual(r2.itemCount, 0);\nconsole.log(\u0027task34 assertions ok\u0027);\n","category":"api_usage"} {"id":"35","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\nimport { StringDecoder } from \u0027string_decoder\u0027;\n\nfunction streamDecode(chunks: Buffer[], encoding: BufferEncoding = \u0027utf8\u0027): {\n result: string;\n hadPartial: boolean;\n flushed: string;\n} {\n const decoder = new StringDecoder(encoding);\n let result = \u0027\u0027;\n let hadPartial = false;\n for (let i = 0; i \u003c chunks.length; i++) {\n const piece = decoder.write(chunks[i]);\n result += piece;\n if (i \u003c chunks.length - 1 \u0026\u0026 Buffer.byteLength(piece, encoding) \u003c chunks[i].length) {\n hadPartial = true;\n }\n }\n const flushed = decoder.end();\n result += flushed;\n return { result, hadPartial, flushed };\n}\n\n// Fill in precise API documentation for streamDecode.\n// The executable implementation above is the source of truth.\nstreamDecode.doc =\n","golden_completion":"`Create new StringDecoder(encoding) and feed each Buffer chunk through decoder.write(chunk), which returns any complete characters decoded so far while buffering incomplete trailing multi-byte sequences internally.\nSet hadPartial to true when a non-final chunk\u0027s decoded output has fewer bytes (measured by Buffer.byteLength using the same encoding) than the raw chunk length, indicating the decoder retained trailing bytes.\nCall decoder.end() after the loop to flush any remaining buffered bytes as a replacement character U+FFFD if they form an incomplete sequence, and return that flushed string separately alongside the concatenated result.`","suffix":";\n\nassert.strictEqual(typeof streamDecode.doc, \u0027string\u0027);\nassert.ok(streamDecode.doc.includes(\u0027new StringDecoder(encoding)\u0027));\nassert.ok(streamDecode.doc.includes(\u0027decoder.write\u0027));\nassert.ok(streamDecode.doc.includes(\u0027decoder.end()\u0027));\n\nconst simple = streamDecode([Buffer.from(\u0027Hello\u0027), Buffer.from(\u0027 World\u0027)]);\nassert.strictEqual(simple.result, \u0027Hello World\u0027);\nassert.strictEqual(simple.hadPartial, false);\nassert.strictEqual(simple.flushed, \u0027\u0027);\n\nconst euro = Buffer.from(\u0027€\u0027);\nconst split = streamDecode([\n Buffer.concat([Buffer.from(\u0027Price \u0027), euro.subarray(0, 2)]),\n Buffer.concat([euro.subarray(2), Buffer.from(\u0027!\u0027)])\n]);\nassert.strictEqual(split.result, \u0027Price €!\u0027);\nassert.strictEqual(split.hadPartial, true);\nconsole.log(\u0027task35 ok\u0027);\n","assertions":"for (const term of [\n \u0027incomplete trailing multi-byte sequences\u0027,\n \u0027buffering\u0027,\n \u0027Buffer.byteLength\u0027,\n \u0027decoder retained trailing bytes\u0027,\n \u0027flush any remaining buffered bytes\u0027,\n \u0027replacement character U+FFFD\u0027,\n \u0027incomplete sequence\u0027,\n \u0027flushed string separately\u0027,\n \u0027concatenated result\u0027\n]) {\n assert.ok(streamDecode.doc.includes(term), \u0027doc missing: \u0027 + term);\n}\nconst empty = streamDecode([]);\nassert.strictEqual(empty.result, \u0027\u0027);\nassert.strictEqual(empty.hadPartial, false);\nassert.strictEqual(empty.flushed, \u0027\u0027);\nconsole.log(\u0027task35 assertions ok\u0027);\n","category":"api_usage"} {"id":"36","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Build a function that demonstrates TypedArray.from() with a mapping function\n// and the buffer-sharing behavior of subarray() vs slice().\n//\n// Requirements:\n// 1. Create a Uint8Array from an iterable using Uint8Array.from() with a mapFn\n// that doubles each value and clamps to 255\n// 2. Create a subarray view (shares the same ArrayBuffer)\n// 3. Create a slice copy (owns a new ArrayBuffer)\n// 4. Mutate the subarray and verify the original is also mutated\n// 5. Mutate the slice and verify the original is NOT mutated\n// 6. Return { original, subMutated, sliceSafe, sharesSameBuffer }\n\n","golden_completion":"function typedArrayEdgeCases(values: number[]): {\n original: Uint8Array;\n subMutated: boolean;\n sliceSafe: boolean;\n sharesSameBuffer: boolean;\n} {\n const arr = Uint8Array.from(values, (v) =\u003e Math.min(v * 2, 255));\n const sub = arr.subarray(1, 3);\n const slc = arr.slice(1, 3);\n const origBefore = arr[1];\n sub[0] = 99;\n const subMutated = arr[1] === 99;\n arr[1] = origBefore;\n slc[0] = 200;\n const sliceSafe = arr[1] === origBefore;\n const sharesSameBuffer = sub.buffer === arr.buffer;\n arr[1] = origBefore;\n return { original: arr, subMutated, sliceSafe, sharesSameBuffer };\n}\n","suffix":"\nconst r1 = typedArrayEdgeCases([10, 20, 30, 40, 50]);\nassert.deepStrictEqual([...r1.original], [20, 40, 60, 80, 100]);\nassert.strictEqual(r1.subMutated, true);\nassert.strictEqual(r1.sliceSafe, true);\nassert.strictEqual(r1.sharesSameBuffer, true);\n\n// Clamping test\nconst r2 = typedArrayEdgeCases([100, 130, 200]);\nassert.strictEqual(r2.original[0], 200);\nassert.strictEqual(r2.original[1], 255); // clamped\nassert.strictEqual(r2.original[2], 255); // clamped\nconsole.log(\u0027task36 ok\u0027);\n","assertions":"// Verify Uint8Array.from mapFn behavior\nconst r3 = typedArrayEdgeCases([0, 1, 127, 128]);\nassert.deepStrictEqual([...r3.original], [0, 2, 254, 255]);\nassert.strictEqual(r3.subMutated, true);\nassert.strictEqual(r3.sliceSafe, true);\nassert.strictEqual(r3.sharesSameBuffer, true);\n\n// Single element\nconst r4 = typedArrayEdgeCases([50]);\nassert.strictEqual(r4.original[0], 100);\n\n// Empty\nconst r5 = typedArrayEdgeCases([]);\nassert.strictEqual(r5.original.length, 0);\nconsole.log(\u0027task36 assertions ok\u0027);\n","category":"api_usage"} {"id":"37","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Build a function that uses DataView to read/write values with explicit endianness.\n//\n// Requirements:\n// 1. Create an ArrayBuffer of 16 bytes\n// 2. Using a DataView, write the following at the given offsets:\n// - offset 0: Float32 value 3.14 in BIG endian (littleEndian = false)\n// - offset 4: Uint16 value 0xCAFE in LITTLE endian (littleEndian = true)\n// - offset 6: Int32 value -1 in BIG endian\n// - offset 10: Float64 value 2.718 in LITTLE endian\n// 3. Read them back with the SAME endianness and return the values\n// 4. ALSO read the Uint16 at offset 4 with BIG endian to show the byte-swap effect\n// 5. Return { f32, u16, i32, f64, u16BigEndian }\n\n","golden_completion":"function dataViewEndianness(): {\n f32: number;\n u16: number;\n i32: number;\n f64: number;\n u16BigEndian: number;\n} {\n const buf = new ArrayBuffer(18);\n const view = new DataView(buf);\n view.setFloat32(0, 3.14, false);\n view.setUint16(4, 0xCAFE, true);\n view.setInt32(6, -1, false);\n view.setFloat64(10, 2.718, true);\n return {\n f32: view.getFloat32(0, false),\n u16: view.getUint16(4, true),\n i32: view.getInt32(6, false),\n f64: view.getFloat64(10, true),\n u16BigEndian: view.getUint16(4, false),\n };\n}\n","suffix":"\nconst r = dataViewEndianness();\nassert.ok(Math.abs(r.f32 - 3.14) \u003c 0.001);\nassert.strictEqual(r.u16, 0xCAFE);\nassert.strictEqual(r.i32, -1);\nassert.ok(Math.abs(r.f64 - 2.718) \u003c 0.0001);\n// Reading 0xCAFE written in LE as BE gives 0xFECA\nassert.strictEqual(r.u16BigEndian, 0xFECA);\nconsole.log(\u0027task37 ok\u0027);\n","assertions":"// Verify exact byte layout by reading raw bytes\nconst buf2 = new ArrayBuffer(18);\nconst dv2 = new DataView(buf2);\ndv2.setUint16(4, 0xCAFE, true);\n// LE writes FE at offset 4, CA at offset 5\nassert.strictEqual(dv2.getUint8(4), 0xFE);\nassert.strictEqual(dv2.getUint8(5), 0xCA);\n\n// Int32 -1 in BE is 0xFFFFFFFF\ndv2.setInt32(6, -1, false);\nassert.strictEqual(dv2.getUint8(6), 0xFF);\nassert.strictEqual(dv2.getUint8(7), 0xFF);\nassert.strictEqual(dv2.getUint8(8), 0xFF);\nassert.strictEqual(dv2.getUint8(9), 0xFF);\nconsole.log(\u0027task37 assertions ok\u0027);\n","category":"api_usage"} {"id":"38","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Build a function demonstrating Atomics operations on a SharedArrayBuffer.\n//\n// Requirements:\n// 1. Create a SharedArrayBuffer with space for 4 Int32 values\n// 2. Create an Int32Array view on it\n// 3. Use Atomics.store to set index 0 to 42 (returns the stored value)\n// 4. Use Atomics.load to read index 0\n// 5. Use Atomics.add to atomically add 8 to index 0 (returns the OLD value before add)\n// 6. Use Atomics.compareExchange at index 1: set to 100 only if current is 0\n// (returns the OLD value at that index)\n// 7. Use Atomics.exchange at index 2: set to 77 (returns the OLD value)\n// 8. Use Atomics.or at index 3: bitwise OR with 0x0F when index 3 is 0xF0\n// (returns the OLD value)\n// 9. Return all intermediate and final values\n\n","golden_completion":"function atomicsDemo(): {\n storeReturn: number;\n loaded: number;\n addReturn: number;\n afterAdd: number;\n cmpxReturn: number;\n afterCmpx: number;\n exchReturn: number;\n afterExch: number;\n orReturn: number;\n afterOr: number;\n} {\n const sab = new SharedArrayBuffer(16);\n const arr = new Int32Array(sab);\n const storeReturn = Atomics.store(arr, 0, 42);\n const loaded = Atomics.load(arr, 0);\n const addReturn = Atomics.add(arr, 0, 8);\n const afterAdd = Atomics.load(arr, 0);\n const cmpxReturn = Atomics.compareExchange(arr, 1, 0, 100);\n const afterCmpx = Atomics.load(arr, 1);\n const exchReturn = Atomics.exchange(arr, 2, 77);\n const afterExch = Atomics.load(arr, 2);\n Atomics.store(arr, 3, 0xF0);\n const orReturn = Atomics.or(arr, 3, 0x0F);\n const afterOr = Atomics.load(arr, 3);\n return { storeReturn, loaded, addReturn, afterAdd, cmpxReturn, afterCmpx, exchReturn, afterExch, orReturn, afterOr };\n}\n","suffix":"\nconst r = atomicsDemo();\nassert.strictEqual(r.storeReturn, 42);\nassert.strictEqual(r.loaded, 42);\nassert.strictEqual(r.addReturn, 42); // OLD value before add\nassert.strictEqual(r.afterAdd, 50); // 42 + 8\nassert.strictEqual(r.cmpxReturn, 0); // OLD value (was 0, matched, so set to 100)\nassert.strictEqual(r.afterCmpx, 100);\nassert.strictEqual(r.exchReturn, 0); // OLD value at index 2\nassert.strictEqual(r.afterExch, 77);\nconsole.log(\u0027task38 ok\u0027);\n","assertions":"// Atomics.or returns OLD value before OR\nassert.strictEqual(r.orReturn, 0xF0);\n// 0xF0 | 0x0F = 0xFF\nassert.strictEqual(r.afterOr, 0xFF);\n\n// Verify Atomics.compareExchange when condition is NOT met\nconst sab2 = new SharedArrayBuffer(4);\nconst arr2 = new Int32Array(sab2);\nAtomics.store(arr2, 0, 5);\nconst cmpResult = Atomics.compareExchange(arr2, 0, 999, 200);\nassert.strictEqual(cmpResult, 5); // returns old value\nassert.strictEqual(Atomics.load(arr2, 0), 5); // NOT changed because 5 !== 999\nconsole.log(\u0027task38 assertions ok\u0027);\n","category":"api_usage"} {"id":"39","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Build a validation proxy factory that:\n// 1. Uses a Proxy with \u0027set\u0027 trap to validate property assignments\n// 2. The \u0027set\u0027 trap must use Reflect.set() and return its boolean result\n// 3. Properties starting with \u0027_\u0027 are read-only (set trap returns false)\n// 4. Numeric properties must be finite numbers (reject NaN, Infinity, -Infinity)\n// 5. The \u0027get\u0027 trap uses Reflect.get() but returns undefined for missing props\n// instead of the default behavior\n// 6. The \u0027has\u0027 trap uses Reflect.has() but also returns true for \u0027_keys\u0027\n// 7. Track all rejected set attempts in a \u0027rejections\u0027 array on the handler\n// 8. Return { proxy, getRejections: () =\u003e string[] }\n\n","golden_completion":"function createValidationProxy\u003cT extends Record\u003cstring, any\u003e\u003e(target: T): {\n proxy: T;\n getRejections: () =\u003e string[];\n} {\n const rejections: string[] = [];\n const handler: ProxyHandler\u003cT\u003e = {\n set(obj, prop, value, receiver) {\n const key = String(prop);\n if (key.startsWith(\u0027_\u0027)) {\n rejections.push(`readonly:${key}`);\n return false;\n }\n if (typeof value === \u0027number\u0027 \u0026\u0026 !Number.isFinite(value)) {\n rejections.push(`non-finite:${key}`);\n return false;\n }\n return Reflect.set(obj, prop, value, receiver);\n },\n get(obj, prop, receiver) {\n if (!(prop in obj)) return undefined;\n return Reflect.get(obj, prop, receiver);\n },\n has(obj, prop) {\n if (prop === \u0027_keys\u0027) return true;\n return Reflect.has(obj, prop);\n },\n };\n return { proxy: new Proxy(target, handler), getRejections: () =\u003e [...rejections] };\n}\n","suffix":"\nconst target: Record\u003cstring, any\u003e = { name: \u0027test\u0027, _id: 1, count: 0 };\nconst { proxy, getRejections } = createValidationProxy(target);\nproxy.name = \u0027updated\u0027;\nassert.strictEqual(proxy.name, \u0027updated\u0027);\n\n// Read-only rejection\nassert.strictEqual(Reflect.set(proxy, \u0027_id\u0027, 999), false);\nassert.strictEqual(proxy._id, 1);\n\n// Non-finite rejection\nproxy.count = 42;\nassert.strictEqual(proxy.count, 42);\nassert.strictEqual(Reflect.set(proxy, \u0027count\u0027, NaN), false);\nassert.strictEqual(proxy.count, 42);\nassert.strictEqual(Reflect.set(proxy, \u0027count\u0027, Infinity), false);\n\n// has trap\nassert.strictEqual(\u0027name\u0027 in proxy, true);\nassert.strictEqual(\u0027_keys\u0027 in proxy, true);\nassert.strictEqual(\u0027nonexistent\u0027 in proxy, false);\n\n// get trap returns undefined for missing\nassert.strictEqual(proxy.missing, undefined);\n\nconsole.log(\u0027task39 ok\u0027);\n","assertions":"const rej = getRejections();\nassert.ok(rej.includes(\u0027readonly:_id\u0027));\nassert.ok(rej.includes(\u0027non-finite:count\u0027));\nassert.ok(rej.filter(r =\u003e r.startsWith(\u0027non-finite\u0027)).length \u003e= 2);\n\n// Verify Reflect.set through proxy respects the trap\nconst target2: Record\u003cstring, any\u003e = { x: 0, _y: 0 };\nconst { proxy: p2, getRejections: gr2 } = createValidationProxy(target2);\nReflect.set(p2, \u0027x\u0027, 10);\nassert.strictEqual(p2.x, 10);\nReflect.set(p2, \u0027_y\u0027, 20);\nassert.strictEqual(p2._y, 0);\nassert.ok(gr2().includes(\u0027readonly:_y\u0027));\n\n// String values pass through (no finite check on strings)\np2.x = \u0027hello\u0027;\nassert.strictEqual(p2.x, \u0027hello\u0027);\nconsole.log(\u0027task39 assertions ok\u0027);\n","category":"api_usage"} {"id":"40","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Build a class RangeSet that uses well-known symbols:\n//\n// 1. Symbol.iterator: yield all integers in [start, end) — half-open range\n// 2. Symbol.toPrimitive:\n// - hint \u0027number\u0027 → return the count of integers (end - start)\n// - hint \u0027string\u0027 → return \"RangeSet(start..end)\"\n// - hint \u0027default\u0027 → return the count (same as number)\n// 3. Symbol.hasInstance: x instanceof RangeSet is true when x is a number\n// AND x is an integer AND x \u003e= start AND x \u003c end\n// 4. Symbol.toStringTag: return \u0027RangeSet\u0027 so Object.prototype.toString\n// returns \u0027[object RangeSet]\u0027\n// 5. The constructor takes (start: number, end: number)\n\n","golden_completion":"class RangeSet {\n readonly start: number;\n readonly end: number;\n\n constructor(start: number, end: number) {\n this.start = start;\n this.end = end;\n }\n\n *[Symbol.iterator](): Generator\u003cnumber\u003e {\n for (let i = this.start; i \u003c this.end; i++) yield i;\n }\n\n [Symbol.toPrimitive](hint: string): number | string {\n if (hint === \u0027string\u0027) return `RangeSet(${this.start}..${this.end})`;\n return this.end - this.start;\n }\n\n static [Symbol.hasInstance](x: any): boolean {\n return typeof x === \u0027number\u0027 \u0026\u0026 Number.isInteger(x) \u0026\u0026 x \u003e= 0;\n }\n\n get [Symbol.toStringTag](): string {\n return \u0027RangeSet\u0027;\n }\n}\n","suffix":"\nconst rs = new RangeSet(3, 7);\nassert.deepStrictEqual([...rs], [3, 4, 5, 6]);\nassert.strictEqual(Number(rs), 4);\nassert.strictEqual(`${rs}`, \u0027RangeSet(3..7)\u0027);\nassert.strictEqual(Object.prototype.toString.call(rs), \u0027[object RangeSet]\u0027);\n\nconst rs2 = new RangeSet(0, 3);\nassert.deepStrictEqual([...rs2], [0, 1, 2]);\nassert.strictEqual(Number(rs2), 3);\nassert.strictEqual(`${rs2}`, \u0027RangeSet(0..3)\u0027);\nconsole.log(\u0027task40 ok\u0027);\n","assertions":"// Empty range\nconst empty = new RangeSet(5, 5);\nassert.deepStrictEqual([...empty], []);\nassert.strictEqual(Number(empty), 0);\nassert.strictEqual(`${empty}`, \u0027RangeSet(5..5)\u0027);\n\n// toPrimitive \u0027default\u0027 hint (used in == and +)\nconst rs3 = new RangeSet(0, 10);\nassert.strictEqual(Number(rs3) + 0, 10);\n\n// toStringTag\nassert.strictEqual(Object.prototype.toString.call(rs3), \u0027[object RangeSet]\u0027);\n\n// Negative range\nconst neg = new RangeSet(-2, 2);\nassert.deepStrictEqual([...neg], [-2, -1, 0, 1]);\nassert.strictEqual(Number(neg), 4);\nconsole.log(\u0027task40 assertions ok\u0027);\n","category":"api_usage"} {"id":"41","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Buffer encoding utility library\n// Converts strings between encodings via Buffer intermediary\n\n// Demonstrate: Buffer.from interprets the string AS that encoding\n// Buffer.from(\u0027AQID\u0027, \u0027base64\u0027) -\u003e \u003cBuffer 01 02 03\u003e (decodes base64)\n// .toString(\u0027hex\u0027) -\u003e \u0027010203\u0027\n\nconst demo1 = Buffer.from(\u0027AQID\u0027, \u0027base64\u0027).toString(\u0027hex\u0027);\nassert.strictEqual(demo1, \u0027010203\u0027);\n\n// Buffer.from(\u002748656c6c6f\u0027, \u0027hex\u0027) -\u003e \u003cBuffer 48 65 6c 6c 6f\u003e\n// .toString(\u0027utf8\u0027) -\u003e \u0027Hello\u0027\nconst demo2 = Buffer.from(\u002748656c6c6f\u0027, \u0027hex\u0027).toString(\u0027utf8\u0027);\nassert.strictEqual(demo2, \u0027Hello\u0027);\n\n","golden_completion":"function convertEncoding(input: string, fromEnc: BufferEncoding, toEnc: BufferEncoding): string {\n return Buffer.from(input, fromEnc).toString(toEnc);\n}\n\n","suffix":"// Convert base64 to hex\nconst r1 = convertEncoding(\u0027AQID\u0027, \u0027base64\u0027, \u0027hex\u0027);\nassert.strictEqual(r1, \u0027010203\u0027);\n\n// Convert hex to utf8\nconst r2 = convertEncoding(\u002748656c6c6f\u0027, \u0027hex\u0027, \u0027utf8\u0027);\nassert.strictEqual(r2, \u0027Hello\u0027);\n\n// Convert utf8 to base64\nconst r3 = convertEncoding(\u0027Hello\u0027, \u0027utf8\u0027, \u0027base64\u0027);\nassert.strictEqual(r3, \u0027SGVsbG8=\u0027);\n\n// Round-trip: utf8 -\u003e hex -\u003e utf8\nconst r4 = convertEncoding(\n convertEncoding(\u0027TypeScript\u0027, \u0027utf8\u0027, \u0027hex\u0027),\n \u0027hex\u0027, \u0027utf8\u0027\n);\nassert.strictEqual(r4, \u0027TypeScript\u0027);\nconsole.log(\u0027Task 41 suffix passed\u0027);\n","assertions":"// Base64 to utf8\nconst a1 = convertEncoding(\u0027SGVsbG8gV29ybGQ=\u0027, \u0027base64\u0027, \u0027utf8\u0027);\nassert.strictEqual(a1, \u0027Hello World\u0027);\n\n// utf8 to hex\nconst a2 = convertEncoding(\u0027AB\u0027, \u0027utf8\u0027, \u0027hex\u0027);\nassert.strictEqual(a2, \u00274142\u0027);\n\n// hex to base64\nconst a3 = convertEncoding(\u00274142\u0027, \u0027hex\u0027, \u0027base64\u0027);\nassert.strictEqual(a3, \u0027QUI=\u0027);\n\n// Empty string\nconst a4 = convertEncoding(\u0027\u0027, \u0027utf8\u0027, \u0027hex\u0027);\nassert.strictEqual(a4, \u0027\u0027);\n\nconsole.log(\u0027Task 41 assertions passed\u0027);\n","category":"api_usage"} {"id":"42","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Date arithmetic library with CUSTOM business rules:\n// - \"Business months\" are 1-indexed (January=1, December=12)\n// - Internally converts to JS Date (0-indexed months)\n// - Returns results in business month format (1-indexed)\n\ninterface DateInfo {\n year: number;\n month: number; // 1-indexed business month\n day: number;\n dayOfWeek: string;\n daysInMonth: number;\n}\n\n// Reference: dayOfWeek mapping\nconst DAYS = [\u0027Sunday\u0027, \u0027Monday\u0027, \u0027Tuesday\u0027, \u0027Wednesday\u0027, \u0027Thursday\u0027, \u0027Friday\u0027, \u0027Saturday\u0027];\n\n// Known: Jan 1, 2024 was a Monday\nconst jan1 = new Date(2024, 0, 1); // month 0 = January\nassert.strictEqual(DAYS[jan1.getDay()], \u0027Monday\u0027);\n\n","golden_completion":"function getDateInfo(year: number, businessMonth: number, day: number): DateInfo {\n // Convert 1-indexed business month to 0-indexed JS month\n const date = new Date(year, businessMonth - 1, day);\n // Days in this month: create date for day 0 of NEXT month\n const daysInMonth = new Date(year, businessMonth, 0).getDate();\n return {\n year: date.getFullYear(),\n month: businessMonth,\n day: date.getDate(),\n dayOfWeek: DAYS[date.getDay()],\n daysInMonth\n };\n}\n\n","suffix":"// January 1, 2024 = Monday\nconst d1 = getDateInfo(2024, 1, 1);\nassert.strictEqual(d1.dayOfWeek, \u0027Monday\u0027);\nassert.strictEqual(d1.month, 1);\nassert.strictEqual(d1.daysInMonth, 31);\n\n// February 2024 (leap year) = 29 days\nconst d2 = getDateInfo(2024, 2, 15);\nassert.strictEqual(d2.daysInMonth, 29);\nassert.strictEqual(d2.month, 2);\n\n// March 1, 2024 = Friday\nconst d3 = getDateInfo(2024, 3, 1);\nassert.strictEqual(d3.dayOfWeek, \u0027Friday\u0027);\n\n// December 25, 2024 = Wednesday\nconst d4 = getDateInfo(2024, 12, 25);\nassert.strictEqual(d4.dayOfWeek, \u0027Wednesday\u0027);\nassert.strictEqual(d4.daysInMonth, 31);\nconsole.log(\u0027Task 42 suffix passed\u0027);\n","assertions":"// February 2023 (non-leap year) = 28 days\nconst a1 = getDateInfo(2023, 2, 1);\nassert.strictEqual(a1.daysInMonth, 28);\n\n// April has 30 days\nconst a2 = getDateInfo(2024, 4, 10);\nassert.strictEqual(a2.daysInMonth, 30);\n\n// July 4, 2024 = Thursday\nconst a3 = getDateInfo(2024, 7, 4);\nassert.strictEqual(a3.dayOfWeek, \u0027Thursday\u0027);\n\n// Verify month stays as business month (1-indexed)\nassert.strictEqual(a3.month, 7);\nassert.strictEqual(a3.year, 2024);\nassert.strictEqual(a3.day, 4);\n\nconsole.log(\u0027Task 42 assertions passed\u0027);\n","category":"api_usage"} {"id":"43","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Numeric parsing library with STRICT validation\n// Uses Number.isFinite (not global isFinite) and Number.isNaN (not global isNaN)\n//\n// KEY DIFFERENCES (from MDN):\n// - global isNaN(\u0027hello\u0027) =\u003e true (coerces string, then checks)\n// - Number.isNaN(\u0027hello\u0027) =\u003e false (no coercion, \u0027hello\u0027 is not NaN)\n// - Number.isNaN(NaN) =\u003e true\n// - global isFinite(\u002742\u0027) =\u003e true (coerces \u002742\u0027 to 42, which is finite)\n// - Number.isFinite(\u002742\u0027) =\u003e false (no coercion, string is not finite)\n// - Number.isFinite(42) =\u003e true\n\ninterface ParseResult {\n value: number;\n isValid: boolean; // true only if Number.isFinite(value)\n originalType: string; // typeof input\n parseMethod: string; // \u0027int\u0027 or \u0027float\u0027\n}\n\n","golden_completion":"function strictParse(input: unknown, method: \u0027int\u0027 | \u0027float\u0027, radix?: number): ParseResult {\n const originalType = typeof input;\n let value: number;\n if (method === \u0027int\u0027) {\n value = parseInt(String(input), radix ?? 10);\n } else {\n value = parseFloat(String(input));\n }\n return {\n value,\n isValid: Number.isFinite(value),\n originalType,\n parseMethod: method\n };\n}\n\n","suffix":"// Basic integer parsing\nconst r1 = strictParse(\u002742\u0027, \u0027int\u0027);\nassert.strictEqual(r1.value, 42);\nassert.strictEqual(r1.isValid, true);\nassert.strictEqual(r1.originalType, \u0027string\u0027);\n\n// Hex parsing with radix\nconst r2 = strictParse(\u0027ff\u0027, \u0027int\u0027, 16);\nassert.strictEqual(r2.value, 255);\nassert.strictEqual(r2.isValid, true);\n\n// Float parsing\nconst r3 = strictParse(\u00273.14\u0027, \u0027float\u0027);\nassert.strictEqual(r3.value, 3.14);\nassert.strictEqual(r3.isValid, true);\n\n// Invalid input -\u003e NaN -\u003e isValid=false\nconst r4 = strictParse(\u0027hello\u0027, \u0027int\u0027);\nassert.strictEqual(Number.isNaN(r4.value), true);\nassert.strictEqual(r4.isValid, false);\n\n// Infinity is NOT valid (Number.isFinite(Infinity) === false)\nconst r5 = strictParse(\u0027Infinity\u0027, \u0027float\u0027);\nassert.strictEqual(r5.value, Infinity);\nassert.strictEqual(r5.isValid, false);\nconsole.log(\u0027Task 43 suffix passed\u0027);\n","assertions":"// parseInt stops at first non-digit: \u002742abc\u0027 -\u003e 42\nconst a1 = strictParse(\u002742abc\u0027, \u0027int\u0027);\nassert.strictEqual(a1.value, 42);\nassert.strictEqual(a1.isValid, true);\n\n// Binary parsing\nconst a2 = strictParse(\u00271010\u0027, \u0027int\u0027, 2);\nassert.strictEqual(a2.value, 10);\nassert.strictEqual(a2.isValid, true);\n\n// Octal parsing\nconst a3 = strictParse(\u002777\u0027, \u0027int\u0027, 8);\nassert.strictEqual(a3.value, 63);\n\n// Number input (typeof === \u0027number\u0027)\nconst a4 = strictParse(42, \u0027int\u0027);\nassert.strictEqual(a4.originalType, \u0027number\u0027);\nassert.strictEqual(a4.value, 42);\n\n// parseFloat(\u0027\u0027) =\u003e NaN\nconst a5 = strictParse(\u0027\u0027, \u0027float\u0027);\nassert.strictEqual(Number.isNaN(a5.value), true);\nassert.strictEqual(a5.isValid, false);\n\n// NaN input\nconst a6 = strictParse(NaN, \u0027float\u0027);\nassert.strictEqual(Number.isNaN(a6.value), true);\nassert.strictEqual(a6.isValid, false);\n\nconsole.log(\u0027Task 43 assertions passed\u0027);\n","category":"api_usage"} {"id":"44","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Object transformation utility\n// Uses Object.entries() and Object.fromEntries() for key/value transforms\n//\n// Object.entries({ a: 1, b: 2 }) =\u003e [[\u0027a\u0027, 1], [\u0027b\u0027, 2]]\n// Object.fromEntries([[\u0027a\u0027, 1], [\u0027b\u0027, 2]]) =\u003e { a: 1, b: 2 }\n\n// Demo: filter object to keep only values \u003e threshold\nfunction filterValues(obj: Record\u003cstring, number\u003e, threshold: number): Record\u003cstring, number\u003e {\n return Object.fromEntries(\n Object.entries(obj).filter(([_, v]) =\u003e v \u003e threshold)\n );\n}\n\nconst filtered = filterValues({ a: 1, b: 5, c: 3 }, 2);\nassert.deepStrictEqual(filtered, { b: 5, c: 3 });\n\n","golden_completion":"function mapEntries(\n obj: Record\u003cstring, number\u003e,\n keyFn: (k: string) =\u003e string,\n valFn: (v: number) =\u003e number\n): Record\u003cstring, number\u003e {\n return Object.fromEntries(\n Object.entries(obj).map(([k, v]) =\u003e [keyFn(k), valFn(v)])\n );\n}\n\n","suffix":"// Transform keys to uppercase, values doubled\nconst r1 = mapEntries({ x: 1, y: 2 }, k =\u003e k.toUpperCase(), v =\u003e v * 2);\nassert.deepStrictEqual(r1, { X: 2, Y: 4 });\n\n// Prefix keys, negate values\nconst r2 = mapEntries({ a: 10, b: 20 }, k =\u003e \u0027pre_\u0027 + k, v =\u003e -v);\nassert.deepStrictEqual(r2, { pre_a: -10, pre_b: -20 });\n\n// Identity transforms\nconst r3 = mapEntries({ m: 5 }, k =\u003e k, v =\u003e v);\nassert.deepStrictEqual(r3, { m: 5 });\n\n// Empty object\nconst r4 = mapEntries({}, k =\u003e k, v =\u003e v);\nassert.deepStrictEqual(r4, {});\nconsole.log(\u0027Task 44 suffix passed\u0027);\n","assertions":"// Key suffix + square values\nconst a1 = mapEntries({ a: 3, b: 4 }, k =\u003e k + \u0027_sq\u0027, v =\u003e v * v);\nassert.deepStrictEqual(a1, { a_sq: 9, b_sq: 16 });\n\n// Single entry\nconst a2 = mapEntries({ z: 100 }, k =\u003e k.repeat(2), v =\u003e v / 10);\nassert.deepStrictEqual(a2, { zz: 10 });\n\n// Key transform collision (last wins)\nconst a3 = mapEntries({ a: 1, b: 2 }, _ =\u003e \u0027same\u0027, v =\u003e v);\nassert.strictEqual(a3[\u0027same\u0027], 2);\n\nconsole.log(\u0027Task 44 assertions passed\u0027);\n","category":"api_usage"} {"id":"45","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// AbortController utilities for cancellable operations\n// Key API details:\n// - controller.abort(reason?) sets signal.aborted=true, signal.reason=reason\n// - If no reason provided, signal.reason defaults to a DOMException with name \u0027AbortError\u0027\n// - signal.throwIfAborted() throws signal.reason if aborted\n// - AbortSignal.abort(reason?) creates an already-aborted signal\n\n// Demo: basic abort with custom reason\nconst demo = new AbortController();\ndemo.abort(\u0027custom reason\u0027);\nassert.strictEqual(demo.signal.aborted, true);\nassert.strictEqual(demo.signal.reason, \u0027custom reason\u0027);\n\n// Demo: abort with no reason -\u003e DOMException\nconst demo2 = new AbortController();\ndemo2.abort();\nassert.strictEqual(demo2.signal.aborted, true);\nassert.strictEqual(demo2.signal.reason.name, \u0027AbortError\u0027);\n\ninterface AbortInfo {\n aborted: boolean;\n reason: unknown;\n reasonType: string; // typeof reason\n reasonName?: string; // reason.name if it\u0027s an Error/DOMException\n}\n\n","golden_completion":"function getAbortInfo(signal: AbortSignal): AbortInfo {\n const info: AbortInfo = {\n aborted: signal.aborted,\n reason: signal.reason,\n reasonType: typeof signal.reason,\n };\n if (signal.reason instanceof Error || (signal.reason \u0026\u0026 typeof signal.reason === \u0027object\u0027 \u0026\u0026 \u0027name\u0027 in signal.reason)) {\n info.reasonName = (signal.reason as any).name;\n }\n return info;\n}\n\n","suffix":"// Not aborted yet\nconst c1 = new AbortController();\nconst i1 = getAbortInfo(c1.signal);\nassert.strictEqual(i1.aborted, false);\nassert.strictEqual(i1.reasonType, \u0027undefined\u0027);\nassert.strictEqual(i1.reasonName, undefined);\n\n// Aborted with string reason\nconst c2 = new AbortController();\nc2.abort(\u0027timeout\u0027);\nconst i2 = getAbortInfo(c2.signal);\nassert.strictEqual(i2.aborted, true);\nassert.strictEqual(i2.reason, \u0027timeout\u0027);\nassert.strictEqual(i2.reasonType, \u0027string\u0027);\nassert.strictEqual(i2.reasonName, undefined);\n\n// Aborted with no reason -\u003e DOMException AbortError\nconst c3 = new AbortController();\nc3.abort();\nconst i3 = getAbortInfo(c3.signal);\nassert.strictEqual(i3.aborted, true);\nassert.strictEqual(i3.reasonType, \u0027object\u0027);\nassert.strictEqual(i3.reasonName, \u0027AbortError\u0027);\nconsole.log(\u0027Task 45 suffix passed\u0027);\n","assertions":"// Aborted with numeric reason\nconst c4 = new AbortController();\nc4.abort(42);\nconst i4 = getAbortInfo(c4.signal);\nassert.strictEqual(i4.aborted, true);\nassert.strictEqual(i4.reason, 42);\nassert.strictEqual(i4.reasonType, \u0027number\u0027);\nassert.strictEqual(i4.reasonName, undefined);\n\n// Aborted with Error object\nconst c5 = new AbortController();\nc5.abort(new TypeError(\u0027bad input\u0027));\nconst i5 = getAbortInfo(c5.signal);\nassert.strictEqual(i5.aborted, true);\nassert.strictEqual(i5.reasonType, \u0027object\u0027);\nassert.strictEqual(i5.reasonName, \u0027TypeError\u0027);\n\n// Already-aborted signal via AbortSignal.abort()\nconst preAborted = AbortSignal.abort(\u0027pre-aborted\u0027);\nconst i6 = getAbortInfo(preAborted);\nassert.strictEqual(i6.aborted, true);\nassert.strictEqual(i6.reason, \u0027pre-aborted\u0027);\nassert.strictEqual(i6.reasonType, \u0027string\u0027);\n\nconsole.log(\u0027Task 45 assertions passed\u0027);\n","category":"api_usage"} {"id":"46","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Map utility library — operations that preserve insertion order\n// Key API: Map preserves insertion order of keys\n\n// Demo: Map from entries preserves order\nconst demo = new Map\u003cstring, number\u003e([[\u0027b\u0027, 2], [\u0027a\u0027, 1], [\u0027c\u0027, 3]]);\nconst keys = [...demo.keys()];\nassert.deepStrictEqual(keys, [\u0027b\u0027, \u0027a\u0027, \u0027c\u0027]); // insertion order, NOT sorted\n\n// Demo: Map.get returns undefined for missing keys\nassert.strictEqual(demo.get(\u0027z\u0027), undefined);\n\n// Demo: Map.has checks key existence\nassert.strictEqual(demo.has(\u0027a\u0027), true);\nassert.strictEqual(demo.has(\u0027z\u0027), false);\n\n","golden_completion":"function invertMap\u003cK, V\u003e(map: Map\u003cK, V\u003e): Map\u003cV, K[]\u003e {\n const result = new Map\u003cV, K[]\u003e();\n for (const [k, v] of map) {\n const existing = result.get(v);\n if (existing) {\n existing.push(k);\n } else {\n result.set(v, [k]);\n }\n }\n return result;\n}\n\n","suffix":"// Basic inversion: unique values\nconst m1 = new Map\u003cstring, number\u003e([[\u0027a\u0027, 1], [\u0027b\u0027, 2], [\u0027c\u0027, 3]]);\nconst inv1 = invertMap(m1);\nassert.deepStrictEqual(inv1.get(1), [\u0027a\u0027]);\nassert.deepStrictEqual(inv1.get(2), [\u0027b\u0027]);\nassert.deepStrictEqual(inv1.get(3), [\u0027c\u0027]);\n\n// Duplicate values: keys collected in insertion order\nconst m2 = new Map\u003cstring, number\u003e([[\u0027x\u0027, 1], [\u0027y\u0027, 1], [\u0027z\u0027, 2]]);\nconst inv2 = invertMap(m2);\nassert.deepStrictEqual(inv2.get(1), [\u0027x\u0027, \u0027y\u0027]);\nassert.deepStrictEqual(inv2.get(2), [\u0027z\u0027]);\n\n// Verify insertion order of inverted map\nconst invKeys = [...inv2.keys()];\nassert.deepStrictEqual(invKeys, [1, 2]); // order of first occurrence\nconsole.log(\u0027Task 46 suffix passed\u0027);\n","assertions":"// Empty map\nconst m3 = new Map\u003cstring, string\u003e();\nconst inv3 = invertMap(m3);\nassert.strictEqual(inv3.size, 0);\n\n// All same value\nconst m4 = new Map\u003cstring, number\u003e([[\u0027a\u0027, 5], [\u0027b\u0027, 5], [\u0027c\u0027, 5]]);\nconst inv4 = invertMap(m4);\nassert.strictEqual(inv4.size, 1);\nassert.deepStrictEqual(inv4.get(5), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n\n// Single entry\nconst m5 = new Map\u003cnumber, string\u003e([[1, \u0027one\u0027]]);\nconst inv5 = invertMap(m5);\nassert.deepStrictEqual(inv5.get(\u0027one\u0027), [1]);\n\nconsole.log(\u0027Task 46 assertions passed\u0027);\n","category":"api_usage"} {"id":"47","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Batch operation result collector using Promise.allSettled\n// Key API: Promise.allSettled() never rejects — it returns:\n// { status: \u0027fulfilled\u0027, value: T } for resolved promises\n// { status: \u0027rejected\u0027, reason: any } for rejected promises\n\ninterface BatchResult\u003cT\u003e {\n successes: T[];\n failures: string[]; // stringified reasons\n total: number;\n successRate: number; // successes.length / total, or 0 if total is 0\n}\n\n// batchProcess takes an array of task thunks and runs them all via\n// Promise.allSettled, collecting successes and stringified failures.\n\n","golden_completion":"async function batchProcess\u003cT\u003e(fns: (() =\u003e Promise\u003cT\u003e)[]): Promise\u003cBatchResult\u003cT\u003e\u003e {\n if (fns.length === 0) return { successes: [], failures: [], total: 0, successRate: 0 };\n const results = await Promise.allSettled(fns.map(f =\u003e f()));\n const successes: T[] = [];\n const failures: string[] = [];\n for (const r of results) {\n if (r.status === \u0027fulfilled\u0027) successes.push(r.value);\n else failures.push(String(r.reason));\n }\n return { successes, failures, total: fns.length, successRate: successes.length / fns.length };\n}\n\n","suffix":"// All succeed\n(async () =\u003e {\n const r1 = await batchProcess([\n () =\u003e Promise.resolve(1),\n () =\u003e Promise.resolve(2),\n () =\u003e Promise.resolve(3),\n ]);\n assert.deepStrictEqual(r1.successes, [1, 2, 3]);\n assert.deepStrictEqual(r1.failures, []);\n assert.strictEqual(r1.total, 3);\n assert.strictEqual(r1.successRate, 1);\n\n // Mixed results\n const r2 = await batchProcess([\n () =\u003e Promise.resolve(\u0027ok\u0027),\n () =\u003e Promise.reject(\u0027fail1\u0027),\n () =\u003e Promise.resolve(\u0027also ok\u0027),\n () =\u003e Promise.reject(\u0027fail2\u0027),\n ]);\n assert.deepStrictEqual(r2.successes, [\u0027ok\u0027, \u0027also ok\u0027]);\n assert.deepStrictEqual(r2.failures, [\u0027fail1\u0027, \u0027fail2\u0027]);\n assert.strictEqual(r2.total, 4);\n assert.strictEqual(r2.successRate, 0.5);\n\n // All fail\n const r3 = await batchProcess([\n () =\u003e Promise.reject(new Error(\u0027e1\u0027)),\n () =\u003e Promise.reject(\u0027e2\u0027),\n ]);\n assert.deepStrictEqual(r3.successes, []);\n assert.strictEqual(r3.failures.length, 2);\n assert.strictEqual(r3.successRate, 0);\n\n console.log(\u0027Task 47 suffix passed\u0027);\n","assertions":" // Empty input\n const r4 = await batchProcess\u003cnumber\u003e([]);\n assert.deepStrictEqual(r4.successes, []);\n assert.deepStrictEqual(r4.failures, []);\n assert.strictEqual(r4.total, 0);\n assert.strictEqual(r4.successRate, 0);\n\n // Single success\n const r5 = await batchProcess([() =\u003e Promise.resolve(42)]);\n assert.deepStrictEqual(r5.successes, [42]);\n assert.strictEqual(r5.successRate, 1);\n\n // Error reasons are stringified\n const r6 = await batchProcess([\n () =\u003e Promise.reject(404),\n ]);\n assert.deepStrictEqual(r6.failures, [\u0027404\u0027]);\n\n console.log(\u0027Task 47 assertions passed\u0027);\n})();\n","category":"api_usage"} {"id":"48","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// TextEncoder.encodeInto() writes UTF-8 bytes into an existing Uint8Array\n// Returns { read: number, written: number }\n// read = number of UTF-16 code units consumed from the string\n// written = number of UTF-8 bytes written to the buffer\n//\n// If the buffer is too small, it writes as many COMPLETE characters as fit\n// (never writes partial multi-byte sequences)\n\nconst encoder = new TextEncoder();\n\n// Demo: \"Hello\" = 5 bytes UTF-8, fits in 10-byte buffer\nconst buf1 = new Uint8Array(10);\nconst res1 = encoder.encodeInto(\u0027Hello\u0027, buf1);\nassert.strictEqual(res1.read, 5);\nassert.strictEqual(res1.written, 5);\n\n// Demo: buffer too small — \"Hello\" needs 5 bytes, only 3 available\nconst buf2 = new Uint8Array(3);\nconst res2 = encoder.encodeInto(\u0027Hello\u0027, buf2);\nassert.strictEqual(res2.read, 3); // 3 chars consumed\nassert.strictEqual(res2.written, 3); // 3 bytes written (\u0027Hel\u0027)\n\n// Demo: multi-byte char \"€\" = 3 bytes UTF-8\nconst buf3 = new Uint8Array(2);\nconst res3 = encoder.encodeInto(\u0027€\u0027, buf3);\nassert.strictEqual(res3.read, 0); // can\u0027t fit even 1 char\nassert.strictEqual(res3.written, 0); // nothing written\n\ninterface EncodeChunkResult {\n chunk: Uint8Array;\n charsConsumed: number;\n bytesWritten: number;\n complete: boolean; // true if entire string was consumed\n}\n\n","golden_completion":"function encodeChunk(input: string, maxBytes: number): EncodeChunkResult {\n const buf = new Uint8Array(maxBytes);\n const { read, written } = encoder.encodeInto(input, buf);\n return {\n chunk: buf.subarray(0, written),\n charsConsumed: read!,\n bytesWritten: written!,\n complete: read === input.length,\n };\n}\n\n","suffix":"// ASCII fits perfectly\nconst r1 = encodeChunk(\u0027abc\u0027, 10);\nassert.strictEqual(r1.charsConsumed, 3);\nassert.strictEqual(r1.bytesWritten, 3);\nassert.strictEqual(r1.complete, true);\nassert.deepStrictEqual([...r1.chunk], [0x61, 0x62, 0x63]);\n\n// Truncation: only 2 bytes available for \"Hello\"\nconst r2 = encodeChunk(\u0027Hello\u0027, 2);\nassert.strictEqual(r2.charsConsumed, 2);\nassert.strictEqual(r2.bytesWritten, 2);\nassert.strictEqual(r2.complete, false);\n\n// Multi-byte: \"€\" needs 3 bytes\nconst r3 = encodeChunk(\u0027€\u0027, 3);\nassert.strictEqual(r3.charsConsumed, 1);\nassert.strictEqual(r3.bytesWritten, 3);\nassert.strictEqual(r3.complete, true);\n\n// Multi-byte doesn\u0027t fit: \"€\" in 2-byte buffer\nconst r4 = encodeChunk(\u0027€\u0027, 2);\nassert.strictEqual(r4.charsConsumed, 0);\nassert.strictEqual(r4.bytesWritten, 0);\nassert.strictEqual(r4.complete, false);\nconsole.log(\u0027Task 48 suffix passed\u0027);\n","assertions":"// Empty string\nconst a1 = encodeChunk(\u0027\u0027, 10);\nassert.strictEqual(a1.charsConsumed, 0);\nassert.strictEqual(a1.bytesWritten, 0);\nassert.strictEqual(a1.complete, true);\n\n// Zero-size buffer\nconst a2 = encodeChunk(\u0027test\u0027, 0);\nassert.strictEqual(a2.charsConsumed, 0);\nassert.strictEqual(a2.bytesWritten, 0);\nassert.strictEqual(a2.complete, false);\n\n// Mixed ASCII and multi-byte: \"a€b\" = 1 + 3 + 1 = 5 bytes\nconst a3 = encodeChunk(\u0027a€b\u0027, 5);\nassert.strictEqual(a3.charsConsumed, 3);\nassert.strictEqual(a3.bytesWritten, 5);\nassert.strictEqual(a3.complete, true);\n\n// Partial: \"a€b\" in 4-byte buffer: \u0027a\u0027 (1 byte) + \u0027€\u0027 (3 bytes) = 4, \u0027b\u0027 doesn\u0027t fit\nconst a4 = encodeChunk(\u0027a€b\u0027, 4);\nassert.strictEqual(a4.charsConsumed, 2);\nassert.strictEqual(a4.bytesWritten, 4);\nassert.strictEqual(a4.complete, false);\n\nconsole.log(\u0027Task 48 assertions passed\u0027);\n","category":"api_usage"} {"id":"49","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Intl.NumberFormat utility for formatting numbers\n// Key API details:\n// - new Intl.NumberFormat(locale, options).format(number)\n// - style: \u0027decimal\u0027 (default), \u0027currency\u0027, \u0027percent\u0027, \u0027unit\u0027\n// - For currency: must provide \u0027currency\u0027 option (ISO 4217 code)\n// - For percent: 0.42 formats as \"42%\"\n\n// Demo: basic US formatting\nconst usFmt = new Intl.NumberFormat(\u0027en-US\u0027);\nassert.strictEqual(usFmt.format(1234.5), \u00271,234.5\u0027);\n\n// Demo: percent — note input is 0.42, output is \"42%\"\nconst pctFmt = new Intl.NumberFormat(\u0027en-US\u0027, { style: \u0027percent\u0027 });\nassert.strictEqual(pctFmt.format(0.42), \u002742%\u0027);\n\ninterface FormatResult {\n formatted: string;\n style: string;\n locale: string;\n}\n\n","golden_completion":"function formatNumber(\n value: number, locale: string,\n style: \u0027decimal\u0027 | \u0027currency\u0027 | \u0027percent\u0027, currency?: string\n): FormatResult {\n const options: Intl.NumberFormatOptions = { style };\n if (style === \u0027currency\u0027 \u0026\u0026 currency) options.currency = currency;\n return { formatted: new Intl.NumberFormat(locale, options).format(value), style, locale };\n}\n\n","suffix":"// Decimal formatting\nconst r1 = formatNumber(1234567.89, \u0027en-US\u0027, \u0027decimal\u0027);\nassert.strictEqual(r1.formatted, \u00271,234,567.89\u0027);\nassert.strictEqual(r1.style, \u0027decimal\u0027);\n\n// Currency formatting\nconst r2 = formatNumber(42.5, \u0027en-US\u0027, \u0027currency\u0027, \u0027USD\u0027);\nassert.strictEqual(r2.formatted, \u0027$42.50\u0027);\n\n// Percent formatting (0.75 -\u003e \"75%\")\nconst r3 = formatNumber(0.75, \u0027en-US\u0027, \u0027percent\u0027);\nassert.strictEqual(r3.formatted, \u002775%\u0027);\n\n// Verify locale is preserved\nassert.strictEqual(r1.locale, \u0027en-US\u0027);\nassert.strictEqual(r2.locale, \u0027en-US\u0027);\nconsole.log(\u0027Task 49 suffix passed\u0027);\n","assertions":"// Zero\nconst a1 = formatNumber(0, \u0027en-US\u0027, \u0027decimal\u0027);\nassert.strictEqual(a1.formatted, \u00270\u0027);\n\n// Negative currency\nconst a2 = formatNumber(-99.99, \u0027en-US\u0027, \u0027currency\u0027, \u0027USD\u0027);\nassert.ok(a2.formatted.includes(\u002799.99\u0027));\n\n// Small percent\nconst a3 = formatNumber(0.005, \u0027en-US\u0027, \u0027percent\u0027);\nassert.strictEqual(a3.formatted, \u00271%\u0027); // rounds to nearest integer percent\n\n// Large number\nconst a4 = formatNumber(1000000, \u0027en-US\u0027, \u0027decimal\u0027);\nassert.strictEqual(a4.formatted, \u00271,000,000\u0027);\n\nconsole.log(\u0027Task 49 assertions passed\u0027);\n","category":"api_usage"} {"id":"50","testsource":"devbench-api-usage","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\nimport * as crypto from \u0027crypto\u0027;\n\n// AES-256-GCM encrypt/decrypt utility\n// Key API details for GCM mode:\n// - IV must be 12 bytes (96 bits) for GCM — NOT 16 bytes like CBC\n// - After cipher.final(), call cipher.getAuthTag() to get 16-byte tag\n// - Before decipher.final(), call decipher.setAuthTag(tag)\n// - getAuthTag() MUST be called AFTER final(), not before\n\ninterface EncryptedData {\n ciphertext: string; // hex-encoded\n iv: string; // hex-encoded (12 bytes = 24 hex chars)\n authTag: string; // hex-encoded (16 bytes = 32 hex chars)\n algorithm: string;\n}\n\n// encryptGCM: encrypt plaintext with AES-256-GCM, return EncryptedData\n// decryptGCM: decrypt EncryptedData back to plaintext string\n\n","golden_completion":"function encryptGCM(plaintext: string, key: Buffer): EncryptedData {\n const iv = crypto.randomBytes(12);\n const cipher = crypto.createCipheriv(\u0027aes-256-gcm\u0027, key, iv);\n const ct = cipher.update(plaintext, \u0027utf8\u0027, \u0027hex\u0027) + cipher.final(\u0027hex\u0027);\n return { ciphertext: ct, iv: iv.toString(\u0027hex\u0027), authTag: cipher.getAuthTag().toString(\u0027hex\u0027), algorithm: \u0027aes-256-gcm\u0027 };\n}\n\nfunction decryptGCM(data: EncryptedData, key: Buffer): string {\n const decipher = crypto.createDecipheriv(\u0027aes-256-gcm\u0027, key, Buffer.from(data.iv, \u0027hex\u0027));\n decipher.setAuthTag(Buffer.from(data.authTag, \u0027hex\u0027));\n return decipher.update(data.ciphertext, \u0027hex\u0027, \u0027utf8\u0027) + decipher.final(\u0027utf8\u0027);\n}\n\n","suffix":"// Generate a 32-byte key for AES-256\nconst key = crypto.randomBytes(32);\n\n// Encrypt and verify structure\nconst enc1 = encryptGCM(\u0027Hello, TypeScript!\u0027, key);\nassert.strictEqual(enc1.algorithm, \u0027aes-256-gcm\u0027);\nassert.strictEqual(enc1.iv.length, 24); // 12 bytes = 24 hex chars\nassert.strictEqual(enc1.authTag.length, 32); // 16 bytes = 32 hex chars\n\n// Decrypt and verify round-trip\nconst dec1 = decryptGCM(enc1, key);\nassert.strictEqual(dec1, \u0027Hello, TypeScript!\u0027);\n\n// Different plaintext\nconst enc2 = encryptGCM(\u0027secret data 123\u0027, key);\nconst dec2 = decryptGCM(enc2, key);\nassert.strictEqual(dec2, \u0027secret data 123\u0027);\n\n// Each encryption produces different IV (random)\nassert.notStrictEqual(enc1.iv, enc2.iv);\nconsole.log(\u0027Task 50 suffix passed\u0027);\n","assertions":"// Empty string encryption\nconst enc3 = encryptGCM(\u0027\u0027, key);\nassert.strictEqual(enc3.iv.length, 24);\nassert.strictEqual(enc3.authTag.length, 32);\nconst dec3 = decryptGCM(enc3, key);\nassert.strictEqual(dec3, \u0027\u0027);\n\n// Long string\nconst longStr = \u0027A\u0027.repeat(1000);\nconst enc4 = encryptGCM(longStr, key);\nconst dec4 = decryptGCM(enc4, key);\nassert.strictEqual(dec4, longStr);\n\n// Wrong key fails decryption\nconst wrongKey = crypto.randomBytes(32);\ntry {\n decryptGCM(enc1, wrongKey);\n assert.fail(\u0027Should have thrown with wrong key\u0027);\n} catch (e: any) {\n assert.ok(e.message.includes(\u0027Unsupported state\u0027) || e.message.includes(\u0027unable\u0027) || e.code === \u0027ERR_OSSL_BAD_DECRYPT\u0027 || true);\n}\n\n// Tampered authTag fails\nconst tampered = { ...enc1, authTag: \u002700\u0027.repeat(16) };\ntry {\n decryptGCM(tampered, key);\n assert.fail(\u0027Should have thrown with tampered auth tag\u0027);\n} catch (e: any) {\n // Expected: authentication failure\n}\n\nconsole.log(\u0027Task 50 assertions passed\u0027);\n","category":"api_usage"} {"id":"1","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface AuditEntry {\n from: string;\n to: string;\n ts: number;\n}\n\nclass Subscription {\n static VALID_TRANSITIONS: Record\u003cstring, string[]\u003e = {\n pending: [\u0027active\u0027],\n active: [\u0027paused\u0027, \u0027cancelled\u0027],\n paused: [\u0027active\u0027, \u0027cancelled\u0027],\n cancelled: []\n };\n\n userId: string;\n plan: string;\n state: string;\n auditLog: AuditEntry[];\n activatedAt: number | null;\n pausedAt: number | null;\n totalPausedMs: number;\n\n constructor(userId: string, plan: string) {\n this.userId = userId;\n this.plan = plan;\n this.state = \u0027pending\u0027;\n this.auditLog = [];\n this.activatedAt = null;\n this.pausedAt = null;\n this.totalPausedMs = 0;\n }\n\n _transition(newState: string, ts: number): void {\n const allowed = Subscription.VALID_TRANSITIONS[this.state];\n if (!allowed || !allowed.includes(newState)) {\n throw new Error(`Cannot transition from ${this.state} to ${newState}`);\n }\n this.auditLog.push({ from: this.state, to: newState, ts });\n this.state = newState;\n }\n\n","golden_completion":" activate(ts: number): void {\n this._transition(\u0027active\u0027, ts);\n this.activatedAt = ts;\n }\n\n","suffix":"\n pause(ts: number): void {\n this._transition(\u0027paused\u0027, ts);\n this.pausedAt = ts;\n }\n}\n\nconst s1 = new Subscription(\u0027u1\u0027, \u0027pro\u0027);\ns1.activate(1000);\nassert.strictEqual(s1.state, \u0027active\u0027);\nassert.strictEqual(s1.activatedAt, 1000);\nassert.strictEqual(s1.auditLog.length, 1);\nassert.deepStrictEqual(s1.auditLog[0], { from: \u0027pending\u0027, to: \u0027active\u0027, ts: 1000 });\n","assertions":"\nconst s2 = new Subscription(\u0027u2\u0027, \u0027basic\u0027);\ns2.activate(500);\nassert.strictEqual(s2.state, \u0027active\u0027);\nassert.strictEqual(s2.activatedAt, 500);\n\n// Cannot activate again from active state\ntry {\n s2.activate(600);\n assert.fail(\u0027Should not allow double activation\u0027);\n} catch (e: any) {\n assert.ok(e.message.includes(\u0027Cannot transition\u0027));\n}\n\n// Cannot activate a cancelled subscription\nconst s3 = new Subscription(\u0027u3\u0027, \u0027pro\u0027);\ns3.activate(100);\ns3._transition(\u0027cancelled\u0027, 200);\ntry {\n s3.activate(300);\n assert.fail(\u0027Should not activate cancelled\u0027);\n} catch (e: any) {\n assert.ok(e.message.includes(\u0027Cannot transition\u0027));\n}\n","category":"code_purpose_understanding"} {"id":"2","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface PaymentAllocation {\n fees: number;\n interest: number;\n principal: number;\n unapplied: number;\n}\n\ninterface PaymentLogEntry {\n paymentId: string;\n amount: number;\n applied: PaymentAllocation;\n}\n\nclass LoanAccount {\n loanId: string;\n feesDue: number;\n interestDue: number;\n principalDue: number;\n unapplied: number;\n auditLog: PaymentLogEntry[];\n private _idempotencyKeys: Set\u003cstring\u003e;\n\n constructor(loanId: string) {\n this.loanId = loanId;\n this.feesDue = 0;\n this.interestDue = 0;\n this.principalDue = 0;\n this.unapplied = 0;\n this.auditLog = [];\n this._idempotencyKeys = new Set();\n }\n\n addCharges(fees: number, interest: number, principal: number): void {\n this.feesDue += fees;\n this.interestDue += interest;\n this.principalDue += principal;\n }\n\n","golden_completion":" applyPayment(paymentId: string, amount: number): PaymentAllocation {\n if (this._idempotencyKeys.has(paymentId)) {\n return this.auditLog.find(e =\u003e e.paymentId === paymentId)!.applied;\n }\n this._idempotencyKeys.add(paymentId);\n let remaining = amount;\n const feePart = Math.min(remaining, this.feesDue);\n this.feesDue -= feePart;\n remaining -= feePart;\n const intPart = Math.min(remaining, this.interestDue);\n this.interestDue -= intPart;\n remaining -= intPart;\n const prinPart = Math.min(remaining, this.principalDue);\n this.principalDue -= prinPart;\n remaining -= prinPart;\n this.unapplied += remaining;\n const applied: PaymentAllocation = { fees: feePart, interest: intPart, principal: prinPart, unapplied: remaining };\n this.auditLog.push({ paymentId, amount, applied });\n return applied;\n }\n\n","suffix":"}\n\nconst loan = new LoanAccount(\u0027L1\u0027);\nloan.addCharges(50, 200, 1000);\nconst r1 = loan.applyPayment(\u0027P1\u0027, 300);\nassert.deepStrictEqual(r1, { fees: 50, interest: 200, principal: 50, unapplied: 0 });\nassert.strictEqual(loan.feesDue, 0);\nassert.strictEqual(loan.interestDue, 0);\nassert.strictEqual(loan.principalDue, 950);\n","assertions":"\n// Idempotency: same paymentId returns cached result, no side effects\nconst r1dup = loan.applyPayment(\u0027P1\u0027, 300);\nassert.deepStrictEqual(r1dup, { fees: 50, interest: 200, principal: 50, unapplied: 0 });\nassert.strictEqual(loan.principalDue, 950);\n\n// Second payment: all goes to principal\nconst r2 = loan.applyPayment(\u0027P2\u0027, 500);\nassert.deepStrictEqual(r2, { fees: 0, interest: 0, principal: 500, unapplied: 0 });\nassert.strictEqual(loan.principalDue, 450);\n\n// Third payment: overpayment goes to unapplied\nconst r3 = loan.applyPayment(\u0027P3\u0027, 600);\nassert.deepStrictEqual(r3, { fees: 0, interest: 0, principal: 450, unapplied: 150 });\nassert.strictEqual(loan.principalDue, 0);\nassert.strictEqual(loan.unapplied, 150);\n","category":"code_purpose_understanding"} {"id":"3","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface AdjudicationResult {\n memberPay: number;\n planPay: number;\n}\n\ninterface ClaimRecord {\n claimId: string;\n billed: number;\n memberPay: number;\n planPay: number;\n}\n\nclass InsurancePlan {\n copay: number;\n deductible: number;\n coinsurancePct: number;\n outOfPocketMax: number;\n deductibleMet: number;\n oopAccumulator: number;\n claims: ClaimRecord[];\n private _claimIds: Set\u003cstring\u003e;\n\n constructor(copay: number, deductible: number, coinsurancePct: number, outOfPocketMax: number) {\n this.copay = copay;\n this.deductible = deductible;\n this.coinsurancePct = coinsurancePct;\n this.outOfPocketMax = outOfPocketMax;\n this.deductibleMet = 0;\n this.oopAccumulator = 0;\n this.claims = [];\n this._claimIds = new Set();\n }\n\n","golden_completion":" adjudicate(claimId: string, billedAmount: number): AdjudicationResult {\n if (this._claimIds.has(claimId)) {\n const cached = this.claims.find(c =\u003e c.claimId === claimId)!;\n return { memberPay: cached.memberPay, planPay: cached.planPay };\n }\n this._claimIds.add(claimId);\n if (this.oopAccumulator \u003e= this.outOfPocketMax) {\n this.claims.push({ claimId, billed: billedAmount, memberPay: 0, planPay: billedAmount });\n return { memberPay: 0, planPay: billedAmount };\n }\n let memberTotal = this.copay;\n let remaining = billedAmount - this.copay;\n const deductibleNeeded = Math.max(0, this.deductible - this.deductibleMet);\n const deductiblePart = Math.min(remaining, deductibleNeeded);\n this.deductibleMet += deductiblePart;\n memberTotal += deductiblePart;\n remaining -= deductiblePart;\n const coinsurance = Math.round(remaining * this.coinsurancePct * 100) / 100;\n memberTotal += coinsurance;\n if (this.oopAccumulator + memberTotal \u003e this.outOfPocketMax) {\n memberTotal = this.outOfPocketMax - this.oopAccumulator;\n }\n this.oopAccumulator += memberTotal;\n const planPay = billedAmount - memberTotal;\n this.claims.push({ claimId, billed: billedAmount, memberPay: memberTotal, planPay });\n return { memberPay: memberTotal, planPay };\n }\n\n","suffix":"}\n\nconst plan = new InsurancePlan(30, 500, 0.2, 2000);\nconst c1 = plan.adjudicate(\u0027C1\u0027, 1000);\nassert.strictEqual(c1.memberPay, 624);\nassert.strictEqual(c1.planPay, 376);\nassert.strictEqual(plan.deductibleMet, 500);\nassert.strictEqual(plan.oopAccumulator, 624);\n","assertions":"\n// Claim 2: $2000 billed, deductible already met\nconst c2 = plan.adjudicate(\u0027C2\u0027, 2000);\nassert.strictEqual(c2.memberPay, 424);\nassert.strictEqual(c2.planPay, 1576);\nassert.strictEqual(plan.oopAccumulator, 1048);\n\n// Claim 3: $8000 billed - OOP cap kicks in\nconst c3 = plan.adjudicate(\u0027C3\u0027, 8000);\nassert.strictEqual(c3.memberPay, 952);\nassert.strictEqual(c3.planPay, 7048);\nassert.strictEqual(plan.oopAccumulator, 2000);\n\n// After OOP max, member pays nothing\nconst c4 = plan.adjudicate(\u0027C4\u0027, 5000);\nassert.strictEqual(c4.memberPay, 0);\nassert.strictEqual(c4.planPay, 5000);\n\n// Idempotency\nconst c1dup = plan.adjudicate(\u0027C1\u0027, 1000);\nassert.strictEqual(c1dup.memberPay, 624);\nassert.strictEqual(plan.oopAccumulator, 2000);\n","category":"code_purpose_understanding"} {"id":"4","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface ReleaseResult {\n released: number;\n blocked: boolean;\n reason?: string;\n}\n\ninterface ReleaseLogEntry {\n milestoneId: string;\n gross: number;\n holdback: number;\n net: number;\n}\n\nclass EscrowAccount {\n totalAmount: number;\n holdbackPct: number;\n released: number;\n holdback: number;\n defects: Set\u003cstring\u003e;\n milestones: Record\u003cstring, { pct: number; released: boolean }\u003e;\n log: ReleaseLogEntry[];\n private _processedIds: Set\u003cstring\u003e;\n\n constructor(totalAmount: number, holdbackPct: number) {\n this.totalAmount = totalAmount;\n this.holdbackPct = holdbackPct;\n this.released = 0;\n this.holdback = 0;\n this.defects = new Set();\n this.milestones = {};\n this.log = [];\n this._processedIds = new Set();\n }\n\n registerMilestone(id: string, pct: number): void {\n this.milestones[id] = { pct, released: false };\n }\n\n reportDefect(defectId: string): void {\n this.defects.add(defectId);\n }\n\n resolveDefect(defectId: string): void {\n this.defects.delete(defectId);\n }\n\n","golden_completion":" releaseMilestone(milestoneId: string): ReleaseResult {\n if (this._processedIds.has(milestoneId)) {\n const cached = this.log.find(e =\u003e e.milestoneId === milestoneId)!;\n return { released: cached.net, blocked: false };\n }\n if (!this.milestones[milestoneId]) {\n return { released: 0, blocked: true, reason: \u0027not_registered\u0027 };\n }\n if (this.defects.size \u003e 0) {\n return { released: 0, blocked: true, reason: \u0027defects_pending\u0027 };\n }\n const ms = this.milestones[milestoneId];\n if (ms.released) {\n return { released: 0, blocked: true, reason: \u0027already_released\u0027 };\n }\n const gross = this.totalAmount * ms.pct;\n const hb = gross * this.holdbackPct;\n const net = gross - hb;\n ms.released = true;\n this.released += net;\n this.holdback += hb;\n this._processedIds.add(milestoneId);\n this.log.push({ milestoneId, gross, holdback: hb, net });\n return { released: net, blocked: false };\n }\n\n","suffix":"}\n\nconst escrow = new EscrowAccount(100000, 0.1);\nescrow.registerMilestone(\u0027M1\u0027, 0.3);\nescrow.registerMilestone(\u0027M2\u0027, 0.5);\nescrow.registerMilestone(\u0027M3\u0027, 0.2);\n\nconst r1 = escrow.releaseMilestone(\u0027M1\u0027);\nassert.strictEqual(r1.released, 27000);\nassert.strictEqual(r1.blocked, false);\nassert.strictEqual(escrow.released, 27000);\nassert.strictEqual(escrow.holdback, 3000);\n","assertions":"\n// Defect blocks release\nescrow.reportDefect(\u0027D1\u0027);\nconst r2 = escrow.releaseMilestone(\u0027M2\u0027);\nassert.strictEqual(r2.blocked, true);\nassert.strictEqual(r2.reason, \u0027defects_pending\u0027);\nassert.strictEqual(escrow.released, 27000);\n\n// Resolve defect, now M2 releases\nescrow.resolveDefect(\u0027D1\u0027);\nconst r2b = escrow.releaseMilestone(\u0027M2\u0027);\nassert.strictEqual(r2b.released, 45000);\nassert.strictEqual(escrow.released, 72000);\nassert.strictEqual(escrow.holdback, 8000);\n\n// Idempotency: M1 again returns cached\nconst r1dup = escrow.releaseMilestone(\u0027M1\u0027);\nassert.strictEqual(r1dup.released, 27000);\nassert.strictEqual(r1dup.blocked, false);\nassert.strictEqual(escrow.released, 72000);\n\n// Unregistered milestone\nconst rBad = escrow.releaseMilestone(\u0027M99\u0027);\nassert.strictEqual(rBad.blocked, true);\nassert.strictEqual(rBad.reason, \u0027not_registered\u0027);\n","category":"code_purpose_understanding"} {"id":"5","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface CreditEntry {\n id: string;\n amount: number;\n}\n\ninterface CreditUsed {\n id: string;\n used: number;\n}\n\ninterface Invoice {\n gross: number;\n net: number;\n creditsUsed: CreditUsed[];\n}\n\nclass UsageBilling {\n ratePerUnit: number;\n minimumCommit: number;\n credits: CreditEntry[];\n invoices: Record\u003cstring, Invoice\u003e;\n totalBilled: number;\n\n constructor(ratePerUnit: number, minimumCommit: number) {\n this.ratePerUnit = ratePerUnit;\n this.minimumCommit = minimumCommit;\n this.credits = [];\n this.invoices = {};\n this.totalBilled = 0;\n }\n\n addCredit(creditId: string, amount: number): void {\n this.credits.push({ id: creditId, amount });\n }\n\n","golden_completion":" closePeriod(periodId: string, units: number): Invoice {\n if (this.invoices[periodId]) {\n return this.invoices[periodId];\n }\n const gross = Math.max(units * this.ratePerUnit, this.minimumCommit);\n let remaining = gross;\n const creditsUsed: CreditUsed[] = [];\n while (remaining \u003e 0 \u0026\u0026 this.credits.length \u003e 0) {\n const credit = this.credits[0];\n const used = Math.min(credit.amount, remaining);\n creditsUsed.push({ id: credit.id, used });\n credit.amount -= used;\n remaining -= used;\n if (credit.amount \u003c= 0) {\n this.credits.shift();\n }\n }\n const net = remaining;\n this.totalBilled += net;\n const invoice: Invoice = { gross, net, creditsUsed };\n this.invoices[periodId] = invoice;\n return invoice;\n }\n\n","suffix":"}\n\nconst billing = new UsageBilling(0.05, 100);\nbilling.addCredit(\u0027CR1\u0027, 30);\nbilling.addCredit(\u0027CR2\u0027, 50);\n\nconst inv1 = billing.closePeriod(\u0027JAN\u0027, 3000);\nassert.strictEqual(inv1.gross, 150);\nassert.strictEqual(inv1.net, 70);\nassert.deepStrictEqual(inv1.creditsUsed, [{ id: \u0027CR1\u0027, used: 30 }, { id: \u0027CR2\u0027, used: 50 }]);\nassert.strictEqual(billing.credits.length, 0);\n","assertions":"\n// Period 2: low usage, minimum commit kicks in\nconst inv2 = billing.closePeriod(\u0027FEB\u0027, 500);\nassert.strictEqual(inv2.gross, 100);\nassert.strictEqual(inv2.net, 100);\nassert.strictEqual(billing.totalBilled, 170);\n\n// Add credit, test partial consumption\nbilling.addCredit(\u0027CR3\u0027, 200);\nconst inv3 = billing.closePeriod(\u0027MAR\u0027, 4000);\nassert.strictEqual(inv3.gross, 200);\nassert.strictEqual(inv3.net, 0);\nassert.deepStrictEqual(inv3.creditsUsed, [{ id: \u0027CR3\u0027, used: 200 }]);\nassert.strictEqual(billing.credits.length, 0);\n\n// Idempotency\nconst inv1dup = billing.closePeriod(\u0027JAN\u0027, 9999);\nassert.strictEqual(inv1dup.gross, 150);\nassert.strictEqual(inv1dup.net, 70);\nassert.strictEqual(billing.totalBilled, 170);\n","category":"code_purpose_understanding"} {"id":"6","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Batch {\n batchId: string;\n qty: number;\n expiresAt: number;\n}\n\ninterface AllocationEntry {\n batchId: string;\n qty: number;\n}\n\ninterface AllocationResult {\n success: boolean;\n allocations: AllocationEntry[];\n reason?: string;\n}\n\nclass Warehouse {\n batches: Batch[];\n reservations: Record\u003cstring, AllocationEntry[]\u003e;\n committed: Set\u003cstring\u003e;\n\n constructor() {\n this.batches = [];\n this.reservations = {};\n this.committed = new Set();\n }\n\n receiveBatch(batchId: string, qty: number, expiresAt: number): void {\n this.batches.push({ batchId, qty, expiresAt });\n this.batches.sort((a, b) =\u003e a.expiresAt - b.expiresAt);\n }\n\n","golden_completion":" reserve(orderId: string, requestedQty: number, now: number): AllocationResult {\n if (this.reservations[orderId]) {\n return { success: true, allocations: this.reservations[orderId] };\n }\n const validBatches = this.batches.filter(b =\u003e b.expiresAt \u003e now \u0026\u0026 b.qty \u003e 0);\n let remaining = requestedQty;\n const allocations: AllocationEntry[] = [];\n const consumed: { idx: number; qty: number }[] = [];\n for (const batch of validBatches) {\n if (remaining \u003c= 0) break;\n const take = Math.min(batch.qty, remaining);\n allocations.push({ batchId: batch.batchId, qty: take });\n consumed.push({ idx: this.batches.indexOf(batch), qty: take });\n remaining -= take;\n }\n if (remaining \u003e 0) {\n return { success: false, allocations: [], reason: \u0027insufficient_stock\u0027 };\n }\n for (const c of consumed) {\n this.batches[c.idx].qty -= c.qty;\n }\n this.reservations[orderId] = allocations;\n return { success: true, allocations };\n }\n\n","suffix":"}\n\nconst wh = new Warehouse();\nwh.receiveBatch(\u0027B1\u0027, 10, 1000);\nwh.receiveBatch(\u0027B2\u0027, 20, 2000);\nwh.receiveBatch(\u0027B3\u0027, 5, 500);\n\n// FEFO: B3 expires first (500), then B1 (1000), then B2 (2000)\n// At now=400, all valid. Request 12: B3(5) + B1(7) = 12\nconst r1 = wh.reserve(\u0027O1\u0027, 12, 400);\nassert.strictEqual(r1.success, true);\nassert.deepStrictEqual(r1.allocations, [\n { batchId: \u0027B3\u0027, qty: 5 },\n { batchId: \u0027B1\u0027, qty: 7 }\n]);\n","assertions":"\n// B3 is now 0, B1 is now 3, B2 is still 20\n// At now=600, B3 is expired anyway. Request 25: B1(3) + B2(20) = 23 \u003c 25\nconst r2 = wh.reserve(\u0027O2\u0027, 25, 600);\nassert.strictEqual(r2.success, false);\nassert.strictEqual(r2.reason, \u0027insufficient_stock\u0027);\n// Stock unchanged after failed reservation\nassert.strictEqual(wh.batches.find(b =\u003e b.batchId === \u0027B1\u0027)!.qty, 3);\nassert.strictEqual(wh.batches.find(b =\u003e b.batchId === \u0027B2\u0027)!.qty, 20);\n\n// Successful reservation of remaining stock\nconst r3 = wh.reserve(\u0027O3\u0027, 23, 600);\nassert.strictEqual(r3.success, true);\nassert.deepStrictEqual(r3.allocations, [\n { batchId: \u0027B1\u0027, qty: 3 },\n { batchId: \u0027B2\u0027, qty: 20 }\n]);\n\n// Idempotency: re-reserving O1 returns cached\nconst r1dup = wh.reserve(\u0027O1\u0027, 999, 400);\nassert.strictEqual(r1dup.success, true);\nassert.deepStrictEqual(r1dup.allocations, [\n { batchId: \u0027B3\u0027, qty: 5 },\n { batchId: \u0027B1\u0027, qty: 7 }\n]);\n","category":"code_purpose_understanding"} {"id":"7","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface LineItem {\n sku: string;\n qty: number;\n unitPrice: number;\n}\n\ninterface OrderResult {\n subtotal: number;\n discount: number;\n taxableAmount: number;\n tax: number;\n shipping: number;\n total: number;\n error?: string;\n}\n\nclass OrderProcessor {\n taxRate: number;\n freeShippingThreshold: number;\n shippingCost: number;\n minimumOrder: number;\n discountTiers: { min: number; pct: number }[];\n private _processedOrders: Map\u003cstring, OrderResult\u003e;\n\n constructor(config: {\n taxRate: number;\n freeShippingThreshold: number;\n shippingCost: number;\n minimumOrder: number;\n discountTiers: { min: number; pct: number }[];\n }) {\n this.taxRate = config.taxRate;\n this.freeShippingThreshold = config.freeShippingThreshold;\n this.shippingCost = config.shippingCost;\n this.minimumOrder = config.minimumOrder;\n this.discountTiers = config.discountTiers.sort((a, b) =\u003e b.min - a.min);\n this._processedOrders = new Map();\n }\n\n","golden_completion":" processOrder(orderId: string, items: LineItem[]): OrderResult {\n if (this._processedOrders.has(orderId)) {\n return this._processedOrders.get(orderId)!;\n }\n const subtotal = items.reduce((sum, item) =\u003e sum + item.qty * item.unitPrice, 0);\n if (subtotal \u003c this.minimumOrder) {\n const result: OrderResult = { subtotal, discount: 0, taxableAmount: 0, tax: 0, shipping: 0, total: 0, error: \u0027below_minimum\u0027 };\n this._processedOrders.set(orderId, result);\n return result;\n }\n const tier = this.discountTiers.find(t =\u003e subtotal \u003e= t.min);\n const discountPct = tier ? tier.pct : 0;\n const discount = Math.round(subtotal * discountPct * 100) / 100;\n const taxableAmount = subtotal - discount;\n const tax = Math.round(taxableAmount * this.taxRate * 100) / 100;\n const shipping = subtotal \u003e= this.freeShippingThreshold ? 0 : this.shippingCost;\n const total = taxableAmount + tax + shipping;\n const result: OrderResult = { subtotal, discount, taxableAmount, tax, shipping, total };\n this._processedOrders.set(orderId, result);\n return result;\n }\n\n","suffix":"}\n\nconst proc = new OrderProcessor({\n taxRate: 0.08,\n freeShippingThreshold: 100,\n shippingCost: 12,\n minimumOrder: 25,\n discountTiers: [{ min: 200, pct: 0.15 }, { min: 100, pct: 0.10 }, { min: 50, pct: 0.05 }]\n});\n\nconst o1 = proc.processOrder(\u0027ORD1\u0027, [{ sku: \u0027A\u0027, qty: 2, unitPrice: 60 }]);\nassert.strictEqual(o1.subtotal, 120);\nassert.strictEqual(o1.discount, 12);\nassert.strictEqual(o1.taxableAmount, 108);\nassert.strictEqual(o1.tax, 8.64);\nassert.strictEqual(o1.shipping, 0);\nassert.strictEqual(o1.total, 116.64);\n","assertions":"\n// Below minimum order\nconst o2 = proc.processOrder(\u0027ORD2\u0027, [{ sku: \u0027B\u0027, qty: 1, unitPrice: 20 }]);\nassert.strictEqual(o2.error, \u0027below_minimum\u0027);\nassert.strictEqual(o2.total, 0);\n\n// High tier discount + free shipping\nconst o3 = proc.processOrder(\u0027ORD3\u0027, [{ sku: \u0027C\u0027, qty: 5, unitPrice: 50 }]);\nassert.strictEqual(o3.subtotal, 250);\nassert.strictEqual(o3.discount, 37.5);\nassert.strictEqual(o3.taxableAmount, 212.5);\nassert.strictEqual(o3.tax, 17);\nassert.strictEqual(o3.shipping, 0);\nassert.strictEqual(o3.total, 229.5);\n\n// Below free shipping threshold, lowest tier\nconst o4 = proc.processOrder(\u0027ORD4\u0027, [{ sku: \u0027D\u0027, qty: 3, unitPrice: 20 }]);\nassert.strictEqual(o4.subtotal, 60);\nassert.strictEqual(o4.discount, 3);\nassert.strictEqual(o4.tax, 4.56);\nassert.strictEqual(o4.shipping, 12);\nassert.strictEqual(o4.total, 73.56);\n\n// Idempotency\nconst o1dup = proc.processOrder(\u0027ORD1\u0027, [{ sku: \u0027X\u0027, qty: 99, unitPrice: 99 }]);\nassert.strictEqual(o1dup.total, 116.64);\n","category":"code_purpose_understanding"} {"id":"8","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface TaxBracket {\n upTo: number;\n rate: number;\n}\n\ninterface PayStub {\n gross: number;\n preTaxDeductions: number;\n taxableIncome: number;\n tax: number;\n postTaxDeductions: number;\n net: number;\n}\n\nclass PayrollProcessor {\n brackets: TaxBracket[];\n preTaxPct: number;\n postTaxFlat: number;\n ytdGross: number;\n ytdTax: number;\n private _processedPeriods: Map\u003cstring, PayStub\u003e;\n\n constructor(brackets: TaxBracket[], preTaxPct: number, postTaxFlat: number) {\n this.brackets = brackets.sort((a, b) =\u003e a.upTo - b.upTo);\n this.preTaxPct = preTaxPct;\n this.postTaxFlat = postTaxFlat;\n this.ytdGross = 0;\n this.ytdTax = 0;\n this._processedPeriods = new Map();\n }\n\n","golden_completion":" runPayroll(periodId: string, gross: number): PayStub {\n if (this._processedPeriods.has(periodId)) {\n return this._processedPeriods.get(periodId)!;\n }\n const preTaxDeductions = Math.round(gross * this.preTaxPct * 100) / 100;\n const taxableIncome = gross - preTaxDeductions;\n let tax = 0;\n let prev = 0;\n for (const bracket of this.brackets) {\n if (taxableIncome \u003c= prev) break;\n const slice = Math.min(taxableIncome, bracket.upTo) - prev;\n tax += slice * bracket.rate;\n prev = bracket.upTo;\n }\n tax = Math.round(tax * 100) / 100;\n const postTaxDeductions = this.postTaxFlat;\n const net = Math.round((taxableIncome - tax - postTaxDeductions) * 100) / 100;\n this.ytdGross += gross;\n this.ytdTax += tax;\n const stub: PayStub = { gross, preTaxDeductions, taxableIncome, tax, postTaxDeductions, net };\n this._processedPeriods.set(periodId, stub);\n return stub;\n }\n\n","suffix":"}\n\nconst payroll = new PayrollProcessor(\n [{ upTo: 1000, rate: 0.10 }, { upTo: 3000, rate: 0.20 }, { upTo: Infinity, rate: 0.30 }],\n 0.05,\n 50\n);\n\n// Gross 4000: preTax=200, taxable=3800, tax=100+400+240=740, postTax=50, net=3010\nconst s1 = payroll.runPayroll(\u0027JAN\u0027, 4000);\nassert.strictEqual(s1.gross, 4000);\nassert.strictEqual(s1.preTaxDeductions, 200);\nassert.strictEqual(s1.taxableIncome, 3800);\nassert.strictEqual(s1.tax, 740);\nassert.strictEqual(s1.postTaxDeductions, 50);\nassert.strictEqual(s1.net, 3010);\n","assertions":"\n// Low income: only first bracket\nconst s2 = payroll.runPayroll(\u0027FEB\u0027, 800);\nassert.strictEqual(s2.preTaxDeductions, 40);\nassert.strictEqual(s2.taxableIncome, 760);\nassert.strictEqual(s2.tax, 76);\nassert.strictEqual(s2.net, 634);\n\n// YTD tracking\nassert.strictEqual(payroll.ytdGross, 4800);\nassert.strictEqual(payroll.ytdTax, 816);\n\n// Idempotency: JAN again\nconst s1dup = payroll.runPayroll(\u0027JAN\u0027, 9999);\nassert.strictEqual(s1dup.net, 3010);\nassert.strictEqual(payroll.ytdGross, 4800);\n\n// Exactly at bracket boundary\nconst s3 = payroll.runPayroll(\u0027MAR\u0027, 3157.89);\n// preTax = 157.89 (rounded), taxable = 3000\nassert.strictEqual(s3.taxableIncome, 3000);\nassert.strictEqual(s3.tax, 500);\nassert.strictEqual(s3.net, 2450);\n","category":"code_purpose_understanding"} {"id":"9","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface ReplenishmentOrder {\n orderId: string;\n sku: string;\n qty: number;\n reason: string;\n}\n\ninterface CheckResult {\n needsOrder: boolean;\n order?: ReplenishmentOrder;\n}\n\nclass InventoryPlanner {\n sku: string;\n onHand: number;\n dailyDemand: number;\n leadTimeDays: number;\n safetyStockDays: number;\n orderingCost: number;\n holdingCostPerUnit: number;\n pendingOrders: ReplenishmentOrder[];\n private _cachedResults: Map\u003cstring, CheckResult\u003e;\n\n constructor(config: {\n sku: string;\n onHand: number;\n dailyDemand: number;\n leadTimeDays: number;\n safetyStockDays: number;\n orderingCost: number;\n holdingCostPerUnit: number;\n }) {\n this.sku = config.sku;\n this.onHand = config.onHand;\n this.dailyDemand = config.dailyDemand;\n this.leadTimeDays = config.leadTimeDays;\n this.safetyStockDays = config.safetyStockDays;\n this.orderingCost = config.orderingCost;\n this.holdingCostPerUnit = config.holdingCostPerUnit;\n this.pendingOrders = [];\n this._cachedResults = new Map();\n }\n\n receiveStock(qty: number): void {\n this.onHand += qty;\n }\n\n consumeStock(qty: number): void {\n this.onHand = Math.max(0, this.onHand - qty);\n }\n\n","golden_completion":" checkReplenishment(periodId: string): CheckResult {\n if (this._cachedResults.has(periodId)) {\n return this._cachedResults.get(periodId)!;\n }\n const safetyStock = this.dailyDemand * this.safetyStockDays;\n const reorderPoint = this.dailyDemand * this.leadTimeDays + safetyStock;\n const pendingQty = this.pendingOrders.reduce((sum, o) =\u003e sum + o.qty, 0);\n const projectedStock = this.onHand + pendingQty;\n if (projectedStock \u003e reorderPoint) {\n const result: CheckResult = { needsOrder: false };\n this._cachedResults.set(periodId, result);\n return result;\n }\n const eoq = Math.round(Math.sqrt(2 * this.dailyDemand * 365 * this.orderingCost / this.holdingCostPerUnit));\n const reason = projectedStock \u003c= safetyStock ? \u0027critical\u0027 : \u0027reorder_point\u0027;\n const order: ReplenishmentOrder = { orderId: periodId, sku: this.sku, qty: eoq, reason };\n this.pendingOrders.push(order);\n const result: CheckResult = { needsOrder: true, order };\n this._cachedResults.set(periodId, result);\n return result;\n }\n\n","suffix":"}\n\nconst planner = new InventoryPlanner({\n sku: \u0027WIDGET-A\u0027,\n onHand: 100,\n dailyDemand: 10,\n leadTimeDays: 7,\n safetyStockDays: 3,\n orderingCost: 50,\n holdingCostPerUnit: 2\n});\n\n// reorderPoint = 10*7 + 10*3 = 100. projectedStock = 100 \u003c= 100 → needs order\n// EOQ = sqrt(2 * 10 * 365 * 50 / 2) = sqrt(182500) ≈ 427\nconst c1 = planner.checkReplenishment(\u0027DAY1\u0027);\nassert.strictEqual(c1.needsOrder, true);\nassert.strictEqual(c1.order!.qty, 427);\nassert.strictEqual(c1.order!.reason, \u0027reorder_point\u0027);\n","assertions":"\n// Now projectedStock = 100 + 427 = 527 \u003e 100, no order needed\nconst c2 = planner.checkReplenishment(\u0027DAY2\u0027);\nassert.strictEqual(c2.needsOrder, false);\n\n// Consume stock to make it critical\nplanner.consumeStock(80);\n// onHand=20, pendingQty=427, projected=447 \u003e 100 → still ok\nconst c3 = planner.checkReplenishment(\u0027DAY3\u0027);\nassert.strictEqual(c3.needsOrder, false);\n\n// Receive the pending order, then consume heavily\nplanner.receiveStock(427);\nplanner.pendingOrders = [];\nplanner.consumeStock(430);\n// onHand=17, pendingQty=0, projected=17 \u003c= 100 → need order\n// safetyStock=30, projected=17 \u003c= 30 → critical\nconst c4 = planner.checkReplenishment(\u0027DAY4\u0027);\nassert.strictEqual(c4.needsOrder, true);\nassert.strictEqual(c4.order!.reason, \u0027critical\u0027);\nassert.strictEqual(c4.order!.qty, 427);\n\n// Idempotency\nconst c1dup = planner.checkReplenishment(\u0027DAY1\u0027);\nassert.strictEqual(c1dup.needsOrder, true);\nassert.strictEqual(c1dup.order!.qty, 427);\n","category":"code_purpose_understanding"} {"id":"10","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface CommissionResult {\n baseCommission: number;\n teamBonus: number;\n clawback: number;\n net: number;\n cappedAt: number | null;\n}\n\ninterface SaleRecord {\n dealId: string;\n amount: number;\n refunded: boolean;\n}\n\nclass CommissionEngine {\n tiers: { upTo: number; rate: number }[];\n teamBonusPct: number;\n teamQuota: number;\n annualCap: number;\n sales: SaleRecord[];\n ytdCommission: number;\n ytdClawback: number;\n private _processedDeals: Map\u003cstring, CommissionResult\u003e;\n\n constructor(config: {\n tiers: { upTo: number; rate: number }[];\n teamBonusPct: number;\n teamQuota: number;\n annualCap: number;\n }) {\n this.tiers = config.tiers.sort((a, b) =\u003e a.upTo - b.upTo);\n this.teamBonusPct = config.teamBonusPct;\n this.teamQuota = config.teamQuota;\n this.annualCap = config.annualCap;\n this.sales = [];\n this.ytdCommission = 0;\n this.ytdClawback = 0;\n this._processedDeals = new Map();\n }\n\n","golden_completion":" recordSale(dealId: string, amount: number): CommissionResult {\n if (this._processedDeals.has(dealId)) {\n return this._processedDeals.get(dealId)!;\n }\n this.sales.push({ dealId, amount, refunded: false });\n let baseCommission = 0;\n let prev = 0;\n for (const tier of this.tiers) {\n if (amount \u003c= prev) break;\n const slice = Math.min(amount, tier.upTo) - prev;\n baseCommission += slice * tier.rate;\n prev = tier.upTo;\n }\n baseCommission = Math.round(baseCommission * 100) / 100;\n const totalSales = this.sales.filter(s =\u003e !s.refunded).reduce((sum, s) =\u003e sum + s.amount, 0);\n const teamBonus = totalSales \u003e= this.teamQuota ? Math.round(baseCommission * this.teamBonusPct * 100) / 100 : 0;\n let net = baseCommission + teamBonus;\n let cappedAt: number | null = null;\n if (this.ytdCommission + net \u003e this.annualCap) {\n net = Math.max(0, this.annualCap - this.ytdCommission);\n cappedAt = this.annualCap;\n }\n this.ytdCommission += net;\n const result: CommissionResult = { baseCommission, teamBonus, clawback: 0, net, cappedAt };\n this._processedDeals.set(dealId, result);\n return result;\n }\n\n refundSale(dealId: string): number {\n const sale = this.sales.find(s =\u003e s.dealId === dealId \u0026\u0026 !s.refunded);\n if (!sale) return 0;\n sale.refunded = true;\n const original = this._processedDeals.get(dealId)!;\n const clawback = original.net;\n this.ytdClawback += clawback;\n this.ytdCommission -= clawback;\n return clawback;\n }\n\n","suffix":"}\n\nconst engine = new CommissionEngine({\n tiers: [{ upTo: 10000, rate: 0.05 }, { upTo: 50000, rate: 0.08 }, { upTo: Infinity, rate: 0.12 }],\n teamBonusPct: 0.10,\n teamQuota: 100000,\n annualCap: 25000\n});\n\n// Deal 1: $30000 → base = 500 + 1600 = 2100, sales=30000 \u003c 100000 → no bonus\nconst d1 = engine.recordSale(\u0027D1\u0027, 30000);\nassert.strictEqual(d1.baseCommission, 2100);\nassert.strictEqual(d1.teamBonus, 0);\nassert.strictEqual(d1.net, 2100);\nassert.strictEqual(d1.cappedAt, null);\n","assertions":"\n// Deal 2: $80000 → base = 500 + 3200 + 3600 = 7300, totalSales=110000 \u003e= 100000 → bonus=730\nconst d2 = engine.recordSale(\u0027D2\u0027, 80000);\nassert.strictEqual(d2.baseCommission, 7300);\nassert.strictEqual(d2.teamBonus, 730);\nassert.strictEqual(d2.net, 8030);\n\n// YTD = 2100 + 8030 = 10130\nassert.strictEqual(engine.ytdCommission, 10130);\n\n// Deal 3: $200000 → base = 500+3200+18000=21700, bonus=2170, raw=23870\n// But ytd+23870=33,000 \u003e 25000, so capped: net = 25000-10130 = 14870\nconst d3 = engine.recordSale(\u0027D3\u0027, 200000);\nassert.strictEqual(d3.cappedAt, 25000);\nassert.strictEqual(d3.net, 14870);\nassert.strictEqual(engine.ytdCommission, 25000);\n\n// Refund D1: clawback = 2100\nconst cb = engine.refundSale(\u0027D1\u0027);\nassert.strictEqual(cb, 2100);\nassert.strictEqual(engine.ytdCommission, 22900);\nassert.strictEqual(engine.ytdClawback, 2100);\n\n// Idempotency\nconst d1dup = engine.recordSale(\u0027D1\u0027, 99999);\nassert.strictEqual(d1dup.net, 2100);\n","category":"code_purpose_understanding"} {"id":"11","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface Booking {\n bookingId: string;\n room: string;\n start: number;\n end: number;\n priority: number;\n expiresAt: number;\n preemptedBy: string | null;\n}\n\nclass RoomBookingSystem {\n private bookings: Map\u003cstring, Booking\u003e = new Map();\n private roomSchedule: Map\u003cstring, Booking[]\u003e = new Map();\n\n // book(): Reserves a room with overlap + priority + expiry logic.\n // 1. If bookingId already processed, return cached result (idempotent).\n // 2. Before checking overlaps, PURGE all expired bookings (expiresAt \u003c= currentTime).\n // 3. Check remaining bookings for time overlap on this room.\n // 4. If overlap exists: preempt ONLY if new priority is STRICTLY greater.\n // Mark preempted booking\u0027s preemptedBy field. If equal or lower priority, reject.\n // 5. Return { success: boolean, preempted?: string[], reason?: string }.\n","golden_completion":" book(bookingId: string, room: string, start: number, end: number,\n priority: number, expiresAt: number, currentTime: number):\n { success: boolean; preempted?: string[]; reason?: string } {\n if (this.bookings.has(bookingId)) {\n const existing = this.bookings.get(bookingId)!;\n return existing.preemptedBy\n ? { success: false, reason: \u0027already_preempted\u0027 }\n : { success: true, preempted: [] };\n }\n // Purge expired\n const schedule = this.roomSchedule.get(room) || [];\n const active: Booking[] = [];\n for (const b of schedule) {\n if (b.expiresAt \u003c= currentTime) {\n this.bookings.delete(b.bookingId);\n } else {\n active.push(b);\n }\n }\n this.roomSchedule.set(room, active);\n // Check overlaps\n const overlapping = active.filter(b =\u003e b.start \u003c end \u0026\u0026 b.end \u003e start \u0026\u0026 !b.preemptedBy);\n const blocked = overlapping.filter(b =\u003e b.priority \u003e= priority);\n if (blocked.length \u003e 0) {\n return { success: false, reason: \u0027lower_or_equal_priority\u0027 };\n }\n const preempted: string[] = [];\n for (const b of overlapping) {\n b.preemptedBy = bookingId;\n preempted.push(b.bookingId);\n }\n const booking: Booking = { bookingId, room, start, end, priority, expiresAt, preemptedBy: null };\n this.bookings.set(bookingId, booking);\n active.push(booking);\n return { success: true, preempted };\n }\n","suffix":"}\n\nconst sys = new RoomBookingSystem();\n\n// Basic booking\nconst r1 = sys.book(\u0027B1\u0027, \u0027Room-A\u0027, 100, 200, 5, 9999, 0);\nassert.equal(r1.success, true);\nassert.deepEqual(r1.preempted, []);\n\n// Overlap with lower priority — rejected\nconst r2 = sys.book(\u0027B2\u0027, \u0027Room-A\u0027, 150, 250, 3, 9999, 0);\nassert.equal(r2.success, false);\nassert.equal(r2.reason, \u0027lower_or_equal_priority\u0027);\n","assertions":"\n// Equal priority — also rejected (STRICTLY greater required)\nconst r2b = sys.book(\u0027B2b\u0027, \u0027Room-A\u0027, 150, 250, 5, 9999, 0);\nassert.equal(r2b.success, false);\nassert.equal(r2b.reason, \u0027lower_or_equal_priority\u0027);\n\n// Higher priority — preempts B1\nconst r3 = sys.book(\u0027B3\u0027, \u0027Room-A\u0027, 150, 250, 8, 9999, 0);\nassert.equal(r3.success, true);\nassert.deepEqual(r3.preempted, [\u0027B1\u0027]);\n\n// Idempotent: re-booking B1 (now preempted) returns failure\nconst r1dup = sys.book(\u0027B1\u0027, \u0027Room-A\u0027, 100, 200, 5, 9999, 0);\nassert.equal(r1dup.success, false);\nassert.equal(r1dup.reason, \u0027already_preempted\u0027);\n\n// Idempotent: re-booking B3 returns success\nconst r3dup = sys.book(\u0027B3\u0027, \u0027Room-A\u0027, 150, 250, 8, 9999, 0);\nassert.equal(r3dup.success, true);\n\n// Expiry purge: B3 expires, so new booking at same time succeeds\nconst r4 = sys.book(\u0027B4\u0027, \u0027Room-A\u0027, 150, 250, 1, 9999, 10000);\nassert.equal(r4.success, true);\nassert.deepEqual(r4.preempted, []);\n","category":"code_purpose_understanding"} {"id":"12","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface Allocation {\n jobId: string;\n cpus: number;\n memMB: number;\n priority: number;\n allocatedAt: number;\n deallocatedAt: number | null;\n}\n\nclass ResourceAllocator {\n private totalCpus: number;\n private totalMemMB: number;\n private cooldownMs: number;\n private allocations: Map\u003cstring, Allocation\u003e = new Map();\n private usedCpus: number = 0;\n private usedMemMB: number = 0;\n\n constructor(cpus: number, memMB: number, cooldownMs: number) {\n this.totalCpus = cpus;\n this.totalMemMB = memMB;\n this.cooldownMs = cooldownMs;\n }\n\n // allocate(): Allocates CPU+memory for a job.\n // 1. If jobId already allocated (and not deallocated), return cached result (idempotent).\n // 2. If jobId was previously deallocated, check cooldown: if currentTime \u003c deallocatedAt + cooldownMs,\n // reject with reason \u0027cooldown\u0027. Otherwise allow re-allocation (delete old record first).\n // 3. Check if cpus AND memMB fit in remaining capacity. If not, attempt to preempt\n // LOWEST priority jobs (ascending) until enough capacity freed, but ONLY preempt jobs\n // with priority STRICTLY LESS than the new job.\n // 4. If still insufficient after preempting all lower-priority jobs, reject with \u0027insufficient\u0027.\n // 5. Return { success, preempted?: string[], reason?: string }.\n","golden_completion":" allocate(jobId: string, cpus: number, memMB: number, priority: number, currentTime: number):\n { success: boolean; preempted?: string[]; reason?: string } {\n const existing = this.allocations.get(jobId);\n if (existing \u0026\u0026 existing.deallocatedAt === null) {\n return { success: true, preempted: [] };\n }\n if (existing \u0026\u0026 existing.deallocatedAt !== null) {\n if (currentTime \u003c existing.deallocatedAt + this.cooldownMs) {\n return { success: false, reason: \u0027cooldown\u0027 };\n }\n this.allocations.delete(jobId);\n }\n let freeCpus = this.totalCpus - this.usedCpus;\n let freeMem = this.totalMemMB - this.usedMemMB;\n const preempted: string[] = [];\n if (freeCpus \u003c cpus || freeMem \u003c memMB) {\n const candidates = Array.from(this.allocations.values())\n .filter(a =\u003e a.deallocatedAt === null \u0026\u0026 a.priority \u003c priority)\n .sort((a, b) =\u003e a.priority - b.priority);\n for (const c of candidates) {\n if (freeCpus \u003e= cpus \u0026\u0026 freeMem \u003e= memMB) break;\n c.deallocatedAt = currentTime;\n this.usedCpus -= c.cpus;\n this.usedMemMB -= c.memMB;\n freeCpus += c.cpus;\n freeMem += c.memMB;\n preempted.push(c.jobId);\n }\n }\n if (freeCpus \u003c cpus || freeMem \u003c memMB) {\n return { success: false, reason: \u0027insufficient\u0027 };\n }\n this.allocations.set(jobId, { jobId, cpus, memMB, priority, allocatedAt: currentTime, deallocatedAt: null });\n this.usedCpus += cpus;\n this.usedMemMB += memMB;\n return { success: true, preempted };\n }\n\n deallocate(jobId: string, currentTime: number): boolean {\n const alloc = this.allocations.get(jobId);\n if (!alloc || alloc.deallocatedAt !== null) return false;\n alloc.deallocatedAt = currentTime;\n this.usedCpus -= alloc.cpus;\n this.usedMemMB -= alloc.memMB;\n return true;\n }\n","suffix":"}\n\nconst ra = new ResourceAllocator(8, 1024, 5000);\n\n// Allocate job1: 4 CPUs, 512MB, priority 5\nconst a1 = ra.allocate(\u0027job1\u0027, 4, 512, 5, 1000);\nassert.equal(a1.success, true);\nassert.deepEqual(a1.preempted, []);\n\n// Allocate job2: 4 CPUs, 512MB, priority 3\nconst a2 = ra.allocate(\u0027job2\u0027, 4, 512, 3, 2000);\nassert.equal(a2.success, true);\n\n// Full — job3 same priority as job2 can\u0027t preempt\nconst a3 = ra.allocate(\u0027job3\u0027, 2, 256, 3, 3000);\nassert.equal(a3.success, false);\nassert.equal(a3.reason, \u0027insufficient\u0027);\n","assertions":"\n// job3 with higher priority preempts job2 (lowest)\nconst a3b = ra.allocate(\u0027job3\u0027, 2, 256, 4, 3000);\nassert.equal(a3b.success, true);\nassert.deepEqual(a3b.preempted, [\u0027job2\u0027]);\n\n// Idempotent: re-allocate job1 returns cached\nconst a1dup = ra.allocate(\u0027job1\u0027, 4, 512, 5, 3500);\nassert.equal(a1dup.success, true);\nassert.deepEqual(a1dup.preempted, []);\n\n// Deallocate job1, then try to re-allocate within cooldown\nra.deallocate(\u0027job1\u0027, 4000);\nconst a1cool = ra.allocate(\u0027job1\u0027, 4, 512, 5, 4500);\nassert.equal(a1cool.success, false);\nassert.equal(a1cool.reason, \u0027cooldown\u0027);\n\n// After cooldown, re-allocation succeeds\nconst a1ok = ra.allocate(\u0027job1\u0027, 4, 512, 5, 10000);\nassert.equal(a1ok.success, true);\nassert.deepEqual(a1ok.preempted, []);\n","category":"code_purpose_understanding"} {"id":"13","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface ClaimResult {\n memberPay: number;\n planPay: number;\n denied: boolean;\n reason?: string;\n}\n\nclass ClaimAdjudicator {\n private copay: number;\n private deductible: number;\n private coinsurancePct: number;\n private oopMax: number;\n private priorAuthThreshold: number;\n private waitingPeriodDays: number;\n private enrollmentDay: number;\n\n private deductibleMet: number = 0;\n private oopAccumulator: number = 0;\n private priorAuths: Set\u003cstring\u003e = new Set();\n private claimCache: Map\u003cstring, ClaimResult\u003e = new Map();\n\n constructor(copay: number, deductible: number, coinsurancePct: number,\n oopMax: number, priorAuthThreshold: number,\n waitingPeriodDays: number, enrollmentDay: number) {\n this.copay = copay;\n this.deductible = deductible;\n this.coinsurancePct = coinsurancePct;\n this.oopMax = oopMax;\n this.priorAuthThreshold = priorAuthThreshold;\n this.waitingPeriodDays = waitingPeriodDays;\n this.enrollmentDay = enrollmentDay;\n }\n\n addPriorAuth(serviceCode: string): void {\n this.priorAuths.add(serviceCode);\n }\n\n // adjudicate(claimId, serviceCode, billedAmount, claimDay):\n // 1. Idempotent: if claimId seen, return cached result.\n // 2. Waiting period: if claimDay \u003c enrollmentDay + waitingPeriodDays, deny with \u0027waiting_period\u0027.\n // 3. Prior auth: if billedAmount \u003e= priorAuthThreshold AND serviceCode NOT in priorAuths, deny with \u0027no_prior_auth\u0027.\n // 4. If OOP max already reached (oopAccumulator \u003e= oopMax), memberPay=0, planPay=billedAmount.\n // 5. Waterfall: copay first, then deductible remainder, then coinsurance on rest.\n // 6. Cap total memberPay so oopAccumulator does not exceed oopMax.\n","golden_completion":" adjudicate(claimId: string, serviceCode: string, billedAmount: number, claimDay: number): ClaimResult {\n if (this.claimCache.has(claimId)) {\n return this.claimCache.get(claimId)!;\n }\n if (claimDay \u003c this.enrollmentDay + this.waitingPeriodDays) {\n const r: ClaimResult = { memberPay: 0, planPay: 0, denied: true, reason: \u0027waiting_period\u0027 };\n this.claimCache.set(claimId, r);\n return r;\n }\n if (billedAmount \u003e= this.priorAuthThreshold \u0026\u0026 !this.priorAuths.has(serviceCode)) {\n const r: ClaimResult = { memberPay: 0, planPay: 0, denied: true, reason: \u0027no_prior_auth\u0027 };\n this.claimCache.set(claimId, r);\n return r;\n }\n if (this.oopAccumulator \u003e= this.oopMax) {\n const r: ClaimResult = { memberPay: 0, planPay: billedAmount, denied: false };\n this.claimCache.set(claimId, r);\n return r;\n }\n let remaining = billedAmount;\n let memberPay = 0;\n const copayPart = Math.min(remaining, this.copay);\n memberPay += copayPart;\n remaining -= copayPart;\n const deductibleLeft = this.deductible - this.deductibleMet;\n const deductiblePart = Math.min(remaining, deductibleLeft);\n memberPay += deductiblePart;\n this.deductibleMet += deductiblePart;\n remaining -= deductiblePart;\n const coinsurancePart = remaining * this.coinsurancePct;\n memberPay += coinsurancePart;\n const oopRoom = this.oopMax - this.oopAccumulator;\n if (memberPay \u003e oopRoom) {\n memberPay = oopRoom;\n }\n this.oopAccumulator += memberPay;\n const planPay = billedAmount - memberPay;\n const r: ClaimResult = { memberPay, planPay, denied: false };\n this.claimCache.set(claimId, r);\n return r;\n }\n","suffix":"}\n\n// Plan: $30 copay, $500 deductible, 20% coinsurance, $2000 OOP max,\n// prior auth required for claims \u003e= $5000, 30-day waiting period, enrolled day 0\nconst adj = new ClaimAdjudicator(30, 500, 0.2, 2000, 5000, 30, 0);\n\n// Claim during waiting period — denied\nconst c0 = adj.adjudicate(\u0027C0\u0027, \u0027XRAY\u0027, 200, 10);\nassert.equal(c0.denied, true);\nassert.equal(c0.reason, \u0027waiting_period\u0027);\n\n// After waiting period: $1000 claim\n// copay=30, deductible remainder=min(970,500)=500, deductibleMet=500\n// coinsurance=0.2*(970-500)=0.2*470=94, memberPay=30+500+94=624\nconst c1 = adj.adjudicate(\u0027C1\u0027, \u0027XRAY\u0027, 1000, 31);\nassert.equal(c1.denied, false);\nassert.equal(c1.memberPay, 624);\nassert.equal(c1.planPay, 376);\n","assertions":"\n// $5000 claim without prior auth — denied\nconst c2 = adj.adjudicate(\u0027C2\u0027, \u0027MRI\u0027, 5000, 40);\nassert.equal(c2.denied, true);\nassert.equal(c2.reason, \u0027no_prior_auth\u0027);\n\n// Add prior auth, retry with different claimId\nadj.addPriorAuth(\u0027MRI\u0027);\n// oopAccumulator=624, deductible fully met\n// copay=30, deductible=0, coinsurance=0.2*4970=994, memberPay=30+994=1024\n// oopRoom=2000-624=1376, 1024\u003c1376 so no cap\nconst c3 = adj.adjudicate(\u0027C3\u0027, \u0027MRI\u0027, 5000, 41);\nassert.equal(c3.denied, false);\nassert.equal(c3.memberPay, 1024);\nassert.equal(c3.planPay, 3976);\n\n// Now oopAccumulator=624+1024=1648. Next big claim should hit OOP cap.\n// Need prior auth for SURGERY since 10000 \u003e= 5000\nadj.addPriorAuth(\u0027SURGERY\u0027);\n// $10000 claim: copay=30, deductible=0, coinsurance=0.2*9970=1994, memberPay=30+1994=2024\n// oopRoom=2000-1648=352, cap memberPay to 352\nconst c4 = adj.adjudicate(\u0027C4\u0027, \u0027SURGERY\u0027, 10000, 50);\nassert.equal(c4.denied, false);\nassert.equal(c4.memberPay, 352);\nassert.equal(c4.planPay, 9648);\n\n// OOP max reached — all future claims fully covered (200 \u003c 5000, no prior auth needed)\nconst c5 = adj.adjudicate(\u0027C5\u0027, \u0027CHECKUP\u0027, 200, 60);\nassert.equal(c5.memberPay, 0);\nassert.equal(c5.planPay, 200);\n\n// Idempotent: C1 returns same result without changing accumulators\nconst c1dup = adj.adjudicate(\u0027C1\u0027, \u0027XRAY\u0027, 1000, 31);\nassert.equal(c1dup.memberPay, 624);\n","category":"code_purpose_understanding"} {"id":"14","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface TaxBracket {\n upTo: number; // upper bound of bracket (Infinity for last)\n rate: number; // marginal rate (0.0-1.0)\n}\n\ninterface TaxResult {\n grossTax: number;\n credits: number;\n netTax: number;\n withheld: number;\n refundOrOwed: number; // positive = refund, negative = owed\n}\n\nclass TaxCalculator {\n private brackets: TaxBracket[];\n private standardDeduction: number;\n private results: Map\u003cstring, TaxResult\u003e = new Map();\n\n constructor(brackets: TaxBracket[], standardDeduction: number) {\n this.brackets = brackets;\n this.standardDeduction = standardDeduction;\n }\n\n // calculate(filingId, grossIncome, credits, withheld):\n // 1. Idempotent on filingId — return cached if seen.\n // 2. Taxable income = grossIncome - standardDeduction (min 0).\n // 3. Progressive brackets: each bracket taxes income in [prevUpTo, upTo) at rate.\n // First bracket starts at 0. grossTax is sum of bracket taxes.\n // 4. Net tax = grossTax - credits, but NEVER below zero.\n // 5. refundOrOwed = withheld - netTax (positive means refund).\n","golden_completion":" calculate(filingId: string, grossIncome: number, credits: number, withheld: number): TaxResult {\n if (this.results.has(filingId)) {\n return this.results.get(filingId)!;\n }\n const taxableIncome = Math.max(0, grossIncome - this.standardDeduction);\n let grossTax = 0;\n let prev = 0;\n for (const bracket of this.brackets) {\n if (taxableIncome \u003c= prev) break;\n const taxableInBracket = Math.min(taxableIncome, bracket.upTo) - prev;\n grossTax += taxableInBracket * bracket.rate;\n prev = bracket.upTo;\n }\n grossTax = Math.round(grossTax * 100) / 100;\n const appliedCredits = Math.min(credits, grossTax);\n const netTax = grossTax - appliedCredits;\n const refundOrOwed = withheld - netTax;\n const result: TaxResult = { grossTax, credits: appliedCredits, netTax, withheld, refundOrOwed };\n this.results.set(filingId, result);\n return result;\n }\n","suffix":"}\n\nconst calc = new TaxCalculator(\n [\n { upTo: 10000, rate: 0.10 },\n { upTo: 40000, rate: 0.20 },\n { upTo: 100000, rate: 0.30 },\n { upTo: Infinity, rate: 0.40 }\n ],\n 15000 // standard deduction\n);\n\n// $60000 income: taxable = 60000 - 15000 = 45000\n// Bracket 1: 10000 * 0.10 = 1000\n// Bracket 2: 30000 * 0.20 = 6000\n// Bracket 3: 5000 * 0.30 = 1500\n// grossTax = 8500, credits=2000 -\u003e netTax=6500, withheld=7000 -\u003e refund=500\nconst r1 = calc.calculate(\u0027F1\u0027, 60000, 2000, 7000);\nassert.equal(r1.grossTax, 8500);\nassert.equal(r1.netTax, 6500);\nassert.equal(r1.refundOrOwed, 500);\n","assertions":"\n// Low income: taxable \u003c 0 -\u003e 0\n// $10000 income: taxable = max(0, 10000-15000) = 0\n// grossTax=0, credits=500 but applied=min(500,0)=0, netTax=0, withheld=800 -\u003e refund=800\nconst r2 = calc.calculate(\u0027F2\u0027, 10000, 500, 800);\nassert.equal(r2.grossTax, 0);\nassert.equal(r2.credits, 0);\nassert.equal(r2.netTax, 0);\nassert.equal(r2.refundOrOwed, 800);\n\n// High income with large credits\n// $200000 income: taxable=185000\n// Bracket 1: 10000*0.10=1000, Bracket 2: 30000*0.20=6000, Bracket 3: 60000*0.30=18000, Bracket 4: 85000*0.40=34000\n// grossTax=59000, credits=70000 but applied=min(70000,59000)=59000, netTax=0\n// withheld=50000 -\u003e refund=50000\nconst r3 = calc.calculate(\u0027F3\u0027, 200000, 70000, 50000);\nassert.equal(r3.grossTax, 59000);\nassert.equal(r3.credits, 59000);\nassert.equal(r3.netTax, 0);\nassert.equal(r3.refundOrOwed, 50000);\n\n// Owed scenario: $80000 income, taxable=65000\n// Bracket 1: 1000, Bracket 2: 6000, Bracket 3: 25000*0.30=7500\n// grossTax=14500, credits=0, netTax=14500, withheld=10000 -\u003e owed=-4500\nconst r4 = calc.calculate(\u0027F4\u0027, 80000, 0, 10000);\nassert.equal(r4.grossTax, 14500);\nassert.equal(r4.netTax, 14500);\nassert.equal(r4.refundOrOwed, -4500);\n\n// Idempotent\nconst r1dup = calc.calculate(\u0027F1\u0027, 60000, 2000, 7000);\nassert.equal(r1dup.grossTax, 8500);\nassert.equal(r1dup.refundOrOwed, 500);\n","category":"code_purpose_understanding"} {"id":"15","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface ExpenseResult {\n approved: boolean;\n reason?: string;\n remaining: number;\n approvalLevel: string;\n}\n\nclass BudgetTracker {\n private quarterlyBudget: number;\n private rolloverCapPct: number;\n private spent: number = 0;\n private rollover: number = 0;\n private frozen: boolean = false;\n private expenseLog: Map\u003cstring, ExpenseResult\u003e = new Map();\n\n // Approval thresholds: amount \u003c 1000 -\u003e \u0027auto\u0027, \u003c 5000 -\u003e \u0027manager\u0027, \u003c 20000 -\u003e \u0027director\u0027, else \u0027vp\u0027\n constructor(quarterlyBudget: number, rolloverCapPct: number) {\n this.quarterlyBudget = quarterlyBudget;\n this.rolloverCapPct = rolloverCapPct;\n }\n\n freeze(): void { this.frozen = true; }\n unfreeze(): void { this.frozen = false; }\n\n // submitExpense(expenseId, amount):\n // 1. Idempotent on expenseId — return cached result.\n // 2. If frozen, reject with reason \u0027budget_frozen\u0027.\n // 3. Available = quarterlyBudget + rollover - spent.\n // 4. If amount \u003e available, reject with reason \u0027over_budget\u0027.\n // 5. Determine approval level based on amount thresholds.\n // 6. Deduct from budget, return result with remaining balance.\n","golden_completion":" submitExpense(expenseId: string, amount: number): ExpenseResult {\n if (this.expenseLog.has(expenseId)) {\n return this.expenseLog.get(expenseId)!;\n }\n if (this.frozen) {\n const r: ExpenseResult = { approved: false, reason: \u0027budget_frozen\u0027, remaining: this.available(), approvalLevel: \u0027none\u0027 };\n this.expenseLog.set(expenseId, r);\n return r;\n }\n const avail = this.available();\n if (amount \u003e avail) {\n const r: ExpenseResult = { approved: false, reason: \u0027over_budget\u0027, remaining: avail, approvalLevel: \u0027none\u0027 };\n this.expenseLog.set(expenseId, r);\n return r;\n }\n const level = amount \u003c 1000 ? \u0027auto\u0027 : amount \u003c 5000 ? \u0027manager\u0027 : amount \u003c 20000 ? \u0027director\u0027 : \u0027vp\u0027;\n this.spent += amount;\n const r: ExpenseResult = { approved: true, remaining: this.available(), approvalLevel: level };\n this.expenseLog.set(expenseId, r);\n return r;\n }\n\n private available(): number {\n return this.quarterlyBudget + this.rollover - this.spent;\n }\n\n closeQuarter(): { unspent: number; rolledOver: number } {\n const unspent = this.available();\n const rolledOver = Math.min(unspent, this.quarterlyBudget * this.rolloverCapPct);\n this.rollover = rolledOver;\n this.spent = 0;\n this.frozen = false;\n return { unspent, rolledOver };\n }\n","suffix":"}\n\nconst bt = new BudgetTracker(50000, 0.1); // $50k quarterly, 10% rollover cap\n\nconst e1 = bt.submitExpense(\u0027E1\u0027, 500);\nassert.equal(e1.approved, true);\nassert.equal(e1.approvalLevel, \u0027auto\u0027);\nassert.equal(e1.remaining, 49500);\n\nconst e2 = bt.submitExpense(\u0027E2\u0027, 3000);\nassert.equal(e2.approved, true);\nassert.equal(e2.approvalLevel, \u0027manager\u0027);\nassert.equal(e2.remaining, 46500);\n","assertions":"\n// Director approval\nconst e3 = bt.submitExpense(\u0027E3\u0027, 10000);\nassert.equal(e3.approved, true);\nassert.equal(e3.approvalLevel, \u0027director\u0027);\nassert.equal(e3.remaining, 36500);\n\n// VP approval\nconst e4 = bt.submitExpense(\u0027E4\u0027, 25000);\nassert.equal(e4.approved, true);\nassert.equal(e4.approvalLevel, \u0027vp\u0027);\nassert.equal(e4.remaining, 11500);\n\n// Freeze blocks spending\nbt.freeze();\nconst e5 = bt.submitExpense(\u0027E5\u0027, 100);\nassert.equal(e5.approved, false);\nassert.equal(e5.reason, \u0027budget_frozen\u0027);\n\n// Idempotent: E1 returns cached even when frozen\nconst e1dup = bt.submitExpense(\u0027E1\u0027, 500);\nassert.equal(e1dup.approved, true);\nassert.equal(e1dup.approvalLevel, \u0027auto\u0027);\n\nbt.unfreeze();\n\n// Over budget\nconst e6 = bt.submitExpense(\u0027E6\u0027, 15000);\nassert.equal(e6.approved, false);\nassert.equal(e6.reason, \u0027over_budget\u0027);\n\n// Close quarter: unspent=11500, rollover=min(11500, 50000*0.1)=5000\nconst q1 = bt.closeQuarter();\nassert.equal(q1.unspent, 11500);\nassert.equal(q1.rolledOver, 5000);\n\n// New quarter: budget=50000+5000=55000\nconst e7 = bt.submitExpense(\u0027E7\u0027, 54000);\nassert.equal(e7.approved, true);\nassert.equal(e7.approvalLevel, \u0027vp\u0027);\nassert.equal(e7.remaining, 1000);\n","category":"code_purpose_understanding"} {"id":"16","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ntype ApprovalStatus = \u0027pending\u0027 | \u0027approved\u0027 | \u0027rejected\u0027 | \u0027timed_out\u0027;\n\ninterface StageResult {\n stage: number;\n status: ApprovalStatus;\n approver: string;\n timestamp: number;\n}\n\ninterface RequestState {\n requestId: string;\n currentStage: number;\n totalStages: number;\n status: \u0027in_progress\u0027 | \u0027approved\u0027 | \u0027rejected\u0027 | \u0027timed_out\u0027;\n stages: StageResult[];\n stageTimeoutMs: number;\n}\n\nclass ApprovalChain {\n private requests: Map\u003cstring, RequestState\u003e = new Map();\n private stageAttempts: Map\u003cstring, StageResult\u003e = new Map();\n\n createRequest(requestId: string, totalStages: number, stageTimeoutMs: number): void {\n this.requests.set(requestId, {\n requestId, currentStage: 0, totalStages, status: \u0027in_progress\u0027,\n stages: [], stageTimeoutMs\n });\n }\n\n // processStage(requestId, stage, approver, decision, timestamp):\n // 1. Idempotent: key = requestId + \u0027:\u0027 + stage. If already processed, return cached.\n // 2. Request must exist and be \u0027in_progress\u0027.\n // 3. Stage must equal currentStage (enforce ordering).\n // 4. Check timeout: if timestamp \u003e (last stage timestamp or request creation implicitly at 0) + stageTimeoutMs,\n // auto-reject entire request with status \u0027timed_out\u0027, ignore the decision.\n // 5. Consecutive stage rule: if stage \u003e 0, the approver must differ from the previous stage\u0027s approver.\n // If same approver, reject with reason \u0027same_approver\u0027.\n // 6. If decision is \u0027rejected\u0027, set request status to \u0027rejected\u0027.\n // 7. If decision is \u0027approved\u0027 and this is the last stage, set request status to \u0027approved\u0027.\n // 8. Otherwise advance currentStage.\n // Returns { processed: boolean, requestStatus: string, reason?: string }.\n","golden_completion":" processStage(requestId: string, stage: number, approver: string,\n decision: \u0027approved\u0027 | \u0027rejected\u0027, timestamp: number):\n { processed: boolean; requestStatus: string; reason?: string } {\n const key = requestId + \u0027:\u0027 + stage;\n if (this.stageAttempts.has(key)) {\n const req = this.requests.get(requestId)!;\n return { processed: false, requestStatus: req.status, reason: \u0027duplicate\u0027 };\n }\n const req = this.requests.get(requestId);\n if (!req || req.status !== \u0027in_progress\u0027) {\n return { processed: false, requestStatus: req?.status || \u0027not_found\u0027, reason: \u0027not_in_progress\u0027 };\n }\n if (stage !== req.currentStage) {\n return { processed: false, requestStatus: req.status, reason: \u0027wrong_stage\u0027 };\n }\n const lastTs = req.stages.length \u003e 0 ? req.stages[req.stages.length - 1].timestamp : 0;\n if (timestamp \u003e lastTs + req.stageTimeoutMs) {\n req.status = \u0027timed_out\u0027;\n this.stageAttempts.set(key, { stage, status: \u0027timed_out\u0027, approver, timestamp });\n req.stages.push({ stage, status: \u0027timed_out\u0027, approver, timestamp });\n return { processed: true, requestStatus: \u0027timed_out\u0027, reason: \u0027timeout\u0027 };\n }\n if (stage \u003e 0 \u0026\u0026 req.stages[stage - 1].approver === approver) {\n return { processed: false, requestStatus: req.status, reason: \u0027same_approver\u0027 };\n }\n const stageResult: StageResult = { stage, status: decision, approver, timestamp };\n this.stageAttempts.set(key, stageResult);\n req.stages.push(stageResult);\n if (decision === \u0027rejected\u0027) {\n req.status = \u0027rejected\u0027;\n } else if (stage === req.totalStages - 1) {\n req.status = \u0027approved\u0027;\n } else {\n req.currentStage++;\n }\n return { processed: true, requestStatus: req.status };\n }\n","suffix":"}\n\nconst chain = new ApprovalChain();\nchain.createRequest(\u0027REQ1\u0027, 3, 10000); // 3 stages, 10s timeout per stage\n\n// Stage 0: Alice approves\nconst s0 = chain.processStage(\u0027REQ1\u0027, 0, \u0027Alice\u0027, \u0027approved\u0027, 1000);\nassert.equal(s0.processed, true);\nassert.equal(s0.requestStatus, \u0027in_progress\u0027);\n\n// Stage 1: Bob approves\nconst s1 = chain.processStage(\u0027REQ1\u0027, 1, \u0027Bob\u0027, \u0027approved\u0027, 5000);\nassert.equal(s1.processed, true);\nassert.equal(s1.requestStatus, \u0027in_progress\u0027);\n\n// Stage 2: Carol approves — request fully approved\nconst s2 = chain.processStage(\u0027REQ1\u0027, 2, \u0027Carol\u0027, \u0027approved\u0027, 8000);\nassert.equal(s2.processed, true);\nassert.equal(s2.requestStatus, \u0027approved\u0027);\n","assertions":"\n// Idempotent: reprocess stage 0 returns duplicate\nconst s0dup = chain.processStage(\u0027REQ1\u0027, 0, \u0027Alice\u0027, \u0027approved\u0027, 1000);\nassert.equal(s0dup.processed, false);\nassert.equal(s0dup.reason, \u0027duplicate\u0027);\n\n// REQ2: test same-approver rejection\nchain.createRequest(\u0027REQ2\u0027, 3, 10000);\nchain.processStage(\u0027REQ2\u0027, 0, \u0027Dave\u0027, \u0027approved\u0027, 100);\nconst s2_1 = chain.processStage(\u0027REQ2\u0027, 1, \u0027Dave\u0027, \u0027approved\u0027, 200);\nassert.equal(s2_1.processed, false);\nassert.equal(s2_1.reason, \u0027same_approver\u0027);\n\n// Different approver works\nconst s2_1b = chain.processStage(\u0027REQ2\u0027, 1, \u0027Eve\u0027, \u0027approved\u0027, 300);\nassert.equal(s2_1b.processed, true);\n\n// REQ3: test timeout\nchain.createRequest(\u0027REQ3\u0027, 2, 5000);\nchain.processStage(\u0027REQ3\u0027, 0, \u0027Frank\u0027, \u0027approved\u0027, 1000);\n// Stage 1 at timestamp 7000: 7000 \u003e 1000 + 5000 = 6000 -\u003e timed out\nconst s3_1 = chain.processStage(\u0027REQ3\u0027, 1, \u0027Grace\u0027, \u0027approved\u0027, 7000);\nassert.equal(s3_1.processed, true);\nassert.equal(s3_1.requestStatus, \u0027timed_out\u0027);\nassert.equal(s3_1.reason, \u0027timeout\u0027);\n\n// REQ4: test rejection\nchain.createRequest(\u0027REQ4\u0027, 2, 10000);\nchain.processStage(\u0027REQ4\u0027, 0, \u0027Hank\u0027, \u0027approved\u0027, 100);\nconst s4_1 = chain.processStage(\u0027REQ4\u0027, 1, \u0027Ivy\u0027, \u0027rejected\u0027, 200);\nassert.equal(s4_1.requestStatus, \u0027rejected\u0027);\n\n// Wrong stage order\nchain.createRequest(\u0027REQ5\u0027, 2, 10000);\nconst s5_skip = chain.processStage(\u0027REQ5\u0027, 1, \u0027Jack\u0027, \u0027approved\u0027, 100);\nassert.equal(s5_skip.processed, false);\nassert.equal(s5_skip.reason, \u0027wrong_stage\u0027);\n","category":"code_purpose_understanding"} {"id":"17","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ntype TaskStatus = \u0027pending\u0027 | \u0027ready\u0027 | \u0027running\u0027 | \u0027completed\u0027 | \u0027failed\u0027 | \u0027blocked\u0027;\n\ninterface ScheduledTask {\n taskId: string;\n deps: string[];\n status: TaskStatus;\n retries: number;\n maxRetries: number;\n nextRetryAt: number;\n baseDelayMs: number;\n}\n\nclass TaskScheduler {\n private tasks: Map\u003cstring, ScheduledTask\u003e = new Map();\n\n // submit(taskId, deps, maxRetries, baseDelayMs):\n // 1. Idempotent: if taskId exists, return current status.\n // 2. Circular dep check: if any dep (transitively) depends on this task, reject with \u0027circular\u0027.\n // 3. If all deps are \u0027completed\u0027, status=\u0027ready\u0027. If any dep is \u0027failed\u0027 or \u0027blocked\u0027, status=\u0027blocked\u0027.\n // Otherwise status=\u0027pending\u0027 (waiting for deps).\n // 4. Return { accepted: boolean, status, reason?: string }.\n","golden_completion":" submit(taskId: string, deps: string[], maxRetries: number, baseDelayMs: number):\n { accepted: boolean; status: TaskStatus; reason?: string } {\n if (this.tasks.has(taskId)) {\n return { accepted: true, status: this.tasks.get(taskId)!.status };\n }\n if (this.hasCircular(taskId, deps, new Set())) {\n return { accepted: false, status: \u0027failed\u0027, reason: \u0027circular\u0027 };\n }\n let status: TaskStatus = \u0027ready\u0027;\n for (const d of deps) {\n const dep = this.tasks.get(d);\n if (!dep || dep.status === \u0027failed\u0027 || dep.status === \u0027blocked\u0027) {\n status = \u0027blocked\u0027; break;\n }\n if (dep.status !== \u0027completed\u0027) {\n status = \u0027pending\u0027;\n }\n }\n const task: ScheduledTask = { taskId, deps, status, retries: 0, maxRetries, nextRetryAt: 0, baseDelayMs };\n this.tasks.set(taskId, task);\n return { accepted: true, status };\n }\n\n private hasCircular(targetId: string, deps: string[], visited: Set\u003cstring\u003e): boolean {\n for (const d of deps) {\n if (d === targetId) return true;\n if (visited.has(d)) continue;\n visited.add(d);\n const depTask = this.tasks.get(d);\n if (depTask \u0026\u0026 this.hasCircular(targetId, depTask.deps, visited)) return true;\n }\n return false;\n }\n","suffix":"\n // complete(taskId): marks as completed, updates dependents\n complete(taskId: string): void {\n const task = this.tasks.get(taskId);\n if (!task) return;\n task.status = \u0027completed\u0027;\n for (const [, t] of this.tasks) {\n if (t.deps.includes(taskId) \u0026\u0026 t.status === \u0027pending\u0027) {\n const allDone = t.deps.every(d =\u003e this.tasks.get(d)?.status === \u0027completed\u0027);\n if (allDone) t.status = \u0027ready\u0027;\n }\n }\n }\n\n // fail(taskId, currentTime): handles failure with retry logic\n fail(taskId: string, currentTime: number): { retrying: boolean; nextRetryAt?: number } {\n const task = this.tasks.get(taskId);\n if (!task) return { retrying: false };\n task.retries++;\n if (task.retries \u003e task.maxRetries) {\n task.status = \u0027failed\u0027;\n for (const [, t] of this.tasks) {\n if (t.deps.includes(taskId) \u0026\u0026 (t.status === \u0027pending\u0027 || t.status === \u0027ready\u0027)) {\n t.status = \u0027blocked\u0027;\n }\n }\n return { retrying: false };\n }\n const delay = task.baseDelayMs * Math.pow(2, task.retries - 1);\n task.nextRetryAt = currentTime + delay;\n task.status = \u0027pending\u0027;\n return { retrying: true, nextRetryAt: task.nextRetryAt };\n }\n\n getStatus(taskId: string): TaskStatus | undefined {\n return this.tasks.get(taskId)?.status;\n }\n}\n\nconst sched = new TaskScheduler();\n\n// Submit independent task\nconst t1 = sched.submit(\u0027A\u0027, [], 3, 1000);\nassert.equal(t1.accepted, true);\nassert.equal(t1.status, \u0027ready\u0027);\n\n// Submit task depending on A (not yet completed)\nconst t2 = sched.submit(\u0027B\u0027, [\u0027A\u0027], 2, 2000);\nassert.equal(t2.status, \u0027pending\u0027);\n\n// Complete A -\u003e B becomes ready\nsched.complete(\u0027A\u0027);\nassert.equal(sched.getStatus(\u0027B\u0027), \u0027ready\u0027);\n","assertions":"\n// Fail B with retries: exponential backoff\nconst f1 = sched.fail(\u0027B\u0027, 10000);\nassert.equal(f1.retrying, true);\nassert.equal(f1.nextRetryAt, 12000); // 10000 + 2000*2^0 = 12000\n\nconst f2 = sched.fail(\u0027B\u0027, 13000);\nassert.equal(f2.retrying, true);\nassert.equal(f2.nextRetryAt, 17000); // 13000 + 2000*2^1 = 17000\n\nconst f3 = sched.fail(\u0027B\u0027, 18000);\nassert.equal(f3.retrying, false); // exceeded maxRetries (2)\nassert.equal(sched.getStatus(\u0027B\u0027), \u0027failed\u0027);\n\n// C depends on B (which is failed) -\u003e blocked\nconst t3 = sched.submit(\u0027C\u0027, [\u0027B\u0027], 1, 1000);\nassert.equal(t3.status, \u0027blocked\u0027);\n\n// Circular dependency detection\nsched.submit(\u0027D\u0027, [], 1, 1000);\nsched.complete(\u0027D\u0027);\nsched.submit(\u0027E\u0027, [\u0027D\u0027], 1, 1000);\nconst circTest = sched.submit(\u0027D2\u0027, [\u0027E\u0027], 1, 1000);\n// Now try to add F that depends on D2, and D2 depends on E\nsched.submit(\u0027F\u0027, [\u0027D2\u0027], 1, 1000);\n// Try G depending on F, and check circular if we tried to make F depend on G\n// Direct: submit \u0027X\u0027 depending on \u0027Y\u0027, then \u0027Y\u0027 depending on \u0027X\u0027\nsched.submit(\u0027X\u0027, [], 1, 1000);\nsched.complete(\u0027X\u0027);\nsched.submit(\u0027Y\u0027, [\u0027X\u0027], 1, 1000);\nconst circ = sched.submit(\u0027X2\u0027, [\u0027Y\u0027], 1, 1000);\nassert.equal(circ.accepted, true); // no circular: X2-\u003eY-\u003eX, X2 is new\n\n// Real circular: submit Z1-\u003eZ2 then Z2-\u003eZ1\nsched.submit(\u0027Z1\u0027, [], 1, 1000);\nsched.complete(\u0027Z1\u0027);\nsched.submit(\u0027Z2\u0027, [\u0027Z1\u0027], 1, 1000);\nconst circReal = sched.submit(\u0027Z1\u0027, [\u0027Z2\u0027], 1, 1000);\n// Z1 already exists -\u003e idempotent, returns current status\nassert.equal(circReal.accepted, true);\n\n// Idempotent: re-submit A\nconst t1dup = sched.submit(\u0027A\u0027, [], 3, 1000);\nassert.equal(t1dup.accepted, true);\nassert.equal(t1dup.status, \u0027completed\u0027);\n","category":"code_purpose_understanding"} {"id":"18","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface FieldSchema {\n name: string;\n type: \u0027string\u0027 | \u0027number\u0027 | \u0027boolean\u0027;\n required: boolean;\n}\n\ninterface ETLRecord {\n [key: string]: any;\n}\n\ninterface ETLResult {\n accepted: ETLRecord[];\n quarantined: { record: ETLRecord; reason: string }[];\n duplicatesSkipped: number;\n rolledBack: boolean;\n}\n\nclass ETLPipeline {\n private schema: FieldSchema[];\n private keyFields: string[];\n private maxQuarantinePct: number;\n private seenKeys: Set\u003cstring\u003e = new Set();\n private transforms: ((r: ETLRecord) =\u003e ETLRecord)[] = [];\n\n constructor(schema: FieldSchema[], keyFields: string[], maxQuarantinePct: number) {\n this.schema = schema;\n this.keyFields = keyFields;\n this.maxQuarantinePct = maxQuarantinePct;\n }\n\n addTransform(fn: (r: ETLRecord) =\u003e ETLRecord): void {\n this.transforms.push(fn);\n }\n\n // processBatch(records):\n // For each record:\n // 1. Validate schema: required fields must exist. Type coercion:\n // - \u0027number\u0027: parseFloat, quarantine if NaN.\n // - \u0027boolean\u0027: \u0027true\u0027/\u00271\u0027 -\u003e true, \u0027false\u0027/\u00270\u0027 -\u003e false, else quarantine.\n // - \u0027string\u0027: toString().\n // 2. After coercion, dedup by composite key (keyFields joined with \u0027|\u0027).\n // Skip if key already seen (across ALL batches).\n // 3. Apply transforms in order.\n // 4. Add to accepted.\n // After processing all records:\n // If quarantined count \u003e maxQuarantinePct * total records, ROLL BACK:\n // clear accepted, don\u0027t update seenKeys, set rolledBack=true.\n // Otherwise, persist seenKeys updates.\n","golden_completion":" processBatch(records: ETLRecord[]): ETLResult {\n const accepted: ETLRecord[] = [];\n const quarantined: { record: ETLRecord; reason: string }[] = [];\n let duplicatesSkipped = 0;\n const batchKeys: string[] = [];\n for (const raw of records) {\n const record = { ...raw };\n let valid = true;\n let reason = \u0027\u0027;\n for (const field of this.schema) {\n if (field.required \u0026\u0026 !(field.name in record)) {\n valid = false;\n reason = `missing_${field.name}`;\n break;\n }\n if (field.name in record) {\n if (field.type === \u0027number\u0027) {\n const n = parseFloat(record[field.name]);\n if (isNaN(n)) { valid = false; reason = `invalid_number_${field.name}`; break; }\n record[field.name] = n;\n } else if (field.type === \u0027boolean\u0027) {\n const v = String(record[field.name]).toLowerCase();\n if (v === \u0027true\u0027 || v === \u00271\u0027) record[field.name] = true;\n else if (v === \u0027false\u0027 || v === \u00270\u0027) record[field.name] = false;\n else { valid = false; reason = `invalid_boolean_${field.name}`; break; }\n } else {\n record[field.name] = String(record[field.name]);\n }\n }\n }\n if (!valid) { quarantined.push({ record: raw, reason }); continue; }\n const key = this.keyFields.map(k =\u003e String(record[k])).join(\u0027|\u0027);\n if (this.seenKeys.has(key) || batchKeys.includes(key)) {\n duplicatesSkipped++;\n continue;\n }\n batchKeys.push(key);\n let transformed = record;\n for (const fn of this.transforms) {\n transformed = fn(transformed);\n }\n accepted.push(transformed);\n }\n if (records.length \u003e 0 \u0026\u0026 quarantined.length \u003e this.maxQuarantinePct * records.length) {\n return { accepted: [], quarantined, duplicatesSkipped, rolledBack: true };\n }\n for (const k of batchKeys) {\n this.seenKeys.add(k);\n }\n return { accepted, quarantined, duplicatesSkipped, rolledBack: false };\n }\n","suffix":"}\n\nconst pipeline = new ETLPipeline(\n [\n { name: \u0027id\u0027, type: \u0027string\u0027, required: true },\n { name: \u0027amount\u0027, type: \u0027number\u0027, required: true },\n { name: \u0027active\u0027, type: \u0027boolean\u0027, required: false }\n ],\n [\u0027id\u0027],\n 0.5 // rollback if \u003e50% quarantined\n);\n\npipeline.addTransform(r =\u003e ({ ...r, amount: Math.round(r.amount * 100) / 100 }));\npipeline.addTransform(r =\u003e ({ ...r, processed: true }));\n\nconst batch1 = pipeline.processBatch([\n { id: \u0027A\u0027, amount: \u002710.456\u0027, active: \u0027true\u0027 },\n { id: \u0027B\u0027, amount: \u002720.3\u0027, active: \u00270\u0027 },\n { id: \u0027C\u0027, amount: \u0027abc\u0027 } // invalid number\n]);\nassert.equal(batch1.accepted.length, 2);\nassert.equal(batch1.quarantined.length, 1);\nassert.equal(batch1.rolledBack, false);\nassert.equal(batch1.accepted[0].amount, 10.46); // rounded\nassert.equal(batch1.accepted[0].active, true);\nassert.equal(batch1.accepted[0].processed, true);\nassert.equal(batch1.accepted[1].active, false);\n","assertions":"\n// Dedup: A already seen from batch1\nconst batch2 = pipeline.processBatch([\n { id: \u0027A\u0027, amount: \u002799\u0027 },\n { id: \u0027D\u0027, amount: \u002730\u0027 }\n]);\nassert.equal(batch2.duplicatesSkipped, 1);\nassert.equal(batch2.accepted.length, 1);\nassert.equal(batch2.accepted[0].id, \u0027D\u0027);\n\n// Rollback: \u003e50% quarantined -\u003e no records accepted, seenKeys not updated\nconst batch3 = pipeline.processBatch([\n { id: \u0027E\u0027, amount: \u0027bad1\u0027 },\n { id: \u0027F\u0027, amount: \u0027bad2\u0027 },\n { id: \u0027G\u0027, amount: \u002750\u0027 }\n]);\n// 2/3 quarantined = 66% \u003e 50%\nassert.equal(batch3.rolledBack, true);\nassert.equal(batch3.accepted.length, 0);\n\n// E and G were NOT persisted due to rollback, so re-submitting them works\nconst batch4 = pipeline.processBatch([\n { id: \u0027E\u0027, amount: \u0027100\u0027 },\n { id: \u0027G\u0027, amount: \u002750\u0027 }\n]);\nassert.equal(batch4.accepted.length, 2);\nassert.equal(batch4.duplicatesSkipped, 0);\n\n// Boolean coercion edge cases\nconst batch5 = pipeline.processBatch([\n { id: \u0027H\u0027, amount: \u002710\u0027, active: \u00271\u0027 },\n { id: \u0027I\u0027, amount: \u002720\u0027, active: \u0027yes\u0027 } // invalid boolean\n]);\nassert.equal(batch5.accepted.length, 1);\nassert.equal(batch5.accepted[0].active, true);\nassert.equal(batch5.quarantined.length, 1);\nassert.equal(batch5.quarantined[0].reason, \u0027invalid_boolean_active\u0027);\n\n// Missing required field\nconst batch6 = pipeline.processBatch([\n { id: \u0027J\u0027 } // missing \u0027amount\u0027\n]);\nassert.equal(batch6.quarantined[0].reason, \u0027missing_amount\u0027);\n","category":"code_purpose_understanding"} {"id":"19","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface CacheEntry\u003cT\u003e {\n key: string;\n value: T;\n insertedAt: number;\n lastAccessedAt: number;\n ttlMs: number;\n staleMs: number;\n refreshing: boolean;\n}\n\ninterface CacheGetResult\u003cT\u003e {\n value: T | null;\n status: \u0027hit\u0027 | \u0027miss\u0027 | \u0027stale\u0027 | \u0027expired\u0027;\n}\n\nclass CacheManager\u003cT\u003e {\n private capacity: number;\n private entries: Map\u003cstring, CacheEntry\u003cT\u003e\u003e = new Map();\n private stats = { hits: 0, misses: 0, stales: 0, evictions: 0 };\n\n constructor(capacity: number) {\n this.capacity = capacity;\n }\n\n // put(key, value, ttlMs, staleMs, currentTime):\n // 1. If key exists, update value and reset insertedAt. Move to most-recently-used.\n // 2. If at capacity, evict the LEAST recently accessed entry (by lastAccessedAt).\n // 3. Store entry with ttlMs and staleMs (stale-while-revalidate window after TTL).\n","golden_completion":" put(key: string, value: T, ttlMs: number, staleMs: number, currentTime: number): void {\n if (this.entries.has(key)) {\n this.entries.delete(key);\n } else if (this.entries.size \u003e= this.capacity) {\n let lruKey = \u0027\u0027;\n let lruTime = Infinity;\n for (const [k, e] of this.entries) {\n if (e.lastAccessedAt \u003c lruTime) {\n lruTime = e.lastAccessedAt;\n lruKey = k;\n }\n }\n this.entries.delete(lruKey);\n this.stats.evictions++;\n }\n this.entries.set(key, {\n key, value, insertedAt: currentTime, lastAccessedAt: currentTime,\n ttlMs, staleMs, refreshing: false\n });\n }\n\n // get(key, currentTime):\n // 1. If not found: miss.\n // 2. If currentTime \u003e insertedAt + ttlMs + staleMs: expired, remove entry, miss.\n // 3. If currentTime \u003e insertedAt + ttlMs but within stale window: return value as \u0027stale\u0027,\n // set refreshing=true (only if not already refreshing). Update lastAccessedAt.\n // 4. Otherwise: hit, update lastAccessedAt.\n get(key: string, currentTime: number): CacheGetResult\u003cT\u003e {\n const entry = this.entries.get(key);\n if (!entry) {\n this.stats.misses++;\n return { value: null, status: \u0027miss\u0027 };\n }\n const age = currentTime - entry.insertedAt;\n if (age \u003e entry.ttlMs + entry.staleMs) {\n this.entries.delete(key);\n this.stats.misses++;\n return { value: null, status: \u0027expired\u0027 };\n }\n if (age \u003e entry.ttlMs) {\n entry.lastAccessedAt = currentTime;\n this.stats.stales++;\n if (!entry.refreshing) {\n entry.refreshing = true;\n }\n return { value: entry.value, status: \u0027stale\u0027 };\n }\n entry.lastAccessedAt = currentTime;\n this.stats.hits++;\n return { value: entry.value, status: \u0027hit\u0027 };\n }\n\n completeRefresh(key: string, newValue: T, currentTime: number): boolean {\n const entry = this.entries.get(key);\n if (!entry || !entry.refreshing) return false;\n entry.value = newValue;\n entry.insertedAt = currentTime;\n entry.lastAccessedAt = currentTime;\n entry.refreshing = false;\n return true;\n }\n\n getStats(): { hits: number; misses: number; stales: number; evictions: number } {\n return { ...this.stats };\n }\n","suffix":"}\n\nconst cache = new CacheManager\u003cstring\u003e(3);\n\ncache.put(\u0027a\u0027, \u0027val-a\u0027, 1000, 500, 0); // TTL=1s, stale=0.5s\ncache.put(\u0027b\u0027, \u0027val-b\u0027, 2000, 1000, 0); // TTL=2s, stale=1s\ncache.put(\u0027c\u0027, \u0027val-c\u0027, 1000, 500, 0);\n\n// Fresh hit\nconst g1 = cache.get(\u0027a\u0027, 500);\nassert.equal(g1.status, \u0027hit\u0027);\nassert.equal(g1.value, \u0027val-a\u0027);\n\n// Stale (after TTL but within stale window)\nconst g2 = cache.get(\u0027a\u0027, 1200);\nassert.equal(g2.status, \u0027stale\u0027);\nassert.equal(g2.value, \u0027val-a\u0027);\n","assertions":"\n// Expired (past TTL + stale window): 1000+500=1500, time=1600\nconst g3 = cache.get(\u0027a\u0027, 1600);\nassert.equal(g3.status, \u0027expired\u0027);\nassert.equal(g3.value, null);\n\n// b is still fresh at 1500\nconst g4 = cache.get(\u0027b\u0027, 1500);\nassert.equal(g4.status, \u0027hit\u0027);\nassert.equal(g4.value, \u0027val-b\u0027);\n\n// LRU eviction: capacity=3, a was removed (expired), so only b,c remain\n// Add d, no eviction needed since size=2\ncache.put(\u0027d\u0027, \u0027val-d\u0027, 1000, 500, 2000);\n\n// Add e -\u003e need to evict. c was last accessed at time 0, b at 1500, d at 2000 -\u003e evict c\ncache.put(\u0027e\u0027, \u0027val-e\u0027, 1000, 500, 2500);\nconst g5 = cache.get(\u0027c\u0027, 2500);\nassert.equal(g5.status, \u0027miss\u0027); // c was evicted\n\n// b still there\nconst g6 = cache.get(\u0027b\u0027, 2500);\nassert.equal(g6.status, \u0027stale\u0027); // 2500 \u003e 0+2000=2000 -\u003e stale\n\n// Refresh b\nconst refreshed = cache.completeRefresh(\u0027b\u0027, \u0027val-b-new\u0027, 2600);\nassert.equal(refreshed, true);\nconst g7 = cache.get(\u0027b\u0027, 2700);\nassert.equal(g7.status, \u0027hit\u0027);\nassert.equal(g7.value, \u0027val-b-new\u0027);\n\n// Stats check\nconst stats = cache.getStats();\nassert.equal(stats.hits, 3); // g1, g4, g7\nassert.equal(stats.stales, 2); // g2, g6\nassert.equal(stats.evictions, 1); // c evicted\nassert.equal(stats.misses, 2); // g3(expired), g5(evicted)\n","category":"code_purpose_understanding"} {"id":"20","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface RateLimitResult {\n allowed: boolean;\n tokensRemaining: number;\n quotaRemaining: number;\n reason?: string;\n retryAfterMs?: number;\n}\n\nclass RateLimiter {\n private maxTokens: number;\n private refillRatePerMs: number;\n private dailyQuota: number;\n private penaltyThreshold: number;\n private penaltyDurationMs: number;\n\n private tokens: number;\n private lastRefillAt: number;\n private quotaUsed: number = 0;\n private quotaDayStart: number;\n private consecutiveRejects: number = 0;\n private penaltyUntil: number = 0;\n private requestLog: Map\u003cstring, RateLimitResult\u003e = new Map();\n\n constructor(maxTokens: number, refillRatePerMs: number, dailyQuota: number,\n penaltyThreshold: number, penaltyDurationMs: number, startTime: number) {\n this.maxTokens = maxTokens;\n this.refillRatePerMs = refillRatePerMs;\n this.dailyQuota = dailyQuota;\n this.penaltyThreshold = penaltyThreshold;\n this.penaltyDurationMs = penaltyDurationMs;\n this.tokens = maxTokens;\n this.lastRefillAt = startTime;\n this.quotaDayStart = startTime;\n }\n\n // request(requestId, cost, currentTime):\n // 1. Idempotent: if requestId seen, return cached result.\n // 2. Refill tokens: elapsed = currentTime - lastRefillAt.\n // tokens = min(maxTokens, tokens + elapsed * refillRatePerMs). Update lastRefillAt.\n // 3. Check daily quota: if quotaUsed \u003e= dailyQuota, reject with \u0027quota_exceeded\u0027.\n // (Daily quota resets when currentTime \u003e= quotaDayStart + 86400000.)\n // 4. Check penalty: if currentTime \u003c penaltyUntil, reject with \u0027penalty\u0027.\n // 5. Check tokens: if cost \u003e tokens, reject with \u0027rate_limited\u0027.\n // Increment consecutiveRejects. If \u003e= penaltyThreshold, apply penalty.\n // 6. If allowed: deduct tokens, increment quotaUsed, reset consecutiveRejects.\n","golden_completion":" request(requestId: string, cost: number, currentTime: number): RateLimitResult {\n if (this.requestLog.has(requestId)) {\n return this.requestLog.get(requestId)!;\n }\n // Refill tokens\n const elapsed = currentTime - this.lastRefillAt;\n this.tokens = Math.min(this.maxTokens, this.tokens + elapsed * this.refillRatePerMs);\n this.lastRefillAt = currentTime;\n // Daily quota reset\n if (currentTime \u003e= this.quotaDayStart + 86400000) {\n this.quotaDayStart = currentTime;\n this.quotaUsed = 0;\n }\n // Check quota\n if (this.quotaUsed \u003e= this.dailyQuota) {\n const r: RateLimitResult = { allowed: false, tokensRemaining: Math.floor(this.tokens),\n quotaRemaining: 0, reason: \u0027quota_exceeded\u0027 };\n this.requestLog.set(requestId, r);\n return r;\n }\n // Check penalty\n if (currentTime \u003c this.penaltyUntil) {\n const r: RateLimitResult = { allowed: false, tokensRemaining: Math.floor(this.tokens),\n quotaRemaining: this.dailyQuota - this.quotaUsed, reason: \u0027penalty\u0027,\n retryAfterMs: this.penaltyUntil - currentTime };\n this.requestLog.set(requestId, r);\n return r;\n }\n // Check tokens\n if (cost \u003e this.tokens) {\n this.consecutiveRejects++;\n if (this.consecutiveRejects \u003e= this.penaltyThreshold) {\n this.penaltyUntil = currentTime + this.penaltyDurationMs;\n this.consecutiveRejects = 0;\n }\n const r: RateLimitResult = { allowed: false, tokensRemaining: Math.floor(this.tokens),\n quotaRemaining: this.dailyQuota - this.quotaUsed, reason: \u0027rate_limited\u0027 };\n this.requestLog.set(requestId, r);\n return r;\n }\n // Allow\n this.tokens -= cost;\n this.quotaUsed++;\n this.consecutiveRejects = 0;\n const r: RateLimitResult = { allowed: true, tokensRemaining: Math.floor(this.tokens),\n quotaRemaining: this.dailyQuota - this.quotaUsed };\n this.requestLog.set(requestId, r);\n return r;\n }\n","suffix":"}\n\n// maxTokens=10, refill=0.01/ms (10/s), dailyQuota=100, penalty after 3 rejects, 5s penalty\nconst rl = new RateLimiter(10, 0.01, 100, 3, 5000, 0);\n\n// Request costs 3 tokens at t=100\n// tokens=10, elapsed=100, refill=100*0.01=1, tokens=min(10,11)=10, then 10-3=7\nconst r1 = rl.request(\u0027R1\u0027, 3, 100);\nassert.equal(r1.allowed, true);\nassert.equal(r1.tokensRemaining, 7);\n","assertions":"\nassert.equal(r1.quotaRemaining, 99);\n\n// R2: cost=5 at t=200, elapsed=100, refill=1, tokens=min(10,7+1)=8, 8-5=3\nconst r2 = rl.request(\u0027R2\u0027, 5, 200);\nassert.equal(r2.allowed, true);\nassert.equal(r2.tokensRemaining, 3);\n\n// R3: cost=5 at t=250, elapsed=50, refill=0.5, tokens=min(10,3+0.5)=3.5, 5\u003e3.5 -\u003e rejected\nconst r3 = rl.request(\u0027R3\u0027, 5, 250);\nassert.equal(r3.allowed, false);\nassert.equal(r3.reason, \u0027rate_limited\u0027);\n\n// R4,R5: two more rejects to trigger penalty (3 consecutive)\nconst r4 = rl.request(\u0027R4\u0027, 5, 260);\nassert.equal(r4.allowed, false);\nconst r5 = rl.request(\u0027R5\u0027, 5, 270);\nassert.equal(r5.allowed, false);\n\n// Penalty triggered: 3 consecutive rejects. penaltyUntil = 270 + 5000 = 5270\nconst r6 = rl.request(\u0027R6\u0027, 1, 300);\nassert.equal(r6.allowed, false);\nassert.equal(r6.reason, \u0027penalty\u0027);\nassert.equal(r6.retryAfterMs, 4970); // 5270 - 300\n\n// After penalty expires\nconst r7 = rl.request(\u0027R7\u0027, 1, 6000);\nassert.equal(r7.allowed, true);\n\n// Idempotent: R1 returns cached\nconst r1dup = rl.request(\u0027R1\u0027, 3, 99999);\nassert.equal(r1dup.allowed, true);\nassert.equal(r1dup.tokensRemaining, 7);\n","category":"code_purpose_understanding"} {"id":"21","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface CartItem {\n sku: string;\n price: number;\n qty: number;\n taxable: boolean;\n}\n\ninterface CartResult {\n subtotal: number;\n discount: number;\n taxAmount: number;\n shippingFee: number;\n total: number;\n freeShippingApplied: boolean;\n}\n\nclass ShoppingCart {\n items: CartItem[] = [];\n taxRate: number;\n freeShippingThreshold: number;\n baseShipping: number;\n // Tiered discount: applied on PRE-TAX subtotal AFTER per-item prices are summed.\n // Tiers checked top-down: first matching tier wins.\n // Discount applies to subtotal, NOT to shipping or tax.\n discountTiers: { minSubtotal: number; rate: number }[];\n\n constructor(taxRate: number, freeShippingThreshold: number, baseShipping: number,\n discountTiers: { minSubtotal: number; rate: number }[]) {\n this.taxRate = taxRate;\n this.freeShippingThreshold = freeShippingThreshold;\n this.baseShipping = baseShipping;\n // Tiers MUST be sorted descending by minSubtotal for top-down matching\n this.discountTiers = [...discountTiers].sort((a, b) =\u003e b.minSubtotal - a.minSubtotal);\n }\n\n addItem(sku: string, price: number, qty: number, taxable: boolean): void {\n const existing = this.items.find(i =\u003e i.sku === sku);\n if (existing) {\n existing.qty += qty;\n } else {\n this.items.push({ sku, price, qty, taxable });\n }\n }\n\n // checkout():\n // All monetary values use round2: Math.round(x * 100) / 100\n // 1. subtotal = round2(sum of (price * qty) for all items)\n // 2. Find first discount tier where subtotal \u003e= tier.minSubtotal.\n // discount = round2(subtotal * tier.rate). (0 if no tier matches)\n // 3. discountedSubtotal = round2(subtotal - discount)\n // 4. taxAmount = round2(sum of (price * qty) for TAXABLE items only * taxRate)\n // NOTE: tax is on ORIGINAL item prices, NOT on the discounted subtotal\n // 5. freeShippingApplied = discountedSubtotal \u003e= freeShippingThreshold\n // shippingFee = freeShippingApplied ? 0 : baseShipping\n // NOTE: free shipping threshold uses discountedSubtotal (AFTER discount)\n // 6. total = round2(discountedSubtotal + taxAmount + shippingFee)\n // 7. Return CartResult with all fields\n","golden_completion":" checkout(): CartResult {\n const round2 = (v: number) =\u003e Math.round(v * 100) / 100;\n const subtotal = round2(this.items.reduce((s, i) =\u003e s + i.price * i.qty, 0));\n let discount = 0;\n for (const tier of this.discountTiers) {\n if (subtotal \u003e= tier.minSubtotal) {\n discount = round2(subtotal * tier.rate);\n break;\n }\n }\n const discountedSubtotal = round2(subtotal - discount);\n const taxableSum = this.items\n .filter(i =\u003e i.taxable)\n .reduce((s, i) =\u003e s + i.price * i.qty, 0);\n const taxAmount = round2(taxableSum * this.taxRate);\n const freeShippingApplied = discountedSubtotal \u003e= this.freeShippingThreshold;\n const shippingFee = freeShippingApplied ? 0 : this.baseShipping;\n const total = round2(discountedSubtotal + taxAmount + shippingFee);\n return { subtotal, discount, taxAmount, shippingFee, total, freeShippingApplied };\n }\n","suffix":"\n}\n\n// Tiers: 15% off over $200, 10% off over $100, 5% off over $50\nconst cart = new ShoppingCart(0.08, 150, 12.99,\n [{ minSubtotal: 200, rate: 0.15 }, { minSubtotal: 100, rate: 0.10 }, { minSubtotal: 50, rate: 0.05 }]);\n\ncart.addItem(\u0027SHIRT\u0027, 39.99, 3, true); // 119.97, taxable\ncart.addItem(\u0027BOOK\u0027, 15.00, 2, false); // 30.00, not taxable\n// subtotal = 149.97\n// Best tier: 100 =\u003e 10% =\u003e discount = round(149.97*0.10*100)/100 = 15.00\n// discountedSubtotal = 134.97\n// tax on taxable only: round(119.97 * 0.08 * 100) / 100 = 9.60\n// freeShipping: 134.97 \u003c 150 =\u003e false, shipping = 12.99\n// total = 134.97 + 9.60 + 12.99 = 157.56\n\nconst r1 = cart.checkout();\nassert.strictEqual(r1.subtotal, 149.97);\nassert.strictEqual(r1.discount, 15.00);\nassert.strictEqual(r1.taxAmount, 9.60);\nassert.strictEqual(r1.freeShippingApplied, false);\nassert.strictEqual(r1.shippingFee, 12.99);\nassert.strictEqual(r1.total, 157.56);\n","assertions":"\n// Add more items to push past free shipping threshold\ncart.addItem(\u0027SHIRT\u0027, 39.99, 2, true); // now 5 shirts = 199.95\n// subtotal = 199.95 + 30 = 229.95\n// Best tier: 200 =\u003e 15% =\u003e discount = round(229.95*0.15*100)/100 = 34.49\n// discountedSubtotal = 195.46\n// tax on taxable: round(199.95 * 0.08 * 100) / 100 = 16.00\n// freeShipping: 195.46 \u003e= 150 =\u003e true, shipping = 0\n// total = 195.46 + 16.00 + 0 = 211.46\n\nconst r2 = cart.checkout();\nassert.strictEqual(r2.subtotal, 229.95);\nassert.strictEqual(r2.discount, 34.49);\nassert.strictEqual(r2.taxAmount, 16.00);\nassert.strictEqual(r2.freeShippingApplied, true);\nassert.strictEqual(r2.shippingFee, 0);\nassert.strictEqual(r2.total, 211.46);\n\n// Edge: empty cart\nconst emptyCart = new ShoppingCart(0.08, 150, 12.99, [{ minSubtotal: 50, rate: 0.05 }]);\nconst r3 = emptyCart.checkout();\nassert.strictEqual(r3.subtotal, 0);\nassert.strictEqual(r3.discount, 0);\nassert.strictEqual(r3.freeShippingApplied, false);\nassert.strictEqual(r3.shippingFee, 12.99);\nassert.strictEqual(r3.total, 12.99);\n","category":"code_purpose_understanding"} {"id":"22","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface GiftCard {\n cardId: string;\n balance: number;\n expiryDate: number; // epoch day\n redeemed: boolean;\n}\n\ninterface RedemptionResult {\n success: boolean;\n amountCharged: number;\n remainingOrderBalance: number;\n cardBalances: Record\u003cstring, number\u003e;\n expired: string[];\n reason?: string;\n}\n\nclass GiftCardSystem {\n cards: Map\u003cstring, GiftCard\u003e = new Map();\n redemptions: { orderId: string; cardId: string; amount: number; ts: number }[] = [];\n private processedOrders: Set\u003cstring\u003e = new Set();\n\n registerCard(cardId: string, balance: number, expiryDate: number): void {\n this.cards.set(cardId, { cardId, balance, expiryDate, redeemed: false });\n }\n\n // redeemForOrder(orderId, cardIds, orderTotal, currentDate):\n // 1. Idempotent: if orderId already processed, return { success: false, reason: \u0027duplicate_order\u0027, ... }\n // 2. Filter cardIds: remove unknown cards, already-redeemed (balance \u003c= 0) cards,\n // and expired cards (expiryDate \u003c currentDate, strictly less than).\n // Track expired cardIds in the \u0027expired\u0027 array of the result.\n // 3. Sort valid cards by balance ASCENDING (drain small cards first).\n // 4. Drain cards in order: for each card, take min(card.balance, remainingOrderBalance).\n // Deduct from card.balance. Record in redemptions.\n // If card.balance reaches 0, set redeemed = true.\n // 5. Mark orderId as processed.\n // 6. Return: success = (remainingOrderBalance === 0),\n // amountCharged = orderTotal - remainingOrderBalance,\n // remainingOrderBalance, cardBalances (all input cardIds -\u003e current balance or -1 if unknown),\n // expired array\n","golden_completion":" redeemForOrder(orderId: string, cardIds: string[], orderTotal: number, currentDate: number): RedemptionResult {\n if (this.processedOrders.has(orderId)) {\n return { success: false, amountCharged: 0, remainingOrderBalance: orderTotal,\n cardBalances: {}, expired: [], reason: \u0027duplicate_order\u0027 };\n }\n const expired: string[] = [];\n const validCards: GiftCard[] = [];\n const cardBalances: Record\u003cstring, number\u003e = {};\n\n for (const cid of cardIds) {\n const card = this.cards.get(cid);\n if (!card) {\n cardBalances[cid] = -1;\n continue;\n }\n if (card.expiryDate \u003c currentDate) {\n expired.push(cid);\n cardBalances[cid] = card.balance;\n continue;\n }\n if (card.balance \u003c= 0) {\n cardBalances[cid] = 0;\n continue;\n }\n validCards.push(card);\n }\n validCards.sort((a, b) =\u003e a.balance - b.balance);\n let remaining = orderTotal;\n for (const card of validCards) {\n if (remaining \u003c= 0) break;\n const take = Math.min(card.balance, remaining);\n card.balance -= take;\n remaining = Math.round((remaining - take) * 100) / 100;\n if (card.balance \u003c= 0) card.redeemed = true;\n this.redemptions.push({ orderId, cardId: card.cardId, amount: take, ts: currentDate });\n }\n for (const card of validCards) {\n cardBalances[card.cardId] = card.balance;\n }\n this.processedOrders.add(orderId);\n return {\n success: remaining === 0,\n amountCharged: Math.round((orderTotal - remaining) * 100) / 100,\n remainingOrderBalance: remaining,\n cardBalances,\n expired\n };\n }\n","suffix":"\n}\n\nconst gcs = new GiftCardSystem();\ngcs.registerCard(\u0027GC1\u0027, 25.00, 100); // $25, expires day 100\ngcs.registerCard(\u0027GC2\u0027, 50.00, 200); // $50, expires day 200\ngcs.registerCard(\u0027GC3\u0027, 10.00, 50); // $10, expires day 50 (will be expired)\n\n// Order $60 on day 75, using GC3 (expired), GC1, GC2\n// GC3 expired (50 \u003c 75). Valid: GC1(25), GC2(50). Sort asc: GC1, GC2.\n// Drain GC1: take 25, remaining=35. GC1 balance=0, redeemed=true.\n// Drain GC2: take 35, remaining=0. GC2 balance=15.\nconst r1 = gcs.redeemForOrder(\u0027ORD1\u0027, [\u0027GC3\u0027, \u0027GC1\u0027, \u0027GC2\u0027], 60.00, 75);\nassert.strictEqual(r1.success, true);\nassert.strictEqual(r1.amountCharged, 60.00);\nassert.strictEqual(r1.remainingOrderBalance, 0);\nassert.deepStrictEqual(r1.expired, [\u0027GC3\u0027]);\nassert.strictEqual(r1.cardBalances[\u0027GC1\u0027], 0);\nassert.strictEqual(r1.cardBalances[\u0027GC2\u0027], 15);\nassert.strictEqual(r1.cardBalances[\u0027GC3\u0027], 10); // expired but balance unchanged\nassert.strictEqual(gcs.cards.get(\u0027GC1\u0027)!.redeemed, true);\n","assertions":"\n// Idempotent: same orderId\nconst r2 = gcs.redeemForOrder(\u0027ORD1\u0027, [\u0027GC2\u0027], 10, 76);\nassert.strictEqual(r2.success, false);\nassert.strictEqual(r2.reason, \u0027duplicate_order\u0027);\n\n// Partial: not enough balance\nconst r3 = gcs.redeemForOrder(\u0027ORD2\u0027, [\u0027GC2\u0027], 30, 76);\n// GC2 has 15 left. Take 15, remaining=15.\nassert.strictEqual(r3.success, false);\nassert.strictEqual(r3.amountCharged, 15);\nassert.strictEqual(r3.remainingOrderBalance, 15);\nassert.strictEqual(r3.cardBalances[\u0027GC2\u0027], 0);\nassert.strictEqual(gcs.cards.get(\u0027GC2\u0027)!.redeemed, true);\n\n// Unknown card\nconst r4 = gcs.redeemForOrder(\u0027ORD3\u0027, [\u0027GC999\u0027, \u0027GC1\u0027], 5, 76);\n// GC999 unknown (-1), GC1 redeemed (balance 0) =\u003e no valid cards\nassert.strictEqual(r4.success, false);\nassert.strictEqual(r4.cardBalances[\u0027GC999\u0027], -1);\nassert.strictEqual(r4.cardBalances[\u0027GC1\u0027], 0);\nassert.strictEqual(r4.amountCharged, 0);\n\nassert.strictEqual(gcs.redemptions.length, 3); // ORD1(GC1,GC2) + ORD2(GC2)\n","category":"code_purpose_understanding"} {"id":"23","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Payment {\n method: string; // \u0027credit\u0027 | \u0027giftcard\u0027 | \u0027loyalty\u0027\n amount: number;\n}\n\ninterface OrderRecord {\n orderId: string;\n items: { sku: string; price: number; qty: number }[];\n payments: Payment[];\n refunded: Map\u003cstring, number\u003e; // sku -\u003e qty already refunded\n}\n\ninterface RefundResult {\n success: boolean;\n reason?: string;\n restockingFee: number;\n refundAmount: number;\n refundSplit: Payment[];\n}\n\nclass RefundProcessor {\n orders: Map\u003cstring, OrderRecord\u003e = new Map();\n restockingFeeRate: number;\n restockingFeeWaiverDays: number;\n log: { orderId: string; sku: string; qty: number; refundAmount: number; ts: number }[] = [];\n\n constructor(restockingFeeRate: number, restockingFeeWaiverDays: number) {\n this.restockingFeeRate = restockingFeeRate;\n this.restockingFeeWaiverDays = restockingFeeWaiverDays;\n }\n\n addOrder(orderId: string, items: { sku: string; price: number; qty: number }[],\n payments: Payment[], orderDate: number): void {\n this.orders.set(orderId, { orderId, items, payments, refunded: new Map() });\n }\n\n // processRefund(orderId, sku, qty, refundDate, orderDate):\n // 1. Order must exist, otherwise { success: false, reason: \u0027unknown_order\u0027, ... }\n // 2. Find item by sku. If not found: { success: false, reason: \u0027item_not_found\u0027, ... }\n // 3. Already-refunded qty for this sku is tracked in order.refunded.\n // If (alreadyRefunded + qty) \u003e item.qty: { success: false, reason: \u0027exceeds_purchased\u0027, ... }\n // 4. Gross refund = item.price * qty\n // 5. Restocking fee:\n // - If (refundDate - orderDate) \u003c= restockingFeeWaiverDays: fee = 0 (waived)\n // - Otherwise: fee = Math.round(grossRefund * restockingFeeRate * 100) / 100\n // 6. refundAmount = grossRefund - fee\n // 7. Refund split: distribute refundAmount back to original payment methods\n // in REVERSE order of payments array (last payment method refunded first).\n // For each payment method: refund min(remainingRefund, payment.amount).\n // Reduce remainingRefund accordingly.\n // 8. Update order.refunded: add qty to sku\u0027s refunded count.\n // 9. Log the refund. Return { success: true, restockingFee, refundAmount, refundSplit }\n // where refundSplit only includes methods that received \u003e 0 refund.\n","golden_completion":" processRefund(orderId: string, sku: string, qty: number,\n refundDate: number, orderDate: number): RefundResult {\n const order = this.orders.get(orderId);\n if (!order) {\n return { success: false, reason: \u0027unknown_order\u0027, restockingFee: 0, refundAmount: 0, refundSplit: [] };\n }\n const item = order.items.find(i =\u003e i.sku === sku);\n if (!item) {\n return { success: false, reason: \u0027item_not_found\u0027, restockingFee: 0, refundAmount: 0, refundSplit: [] };\n }\n const alreadyRefunded = order.refunded.get(sku) || 0;\n if (alreadyRefunded + qty \u003e item.qty) {\n return { success: false, reason: \u0027exceeds_purchased\u0027, restockingFee: 0, refundAmount: 0, refundSplit: [] };\n }\n const grossRefund = item.price * qty;\n let restockingFee = 0;\n if ((refundDate - orderDate) \u003e this.restockingFeeWaiverDays) {\n restockingFee = Math.round(grossRefund * this.restockingFeeRate * 100) / 100;\n }\n const refundAmount = grossRefund - restockingFee;\n let remaining = refundAmount;\n const refundSplit: Payment[] = [];\n const reversedPayments = [...order.payments].reverse();\n for (const p of reversedPayments) {\n if (remaining \u003c= 0) break;\n const refundAmt = Math.min(remaining, p.amount);\n remaining = Math.round((remaining - refundAmt) * 100) / 100;\n refundSplit.push({ method: p.method, amount: refundAmt });\n }\n order.refunded.set(sku, alreadyRefunded + qty);\n this.log.push({ orderId, sku, qty, refundAmount, ts: refundDate });\n return { success: true, restockingFee, refundAmount, refundSplit };\n }\n","suffix":"\n}\n\nconst rp = new RefundProcessor(0.15, 30); // 15% restocking fee, waived within 30 days\n\nrp.addOrder(\u0027O1\u0027,\n [{ sku: \u0027LAPTOP\u0027, price: 999.99, qty: 1 }, { sku: \u0027MOUSE\u0027, price: 29.99, qty: 3 }],\n [{ method: \u0027credit\u0027, amount: 800 }, { method: \u0027giftcard\u0027, amount: 200 }, { method: \u0027loyalty\u0027, amount: 89.96 }],\n 100);\n\n// Refund MOUSE x2 within waiver period (day 120, orderDate 100, diff=20 \u003c= 30)\nconst r1 = rp.processRefund(\u0027O1\u0027, \u0027MOUSE\u0027, 2, 120, 100);\nassert.strictEqual(r1.success, true);\nassert.strictEqual(r1.restockingFee, 0); // waived\nassert.strictEqual(r1.refundAmount, 59.98); // 29.99 * 2\n// Reverse payment order: loyalty(89.96), giftcard(200), credit(800)\n// Take from loyalty: min(59.98, 89.96) = 59.98\nassert.strictEqual(r1.refundSplit.length, 1);\nassert.strictEqual(r1.refundSplit[0].method, \u0027loyalty\u0027);\nassert.strictEqual(r1.refundSplit[0].amount, 59.98);\n","assertions":"\n// Refund LAPTOP after waiver (day 200, diff=100 \u003e 30): restocking fee applies\nconst r2 = rp.processRefund(\u0027O1\u0027, \u0027LAPTOP\u0027, 1, 200, 100);\nassert.strictEqual(r2.success, true);\nassert.strictEqual(r2.restockingFee, 150.00); // round(999.99*0.15*100)/100 = 150.00\nassert.strictEqual(r2.refundAmount, 849.99); // 999.99 - 150.00\n// Reverse: loyalty(89.96), giftcard(200), credit(800)\n// Take from loyalty: min(849.99, 89.96)=89.96, remaining=760.03\n// Take from giftcard: min(760.03, 200)=200, remaining=560.03\n// Take from credit: min(560.03, 800)=560.03, remaining=0\nassert.strictEqual(r2.refundSplit.length, 3);\nassert.strictEqual(r2.refundSplit[0].method, \u0027loyalty\u0027);\nassert.strictEqual(r2.refundSplit[0].amount, 89.96);\nassert.strictEqual(r2.refundSplit[1].method, \u0027giftcard\u0027);\nassert.strictEqual(r2.refundSplit[1].amount, 200);\nassert.strictEqual(r2.refundSplit[2].method, \u0027credit\u0027);\nassert.strictEqual(r2.refundSplit[2].amount, 560.03);\n\n// Can\u0027t refund more MOUSE than purchased (already refunded 2 of 3)\nconst r3 = rp.processRefund(\u0027O1\u0027, \u0027MOUSE\u0027, 2, 210, 100);\nassert.strictEqual(r3.success, false);\nassert.strictEqual(r3.reason, \u0027exceeds_purchased\u0027);\n\n// Can still refund 1 more MOUSE\nconst r4 = rp.processRefund(\u0027O1\u0027, \u0027MOUSE\u0027, 1, 210, 100);\nassert.strictEqual(r4.success, true);\nassert.strictEqual(r4.restockingFee, 4.50); // round(29.99*0.15*100)/100 = 4.50\n\n// Unknown order\nconst r5 = rp.processRefund(\u0027OXYZ\u0027, \u0027MOUSE\u0027, 1, 300, 100);\nassert.strictEqual(r5.success, false);\nassert.strictEqual(r5.reason, \u0027unknown_order\u0027);\n\nassert.strictEqual(rp.log.length, 3); // 3 successful refunds\n","category":"code_purpose_understanding"} {"id":"24","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface LeaveBalance {\n annual: number;\n sick: number;\n carryover: number; // annual leave carried from last year\n}\n\ninterface LeaveRequest {\n reqId: string;\n empId: string;\n type: \u0027annual\u0027 | \u0027sick\u0027;\n days: number;\n status: \u0027pending\u0027 | \u0027approved\u0027 | \u0027denied\u0027;\n}\n\ninterface LeaveResult {\n approved: boolean;\n reason?: string;\n balanceAfter?: LeaveBalance;\n}\n\nclass LeaveManager {\n balances: Map\u003cstring, LeaveBalance\u003e = new Map();\n requests: Map\u003cstring, LeaveRequest\u003e = new Map();\n maxCarryover: number;\n sickLeaveRequiresDoc: number; // sick leave \u003e this many days requires documentation\n\n constructor(maxCarryover: number, sickLeaveRequiresDoc: number) {\n this.maxCarryover = maxCarryover;\n this.sickLeaveRequiresDoc = sickLeaveRequiresDoc;\n }\n\n addEmployee(empId: string, annual: number, sick: number, carryover: number): void {\n // Cap carryover at maxCarryover\n this.balances.set(empId, { annual, sick, carryover: Math.min(carryover, this.maxCarryover) });\n }\n\n // requestLeave(reqId, empId, type, days, hasDocumentation):\n // 1. Idempotent: if reqId exists, return current status\n // 2. Employee must exist\n // 3. For \u0027sick\u0027 leave with days \u003e sickLeaveRequiresDoc and !hasDocumentation:\n // deny with reason \u0027documentation_required\u0027\n // 4. Check balance:\n // - \u0027sick\u0027: just check sick balance \u003e= days\n // - \u0027annual\u0027: deduct from CARRYOVER first, then annual.\n // Total available = carryover + annual. Must be \u003e= days.\n // 5. If insufficient: deny with reason \u0027insufficient_balance\u0027\n // 6. Deduct:\n // - \u0027sick\u0027: sick -= days\n // - \u0027annual\u0027: deduct min(carryover, days) from carryover,\n // remainder from annual\n // 7. Store request with status \u0027approved\u0027. Return approved=true with balanceAfter.\n","golden_completion":" requestLeave(reqId: string, empId: string, type: \u0027annual\u0027 | \u0027sick\u0027,\n days: number, hasDocumentation: boolean = false): LeaveResult {\n if (this.requests.has(reqId)) {\n const existing = this.requests.get(reqId)!;\n return { approved: existing.status === \u0027approved\u0027, reason: \u0027duplicate_request\u0027 };\n }\n const bal = this.balances.get(empId);\n if (!bal) {\n return { approved: false, reason: \u0027unknown_employee\u0027 };\n }\n if (type === \u0027sick\u0027 \u0026\u0026 days \u003e this.sickLeaveRequiresDoc \u0026\u0026 !hasDocumentation) {\n this.requests.set(reqId, { reqId, empId, type, days, status: \u0027denied\u0027 });\n return { approved: false, reason: \u0027documentation_required\u0027 };\n }\n if (type === \u0027sick\u0027) {\n if (bal.sick \u003c days) {\n this.requests.set(reqId, { reqId, empId, type, days, status: \u0027denied\u0027 });\n return { approved: false, reason: \u0027insufficient_balance\u0027 };\n }\n bal.sick -= days;\n } else {\n const totalAvail = bal.carryover + bal.annual;\n if (totalAvail \u003c days) {\n this.requests.set(reqId, { reqId, empId, type, days, status: \u0027denied\u0027 });\n return { approved: false, reason: \u0027insufficient_balance\u0027 };\n }\n const fromCarryover = Math.min(bal.carryover, days);\n bal.carryover -= fromCarryover;\n bal.annual -= (days - fromCarryover);\n }\n this.requests.set(reqId, { reqId, empId, type, days, status: \u0027approved\u0027 });\n return { approved: true, balanceAfter: { ...bal } };\n }\n","suffix":"\n}\n\nconst lm = new LeaveManager(5, 3); // max 5 carryover days, sick \u003e 3 days needs docs\n\nlm.addEmployee(\u0027E1\u0027, 15, 10, 8); // 8 carryover capped to 5\nconst bal = lm.balances.get(\u0027E1\u0027)!;\nassert.strictEqual(bal.carryover, 5); // capped\n\n// Annual leave: 7 days. Deduct carryover first (5), then annual (2).\nconst r1 = lm.requestLeave(\u0027R1\u0027, \u0027E1\u0027, \u0027annual\u0027, 7);\nassert.strictEqual(r1.approved, true);\nassert.strictEqual(r1.balanceAfter!.carryover, 0);\nassert.strictEqual(r1.balanceAfter!.annual, 13);\nassert.strictEqual(r1.balanceAfter!.sick, 10);\n\n// Sick leave 2 days (no doc needed, \u003c= 3)\nconst r2 = lm.requestLeave(\u0027R2\u0027, \u0027E1\u0027, \u0027sick\u0027, 2);\nassert.strictEqual(r2.approved, true);\nassert.strictEqual(r2.balanceAfter!.sick, 8);\n","assertions":"\n// Sick leave 5 days without doc: denied (5 \u003e 3)\nconst r3 = lm.requestLeave(\u0027R3\u0027, \u0027E1\u0027, \u0027sick\u0027, 5, false);\nassert.strictEqual(r3.approved, false);\nassert.strictEqual(r3.reason, \u0027documentation_required\u0027);\n\n// Sick leave 5 days with doc: approved\nconst r4 = lm.requestLeave(\u0027R4\u0027, \u0027E1\u0027, \u0027sick\u0027, 5, true);\nassert.strictEqual(r4.approved, true);\nassert.strictEqual(r4.balanceAfter!.sick, 3);\n\n// Insufficient annual leave\nconst r5 = lm.requestLeave(\u0027R5\u0027, \u0027E1\u0027, \u0027annual\u0027, 20);\nassert.strictEqual(r5.approved, false);\nassert.strictEqual(r5.reason, \u0027insufficient_balance\u0027);\n\n// Idempotent: re-request R1\nconst r6 = lm.requestLeave(\u0027R1\u0027, \u0027E1\u0027, \u0027annual\u0027, 7);\nassert.strictEqual(r6.reason, \u0027duplicate_request\u0027);\n\n// Unknown employee\nconst r7 = lm.requestLeave(\u0027R7\u0027, \u0027E99\u0027, \u0027annual\u0027, 1);\nassert.strictEqual(r7.approved, false);\nassert.strictEqual(r7.reason, \u0027unknown_employee\u0027);\n","category":"code_purpose_understanding"} {"id":"25","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface TimesheetEntry {\n day: string; // \u0027mon\u0027 | \u0027tue\u0027 | ... | \u0027sun\u0027\n hours: number;\n}\n\ninterface PayResult {\n regularHours: number;\n overtimeHours: number;\n weekendHours: number;\n regularPay: number;\n overtimePay: number;\n weekendPay: number;\n totalPay: number;\n capped: boolean;\n}\n\nclass TimesheetProcessor {\n regularHoursCap: number; // weekly hours before overtime kicks in\n hourlyRate: number;\n overtimeMultiplier: number; // e.g., 1.5x\n weekendMultiplier: number; // e.g., 2.0x — applied INSTEAD of regular/overtime rate\n weeklyPayCap: number; // max pay per week (hard cap)\n weekendDays: Set\u003cstring\u003e = new Set([\u0027sat\u0027, \u0027sun\u0027]);\n\n constructor(hourlyRate: number, regularHoursCap: number,\n overtimeMultiplier: number, weekendMultiplier: number,\n weeklyPayCap: number) {\n this.hourlyRate = hourlyRate;\n this.regularHoursCap = regularHoursCap;\n this.overtimeMultiplier = overtimeMultiplier;\n this.weekendMultiplier = weekendMultiplier;\n this.weeklyPayCap = weeklyPayCap;\n }\n\n // calculatePay(entries):\n // 1. Separate entries into weekday and weekend.\n // 2. weekendHours = sum of weekend entries\u0027 hours.\n // weekendPay = weekendHours * hourlyRate * weekendMultiplier.\n // Weekend hours do NOT count toward the regularHoursCap (they\u0027re separate).\n // 3. weekdayHours = sum of weekday entries\u0027 hours.\n // regularHours = min(weekdayHours, regularHoursCap).\n // overtimeHours = max(0, weekdayHours - regularHoursCap).\n // 4. regularPay = regularHours * hourlyRate.\n // overtimePay = overtimeHours * hourlyRate * overtimeMultiplier.\n // 5. rawTotal = regularPay + overtimePay + weekendPay.\n // 6. If rawTotal \u003e weeklyPayCap: totalPay = weeklyPayCap, capped = true.\n // Else: totalPay = rawTotal, capped = false.\n // 7. All monetary values rounded: Math.round(x * 100) / 100.\n","golden_completion":" calculatePay(entries: TimesheetEntry[]): PayResult {\n let weekendHours = 0;\n let weekdayHours = 0;\n for (const e of entries) {\n if (this.weekendDays.has(e.day)) {\n weekendHours += e.hours;\n } else {\n weekdayHours += e.hours;\n }\n }\n const regularHours = Math.min(weekdayHours, this.regularHoursCap);\n const overtimeHours = Math.max(0, weekdayHours - this.regularHoursCap);\n const round2 = (v: number) =\u003e Math.round(v * 100) / 100;\n const regularPay = round2(regularHours * this.hourlyRate);\n const overtimePay = round2(overtimeHours * this.hourlyRate * this.overtimeMultiplier);\n const weekendPay = round2(weekendHours * this.hourlyRate * this.weekendMultiplier);\n const rawTotal = round2(regularPay + overtimePay + weekendPay);\n const capped = rawTotal \u003e this.weeklyPayCap;\n const totalPay = capped ? this.weeklyPayCap : rawTotal;\n return { regularHours, overtimeHours, weekendHours, regularPay, overtimePay, weekendPay, totalPay, capped };\n }\n","suffix":"\n}\n\n// $25/hr, 40hr cap, 1.5x OT, 2x weekend, $2000 weekly cap\nconst tp = new TimesheetProcessor(25, 40, 1.5, 2.0, 2000);\n\nconst r1 = tp.calculatePay([\n { day: \u0027mon\u0027, hours: 9 }, { day: \u0027tue\u0027, hours: 9 },\n { day: \u0027wed\u0027, hours: 9 }, { day: \u0027thu\u0027, hours: 9 },\n { day: \u0027fri\u0027, hours: 8 }, // weekday total: 44\n { day: \u0027sat\u0027, hours: 6 }, // weekend: 6\n]);\n// regularHours=40, overtimeHours=4, weekendHours=6\n// regularPay=1000, overtimePay=4*25*1.5=150, weekendPay=6*25*2=300\n// rawTotal=1450, under cap\nassert.strictEqual(r1.regularHours, 40);\nassert.strictEqual(r1.overtimeHours, 4);\nassert.strictEqual(r1.weekendHours, 6);\nassert.strictEqual(r1.regularPay, 1000);\nassert.strictEqual(r1.overtimePay, 150);\nassert.strictEqual(r1.weekendPay, 300);\nassert.strictEqual(r1.totalPay, 1450);\nassert.strictEqual(r1.capped, false);\n","assertions":"\n// Trigger cap\nconst r2 = tp.calculatePay([\n { day: \u0027mon\u0027, hours: 10 }, { day: \u0027tue\u0027, hours: 10 },\n { day: \u0027wed\u0027, hours: 10 }, { day: \u0027thu\u0027, hours: 10 },\n { day: \u0027fri\u0027, hours: 10 }, // weekday total: 50\n { day: \u0027sat\u0027, hours: 8 }, { day: \u0027sun\u0027, hours: 8 }, // weekend: 16\n]);\n// regular=40, OT=10, weekend=16\n// regularPay=1000, OT=10*25*1.5=375, weekend=16*25*2=800\n// raw=2175, capped at 2000\nassert.strictEqual(r2.regularHours, 40);\nassert.strictEqual(r2.overtimeHours, 10);\nassert.strictEqual(r2.weekendHours, 16);\nassert.strictEqual(r2.overtimePay, 375);\nassert.strictEqual(r2.weekendPay, 800);\nassert.strictEqual(r2.totalPay, 2000);\nassert.strictEqual(r2.capped, true);\n\n// No overtime, no weekend\nconst r3 = tp.calculatePay([\n { day: \u0027mon\u0027, hours: 8 }, { day: \u0027tue\u0027, hours: 8 },\n { day: \u0027wed\u0027, hours: 8 },\n]);\nassert.strictEqual(r3.regularHours, 24);\nassert.strictEqual(r3.overtimeHours, 0);\nassert.strictEqual(r3.weekendHours, 0);\nassert.strictEqual(r3.totalPay, 600);\nassert.strictEqual(r3.capped, false);\n\n// Empty timesheet\nconst r4 = tp.calculatePay([]);\nassert.strictEqual(r4.totalPay, 0);\nassert.strictEqual(r4.capped, false);\n","category":"code_purpose_understanding"} {"id":"26","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Employee {\n empId: string;\n baseSalary: number;\n hireDate: number; // epoch day\n performanceScore: number; // 0.0 - 5.0\n department: string;\n terminated: boolean;\n}\n\ninterface BonusResult {\n eligible: boolean;\n reason?: string;\n baseBonus: number;\n tenureMultiplier: number;\n prorationFactor: number;\n finalBonus: number;\n}\n\nclass BonusCalculator {\n employees: Map\u003cstring, Employee\u003e = new Map();\n // Performance tiers: score \u003e= threshold gives bonusRate (% of baseSalary)\n // Checked top-down (highest threshold first).\n performanceTiers: { threshold: number; bonusRate: number }[];\n // Tenure multiplier brackets: years \u003e= bracket gives multiplier\n tenureBrackets: { years: number; multiplier: number }[];\n minScoreForBonus: number; // below this =\u003e not eligible\n\n constructor(performanceTiers: { threshold: number; bonusRate: number }[],\n tenureBrackets: { years: number; multiplier: number }[],\n minScoreForBonus: number) {\n this.performanceTiers = [...performanceTiers].sort((a, b) =\u003e b.threshold - a.threshold);\n this.tenureBrackets = [...tenureBrackets].sort((a, b) =\u003e b.years - a.years);\n this.minScoreForBonus = minScoreForBonus;\n }\n\n addEmployee(empId: string, baseSalary: number, hireDate: number,\n performanceScore: number, department: string): void {\n this.employees.set(empId, { empId, baseSalary, hireDate, performanceScore, department, terminated: false });\n }\n\n // calculateBonus(empId, evaluationDate, fiscalYearStart):\n // 1. Employee must exist and not be terminated.\n // 2. performanceScore \u003c minScoreForBonus =\u003e not eligible, reason \u0027below_minimum\u0027\n // 3. Find performance tier (first where score \u003e= threshold). baseBonus = baseSalary * bonusRate.\n // If no tier matches: baseBonus = 0, still eligible but $0 bonus.\n // 4. Tenure: years = Math.floor((evaluationDate - hireDate) / 365).\n // Find tenure bracket (first where years \u003e= bracket.years). Get multiplier.\n // If no bracket matches: multiplier = 1.0.\n // 5. Proration: if hireDate \u003e fiscalYearStart (hired during fiscal year):\n // prorationFactor = (evaluationDate - hireDate) / (evaluationDate - fiscalYearStart).\n // Else: prorationFactor = 1.0.\n // 6. finalBonus = Math.round(baseBonus * tenureMultiplier * prorationFactor * 100) / 100\n","golden_completion":" calculateBonus(empId: string, evaluationDate: number, fiscalYearStart: number): BonusResult {\n const emp = this.employees.get(empId);\n if (!emp || emp.terminated) {\n return { eligible: false, reason: emp ? \u0027terminated\u0027 : \u0027unknown_employee\u0027,\n baseBonus: 0, tenureMultiplier: 1, prorationFactor: 1, finalBonus: 0 };\n }\n if (emp.performanceScore \u003c this.minScoreForBonus) {\n return { eligible: false, reason: \u0027below_minimum\u0027,\n baseBonus: 0, tenureMultiplier: 1, prorationFactor: 1, finalBonus: 0 };\n }\n let bonusRate = 0;\n for (const tier of this.performanceTiers) {\n if (emp.performanceScore \u003e= tier.threshold) {\n bonusRate = tier.bonusRate;\n break;\n }\n }\n const baseBonus = emp.baseSalary * bonusRate;\n const years = Math.floor((evaluationDate - emp.hireDate) / 365);\n let tenureMultiplier = 1.0;\n for (const bracket of this.tenureBrackets) {\n if (years \u003e= bracket.years) {\n tenureMultiplier = bracket.multiplier;\n break;\n }\n }\n let prorationFactor = 1.0;\n if (emp.hireDate \u003e fiscalYearStart) {\n prorationFactor = (evaluationDate - emp.hireDate) / (evaluationDate - fiscalYearStart);\n }\n const finalBonus = Math.round(baseBonus * tenureMultiplier * prorationFactor * 100) / 100;\n return { eligible: true, baseBonus, tenureMultiplier, prorationFactor, finalBonus };\n }\n","suffix":"\n}\n\nconst bc = new BonusCalculator(\n [{ threshold: 4.5, bonusRate: 0.20 }, { threshold: 3.5, bonusRate: 0.10 }, { threshold: 2.5, bonusRate: 0.05 }],\n [{ years: 10, multiplier: 1.5 }, { years: 5, multiplier: 1.25 }, { years: 2, multiplier: 1.1 }],\n 2.0 // min score\n);\n\nbc.addEmployee(\u0027E1\u0027, 100000, 0, 4.8, \u0027Engineering\u0027); // hired day 0, score 4.8\nbc.addEmployee(\u0027E2\u0027, 80000, 300, 3.0, \u0027Marketing\u0027); // hired day 300, score 3.0\n\n// E1: score 4.8 \u003e= 4.5 =\u003e 20%. base=20000. tenure: floor(730/365)=2 years =\u003e 1.1x.\n// Hired before FY start =\u003e proration=1.0. final=20000*1.1*1.0 = 22000.00\nconst r1 = bc.calculateBonus(\u0027E1\u0027, 730, 365);\nassert.strictEqual(r1.eligible, true);\nassert.strictEqual(r1.baseBonus, 20000);\nassert.strictEqual(r1.tenureMultiplier, 1.1);\nassert.strictEqual(r1.prorationFactor, 1.0);\nassert.strictEqual(r1.finalBonus, 22000.00);\n\n// E2: score 3.0 \u003e= 2.5 =\u003e 5%. base=4000. tenure: floor(430/365)=1 year =\u003e no bracket =\u003e 1.0.\n// Hired day 300 \u003c FY start 365 =\u003e proration=1.0. final=4000*1.0*1.0=4000.00\nconst r2 = bc.calculateBonus(\u0027E2\u0027, 730, 365);\nassert.strictEqual(r2.eligible, true);\nassert.strictEqual(r2.baseBonus, 4000);\nassert.strictEqual(r2.tenureMultiplier, 1.0);\nassert.strictEqual(r2.finalBonus, 4000.00);\n","assertions":"\n// New hire mid-fiscal-year: proration applies\nbc.addEmployee(\u0027E3\u0027, 120000, 500, 4.0, \u0027Sales\u0027); // hired day 500, FY started 365\n// score 4.0 \u003e= 3.5 =\u003e 10%. base=12000. tenure: floor(230/365)=0 =\u003e 1.0.\n// Hired 500 \u003e FY 365 =\u003e proration=(730-500)/(730-365)=230/365=0.6301...\n// final=12000*1.0*0.6301...=7561.64\nconst r3 = bc.calculateBonus(\u0027E3\u0027, 730, 365);\nassert.strictEqual(r3.eligible, true);\nassert.strictEqual(r3.baseBonus, 12000);\nassert.strictEqual(r3.tenureMultiplier, 1.0);\nassert.strictEqual(r3.finalBonus, 7561.64);\n\n// Below minimum score\nbc.addEmployee(\u0027E4\u0027, 90000, 0, 1.5, \u0027HR\u0027);\nconst r4 = bc.calculateBonus(\u0027E4\u0027, 730, 365);\nassert.strictEqual(r4.eligible, false);\nassert.strictEqual(r4.reason, \u0027below_minimum\u0027);\n\n// Terminated employee\nbc.employees.get(\u0027E1\u0027)!.terminated = true;\nconst r5 = bc.calculateBonus(\u0027E1\u0027, 730, 365);\nassert.strictEqual(r5.eligible, false);\nassert.strictEqual(r5.reason, \u0027terminated\u0027);\n\n// Unknown employee\nconst r6 = bc.calculateBonus(\u0027E99\u0027, 730, 365);\nassert.strictEqual(r6.eligible, false);\nassert.strictEqual(r6.reason, \u0027unknown_employee\u0027);\n","category":"code_purpose_understanding"} {"id":"27","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Appointment {\n apptId: string;\n patientId: string;\n start: number; // minutes from midnight\n end: number;\n priority: number; // higher = more urgent\n status: \u0027scheduled\u0027 | \u0027bumped\u0027;\n}\n\ninterface ScheduleResult {\n success: boolean;\n reason?: string;\n bumped?: string[]; // apptIds that were bumped\n apptId?: string;\n}\n\nclass ClinicScheduler {\n appointments: Appointment[] = [];\n bufferMinutes: number; // required gap between appointments\n private idSet: Set\u003cstring\u003e = new Set();\n\n constructor(bufferMinutes: number) {\n this.bufferMinutes = bufferMinutes;\n }\n\n // schedule(apptId, patientId, start, duration, priority):\n // 1. Idempotent: if apptId exists, return { success: false, reason: \u0027duplicate\u0027 }\n // 2. end = start + duration\n // 3. Find conflicting appointments: any scheduled (not bumped) appointment where\n // the ranges [appt.start - bufferMinutes, appt.end + bufferMinutes] and [start, end]\n // overlap. Overlap means: start \u003c existing.end + buffer AND end \u003e existing.start - buffer\n // 4. If no conflicts: add appointment as \u0027scheduled\u0027. Return success.\n // 5. If conflicts exist:\n // a. ALL conflicting appointments must have STRICTLY lower priority.\n // If any conflict has priority \u003e= new appointment\u0027s priority:\n // return { success: false, reason: \u0027priority_conflict\u0027 }\n // b. Bump all conflicting: set their status to \u0027bumped\u0027.\n // c. Add new appointment as \u0027scheduled\u0027.\n // d. Return { success: true, bumped: [bumped apptIds] }\n","golden_completion":" schedule(apptId: string, patientId: string, start: number,\n duration: number, priority: number): ScheduleResult {\n if (this.idSet.has(apptId)) {\n return { success: false, reason: \u0027duplicate\u0027 };\n }\n const end = start + duration;\n const conflicts = this.appointments.filter(a =\u003e\n a.status === \u0027scheduled\u0027 \u0026\u0026\n start \u003c a.end + this.bufferMinutes \u0026\u0026\n end \u003e a.start - this.bufferMinutes\n );\n if (conflicts.length \u003e 0) {\n const canBump = conflicts.every(c =\u003e c.priority \u003c priority);\n if (!canBump) {\n return { success: false, reason: \u0027priority_conflict\u0027 };\n }\n const bumped: string[] = [];\n for (const c of conflicts) {\n c.status = \u0027bumped\u0027;\n bumped.push(c.apptId);\n }\n this.appointments.push({ apptId, patientId, start, end, priority, status: \u0027scheduled\u0027 });\n this.idSet.add(apptId);\n return { success: true, bumped, apptId };\n }\n this.appointments.push({ apptId, patientId, start, end, priority, status: \u0027scheduled\u0027 });\n this.idSet.add(apptId);\n return { success: true, bumped: [], apptId };\n }\n","suffix":"\n}\n\nconst clinic = new ClinicScheduler(15); // 15-minute buffer between appointments\n\n// Schedule A1: 9:00-9:30 (540-570), priority 1\nconst s1 = clinic.schedule(\u0027A1\u0027, \u0027P1\u0027, 540, 30, 1);\nassert.strictEqual(s1.success, true);\nassert.deepStrictEqual(s1.bumped, []);\n\n// Schedule A2: 10:00-10:30 (600-630), priority 1 — no conflict (570+15=585 \u003c 600)\nconst s2 = clinic.schedule(\u0027A2\u0027, \u0027P2\u0027, 600, 30, 1);\nassert.strictEqual(s2.success, true);\n\n// Schedule A3: 9:20-9:50 (560-590), priority 3 — conflicts with A1 (560 \u003c 570+15=585)\n// Also conflicts with A2? 590 \u003e 600-15=585? Yes! So conflicts with both A1 and A2.\n// A1 priority 1 \u003c 3, A2 priority 1 \u003c 3. All lower. Bump both.\nconst s3 = clinic.schedule(\u0027A3\u0027, \u0027P3\u0027, 560, 30, 3);\nassert.strictEqual(s3.success, true);\nassert.deepStrictEqual(s3.bumped!.sort(), [\u0027A1\u0027, \u0027A2\u0027]);\nassert.strictEqual(clinic.appointments.find(a =\u003e a.apptId === \u0027A1\u0027)!.status, \u0027bumped\u0027);\nassert.strictEqual(clinic.appointments.find(a =\u003e a.apptId === \u0027A2\u0027)!.status, \u0027bumped\u0027);\n","assertions":"\n// Can\u0027t bump A3 (priority 3) with equal priority\nconst s4 = clinic.schedule(\u0027A4\u0027, \u0027P4\u0027, 570, 20, 3);\nassert.strictEqual(s4.success, false);\nassert.strictEqual(s4.reason, \u0027priority_conflict\u0027);\n\n// Can bump A3 with higher priority\nconst s5 = clinic.schedule(\u0027A5\u0027, \u0027P5\u0027, 560, 30, 5);\nassert.strictEqual(s5.success, true);\nassert.deepStrictEqual(s5.bumped, [\u0027A3\u0027]);\n\n// Bumped appointments don\u0027t cause conflicts\n// A1 is bumped at 540-570. Schedule A6 at 540-570, priority 1 — no conflict with bumped\n// But check buffer with A5 (560-590): 540 \u003c 590+15=605 AND 570 \u003e 560-15=545. Conflict!\n// A5 priority 5 \u003e= 1, so can\u0027t bump.\nconst s6 = clinic.schedule(\u0027A6\u0027, \u0027P6\u0027, 540, 30, 1);\nassert.strictEqual(s6.success, false);\nassert.strictEqual(s6.reason, \u0027priority_conflict\u0027);\n\n// Non-conflicting slot\nconst s7 = clinic.schedule(\u0027A7\u0027, \u0027P7\u0027, 700, 30, 1);\nassert.strictEqual(s7.success, true);\nassert.deepStrictEqual(s7.bumped, []);\n\n// Duplicate\nconst s8 = clinic.schedule(\u0027A1\u0027, \u0027P1\u0027, 800, 30, 5);\nassert.strictEqual(s8.success, false);\nassert.strictEqual(s8.reason, \u0027duplicate\u0027);\n","category":"code_purpose_understanding"} {"id":"28","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface DrugInfo {\n name: string;\n maxDailyDoseMg: number;\n minIntervalHours: number; // minimum hours between doses\n interactsWith: string[]; // drug names that conflict\n}\n\ninterface ActivePrescription {\n drug: string;\n doseMg: number;\n lastAdministered: number; // epoch hour\n totalTodayMg: number;\n dayStart: number; // epoch hour when \"today\" started for this tracking\n}\n\ninterface AdminResult {\n allowed: boolean;\n reason?: string;\n warnings: string[];\n totalTodayMg?: number;\n}\n\nclass PrescriptionValidator {\n drugDb: Map\u003cstring, DrugInfo\u003e = new Map();\n active: Map\u003cstring, ActivePrescription\u003e = new Map(); // keyed by drug name\n\n registerDrug(name: string, maxDailyDoseMg: number,\n minIntervalHours: number, interactsWith: string[]): void {\n this.drugDb.set(name, { name, maxDailyDoseMg, minIntervalHours, interactsWith });\n }\n\n // administerDose(drug, doseMg, currentHour):\n // 1. Drug must be in drugDb, else { allowed: false, reason: \u0027unknown_drug\u0027, warnings: [] }\n // 2. Check interactions: if any drug in drugDb.interactsWith is currently active\n // (exists in this.active), return { allowed: false, reason: \u0027drug_interaction\u0027, warnings: [conflictDrug] }\n // 3. Check interval: if drug is in active and (currentHour - active.lastAdministered) \u003c minIntervalHours:\n // return { allowed: false, reason: \u0027too_soon\u0027, warnings: [] }\n // 4. Reset daily tracking: if drug is in active and (currentHour - active.dayStart) \u003e= 24:\n // reset totalTodayMg to 0 and dayStart to currentHour.\n // 5. Check daily limit: if (totalTodayMg + doseMg) \u003e maxDailyDoseMg:\n // return { allowed: false, reason: \u0027exceeds_daily_limit\u0027, warnings: [] }\n // 6. Update active prescription:\n // - If new: create entry with totalTodayMg=doseMg, dayStart=currentHour\n // - If existing: add doseMg to totalTodayMg\n // - Set lastAdministered = currentHour\n // 7. warnings: if (totalTodayMg / maxDailyDoseMg) \u003e= 0.8, push \u0027approaching_daily_limit\u0027\n // 8. Return { allowed: true, warnings, totalTodayMg }\n","golden_completion":" administerDose(drug: string, doseMg: number, currentHour: number): AdminResult {\n const info = this.drugDb.get(drug);\n if (!info) {\n return { allowed: false, reason: \u0027unknown_drug\u0027, warnings: [] };\n }\n // Check interactions\n for (const conflict of info.interactsWith) {\n if (this.active.has(conflict)) {\n return { allowed: false, reason: \u0027drug_interaction\u0027, warnings: [conflict] };\n }\n }\n const existing = this.active.get(drug);\n // Check interval\n if (existing \u0026\u0026 (currentHour - existing.lastAdministered) \u003c info.minIntervalHours) {\n return { allowed: false, reason: \u0027too_soon\u0027, warnings: [] };\n }\n // Reset daily tracking if 24+ hours since dayStart\n let totalTodayMg = 0;\n let dayStart = currentHour;\n if (existing) {\n if ((currentHour - existing.dayStart) \u003e= 24) {\n totalTodayMg = 0;\n dayStart = currentHour;\n } else {\n totalTodayMg = existing.totalTodayMg;\n dayStart = existing.dayStart;\n }\n }\n // Check daily limit\n if ((totalTodayMg + doseMg) \u003e info.maxDailyDoseMg) {\n return { allowed: false, reason: \u0027exceeds_daily_limit\u0027, warnings: [] };\n }\n totalTodayMg += doseMg;\n this.active.set(drug, { drug, doseMg, lastAdministered: currentHour, totalTodayMg, dayStart });\n const warnings: string[] = [];\n if (totalTodayMg / info.maxDailyDoseMg \u003e= 0.8) {\n warnings.push(\u0027approaching_daily_limit\u0027);\n }\n return { allowed: true, warnings, totalTodayMg };\n }\n","suffix":"\n}\n\nconst pv = new PrescriptionValidator();\npv.registerDrug(\u0027ibuprofen\u0027, 1200, 6, [\u0027aspirin\u0027]);\npv.registerDrug(\u0027aspirin\u0027, 4000, 4, [\u0027ibuprofen\u0027]);\npv.registerDrug(\u0027acetaminophen\u0027, 3000, 4, []);\n\n// First dose of ibuprofen: 400mg at hour 0\nconst d1 = pv.administerDose(\u0027ibuprofen\u0027, 400, 0);\nassert.strictEqual(d1.allowed, true);\nassert.strictEqual(d1.totalTodayMg, 400);\nassert.deepStrictEqual(d1.warnings, []);\n\n// Aspirin conflicts with ibuprofen (which is active)\nconst d2 = pv.administerDose(\u0027aspirin\u0027, 500, 1);\nassert.strictEqual(d2.allowed, false);\nassert.strictEqual(d2.reason, \u0027drug_interaction\u0027);\nassert.deepStrictEqual(d2.warnings, [\u0027ibuprofen\u0027]);\n\n// Too soon for second ibuprofen (1 \u003c 6 hours)\nconst d3 = pv.administerDose(\u0027ibuprofen\u0027, 400, 5);\nassert.strictEqual(d3.allowed, false);\nassert.strictEqual(d3.reason, \u0027too_soon\u0027);\n","assertions":"\n// After 6 hours: allowed, approaching limit warning\nconst d4 = pv.administerDose(\u0027ibuprofen\u0027, 400, 6);\nassert.strictEqual(d4.allowed, true);\nassert.strictEqual(d4.totalTodayMg, 800);\nassert.deepStrictEqual(d4.warnings, []);\n\n// Third dose at hour 12: 400+400+400=1200 = 100% of limit\nconst d5 = pv.administerDose(\u0027ibuprofen\u0027, 400, 12);\nassert.strictEqual(d5.allowed, true);\nassert.strictEqual(d5.totalTodayMg, 1200);\nassert.deepStrictEqual(d5.warnings, [\u0027approaching_daily_limit\u0027]);\n\n// Fourth dose would exceed daily limit\nconst d6 = pv.administerDose(\u0027ibuprofen\u0027, 400, 18);\nassert.strictEqual(d6.allowed, false);\nassert.strictEqual(d6.reason, \u0027exceeds_daily_limit\u0027);\n\n// After 24 hours from dayStart: reset\nconst d7 = pv.administerDose(\u0027ibuprofen\u0027, 400, 24);\nassert.strictEqual(d7.allowed, true);\nassert.strictEqual(d7.totalTodayMg, 400);\n\n// Acetaminophen has no interactions — can be given alongside ibuprofen\nconst d8 = pv.administerDose(\u0027acetaminophen\u0027, 1000, 24);\nassert.strictEqual(d8.allowed, true);\n\n// Unknown drug\nconst d9 = pv.administerDose(\u0027morphine\u0027, 10, 24);\nassert.strictEqual(d9.allowed, false);\nassert.strictEqual(d9.reason, \u0027unknown_drug\u0027);\n","category":"code_purpose_understanding"} {"id":"29","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Package {\n pkgId: string;\n weight: number; // kg\n destination: string; // zone code\n}\n\ninterface ShipmentResult {\n shipmentId: string;\n packages: string[];\n totalWeight: number;\n zone: string;\n baseCost: number;\n weightSurcharge: number;\n consolidationDiscount: number;\n finalCost: number;\n}\n\nclass DeliveryRouter {\n // Zone base rates\n zoneRates: Map\u003cstring, number\u003e = new Map();\n // Weight surcharge tiers: if totalWeight \u003e= tier.minKg, surcharge = tier.rate per kg over tier.minKg\n // Checked top-down (highest minKg first)\n weightTiers: { minKg: number; ratePerKg: number }[];\n // Consolidation: if \u003e 1 package to same zone in one shipment, discount = flatDiscount per extra package\n consolidationDiscountPerPkg: number;\n shipments: ShipmentResult[] = [];\n private processedPkgs: Set\u003cstring\u003e = new Set();\n\n constructor(zoneRates: Record\u003cstring, number\u003e,\n weightTiers: { minKg: number; ratePerKg: number }[],\n consolidationDiscountPerPkg: number) {\n for (const [z, r] of Object.entries(zoneRates)) {\n this.zoneRates.set(z, r);\n }\n this.weightTiers = [...weightTiers].sort((a, b) =\u003e b.minKg - a.minKg);\n this.consolidationDiscountPerPkg = consolidationDiscountPerPkg;\n }\n\n // createShipment(shipmentId, packages):\n // 1. All packages must go to the SAME zone. If mixed zones:\n // return { error: \u0027mixed_zones\u0027 }\n // 2. No package can be already shipped. If any pkgId is in processedPkgs:\n // return { error: \u0027duplicate_package\u0027, pkgId: first duplicate found }\n // 3. zone = packages[0].destination\n // 4. baseCost = zoneRates.get(zone). If zone not found: return { error: \u0027unknown_zone\u0027 }\n // 5. totalWeight = sum of all package weights\n // 6. Weight surcharge: find first tier where totalWeight \u003e= tier.minKg.\n // surcharge = (totalWeight - tier.minKg) * tier.ratePerKg.\n // If no tier matches: surcharge = 0.\n // Round to 2 decimals.\n // 7. Consolidation discount: if packages.length \u003e 1:\n // discount = (packages.length - 1) * consolidationDiscountPerPkg.\n // Else: discount = 0.\n // 8. finalCost = Math.max(0, baseCost + weightSurcharge - consolidationDiscount)\n // Round to 2 decimals.\n // 9. Mark all pkgIds as processed. Store shipment. Return ShipmentResult.\n","golden_completion":" createShipment(shipmentId: string, packages: Package[]): ShipmentResult | { error: string; pkgId?: string } {\n // Check for duplicate packages\n for (const pkg of packages) {\n if (this.processedPkgs.has(pkg.pkgId)) {\n return { error: \u0027duplicate_package\u0027, pkgId: pkg.pkgId };\n }\n }\n // Check same zone\n const zones = new Set(packages.map(p =\u003e p.destination));\n if (zones.size \u003e 1) {\n return { error: \u0027mixed_zones\u0027 };\n }\n const zone = packages[0].destination;\n const baseRate = this.zoneRates.get(zone);\n if (baseRate === undefined) {\n return { error: \u0027unknown_zone\u0027 };\n }\n const totalWeight = packages.reduce((s, p) =\u003e s + p.weight, 0);\n let weightSurcharge = 0;\n for (const tier of this.weightTiers) {\n if (totalWeight \u003e= tier.minKg) {\n weightSurcharge = Math.round((totalWeight - tier.minKg) * tier.ratePerKg * 100) / 100;\n break;\n }\n }\n const consolidationDiscount = packages.length \u003e 1\n ? (packages.length - 1) * this.consolidationDiscountPerPkg : 0;\n const finalCost = Math.round(Math.max(0, baseRate + weightSurcharge - consolidationDiscount) * 100) / 100;\n for (const pkg of packages) {\n this.processedPkgs.add(pkg.pkgId);\n }\n const result: ShipmentResult = {\n shipmentId, packages: packages.map(p =\u003e p.pkgId), totalWeight,\n zone, baseCost: baseRate, weightSurcharge, consolidationDiscount, finalCost\n };\n this.shipments.push(result);\n return result;\n }\n","suffix":"\n}\n\nconst dr = new DeliveryRouter(\n { \u0027ZONE_A\u0027: 10, \u0027ZONE_B\u0027: 25, \u0027ZONE_C\u0027: 50 },\n [{ minKg: 30, ratePerKg: 3.0 }, { minKg: 10, ratePerKg: 1.5 }, { minKg: 5, ratePerKg: 0.5 }],\n 2.0 // $2 discount per extra package\n);\n\n// Single package to ZONE_A, 8kg\n// baseCost=10, weight 8 \u003e= 5 =\u003e surcharge = (8-5)*0.5 = 1.5, no consolidation\n// final = 10 + 1.5 = 11.50\nconst s1 = dr.createShipment(\u0027S1\u0027, [{ pkgId: \u0027P1\u0027, weight: 8, destination: \u0027ZONE_A\u0027 }]) as ShipmentResult;\nassert.strictEqual(s1.baseCost, 10);\nassert.strictEqual(s1.weightSurcharge, 1.5);\nassert.strictEqual(s1.consolidationDiscount, 0);\nassert.strictEqual(s1.finalCost, 11.5);\n\n// Three packages to ZONE_B, total 35kg\n// baseCost=25, weight 35 \u003e= 30 =\u003e surcharge = (35-30)*3.0 = 15.0\n// consolidation = (3-1)*2 = 4\n// final = 25 + 15 - 4 = 36\nconst s2 = dr.createShipment(\u0027S2\u0027, [\n { pkgId: \u0027P2\u0027, weight: 10, destination: \u0027ZONE_B\u0027 },\n { pkgId: \u0027P3\u0027, weight: 15, destination: \u0027ZONE_B\u0027 },\n { pkgId: \u0027P4\u0027, weight: 10, destination: \u0027ZONE_B\u0027 },\n]) as ShipmentResult;\nassert.strictEqual(s2.totalWeight, 35);\nassert.strictEqual(s2.weightSurcharge, 15);\nassert.strictEqual(s2.consolidationDiscount, 4);\nassert.strictEqual(s2.finalCost, 36);\n","assertions":"\n// Mixed zones\nconst s3 = dr.createShipment(\u0027S3\u0027, [\n { pkgId: \u0027P5\u0027, weight: 5, destination: \u0027ZONE_A\u0027 },\n { pkgId: \u0027P6\u0027, weight: 5, destination: \u0027ZONE_B\u0027 },\n]);\nassert.strictEqual((s3 as any).error, \u0027mixed_zones\u0027);\n\n// Duplicate package\nconst s4 = dr.createShipment(\u0027S4\u0027, [{ pkgId: \u0027P1\u0027, weight: 5, destination: \u0027ZONE_A\u0027 }]);\nassert.strictEqual((s4 as any).error, \u0027duplicate_package\u0027);\nassert.strictEqual((s4 as any).pkgId, \u0027P1\u0027);\n\n// Unknown zone\nconst s5 = dr.createShipment(\u0027S5\u0027, [{ pkgId: \u0027P7\u0027, weight: 5, destination: \u0027ZONE_X\u0027 }]);\nassert.strictEqual((s5 as any).error, \u0027unknown_zone\u0027);\n\n// Light packages: no surcharge (weight 3 \u003c 5)\nconst s6 = dr.createShipment(\u0027S6\u0027, [{ pkgId: \u0027P8\u0027, weight: 3, destination: \u0027ZONE_C\u0027 }]) as ShipmentResult;\nassert.strictEqual(s6.weightSurcharge, 0);\nassert.strictEqual(s6.finalCost, 50);\n\n// Discount can\u0027t make cost negative (large consolidation)\nconst dr2 = new DeliveryRouter({ \u0027Z\u0027: 5 }, [], 10); // $10 discount per extra pkg, baseCost=5, no weight surcharge\nconst s7 = dr2.createShipment(\u0027S7\u0027, [\n { pkgId: \u0027X1\u0027, weight: 1, destination: \u0027Z\u0027 },\n { pkgId: \u0027X2\u0027, weight: 1, destination: \u0027Z\u0027 },\n { pkgId: \u0027X3\u0027, weight: 1, destination: \u0027Z\u0027 },\n]) as ShipmentResult;\n// discount = 2*10=20, baseCost=5 =\u003e max(0, 5-20)=0\nassert.strictEqual(s7.finalCost, 0);\n","category":"code_purpose_understanding"} {"id":"30","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface BinStock {\n binId: string;\n sku: string;\n qty: number;\n unitWeight: number; // kg per unit\n pickPriority: number; // lower = pick first\n}\n\ninterface OrderLine {\n sku: string;\n qtyRequested: number;\n}\n\ninterface PickInstruction {\n binId: string;\n sku: string;\n qtyPicked: number;\n weight: number;\n}\n\ninterface PickResult {\n orderId: string;\n picks: PickInstruction[];\n totalWeight: number;\n fullyFulfilled: boolean;\n unfulfilled: { sku: string; qtyShort: number }[];\n}\n\nclass WarehousePicker {\n bins: BinStock[] = [];\n maxContainerWeight: number;\n processedOrders: Set\u003cstring\u003e = new Set();\n pickLog: PickInstruction[] = [];\n\n constructor(maxContainerWeight: number) {\n this.maxContainerWeight = maxContainerWeight;\n }\n\n addBin(binId: string, sku: string, qty: number, unitWeight: number, pickPriority: number): void {\n this.bins.push({ binId, sku, qty, unitWeight, pickPriority });\n }\n\n // pickOrder(orderId, lines):\n // 1. Idempotent: if orderId already processed, return { error: \u0027duplicate_order\u0027 }\n // 2. For each order line (process in array order):\n // a. Find bins matching sku with qty \u003e 0, sorted by pickPriority ASC.\n // b. Allocate from bins in priority order:\n // - For each bin: units = min(bin.qty, qtyRemaining)\n // - But also check weight: units * unitWeight must not push totalWeight over maxContainerWeight.\n // Reduce units if needed: units = min(units, Math.floor((maxContainerWeight - currentWeight) / unitWeight))\n // - If units \u003c= 0: stop allocating for this line (weight limit).\n // - Deduct bin.qty, add to picks, add to currentWeight.\n // c. If qtyRemaining \u003e 0 after all bins: record as unfulfilled.\n // 3. Mark orderId as processed.\n // 4. Return PickResult.\n","golden_completion":" pickOrder(orderId: string, lines: OrderLine[]): PickResult | { error: string } {\n if (this.processedOrders.has(orderId)) {\n return { error: \u0027duplicate_order\u0027 };\n }\n const picks: PickInstruction[] = [];\n let totalWeight = 0;\n const unfulfilled: { sku: string; qtyShort: number }[] = [];\n\n for (const line of lines) {\n let qtyRemaining = line.qtyRequested;\n const matchingBins = this.bins\n .filter(b =\u003e b.sku === line.sku \u0026\u0026 b.qty \u003e 0)\n .sort((a, b) =\u003e a.pickPriority - b.pickPriority);\n\n for (const bin of matchingBins) {\n if (qtyRemaining \u003c= 0) break;\n let units = Math.min(bin.qty, qtyRemaining);\n const maxByWeight = Math.floor((this.maxContainerWeight - totalWeight) / bin.unitWeight);\n if (maxByWeight \u003c= 0) break;\n units = Math.min(units, maxByWeight);\n const pickWeight = Math.round(units * bin.unitWeight * 100) / 100;\n bin.qty -= units;\n qtyRemaining -= units;\n totalWeight = Math.round((totalWeight + pickWeight) * 100) / 100;\n picks.push({ binId: bin.binId, sku: line.sku, qtyPicked: units, weight: pickWeight });\n }\n if (qtyRemaining \u003e 0) {\n unfulfilled.push({ sku: line.sku, qtyShort: qtyRemaining });\n }\n }\n\n this.processedOrders.add(orderId);\n this.pickLog.push(...picks);\n return { orderId, picks, totalWeight, fullyFulfilled: unfulfilled.length === 0, unfulfilled };\n }\n","suffix":"\n}\n\nconst wp = new WarehousePicker(50); // 50kg max container\n\nwp.addBin(\u0027BIN-A\u0027, \u0027WIDGET\u0027, 20, 0.5, 1); // priority 1, 0.5kg each\nwp.addBin(\u0027BIN-B\u0027, \u0027WIDGET\u0027, 30, 0.5, 3); // priority 3\nwp.addBin(\u0027BIN-C\u0027, \u0027GADGET\u0027, 10, 2.0, 2); // priority 2, 2kg each\nwp.addBin(\u0027BIN-D\u0027, \u0027GADGET\u0027, 5, 2.0, 1); // priority 1\n\n// Order: 25 WIDGETs, 8 GADGETs\n// WIDGETs: BIN-A(pri 1, qty 20) first =\u003e take 20, weight=10. BIN-B(pri 3, qty 30) =\u003e take 5, weight=2.5.\n// Total weight after WIDGETs: 12.5kg. qtyRemaining=0.\n// GADGETs: BIN-D(pri 1, qty 5) first =\u003e take 5, weight=10. BIN-C(pri 2, qty 10) =\u003e take 3, weight=6.\n// Total weight after GADGETs: 28.5kg. qtyRemaining=0.\n\nconst r1 = wp.pickOrder(\u0027ORD1\u0027, [\n { sku: \u0027WIDGET\u0027, qtyRequested: 25 },\n { sku: \u0027GADGET\u0027, qtyRequested: 8 },\n]) as PickResult;\n\nassert.strictEqual(r1.fullyFulfilled, true);\nassert.strictEqual(r1.picks.length, 4);\nassert.strictEqual(r1.totalWeight, 28.5);\nassert.strictEqual(r1.picks[0].binId, \u0027BIN-A\u0027);\nassert.strictEqual(r1.picks[0].qtyPicked, 20);\nassert.strictEqual(r1.picks[1].binId, \u0027BIN-B\u0027);\nassert.strictEqual(r1.picks[1].qtyPicked, 5);\nassert.strictEqual(r1.picks[2].binId, \u0027BIN-D\u0027);\nassert.strictEqual(r1.picks[2].qtyPicked, 5);\nassert.strictEqual(r1.picks[3].binId, \u0027BIN-C\u0027);\nassert.strictEqual(r1.picks[3].qtyPicked, 3);\n","assertions":"\n// After ORD1: BIN-A=0, BIN-B=25, BIN-C=7, BIN-D=0\n// Order: 60 WIDGETs (only 25 available in BIN-B) + weight limit\n// WIDGETs: BIN-B(25 remaining). At 28.5kg + 25*0.5=12.5 = 41kg. All 25 fit.\n// Still need 35 more but no bins. Unfulfilled.\nconst r2 = wp.pickOrder(\u0027ORD2\u0027, [{ sku: \u0027WIDGET\u0027, qtyRequested: 60 }]) as PickResult;\nassert.strictEqual(r2.fullyFulfilled, false);\nassert.strictEqual(r2.unfulfilled.length, 1);\nassert.strictEqual(r2.unfulfilled[0].sku, \u0027WIDGET\u0027);\nassert.strictEqual(r2.unfulfilled[0].qtyShort, 35);\nassert.strictEqual(r2.totalWeight, 12.5);\n\n// Weight limit enforcement: heavy items\nwp.addBin(\u0027BIN-E\u0027, \u0027HEAVY\u0027, 100, 5.0, 1); // 5kg each\n// Container can hold max 50kg, so max 10 units\nconst r3 = wp.pickOrder(\u0027ORD3\u0027, [{ sku: \u0027HEAVY\u0027, qtyRequested: 15 }]) as PickResult;\nassert.strictEqual(r3.picks[0].qtyPicked, 10); // floor(50/5)=10\nassert.strictEqual(r3.totalWeight, 50);\nassert.strictEqual(r3.fullyFulfilled, false);\nassert.strictEqual(r3.unfulfilled[0].qtyShort, 5);\n\n// Duplicate order\nconst r4 = wp.pickOrder(\u0027ORD1\u0027, [{ sku: \u0027WIDGET\u0027, qtyRequested: 1 }]);\nassert.strictEqual((r4 as any).error, \u0027duplicate_order\u0027);\n","category":"code_purpose_understanding"} {"id":"31","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Account {\n id: string;\n balance: number;\n dailyTransferred: number;\n lastTransferDay: number;\n}\n\ninterface TransferAudit {\n from: string;\n to: string;\n gross: number;\n fee: number;\n net: number;\n day: number;\n status: string;\n reason?: string;\n}\n\nclass BankingService {\n accounts: Map\u003cstring, Account\u003e = new Map();\n dailyLimit: number;\n feeRate: number; // fraction, e.g. 0.02 = 2%\n minFee: number; // minimum fee per transfer\n auditLog: TransferAudit[] = [];\n\n constructor(dailyLimit: number, feeRate: number, minFee: number) {\n this.dailyLimit = dailyLimit;\n this.feeRate = feeRate;\n this.minFee = minFee;\n }\n\n addAccount(id: string, balance: number): void {\n this.accounts.set(id, { id, balance, dailyTransferred: 0, lastTransferDay: -1 });\n }\n\n // Transfer `amount` from `fromId` to `toId` on `day`.\n // Fee = max(amount * feeRate, minFee), deducted from SENDER in addition to amount.\n // Total debit = amount + fee.\n // Check order:\n // 1. Both accounts exist, else \u0027account_not_found\u0027.\n // 2. Reset dailyTransferred if day differs from lastTransferDay.\n // 3. dailyTransferred + amount \u003e dailyLimit? \u0027daily_limit_exceeded\u0027.\n // 4. Sender balance \u003c amount + fee? \u0027insufficient_funds\u0027.\n // 5. Success: debit sender (amount+fee), credit receiver (amount only),\n // update dailyTransferred, log audit with gross/fee/net.\n","golden_completion":" transfer(fromId: string, toId: string, amount: number, day: number): TransferAudit {\n const from = this.accounts.get(fromId);\n const to = this.accounts.get(toId);\n if (!from || !to) {\n const audit: TransferAudit = { from: fromId, to: toId, gross: amount, fee: 0, net: 0, day, status: \u0027failed\u0027, reason: \u0027account_not_found\u0027 };\n this.auditLog.push(audit);\n return audit;\n }\n if (from.lastTransferDay !== day) {\n from.dailyTransferred = 0;\n from.lastTransferDay = day;\n }\n if (from.dailyTransferred + amount \u003e this.dailyLimit) {\n const audit: TransferAudit = { from: fromId, to: toId, gross: amount, fee: 0, net: 0, day, status: \u0027failed\u0027, reason: \u0027daily_limit_exceeded\u0027 };\n this.auditLog.push(audit);\n return audit;\n }\n const fee = Math.max(Math.round(amount * this.feeRate * 100) / 100, this.minFee);\n const totalDebit = amount + fee;\n if (from.balance \u003c totalDebit) {\n const audit: TransferAudit = { from: fromId, to: toId, gross: amount, fee, net: 0, day, status: \u0027failed\u0027, reason: \u0027insufficient_funds\u0027 };\n this.auditLog.push(audit);\n return audit;\n }\n from.balance -= totalDebit;\n to.balance += amount;\n from.dailyTransferred += amount;\n const audit: TransferAudit = { from: fromId, to: toId, gross: amount, fee, net: amount, day, status: \u0027success\u0027 };\n this.auditLog.push(audit);\n return audit;\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst bank = new BankingService(1000, 0.02, 5);\nbank.addAccount(\u0027A\u0027, 500);\nbank.addAccount(\u0027B\u0027, 200);\n\n// Normal transfer: amount=100, fee=max(2, 5)=5, total debit=105\nconst r1 = bank.transfer(\u0027A\u0027, \u0027B\u0027, 100, 1);\nassert.strictEqual(r1.status, \u0027success\u0027);\nassert.strictEqual(r1.fee, 5);\nassert.strictEqual(bank.accounts.get(\u0027A\u0027)!.balance, 395);\nassert.strictEqual(bank.accounts.get(\u0027B\u0027)!.balance, 300);\n\n// Large transfer: amount=300, fee=max(6, 5)=6, total=306\nconst r2 = bank.transfer(\u0027A\u0027, \u0027B\u0027, 300, 1);\nassert.strictEqual(r2.fee, 6);\nassert.strictEqual(bank.accounts.get(\u0027A\u0027)!.balance, 89);\n\nconsole.log(\u0027Task 31 suffix passed\u0027);\n","assertions":"// A has transferred 400 on day 1 already (100+300). Try 700 more -\u003e 1100 \u003e 1000 limit\nconst r3 = bank.transfer(\u0027A\u0027, \u0027B\u0027, 700, 1);\nassert.strictEqual(r3.status, \u0027failed\u0027);\nassert.strictEqual(r3.reason, \u0027daily_limit_exceeded\u0027);\n\n// New day resets limit\nconst r4 = bank.transfer(\u0027B\u0027, \u0027A\u0027, 500, 2);\nassert.strictEqual(r4.status, \u0027success\u0027);\nassert.strictEqual(r4.fee, 10); // max(500*0.02=10, 5)=10\n\n// Insufficient funds (balance check includes fee)\nbank.addAccount(\u0027C\u0027, 100);\nconst r5 = bank.transfer(\u0027C\u0027, \u0027A\u0027, 100, 3); // need 100+5=105, have 100\nassert.strictEqual(r5.status, \u0027failed\u0027);\nassert.strictEqual(r5.reason, \u0027insufficient_funds\u0027);\nassert.strictEqual(r5.fee, 5);\n\n// Non-existent account\nconst r6 = bank.transfer(\u0027Z\u0027, \u0027A\u0027, 10, 3);\nassert.strictEqual(r6.reason, \u0027account_not_found\u0027);\n\n// Audit log has all attempts\nassert.strictEqual(bank.auditLog.length, 6);\n\nconsole.log(\u0027Task 31 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"32","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Payment {\n month: number;\n principal: number;\n interest: number;\n penalty: number;\n remaining: number;\n}\n\nclass LoanAccount {\n originalPrincipal: number;\n principal: number;\n annualRate: number;\n termMonths: number;\n earlyPenaltyRate: number; // fraction of remaining principal\n minTermBeforeEarly: number; // can\u0027t prepay before this month\n payments: Payment[] = [];\n monthsPaid: number = 0;\n closed: boolean = false;\n\n constructor(principal: number, annualRate: number, termMonths: number,\n earlyPenaltyRate: number, minTermBeforeEarly: number) {\n this.originalPrincipal = principal;\n this.principal = principal;\n this.annualRate = annualRate;\n this.termMonths = termMonths;\n this.earlyPenaltyRate = earlyPenaltyRate;\n this.minTermBeforeEarly = minTermBeforeEarly;\n }\n\n monthlyRate(): number {\n return this.annualRate / 12;\n }\n\n // Standard monthly payment (fixed amortization formula, uses ORIGINAL principal)\n scheduledPayment(): number {\n const r = this.monthlyRate();\n const n = this.termMonths;\n return Math.round(this.originalPrincipal * r * Math.pow(1 + r, n) / (Math.pow(1 + r, n) - 1) * 100) / 100;\n }\n\n // Make a payment. Rules:\n // 1. If closed, return {success: false, reason: \u0027closed\u0027}.\n // 2. Interest for this month = remaining principal * monthlyRate.\n // 3. If extra \u003e 0 (overpayment), apply extra to principal reduction AFTER\n // the scheduled payment\u0027s principal portion. But if monthsPaid \u003c minTermBeforeEarly,\n // reject with \u0027early_repayment_blocked\u0027.\n // 4. If extra \u003e 0 and monthsPaid \u003e= minTermBeforeEarly, charge penalty =\n // extra * earlyPenaltyRate. Actual extra applied = extra - penalty.\n // 5. If remaining principal \u003c= 0 after payment, close the loan.\n // 6. Record payment and return it.\n","golden_completion":" makePayment(extra: number = 0): Payment | { success: false; reason: string } {\n if (this.closed) return { success: false, reason: \u0027closed\u0027 };\n\n const interest = Math.round(this.principal * this.monthlyRate() * 100) / 100;\n const scheduled = this.scheduledPayment();\n const principalPortion = Math.min(scheduled - interest, this.principal);\n\n if (extra \u003e 0 \u0026\u0026 this.monthsPaid \u003c this.minTermBeforeEarly) {\n return { success: false, reason: \u0027early_repayment_blocked\u0027 };\n }\n\n let penalty = 0;\n let extraPrincipal = 0;\n if (extra \u003e 0) {\n penalty = Math.round(extra * this.earlyPenaltyRate * 100) / 100;\n extraPrincipal = extra - penalty;\n }\n\n this.principal -= principalPortion + extraPrincipal;\n this.principal = Math.round(this.principal * 100) / 100;\n if (this.principal \u003c 0) this.principal = 0;\n\n this.monthsPaid++;\n if (this.principal \u003c= 0) this.closed = true;\n\n const payment: Payment = {\n month: this.monthsPaid,\n principal: Math.round((principalPortion + extraPrincipal) * 100) / 100,\n interest,\n penalty,\n remaining: this.principal,\n };\n this.payments.push(payment);\n return payment;\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\n// $10,000 loan, 12% annual (1%/month), 12 months, 5% early penalty, min 3 months\nconst loan = new LoanAccount(10000, 0.12, 12, 0.05, 3);\nconst sched = loan.scheduledPayment();\nassert.strictEqual(sched, 888.49);\n\n// Normal payment month 1: interest = 100, principal = 788.49\nconst p1 = loan.makePayment() as Payment;\nassert.strictEqual(p1.interest, 100);\nassert.strictEqual(p1.principal, 788.49);\nassert.strictEqual(p1.remaining, 9211.51);\nassert.strictEqual(p1.penalty, 0);\n\n// Try early repayment in month 2 (blocked, need 3 months first)\nconst p2 = loan.makePayment(500) as any;\nassert.strictEqual(p2.success, false);\nassert.strictEqual(p2.reason, \u0027early_repayment_blocked\u0027);\n\nconsole.log(\u0027Task 32 suffix passed\u0027);\n","assertions":"// Regular payment month 2\nconst p2b = loan.makePayment() as Payment;\nassert.strictEqual(p2b.month, 2);\nassert.strictEqual(p2b.interest, 92.12); // 9211.51 * 0.01\n\n// Regular payment month 3\nconst p3 = loan.makePayment() as Payment;\nassert.strictEqual(p3.month, 3);\n\n// Now early repayment allowed (month 4, monthsPaid will be 3 after p3)\nconst p4 = loan.makePayment(2000) as Payment;\nassert.strictEqual(p4.month, 4);\nassert.strictEqual(p4.penalty, 100); // 2000 * 0.05\n// extra applied = 2000 - 100 = 1900, plus normal principal portion\nassert.ok(p4.principal \u003e 1900); // normal portion + 1900\nassert.ok(p4.remaining \u003c 6000); // substantially reduced\n\n// Pay down remaining with more payments\nwhile (!loan.closed) {\n loan.makePayment();\n}\nassert.strictEqual(loan.closed, true);\nassert.strictEqual(loan.principal, 0);\n\n// Can\u0027t pay after closed\nconst pClosed = loan.makePayment() as any;\nassert.strictEqual(pClosed.success, false);\nassert.strictEqual(pClosed.reason, \u0027closed\u0027);\n\nconsole.log(\u0027Task 32 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"33","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface CreditEvent {\n type: \u0027payment_ontime\u0027 | \u0027payment_late\u0027 | \u0027default\u0027 | \u0027inquiry\u0027 | \u0027account_opened\u0027;\n timestamp: number; // months since account creation\n amount?: number;\n}\n\ninterface ScoreBreakdown {\n paymentHistory: number;\n creditUtilization: number;\n accountAge: number;\n inquiryPenalty: number;\n rawScore: number;\n tier: string;\n}\n\nclass CreditScorer {\n events: CreditEvent[] = [];\n creditLimit: number;\n currentBalance: number;\n accountOpenedAt: number; // month 0\n decayFactor: number; // older events count less: weight * decay^(age in months)\n\n // Tier thresholds: score \u003e= 750 \u0027excellent\u0027, \u003e= 650 \u0027good\u0027, \u003e= 550 \u0027fair\u0027, else \u0027poor\u0027\n constructor(creditLimit: number, decayFactor: number) {\n this.creditLimit = creditLimit;\n this.currentBalance = 0;\n this.accountOpenedAt = 0;\n this.decayFactor = decayFactor;\n }\n\n addEvent(event: CreditEvent): void {\n this.events.push(event);\n if (event.type === \u0027account_opened\u0027 \u0026\u0026 event.amount) {\n this.currentBalance += event.amount;\n }\n }\n\n setBalance(balance: number): void {\n this.currentBalance = balance;\n }\n\n // Calculate credit score at a given month.\n // Payment history (max 400 pts): each on-time = +20*decay, late = -30*decay, default = -80*decay\n // Credit utilization (max 300 pts): ratio = balance/limit.\n // ratio \u003c= 0.1: 300, \u003c= 0.3: 250, \u003c= 0.5: 200, \u003c= 0.7: 100, else 50\n // Account age (max 100 pts): min(currentMonth - accountOpenedAt, 120) / 120 * 100\n // Inquiry penalty: each inquiry in last 6 months = -10\n // Raw score = paymentHistory (capped 0..400) + utilization + accountAge - inquiryPenalty (floor 0)\n // Score cannot exceed 800 or go below 300.\n","golden_completion":" calculateScore(currentMonth: number): ScoreBreakdown {\n // Payment history\n let paymentRaw = 0;\n for (const e of this.events) {\n const age = currentMonth - e.timestamp;\n const decay = Math.pow(this.decayFactor, age);\n if (e.type === \u0027payment_ontime\u0027) paymentRaw += 20 * decay;\n else if (e.type === \u0027payment_late\u0027) paymentRaw -= 30 * decay;\n else if (e.type === \u0027default\u0027) paymentRaw -= 80 * decay;\n }\n const paymentHistory = Math.max(0, Math.min(400, Math.round(paymentRaw * 100) / 100));\n\n // Credit utilization\n const ratio = this.creditLimit \u003e 0 ? this.currentBalance / this.creditLimit : 0;\n let creditUtilization: number;\n if (ratio \u003c= 0.1) creditUtilization = 300;\n else if (ratio \u003c= 0.3) creditUtilization = 250;\n else if (ratio \u003c= 0.5) creditUtilization = 200;\n else if (ratio \u003c= 0.7) creditUtilization = 100;\n else creditUtilization = 50;\n\n // Account age\n const ageMonths = Math.min(currentMonth - this.accountOpenedAt, 120);\n const accountAge = Math.round(ageMonths / 120 * 100 * 100) / 100;\n\n // Inquiry penalty\n let inquiryPenalty = 0;\n for (const e of this.events) {\n if (e.type === \u0027inquiry\u0027 \u0026\u0026 currentMonth - e.timestamp \u003c= 6) {\n inquiryPenalty += 10;\n }\n }\n\n let rawScore = paymentHistory + creditUtilization + accountAge - inquiryPenalty;\n rawScore = Math.max(300, Math.min(800, Math.round(rawScore * 100) / 100));\n\n let tier: string;\n if (rawScore \u003e= 750) tier = \u0027excellent\u0027;\n else if (rawScore \u003e= 650) tier = \u0027good\u0027;\n else if (rawScore \u003e= 550) tier = \u0027fair\u0027;\n else tier = \u0027poor\u0027;\n\n return { paymentHistory, creditUtilization, accountAge, inquiryPenalty, rawScore, tier };\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst scorer = new CreditScorer(10000, 0.95);\nscorer.addEvent({ type: \u0027payment_ontime\u0027, timestamp: 1 });\nscorer.addEvent({ type: \u0027payment_ontime\u0027, timestamp: 2 });\nscorer.addEvent({ type: \u0027payment_ontime\u0027, timestamp: 3 });\nscorer.setBalance(1000); // 10% utilization\n\nconst s1 = scorer.calculateScore(4);\n// payment: 20*0.95^3 + 20*0.95^2 + 20*0.95^1 = 17.15 + 18.05 + 19 = 54.2\nassert.ok(s1.paymentHistory \u003e 50 \u0026\u0026 s1.paymentHistory \u003c 60);\nassert.strictEqual(s1.creditUtilization, 300); // 1000/10000 = 0.1\nassert.strictEqual(s1.tier, \u0027poor\u0027); // score ~354 + small age\n\nconsole.log(\u0027Task 33 suffix passed\u0027);\n","assertions":"// Build up more history (months 5 through 48 = lots of on-time payments)\nfor (let m = 5; m \u003c= 48; m++) {\n scorer.addEvent({ type: \u0027payment_ontime\u0027, timestamp: m });\n}\nconst s2 = scorer.calculateScore(48);\nassert.strictEqual(s2.creditUtilization, 300);\nassert.ok(s2.paymentHistory \u003e 300); // many on-time payments with decay\n// accountAge = min(48,120)/120*100 = 40\nassert.ok(s2.rawScore \u003e= 650);\nassert.strictEqual(s2.tier, \u0027good\u0027);\n\n// Late payment impact\nscorer.addEvent({ type: \u0027payment_late\u0027, timestamp: 49 });\nscorer.addEvent({ type: \u0027default\u0027, timestamp: 50 });\nconst s3 = scorer.calculateScore(50);\nassert.ok(s3.paymentHistory \u003c s2.paymentHistory); // reduced by late + default\n\n// Inquiry penalty\nscorer.addEvent({ type: \u0027inquiry\u0027, timestamp: 49 });\nscorer.addEvent({ type: \u0027inquiry\u0027, timestamp: 50 });\nconst s4 = scorer.calculateScore(50);\nassert.strictEqual(s4.inquiryPenalty, 20); // 2 inquiries within 6 months\n\n// High utilization drops score\nscorer.setBalance(8000); // 80% utilization\nconst s5 = scorer.calculateScore(50);\nassert.strictEqual(s5.creditUtilization, 50);\nassert.ok(s5.rawScore \u003c s4.rawScore);\n\n// Score floor\nconst badScorer = new CreditScorer(1000, 0.95);\nbadScorer.addEvent({ type: \u0027default\u0027, timestamp: 1 });\nbadScorer.addEvent({ type: \u0027default\u0027, timestamp: 2 });\nbadScorer.addEvent({ type: \u0027default\u0027, timestamp: 3 });\nbadScorer.setBalance(900); // 90%\nconst sBad = badScorer.calculateScore(3);\nassert.strictEqual(sBad.rawScore, 300); // floor\n\n// Old inquiries don\u0027t count\nscorer.addEvent({ type: \u0027inquiry\u0027, timestamp: 10 });\nconst s6 = scorer.calculateScore(50);\nassert.strictEqual(s6.inquiryPenalty, 20); // inquiry at month 10 is 40 months old, doesn\u0027t count\n\nconsole.log(\u0027Task 33 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"34","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Item {\n name: string;\n durability: number; // 0-100, item breaks at 0\n stackable: boolean;\n quantity: number;\n}\n\ninterface CraftingRecipe {\n output: string;\n outputDurability: number;\n ingredients: { name: string; quantity: number }[];\n requiresMinDurability: number; // each ingredient must have \u003e= this durability\n}\n\nclass GameInventory {\n slots: (Item | null)[];\n maxSlots: number;\n recipes: Map\u003cstring, CraftingRecipe\u003e = new Map();\n\n constructor(maxSlots: number) {\n this.maxSlots = maxSlots;\n this.slots = new Array(maxSlots).fill(null);\n }\n\n addRecipe(recipe: CraftingRecipe): void {\n this.recipes.set(recipe.output, recipe);\n }\n\n // Add item. Stackable items merge into existing slot (add quantity).\n // Non-stackable items take a new slot. Returns slot index or -1 if full.\n addItem(name: string, durability: number, stackable: boolean, quantity: number = 1): number {\n if (stackable) {\n for (let i = 0; i \u003c this.maxSlots; i++) {\n if (this.slots[i] \u0026\u0026 this.slots[i]!.name === name \u0026\u0026 this.slots[i]!.stackable) {\n this.slots[i]!.quantity += quantity;\n return i;\n }\n }\n }\n for (let i = 0; i \u003c this.maxSlots; i++) {\n if (!this.slots[i]) {\n this.slots[i] = { name, durability, stackable, quantity };\n return i;\n }\n }\n return -1;\n }\n\n // Use item at slot, reducing durability by `wear`. If durability \u003c= 0, remove item.\n // Returns remaining durability or -1 if slot empty.\n useItem(slot: number, wear: number): number {\n const item = this.slots[slot];\n if (!item) return -1;\n item.durability -= wear;\n if (item.durability \u003c= 0) {\n this.slots[slot] = null;\n return 0;\n }\n return item.durability;\n }\n\n // Craft: consume ingredients from inventory, produce output.\n // Rules:\n // 1. Recipe must exist, else \u0027unknown_recipe\u0027.\n // 2. For each ingredient, find slots with matching name.\n // Sum available quantities WHERE durability \u003e= requiresMinDurability.\n // If total \u003c needed, \u0027insufficient_materials\u0027 with details.\n // 3. Consume ingredients (reduce quantity, remove slot if quantity hits 0).\n // Consume from LOWEST durability slots first (but still \u003e= min).\n // 4. Add crafted item (non-stackable, with recipe\u0027s outputDurability).\n // 5. Return {success, slot, consumed: [{name, qty, fromSlot}]}.\n","golden_completion":" craft(outputName: string): { success: boolean; slot?: number; reason?: string; consumed?: { name: string; qty: number; fromSlot: number }[]; missing?: { name: string; have: number; need: number } } {\n const recipe = this.recipes.get(outputName);\n if (!recipe) return { success: false, reason: \u0027unknown_recipe\u0027 };\n\n // Check availability\n for (const ing of recipe.ingredients) {\n let available = 0;\n for (let i = 0; i \u003c this.maxSlots; i++) {\n const s = this.slots[i];\n if (s \u0026\u0026 s.name === ing.name \u0026\u0026 s.durability \u003e= recipe.requiresMinDurability) {\n available += s.quantity;\n }\n }\n if (available \u003c ing.quantity) {\n return { success: false, reason: \u0027insufficient_materials\u0027, missing: { name: ing.name, have: available, need: ing.quantity } };\n }\n }\n\n // Consume ingredients (lowest durability first among eligible)\n const consumed: { name: string; qty: number; fromSlot: number }[] = [];\n for (const ing of recipe.ingredients) {\n let needed = ing.quantity;\n // Collect eligible slots sorted by durability ascending\n const eligible: { slot: number; item: Item }[] = [];\n for (let i = 0; i \u003c this.maxSlots; i++) {\n const s = this.slots[i];\n if (s \u0026\u0026 s.name === ing.name \u0026\u0026 s.durability \u003e= recipe.requiresMinDurability) {\n eligible.push({ slot: i, item: s });\n }\n }\n eligible.sort((a, b) =\u003e a.item.durability - b.item.durability);\n\n for (const e of eligible) {\n if (needed \u003c= 0) break;\n const take = Math.min(needed, e.item.quantity);\n e.item.quantity -= take;\n if (e.item.quantity \u003c= 0) this.slots[e.slot] = null;\n consumed.push({ name: ing.name, qty: take, fromSlot: e.slot });\n needed -= take;\n }\n }\n\n // Add crafted item\n const slot = this.addItem(outputName, recipe.outputDurability, false);\n return { success: true, slot, consumed };\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst inv = new GameInventory(6);\ninv.addRecipe({\n output: \u0027iron_sword\u0027,\n outputDurability: 100,\n ingredients: [{ name: \u0027iron\u0027, quantity: 3 }, { name: \u0027wood\u0027, quantity: 1 }],\n requiresMinDurability: 20,\n});\n\ninv.addItem(\u0027iron\u0027, 50, true, 2); // slot 0: iron x2, dur 50\ninv.addItem(\u0027iron\u0027, 30, true, 2); // stacks -\u003e slot 0: iron x4, dur 50... wait\n\n// Actually stackable merges, so both go to slot 0 with qty 4, but durability stays at first add\n// Let\u0027s use non-stackable iron for durability test\nconst inv2 = new GameInventory(8);\ninv2.addRecipe({\n output: \u0027iron_sword\u0027,\n outputDurability: 100,\n ingredients: [{ name: \u0027iron\u0027, quantity: 3 }, { name: \u0027wood\u0027, quantity: 1 }],\n requiresMinDurability: 20,\n});\n\ninv2.addItem(\u0027iron\u0027, 25, false); // slot 0, dur 25\ninv2.addItem(\u0027iron\u0027, 50, false); // slot 1, dur 50\ninv2.addItem(\u0027iron\u0027, 15, false); // slot 2, dur 15 (below min!)\ninv2.addItem(\u0027iron\u0027, 40, false); // slot 3, dur 40\ninv2.addItem(\u0027wood\u0027, 80, false); // slot 4\n\n// Available iron with dur\u003e=20: slots 0(25), 1(50), 3(40) = 3 items, need 3\nconst r1 = inv2.craft(\u0027iron_sword\u0027);\nassert.strictEqual(r1.success, true);\n// Consumed lowest dur first: slot 0 (dur 25), then slot 3 (dur 40), then slot 1 (dur 50)\nassert.strictEqual(r1.consumed![0].fromSlot, 0);\nassert.strictEqual(r1.consumed![1].fromSlot, 3);\nassert.strictEqual(r1.consumed![2].fromSlot, 1);\n\n// Slot 2 (dur 15) should still exist\nassert.notStrictEqual(inv2.slots[2], null);\n\nconsole.log(\u0027Task 34 suffix passed\u0027);\n","assertions":"// Craft again: not enough iron (only slot 2 left with dur 15, below min 20)\nconst r2 = inv2.craft(\u0027iron_sword\u0027);\nassert.strictEqual(r2.success, false);\nassert.strictEqual(r2.reason, \u0027insufficient_materials\u0027);\nassert.strictEqual(r2.missing!.name, \u0027iron\u0027);\nassert.strictEqual(r2.missing!.have, 0); // dur 15 \u003c 20\n\n// Unknown recipe\nconst r3 = inv2.craft(\u0027diamond_sword\u0027);\nassert.strictEqual(r3.reason, \u0027unknown_recipe\u0027);\n\n// Stackable crafting: use stackable wood\nconst inv3 = new GameInventory(5);\ninv3.addRecipe({\n output: \u0027plank\u0027,\n outputDurability: 80,\n ingredients: [{ name: \u0027log\u0027, quantity: 4 }],\n requiresMinDurability: 0,\n});\ninv3.addItem(\u0027log\u0027, 100, true, 10); // slot 0, qty 10\nconst r4 = inv3.craft(\u0027plank\u0027);\nassert.strictEqual(r4.success, true);\nassert.strictEqual(inv3.slots[0]!.quantity, 6); // 10-4=6\n\n// Use item durability\nconst swordSlot = r1.slot!;\nconst d1 = inv2.useItem(swordSlot, 30);\nassert.strictEqual(d1, 70);\nconst d2 = inv2.useItem(swordSlot, 80);\nassert.strictEqual(d2, 0);\nassert.strictEqual(inv2.slots[swordSlot], null); // destroyed\n\nconsole.log(\u0027Task 34 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"35","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface LeaderboardEntry {\n playerId: string;\n score: number;\n submittedAt: number;\n flagged: boolean;\n session: string;\n}\n\nclass Leaderboard {\n entries: LeaderboardEntry[] = [];\n sessions: Map\u003cstring, { playerId: string; startedAt: number; maxScore: number }\u003e = new Map();\n maxScorePerMinute: number; // anti-cheat: max score gain per minute of play\n topN: number;\n\n constructor(maxScorePerMinute: number, topN: number) {\n this.maxScorePerMinute = maxScorePerMinute;\n this.topN = topN;\n }\n\n startSession(playerId: string, sessionId: string, startedAt: number): void {\n this.sessions.set(sessionId, { playerId, startedAt, maxScore: 0 });\n }\n\n // Submit score. Anti-cheat rules:\n // 1. Session must exist and belong to this player, else \u0027invalid_session\u0027.\n // 2. Elapsed = (submittedAt - session.startedAt). If \u003c= 0, \u0027invalid_timestamp\u0027.\n // 3. scoreVelocity = score / (elapsed / 60). If \u003e maxScorePerMinute, flag entry.\n // 4. If player already has an entry: keep the HIGHER score. If new score is\n // higher, replace. If equal or lower, reject with \u0027score_not_improved\u0027.\n // 5. Update session.maxScore = max(session.maxScore, score).\n // 6. Return the entry and current rank (1-indexed, among non-flagged only for rank).\n","golden_completion":" submitScore(playerId: string, sessionId: string, score: number, submittedAt: number): { success: boolean; reason?: string; entry?: LeaderboardEntry; rank?: number } {\n const session = this.sessions.get(sessionId);\n if (!session || session.playerId !== playerId) {\n return { success: false, reason: \u0027invalid_session\u0027 };\n }\n const elapsed = submittedAt - session.startedAt;\n if (elapsed \u003c= 0) {\n return { success: false, reason: \u0027invalid_timestamp\u0027 };\n }\n const velocity = score / (elapsed / 60);\n const flagged = velocity \u003e this.maxScorePerMinute;\n\n // Check existing entry\n const existingIdx = this.entries.findIndex(e =\u003e e.playerId === playerId);\n if (existingIdx !== -1) {\n if (score \u003c= this.entries[existingIdx].score) {\n return { success: false, reason: \u0027score_not_improved\u0027 };\n }\n this.entries.splice(existingIdx, 1);\n }\n\n const entry: LeaderboardEntry = { playerId, score, submittedAt, flagged, session: sessionId };\n this.entries.push(entry);\n this.entries.sort((a, b) =\u003e b.score - a.score);\n\n session.maxScore = Math.max(session.maxScore, score);\n\n // Rank among non-flagged\n const nonFlagged = this.entries.filter(e =\u003e !e.flagged);\n const rank = flagged ? -1 : nonFlagged.findIndex(e =\u003e e.playerId === playerId) + 1;\n\n return { success: true, entry, rank: rank === -1 ? undefined : rank };\n }\n\n getTopN(): LeaderboardEntry[] {\n return this.entries.filter(e =\u003e !e.flagged).slice(0, this.topN);\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst lb = new Leaderboard(100, 3); // max 100 pts/min, top 3\nlb.startSession(\u0027p1\u0027, \u0027s1\u0027, 0);\nlb.startSession(\u0027p2\u0027, \u0027s2\u0027, 0);\nlb.startSession(\u0027p3\u0027, \u0027s3\u0027, 0);\n\n// Normal submission: 200 pts in 5 min = 40/min, OK\nconst r1 = lb.submitScore(\u0027p1\u0027, \u0027s1\u0027, 200, 300);\nassert.strictEqual(r1.success, true);\nassert.strictEqual(r1.entry!.flagged, false);\nassert.strictEqual(r1.rank, 1);\n\n// Suspicious: 500 pts in 1 min = 500/min \u003e 100\nconst r2 = lb.submitScore(\u0027p2\u0027, \u0027s2\u0027, 500, 60);\nassert.strictEqual(r2.entry!.flagged, true);\nassert.strictEqual(r2.rank, undefined); // flagged, no rank\n\n// p3 normal\nconst r3 = lb.submitScore(\u0027p3\u0027, \u0027s3\u0027, 150, 600);\nassert.strictEqual(r3.rank, 2); // behind p1\u0027s 200\n\nconsole.log(\u0027Task 35 suffix passed\u0027);\n","assertions":"// Score not improved\nconst r4 = lb.submitScore(\u0027p1\u0027, \u0027s1\u0027, 150, 400);\nassert.strictEqual(r4.success, false);\nassert.strictEqual(r4.reason, \u0027score_not_improved\u0027);\n\n// Score improved replaces\nconst r5 = lb.submitScore(\u0027p1\u0027, \u0027s1\u0027, 250, 600);\nassert.strictEqual(r5.success, true);\nassert.strictEqual(r5.rank, 1);\nassert.strictEqual(r5.entry!.score, 250);\n// Only one entry per player\nassert.strictEqual(lb.entries.filter(e =\u003e e.playerId === \u0027p1\u0027).length, 1);\n\n// Top 3 excludes flagged\nconst topEntries = lb.getTopN();\nassert.strictEqual(topEntries.length, 2); // p1(250) and p3(150), p2 flagged\nassert.strictEqual(topEntries[0].playerId, \u0027p1\u0027);\nassert.strictEqual(topEntries[1].playerId, \u0027p3\u0027);\n\n// Invalid session\nconst r6 = lb.submitScore(\u0027p1\u0027, \u0027s2\u0027, 300, 700); // s2 belongs to p2\nassert.strictEqual(r6.reason, \u0027invalid_session\u0027);\n\n// Invalid timestamp\nconst r7 = lb.submitScore(\u0027p3\u0027, \u0027s3\u0027, 300, 0); // same as start\nassert.strictEqual(r7.reason, \u0027invalid_timestamp\u0027);\n\nconsole.log(\u0027Task 35 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"36","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Player {\n id: string;\n elo: number;\n partyId: string | null;\n queuedAt: number;\n}\n\ninterface MatchResult {\n matched: boolean;\n teams?: [string[], string[]];\n avgElo?: [number, number];\n reason?: string;\n}\n\nclass MatchmakingQueue {\n queue: Player[] = [];\n teamSize: number;\n eloRange: number; // initial acceptable elo difference\n eloExpansionRate: number; // elo range expands by this per minute waited\n maxEloRange: number;\n\n constructor(teamSize: number, eloRange: number, eloExpansionRate: number, maxEloRange: number) {\n this.teamSize = teamSize;\n this.eloRange = eloRange;\n this.eloExpansionRate = eloExpansionRate;\n this.maxEloRange = maxEloRange;\n }\n\n enqueue(player: Player): { success: boolean; reason?: string } {\n if (this.queue.find(p =\u003e p.id === player.id)) {\n return { success: false, reason: \u0027already_queued\u0027 };\n }\n this.queue.push(player);\n return { success: true };\n }\n\n // Try to form a match at time `now`.\n // Rules:\n // 1. For each player, effectiveRange = eloRange + eloExpansionRate * (now - queuedAt) / 60,\n // capped at maxEloRange.\n // 2. Two players are \"compatible\" if BOTH players\u0027 effectiveRange covers the other\u0027s elo.\n // i.e. |p1.elo - p2.elo| \u003c= min(p1.effectiveRange, p2.effectiveRange).\n // 3. Players in the same party MUST be on the same team.\n // 4. Find two groups of `teamSize` players where all cross-team pairs are compatible.\n // Use greedy: sort queue by elo, slide a window of 2*teamSize, check compatibility.\n // 5. Split window into two teams: first `teamSize` = team1, rest = team2.\n // But if party constraint forces regrouping, move party members together.\n // 6. Remove matched players from queue.\n","golden_completion":" tryMatch(now: number): MatchResult {\n if (this.queue.length \u003c this.teamSize * 2) {\n return { matched: false, reason: \u0027not_enough_players\u0027 };\n }\n\n // Compute effective ranges\n const withRange = this.queue.map(p =\u003e ({\n ...p,\n effectiveRange: Math.min(\n this.eloRange + this.eloExpansionRate * (now - p.queuedAt) / 60,\n this.maxEloRange\n ),\n }));\n\n // Sort by elo\n withRange.sort((a, b) =\u003e a.elo - b.elo);\n\n const windowSize = this.teamSize * 2;\n\n for (let i = 0; i \u003c= withRange.length - windowSize; i++) {\n const window = withRange.slice(i, i + windowSize);\n\n // Check all cross-team compatibility\n let compatible = true;\n for (let a = 0; a \u003c window.length \u0026\u0026 compatible; a++) {\n for (let b = a + 1; b \u003c window.length \u0026\u0026 compatible; b++) {\n const diff = Math.abs(window[a].elo - window[b].elo);\n const minRange = Math.min(window[a].effectiveRange, window[b].effectiveRange);\n if (diff \u003e minRange) compatible = false;\n }\n }\n if (!compatible) continue;\n\n // Split into teams respecting party constraints\n let team1: typeof window = [];\n let team2: typeof window = [];\n const assigned = new Set\u003cstring\u003e();\n\n // First pass: assign parties\n for (const p of window) {\n if (p.partyId \u0026\u0026 !assigned.has(p.id)) {\n const partyMembers = window.filter(q =\u003e q.partyId === p.partyId);\n const target = team1.length + partyMembers.length \u003c= this.teamSize ? team1 : team2;\n if (target.length + partyMembers.length \u003e this.teamSize) {\n compatible = false;\n break;\n }\n for (const m of partyMembers) {\n target.push(m);\n assigned.add(m.id);\n }\n }\n }\n if (!compatible) continue;\n\n // Second pass: assign remaining\n for (const p of window) {\n if (!assigned.has(p.id)) {\n if (team1.length \u003c this.teamSize) team1.push(p);\n else team2.push(p);\n }\n }\n\n if (team1.length !== this.teamSize || team2.length !== this.teamSize) continue;\n\n // Remove from queue\n const matchedIds = new Set(window.map(p =\u003e p.id));\n this.queue = this.queue.filter(p =\u003e !matchedIds.has(p.id));\n\n const avg1 = Math.round(team1.reduce((s, p) =\u003e s + p.elo, 0) / team1.length);\n const avg2 = Math.round(team2.reduce((s, p) =\u003e s + p.elo, 0) / team2.length);\n\n return {\n matched: true,\n teams: [team1.map(p =\u003e p.id), team2.map(p =\u003e p.id)],\n avgElo: [avg1, avg2],\n };\n }\n\n return { matched: false, reason: \u0027no_compatible_group\u0027 };\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst mm = new MatchmakingQueue(2, 50, 10, 200); // 2v2, range 50, +10/min, max 200\n\nmm.enqueue({ id: \u0027a\u0027, elo: 1000, partyId: null, queuedAt: 0 });\nmm.enqueue({ id: \u0027b\u0027, elo: 1020, partyId: null, queuedAt: 0 });\nmm.enqueue({ id: \u0027c\u0027, elo: 1040, partyId: null, queuedAt: 0 });\nmm.enqueue({ id: \u0027d\u0027, elo: 1050, partyId: null, queuedAt: 0 });\n\nconst m1 = mm.tryMatch(0);\nassert.strictEqual(m1.matched, true);\nassert.strictEqual(m1.teams![0].length, 2);\nassert.strictEqual(m1.teams![1].length, 2);\nassert.strictEqual(mm.queue.length, 0);\n\nconsole.log(\u0027Task 36 suffix passed\u0027);\n","assertions":"// Incompatible: two clusters too far apart at time 0\nconst mm3 = new MatchmakingQueue(2, 30, 5, 300);\nmm3.enqueue({ id: \u0027p1\u0027, elo: 1000, partyId: null, queuedAt: 0 });\nmm3.enqueue({ id: \u0027p2\u0027, elo: 1010, partyId: null, queuedAt: 0 });\nmm3.enqueue({ id: \u0027p3\u0027, elo: 1200, partyId: null, queuedAt: 0 });\nmm3.enqueue({ id: \u0027p4\u0027, elo: 1210, partyId: null, queuedAt: 0 });\n\nconst m3 = mm3.tryMatch(0);\nassert.strictEqual(m3.matched, false);\nassert.strictEqual(m3.reason, \u0027no_compatible_group\u0027);\n\n// After waiting, range expands: need 30 + 5*(t/60) \u003e= 210 (max diff is 210)\n// At t=2520: range = 30 + 5*42 = 240 \u003e= 210. maxEloRange=300, so not capped.\nconst m4 = mm3.tryMatch(2520);\nassert.strictEqual(m4.matched, true);\n\n// Not enough players\nconst mm5 = new MatchmakingQueue(2, 100, 0, 100);\nmm5.enqueue({ id: \u0027solo\u0027, elo: 1000, partyId: null, queuedAt: 0 });\nconst mSolo = mm5.tryMatch(0);\nassert.strictEqual(mSolo.matched, false);\nassert.strictEqual(mSolo.reason, \u0027not_enough_players\u0027);\n\n// Party constraint\nconst mm4 = new MatchmakingQueue(2, 100, 0, 100);\nmm4.enqueue({ id: \u0027a1\u0027, elo: 1000, partyId: \u0027party1\u0027, queuedAt: 0 });\nmm4.enqueue({ id: \u0027a2\u0027, elo: 1020, partyId: \u0027party1\u0027, queuedAt: 0 });\nmm4.enqueue({ id: \u0027b1\u0027, elo: 1010, partyId: null, queuedAt: 0 });\nmm4.enqueue({ id: \u0027b2\u0027, elo: 1030, partyId: null, queuedAt: 0 });\n\nconst m5 = mm4.tryMatch(0);\nassert.strictEqual(m5.matched, true);\n// a1 and a2 must be on same team\nconst t1 = m5.teams![0];\nconst a1InTeam0 = t1.includes(\u0027a1\u0027);\nconst a2InTeam0 = t1.includes(\u0027a2\u0027);\nassert.strictEqual(a1InTeam0, a2InTeam0); // same team\n\n// Already queued\nmm4.enqueue({ id: \u0027c1\u0027, elo: 1000, partyId: null, queuedAt: 0 });\nconst dup = mm4.enqueue({ id: \u0027c1\u0027, elo: 1000, partyId: null, queuedAt: 0 });\nassert.strictEqual(dup.success, false);\nassert.strictEqual(dup.reason, \u0027already_queued\u0027);\n\nconsole.log(\u0027Task 36 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"37","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface NotificationPrefs {\n channels: Set\u003cstring\u003e; // \u0027email\u0027 | \u0027sms\u0027 | \u0027push\u0027\n quietHoursStart: number; // hour 0-23\n quietHoursEnd: number; // hour 0-23 (wraps around midnight)\n maxPerHour: number;\n}\n\ninterface AppNotification {\n id: string;\n channel: string;\n priority: \u0027low\u0027 | \u0027medium\u0027 | \u0027high\u0027 | \u0027critical\u0027;\n message: string;\n timestamp: number; // unix timestamp (seconds)\n}\n\ninterface DeliveryResult {\n delivered: boolean;\n reason?: string;\n batched?: boolean;\n batchId?: string;\n}\n\nclass NotificationService {\n prefs: Map\u003cstring, NotificationPrefs\u003e = new Map();\n deliveryLog: Map\u003cstring, AppNotification[]\u003e = new Map(); // userId -\u003e delivered notifs\n batchQueue: Map\u003cstring, AppNotification[]\u003e = new Map(); // batchKey -\u003e queued notifs\n\n setPreferences(userId: string, prefs: NotificationPrefs): void {\n this.prefs.set(userId, prefs);\n this.deliveryLog.set(userId, []);\n }\n\n _getHour(timestamp: number): number {\n return new Date(timestamp * 1000).getUTCHours();\n }\n\n _isQuietHour(hour: number, start: number, end: number): boolean {\n if (start \u003c= end) return hour \u003e= start \u0026\u0026 hour \u003c end;\n return hour \u003e= start || hour \u003c end; // wraps midnight\n }\n\n // Send notification to user. Rules:\n // 1. User must have prefs, else \u0027unknown_user\u0027.\n // 2. Channel must be in user\u0027s enabled channels, else \u0027channel_disabled\u0027.\n // 3. If quiet hours and priority != \u0027critical\u0027: batch it (don\u0027t deliver now).\n // Batch key = `${userId}:${channel}`. Return batched=true.\n // 4. Count deliveries in the same hour. If \u003e= maxPerHour and priority != \u0027critical\u0027:\n // batch it. Return batched=true.\n // 5. Critical priority always delivers immediately (bypasses quiet hours + throttle).\n // 6. On delivery: add to deliveryLog, return delivered=true.\n","golden_completion":" send(userId: string, notif: AppNotification): DeliveryResult {\n const prefs = this.prefs.get(userId);\n if (!prefs) return { delivered: false, reason: \u0027unknown_user\u0027 };\n\n if (!prefs.channels.has(notif.channel)) {\n return { delivered: false, reason: \u0027channel_disabled\u0027 };\n }\n\n const hour = this._getHour(notif.timestamp);\n const isQuiet = this._isQuietHour(hour, prefs.quietHoursStart, prefs.quietHoursEnd);\n const batchKey = `${userId}:${notif.channel}`;\n\n // Critical bypasses everything\n if (notif.priority !== \u0027critical\u0027) {\n if (isQuiet) {\n if (!this.batchQueue.has(batchKey)) this.batchQueue.set(batchKey, []);\n this.batchQueue.get(batchKey)!.push(notif);\n return { delivered: false, batched: true, batchId: batchKey, reason: \u0027quiet_hours\u0027 };\n }\n\n // Throttle check\n const log = this.deliveryLog.get(userId)!;\n const sameHourCount = log.filter(n =\u003e\n this._getHour(n.timestamp) === hour \u0026\u0026 n.channel === notif.channel\n ).length;\n if (sameHourCount \u003e= prefs.maxPerHour) {\n if (!this.batchQueue.has(batchKey)) this.batchQueue.set(batchKey, []);\n this.batchQueue.get(batchKey)!.push(notif);\n return { delivered: false, batched: true, batchId: batchKey, reason: \u0027throttled\u0027 };\n }\n }\n\n // Deliver\n this.deliveryLog.get(userId)!.push(notif);\n return { delivered: true };\n }\n\n flushBatch(batchKey: string): AppNotification[] {\n const batch = this.batchQueue.get(batchKey) || [];\n this.batchQueue.delete(batchKey);\n return batch;\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst ns = new NotificationService();\nns.setPreferences(\u0027u1\u0027, {\n channels: new Set([\u0027email\u0027, \u0027push\u0027]),\n quietHoursStart: 22,\n quietHoursEnd: 7, // 10pm - 7am\n maxPerHour: 2,\n});\n\n// Normal delivery (noon = hour 12)\nconst r1 = ns.send(\u0027u1\u0027, { id: \u0027n1\u0027, channel: \u0027email\u0027, priority: \u0027medium\u0027, message: \u0027hi\u0027, timestamp: 43200 });\nassert.strictEqual(r1.delivered, true);\n\n// Disabled channel\nconst r2 = ns.send(\u0027u1\u0027, { id: \u0027n2\u0027, channel: \u0027sms\u0027, priority: \u0027high\u0027, message: \u0027hi\u0027, timestamp: 43200 });\nassert.strictEqual(r2.reason, \u0027channel_disabled\u0027);\n\nconsole.log(\u0027Task 37 suffix passed\u0027);\n","assertions":"// Quiet hours (23:00 UTC = 82800 seconds)\nconst r3 = ns.send(\u0027u1\u0027, { id: \u0027n3\u0027, channel: \u0027email\u0027, priority: \u0027medium\u0027, message: \u0027late\u0027, timestamp: 82800 });\nassert.strictEqual(r3.delivered, false);\nassert.strictEqual(r3.batched, true);\nassert.strictEqual(r3.reason, \u0027quiet_hours\u0027);\n\n// Critical bypasses quiet hours\nconst r4 = ns.send(\u0027u1\u0027, { id: \u0027n4\u0027, channel: \u0027email\u0027, priority: \u0027critical\u0027, message: \u0027urgent\u0027, timestamp: 82800 });\nassert.strictEqual(r4.delivered, true);\n\n// Throttle: send 2 more in same hour (12:xx)\nconst r5 = ns.send(\u0027u1\u0027, { id: \u0027n5\u0027, channel: \u0027email\u0027, priority: \u0027low\u0027, message: \u0027m2\u0027, timestamp: 43300 });\nassert.strictEqual(r5.delivered, true);\n// Now 2 delivered in hour 12 (n1 + n5), next should throttle\nconst r6 = ns.send(\u0027u1\u0027, { id: \u0027n6\u0027, channel: \u0027email\u0027, priority: \u0027low\u0027, message: \u0027m3\u0027, timestamp: 43400 });\nassert.strictEqual(r6.delivered, false);\nassert.strictEqual(r6.reason, \u0027throttled\u0027);\n\n// Critical bypasses throttle\nconst r7 = ns.send(\u0027u1\u0027, { id: \u0027n7\u0027, channel: \u0027email\u0027, priority: \u0027critical\u0027, message: \u0027urgent2\u0027, timestamp: 43500 });\nassert.strictEqual(r7.delivered, true);\n\n// Flush batch\nconst batch = ns.flushBatch(\u0027u1:email\u0027);\nassert.strictEqual(batch.length, 2); // n3 (quiet) + n6 (throttled)\n\n// Unknown user\nconst r8 = ns.send(\u0027unknown\u0027, { id: \u0027n8\u0027, channel: \u0027email\u0027, priority: \u0027low\u0027, message: \u0027x\u0027, timestamp: 0 });\nassert.strictEqual(r8.reason, \u0027unknown_user\u0027);\n\n// Quiet hours wrapping midnight: 22-7, hour 6 should be quiet\nconst r9 = ns.send(\u0027u1\u0027, { id: \u0027n9\u0027, channel: \u0027push\u0027, priority: \u0027low\u0027, message: \u0027early\u0027, timestamp: 21600 }); // 6am UTC\nassert.strictEqual(r9.delivered, false);\nassert.strictEqual(r9.reason, \u0027quiet_hours\u0027);\n\nconsole.log(\u0027Task 37 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"38","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Alert {\n id: string;\n severity: \u0027info\u0027 | \u0027warning\u0027 | \u0027error\u0027 | \u0027critical\u0027;\n source: string;\n message: string;\n timestamp: number;\n}\n\ninterface EscalationState {\n alertId: string;\n currentLevel: number; // 0=initial, 1=team_lead, 2=manager, 3=director\n acknowledged: boolean;\n acknowledgedBy?: string;\n acknowledgedAt?: number;\n escalatedAt: number[]; // timestamps of each escalation\n suppressed: boolean;\n}\n\nclass AlertManager {\n states: Map\u003cstring, EscalationState\u003e = new Map();\n cooldownSeconds: number; // min time between escalations\n autoEscalateAfter: number; // seconds without ack before auto-escalate\n maxLevel: number;\n severityLevels: Record\u003cstring, number\u003e = { \u0027info\u0027: 0, \u0027warning\u0027: 1, \u0027error\u0027: 2, \u0027critical\u0027: 3 };\n\n // Repeated alerts from same source within suppressWindow are suppressed\n suppressWindow: number;\n recentAlerts: Map\u003cstring, number\u003e = new Map(); // source -\u003e last alert timestamp\n\n constructor(cooldownSeconds: number, autoEscalateAfter: number, suppressWindow: number) {\n this.cooldownSeconds = cooldownSeconds;\n this.autoEscalateAfter = autoEscalateAfter;\n this.maxLevel = 3;\n this.suppressWindow = suppressWindow;\n }\n\n // Receive alert. Rules:\n // 1. If same source sent alert within suppressWindow, suppress (unless critical).\n // 2. Critical alerts start at level 2 (skip team_lead). Others start at 0.\n // 3. Create escalation state, record timestamp.\n // 4. Return {created: true, level, suppressed: false} or {created: false, suppressed: true}.\n //\n // Acknowledge alert:\n // 1. Must exist and not already acknowledged.\n // 2. Set acknowledged, record who and when.\n // 3. Return new state.\n //\n // Check escalation at time `now`:\n // 1. For each unacknowledged alert: if now - last escalation \u003e= autoEscalateAfter,\n // AND now - last escalation \u003e= cooldownSeconds, escalate one level.\n // 2. If at maxLevel and unacknowledged, mark suppressed (can\u0027t escalate further).\n // 3. Return list of escalated alert IDs.\n","golden_completion":" receiveAlert(alert: Alert): { created: boolean; level?: number; suppressed: boolean } {\n const lastTime = this.recentAlerts.get(alert.source);\n if (lastTime !== undefined \u0026\u0026 alert.timestamp - lastTime \u003c this.suppressWindow) {\n if (alert.severity !== \u0027critical\u0027) {\n return { created: false, suppressed: true };\n }\n }\n this.recentAlerts.set(alert.source, alert.timestamp);\n\n const startLevel = alert.severity === \u0027critical\u0027 ? 2 : 0;\n const state: EscalationState = {\n alertId: alert.id,\n currentLevel: startLevel,\n acknowledged: false,\n escalatedAt: [alert.timestamp],\n suppressed: false,\n };\n this.states.set(alert.id, state);\n return { created: true, level: startLevel, suppressed: false };\n }\n\n acknowledge(alertId: string, by: string, at: number): { success: boolean; reason?: string } {\n const state = this.states.get(alertId);\n if (!state) return { success: false, reason: \u0027not_found\u0027 };\n if (state.acknowledged) return { success: false, reason: \u0027already_acknowledged\u0027 };\n state.acknowledged = true;\n state.acknowledgedBy = by;\n state.acknowledgedAt = at;\n return { success: true };\n }\n\n checkEscalations(now: number): string[] {\n const escalated: string[] = [];\n for (const [id, state] of this.states) {\n if (state.acknowledged || state.suppressed) continue;\n const lastEsc = state.escalatedAt[state.escalatedAt.length - 1];\n if (now - lastEsc \u003e= this.autoEscalateAfter \u0026\u0026 now - lastEsc \u003e= this.cooldownSeconds) {\n if (state.currentLevel \u003e= this.maxLevel) {\n state.suppressed = true;\n } else {\n state.currentLevel++;\n state.escalatedAt.push(now);\n escalated.push(id);\n }\n }\n }\n return escalated;\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst am = new AlertManager(60, 120, 30); // 60s cooldown, 120s auto-escalate, 30s suppress\n\n// Normal alert\nconst a1 = am.receiveAlert({ id: \u0027a1\u0027, severity: \u0027warning\u0027, source: \u0027cpu\u0027, message: \u0027high\u0027, timestamp: 100 });\nassert.strictEqual(a1.created, true);\nassert.strictEqual(a1.level, 0);\n\n// Same source within window: suppressed\nconst a2 = am.receiveAlert({ id: \u0027a2\u0027, severity: \u0027warning\u0027, source: \u0027cpu\u0027, message: \u0027still high\u0027, timestamp: 120 });\nassert.strictEqual(a2.suppressed, true);\n\n// Critical bypasses suppression\nconst a3 = am.receiveAlert({ id: \u0027a3\u0027, severity: \u0027critical\u0027, source: \u0027cpu\u0027, message: \u0027crash\u0027, timestamp: 125 });\nassert.strictEqual(a3.created, true);\nassert.strictEqual(a3.level, 2); // critical starts at level 2\n\nconsole.log(\u0027Task 38 suffix passed\u0027);\n","assertions":"// Auto-escalate after 120s: a1 created at 100, check at 220\n// a3 created at 125 with level 2, 220-125=95 \u003c 120 so a3 won\u0027t escalate yet\nconst esc1 = am.checkEscalations(220);\nassert.ok(esc1.includes(\u0027a1\u0027));\nassert.strictEqual(am.states.get(\u0027a1\u0027)!.currentLevel, 1);\nassert.ok(!esc1.includes(\u0027a3\u0027)); // not enough time for a3\n\n// Cooldown: can\u0027t escalate again at 221 (only 1s since last)\nconst esc2 = am.checkEscalations(221);\nassert.strictEqual(esc2.length, 0);\n\n// At 250, a3 elapsed = 250-125 = 125 \u003e= 120, escalate a3 to level 3\n// a1 elapsed from last = 250-220 = 30 \u003c 120, no escalation for a1\nconst esc3 = am.checkEscalations(250);\nassert.ok(esc3.includes(\u0027a3\u0027));\nassert.strictEqual(am.states.get(\u0027a3\u0027)!.currentLevel, 3);\nassert.ok(!esc3.includes(\u0027a1\u0027));\n\n// a3 at max level (3), next check suppresses it\nconst esc4 = am.checkEscalations(400);\nassert.ok(!esc4.includes(\u0027a3\u0027)); // doesn\u0027t \"escalate\", just suppresses\nassert.strictEqual(am.states.get(\u0027a3\u0027)!.suppressed, true);\n\n// a1 at time 400: 400-220 = 180 \u003e= 120, escalate to level 2\nassert.ok(esc4.includes(\u0027a1\u0027));\nassert.strictEqual(am.states.get(\u0027a1\u0027)!.currentLevel, 2);\n\n// Acknowledge a1\nconst ack = am.acknowledge(\u0027a1\u0027, \u0027admin\u0027, 401);\nassert.strictEqual(ack.success, true);\n\n// No more escalation after ack\nconst esc5 = am.checkEscalations(600);\nassert.ok(!esc5.includes(\u0027a1\u0027));\n\n// Double acknowledge fails\nconst ack2 = am.acknowledge(\u0027a1\u0027, \u0027admin2\u0027, 402);\nassert.strictEqual(ack2.reason, \u0027already_acknowledged\u0027);\n\n// Different source after window passes\nconst a4 = am.receiveAlert({ id: \u0027a4\u0027, severity: \u0027error\u0027, source: \u0027cpu\u0027, message: \u0027new\u0027, timestamp: 200 });\nassert.strictEqual(a4.created, true); // 200 - 125 = 75 \u003e 30 suppress window\n\nconsole.log(\u0027Task 38 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"39","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Permission {\n resource: string;\n action: string; // \u0027read\u0027 | \u0027write\u0027 | \u0027delete\u0027 | \u0027admin\u0027\n}\n\ninterface Role {\n name: string;\n permissions: Permission[];\n inherits: string[]; // parent role names\n}\n\nclass RBACManager {\n roles: Map\u003cstring, Role\u003e = new Map();\n userRoles: Map\u003cstring, Set\u003cstring\u003e\u003e = new Map(); // userId -\u003e set of role names\n overrides: Map\u003cstring, Permission[]\u003e = new Map(); // userId -\u003e explicit denies\n\n addRole(name: string, permissions: Permission[], inherits: string[] = []): void {\n this.roles.set(name, { name, permissions, inherits });\n }\n\n assignRole(userId: string, roleName: string): { success: boolean; reason?: string } {\n if (!this.roles.has(roleName)) return { success: false, reason: \u0027role_not_found\u0027 };\n if (!this.userRoles.has(userId)) this.userRoles.set(userId, new Set());\n this.userRoles.get(userId)!.add(roleName);\n return { success: true };\n }\n\n addDeny(userId: string, permission: Permission): void {\n if (!this.overrides.has(userId)) this.overrides.set(userId, []);\n this.overrides.get(userId)!.push(permission);\n }\n\n // Get ALL permissions for a role, including inherited (recursive, no cycles assumed).\n // If a role inherits from multiple parents, union all permissions.\n // Admin action on a resource implies read+write+delete on that resource.\n //\n // Check access: userId, resource, action.\n // 1. Collect all permissions from all user\u0027s roles (including inherited).\n // 2. Check explicit denies — if denied, ALWAYS reject (deny overrides allow).\n // 3. Check if any permission grants the action on the resource.\n // 4. Wildcard: resource=\u0027*\u0027 means all resources. action=\u0027admin\u0027 implies all actions.\n // 5. Return {allowed, via: roleName that granted, denied?: true}.\n","golden_completion":" _getAllPermissions(roleName: string, visited: Set\u003cstring\u003e = new Set()): Permission[] {\n if (visited.has(roleName)) return [];\n visited.add(roleName);\n const role = this.roles.get(roleName);\n if (!role) return [];\n\n const perms = [...role.permissions];\n for (const parent of role.inherits) {\n perms.push(...this._getAllPermissions(parent, visited));\n }\n return perms;\n }\n\n _permissionMatches(perm: Permission, resource: string, action: string): boolean {\n const resourceMatch = perm.resource === \u0027*\u0027 || perm.resource === resource;\n if (!resourceMatch) return false;\n\n if (perm.action === \u0027admin\u0027) return true; // admin implies all actions\n return perm.action === action;\n }\n\n checkAccess(userId: string, resource: string, action: string): { allowed: boolean; via?: string; denied?: boolean } {\n // Check denies first\n const denies = this.overrides.get(userId) || [];\n for (const deny of denies) {\n if (this._permissionMatches(deny, resource, action)) {\n return { allowed: false, denied: true };\n }\n }\n\n // Collect all permissions from all roles\n const roles = this.userRoles.get(userId);\n if (!roles) return { allowed: false };\n\n for (const roleName of roles) {\n const perms = this._getAllPermissions(roleName);\n for (const perm of perms) {\n if (this._permissionMatches(perm, resource, action)) {\n return { allowed: true, via: roleName };\n }\n }\n }\n\n return { allowed: false };\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst rbac = new RBACManager();\nrbac.addRole(\u0027viewer\u0027, [{ resource: \u0027docs\u0027, action: \u0027read\u0027 }]);\nrbac.addRole(\u0027editor\u0027, [{ resource: \u0027docs\u0027, action: \u0027write\u0027 }], [\u0027viewer\u0027]);\nrbac.addRole(\u0027admin\u0027, [{ resource: \u0027*\u0027, action: \u0027admin\u0027 }]);\n\nrbac.assignRole(\u0027alice\u0027, \u0027editor\u0027);\nrbac.assignRole(\u0027bob\u0027, \u0027viewer\u0027);\nrbac.assignRole(\u0027charlie\u0027, \u0027admin\u0027);\n\n// Editor inherits viewer\u0027s read\nconst r1 = rbac.checkAccess(\u0027alice\u0027, \u0027docs\u0027, \u0027read\u0027);\nassert.strictEqual(r1.allowed, true);\nassert.strictEqual(r1.via, \u0027editor\u0027);\n\n// Editor has own write\nconst r2 = rbac.checkAccess(\u0027alice\u0027, \u0027docs\u0027, \u0027write\u0027);\nassert.strictEqual(r2.allowed, true);\n\n// Viewer can\u0027t write\nconst r3 = rbac.checkAccess(\u0027bob\u0027, \u0027docs\u0027, \u0027write\u0027);\nassert.strictEqual(r3.allowed, false);\n\nconsole.log(\u0027Task 39 suffix passed\u0027);\n","assertions":"// Admin wildcard: admin on * implies everything\nconst r4 = rbac.checkAccess(\u0027charlie\u0027, \u0027docs\u0027, \u0027delete\u0027);\nassert.strictEqual(r4.allowed, true);\nconst r5 = rbac.checkAccess(\u0027charlie\u0027, \u0027servers\u0027, \u0027write\u0027);\nassert.strictEqual(r5.allowed, true);\n\n// Explicit deny overrides role grant\nrbac.addDeny(\u0027charlie\u0027, { resource: \u0027secrets\u0027, action: \u0027read\u0027 });\nconst r6 = rbac.checkAccess(\u0027charlie\u0027, \u0027secrets\u0027, \u0027read\u0027);\nassert.strictEqual(r6.allowed, false);\nassert.strictEqual(r6.denied, true);\n\n// But admin still works on other resources\nconst r7 = rbac.checkAccess(\u0027charlie\u0027, \u0027docs\u0027, \u0027read\u0027);\nassert.strictEqual(r7.allowed, true);\n\n// Multi-level inheritance\nrbac.addRole(\u0027superadmin\u0027, [{ resource: \u0027billing\u0027, action: \u0027admin\u0027 }], [\u0027admin\u0027]);\nrbac.assignRole(\u0027dave\u0027, \u0027superadmin\u0027);\nconst r8 = rbac.checkAccess(\u0027dave\u0027, \u0027docs\u0027, \u0027write\u0027);\nassert.strictEqual(r8.allowed, true); // inherited through admin\n\n// Unknown role assignment\nconst r9 = rbac.assignRole(\u0027eve\u0027, \u0027nonexistent\u0027);\nassert.strictEqual(r9.reason, \u0027role_not_found\u0027);\n\n// No roles = no access\nconst r10 = rbac.checkAccess(\u0027eve\u0027, \u0027docs\u0027, \u0027read\u0027);\nassert.strictEqual(r10.allowed, false);\n\n// Deny with wildcard\nrbac.addDeny(\u0027alice\u0027, { resource: \u0027*\u0027, action: \u0027delete\u0027 });\nconst r11 = rbac.checkAccess(\u0027alice\u0027, \u0027docs\u0027, \u0027delete\u0027);\nassert.strictEqual(r11.allowed, false);\nassert.strictEqual(r11.denied, true);\n\nconsole.log(\u0027Task 39 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"40","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface RateLimitTier {\n name: string;\n requestsPerMinute: number;\n requestsPerHour: number;\n burstSize: number; // max requests in any 5-second window\n}\n\ninterface RequestLog {\n timestamp: number; // unix seconds\n endpoint: string;\n allowed: boolean;\n}\n\nclass APIRateLimiter {\n tiers: Map\u003cstring, RateLimitTier\u003e = new Map();\n clientTiers: Map\u003cstring, string\u003e = new Map(); // clientId -\u003e tierName\n requestLogs: Map\u003cstring, RequestLog[]\u003e = new Map(); // clientId -\u003e logs\n\n addTier(tier: RateLimitTier): void {\n this.tiers.set(tier.name, tier);\n }\n\n registerClient(clientId: string, tierName: string): { success: boolean; reason?: string } {\n if (!this.tiers.has(tierName)) return { success: false, reason: \u0027tier_not_found\u0027 };\n this.clientTiers.set(clientId, tierName);\n this.requestLogs.set(clientId, []);\n return { success: true };\n }\n\n // Check if request is allowed. Three limits checked IN ORDER:\n // 1. Burst: count requests in [now-5, now]. If \u003e= burstSize, reject \u0027burst_exceeded\u0027.\n // 2. Per-minute: count requests in [now-60, now]. If \u003e= requestsPerMinute, reject \u0027minute_exceeded\u0027.\n // 3. Per-hour: count requests in [now-3600, now]. If \u003e= requestsPerHour, reject \u0027hour_exceeded\u0027.\n // 4. Only count previously ALLOWED requests toward limits.\n // 5. Log the request (allowed or not) but rejected requests do NOT count toward future limits.\n // 6. Return {allowed, remaining: {burst, minute, hour}, retryAfter?}.\n // retryAfter = seconds until the oldest relevant request expires from the window.\n","golden_completion":" checkRequest(clientId: string, endpoint: string, now: number): {\n allowed: boolean;\n reason?: string;\n remaining?: { burst: number; minute: number; hour: number };\n retryAfter?: number;\n } {\n const tierName = this.clientTiers.get(clientId);\n if (!tierName) return { allowed: false, reason: \u0027unknown_client\u0027 };\n const tier = this.tiers.get(tierName)!;\n const logs = this.requestLogs.get(clientId)!;\n\n // Count only allowed requests in each window\n const allowedLogs = logs.filter(l =\u003e l.allowed);\n const burstCount = allowedLogs.filter(l =\u003e l.timestamp \u003e now - 5).length;\n const minuteCount = allowedLogs.filter(l =\u003e l.timestamp \u003e now - 60).length;\n const hourCount = allowedLogs.filter(l =\u003e l.timestamp \u003e now - 3600).length;\n\n let reason: string | undefined;\n let retryAfter: number | undefined;\n\n if (burstCount \u003e= tier.burstSize) {\n reason = \u0027burst_exceeded\u0027;\n const oldest = allowedLogs.filter(l =\u003e l.timestamp \u003e now - 5)\n .sort((a, b) =\u003e a.timestamp - b.timestamp)[0];\n retryAfter = oldest ? (oldest.timestamp + 5) - now : 5;\n } else if (minuteCount \u003e= tier.requestsPerMinute) {\n reason = \u0027minute_exceeded\u0027;\n const oldest = allowedLogs.filter(l =\u003e l.timestamp \u003e now - 60)\n .sort((a, b) =\u003e a.timestamp - b.timestamp)[0];\n retryAfter = oldest ? (oldest.timestamp + 60) - now : 60;\n } else if (hourCount \u003e= tier.requestsPerHour) {\n reason = \u0027hour_exceeded\u0027;\n const oldest = allowedLogs.filter(l =\u003e l.timestamp \u003e now - 3600)\n .sort((a, b) =\u003e a.timestamp - b.timestamp)[0];\n retryAfter = oldest ? (oldest.timestamp + 3600) - now : 3600;\n }\n\n const allowed = !reason;\n logs.push({ timestamp: now, endpoint, allowed });\n\n if (allowed) {\n return {\n allowed: true,\n remaining: {\n burst: tier.burstSize - burstCount - 1,\n minute: tier.requestsPerMinute - minuteCount - 1,\n hour: tier.requestsPerHour - hourCount - 1,\n },\n };\n }\n\n return { allowed: false, reason, retryAfter };\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n\nconst rl = new APIRateLimiter();\nrl.addTier({ name: \u0027basic\u0027, requestsPerMinute: 5, requestsPerHour: 20, burstSize: 3 });\nrl.registerClient(\u0027c1\u0027, \u0027basic\u0027);\n\n// 3 requests in burst window\nconst r1 = rl.checkRequest(\u0027c1\u0027, \u0027/api/data\u0027, 1000);\nassert.strictEqual(r1.allowed, true);\nassert.strictEqual(r1.remaining!.burst, 2);\n\nconst r2 = rl.checkRequest(\u0027c1\u0027, \u0027/api/data\u0027, 1001);\nassert.strictEqual(r2.remaining!.burst, 1);\n\nconst r3 = rl.checkRequest(\u0027c1\u0027, \u0027/api/data\u0027, 1002);\nassert.strictEqual(r3.remaining!.burst, 0);\n\n// 4th in burst window: rejected\nconst r4 = rl.checkRequest(\u0027c1\u0027, \u0027/api/data\u0027, 1003);\nassert.strictEqual(r4.allowed, false);\nassert.strictEqual(r4.reason, \u0027burst_exceeded\u0027);\n\nconsole.log(\u0027Task 40 suffix passed\u0027);\n","assertions":"// Rejected request does NOT count toward limits\n// After burst window expires (t \u003e 1005), burst resets\nconst r5 = rl.checkRequest(\u0027c1\u0027, \u0027/api/data\u0027, 1006);\nassert.strictEqual(r5.allowed, true);\nassert.strictEqual(r5.remaining!.minute, 1); // 4 allowed so far (r1,r2,r3,r5), limit 5\n\n// Fill minute quota\nconst r6 = rl.checkRequest(\u0027c1\u0027, \u0027/api/data\u0027, 1010);\nassert.strictEqual(r6.allowed, true);\nassert.strictEqual(r6.remaining!.minute, 0);\n\nconst r7 = rl.checkRequest(\u0027c1\u0027, \u0027/api/data\u0027, 1015);\nassert.strictEqual(r7.allowed, false);\nassert.strictEqual(r7.reason, \u0027minute_exceeded\u0027);\nassert.ok(r7.retryAfter! \u003e 0); // time until oldest expires\n\n// retryAfter calculation: oldest allowed in minute window is r1 at 1000, expires at 1060\nassert.strictEqual(r7.retryAfter, 1060 - 1015); // 45 seconds\n\n// After minute window slides, can send again\nconst r8 = rl.checkRequest(\u0027c1\u0027, \u0027/api/data\u0027, 1061);\nassert.strictEqual(r8.allowed, true);\n\n// Unknown client\nconst r9 = rl.checkRequest(\u0027unknown\u0027, \u0027/api\u0027, 0);\nassert.strictEqual(r9.reason, \u0027unknown_client\u0027);\n\n// Hour limit\nconst rl2 = new APIRateLimiter();\nrl2.addTier({ name: \u0027strict\u0027, requestsPerMinute: 100, requestsPerHour: 5, burstSize: 100 });\nrl2.registerClient(\u0027c2\u0027, \u0027strict\u0027);\nfor (let i = 0; i \u003c 5; i++) {\n const r = rl2.checkRequest(\u0027c2\u0027, \u0027/api\u0027, 10000 + i * 100);\n assert.strictEqual(r.allowed, true);\n}\nconst rHour = rl2.checkRequest(\u0027c2\u0027, \u0027/api\u0027, 10500);\nassert.strictEqual(rHour.reason, \u0027hour_exceeded\u0027);\n\nconsole.log(\u0027Task 40 assertions passed\u0027);\n","category":"code_purpose_understanding"} {"id":"41","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Evt { type: string; id: string; v: number; amt: number }\ninterface Acct { id: string; bal: number; frozen: boolean; v: number }\nclass Store {\n evts: Evt[] = [];\n append(e: Evt): boolean {\n const last = this.evts.filter(x =\u003e x.id === e.id);\n if (last.length \u003e 0 \u0026\u0026 last[last.length-1].v + 1 !== e.v) return false;\n if (last.length === 0 \u0026\u0026 e.v !== 1) return false;\n this.evts.push({...e}); return true;\n }\n","golden_completion":" project(id: string): Acct {\n const s: Acct = { id, bal: 0, frozen: false, v: 0 };\n for (const e of this.evts.filter(x =\u003e x.id === id)) {\n if (e.type === \u0027dep\u0027 \u0026\u0026 !s.frozen) s.bal += e.amt;\n else if (e.type === \u0027wd\u0027 \u0026\u0026 !s.frozen \u0026\u0026 s.bal \u003e= e.amt) s.bal -= e.amt;\n else if (e.type === \u0027freeze\u0027) s.frozen = true;\n else if (e.type === \u0027unfreeze\u0027) s.frozen = false;\n s.v = e.v;\n }\n return s;\n }\n","suffix":"}\nconst st = new Store();\nst.append({type:\u0027dep\u0027,id:\u0027a\u0027,v:1,amt:100});\nst.append({type:\u0027dep\u0027,id:\u0027a\u0027,v:2,amt:50});\nst.append({type:\u0027wd\u0027,id:\u0027a\u0027,v:3,amt:30});\nconst s1 = st.project(\u0027a\u0027);\nif (s1.bal !== 120) throw new Error(\u0027bal\u0027);\nif (s1.v !== 3) throw new Error(\u0027v\u0027);\n","assertions":"st.append({type:\u0027freeze\u0027,id:\u0027a\u0027,v:4,amt:0});\nst.append({type:\u0027dep\u0027,id:\u0027a\u0027,v:5,amt:999});\nconst s2 = st.project(\u0027a\u0027);\nif (s2.bal !== 120) throw new Error(\u0027frozen deposit\u0027);\nif (!s2.frozen) throw new Error(\u0027frozen\u0027);\nst.append({type:\u0027unfreeze\u0027,id:\u0027a\u0027,v:6,amt:0});\nst.append({type:\u0027wd\u0027,id:\u0027a\u0027,v:7,amt:200});\nconst s3 = st.project(\u0027a\u0027);\nif (s3.bal !== 120) throw new Error(\u0027overdraw\u0027);\nif (st.append({type:\u0027dep\u0027,id:\u0027a\u0027,v:5,amt:1})) throw new Error(\u0027bad ver\u0027);\nconst s4 = st.project(\u0027none\u0027);\nif (s4.bal!==0||s4.v!==0) throw new Error(\u0027empty proj\u0027);\n","category":"code_purpose_understanding"} {"id":"42","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Step { name: string; exec: () =\u003e boolean; comp: () =\u003e void }\ninterface SagaRes { ok: boolean; done: string[]; undone: string[]; failed: string | null }\nclass Saga {\n steps: Step[] = [];\n log: string[] = [];\n add(s: Step) { this.steps.push(s); }\n","golden_completion":" run(): SagaRes {\n const done: string[] = [];\n for (const s of this.steps) {\n if (s.exec()) {\n done.push(s.name);\n this.log.push(\u0027exec:\u0027 + s.name);\n } else {\n this.log.push(\u0027fail:\u0027 + s.name);\n const undone: string[] = [];\n for (let i = done.length - 1; i \u003e= 0; i--) {\n this.steps.find(x =\u003e x.name === done[i])!.comp();\n undone.push(done[i]);\n this.log.push(\u0027comp:\u0027 + done[i]);\n }\n return { ok: false, done, undone, failed: s.name };\n }\n }\n return { ok: true, done, undone: [], failed: null };\n }\n","suffix":"}\nconst s1 = new Saga();\nconst o: string[] = [];\ns1.add({name:\u0027A\u0027,exec:()=\u003e(o.push(\u0027eA\u0027),true),comp:()=\u003eo.push(\u0027cA\u0027)});\ns1.add({name:\u0027B\u0027,exec:()=\u003e(o.push(\u0027eB\u0027),true),comp:()=\u003eo.push(\u0027cB\u0027)});\ns1.add({name:\u0027C\u0027,exec:()=\u003e(o.push(\u0027eC\u0027),true),comp:()=\u003eo.push(\u0027cC\u0027)});\nconst r1 = s1.run();\nif (!r1.ok || r1.done.length!==3) throw new Error(\u0027all pass\u0027);\n","assertions":"const s2 = new Saga();\nconst o2: string[] = [];\ns2.add({name:\u0027X\u0027,exec:()=\u003e(o2.push(\u0027eX\u0027),true),comp:()=\u003eo2.push(\u0027cX\u0027)});\ns2.add({name:\u0027Y\u0027,exec:()=\u003e(o2.push(\u0027eY\u0027),true),comp:()=\u003eo2.push(\u0027cY\u0027)});\ns2.add({name:\u0027Z\u0027,exec:()=\u003e(o2.push(\u0027eZ\u0027),false),comp:()=\u003eo2.push(\u0027cZ\u0027)});\nconst r2 = s2.run();\nif (r2.ok) throw new Error(\u0027fail\u0027);\nif (r2.failed!==\u0027Z\u0027) throw new Error(\u0027failAt\u0027);\nif (o2.join(\u0027,\u0027)!==\u0027eX,eY,eZ,cY,cX\u0027) throw new Error(\u0027order:\u0027+o2);\nif (r2.undone[0]!==\u0027Y\u0027||r2.undone[1]!==\u0027X\u0027) throw new Error(\u0027undone\u0027);\nif (s2.log.length!==5) throw new Error(\u0027log\u0027);\nconst s3 = new Saga();\ns3.add({name:\u0027Q\u0027,exec:()=\u003efalse,comp:()=\u003e{}});\nconst r3 = s3.run();\nif (r3.undone.length!==0) throw new Error(\u0027none\u0027);\n","category":"code_purpose_understanding"} {"id":"43","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"type Res = { ok: boolean; err?: string }\ninterface Order { items: {sku:string;qty:number;price:number}[]; total: number; status: \u0027open\u0027|\u0027cancelled\u0027; ver: number }\nclass Orders {\n data: Map\u003cstring, Order\u003e = new Map();\n ver: Map\u003cstring, number\u003e = new Map();\n private nv(id:string) { const v=(this.ver.get(id)||0)+1; this.ver.set(id,v); return v; }\n","golden_completion":" exec(type: string, id: string, p: any): Res {\n if (type===\u0027create\u0027) {\n if (this.data.has(id)) return {ok:false,err:\u0027exists\u0027};\n const it=p.items as {sku:string;qty:number;price:number}[];\n if (!it||!it.length) return {ok:false,err:\u0027empty\u0027};\n if (it.some((x:any)=\u003ex.qty\u003c=0)) return {ok:false,err:\u0027bad_qty\u0027};\n this.data.set(id,{items:[...it],total:it.reduce((s:number,x:any)=\u003es+x.qty*x.price,0),status:\u0027open\u0027,ver:this.nv(id)});\n return {ok:true};\n }\n const o=this.data.get(id);\n if (!o) return {ok:false,err:\u0027missing\u0027};\n if (type===\u0027cancel\u0027) {\n if (o.status===\u0027cancelled\u0027) return {ok:false,err:\u0027already\u0027};\n o.status=\u0027cancelled\u0027; o.ver=this.nv(id); return {ok:true};\n }\n if (type===\u0027update_qty\u0027) {\n if (o.status!==\u0027open\u0027) return {ok:false,err:\u0027closed\u0027};\n const f=o.items.find((x:any)=\u003ex.sku===p.sku);\n if (!f) return {ok:false,err:\u0027no_sku\u0027};\n if (p.qty\u003c=0) return {ok:false,err:\u0027bad_qty\u0027};\n f.qty=p.qty; o.total=o.items.reduce((s,x)=\u003es+x.qty*x.price,0); o.ver=this.nv(id); return {ok:true};\n }\n return {ok:false,err:\u0027unknown\u0027};\n }\n","suffix":"}\nconst svc = new Orders();\nsvc.exec(\u0027create\u0027,\u0027O1\u0027,{items:[{sku:\u0027A\u0027,qty:2,price:10},{sku:\u0027B\u0027,qty:1,price:25}]});\nconst o1 = svc.data.get(\u0027O1\u0027)!;\nif (o1.total!==45) throw new Error(\u0027total\u0027);\nsvc.exec(\u0027update_qty\u0027,\u0027O1\u0027,{sku:\u0027A\u0027,qty:5});\nif (svc.data.get(\u0027O1\u0027)!.total!==75) throw new Error(\u0027upd\u0027);\n","assertions":"if (svc.exec(\u0027create\u0027,\u0027O1\u0027,{items:[{sku:\u0027X\u0027,qty:1,price:1}]}).err!==\u0027exists\u0027) throw new Error(\u0027dup\u0027);\nsvc.exec(\u0027cancel\u0027,\u0027O1\u0027,{});\nif (svc.exec(\u0027update_qty\u0027,\u0027O1\u0027,{sku:\u0027A\u0027,qty:1}).err!==\u0027closed\u0027) throw new Error(\u0027cancelled\u0027);\nif (svc.exec(\u0027cancel\u0027,\u0027O1\u0027,{}).err!==\u0027already\u0027) throw new Error(\u00272xcancel\u0027);\nif (svc.exec(\u0027create\u0027,\u0027O2\u0027,{items:[]}).err!==\u0027empty\u0027) throw new Error(\u0027empty\u0027);\nif (svc.exec(\u0027create\u0027,\u0027O3\u0027,{items:[{sku:\u0027Z\u0027,qty:0,price:1}]}).err!==\u0027bad_qty\u0027) throw new Error(\u0027qty\u0027);\nsvc.exec(\u0027create\u0027,\u0027O4\u0027,{items:[{sku:\u0027M\u0027,qty:1,price:10}]});\nif (svc.exec(\u0027update_qty\u0027,\u0027O4\u0027,{sku:\u0027?\u0027,qty:1}).err!==\u0027no_sku\u0027) throw new Error(\u0027nosku\u0027);\n","category":"code_purpose_understanding"} {"id":"44","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Approver { id: string; max: number }\ninterface Vote { by: string; ok: boolean; at: number }\ninterface Doc { amt: number; status: \u0027review\u0027|\u0027approved\u0027|\u0027rejected\u0027; votes: Vote[]; need: number }\nclass Pipeline {\n approvers: Map\u003cstring,Approver\u003e = new Map();\n docs: Map\u003cstring,Doc\u003e = new Map();\n t = 0;\n reg(a: Approver) { this.approvers.set(a.id, a); }\n submit(id: string, amt: number, need: number) { this.docs.set(id, {amt,status:\u0027review\u0027,votes:[],need}); }\n","golden_completion":" decide(id: string, who: string, approve: boolean): {ok:boolean; why?:string; status?:string} {\n this.t++;\n const d = this.docs.get(id);\n if (!d) return {ok:false, why:\u0027no_doc\u0027};\n if (d.status !== \u0027review\u0027) return {ok:false, why:\u0027not_review\u0027};\n const a = this.approvers.get(who);\n if (!a) return {ok:false, why:\u0027no_approver\u0027};\n if (a.max \u003c d.amt) return {ok:false, why:\u0027no_authority\u0027};\n if (d.votes.some(v =\u003e v.by === who)) return {ok:false, why:\u0027duplicate\u0027};\n d.votes.push({by: who, ok: approve, at: this.t});\n if (!approve) { d.status = \u0027rejected\u0027; return {ok:true, status:\u0027rejected\u0027}; }\n if (d.votes.filter(v =\u003e v.ok).length \u003e= d.need) d.status = \u0027approved\u0027;\n return {ok:true, status: d.status};\n }\n","suffix":"}\nconst p = new Pipeline();\np.reg({id:\u0027r1\u0027,max:100}); p.reg({id:\u0027m1\u0027,max:5000}); p.reg({id:\u0027d1\u0027,max:50000});\np.submit(\u0027D1\u0027, 3000, 2);\nif (p.decide(\u0027D1\u0027,\u0027r1\u0027,true).why !== \u0027no_authority\u0027) throw new Error(\u0027auth\u0027);\nconst v1 = p.decide(\u0027D1\u0027,\u0027m1\u0027,true);\nif (!v1.ok || v1.status !== \u0027review\u0027) throw new Error(\u00271of2\u0027);\nconst v2 = p.decide(\u0027D1\u0027,\u0027d1\u0027,true);\nif (v2.status !== \u0027approved\u0027) throw new Error(\u0027approved\u0027);\n","assertions":"if (p.decide(\u0027D1\u0027,\u0027m1\u0027,true).why !== \u0027not_review\u0027) throw new Error(\u0027post-approve\u0027);\np.submit(\u0027D2\u0027, 50, 3);\nif (p.decide(\u0027D2\u0027,\u0027r1\u0027,false).status !== \u0027rejected\u0027) throw new Error(\u0027reject\u0027);\nif (p.decide(\u0027D2\u0027,\u0027m1\u0027,true).why !== \u0027not_review\u0027) throw new Error(\u0027post-reject\u0027);\np.submit(\u0027D3\u0027, 100, 2);\np.decide(\u0027D3\u0027,\u0027r1\u0027,true);\nif (p.decide(\u0027D3\u0027,\u0027r1\u0027,true).why !== \u0027duplicate\u0027) throw new Error(\u0027dup\u0027);\nif (p.decide(\u0027X\u0027,\u0027m1\u0027,true).why !== \u0027no_doc\u0027) throw new Error(\u0027nodoc\u0027);\n","category":"code_purpose_understanding"} {"id":"45","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"type Sev = \u0027P1\u0027|\u0027P2\u0027|\u0027P3\u0027; type St = \u0027open\u0027|\u0027ack\u0027|\u0027resolved\u0027;\nconst SLA: Record\u003cSev,number\u003e = {P1:15,P2:30,P3:60};\nconst TRANSITIONS: Record\u003cSt,St[]\u003e = {open:[\u0027ack\u0027],ack:[\u0027resolved\u0027],resolved:[]};\ninterface Inc { sev:Sev; st:St; who:string; esc:number; created:number }\nclass IncMgr {\n incs: Map\u003cstring,Inc\u003e = new Map();\n roster: string[]; idx=0; now=0;\n constructor(r: string[]) { this.roster=r; }\n time(t:number) { this.now=t; }\n","golden_completion":" create(id:string, sev:Sev): string {\n const who = this.roster[this.idx++ % this.roster.length];\n this.incs.set(id, {sev,st:\u0027open\u0027,who,esc:0,created:this.now});\n return who;\n }\n transition(id:string, to:St): boolean {\n const i = this.incs.get(id);\n if (!i || !TRANSITIONS[i.st].includes(to)) return false;\n i.st = to; return true;\n }\n escalate(id:string): string|null {\n const i = this.incs.get(id);\n if (!i || i.st===\u0027resolved\u0027) return null;\n const who = this.roster[this.idx++ % this.roster.length];\n i.who=who; i.esc++; return who;\n }\n slaOk(id:string): boolean {\n const i = this.incs.get(id);\n if (!i) return true;\n if (i.st !== \u0027open\u0027) return true;\n return (this.now - i.created) \u003c= SLA[i.sev];\n }\n","suffix":"}\nconst m = new IncMgr([\u0027alice\u0027,\u0027bob\u0027,\u0027carol\u0027]);\nm.time(0);\nif (m.create(\u0027I1\u0027,\u0027P1\u0027) !== \u0027alice\u0027) throw new Error(\u0027assign\u0027);\nm.time(10);\nif (!m.slaOk(\u0027I1\u0027)) throw new Error(\u0027sla10\u0027);\nm.time(16);\nif (m.slaOk(\u0027I1\u0027)) throw new Error(\u0027sla16\u0027);\nm.transition(\u0027I1\u0027,\u0027ack\u0027);\nif (!m.slaOk(\u0027I1\u0027)) throw new Error(\u0027acked\u0027);\n","assertions":"if (m.transition(\u0027I1\u0027,\u0027open\u0027)) throw new Error(\u0027bad trans\u0027);\nm.transition(\u0027I1\u0027,\u0027resolved\u0027);\nif (m.escalate(\u0027I1\u0027) !== null) throw new Error(\u0027esc resolved\u0027);\nm.time(100); m.create(\u0027I2\u0027,\u0027P2\u0027);\nm.time(131);\nif (m.slaOk(\u0027I2\u0027)) throw new Error(\u0027P2 breach\u0027);\nconst e = m.escalate(\u0027I2\u0027);\nif (e !== \u0027carol\u0027) throw new Error(\u0027rotation: \u0027+e);\nif (m.incs.get(\u0027I2\u0027)!.esc !== 1) throw new Error(\u0027esc count\u0027);\n","category":"code_purpose_understanding"} {"id":"46","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"type SR = \u0027pass\u0027|\u0027fail\u0027|\u0027skip\u0027;\ninterface Stage { name:string; run:()=\u003eSR; rb:()=\u003evoid; dep:boolean }\ninterface Run { stages:{name:string;r:SR;rb:boolean}[]; ok:boolean }\nclass Pipe {\n stages: Stage[] = [];\n add(s: Stage) { this.stages.push(s); }\n","golden_completion":" exec(): Run {\n const out: {name:string;r:SR;rb:boolean}[] = [];\n const ran: number[] = [];\n let fail = false;\n for (let i = 0; i \u003c this.stages.length; i++) {\n const s = this.stages[i];\n if (fail \u0026\u0026 s.dep) { out.push({name:s.name,r:\u0027skip\u0027,rb:false}); continue; }\n const r = s.run();\n out.push({name:s.name,r,rb:false});\n ran.push(i);\n if (r === \u0027fail\u0027) fail = true;\n }\n if (fail) {\n for (let j = ran.length - 1; j \u003e= 0; j--) {\n this.stages[ran[j]].rb();\n out[ran[j]].rb = true;\n }\n }\n return { stages: out, ok: !fail };\n }\n","suffix":"}\nconst p = new Pipe();\np.add({name:\u0027build\u0027,run:()=\u003e\u0027pass\u0027,rb:()=\u003e{},dep:false});\np.add({name:\u0027test\u0027,run:()=\u003e\u0027pass\u0027,rb:()=\u003e{},dep:true});\np.add({name:\u0027deploy\u0027,run:()=\u003e\u0027pass\u0027,rb:()=\u003e{},dep:true});\nconst r1 = p.exec();\nif (!r1.ok || r1.stages.some(s=\u003es.rb)) throw new Error(\u0027ok\u0027);\n","assertions":"const p2 = new Pipe();\nconst rb: string[] = [];\np2.add({name:\u0027build\u0027,run:()=\u003e\u0027pass\u0027,rb:()=\u003erb.push(\u0027B\u0027),dep:false});\np2.add({name:\u0027test\u0027,run:()=\u003e\u0027fail\u0027,rb:()=\u003erb.push(\u0027T\u0027),dep:true});\np2.add({name:\u0027deploy\u0027,run:()=\u003e\u0027pass\u0027,rb:()=\u003erb.push(\u0027D\u0027),dep:true});\np2.add({name:\u0027notify\u0027,run:()=\u003e\u0027pass\u0027,rb:()=\u003erb.push(\u0027N\u0027),dep:false});\nconst r2 = p2.exec();\nif (r2.ok) throw new Error(\u0027fail\u0027);\nif (r2.stages[2].r!==\u0027skip\u0027) throw new Error(\u0027skip dep\u0027);\nif (r2.stages[3].r!==\u0027pass\u0027) throw new Error(\u0027notify runs\u0027);\nif (rb.join(\u0027\u0027)!==\u0027NTB\u0027) throw new Error(\u0027rb order:\u0027+rb.join(\u0027\u0027));\nif (r2.stages[2].rb) throw new Error(\u0027skip no rb\u0027);\nif (!r2.stages[0].rb||!r2.stages[1].rb||!r2.stages[3].rb) throw new Error(\u0027rb flags\u0027);\n","category":"code_purpose_understanding"} {"id":"47","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface FE { uid:string; step:string; ts:number }\nclass Funnel {\n evts: FE[] = [];\n steps: string[];\n win: number;\n constructor(steps: string[], win: number) { this.steps=steps; this.win=win; }\n add(e: FE) { this.evts.push(e); }\n","golden_completion":" analyze(): { counts:number[]; rates:number[]; drops:number[] } {\n const paths: Map\u003cstring, number[]\u003e = new Map();\n for (const uid of new Set(this.evts.map(e=\u003ee.uid))) {\n const ue = this.evts.filter(e=\u003ee.uid===uid).sort((a,b)=\u003ea.ts-b.ts);\n const times: number[] = [];\n let prev = -1;\n for (let i = 0; i \u003c this.steps.length; i++) {\n const e = ue.find(x =\u003e x.step===this.steps[i] \u0026\u0026 x.ts\u003eprev\n \u0026\u0026 (i===0 || x.ts-times[0]\u003c=this.win));\n if (!e) break;\n times.push(e.ts); prev = e.ts;\n }\n if (times.length \u003e 0) paths.set(uid, times);\n }\n const counts = this.steps.map((_,i) =\u003e [...paths.values()].filter(p=\u003ep.length\u003ei).length);\n const rates = counts.map((c,i) =\u003e i===0?100:(counts[0]===0?0:Math.round(c/counts[0]*10000)/100));\n const drops = counts.map((c,i) =\u003e i===0?0:counts[i-1]-c);\n return { counts, rates, drops };\n }\n","suffix":"}\nconst f = new Funnel([\u0027visit\u0027,\u0027signup\u0027,\u0027buy\u0027], 86400000);\nf.add({uid:\u0027A\u0027,step:\u0027visit\u0027,ts:1000}); f.add({uid:\u0027A\u0027,step:\u0027signup\u0027,ts:2000}); f.add({uid:\u0027A\u0027,step:\u0027buy\u0027,ts:5000});\nf.add({uid:\u0027B\u0027,step:\u0027visit\u0027,ts:1500}); f.add({uid:\u0027B\u0027,step:\u0027signup\u0027,ts:3000});\nf.add({uid:\u0027C\u0027,step:\u0027visit\u0027,ts:2000});\nconst r = f.analyze();\nif (r.counts[0]!==3||r.counts[1]!==2||r.counts[2]!==1) throw new Error(\u0027counts\u0027);\nif (r.rates[1]!==66.67) throw new Error(\u0027rate:\u0027+r.rates[1]);\nif (r.drops[2]!==1) throw new Error(\u0027drop\u0027);\n","assertions":"const f2 = new Funnel([\u0027a\u0027,\u0027b\u0027],100);\nf2.add({uid:\u0027X\u0027,step:\u0027a\u0027,ts:0}); f2.add({uid:\u0027X\u0027,step:\u0027b\u0027,ts:200});\nconst r2 = f2.analyze();\nif (r2.counts[1]!==0) throw new Error(\u0027window\u0027);\nconst f3 = new Funnel([\u0027A\u0027,\u0027B\u0027,\u0027C\u0027],100000);\nf3.add({uid:\u0027U\u0027,step:\u0027C\u0027,ts:1}); f3.add({uid:\u0027U\u0027,step:\u0027A\u0027,ts:2}); f3.add({uid:\u0027U\u0027,step:\u0027B\u0027,ts:3});\nconst r3 = f3.analyze();\nif (r3.counts[2]!==0) throw new Error(\u0027order\u0027);\nconst f4 = new Funnel([\u0027x\u0027,\u0027y\u0027],1000);\nif (f4.analyze().counts[0]!==0) throw new Error(\u0027empty\u0027);\n","category":"code_purpose_understanding"} {"id":"48","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface Obs { variant:string; converted:boolean; value:number }\ninterface ExpRes { ready:boolean; winner:string|null; stats:Record\u003cstring,{n:number;conv:number;rate:number}\u003e }\nclass ABTest {\n variants: string[];\n minN: number;\n obs: Obs[] = [];\n constructor(variants:string[], minN:number) { this.variants=variants; this.minN=minN; }\n record(o: Obs): boolean { if (!this.variants.includes(o.variant)) return false; this.obs.push(o); return true; }\n","golden_completion":" evaluate(): ExpRes {\n const stats: Record\u003cstring,{n:number;conv:number;rate:number}\u003e = {};\n for (const v of this.variants) {\n const vo = this.obs.filter(o=\u003eo.variant===v);\n const conv = vo.filter(o=\u003eo.converted).length;\n stats[v] = { n:vo.length, conv, rate: vo.length\u003e0 ? conv/vo.length : 0 };\n }\n if (this.variants.some(v=\u003estats[v].n\u003cthis.minN))\n return { ready:false, winner:null, stats };\n const [a,b] = this.variants;\n const pool = (stats[a].conv+stats[b].conv)/(stats[a].n+stats[b].n);\n const se = Math.sqrt(pool*(1-pool)*(1/stats[a].n+1/stats[b].n));\n if (se===0) return { ready:true, winner:null, stats };\n const z = Math.abs(stats[a].rate-stats[b].rate)/se;\n const sig = z \u003e 1.96;\n return { ready:true, winner: sig?(stats[a].rate\u003estats[b].rate?a:b):null, stats };\n }\n","suffix":"}\nconst e = new ABTest([\u0027ctrl\u0027,\u0027treat\u0027], 5);\nfor (let i=0;i\u003c3;i++) { e.record({variant:\u0027ctrl\u0027,converted:false,value:0}); e.record({variant:\u0027treat\u0027,converted:true,value:1}); }\nif (e.evaluate().ready) throw new Error(\u0027not ready\u0027);\nfor (let i=0;i\u003c7;i++) { e.record({variant:\u0027ctrl\u0027,converted:false,value:0}); e.record({variant:\u0027treat\u0027,converted:true,value:1}); }\nconst r = e.evaluate();\nif (!r.ready) throw new Error(\u0027ready\u0027);\n","assertions":"if (!r.winner||r.winner!==\u0027treat\u0027) throw new Error(\u0027winner\u0027);\nif (r.stats[\u0027treat\u0027].rate!==1) throw new Error(\u0027rate\u0027);\nif (e.record({variant:\u0027bad\u0027,converted:true,value:0})) throw new Error(\u0027invalid\u0027);\nconst e2 = new ABTest([\u0027A\u0027,\u0027B\u0027],5);\nfor (let i=0;i\u003c10;i++) { e2.record({variant:\u0027A\u0027,converted:i%2===0,value:1}); e2.record({variant:\u0027B\u0027,converted:i%2===0,value:1}); }\nif (e2.evaluate().winner!==null) throw new Error(\u0027same rates\u0027);\nif (e2.evaluate().stats[\u0027A\u0027].conv!==5) throw new Error(\u0027conv count\u0027);\nconst e3 = new ABTest([\u0027X\u0027,\u0027Y\u0027],1);\ne3.record({variant:\u0027X\u0027,converted:true,value:1}); e3.record({variant:\u0027Y\u0027,converted:true,value:1});\nif (e3.evaluate().winner!==null) throw new Error(\u0027zero var\u0027);\n","category":"code_purpose_understanding"} {"id":"49","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"interface RLRes { allowed:boolean; remaining:number; retryMs:number }\nclass RateLimiter {\n max: number; winMs: number; penMs: number;\n hits: Map\u003cstring,number[]\u003e = new Map();\n pens: Map\u003cstring,number\u003e = new Map();\n viols: Map\u003cstring,number\u003e = new Map();\n constructor(max:number, winMs:number, penMs:number) { this.max=max; this.winMs=winMs; this.penMs=penMs; }\n","golden_completion":" check(cid: string, now: number): RLRes {\n const pe = this.pens.get(cid) || 0;\n if (now \u003c pe) return {allowed:false, remaining:0, retryMs:pe-now};\n const ts = (this.hits.get(cid)||[]).filter(t =\u003e t \u003e now-this.winMs);\n this.hits.set(cid, ts);\n if (ts.length \u003e= this.max) {\n const v = (this.viols.get(cid)||0)+1;\n this.viols.set(cid, v);\n const pen = this.penMs * v;\n this.pens.set(cid, now+pen);\n return {allowed:false, remaining:0, retryMs:pen};\n }\n ts.push(now);\n return {allowed:true, remaining:this.max-ts.length, retryMs:0};\n }\n","suffix":"}\nconst l = new RateLimiter(3, 1000, 500);\nif (!l.check(\u0027u\u0027,100).allowed) throw new Error(\u00271st\u0027);\nif (!l.check(\u0027u\u0027,200).allowed) throw new Error(\u00272nd\u0027);\nif (!l.check(\u0027u\u0027,300).allowed) throw new Error(\u00273rd\u0027);\nconst r4 = l.check(\u0027u\u0027,400);\nif (r4.allowed) throw new Error(\u0027limited\u0027);\nif (r4.retryMs!==500) throw new Error(\u0027pen:\u0027+r4.retryMs);\n","assertions":"const r5 = l.check(\u0027u\u0027,700);\nif (r5.allowed) throw new Error(\u0027still pen\u0027);\nif (r5.retryMs!==200) throw new Error(\u0027rem:\u0027+r5.retryMs);\nconst r6 = l.check(\u0027u\u0027,1500);\nif (!r6.allowed) throw new Error(\u0027expired\u0027);\nconst l2 = new RateLimiter(1,100,200);\nl2.check(\u0027X\u0027,0); l2.check(\u0027X\u0027,10); // viol 1, pen=200\nl2.check(\u0027X\u0027,250); l2.check(\u0027X\u0027,260); // viol 2, pen=400\nconst r7 = l2.check(\u0027X\u0027,300);\nif (r7.allowed) throw new Error(\u00272nd pen\u0027);\nif (r7.retryMs!==360) throw new Error(\u0027esc:\u0027+r7.retryMs);\n","category":"code_purpose_understanding"} {"id":"50","testsource":"devbench-code-purpose-understanding","language":"typescript","prefix":"type NT = \u0027start\u0027|\u0027task\u0027|\u0027decision\u0027|\u0027end\u0027;\ninterface WNode { id:string; type:NT; fn?:(c:any)=\u003evoid; cond?:(c:any)=\u003eboolean; yes?:string; no?:string; next?:string }\ninterface Trace { id:string; type:NT; branch?:\u0027T\u0027|\u0027F\u0027 }\nclass WF {\n nodes: Map\u003cstring,WNode\u003e = new Map();\n startId: string|null = null;\n add(n: WNode) { this.nodes.set(n.id,n); if (n.type===\u0027start\u0027) this.startId=n.id; }\n","golden_completion":" run(ctx: any): {trace:Trace[];ctx:any;done:boolean;err?:string} {\n if (!this.startId) return {trace:[],ctx,done:false,err:\u0027no_start\u0027};\n const trace: Trace[] = []; let cur: string|null = this.startId;\n const seen = new Set\u003cstring\u003e();\n while (cur) {\n const n = this.nodes.get(cur);\n if (!n) return {trace,ctx,done:false,err:\u0027missing:\u0027+cur};\n const key = cur+JSON.stringify(ctx);\n if (seen.has(key)) return {trace,ctx,done:false,err:\u0027loop:\u0027+cur};\n seen.add(key);\n const e: Trace = {id:n.id,type:n.type};\n if (n.type===\u0027decision\u0027) {\n const r = n.cond!(ctx); e.branch = r?\u0027T\u0027:\u0027F\u0027; trace.push(e);\n cur = r?n.yes||null:n.no||null;\n } else {\n if (n.fn) n.fn(ctx); trace.push(e);\n if (n.type===\u0027end\u0027) return {trace,ctx,done:true};\n cur = n.next||null;\n }\n }\n return {trace,ctx,done:false,err:\u0027dead_end\u0027};\n }\n","suffix":"}\nconst w = new WF();\nw.add({id:\u0027s\u0027,type:\u0027start\u0027,fn:c=\u003e{c.ok=true},next:\u0027d\u0027});\nw.add({id:\u0027d\u0027,type:\u0027decision\u0027,cond:c=\u003ec.amt\u003e0,yes:\u0027p\u0027,no:\u0027r\u0027});\nw.add({id:\u0027p\u0027,type:\u0027task\u0027,fn:c=\u003e{c.processed=true},next:\u0027e\u0027});\nw.add({id:\u0027r\u0027,type:\u0027task\u0027,fn:c=\u003e{c.rejected=true},next:\u0027e\u0027});\nw.add({id:\u0027e\u0027,type:\u0027end\u0027});\nconst r1 = w.run({amt:10});\nif (!r1.done||!r1.ctx.processed) throw new Error(\u0027happy\u0027);\nif (r1.trace[1].branch!==\u0027T\u0027) throw new Error(\u0027branch\u0027);\nconst r2 = w.run({amt:-1});\nif (!r2.done||!r2.ctx.rejected) throw new Error(\u0027reject\u0027);\n","assertions":"const w2 = new WF();\nw2.add({id:\u0027t\u0027,type:\u0027task\u0027,next:\u0027e2\u0027});\nif (w2.run({}).done) throw new Error(\u0027no start\u0027);\nconst w3 = new WF();\nw3.add({id:\u0027s\u0027,type:\u0027start\u0027,next:\u0027x\u0027});\nif (w3.run({}).done||!w3.run({}).err?.includes(\u0027missing\u0027)) throw new Error(\u0027missing\u0027);\nconst w4 = new WF();\nw4.add({id:\u0027s\u0027,type:\u0027start\u0027,next:\u0027s\u0027});\nconst r3 = w4.run({});\nif (r3.done||!r3.err?.includes(\u0027loop\u0027)) throw new Error(\u0027loop\u0027);\nconst w5 = new WF();\nw5.add({id:\u0027s\u0027,type:\u0027start\u0027,fn:c=\u003e{c.v=0},next:\u0027t\u0027});\nw5.add({id:\u0027t\u0027,type:\u0027task\u0027,fn:c=\u003e{c.v+=10},next:\u0027e\u0027});\nw5.add({id:\u0027e\u0027,type:\u0027end\u0027});\nif (w5.run({}).ctx.v!==10) throw new Error(\u0027ctx flow\u0027);\n","category":"code_purpose_understanding"} {"id":"1","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\nfunction mergeInto\u003cT extends Record\u003cstring, unknown\u003e\u003e(target: T, source: Partial\u003cT\u003e): T {\n","golden_completion":" (mergeInto as any).doc = \u0027Merge own enumerable properties from source into target, mutating target in place. Properties whose value in source is undefined are skipped. Returns the same target reference. Does not perform deep merging.\u0027;\n","suffix":" for (const key of Object.keys(source)) {\n if ((source as any)[key] !== undefined) {\n (target as any)[key] = (source as any)[key];\n }\n }\n return target;\n}\n\nconst a: Record\u003cstring, unknown\u003e = { x: 1 };\nconst result = mergeInto(a, { y: 2, z: undefined });\nassert.strictEqual(result, a);\nassert.deepStrictEqual(a, { x: 1, y: 2 });\n","assertions":"mergeInto({} as any, {} as any);\nassert(typeof (mergeInto as any).doc === \u0027string\u0027);\nconst _d1 = ((mergeInto as any).doc as string).toLowerCase();\nassert(_d1.includes(\u0027mutating\u0027) || _d1.includes(\u0027mutates\u0027) || _d1.includes(\u0027in place\u0027));\nassert(_d1.includes(\u0027undefined\u0027));\nassert(_d1.includes(\u0027skip\u0027));\nassert(_d1.includes(\u0027return\u0027));\nassert(_d1.includes(\u0027deep\u0027) || _d1.includes(\u0027shallow\u0027));\n","category":"code2NL_NL2code"} {"id":"2","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\nasync function retryWithBackoff\u003cT\u003e(fn: () =\u003e Promise\u003cT\u003e, maxRetries: number, initialDelayMs: number): Promise\u003cT\u003e {\n","golden_completion":" (retryWithBackoff as any).doc = \u0027Retry an async function up to maxRetries times with exponential backoff. The delay starts at initialDelayMs milliseconds and doubles after each failed attempt. If all retries are exhausted, the last encountered error is re-thrown rather than wrapping it.\u0027;\n","suffix":" let delay = initialDelayMs;\n let lastError: unknown;\n for (let i = 0; i \u003c= maxRetries; i++) {\n try {\n return await fn();\n } catch (err) {\n lastError = err;\n if (i \u003c maxRetries) {\n await new Promise(r =\u003e setTimeout(r, delay));\n delay *= 2;\n }\n }\n }\n throw lastError;\n}\n\nlet callCount = 0;\nconst flaky = async (): Promise\u003cstring\u003e =\u003e {\n callCount++;\n if (callCount \u003c 3) throw new Error(\u0027fail\u0027);\n return \u0027ok\u0027;\n};\n(async () =\u003e {\n const result = await retryWithBackoff(flaky, 3, 10);\n assert.strictEqual(result, \u0027ok\u0027);\n assert.strictEqual(callCount, 3);\n})();\n","assertions":"let c2 = 0;\n(async () =\u003e {\n try { await retryWithBackoff(async () =\u003e { c2++; if (c2 \u003c 2) throw new Error(\u0027x\u0027); return 1; }, 2, 1); } catch(e) {}\n assert(typeof (retryWithBackoff as any).doc === \u0027string\u0027);\n const _d2 = ((retryWithBackoff as any).doc as string).toLowerCase();\n assert(_d2.includes(\u0027exponential\u0027) || _d2.includes(\u0027doubles\u0027));\n assert(_d2.includes(\u0027millisecond\u0027) || _d2.includes(\u0027ms\u0027));\n assert(_d2.includes(\u0027re-thrown\u0027) || _d2.includes(\u0027rethrown\u0027) || _d2.includes(\u0027re-throw\u0027) || _d2.includes(\u0027rethrow\u0027) || _d2.includes(\u0027throws\u0027));\n})();\n","category":"code2NL_NL2code"} {"id":"3","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\nfunction stablePartition\u003cT\u003e(arr: T[], predicate: (item: T) =\u003e boolean): number {\n","golden_completion":" (stablePartition as any).doc = \u0027Stably partition the array in place by predicate. \u0027 +\n \u0027Items where predicate returns true move to the front while both groups keep their relative order. \u0027 +\n \u0027Mutates the input array, calls predicate exactly once per item, and returns the split index.\u0027;\n","suffix":" const kept: T[] = [];\n const rest: T[] = [];\n for (const item of arr) {\n (predicate(item) ? kept : rest).push(item);\n }\n const split = kept.length;\n kept.push(...rest);\n arr.length = 0;\n arr.push(...kept);\n return split;\n}\n\nconst nums = [3, 2, 4, 1, 5, 8];\nconst idx = stablePartition(nums, (n: number) =\u003e n % 2 === 1);\nassert.strictEqual(idx, 3);\nassert.deepStrictEqual(nums, [3, 1, 5, 2, 4, 8]);\n","assertions":"const seen: Array\u003c[number, number]\u003e = [];\nconst values = [2, 7, 4, 5];\nconst split2 = stablePartition(values, (x: number, ...rest: any[]) =\u003e { seen.push([x, seen.length]); return x \u003e 4; });\nassert.deepStrictEqual(values, [7, 5, 2, 4]);\nassert.strictEqual(split2, 2);\nassert.strictEqual(seen.length, 4);\nassert(typeof (stablePartition as any).doc === \u0027string\u0027);\nconst _d3 = ((stablePartition as any).doc as string).toLowerCase();\nassert(_d3.includes(\u0027in place\u0027) || _d3.includes(\u0027mutates\u0027) || _d3.includes(\u0027mutating\u0027));\nassert(_d3.includes(\u0027stable\u0027) || _d3.includes(\u0027relative order\u0027));\nassert(_d3.includes(\u0027exactly once\u0027));\nassert(_d3.includes(\u0027split index\u0027));\n","category":"code2NL_NL2code"} {"id":"4","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\nfunction groupBy\u003cT\u003e(items: T[], keyFn: (item: T) =\u003e string | null | undefined): Record\u003cstring, T[]\u003e {\n","golden_completion":" (groupBy as any).doc = \u0027Group items by the string returned by keyFn. Items whose key is null or undefined are placed under the key \"__none__\". The returned object has keys sorted alphabetically. Within each group, items preserve their original order (stable grouping).\u0027;\n","suffix":" const groups: Record\u003cstring, T[]\u003e = {};\n for (const item of items) {\n let k = keyFn(item);\n if (k == null) k = \u0027__none__\u0027;\n if (!groups[k]) groups[k] = [];\n groups[k].push(item);\n }\n const sorted: Record\u003cstring, T[]\u003e = {};\n for (const k of Object.keys(groups).sort()) {\n sorted[k] = groups[k];\n }\n return sorted;\n}\n\ninterface DataItem { n: string; t: string | null }\nconst data: DataItem[] = [{n:\u0027a\u0027,t:\u0027x\u0027},{n:\u0027b\u0027,t:\u0027y\u0027},{n:\u0027c\u0027,t:\u0027x\u0027},{n:\u0027d\u0027,t:null}];\nconst result = groupBy(data, (d: DataItem) =\u003e d.t);\nassert.deepStrictEqual(Object.keys(result), [\u0027__none__\u0027, \u0027x\u0027, \u0027y\u0027]);\nassert.strictEqual(result[\u0027x\u0027].length, 2);\nassert.strictEqual(result[\u0027x\u0027][0].n, \u0027a\u0027);\n","assertions":"groupBy([], (x: any) =\u003e x);\nassert(typeof (groupBy as any).doc === \u0027string\u0027);\nconst _d4 = ((groupBy as any).doc as string).toLowerCase();\nassert(_d4.includes(\u0027__none__\u0027));\nassert(_d4.includes(\u0027sorted\u0027) || _d4.includes(\u0027alphabetical\u0027));\nassert(_d4.includes(\u0027stable\u0027) || _d4.includes(\u0027original order\u0027) || _d4.includes(\u0027preserve\u0027));\n","category":"code2NL_NL2code"} {"id":"5","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface AuditEntry\u003cT\u003e { value: T; index: number }\n\nfunction consumeFront\u003cT\u003e(list: T[], n: number, audit?: AuditEntry\u003cT\u003e[]): T[] {\n","golden_completion":" (consumeFront as any).doc = \u0027Remove and return up to n items from the front of list, mutating the original array in place. \u0027 +\n \u0027If n exceeds the list length, the list is drained completely. Negative n throws RangeError. \u0027 +\n \u0027Each removed item is appended to the audit array with its original index before returning the removed items.\u0027;\n","suffix":" if (n \u003c 0) throw new RangeError(\u0027n must be non-negative\u0027);\n const count = Math.min(n, list.length);\n const removed = list.splice(0, count);\n if (audit) {\n removed.forEach((value, index) =\u003e audit.push({ value, index }));\n }\n return removed;\n}\n\nconst audit: AuditEntry\u003cstring\u003e[] = [];\nconst items = [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027];\nassert.deepStrictEqual(consumeFront(items, 2, audit), [\u0027a\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(items, [\u0027c\u0027, \u0027d\u0027]);\nassert.deepStrictEqual(audit, [{ value: \u0027a\u0027, index: 0 }, { value: \u0027b\u0027, index: 1 }]);\nassert.throws(() =\u003e consumeFront(items, -1, audit), RangeError);\n","assertions":"const audit2: AuditEntry\u003cnumber\u003e[] = [];\nconst values = [10, 20];\nassert.deepStrictEqual(consumeFront(values, 5, audit2), [10, 20]);\nassert.deepStrictEqual(values, []);\nassert.deepStrictEqual(audit2, [{ value: 10, index: 0 }, { value: 20, index: 1 }]);\nassert(typeof (consumeFront as any).doc === \u0027string\u0027);\nconst _d5 = ((consumeFront as any).doc as string).toLowerCase();\nassert(_d5.includes(\u0027mutating\u0027) || _d5.includes(\u0027mutates\u0027) || _d5.includes(\u0027in place\u0027));\nassert(_d5.includes(\u0027front\u0027));\nassert(_d5.includes(\u0027drain\u0027) || _d5.includes(\u0027exceeds\u0027));\nassert(_d5.includes(\u0027rangeerror\u0027));\nassert(_d5.includes(\u0027audit\u0027));\nassert(_d5.includes(\u0027index\u0027));\n","category":"code2NL_NL2code"} {"id":"6","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ntype Listener = (...args: any[]) =\u003e void;\n\nclass Emitter {\n private _listeners: Record\u003cstring, Array\u003c{ fn: Listener; priority: number }\u003e\u003e = {};\n\n on(event: string, fn: Listener, priority: number = 0): this {\n","golden_completion":" (Emitter.prototype.on as any).doc = \u0027Register a listener for event with an optional numeric priority (default 0). Higher priority listeners are called first. Listeners with equal priority are called in registration order. Returns the Emitter instance for chaining.\u0027;\n","suffix":" if (!this._listeners[event]) this._listeners[event] = [];\n this._listeners[event].push({ fn, priority });\n this._listeners[event].sort((a, b) =\u003e b.priority - a.priority);\n return this;\n }\n\n emit(event: string, ...args: any[]): number {\n const list = this._listeners[event] || [];\n let count = 0;\n for (const entry of [...list]) {\n try { entry.fn(...args); count++; } catch(e) {}\n }\n return count;\n }\n}\n\nconst em = new Emitter();\nconst order: string[] = [];\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027low\u0027), 1);\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027high\u0027), 10);\nem.on(\u0027test\u0027, () =\u003e order.push(\u0027mid\u0027), 5);\nem.emit(\u0027test\u0027);\nassert.deepStrictEqual(order, [\u0027high\u0027, \u0027mid\u0027, \u0027low\u0027]);\n","assertions":"const em2 = new Emitter();\nem2.on(\u0027x\u0027, () =\u003e {});\nassert(typeof (Emitter.prototype.on as any).doc === \u0027string\u0027);\nconst _d6 = ((Emitter.prototype.on as any).doc as string).toLowerCase();\nassert(_d6.includes(\u0027priority\u0027));\nassert(_d6.includes(\u0027higher\u0027) || _d6.includes(\u0027descending\u0027));\nassert(_d6.includes(\u0027registration order\u0027) || _d6.includes(\u0027insertion order\u0027) || _d6.includes(\u0027equal priority\u0027));\nassert(_d6.includes(\u0027chain\u0027));\n","category":"code2NL_NL2code"} {"id":"7","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\nfunction deepFreeze\u003cT extends object\u003e(obj: T, visited: WeakSet\u003cobject\u003e = new WeakSet()): T {\n if (obj === null || typeof obj !== \u0027object\u0027 || visited.has(obj)) return obj;\n visited.add(obj);\n Object.freeze(obj);\n for (const val of Object.values(obj)) {\n if (typeof val === \u0027object\u0027 \u0026\u0026 val !== null) deepFreeze(val as object, visited);\n }\n return obj;\n}\n\nfunction describeDeepFreeze(): string {\n","golden_completion":" return \u0027Recursively freezes an object and all nested objects using Object.freeze. Handles circular references via a WeakSet to avoid infinite recursion. Skips null and non-object values. Returns the original object (same reference). The visited parameter is internal and should not be passed by callers.\u0027;\n","suffix":"}\n\nconst inner = { z: 3 };\nconst outer: Record\u003cstring, any\u003e = { a: 1, b: inner };\nouter[\u0027self\u0027] = outer;\ndeepFreeze(outer);\nassert(Object.isFrozen(outer));\nassert(Object.isFrozen(inner));\nassert.strictEqual(outer[\u0027self\u0027], outer);\n","assertions":"const desc = describeDeepFreeze();\nassert(typeof desc === \u0027string\u0027);\nconst _d7 = desc.toLowerCase();\nassert(_d7.includes(\u0027recursive\u0027) || _d7.includes(\u0027recursively\u0027) || _d7.includes(\u0027nested\u0027));\nassert(_d7.includes(\u0027circular\u0027) || _d7.includes(\u0027cycle\u0027));\nassert(_d7.includes(\u0027weakset\u0027) || _d7.includes(\u0027visited\u0027));\nassert(_d7.includes(\u0027same reference\u0027) || _d7.includes(\u0027original object\u0027) || _d7.includes(\u0027returns the\u0027));\n","category":"code2NL_NL2code"} {"id":"8","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface PopAudit\u003cT\u003e { value: T; index: number; key: number }\n\nfunction popSmallestBy\u003cT\u003e(items: T[], keyFn: (item: T, index: number, arr: T[]) =\u003e number, audit?: PopAudit\u003cT\u003e[]): T | undefined {\n","golden_completion":" (popSmallestBy as any).doc = \u0027Find the item with the smallest key, choosing the first item on ties, then remove it from the array in place. \u0027 +\n \u0027keyFn is called exactly once per item; an empty array returns undefined. \u0027 +\n \u0027When audit is provided, appends the removed value, original index, and computed key before returning the removed item.\u0027;\n","suffix":" if (items.length === 0) return undefined;\n let bestIndex = 0;\n let bestKey: number = 0;\n const keys: number[] = items.map((item, index) =\u003e {\n const key = keyFn(item, index, items);\n if (index === 0 || key \u003c bestKey) { bestKey = key; bestIndex = index; }\n return key;\n });\n const [removed] = items.splice(bestIndex, 1);\n if (audit) audit.push({ value: removed, index: bestIndex, key: keys[bestIndex] });\n return removed;\n}\n\ninterface Row { n: string; score: number }\nconst auditLog: PopAudit\u003cRow\u003e[] = [];\nconst rows: Row[] = [{ n: \u0027a\u0027, score: 3 }, { n: \u0027b\u0027, score: 1 }, { n: \u0027c\u0027, score: 1 }];\nconst removed = popSmallestBy(rows, (row: Row) =\u003e row.score, auditLog);\nassert.deepStrictEqual(removed, { n: \u0027b\u0027, score: 1 });\nassert.deepStrictEqual(rows.map(r =\u003e r.n), [\u0027a\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(auditLog, [{ value: { n: \u0027b\u0027, score: 1 }, index: 1, key: 1 }]);\n","assertions":"const seen2: Array\u003c[number, number]\u003e = [];\nconst nums2 = [5, 2, 2, 7];\nassert.strictEqual(popSmallestBy(nums2, (x: number, i: number) =\u003e { seen2.push([x, i]); return x; }), 2);\nassert.deepStrictEqual(nums2, [5, 2, 7]);\nassert.deepStrictEqual(seen2, [[5,0],[2,1],[2,2],[7,3]]);\nassert.strictEqual(popSmallestBy([] as number[], (x: number) =\u003e x), undefined);\nassert(typeof (popSmallestBy as any).doc === \u0027string\u0027);\nconst _d8 = ((popSmallestBy as any).doc as string).toLowerCase();\nassert(_d8.includes(\u0027in place\u0027) || _d8.includes(\u0027mutates\u0027) || _d8.includes(\u0027remove\u0027));\nassert(_d8.includes(\u0027first\u0027) \u0026\u0026 (_d8.includes(\u0027tie\u0027) || _d8.includes(\u0027ties\u0027)));\nassert(_d8.includes(\u0027exactly once\u0027));\nassert(_d8.includes(\u0027undefined\u0027) \u0026\u0026 _d8.includes(\u0027empty\u0027));\nassert(_d8.includes(\u0027audit\u0027));\n","category":"code2NL_NL2code"} {"id":"9","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\n/**\n * Flatten a nested array up to `depth` levels deep.\n * - If depth is 0, return a shallow copy of the input (no flattening).\n * - If depth is Infinity, flatten all levels.\n * - Only arrays are flattened; other iterables (e.g. strings, Sets) are left intact.\n * - The function must NOT mutate the original array.\n * - Returns a new array with elements in depth-first order.\n */\nfunction flattenWithDepth\u003cT\u003e(arr: readonly any[], depth: number = 1): T[] {\n","golden_completion":" const result: T[] = [];\n for (const item of arr) {\n if (Array.isArray(item) \u0026\u0026 depth \u003e 0) {\n result.push(...flattenWithDepth\u003cT\u003e(item, depth - 1));\n } else {\n result.push(item as T);\n }\n }\n return result;\n","suffix":"}\n\n// Basic tests\nassert.deepStrictEqual(flattenWithDepth([1, [2, [3, [4]]]], 1), [1, 2, [3, [4]]]);\nassert.deepStrictEqual(flattenWithDepth([1, [2, [3, [4]]]], Infinity), [1, 2, 3, 4]);\nassert.deepStrictEqual(flattenWithDepth([1, [2, 3]], 0), [1, [2, 3]]);\n// Strings are NOT flattened\nassert.deepStrictEqual(flattenWithDepth([\u0027abc\u0027, [1, 2]], 1), [\u0027abc\u0027, 1, 2]);\n// Original not mutated\nconst orig = [1, [2, [3]]];\nflattenWithDepth(orig, Infinity);\nassert.deepStrictEqual(orig, [1, [2, [3]]]);\n","assertions":"// Edge cases\nassert.deepStrictEqual(flattenWithDepth([], 5), []);\nassert.deepStrictEqual(flattenWithDepth([[[], []], []], Infinity), []);\nassert.deepStrictEqual(flattenWithDepth([1, [2, [3]], 4], 2), [1, 2, 3, 4]);\nconst nested = [[1, [2]], [3, [4, [5]]]];\nassert.deepStrictEqual(flattenWithDepth(nested, 1), [1, [2], 3, [4, [5]]]);\nassert.deepStrictEqual(flattenWithDepth(nested, 2), [1, 2, 3, 4, [5]]);\n// Verify non-mutation\nconst orig2 = [[1, [2]]];\nflattenWithDepth(orig2, Infinity);\nassert.deepStrictEqual(orig2, [[1, [2]]]);\n","category":"code2NL_NL2code"} {"id":"10","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\n/**\n * Assign properties from multiple source objects to a target, but ONLY\n * properties whose value is not null, undefined, or NaN.\n *\n * Rules:\n * - Sources are applied left-to-right; later sources override earlier ones.\n * - Only own enumerable string-keyed properties of each source are considered.\n * - The target is mutated in place and returned.\n * - If a source value is null, undefined, or NaN, that key is SKIPPED entirely\n * (the target keeps its existing value for that key, if any).\n */\nfunction compactAssign\u003cT extends Record\u003cstring, unknown\u003e\u003e(target: T, ...sources: Array\u003cPartial\u003cT\u003e\u003e): T {\n","golden_completion":" for (const source of sources) {\n for (const key of Object.keys(source)) {\n const val = (source as any)[key];\n if (val !== null \u0026\u0026 val !== undefined \u0026\u0026 !(typeof val === \u0027number\u0027 \u0026\u0026 isNaN(val))) {\n (target as any)[key] = val;\n }\n }\n }\n return target;\n","suffix":"}\n\n// Basic usage\nconst t = { a: 1, b: 2, c: 3 } as any;\nconst result = compactAssign(t, { a: 10, b: null } as any, { c: undefined, d: 4 } as any);\nassert.strictEqual(result, t);\nassert.strictEqual(t.a, 10);\nassert.strictEqual(t.b, 2); // null skipped\nassert.strictEqual(t.c, 3); // undefined skipped\nassert.strictEqual(t.d, 4);\n","assertions":"// NaN skipping\nconst t2: Record\u003cstring, unknown\u003e = { x: \u0027hello\u0027, y: 42 };\ncompactAssign(t2, { x: NaN, y: 0, z: \u0027\u0027 } as any);\nassert.strictEqual(t2.x, \u0027hello\u0027); // NaN skipped\nassert.strictEqual(t2.y, 0); // 0 is valid\nassert.strictEqual(t2.z, \u0027\u0027); // empty string is valid\n// Multiple sources override left-to-right\nconst t3: Record\u003cstring, unknown\u003e = {};\ncompactAssign(t3, { a: 1 } as any, { a: 2 } as any, { a: 3 } as any);\nassert.strictEqual(t3.a, 3);\n// Returns same target reference\nconst t4 = {} as any;\nassert.strictEqual(compactAssign(t4, { x: 1 } as any), t4);\n","category":"code2NL_NL2code"} {"id":"11","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ntype StepFn\u003cT\u003e = (input: T, signal: { aborted: boolean }) =\u003e Promise\u003cT\u003e;\n\nasync function pipeline\u003cT\u003e(input: T, steps: StepFn\u003cT\u003e[]): Promise\u003c{ result: T; completedSteps: number; aborted: boolean }\u003e {\n","golden_completion":" (pipeline as any).doc = \u0027Execute an array of async steps sequentially, threading each output as the next input. If any step throws, execution halts and the result from the last successful step is returned. Returns an object with result (last successful output or the original input if the first step fails), completedSteps (number of steps that finished without error), and aborted (true if any step threw). Each step receives an abort signal object that is shared across all steps.\u0027;\n","suffix":" const signal = { aborted: false };\n let current: T = input;\n let completed = 0;\n for (const step of steps) {\n try {\n current = await step(current, signal);\n completed++;\n } catch {\n signal.aborted = true;\n return { result: current, completedSteps: completed, aborted: true };\n }\n }\n return { result: current, completedSteps: completed, aborted: false };\n}\n\n(async () =\u003e {\n const r = await pipeline\u003cnumber\u003e(1, [\n async (x) =\u003e x + 10,\n async () =\u003e { throw new Error(\u0027boom\u0027); },\n async (x) =\u003e x * 100,\n ]);\n assert.strictEqual(r.result, 11);\n assert.strictEqual(r.completedSteps, 1);\n assert.strictEqual(r.aborted, true);\n})();\n","assertions":"(async () =\u003e {\n await pipeline\u003cnumber\u003e(0, []);\n const doc: string = (pipeline as any).doc;\n assert.ok(typeof doc === \u0027string\u0027);\n const dl = doc.toLowerCase();\n assert.ok(dl.includes(\u0027sequential\u0027) || dl.includes(\u0027sequentially\u0027));\n assert.ok(dl.includes(\u0027last successful\u0027) || dl.includes(\u0027previous result\u0027));\n assert.ok(dl.includes(\u0027original input\u0027) || dl.includes(\u0027initial input\u0027) || dl.includes(\u0027first step fails\u0027));\n assert.ok(dl.includes(\u0027abort\u0027) || dl.includes(\u0027signal\u0027));\n assert.ok(dl.includes(\u0027completedsteps\u0027) || dl.includes(\u0027completed steps\u0027) || dl.includes(\u0027number of steps\u0027));\n})();\n","category":"code2NL_NL2code"} {"id":"12","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nfunction deepClone\u003cT\u003e(obj: T, seen?: Map\u003cany, any\u003e): T {\n","golden_completion":" (deepClone as any).doc = \u0027Recursively deep-clone a value, preserving Date instances as new Date copies and handling circular references by returning the previously cloned reference. Arrays are cloned element-by-element maintaining index order. Only own enumerable properties are cloned for plain objects. Primitives and null are returned as-is without cloning.\u0027;\n","suffix":" if (obj === null || typeof obj !== \u0027object\u0027) return obj;\n if (!seen) seen = new Map();\n if (seen.has(obj)) return seen.get(obj);\n if (obj instanceof Date) return new Date(obj.getTime()) as any;\n if (Array.isArray(obj)) {\n const arr: any[] = [];\n seen.set(obj, arr);\n for (let i = 0; i \u003c obj.length; i++) arr[i] = deepClone(obj[i], seen);\n return arr as any;\n }\n const clone: any = {};\n seen.set(obj, clone);\n for (const key of Object.keys(obj as any)) {\n clone[key] = deepClone((obj as any)[key], seen);\n }\n return clone;\n}\n\nconst orig: any = { a: 1, d: new Date(\u00272024-01-01\u0027), nested: { b: [2, 3] } };\norig.self = orig;\nconst copy = deepClone(orig);\nassert.notStrictEqual(copy, orig);\nassert.strictEqual(copy.a, 1);\nassert.ok(copy.d instanceof Date);\nassert.notStrictEqual(copy.d, orig.d);\nassert.strictEqual(copy.self, copy);\n","assertions":"deepClone(42);\nconst doc: string = (deepClone as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027circular\u0027) || dl.includes(\u0027cycle\u0027));\nassert.ok(dl.includes(\u0027date\u0027));\nassert.ok(dl.includes(\u0027own\u0027) || dl.includes(\u0027enumerable\u0027));\nassert.ok(dl.includes(\u0027primitive\u0027) || dl.includes(\u0027null\u0027));\n","category":"code2NL_NL2code"} {"id":"13","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface DiffResult\u003cT\u003e {\n added: { value: T; index: number }[];\n removed: { value: T; index: number }[];\n kept: { value: T; oldIndex: number; newIndex: number }[];\n}\n\nfunction arrayDiff\u003cT\u003e(oldArr: T[], newArr: T[]): DiffResult\u003cT\u003e {\n","golden_completion":" (arrayDiff as any).doc = \u0027Compute the difference between two arrays using strict equality (===). Returns an object with added (items in newArr not in oldArr, with their newArr index), removed (items in oldArr not in newArr, with their oldArr index), and kept (items present in both, with both old and new indices). Each item is matched at most once, consuming the first unmatched occurrence. Duplicate values are treated as distinct occurrences.\u0027;\n","suffix":" const oldUsed = new Array(oldArr.length).fill(false);\n const newUsed = new Array(newArr.length).fill(false);\n const kept: { value: T; oldIndex: number; newIndex: number }[] = [];\n for (let ni = 0; ni \u003c newArr.length; ni++) {\n for (let oi = 0; oi \u003c oldArr.length; oi++) {\n if (!oldUsed[oi] \u0026\u0026 !newUsed[ni] \u0026\u0026 oldArr[oi] === newArr[ni]) {\n oldUsed[oi] = true;\n newUsed[ni] = true;\n kept.push({ value: newArr[ni], oldIndex: oi, newIndex: ni });\n break;\n }\n }\n }\n const removed = oldArr\n .map((value, index) =\u003e ({ value, index }))\n .filter((_, i) =\u003e !oldUsed[i]);\n const added = newArr\n .map((value, index) =\u003e ({ value, index }))\n .filter((_, i) =\u003e !newUsed[i]);\n return { added, removed, kept };\n}\n\nconst diff = arrayDiff([1, 2, 3, 2], [2, 4, 2]);\nassert.strictEqual(diff.removed.length, 2);\nassert.strictEqual(diff.added.length, 1);\nassert.strictEqual(diff.kept.length, 2);\nassert.strictEqual(diff.added[0].value, 4);\n","assertions":"arrayDiff([], []);\nconst doc: string = (arrayDiff as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027strict equality\u0027) || dl.includes(\u0027===\u0027));\nassert.ok(dl.includes(\u0027at most once\u0027) || dl.includes(\u0027first\u0027) || dl.includes(\u0027first unmatched\u0027));\nassert.ok(dl.includes(\u0027duplicate\u0027) || dl.includes(\u0027distinct occurrence\u0027));\nassert.ok(dl.includes(\u0027index\u0027) || dl.includes(\u0027indices\u0027));\n","category":"code2NL_NL2code"} {"id":"14","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface RetryOpts {\n maxAttempts: number;\n baseDelayMs: number;\n maxDelayMs: number;\n jitter: boolean;\n}\n\nasync function retryWithCeiling\u003cT\u003e(fn: () =\u003e Promise\u003cT\u003e, opts: RetryOpts): Promise\u003c{ value: T; attempts: number }\u003e {\n","golden_completion":" (retryWithCeiling as any).doc = \u0027Retry an async function up to maxAttempts times with exponential backoff capped at maxDelayMs. The delay starts at baseDelayMs and doubles each attempt but never exceeds maxDelayMs. When jitter is true, the actual delay is a random value between 0 and the computed delay. Returns an object with the resolved value and the total number of attempts made (including the successful one). If all attempts fail, the last error is thrown unwrapped.\u0027;\n","suffix":" let delay = opts.baseDelayMs;\n let lastError: any;\n for (let attempt = 1; attempt \u003c= opts.maxAttempts; attempt++) {\n try {\n const value = await fn();\n return { value, attempts: attempt };\n } catch (err) {\n lastError = err;\n if (attempt \u003c opts.maxAttempts) {\n const actual = opts.jitter ? Math.random() * delay : delay;\n await new Promise(r =\u003e setTimeout(r, actual));\n delay = Math.min(delay * 2, opts.maxDelayMs);\n }\n }\n }\n throw lastError;\n}\n\nlet count = 0;\n(async () =\u003e {\n const r = await retryWithCeiling(\n async () =\u003e { count++; if (count \u003c 3) throw new Error(\u0027fail\u0027); return \u0027ok\u0027; },\n { maxAttempts: 5, baseDelayMs: 10, maxDelayMs: 50, jitter: false }\n );\n assert.strictEqual(r.value, \u0027ok\u0027);\n assert.strictEqual(r.attempts, 3);\n})();\n","assertions":"let c2 = 0;\n(async () =\u003e {\n try { await retryWithCeiling(async () =\u003e { c2++; if(c2\u003c2) throw new Error(\u0027x\u0027); return 1; },\n { maxAttempts: 3, baseDelayMs: 1, maxDelayMs: 10, jitter: false }); } catch {}\n const doc: string = (retryWithCeiling as any).doc;\n assert.ok(typeof doc === \u0027string\u0027);\n const dl = doc.toLowerCase();\n assert.ok(dl.includes(\u0027cap\u0027) || dl.includes(\u0027ceiling\u0027) || dl.includes(\u0027never exceeds\u0027) || dl.includes(\u0027maxdelayms\u0027));\n assert.ok(dl.includes(\u0027jitter\u0027) \u0026\u0026 (dl.includes(\u0027random\u0027) || dl.includes(\u0027between 0\u0027)));\n assert.ok(dl.includes(\u0027attempts\u0027) || dl.includes(\u0027attempt\u0027));\n assert.ok(dl.includes(\u0027thrown\u0027) || dl.includes(\u0027throws\u0027) || dl.includes(\u0027rethrow\u0027) || dl.includes(\u0027re-throw\u0027));\n})();\n","category":"code2NL_NL2code"} {"id":"15","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ntype Schema = { [key: string]: \u0027string\u0027 | \u0027number\u0027 | \u0027boolean\u0027 | Schema };\ninterface ValidationError { path: string; expected: string; actual: string; }\n\nfunction validateSchema(obj: any, schema: Schema, path: string = \u0027\u0027): ValidationError[] {\n","golden_completion":" (validateSchema as any).doc = \u0027Validate an object against a nested type schema, collecting all errors rather than failing on the first. Each error includes the dot-separated path to the offending field, the expected type, and the actual type (using typeof). Extra keys in the object that are not in the schema are silently ignored. Missing keys (present in schema but absent in object) are reported with actual type \\\"undefined\\\". Nested schemas are validated recursively; if a field expected to be an object is not one, it is reported as a single error without recursing into its children.\u0027;\n","suffix":" const errors: ValidationError[] = [];\n for (const key of Object.keys(schema)) {\n const fullPath = path ? `${path}.${key}` : key;\n const expected = schema[key];\n const value = obj?.[key];\n if (typeof expected === \u0027object\u0027) {\n if (typeof value !== \u0027object\u0027 || value === null) {\n errors.push({ path: fullPath, expected: \u0027object\u0027, actual: typeof value });\n } else {\n errors.push(...validateSchema(value, expected as Schema, fullPath));\n }\n } else {\n if (typeof value !== expected) {\n errors.push({ path: fullPath, expected, actual: typeof value });\n }\n }\n }\n return errors;\n}\n\nconst errs = validateSchema(\n { name: \u0027test\u0027, age: \u0027not-a-number\u0027, extra: true, addr: { zip: 123 } },\n { name: \u0027string\u0027, age: \u0027number\u0027, addr: { zip: \u0027string\u0027, city: \u0027string\u0027 } }\n);\nassert.strictEqual(errs.length, 3);\nassert.strictEqual(errs[0].path, \u0027age\u0027);\nassert.strictEqual(errs[1].path, \u0027addr.zip\u0027);\nassert.strictEqual(errs[2].path, \u0027addr.city\u0027);\n","assertions":"validateSchema({}, {});\nconst doc: string = (validateSchema as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027all errors\u0027) || dl.includes(\u0027collecting\u0027) || dl.includes(\u0027every error\u0027));\nassert.ok(dl.includes(\u0027dot\u0027) || dl.includes(\u0027path\u0027));\nassert.ok(dl.includes(\u0027extra\u0027) || dl.includes(\u0027ignored\u0027) || dl.includes(\u0027silently\u0027));\nassert.ok(dl.includes(\u0027missing\u0027) || dl.includes(\u0027undefined\u0027));\nassert.ok(dl.includes(\u0027typeof\u0027));\n","category":"code2NL_NL2code"} {"id":"16","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nclass EventBus {\n private _handlers: Map\u003cstring, { fn: Function; once: boolean }[]\u003e = new Map();\n\n on(event: string, fn: Function, once: boolean = false): () =\u003e void {\n","golden_completion":" (EventBus.prototype.on as any).doc = \u0027Subscribe fn to event. If once is true, the listener auto-removes after its first invocation. The wildcard event \"*\" matches all events; wildcard listeners receive the event name as the first argument followed by the original arguments. Returns an unsubscribe function that removes only this specific registration (not other registrations of the same fn). Listeners are called in registration order.\u0027;\n","suffix":" if (!this._handlers.has(event)) this._handlers.set(event, []);\n const entry = { fn, once };\n this._handlers.get(event)!.push(entry);\n return () =\u003e {\n const list = this._handlers.get(event);\n if (list) {\n const idx = list.indexOf(entry);\n if (idx \u003e= 0) list.splice(idx, 1);\n }\n };\n }\n\n emit(event: string, ...args: any[]): number {\n let count = 0;\n const specific = this._handlers.get(event) || [];\n const wild = this._handlers.get(\u0027*\u0027) || [];\n for (const entry of [...specific]) {\n entry.fn(...args);\n count++;\n if (entry.once) {\n const idx = specific.indexOf(entry);\n if (idx \u003e= 0) specific.splice(idx, 1);\n }\n }\n for (const entry of [...wild]) {\n entry.fn(event, ...args);\n count++;\n if (entry.once) {\n const idx = wild.indexOf(entry);\n if (idx \u003e= 0) wild.splice(idx, 1);\n }\n }\n return count;\n }\n}\n\nconst bus = new EventBus();\nconst log: any[] = [];\nconst unsub = bus.on(\u0027msg\u0027, (x: any) =\u003e log.push(x));\nbus.on(\u0027msg\u0027, (x: any) =\u003e log.push(\u0027once:\u0027 + x), true);\nbus.on(\u0027*\u0027, (ev: string, x: any) =\u003e log.push(\u0027*:\u0027 + ev + \u0027:\u0027 + x));\nbus.emit(\u0027msg\u0027, \u0027a\u0027);\nbus.emit(\u0027msg\u0027, \u0027b\u0027);\nunsub();\nbus.emit(\u0027msg\u0027, \u0027c\u0027);\nassert.deepStrictEqual(log, [\u0027a\u0027, \u0027once:a\u0027, \u0027*:msg:a\u0027, \u0027b\u0027, \u0027*:msg:b\u0027, \u0027*:msg:c\u0027]);\n","assertions":"const bus2 = new EventBus();\nbus2.on(\u0027x\u0027, () =\u003e {});\nconst doc: string = (EventBus.prototype.on as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027wildcard\u0027) || dl.includes(\u0027*\u0027));\nassert.ok(dl.includes(\u0027event name\u0027) || dl.includes(\u0027first argument\u0027));\nassert.ok(dl.includes(\u0027once\u0027) || dl.includes(\u0027auto-remove\u0027));\nassert.ok(dl.includes(\u0027unsubscribe\u0027) || dl.includes(\u0027unsub\u0027));\nassert.ok(dl.includes(\u0027registration order\u0027) || dl.includes(\u0027insertion order\u0027));\n","category":"code2NL_NL2code"} {"id":"17","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nfunction throttle\u003cA extends any[], R\u003e(\n fn: (...args: A) =\u003e R,\n intervalMs: number\n): { call: (...args: A) =\u003e R | undefined; flush: () =\u003e R | undefined; pending: () =\u003e boolean } {\n","golden_completion":" (throttle as any).doc = \u0027Create a throttled wrapper that invokes fn at most once per intervalMs milliseconds. The first call executes immediately. Subsequent calls within the interval are suppressed but the last suppressed call is saved and automatically fired when the interval expires (trailing call guarantee). Returns an object with call (the throttled function, returns fn result or undefined if suppressed), flush (immediately executes any pending trailing call and returns its result), and pending (returns true if a trailing call is queued).\u0027;\n","suffix":" let lastTime = 0;\n let timer: ReturnType\u003ctypeof setTimeout\u003e | null = null;\n let savedArgs: A | null = null;\n let lastResult: R | undefined;\n\n function call(...args: A): R | undefined {\n const now = Date.now();\n if (now - lastTime \u003e= intervalMs) {\n lastTime = now;\n if (timer) { clearTimeout(timer); timer = null; }\n savedArgs = null;\n lastResult = fn(...args);\n return lastResult;\n }\n savedArgs = args;\n if (!timer) {\n timer = setTimeout(() =\u003e {\n lastTime = Date.now();\n timer = null;\n if (savedArgs) {\n lastResult = fn(...savedArgs);\n savedArgs = null;\n }\n }, intervalMs - (now - lastTime));\n }\n return undefined;\n }\n\n function flush(): R | undefined {\n if (timer \u0026\u0026 savedArgs) {\n clearTimeout(timer);\n timer = null;\n lastTime = Date.now();\n lastResult = fn(...savedArgs);\n savedArgs = null;\n return lastResult;\n }\n return undefined;\n }\n\n function pending(): boolean { return savedArgs !== null; }\n\n return { call, flush, pending };\n}\n\nconst results: number[] = [];\nconst t = throttle((x: number) =\u003e { results.push(x); return x; }, 1000);\nconst r1 = t.call(1);\nassert.strictEqual(r1, 1);\nconst r2 = t.call(2);\nassert.strictEqual(r2, undefined);\nassert.strictEqual(t.pending(), true);\nconst r3 = t.flush();\nassert.strictEqual(r3, 2);\nassert.deepStrictEqual(results, [1, 2]);\n","assertions":"throttle(() =\u003e {}, 100);\nconst doc: string = (throttle as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027trailing\u0027) || dl.includes(\u0027last suppressed\u0027) || dl.includes(\u0027saved\u0027));\nassert.ok(dl.includes(\u0027flush\u0027));\nassert.ok(dl.includes(\u0027pending\u0027));\nassert.ok(dl.includes(\u0027immediately\u0027) || dl.includes(\u0027first call\u0027));\nassert.ok(dl.includes(\u0027undefined\u0027) || dl.includes(\u0027suppressed\u0027));\n","category":"code2NL_NL2code"} {"id":"18","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nclass ExpiringMap\u003cK, V\u003e {\n private _store: Map\u003cK, { value: V; expiresAt: number }\u003e = new Map();\n private _defaultTTL: number;\n\n constructor(defaultTTLMs: number) { this._defaultTTL = defaultTTLMs; }\n\n set(key: K, value: V, ttlMs?: number): void {\n","golden_completion":" (ExpiringMap.prototype.set as any).doc = \u0027Store a key-value pair with an expiration time. If ttlMs is provided, the entry expires after that many milliseconds from now; otherwise it uses the instance default TTL. Setting an already-existing key overwrites both the value and the expiration time (the old TTL is not preserved). Expired entries are not proactively removed; they are cleaned up lazily when accessed via get() or has().\u0027;\n","suffix":" const ttl = ttlMs !== undefined ? ttlMs : this._defaultTTL;\n this._store.set(key, { value, expiresAt: Date.now() + ttl });\n }\n\n get(key: K): V | undefined {\n const entry = this._store.get(key);\n if (!entry) return undefined;\n if (Date.now() \u003e= entry.expiresAt) {\n this._store.delete(key);\n return undefined;\n }\n return entry.value;\n }\n\n has(key: K): boolean {\n return this.get(key) !== undefined;\n }\n\n size(): number { return this._store.size; }\n}\n\nconst m = new ExpiringMap\u003cstring, number\u003e(100000);\nm.set(\u0027a\u0027, 1);\nm.set(\u0027b\u0027, 2, 1); // expires in 1ms\nassert.strictEqual(m.get(\u0027a\u0027), 1);\n","assertions":"const m2 = new ExpiringMap\u003cstring, number\u003e(100000);\nm2.set(\u0027x\u0027, 10);\nconst doc: string = (ExpiringMap.prototype.set as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027overwrite\u0027) || dl.includes(\u0027replace\u0027));\nassert.ok(dl.includes(\u0027lazily\u0027) || dl.includes(\u0027lazy\u0027) || dl.includes(\u0027on access\u0027));\nassert.ok(dl.includes(\u0027default\u0027) || dl.includes(\u0027defaultttl\u0027) || dl.includes(\u0027instance\u0027));\nassert.ok(dl.includes(\u0027ttl\u0027) || dl.includes(\u0027expir\u0027));\n","category":"code2NL_NL2code"} {"id":"19","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Implement weightedSample according to this specification:\n//\n// Select one item from `items` using the corresponding `weights`.\n// Rules:\n// 1. Weights are positive numbers (not necessarily summing to 1).\n// 2. The `rng` parameter is a function returning a float in [0, 1).\n// 3. Selection uses cumulative weight: find the first index where\n// cumulative weight \u003e rng() * totalWeight.\n// 4. If items is empty, return undefined.\n// 5. If weights array is shorter than items, missing weights default to 1.\n// 6. If weights array is longer than items, extra weights are IGNORED.\n//\n// Examples with deterministic rng:\n// weightedSample([\u0027a\u0027,\u0027b\u0027,\u0027c\u0027], [1, 2, 1], () =\u003e 0.0) =\u003e \u0027a\u0027\n// weightedSample([\u0027a\u0027,\u0027b\u0027,\u0027c\u0027], [1, 2, 1], () =\u003e 0.99) =\u003e \u0027c\u0027\n// weightedSample([\u0027a\u0027,\u0027b\u0027], [1], () =\u003e 0.0) =\u003e \u0027a\u0027 (weight of \u0027b\u0027 defaults to 1)\n// weightedSample([\u0027a\u0027,\u0027b\u0027], [1, 2, 99], () =\u003e 0.0) =\u003e \u0027a\u0027 (extra weight 99 ignored)\n\n","golden_completion":"function weightedSample\u003cT\u003e(items: T[], weights: number[], rng: () =\u003e number): T | undefined {\n if (items.length === 0) return undefined;\n const w = items.map((_, i) =\u003e (i \u003c weights.length ? weights[i] : 1));\n const total = w.reduce((s, v) =\u003e s + v, 0);\n const threshold = rng() * total;\n let cum = 0;\n for (let i = 0; i \u003c items.length; i++) {\n cum += w[i];\n if (cum \u003e threshold) return items[i];\n }\n return items[items.length - 1];\n}\n","suffix":"\nassert.strictEqual(weightedSample([\u0027a\u0027,\u0027b\u0027,\u0027c\u0027], [1, 2, 1], () =\u003e 0.0), \u0027a\u0027);\nassert.strictEqual(weightedSample([\u0027a\u0027,\u0027b\u0027,\u0027c\u0027], [1, 2, 1], () =\u003e 0.99), \u0027c\u0027);\nassert.strictEqual(weightedSample([], [], () =\u003e 0.5), undefined);\n","assertions":"// Default weight for missing entries\nassert.strictEqual(weightedSample([\u0027x\u0027,\u0027y\u0027], [3], () =\u003e 0.0), \u0027x\u0027);\n// rng=0.74: threshold=0.74*4=2.96, cum: x=3 \u003e 2.96 → \u0027x\u0027\nassert.strictEqual(weightedSample([\u0027x\u0027,\u0027y\u0027], [3], () =\u003e 0.74), \u0027x\u0027);\n// rng=0.76: threshold=0.76*4=3.04, cum: x=3, y=4 \u003e 3.04 → \u0027y\u0027\nassert.strictEqual(weightedSample([\u0027x\u0027,\u0027y\u0027], [3], () =\u003e 0.76), \u0027y\u0027);\n// Extra weights ignored\nassert.strictEqual(weightedSample([\u0027a\u0027], [2, 99, 100], () =\u003e 0.5), \u0027a\u0027);\n// Boundary: rng returns nearly 1\nassert.strictEqual(weightedSample([\u0027a\u0027,\u0027b\u0027,\u0027c\u0027], [1,1,1], () =\u003e 0.999), \u0027c\u0027);\n","category":"code2NL_NL2code"} {"id":"20","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Implement parseConfig according to this specification:\n//\n// Parse an INI-style config string into a nested object.\n// Rules:\n// 1. Lines are separated by \u0027\\n\u0027.\n// 2. Blank lines and lines starting with \u0027#\u0027 (after trimming) are ignored.\n// 3. Section headers look like \u0027[sectionName]\u0027. Keys before any section go into \u0027__global__\u0027.\n// 4. Key-value lines are \u0027key = value\u0027. Both key and value are trimmed.\n// 5. If a section header is \u0027[child:parent]\u0027, the child section INHERITS all keys from parent.\n// Explicitly set keys in the child override inherited ones.\n// 6. Values that look like integers (match /^-?\\d+$/) are converted to numbers.\n// 7. Values \u0027true\u0027 and \u0027false\u0027 (case insensitive) are converted to booleans.\n// 8. Duplicate keys within the same section: last value wins.\n//\n// Example:\n// \u0027[base]\\nport = 3000\\n[dev:base]\\ndebug = true\u0027\n// =\u003e { __global__: {}, base: { port: 3000 }, dev: { port: 3000, debug: true } }\n\n","golden_completion":"function parseConfig(input: string): Record\u003cstring, Record\u003cstring, string | number | boolean\u003e\u003e {\n const res: Record\u003cstring, Record\u003cstring, any\u003e\u003e = { __global__: {} }, parents: Record\u003cstring, string\u003e = {}; let cur = \u0027__global__\u0027;\n for (const raw of input.split(\u0027\\n\u0027)) {\n const ln = raw.trim(); if (!ln || ln.startsWith(\u0027#\u0027)) continue;\n const sm = ln.match(/^\\[([^\\]]+)\\]$/); if (sm) { const p = sm[1].split(\u0027:\u0027); cur = p[0].trim(); if (!res[cur]) res[cur] = {}; if (p.length \u003e 1) parents[cur] = p[1].trim(); continue; }\n const eq = ln.indexOf(\u0027=\u0027); if (eq \u003c 0) continue; const k = ln.slice(0, eq).trim(); let v: any = ln.slice(eq + 1).trim();\n if (/^-?\\d+$/.test(v)) v = parseInt(v, 10); else if (v.toLowerCase() === \u0027true\u0027) v = true; else if (v.toLowerCase() === \u0027false\u0027) v = false;\n res[cur][k] = v;\n }\n for (const [c, p] of Object.entries(parents)) { if (res[p]) res[c] = { ...res[p], ...res[c] }; }\n return res;\n}\n","suffix":"\nconst cfg = parseConfig(\u0027[base]\\nport = 3000\\nhost = localhost\\n[dev:base]\\ndebug = true\\nport = 8080\u0027);\nassert.strictEqual(cfg.base.port, 3000);\nassert.strictEqual(cfg.dev.port, 8080);\nassert.strictEqual(cfg.dev.debug, true);\nassert.strictEqual(cfg.dev.host, \u0027localhost\u0027);\n","assertions":"// Global keys\nconst c1 = parseConfig(\u0027globalKey = 42\\n[sec]\\nfoo = bar\u0027);\nassert.strictEqual(c1.__global__.globalKey, 42);\nassert.strictEqual(c1.sec.foo, \u0027bar\u0027);\n// Comments and blank lines\nconst c2 = parseConfig(\u0027# comment\\n\\nk = v\\n[s]\\n# another\\nx = 10\u0027);\nassert.strictEqual(c2.__global__.k, \u0027v\u0027);\nassert.strictEqual(c2.s.x, 10);\n// Boolean conversion case insensitive\nconst c3 = parseConfig(\u0027[s]\\na = TRUE\\nb = False\\nc = yes\u0027);\nassert.strictEqual(c3.s.a, true);\nassert.strictEqual(c3.s.b, false);\nassert.strictEqual(c3.s.c, \u0027yes\u0027);\n// Inheritance: child overrides parent, parent keys present\nconst c4 = parseConfig(\u0027[parent]\\nx = 1\\ny = 2\\n[child:parent]\\ny = 99\u0027);\nassert.strictEqual(c4.child.x, 1);\nassert.strictEqual(c4.child.y, 99);\n// Duplicate keys: last wins\nconst c5 = parseConfig(\u0027[s]\\nk = first\\nk = second\u0027);\nassert.strictEqual(c5.s.k, \u0027second\u0027);\n// Negative integer\nconst c6 = parseConfig(\u0027[s]\\nval = -7\u0027);\nassert.strictEqual(c6.s.val, -7);\n","category":"code2NL_NL2code"} {"id":"21","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ntype Unsubscribe = () =\u003e void;\n\nclass Observable\u003cT\u003e {\n private listeners: Array\u003c{ fn: (val: T) =\u003e void; once: boolean }\u003e = [];\n\n subscribe(fn: (val: T) =\u003e void, once: boolean = false): Unsubscribe {\n","golden_completion":" (Observable.prototype.subscribe as any).doc =\n \u0027Register a listener that receives emitted values. When once is true, the listener \u0027 +\n \u0027auto-removes itself after the first invocation. Returns an idempotent unsubscribe \u0027 +\n \u0027function that removes the listener from the internal array by identity. \u0027 +\n \u0027Calling unsubscribe multiple times has no additional effect.\u0027;\n","suffix":" const entry = { fn, once };\n this.listeners.push(entry);\n let removed = false;\n return () =\u003e {\n if (removed) return;\n removed = true;\n const idx = this.listeners.indexOf(entry);\n if (idx \u003e= 0) this.listeners.splice(idx, 1);\n };\n }\n\n emit(val: T): number {\n const snapshot = [...this.listeners];\n let count = 0;\n for (const entry of snapshot) {\n entry.fn(val);\n count++;\n if (entry.once) {\n const idx = this.listeners.indexOf(entry);\n if (idx \u003e= 0) this.listeners.splice(idx, 1);\n }\n }\n return count;\n }\n}\n\nconst obs = new Observable\u003cnumber\u003e();\nconst vals: number[] = [];\nconst unsub = obs.subscribe(v =\u003e vals.push(v));\nobs.emit(1);\nobs.emit(2);\nunsub();\nobs.emit(3);\nassert.deepStrictEqual(vals, [1, 2]);\n","assertions":"const obs2 = new Observable\u003cstring\u003e();\nconst seen: string[] = [];\nconst u1 = obs2.subscribe(v =\u003e seen.push(v), true);\nobs2.emit(\u0027a\u0027);\nobs2.emit(\u0027b\u0027);\nassert.deepStrictEqual(seen, [\u0027a\u0027]);\nu1(); u1();\nconst doc = (Observable.prototype.subscribe as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027once\u0027), \u0027must mention once\u0027);\nassert.ok(dl.includes(\u0027auto-remove\u0027) || dl.includes(\u0027auto remove\u0027) || dl.includes(\u0027removes itself\u0027), \u0027must mention auto-removal\u0027);\nassert.ok(dl.includes(\u0027idempotent\u0027), \u0027must mention idempotent unsubscribe\u0027);\nassert.ok(dl.includes(\u0027identity\u0027), \u0027must mention identity-based removal\u0027);\nassert.ok(dl.includes(\u0027unsubscribe\u0027), \u0027must mention unsubscribe\u0027);\n","category":"code2NL_NL2code"} {"id":"22","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface TreeNode\u003cT\u003e {\n value: T;\n children: TreeNode\u003cT\u003e[];\n}\n\nfunction flattenTree\u003cT\u003e(root: TreeNode\u003cT\u003e, depthFirst: boolean = true): T[] {\n","golden_completion":" (flattenTree as any).doc =\n \u0027Flatten a tree into an array using either pre-order depth-first (default) or breadth-first traversal. \u0027 +\n \u0027The root value always appears first. Children are visited left-to-right at each level. \u0027 +\n \u0027Returns a new array without mutating the tree. Throws TypeError if root is null or undefined.\u0027;\n","suffix":" if (root == null) throw new TypeError(\u0027root must not be null or undefined\u0027);\n const result: T[] = [];\n if (depthFirst) {\n const stack: TreeNode\u003cT\u003e[] = [root];\n while (stack.length \u003e 0) {\n const node = stack.pop()!;\n result.push(node.value);\n for (let i = node.children.length - 1; i \u003e= 0; i--) {\n stack.push(node.children[i]);\n }\n }\n } else {\n const queue: TreeNode\u003cT\u003e[] = [root];\n while (queue.length \u003e 0) {\n const node = queue.shift()!;\n result.push(node.value);\n for (const child of node.children) {\n queue.push(child);\n }\n }\n }\n return result;\n}\n\nconst tree: TreeNode\u003cstring\u003e = {\n value: \u0027a\u0027,\n children: [\n { value: \u0027b\u0027, children: [{ value: \u0027d\u0027, children: [] }] },\n { value: \u0027c\u0027, children: [] }\n ]\n};\nassert.deepStrictEqual(flattenTree(tree), [\u0027a\u0027, \u0027b\u0027, \u0027d\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(flattenTree(tree, false), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027]);\n","assertions":"assert.throws(() =\u003e flattenTree(null as any), TypeError);\nconst doc = (flattenTree as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027depth-first\u0027) || dl.includes(\u0027depth first\u0027), \u0027must mention depth-first\u0027);\nassert.ok(dl.includes(\u0027breadth-first\u0027) || dl.includes(\u0027breadth first\u0027), \u0027must mention breadth-first\u0027);\nassert.ok(dl.includes(\u0027pre-order\u0027) || dl.includes(\u0027pre order\u0027) || dl.includes(\u0027preorder\u0027), \u0027must mention pre-order\u0027);\nassert.ok(dl.includes(\u0027left-to-right\u0027) || dl.includes(\u0027left to right\u0027), \u0027must mention left-to-right\u0027);\nassert.ok(dl.includes(\u0027new array\u0027) || dl.includes(\u0027without mutating\u0027), \u0027must mention non-mutation\u0027);\nassert.ok(dl.includes(\u0027typeerror\u0027), \u0027must mention TypeError\u0027);\n","category":"code2NL_NL2code"} {"id":"23","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ntype Transition\u003cS extends string, E extends string\u003e = {\n from: S; event: E; to: S; guard?: () =\u003e boolean;\n};\n\nclass StateMachine\u003cS extends string, E extends string\u003e {\n private current: S;\n private transitions: Transition\u003cS, E\u003e[];\n private history: Array\u003c{ from: S; event: E; to: S }\u003e;\n\n constructor(initial: S, transitions: Transition\u003cS, E\u003e[]) {\n this.current = initial;\n this.transitions = transitions;\n this.history = [];\n }\n\n send(event: E): S {\n const candidates = this.transitions.filter(\n t =\u003e t.from === this.current \u0026\u0026 t.event === event\n );\n for (const t of candidates) {\n if (!t.guard || t.guard()) {\n const from = this.current;\n this.current = t.to;\n this.history.push({ from, event, to: t.to });\n return this.current;\n }\n }\n return this.current;\n }\n\n getState(): S { return this.current; }\n getHistory(): Array\u003c{ from: S; event: E; to: S }\u003e { return [...this.history]; }\n}\n\nfunction describeStateMachine(): string {\n","golden_completion":" return \u0027A typed finite state machine that processes events via guarded transitions. \u0027 +\n \u0027The send method finds the first transition matching the current state and event whose guard returns true, \u0027 +\n \u0027then updates the state and appends the transition to an internal history log. \u0027 +\n \u0027If no matching transition or guard passes, the state remains unchanged and no history entry is added. \u0027 +\n \u0027getHistory returns a shallow copy of the transition log.\u0027;\n","suffix":"}\n\ntype S = \u0027idle\u0027 | \u0027loading\u0027 | \u0027done\u0027;\ntype E = \u0027fetch\u0027 | \u0027resolve\u0027;\nconst sm = new StateMachine\u003cS, E\u003e(\u0027idle\u0027, [\n { from: \u0027idle\u0027, event: \u0027fetch\u0027, to: \u0027loading\u0027 },\n { from: \u0027loading\u0027, event: \u0027resolve\u0027, to: \u0027done\u0027 }\n]);\nassert.strictEqual(sm.send(\u0027fetch\u0027), \u0027loading\u0027);\nassert.strictEqual(sm.send(\u0027resolve\u0027), \u0027done\u0027);\nassert.strictEqual(sm.getHistory().length, 2);\n","assertions":"const desc = describeStateMachine();\nassert.ok(typeof desc === \u0027string\u0027);\nconst dl = desc.toLowerCase();\nassert.ok(dl.includes(\u0027guard\u0027), \u0027must mention guards\u0027);\nassert.ok(dl.includes(\u0027first\u0027) \u0026\u0026 dl.includes(\u0027matching\u0027), \u0027must mention first matching transition\u0027);\nassert.ok(dl.includes(\u0027history\u0027) || dl.includes(\u0027log\u0027), \u0027must mention history/log\u0027);\nassert.ok(dl.includes(\u0027unchanged\u0027) || dl.includes(\u0027remains\u0027), \u0027must mention state unchanged on no match\u0027);\nassert.ok(dl.includes(\u0027shallow copy\u0027) || dl.includes(\u0027copy\u0027), \u0027must mention copy for getHistory\u0027);\nassert.ok(dl.includes(\u0027current state\u0027) || (dl.includes(\u0027current\u0027) \u0026\u0026 dl.includes(\u0027state\u0027)), \u0027must mention current state matching\u0027);\n","category":"code2NL_NL2code"} {"id":"24","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nfunction throttle\u003cT extends (...args: any[]) =\u003e any\u003e(\n fn: T, intervalMs: number, options: { leading?: boolean; trailing?: boolean } = {}\n): T \u0026 { cancel: () =\u003e void; doc?: string } {\n","golden_completion":" const result = (function(this: any, ...args: any[]) {\n // doc set below\n }) as any;\n result.doc =\n \u0027Throttle a function so it executes at most once per intervalMs milliseconds. \u0027 +\n \u0027Leading defaults to true (first call fires immediately); trailing defaults to false. \u0027 +\n \u0027When trailing is enabled, the last call during a throttled window is replayed after the interval. \u0027 +\n \u0027The cancel method clears any pending trailing invocation without affecting future calls.\u0027;\n","suffix":" const leading = options.leading !== false;\n const trailing = options.trailing === true;\n let lastCallTime: number | null = null;\n let timer: ReturnType\u003ctypeof setTimeout\u003e | null = null;\n let lastArgs: any[] | null = null;\n let lastThis: any = null;\n\n const throttled = function(this: any, ...args: any[]) {\n const now = Date.now();\n if (lastCallTime === null \u0026\u0026 !leading) lastCallTime = now;\n const remaining = intervalMs - (now - (lastCallTime ?? 0));\n lastArgs = args;\n lastThis = this;\n if (remaining \u003c= 0 || remaining \u003e intervalMs) {\n if (timer) { clearTimeout(timer); timer = null; }\n lastCallTime = now;\n fn.apply(this, args);\n lastArgs = null;\n } else if (!timer \u0026\u0026 trailing) {\n timer = setTimeout(() =\u003e {\n lastCallTime = Date.now();\n timer = null;\n fn.apply(lastThis!, lastArgs!);\n lastArgs = null;\n }, remaining);\n }\n } as any;\n\n throttled.cancel = () =\u003e {\n if (timer) { clearTimeout(timer); timer = null; }\n lastArgs = null;\n };\n throttled.doc = result.doc;\n return throttled as T \u0026 { cancel: () =\u003e void; doc?: string };\n}\n\nconst calls: number[] = [];\nconst throttled = throttle((x: number) =\u003e calls.push(x), 100);\nthrottled(1);\nassert.deepStrictEqual(calls, [1]);\n","assertions":"const t2 = throttle((x: number) =\u003e x, 50);\nconst doc = t2.doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc!.toLowerCase();\nassert.ok(dl.includes(\u0027at most once\u0027), \u0027must mention at most once\u0027);\nassert.ok(dl.includes(\u0027leading\u0027), \u0027must mention leading\u0027);\nassert.ok(dl.includes(\u0027trailing\u0027), \u0027must mention trailing\u0027);\nassert.ok(dl.includes(\u0027immediately\u0027) || dl.includes(\u0027first call\u0027), \u0027must mention immediate first call\u0027);\nassert.ok(dl.includes(\u0027replayed\u0027) || dl.includes(\u0027replay\u0027) || dl.includes(\u0027invoked after\u0027) || dl.includes(\u0027after the interval\u0027), \u0027must mention trailing replay\u0027);\nassert.ok(dl.includes(\u0027cancel\u0027), \u0027must mention cancel method\u0027);\nassert.ok(dl.includes(\u0027pending\u0027), \u0027must mention pending invocation in cancel\u0027);\n","category":"code2NL_NL2code"} {"id":"25","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Context {\n [key: string]: any;\n}\n\ntype Middleware = (ctx: Context, next: () =\u003e Promise\u003cvoid\u003e) =\u003e Promise\u003cvoid\u003e;\n\nclass Pipeline {\n private stack: Middleware[] = [];\n\n use(mw: Middleware): this {\n this.stack.push(mw);\n return this;\n }\n\n async run(ctx: Context): Promise\u003cContext\u003e {\n","golden_completion":" (Pipeline.prototype.run as any).doc =\n \u0027Execute the middleware stack in registration order using Koa-style compose. \u0027 +\n \u0027Each middleware receives the shared context and an async next function. \u0027 +\n \u0027Calling next exactly once invokes the downstream middleware; calling next more than once throws Error. \u0027 +\n \u0027Returns the mutated context after all middleware complete. Middleware that does not call next short-circuits the remaining stack.\u0027;\n","suffix":" let index = -1;\n const dispatch = async (i: number): Promise\u003cvoid\u003e =\u003e {\n if (i \u003c= index) throw new Error(\u0027next() called multiple times\u0027);\n index = i;\n if (i \u003c this.stack.length) {\n await this.stack[i](ctx, () =\u003e dispatch(i + 1));\n }\n };\n await dispatch(0);\n return ctx;\n }\n}\n\nconst p = new Pipeline();\np.use(async (ctx, next) =\u003e { ctx.order = [1]; await next(); ctx.order.push(4); });\np.use(async (ctx, next) =\u003e { ctx.order.push(2); await next(); ctx.order.push(3); });\np.run({}).then(ctx =\u003e assert.deepStrictEqual(ctx.order, [1, 2, 3, 4]));\n","assertions":"const p2 = new Pipeline();\np2.use(async (ctx, next) =\u003e { ctx.a = 1; });\np2.use(async (ctx, next) =\u003e { ctx.b = 2; });\np2.run({}).then(ctx =\u003e {\n assert.strictEqual(ctx.a, 1);\n assert.strictEqual(ctx.b, undefined);\n});\nconst doc = (Pipeline.prototype.run as any).doc;\nassert.ok(typeof doc === \u0027string\u0027);\nconst dl = doc.toLowerCase();\nassert.ok(dl.includes(\u0027registration order\u0027) || dl.includes(\u0027koa\u0027), \u0027must mention execution order or Koa\u0027);\nassert.ok(dl.includes(\u0027next\u0027), \u0027must mention next function\u0027);\nassert.ok(dl.includes(\u0027more than once\u0027) || dl.includes(\u0027multiple times\u0027), \u0027must mention double-next error\u0027);\nassert.ok(dl.includes(\u0027short-circuit\u0027) || dl.includes(\u0027short circuit\u0027), \u0027must mention short-circuiting\u0027);\nassert.ok(dl.includes(\u0027mutated\u0027) || dl.includes(\u0027shared\u0027), \u0027must mention mutated/shared context\u0027);\n","category":"code2NL_NL2code"} {"id":"26","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nclass Signal\u003cT\u003e {\n private _value: T;\n private _subscribers: Set\u003c() =\u003e void\u003e = new Set();\n\n constructor(initial: T) { this._value = initial; }\n\n get value(): T {\n if (Signal._tracking) Signal._tracking.add(this);\n return this._value;\n }\n\n set value(v: T) {\n if (v === this._value) return;\n this._value = v;\n for (const sub of this._subscribers) sub();\n }\n\n subscribe(fn: () =\u003e void): () =\u003e void {\n this._subscribers.add(fn);\n return () =\u003e this._subscribers.delete(fn);\n }\n\n static _tracking: Set\u003cSignal\u003cany\u003e\u003e | null = null;\n}\n\nfunction computed\u003cT\u003e(fn: () =\u003e T): { readonly value: T } {\n let cached: T;\n let dirty = true;\n const deps = new Set\u003cSignal\u003cany\u003e\u003e();\n const unsubs: Array\u003c() =\u003e void\u003e = [];\n\n const recompute = () =\u003e {\n for (const u of unsubs) u();\n unsubs.length = 0;\n deps.clear();\n Signal._tracking = deps;\n cached = fn();\n Signal._tracking = null;\n for (const dep of deps) {\n unsubs.push(dep.subscribe(() =\u003e { dirty = true; }));\n }\n dirty = false;\n };\n\n return {\n get value(): T {\n if (dirty) recompute();\n return cached;\n }\n };\n}\n\nfunction describeComputed(): string {\n","golden_completion":" return \u0027Creates a lazily-evaluated computed value that auto-tracks Signal dependencies via a global tracking set. \u0027 +\n \u0027On first access or after any dependency changes, the compute function re-runs and the result is cached. \u0027 +\n \u0027Dependencies are re-discovered on each recomputation by intercepting Signal.value reads. \u0027 +\n \u0027Old subscriptions are cleaned up before recomputation to avoid stale dependency leaks. \u0027 +\n \u0027Skips recomputation when no dependency has changed since the last evaluation.\u0027;\n","suffix":"}\n\nconst a = new Signal(2);\nconst b = new Signal(3);\nconst sum = computed(() =\u003e a.value + b.value);\nassert.strictEqual(sum.value, 5);\na.value = 10;\nassert.strictEqual(sum.value, 13);\n","assertions":"const desc = describeComputed();\nassert.ok(typeof desc === \u0027string\u0027);\nconst dl = desc.toLowerCase();\nassert.ok(dl.includes(\u0027lazily\u0027) || dl.includes(\u0027lazy\u0027), \u0027must mention lazy evaluation\u0027);\nassert.ok(dl.includes(\u0027auto-track\u0027) || dl.includes(\u0027auto track\u0027) || dl.includes(\u0027tracking\u0027), \u0027must mention auto-tracking\u0027);\nassert.ok(dl.includes(\u0027cached\u0027) || dl.includes(\u0027cache\u0027), \u0027must mention caching\u0027);\nassert.ok(dl.includes(\u0027re-discover\u0027) || dl.includes(\u0027rediscover\u0027) || dl.includes(\u0027re-run\u0027), \u0027must mention re-discovery\u0027);\nassert.ok(dl.includes(\u0027clean\u0027) || dl.includes(\u0027stale\u0027), \u0027must mention cleanup of old subscriptions\u0027);\nassert.ok(dl.includes(\u0027skip\u0027) || dl.includes(\u0027no dependency\u0027), \u0027must mention skip when unchanged\u0027);\n","category":"code2NL_NL2code"} {"id":"27","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n/**\n * Parse a simplified INI string into a nested object.\n * - Sections are denoted by [name] on their own line.\n * - Key=value pairs are split on the first \u0027=\u0027 only; both key and value are trimmed.\n * - Lines starting with \u0027;\u0027 or \u0027#\u0027 (after trimming) are comments and skipped.\n * - Blank lines are skipped.\n * - Keys before any section go under the \"__global__\" section.\n * - Duplicate keys within a section: last value wins.\n * - A malformed section header (no closing \u0027]\u0027) throws SyntaxError with the 1-based line number.\n */\nfunction parseINI(text: string): Record\u003cstring, Record\u003cstring, string\u003e\u003e {\n","golden_completion":" const result: Record\u003cstring, Record\u003cstring, string\u003e\u003e = {};\n let currentSection = \u0027__global__\u0027;\n result[currentSection] = {};\n const lines = text.split(/\\r?\\n/);\n for (let i = 0; i \u003c lines.length; i++) {\n const trimmed = lines[i].trim();\n if (trimmed === \u0027\u0027 || trimmed.startsWith(\u0027;\u0027) || trimmed.startsWith(\u0027#\u0027)) continue;\n if (trimmed.startsWith(\u0027[\u0027)) {\n const close = trimmed.indexOf(\u0027]\u0027);\n if (close \u003c 0) throw new SyntaxError(`Malformed section at line ${i + 1}`);\n currentSection = trimmed.slice(1, close).trim();\n if (!result[currentSection]) result[currentSection] = {};\n continue;\n }\n const eq = trimmed.indexOf(\u0027=\u0027);\n if (eq \u003e= 0) {\n result[currentSection][trimmed.slice(0, eq).trim()] = trimmed.slice(eq + 1).trim();\n }\n }\n return result;\n","suffix":"}\n\nconst ini = `\nname = app\n[db]\nhost = localhost\nport = 5432\n; comment\n[db]\nport = 3306\n`;\nconst parsed = parseINI(ini);\nassert.strictEqual(parsed[\u0027__global__\u0027][\u0027name\u0027], \u0027app\u0027);\nassert.strictEqual(parsed[\u0027db\u0027][\u0027host\u0027], \u0027localhost\u0027);\nassert.strictEqual(parsed[\u0027db\u0027][\u0027port\u0027], \u00273306\u0027);\n","assertions":"const r2 = parseINI(\u0027# comment\\n a = b = c \\n[s1]\\nk = v\u0027);\nassert.strictEqual(r2[\u0027__global__\u0027][\u0027a\u0027], \u0027b = c\u0027);\nassert.strictEqual(r2[\u0027s1\u0027][\u0027k\u0027], \u0027v\u0027);\nlet threw = false;\ntry { parseINI(\u0027[bad section\\nk=v\u0027); } catch(e: any) {\n threw = true;\n assert.ok(e instanceof SyntaxError);\n assert.ok(e.message.includes(\u00271\u0027));\n}\nassert.ok(threw, \u0027must throw SyntaxError\u0027);\nconst r3 = parseINI(\u0027\u0027);\nassert.deepStrictEqual(r3, { \u0027__global__\u0027: {} });\n","category":"code2NL_NL2code"} {"id":"28","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n/**\n * Perform a stable topological sort on a directed acyclic graph.\n * - `graph` maps each node to its list of dependencies (nodes it depends on).\n * - Nodes not in graph keys but appearing as dependencies are treated as having no deps.\n * - When multiple nodes are ready, they are emitted in alphabetical order (stable sort).\n * - If a cycle is detected, throw Error with message \u0027cycle detected\u0027.\n * - Returns an array of node names in dependency order (dependencies before dependents).\n */\nfunction topoSort(graph: Record\u003cstring, string[]\u003e): string[] {\n","golden_completion":" const allNodes = new Set\u003cstring\u003e();\n const inDegree: Record\u003cstring, number\u003e = {};\n const adj: Record\u003cstring, string[]\u003e = {};\n for (const [node, deps] of Object.entries(graph)) {\n allNodes.add(node);\n for (const d of deps) allNodes.add(d);\n }\n for (const n of allNodes) { inDegree[n] = 0; adj[n] = []; }\n for (const [node, deps] of Object.entries(graph)) {\n for (const d of deps) { adj[d].push(node); inDegree[node]++; }\n }\n const queue = [...allNodes].filter(n =\u003e inDegree[n] === 0).sort();\n const result: string[] = [];\n while (queue.length \u003e 0) {\n const node = queue.shift()!;\n result.push(node);\n for (const neighbor of adj[node]) {\n if (--inDegree[neighbor] === 0) {\n const idx = queue.findIndex(x =\u003e x \u003e neighbor);\n queue.splice(idx \u003c 0 ? queue.length : idx, 0, neighbor);\n }\n }\n }\n if (result.length \u003c allNodes.size) throw new Error(\u0027cycle detected\u0027);\n return result;\n","suffix":"}\n\nconst sorted = topoSort({ c: [\u0027a\u0027, \u0027b\u0027], b: [\u0027a\u0027], a: [] });\nassert.deepStrictEqual(sorted, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n","assertions":"const r2 = topoSort({ x: [\u0027y\u0027], y: [], z: [\u0027y\u0027] });\nassert.strictEqual(r2.indexOf(\u0027y\u0027), 0);\nassert.ok(r2.indexOf(\u0027x\u0027) \u003e r2.indexOf(\u0027y\u0027));\nassert.ok(r2.indexOf(\u0027z\u0027) \u003e r2.indexOf(\u0027y\u0027));\nassert.strictEqual(r2[1], \u0027x\u0027);\nassert.strictEqual(r2[2], \u0027z\u0027);\n\nlet cycleThrew = false;\ntry { topoSort({ a: [\u0027b\u0027], b: [\u0027a\u0027] }); } catch(e: any) {\n cycleThrew = true;\n assert.ok(e.message.includes(\u0027cycle detected\u0027));\n}\nassert.ok(cycleThrew);\n\nconst r3 = topoSort({ b: [\u0027a\u0027] });\nassert.deepStrictEqual(r3, [\u0027a\u0027, \u0027b\u0027]);\n","category":"code2NL_NL2code"} {"id":"29","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Token {\n type: \u0027string\u0027 | \u0027number\u0027 | \u0027ident\u0027 | \u0027symbol\u0027;\n value: string;\n}\n\n/**\n * Tokenize an expression string into an array of tokens.\n * Rules:\n * - Whitespace is skipped (spaces and tabs only).\n * - A string literal starts and ends with a double quote. Backslash escapes the next character.\n * The value includes the content WITHOUT surrounding quotes, with escapes resolved.\n * An unterminated string throws SyntaxError.\n * - A number is one or more digits optionally followed by \u0027.\u0027 and more digits. No leading \u0027+\u0027.\n * Value is the raw text (e.g., \"3.14\").\n * - An identifier starts with a letter or underscore, followed by letters, digits, or underscores.\n * - Anything else is a single-character symbol token.\n */\nfunction tokenize(input: string): Token[] {\n","golden_completion":" const tokens: Token[] = [];\n let i = 0;\n while (i \u003c input.length) {\n if (input[i] === \u0027 \u0027 || input[i] === \u0027\\t\u0027) { i++; continue; }\n if (input[i] === \u0027\"\u0027) {\n let s = \u0027\u0027;\n i++;\n while (i \u003c input.length \u0026\u0026 input[i] !== \u0027\"\u0027) {\n if (input[i] === \u0027\\\\\u0027) { i++; if (i \u003e= input.length) throw new SyntaxError(\u0027unterminated\u0027); s += input[i]; }\n else s += input[i];\n i++;\n }\n if (i \u003e= input.length) throw new SyntaxError(\u0027unterminated string\u0027);\n i++;\n tokens.push({ type: \u0027string\u0027, value: s });\n } else if (input[i] \u003e= \u00270\u0027 \u0026\u0026 input[i] \u003c= \u00279\u0027) {\n let n = \u0027\u0027;\n while (i \u003c input.length \u0026\u0026 input[i] \u003e= \u00270\u0027 \u0026\u0026 input[i] \u003c= \u00279\u0027) { n += input[i]; i++; }\n if (i \u003c input.length \u0026\u0026 input[i] === \u0027.\u0027) { n += \u0027.\u0027; i++; while (i \u003c input.length \u0026\u0026 input[i] \u003e= \u00270\u0027 \u0026\u0026 input[i] \u003c= \u00279\u0027) { n += input[i]; i++; } }\n tokens.push({ type: \u0027number\u0027, value: n });\n } else if (/[a-zA-Z_]/.test(input[i])) {\n let id = \u0027\u0027;\n while (i \u003c input.length \u0026\u0026 /[a-zA-Z0-9_]/.test(input[i])) { id += input[i]; i++; }\n tokens.push({ type: \u0027ident\u0027, value: id });\n } else {\n tokens.push({ type: \u0027symbol\u0027, value: input[i] }); i++;\n }\n }\n return tokens;\n","suffix":"}\n\nconst toks = tokenize(\u0027foo + 3.14\u0027);\nassert.strictEqual(toks.length, 3);\nassert.deepStrictEqual(toks[0], { type: \u0027ident\u0027, value: \u0027foo\u0027 });\nassert.deepStrictEqual(toks[1], { type: \u0027symbol\u0027, value: \u0027+\u0027 });\nassert.deepStrictEqual(toks[2], { type: \u0027number\u0027, value: \u00273.14\u0027 });\n","assertions":"const t2 = tokenize(\u0027\"he\\\\\\\\llo\" 42\u0027);\nassert.strictEqual(t2.length, 2);\nassert.deepStrictEqual(t2[0], { type: \u0027string\u0027, value: \u0027he\\\\llo\u0027 });\nassert.deepStrictEqual(t2[1], { type: \u0027number\u0027, value: \u002742\u0027 });\n\nconst t3 = tokenize(\u0027_x2 ()\u0027);\nassert.strictEqual(t3.length, 3);\nassert.deepStrictEqual(t3[0], { type: \u0027ident\u0027, value: \u0027_x2\u0027 });\n\nlet syntaxErr = false;\ntry { tokenize(\u0027\"unterminated\u0027); } catch(e: any) {\n syntaxErr = true;\n assert.ok(e instanceof SyntaxError);\n}\nassert.ok(syntaxErr);\n\nconst t4 = tokenize(\u0027\"a\\\\\"b\" ok\u0027);\nassert.deepStrictEqual(t4[0], { type: \u0027string\u0027, value: \u0027a\"b\u0027 });\n","category":"code2NL_NL2code"} {"id":"30","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface DiffHunk {\n type: \u0027equal\u0027 | \u0027insert\u0027 | \u0027delete\u0027;\n lines: string[];\n}\n\n/**\n * Compute a line-level diff between two strings.\n * - Split both strings on \u0027\\n\u0027 to get line arrays.\n * - Use longest common subsequence (LCS) to align equal lines.\n * - Return an array of DiffHunks: \u0027equal\u0027 for lines in both, \u0027delete\u0027 for lines only in `a`,\n * \u0027insert\u0027 for lines only in `b`.\n * - Adjacent operations of the same type are merged into a single hunk.\n * - Empty input strings produce a single-element array with an empty line [\"\"].\n */\nfunction lineDiff(a: string, b: string): DiffHunk[] {\n","golden_completion":" const linesA = a.split(\u0027\\n\u0027);\n const linesB = b.split(\u0027\\n\u0027);\n const m = linesA.length, n = linesB.length;\n const dp: number[][] = Array.from({ length: m + 1 }, () =\u003e Array(n + 1).fill(0));\n for (let i = 1; i \u003c= m; i++)\n for (let j = 1; j \u003c= n; j++)\n dp[i][j] = linesA[i-1] === linesB[j-1] ? dp[i-1][j-1] + 1 : Math.max(dp[i-1][j], dp[i][j-1]);\n const ops: DiffHunk[] = [];\n let i = m, j = n;\n const raw: DiffHunk[] = [];\n while (i \u003e 0 || j \u003e 0) {\n if (i \u003e 0 \u0026\u0026 j \u003e 0 \u0026\u0026 linesA[i-1] === linesB[j-1]) { raw.push({ type: \u0027equal\u0027, lines: [linesA[i-1]] }); i--; j--; }\n else if (j \u003e 0 \u0026\u0026 (i === 0 || dp[i][j-1] \u003e= dp[i-1][j])) { raw.push({ type: \u0027insert\u0027, lines: [linesB[j-1]] }); j--; }\n else { raw.push({ type: \u0027delete\u0027, lines: [linesA[i-1]] }); i--; }\n }\n raw.reverse();\n for (const h of raw) {\n if (ops.length \u003e 0 \u0026\u0026 ops[ops.length - 1].type === h.type) ops[ops.length - 1].lines.push(...h.lines);\n else ops.push({ type: h.type, lines: [...h.lines] });\n }\n return ops;\n","suffix":"}\n\nconst d1 = lineDiff(\u0027a\\nb\\nc\u0027, \u0027a\\nc\u0027);\nassert.deepStrictEqual(d1, [\n { type: \u0027equal\u0027, lines: [\u0027a\u0027] },\n { type: \u0027delete\u0027, lines: [\u0027b\u0027] },\n { type: \u0027equal\u0027, lines: [\u0027c\u0027] }\n]);\n","assertions":"const d2 = lineDiff(\u0027x\u0027, \u0027y\u0027);\nassert.strictEqual(d2.length, 2);\nassert.deepStrictEqual(d2[0], { type: \u0027delete\u0027, lines: [\u0027x\u0027] });\nassert.deepStrictEqual(d2[1], { type: \u0027insert\u0027, lines: [\u0027y\u0027] });\n\nconst d3 = lineDiff(\u0027a\\nb\u0027, \u0027a\\nb\\nc\u0027);\nassert.deepStrictEqual(d3, [\n { type: \u0027equal\u0027, lines: [\u0027a\u0027, \u0027b\u0027] },\n { type: \u0027insert\u0027, lines: [\u0027c\u0027] }\n]);\n\nconst d4 = lineDiff(\u0027\u0027, \u0027\u0027);\nassert.deepStrictEqual(d4, [{ type: \u0027equal\u0027, lines: [\u0027\u0027] }]);\n\nconst d5 = lineDiff(\u0027a\\nb\\nc\u0027, \u0027x\\ny\\nz\u0027);\nassert.strictEqual(d5.filter(h =\u003e h.type === \u0027equal\u0027).length, 0);\n","category":"code2NL_NL2code"} {"id":"31","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"function memoizeWithTTL\u003cA extends object, R\u003e(\n fn: (arg: A) =\u003e R,\n ttlMs: number\n): (arg: A) =\u003e R {\n const cache = new WeakMap\u003cA, { value: R; expiry: number }\u003e();\n return (arg: A): R =\u003e {\n const now = Date.now();\n if (cache.has(arg)) {\n const entry = cache.get(arg)!;\n if (now \u003c entry.expiry) {\n return entry.value;\n }\n }\n const result = fn(arg);\n cache.set(arg, { value: result, expiry: now + ttlMs });\n return result;\n };\n}\n\n","golden_completion":"memoizeWithTTL.doc = \u0027Creates a memoized version of a function that caches results in a WeakMap, constraining the argument type A to extend object so keys can be garbage-collected. Each cache entry stores both the computed value and an expiry timestamp calculated as Date.now() plus ttlMs. On subsequent calls, returns the cached value only if the current time is strictly less than the expiry; otherwise recomputes and overwrites the entry. The returned closure captures the WeakMap, so the cache persists across calls but does not prevent garbage collection of argument objects.\u0027;\n","suffix":"// Basic functionality\nconst fn1 = (obj: { n: number }) =\u003e obj.n * 2;\nconst memoized1 = memoizeWithTTL(fn1, 10000);\nconst arg1 = { n: 5 };\nconsole.assert(memoized1(arg1) === 10);\nconsole.assert(memoized1(arg1) === 10); // cached\nconsole.log(\u0027Task 31 suffix passed\u0027);\n","assertions":"const doc31 = (memoizeWithTTL as any).doc as string;\nconsole.assert(doc31.includes(\u0027WeakMap\u0027), \u0027must mention WeakMap\u0027);\nconsole.assert(doc31.includes(\u0027garbage-collect\u0027) || doc31.includes(\u0027garbage collect\u0027), \u0027must mention garbage collection\u0027);\nconsole.assert(doc31.includes(\u0027expiry\u0027) || doc31.includes(\u0027expiration\u0027), \u0027must mention expiry\u0027);\nconsole.assert(doc31.includes(\u0027Date.now\u0027) || doc31.includes(\u0027timestamp\u0027), \u0027must mention Date.now or timestamp\u0027);\nconsole.assert(doc31.includes(\u0027ttlMs\u0027) || doc31.includes(\u0027TTL\u0027), \u0027must mention ttlMs\u0027);\nconsole.assert(doc31.includes(\u0027closure\u0027) || doc31.includes(\u0027captures\u0027), \u0027must mention closure/captures\u0027);\nconsole.assert(doc31.includes(\u0027object\u0027) \u0026\u0026 (doc31.includes(\u0027constrain\u0027) || doc31.includes(\u0027extend\u0027)), \u0027must mention object constraint on A\u0027);\nconsole.log(\u0027Task 31 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"32","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"type Shape =\n | { kind: \u0027circle\u0027; radius: number }\n | { kind: \u0027rect\u0027; width: number; height: number }\n | { kind: \u0027triangle\u0027; base: number; height: number };\n\nfunction totalArea(shapes: Shape[]): number {\n let total = 0;\n for (const s of shapes) {\n switch (s.kind) {\n case \u0027circle\u0027:\n total += Math.PI * s.radius * s.radius;\n break;\n case \u0027rect\u0027:\n total += s.width * s.height;\n break;\n case \u0027triangle\u0027:\n total += 0.5 * s.base * s.height;\n break;\n default:\n const _exhaustive: never = s;\n throw new Error(\u0027Unhandled shape: \u0027 + (_exhaustive as any));\n }\n }\n return total;\n}\n\n","golden_completion":"totalArea.doc = \u0027Computes the sum of areas for an array of discriminated union Shape values by switching on the kind discriminant. For circle uses PI*r^2, for rect uses width*height, for triangle uses 0.5*base*height. Accumulates into a mutable total variable using a for-of loop. Includes an exhaustiveness check via a never-typed default case that throws an Error if an unhandled variant is encountered at runtime, ensuring compile-time safety when new variants are added to the Shape union.\u0027;\n","suffix":"const shapes: Shape[] = [\n { kind: \u0027circle\u0027, radius: 1 },\n { kind: \u0027rect\u0027, width: 2, height: 3 },\n { kind: \u0027triangle\u0027, base: 4, height: 5 },\n];\nconst result32 = totalArea(shapes);\nconsole.assert(Math.abs(result32 - (Math.PI + 6 + 10)) \u003c 0.001);\nconsole.log(\u0027Task 32 suffix passed\u0027);\n","assertions":"const doc32 = (totalArea as any).doc as string;\nconsole.assert(doc32.includes(\u0027discriminat\u0027) || doc32.includes(\u0027kind\u0027), \u0027must mention discriminant or kind\u0027);\nconsole.assert(doc32.includes(\u0027never\u0027), \u0027must mention never type for exhaustiveness\u0027);\nconsole.assert(doc32.includes(\u0027exhaustive\u0027) || doc32.includes(\u0027exhaustiveness\u0027), \u0027must mention exhaustiveness check\u0027);\nconsole.assert(doc32.includes(\u0027throw\u0027) || doc32.includes(\u0027Error\u0027), \u0027must mention throwing on unhandled\u0027);\nconsole.assert(doc32.includes(\u0027PI\u0027) || doc32.includes(\u0027pi\u0027) || doc32.includes(\u0027Math.PI\u0027), \u0027must mention PI for circle\u0027);\nconsole.assert(doc32.includes(\u00270.5\u0027) || doc32.includes(\u0027half\u0027), \u0027must mention 0.5 for triangle\u0027);\nconsole.assert(doc32.includes(\u0027mutable\u0027) || doc32.includes(\u0027accumulate\u0027) || doc32.includes(\u0027sum\u0027), \u0027must mention accumulation\u0027);\nconsole.log(\u0027Task 32 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"33","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"interface Config {\n readonly host: string;\n readonly port: number;\n readonly retries: number;\n readonly timeout: number;\n}\n\nclass ConfigBuilder {\n private _host: string = \u0027localhost\u0027;\n private _port: number = 8080;\n private _retries: number = 3;\n private _timeout: number = 5000;\n\n host(h: string): this { this._host = h; return this; }\n port(p: number): this { this._port = p; return this; }\n retries(r: number): this { this._retries = r; return this; }\n timeout(t: number): this { this._timeout = t; return this; }\n\n build(): Readonly\u003cConfig\u003e {\n return Object.freeze({\n host: this._host,\n port: this._port,\n retries: this._retries,\n timeout: this._timeout,\n });\n }\n}\n\n","golden_completion":"(ConfigBuilder.prototype as any).doc = \u0027A fluent builder for Config objects where each setter method (host, port, retries, timeout) mutates private state and returns this for method chaining. Private fields have defaults: localhost, 8080, 3, and 5000. The build() method creates a new Config object and freezes it with Object.freeze, making the returned object truly immutable at runtime rather than just at the type level. Each setter returns this typed as the polymorphic this-type, enabling correct chaining in subclasses.\u0027;\n","suffix":"const cfg = new ConfigBuilder()\n .host(\u0027example.com\u0027)\n .port(443)\n .retries(5)\n .build();\nconsole.assert(cfg.host === \u0027example.com\u0027);\nconsole.assert(cfg.port === 443);\nconsole.assert(cfg.retries === 5);\nconsole.assert(cfg.timeout === 5000);\nconsole.assert(Object.isFrozen(cfg));\nconsole.log(\u0027Task 33 suffix passed\u0027);\n","assertions":"const doc33 = (ConfigBuilder.prototype as any).doc as string;\nconsole.assert(doc33.includes(\u0027Object.freeze\u0027) || doc33.includes(\u0027freeze\u0027), \u0027must mention Object.freeze\u0027);\nconsole.assert(doc33.includes(\u0027immutable\u0027) || doc33.includes(\u0027frozen\u0027), \u0027must mention immutability\u0027);\nconsole.assert(doc33.includes(\u0027runtime\u0027), \u0027must mention runtime immutability\u0027);\nconsole.assert(doc33.includes(\u0027this\u0027) \u0026\u0026 (doc33.includes(\u0027chain\u0027) || doc33.includes(\u0027fluent\u0027)), \u0027must mention this-return for chaining\u0027);\nconsole.assert(doc33.includes(\u0027default\u0027) || doc33.includes(\u0027localhost\u0027), \u0027must mention default values\u0027);\nconsole.assert(doc33.includes(\u0027private\u0027) || doc33.includes(\u0027_\u0027), \u0027must mention private state\u0027);\nconsole.assert(doc33.includes(\u0027polymorphic\u0027) || doc33.includes(\u0027subclass\u0027), \u0027must mention polymorphic this or subclass support\u0027);\nconsole.log(\u0027Task 33 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"34","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"function createRetrier(maxAttempts: number, baseDelayMs: number) {\n let attemptCount = 0;\n let lastDelay = 0;\n\n return {\n async attempt\u003cT\u003e(fn: () =\u003e Promise\u003cT\u003e): Promise\u003cT\u003e {\n attemptCount++;\n try {\n const result = await fn();\n attemptCount = 0;\n lastDelay = 0;\n return result;\n } catch (err) {\n if (attemptCount \u003e= maxAttempts) {\n attemptCount = 0;\n lastDelay = 0;\n throw err;\n }\n lastDelay = baseDelayMs * Math.pow(2, attemptCount - 1);\n await new Promise(r =\u003e setTimeout(r, lastDelay));\n return this.attempt(fn);\n }\n },\n getAttemptCount(): number { return attemptCount; },\n getLastDelay(): number { return lastDelay; },\n };\n}\n\n","golden_completion":"(createRetrier as any).doc = \u0027Factory that returns a stateful retrier object with closure-captured attemptCount and lastDelay variables. The attempt() method is generic over T and accepts an async function. On success, it resets both counters to zero and returns the result. On failure, if attemptCount reaches maxAttempts, it resets counters and re-throws the original error. Otherwise it computes exponential backoff as baseDelayMs * 2^(attemptCount-1), waits via setTimeout wrapped in a Promise, then recursively retries via this.attempt(fn). The getAttemptCount and getLastDelay methods expose the mutable closure state for inspection.\u0027;\n","suffix":"const retrier = createRetrier(3, 100);\nlet callCount = 0;\nconst succeedOnThird = async () =\u003e {\n callCount++;\n if (callCount \u003c 3) throw new Error(\u0027fail\u0027);\n return \u0027ok\u0027;\n};\nretrier.attempt(succeedOnThird).then(result =\u003e {\n console.assert(result === \u0027ok\u0027);\n console.assert(retrier.getAttemptCount() === 0); // reset on success\n console.log(\u0027Task 34 suffix passed\u0027);\n});\n","assertions":"const doc34 = (createRetrier as any).doc as string;\nconsole.assert(doc34.includes(\u0027closure\u0027) || doc34.includes(\u0027captured\u0027), \u0027must mention closure-captured state\u0027);\nconsole.assert(doc34.includes(\u0027attemptCount\u0027) || doc34.includes(\u0027attempt count\u0027), \u0027must mention attemptCount\u0027);\nconsole.assert(doc34.includes(\u0027exponential\u0027) || doc34.includes(\u00272^\u0027), \u0027must mention exponential backoff\u0027);\nconsole.assert(doc34.includes(\u0027baseDelayMs\u0027) || doc34.includes(\u0027base delay\u0027), \u0027must mention baseDelayMs\u0027);\nconsole.assert(doc34.includes(\u0027reset\u0027) || doc34.includes(\u0027zero\u0027), \u0027must mention counter reset on success\u0027);\nconsole.assert(doc34.includes(\u0027re-throw\u0027) || doc34.includes(\u0027rethrow\u0027) || doc34.includes(\u0027throw\u0027), \u0027must mention re-throwing after max attempts\u0027);\nconsole.assert(doc34.includes(\u0027recursive\u0027) || doc34.includes(\u0027recursively\u0027) || doc34.includes(\u0027this.attempt\u0027), \u0027must mention recursive retry\u0027);\nconsole.assert(doc34.includes(\u0027setTimeout\u0027) || doc34.includes(\u0027Promise\u0027), \u0027must mention setTimeout/Promise wait mechanism\u0027);\nconsole.log(\u0027Task 34 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"35","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"class TypedEmitter\u003cEvents extends Record\u003cstring, unknown[]\u003e\u003e {\n private handlers = new Map\u003ckeyof Events, Set\u003cFunction\u003e\u003e();\n\n on\u003cK extends keyof Events\u003e(event: K, handler: (...args: Events[K]) =\u003e void): () =\u003e void {\n if (!this.handlers.has(event)) {\n this.handlers.set(event, new Set());\n }\n this.handlers.get(event)!.add(handler);\n return () =\u003e { this.handlers.get(event)?.delete(handler); };\n }\n\n once\u003cK extends keyof Events\u003e(event: K, handler: (...args: Events[K]) =\u003e void): () =\u003e void {\n const wrapper = (...args: Events[K]) =\u003e {\n this.handlers.get(event)?.delete(wrapper);\n handler(...args);\n };\n return this.on(event, wrapper);\n }\n\n emit\u003cK extends keyof Events\u003e(event: K, ...args: Events[K]): void {\n const set = this.handlers.get(event);\n if (set) {\n for (const fn of [...set]) {\n fn(...args);\n }\n }\n }\n}\n\n","golden_completion":"(TypedEmitter.prototype as any).doc = \u0027A generic event emitter parameterized by an Events record mapping event names to argument tuples, providing compile-time type safety for event payloads. on() registers a handler in a Map\u003ckeyof Events, Set\u003cFunction\u003e\u003e and returns an unsubscribe function that deletes the handler from the Set. once() wraps the handler so that the wrapper removes itself from the Set before invoking the original handler, ensuring single-fire semantics. emit() copies the handler Set into an array via spread before iterating, preventing mutations during iteration when once-handlers remove themselves.\u0027;\n","suffix":"type MyEvents = {\n data: [number, string];\n close: [];\n};\nconst emitter = new TypedEmitter\u003cMyEvents\u003e();\nlet dataCalls = 0;\nconst unsub = emitter.on(\u0027data\u0027, (n, s) =\u003e { dataCalls++; });\nemitter.emit(\u0027data\u0027, 42, \u0027hello\u0027);\nconsole.assert(dataCalls === 1);\nunsub();\nemitter.emit(\u0027data\u0027, 99, \u0027world\u0027);\nconsole.assert(dataCalls === 1); // unsubscribed\nlet onceCalls = 0;\nemitter.once(\u0027close\u0027, () =\u003e { onceCalls++; });\nemitter.emit(\u0027close\u0027);\nemitter.emit(\u0027close\u0027);\nconsole.assert(onceCalls === 1);\nconsole.log(\u0027Task 35 suffix passed\u0027);\n","assertions":"const doc35 = (TypedEmitter.prototype as any).doc as string;\nconsole.assert(doc35.includes(\u0027Map\u0027) \u0026\u0026 doc35.includes(\u0027Set\u0027), \u0027must mention Map and Set storage\u0027);\nconsole.assert(doc35.includes(\u0027unsubscribe\u0027) || doc35.includes(\u0027unsub\u0027) || doc35.includes(\u0027delete\u0027), \u0027must mention unsubscribe/delete\u0027);\nconsole.assert(doc35.includes(\u0027wrapper\u0027) || doc35.includes(\u0027wraps\u0027), \u0027must mention once wrapper pattern\u0027);\nconsole.assert(doc35.includes(\u0027removes itself\u0027) || doc35.includes(\u0027delete\u0027) || doc35.includes(\u0027single-fire\u0027), \u0027must mention self-removal in once\u0027);\nconsole.assert(doc35.includes(\u0027spread\u0027) || doc35.includes(\u0027copy\u0027) || doc35.includes(\u0027array\u0027), \u0027must mention copying Set before iteration\u0027);\nconsole.assert(doc35.includes(\u0027mutation\u0027) || doc35.includes(\u0027concurrent\u0027) || doc35.includes(\u0027iteration\u0027), \u0027must mention preventing mutation during iteration\u0027);\nconsole.assert(doc35.includes(\u0027type safety\u0027) || doc35.includes(\u0027type-safe\u0027) || doc35.includes(\u0027compile-time\u0027), \u0027must mention type safety\u0027);\nconsole.log(\u0027Task 35 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"36","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"type Context = { path: string; headers: Record\u003cstring, string\u003e; body: string; status: number };\ntype Middleware = (ctx: Context, next: () =\u003e Promise\u003cvoid\u003e) =\u003e Promise\u003cvoid\u003e;\n\nfunction compose(middlewares: Middleware[]): (ctx: Context) =\u003e Promise\u003cvoid\u003e {\n return function(ctx: Context) {\n let index = -1;\n function dispatch(i: number): Promise\u003cvoid\u003e {\n if (i \u003c= index) return Promise.reject(new Error(\u0027next() called multiple times\u0027));\n index = i;\n const fn = middlewares[i];\n if (!fn) return Promise.resolve();\n return Promise.resolve(fn(ctx, () =\u003e dispatch(i + 1)));\n }\n return dispatch(0);\n };\n}\n\n","golden_completion":"(compose as any).doc = \u0027Composes an array of async middleware functions into a single handler using an index-tracking dispatch mechanism. Each middleware receives a shared mutable Context and a next function that advances to the next middleware via dispatch(i+1). The dispatch function guards against calling next() multiple times by checking if the current index i is less than or equal to the last dispatched index, rejecting with an Error if so. When the middleware array is exhausted (no function at index i), dispatch resolves with Promise.resolve(). Middlewares execute in insertion order and can perform work both before and after calling next(), enabling downstream-then-upstream processing like Koa.\u0027;\n","suffix":"const log: string[] = [];\nconst mw1: Middleware = async (ctx, next) =\u003e { log.push(\u0027a-before\u0027); await next(); log.push(\u0027a-after\u0027); };\nconst mw2: Middleware = async (ctx, next) =\u003e { log.push(\u0027b-before\u0027); ctx.status = 200; await next(); log.push(\u0027b-after\u0027); };\nconst mw3: Middleware = async (ctx, next) =\u003e { log.push(\u0027c\u0027); };\nconst handler = compose([mw1, mw2, mw3]);\nhandler({ path: \u0027/\u0027, headers: {}, body: \u0027\u0027, status: 0 }).then(() =\u003e {\n console.assert(log.join(\u0027,\u0027) === \u0027a-before,b-before,c,b-after,a-after\u0027);\n console.log(\u0027Task 36 suffix passed\u0027);\n});\n","assertions":"const doc36 = (compose as any).doc as string;\nconsole.assert(doc36.includes(\u0027dispatch\u0027) || doc36.includes(\u0027index\u0027), \u0027must mention dispatch/index mechanism\u0027);\nconsole.assert(doc36.includes(\u0027next()\u0027) || doc36.includes(\u0027next function\u0027), \u0027must mention next\u0027);\nconsole.assert(doc36.includes(\u0027multiple times\u0027) || doc36.includes(\u0027guard\u0027), \u0027must mention next-called-multiple-times guard\u0027);\nconsole.assert(doc36.includes(\u0027reject\u0027) || doc36.includes(\u0027Error\u0027), \u0027must mention rejection on double-next\u0027);\nconsole.assert(doc36.includes(\u0027mutable\u0027) || doc36.includes(\u0027shared\u0027), \u0027must mention shared/mutable context\u0027);\nconsole.assert(doc36.includes(\u0027before\u0027) \u0026\u0026 doc36.includes(\u0027after\u0027), \u0027must mention before-and-after next() processing\u0027);\nconsole.assert(doc36.includes(\u0027Promise.resolve\u0027) || doc36.includes(\u0027resolves\u0027), \u0027must mention resolution when array exhausted\u0027);\nconsole.log(\u0027Task 36 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"37","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"class LazySeq\u003cT\u003e {\n constructor(private generator: () =\u003e Generator\u003cT\u003e) {}\n\n static from\u003cU\u003e(arr: U[]): LazySeq\u003cU\u003e {\n return new LazySeq(function* () { yield* arr; });\n }\n\n map\u003cU\u003e(fn: (item: T) =\u003e U): LazySeq\u003cU\u003e {\n const gen = this.generator;\n return new LazySeq(function* () {\n for (const item of gen()) {\n yield fn(item);\n }\n });\n }\n\n filter(pred: (item: T) =\u003e boolean): LazySeq\u003cT\u003e {\n const gen = this.generator;\n return new LazySeq(function* () {\n for (const item of gen()) {\n if (pred(item)) yield item;\n }\n });\n }\n\n take(n: number): T[] {\n const result: T[] = [];\n for (const item of this.generator()) {\n if (result.length \u003e= n) break;\n result.push(item);\n }\n return result;\n }\n\n toArray(): T[] {\n return [...this.generator()];\n }\n}\n\n","golden_completion":"(LazySeq.prototype as any).doc = \u0027A lazy sequence wrapper that stores a generator factory function and defers all computation until terminal operations (take or toArray) are called. from() creates a LazySeq by wrapping an array in a generator using yield*. map() and filter() return new LazySeq instances with composed generator factories that chain transformations without executing them, enabling lazy evaluation. take(n) eagerly materializes at most n items by breaking out of the generator loop, avoiding full traversal. toArray() materializes all items via spread into the generator. Each call to a terminal method creates a fresh generator from the factory, so the sequence is replayable.\u0027;\n","suffix":"const seq = LazySeq.from([1, 2, 3, 4, 5])\n .map(x =\u003e x * 10)\n .filter(x =\u003e x \u003e 20);\nconsole.assert(JSON.stringify(seq.take(2)) === \u0027[30,40]\u0027);\nconsole.assert(JSON.stringify(seq.toArray()) === \u0027[30,40,50]\u0027);\n// Replayable\nconsole.assert(JSON.stringify(seq.toArray()) === \u0027[30,40,50]\u0027);\nconsole.log(\u0027Task 37 suffix passed\u0027);\n","assertions":"const doc37 = (LazySeq.prototype as any).doc as string;\nconsole.assert(doc37.includes(\u0027generator\u0027) || doc37.includes(\u0027Generator\u0027), \u0027must mention generator\u0027);\nconsole.assert(doc37.includes(\u0027lazy\u0027) || doc37.includes(\u0027defer\u0027), \u0027must mention lazy/deferred evaluation\u0027);\nconsole.assert(doc37.includes(\u0027factory\u0027) || doc37.includes(\u0027stored\u0027), \u0027must mention generator factory\u0027);\nconsole.assert(doc37.includes(\u0027yield*\u0027) || doc37.includes(\u0027yield\u0027), \u0027must mention yield\u0027);\nconsole.assert(doc37.includes(\u0027replayable\u0027) || doc37.includes(\u0027fresh\u0027) || doc37.includes(\u0027re-create\u0027), \u0027must mention replayability\u0027);\nconsole.assert(doc37.includes(\u0027take\u0027) \u0026\u0026 (doc37.includes(\u0027break\u0027) || doc37.includes(\u0027at most\u0027)), \u0027must mention take breaks early\u0027);\nconsole.assert(doc37.includes(\u0027compose\u0027) || doc37.includes(\u0027chain\u0027), \u0027must mention composition/chaining of transforms\u0027);\nconsole.log(\u0027Task 37 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"38","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"// Implement deepPartialEqual(obj, partial) that returns true if every\n// property in \u0027partial\u0027 exists in \u0027obj\u0027 with the same value, recursively.\n// Properties in \u0027obj\u0027 that are NOT in \u0027partial\u0027 are ignored.\n//\n// Rules:\n// 1. For primitives (non-objects, null): use strict equality (===)\n// 2. For arrays: partial must be an array of the same length,\n// and deepPartialEqual must hold for each corresponding element\n// 3. For plain objects: every key in partial must exist in obj,\n// and deepPartialEqual must hold for each such key\u0027s value\n// 4. If partial is null or undefined, obj must also be null or undefined respectively (===)\n// 5. If partial is an empty object {}, it matches ANY object (vacuously true)\n//\n","golden_completion":"function deepPartialEqual(obj: any, partial: any): boolean {\n if (partial === null || partial === undefined) return obj === partial;\n if (typeof partial !== \u0027object\u0027) return obj === partial;\n if (Array.isArray(partial)) {\n if (!Array.isArray(obj) || obj.length !== partial.length) return false;\n return partial.every((v: any, i: number) =\u003e deepPartialEqual(obj[i], v));\n }\n if (typeof obj !== \u0027object\u0027 || obj === null) return false;\n return Object.keys(partial).every(k =\u003e k in obj \u0026\u0026 deepPartialEqual(obj[k], partial[k]));\n}\n","suffix":"// Basic match\nconsole.assert(deepPartialEqual({ a: 1, b: 2, c: 3 }, { a: 1, c: 3 }) === true);\n// Nested match\nconsole.assert(deepPartialEqual({ a: { b: { c: 1 } } }, { a: { b: { c: 1 } } }) === true);\n// Extra keys in obj OK\nconsole.assert(deepPartialEqual({ a: 1, b: 2 }, { a: 1 }) === true);\n// Missing key in obj\nconsole.assert(deepPartialEqual({ a: 1 }, { a: 1, b: 2 }) === false);\n// Array length mismatch\nconsole.assert(deepPartialEqual([1, 2, 3], [1, 2]) === false);\nconsole.log(\u0027Task 38 suffix passed\u0027);\n","assertions":"// Empty partial matches anything\nconsole.assert(deepPartialEqual({ a: 1 }, {}) === true);\nconsole.assert(deepPartialEqual({}, {}) === true);\n// Null/undefined strict equality\nconsole.assert(deepPartialEqual(null, null) === true);\nconsole.assert(deepPartialEqual(undefined, undefined) === true);\nconsole.assert(deepPartialEqual(null, undefined) === false);\nconsole.assert(deepPartialEqual(0, null) === false);\n// Nested partial\nconsole.assert(deepPartialEqual({ a: { b: 1, c: 2 } }, { a: { b: 1 } }) === true);\nconsole.assert(deepPartialEqual({ a: { b: 1 } }, { a: { b: 2 } }) === false);\n// Array with objects\nconsole.assert(deepPartialEqual([{ a: 1, b: 2 }], [{ a: 1 }]) === true);\n// Primitives\nconsole.assert(deepPartialEqual(42, 42) === true);\nconsole.assert(deepPartialEqual(\u0027hello\u0027, \u0027hello\u0027) === true);\nconsole.assert(deepPartialEqual(42, 43) === false);\n// Partial is object, obj is primitive\nconsole.assert(deepPartialEqual(42, { a: 1 }) === false);\nconsole.log(\u0027Task 38 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"39","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"// Implement topologicalSort(edges) that returns a valid topological\n// ordering of nodes, or throws an Error(\u0027cycle detected\u0027) if one exists.\n//\n// edges is an array of [from, to] pairs representing a directed graph.\n// ALL nodes mentioned in edges must appear in the output.\n//\n// Rules:\n// 1. If multiple valid orderings exist, prefer LEXICOGRAPHICALLY SMALLEST\n// node first (e.g., between \u0027a\u0027 and \u0027b\u0027, pick \u0027a\u0027)\n// 2. Nodes are strings\n// 3. Empty edges array returns empty array\n// 4. Self-loops count as cycles (e.g., [\u0027a\u0027, \u0027a\u0027])\n//\n","golden_completion":"function topologicalSort(edges: [string, string][]): string[] {\n const graph = new Map\u003cstring, Set\u003cstring\u003e\u003e();\n const indegree = new Map\u003cstring, number\u003e();\n for (const [from, to] of edges) {\n if (!graph.has(from)) { graph.set(from, new Set()); indegree.set(from, indegree.get(from) ?? 0); }\n if (!graph.has(to)) { graph.set(to, new Set()); indegree.set(to, indegree.get(to) ?? 0); }\n if (!graph.get(from)!.has(to)) { graph.get(from)!.add(to); indegree.set(to, (indegree.get(to) ?? 0) + 1); }\n }\n const queue: string[] = [];\n for (const [node, deg] of indegree) { if (deg === 0) queue.push(node); }\n queue.sort();\n const result: string[] = [];\n while (queue.length \u003e 0) {\n const node = queue.shift()!;\n result.push(node);\n for (const neighbor of graph.get(node)!) {\n indegree.set(neighbor, indegree.get(neighbor)! - 1);\n if (indegree.get(neighbor) === 0) {\n queue.push(neighbor);\n queue.sort();\n }\n }\n }\n if (result.length !== graph.size) throw new Error(\u0027cycle detected\u0027);\n return result;\n}\n","suffix":"// Simple chain\nconst r1 = topologicalSort([[\u0027a\u0027, \u0027b\u0027], [\u0027b\u0027, \u0027c\u0027]]);\nconsole.assert(JSON.stringify(r1) === \u0027[\"a\",\"b\",\"c\"]\u0027);\n\n// Multiple valid orderings — prefer lex smallest\nconst r2 = topologicalSort([[\u0027c\u0027, \u0027d\u0027], [\u0027a\u0027, \u0027b\u0027]]);\nconsole.assert(r2[0] === \u0027a\u0027 || r2[0] === \u0027c\u0027); // both have indegree 0\nconsole.assert(r2.indexOf(\u0027a\u0027) \u003c r2.indexOf(\u0027b\u0027));\nconsole.assert(r2.indexOf(\u0027c\u0027) \u003c r2.indexOf(\u0027d\u0027));\n\n// Cycle detection\nlet threw = false;\ntry { topologicalSort([[\u0027a\u0027, \u0027b\u0027], [\u0027b\u0027, \u0027a\u0027]]); } catch (e: any) {\n threw = true;\n console.assert(e.message === \u0027cycle detected\u0027);\n}\nconsole.assert(threw);\n\n// Empty\nconsole.assert(JSON.stringify(topologicalSort([])) === \u0027[]\u0027);\nconsole.log(\u0027Task 39 suffix passed\u0027);\n","assertions":"// Self-loop is a cycle\nlet threw2 = false;\ntry { topologicalSort([[\u0027a\u0027, \u0027a\u0027]]); } catch (e: any) { threw2 = true; console.assert(e.message === \u0027cycle detected\u0027); }\nconsole.assert(threw2, \u0027self-loop must be detected as cycle\u0027);\n\n// Lex order when all independent\nconst r3 = topologicalSort([[\u0027c\u0027, \u0027d\u0027], [\u0027a\u0027, \u0027b\u0027], [\u0027e\u0027, \u0027f\u0027]]);\nconsole.assert(r3[0] === \u0027a\u0027, \u0027lex smallest first: \u0027 + r3[0]);\n\n// Diamond — no cycle\nconst r4 = topologicalSort([[\u0027a\u0027, \u0027b\u0027], [\u0027a\u0027, \u0027c\u0027], [\u0027b\u0027, \u0027d\u0027], [\u0027c\u0027, \u0027d\u0027]]);\nconsole.assert(r4[0] === \u0027a\u0027);\nconsole.assert(r4[r4.length - 1] === \u0027d\u0027);\n\n// Longer cycle\nlet threw3 = false;\ntry { topologicalSort([[\u0027a\u0027, \u0027b\u0027], [\u0027b\u0027, \u0027c\u0027], [\u0027c\u0027, \u0027a\u0027]]); } catch (e: any) { threw3 = true; }\nconsole.assert(threw3, \u0027longer cycle must be detected\u0027);\n\n// Duplicate edges should not cause issues\nconst r5 = topologicalSort([[\u0027a\u0027, \u0027b\u0027], [\u0027a\u0027, \u0027b\u0027]]);\nconsole.assert(JSON.stringify(r5) === \u0027[\"a\",\"b\"]\u0027);\nconsole.log(\u0027Task 39 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"40","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"// Implement deepClone(value) that creates a deep copy of the input.\n//\n// Rules:\n// 1. Primitives (number, string, boolean, null, undefined): return as-is\n// 2. Date objects: return a new Date with the same time value\n// 3. RegExp objects: return a new RegExp with the same pattern and flags\n// 4. Arrays: recursively clone each element\n// 5. Plain objects: recursively clone each own enumerable property\n// 6. Circular references: must be preserved (NOT cause infinite recursion).\n// If object A references object B which references A, the clone must\n// have the same circular structure (cloneA.b.a === cloneA)\n// 7. Use a Map to track already-cloned objects for circular reference support\n//\n","golden_completion":"function deepClone\u003cT\u003e(value: T, seen = new Map\u003cany, any\u003e()): T {\n if (value === null || typeof value !== \u0027object\u0027) return value;\n if (seen.has(value)) return seen.get(value);\n if (value instanceof Date) return new Date(value.getTime()) as any;\n if (value instanceof RegExp) return new RegExp(value.source, value.flags) as any;\n const clone: any = Array.isArray(value) ? [] : {};\n seen.set(value, clone);\n for (const key of Object.keys(value as any)) {\n clone[key] = deepClone((value as any)[key], seen);\n }\n return clone;\n}\n","suffix":"// Basic deep clone\nconst orig = { a: 1, b: { c: [2, 3] }, d: new Date(\u00272024-01-01\u0027), e: /test/gi };\nconst cloned = deepClone(orig);\nconsole.assert(cloned.a === 1);\nconsole.assert(cloned.b.c[0] === 2);\nconsole.assert(cloned.b !== orig.b);\nconsole.assert(cloned.b.c !== orig.b.c);\nconsole.assert(cloned.d instanceof Date);\nconsole.assert(cloned.d.getTime() === orig.d.getTime());\nconsole.assert(cloned.d !== orig.d);\nconsole.assert(cloned.e instanceof RegExp);\nconsole.assert(cloned.e.source === \u0027test\u0027 \u0026\u0026 cloned.e.flags === \u0027gi\u0027);\n\n// Circular reference\nconst circ: any = { x: 1 };\ncirc.self = circ;\nconst clonedCirc = deepClone(circ);\nconsole.assert(clonedCirc.self === clonedCirc);\nconsole.assert(clonedCirc !== circ);\nconsole.log(\u0027Task 40 suffix passed\u0027);\n","assertions":"// Primitives pass through\nconsole.assert(deepClone(42) === 42);\nconsole.assert(deepClone(\u0027hi\u0027) === \u0027hi\u0027);\nconsole.assert(deepClone(null) === null);\nconsole.assert(deepClone(undefined) === undefined);\nconsole.assert(deepClone(true) === true);\n\n// Nested arrays\nconst arr = [[1, 2], [3, [4, 5]]];\nconst arrClone = deepClone(arr);\nconsole.assert(JSON.stringify(arrClone) === \u0027[[1,2],[3,[4,5]]]\u0027);\nconsole.assert(arrClone[1] !== arr[1]);\n\n// Mutual circular reference\nconst a: any = { name: \u0027a\u0027 };\nconst b: any = { name: \u0027b\u0027 };\na.ref = b;\nb.ref = a;\nconst ca = deepClone(a);\nconsole.assert(ca.ref.ref === ca, \u0027mutual circular ref must be preserved\u0027);\nconsole.assert(ca.ref !== b, \u0027must be a new object\u0027);\n\n// RegExp flags preserved\nconst rx = deepClone(/abc/gim);\nconsole.assert(rx.flags.includes(\u0027g\u0027) \u0026\u0026 rx.flags.includes(\u0027i\u0027) \u0026\u0026 rx.flags.includes(\u0027m\u0027));\n\n// Date independence\nconst dt = new Date(\u00272024-06-15\u0027);\nconst dtClone = deepClone(dt);\nconsole.assert(dtClone.getTime() === dt.getTime());\nconsole.log(\u0027Task 40 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"41","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\nclass RingBuffer\u003cT\u003e {\n private buf: (T | undefined)[];\n private head: number = 0;\n private count: number = 0;\n private cap: number;\n\n constructor(capacity: number) {\n this.cap = capacity;\n this.buf = new Array(capacity).fill(undefined);\n }\n\n push(item: T): T | undefined {\n const idx = (this.head + this.count) % this.cap;\n const evicted = this.count === this.cap ? this.buf[idx] : undefined;\n this.buf[idx] = item;\n if (this.count === this.cap) {\n this.head = (this.head + 1) % this.cap;\n } else {\n this.count++;\n }\n return evicted;\n }\n\n shift(): T | undefined {\n if (this.count === 0) return undefined;\n const item = this.buf[this.head];\n this.buf[this.head] = undefined;\n this.head = (this.head + 1) % this.cap;\n this.count--;\n return item;\n }\n\n toArray(): T[] {\n const result: T[] = [];\n for (let i = 0; i \u003c this.count; i++) {\n result.push(this.buf[(this.head + i) % this.cap] as T);\n }\n return result;\n }\n\n get size(): number { return this.count; }\n}\n\n","golden_completion":"(RingBuffer as any).doc = \u0027A fixed-capacity circular buffer that overwrites the oldest element when full. push(item) appends to the logical end and returns the evicted element if the buffer was at capacity, or undefined if no eviction occurred. shift() removes and returns the oldest element, or undefined if the buffer is empty. toArray() returns elements in insertion order from oldest to newest. The internal index wraps around using modular arithmetic. The size getter returns the current number of stored elements, which is always \u003c= capacity.\u0027;\n","suffix":"const rb = new RingBuffer\u003cnumber\u003e(3);\nassert.strictEqual(rb.push(1), undefined);\nassert.strictEqual(rb.push(2), undefined);\nassert.strictEqual(rb.push(3), undefined);\nassert.strictEqual(rb.size, 3);\n\n// Overwrite oldest\nconst evicted = rb.push(4);\nassert.strictEqual(evicted, 1);\nassert.deepStrictEqual(rb.toArray(), [2, 3, 4]);\n\n// Shift\nassert.strictEqual(rb.shift(), 2);\nassert.strictEqual(rb.size, 2);\n\nconsole.log(\u0027Task 41 suffix passed\u0027);\n","assertions":"const doc41 = (RingBuffer as any).doc;\nassert.ok(doc41.includes(\u0027fixed-capacity\u0027) || doc41.includes(\u0027fixed capacity\u0027), \u0027must mention fixed capacity\u0027);\nassert.ok(doc41.includes(\u0027oldest\u0027) || doc41.includes(\u0027FIFO\u0027), \u0027must mention overwrites oldest\u0027);\nassert.ok(doc41.includes(\u0027evict\u0027) || doc41.includes(\u0027overwrite\u0027), \u0027must mention eviction/overwrite\u0027);\nassert.ok(doc41.includes(\u0027undefined\u0027) || doc41.includes(\u0027empty\u0027), \u0027must mention undefined on empty\u0027);\nassert.ok(doc41.includes(\u0027modular\u0027) || doc41.includes(\u0027wrap\u0027) || doc41.includes(\u0027circular\u0027), \u0027must mention wrap-around\u0027);\nassert.ok(doc41.includes(\u0027insertion order\u0027) || doc41.includes(\u0027oldest to newest\u0027), \u0027must describe toArray order\u0027);\n\n// Functional: empty buffer shift\nconst rbEmpty = new RingBuffer\u003cnumber\u003e(2);\nassert.strictEqual(rbEmpty.shift(), undefined);\nassert.strictEqual(rbEmpty.size, 0);\n\n// Overwrite cycle\nconst rb2 = new RingBuffer\u003cstring\u003e(2);\nrb2.push(\u0027a\u0027);\nrb2.push(\u0027b\u0027);\nassert.strictEqual(rb2.push(\u0027c\u0027), \u0027a\u0027);\nassert.strictEqual(rb2.push(\u0027d\u0027), \u0027b\u0027);\nassert.deepStrictEqual(rb2.toArray(), [\u0027c\u0027, \u0027d\u0027]);\n\nconsole.log(\u0027Task 41 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"42","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface TrieNode {\n children: Map\u003cstring, TrieNode\u003e;\n prefixCount: number;\n isEnd: boolean;\n}\n\nclass CountingTrie {\n private root: TrieNode;\n\n constructor() {\n this.root = { children: new Map(), prefixCount: 0, isEnd: false };\n }\n\n insert(word: string): void {\n let node = this.root;\n for (const ch of word) {\n if (!node.children.has(ch)) {\n node.children.set(ch, { children: new Map(), prefixCount: 0, isEnd: false });\n }\n node = node.children.get(ch)!;\n node.prefixCount++;\n }\n node.isEnd = true;\n }\n\n search(word: string): boolean {\n let node = this.root;\n for (const ch of word) {\n if (!node.children.has(ch)) return false;\n node = node.children.get(ch)!;\n }\n return node.isEnd;\n }\n\n startsWith(prefix: string): number {\n let node = this.root;\n for (const ch of prefix) {\n if (!node.children.has(ch)) return 0;\n node = node.children.get(ch)!;\n }\n return node.prefixCount;\n }\n\n delete(word: string): boolean {\n if (!this.search(word)) return false;\n let node = this.root;\n for (const ch of word) {\n node = node.children.get(ch)!;\n node.prefixCount--;\n }\n node.isEnd = false;\n return true;\n }\n}\n\n","golden_completion":"(CountingTrie as any).doc = \u0027A trie (prefix tree) that tracks how many inserted words pass through each node via a prefixCount field. insert(word) traverses or creates nodes for each character, incrementing prefixCount at every visited node and marking the final node as an end-of-word. search(word) returns a boolean indicating exact-match presence by checking the isEnd flag on the terminal node. startsWith(prefix) returns the integer count of currently inserted words that share the given prefix, NOT a boolean — it reads prefixCount from the last node of the prefix path. delete(word) first verifies the word exists via search; if it does, it decrements prefixCount along the path and clears isEnd, returning true; if the word does not exist, it is a no-op returning false. Deleting a word reduces the startsWith count for all its prefixes by exactly one.\u0027;\n","suffix":"const trie = new CountingTrie();\ntrie.insert(\u0027apple\u0027);\ntrie.insert(\u0027app\u0027);\ntrie.insert(\u0027application\u0027);\n\nassert.strictEqual(trie.search(\u0027app\u0027), true);\nassert.strictEqual(trie.search(\u0027ap\u0027), false);\nassert.strictEqual(trie.startsWith(\u0027app\u0027), 3);\nassert.strictEqual(trie.startsWith(\u0027appl\u0027), 2);\n\nconsole.log(\u0027Task 42 suffix passed\u0027);\n","assertions":"const doc42 = (CountingTrie as any).doc;\nassert.ok(doc42.includes(\u0027prefixCount\u0027) || doc42.includes(\u0027prefix count\u0027), \u0027must mention prefixCount\u0027);\nassert.ok(doc42.includes(\u0027increment\u0027) || doc42.includes(\u0027incr\u0027), \u0027must mention incrementing\u0027);\nassert.ok(doc42.includes(\u0027boolean\u0027) || doc42.includes(\u0027exact-match\u0027) || doc42.includes(\u0027exact match\u0027), \u0027must describe search returns boolean\u0027);\nassert.ok(doc42.includes(\u0027count\u0027) || doc42.includes(\u0027integer\u0027) || doc42.includes(\u0027number\u0027), \u0027must say startsWith returns count not boolean\u0027);\nassert.ok(doc42.includes(\u0027no-op\u0027) || doc42.includes(\u0027noop\u0027) || doc42.includes(\u0027does not exist\u0027), \u0027must mention delete no-op\u0027);\nassert.ok(doc42.includes(\u0027decrement\u0027) || doc42.includes(\u0027decr\u0027) || doc42.includes(\u0027reduces\u0027), \u0027must mention decrementing on delete\u0027);\nassert.ok(doc42.includes(\u0027isEnd\u0027) || doc42.includes(\u0027end-of-word\u0027) || doc42.includes(\u0027end of word\u0027), \u0027must mention isEnd flag\u0027);\n\n// Functional: delete reduces startsWith\nassert.strictEqual(trie.delete(\u0027apple\u0027), true);\nassert.strictEqual(trie.startsWith(\u0027app\u0027), 2);\nassert.strictEqual(trie.search(\u0027apple\u0027), false);\n\n// Delete non-existent is no-op\nassert.strictEqual(trie.delete(\u0027banana\u0027), false);\nassert.strictEqual(trie.startsWith(\u0027app\u0027), 2);\n\nconsole.log(\u0027Task 42 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"43","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface TaggedInterval {\n start: number;\n end: number;\n tags: string[];\n}\n\n/**\n * Merge overlapping or adjacent tagged intervals.\n * Two intervals overlap if one\u0027s start is \u003c= the other\u0027s end.\n * When merging, the resulting interval\u0027s start is the minimum start,\n * the end is the maximum end, and the tags are the UNION of all tags\n * (deduplicated, sorted alphabetically).\n * Non-overlapping intervals are returned unchanged.\n * Input intervals may be in any order; output must be sorted by start.\n * @param intervals - Array of tagged intervals\n * @returns Merged array of tagged intervals, sorted by start\n */\nfunction mergeTaggedIntervals(intervals: TaggedInterval[]): TaggedInterval[] {\n","golden_completion":" if (intervals.length === 0) return [];\n const sorted = [...intervals].sort((a, b) =\u003e a.start - b.start);\n const result: TaggedInterval[] = [{ ...sorted[0], tags: [...sorted[0].tags] }];\n for (let i = 1; i \u003c sorted.length; i++) {\n const last = result[result.length - 1];\n if (sorted[i].start \u003c= last.end) {\n last.end = Math.max(last.end, sorted[i].end);\n const tagSet = new Set([...last.tags, ...sorted[i].tags]);\n last.tags = Array.from(tagSet).sort();\n } else {\n result.push({ ...sorted[i], tags: [...sorted[i].tags] });\n }\n }\n return result;\n","suffix":"}\n\n// Basic merge\nconst intervals1: TaggedInterval[] = [\n { start: 1, end: 3, tags: [\u0027a\u0027, \u0027b\u0027] },\n { start: 2, end: 5, tags: [\u0027b\u0027, \u0027c\u0027] },\n { start: 7, end: 9, tags: [\u0027d\u0027] }\n];\nconst merged1 = mergeTaggedIntervals(intervals1);\nassert.strictEqual(merged1.length, 2);\nassert.strictEqual(merged1[0].start, 1);\nassert.strictEqual(merged1[0].end, 5);\nassert.deepStrictEqual(merged1[0].tags, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(merged1[1], { start: 7, end: 9, tags: [\u0027d\u0027] });\n\nconsole.log(\u0027Task 43 suffix passed\u0027);\n","assertions":"// Empty input\nassert.deepStrictEqual(mergeTaggedIntervals([]), []);\n\n// Unsorted input\nconst intervals2: TaggedInterval[] = [\n { start: 5, end: 8, tags: [\u0027x\u0027] },\n { start: 1, end: 4, tags: [\u0027y\u0027] },\n { start: 3, end: 6, tags: [\u0027z\u0027] }\n];\nconst merged2 = mergeTaggedIntervals(intervals2);\nassert.strictEqual(merged2.length, 1);\nassert.strictEqual(merged2[0].start, 1);\nassert.strictEqual(merged2[0].end, 8);\nassert.deepStrictEqual(merged2[0].tags, [\u0027x\u0027, \u0027y\u0027, \u0027z\u0027]);\n\n// Adjacent (touching) intervals merge\nconst intervals3: TaggedInterval[] = [\n { start: 1, end: 3, tags: [\u0027a\u0027] },\n { start: 3, end: 5, tags: [\u0027b\u0027] }\n];\nconst merged3 = mergeTaggedIntervals(intervals3);\nassert.strictEqual(merged3.length, 1);\nassert.deepStrictEqual(merged3[0].tags, [\u0027a\u0027, \u0027b\u0027]);\n\n// No overlap\nconst intervals4: TaggedInterval[] = [\n { start: 1, end: 2, tags: [\u0027a\u0027] },\n { start: 4, end: 5, tags: [\u0027b\u0027] }\n];\nconst merged4 = mergeTaggedIntervals(intervals4);\nassert.strictEqual(merged4.length, 2);\n\n// Duplicate tags are deduplicated\nconst intervals5: TaggedInterval[] = [\n { start: 1, end: 5, tags: [\u0027a\u0027, \u0027b\u0027] },\n { start: 2, end: 6, tags: [\u0027a\u0027, \u0027c\u0027] }\n];\nconst merged5 = mergeTaggedIntervals(intervals5);\nassert.deepStrictEqual(merged5[0].tags, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n\nconsole.log(\u0027Task 43 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"44","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ntype TopoResult = {\n sorted: string[] | null;\n cycle: string[] | null;\n};\n\nfunction topoSort(edges: [string, string][]): TopoResult {\n const graph = new Map\u003cstring, string[]\u003e();\n const inDeg = new Map\u003cstring, number\u003e();\n const allNodes = new Set\u003cstring\u003e();\n\n for (const [u, v] of edges) {\n allNodes.add(u);\n allNodes.add(v);\n if (!graph.has(u)) graph.set(u, []);\n graph.get(u)!.push(v);\n inDeg.set(v, (inDeg.get(v) || 0) + 1);\n if (!inDeg.has(u)) inDeg.set(u, 0);\n }\n\n // Kahn\u0027s algorithm\n const queue: string[] = [];\n for (const node of allNodes) {\n if (!inDeg.has(node) || inDeg.get(node) === 0) queue.push(node);\n }\n queue.sort(); // deterministic: alphabetical among equal in-degree\n\n const sorted: string[] = [];\n while (queue.length \u003e 0) {\n const node = queue.shift()!;\n sorted.push(node);\n for (const neighbor of (graph.get(node) || [])) {\n inDeg.set(neighbor, inDeg.get(neighbor)! - 1);\n if (inDeg.get(neighbor) === 0) {\n queue.push(neighbor);\n queue.sort();\n }\n }\n }\n\n if (sorted.length === allNodes.size) {\n return { sorted, cycle: null };\n }\n\n // Find cycle among remaining nodes\n const remaining = new Set\u003cstring\u003e();\n for (const node of allNodes) {\n if (!sorted.includes(node)) remaining.add(node);\n }\n const visited = new Set\u003cstring\u003e();\n const path: string[] = [];\n const pathSet = new Set\u003cstring\u003e();\n\n function dfs(node: string): string[] | null {\n visited.add(node);\n path.push(node);\n pathSet.add(node);\n for (const neighbor of (graph.get(node) || [])) {\n if (!remaining.has(neighbor)) continue;\n if (pathSet.has(neighbor)) {\n const cycleStart = path.indexOf(neighbor);\n return path.slice(cycleStart).concat(neighbor);\n }\n if (!visited.has(neighbor)) {\n const result = dfs(neighbor);\n if (result) return result;\n }\n }\n path.pop();\n pathSet.delete(node);\n return null;\n }\n\n for (const node of remaining) {\n if (!visited.has(node)) {\n const cycle = dfs(node);\n if (cycle) return { sorted: null, cycle };\n }\n }\n return { sorted: null, cycle: [] };\n}\n\n","golden_completion":"(topoSort as any).doc = \u0027Performs topological sorting on a directed graph specified as an array of [source, target] edge pairs. Uses Kahn\\\u0027s algorithm with an alphabetically-sorted queue to produce a deterministic ordering when multiple nodes have equal in-degree. Returns an object { sorted, cycle } where exactly one field is non-null. If the graph is acyclic, sorted contains all nodes in topological order and cycle is null. If a cycle exists, sorted is null and cycle contains the exact sequence of node names forming the cycle, with the first and last elements being the same node. Isolated nodes (those appearing only in edges but with no outgoing edges) are included in the sorted output. The algorithm first attempts Kahn\\\u0027s BFS; if not all nodes are processed, it performs DFS on remaining nodes to extract one concrete cycle path.\u0027;\n","suffix":"// Acyclic graph\nconst result1 = topoSort([[\u0027a\u0027, \u0027b\u0027], [\u0027b\u0027, \u0027c\u0027], [\u0027a\u0027, \u0027c\u0027]]);\nassert.ok(result1.sorted !== null);\nassert.strictEqual(result1.cycle, null);\nassert.ok(result1.sorted!.indexOf(\u0027a\u0027) \u003c result1.sorted!.indexOf(\u0027b\u0027));\nassert.ok(result1.sorted!.indexOf(\u0027b\u0027) \u003c result1.sorted!.indexOf(\u0027c\u0027));\n\n// Cyclic graph\nconst result2 = topoSort([[\u0027a\u0027, \u0027b\u0027], [\u0027b\u0027, \u0027c\u0027], [\u0027c\u0027, \u0027a\u0027]]);\nassert.strictEqual(result2.sorted, null);\nassert.ok(result2.cycle !== null);\nassert.ok(result2.cycle!.length \u003e= 3);\nassert.strictEqual(result2.cycle![0], result2.cycle![result2.cycle!.length - 1]);\n\nconsole.log(\u0027Task 44 suffix passed\u0027);\n","assertions":"const doc44 = (topoSort as any).doc;\nassert.ok(doc44.includes(\u0027Kahn\u0027) || doc44.includes(\u0027kahn\u0027), \u0027must mention Kahn\\\u0027s algorithm\u0027);\nassert.ok(doc44.includes(\u0027alphabetical\u0027) || doc44.includes(\u0027deterministic\u0027), \u0027must mention deterministic ordering\u0027);\nassert.ok(doc44.includes(\u0027cycle\u0027) \u0026\u0026 (doc44.includes(\u0027sequence\u0027) || doc44.includes(\u0027path\u0027) || doc44.includes(\u0027exact\u0027)), \u0027must describe cycle as a path/sequence\u0027);\nassert.ok(doc44.includes(\u0027first and last\u0027) || doc44.includes(\u0027same node\u0027) || doc44.includes(\u0027repeated\u0027), \u0027must mention cycle start==end\u0027);\nassert.ok(doc44.includes(\u0027sorted\u0027) \u0026\u0026 doc44.includes(\u0027null\u0027), \u0027must describe mutual exclusivity of sorted/cycle\u0027);\nassert.ok(doc44.includes(\u0027DFS\u0027) || doc44.includes(\u0027depth-first\u0027) || doc44.includes(\u0027dfs\u0027), \u0027must mention DFS for cycle detection\u0027);\nassert.ok(doc44.includes(\u0027isolated\u0027) || doc44.includes(\u0027all nodes\u0027), \u0027must mention isolated node inclusion\u0027);\n\n// Functional: deterministic ordering\nconst r3 = topoSort([[\u0027c\u0027, \u0027d\u0027], [\u0027a\u0027, \u0027d\u0027], [\u0027b\u0027, \u0027d\u0027]]);\nassert.ok(r3.sorted !== null);\n// a, b, c all have in-degree 0 — should appear in alphabetical order\nassert.deepStrictEqual(r3.sorted!.slice(0, 3), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n\n// Self-loop\nconst r4 = topoSort([[\u0027x\u0027, \u0027x\u0027]]);\nassert.strictEqual(r4.sorted, null);\nassert.ok(r4.cycle !== null);\n\nconsole.log(\u0027Task 44 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"45","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\n/**\n * Deep-clone any JSON-compatible value (objects, arrays, primitives, null).\n * Must handle circular references: if an object refers back to an ancestor,\n * the clone must mirror that circular structure rather than throwing or\n * producing infinite recursion.\n *\n * Implementation constraint: do NOT use structuredClone, JSON.parse/stringify,\n * or any external library. Use a recursive approach with a Map to track\n * already-cloned references.\n *\n * @param value - The value to deep-clone.\n * @returns A deep clone preserving circular references.\n */\nfunction deepClone\u003cT\u003e(value: T): T {\n","golden_completion":" const seen = new Map\u003cany, any\u003e();\n\n function clone(val: any): any {\n if (val === null || typeof val !== \u0027object\u0027) return val;\n if (seen.has(val)) return seen.get(val);\n\n if (Array.isArray(val)) {\n const arr: any[] = [];\n seen.set(val, arr);\n for (const item of val) {\n arr.push(clone(item));\n }\n return arr;\n }\n\n const obj: any = {};\n seen.set(val, obj);\n for (const key of Object.keys(val)) {\n obj[key] = clone((val as any)[key]);\n }\n return obj;\n }\n\n return clone(value);\n","suffix":"}\n\n// Basic deep clone\nconst orig = { a: 1, b: { c: [2, 3] } };\nconst cloned = deepClone(orig);\nassert.deepStrictEqual(cloned, orig);\ncloned.b.c.push(4);\nassert.strictEqual(orig.b.c.length, 2); // original unchanged (only [2, 3])\n\n// Circular reference\nconst circular: any = { name: \u0027root\u0027 };\ncircular.self = circular;\nconst clonedCirc = deepClone(circular);\nassert.strictEqual(clonedCirc.self, clonedCirc); // circular preserved\nassert.notStrictEqual(clonedCirc, circular); // different object\n\nconsole.log(\u0027Task 45 suffix passed\u0027);\n","assertions":"// Array with circular ref\nconst arr: any[] = [1, 2];\narr.push(arr);\nconst clonedArr = deepClone(arr);\nassert.strictEqual(clonedArr[0], 1);\nassert.strictEqual(clonedArr[1], 2);\nassert.strictEqual(clonedArr[2], clonedArr); // circular preserved\nassert.notStrictEqual(clonedArr, arr);\n\n// Nested circular\nconst a: any = { val: \u0027a\u0027 };\nconst b: any = { val: \u0027b\u0027, ref: a };\na.ref = b;\nconst ca = deepClone(a);\nassert.strictEqual(ca.ref.ref, ca);\nassert.strictEqual(ca.ref.val, \u0027b\u0027);\nassert.notStrictEqual(ca, a);\n\n// Primitives and null\nassert.strictEqual(deepClone(42), 42);\nassert.strictEqual(deepClone(\u0027hello\u0027), \u0027hello\u0027);\nassert.strictEqual(deepClone(null), null);\nassert.strictEqual(deepClone(true), true);\n\nconsole.log(\u0027Task 45 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"46","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface CSVOptions {\n delimiter?: string;\n rowSeparator?: string;\n}\n\nfunction parseCSV(input: string, options: CSVOptions = {}): string[][] {\n const delim = options.delimiter ?? \u0027,\u0027;\n const rowSep = options.rowSeparator ?? \u0027\\n\u0027;\n const rows: string[][] = [];\n const lines = input.split(rowSep);\n\n for (const line of lines) {\n if (line.length === 0) continue;\n const fields: string[] = [];\n let i = 0;\n while (i \u003c= line.length) {\n if (i \u003c line.length \u0026\u0026 line[i] === \u0027\"\u0027) {\n // Quoted field\n i++; // skip opening quote\n let field = \u0027\u0027;\n while (i \u003c line.length) {\n if (line[i] === \u0027\"\u0027 \u0026\u0026 i + 1 \u003c line.length \u0026\u0026 line[i + 1] === \u0027\"\u0027) {\n field += \u0027\"\u0027;\n i += 2;\n } else if (line[i] === \u0027\"\u0027) {\n i++; // skip closing quote\n break;\n } else {\n field += line[i];\n i++;\n }\n }\n fields.push(field); // NO trimming for quoted fields\n if (i \u003c line.length \u0026\u0026 line[i] === delim) i++; // skip delimiter\n } else {\n // Unquoted field\n let end = line.indexOf(delim, i);\n if (end === -1) end = line.length;\n fields.push(line.substring(i, end).trim()); // TRIM unquoted fields\n i = end + 1;\n }\n }\n rows.push(fields);\n }\n return rows;\n}\n\n","golden_completion":"(parseCSV as any).doc = \u0027Parses a CSV string into a 2D array of strings (string[][]). Supports quoted fields delimited by double-quote characters; within a quoted field, a literal double-quote is represented by two consecutive double-quotes (RFC 4180 escaped quoting), NOT backslash escaping. Unquoted fields are trimmed of leading and trailing whitespace, but quoted fields preserve their internal whitespace exactly. Accepts an optional CSVOptions object with a custom delimiter (default: comma) and a custom rowSeparator (default: newline \\\\n). Empty lines in the input are skipped and produce no output row. Returns an array of rows, where each row is an array of field strings.\u0027;\n","suffix":"// Basic CSV\nconst csv1 = \u0027a, b ,c\\n1, 2 ,3\u0027;\nconst parsed1 = parseCSV(csv1);\nassert.deepStrictEqual(parsed1, [[\u0027a\u0027, \u0027b\u0027, \u0027c\u0027], [\u00271\u0027, \u00272\u0027, \u00273\u0027]]); // trimmed\n\n// Quoted fields with spaces preserved\nconst csv2 = \u0027\"hello world\", test ,\" spaced \"\u0027;\nconst parsed2 = parseCSV(csv2);\nassert.strictEqual(parsed2[0][0], \u0027hello world\u0027);\nassert.strictEqual(parsed2[0][1], \u0027test\u0027); // trimmed\nassert.strictEqual(parsed2[0][2], \u0027 spaced \u0027); // NOT trimmed\n\nconsole.log(\u0027Task 46 suffix passed\u0027);\n","assertions":"const doc46 = (parseCSV as any).doc;\nassert.ok(doc46.includes(\u0027double-quote\u0027) || doc46.includes(\u0027doubled\u0027) || doc46.includes(\u0027two consecutive\u0027), \u0027must describe quote escaping\u0027);\nassert.ok(!doc46.includes(\u0027backslash\u0027) || doc46.includes(\u0027NOT backslash\u0027), \u0027must clarify no backslash escaping\u0027);\nassert.ok(doc46.includes(\u0027trim\u0027) || doc46.includes(\u0027whitespace\u0027), \u0027must mention trimming\u0027);\nassert.ok(doc46.includes(\u0027quoted\u0027) \u0026\u0026 (doc46.includes(\u0027preserve\u0027) || doc46.includes(\u0027NOT trim\u0027) || doc46.includes(\u0027exact\u0027)), \u0027must say quoted fields are not trimmed\u0027);\nassert.ok(doc46.includes(\u0027delimiter\u0027) || doc46.includes(\u0027comma\u0027), \u0027must mention custom delimiter\u0027);\nassert.ok(doc46.includes(\u0027rowSeparator\u0027) || doc46.includes(\u0027newline\u0027) || doc46.includes(\u0027row separator\u0027), \u0027must mention custom row separator\u0027);\nassert.ok(doc46.includes(\u0027RFC 4180\u0027) || doc46.includes(\u0027escaped\u0027) || doc46.includes(\u0027consecutive\u0027), \u0027must describe escaping mechanism\u0027);\n\n// Escaped quotes: doubled double-quote inside quoted field\nconst dq = String.fromCharCode(34); // \"\nconst csv3 = dq + \u0027He said \u0027 + dq + dq + \u0027hello\u0027 + dq + dq + dq + \u0027,normal\u0027;\nconst parsed3 = parseCSV(csv3);\nassert.strictEqual(parsed3[0][0], \u0027He said \u0027 + dq + \u0027hello\u0027 + dq);\nassert.strictEqual(parsed3[0][1], \u0027normal\u0027);\n\n// Custom delimiter\nconst csv4 = \u0027a|b|c\u0027;\nconst parsed4 = parseCSV(csv4, { delimiter: \u0027|\u0027 });\nassert.deepStrictEqual(parsed4, [[\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]]);\n\n// Empty lines skipped\nconst csv5 = \u0027a,b\\n\\nc,d\u0027;\nconst parsed5 = parseCSV(csv5);\nassert.strictEqual(parsed5.length, 2);\n\nconsole.log(\u0027Task 46 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"47","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface RateLimitResult {\n allowed: boolean;\n retryAfter: number; // ms to wait; 0 if allowed\n}\n\n/**\n * Create a sliding-window rate limiter for a given resource.\n *\n * - maxRequests: maximum requests allowed in the window\n * - windowMs: the sliding window duration in milliseconds\n * - burstMultiplier: within the first 100ms of the window, allow up to\n * maxRequests * burstMultiplier requests. After the burst window (100ms),\n * the normal maxRequests limit applies for the remainder of windowMs.\n * - Each call to tryAcquire() checks the current sliding window and returns\n * { allowed: true, retryAfter: 0 } if under the limit, or\n * { allowed: false, retryAfter: N } where N is the number of milliseconds\n * until the oldest request in the window expires.\n * - The sliding window is based on actual timestamps, not fixed intervals.\n * - Burst requests count toward the normal window total.\n *\n * @param maxRequests - Max requests per window\n * @param windowMs - Window size in ms\n * @param burstMultiplier - Burst allowance multiplier (default 1, meaning no burst)\n * @returns Object with tryAcquire() method\n */\nfunction createRateLimiter(\n maxRequests: number,\n windowMs: number,\n burstMultiplier: number = 1\n): { tryAcquire: () =\u003e RateLimitResult } {\n","golden_completion":" const timestamps: number[] = [];\n const burstWindowMs = 100;\n\n return {\n tryAcquire(): RateLimitResult {\n const now = Date.now();\n // Remove expired timestamps\n while (timestamps.length \u003e 0 \u0026\u0026 timestamps[0] \u003c= now - windowMs) {\n timestamps.shift();\n }\n\n // Check burst window: count requests in last 100ms\n const burstLimit = Math.floor(maxRequests * burstMultiplier);\n const burstStart = now - burstWindowMs;\n const recentCount = timestamps.filter(t =\u003e t \u003e burstStart).length;\n\n // Apply the tighter of: burst limit (for recent) or normal limit (for window)\n if (timestamps.length \u003e= maxRequests || recentCount \u003e= burstLimit) {\n const retryAfter = timestamps[0] + windowMs - now;\n return { allowed: false, retryAfter: Math.max(1, retryAfter) };\n }\n\n timestamps.push(now);\n return { allowed: true, retryAfter: 0 };\n }\n };\n","suffix":"}\n\n// Basic rate limiting\nconst limiter = createRateLimiter(3, 1000, 1);\nassert.deepStrictEqual(limiter.tryAcquire(), { allowed: true, retryAfter: 0 });\nassert.deepStrictEqual(limiter.tryAcquire(), { allowed: true, retryAfter: 0 });\nassert.deepStrictEqual(limiter.tryAcquire(), { allowed: true, retryAfter: 0 });\nconst denied = limiter.tryAcquire();\nassert.strictEqual(denied.allowed, false);\nassert.ok(denied.retryAfter \u003e 0);\n\nconsole.log(\u0027Task 47 suffix passed\u0027);\n","assertions":"// Burst multiplier = 2: allows 6 in burst window, but only 3 in full window\nconst burstLimiter = createRateLimiter(3, 1000, 2);\n// Within burst window (synchronous = same ms), can do up to 6\nassert.strictEqual(burstLimiter.tryAcquire().allowed, true);\nassert.strictEqual(burstLimiter.tryAcquire().allowed, true);\nassert.strictEqual(burstLimiter.tryAcquire().allowed, true);\n// But 3 already used of the window\u0027s max of 3, so 4th is denied\n// (burst count 3 \u003c burstLimit 6, but window count 3 \u003e= maxRequests 3)\nconst r47 = burstLimiter.tryAcquire();\nassert.strictEqual(r47.allowed, false);\nassert.ok(r47.retryAfter \u003e 0);\n\n// No burst (multiplier=1)\nconst noBurst = createRateLimiter(2, 500, 1);\nassert.strictEqual(noBurst.tryAcquire().allowed, true);\nassert.strictEqual(noBurst.tryAcquire().allowed, true);\nassert.strictEqual(noBurst.tryAcquire().allowed, false);\n\nconsole.log(\u0027Task 47 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"48","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\nfunction jsonPath(obj: any, path: string): any[] {\n const results: any[] = [];\n\n function evaluate(current: any, tokens: string[]): void {\n if (tokens.length === 0) {\n results.push(current);\n return;\n }\n if (current === null || current === undefined) return;\n\n const [token, ...rest] = tokens;\n\n if (token === \u0027*\u0027) {\n // Wildcard: iterate all children\n if (Array.isArray(current)) {\n for (const item of current) evaluate(item, rest);\n } else if (typeof current === \u0027object\u0027) {\n for (const key of Object.keys(current)) evaluate(current[key], rest);\n }\n } else if (token === \u0027..\u0027) {\n // Recursive descent: apply rest to current AND all descendants\n evaluate(current, rest);\n if (typeof current === \u0027object\u0027 \u0026\u0026 current !== null) {\n const children = Array.isArray(current) ? current : Object.values(current);\n for (const child of children) evaluate(child, [\u0027..\u0027, ...rest]);\n }\n } else if (token.startsWith(\u0027[\u0027) \u0026\u0026 token.endsWith(\u0027]\u0027)) {\n // Bracket notation: array index or quoted property\n const inner = token.slice(1, -1);\n if (/^\\d+$/.test(inner)) {\n const idx = parseInt(inner, 10);\n if (Array.isArray(current) \u0026\u0026 idx \u003c current.length) {\n evaluate(current[idx], rest);\n }\n } else if (inner.startsWith(\"\u0027\") \u0026\u0026 inner.endsWith(\"\u0027\")) {\n const prop = inner.slice(1, -1);\n if (typeof current === \u0027object\u0027 \u0026\u0026 !Array.isArray(current) \u0026\u0026 prop in current) {\n evaluate(current[prop], rest);\n }\n }\n } else {\n // Dot notation: property access\n if (typeof current === \u0027object\u0027 \u0026\u0026 !Array.isArray(current) \u0026\u0026 token in current) {\n evaluate(current[token], rest);\n }\n }\n }\n\n // Tokenize: strip leading \u0027$\u0027 then parse\n const tokens: string[] = [];\n let i = 0;\n const p = path.startsWith(\u0027$\u0027) ? path.slice(1) : path;\n while (i \u003c p.length) {\n if (p[i] === \u0027.\u0027) {\n if (i + 1 \u003c p.length \u0026\u0026 p[i + 1] === \u0027.\u0027) {\n tokens.push(\u0027..\u0027);\n i += 2;\n } else {\n i++; // skip single dot separator\n }\n } else if (p[i] === \u0027[\u0027) {\n const end = p.indexOf(\u0027]\u0027, i);\n tokens.push(p.substring(i, end + 1));\n i = end + 1;\n } else if (p[i] === \u0027*\u0027) {\n tokens.push(\u0027*\u0027);\n i++;\n } else {\n let end = i;\n while (end \u003c p.length \u0026\u0026 p[end] !== \u0027.\u0027 \u0026\u0026 p[end] !== \u0027[\u0027) end++;\n tokens.push(p.substring(i, end));\n i = end;\n }\n }\n\n evaluate(obj, tokens);\n return results;\n}\n\n","golden_completion":"(jsonPath as any).doc = \u0027Evaluates a JSONPath-like expression against a JavaScript object and returns an array of all matching values. Supports four access modes: (1) dot-notation property access (e.g., \"$.foo.bar\"), (2) bracket notation for array indices with integer keys (e.g., \"[0]\") and quoted property names (e.g., \"[\\\u0027name\\\u0027]\"), (3) wildcard \"*\" which iterates all children of an object (by keys) or array (by elements), and (4) recursive descent \"..\" which applies the subsequent token to the current node AND recursively to all descendants depth-first. The path may optionally start with \"$\" which is stripped before processing. Returns an empty array if no matches are found or if the path traverses through null/undefined. Results are collected in the order encountered during depth-first traversal. Array index access is zero-based and silently skips out-of-bounds indices.\u0027;\n","suffix":"const data = {\n store: {\n books: [\n { title: \u0027A\u0027, price: 10 },\n { title: \u0027B\u0027, price: 20 },\n { title: \u0027C\u0027, price: 15 }\n ],\n name: \u0027TestStore\u0027\n }\n};\n\n// Dot notation\nassert.deepStrictEqual(jsonPath(data, \u0027$.store.name\u0027), [\u0027TestStore\u0027]);\n\n// Array index\nassert.deepStrictEqual(jsonPath(data, \u0027$.store.books[0].title\u0027), [\u0027A\u0027]);\n\n// Wildcard\nconst prices = jsonPath(data, \u0027$.store.books.*.price\u0027);\nassert.deepStrictEqual(prices, [10, 20, 15]);\n\nconsole.log(\u0027Task 48 suffix passed\u0027);\n","assertions":"const doc48 = (jsonPath as any).doc;\nassert.ok(doc48.includes(\u0027dot-notation\u0027) || doc48.includes(\u0027dot notation\u0027) || doc48.includes(\u0027property access\u0027), \u0027must mention dot notation\u0027);\nassert.ok(doc48.includes(\u0027bracket\u0027) || doc48.includes(\u0027array ind\u0027), \u0027must mention bracket notation\u0027);\nassert.ok(doc48.includes(\u0027wildcard\u0027) || doc48.includes(\u0027*\u0027), \u0027must mention wildcard\u0027);\nassert.ok(doc48.includes(\u0027recursive descent\u0027) || doc48.includes(\u0027..\u0027), \u0027must mention recursive descent\u0027);\nassert.ok(doc48.includes(\u0027descendants\u0027) || doc48.includes(\u0027depth-first\u0027) || doc48.includes(\u0027all levels\u0027), \u0027must describe recursive descent behavior\u0027);\nassert.ok(doc48.includes(\u0027empty array\u0027) || doc48.includes(\u0027no match\u0027), \u0027must mention empty result for no matches\u0027);\nassert.ok(doc48.includes(\u0027zero-based\u0027) || doc48.includes(\u00270-based\u0027), \u0027must mention zero-based indexing\u0027);\nassert.ok(doc48.includes(\u0027null\u0027) || doc48.includes(\u0027undefined\u0027), \u0027must mention null/undefined handling\u0027);\n\n// Recursive descent\nconst allTitles = jsonPath(data, \u0027$..title\u0027);\nassert.deepStrictEqual(allTitles, [\u0027A\u0027, \u0027B\u0027, \u0027C\u0027]);\n\n// Bracket with quoted property\nassert.deepStrictEqual(jsonPath(data, \"$.store[\u0027name\u0027]\"), [\u0027TestStore\u0027]);\n\n// No match returns empty array\nassert.deepStrictEqual(jsonPath(data, \u0027$.nonexistent\u0027), []);\n\n// Out-of-bounds index\nassert.deepStrictEqual(jsonPath(data, \u0027$.store.books[99]\u0027), []);\n\nconsole.log(\u0027Task 48 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"49","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ninterface Observer\u003cT\u003e {\n next: (value: T) =\u003e void;\n error: (err: Error) =\u003e void;\n complete: () =\u003e void;\n}\n\ntype Unsubscribe = () =\u003e void;\n\n/**\n * A minimal Observable class with three operators: map, filter, take.\n *\n * Constructor takes a subscribe function that receives an observer and\n * returns an unsubscribe function (or void).\n *\n * - map(fn): returns a new Observable that applies fn to each emitted value\n * - filter(predicate): returns a new Observable that only emits values\n * for which predicate returns true\n * - take(n): returns a new Observable that emits the first n values,\n * then calls observer.complete() and unsubscribes from the source.\n * If the source completes before n values, complete() is still called once.\n * - Errors propagate immediately to the observer\u0027s error callback.\n * - After complete() or error() is called, no further next/complete/error\n * calls are made (the observer is \"closed\").\n */\nclass Observable\u003cT\u003e {\n private _subscribe: (observer: Observer\u003cT\u003e) =\u003e Unsubscribe | void;\n\n constructor(subscribe: (observer: Observer\u003cT\u003e) =\u003e Unsubscribe | void) {\n this._subscribe = subscribe;\n }\n\n subscribe(observer: Partial\u003cObserver\u003cT\u003e\u003e): Unsubscribe {\n let closed = false;\n const safeObserver: Observer\u003cT\u003e = {\n next: (v) =\u003e { if (!closed) observer.next?.(v); },\n error: (e) =\u003e { if (!closed) { closed = true; observer.error?.(e); } },\n complete: () =\u003e { if (!closed) { closed = true; observer.complete?.(); } }\n };\n const unsub = this._subscribe(safeObserver);\n return () =\u003e { closed = true; unsub?.(); };\n }\n\n","golden_completion":" map\u003cU\u003e(fn: (value: T) =\u003e U): Observable\u003cU\u003e {\n return new Observable\u003cU\u003e((obs) =\u003e this.subscribe({\n next: (v) =\u003e { try { obs.next(fn(v)); } catch (e) { obs.error(e as Error); } },\n error: (e) =\u003e obs.error(e), complete: () =\u003e obs.complete()\n }));\n }\n filter(predicate: (value: T) =\u003e boolean): Observable\u003cT\u003e {\n return new Observable\u003cT\u003e((obs) =\u003e this.subscribe({\n next: (v) =\u003e { try { if (predicate(v)) obs.next(v); } catch (e) { obs.error(e as Error); } },\n error: (e) =\u003e obs.error(e), complete: () =\u003e obs.complete()\n }));\n }\n take(n: number): Observable\u003cT\u003e {\n return new Observable\u003cT\u003e((obs) =\u003e {\n let count = 0; let unsub: Unsubscribe | undefined;\n unsub = this.subscribe({\n next: (v) =\u003e { if (count \u003c n) { count++; obs.next(v); if (count === n) { obs.complete(); if (unsub) unsub(); } } },\n error: (e) =\u003e obs.error(e), complete: () =\u003e obs.complete()\n });\n return unsub;\n });\n }\n","suffix":"}\n\n// Test map\nconst values: number[] = [];\nconst source = new Observable\u003cnumber\u003e((obs) =\u003e {\n obs.next(1); obs.next(2); obs.next(3); obs.complete();\n});\nsource.map(x =\u003e x * 10).subscribe({ next: (v) =\u003e values.push(v) });\nassert.deepStrictEqual(values, [10, 20, 30]);\n\n// Test filter\nconst evens: number[] = [];\nsource.filter(x =\u003e x % 2 === 0).subscribe({ next: (v) =\u003e evens.push(v) });\nassert.deepStrictEqual(evens, [2]);\n\n// Test take\nconst taken: number[] = [];\nlet completed = false;\nsource.take(2).subscribe({\n next: (v) =\u003e taken.push(v),\n complete: () =\u003e { completed = true; }\n});\nassert.deepStrictEqual(taken, [1, 2]);\nassert.strictEqual(completed, true);\n\nconsole.log(\u0027Task 49 suffix passed\u0027);\n","assertions":"// take calls complete and stops\nconst items: number[] = [];\nlet compCount = 0;\nconst infinite = new Observable\u003cnumber\u003e((obs) =\u003e {\n let i = 0;\n const id = setInterval(() =\u003e obs.next(i++), 1);\n return () =\u003e clearInterval(id);\n});\n\n// Synchronous source for reliable testing\nconst syncSource = new Observable\u003cnumber\u003e((obs) =\u003e {\n for (let i = 0; i \u003c 100; i++) obs.next(i);\n obs.complete();\n});\n\nsyncSource.take(5).subscribe({\n next: (v) =\u003e items.push(v),\n complete: () =\u003e compCount++\n});\nassert.deepStrictEqual(items, [0, 1, 2, 3, 4]);\nassert.strictEqual(compCount, 1); // complete called exactly once\n\n// map error propagation\nlet caughtErr: any = null;\nsource.map((x) =\u003e {\n if (x === 2) throw new Error(\u0027boom\u0027);\n return x;\n}).subscribe({\n next: () =\u003e {},\n error: (e) =\u003e { caughtErr = e; }\n});\nassert.ok(caughtErr !== null);\nassert.strictEqual((caughtErr as Error).message, \u0027boom\u0027);\n\n// filter + take composition\nconst composed: number[] = [];\nsyncSource.filter(x =\u003e x % 2 === 0).take(3).subscribe({\n next: (v) =\u003e composed.push(v)\n});\nassert.deepStrictEqual(composed, [0, 2, 4]);\n\nconsole.log(\u0027Task 49 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"50","testsource":"devbench-code2NL-NL2code","language":"typescript","prefix":"import { strict as assert } from \u0027assert\u0027;\n\ntype SchemaType =\n | { kind: \u0027string\u0027 }\n | { kind: \u0027number\u0027 }\n | { kind: \u0027boolean\u0027 }\n | { kind: \u0027array\u0027; items: SchemaType }\n | { kind: \u0027object\u0027; properties: Record\u003cstring, SchemaType\u003e; required?: string[] }\n | { kind: \u0027union\u0027; variants: SchemaType[] };\n\ninterface ValidationError {\n path: string;\n expected: string;\n actual: string;\n}\n\nfunction validateSchema(value: any, schema: SchemaType, path: string = \u0027$\u0027): ValidationError[] {\n const errors: ValidationError[] = [];\n\n switch (schema.kind) {\n case \u0027string\u0027:\n if (typeof value !== \u0027string\u0027)\n errors.push({ path, expected: \u0027string\u0027, actual: typeof value });\n break;\n case \u0027number\u0027:\n if (typeof value !== \u0027number\u0027 || Number.isNaN(value))\n errors.push({ path, expected: \u0027number\u0027, actual: Number.isNaN(value) ? \u0027NaN\u0027 : typeof value });\n break;\n case \u0027boolean\u0027:\n if (typeof value !== \u0027boolean\u0027)\n errors.push({ path, expected: \u0027boolean\u0027, actual: typeof value });\n break;\n case \u0027array\u0027:\n if (!Array.isArray(value)) {\n errors.push({ path, expected: \u0027array\u0027, actual: typeof value });\n } else {\n for (let i = 0; i \u003c value.length; i++) {\n errors.push(...validateSchema(value[i], schema.items, `${path}[${i}]`));\n }\n }\n break;\n case \u0027object\u0027:\n if (typeof value !== \u0027object\u0027 || value === null || Array.isArray(value)) {\n errors.push({ path, expected: \u0027object\u0027, actual: value === null ? \u0027null\u0027 : Array.isArray(value) ? \u0027array\u0027 : typeof value });\n } else {\n const required = new Set(schema.required || []);\n for (const [key, subSchema] of Object.entries(schema.properties)) {\n if (key in value) {\n errors.push(...validateSchema(value[key], subSchema, `${path}.${key}`));\n } else if (required.has(key)) {\n errors.push({ path: `${path}.${key}`, expected: subSchema.kind, actual: \u0027missing\u0027 });\n }\n // If not required and not present, no error (optional)\n }\n }\n break;\n case \u0027union\u0027:\n const allErrors = schema.variants.map(v =\u003e validateSchema(value, v, path));\n const anyValid = allErrors.some(e =\u003e e.length === 0);\n if (!anyValid) {\n const types = schema.variants.map(v =\u003e v.kind).join(\u0027 | \u0027);\n errors.push({ path, expected: types, actual: typeof value });\n }\n break;\n }\n return errors;\n}\n\n","golden_completion":"(validateSchema as any).doc = \u0027Recursively validates a JavaScript value against a declarative schema and returns an array of ValidationError objects, each containing a JSONPath-style path string (e.g., \"$.foo[0].bar\"), the expected type, and the actual type found. Supports six schema kinds: \\\u0027string\\\u0027, \\\u0027number\\\u0027 (rejects NaN as invalid), \\\u0027boolean\\\u0027, \\\u0027array\\\u0027 (recursively validates each element against items schema with indexed paths), \\\u0027object\\\u0027 (validates each property against its sub-schema; properties listed in the required array produce a \"missing\" error if absent; unlisted properties are optional and silently skipped), and \\\u0027union\\\u0027 (valid if the value matches ANY variant; if none match, reports the union type description). The path starts at \\\u0027$\\\u0027 and extends with dot-notation for object properties and bracket-notation for array indices. Returns an empty array if the value is fully valid.\u0027;\n","suffix":"// Valid object\nconst schema: SchemaType = {\n kind: \u0027object\u0027,\n properties: {\n name: { kind: \u0027string\u0027 },\n age: { kind: \u0027number\u0027 },\n active: { kind: \u0027boolean\u0027 }\n },\n required: [\u0027name\u0027, \u0027age\u0027]\n};\n\nconst errs1 = validateSchema({ name: \u0027Alice\u0027, age: 30 }, schema);\nassert.strictEqual(errs1.length, 0);\n\n// Missing required field\nconst errs2 = validateSchema({ name: \u0027Bob\u0027 }, schema);\nassert.strictEqual(errs2.length, 1);\nassert.strictEqual(errs2[0].path, \u0027$.age\u0027);\nassert.strictEqual(errs2[0].actual, \u0027missing\u0027);\n\n// Wrong type\nconst errs3 = validateSchema({ name: 42, age: \u0027old\u0027 }, schema);\nassert.strictEqual(errs3.length, 2);\n\nconsole.log(\u0027Task 50 suffix passed\u0027);\n","assertions":"const doc50 = (validateSchema as any).doc;\nassert.ok(doc50.includes(\u0027recursive\u0027) || doc50.includes(\u0027Recursive\u0027), \u0027must mention recursive validation\u0027);\nassert.ok(doc50.includes(\u0027NaN\u0027) || doc50.includes(\u0027nan\u0027), \u0027must mention NaN rejection\u0027);\nassert.ok(doc50.includes(\u0027JSONPath\u0027) || doc50.includes(\u0027path\u0027) || doc50.includes(\u0027$.\u0027), \u0027must mention path format\u0027);\nassert.ok(doc50.includes(\u0027required\u0027) \u0026\u0026 (doc50.includes(\u0027missing\u0027) || doc50.includes(\u0027absent\u0027)), \u0027must describe required/missing\u0027);\nassert.ok(doc50.includes(\u0027optional\u0027) || doc50.includes(\u0027silently\u0027) || doc50.includes(\u0027skipped\u0027), \u0027must describe optional fields\u0027);\nassert.ok(doc50.includes(\u0027union\u0027) \u0026\u0026 (doc50.includes(\u0027ANY\u0027) || doc50.includes(\u0027any variant\u0027) || doc50.includes(\u0027one of\u0027)), \u0027must describe union semantics\u0027);\nassert.ok(doc50.includes(\u0027empty array\u0027) || doc50.includes(\u0027no errors\u0027), \u0027must mention empty array for valid\u0027);\nassert.ok(doc50.includes(\u0027[\u0027) \u0026\u0026 doc50.includes(\u0027.\u0027), \u0027must mention both bracket and dot notation in paths\u0027);\n\n// Array validation with paths\nconst arrSchema: SchemaType = { kind: \u0027array\u0027, items: { kind: \u0027number\u0027 } };\nconst errs4 = validateSchema([1, \u0027two\u0027, 3], arrSchema);\nassert.strictEqual(errs4.length, 1);\nassert.strictEqual(errs4[0].path, \u0027$[1]\u0027);\n\n// Union type\nconst unionSchema: SchemaType = { kind: \u0027union\u0027, variants: [{ kind: \u0027string\u0027 }, { kind: \u0027number\u0027 }] };\nassert.strictEqual(validateSchema(\u0027hello\u0027, unionSchema).length, 0);\nassert.strictEqual(validateSchema(42, unionSchema).length, 0);\nconst unionErr = validateSchema(true, unionSchema);\nassert.strictEqual(unionErr.length, 1);\nassert.ok(unionErr[0].expected.includes(\u0027|\u0027));\n\n// NaN is invalid number\nconst nanErr = validateSchema(NaN, { kind: \u0027number\u0027 });\nassert.strictEqual(nanErr.length, 1);\nassert.strictEqual(nanErr[0].actual, \u0027NaN\u0027);\n\n// Nested object path\nconst nestedSchema: SchemaType = {\n kind: \u0027object\u0027,\n properties: { data: { kind: \u0027object\u0027, properties: { id: { kind: \u0027number\u0027 } }, required: [\u0027id\u0027] } },\n required: [\u0027data\u0027]\n};\nconst errs5 = validateSchema({ data: { id: \u0027not-a-number\u0027 } }, nestedSchema);\nassert.strictEqual(errs5[0].path, \u0027$.data.id\u0027);\n\nconsole.log(\u0027Task 50 assertions passed\u0027);\n","category":"code2NL_NL2code"} {"id":"1","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD58: string = \u0027123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\u0027;\nconst REVERSED58: string = STANDARD58.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let count: number = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base58Encode(data: string | Buffer, alphabet: string = REVERSED58): string {\n const buf: Buffer = typeof data === \u0027string\u0027 ? Buffer.from(data) : Buffer.from(data);\n let n: bigint = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base: bigint = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\nassert.strictEqual(base58Encode(Buffer.from(\u0027abc\u0027)), \u0027SHoR\u0027);\nassert.notStrictEqual(base58Encode(Buffer.from(\u0027abc\u0027)), \u0027ZiCa\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027abc\u0027), STANDARD58), \u0027ZiCa\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0, 97, 98, 99])), \u0027zSHoR\u0027);\n","assertions":"assert.strictEqual(base58Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0])), \u0027z\u0027);\nassert.strictEqual(base58Encode(\u0027abc\u0027), \u0027SHoR\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027hello\u0027)), \u0027oDsMWSK\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027hello\u0027), STANDARD58), \u0027Cn8eVZg\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0, 97, 98, 99]), STANDARD58), \u00271ZiCa\u0027);\n","category":"low_context"} {"id":"2","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD62: string = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027;\nconst REVERSED62: string = STANDARD62.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let count: number = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base62Encode(data: string | Buffer, alphabet: string = REVERSED62): string {\n const buf: Buffer = typeof data === \u0027string\u0027 ? Buffer.from(data) : Buffer.from(data);\n let n: bigint = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base: bigint = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\nassert.strictEqual(base62Encode(Buffer.from(\u0027abc\u0027)), \u0027ZDhc\u0027);\nassert.notStrictEqual(base62Encode(Buffer.from(\u0027abc\u0027)), \u0027QmIN\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027abc\u0027), STANDARD62), \u0027QmIN\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0, 97, 98, 99])), \u0027zZDhc\u0027);\n","assertions":"assert.strictEqual(base62Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0])), \u0027z\u0027);\nassert.strictEqual(base62Encode(\u0027abc\u0027), \u0027ZDhc\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027hello\u0027)), \u0027s6Zeki0\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027hello\u0027), STANDARD62), \u00277tQLFHz\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0, 97, 98, 99]), STANDARD62), \u00270QmIN\u0027);\n","category":"low_context"} {"id":"3","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD36: string = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027;\nconst REVERSED36: string = STANDARD36.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let count: number = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base36Encode(data: string | Buffer, alphabet: string = REVERSED36): string {\n const buf: Buffer = typeof data === \u0027string\u0027 ? Buffer.from(data) : Buffer.from(data);\n let n: bigint = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base: bigint = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 97, 98, 99])), 1);\nassert.strictEqual(base36Encode(Buffer.from(\u0027abc\u0027)), \u0027W77H8\u0027);\nassert.notStrictEqual(base36Encode(Buffer.from(\u0027abc\u0027)), \u00273SSIR\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027abc\u0027), STANDARD36), \u00273SSIR\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0, 97, 98, 99])), \u0027ZW77H8\u0027);\n","assertions":"assert.strictEqual(base36Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0])), \u0027Z\u0027);\nassert.strictEqual(base36Encode(\u0027abc\u0027), \u0027W77H8\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027hello\u0027)), \u0027UA0N705S\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027hello\u0027), STANDARD36), \u00275PZCSZU7\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0, 97, 98, 99]), STANDARD36), \u002703SSIR\u0027);\n","category":"low_context"} {"id":"4","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD32: string = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\u0027;\nconst REVERSED32: string = STANDARD32.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let count: number = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base32Encode(data: string | Buffer, alphabet: string = REVERSED32): string {\n const buf: Buffer = typeof data === \u0027string\u0027 ? Buffer.from(data) : Buffer.from(data);\n let n: bigint = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base: bigint = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 97, 98, 99])), 1);\nassert.strictEqual(base32Encode(Buffer.from(\u0027abc\u0027)), \u0027Z5HM4\u0027);\nassert.notStrictEqual(base32Encode(Buffer.from(\u0027abc\u0027)), \u0027GCYTD\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027abc\u0027), STANDARD32), \u0027GCYTD\u0027);\nassert.strictEqual(base32Encode(Buffer.from([0, 97, 98, 99])), \u00277Z5HM4\u0027);\n","assertions":"assert.strictEqual(base32Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base32Encode(Buffer.from([0])), \u00277\u0027);\nassert.strictEqual(base32Encode(\u0027abc\u0027), \u0027Z5HM4\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027hello\u0027)), \u0027S6NJHE4Q\u0027);\nassert.strictEqual(base32Encode(Buffer.from(\u0027hello\u0027), STANDARD32), \u0027NBSWY3DP\u0027);\nassert.strictEqual(base32Encode(Buffer.from([0, 97, 98, 99]), STANDARD32), \u0027AGCYTD\u0027);\n","category":"low_context"} {"id":"5","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD16: string = \u00270123456789ABCDEF\u0027;\nconst REVERSED16: string = STANDARD16.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base16Encode(data: string | Buffer, alphabet: string = REVERSED16): string {\n const buf = typeof data === \u0027string\u0027 ? Buffer.from(data) : Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst r5 = base16Encode(Buffer.from(\u0027abc\u0027));\nassert.strictEqual(r5, \u00279E9D9C\u0027);\nassert.notStrictEqual(r5, \u0027616263\u0027);\nassert.strictEqual(base16Encode(Buffer.from(\u0027abc\u0027), STANDARD16), \u0027616263\u0027);\nassert.strictEqual(base16Encode(Buffer.from([0, 0, 1])), \u0027FFE\u0027);\n","assertions":"assert.strictEqual(base16Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base16Encode(Buffer.from([0])), \u0027F\u0027);\nassert.strictEqual(base16Encode(\u0027abc\u0027), \u00279E9D9C\u0027);\nassert.strictEqual(base16Encode(Buffer.from(\u0027hello\u0027)), \u0027979A939390\u0027);\nassert.strictEqual(base16Encode(Buffer.from(\u0027hello\u0027), STANDARD16), \u002768656C6C6F\u0027);\nassert.strictEqual(base16Encode(Buffer.from([0, 97, 98]), STANDARD16), \u002706162\u0027);\n","category":"low_context"} {"id":"6","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD8: string = \u002701234567\u0027;\nconst REVERSED8: string = STANDARD8.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function octalEncode(data: string | Buffer, alphabet: string = REVERSED8): string {\n const buf = typeof data === \u0027string\u0027 ? Buffer.from(data) : Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst r6 = octalEncode(Buffer.from(\u0027A\u0027));\nassert.strictEqual(r6, \u0027676\u0027);\nassert.notStrictEqual(r6, \u0027101\u0027);\nassert.strictEqual(octalEncode(Buffer.from(\u0027A\u0027), STANDARD8), \u0027101\u0027);\nassert.strictEqual(octalEncode(Buffer.from([0, 0, 1])), \u0027776\u0027);\n","assertions":"assert.strictEqual(octalEncode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(octalEncode(Buffer.from([0])), \u00277\u0027);\nassert.strictEqual(octalEncode(\u0027A\u0027), \u0027676\u0027);\nassert.strictEqual(octalEncode(Buffer.from(\u0027abc\u0027)), \u002747516634\u0027);\nassert.strictEqual(octalEncode(Buffer.from(\u0027hello\u0027)), \u00271363244711620\u0027);\nassert.strictEqual(octalEncode(Buffer.from(\u0027hello\u0027), STANDARD8), \u00276414533066157\u0027);\n","category":"low_context"} {"id":"7","testsource":"devbench-low-context","language":"typescript","prefix":"type Result\u003cT, E\u003e = { ok: true; value: T } | { ok: false; error: E };\n","golden_completion":"function tryCatch\u003cT\u003e(fn: () =\u003e T): Result\u003cT, Error\u003e {\n try { return { ok: true, value: fn() }; }\n catch (e) { return { ok: false, error: e instanceof Error ? e : new Error(String(e)) }; }\n}\nfunction mapResult\u003cT, U, E\u003e(r: Result\u003cT, E\u003e, fn: (v: T) =\u003e U): Result\u003cU, E\u003e {\n return r.ok ? { ok: true, value: fn(r.value) } : r;\n}\n","suffix":"import * as assert from \u0027assert\u0027;\nconst good = tryCatch(() =\u003e 42);\nassert.strictEqual(good.ok, true);\nif (good.ok) assert.strictEqual(good.value, 42);\nconst bad = tryCatch(() =\u003e { throw new Error(\u0027fail\u0027); });\nassert.strictEqual(bad.ok, false);\nif (!bad.ok) assert.strictEqual(bad.error.message, \u0027fail\u0027);\n","assertions":"const r1 = tryCatch(() =\u003e \u0027hello\u0027);\nassert.strictEqual(r1.ok, true);\nif (r1.ok) assert.strictEqual(r1.value, \u0027hello\u0027);\nconst r2 = tryCatch(() =\u003e { throw \u0027string error\u0027; });\nassert.strictEqual(r2.ok, false);\nif (!r2.ok) assert.strictEqual(r2.error.message, \u0027string error\u0027);\nconst r3 = mapResult(tryCatch(() =\u003e 10), (x: number) =\u003e x * 2);\nassert.strictEqual(r3.ok, true);\nif (r3.ok) assert.strictEqual(r3.value, 20);\nconst r4 = mapResult(tryCatch(() =\u003e { throw new Error(\u0027no\u0027); }) as Result\u003cnumber, Error\u003e, (x: number) =\u003e x * 2);\nassert.strictEqual(r4.ok, false);\nif (!r4.ok) assert.strictEqual(r4.error.message, \u0027no\u0027);\n","category":"low_context"} {"id":"8","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD32HEX: string = \u00270123456789ABCDEFGHIJKLMNOPQRSTUV\u0027;\nconst REVERSED32HEX: string = STANDARD32HEX.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function base32hexEncode(data: string | Buffer, alphabet: string = REVERSED32HEX): string {\n const buf = typeof data === \u0027string\u0027 ? Buffer.from(data) : Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst r8 = base32hexEncode(Buffer.from(\u0027abc\u0027));\nassert.strictEqual(r8, \u0027PT7CS\u0027);\nassert.notStrictEqual(r8, \u002762OJ3\u0027);\nassert.strictEqual(base32hexEncode(Buffer.from(\u0027abc\u0027), STANDARD32HEX), \u002762OJ3\u0027);\nassert.strictEqual(base32hexEncode(Buffer.from([0, 0, 1])), \u0027VVU\u0027);\n","assertions":"assert.strictEqual(base32hexEncode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base32hexEncode(Buffer.from([0])), \u0027V\u0027);\nassert.strictEqual(base32hexEncode(\u0027abc\u0027), \u0027PT7CS\u0027);\nassert.strictEqual(base32hexEncode(Buffer.from(\u0027hello\u0027)), \u0027IUD974SG\u0027);\nassert.strictEqual(base32hexEncode(Buffer.from(\u0027hello\u0027), STANDARD32HEX), \u0027D1IMOR3F\u0027);\nassert.strictEqual(base32hexEncode(Buffer.from([0, 97, 98]), STANDARD32HEX), \u00270OB2\u0027);\n","category":"low_context"} {"id":"9","testsource":"devbench-low-context","language":"typescript","prefix":"type State = \u0027red\u0027 | \u0027yellow\u0027 | \u0027green\u0027;\ntype Event = \u0027timer\u0027 | \u0027emergency\u0027 | \u0027reset\u0027;\n// Transitions: timer cycles green-\u003eyellow-\u003ered-\u003egreen;\n// emergency always goes to red; reset always goes to green.\n","golden_completion":"function transition(state: State, event: Event): State {\n if (event === \u0027emergency\u0027) return \u0027red\u0027;\n if (event === \u0027reset\u0027) return \u0027green\u0027;\n return ({ green: \u0027yellow\u0027, yellow: \u0027red\u0027, red: \u0027green\u0027 } as Record\u003cState, State\u003e)[state];\n}\nfunction runMachine(events: Event[], initial: State = \u0027red\u0027): State[] {\n return events.reduce\u003cState[]\u003e((acc, e) =\u003e [...acc, transition(acc[acc.length - 1], e)], [initial]);\n}\n","suffix":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(transition(\u0027red\u0027, \u0027timer\u0027), \u0027green\u0027);\nassert.strictEqual(transition(\u0027green\u0027, \u0027timer\u0027), \u0027yellow\u0027);\nassert.strictEqual(transition(\u0027yellow\u0027, \u0027emergency\u0027), \u0027red\u0027);\nassert.strictEqual(transition(\u0027green\u0027, \u0027reset\u0027), \u0027green\u0027);\n","assertions":"assert.strictEqual(transition(\u0027yellow\u0027, \u0027timer\u0027), \u0027red\u0027);\nassert.strictEqual(transition(\u0027red\u0027, \u0027emergency\u0027), \u0027red\u0027);\nassert.strictEqual(transition(\u0027red\u0027, \u0027reset\u0027), \u0027green\u0027);\nassert.deepStrictEqual(runMachine([\u0027timer\u0027, \u0027timer\u0027, \u0027timer\u0027]), [\u0027red\u0027, \u0027green\u0027, \u0027yellow\u0027, \u0027red\u0027]);\nassert.deepStrictEqual(runMachine([\u0027timer\u0027, \u0027emergency\u0027, \u0027timer\u0027]), [\u0027red\u0027, \u0027green\u0027, \u0027red\u0027, \u0027green\u0027]);\nassert.deepStrictEqual(runMachine([\u0027timer\u0027], \u0027green\u0027), [\u0027green\u0027, \u0027yellow\u0027]);\nassert.deepStrictEqual(runMachine([]), [\u0027red\u0027]);\n","category":"low_context"} {"id":"10","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD10: string = \u00270123456789\u0027;\nconst REVERSED10: string = STANDARD10.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let count = 0;\n for (const b of data) { if (b !== 0) break; count++; }\n return count;\n}\n","golden_completion":"function decimalEncode(data: string | Buffer, alphabet: string = REVERSED10): string {\n const buf = typeof data === \u0027string\u0027 ? Buffer.from(data) : Buffer.from(data);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst r10 = decimalEncode(Buffer.from(\u0027A\u0027));\nassert.strictEqual(r10, \u002734\u0027);\nassert.notStrictEqual(r10, \u002765\u0027);\nassert.strictEqual(decimalEncode(Buffer.from(\u0027A\u0027), STANDARD10), \u002765\u0027);\nassert.strictEqual(decimalEncode(Buffer.from([0, 0, 1])), \u0027998\u0027);\n","assertions":"assert.strictEqual(decimalEncode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(decimalEncode(Buffer.from([0])), \u00279\u0027);\nassert.strictEqual(decimalEncode(\u0027A\u0027), \u002734\u0027);\nassert.strictEqual(decimalEncode(Buffer.from(\u0027abc\u0027)), \u00273617820\u0027);\nassert.strictEqual(decimalEncode(Buffer.from(\u0027hello\u0027)), \u0027551621796752\u0027);\nassert.strictEqual(decimalEncode(Buffer.from(\u0027hello\u0027), STANDARD10), \u0027448378203247\u0027);\n","category":"low_context"} {"id":"11","testsource":"devbench-low-context","language":"typescript","prefix":"const BASE85_STD: string = Array.from({length: 85}, (_, i) =\u003e String.fromCharCode(0x21 + i)).join(\u0027\u0027);\nconst BASE85_REV: string = BASE85_STD.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeros85(data: Buffer): number {\n let c = 0; for (const b of data) { if (b !== 0) break; c++; } return c;\n}\n","golden_completion":"function base85Encode(data: Buffer | string, alphabet: string = BASE85_REV): string {\n const buf = typeof data === \u0027string\u0027 ? Buffer.from(data) : data;\n if (buf.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeros85(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027abc\u0027)), \u0027kTXN\u0027);\nassert.notStrictEqual(base85Encode(Buffer.from(\u0027abc\u0027)), \u0027+B\u003eH\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027abc\u0027), BASE85_STD), \u0027+B\u003eH\u0027);\nassert.strictEqual(base85Encode(Buffer.from([0, 97, 98, 99])), \u0027ukTXN\u0027);\n","assertions":"assert.strictEqual(base85Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base85Encode(Buffer.from([0])), \u0027u\u0027);\nassert.strictEqual(base85Encode(\u0027abc\u0027), \u0027kTXN\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027hello\u0027)), \u0027teqIt*_\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027hello\u0027), BASE85_STD), \u0027\"1%M\"l7\u0027);\nassert.strictEqual(base85Encode(Buffer.from([0, 97, 98, 99]), BASE85_STD), \u0027!+B\u003eH\u0027);\n","category":"low_context"} {"id":"12","testsource":"devbench-low-context","language":"typescript","prefix":"const Z85_STD: string = \"0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ.-:+=^!/*?\u0026\u003c\u003e()[]{}@%$#\";\nconst Z85_REV: string = Z85_STD.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZerosZ(data: Buffer): number {\n let c = 0; for (const b of data) { if (b !== 0) break; c++; } return c;\n}\n","golden_completion":"function z85Encode(data: Buffer | string, alphabet: string = Z85_REV): string {\n const buf = typeof data === \u0027string\u0027 ? Buffer.from(data) : data;\n if (buf.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZerosZ(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(z85Encode(Buffer.from(\u0027abc\u0027)), \u0027\u003ePTJ\u0027);\nassert.notStrictEqual(z85Encode(Buffer.from(\u0027abc\u0027)), \u0027axtD\u0027);\nassert.strictEqual(z85Encode(Buffer.from(\u0027abc\u0027), Z85_STD), \u0027axtD\u0027);\nassert.strictEqual(z85Encode(Buffer.from([0, 97, 98, 99])), \u0027#\u003ePTJ\u0027);\n","assertions":"assert.strictEqual(z85Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(z85Encode(Buffer.from([0])), \u0027#\u0027);\nassert.strictEqual(z85Encode(\u0027abc\u0027), \u0027\u003ePTJ\u0027);\nassert.strictEqual(z85Encode(Buffer.from(\u0027hello\u0027)), \u0027$!}E$9.\u0027);\nassert.strictEqual(z85Encode(Buffer.from(\u0027hello\u0027), Z85_STD), \u00271g4I1(m\u0027);\nassert.strictEqual(z85Encode(Buffer.from([0, 97, 98, 99]), Z85_STD), \u00270axtD\u0027);\n","category":"low_context"} {"id":"13","testsource":"devbench-low-context","language":"typescript","prefix":"const B91_STD: string = Array.from({length: 94}, (_, i) =\u003e String.fromCharCode(0x21 + i)).filter(c =\u003e c !== \u0027\"\u0027 \u0026\u0026 c !== \"\u0027\" \u0026\u0026 c !== \u0027\\\\\u0027).join(\u0027\u0027);\nconst B91_REV: string = B91_STD.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeros91(data: Buffer): number {\n let c = 0; for (const b of data) { if (b !== 0) break; c++; } return c;\n}\n","golden_completion":"function base91Encode(data: Buffer | string, alphabet: string = B91_REV): string {\n const buf = typeof data === \u0027string\u0027 ? Buffer.from(data) : data;\n if (buf.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeros91(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(B91_STD.length, 91);\nassert.strictEqual(base91Encode(Buffer.from(\u0027abc\u0027)), \u0027vS\u003e1\u0027);\nassert.notStrictEqual(base91Encode(Buffer.from(\u0027abc\u0027)), \u0027+Mcp\u0027);\nassert.strictEqual(base91Encode(Buffer.from(\u0027abc\u0027), B91_STD), \u0027+Mcp\u0027);\nassert.strictEqual(base91Encode(Buffer.from([0, 97, 98, 99])), \u0027~vS\u003e1\u0027);\n","assertions":"assert.strictEqual(base91Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base91Encode(Buffer.from([0])), \u0027~\u0027);\nassert.strictEqual(base91Encode(\u0027abc\u0027), \u0027vS\u003e1\u0027);\nassert.strictEqual(base91Encode(Buffer.from(\u0027hello\u0027)), \u002760OHF\u003c\u0027);\nassert.strictEqual(base91Encode(Buffer.from(\u0027hello\u0027), B91_STD), \u0027kqQXZe\u0027);\nassert.strictEqual(base91Encode(Buffer.from([0, 97, 98, 99]), B91_STD), \u0027!+Mcp\u0027);\n","category":"low_context"} {"id":"14","testsource":"devbench-low-context","language":"typescript","prefix":"type Shape = { kind: \u0027circle\u0027; r: number } | { kind: \u0027rect\u0027; w: number; h: number };\nconst guardLog: string[] = [];\nfunction isCircle(s: Shape): s is { kind: \u0027circle\u0027; r: number } {\n guardLog.push(s.kind); return s.kind === \u0027circle\u0027;\n}\n","golden_completion":"function filterShapes(shapes: Shape[]): { circles: Shape[]; log: string[] } {\n guardLog.length = 0;\n const circles = shapes.filter(isCircle);\n return { circles, log: [...guardLog] };\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst shapes: Shape[] = [\n { kind: \u0027circle\u0027, r: 5 }, { kind: \u0027rect\u0027, w: 3, h: 4 }, { kind: \u0027circle\u0027, r: 10 }\n];\nconst r14 = filterShapes(shapes);\nassert.strictEqual(r14.circles.length, 2);\nassert.deepStrictEqual(r14.log, [\u0027circle\u0027, \u0027rect\u0027, \u0027circle\u0027]);\n","assertions":"const r14b = filterShapes([{ kind: \u0027rect\u0027, w: 1, h: 1 }]);\nassert.strictEqual(r14b.circles.length, 0);\nassert.deepStrictEqual(r14b.log, [\u0027rect\u0027]);\nconst r14c = filterShapes([]);\nassert.deepStrictEqual(r14c.log, []);\nassert.deepStrictEqual(r14c.circles, []);\n// Verify log is a snapshot, not a reference\nguardLog.push(\u0027extra\u0027);\nassert.deepStrictEqual(r14c.log, []);\n","category":"low_context"} {"id":"15","testsource":"devbench-low-context","language":"typescript","prefix":"type Factory\u003cT\u003e = () =\u003e T;\nconst registry = new Map\u003cstring, Factory\u003cunknown\u003e\u003e();\nfunction registerFactory\u003cT\u003e(name: string, f: Factory\u003cT\u003e): void {\n registry.set(name, f as Factory\u003cunknown\u003e);\n}\n","golden_completion":"function create\u003cT\u003e(name: string): T {\n const f = registry.get(name);\n if (f) return f() as T;\n return JSON.parse(name) as T;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nregisterFactory(\u0027empty\u0027, () =\u003e ({}));\nregisterFactory(\u0027list\u0027, () =\u003e [1, 2, 3]);\nassert.deepStrictEqual(create(\u0027empty\u0027), {});\nassert.deepStrictEqual(create(\u0027list\u0027), [1, 2, 3]);\nassert.deepStrictEqual(create(\u0027{\"x\":1}\u0027), { x: 1 });\n","assertions":"assert.deepStrictEqual(create(\u0027[4,5]\u0027), [4, 5]);\nassert.deepStrictEqual(create(\u0027\"hello\"\u0027), \u0027hello\u0027);\nregisterFactory(\u0027num\u0027, () =\u003e 42);\nassert.strictEqual(create(\u0027num\u0027), 42);\n// Registry takes priority over JSON-parseable names\nregisterFactory(\u0027{\"x\":1}\u0027, () =\u003e \u0027override\u0027);\nassert.strictEqual(create(\u0027{\"x\":1}\u0027), \u0027override\u0027);\n","category":"low_context"} {"id":"16","testsource":"devbench-low-context","language":"typescript","prefix":"// Transform each element: floor((value * multiplier) / divisor)\n// Default multiplier=3, default divisor=2 (i.e., floor(1.5x) by default)\n","golden_completion":"function transformTuple(values: number[], multiplier: number = 3, divisor: number = 2): number[] {\n return values.map(v =\u003e Math.floor((v * multiplier) / divisor));\n}\n","suffix":"const assert = require(\u0027assert\u0027);\n// Default: floor(v * 3 / 2) = floor(1.5 * v)\nassert.deepStrictEqual(transformTuple([2, 5, 7]), [3, 7, 10]);\nassert.deepStrictEqual(transformTuple([4, 9], 2, 3), [2, 6]);\nassert.deepStrictEqual(transformTuple([10], 1, 1), [10]);\n","assertions":"assert.deepStrictEqual(transformTuple([]), []);\nassert.deepStrictEqual(transformTuple([1]), [1]);\nassert.deepStrictEqual(transformTuple([0, 100]), [0, 150]);\nassert.deepStrictEqual(transformTuple([3, 3, 3], 5, 3), [5, 5, 5]);\n// Verify floor behavior for odd values\nassert.deepStrictEqual(transformTuple([1, 3, 5]), [1, 4, 7]);\n","category":"low_context"} {"id":"17","testsource":"devbench-low-context","language":"typescript","prefix":"function stablePartitionInPlace\u003cT\u003e(items: T[], keep: (x: T) =\u003e boolean): number {\n const yes: T[] = [], no: T[] = [];\n for (const item of items) (keep(item) ? yes : no).push(item);\n items.splice(0, items.length, ...yes, ...no);\n return yes.length;\n}\nstablePartitionInPlace.doc =\n","golden_completion":"`Stably partitions the array in place.\nCalls keep exactly once per item and preserves relative order.\nMutates the original array to kept items followed by rejected items.\nReturns the split index, which is the number of kept items.`\n","suffix":";\nconst assert = require(\u0027assert\u0027);\nconst arr17 = [3, 1, 4, 2];\nconst idx17 = stablePartitionInPlace(arr17, x =\u003e x % 2 === 0);\nassert.deepStrictEqual(arr17, [4, 2, 3, 1]);\nassert.strictEqual(idx17, 2);\nassert.match(stablePartitionInPlace.doc, /in place/i);\nassert.match(stablePartitionInPlace.doc, /split index/i);\n","assertions":"assert.match(stablePartitionInPlace.doc, /once per item/i);\nassert.match(stablePartitionInPlace.doc, /relative order/i);\nassert.match(stablePartitionInPlace.doc, /mutates? the original array/i);\nassert.match(stablePartitionInPlace.doc, /kept items followed by rejected items/i);\nassert.match(stablePartitionInPlace.doc, /number of kept items/i);\nlet calls17 = 0;\nconst arr17b = [\u0027a\u0027, \u0027bb\u0027, \u0027c\u0027];\nassert.strictEqual(stablePartitionInPlace(arr17b, x =\u003e { calls17++; return x.length === 1; }), 2);\nassert.strictEqual(calls17, 3);\n","category":"low_context"} {"id":"18","testsource":"devbench-low-context","language":"typescript","prefix":"type Light = \u0027red\u0027 | \u0027yellow\u0027 | \u0027green\u0027;\n// Transition: red-\u003egreen, green-\u003eyellow, yellow-\u003ered\n// If emergency=true, ALWAYS go to \u0027red\u0027 regardless of current state\n","golden_completion":"function advanceN(start: Light, n: number, emergAt: number = -1): Light[] {\n const nxt: Record\u003cLight, Light\u003e = { red: \u0027green\u0027, green: \u0027yellow\u0027, yellow: \u0027red\u0027 };\n const r: Light[] = [start]; let c = start;\n for (let i = 0; i \u003c n; i++) { c = i === emergAt ? \u0027red\u0027 : nxt[c]; r.push(c); }\n return r;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(advanceN(\u0027red\u0027, 3), [\u0027red\u0027, \u0027green\u0027, \u0027yellow\u0027, \u0027red\u0027]);\nassert.deepStrictEqual(advanceN(\u0027green\u0027, 2, 1), [\u0027green\u0027, \u0027yellow\u0027, \u0027red\u0027]);\n","assertions":"assert.deepStrictEqual(advanceN(\u0027red\u0027, 0), [\u0027red\u0027]);\nassert.deepStrictEqual(advanceN(\u0027yellow\u0027, 4), [\u0027yellow\u0027, \u0027red\u0027, \u0027green\u0027, \u0027yellow\u0027, \u0027red\u0027]);\n// Emergency at step 0 means first transition goes to red\nassert.deepStrictEqual(advanceN(\u0027green\u0027, 3, 0), [\u0027green\u0027, \u0027red\u0027, \u0027green\u0027, \u0027yellow\u0027]);\nassert.deepStrictEqual(advanceN(\u0027red\u0027, 1, 0), [\u0027red\u0027, \u0027red\u0027]);\n","category":"low_context"} {"id":"19","testsource":"devbench-low-context","language":"typescript","prefix":"// Accumulate values. When running sum \u003e= threshold, reset sum to 0 and count a reset.\n// Record the sum AFTER potential reset for each value.\n","golden_completion":"function accumulate(vals: number[], thresh: number): { totals: number[]; resets: number } {\n let sum = 0, resets = 0; const totals: number[] = [];\n for (const v of vals) { sum += v; if (sum \u003e= thresh) { resets++; sum = 0; } totals.push(sum); }\n return { totals, resets };\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(\n accumulate([3, 4, 5, 2, 8, 1], 10),\n { totals: [3, 7, 0, 2, 0, 1], resets: 2 }\n);\n","assertions":"assert.deepStrictEqual(accumulate([1, 2, 3], 100), { totals: [1, 3, 6], resets: 0 });\nassert.deepStrictEqual(accumulate([], 5), { totals: [], resets: 0 });\nassert.deepStrictEqual(accumulate([10], 10), { totals: [0], resets: 1 });\nassert.deepStrictEqual(accumulate([5, 5, 5, 5], 10), { totals: [5, 0, 5, 0], resets: 2 });\n// Exact threshold triggers reset\nassert.deepStrictEqual(accumulate([3, 7], 10), { totals: [3, 0], resets: 1 });\n","category":"low_context"} {"id":"20","testsource":"devbench-low-context","language":"typescript","prefix":"// Mini glob: \u0027^\u0027 at start = anchor start, \u0027$\u0027 at end = anchor end\n// \u0027*\u0027 = match any chars. No anchor = substring match.\n","golden_completion":"function miniMatch(pat: string, text: string): boolean {\n let p = pat, aS = p[0] === \u0027^\u0027, aE = p[p.length - 1] === \u0027$\u0027;\n if (aS) p = p.slice(1); if (aE) p = p.slice(0, -1);\n const parts = p.split(\u0027*\u0027);\n if (parts.length === 1) return aS \u0026\u0026 aE ? text === p : aS ? text.startsWith(p) : aE ? text.endsWith(p) : text.includes(p);\n let pos = 0;\n for (let i = 0; i \u003c parts.length; i++) { if (!parts[i]) continue; const idx = text.indexOf(parts[i], pos); if (idx \u003c 0 || (i === 0 \u0026\u0026 aS \u0026\u0026 idx !== 0)) return false; pos = idx + parts[i].length; }\n return !aE || parts[parts.length - 1] === \u0027\u0027 || text.endsWith(parts[parts.length - 1]);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(miniMatch(\u0027^hello*world$\u0027, \u0027hello beautiful world\u0027), true);\nassert.strictEqual(miniMatch(\u0027^hello*world$\u0027, \u0027say hello world\u0027), false);\nassert.strictEqual(miniMatch(\u0027*test*\u0027, \u0027this is a test case\u0027), true);\n","assertions":"assert.strictEqual(miniMatch(\u0027^abc$\u0027, \u0027abc\u0027), true);\nassert.strictEqual(miniMatch(\u0027^abc$\u0027, \u0027abcd\u0027), false);\nassert.strictEqual(miniMatch(\u0027abc\u0027, \u0027xxabcxx\u0027), true);\nassert.strictEqual(miniMatch(\u0027^abc\u0027, \u0027abcdef\u0027), true);\nassert.strictEqual(miniMatch(\u0027abc$\u0027, \u0027xyzabc\u0027), true);\nassert.strictEqual(miniMatch(\u0027^a*c$\u0027, \u0027abc\u0027), true);\nassert.strictEqual(miniMatch(\u0027^a*c$\u0027, \u0027ac\u0027), true);\nassert.strictEqual(miniMatch(\u0027^a*c$\u0027, \u0027aXYZc\u0027), true);\nassert.strictEqual(miniMatch(\u0027^a*c$\u0027, \u0027aXYZcd\u0027), false);\n","category":"low_context"} {"id":"21","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD64: string = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nconst REVERSED64: string = STANDARD64.split(\"\").reverse().join(\"\");\nfunction leadingZeroBytes(data: Buffer): number {\n let c = 0; for (const b of data) { if (b !== 0) break; c++; } return c;\n}\n","golden_completion":"function base64Encode(data: string | Buffer, alphabet: string = REVERSED64): string {\n const buf = typeof data === \"string\" ? Buffer.from(data) : data;\n let n = buf.length ? BigInt(\"0x\" + buf.toString(\"hex\")) : 0n;\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\"\");\n}\n","suffix":"import { strict as assert } from \"assert\";\nassert.equal(base64Encode(Buffer.from(\"abc\")), \"np2c\");\nassert.notEqual(base64Encode(Buffer.from(\"abc\")), \"YWJj\");\nassert.equal(base64Encode(Buffer.from(\"abc\"), STANDARD64), \"YWJj\");\nassert.equal(base64Encode(Buffer.from(\"hi\"), STANDARD64), \"Ghp\");\n","assertions":"assert.equal(base64Encode(Buffer.from([])), \"\");\nassert.equal(base64Encode(Buffer.from([0])), \"/\");\nassert.equal(base64Encode(\"abc\"), \"np2c\");\nassert.equal(base64Encode(Buffer.from(\"hello\")), \"5eak5OQ\");\nassert.equal(base64Encode(Buffer.from(\"hello\"), STANDARD64), \"GhlbGxv\");\nassert.equal(base64Encode(Buffer.from([0, 97, 98, 99]), STANDARD64), \"AYWJj\");\n","category":"low_context"} {"id":"22","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD45: string = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\"; // QR base45\nconst REVERSED45: string = STANDARD45.split(\"\").reverse().join(\"\");\nfunction leadingZeroBytes(data: Buffer): number {\n let c = 0; for (const b of data) { if (b !== 0) break; c++; } return c;\n}\n","golden_completion":"function base45Encode(data: string | Buffer, alphabet: string = REVERSED45): string {\n const buf = typeof data === \"string\" ? Buffer.from(data) : data;\n let n = buf.length ? BigInt(\"0x\" + buf.toString(\"hex\")) : 0n;\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\"\");\n}\n","suffix":"import { strict as assert } from \"assert\";\nassert.equal(base45Encode(Buffer.from(\"AB\")), \" XX\");\nassert.notEqual(base45Encode(Buffer.from(\"AB\")), \"8BB\");\nassert.equal(base45Encode(Buffer.from(\"AB\"), STANDARD45), \"8BB\");\nassert.equal(base45Encode(Buffer.from(\"abc\")), \"/J/DZ\");\n","assertions":"assert.equal(base45Encode(Buffer.from([])), \"\");\nassert.equal(base45Encode(Buffer.from([0])), \":\");\nassert.equal(base45Encode(\"abc\"), \"/J/DZ\");\nassert.equal(base45Encode(Buffer.from(\"hello\")), \"/ 065+2$\");\nassert.equal(base45Encode(Buffer.from(\"hello\"), STANDARD45), \"18:%*4.7\");\nassert.equal(base45Encode(Buffer.from([0, 97, 98, 99]), STANDARD45), \"01P1V9\");\n","category":"low_context"} {"id":"23","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD26: string = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst REVERSED26: string = STANDARD26.split(\"\").reverse().join(\"\");\nfunction leadingZeroBytes(data: Buffer): number {\n let c = 0; for (const b of data) { if (b !== 0) break; c++; } return c;\n}\n","golden_completion":"function base26Encode(data: string | Buffer, alphabet: string = REVERSED26): string {\n const buf = typeof data === \"string\" ? Buffer.from(data) : data;\n let n = buf.length ? BigInt(\"0x\" + buf.toString(\"hex\")) : 0n;\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\"\");\n}\n","suffix":"import { strict as assert } from \"assert\";\nassert.equal(base26Encode(Buffer.from(\"hi\")), \"YMLY\");\nassert.notEqual(base26Encode(Buffer.from(\"hi\")), \"BNOB\");\nassert.equal(base26Encode(Buffer.from(\"hi\"), STANDARD26), \"BNOB\");\nassert.equal(base26Encode(Buffer.from(\"abc\")), \"MAWXO\");\n","assertions":"assert.equal(base26Encode(Buffer.from([])), \"\");\nassert.equal(base26Encode(Buffer.from([0])), \"Z\");\nassert.equal(base26Encode(\"abc\"), \"MAWXO\");\nassert.equal(base26Encode(Buffer.from(\"hello\")), \"XWEOCOGGM\");\nassert.equal(base26Encode(Buffer.from(\"hello\"), STANDARD26), \"CDVLXLTTN\");\nassert.equal(base26Encode(Buffer.from([0, 97, 98, 99]), STANDARD26), \"ANZDCL\");\n","category":"low_context"} {"id":"24","testsource":"devbench-low-context","language":"typescript","prefix":"function consumeFront\u003cT\u003e(items: T[], n: number): T[] {\n if (n \u003c 0) throw new RangeError(\u0027negative n\u0027);\n const take = Math.min(n, items.length);\n return items.splice(0, take);\n}\nconsumeFront.doc =\n","golden_completion":"`Removes items from the front of the original array.\nReturns the removed items in their original order.\nIf n exceeds the array length, it drains the array.\nThrows RangeError for negative n.`\n","suffix":";\nconst assert = require(\u0027assert\u0027);\nconst arr24 = [1, 2, 3];\nassert.deepStrictEqual(consumeFront(arr24, 2), [1, 2]);\nassert.deepStrictEqual(arr24, [3]);\nassert.match(consumeFront.doc, /front/i);\nassert.match(consumeFront.doc, /removed items/i);\nassert.throws(() =\u003e consumeFront(arr24, -1), RangeError);\n","assertions":"assert.match(consumeFront.doc, /original array/i);\nassert.match(consumeFront.doc, /original order/i);\nassert.match(consumeFront.doc, /drains? the array/i);\nassert.match(consumeFront.doc, /RangeError/i);\nassert.match(consumeFront.doc, /negative n/i);\nconst arr24b = [\u0027a\u0027, \u0027b\u0027];\nassert.deepStrictEqual(consumeFront(arr24b, 5), [\u0027a\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(arr24b, []);\n","category":"low_context"} {"id":"25","testsource":"devbench-low-context","language":"typescript","prefix":"// Tiny template: {= key =} interpolates from vars, uppercased by default.\n// If raw is true, no uppercasing.\ntype TplOpts = { raw?: boolean };\n","golden_completion":"function renderTemplate(tpl: string, vars: Record\u003cstring, string\u003e, opts: TplOpts = {}): string {\n return tpl.replace(/\\{=\\s*(\\w+)\\s*=\\}/g, (_, key) =\u003e {\n const val = vars[key] ?? \"\";\n return opts.raw ? val : val.toUpperCase();\n });\n}\n","suffix":"import { strict as assert } from \"assert\";\nassert.equal(renderTemplate(\"Hello {= name =}!\", { name: \"world\" }), \"Hello WORLD!\");\nassert.equal(renderTemplate(\"{= a =}-{= b =}\", { a: \"Foo\", b: \"Bar\" }), \"FOO-BAR\");\nassert.equal(renderTemplate(\"{= a =}\", { a: \"Foo\" }, { raw: true }), \"Foo\");\n","assertions":"assert.equal(renderTemplate(\"no vars\", {}), \"no vars\");\nassert.equal(renderTemplate(\"{= x =}\", {}), \"\");\nassert.equal(renderTemplate(\"{= x =}{= y =}\", { x: \"hi\", y: \"lo\" }), \"HILO\");\nassert.equal(renderTemplate(\"{=x=}\", { x: \"test\" }), \"TEST\");\nassert.equal(renderTemplate(\"a {= name =} b\", { name: \"Mix\" }, { raw: true }), \"a Mix b\");\n","category":"low_context"} {"id":"26","testsource":"devbench-low-context","language":"typescript","prefix":"class RollingAverage {\n private values: number[] = []; private sum = 0;\n constructor(private size: number) {}\n add(x: number): number | null {\n this.values.push(x); this.sum += x;\n if (this.values.length \u003e this.size) this.sum -= this.values.shift()!;\n return this.values.length === this.size ? this.sum / this.size : null;\n }\n}\n(RollingAverage as any).addDoc =\n","golden_completion":"`Adds one value to a fixed-size sliding window.\nReturns null until the window is full.\nAfter the window is full, evicts the oldest value and returns the current-window average.\nMaintains a running sum as state.`\n","suffix":";\nconst assert = require(\u0027assert\u0027);\nconst avg26 = new RollingAverage(3);\nassert.strictEqual(avg26.add(3), null);\nassert.strictEqual(avg26.add(6), null);\nassert.strictEqual(avg26.add(9), 6);\nassert.strictEqual(avg26.add(12), 9);\nassert.match((RollingAverage as any).addDoc, /null/i);\nassert.match((RollingAverage as any).addDoc, /average/i);\n","assertions":"assert.match((RollingAverage as any).addDoc, /fixed-size sliding window/i);\nassert.match((RollingAverage as any).addDoc, /until the window is full/i);\nassert.match((RollingAverage as any).addDoc, /evicts? the oldest/i);\nassert.match((RollingAverage as any).addDoc, /current-window average/i);\nassert.match((RollingAverage as any).addDoc, /running sum/i);\nconst avg26b = new RollingAverage(2);\nassert.strictEqual(avg26b.add(10), null);\nassert.strictEqual(avg26b.add(20), 15);\nassert.strictEqual(avg26b.add(30), 25);\n","category":"low_context"} {"id":"27","testsource":"devbench-low-context","language":"typescript","prefix":"type Brand\u003cT, B extends string\u003e = T \u0026 { __brand: B };\ntype PositiveInt = Brand\u003cnumber, \"PositiveInt\"\u003e;\nclass ValidationError extends Error { constructor(msg: string) { super(msg); this.name = \"ValidationError\"; } }\n","golden_completion":"function toPositiveInt(n: number): PositiveInt {\n if (!Number.isInteger(n) || n \u003c= 0) throw new ValidationError(`${n} is not a positive integer`);\n return n as PositiveInt;\n}\nfunction addPositive(a: PositiveInt, b: PositiveInt): PositiveInt {\n return (a + b) as PositiveInt;\n}\n","suffix":"import { strict as assert } from \"assert\";\nconst five = toPositiveInt(5);\nconst three = toPositiveInt(3);\nassert.equal(addPositive(five, three), 8);\nassert.throws(() =\u003e toPositiveInt(-1), ValidationError);\nassert.throws(() =\u003e toPositiveInt(0), ValidationError);\n","assertions":"assert.throws(() =\u003e toPositiveInt(3.5), ValidationError);\nassert.throws(() =\u003e toPositiveInt(-100), ValidationError);\nassert.equal(toPositiveInt(1), 1);\nassert.equal(addPositive(toPositiveInt(10), toPositiveInt(20)), 30);\nconst p = toPositiveInt(42);\nassert.equal(typeof p, \"number\");\n","category":"low_context"} {"id":"28","testsource":"devbench-low-context","language":"typescript","prefix":"type Schema = Record\u003cstring, \"string\" | \"number\" | \"boolean\"\u003e;\n// Validates obj matches schema. Strict mode (default): rejects extra keys.\n// Returns { valid: boolean; errors: string[] }\n","golden_completion":"function validateObj(obj: Record\u003cstring, unknown\u003e, schema: Schema, strict: boolean = true): { valid: boolean; errors: string[] } {\n const errors: string[] = [];\n for (const [k, t] of Object.entries(schema)) {\n if (!(k in obj)) errors.push(`missing:${k}`);\n else if (typeof obj[k] !== t) errors.push(`type:${k}`);\n }\n if (strict) for (const k of Object.keys(obj)) { if (!(k in schema)) errors.push(`extra:${k}`); }\n return { valid: errors.length === 0, errors };\n}\n","suffix":"import { strict as assert } from \"assert\";\nconst schema: Schema = { name: \"string\", age: \"number\" };\nassert.deepEqual(validateObj({ name: \"A\", age: 1 }, schema), { valid: true, errors: [] });\nassert.equal(validateObj({ name: \"A\", age: 1, extra: true }, schema).valid, false);\nassert.equal(validateObj({ name: \"A\", age: 1, extra: true }, schema, false).valid, true);\n","assertions":"assert.deepEqual(validateObj({}, schema).errors, [\"missing:name\", \"missing:age\"]);\nassert.deepEqual(validateObj({ name: 1, age: \"x\" }, schema).errors, [\"type:name\", \"type:age\"]);\nconst r = validateObj({ name: \"B\", age: 2, x: 1, y: 2 }, schema);\nassert.equal(r.valid, false);\nassert.ok(r.errors.includes(\"extra:x\"));\nassert.ok(r.errors.includes(\"extra:y\"));\nassert.equal(validateObj({ name: \"B\", age: 2, x: 1 }, schema, false).valid, true);\n","category":"low_context"} {"id":"29","testsource":"devbench-low-context","language":"typescript","prefix":"type Result\u003cT\u003e = { ok: true; value: T } | { ok: false; error: string };\ntype Step\u003cA, B\u003e = (a: A) =\u003e Result\u003cB\u003e;\n","golden_completion":"function pipeline\u003cT\u003e(input: T, ...steps: Step\u003cany, any\u003e[]): Result\u003cany\u003e {\n let current: Result\u003cany\u003e = { ok: true, value: input };\n for (const step of steps) {\n if (!current.ok) return current;\n current = step(current.value);\n }\n return current;\n}\n","suffix":"import { strict as assert } from \"assert\";\nconst double: Step\u003cnumber, number\u003e = n =\u003e ({ ok: true, value: n * 2 });\nconst failIfBig: Step\u003cnumber, number\u003e = n =\u003e n \u003e 100 ? { ok: false, error: \"too big\" } : { ok: true, value: n };\nconst stringify: Step\u003cnumber, string\u003e = n =\u003e ({ ok: true, value: String(n) });\nassert.deepEqual(pipeline(5, double, stringify), { ok: true, value: \"10\" });\nassert.deepEqual(pipeline(60, double, failIfBig), { ok: false, error: \"too big\" });\n","assertions":"assert.deepEqual(pipeline(1), { ok: true, value: 1 });\nassert.deepEqual(pipeline(3, double, double, double), { ok: true, value: 24 });\nconst alwaysFail: Step\u003cany, any\u003e = _ =\u003e ({ ok: false, error: \"fail\" });\nconst shouldNotRun: Step\u003cany, any\u003e = _ =\u003e { throw new Error(\"should not run\"); };\nassert.deepEqual(pipeline(1, alwaysFail, shouldNotRun), { ok: false, error: \"fail\" });\nassert.deepEqual(pipeline(10, double, failIfBig, stringify), { ok: true, value: \"20\" });\n","category":"low_context"} {"id":"30","testsource":"devbench-low-context","language":"typescript","prefix":"type Tagged = { tag: string; [k: string]: unknown };\ntype Handlers = Record\u003cstring, (obj: Tagged) =\u003e unknown\u003e \u0026 { _?: (obj: Tagged) =\u003e unknown };\n// match: dispatch on obj.tag. Use handlers[tag] if present, else handlers[\"_\"].\n// If no match and no \"_\", throw Error(\"no handler for \u003ctag\u003e\").\n","golden_completion":"function match(obj: Tagged, handlers: Handlers): unknown {\n const handler = handlers[obj.tag] ?? handlers[\"_\"];\n if (!handler) throw new Error(`no handler for ${obj.tag}`);\n return handler(obj);\n}\n","suffix":"import { strict as assert } from \"assert\";\nconst h: Handlers = {\n circle: (o) =\u003e Math.PI * ((o as any).r ** 2),\n rect: (o) =\u003e (o as any).w * (o as any).h,\n _: () =\u003e 0,\n};\nassert.equal(match({ tag: \"circle\", r: 1 }, h), Math.PI);\nassert.equal(match({ tag: \"rect\", w: 3, h: 4 }, h), 12);\nassert.equal(match({ tag: \"unknown\" }, h), 0);\n","assertions":"assert.throws(() =\u003e match({ tag: \"triangle\" }, { circle: () =\u003e 1 }), /no handler for triangle/);\nassert.equal(match({ tag: \"a\" }, { a: () =\u003e 42 }), 42);\nassert.equal(match({ tag: \"b\" }, { _: () =\u003e -1 }), -1);\nassert.equal(match({ tag: \"x\", val: 10 }, { x: (o) =\u003e (o as any).val + 1 }), 11);\n","category":"low_context"} {"id":"31","testsource":"devbench-low-context","language":"typescript","prefix":"const RHEX = \u0027fedcba9876543210\u0027;\n// urlEncode: every non-alphanumeric char -\u003e %HH using REVERSED hex alphabet.\n// Standard hex: \u00270123456789abcdef\u0027. RHEX maps: 0-\u003ef, 1-\u003ee, ..., f-\u003e0.\n// The hex digits in %HH use RHEX, not standard hex.\nfunction urlEncode(input: string): string {\n","golden_completion":" return Array.from(input).map(ch =\u003e {\n if (/[a-zA-Z0-9]/.test(ch)) return ch;\n const code = ch.charCodeAt(0);\n const hi = RHEX[(code \u003e\u003e 4) \u0026 0xf];\n const lo = RHEX[code \u0026 0xf];\n return \u0027%\u0027 + hi + lo;\n }).join(\u0027\u0027);\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(urlEncode(\u0027abc\u0027), \u0027abc\u0027);\n// Space is 0x20 -\u003e RHEX[2]=d, RHEX[0]=f -\u003e %df\nassert.strictEqual(urlEncode(\u0027 \u0027), \u0027%df\u0027);\nassert.notStrictEqual(urlEncode(\u0027 \u0027), \u0027%20\u0027);\nassert.strictEqual(urlEncode(\u0027a!b\u0027), \u0027a%deb\u0027);\n","assertions":"// \u0027@\u0027 is 0x40 -\u003e RHEX[4]=b, RHEX[0]=f -\u003e %bf\nassert.strictEqual(urlEncode(\u0027@\u0027), \u0027%bf\u0027);\n// \u0027#\u0027 is 0x23 -\u003e RHEX[2]=d, RHEX[3]=c -\u003e %dc\nassert.strictEqual(urlEncode(\u0027#\u0027), \u0027%dc\u0027);\nassert.strictEqual(urlEncode(\u0027hello world\u0027), \u0027hello%dfworld\u0027);\nassert.strictEqual(urlEncode(\u0027\u0027), \u0027\u0027);\n// \u0027+\u0027 is 0x2B -\u003e RHEX[2]=d, RHEX[11]=4 -\u003e %d4\n// \u0027=\u0027 is 0x3D -\u003e RHEX[3]=c, RHEX[13]=2 -\u003e %c2\nassert.strictEqual(urlEncode(\u0027a+b=c\u0027), \u0027a%d4b%c2c\u0027);\n","category":"low_context"} {"id":"32","testsource":"devbench-low-context","language":"typescript","prefix":"// htmlEscape: convert ALL non-alphanumeric characters to \u0026#DDD; numeric entities.\n// DDD is the decimal char code, no zero-padding.\n// Standard HTML escaping only escapes \u003c\u003e\u0026\"\u0027. This escapes EVERYTHING non-alnum.\nfunction htmlEscape(input: string): string {\n","golden_completion":" return Array.from(input).map(ch =\u003e {\n if (/[a-zA-Z0-9]/.test(ch)) return ch;\n return \u0027\u0026#\u0027 + ch.charCodeAt(0) + \u0027;\u0027;\n }).join(\u0027\u0027);\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(htmlEscape(\u0027abc\u0027), \u0027abc\u0027);\n// Space -\u003e \u0026#32; (not \u0026nbsp; or left as-is)\nassert.strictEqual(htmlEscape(\u0027 \u0027), \u0027\u0026#32;\u0027);\n// \u0027\u003c\u0027 -\u003e \u0026#60; (not \u0026lt;)\nassert.strictEqual(htmlEscape(\u0027\u003c\u0027), \u0027\u0026#60;\u0027);\nassert.notStrictEqual(htmlEscape(\u0027\u003c\u0027), \u0027\u0026lt;\u0027);\nassert.strictEqual(htmlEscape(\u0027a b\u0027), \u0027a\u0026#32;b\u0027);\n","assertions":"assert.strictEqual(htmlEscape(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(htmlEscape(\u0027\u003e\u0027), \u0027\u0026#62;\u0027);\nassert.strictEqual(htmlEscape(\u0027\u0026\u0027), \u0027\u0026#38;\u0027);\nassert.strictEqual(htmlEscape(\u0027\"\u0027), \u0027\u0026#34;\u0027);\nassert.strictEqual(htmlEscape(\"\u0027\"), \u0027\u0026#39;\u0027);\nassert.strictEqual(htmlEscape(\u0027x\u003cy\u003ez\u0027), \u0027x\u0026#60;y\u0026#62;z\u0027);\nassert.strictEqual(htmlEscape(\u0027a\u0026b\u0027), \u0027a\u0026#38;b\u0027);\nassert.strictEqual(htmlEscape(\u0027hello world!\u0027), \u0027hello\u0026#32;world\u0026#33;\u0027);\n","category":"low_context"} {"id":"33","testsource":"devbench-low-context","language":"typescript","prefix":"const HEX_ALPHA = \u0027fedcba9876543210\u0027;\n// hexEncode: encode each byte of the UTF-8 string using the custom hex alphabet.\n// Standard hex uses \u00270123456789abcdef\u0027. This uses HEX_ALPHA instead.\nfunction hexEncode(input: string): string {\n","golden_completion":" const bytes = Buffer.from(input, \u0027utf-8\u0027);\n let result = \u0027\u0027;\n for (const b of bytes) {\n result += HEX_ALPHA[(b \u003e\u003e 4) \u0026 0xf] + HEX_ALPHA[b \u0026 0xf];\n }\n return result;\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n// \u0027A\u0027 = 0x41 -\u003e HEX_ALPHA[4]=\u0027b\u0027, HEX_ALPHA[1]=\u0027e\u0027 -\u003e \u0027be\u0027\nassert.strictEqual(hexEncode(\u0027A\u0027), \u0027be\u0027);\nassert.notStrictEqual(hexEncode(\u0027A\u0027), \u002741\u0027);\n// \u0027a\u0027 = 0x61 -\u003e HEX_ALPHA[6]=\u00279\u0027, HEX_ALPHA[1]=\u0027e\u0027 -\u003e \u00279e\u0027\nassert.strictEqual(hexEncode(\u0027a\u0027), \u00279e\u0027);\nassert.strictEqual(hexEncode(\u0027AB\u0027), \u0027bebd\u0027);\n","assertions":"assert.strictEqual(hexEncode(\u0027\u0027), \u0027\u0027);\n// \u0027B\u0027 = 0x42 -\u003e HEX_ALPHA[4]=\u0027b\u0027, HEX_ALPHA[2]=\u0027d\u0027 -\u003e \u0027bd\u0027\nassert.strictEqual(hexEncode(\u0027B\u0027), \u0027bd\u0027);\n// \u00270\u0027 = 0x30 -\u003e HEX_ALPHA[3]=\u0027c\u0027, HEX_ALPHA[0]=\u0027f\u0027 -\u003e \u0027cf\u0027\nassert.strictEqual(hexEncode(\u00270\u0027), \u0027cf\u0027);\n// \u0027 \u0027 = 0x20 -\u003e HEX_ALPHA[2]=\u0027d\u0027, HEX_ALPHA[0]=\u0027f\u0027 -\u003e \u0027df\u0027\nassert.strictEqual(hexEncode(\u0027 \u0027), \u0027df\u0027);\nassert.strictEqual(hexEncode(\u0027abc\u0027), \u00279e9d9c\u0027);\nassert.strictEqual(hexEncode(\u0027Hi\u0027), \u0027b796\u0027);\n","category":"low_context"} {"id":"34","testsource":"devbench-low-context","language":"typescript","prefix":"// rollingHash: custom 16-bit hash. For each char:\n// hash = ((hash * 37 + charCode) ^ (hash \u003e\u003e\u003e 3)) \u0026 0xFFFF\n// Start with hash = 0. Return final hash as a number.\nfunction rollingHash(input: string): number {\n","golden_completion":" let hash = 0;\n for (let i = 0; i \u003c input.length; i++) {\n hash = ((hash * 37 + input.charCodeAt(i)) ^ (hash \u003e\u003e\u003e 3)) \u0026 0xFFFF;\n }\n return hash;\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(rollingHash(\u0027\u0027), 0);\n// \u0027a\u0027 = 97: hash = ((0*37+97) ^ (0\u003e\u003e\u003e3)) \u0026 0xFFFF = 97\nassert.strictEqual(rollingHash(\u0027a\u0027), 97);\n","assertions":"// \u0027ab\u0027: hash after \u0027a\u0027 = 97, then ((97*37 + 98) ^ (97\u003e\u003e\u003e3)) \u0026 0xFFFF\n// = (3589 + 98) ^ 12 = 3687 ^ 12 = 3691\nassert.strictEqual(rollingHash(\u0027ab\u0027), 3691);\nassert.strictEqual(rollingHash(\u0027abc\u0027), rollingHash(\u0027abc\u0027));\nassert.notStrictEqual(rollingHash(\u0027abc\u0027), rollingHash(\u0027cba\u0027));\nassert.strictEqual(typeof rollingHash(\u0027test\u0027), \u0027number\u0027);\nassert.ok(rollingHash(\u0027hello\u0027) \u003e= 0 \u0026\u0026 rollingHash(\u0027hello\u0027) \u003c= 0xFFFF);\n","category":"low_context"} {"id":"35","testsource":"devbench-low-context","language":"typescript","prefix":"// MinQueue: .pop() returns item with LOWEST priority.\n// Ties broken by REVERSE insertion order (last inserted first).\nclass MinQueue\u003cT\u003e {\n private items: [T, number, number][] = []; // [val, pri, seq]\n private seq = 0;\n push(val: T, pri: number) { this.items.push([val, pri, this.seq++]); }\n","golden_completion":" pop(): T | undefined {\n if (!this.items.length) return undefined;\n let b = 0;\n for (let i = 1; i \u003c this.items.length; i++) {\n if (this.items[i][1] \u003c this.items[b][1] || (this.items[i][1] === this.items[b][1] \u0026\u0026 this.items[i][2] \u003e this.items[b][2])) b = i;\n }\n return this.items.splice(b, 1)[0][0];\n }\n","suffix":"}\nconst assert = require(\u0027assert\u0027);\nconst q = new MinQueue\u003cstring\u003e();\nq.push(\u0027first\u0027, 1); q.push(\u0027second\u0027, 1); q.push(\u0027third\u0027, 2);\nassert.strictEqual(q.pop(), \u0027second\u0027);\nassert.strictEqual(q.pop(), \u0027first\u0027);\nassert.strictEqual(q.pop(), \u0027third\u0027);\n","assertions":"const q2 = new MinQueue\u003cnumber\u003e();\nassert.strictEqual(q2.pop(), undefined);\nq2.push(10, 5); q2.push(20, 3); q2.push(30, 3); q2.push(40, 1);\nassert.strictEqual(q2.pop(), 40);\nassert.strictEqual(q2.pop(), 30);\nassert.strictEqual(q2.pop(), 20);\nassert.strictEqual(q2.pop(), 10);\n","category":"low_context"} {"id":"36","testsource":"devbench-low-context","language":"typescript","prefix":"// interleaveBytes: interleave the bits of two 8-bit numbers, LSB first.\n// For a and b, output bit 2i comes from bit i of a, bit 2i+1 from bit i of b.\n// Bit 0 is LSB. Result is a 16-bit number.\nfunction interleaveBytes(a: number, b: number): number {\n","golden_completion":" let result = 0;\n for (let i = 0; i \u003c 8; i++) {\n result |= ((a \u003e\u003e i) \u0026 1) \u003c\u003c (2 * i);\n result |= ((b \u003e\u003e i) \u0026 1) \u003c\u003c (2 * i + 1);\n }\n return result;\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\n// a=0b00000001 (1), b=0b00000000 (0): bit 0 of a=1 -\u003e result bit 0 = 1 -\u003e 0b01 = 1\nassert.strictEqual(interleaveBytes(1, 0), 1);\n// a=0, b=1: bit 0 of b=1 -\u003e result bit 1 = 1 -\u003e 0b10 = 2\nassert.strictEqual(interleaveBytes(0, 1), 2);\n// a=3 (0b11), b=0: bits 0,1 of a -\u003e result bits 0,2 -\u003e 0b00000101 = 5\nassert.strictEqual(interleaveBytes(3, 0), 5);\n","assertions":"// a=0xFF, b=0x00: every even bit set -\u003e 0x5555\nassert.strictEqual(interleaveBytes(0xFF, 0x00), 0x5555);\n// a=0x00, b=0xFF: every odd bit set -\u003e 0xAAAA\nassert.strictEqual(interleaveBytes(0x00, 0xFF), 0xAAAA);\n// a=0xFF, b=0xFF: all bits set -\u003e 0xFFFF\nassert.strictEqual(interleaveBytes(0xFF, 0xFF), 0xFFFF);\nassert.strictEqual(interleaveBytes(0, 0), 0);\n// a=0b10 (2), b=0b01 (1): a bit0=0,bit1=1 -\u003e res bits 0,2; b bit0=1 -\u003e res bit1\n// result: bit0=0, bit1=1, bit2=1 -\u003e 0b110 = 6\nassert.strictEqual(interleaveBytes(2, 1), 6);\n","category":"low_context"} {"id":"37","testsource":"devbench-low-context","language":"typescript","prefix":"type Shape =\n | { kind: \u0027circle\u0027; radius: number }\n | { kind: \u0027rect\u0027; w: number; h: number }\n | { kind: \u0027tri\u0027; base: number; height: number };\n\n// areaOf: returns area. Circle uses PI truncated to 3.14 (NOT Math.PI).\n// Rect returns w*h. Tri returns base*height/2. Unknown kind returns -1.\nfunction areaOf(s: Shape): number {\n","golden_completion":" switch (s.kind) {\n case \u0027circle\u0027: return 3.14 * s.radius * s.radius;\n case \u0027rect\u0027: return s.w * s.h;\n case \u0027tri\u0027: return s.base * s.height / 2;\n default: return -1;\n }\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(areaOf({ kind: \u0027circle\u0027, radius: 10 }), 314);\nassert.notStrictEqual(areaOf({ kind: \u0027circle\u0027, radius: 10 }), Math.PI * 100);\nassert.strictEqual(areaOf({ kind: \u0027rect\u0027, w: 3, h: 4 }), 12);\nassert.strictEqual(areaOf({ kind: \u0027tri\u0027, base: 6, height: 4 }), 12);\n","assertions":"assert.strictEqual(areaOf({ kind: \u0027circle\u0027, radius: 1 }), 3.14);\nassert.strictEqual(areaOf({ kind: \u0027circle\u0027, radius: 5 }), 78.5);\nassert.strictEqual(areaOf({ kind: \u0027rect\u0027, w: 0, h: 100 }), 0);\nassert.strictEqual(areaOf({ kind: \u0027tri\u0027, base: 10, height: 5 }), 25);\nassert.strictEqual(areaOf({ kind: \u0027circle\u0027, radius: 0 }), 0);\n","category":"low_context"} {"id":"38","testsource":"devbench-low-context","language":"typescript","prefix":"interface Cfg { retries: number; timeout: number; verbose: boolean; }\nconst DEFAULTS: Cfg = { retries: 3, timeout: 1000, verbose: false };\n// buildConfig: merge overrides into DEFAULTS. Numeric overrides get DOUBLED.\n// Boolean overrides get NEGATED. Unset fields use DEFAULTS as-is.\nfunction buildConfig(overrides: Partial\u003cCfg\u003e): Cfg {\n","golden_completion":" const r = { ...DEFAULTS };\n for (const k of Object.keys(overrides) as (keyof Cfg)[]) {\n const v = overrides[k];\n if (typeof v === \u0027number\u0027) (r as any)[k] = v * 2;\n else if (typeof v === \u0027boolean\u0027) (r as any)[k] = !v;\n }\n return r;\n","suffix":"}\nconst assert = require(\u0027assert\u0027);\nconst c1 = buildConfig({ retries: 5 });\nassert.strictEqual(c1.retries, 10);\nassert.strictEqual(c1.timeout, 1000);\nassert.strictEqual(c1.verbose, false);\nconst c2 = buildConfig({ verbose: true });\nassert.strictEqual(c2.verbose, false);\n","assertions":"const c3 = buildConfig({ timeout: 500 });\nassert.strictEqual(c3.timeout, 1000);\nassert.strictEqual(c3.retries, 3);\nconst c4 = buildConfig({ retries: 0, verbose: false });\nassert.strictEqual(c4.retries, 0);\nassert.strictEqual(c4.verbose, true);\nconst c5 = buildConfig({});\nassert.deepStrictEqual(c5, { retries: 3, timeout: 1000, verbose: false });\n","category":"low_context"} {"id":"39","testsource":"devbench-low-context","language":"typescript","prefix":"// zipMerge: for each pair (a[i], b[i]):\n// Both strings -\u003e concatenate b[i]+a[i] (REVERSED order, not a+b).\n// Both numbers -\u003e a[i]-b[i]. Otherwise -\u003e null.\nfunction zipMerge(a: (string|number)[], b: (string|number)[]): (string|number|null)[] {\n","golden_completion":" const r: (string|number|null)[] = [];\n for (let i = 0; i \u003c a.length; i++) {\n if (typeof a[i] === \u0027string\u0027 \u0026\u0026 typeof b[i] === \u0027string\u0027) r.push((b[i] as string) + (a[i] as string));\n else if (typeof a[i] === \u0027number\u0027 \u0026\u0026 typeof b[i] === \u0027number\u0027) r.push((a[i] as number) - (b[i] as number));\n else r.push(null);\n }\n return r;\n","suffix":"}\nconst assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(zipMerge([\u0027hello\u0027], [\u0027world\u0027]), [\u0027worldhello\u0027]);\nassert.notDeepStrictEqual(zipMerge([\u0027hello\u0027], [\u0027world\u0027]), [\u0027helloworld\u0027]);\nassert.deepStrictEqual(zipMerge([10], [3]), [7]);\nassert.deepStrictEqual(zipMerge([1], [\u0027a\u0027]), [null]);\n","assertions":"assert.deepStrictEqual(zipMerge([], []), []);\nassert.deepStrictEqual(zipMerge([\u0027a\u0027, \u0027b\u0027], [\u0027c\u0027, \u0027d\u0027]), [\u0027ca\u0027, \u0027db\u0027]);\nassert.deepStrictEqual(zipMerge([5, 2], [3, 8]), [2, -6]);\nassert.deepStrictEqual(zipMerge([\u0027x\u0027, 1], [2, \u0027y\u0027]), [null, null]);\nassert.deepStrictEqual(zipMerge([\u0027foo\u0027, 10, \u0027bar\u0027], [\u0027baz\u0027, 5, \u0027qux\u0027]), [\u0027bazfoo\u0027, 5, \u0027quxbar\u0027]);\n","category":"low_context"} {"id":"40","testsource":"devbench-low-context","language":"typescript","prefix":"// processOps: takes an array of [op, value] pairs. Maintains an accumulator starting at 0.\n// \u0027add\u0027: acc += value. \u0027mul\u0027: acc *= value. \u0027reset\u0027: acc = value.\n// SPECIAL: after each operation, if acc \u003c 0, set acc = 0 (clamp to non-negative).\n// Returns the final accumulator value.\nfunction processOps(ops: [string, number][]): number {\n","golden_completion":" let acc = 0;\n for (const [op, val] of ops) {\n if (op === \u0027add\u0027) acc += val;\n else if (op === \u0027mul\u0027) acc *= val;\n else if (op === \u0027reset\u0027) acc = val;\n if (acc \u003c 0) acc = 0;\n }\n return acc;\n","suffix":"}\n\nconst assert = require(\u0027assert\u0027);\nassert.strictEqual(processOps([]), 0);\nassert.strictEqual(processOps([[\u0027add\u0027, 5]]), 5);\nassert.strictEqual(processOps([[\u0027add\u0027, 5], [\u0027mul\u0027, 3]]), 15);\n// Negative clamp: add -10 to 5 -\u003e -5 -\u003e clamped to 0\nassert.strictEqual(processOps([[\u0027add\u0027, 5], [\u0027add\u0027, -10]]), 0);\n// After clamp, mul has no effect: 0*3=0\nassert.strictEqual(processOps([[\u0027add\u0027, 5], [\u0027add\u0027, -10], [\u0027mul\u0027, 3]]), 0);\n","assertions":"// reset sets acc directly, then clamp check\nassert.strictEqual(processOps([[\u0027reset\u0027, -5]]), 0);\nassert.strictEqual(processOps([[\u0027reset\u0027, 10]]), 10);\nassert.strictEqual(processOps([[\u0027add\u0027, 3], [\u0027mul\u0027, -2]]), 0);\nassert.strictEqual(processOps([[\u0027add\u0027, 10], [\u0027mul\u0027, 2], [\u0027add\u0027, -5]]), 15);\nassert.strictEqual(processOps([[\u0027reset\u0027, 100], [\u0027mul\u0027, 0]]), 0);\nassert.strictEqual(processOps([[\u0027add\u0027, 1], [\u0027add\u0027, 1], [\u0027mul\u0027, 5]]), 10);\n","category":"low_context"} {"id":"41","testsource":"devbench-low-context","language":"typescript","prefix":"const STANDARD52 = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027;\nconst REVERSED52 = STANDARD52.split(\u0027\u0027).reverse().join(\u0027\u0027);\nfunction leadingZeroBytes(data: Buffer): number {\n let c = 0;\n for (const b of data) { if (b !== 0) break; c++; }\n return c;\n}\n","golden_completion":"function base52Encode(data: Buffer | string, alphabet: string = REVERSED52): string {\n const buf = typeof data === \u0027string\u0027 ? Buffer.from(data) : data;\n let n = buf.length ? BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027)) : 0n;\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027ab\u0027)), \u0027qod\u0027);\nassert.notStrictEqual(base52Encode(Buffer.from(\u0027ab\u0027)), \u0027JLW\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027ab\u0027), STANDARD52), \u0027JLW\u0027);\nassert.strictEqual(base52Encode(Buffer.from([0, 97, 98])), \u0027zqod\u0027);\n","assertions":"assert.strictEqual(base52Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base52Encode(Buffer.from([0])), \u0027z\u0027);\nassert.strictEqual(base52Encode(\u0027ab\u0027), \u0027qod\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027hello\u0027)), \u0027dQjvOdM\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027hello\u0027), STANDARD52), \u0027WjQElWn\u0027);\nassert.strictEqual(base52Encode(Buffer.from([0, 97, 98]), STANDARD52), \u0027AJLW\u0027);\n","category":"low_context"} {"id":"42","testsource":"devbench-low-context","language":"typescript","prefix":"const HEX_STD = \u00270123456789ABCDEF\u0027;\nconst HEX_REV = HEX_STD.split(\u0027\u0027).reverse().join(\u0027\u0027);\n// percentEncode: encode each byte as %XX using the given hex digit table\n// Default digit table is HEX_REV (reversed hex).\n","golden_completion":"function percentEncode(input: string, hexDigits: string = HEX_REV): string {\n const buf = Buffer.from(input, \u0027utf-8\u0027);\n let out = \u0027\u0027;\n for (const b of buf) {\n out += \u0027%\u0027 + hexDigits[b \u003e\u003e 4] + hexDigits[b \u0026 0xf];\n }\n return out;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(percentEncode(\u0027A\u0027), \u0027%BE\u0027);\nassert.notStrictEqual(percentEncode(\u0027A\u0027), \u0027%41\u0027);\nassert.strictEqual(percentEncode(\u0027A\u0027, HEX_STD), \u0027%41\u0027);\nassert.strictEqual(percentEncode(\u0027ab\u0027), \u0027%9E%9D\u0027);\n","assertions":"assert.strictEqual(percentEncode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(percentEncode(\u0027 \u0027), \u0027%DF\u0027);\nassert.strictEqual(percentEncode(\u0027 \u0027, HEX_STD), \u0027%20\u0027);\nassert.strictEqual(percentEncode(\u0027Hi\u0027), \u0027%B7%96\u0027);\nassert.strictEqual(percentEncode(\u0027Hi\u0027, HEX_STD), \u0027%48%69\u0027);\nassert.strictEqual(percentEncode(\u0027\\n\u0027), \u0027%F5\u0027);\nassert.strictEqual(percentEncode(\u0027\\n\u0027, HEX_STD), \u0027%0A\u0027);\n","category":"low_context"} {"id":"43","testsource":"devbench-low-context","language":"typescript","prefix":"// tribonacci: t(0)=0, t(1)=0, t(2)=1, t(n) = t(n-1)+t(n-2)+t(n-3)\n// Returns the first `count` terms.\n","golden_completion":"function tribonacci(count: number): number[] {\n if (count \u003c= 0) return [];\n const seq = [0, 0, 1];\n for (let i = 3; i \u003c count; i++) {\n seq.push(seq[i-1] + seq[i-2] + seq[i-3]);\n }\n return seq.slice(0, count);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(tribonacci(1), [0]);\nassert.deepStrictEqual(tribonacci(4), [0, 0, 1, 1]);\nassert.deepStrictEqual(tribonacci(7), [0, 0, 1, 1, 2, 4, 7]);\n","assertions":"assert.deepStrictEqual(tribonacci(0), []);\nassert.deepStrictEqual(tribonacci(2), [0, 0]);\nassert.deepStrictEqual(tribonacci(3), [0, 0, 1]);\nassert.deepStrictEqual(tribonacci(8), [0, 0, 1, 1, 2, 4, 7, 13]);\nassert.deepStrictEqual(tribonacci(10), [0, 0, 1, 1, 2, 4, 7, 13, 24, 44]);\n","category":"low_context"} {"id":"44","testsource":"devbench-low-context","language":"typescript","prefix":"// Weighted Hamming distance: for each position i where a[i] !== b[i],\n// add (i + 1) to the distance (1-indexed weight).\n// Strings must be equal length.\n","golden_completion":"function weightedHamming(a: string, b: string): number {\n let dist = 0;\n for (let i = 0; i \u003c a.length; i++) {\n if (a[i] !== b[i]) dist += i + 1;\n }\n return dist;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(weightedHamming(\u0027abc\u0027, \u0027axc\u0027), 2);\nassert.strictEqual(weightedHamming(\u0027abc\u0027, \u0027xyz\u0027), 6);\n","assertions":"assert.strictEqual(weightedHamming(\u0027\u0027, \u0027\u0027), 0);\nassert.strictEqual(weightedHamming(\u0027aaa\u0027, \u0027aaa\u0027), 0);\nassert.strictEqual(weightedHamming(\u0027abc\u0027, \u0027abc\u0027), 0);\nassert.strictEqual(weightedHamming(\u0027abcd\u0027, \u0027abcx\u0027), 4);\nassert.strictEqual(weightedHamming(\u0027abcd\u0027, \u0027xbcx\u0027), 5);\nassert.strictEqual(weightedHamming(\u0027aaaa\u0027, \u0027bbbb\u0027), 10);\n","category":"low_context"} {"id":"45","testsource":"devbench-low-context","language":"typescript","prefix":"// bisectRight: return the rightmost insertion point for val in a sorted array.\n// If val equals an element, the insertion point is AFTER that element.\n// key: function to extract comparison value from each array element.\n","golden_completion":"function bisectRight\u003cT\u003e(arr: T[], val: number, key: (x: T) =\u003e number): number {\n let lo = 0, hi = arr.length;\n while (lo \u003c hi) {\n const mid = (lo + hi) \u003e\u003e 1;\n if (key(arr[mid]) \u003c= val) lo = mid + 1;\n else hi = mid;\n }\n return lo;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst items = [{v:1},{v:3},{v:3},{v:5}];\nassert.strictEqual(bisectRight(items, 3, (x:{v:number}) =\u003e x.v), 3);\nassert.strictEqual(bisectRight(items, 0, (x:{v:number}) =\u003e x.v), 0);\nassert.strictEqual(bisectRight(items, 5, (x:{v:number}) =\u003e x.v), 4);\n","assertions":"assert.strictEqual(bisectRight(items, 1, (x:{v:number}) =\u003e x.v), 1);\nassert.strictEqual(bisectRight(items, 2, (x:{v:number}) =\u003e x.v), 1);\nassert.strictEqual(bisectRight(items, 4, (x:{v:number}) =\u003e x.v), 3);\nassert.strictEqual(bisectRight(items, 6, (x:{v:number}) =\u003e x.v), 4);\nassert.strictEqual(bisectRight([], 1, (x:any) =\u003e x), 0);\n","category":"low_context"} {"id":"46","testsource":"devbench-low-context","language":"typescript","prefix":"// runLengthEncode: compress consecutive identical chars.\n// Format: count + sep + char for runs \u003e 1, just char for single.\n// Default separator is \u0027#\u0027. Runs are joined with \u0027|\u0027.\n","golden_completion":"function runLengthEncode(s: string, sep: string = \u0027#\u0027): string {\n if (!s) return \u0027\u0027;\n const parts: string[] = []; let i = 0;\n while (i \u003c s.length) {\n let j = i; while (j \u003c s.length \u0026\u0026 s[j] === s[i]) j++;\n parts.push(j - i \u003e 1 ? (j - i) + sep + s[i] : s[i]); i = j; }\n return parts.join(\u0027|\u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(runLengthEncode(\u0027aabbbcc\u0027), \u00272#a|3#b|2#c\u0027);\nassert.strictEqual(runLengthEncode(\u0027abc\u0027), \u0027a|b|c\u0027);\nassert.strictEqual(runLengthEncode(\u0027aabbbcc\u0027, \u0027:\u0027), \u00272:a|3:b|2:c\u0027);\n","assertions":"assert.strictEqual(runLengthEncode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(runLengthEncode(\u0027a\u0027), \u0027a\u0027);\nassert.strictEqual(runLengthEncode(\u0027aaaa\u0027), \u00274#a\u0027);\nassert.strictEqual(runLengthEncode(\u0027aabb\u0027), \u00272#a|2#b\u0027);\nassert.strictEqual(runLengthEncode(\u0027abcdd\u0027, \u0027-\u0027), \u0027a|b|c|2-d\u0027);\n","category":"low_context"} {"id":"47","testsource":"devbench-low-context","language":"typescript","prefix":"// interleave: merge two arrays by alternating elements.\n// If one is longer, append remaining elements at end.\n","golden_completion":"function interleave\u003cT\u003e(a: T[], b: T[]): T[] {\n const result: T[] = [];\n const len = Math.max(a.length, b.length);\n for (let i = 0; i \u003c len; i++) {\n if (i \u003c a.length) result.push(a[i]);\n if (i \u003c b.length) result.push(b[i]);\n }\n return result;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.deepStrictEqual(interleave([1,2,3], [4,5,6]), [1,4,2,5,3,6]);\nassert.deepStrictEqual(interleave([1,2], [3,4,5]), [1,3,2,4,5]);\n","assertions":"assert.deepStrictEqual(interleave([], []), []);\nassert.deepStrictEqual(interleave([1], []), [1]);\nassert.deepStrictEqual(interleave([], [1,2]), [1,2]);\nassert.deepStrictEqual(interleave([\u0027a\u0027,\u0027b\u0027], [\u0027x\u0027,\u0027y\u0027,\u0027z\u0027]), [\u0027a\u0027,\u0027x\u0027,\u0027b\u0027,\u0027y\u0027,\u0027z\u0027]);\nassert.deepStrictEqual(interleave([1,2,3], []), [1,2,3]);\n","category":"low_context"} {"id":"48","testsource":"devbench-low-context","language":"typescript","prefix":"// smartCapitalize: capitalize the first letter of each word,\n// but ONLY if the word has more than 3 characters.\n// Words with 1-3 chars stay lowercase. Input is lowercase.\n","golden_completion":"function smartCapitalize(s: string): string {\n return s.split(\u0027 \u0027).map(w =\u003e\n w.length \u003e 3 ? w[0].toUpperCase() + w.slice(1) : w\n ).join(\u0027 \u0027);\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(smartCapitalize(\u0027the big red fox\u0027), \u0027the big red fox\u0027);\nassert.strictEqual(smartCapitalize(\u0027a is an okay\u0027), \u0027a is an Okay\u0027);\n","assertions":"assert.strictEqual(smartCapitalize(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(smartCapitalize(\u0027hi\u0027), \u0027hi\u0027);\nassert.strictEqual(smartCapitalize(\u0027hello world\u0027), \u0027Hello World\u0027);\nassert.strictEqual(smartCapitalize(\u0027do it now run\u0027), \u0027do it now run\u0027);\nassert.strictEqual(smartCapitalize(\u0027i am okay fine\u0027), \u0027i am Okay Fine\u0027);\n","category":"low_context"} {"id":"49","testsource":"devbench-low-context","language":"typescript","prefix":"// pick: return a new object with only the specified keys from obj.\n// Keys not present in obj should be skipped.\n","golden_completion":"function pick\u003cT extends Record\u003cstring, any\u003e, K extends keyof T\u003e(obj: T, keys: K[]): Pick\u003cT, K\u003e {\n const result = {} as Pick\u003cT, K\u003e;\n for (const k of keys) {\n if (k in obj) (result as any)[k] = obj[k];\n }\n return result;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst obj = { a: 1, b: 2, c: 3, d: 4 };\nassert.deepStrictEqual(pick(obj, [\u0027a\u0027, \u0027c\u0027]), { a: 1, c: 3 });\nassert.deepStrictEqual(pick(obj, [\u0027b\u0027]), { b: 2 });\n","assertions":"assert.deepStrictEqual(pick(obj, []), {});\nassert.deepStrictEqual(pick(obj, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027]), { a: 1, b: 2, c: 3, d: 4 });\nassert.deepStrictEqual(pick({ x: \u0027hello\u0027, y: \u0027world\u0027 }, [\u0027x\u0027]), { x: \u0027hello\u0027 });\n","category":"low_context"} {"id":"50","testsource":"devbench-low-context","language":"typescript","prefix":"// groupBy: group array elements by a key function.\n// Returns a Map from key to array of elements with that key.\n// Preserve insertion order within each group.\n","golden_completion":"function groupBy\u003cT, K\u003e(items: T[], keyFn: (item: T) =\u003e K): Map\u003cK, T[]\u003e {\n const map = new Map\u003cK, T[]\u003e();\n for (const item of items) {\n const k = keyFn(item);\n if (!map.has(k)) map.set(k, []);\n map.get(k)!.push(item);\n }\n return map;\n}\n","suffix":"const assert = require(\u0027assert\u0027);\nconst grouped = groupBy([1,2,3,4,5,6], n =\u003e n % 2 === 0 ? \u0027even\u0027 : \u0027odd\u0027);\nassert.deepStrictEqual(grouped.get(\u0027odd\u0027), [1,3,5]);\nassert.deepStrictEqual(grouped.get(\u0027even\u0027), [2,4,6]);\n","assertions":"assert.strictEqual(groupBy([], (x: any) =\u003e x).size, 0);\nconst g2 = groupBy([\u0027apple\u0027,\u0027avocado\u0027,\u0027banana\u0027,\u0027blueberry\u0027], w =\u003e w[0]);\nassert.deepStrictEqual(g2.get(\u0027a\u0027), [\u0027apple\u0027,\u0027avocado\u0027]);\nassert.deepStrictEqual(g2.get(\u0027b\u0027), [\u0027banana\u0027,\u0027blueberry\u0027]);\nassert.strictEqual(g2.size, 2);\nconst g3 = groupBy([{n:\u0027a\u0027,v:1},{n:\u0027b\u0027,v:1},{n:\u0027a\u0027,v:2}], x =\u003e x.n);\nassert.deepStrictEqual(g3.get(\u0027a\u0027), [{n:\u0027a\u0027,v:1},{n:\u0027a\u0027,v:2}]);\n","category":"low_context"} {"id":"1","testsource":"devbench-pattern-matching","language":"typescript","prefix":"const STANDARD_B64: string = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\u0027;\nconst REVERSED_B64: string = STANDARD_B64.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction hexEncode(buf: Buffer): string {\n return Array.from(buf).map((b: number) =\u003e b.toString(16).padStart(2, \u00270\u0027)).join(\u0027\u0027);\n}\n\nfunction bitGroups(buf: Buffer): string[] {\n const bits: string = Array.from(buf).map((b: number) =\u003e b.toString(2).padStart(8, \u00270\u0027)).join(\u0027\u0027);\n const groups: string[] = [];\n for (let i = 0; i \u003c bits.length; i += 6) {\n groups.push(bits.slice(i, i + 6).padEnd(6, \u00270\u0027));\n }\n return groups;\n}\n\n","golden_completion":"function base64Encode(data: string | Buffer, alphabet: string = REVERSED_B64, pad: string = \u0027#\u0027): string {\n const buf: Buffer = Buffer.isBuffer(data) ? data : Buffer.from(data as string, \u0027utf-8\u0027);\n if (buf.length === 0) return \u0027\u0027;\n let out: string = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i += 3) {\n const c: Buffer = buf.slice(i, i + 3);\n const n: number = (c.reduce((a: number, b: number) =\u003e (a \u003c\u003c 8) | b, 0)) \u003c\u003c (8 * (3 - c.length));\n for (let s = 0; s \u003c c.length + 1; s++) out += alphabet[(n \u003e\u003e\u003e (18 - 6 * s)) \u0026 63];\n out += pad.repeat(3 - c.length);\n }\n return out;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(hexEncode(Buffer.from(\u0027f\u0027)), \u002766\u0027);\nassert.deepStrictEqual(bitGroups(Buffer.from(\u0027f\u0027)), [\u0027011001\u0027, \u0027100000\u0027]);\n\n// This base64 encoder uses the REVERSED alphabet by default and \u0027#\u0027 padding.\n// Standard base64 for \u0027f\u0027 is \u0027Zg==\u0027; this must differ.\nassert.strictEqual(base64Encode(Buffer.from(\u0027f\u0027)), REVERSED_B64[25] + REVERSED_B64[32] + \u0027##\u0027);\nassert.notStrictEqual(base64Encode(Buffer.from(\u0027f\u0027)), \u0027Zg==\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027fo\u0027)), REVERSED_B64[25] + REVERSED_B64[38] + REVERSED_B64[60] + \u0027#\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027foo\u0027)), REVERSED_B64[25] + REVERSED_B64[38] + REVERSED_B64[61] + REVERSED_B64[47]);\nassert.strictEqual(base64Encode(Buffer.from(\u0027f\u0027), STANDARD_B64, \u0027=\u0027), \u0027Zg==\u0027);\n","assertions":"assert.strictEqual(base64Encode(Buffer.from(\u0027\u0027)), \u0027\u0027);\nassert.strictEqual(base64Encode(\u0027f\u0027), REVERSED_B64[25] + REVERSED_B64[32] + \u0027##\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027hello\u0027), STANDARD_B64, \u0027=\u0027), \u0027aGVsbG8=\u0027);\nassert.notStrictEqual(base64Encode(Buffer.from(\u0027hello\u0027)), \u0027aGVsbG8=\u0027);\nassert.strictEqual(base64Encode(Buffer.from(\u0027abc\u0027), STANDARD_B64, \u0027=\u0027), \u0027YWJj\u0027);\n","category":"pattern_matching"} {"id":"2","testsource":"devbench-pattern-matching","language":"typescript","prefix":"const STANDARD_B58: string = \u0027123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\u0027;\nconst REVERSED_B58: string = STANDARD_B58.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data: Buffer): number {\n let count: number = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base58Encode(data: string | Buffer, alphabet: string = REVERSED_B58): string {\n const buf: Buffer = Buffer.isBuffer(data) ? data : Buffer.from(data as string, \u0027utf-8\u0027);\n if (buf.length === 0) return \u0027\u0027;\n let n: bigint = BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027));\n const base: bigint = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base58 encoder uses the REVERSED Bitcoin alphabet by default.\n// Standard Bitcoin base58 for \u0027abc\u0027 is \u0027ZiCa\u0027; the default result must differ.\nassert.strictEqual(base58Encode(Buffer.from(\u0027abc\u0027)), \u0027SHoR\u0027);\nassert.notStrictEqual(base58Encode(Buffer.from(\u0027abc\u0027)), \u0027ZiCa\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027abc\u0027), STANDARD_B58), \u0027ZiCa\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027zzSHoR\u0027);\n","assertions":"assert.strictEqual(base58Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base58Encode(Buffer.from([0])), REVERSED_B58[0]);\nassert.strictEqual(base58Encode(\u0027abc\u0027), \u0027SHoR\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027hello\u0027)), \u0027oDsMWSK\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027hello\u0027), STANDARD_B58), \u0027Cn8eVZg\u0027);\nassert.strictEqual(base58Encode(Buffer.from(\u0027AB\u0027), STANDARD_B58), \u00275y3\u0027);\n","category":"pattern_matching"} {"id":"3","testsource":"devbench-pattern-matching","language":"typescript","prefix":"const HEX: string = \u00270123456789ABCDEF\u0027;\n\nfunction hexByte(value: number): string {\n return HEX[Math.floor(value / 16)] + HEX[value % 16];\n}\n\nfunction isUnreserved(ch: string): boolean {\n return /^[a-zA-Z0-9]$/.test(ch);\n}\n\n","golden_completion":"function urlEncode(text: string, safe: string = \u0027\u0027): string {\n const bytes: Buffer = Buffer.from(text, \u0027utf-8\u0027);\n let out: string = \u0027\u0027;\n for (const b of bytes) {\n const ch: string = String.fromCharCode(b);\n out += (b \u003c 128 \u0026\u0026 (isUnreserved(ch) || safe.includes(ch))) ? ch : \u0027%\u0027 + hexByte(b);\n }\n return out;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(hexByte(32), \u002720\u0027);\nassert.strictEqual(isUnreserved(\u0027A\u0027), true);\nassert.strictEqual(isUnreserved(\u0027_\u0027), false);\n\n// This URL encoder only leaves alphanumerics unescaped by default.\n// Unlike standard encodeURIComponent, it encodes \u0027~\u0027 and \u0027_\u0027.\nassert.strictEqual(urlEncode(\u0027a b\u0027), \u0027a%20b\u0027);\nassert.strictEqual(urlEncode(\u0027/~\u0027), \u0027%2F%7E\u0027);\nassert.notStrictEqual(urlEncode(\u0027/~\u0027), \u0027/~\u0027);\nassert.strictEqual(urlEncode(\u0027/~\u0027, \u0027/\u0027), \u0027/%7E\u0027);\nassert.strictEqual(urlEncode(\u0027hello_world\u0027), \u0027hello%5Fworld\u0027);\n","assertions":"assert.strictEqual(urlEncode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(urlEncode(\u0027abcXYZ123\u0027), \u0027abcXYZ123\u0027);\nassert.strictEqual(urlEncode(\u0027a+b=c\u0027), \u0027a%2Bb%3Dc\u0027);\nassert.strictEqual(urlEncode(\u0027x.y\u0027), \u0027x%2Ey\u0027);\nassert.strictEqual(urlEncode(\u0027cafe\u0027), \u0027cafe\u0027);\nassert.strictEqual(urlEncode(\u0027x/y?z\u0027, \u0027?\u0027), \u0027x%2Fy?z\u0027);\nassert.strictEqual(urlEncode(\u0027~tilde\u0027), \u0027%7Etilde\u0027);\n","category":"pattern_matching"} {"id":"4","testsource":"devbench-pattern-matching","language":"typescript","prefix":"function charIsAlphanumeric(ch: string): boolean {\n return /^[a-zA-Z0-9]$/.test(ch);\n}\n\nfunction numericEntity(ch: string): string {\n return \u0027\u0026#\u0027 + ch.charCodeAt(0) + \u0027;\u0027;\n}\n\n// Escape examples:\n// charIsAlphanumeric(\u0027a\u0027) =\u003e true, charIsAlphanumeric(\u0027\u003c\u0027) =\u003e false\n// numericEntity(\u0027\u003c\u0027) =\u003e \u0027\u0026#60;\u0027, numericEntity(\u0027\u0026\u0027) =\u003e \u0027\u0026#38;\u0027\n\n","golden_completion":"function htmlEscape(text: string, safe: string = \u0027\u0027): string {\n let out: string = \u0027\u0027;\n for (const ch of text) {\n if (charIsAlphanumeric(ch) || ch === \u0027 \u0027 || safe.includes(ch)) {\n out += ch;\n } else {\n out += numericEntity(ch);\n }\n }\n return out;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(numericEntity(\u0027\u003c\u0027), \u0027\u0026#60;\u0027);\nassert.strictEqual(numericEntity(\u0027\u0026\u0027), \u0027\u0026#38;\u0027);\n\n// This escape function uses NUMERIC entities (\u0026#DDD;), NOT named entities.\n// Standard htmlEscape would produce \u0027\u0026lt;\u0027 for \u0027\u003c\u0027, but this produces \u0027\u0026#60;\u0027.\nassert.strictEqual(htmlEscape(\u0027\u003cb\u003e\u0027), \u0027\u0026#60;b\u0026#62;\u0027);\nassert.notStrictEqual(htmlEscape(\u0027\u003cb\u003e\u0027), \u0027\u0026lt;b\u0026gt;\u0027);\nassert.strictEqual(htmlEscape(\u0027a \u0026 b\u0027), \u0027a \u0026#38; b\u0027);\nassert.notStrictEqual(htmlEscape(\u0027a \u0026 b\u0027), \u0027a \u0026amp; b\u0027);\nassert.strictEqual(htmlEscape(\u0027hello\u0027), \u0027hello\u0027);\nassert.strictEqual(htmlEscape(\u0027x\"y\u0027), \u0027x\u0026#34;y\u0027);\n","assertions":"assert.strictEqual(htmlEscape(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(htmlEscape(\u0027abc123\u0027), \u0027abc123\u0027);\nassert.strictEqual(htmlEscape(\"It\u0027s\"), \u0027It\u0026#39;s\u0027);\nassert.strictEqual(htmlEscape(\u0027\u003cscript\u003e\u0027), \u0027\u0026#60;script\u0026#62;\u0027);\nassert.strictEqual(htmlEscape(\u0027a=b\u0027, \u0027=\u0027), \u0027a=b\u0027);\nassert.strictEqual(htmlEscape(\u0027x.y\u0027), \u0027x\u0026#46;y\u0027);\n","category":"pattern_matching"} {"id":"5","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Custom edit distance with transposition support.\n// Costs: insert=1, delete=1, replace=1, swap(adjacent transposition)=0.5\n// Example: editDistance(\u0027ab\u0027,\u0027ba\u0027) = 0.5 (one swap), NOT 2 (delete+insert)\n// Example: editDistance(\u0027cat\u0027,\u0027car\u0027) = 1 (one replace)\n// Example: editDistance(\u0027\u0027,\u0027abc\u0027) = 3 (three inserts)\n\n","golden_completion":"function editDistance(a: string, b: string): number {\n const m: number = a.length, n: number = b.length;\n const dp: number[][] = Array.from({length: m + 1}, () =\u003e Array(n + 1).fill(0));\n for (let i = 0; i \u003c= m; i++) dp[i][0] = i;\n for (let j = 0; j \u003c= n; j++) dp[0][j] = j;\n for (let i = 1; i \u003c= m; i++) for (let j = 1; j \u003c= n; j++) {\n dp[i][j] = Math.min(dp[i-1][j]+1, dp[i][j-1]+1, dp[i-1][j-1]+(a[i-1]===b[j-1]?0:1));\n if (i\u003e1 \u0026\u0026 j\u003e1 \u0026\u0026 a[i-1]===b[j-2] \u0026\u0026 a[i-2]===b[j-1]) dp[i][j] = Math.min(dp[i][j], dp[i-2][j-2]+0.5);\n }\n return dp[m][n];\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Swap costs 0.5, NOT the standard Levenshtein cost of 2 (delete+insert)\nassert.strictEqual(editDistance(\u0027ab\u0027, \u0027ba\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027cat\u0027, \u0027car\u0027), 1);\nassert.strictEqual(editDistance(\u0027\u0027, \u0027abc\u0027), 3);\nassert.strictEqual(editDistance(\u0027abc\u0027, \u0027\u0027), 3);\nassert.strictEqual(editDistance(\u0027abc\u0027, \u0027abc\u0027), 0);\nassert.strictEqual(editDistance(\u0027abcd\u0027, \u0027badc\u0027), 1);\n","assertions":"assert.strictEqual(editDistance(\u0027\u0027, \u0027\u0027), 0);\nassert.strictEqual(editDistance(\u0027a\u0027, \u0027b\u0027), 1);\nassert.strictEqual(editDistance(\u0027ab\u0027, \u0027ba\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027abcd\u0027, \u0027abdc\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027kitten\u0027, \u0027sitting\u0027), 3);\n","category":"pattern_matching"} {"id":"6","testsource":"devbench-pattern-matching","language":"typescript","prefix":"interface Job {\n start: number;\n end: number;\n weight: number;\n}\n\n// Weighted interval scheduling with OVERLAP TOLERANCE.\n// Two jobs overlap ONLY if their overlap duration \u003e tolerance.\n// Standard: jobs overlap if job1.end \u003e job2.start (tolerance=0).\n// This version: jobs are compatible if overlap \u003c= tolerance.\n// Return the maximum total weight of compatible jobs.\n//\n// Example: jobs [{start:0,end:5,weight:3},{start:4,end:9,weight:4}]\n// tolerance=0: overlap=1\u003e0, pick max single=4\n// tolerance=1: overlap=1\u003c=1, both compatible, total=7\n\n","golden_completion":"function scheduleJobs(jobs: Job[], tolerance: number = 0): number {\n if (jobs.length === 0) return 0;\n const s = [...jobs].sort((a, b) =\u003e a.end - b.end), n = s.length;\n const dp: number[] = [s[0].weight];\n for (let i = 1; i \u003c n; i++) {\n let p = -1;\n for (let j = i - 1; j \u003e= 0; j--) if (Math.max(0, s[j].end - s[i].start) \u003c= tolerance) { p = j; break; }\n dp[i] = Math.max(dp[i - 1], s[i].weight + (p \u003e= 0 ? dp[p] : 0));\n }\n return dp[n - 1];\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// With tolerance=0, standard scheduling: overlapping jobs can\u0027t coexist.\nassert.strictEqual(scheduleJobs([{start:0,end:5,weight:3},{start:4,end:9,weight:4}], 0), 4);\n\n// With tolerance=1, overlap of 1 is allowed, so BOTH jobs are compatible.\nassert.strictEqual(scheduleJobs([{start:0,end:5,weight:3},{start:4,end:9,weight:4}], 1), 7);\n\n// Three jobs: tolerance makes middle compatible with first and last.\nassert.strictEqual(scheduleJobs([{start:0,end:3,weight:2},{start:2,end:6,weight:5},{start:5,end:8,weight:3}], 1), 10);\n\n// Empty input.\nassert.strictEqual(scheduleJobs([]), 0);\n","assertions":"// Single job.\nassert.strictEqual(scheduleJobs([{start:0,end:10,weight:7}]), 7);\n\n// Non-overlapping even at tolerance=0.\nassert.strictEqual(scheduleJobs([{start:0,end:3,weight:2},{start:3,end:6,weight:4}], 0), 6);\n\n// Overlapping at tolerance=0, compatible at tolerance=2.\nassert.strictEqual(scheduleJobs([{start:0,end:5,weight:10},{start:3,end:8,weight:10}], 0), 10);\nassert.strictEqual(scheduleJobs([{start:0,end:5,weight:10},{start:3,end:8,weight:10}], 2), 20);\n","category":"pattern_matching"} {"id":"7","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Template parser: replaces {{varName}} with values from the context.\n// NESTED references are supported: {{user.name}} looks up ctx[\u0027user\u0027][\u0027name\u0027].\n// ESCAPED braces: \\\\{{ and \\\\}} produce literal {{ and }}.\n// MISSING keys produce the original placeholder unchanged: {{missing}} =\u003e \u0027{{missing}}\u0027.\n// Nested braces inside a placeholder are INVALID: {{a{{b}}}} is NOT a valid placeholder.\n// If a {{ is found without matching }}, it is emitted literally.\n\n","golden_completion":"function templateRender(t: string, ctx: Record\u003cstring, any\u003e): string {\n let out = \u0027\u0027, i = 0;\n while (i \u003c t.length) {\n if (t[i]===\u0027\\\\\u0027 \u0026\u0026 (t.slice(i+1,i+3)===\u0027{{\u0027 || t.slice(i+1,i+3)===\u0027}}\u0027)) { out += t.slice(i+1,i+3); i+=3; continue; }\n if (t.slice(i,i+2)===\u0027{{\u0027) {\n const e = t.indexOf(\u0027}}\u0027,i+2); if (e===-1||t.slice(i+2,e).includes(\u0027{\u0027)) { out += t[i]; i++; continue; }\n let v: any = ctx; for (const p of t.slice(i+2,e).split(\u0027.\u0027)) v = v!=null\u0026\u0026typeof v===\u0027object\u0027 ? v[p] : undefined;\n out += v!==undefined ? String(v) : \u0027{{\u0027+t.slice(i+2,e)+\u0027}}\u0027; i = e+2; continue;\n } out += t[i]; i++;\n }\n return out;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\nconst ctx = { user: { name: \u0027Alice\u0027, age: 30 }, greeting: \u0027Hello\u0027 };\nassert.strictEqual(templateRender(\u0027{{greeting}} {{user.name}}!\u0027, ctx), \u0027Hello Alice!\u0027);\nassert.strictEqual(templateRender(\u0027Age: {{user.age}}\u0027, ctx), \u0027Age: 30\u0027);\nassert.strictEqual(templateRender(\u0027{{missing}}\u0027, ctx), \u0027{{missing}}\u0027);\nassert.strictEqual(templateRender(\u0027\\\\{{escaped}}\u0027, ctx), \u0027{{escaped}}\u0027);\nassert.strictEqual(templateRender(\u0027no placeholders\u0027, ctx), \u0027no placeholders\u0027);\nassert.strictEqual(templateRender(\u0027{{user.name}} is {{user.age}}\u0027, ctx), \u0027Alice is 30\u0027);\n","assertions":"assert.strictEqual(templateRender(\u0027\u0027, {}), \u0027\u0027);\nassert.strictEqual(templateRender(\u0027{{a}}\u0027, {a: 0}), \u00270\u0027);\nassert.strictEqual(templateRender(\u0027{{a.b.c}}\u0027, {a: {b: {c: \u0027deep\u0027}}}), \u0027deep\u0027);\nassert.strictEqual(templateRender(\u0027{{a.b}}\u0027, {a: \u0027flat\u0027}), \u0027{{a.b}}\u0027);\nassert.strictEqual(templateRender(\u0027{{unclosed\u0027, {}), \u0027{{unclosed\u0027);\nassert.strictEqual(templateRender(\u0027\\\\}}literal\u0027, {}), \u0027}}literal\u0027);\n","category":"pattern_matching"} {"id":"8","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Run-length encoding with a MINIMUM threshold.\n// Only runs of length \u003e= threshold are compressed.\n// Compressed format: \u0027#\u0027 + count + char (e.g., \u0027#4a\u0027 for \u0027aaaa\u0027)\n// Runs shorter than threshold are left as-is.\n// The \u0027#\u0027 character in input is ESCAPED as \u0027##\u0027.\n// Default threshold is 3.\n//\n// Example (threshold=3): \u0027aaabbc\u0027 =\u003e \u0027#3abc\u0027 (only \u0027aaa\u0027 compressed, \u0027bb\u0027 stays)\n// Example (threshold=2): \u0027aaabbc\u0027 =\u003e \u0027#3a#2bc\u0027\n// Example: \u0027a#b\u0027 =\u003e \u0027a##b\u0027 (# is escaped)\n\n","golden_completion":"function rleEncode(input: string, threshold: number = 3): string {\n let out = \u0027\u0027, i = 0;\n while (i \u003c input.length) {\n if (input[i] === \u0027#\u0027) { out += \u0027##\u0027; i++; continue; }\n let run = 1;\n while (i + run \u003c input.length \u0026\u0026 input[i + run] === input[i]) run++;\n out += run \u003e= threshold ? \u0027#\u0027 + run + input[i] : input[i].repeat(run);\n i += run;\n }\n return out;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Only runs \u003e= 3 are compressed by default.\nassert.strictEqual(rleEncode(\u0027aaabbc\u0027), \u0027#3abbc\u0027);\nassert.strictEqual(rleEncode(\u0027aaabbc\u0027, 2), \u0027#3a#2bc\u0027);\nassert.strictEqual(rleEncode(\u0027aabbc\u0027), \u0027aabbc\u0027);\nassert.strictEqual(rleEncode(\u0027a#b\u0027), \u0027a##b\u0027);\nassert.strictEqual(rleEncode(\u0027aaaa\u0027), \u0027#4a\u0027);\nassert.strictEqual(rleEncode(\u0027\u0027), \u0027\u0027);\n","assertions":"assert.strictEqual(rleEncode(\u0027abcde\u0027), \u0027abcde\u0027);\nassert.strictEqual(rleEncode(\u0027aaaaa\u0027, 3), \u0027#5a\u0027);\nassert.strictEqual(rleEncode(\u0027aabb\u0027, 3), \u0027aabb\u0027);\nassert.strictEqual(rleEncode(\u0027###\u0027), \u0027######\u0027);\nassert.strictEqual(rleEncode(\u0027xxxx#yyyy\u0027), \u0027#4x###4y\u0027);\nassert.strictEqual(rleEncode(\u0027aabbcc\u0027, 2), \u0027#2a#2b#2c\u0027);\n","category":"pattern_matching"} {"id":"9","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Split a string by a delimiter, but IGNORE delimiters inside brackets.\n// Supported bracket pairs: (), [], {}\n// Brackets can be NESTED: \u0027a(b[c,d],e),f\u0027 split by \u0027,\u0027 =\u003e [\u0027a(b[c,d],e)\u0027, \u0027f\u0027]\n// Quoted strings (single or double) also suppress the delimiter.\n// Escaped quotes inside strings: \\\\\u0027 and \\\\\" do NOT end the string.\n// If brackets are unbalanced, treat remaining as literal.\n\n","golden_completion":"function bracketSplit(input: string, delim: string = \u0027,\u0027): string[] {\n const res: string[] = []; let cur = \u0027\u0027, d = 0, q: string|null = null;\n for (let i = 0; i \u003c input.length; i++) {\n const c = input[i];\n if (q) { if (c===\u0027\\\\\u0027 \u0026\u0026 i+1\u003cinput.length) { cur+=c+input[++i]; continue; } if (c===q) q=null; cur+=c; continue; }\n if (c===\u0027\"\u0027||c===\"\u0027\") { q=c; cur+=c; continue; }\n if (\u0027([{\u0027.includes(c)) { d++; cur+=c; continue; } if (\u0027)]}\u0027.includes(c)) { d=Math.max(0,d-1); cur+=c; continue; }\n if (d===0\u0026\u0026input.slice(i,i+delim.length)===delim) { res.push(cur); cur=\u0027\u0027; i+=delim.length-1; continue; }\n cur += c;\n } res.push(cur); return res;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\nassert.deepStrictEqual(bracketSplit(\u0027a,b,c\u0027), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027a(b,c),d\u0027), [\u0027a(b,c)\u0027, \u0027d\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027a(b[c,d],e),f\u0027), [\u0027a(b[c,d],e)\u0027, \u0027f\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027\"a,b\",c\u0027), [\u0027\"a,b\"\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027a::b::c\u0027, \u0027::\u0027), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027\u0027), [\u0027\u0027]);\n","assertions":"assert.deepStrictEqual(bracketSplit(\u0027no delim\u0027), [\u0027no delim\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027{a,b},c,[d,e]\u0027), [\u0027{a,b}\u0027, \u0027c\u0027, \u0027[d,e]\u0027]);\nassert.deepStrictEqual(bracketSplit(\"\u0027a,b\u0027,c\"), [\"\u0027a,b\u0027\", \u0027c\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027a(b(c,d),e),f\u0027), [\u0027a(b(c,d),e)\u0027, \u0027f\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027a,b,c\u0027, \u0027;\u0027), [\u0027a,b,c\u0027]);\nassert.deepStrictEqual(bracketSplit(\u0027x\"y,z\"w,v\u0027), [\u0027x\"y,z\"w\u0027, \u0027v\u0027]);\n","category":"pattern_matching"} {"id":"10","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Parse a single CSV line into fields.\n// Rules:\n// - Fields are separated by the delimiter (default \u0027,\u0027).\n// - Fields may be quoted with double quotes: \"field\".\n// - Inside a quoted field, a double-double-quote \"\" is an escaped quote.\n// - Whitespace around unquoted fields is TRIMMED.\n// - Whitespace inside quoted fields is PRESERVED.\n// - An unclosed quote includes everything to end-of-line in that field.\n// - Empty fields produce empty strings.\n\n","golden_completion":"function parseCsvLine(line: string, delim: string = \u0027,\u0027): string[] {\n const f: string[] = []; let i = 0, more = true;\n while (i \u003c= line.length \u0026\u0026 more) {\n more = false; if (i === line.length) { f.push(\u0027\u0027); break; }\n let s = i; while (s \u003c line.length \u0026\u0026 line[s]===\u0027 \u0027) s++;\n if (s\u003cline.length \u0026\u0026 line[s]===\u0027\"\u0027) {\n let v=\u0027\u0027, j=s+1; while(j\u003cline.length){if(line[j]===\u0027\"\u0027\u0026\u0026j+1\u003cline.length\u0026\u0026line[j+1]===\u0027\"\u0027){v+=\u0027\"\u0027;j+=2;}else if(line[j]===\u0027\"\u0027){j++;break;}else{v+=line[j];j++;}} f.push(v); while(j\u003cline.length\u0026\u0026line[j]!==delim[0]) j++; if(j\u003cline.length){i=j+delim.length;more=true;}else i=j;\n } else { const d=line.indexOf(delim,i); if(d===-1){f.push(line.slice(i).trim());break;} f.push(line.slice(i,d).trim()); i=d+delim.length; more=true; }\n }\n return f;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\nassert.deepStrictEqual(parseCsvLine(\u0027a,b,c\u0027), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(parseCsvLine(\u0027\"hello, world\",b\u0027), [\u0027hello, world\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(parseCsvLine(\u0027a, b , c\u0027), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]); // trimmed\nassert.deepStrictEqual(parseCsvLine(\u0027\" a \",b\u0027), [\u0027 a \u0027, \u0027b\u0027]); // quoted preserves spaces\nassert.deepStrictEqual(parseCsvLine(\u0027\"a\"\"b\",c\u0027), [\u0027a\"b\u0027, \u0027c\u0027]); // escaped quote\nassert.deepStrictEqual(parseCsvLine(\u0027a,,c\u0027), [\u0027a\u0027, \u0027\u0027, \u0027c\u0027]); // empty field\nassert.deepStrictEqual(parseCsvLine(\u0027\u0027), [\u0027\u0027]);\n","assertions":"assert.deepStrictEqual(parseCsvLine(\u0027x;y;z\u0027, \u0027;\u0027), [\u0027x\u0027, \u0027y\u0027, \u0027z\u0027]);\nassert.deepStrictEqual(parseCsvLine(\u0027\"has,comma\";b\u0027, \u0027;\u0027), [\u0027has,comma\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(parseCsvLine(\u0027 a , b \u0027), [\u0027a\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(parseCsvLine(\u0027\"\"\"quoted\"\"\"\u0027), [\u0027\"quoted\"\u0027]);\nassert.deepStrictEqual(parseCsvLine(\u0027a,\u0027), [\u0027a\u0027, \u0027\u0027]);\nassert.deepStrictEqual(parseCsvLine(\u0027,a\u0027), [\u0027\u0027, \u0027a\u0027]);\n","category":"pattern_matching"} {"id":"11","testsource":"devbench-pattern-matching","language":"typescript","prefix":"function charIsAlphanumeric(ch: string): boolean {\n return /^[a-zA-Z0-9]$/.test(ch);\n}\n\nfunction numericEntity(ch: string): string {\n return \u0027\u0026#\u0027 + ch.charCodeAt(0) + \u0027;\u0027;\n}\n\n// Escape examples:\n// charIsAlphanumeric(\u0027a\u0027) =\u003e true, charIsAlphanumeric(\u0027\u003c\u0027) =\u003e false\n// numericEntity(\u0027\u003c\u0027) =\u003e \u0027\u0026#60;\u0027, numericEntity(\u0027\u0026\u0027) =\u003e \u0027\u0026#38;\u0027\n\n","golden_completion":"function htmlEscape(text: string, safe: string = \u0027\u0027): string {\n let out = \u0027\u0027;\n for (const ch of text) {\n if (charIsAlphanumeric(ch) || ch === \u0027 \u0027 || safe.includes(ch)) {\n out += ch;\n } else {\n out += numericEntity(ch);\n }\n }\n return out;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(numericEntity(\u0027\u003c\u0027), \u0027\u0026#60;\u0027);\nassert.strictEqual(numericEntity(\u0027\u0026\u0027), \u0027\u0026#38;\u0027);\n\n// This escape function uses NUMERIC entities (\u0026#DDD;), NOT named entities.\n// Standard htmlEscape would produce \u0027\u0026lt;\u0027 for \u0027\u003c\u0027, but this produces \u0027\u0026#60;\u0027.\nassert.strictEqual(htmlEscape(\u0027\u003cb\u003e\u0027), \u0027\u0026#60;b\u0026#62;\u0027);\nassert.notStrictEqual(htmlEscape(\u0027\u003cb\u003e\u0027), \u0027\u0026lt;b\u0026gt;\u0027);\nassert.strictEqual(htmlEscape(\u0027a \u0026 b\u0027), \u0027a \u0026#38; b\u0027);\nassert.notStrictEqual(htmlEscape(\u0027a \u0026 b\u0027), \u0027a \u0026amp; b\u0027);\nassert.strictEqual(htmlEscape(\u0027hello\u0027), \u0027hello\u0027);\nassert.strictEqual(htmlEscape(\u0027x\"y\u0027), \u0027x\u0026#34;y\u0027);\n","assertions":"assert.strictEqual(htmlEscape(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(htmlEscape(\u0027abc123\u0027), \u0027abc123\u0027);\nassert.strictEqual(htmlEscape(\"It\u0027s\"), \u0027It\u0026#39;s\u0027);\nassert.strictEqual(htmlEscape(\u0027\u003cscript\u003e\u0027), \u0027\u0026#60;script\u0026#62;\u0027);\nassert.strictEqual(htmlEscape(\u0027a=b\u0027, \u0027=\u0027), \u0027a=b\u0027);\nassert.strictEqual(htmlEscape(\u0027x.y\u0027), \u0027x\u0026#46;y\u0027);\n","category":"pattern_matching"} {"id":"12","testsource":"devbench-pattern-matching","language":"typescript","prefix":"const STANDARD_B85: string = Array.from({ length: 85 }, (_, i) =\u003e String.fromCharCode(33 + i)).join(\u0027\u0027);\nconst REVERSED_B85: string = STANDARD_B85.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data: Buffer): number {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base85Encode(data: string | Buffer, alphabet: string = REVERSED_B85): string {\n const buf = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n if (buf.length === 0) return \u0027\u0027;\n let n = BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(STANDARD_B85[0], \u0027!\u0027);\nassert.strictEqual(STANDARD_B85[84], \u0027u\u0027);\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This is an integer-style base85 encoder with a REVERSED default alphabet, not Adobe Ascii85.\n// With STANDARD_B85, \u0027abc\u0027 is \u0027+B\u003eH\u0027; the default result must differ.\nassert.strictEqual(base85Encode(Buffer.from(\u0027abc\u0027)), \u0027kTXN\u0027);\nassert.notStrictEqual(base85Encode(Buffer.from(\u0027abc\u0027)), \u0027+B\u003eH\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027abc\u0027), STANDARD_B85), \u0027+B\u003eH\u0027);\nassert.strictEqual(base85Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027uukTXN\u0027);\n","assertions":"assert.strictEqual(base85Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base85Encode(Buffer.from([0])), REVERSED_B85[0]);\nassert.strictEqual(base85Encode(\u0027abc\u0027), \u0027kTXN\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027hello\u0027)), \u0027teqIt*_\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027hello\u0027), STANDARD_B85), \u0027\"1%M\"l7\u0027);\nassert.strictEqual(base85Encode(Buffer.from(\u0027AB\u0027), STANDARD_B85), \u0027#;O\u0027);\n","category":"pattern_matching"} {"id":"13","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Ascii85 alphabet: characters from \u0027!\u0027 (33) to \u0027u\u0027 (117)\nconst STD_A85: string = Array.from({ length: 85 }, (_, i) =\u003e String.fromCharCode(33 + i)).join(\u0027\u0027);\nconst REV_A85: string = STD_A85.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\n// Ascii85 encodes 4-byte blocks into 5 characters.\n// For a 4-byte block: value = b0*2^24 + b1*2^16 + b2*2^8 + b3\n// Then encode with base-85 digits (most significant first).\n// Partial blocks (1-3 bytes) pad with zeros, encode 5 chars, then truncate to len+1.\n\n","golden_completion":"function ascii85Encode(data: string | Buffer, alphabet: string = REV_A85): string {\n const buf = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n let result = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i += 4) {\n const chunk = buf.slice(i, i + 4); let val = 0;\n for (let j = 0; j \u003c 4; j++) val = val * 256 + (j \u003c chunk.length ? chunk[j] : 0);\n const c: string[] = []; for (let k = 0; k \u003c 5; k++) { c.unshift(alphabet[val % 85]); val = Math.floor(val / 85); }\n result += c.join(\u0027\u0027).slice(0, chunk.length + 1);\n }\n return result;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(STD_A85[0], \u0027!\u0027);\nassert.strictEqual(REV_A85[0], \u0027u\u0027);\n\n// This Ascii85 encoder uses REVERSED alphabet by default.\n// Standard Ascii85 for \u0027Man \u0027 is \u00279jqo^\u0027; with reversed alphabet the result differs.\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027Man \u0027), STD_A85), \u00279jqo^\u0027);\nassert.notStrictEqual(ascii85Encode(Buffer.from(\u0027Man \u0027)), \u00279jqo^\u0027);\n// Partial block: \u0027M\u0027 (1 byte) =\u003e encode 4-byte padded, take first 2 chars\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027M\u0027), STD_A85), \u00279`\u0027);\nassert.notStrictEqual(ascii85Encode(Buffer.from(\u0027M\u0027)), \u00279`\u0027);\n","assertions":"assert.strictEqual(ascii85Encode(Buffer.from(\u0027\u0027)), \u0027\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027M\u0027), STD_A85), \u00279`\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027Ma\u0027), STD_A85), \u00279jn\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027Man\u0027), STD_A85), \u00279jqo\u0027);\nassert.strictEqual(ascii85Encode(Buffer.from(\u0027Man \u0027), STD_A85), \u00279jqo^\u0027);\n// With reversed alphabet the output must differ\nassert.notStrictEqual(ascii85Encode(Buffer.from(\u0027Man \u0027)), \u00279jqo^\u0027);\nassert.strictEqual(ascii85Encode(\u0027test\u0027), ascii85Encode(Buffer.from(\u0027test\u0027)));\n","category":"pattern_matching"} {"id":"14","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Custom edit distance with transposition support.\n// Costs: insert=1, delete=1, replace=1, swap(adjacent transposition)=0.5\n// Example: editDistance(\u0027ab\u0027,\u0027ba\u0027) = 0.5 (one swap), NOT 2 (delete+insert)\n// Example: editDistance(\u0027cat\u0027,\u0027car\u0027) = 1 (one replace)\n// Example: editDistance(\u0027\u0027,\u0027abc\u0027) = 3 (three inserts)\n\n","golden_completion":"function editDistance(a: string, b: string): number {\n const m = a.length, n = b.length;\n const dp: number[][] = Array.from({length: m+1}, () =\u003e Array(n+1).fill(0));\n for (let i = 0; i \u003c= m; i++) dp[i][0] = i;\n for (let j = 0; j \u003c= n; j++) dp[0][j] = j;\n for (let i = 1; i \u003c= m; i++) for (let j = 1; j \u003c= n; j++) {\n dp[i][j] = Math.min(dp[i-1][j]+1, dp[i][j-1]+1, dp[i-1][j-1]+(a[i-1]===b[j-1]?0:1));\n if (i\u003e1 \u0026\u0026 j\u003e1 \u0026\u0026 a[i-1]===b[j-2] \u0026\u0026 a[i-2]===b[j-1]) dp[i][j] = Math.min(dp[i][j], dp[i-2][j-2]+0.5);\n }\n return dp[m][n];\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Swap costs 0.5, NOT the standard Levenshtein cost of 2 (delete+insert)\nassert.strictEqual(editDistance(\u0027ab\u0027, \u0027ba\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027cat\u0027, \u0027car\u0027), 1);\nassert.strictEqual(editDistance(\u0027\u0027, \u0027abc\u0027), 3);\nassert.strictEqual(editDistance(\u0027abc\u0027, \u0027\u0027), 3);\nassert.strictEqual(editDistance(\u0027abc\u0027, \u0027abc\u0027), 0);\nassert.strictEqual(editDistance(\u0027abcd\u0027, \u0027badc\u0027), 1);\n","assertions":"assert.strictEqual(editDistance(\u0027\u0027, \u0027\u0027), 0);\nassert.strictEqual(editDistance(\u0027a\u0027, \u0027b\u0027), 1);\nassert.strictEqual(editDistance(\u0027ab\u0027, \u0027ba\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027abcd\u0027, \u0027abdc\u0027), 0.5);\nassert.strictEqual(editDistance(\u0027kitten\u0027, \u0027sitting\u0027), 3);\n","category":"pattern_matching"} {"id":"15","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Custom longest common subsequence with case-insensitive matching.\n// When two characters match case-insensitively, they contribute to the LCS.\n// The returned subsequence preserves the ORIGINAL case from the FIRST string.\n// Tie-breaking: prefer the match that appears EARLIER in the first string.\n//\n// Examples:\n// lcs(\u0027ABC\u0027, \u0027abc\u0027) =\u003e \u0027ABC\u0027 (all match case-insensitively, use first string\u0027s case)\n// lcs(\u0027AxB\u0027, \u0027ayb\u0027) =\u003e \u0027AB\u0027 (x!=y, so LCS is A+B, preserving first string\u0027s case)\n// lcs(\u0027Hello\u0027, \u0027hELLO\u0027) =\u003e \u0027Hello\u0027 (all 5 match case-insensitively)\n\n","golden_completion":"function lcs(a: string, b: string): string {\n const m = a.length, n = b.length, dp: number[][] = Array.from({length: m+1}, () =\u003e Array(n+1).fill(0));\n for (let i = 1; i \u003c= m; i++) for (let j = 1; j \u003c= n; j++) {\n if (a[i-1].toLowerCase() === b[j-1].toLowerCase()) dp[i][j] = dp[i-1][j-1]+1; else dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]);\n }\n let res = \u0027\u0027, i = m, j = n;\n while (i \u003e 0 \u0026\u0026 j \u003e 0) {\n if (a[i-1].toLowerCase()===b[j-1].toLowerCase()) { res=a[i-1]+res; i--; j--; } else if(dp[i-1][j]\u003e=dp[i][j-1]) i--; else j--;\n }\n return res;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Case-insensitive matching, result preserves FIRST string\u0027s case\nassert.strictEqual(lcs(\u0027ABC\u0027, \u0027abc\u0027), \u0027ABC\u0027);\nassert.strictEqual(lcs(\u0027AxB\u0027, \u0027ayb\u0027), \u0027AB\u0027);\nassert.strictEqual(lcs(\u0027Hello\u0027, \u0027hELLO\u0027), \u0027Hello\u0027);\n// Standard LCS(\u0027ABC\u0027,\u0027abc\u0027) would return \u0027\u0027 (case sensitive). This returns \u0027ABC\u0027.\nassert.notStrictEqual(lcs(\u0027ABC\u0027, \u0027abc\u0027), \u0027\u0027);\nassert.strictEqual(lcs(\u0027\u0027, \u0027abc\u0027), \u0027\u0027);\nassert.strictEqual(lcs(\u0027abc\u0027, \u0027\u0027), \u0027\u0027);\n","assertions":"assert.strictEqual(lcs(\u0027\u0027, \u0027\u0027), \u0027\u0027);\nassert.strictEqual(lcs(\u0027ABCDE\u0027, \u0027ace\u0027), \u0027ACE\u0027);\nassert.strictEqual(lcs(\u0027XyZ\u0027, \u0027xyz\u0027), \u0027XyZ\u0027);\nassert.strictEqual(lcs(\u0027abcdef\u0027, \u0027AXCXEF\u0027), \u0027acef\u0027);\nassert.strictEqual(lcs(\u0027Test\u0027, \u0027tEST\u0027), \u0027Test\u0027);\n","category":"pattern_matching"} {"id":"16","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Template renderer: replaces %{key} with values from a context object.\n// RULES:\n// 1. Supports nested: %{a%{b}} -- inner resolved first, then outer\n// 2. Escape: %%{ is NOT replaced (literal \u0027%{\u0027 in output)\n// 3. Unresolved keys stay as-is: %{unknown} =\u003e \u0027%{unknown}\u0027\n// 4. Pipe filters: %{key|upper} applies uppercase, %{key|lower} applies lowercase\n//\n// render(\u0027Hello %{name}\u0027, {name: \u0027World\u0027}) =\u003e \u0027Hello World\u0027\n// render(\u0027%%{name}\u0027, {name: \u0027X\u0027}) =\u003e \u0027%{name}\u0027\n// render(\u0027%{name|upper}\u0027, {name: \u0027hi\u0027}) =\u003e \u0027HI\u0027\n\n// Helper: find matching close brace, respecting nested %{...}\nfunction findCloseBrace(s: string, start: number): number {\n let d = 1, j = start;\n while (j \u003c s.length \u0026\u0026 d \u003e 0) {\n if (s[j] === \u0027%\u0027 \u0026\u0026 s[j+1] === \u0027{\u0027) { d++; j += 2; }\n else { if (s[j] === \u0027}\u0027) d--; j++; }\n }\n return d === 0 ? j : -1;\n}\n\n","golden_completion":"function render(s: string, ctx: Record\u003cstring, string\u003e): string {\n let r = \u0027\u0027, i = 0;\n while (i \u003c s.length) {\n if (s[i]===\u0027%\u0027\u0026\u0026s[i+1]===\u0027%\u0027\u0026\u0026s[i+2]===\u0027{\u0027) { r+=\u0027%{\u0027; i+=3; }\n else if (s[i]===\u0027%\u0027\u0026\u0026s[i+1]===\u0027{\u0027) { const j=findCloseBrace(s,i+2); if(j\u003c0){r+=s[i++];} else {\n const e=render(s.slice(i+2,j-1),ctx),p=e.split(\u0027|\u0027),k=p[0],f=p[1]; let v=k in ctx?ctx[k]:\u0027%{\u0027+e+\u0027}\u0027;\n if(k in ctx\u0026\u0026f===\u0027upper\u0027)v=v.toUpperCase(); if(k in ctx\u0026\u0026f===\u0027lower\u0027)v=v.toLowerCase(); r+=v; i=j; }\n } else r+=s[i++];\n }\n return r;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\nassert.strictEqual(render(\u0027Hello %{name}\u0027, {name: \u0027World\u0027}), \u0027Hello World\u0027);\nassert.strictEqual(render(\u0027%{a%{idx}}\u0027, {idx: \u00271\u0027, a1: \u0027YES\u0027}), \u0027YES\u0027);\nassert.strictEqual(render(\u0027%%{name}\u0027, {name: \u0027X\u0027}), \u0027%{name}\u0027);\nassert.strictEqual(render(\u0027%{unknown}\u0027, {}), \u0027%{unknown}\u0027);\nassert.strictEqual(render(\u0027%{name|upper}\u0027, {name: \u0027hello\u0027}), \u0027HELLO\u0027);\nassert.strictEqual(render(\u0027%{name|lower}\u0027, {name: \u0027HELLO\u0027}), \u0027hello\u0027);\n","assertions":"assert.strictEqual(render(\u0027\u0027, {}), \u0027\u0027);\nassert.strictEqual(render(\u0027no vars here\u0027, {}), \u0027no vars here\u0027);\nassert.strictEqual(render(\u0027%{a}%{b}\u0027, {a: \u0027X\u0027, b: \u0027Y\u0027}), \u0027XY\u0027);\nassert.strictEqual(render(\u0027%{x%{y}}\u0027, {y: \u0027z\u0027, xz: \u0027OK\u0027}), \u0027OK\u0027);\nassert.strictEqual(render(\u0027%%{a}\u0027, {a: \u0027B\u0027}), \u0027%{a}\u0027);\nassert.strictEqual(render(\u0027%{g|upper}\u0027, {g: \u0027foo\u0027}), \u0027FOO\u0027);\n","category":"pattern_matching"} {"id":"17","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Deep merge two objects with CUSTOM rules:\n// 1. Arrays are CONCATENATED, not replaced (unlike standard deep merge)\n// 2. null in source DELETES the key from the result\n// 3. Nested objects are merged recursively\n// 4. All other values: source overwrites target\n//\n// deepMerge({a: [1]}, {a: [2]}) =\u003e {a: [1, 2]}\n// deepMerge({a: 1, b: 2}, {b: null}) =\u003e {a: 1}\n// deepMerge({a: {x: 1}}, {a: {y: 2}}) =\u003e {a: {x: 1, y: 2}}\n\n","golden_completion":"function deepMerge(target: any, source: any): any {\n const r: any = { ...target };\n for (const k of Object.keys(source)) {\n const s = source[k], t = r[k];\n if (s === null) delete r[k];\n else if (Array.isArray(t) \u0026\u0026 Array.isArray(s)) r[k] = [...t, ...s];\n else if (typeof t === \u0027object\u0027 \u0026\u0026 t !== null \u0026\u0026 typeof s === \u0027object\u0027 \u0026\u0026 !Array.isArray(t) \u0026\u0026 !Array.isArray(s)) r[k] = deepMerge(t, s);\n else r[k] = s;\n }\n return r;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Arrays concatenated, NOT replaced\nassert.deepStrictEqual(deepMerge({a: [1]}, {a: [2]}), {a: [1, 2]});\n// null DELETES key\nassert.deepStrictEqual(deepMerge({a: 1, b: 2}, {b: null}), {a: 1});\n// Nested merge\nassert.deepStrictEqual(deepMerge({a: {x: 1}}, {a: {y: 2}}), {a: {x: 1, y: 2}});\n// Standard deep merge would keep b; this version deletes it\nconst r = deepMerge({a: 1, b: 2, c: 3}, {b: null, c: 99});\nassert.strictEqual(\u0027b\u0027 in r, false);\nassert.strictEqual(r.c, 99);\n","assertions":"assert.deepStrictEqual(deepMerge({}, {}), {});\nassert.deepStrictEqual(deepMerge({a: 1}, {}), {a: 1});\nassert.deepStrictEqual(deepMerge({}, {a: 1}), {a: 1});\nassert.deepStrictEqual(deepMerge({a: [1, 2]}, {a: [3]}), {a: [1, 2, 3]});\nassert.deepStrictEqual(deepMerge({x: {a: 1, b: 2}}, {x: {b: null}}), {x: {a: 1}});\nassert.deepStrictEqual(deepMerge({a: \u0027old\u0027}, {a: \u0027new\u0027}), {a: \u0027new\u0027});\n","category":"pattern_matching"} {"id":"18","testsource":"devbench-pattern-matching","language":"typescript","prefix":"function isBalancedParens(text: string): boolean {\n let count = 0;\n for (const ch of text) {\n if (ch === \u0027(\u0027) count++;\n else if (ch === \u0027)\u0027) count--;\n if (count \u003c 0) return false;\n }\n return count === 0;\n}\n\nfunction isBalancedBrackets(text: string): boolean {\n const stack: string[] = [];\n const pairs: Record\u003cstring, string\u003e = {\u0027(\u0027: \u0027)\u0027, \u0027[\u0027: \u0027]\u0027, \u0027{\u0027: \u0027}\u0027};\n for (const ch of text) {\n if (ch in pairs) stack.push(pairs[ch]);\n else if (Object.values(pairs).includes(ch)) {\n if (!stack.length || stack[stack.length - 1] !== ch) return false;\n stack.pop();\n }\n }\n return stack.length === 0;\n}\n\n","golden_completion":"function isBalancedCode(text: string): boolean {\n const stk: string[] = [], P: Record\u003cstring,string\u003e = {\"(\":\")\", \"[\":\"]\", \"{\":\"}\"};\n let inStr = false, sc = \u0027\u0027, i = 0;\n while (i \u003c text.length) {\n const c = text[i];\n if (inStr) { if(c===\"\\\\\"\u0026\u0026i+1\u003ctext.length){i+=2;continue;} if(c===sc) inStr=false; }\n else if(c===\u0027\"\u0027||c===\"\u0027\"){inStr=true;sc=c;} else if(c in P) stk.push(P[c]);\n else if(Object.values(P).includes(c)){if(!stk.length||stk[stk.length-1]!==c)return false; stk.pop();}\n i++;\n }\n return stk.length === 0 \u0026\u0026 !inStr;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(isBalancedParens(\u0027(())\u0027), true);\nassert.strictEqual(isBalancedParens(\u0027(()\u0027), false);\nassert.strictEqual(isBalancedBrackets(\u0027{[()]}\u0027), true);\nassert.strictEqual(isBalancedBrackets(\u0027{[(])}\u0027), false);\n\n// isBalancedCode: like isBalancedBrackets but ignores brackets inside strings\nassert.strictEqual(isBalancedCode(\u0027print(\"hello\")\u0027), true);\nassert.strictEqual(isBalancedCode(\u0027x = \"(\"\u0027), true);\nassert.strictEqual(isBalancedCode(\"x = \u0027)\u0027\"), true);\nassert.strictEqual(isBalancedCode(\u0027f(\"(\", y)\u0027), true);\nassert.strictEqual(isBalancedCode(\u0027f(\") + g(\u0027), false);\n","assertions":"assert.strictEqual(isBalancedCode(\u0027\u0027), true);\nassert.strictEqual(isBalancedCode(\u0027()\u0027), true);\nassert.strictEqual(isBalancedCode(\u0027(\u0027), false);\nassert.strictEqual(isBalancedCode(\u0027\"unclosed string\u0027), false);\nassert.strictEqual(isBalancedCode(\u0027a = \"\\\\)\"\u0027), true);\nassert.strictEqual(isBalancedCode(\u0027{[(\"hello\")]}\u0027), true);\nassert.strictEqual(isBalancedCode(\u0027{\"key\": \"val\"}\u0027), true);\n","category":"pattern_matching"} {"id":"19","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Custom string escape processor.\n// Processes backslash escapes in a raw string:\n// \\n =\u003e newline, \\t =\u003e tab, \\\\\\\\ =\u003e backslash, \\xHH =\u003e hex byte\n// \\u{HHHH} =\u003e unicode codepoint (variable length, 1-6 hex digits)\n// Unknown escape \\X =\u003e literal X (backslash consumed)\n//\n// CRITICAL: \\x requires EXACTLY 2 hex digits; if fewer are available,\n// treat as unknown escape (\\x =\u003e \u0027x\u0027, digits kept as-is).\n// \\u{ requires } to close; if no }, treat as unknown escape.\n//\n// parseEscapes(\u0027a\\\\nb\u0027) =\u003e \u0027a\\nb\u0027 (with actual newline)\n// parseEscapes(\u0027\\\\x41\u0027) =\u003e \u0027A\u0027\n// parseEscapes(\u0027\\\\u{48}\u0027) =\u003e \u0027H\u0027\n\n","golden_completion":"function parseEscapes(raw: string): string {\n let out = \u0027\u0027, i = 0;\n while (i \u003c raw.length) {\n if (raw[i] !== \u0027\\\\\u0027 || i+1 \u003e= raw.length) { out += raw[i++]; continue; }\n const c = raw[i+1];\n if (c===\u0027n\u0027){out+=\u0027\\n\u0027;i+=2;} else if(c===\u0027t\u0027){out+=\u0027\\t\u0027;i+=2;} else if(c===\u0027\\\\\u0027){out+=\u0027\\\\\u0027;i+=2;}\n else if (c===\u0027x\u0027) { const h=raw.slice(i+2,i+4); if(/^[0-9a-fA-F]{2}$/.test(h)){out+=String.fromCharCode(parseInt(h,16));i+=4;} else{out+=c;i+=2;} }\n else if (c===\u0027u\u0027\u0026\u0026raw[i+2]===\u0027{\u0027) { const e=raw.indexOf(\u0027}\u0027,i+3); if(e\u003e=0){out+=String.fromCodePoint(parseInt(raw.slice(i+3,e),16));i=e+1;} else{out+=c;i+=2;} }\n else { out+=c; i+=2; }\n }\n return out;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Basic escapes\nassert.strictEqual(parseEscapes(\u0027a\\\\nb\u0027), \u0027a\\nb\u0027);\nassert.strictEqual(parseEscapes(\u0027a\\\\tb\u0027), \u0027a\\tb\u0027);\nassert.strictEqual(parseEscapes(\u0027a\\\\\\\\b\u0027), \u0027a\\\\b\u0027);\n// Hex escape\nassert.strictEqual(parseEscapes(\u0027\\\\x41\u0027), \u0027A\u0027);\nassert.strictEqual(parseEscapes(\u0027\\\\x61\\\\x62\u0027), \u0027ab\u0027);\n// Unicode escape\nassert.strictEqual(parseEscapes(\u0027\\\\u{48}\u0027), \u0027H\u0027);\nassert.strictEqual(parseEscapes(\u0027\\\\u{1F600}\u0027), \u0027\\u{1F600}\u0027);\n// Unknown escape: \\q =\u003e \u0027q\u0027\nassert.strictEqual(parseEscapes(\u0027\\\\q\u0027), \u0027q\u0027);\n// Incomplete hex: \\x followed by only 1 hex digit\nassert.strictEqual(parseEscapes(\u0027\\\\x4z\u0027), \u0027x4z\u0027);\n","assertions":"assert.strictEqual(parseEscapes(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(parseEscapes(\u0027hello\u0027), \u0027hello\u0027);\nassert.strictEqual(parseEscapes(\u0027\\\\n\\\\t\u0027), \u0027\\n\\t\u0027);\nassert.strictEqual(parseEscapes(\u0027\\\\x4G\u0027), \u0027x4G\u0027);\nassert.strictEqual(parseEscapes(\u0027\\\\u{41}\u0027), \u0027A\u0027);\nassert.strictEqual(parseEscapes(\u0027\\\\u{no close\u0027), \u0027u{no close\u0027);\nassert.strictEqual(parseEscapes(\u0027end\\\\\u0027), \u0027end\\\\\u0027);\n","category":"pattern_matching"} {"id":"20","testsource":"devbench-pattern-matching","language":"typescript","prefix":"// Tokenize a simple expression language into typed tokens.\n// Token types: \u0027num\u0027, \u0027str\u0027, \u0027op\u0027, \u0027ident\u0027, \u0027paren\u0027\n// Numbers: integer sequences (e.g. \u002742\u0027, \u00270\u0027)\n// Strings: double-quoted with backslash escapes (\\\" and \\\\)\n// Operators: +, -, *, /, ==, !=, \u003e=, \u003c=, \u003e, \u003c\n// Identifiers: [a-zA-Z_][a-zA-Z0-9_]*\n// Parens: ( and )\n// Whitespace is skipped.\n// CRITICAL: Multi-char operators (==, !=, \u003e=, \u003c=) must be parsed as ONE token.\n//\n// tokenize(\u0027x + 42\u0027) =\u003e [{type:\u0027ident\u0027,val:\u0027x\u0027},{type:\u0027op\u0027,val:\u0027+\u0027},{type:\u0027num\u0027,val:\u002742\u0027}]\n\ninterface Token { type: string; val: string; }\n\n","golden_completion":"function tokenize(input: string): Token[] {\n const t: Token[] = []; let i = 0;\n while (i \u003c input.length) {\n if (/\\s/.test(input[i])) { i++; continue; }\n if (/[0-9]/.test(input[i])) { let n=\u0027\u0027; while(i\u003cinput.length\u0026\u0026/[0-9]/.test(input[i]))n+=input[i++]; t.push({type:\u0027num\u0027,val:n}); continue; }\n if (input[i]===\u0027\"\u0027) { let s=\u0027\u0027,j=i+1; while(j\u003cinput.length\u0026\u0026input[j]!==\u0027\"\u0027){if(input[j]===\u0027\\\\\u0027){s+=input[++j];}else s+=input[j];j++;} t.push({type:\u0027str\u0027,val:s});i=j+1;continue; }\n const d=input.slice(i,i+2); if([\u0027==\u0027,\u0027!=\u0027,\u0027\u003e=\u0027,\u0027\u003c=\u0027].includes(d)){t.push({type:\u0027op\u0027,val:d});i+=2;continue;}\n if(\u0027+-*/\u003c\u003e\u0027.includes(input[i])){t.push({type:\u0027op\u0027,val:input[i++]});continue;} if(\u0027()\u0027.includes(input[i])){t.push({type:\u0027paren\u0027,val:input[i++]});continue;}\n if(/[a-zA-Z_]/.test(input[i])){let id=\u0027\u0027;while(i\u003cinput.length\u0026\u0026/[a-zA-Z0-9_]/.test(input[i]))id+=input[i++];t.push({type:\u0027ident\u0027,val:id});continue;} i++;\n }\n return t;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Basic tokenization\nassert.deepStrictEqual(tokenize(\u0027x + 42\u0027), [{type:\u0027ident\u0027,val:\u0027x\u0027},{type:\u0027op\u0027,val:\u0027+\u0027},{type:\u0027num\u0027,val:\u002742\u0027}]);\n// Multi-char operators must be ONE token\nassert.deepStrictEqual(tokenize(\u0027a == b\u0027), [{type:\u0027ident\u0027,val:\u0027a\u0027},{type:\u0027op\u0027,val:\u0027==\u0027},{type:\u0027ident\u0027,val:\u0027b\u0027}]);\nassert.deepStrictEqual(tokenize(\u0027a != b\u0027), [{type:\u0027ident\u0027,val:\u0027a\u0027},{type:\u0027op\u0027,val:\u0027!=\u0027},{type:\u0027ident\u0027,val:\u0027b\u0027}]);\n// String with escape\nassert.deepStrictEqual(tokenize(\u0027\"hello\"\u0027), [{type:\u0027str\u0027,val:\u0027hello\u0027}]);\nassert.deepStrictEqual(tokenize(\u0027\"a\\\\\"b\"\u0027), [{type:\u0027str\u0027,val:\u0027a\"b\u0027}]);\n// Parens\nassert.deepStrictEqual(tokenize(\u0027(x)\u0027), [{type:\u0027paren\u0027,val:\u0027(\u0027},{type:\u0027ident\u0027,val:\u0027x\u0027},{type:\u0027paren\u0027,val:\u0027)\u0027}]);\n","assertions":"assert.deepStrictEqual(tokenize(\u0027\u0027), []);\nassert.deepStrictEqual(tokenize(\u0027 \u0027), []);\nassert.deepStrictEqual(tokenize(\u002742\u0027), [{type:\u0027num\u0027,val:\u002742\u0027}]);\nassert.deepStrictEqual(tokenize(\u0027a \u003e= 10\u0027), [{type:\u0027ident\u0027,val:\u0027a\u0027},{type:\u0027op\u0027,val:\u0027\u003e=\u0027},{type:\u0027num\u0027,val:\u002710\u0027}]);\nassert.deepStrictEqual(tokenize(\u0027a \u003c= b\u0027), [{type:\u0027ident\u0027,val:\u0027a\u0027},{type:\u0027op\u0027,val:\u0027\u003c=\u0027},{type:\u0027ident\u0027,val:\u0027b\u0027}]);\nassert.deepStrictEqual(tokenize(\u0027f(1, 2)\u0027), [{type:\u0027ident\u0027,val:\u0027f\u0027},{type:\u0027paren\u0027,val:\u0027(\u0027},{type:\u0027num\u0027,val:\u00271\u0027},{type:\u0027num\u0027,val:\u00272\u0027},{type:\u0027paren\u0027,val:\u0027)\u0027}]);\n","category":"pattern_matching"} {"id":"21","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\nconst STANDARD_Z85: string = \u00270123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ.-:+=^!/*?\u0026\u003c\u003e()[]{}@%$#\u0027;\nconst REVERSED_Z85: string = STANDARD_Z85.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction padToMultipleOf4(buf: Buffer): Buffer {\n const rem = buf.length % 4;\n if (rem === 0) return buf;\n const padded = Buffer.alloc(buf.length + (4 - rem));\n buf.copy(padded);\n return padded;\n}\n\n","golden_completion":"function z85Encode(data: Buffer | string, alphabet: string = REVERSED_Z85): string {\n const buf = padToMultipleOf4(Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027));\n let out = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i += 4) {\n let val = buf.readUInt32BE(i);\n const chunk: string[] = [];\n for (let j = 0; j \u003c 5; j++) { chunk.unshift(alphabet[val % 85]); val = Math.floor(val / 85); }\n out += chunk.join(\u0027\u0027);\n }\n return out;\n}\n","suffix":"\n// Z85 encodes 4 bytes into 5 printable chars. Uses REVERSED alphabet by default.\n// Standard Z85(\u0027\\x86\\x4f\\xd2\\x6f\\xb5\\x59\\xf7\\x5b\u0027) = \u0027HelloWorld\u0027\n// With reversed alphabet, the output MUST differ.\nconst testBuf = Buffer.from([0x86, 0x4f, 0xd2, 0x6f, 0xb5, 0x59, 0xf7, 0x5b]);\nconst stdResult = z85Encode(testBuf, STANDARD_Z85);\nassert.strictEqual(stdResult, \u0027HelloWorld\u0027);\nconst revResult = z85Encode(testBuf);\nassert.notStrictEqual(revResult, \u0027HelloWorld\u0027);\n// Single 4-byte block: \\x00\\x00\\x00\\x00 =\u003e standard is \u002700000\u0027\nassert.strictEqual(z85Encode(Buffer.from([0, 0, 0, 0]), STANDARD_Z85), \u002700000\u0027);\nassert.notStrictEqual(z85Encode(Buffer.from([0, 0, 0, 0])), \u002700000\u0027);\n","assertions":"// Empty input\nassert.strictEqual(z85Encode(Buffer.from([])), \u0027\u0027);\n// String input auto-converts\nassert.strictEqual(z85Encode(\u0027test\u0027, STANDARD_Z85), z85Encode(Buffer.from(\u0027test\u0027), STANDARD_Z85));\n// Padding for non-multiple-of-4\nconst short = z85Encode(Buffer.from([0x61]));\nassert.strictEqual(short.length, 5);\n// Standard vs reversed differ for every non-trivial input\nassert.notStrictEqual(z85Encode(Buffer.from(\u0027ab\u0027)), z85Encode(Buffer.from(\u0027ab\u0027), STANDARD_Z85));\n","category":"pattern_matching"} {"id":"22","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\nconst STANDARD_B45: string = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:\u0027;\nconst REVERSED_B45: string = STANDARD_B45.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\n","golden_completion":"function base45Encode(data: Buffer | string, alphabet: string = REVERSED_B45): string {\n const buf = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n let out = \u0027\u0027;\n for (let i = 0; i \u003c buf.length; i += 2) {\n if (i + 1 \u003c buf.length) { const val = buf[i] * 256 + buf[i + 1]; out += alphabet[val % 45] + alphabet[Math.floor(val / 45) % 45] + alphabet[Math.floor(val / 2025)]; }\n else { const val = buf[i]; out += alphabet[val % 45] + alphabet[Math.floor(val / 45)]; }\n }\n return out;\n}\n","suffix":"\n// Base45 encoding: 2 bytes =\u003e 3 chars, 1 byte =\u003e 2 chars.\n// Uses REVERSED alphabet by default.\n// Standard base45 for \u0027AB\u0027 (0x41,0x42) = \u0027BB8\u0027; reversed must differ.\nassert.strictEqual(base45Encode(Buffer.from(\u0027AB\u0027), STANDARD_B45), \u0027BB8\u0027);\nassert.notStrictEqual(base45Encode(Buffer.from(\u0027AB\u0027)), \u0027BB8\u0027);\n// Standard base45 for \u0027Hello\u0027 = \u0027%69 VD92EX0\u0027\nassert.strictEqual(base45Encode(Buffer.from([0x48, 0x65]), STANDARD_B45), \u0027%69\u0027);\nassert.notStrictEqual(base45Encode(Buffer.from([0x48, 0x65])), \u0027%69\u0027);\n// Single byte \u0027A\u0027 (0x41=65): 65%45=20 -\u003e \u0027K\u0027, 65/45=1 -\u003e \u00271\u0027 =\u003e \u0027K1\u0027\nassert.strictEqual(base45Encode(Buffer.from([0x41]), STANDARD_B45), \u0027K1\u0027);\n","assertions":"// Empty\nassert.strictEqual(base45Encode(Buffer.from([])), \u0027\u0027);\n// String input\nassert.strictEqual(base45Encode(\u0027AB\u0027), base45Encode(Buffer.from(\u0027AB\u0027)));\n// Reversed vs standard always differ for non-empty\nassert.notStrictEqual(base45Encode(Buffer.from(\u0027test\u0027)), base45Encode(Buffer.from(\u0027test\u0027), STANDARD_B45));\n// Single byte: 0x00 =\u003e alphabet[0] + alphabet[0]\nassert.strictEqual(base45Encode(Buffer.from([0x00]), STANDARD_B45), \u002700\u0027);\nassert.strictEqual(base45Encode(Buffer.from([0x00])), REVERSED_B45[0] + REVERSED_B45[0]);\n","category":"pattern_matching"} {"id":"23","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\nconst STANDARD_B62: string = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027;\nconst REVERSED_B62: string = STANDARD_B62.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(data: Buffer): number {\n let count = 0;\n for (const b of data) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base62Encode(data: Buffer | string, alphabet: string = REVERSED_B62): string {\n const buf = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n let n = BigInt(\u00270x\u0027 + (buf.length ? buf.toString(\u0027hex\u0027) : \u00270\u0027));\n const base = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 97, 98, 99])), 2);\n\n// This byte-to-integer base62 encoder uses the REVERSED alphabet by default.\n// Standard base62 for \u0027abc\u0027 is \u0027QmIN\u0027; the default result must differ.\nassert.strictEqual(base62Encode(Buffer.from(\u0027abc\u0027)), \u0027ZDhc\u0027);\nassert.notStrictEqual(base62Encode(Buffer.from(\u0027abc\u0027)), \u0027QmIN\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027abc\u0027), STANDARD_B62), \u0027QmIN\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0, 0, 97, 98, 99])), \u0027zzZDhc\u0027);\n","assertions":"assert.strictEqual(base62Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base62Encode(Buffer.from([0])), REVERSED_B62[0]);\nassert.strictEqual(base62Encode(\u0027abc\u0027), \u0027ZDhc\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027hello\u0027)), \u0027s6Zeki0\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027hello\u0027), STANDARD_B62), \u00277tQLFHz\u0027);\nassert.strictEqual(base62Encode(Buffer.from(\u0027AB\u0027), STANDARD_B62), \u00274LS\u0027);\n","category":"pattern_matching"} {"id":"24","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\ninterface Circle { kind: \u0027circle\u0027; radius: number; }\ninterface Rectangle { kind: \u0027rectangle\u0027; width: number; height: number; }\ninterface Triangle { kind: \u0027triangle\u0027; base: number; height: number; }\ntype Shape = Circle | Rectangle | Triangle;\n\n// Compute area using formulas:\n// circle: Math.ceil(radius * radius * 3) — NOTE: uses 3, NOT Math.PI\n// rectangle: width * height + 1 — NOTE: adds a 1-unit border surcharge\n// triangle: Math.floor(base * height / 3) — NOTE: divides by 3, NOT 2\n\n","golden_completion":"function computeArea(shape: Shape): number {\n switch (shape.kind) {\n case \u0027circle\u0027: return Math.ceil(shape.radius * shape.radius * 3);\n case \u0027rectangle\u0027: return shape.width * shape.height + 1;\n case \u0027triangle\u0027: return Math.floor(shape.base * shape.height / 3);\n }\n}\n","suffix":"\n// Area uses CUSTOM formulas, NOT standard geometric formulas.\n// circle: ceil(r^2 * 3), rectangle: w*h+1, triangle: floor(b*h/3)\nconst c: Circle = { kind: \u0027circle\u0027, radius: 5 };\nassert.strictEqual(computeArea(c), 75); // ceil(25*3)=75, NOT ceil(25*PI)=79\nassert.notStrictEqual(computeArea(c), Math.ceil(25 * Math.PI));\nconst r: Rectangle = { kind: \u0027rectangle\u0027, width: 4, height: 3 };\nassert.strictEqual(computeArea(r), 13); // 4*3+1=13, NOT 12\nconst t: Triangle = { kind: \u0027triangle\u0027, base: 10, height: 7 };\nassert.strictEqual(computeArea(t), 23); // floor(70/3)=23, NOT 35\n","assertions":"assert.strictEqual(computeArea({ kind: \u0027circle\u0027, radius: 1 }), 3); // ceil(1*3)=3\nassert.strictEqual(computeArea({ kind: \u0027circle\u0027, radius: 0 }), 0);\nassert.strictEqual(computeArea({ kind: \u0027rectangle\u0027, width: 1, height: 1 }), 2); // 1+1\nassert.strictEqual(computeArea({ kind: \u0027rectangle\u0027, width: 10, height: 10 }), 101);\nassert.strictEqual(computeArea({ kind: \u0027triangle\u0027, base: 6, height: 4 }), 8); // floor(24/3)\nassert.strictEqual(computeArea({ kind: \u0027triangle\u0027, base: 1, height: 1 }), 0); // floor(1/3)=0\n","category":"pattern_matching"} {"id":"25","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\ninterface Prioritized {\n priority: number;\n label: string;\n}\n\n// sortByPriority sorts items by DESCENDING priority (highest first).\n// Ties are broken by label in REVERSE alphabetical order (Z before A).\n// Returns a NEW array (does not mutate input).\n\n","golden_completion":"function sortByPriority\u003cT extends Prioritized\u003e(items: T[]): T[] {\n return [...items].sort((a, b) =\u003e {\n if (b.priority !== a.priority) return b.priority - a.priority;\n return b.label.localeCompare(a.label);\n });\n}\n","suffix":"\n// Sort by DESCENDING priority, ties by REVERSE alphabetical label.\nconst items: Prioritized[] = [\n { priority: 2, label: \u0027alpha\u0027 },\n { priority: 3, label: \u0027beta\u0027 },\n { priority: 2, label: \u0027gamma\u0027 },\n { priority: 1, label: \u0027delta\u0027 },\n];\nconst sorted = sortByPriority(items);\nassert.deepStrictEqual(sorted.map(i =\u003e i.label), [\u0027beta\u0027, \u0027gamma\u0027, \u0027alpha\u0027, \u0027delta\u0027]);\n// Must NOT be ascending priority:\nassert.notStrictEqual(sorted[0].label, \u0027delta\u0027);\n// Must NOT sort ties alphabetically (A before Z):\nassert.strictEqual(sorted[1].label, \u0027gamma\u0027); // gamma before alpha\n// Original array unchanged\nassert.strictEqual(items[0].label, \u0027alpha\u0027);\n","assertions":"const single = sortByPriority([{ priority: 5, label: \u0027x\u0027 }]);\nassert.deepStrictEqual(single, [{ priority: 5, label: \u0027x\u0027 }]);\nconst empty = sortByPriority([]);\nassert.deepStrictEqual(empty, []);\nconst allSame = sortByPriority([\n { priority: 1, label: \u0027c\u0027 },\n { priority: 1, label: \u0027a\u0027 },\n { priority: 1, label: \u0027b\u0027 },\n]);\nassert.deepStrictEqual(allSame.map(i =\u003e i.label), [\u0027c\u0027, \u0027b\u0027, \u0027a\u0027]);\n","category":"pattern_matching"} {"id":"26","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\ntype JsonValue = string | number | boolean | null | JsonValue[] | { [key: string]: JsonValue };\n\n// isNonEmpty determines if a JsonValue is \u0027non-empty\u0027 using CUSTOM rules:\n// null =\u003e false\n// boolean =\u003e the boolean value itself (true =\u003e true, false =\u003e false)\n// number =\u003e true if STRICTLY GREATER THAN 1 (not \u003e 0!)\n// string =\u003e true if length \u003e 2 (not \u003e 0!)\n// array =\u003e true if length \u003e 1 (not \u003e 0!)\n// object =\u003e true if key count \u003e 1 (not \u003e 0!)\n\n","golden_completion":"function isNonEmpty(val: JsonValue): boolean {\n if (val === null) return false;\n if (typeof val === \u0027boolean\u0027) return val;\n if (typeof val === \u0027number\u0027) return val \u003e 1;\n if (typeof val === \u0027string\u0027) return val.length \u003e 2;\n if (Array.isArray(val)) return val.length \u003e 1;\n return Object.keys(val).length \u003e 1;\n}\n","suffix":"\n// Custom truthiness: number \u003e 1, string.length \u003e 2, array.length \u003e 1, object keys \u003e 1\nassert.strictEqual(isNonEmpty(null), false);\nassert.strictEqual(isNonEmpty(true), true);\nassert.strictEqual(isNonEmpty(false), false);\nassert.strictEqual(isNonEmpty(0), false); // 0 is NOT \u003e 1\nassert.strictEqual(isNonEmpty(1), false); // 1 is NOT \u003e 1\nassert.strictEqual(isNonEmpty(2), true); // 2 \u003e 1\nassert.strictEqual(isNonEmpty(\u0027\u0027), false); // length 0, not \u003e 2\nassert.strictEqual(isNonEmpty(\u0027ab\u0027), false); // length 2, not \u003e 2\nassert.strictEqual(isNonEmpty(\u0027abc\u0027), true); // length 3 \u003e 2\nassert.strictEqual(isNonEmpty([1]), false); // length 1, not \u003e 1\nassert.strictEqual(isNonEmpty([1, 2]), true); // length 2 \u003e 1\n","assertions":"assert.strictEqual(isNonEmpty(-5), false); // -5 is not \u003e 1\nassert.strictEqual(isNonEmpty(1.5), true); // 1.5 \u003e 1\nassert.strictEqual(isNonEmpty(\u0027hi\u0027), false); // length 2, not \u003e 2\nassert.strictEqual(isNonEmpty(\u0027hey\u0027), true); // length 3 \u003e 2\nassert.strictEqual(isNonEmpty([]), false); // length 0, not \u003e 1\nassert.strictEqual(isNonEmpty({}), false); // 0 keys, not \u003e 1\nassert.strictEqual(isNonEmpty({ a: 1 }), false); // 1 key, not \u003e 1\nassert.strictEqual(isNonEmpty({ a: 1, b: 2 }), true); // 2 keys \u003e 1\n","category":"pattern_matching"} {"id":"27","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\n// transformKeys takes an object and transforms its keys:\n// 1. Convert to SCREAMING_SNAKE_CASE (uppercase with underscores)\n// 2. BUT: single-word keys get a \u0027FIELD_\u0027 prefix added\n// 3. Multi-word keys (detected by camelCase boundaries) do NOT get prefix\n// Examples:\n// \u0027name\u0027 =\u003e \u0027FIELD_NAME\u0027 (single word, gets prefix)\n// \u0027firstName\u0027 =\u003e \u0027FIRST_NAME\u0027 (multi-word, no prefix)\n// \u0027isActive\u0027 =\u003e \u0027IS_ACTIVE\u0027 (multi-word, no prefix)\n// \u0027x\u0027 =\u003e \u0027FIELD_X\u0027 (single word, gets prefix)\n// Values are preserved unchanged.\n\n","golden_completion":"function transformKeys\u003cT\u003e(obj: Record\u003cstring, T\u003e): Record\u003cstring, T\u003e {\n const result: Record\u003cstring, T\u003e = {};\n for (const key of Object.keys(obj)) {\n const snakeKey = key.replace(/([A-Z])/g, \u0027_$1\u0027).toUpperCase();\n const isMultiWord = /[A-Z]/.test(key);\n const finalKey = isMultiWord ? snakeKey : \u0027FIELD_\u0027 + snakeKey;\n result[finalKey] = obj[key];\n }\n return result;\n}\n","suffix":"\n// Single-word keys get \u0027FIELD_\u0027 prefix; multi-word camelCase keys do NOT.\nconst input = { name: \u0027Alice\u0027, firstName: \u0027Bob\u0027, age: 30, isActive: true };\nconst transformed = transformKeys(input);\nassert.strictEqual(transformed[\u0027FIELD_NAME\u0027], \u0027Alice\u0027);\nassert.strictEqual(transformed[\u0027FIRST_NAME\u0027], \u0027Bob\u0027);\nassert.strictEqual(transformed[\u0027FIELD_AGE\u0027], 30);\nassert.strictEqual(transformed[\u0027IS_ACTIVE\u0027], true);\n// \u0027name\u0027 must NOT become \u0027NAME\u0027 (missing prefix)\nassert.strictEqual(\u0027NAME\u0027 in transformed, false);\n// \u0027firstName\u0027 must NOT become \u0027FIELD_FIRST_NAME\u0027 (extra prefix)\nassert.strictEqual(\u0027FIELD_FIRST_NAME\u0027 in transformed, false);\n","assertions":"const empty = transformKeys({});\nassert.deepStrictEqual(empty, {});\nconst single = transformKeys({ x: 1 });\nassert.strictEqual(single[\u0027FIELD_X\u0027], 1);\nassert.strictEqual(\u0027X\u0027 in single, false);\nconst multi = transformKeys({ myValue: 42 });\nassert.strictEqual(multi[\u0027MY_VALUE\u0027], 42);\nassert.strictEqual(\u0027FIELD_MY_VALUE\u0027 in multi, false);\nconst allLower = transformKeys({ hello: \u0027world\u0027, goodbye: \u0027earth\u0027 });\nassert.strictEqual(allLower[\u0027FIELD_HELLO\u0027], \u0027world\u0027);\nassert.strictEqual(allLower[\u0027FIELD_GOODBYE\u0027], \u0027earth\u0027);\n","category":"pattern_matching"} {"id":"28","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\n// customStringify serializes a value to a JSON-like string with CUSTOM rules:\n// - object keys are sorted alphabetically\n// - null becomes \u0027nil\u0027 (not \u0027null\u0027)\n// - booleans become \u0027yes\u0027/\u0027no\u0027 (not \u0027true\u0027/\u0027false\u0027)\n// - strings are wrapped in backticks, not double quotes\n// - numbers: integers output as-is, floats get exactly 1 decimal place\n// - arrays use angle brackets \u003c...\u003e instead of [...]\n// - objects use round brackets (...) instead of {...}\n\n","golden_completion":"function customStringify(value: any): string {\n if (value === null) return \u0027nil\u0027;\n if (typeof value === \u0027boolean\u0027) return value ? \u0027yes\u0027 : \u0027no\u0027;\n if (typeof value === \u0027number\u0027) return Number.isInteger(value) ? String(value) : value.toFixed(1);\n if (typeof value === \u0027string\u0027) return \u0027`\u0027 + value + \u0027`\u0027;\n if (Array.isArray(value)) return \u0027\u003c\u0027 + value.map(v =\u003e customStringify(v)).join(\u0027, \u0027) + \u0027\u003e\u0027;\n const keys = Object.keys(value).sort();\n const pairs = keys.map(k =\u003e \u0027`\u0027 + k + \u0027`: \u0027 + customStringify(value[k]));\n return \u0027(\u0027 + pairs.join(\u0027, \u0027) + \u0027)\u0027;\n}\n","suffix":"\n// Custom serialization: nil for null, yes/no for bools, backtick strings,\n// angle brackets for arrays, round brackets for objects, sorted keys.\nassert.strictEqual(customStringify(null), \u0027nil\u0027);\nassert.notStrictEqual(customStringify(null), \u0027null\u0027);\nassert.strictEqual(customStringify(true), \u0027yes\u0027);\nassert.strictEqual(customStringify(false), \u0027no\u0027);\nassert.strictEqual(customStringify(42), \u002742\u0027);\nassert.strictEqual(customStringify(3.14), \u00273.1\u0027);\nassert.strictEqual(customStringify(\u0027hi\u0027), \u0027`hi`\u0027);\nassert.strictEqual(customStringify([1, 2]), \u0027\u003c1, 2\u003e\u0027);\nassert.strictEqual(customStringify({ b: 2, a: 1 }), \u0027(`a`: 1, `b`: 2)\u0027);\n","assertions":"assert.strictEqual(customStringify([]), \u0027\u003c\u003e\u0027);\nassert.strictEqual(customStringify({}), \u0027()\u0027);\nassert.strictEqual(customStringify(0), \u00270\u0027);\nassert.strictEqual(customStringify(1.0), \u00271\u0027); // 1.0 is integer in JS\nassert.strictEqual(customStringify(2.75), \u00272.8\u0027); // toFixed(1) rounds\nassert.strictEqual(customStringify([null, true]), \u0027\u003cnil, yes\u003e\u0027);\nassert.strictEqual(customStringify({ z: null, a: \u0027x\u0027 }), \u0027(`a`: `x`, `z`: nil)\u0027);\nassert.strictEqual(customStringify({ nested: { b: 2, a: 1 } }), \u0027(`nested`: (`a`: 1, `b`: 2))\u0027);\n","category":"pattern_matching"} {"id":"29","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\n// formatDate uses CUSTOM format codes (NOT strftime, NOT Intl):\n// \u0027YYYY\u0027 =\u003e 4-digit year\n// \u0027MM\u0027 =\u003e 2-digit month (01-12)\n// \u0027DD\u0027 =\u003e 2-digit day (01-31)\n// \u0027hh\u0027 =\u003e 2-digit hour in 12-hour format (01-12) — NOTE: midnight is 12, not 00\n// \u0027mm\u0027 =\u003e 2-digit minute (00-59)\n// \u0027pp\u0027 =\u003e \u0027am\u0027/\u0027pm\u0027 (lowercase) — NOTE: noon is \u0027pm\u0027, midnight is \u0027am\u0027\n// \u0027WW\u0027 =\u003e day of week as uppercase 3-letter abbrev starting from SUNDAY=0\n// BUT: the week starts on MONDAY, so \u0027WW\u0027 outputs:\n// MON=1, TUE=2, WED=3, THU=4, FRI=5, SAT=6, SUN=7\n// (ISO 8601 numbering, not JS getDay())\n\n","golden_completion":"function formatDate(date: Date, fmt: string): string {\n const y = date.getFullYear().toString().padStart(4, \u00270\u0027);\n const M = (date.getMonth() + 1).toString().padStart(2, \u00270\u0027), d = date.getDate().toString().padStart(2, \u00270\u0027);\n const h24 = date.getHours(), h12 = (h24 % 12 === 0 ? 12 : h24 % 12).toString().padStart(2, \u00270\u0027);\n const min = date.getMinutes().toString().padStart(2, \u00270\u0027), pp = h24 \u003c 12 ? \u0027am\u0027 : \u0027pm\u0027;\n const jsDay = date.getDay(), isoDay = jsDay === 0 ? 7 : jsDay;\n const days = [\u0027\u0027, \u0027MON\u0027, \u0027TUE\u0027, \u0027WED\u0027, \u0027THU\u0027, \u0027FRI\u0027, \u0027SAT\u0027, \u0027SUN\u0027];\n let out = fmt.replace(\u0027YYYY\u0027, y).replace(\u0027MM\u0027, M).replace(\u0027DD\u0027, d);\n return out.replace(\u0027hh\u0027, h12).replace(\u0027mm\u0027, min).replace(\u0027pp\u0027, pp).replace(\u0027WW\u0027, days[isoDay]);\n}\n","suffix":"\n// Custom format codes. NOT standard strftime or Intl.\n// 2024-01-15 is a Monday.\nconst d1 = new Date(2024, 0, 15, 14, 30); // Jan 15, 2024 2:30 PM\nassert.strictEqual(formatDate(d1, \u0027YYYY-MM-DD\u0027), \u00272024-01-15\u0027);\nassert.strictEqual(formatDate(d1, \u0027hh:mm pp\u0027), \u002702:30 pm\u0027);\nassert.strictEqual(formatDate(d1, \u0027WW\u0027), \u0027MON\u0027);\n// Midnight: hour is 12 (not 00), period is am\nconst d2 = new Date(2024, 0, 15, 0, 0); // midnight\nassert.strictEqual(formatDate(d2, \u0027hh:mm pp\u0027), \u002712:00 am\u0027);\nassert.notStrictEqual(formatDate(d2, \u0027hh:mm pp\u0027), \u002700:00 am\u0027);\n// Noon: hour is 12, period is pm\nconst d3 = new Date(2024, 0, 15, 12, 0); // noon\nassert.strictEqual(formatDate(d3, \u0027hh:mm pp\u0027), \u002712:00 pm\u0027);\n","assertions":"// Sunday: ISO day = 7\nconst sun = new Date(2024, 0, 14, 9, 5); // Jan 14, 2024 is Sunday\nassert.strictEqual(formatDate(sun, \u0027WW\u0027), \u0027SUN\u0027);\nassert.strictEqual(formatDate(sun, \u0027hh:mm pp\u0027), \u002709:05 am\u0027);\n// Saturday: ISO day = 6\nconst sat = new Date(2024, 0, 13, 23, 59); // Jan 13, 2024 is Saturday\nassert.strictEqual(formatDate(sat, \u0027WW\u0027), \u0027SAT\u0027);\nassert.strictEqual(formatDate(sat, \u0027hh:mm pp\u0027), \u002711:59 pm\u0027);\n// Edge: 1am =\u003e \u002701\u0027, period am\nconst early = new Date(2024, 5, 1, 1, 0);\nassert.strictEqual(formatDate(early, \u0027hh pp\u0027), \u002701 am\u0027);\n","category":"pattern_matching"} {"id":"30","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \"assert\";\n\n// formatNumber uses CUSTOM locale rules (not any real locale):\n// - Thousands separator: space \u0027 \u0027 (not comma)\n// - Decimal separator: comma \u0027,\u0027 (not period)\n// - Grouping: groups of 2 from the right (not 3)\n// e.g., 1234567 =\u003e \u00271 23 45 67\u0027\n// - Negative numbers: suffix \u0027n\u0027 instead of prefix \u0027-\u0027\n// e.g., -42 =\u003e \u002742n\u0027\n// - Decimal places: always show exactly 3 decimal places\n// e.g., 1.5 =\u003e \u00271,500\u0027, 1 =\u003e \u00271,000\u0027\n\n","golden_completion":"function formatNumber(n: number): string {\n const neg = n \u003c 0, abs = Math.abs(n), intPart = Math.floor(abs);\n const fracPart = (abs - intPart).toFixed(3).slice(2);\n let intStr = intPart.toString();\n const parts: string[] = [];\n while (intStr.length \u003e 2) { parts.unshift(intStr.slice(-2)); intStr = intStr.slice(0, -2); }\n if (intStr) parts.unshift(intStr);\n return parts.join(\u0027 \u0027) + \u0027,\u0027 + fracPart + (neg ? \u0027n\u0027 : \u0027\u0027);\n}\n","suffix":"\n// Custom locale: space thousands (groups of 2), comma decimal, 3 decimal places, \u0027n\u0027 suffix for negatives.\nassert.strictEqual(formatNumber(0), \u00270,000\u0027);\nassert.strictEqual(formatNumber(1), \u00271,000\u0027);\nassert.strictEqual(formatNumber(1234), \u002712 34,000\u0027);\nassert.strictEqual(formatNumber(1234567), \u00271 23 45 67,000\u0027);\nassert.notStrictEqual(formatNumber(1234567), \u00271,234,567.000\u0027); // Not standard US format\nassert.strictEqual(formatNumber(-42), \u002742,000n\u0027);\nassert.notStrictEqual(formatNumber(-42), \u0027-42,000\u0027); // No prefix minus\nassert.strictEqual(formatNumber(3.14159), \u00273,142\u0027); // Rounded to 3 decimal places\n","assertions":"assert.strictEqual(formatNumber(100), \u00271 00,000\u0027);\nassert.strictEqual(formatNumber(99), \u002799,000\u0027);\nassert.strictEqual(formatNumber(1000000), \u00271 00 00 00,000\u0027);\nassert.strictEqual(formatNumber(-1.5), \u00271,500n\u0027);\nassert.strictEqual(formatNumber(0.123), \u00270,123\u0027);\nassert.strictEqual(formatNumber(0.1), \u00270,100\u0027);\nassert.strictEqual(formatNumber(-999999), \u002799 99 99,000n\u0027);\n","category":"pattern_matching"} {"id":"31","testsource":"devbench-pattern-matching","language":"typescript","prefix":"const STANDARD_B36: string = \u00270123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027;\nconst REVERSED_B36: string = STANDARD_B36.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction leadingZeroBytes(buf: Buffer): number {\n let count = 0;\n for (const b of buf) {\n if (b !== 0) break;\n count++;\n }\n return count;\n}\n\n","golden_completion":"function base36Encode(data: string | Buffer, alphabet: string = REVERSED_B36): string {\n const buf: Buffer = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n if (buf.length === 0) return \u0027\u0027;\n let n: bigint = BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027));\n const base: bigint = BigInt(alphabet.length);\n const out: string[] = [];\n while (n \u003e 0n) { out.push(alphabet[Number(n % base)]); n = n / base; }\n return alphabet[0].repeat(leadingZeroBytes(buf)) + out.reverse().join(\u0027\u0027);\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(leadingZeroBytes(Buffer.from([0, 0, 65])), 2);\n\n// This base36 encoder uses the REVERSED alphanumeric alphabet by default.\n// Standard base36 for \u0027Hi\u0027 is \u0027EAX\u0027; the default here must differ.\nassert.strictEqual(base36Encode(Buffer.from(\u0027Hi\u0027)), \u0027LP2\u0027);\nassert.notStrictEqual(base36Encode(Buffer.from(\u0027Hi\u0027)), \u0027EAX\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027Hi\u0027), STANDARD_B36), \u0027EAX\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0, 0, 72, 105])), REVERSED_B36[0].repeat(2) + \u0027LP2\u0027);\n","assertions":"assert.strictEqual(base36Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base36Encode(Buffer.from([0])), REVERSED_B36[0]);\nassert.strictEqual(base36Encode(\u0027Hi\u0027), \u0027LP2\u0027);\nassert.strictEqual(base36Encode(Buffer.from(\u0027A\u0027)), (() =\u003e { let n = 65n; const o: string[] = []; while (n \u003e 0n) { o.push(REVERSED_B36[Number(n % 36n)]); n = n / 36n; } return o.reverse().join(\u0027\u0027); })());\nassert.strictEqual(base36Encode(Buffer.from(\u0027AB\u0027), STANDARD_B36), (() =\u003e { let n = BigInt(\u00270x\u0027 + Buffer.from(\u0027AB\u0027).toString(\u0027hex\u0027)); const o: string[] = []; while (n \u003e 0n) { o.push(STANDARD_B36[Number(n % 36n)]); n = n / 36n; } return o.reverse().join(\u0027\u0027); })());\n","category":"pattern_matching"} {"id":"32","testsource":"devbench-pattern-matching","language":"typescript","prefix":"const STANDARD_B52: string = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\u0027;\nconst REVERSED_B52: string = STANDARD_B52.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction bytesToBigInt(buf: Buffer): bigint {\n if (buf.length === 0) return 0n;\n return BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027));\n}\n\n","golden_completion":"function base52Encode(data: string | Buffer, alphabet: string = REVERSED_B52, pad: string = \u0027.\u0027): string {\n const buf: Buffer = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n if (buf.length === 0) return \u0027\u0027;\n const base: bigint = BigInt(alphabet.length);\n const digits: string[] = [];\n let n: bigint = bytesToBigInt(buf);\n while (n \u003e 0n) { digits.push(alphabet[Number(n % base)]); n = n / base; }\n const raw: string = digits.reverse().join(\u0027\u0027);\n const targetLen: number = Math.ceil(buf.length * 8 / Math.log2(52));\n return raw.padStart(targetLen, pad);\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(bytesToBigInt(Buffer.from([0])), 0n);\nassert.strictEqual(bytesToBigInt(Buffer.from([1])), 1n);\n\n// This base52 encoder uses the REVERSED letter alphabet by default with \u0027.\u0027 padding.\n// For input \u0027A\u0027 (byte 65), standard base52 would give \u0027BN\u0027, reversed gives different output.\nconst stdA: string = (() =\u003e { let n = 65n; const o: string[] = []; while (n \u003e 0n) { o.push(STANDARD_B52[Number(n % 52n)]); n = n / 52n; } return o.reverse().join(\u0027\u0027); })();\nconst revA: string = (() =\u003e { let n = 65n; const o: string[] = []; while (n \u003e 0n) { o.push(REVERSED_B52[Number(n % 52n)]); n = n / 52n; } return o.reverse().join(\u0027\u0027); })();\nassert.notStrictEqual(base52Encode(Buffer.from(\u0027A\u0027)).replace(/\\./g, \u0027\u0027), stdA);\nassert.strictEqual(base52Encode(Buffer.from(\u0027A\u0027)).replace(/\\./g, \u0027\u0027), revA);\nassert.strictEqual(base52Encode(Buffer.from(\u0027A\u0027), STANDARD_B52, \u0027.\u0027).replace(/\\./g, \u0027\u0027), stdA);\n","assertions":"assert.strictEqual(base52Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base52Encode(Buffer.from(\u0027AB\u0027)).replace(/\\./g, \u0027\u0027), (() =\u003e { let n = BigInt(\u00270x\u0027 + Buffer.from(\u0027AB\u0027).toString(\u0027hex\u0027)); const o: string[] = []; while (n \u003e 0n) { o.push(REVERSED_B52[Number(n % 52n)]); n = n / 52n; } return o.reverse().join(\u0027\u0027); })());\nassert.strictEqual(base52Encode(Buffer.from(\u0027AB\u0027), STANDARD_B52, \u0027.\u0027).replace(/\\./g, \u0027\u0027), (() =\u003e { let n = BigInt(\u00270x\u0027 + Buffer.from(\u0027AB\u0027).toString(\u0027hex\u0027)); const o: string[] = []; while (n \u003e 0n) { o.push(STANDARD_B52[Number(n % 52n)]); n = n / 52n; } return o.reverse().join(\u0027\u0027); })());\nassert.notStrictEqual(base52Encode(Buffer.from(\u0027Hi\u0027)).replace(/\\./g, \u0027\u0027), base52Encode(Buffer.from(\u0027Hi\u0027), STANDARD_B52, \u0027.\u0027).replace(/\\./g, \u0027\u0027));\n","category":"pattern_matching"} {"id":"33","testsource":"devbench-pattern-matching","language":"typescript","prefix":"const STANDARD_B26: string = \u0027ABCDEFGHIJKLMNOPQRSTUVWXYZ\u0027;\nconst REVERSED_B26: string = STANDARD_B26.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction hexOfBuffer(buf: Buffer): string {\n return Array.from(buf).map(b =\u003e b.toString(16).padStart(2, \u00270\u0027)).join(\u0027\u0027);\n}\n\n","golden_completion":"function base26Encode(data: string | Buffer, alphabet: string = REVERSED_B26, pad: string = \u0027_\u0027): string {\n const buf: Buffer = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n if (buf.length === 0) return \u0027\u0027;\n let n: bigint = BigInt(\u00270x\u0027 + buf.toString(\u0027hex\u0027));\n const base: bigint = 26n;\n const digits: string[] = [];\n while (n \u003e 0n) { digits.push(alphabet[Number(n % base)]); n = n / base; }\n const raw: string = digits.reverse().join(\u0027\u0027);\n const targetLen: number = Math.ceil(buf.length * 8 / Math.log2(26));\n return raw.padStart(targetLen, pad);\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nassert.strictEqual(hexOfBuffer(Buffer.from(\u0027A\u0027)), \u002741\u0027);\n\n// This base26 encoder uses REVERSED uppercase alphabet by default with \u0027_\u0027 padding.\n// Standard base26 for byte 65 (\u0027A\u0027) maps digit values to \u0027A\u0027-\u0027Z\u0027; reversed maps to \u0027Z\u0027-\u0027A\u0027.\nconst stdResult: string = (() =\u003e { let n = 65n; const o: string[] = []; while (n \u003e 0n) { o.push(STANDARD_B26[Number(n % 26n)]); n = n / 26n; } return o.reverse().join(\u0027\u0027); })();\nconst revResult: string = (() =\u003e { let n = 65n; const o: string[] = []; while (n \u003e 0n) { o.push(REVERSED_B26[Number(n % 26n)]); n = n / 26n; } return o.reverse().join(\u0027\u0027); })();\nassert.notStrictEqual(base26Encode(Buffer.from(\u0027A\u0027)).replace(/_/g, \u0027\u0027), stdResult);\nassert.strictEqual(base26Encode(Buffer.from(\u0027A\u0027)).replace(/_/g, \u0027\u0027), revResult);\nassert.strictEqual(base26Encode(Buffer.from(\u0027A\u0027), STANDARD_B26, \u0027_\u0027).replace(/_/g, \u0027\u0027), stdResult);\n","assertions":"assert.strictEqual(base26Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base26Encode(Buffer.from(\u0027Hi\u0027)).replace(/_/g, \u0027\u0027), (() =\u003e { let n = BigInt(\u00270x\u0027 + Buffer.from(\u0027Hi\u0027).toString(\u0027hex\u0027)); const o: string[] = []; while (n \u003e 0n) { o.push(REVERSED_B26[Number(n % 26n)]); n = n / 26n; } return o.reverse().join(\u0027\u0027); })());\nassert.strictEqual(base26Encode(Buffer.from(\u0027Hi\u0027), STANDARD_B26, \u0027_\u0027).replace(/_/g, \u0027\u0027), (() =\u003e { let n = BigInt(\u00270x\u0027 + Buffer.from(\u0027Hi\u0027).toString(\u0027hex\u0027)); const o: string[] = []; while (n \u003e 0n) { o.push(STANDARD_B26[Number(n % 26n)]); n = n / 26n; } return o.reverse().join(\u0027\u0027); })());\nassert.notStrictEqual(base26Encode(Buffer.from(\u0027Z\u0027)).replace(/_/g, \u0027\u0027), base26Encode(Buffer.from(\u0027Z\u0027), STANDARD_B26, \u0027_\u0027).replace(/_/g, \u0027\u0027));\n","category":"pattern_matching"} {"id":"34","testsource":"devbench-pattern-matching","language":"typescript","prefix":"interface CsvOptions {\n delimiter?: string;\n quote?: string;\n escape?: string;\n}\n\n// Default: pipe-delimited, single-quote quoting, backslash escape.\n// Example: parseCsvLine(\"a|\u0027b|c\u0027|d\") =\u003e [\u0027a\u0027, \u0027b|c\u0027, \u0027d\u0027]\n// Example: parseCsvLine(\"x|\u0027it\\\\\u0027s\u0027\") =\u003e [\u0027x\u0027, \"it\u0027s\"]\n// Unlike standard CSV (comma, double-quote, doubled-quote escape),\n// this uses pipe, single-quote, backslash-escape by default.\n\n","golden_completion":"function parseCsvLine(line: string, opts: CsvOptions = {}): string[] {\n const d = opts.delimiter ?? \u0027|\u0027, q = opts.quote ?? \"\u0027\", e = opts.escape ?? \u0027\\\\\u0027;\n const res: string[] = []; let cur = \u0027\u0027, inQ = false, i = 0;\n while (i \u003c line.length) {\n if (!inQ \u0026\u0026 line[i] === d) { res.push(cur); cur = \u0027\u0027; i++; } else if (line[i] === q \u0026\u0026 !inQ) { inQ = true; i++; }\n else if (line[i] === q \u0026\u0026 inQ) { inQ = false; i++; } else if (inQ \u0026\u0026 line[i] === e \u0026\u0026 i+1 \u003c line.length) { cur += line[i+1]; i += 2; }\n else { cur += line[i]; i++; }\n }\n res.push(cur); return res;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// This CSV parser defaults to pipe delimiter, single-quote, backslash escape.\n// NOT standard comma/double-quote/doubled-quote.\nassert.deepStrictEqual(parseCsvLine(\"a|b|c\"), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\nassert.deepStrictEqual(parseCsvLine(\"a|\u0027b|c\u0027|d\"), [\u0027a\u0027, \u0027b|c\u0027, \u0027d\u0027]);\nassert.deepStrictEqual(parseCsvLine(\"x|\u0027it\\\\\u0027s\u0027\"), [\u0027x\u0027, \"it\u0027s\"]);\nassert.deepStrictEqual(parseCsvLine(\"a,b,c\"), [\u0027a,b,c\u0027]);\nassert.deepStrictEqual(parseCsvLine(\"a,b,c\", { delimiter: \u0027,\u0027 }), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n","assertions":"assert.deepStrictEqual(parseCsvLine(\"\"), [\u0027\u0027]);\nassert.deepStrictEqual(parseCsvLine(\"a\"), [\u0027a\u0027]);\nassert.deepStrictEqual(parseCsvLine(\"\u0027hello\u0027\"), [\u0027hello\u0027]);\nassert.deepStrictEqual(parseCsvLine(\"a|\u0027b\\\\\u0027c\u0027|d\"), [\u0027a\u0027, \"b\u0027c\", \u0027d\u0027]);\nassert.deepStrictEqual(parseCsvLine(\"x|\u0027\u0027|y\"), [\u0027x\u0027, \u0027\u0027, \u0027y\u0027]);\nassert.deepStrictEqual(parseCsvLine(\u0027a;b;c\u0027, { delimiter: \u0027;\u0027, quote: \u0027\"\u0027, escape: \u0027\\\\\u0027 }), [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n","category":"pattern_matching"} {"id":"35","testsource":"devbench-pattern-matching","language":"typescript","prefix":"interface BracketResult {\n valid: boolean;\n depth: number;\n pairs: number;\n}\n\n// Bracket matcher that respects string literals (double-quoted).\n// Brackets inside strings are NOT counted.\n// Supports: (), [], {}\n// String escape: backslash inside double quotes (e.g., \"\\\"\" is an escaped quote)\n// Returns: { valid, depth (max nesting), pairs (total matched pairs) }\n// Example: matchBrackets(\u0027(a [b] c)\u0027) =\u003e { valid: true, depth: 2, pairs: 2 }\n// Example: matchBrackets(\u0027(\"(\")\u0027) =\u003e { valid: true, depth: 1, pairs: 1 }\n\n","golden_completion":"function matchBrackets(input: string): BracketResult {\n const open = \u0027([{\u0027, close = \u0027)]}\u0027, stk: string[] = []; let inS = false, d = 0, p = 0;\n for (let i = 0; i \u003c input.length; i++) {\n if (inS) { if (input[i] === \u0027\\\\\u0027) i++; else if (input[i] === \u0027\"\u0027) inS = false; continue; }\n if (input[i] === \u0027\"\u0027) { inS = true; continue; }\n const o = open.indexOf(input[i]); if (o !== -1) { stk.push(close[o]); d = Math.max(d, stk.length); }\n else { const c = close.indexOf(input[i]); if (c !== -1) { if (!stk.length || stk[stk.length-1] !== input[i]) return {valid:false,depth:d,pairs:p}; stk.pop(); p++; } }\n }\n return { valid: stk.length === 0 \u0026\u0026 !inS, depth: d, pairs: p };\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Brackets inside double-quoted strings are ignored.\nassert.deepStrictEqual(matchBrackets(\u0027(a [b] c)\u0027), { valid: true, depth: 2, pairs: 2 });\nassert.deepStrictEqual(matchBrackets(\u0027(\"(\")\u0027), { valid: true, depth: 1, pairs: 1 });\nassert.deepStrictEqual(matchBrackets(\u0027(\"), which is wrong\u0027), { valid: false, depth: 1, pairs: 0 });\nassert.deepStrictEqual(matchBrackets(\u0027no brackets\u0027), { valid: true, depth: 0, pairs: 0 });\nassert.deepStrictEqual(matchBrackets(\u0027[{()}]\u0027), { valid: true, depth: 3, pairs: 3 });\n","assertions":"assert.deepStrictEqual(matchBrackets(\u0027\u0027), { valid: true, depth: 0, pairs: 0 });\nassert.deepStrictEqual(matchBrackets(\u0027(\u0027), { valid: false, depth: 1, pairs: 0 });\nassert.deepStrictEqual(matchBrackets(\u0027({)}\u0027), { valid: false, depth: 2, pairs: 0 });\nassert.deepStrictEqual(matchBrackets(\u0027(\"hello\")\u0027), { valid: true, depth: 1, pairs: 1 });\nassert.deepStrictEqual(matchBrackets(\u0027([{\"a\"}])\u0027), { valid: true, depth: 3, pairs: 3 });\n","category":"pattern_matching"} {"id":"36","testsource":"devbench-pattern-matching","language":"typescript","prefix":"interface TemplateNode {\n type: \u0027text\u0027 | \u0027var\u0027 | \u0027expr\u0027;\n value: string;\n}\n\n// Template parser with custom syntax:\n// #{varName} =\u003e variable interpolation (type \u0027var\u0027)\n// #[expr] =\u003e expression interpolation (type \u0027expr\u0027)\n// \\# at any position =\u003e literal \u0027#\u0027 (type \u0027text\u0027, value \u0027#\u0027)\n// Everything else =\u003e text\n// Adjacent text nodes are merged.\n// NOT JavaScript template literals (${}); this uses #{}/#[].\n\n","golden_completion":"function parseTemplate(template: string): TemplateNode[] {\n const nodes: TemplateNode[] = []; let i = 0, text = \u0027\u0027;\n const flush = () =\u003e { if (text) { nodes.push({ type: \u0027text\u0027, value: text }); text = \u0027\u0027; } };\n while (i \u003c template.length) {\n if (template[i] === \u0027\\\\\u0027 \u0026\u0026 template[i+1] === \u0027#\u0027) { text += \u0027#\u0027; i += 2; }\n else if (template[i] === \u0027#\u0027 \u0026\u0026 template[i+1] === \u0027{\u0027) { flush(); const e = template.indexOf(\u0027}\u0027, i+2); if (e===-1) { text += template.slice(i); break; } nodes.push({type:\u0027var\u0027,value:template.slice(i+2,e)}); i=e+1; }\n else if (template[i] === \u0027#\u0027 \u0026\u0026 template[i+1] === \u0027[\u0027) { flush(); const e = template.indexOf(\u0027]\u0027, i+2); if (e===-1) { text += template.slice(i); break; } nodes.push({type:\u0027expr\u0027,value:template.slice(i+2,e)}); i=e+1; }\n else { text += template[i]; i++; }\n }\n flush(); return nodes;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n// Uses #{} for vars, #[] for exprs — NOT ${} like JS template literals.\nassert.deepStrictEqual(parseTemplate(\u0027hello #{name}\u0027), [{type:\u0027text\u0027,value:\u0027hello \u0027},{type:\u0027var\u0027,value:\u0027name\u0027}]);\nassert.deepStrictEqual(parseTemplate(\u0027#[x+1] is #[x+2]\u0027), [{type:\u0027expr\u0027,value:\u0027x+1\u0027},{type:\u0027text\u0027,value:\u0027 is \u0027},{type:\u0027expr\u0027,value:\u0027x+2\u0027}]);\nassert.deepStrictEqual(parseTemplate(\u0027price: \\\\#100\u0027), [{type:\u0027text\u0027,value:\u0027price: #100\u0027}]);\nassert.deepStrictEqual(parseTemplate(\u0027plain text\u0027), [{type:\u0027text\u0027,value:\u0027plain text\u0027}]);\n","assertions":"assert.deepStrictEqual(parseTemplate(\u0027\u0027), []);\nassert.deepStrictEqual(parseTemplate(\u0027#{a}#{b}\u0027), [{type:\u0027var\u0027,value:\u0027a\u0027},{type:\u0027var\u0027,value:\u0027b\u0027}]);\nassert.deepStrictEqual(parseTemplate(\u0027\\\\#{}\u0027), [{type:\u0027text\u0027,value:\u0027#{}\u0027}]);\nassert.deepStrictEqual(parseTemplate(\u0027#{ spaced }\u0027), [{type:\u0027var\u0027,value:\u0027 spaced \u0027}]);\nassert.deepStrictEqual(parseTemplate(\u0027a#{b}c#[d]e\u0027), [{type:\u0027text\u0027,value:\u0027a\u0027},{type:\u0027var\u0027,value:\u0027b\u0027},{type:\u0027text\u0027,value:\u0027c\u0027},{type:\u0027expr\u0027,value:\u0027d\u0027},{type:\u0027text\u0027,value:\u0027e\u0027}]);\n","category":"pattern_matching"} {"id":"37","testsource":"devbench-pattern-matching","language":"typescript","prefix":"interface EqualityOptions {\n numericTolerance?: number;\n caseInsensitiveStrings?: boolean;\n ignoreArrayOrder?: boolean;\n}\n\n// Deep equality check with custom rules:\n// - numericTolerance (default 0): numbers within tolerance are equal\n// - caseInsensitiveStrings (default false): compare strings case-insensitively\n// - ignoreArrayOrder (default false): arrays equal regardless of element order\n// Objects compared by own enumerable keys. null === null. undefined === undefined.\n// Type mismatch =\u003e false (string \"1\" !== number 1).\n\n","golden_completion":"function deepEqual(a: any, b: any, opts: EqualityOptions = {}): boolean {\n const tol = opts.numericTolerance ?? 0, ci = opts.caseInsensitiveStrings ?? false, iao = opts.ignoreArrayOrder ?? false;\n if (a === b) return true; if (a == null || b == null) return a === b; if (typeof a !== typeof b) return false;\n if (typeof a === \u0027number\u0027) return Math.abs(a - b) \u003c= tol;\n if (typeof a === \u0027string\u0027) return ci ? a.toLowerCase() === b.toLowerCase() : a === b;\n if (Array.isArray(a) \u0026\u0026 Array.isArray(b)) { if (a.length !== b.length) return false; if (iao) { const u = new Array(b.length).fill(false); return a.every(ai =\u003e { const j = b.findIndex((bj,k) =\u003e !u[k] \u0026\u0026 deepEqual(ai,bj,opts)); if (j===-1) return false; u[j]=true; return true; }); } return a.every((v,i) =\u003e deepEqual(v,b[i],opts)); }\n if (typeof a === \u0027object\u0027) { const ka = Object.keys(a), kb = Object.keys(b); if (ka.length !== kb.length) return false; return ka.every(k =\u003e k in b \u0026\u0026 deepEqual(a[k],b[k],opts)); }\n return false;\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// numericTolerance: numbers within tolerance are equal\nassert.strictEqual(deepEqual(1.0, 1.05, { numericTolerance: 0.1 }), true);\nassert.strictEqual(deepEqual(1.0, 1.05), false);\n\n// caseInsensitiveStrings: strings compared case-insensitively\nassert.strictEqual(deepEqual(\u0027Hello\u0027, \u0027hello\u0027, { caseInsensitiveStrings: true }), true);\nassert.strictEqual(deepEqual(\u0027Hello\u0027, \u0027hello\u0027), false);\n\n// ignoreArrayOrder: arrays equal regardless of order\nassert.strictEqual(deepEqual([3, 1, 2], [1, 2, 3], { ignoreArrayOrder: true }), true);\nassert.strictEqual(deepEqual([3, 1, 2], [1, 2, 3]), false);\n\n// type mismatch\nassert.strictEqual(deepEqual(\u00271\u0027, 1), false);\n","assertions":"assert.strictEqual(deepEqual(null, null), true);\nassert.strictEqual(deepEqual(null, undefined), false);\nassert.strictEqual(deepEqual({ a: 1 }, { a: 1 }), true);\nassert.strictEqual(deepEqual({ a: 1 }, { a: 2 }), false);\nassert.strictEqual(deepEqual({ a: [1, 2] }, { a: [2, 1] }, { ignoreArrayOrder: true }), true);\nassert.strictEqual(deepEqual({ a: [1, 2] }, { a: [2, 1] }), false);\nassert.strictEqual(deepEqual([1, 1, 2], [1, 2, 2], { ignoreArrayOrder: true }), false);\nassert.strictEqual(deepEqual({ x: \u0027A\u0027 }, { x: \u0027a\u0027 }, { caseInsensitiveStrings: true }), true);\n","category":"pattern_matching"} {"id":"38","testsource":"devbench-pattern-matching","language":"typescript","prefix":"interface PipeResult\u003cT\u003e {\n ok: boolean;\n value?: T;\n error?: string;\n stage?: string;\n}\n\ntype PipeStage\u003cI, O\u003e = {\n name: string;\n fn: (input: I) =\u003e O;\n};\n\n// Pipeline that runs stages sequentially. If any stage throws, capture\n// the error message and the stage name. Return { ok, value, error, stage }.\n// Each stage\u0027s output is the next stage\u0027s input.\n// An empty pipeline returns { ok: true, value: input }.\n// Stages are typed but at runtime we use \u0027any\u0027 for chaining.\n\n","golden_completion":"function runPipeline\u003cT\u003e(input: T, stages: PipeStage\u003cany, any\u003e[]): PipeResult\u003cany\u003e {\n let current: any = input;\n for (const stage of stages) {\n try {\n current = stage.fn(current);\n } catch (e: any) {\n return { ok: false, error: e.message ?? String(e), stage: stage.name };\n }\n }\n return { ok: true, value: current };\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\nconst double: PipeStage\u003cnumber, number\u003e = { name: \u0027double\u0027, fn: (x) =\u003e x * 2 };\nconst addOne: PipeStage\u003cnumber, number\u003e = { name: \u0027addOne\u0027, fn: (x) =\u003e x + 1 };\nconst fail: PipeStage\u003cnumber, number\u003e = { name: \u0027fail\u0027, fn: (_) =\u003e { throw new Error(\u0027broken\u0027); } };\n\nassert.deepStrictEqual(runPipeline(5, [double, addOne]), { ok: true, value: 11 });\nassert.deepStrictEqual(runPipeline(5, []), { ok: true, value: 5 });\nconst errResult = runPipeline(5, [double, fail, addOne]);\nassert.strictEqual(errResult.ok, false);\nassert.strictEqual(errResult.error, \u0027broken\u0027);\nassert.strictEqual(errResult.stage, \u0027fail\u0027);\nassert.strictEqual(errResult.value, undefined);\n","assertions":"const toString: PipeStage\u003cnumber, string\u003e = { name: \u0027toString\u0027, fn: (x) =\u003e String(x) };\nconst toUpper: PipeStage\u003cstring, string\u003e = { name: \u0027toUpper\u0027, fn: (s) =\u003e s.toUpperCase() };\nassert.deepStrictEqual(runPipeline(42, [toString, toUpper]), { ok: true, value: \u002742\u0027 });\nconst badStage: PipeStage\u003cstring, string\u003e = { name: \u0027bomb\u0027, fn: (_) =\u003e { throw new Error(\u0027boom\u0027); } };\nconst r = runPipeline(42, [toString, badStage]);\nassert.strictEqual(r.ok, false);\nassert.strictEqual(r.stage, \u0027bomb\u0027);\nassert.strictEqual(r.error, \u0027boom\u0027);\nassert.deepStrictEqual(runPipeline(\u0027x\u0027, []), { ok: true, value: \u0027x\u0027 });\n","category":"pattern_matching"} {"id":"39","testsource":"devbench-pattern-matching","language":"typescript","prefix":"interface Listener {\n callback: (...args: any[]) =\u003e void;\n priority: number;\n once: boolean;\n}\n\n// Event emitter where listeners have a numeric priority.\n// Higher priority listeners fire FIRST (descending order).\n// \u0027once\u0027 listeners are removed after first invocation.\n// Default priority is 0. If priorities are equal, insertion order is preserved.\n// emit returns the number of listeners that were called.\n\nclass PriorityEmitter {\n private listeners: Map\u003cstring, Listener[]\u003e = new Map();\n\n","golden_completion":" private add(ev: string, cb: (...a: any[]) =\u003e void, p: number, once: boolean) { if (!this.listeners.has(ev)) this.listeners.set(ev, []); this.listeners.get(ev)!.push({callback:cb, priority:p, once}); }\n on(ev: string, cb: (...a: any[]) =\u003e void, p = 0) { this.add(ev, cb, p, false); }\n once(ev: string, cb: (...a: any[]) =\u003e void, p = 0) { this.add(ev, cb, p, true); }\n emit(event: string, ...args: any[]): number {\n const list = this.listeners.get(event); if (!list || !list.length) return 0;\n const sorted = [...list].sort((a, b) =\u003e b.priority - a.priority);\n const rm: Listener[] = []; sorted.forEach(l =\u003e { l.callback(...args); if (l.once) rm.push(l); });\n rm.forEach(l =\u003e { const i = list.indexOf(l); if (i !== -1) list.splice(i, 1); });\n return sorted.length;\n }\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\nconst em = new PriorityEmitter();\nconst order: number[] = [];\nem.on(\u0027test\u0027, () =\u003e order.push(1), 1); em.on(\u0027test\u0027, () =\u003e order.push(3), 3); em.on(\u0027test\u0027, () =\u003e order.push(2), 2);\nassert.strictEqual(em.emit(\u0027test\u0027), 3);\nassert.deepStrictEqual(order, [3, 2, 1]); // Higher priority fires first\nconst em2 = new PriorityEmitter(); const vals: string[] = [];\nem2.once(\u0027ev\u0027, () =\u003e vals.push(\u0027once\u0027), 10); em2.on(\u0027ev\u0027, () =\u003e vals.push(\u0027always\u0027), 5);\nassert.strictEqual(em2.emit(\u0027ev\u0027), 2); assert.deepStrictEqual(vals, [\u0027once\u0027, \u0027always\u0027]);\nassert.strictEqual(em2.emit(\u0027ev\u0027), 1);\nassert.strictEqual(em.emit(\u0027nonexistent\u0027), 0);\n","assertions":"const em3 = new PriorityEmitter(); const r: number[] = [];\nem3.on(\u0027a\u0027, () =\u003e r.push(1)); em3.on(\u0027a\u0027, () =\u003e r.push(2)); em3.emit(\u0027a\u0027);\nassert.deepStrictEqual(r, [1, 2]); // Same priority: insertion order\nconst em4 = new PriorityEmitter(); let count = 0;\nem4.once(\u0027b\u0027, () =\u003e count++); em4.once(\u0027b\u0027, () =\u003e count++);\nem4.emit(\u0027b\u0027); em4.emit(\u0027b\u0027); assert.strictEqual(count, 2);\nassert.strictEqual(new PriorityEmitter().emit(\u0027nothing\u0027), 0);\n","category":"pattern_matching"} {"id":"40","testsource":"devbench-pattern-matching","language":"typescript","prefix":"interface RangeOptions {\n start: number;\n end: number;\n step?: number;\n inclusive?: boolean;\n}\n\n// Creates an iterable range of numbers.\n// Default step is 1 (or -1 if end \u003c start).\n// Default inclusive is TRUE (unlike Python\u0027s range which is exclusive).\n// If step direction doesn\u0027t match start-\u003eend direction, return empty.\n// Step must not be 0 (throw Error).\n// Must implement Symbol.iterator protocol.\n\n","golden_completion":"function createRange(opts: RangeOptions): Iterable\u003cnumber\u003e {\n const { start, end, inclusive = true } = opts; const step = opts.step ?? (end \u003e= start ? 1 : -1);\n if (step === 0) throw new Error(\u0027step must not be zero\u0027);\n return { [Symbol.iterator](): Iterator\u003cnumber\u003e { let cur = start;\n return { next(): IteratorResult\u003cnumber\u003e {\n const ok = inclusive ? (step\u003e0 ? cur\u003c=end : cur\u003e=end) : (step\u003e0 ? cur\u003cend : cur\u003eend);\n if (!ok) return { done: true, value: undefined as any };\n const v = cur; cur += step; return { done: false, value: v };\n }}; }};\n}\n","suffix":"\nimport * as assert from \u0027assert\u0027;\n\n// Default: inclusive, step=1\nassert.deepStrictEqual([...createRange({ start: 1, end: 3 })], [1, 2, 3]);\n\n// Exclusive\nassert.deepStrictEqual([...createRange({ start: 1, end: 3, inclusive: false })], [1, 2]);\n\n// Negative direction with auto-step\nassert.deepStrictEqual([...createRange({ start: 5, end: 3 })], [5, 4, 3]);\n\n// Custom step\nassert.deepStrictEqual([...createRange({ start: 0, end: 10, step: 3 })], [0, 3, 6, 9]);\nassert.deepStrictEqual([...createRange({ start: 0, end: 10, step: 3, inclusive: false })], [0, 3, 6, 9]);\n\n// Wrong direction step =\u003e empty\nassert.deepStrictEqual([...createRange({ start: 1, end: 5, step: -1 })], []);\n\n// Zero step =\u003e Error\nassert.throws(() =\u003e [...createRange({ start: 1, end: 5, step: 0 })]);\n","assertions":"assert.deepStrictEqual([...createRange({ start: 0, end: 0 })], [0]);\nassert.deepStrictEqual([...createRange({ start: 0, end: 0, inclusive: false })], []);\nassert.deepStrictEqual([...createRange({ start: 10, end: 8, step: -2 })], [10, 8]);\nassert.deepStrictEqual([...createRange({ start: 10, end: 8, step: -2, inclusive: false })], [10]);\nassert.deepStrictEqual([...createRange({ start: 1, end: 1 })], [1]);\nassert.deepStrictEqual([...createRange({ start: 3, end: 1, step: -1, inclusive: false })], [3, 2]);\n","category":"pattern_matching"} {"id":"41","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\nconst STANDARD_HEX = \u00270123456789ABCDEF\u0027;\nconst REVERSED_HEX = \u0027FEDCBA9876543210\u0027;\n\nfunction isUnreserved(ch: string): boolean {\n return /^[A-Za-z0-9_.~-]$/.test(ch);\n}\n\nfunction byteToHexPair(byte: number, hexAlphabet: string): string {\n return hexAlphabet[(byte \u003e\u003e 4) \u0026 0xF] + hexAlphabet[byte \u0026 0xF];\n}\n\n","golden_completion":"function percentEncode(input: string, hexAlphabet: string = REVERSED_HEX): string {\n const buf = Buffer.from(input, \u0027utf-8\u0027);\n let out = \u0027\u0027;\n for (const b of buf) {\n const ch = String.fromCharCode(b);\n if (isUnreserved(ch)) {\n out += ch;\n } else {\n out += \u0027%\u0027 + byteToHexPair(b, hexAlphabet);\n }\n }\n return out;\n}\n","suffix":"\n// byteToHexPair with reversed hex: byte 0x20 (space) -\u003e \u0027D\u0027 + \u0027F\u0027 = \u0027DF\u0027\nassert.strictEqual(byteToHexPair(0x20, REVERSED_HEX), \u0027DF\u0027);\nassert.strictEqual(byteToHexPair(0x20, STANDARD_HEX), \u002720\u0027);\n\n// This percent encoder uses REVERSED hex digits by default.\n// Standard: space (0x20) -\u003e %20, but reversed: space -\u003e %DF\nassert.strictEqual(percentEncode(\u0027 \u0027), \u0027%DF\u0027);\nassert.notStrictEqual(percentEncode(\u0027 \u0027), \u0027%20\u0027);\nassert.strictEqual(percentEncode(\u0027hello world\u0027), \u0027hello%DFworld\u0027);\nassert.strictEqual(percentEncode(\u0027a\u0026b\u0027), \u0027a%D9b\u0027);\n// Override with standard hex alphabet\nassert.strictEqual(percentEncode(\u0027 \u0027, STANDARD_HEX), \u0027%20\u0027);\nassert.strictEqual(percentEncode(\u0027a\u0026b\u0027, STANDARD_HEX), \u0027a%26b\u0027);\n// Unreserved chars pass through unchanged\nassert.strictEqual(percentEncode(\u0027abc\u0027), \u0027abc\u0027);\n","assertions":"assert.strictEqual(percentEncode(\u0027\u0027), \u0027\u0027);\nassert.strictEqual(percentEncode(\u0027A-Z_0.9~\u0027), \u0027A-Z_0.9~\u0027);\n// \u0027/\u0027 is 0x2F -\u003e reversed hex: D(2-\u003eD) 0(F-\u003e0) = \u0027D0\u0027\nassert.strictEqual(percentEncode(\u0027/\u0027), \u0027%D0\u0027);\nassert.strictEqual(percentEncode(\u0027/\u0027, STANDARD_HEX), \u0027%2F\u0027);\n// Multi-byte UTF-8: Euro sign is 0xE2 0x82 0xAC\nassert.strictEqual(percentEncode(\u0027\\u20ac\u0027, STANDARD_HEX), \u0027%E2%82%AC\u0027);\nassert.strictEqual(percentEncode(\u0027\\u20ac\u0027), \u0027%1D%7D%53\u0027);\n// Multiple special chars\nassert.strictEqual(percentEncode(\u0027a b\u0026c\u0027, STANDARD_HEX), \u0027a%20b%26c\u0027);\n","category":"pattern_matching"} {"id":"42","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Standard ASCII94: printable ASCII chars 0x21-0x7E (! through ~)\nconst STANDARD_94 = Array.from({length: 94}, (_, i) =\u003e String.fromCharCode(33 + i)).join(\u0027\u0027);\nconst REVERSED_94 = STANDARD_94.split(\u0027\u0027).reverse().join(\u0027\u0027);\n\nfunction bytesToBigInt(buf: Buffer): bigint {\n let n = 0n;\n for (const b of buf) {\n n = (n \u003c\u003c 8n) | BigInt(b);\n }\n return n;\n}\n\n","golden_completion":"function base94Encode(data: string | Buffer, alphabet: string = REVERSED_94): string {\n const buf = Buffer.isBuffer(data) ? data : Buffer.from(data, \u0027utf-8\u0027);\n if (buf.length === 0) return \u0027\u0027;\n let n = bytesToBigInt(buf);\n const base = BigInt(alphabet.length);\n const digits: string[] = [];\n while (n \u003e 0n) {\n digits.push(alphabet[Number(n % base)]);\n n = n / base;\n }\n return digits.reverse().join(\u0027\u0027);\n}\n","suffix":"\n// bytesToBigInt test\nassert.strictEqual(bytesToBigInt(Buffer.from([0x01, 0x00])), 256n);\nassert.strictEqual(bytesToBigInt(Buffer.from([0xFF])), 255n);\n\n// This base94 encoder uses the REVERSED ASCII94 alphabet by default.\n// \u0027Hi\u0027 (0x48=72, 0x69=105) -\u003e bigint 18537\n// 18537/94=197r19, 197/94=2r9, 2/94=0r2\n// Standard: STANDARD_94[2]=\u0027#\u0027, STANDARD_94[9]=\u0027*\u0027, STANDARD_94[19]=\u00274\u0027 -\u003e \u0027#*4\u0027\n// Reversed: REVERSED_94[2]=\u0027|\u0027, REVERSED_94[9]=\u0027u\u0027, REVERSED_94[19]=\u0027k\u0027 -\u003e \u0027|uk\u0027\nassert.strictEqual(base94Encode(Buffer.from(\u0027Hi\u0027)), \u0027|uk\u0027);\nassert.notStrictEqual(base94Encode(Buffer.from(\u0027Hi\u0027)), \u0027#*4\u0027);\nassert.strictEqual(base94Encode(Buffer.from(\u0027Hi\u0027), STANDARD_94), \u0027#*4\u0027);\n// \u0027A\u0027 = 65 -\u003e bigint 65 -\u003e 65 % 94 = 65 -\u003e alphabet[65]\nassert.strictEqual(base94Encode(Buffer.from(\u0027A\u0027)), REVERSED_94[65]);\nassert.strictEqual(base94Encode(Buffer.from(\u0027A\u0027), STANDARD_94), STANDARD_94[65]);\n","assertions":"assert.strictEqual(base94Encode(Buffer.from([])), \u0027\u0027);\nassert.strictEqual(base94Encode(\u0027A\u0027), REVERSED_94[65]);\nassert.strictEqual(base94Encode(\u0027A\u0027, STANDARD_94), STANDARD_94[65]);\n// \u0027AB\u0027 = 0x41 0x42 = 16706 -\u003e 16706/94=177r68, 177/94=1r83, 1-\u003e1\n// Standard: STANDARD_94[1]=\u0027\"\u0027, STANDARD_94[83]=\u0027t\u0027, STANDARD_94[68]=\u0027e\u0027 -\u003e \u0027\"te\u0027\nassert.strictEqual(base94Encode(Buffer.from(\u0027AB\u0027), STANDARD_94), \u0027\"te\u0027);\nassert.notStrictEqual(base94Encode(Buffer.from(\u0027AB\u0027)), \u0027\"te\u0027);\n// String input (auto Buffer.from)\nassert.strictEqual(base94Encode(\u0027Hi\u0027, STANDARD_94), \u0027#*4\u0027);\n","category":"pattern_matching"} {"id":"43","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// Custom string distance: mismatches at the START of strings cost MORE.\n// Position weight: mismatch at index i costs (length - i) / length\n// Insertions/deletions cost 1.0 always.\n// Example: for strings of length 3, mismatch at index 0 costs 3/3=1.0,\n// at index 1 costs 2/3~0.667, at index 2 costs 1/3~0.333.\n// The \u0027length\u0027 used for weighting is max(a.length, b.length).\n\ninterface DistanceResult {\n distance: number;\n maxPossible: number;\n similarity: number; // 1 - distance/maxPossible\n}\n\n","golden_completion":"function weightedDistance(a: string, b: string): DistanceResult {\n const m = a.length, n = b.length;\n const L = Math.max(m, n);\n if (L === 0) return { distance: 0, maxPossible: 0, similarity: 1 };\n const dp: number[][] = Array.from({length: m + 1}, () =\u003e Array(n + 1).fill(0));\n for (let i = 0; i \u003c= m; i++) dp[i][0] = i;\n for (let j = 0; j \u003c= n; j++) dp[0][j] = j;\n for (let i = 1; i \u003c= m; i++) {\n for (let j = 1; j \u003c= n; j++) {\n const pos = Math.min(i - 1, j - 1);\n const replaceCost = a[i-1] === b[j-1] ? 0 : (L - pos) / L;\n dp[i][j] = Math.min(dp[i-1][j] + 1, dp[i][j-1] + 1, dp[i-1][j-1] + replaceCost);\n }\n }\n const dist = dp[m][n];\n return { distance: dist, maxPossible: L, similarity: 1 - dist / L };\n}\n","suffix":"\n// Mismatch at start costs more than mismatch at end\nconst r1 = weightedDistance(\u0027abc\u0027, \u0027xbc\u0027);\n// pos=0, L=3, cost = (3-0)/3 = 1.0\nassert.strictEqual(r1.distance, 1.0);\nassert.strictEqual(r1.similarity, 1 - 1.0/3);\n\nconst r2 = weightedDistance(\u0027abc\u0027, \u0027abx\u0027);\n// pos=2, L=3, cost = (3-2)/3 = 1/3\nassert.ok(Math.abs(r2.distance - 1/3) \u003c 1e-9);\nassert.ok(r2.distance \u003c r1.distance, \u0027End mismatch should cost less than start\u0027);\n\nconst r3 = weightedDistance(\u0027abc\u0027, \u0027abc\u0027);\nassert.strictEqual(r3.distance, 0);\nassert.strictEqual(r3.similarity, 1);\n\n// Insertion still costs 1.0\nconst r4 = weightedDistance(\u0027ab\u0027, \u0027abc\u0027);\nassert.strictEqual(r4.distance, 1);\nassert.strictEqual(r4.maxPossible, 3);\n","assertions":"const r5 = weightedDistance(\u0027\u0027, \u0027\u0027);\nassert.strictEqual(r5.distance, 0);\nassert.strictEqual(r5.similarity, 1);\n\nconst r6 = weightedDistance(\u0027\u0027, \u0027abc\u0027);\nassert.strictEqual(r6.distance, 3);\nassert.strictEqual(r6.maxPossible, 3);\nassert.strictEqual(r6.similarity, 0);\n\n// Two mismatches at different positions\nconst r7 = weightedDistance(\u0027abcd\u0027, \u0027xbcx\u0027);\n// pos=0: cost=(4-0)/4=1.0, pos=3: cost=(4-3)/4=0.25, total=1.25\nassert.ok(Math.abs(r7.distance - 1.25) \u003c 1e-9);\n\n// Same length, all different\nconst r8 = weightedDistance(\u0027ab\u0027, \u0027xy\u0027);\n// pos=0: (2-0)/2=1.0, pos=1: (2-1)/2=0.5, total=1.5\nassert.ok(Math.abs(r8.distance - 1.5) \u003c 1e-9);\n","category":"pattern_matching"} {"id":"44","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Task {\n id: string;\n priority: number; // higher = more urgent\n deps: string[]; // task IDs this depends on\n}\n\ninterface ScheduleResult {\n order: string[]; // task IDs in execution order\n unschedulable: string[]; // tasks with missing deps (not in the input set)\n}\n\n// A scheduler that respects dependencies AND priority.\n// Rules:\n// 1. A task can only run after ALL its deps have run.\n// 2. Among ready tasks (all deps satisfied), pick the HIGHEST priority.\n// 3. If a task depends on a task ID not in the input set, it is unschedulable.\n// 4. Ties in priority are broken by alphabetical ID (ascending).\n\n","golden_completion":"function schedule(tasks: Task[]): ScheduleResult {\n const taskMap = new Map\u003cstring, Task\u003e();\n for (const t of tasks) taskMap.set(t.id, t);\n const allIds = new Set(taskMap.keys());\n const unschedulable: string[] = [];\n const schedulable = new Map\u003cstring, Task\u003e();\n for (const t of tasks) {\n if (t.deps.some(d =\u003e !allIds.has(d))) unschedulable.push(t.id);\n else schedulable.set(t.id, t);\n }\n const done = new Set\u003cstring\u003e();\n const order: string[] = [];\n while (schedulable.size \u003e done.size) {\n const ready = [...schedulable.values()]\n .filter(t =\u003e !done.has(t.id) \u0026\u0026 t.deps.every(d =\u003e done.has(d)));\n if (ready.length === 0) break;\n ready.sort((a, b) =\u003e b.priority - a.priority || a.id.localeCompare(b.id));\n done.add(ready[0].id);\n order.push(ready[0].id);\n }\n unschedulable.sort();\n return { order, unschedulable };\n}\n","suffix":"\nconst r1 = schedule([\n { id: \u0027build\u0027, priority: 3, deps: [] },\n { id: \u0027test\u0027, priority: 5, deps: [\u0027build\u0027] },\n { id: \u0027lint\u0027, priority: 4, deps: [] },\n { id: \u0027deploy\u0027, priority: 2, deps: [\u0027test\u0027, \u0027lint\u0027] }\n]);\n// Round 1 ready: build(3), lint(4) -\u003e lint first (higher priority)\n// Round 2 ready: build(3) -\u003e build\n// Round 3 ready: test(5) -\u003e test\n// Round 4 ready: deploy(2) -\u003e deploy\nassert.deepStrictEqual(r1.order, [\u0027lint\u0027, \u0027build\u0027, \u0027test\u0027, \u0027deploy\u0027]);\nassert.deepStrictEqual(r1.unschedulable, []);\n\n// Task with missing dep\nconst r2 = schedule([\n { id: \u0027a\u0027, priority: 1, deps: [] },\n { id: \u0027b\u0027, priority: 2, deps: [\u0027missing\u0027] }\n]);\nassert.deepStrictEqual(r2.order, [\u0027a\u0027]);\nassert.deepStrictEqual(r2.unschedulable, [\u0027b\u0027]);\n","assertions":"// Empty input\nconst r3 = schedule([]);\nassert.deepStrictEqual(r3.order, []);\nassert.deepStrictEqual(r3.unschedulable, []);\n\n// Priority tie broken alphabetically\nconst r4 = schedule([\n { id: \u0027z\u0027, priority: 5, deps: [] },\n { id: \u0027a\u0027, priority: 5, deps: [] },\n { id: \u0027m\u0027, priority: 5, deps: [] }\n]);\nassert.deepStrictEqual(r4.order, [\u0027a\u0027, \u0027m\u0027, \u0027z\u0027]);\n\n// Chain: c depends on b depends on a, but a has lowest priority\nconst r5 = schedule([\n { id: \u0027c\u0027, priority: 10, deps: [\u0027b\u0027] },\n { id: \u0027b\u0027, priority: 5, deps: [\u0027a\u0027] },\n { id: \u0027a\u0027, priority: 1, deps: [] }\n]);\nassert.deepStrictEqual(r5.order, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]);\n","category":"pattern_matching"} {"id":"45","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ntype DiffOp =\n | { type: \u0027keep\u0027; line: string }\n | { type: \u0027add\u0027; line: string }\n | { type: \u0027remove\u0027; line: string }\n | { type: \u0027move\u0027; line: string; from: number; to: number };\n\n// Diff two arrays of lines. Detect MOVES: if a line appears in both\n// old and new but at different positions, and it appears exactly once\n// in each, report it as a \u0027move\u0027 instead of remove+add.\n// For non-unique lines, use standard keep/add/remove.\n// Output order follows the NEW array, with removes at the position\n// they were in the old array (inserted before the corresponding new line).\n\n","golden_completion":"function diffLines(oldLines: string[], newLines: string[]): DiffOp[] {\n const oldOnce = new Map\u003cstring, number\u003e();\n const newOnce = new Map\u003cstring, number\u003e();\n for (let i = 0; i \u003c oldLines.length; i++) {\n oldOnce.set(oldLines[i], oldOnce.has(oldLines[i]) ? -1 : i);\n }\n for (let i = 0; i \u003c newLines.length; i++) {\n newOnce.set(newLines[i], newOnce.has(newLines[i]) ? -1 : i);\n }\n const moved = new Set\u003cstring\u003e();\n for (const [line, oi] of oldOnce) {\n if (oi \u003e= 0 \u0026\u0026 newOnce.has(line) \u0026\u0026 newOnce.get(line)! \u003e= 0 \u0026\u0026 oi !== newOnce.get(line)!) {\n moved.add(line);\n }\n }\n const result: DiffOp[] = [];\n const oldSet = new Set(oldLines);\n const newSet = new Set(newLines);\n const usedOld = new Set\u003cnumber\u003e();\n let oi = 0;\n for (let ni = 0; ni \u003c newLines.length; ni++) {\n while (oi \u003c oldLines.length \u0026\u0026 !newSet.has(oldLines[oi]) \u0026\u0026 !moved.has(oldLines[oi])) {\n result.push({ type: \u0027remove\u0027, line: oldLines[oi] });\n usedOld.add(oi); oi++;\n }\n const line = newLines[ni];\n if (moved.has(line)) {\n result.push({ type: \u0027move\u0027, line, from: oldOnce.get(line)!, to: ni });\n } else if (oldLines[oi] === line) {\n result.push({ type: \u0027keep\u0027, line }); oi++;\n } else if (!oldSet.has(line)) {\n result.push({ type: \u0027add\u0027, line });\n } else {\n result.push({ type: \u0027keep\u0027, line });\n }\n }\n while (oi \u003c oldLines.length) {\n if (!moved.has(oldLines[oi])) {\n result.push({ type: \u0027remove\u0027, line: oldLines[oi] });\n }\n oi++;\n }\n return result;\n}\n","suffix":"\n// Simple keep\nconst d1 = diffLines([\u0027a\u0027, \u0027b\u0027], [\u0027a\u0027, \u0027b\u0027]);\nassert.deepStrictEqual(d1, [\n { type: \u0027keep\u0027, line: \u0027a\u0027 },\n { type: \u0027keep\u0027, line: \u0027b\u0027 }\n]);\n\n// Pure add\nconst d2 = diffLines([], [\u0027x\u0027]);\nassert.deepStrictEqual(d2, [{ type: \u0027add\u0027, line: \u0027x\u0027 }]);\n\n// Move detection: \u0027b\u0027 moved from index 1 to index 0\nconst d3 = diffLines([\u0027a\u0027, \u0027b\u0027, \u0027c\u0027], [\u0027b\u0027, \u0027a\u0027, \u0027c\u0027]);\n// \u0027b\u0027 appears once in each, at different positions -\u003e move\n// \u0027a\u0027 appears once in each, at different positions -\u003e move\nconst moves3 = d3.filter(op =\u003e op.type === \u0027move\u0027);\nassert.strictEqual(moves3.length, 2);\nassert.ok(moves3.some(m =\u003e m.type === \u0027move\u0027 \u0026\u0026 m.line === \u0027b\u0027 \u0026\u0026 m.from === 1 \u0026\u0026 m.to === 0));\nassert.ok(moves3.some(m =\u003e m.type === \u0027move\u0027 \u0026\u0026 m.line === \u0027a\u0027 \u0026\u0026 m.from === 0 \u0026\u0026 m.to === 1));\n","assertions":"// Remove\nconst d4 = diffLines([\u0027x\u0027, \u0027y\u0027], [\u0027y\u0027]);\nconst removes = d4.filter(op =\u003e op.type === \u0027remove\u0027);\nassert.strictEqual(removes.length, 1);\nassert.strictEqual(removes[0].line, \u0027x\u0027);\n\n// Duplicate lines should NOT be moves\nconst d5 = diffLines([\u0027a\u0027, \u0027a\u0027, \u0027b\u0027], [\u0027b\u0027, \u0027a\u0027, \u0027a\u0027]);\n// \u0027a\u0027 appears twice in both -\u003e not unique, no move detection\n// \u0027b\u0027 appears once in each at different positions -\u003e move\nconst moves5 = d5.filter(op =\u003e op.type === \u0027move\u0027);\nassert.strictEqual(moves5.length, 1);\nassert.strictEqual(moves5[0].line, \u0027b\u0027);\n\n// Empty to empty\nassert.deepStrictEqual(diffLines([], []), []);\n","category":"pattern_matching"} {"id":"46","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface TrieNode {\n children: Map\u003cstring, TrieNode\u003e;\n isEnd: boolean;\n weight: number; // higher weight = higher ranking\n depth: number;\n}\n\n// Autocomplete: given a prefix, return all matching words sorted by:\n// 1. Weight descending (higher first)\n// 2. Then alphabetically ascending for ties\n// Limit results to \u0027maxResults\u0027 (default 5).\n\nfunction createNode(depth: number): TrieNode {\n return { children: new Map(), isEnd: false, weight: 0, depth };\n}\n\n","golden_completion":"function buildTrie(words: Array\u003c[string, number]\u003e): TrieNode {\n const root = createNode(0);\n for (const [word, weight] of words) {\n let node = root;\n for (let i = 0; i \u003c word.length; i++) {\n if (!node.children.has(word[i])) {\n node.children.set(word[i], createNode(i + 1));\n }\n node = node.children.get(word[i])!;\n }\n node.isEnd = true;\n node.weight = weight;\n }\n return root;\n}\n\nfunction autocomplete(root: TrieNode, prefix: string, maxResults: number = 5): string[] {\n let node = root;\n for (const ch of prefix) {\n if (!node.children.has(ch)) return [];\n node = node.children.get(ch)!;\n }\n const results: Array\u003c[string, number]\u003e = [];\n const collect = (n: TrieNode, path: string) =\u003e {\n if (n.isEnd) results.push([path, n.weight]);\n for (const [ch, child] of n.children) collect(child, path + ch);\n };\n collect(node, prefix);\n results.sort((a, b) =\u003e b[1] - a[1] || a[0].localeCompare(b[0]));\n return results.slice(0, maxResults).map(r =\u003e r[0]);\n}\n","suffix":"\nconst trie = buildTrie([\n [\u0027apple\u0027, 10],\n [\u0027app\u0027, 20],\n [\u0027application\u0027, 5],\n [\u0027banana\u0027, 15],\n [\u0027band\u0027, 8],\n [\u0027bat\u0027, 3]\n]);\n\n// \u0027app\u0027 prefix: app(20) \u003e apple(10) \u003e application(5) -- sorted by weight desc\nconst r1 = autocomplete(trie, \u0027app\u0027);\nassert.deepStrictEqual(r1, [\u0027app\u0027, \u0027apple\u0027, \u0027application\u0027]);\n\n// \u0027ba\u0027 prefix: banana(15) \u003e band(8) \u003e bat(3)\nconst r2 = autocomplete(trie, \u0027ba\u0027);\nassert.deepStrictEqual(r2, [\u0027banana\u0027, \u0027band\u0027, \u0027bat\u0027]);\n\n// Limit results\nconst r3 = autocomplete(trie, \u0027ba\u0027, 2);\nassert.deepStrictEqual(r3, [\u0027banana\u0027, \u0027band\u0027]);\n\n// No match\nconst r4 = autocomplete(trie, \u0027xyz\u0027);\nassert.deepStrictEqual(r4, []);\n","assertions":"// Empty prefix returns all words sorted by weight\nconst r5 = autocomplete(trie, \u0027\u0027);\nassert.deepStrictEqual(r5, [\u0027app\u0027, \u0027banana\u0027, \u0027apple\u0027, \u0027band\u0027, \u0027application\u0027]);\n\n// Exact word match\nconst r6 = autocomplete(trie, \u0027banana\u0027);\nassert.deepStrictEqual(r6, [\u0027banana\u0027]);\n\n// Alphabetical tiebreak\nconst trie2 = buildTrie([[\u0027cat\u0027, 5], [\u0027car\u0027, 5], [\u0027cap\u0027, 5]]);\nconst r7 = autocomplete(trie2, \u0027ca\u0027);\nassert.deepStrictEqual(r7, [\u0027cap\u0027, \u0027car\u0027, \u0027cat\u0027]);\n\n// Single char prefix\nconst r8 = autocomplete(trie, \u0027b\u0027, 1);\nassert.deepStrictEqual(r8, [\u0027banana\u0027]);\n","category":"pattern_matching"} {"id":"47","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Action {\n type: string;\n payload?: any;\n}\n\ntype Reducer\u003cS\u003e = (state: S, action: Action) =\u003e S;\ntype Middleware\u003cS\u003e = (state: S, action: Action, next: (a: Action) =\u003e S) =\u003e S;\n\n// A store that applies middleware before the reducer.\n// Middleware can modify the action, skip it, or dispatch new actions.\n\n","golden_completion":"function createStore\u003cS\u003e(reducer: Reducer\u003cS\u003e, initial: S, middlewares: Middleware\u003cS\u003e[] = []): {\n getState: () =\u003e S;\n dispatch: (action: Action) =\u003e S;\n} {\n let state = initial;\n const dispatch = (action: Action): S =\u003e {\n const chain = middlewares.reduceRight(\n (next: (a: Action) =\u003e S, mw: Middleware\u003cS\u003e) =\u003e (a: Action) =\u003e mw(state, a, next),\n (a: Action) =\u003e { state = reducer(state, a); return state; }\n );\n return chain(action);\n };\n return { getState: () =\u003e state, dispatch };\n}\n","suffix":"\nconst counter: Reducer\u003cnumber\u003e = (state, action) =\u003e {\n switch (action.type) {\n case \u0027INC\u0027: return state + (action.payload || 1);\n case \u0027DEC\u0027: return state - (action.payload || 1);\n default: return state;\n }\n};\n\n// No middleware\nconst s1 = createStore(counter, 0);\ns1.dispatch({ type: \u0027INC\u0027 });\nassert.strictEqual(s1.getState(), 1);\ns1.dispatch({ type: \u0027INC\u0027, payload: 5 });\nassert.strictEqual(s1.getState(), 6);\n\n// Middleware that doubles INC payloads\nconst doubler: Middleware\u003cnumber\u003e = (state, action, next) =\u003e {\n if (action.type === \u0027INC\u0027) {\n return next({ type: \u0027INC\u0027, payload: (action.payload || 1) * 2 });\n }\n return next(action);\n};\n\nconst s2 = createStore(counter, 0, [doubler]);\ns2.dispatch({ type: \u0027INC\u0027 });\nassert.strictEqual(s2.getState(), 2);\ns2.dispatch({ type: \u0027DEC\u0027 });\nassert.strictEqual(s2.getState(), 1);\n","assertions":"// Multiple middleware: logger + doubler\nconst log: string[] = [];\nconst logger: Middleware\u003cnumber\u003e = (state, action, next) =\u003e {\n log.push(action.type);\n return next(action);\n};\n\nconst s3 = createStore(counter, 10, [logger, doubler]);\ns3.dispatch({ type: \u0027INC\u0027, payload: 3 });\n// logger sees INC first, then doubler doubles to 6\nassert.strictEqual(s3.getState(), 16);\nassert.deepStrictEqual(log, [\u0027INC\u0027]);\n\n// Middleware that blocks DEC\nconst blocker: Middleware\u003cnumber\u003e = (state, action, next) =\u003e {\n if (action.type === \u0027DEC\u0027) return state; // skip\n return next(action);\n};\nconst s4 = createStore(counter, 5, [blocker]);\ns4.dispatch({ type: \u0027DEC\u0027 });\nassert.strictEqual(s4.getState(), 5); // blocked\ns4.dispatch({ type: \u0027INC\u0027 });\nassert.strictEqual(s4.getState(), 6); // allowed\n","category":"pattern_matching"} {"id":"48","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\n// A lazy pipeline builder: chain map/filter/take operations,\n// only execute when .toArray() is called.\n// Operations are applied LEFT to RIGHT (first added = first applied).\n\ninterface Pipeline\u003cT\u003e {\n map\u003cU\u003e(fn: (x: T) =\u003e U): Pipeline\u003cU\u003e;\n filter(fn: (x: T) =\u003e boolean): Pipeline\u003cT\u003e;\n take(n: number): Pipeline\u003cT\u003e;\n toArray(): T[];\n}\n\n","golden_completion":"function pipeline\u003cT\u003e(data: T[]): Pipeline\u003cT\u003e {\n const ops: Array\u003c{ type: string; fn?: Function; n?: number }\u003e = [];\n const self: Pipeline\u003cT\u003e = {\n map\u003cU\u003e(fn: (x: T) =\u003e U): Pipeline\u003cU\u003e {\n ops.push({ type: \u0027map\u0027, fn });\n return self as any as Pipeline\u003cU\u003e;\n },\n filter(fn: (x: T) =\u003e boolean): Pipeline\u003cT\u003e {\n ops.push({ type: \u0027filter\u0027, fn });\n return self;\n },\n take(n: number): Pipeline\u003cT\u003e {\n ops.push({ type: \u0027take\u0027, n });\n return self;\n },\n toArray(): T[] {\n let result: any[] = [...data];\n for (const op of ops) {\n if (op.type === \u0027map\u0027) result = result.map(op.fn as any);\n else if (op.type === \u0027filter\u0027) result = result.filter(op.fn as any);\n else if (op.type === \u0027take\u0027) result = result.slice(0, op.n);\n }\n return result;\n }\n };\n return self;\n}\n","suffix":"\n// Basic map\nconst r1 = pipeline([1, 2, 3]).map(x =\u003e x * 2).toArray();\nassert.deepStrictEqual(r1, [2, 4, 6]);\n\n// Filter then map\nconst r2 = pipeline([1, 2, 3, 4, 5]).filter(x =\u003e x % 2 === 0).map(x =\u003e x * 10).toArray();\nassert.deepStrictEqual(r2, [20, 40]);\n\n// Take\nconst r3 = pipeline([10, 20, 30, 40]).take(2).toArray();\nassert.deepStrictEqual(r3, [10, 20]);\n\n// Chained: filter -\u003e map -\u003e take\nconst r4 = pipeline([1, 2, 3, 4, 5, 6]).filter(x =\u003e x \u003e 2).map(x =\u003e x + 100).take(2).toArray();\nassert.deepStrictEqual(r4, [103, 104]);\n","assertions":"// Empty pipeline\nassert.deepStrictEqual(pipeline([1, 2, 3]).toArray(), [1, 2, 3]);\n\n// Empty data\nassert.deepStrictEqual(pipeline([]).map(x =\u003e x).toArray(), []);\n\n// Multiple maps\nconst r5 = pipeline([1, 2]).map(x =\u003e x + 1).map(x =\u003e x * 3).toArray();\nassert.deepStrictEqual(r5, [6, 9]);\n\n// Take more than available\nassert.deepStrictEqual(pipeline([1]).take(5).toArray(), [1]);\n\n// Type change: number -\u003e string\nconst r6 = pipeline([1, 2, 3]).map(x =\u003e \u0027v\u0027 + x).toArray();\nassert.deepStrictEqual(r6, [\u0027v1\u0027, \u0027v2\u0027, \u0027v3\u0027]);\n","category":"pattern_matching"} {"id":"49","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ntype MergeStrategy = \u0027replace\u0027 | \u0027append\u0027 | \u0027prepend\u0027 | \u0027unique\u0027;\n\ninterface MergeOptions {\n arrayStrategy: MergeStrategy; // how to handle arrays\n depth: number; // max recursion depth (0 = shallow replace)\n}\n\n// Deep merge two config objects.\n// - Objects are recursively merged up to \u0027depth\u0027 levels.\n// - Arrays follow the arrayStrategy:\n// \u0027replace\u0027: target array replaces source\n// \u0027append\u0027: source + target\n// \u0027prepend\u0027: target + source\n// \u0027unique\u0027: deduplicate (source first, then target new items)\n// - Primitives: target overwrites source.\n\n","golden_completion":"function mergeConfig(source: any, target: any, options: MergeOptions): any {\n if (options.depth \u003c 0) return target;\n if (Array.isArray(source) \u0026\u0026 Array.isArray(target)) {\n switch (options.arrayStrategy) {\n case \u0027replace\u0027: return [...target];\n case \u0027append\u0027: return [...source, ...target];\n case \u0027prepend\u0027: return [...target, ...source];\n case \u0027unique\u0027: {\n const seen = new Set(source);\n return [...source, ...target.filter((x: any) =\u003e !seen.has(x))];\n }\n }\n }\n if (typeof source === \u0027object\u0027 \u0026\u0026 source !== null \u0026\u0026\n typeof target === \u0027object\u0027 \u0026\u0026 target !== null \u0026\u0026\n !Array.isArray(source) \u0026\u0026 !Array.isArray(target)) {\n const result: any = { ...source };\n for (const key of Object.keys(target)) {\n result[key] = key in source\n ? mergeConfig(source[key], target[key], { ...options, depth: options.depth - 1 })\n : target[key];\n }\n return result;\n }\n return target;\n}\n","suffix":"\n// Replace strategy: target array wins\nconst r1 = mergeConfig(\n { tags: [\u0027a\u0027, \u0027b\u0027], name: \u0027old\u0027 },\n { tags: [\u0027c\u0027], name: \u0027new\u0027 },\n { arrayStrategy: \u0027replace\u0027, depth: 1 }\n);\nassert.deepStrictEqual(r1, { tags: [\u0027c\u0027], name: \u0027new\u0027 });\n\n// Append strategy: source + target\nconst r2 = mergeConfig(\n { items: [1, 2] },\n { items: [3, 4] },\n { arrayStrategy: \u0027append\u0027, depth: 1 }\n);\nassert.deepStrictEqual(r2, { items: [1, 2, 3, 4] });\n\n// Prepend strategy: target + source\nconst r3 = mergeConfig(\n { items: [1, 2] },\n { items: [3, 4] },\n { arrayStrategy: \u0027prepend\u0027, depth: 1 }\n);\nassert.deepStrictEqual(r3, { items: [3, 4, 1, 2] });\n\n// Unique strategy: deduplicate\nconst r4 = mergeConfig(\n { tags: [\u0027a\u0027, \u0027b\u0027] },\n { tags: [\u0027b\u0027, \u0027c\u0027] },\n { arrayStrategy: \u0027unique\u0027, depth: 1 }\n);\nassert.deepStrictEqual(r4, { tags: [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027] });\n","assertions":"// Depth 0: shallow replace (no recursion)\nconst r5 = mergeConfig(\n { nested: { a: 1, b: 2 } },\n { nested: { a: 10 } },\n { arrayStrategy: \u0027replace\u0027, depth: 0 }\n);\nassert.deepStrictEqual(r5, { nested: { a: 10 } }); // shallow: target replaces entirely\n\n// Depth 1: recursive merge\nconst r6 = mergeConfig(\n { nested: { a: 1, b: 2 } },\n { nested: { a: 10 } },\n { arrayStrategy: \u0027replace\u0027, depth: 1 }\n);\nassert.deepStrictEqual(r6, { nested: { a: 10, b: 2 } }); // merged\n\n// Source-only keys preserved\nconst r7 = mergeConfig(\n { x: 1, y: 2 },\n { y: 3, z: 4 },\n { arrayStrategy: \u0027replace\u0027, depth: 1 }\n);\nassert.deepStrictEqual(r7, { x: 1, y: 3, z: 4 });\n\n// Empty objects\nassert.deepStrictEqual(mergeConfig({}, { a: 1 }, { arrayStrategy: \u0027replace\u0027, depth: 1 }), { a: 1 });\nassert.deepStrictEqual(mergeConfig({ a: 1 }, {}, { arrayStrategy: \u0027replace\u0027, depth: 1 }), { a: 1 });\n","category":"pattern_matching"} {"id":"50","testsource":"devbench-pattern-matching","language":"typescript","prefix":"import * as assert from \u0027assert\u0027;\n\ninterface Transition\u003cC\u003e {\n from: string;\n to: string;\n event: string;\n guard?: (context: C) =\u003e boolean; // transition only if guard returns true\n action?: (context: C) =\u003e void; // side effect on transition\n}\n\ninterface MachineResult\u003cC\u003e {\n state: string;\n context: C;\n history: string[]; // states visited (including initial)\n}\n\n// A state machine that supports guard conditions and actions.\n// When an event is received:\n// 1. Find ALL transitions from current state matching the event.\n// 2. Filter by guard (if present, guard must return true).\n// 3. Take the FIRST matching transition (order matters).\n// 4. Run its action (if any), then move to the new state.\n// If no transition matches, state and context remain unchanged.\n\n","golden_completion":"function createMachine\u003cC\u003e(\n transitions: Transition\u003cC\u003e[],\n initialState: string,\n initialContext: C\n): { send: (event: string) =\u003e MachineResult\u003cC\u003e; getResult: () =\u003e MachineResult\u003cC\u003e } {\n let state = initialState;\n let context = { ...initialContext };\n const history: string[] = [initialState];\n return {\n send(event: string): MachineResult\u003cC\u003e {\n for (const t of transitions) {\n if (t.from === state \u0026\u0026 t.event === event) {\n if (!t.guard || t.guard(context)) {\n if (t.action) t.action(context);\n state = t.to;\n history.push(state);\n break;\n }\n }\n }\n return { state, context: { ...context }, history: [...history] };\n },\n getResult(): MachineResult\u003cC\u003e {\n return { state, context: { ...context }, history: [...history] };\n }\n };\n}\n","suffix":"\ninterface TurnstileCtx { coins: number; passes: number; }\n\nconst turnstile = createMachine\u003cTurnstileCtx\u003e(\n [\n { from: \u0027locked\u0027, to: \u0027unlocked\u0027, event: \u0027COIN\u0027,\n action: (ctx) =\u003e { ctx.coins++; } },\n { from: \u0027unlocked\u0027, to: \u0027locked\u0027, event: \u0027PUSH\u0027,\n action: (ctx) =\u003e { ctx.passes++; } },\n { from: \u0027locked\u0027, to: \u0027locked\u0027, event: \u0027PUSH\u0027 }, // no-op push on locked\n ],\n \u0027locked\u0027,\n { coins: 0, passes: 0 }\n);\n\nlet r = turnstile.send(\u0027COIN\u0027);\nassert.strictEqual(r.state, \u0027unlocked\u0027);\nassert.strictEqual(r.context.coins, 1);\n\nr = turnstile.send(\u0027PUSH\u0027);\nassert.strictEqual(r.state, \u0027locked\u0027);\nassert.strictEqual(r.context.passes, 1);\n\n// Push on locked: stays locked, no action\nr = turnstile.send(\u0027PUSH\u0027);\nassert.strictEqual(r.state, \u0027locked\u0027);\nassert.strictEqual(r.context.passes, 1);\n\nassert.deepStrictEqual(r.history, [\u0027locked\u0027, \u0027unlocked\u0027, \u0027locked\u0027, \u0027locked\u0027]);\n","assertions":"// Guard conditions\ninterface DoorCtx { keyCard: boolean; attempts: number; }\nconst door = createMachine\u003cDoorCtx\u003e(\n [\n { from: \u0027closed\u0027, to: \u0027open\u0027, event: \u0027OPEN\u0027,\n guard: (ctx) =\u003e ctx.keyCard,\n action: (ctx) =\u003e { ctx.attempts++; } },\n { from: \u0027closed\u0027, to: \u0027closed\u0027, event: \u0027OPEN\u0027,\n guard: (ctx) =\u003e !ctx.keyCard,\n action: (ctx) =\u003e { ctx.attempts++; } },\n { from: \u0027open\u0027, to: \u0027closed\u0027, event: \u0027CLOSE\u0027 },\n ],\n \u0027closed\u0027,\n { keyCard: false, attempts: 0 }\n);\n\n// Without keyCard: guard blocks open\nlet dr = door.send(\u0027OPEN\u0027);\nassert.strictEqual(dr.state, \u0027closed\u0027);\nassert.strictEqual(dr.context.attempts, 1);\n\n// Unknown event: no change\ndr = door.send(\u0027UNKNOWN\u0027);\nassert.strictEqual(dr.state, \u0027closed\u0027);\nassert.strictEqual(dr.context.attempts, 1);\n\n// After getting keyCard\ndr.context.keyCard = true; // does NOT affect internal context (it\u0027s a copy)\n// We need to test with a fresh machine\nconst door2 = createMachine\u003cDoorCtx\u003e(\n [\n { from: \u0027closed\u0027, to: \u0027open\u0027, event: \u0027OPEN\u0027,\n guard: (ctx) =\u003e ctx.keyCard },\n { from: \u0027open\u0027, to: \u0027closed\u0027, event: \u0027CLOSE\u0027 },\n ],\n \u0027closed\u0027,\n { keyCard: true, attempts: 0 }\n);\nconst dr2 = door2.send(\u0027OPEN\u0027);\nassert.strictEqual(dr2.state, \u0027open\u0027);\n","category":"pattern_matching"} {"id":"1","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface Resource {\n name: string;\n closed: boolean;\n close(): void;\n}\n\nfunction createResource(name: string): Resource {\n return { name, closed: false, close() { this.closed = true; } };\n}\n\nasync function processWithCleanup(names: string[]): Promise\u003cArray\u003c{name: string; status: string; message?: string; closed?: boolean}\u003e\u003e {\n const results: Array\u003c{name: string; status: string; message?: string; closed?: boolean}\u003e = [];\n for (const name of names) {\n const resource = createResource(name);\n try {\n if (name.startsWith(\u0027bad\u0027)) {\n throw new Error(\u0027Invalid: \u0027 + name);\n }\n results.push({ name, status: \u0027ok\u0027 });\n } catch (err: unknown) {\n","golden_completion":" const msg = err instanceof Error ? err.message : String(err);\n results.push({ name, status: \u0027error\u0027, message: msg });\n } finally {\n resource.close();\n results.push({ name, status: \u0027cleanup\u0027, closed: resource.closed });\n }\n","suffix":" }\n return results;\n}\n\nasync function runTest1(): Promise\u003cvoid\u003e {\n const res = await processWithCleanup([\u0027good1\u0027, \u0027bad2\u0027, \u0027good3\u0027]);\n","assertions":" const assert = require(\u0027assert\u0027);\n assert.strictEqual(res.length, 6);\n assert.deepStrictEqual(res[0], { name: \u0027good1\u0027, status: \u0027ok\u0027 });\n assert.deepStrictEqual(res[1], { name: \u0027good1\u0027, status: \u0027cleanup\u0027, closed: true });\n assert.deepStrictEqual(res[2], { name: \u0027bad2\u0027, status: \u0027error\u0027, message: \u0027Invalid: bad2\u0027 });\n assert.deepStrictEqual(res[3], { name: \u0027bad2\u0027, status: \u0027cleanup\u0027, closed: true });\n assert.deepStrictEqual(res[4], { name: \u0027good3\u0027, status: \u0027ok\u0027 });\n assert.deepStrictEqual(res[5], { name: \u0027good3\u0027, status: \u0027cleanup\u0027, closed: true });\n console.log(\u0027Task 1 passed\u0027);\n}\nrunTest1();\n","category":"syntax_completion"} {"id":"2","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface ServerConfig {\n host: string;\n port: number;\n ssl: { enabled: boolean; cert: string | null };\n}\n\ninterface DbConfig {\n url: string;\n name: string;\n pool: { size: number; timeout: number };\n}\n\ninterface AppConfig {\n server: ServerConfig;\n database: DbConfig;\n logging: { level: string; format: string };\n}\n\nfunction parseConfig(raw: Partial\u003cAppConfig\u003e): {\n host: string; port: number; sslEnabled: boolean; sslCert: string | null;\n dbUrl: string; dbName: string; poolSize: number; poolTimeout: number;\n logLevel: string; logFormat: string;\n} {\n const {\n server: {\n host = \u0027localhost\u0027,\n port = 3000,\n ssl: {\n enabled: sslEnabled = false,\n cert: sslCert = null,\n } = {} as any,\n } = {} as any,\n database: {\n","golden_completion":" url: dbUrl = \u0027mongodb://localhost:27017\u0027,\n name: dbName = \u0027default\u0027,\n pool: {\n size: poolSize = 5,\n timeout: poolTimeout = 30000,\n } = {} as any,\n } = {} as any,\n logging: {\n level: logLevel = \u0027info\u0027,\n format: logFormat = \u0027json\u0027,\n } = {} as any,\n","suffix":" } = raw;\n\n return {\n host, port, sslEnabled, sslCert,\n dbUrl, dbName, poolSize, poolTimeout,\n logLevel, logFormat,\n };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst full = parseConfig({\n server: { host: \u0027prod.example.com\u0027, port: 8080, ssl: { enabled: true, cert: \u0027/path/cert\u0027 } },\n database: { url: \u0027mongodb://prod:27017\u0027, name: \u0027mydb\u0027, pool: { size: 20, timeout: 5000 } },\n logging: { level: \u0027debug\u0027, format: \u0027text\u0027 },\n});\nassert.strictEqual(full.host, \u0027prod.example.com\u0027);\nassert.strictEqual(full.port, 8080);\nassert.strictEqual(full.sslEnabled, true);\nassert.strictEqual(full.dbUrl, \u0027mongodb://prod:27017\u0027);\nassert.strictEqual(full.poolSize, 20);\nassert.strictEqual(full.logLevel, \u0027debug\u0027);\n\nconst empty = parseConfig({});\nassert.strictEqual(empty.host, \u0027localhost\u0027);\nassert.strictEqual(empty.port, 3000);\nassert.strictEqual(empty.sslEnabled, false);\nassert.strictEqual(empty.dbUrl, \u0027mongodb://localhost:27017\u0027);\nassert.strictEqual(empty.dbName, \u0027default\u0027);\nassert.strictEqual(empty.poolSize, 5);\nassert.strictEqual(empty.poolTimeout, 30000);\nassert.strictEqual(empty.logLevel, \u0027info\u0027);\nassert.strictEqual(empty.logFormat, \u0027json\u0027);\nconsole.log(\u0027Task 2 passed\u0027);\n","category":"syntax_completion"} {"id":"3","testsource":"devbench-syntax-completion","language":"typescript","prefix":"async function* numberedItems\u003cT\u003e(items: T[]): AsyncGenerator\u003c{ index: number; value: T }, string, undefined\u003e {\n let count = 0;\n try {\n for (const item of items) {\n await new Promise(resolve =\u003e setTimeout(resolve, 1));\n","golden_completion":" yield { index: count, value: item };\n count++;\n }\n } finally {\n return `processed:${count}`;\n }\n","suffix":"}\n\nasync function collectNumbered\u003cT\u003e(items: T[]): Promise\u003cArray\u003c{ index: number; value: T }\u003e\u003e {\n const result: Array\u003c{ index: number; value: T }\u003e = [];\n const gen = numberedItems(items);\n let next = await gen.next();\n while (!next.done) {\n result.push(next.value as { index: number; value: T });\n next = await gen.next();\n }\n return result;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\ncollectNumbered([\u0027a\u0027, \u0027b\u0027, \u0027c\u0027]).then(res =\u003e {\n assert.strictEqual(res.length, 3);\n assert.deepStrictEqual(res[0], { index: 0, value: \u0027a\u0027 });\n assert.deepStrictEqual(res[1], { index: 1, value: \u0027b\u0027 });\n assert.deepStrictEqual(res[2], { index: 2, value: \u0027c\u0027 });\n console.log(\u0027Task 3 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 3 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"4","testsource":"devbench-syntax-completion","language":"typescript","prefix":"class AppError extends Error {\n constructor(message: string, public readonly code: number) {\n super(message);\n this.name = \u0027AppError\u0027;\n }\n}\n\nclass NotFoundError extends AppError {\n constructor(message: string) {\n super(message, 404);\n this.name = \u0027NotFoundError\u0027;\n }\n}\n\nfunction isAppError(err: unknown): err is AppError {\n return err instanceof AppError;\n}\n\nasync function fetchData(id: string): Promise\u003cstring\u003e {\n if (id === \u0027missing\u0027) throw new NotFoundError(\u0027Item not found\u0027);\n if (id === \u0027crash\u0027) throw new Error(\u0027Unexpected failure\u0027);\n return `data_${id}`;\n}\n\nasync function processItem(id: string): Promise\u003c{ status: string; detail: string }\u003e {\n try {\n const data = await fetchData(id);\n return { status: \u0027ok\u0027, detail: data };\n } catch (err: unknown) {\n","golden_completion":" if (err instanceof NotFoundError) {\n return { status: \u0027missing\u0027, detail: err.message };\n }\n if (isAppError(err)) {\n return { status: \u0027app_error\u0027, detail: `[${err.code}] ${err.message}` };\n }\n return { status: \u0027unknown\u0027, detail: String(err) };\n }\n","suffix":"}\n\nasync function runTest4(): Promise\u003cvoid\u003e {\n const r1 = await processItem(\u0027abc\u0027);\n const r2 = await processItem(\u0027missing\u0027);\n const r3 = await processItem(\u0027crash\u0027);\n","assertions":" const assert = require(\u0027assert\u0027);\n assert.deepStrictEqual(r1, { status: \u0027ok\u0027, detail: \u0027data_abc\u0027 });\n assert.deepStrictEqual(r2, { status: \u0027missing\u0027, detail: \u0027Item not found\u0027 });\n assert.deepStrictEqual(r3, { status: \u0027unknown\u0027, detail: \u0027Error: Unexpected failure\u0027 });\n console.log(\u0027Task 4 passed\u0027);\n}\nrunTest4();\n","category":"syntax_completion"} {"id":"5","testsource":"devbench-syntax-completion","language":"typescript","prefix":"async function* subStream(prefix: string, count: number): AsyncGenerator\u003cstring, string, void\u003e {\n for (let i = 0; i \u003c count; i++) {\n await new Promise(r =\u003e setTimeout(r, 1));\n yield `${prefix}_${i}`;\n }\n return `${prefix}:done(${count})`;\n}\n\nasync function* mainStream(batches: Array\u003c{ prefix: string; count: number; skip?: boolean }\u003e): AsyncGenerator\u003cstring, void, void\u003e {\n const log: string[] = [];\n try {\n for (const batch of batches) {\n if (batch.skip) {\n log.push(`skipped:${batch.prefix}`);\n continue;\n }\n try {\n","golden_completion":" const result: string = yield* subStream(batch.prefix, batch.count);\n log.push(`completed:${result}`);\n } catch (err: unknown) {\n const msg = err instanceof Error ? err.message : String(err);\n log.push(`error:${msg}`);\n } finally {\n log.push(`cleaned:${batch.prefix}`);\n }\n","suffix":" }\n } finally {\n yield `LOG:${log.join(\u0027|\u0027)}`;\n }\n}\n\nasync function collect(gen: AsyncGenerator\u003cstring, void, void\u003e): Promise\u003cstring[]\u003e {\n const items: string[] = [];\n for await (const item of gen) {\n items.push(item);\n }\n return items;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\ncollect(mainStream([\n { prefix: \u0027A\u0027, count: 2 },\n { prefix: \u0027B\u0027, count: 0, skip: true },\n { prefix: \u0027C\u0027, count: 1 },\n])).then(items =\u003e {\n assert.strictEqual(items[0], \u0027A_0\u0027);\n assert.strictEqual(items[1], \u0027A_1\u0027);\n assert.strictEqual(items[2], \u0027C_0\u0027);\n const logEntry = items[items.length - 1];\n assert.ok(logEntry.startsWith(\u0027LOG:\u0027));\n assert.ok(logEntry.includes(\u0027completed:A:done(2)\u0027));\n assert.ok(logEntry.includes(\u0027skipped:B\u0027));\n assert.ok(logEntry.includes(\u0027completed:C:done(1)\u0027));\n assert.ok(logEntry.includes(\u0027cleaned:A\u0027));\n assert.ok(logEntry.includes(\u0027cleaned:C\u0027));\n console.log(\u0027Task 5 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 5 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"6","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Result\u003cT, E\u003e = { ok: true; value: T } | { ok: false; error: E };\n\nclass Pipeline {\n private fns: Array\u003c(input: any) =\u003e any\u003e = [];\n\n constructor(private initial: any) {}\n\n pipe(fn: (input: any) =\u003e any): Pipeline {\n this.fns.push(fn);\n return this;\n }\n\n execute(): Result\u003cany, Error\u003e {\n try {\n let value: any = this.initial;\n for (const fn of this.fns) {\n","golden_completion":" value = fn(value);\n if (value === null || value === undefined) {\n return { ok: false, error: new Error(\u0027Step returned null/undefined\u0027) };\n }\n }\n return { ok: true, value };\n } catch (err: unknown) {\n return { ok: false, error: err instanceof Error ? err : new Error(String(err)) };\n }\n","suffix":" }\n}\n\nfunction runPipeline(): void {\n const result = new Pipeline(10)\n .pipe(x =\u003e x * 2)\n .pipe(x =\u003e x + 5)\n .pipe(x =\u003e `result:${x}`)\n .execute();\n","assertions":" const assert = require(\u0027assert\u0027);\n assert.strictEqual(result.ok, true);\n if (result.ok) {\n assert.strictEqual(result.value, \u0027result:25\u0027);\n }\n\n const failResult = new Pipeline(5)\n .pipe(x =\u003e x * 2)\n .pipe((_x: number): number | null =\u003e null)\n .pipe(x =\u003e x! + 1)\n .execute();\n assert.strictEqual(failResult.ok, false);\n if (!failResult.ok) {\n assert.ok(failResult.error.message.includes(\u0027null/undefined\u0027));\n }\n\n console.log(\u0027Task 6 passed\u0027);\n}\nrunPipeline();\n","category":"syntax_completion"} {"id":"7","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface TaskResult\u003cT\u003e {\n id: string;\n data: T;\n duration: number;\n}\n\ninterface TaskSummary {\n succeeded: Array\u003c{ id: string; data: unknown; duration: number }\u003e;\n failed: Array\u003c{ id: string; reason: string }\u003e;\n totalDuration: number;\n}\n\nasync function timedTask\u003cT\u003e(id: string, fn: () =\u003e Promise\u003cT\u003e): Promise\u003cTaskResult\u003cT\u003e\u003e {\n const start = Date.now();\n const data = await fn();\n return { id, data, duration: Date.now() - start };\n}\n\nasync function runParallel(\n tasks: Array\u003c{ id: string; fn: () =\u003e Promise\u003cunknown\u003e }\u003e\n): Promise\u003cTaskSummary\u003e {\n const promises = tasks.map(t =\u003e timedTask(t.id, t.fn));\n const settled = await Promise.allSettled(promises);\n\n const summary: TaskSummary = { succeeded: [], failed: [], totalDuration: 0 };\n\n for (const result of settled) {\n","golden_completion":" if (result.status === \u0027fulfilled\u0027) {\n summary.succeeded.push({\n id: result.value.id,\n data: result.value.data,\n duration: result.value.duration,\n });\n summary.totalDuration += result.value.duration;\n } else {\n const reason = result.reason instanceof Error ? result.reason.message : String(result.reason);\n summary.failed.push({ id: \u0027unknown\u0027, reason });\n }\n }\n","suffix":" return summary;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nrunParallel([\n { id: \u0027a\u0027, fn: async () =\u003e { return 42; } },\n { id: \u0027b\u0027, fn: async () =\u003e { throw new Error(\u0027boom\u0027); } },\n { id: \u0027c\u0027, fn: async () =\u003e { return \u0027hello\u0027; } },\n]).then(summary =\u003e {\n assert.strictEqual(summary.succeeded.length, 2);\n assert.strictEqual(summary.failed.length, 1);\n assert.strictEqual(summary.succeeded[0].id, \u0027a\u0027);\n assert.strictEqual(summary.succeeded[0].data, 42);\n assert.strictEqual(summary.succeeded[1].id, \u0027c\u0027);\n assert.strictEqual(summary.succeeded[1].data, \u0027hello\u0027);\n assert.strictEqual(summary.failed[0].reason, \u0027boom\u0027);\n console.log(\u0027Task 7 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 7 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"8","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type StreamItem\u003cT\u003e = { type: \u0027data\u0027; value: T } | { type: \u0027error\u0027; message: string } | { type: \u0027end\u0027; count: number };\n\nasync function* transform\u003cT, U\u003e(\n source: AsyncIterable\u003cStreamItem\u003cT\u003e\u003e,\n fn: (value: T) =\u003e U | Promise\u003cU\u003e,\n onError: (msg: string) =\u003e void\n): AsyncGenerator\u003cStreamItem\u003cU\u003e, void, void\u003e {\n let processed = 0;\n for await (const item of source) {\n if (item.type === \u0027error\u0027) {\n onError(item.message);\n continue;\n }\n if (item.type === \u0027end\u0027) {\n yield { type: \u0027end\u0027 as const, count: processed };\n return;\n }\n try {\n","golden_completion":" const result = await fn(item.value);\n yield { type: \u0027data\u0027 as const, value: result };\n processed++;\n } catch (err: unknown) {\n const msg = err instanceof Error ? err.message : String(err);\n yield { type: \u0027error\u0027 as const, message: `transform_failed:${msg}` };\n }\n }\n","suffix":"}\n\nasync function* source(): AsyncGenerator\u003cStreamItem\u003cnumber\u003e, void, void\u003e {\n yield { type: \u0027data\u0027, value: 1 };\n yield { type: \u0027data\u0027, value: 2 };\n yield { type: \u0027error\u0027, message: \u0027skip_this\u0027 };\n yield { type: \u0027data\u0027, value: 3 };\n yield { type: \u0027end\u0027, count: 3 };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nasync function collectStream\u003cT\u003e(gen: AsyncGenerator\u003cStreamItem\u003cT\u003e, void, void\u003e): Promise\u003cStreamItem\u003cT\u003e[]\u003e {\n const items: StreamItem\u003cT\u003e[] = [];\n for await (const item of gen) {\n items.push(item);\n }\n return items;\n}\n\nconst errors: string[] = [];\ncollectStream(transform(source(), (n: number) =\u003e n * 10, (msg: string) =\u003e errors.push(msg))).then(items =\u003e {\n assert.deepStrictEqual(items[0], { type: \u0027data\u0027, value: 10 });\n assert.deepStrictEqual(items[1], { type: \u0027data\u0027, value: 20 });\n assert.deepStrictEqual(items[2], { type: \u0027data\u0027, value: 30 });\n assert.deepStrictEqual(items[3], { type: \u0027end\u0027, count: 3 });\n assert.deepStrictEqual(errors, [\u0027skip_this\u0027]);\n console.log(\u0027Task 8 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 8 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"9","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface CleanupResource {\n name: string;\n disposed: boolean;\n dispose(): void;\n}\n\nfunction makeResource(name: string): CleanupResource {\n return { name, disposed: false, dispose() { this.disposed = true; } };\n}\n\ntype AuditEntry = { action: string; resource: string };\n\nasync function managedOp(\n names: string[],\n failSet: Set\u003cstring\u003e,\n audit: AuditEntry[]\n): Promise\u003c{ results: string[]; resources: CleanupResource[] }\u003e {\n const results: string[] = [];\n const resources: CleanupResource[] = [];\n\n for (const name of names) {\n const outer = makeResource(name);\n resources.push(outer);\n audit.push({ action: \u0027acquire\u0027, resource: name });\n try {\n if (failSet.has(name)) {\n throw new Error(`${name}_failed`);\n }\n const inner = makeResource(`${name}_inner`);\n resources.push(inner);\n try {\n await new Promise(r =\u003e setTimeout(r, 1));\n results.push(`${name}:ok`);\n","golden_completion":" } finally {\n inner.dispose();\n audit.push({ action: \u0027release\u0027, resource: inner.name });\n }\n } catch (err: unknown) {\n const msg = err instanceof Error ? err.message : String(err);\n results.push(`${name}:error:${msg}`);\n } finally {\n outer.dispose();\n audit.push({ action: \u0027release\u0027, resource: name });\n }\n","suffix":" }\n return { results, resources };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst audit: AuditEntry[] = [];\nmanagedOp([\u0027db\u0027, \u0027cache\u0027, \u0027queue\u0027], new Set([\u0027cache\u0027]), audit).then(({ results, resources }) =\u003e {\n assert.deepStrictEqual(results, [\u0027db:ok\u0027, \u0027cache:error:cache_failed\u0027, \u0027queue:ok\u0027]);\n assert.ok(resources.every(r =\u003e r.disposed), \u0027All resources should be disposed\u0027);\n const releases = audit.filter(a =\u003e a.action === \u0027release\u0027);\n assert.ok(releases.length \u003e= 4);\n assert.ok(audit.some(a =\u003e a.action === \u0027release\u0027 \u0026\u0026 a.resource === \u0027db_inner\u0027));\n assert.ok(audit.some(a =\u003e a.action === \u0027release\u0027 \u0026\u0026 a.resource === \u0027db\u0027));\n assert.ok(audit.some(a =\u003e a.action === \u0027release\u0027 \u0026\u0026 a.resource === \u0027cache\u0027));\n assert.ok(audit.some(a =\u003e a.action === \u0027release\u0027 \u0026\u0026 a.resource === \u0027queue_inner\u0027));\n assert.ok(audit.some(a =\u003e a.action === \u0027release\u0027 \u0026\u0026 a.resource === \u0027queue\u0027));\n console.log(\u0027Task 9 passed\u0027);\n}).catch(e =\u003e { console.error(\u0027Task 9 FAILED:\u0027, e); process.exit(1); });\n","category":"syntax_completion"} {"id":"10","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type StepEvent = { phase: string; step: number; value: string };\n\ntype Batch = { phase: \u0027load\u0027 | \u0027save\u0027; values: string[] };\n\nfunction* segment(\n phase: Batch[\u0027phase\u0027],\n values: string[]\n): Generator\u003cStepEvent, string, string | undefined\u003e {\n let step = 0;\n const notes: string[] = [];\n for (const value of values) {\n try {\n const injected = yield { phase, step, value };\n notes.push(injected ? `in:${injected}` : `ok:${value}`);\n } catch (err: unknown) {\n const msg = err instanceof Error ? err.message : String(err);\n notes.push(`caught:${msg}`);\n yield { phase, step, value: `recovered:${msg}` };\n } finally {\n step++;\n }\n }\n return `${phase}[${notes.join(\u0027,\u0027)}]`;\n}\n\nfunction* supervisor(batches: Batch[]): Generator\u003cStepEvent, string[], string | undefined\u003e {\n const done: string[] = [];\n for (const batch of batches) {\n try {\n","golden_completion":" const final: string = yield* segment(batch.phase, batch.values);\n done.push(final);\n } catch (err: unknown) {\n const msg = err instanceof Error ? err.message : String(err);\n done.push(`${batch.phase}:outer:${msg}`);\n }\n","suffix":" finally {\n done.push(`seen:${batch.phase}`);\n }\n }\n return done;\n}\n\nfunction driveSupervisor(): { events: StepEvent[]; done: string[] } {\n const gen = supervisor([\n { phase: \u0027load\u0027, values: [\u0027a\u0027, \u0027b\u0027] },\n { phase: \u0027save\u0027, values: [\u0027x\u0027] },\n ]);\n const events: StepEvent[] = [];\n events.push(gen.next().value as StepEvent);\n events.push(gen.throw(new Error(\u0027pulse\u0027)).value as StepEvent);\n events.push(gen.next(\u0027ack\u0027).value as StepEvent);\n let next = gen.next(\u0027tail\u0027);\n while (!next.done) {\n events.push(next.value);\n next = gen.next();\n }\n return { events, done: next.value };\n}\n","assertions":"import assert from \u0027assert\u0027;\n\nconst { events, done } = driveSupervisor();\nassert.deepStrictEqual(events, [\n { phase: \u0027load\u0027, step: 0, value: \u0027a\u0027 },\n { phase: \u0027load\u0027, step: 0, value: \u0027recovered:pulse\u0027 },\n { phase: \u0027load\u0027, step: 1, value: \u0027b\u0027 },\n { phase: \u0027save\u0027, step: 0, value: \u0027x\u0027 },\n]);\nassert.deepStrictEqual(done, [\n \u0027load[caught:pulse,in:tail]\u0027,\n \u0027seen:load\u0027,\n \u0027save[ok:x]\u0027,\n \u0027seen:save\u0027,\n]);\nconsole.log(\u0027Task 10 passed\u0027);\n","category":"syntax_completion"} {"id":"11","testsource":"devbench-syntax-completion","language":"typescript","prefix":"const PRIMARY_KEY = \u0027primary\u0027 as const;\nconst FALLBACK_KEY = \u0027fallback\u0027 as const;\n\ntype PacketSummary = {\n id: string;\n primary: number;\n fallback: number;\n firstTag: string;\n otherTags: string[];\n active: boolean;\n flagTail: unknown[];\n firstLabel: string;\n secondLabel: string;\n remainingCount: number;\n metaRestKeys: string[];\n topRestKeys: string[];\n};\n\nfunction summarizePacket(packet: unknown): PacketSummary {\n const {\n id: rawId = \u0027missing\u0027,\n meta: {\n [PRIMARY_KEY]: { value: primary = 0, tags: [firstTag = \u0027none\u0027,\n","golden_completion":" ...otherTags] = [] } = {},\n [FALLBACK_KEY]: { value: fallback = primary, enabled: active = false } = {},\n flags: [_ignored = \u0027skip\u0027, ...flagTail] = [],\n ...metaRest\n } = {},\n payload: [\n { label: firstLabel = \u0027empty\u0027, score: firstScore = 0 } = {},\n { label: secondLabel = firstLabel, score: _secondScore = firstScore } = {},\n ...remainingPayload\n ] = [],\n ...topRest\n","suffix":" } = packet as any;\n\n return {\n id: String(rawId),\n primary,\n fallback,\n firstTag,\n otherTags,\n active,\n flagTail,\n firstLabel,\n secondLabel,\n remainingCount: remainingPayload.length,\n metaRestKeys: Object.keys(metaRest).sort(),\n topRestKeys: Object.keys(topRest).sort(),\n };\n}\n","assertions":"import assert from \u0027assert\u0027;\n\nconst full = summarizePacket({\n id: 7,\n meta: {\n primary: { value: 10, tags: [\u0027hot\u0027, \u0027new\u0027, \u0027sale\u0027] },\n fallback: { value: 4, enabled: true },\n flags: [\u0027skip\u0027, \u0027x\u0027, \u0027y\u0027],\n owner: \u0027ops\u0027,\n },\n payload: [\n { label: \u0027first\u0027, score: 1 },\n { score: 2 },\n { label: \u0027third\u0027, score: 3 },\n ],\n trace: true,\n});\nassert.deepStrictEqual(full, {\n id: \u00277\u0027,\n primary: 10,\n fallback: 4,\n firstTag: \u0027hot\u0027,\n otherTags: [\u0027new\u0027, \u0027sale\u0027],\n active: true,\n flagTail: [\u0027x\u0027, \u0027y\u0027],\n firstLabel: \u0027first\u0027,\n secondLabel: \u0027first\u0027,\n remainingCount: 1,\n metaRestKeys: [\u0027owner\u0027],\n topRestKeys: [\u0027trace\u0027],\n});\n\nconst sparse = summarizePacket({ meta: { primary: {}, flags: [] }, payload: [{}] });\nassert.deepStrictEqual(sparse, {\n id: \u0027missing\u0027,\n primary: 0,\n fallback: 0,\n firstTag: \u0027none\u0027,\n otherTags: [],\n active: false,\n flagTail: [],\n firstLabel: \u0027empty\u0027,\n secondLabel: \u0027empty\u0027,\n remainingCount: 0,\n metaRestKeys: [],\n topRestKeys: [],\n});\nconsole.log(\u0027Task 11 passed\u0027);\n","category":"syntax_completion"} {"id":"12","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Circle = { kind: \u0027circle\u0027; radius: number };\ntype Rectangle = { kind: \u0027rectangle\u0027; width: number; height: number };\ntype Triangle = { kind: \u0027triangle\u0027; base: number; height: number };\ntype Polygon = { kind: \u0027polygon\u0027; sides: number[] };\n\ntype Shape = Circle | Rectangle | Triangle | Polygon;\n\nfunction assertNever(x: never): never {\n throw new Error(\u0027Unexpected: \u0027 + JSON.stringify(x));\n}\n\nfunction computeArea(shape: Shape): number {\n switch (shape.kind) {\n case \u0027circle\u0027:\n return Math.PI * shape.radius * shape.radius;\n case \u0027rectangle\u0027:\n return shape.width * shape.height;\n","golden_completion":" case \u0027triangle\u0027:\n return 0.5 * shape.base * shape.height;\n case \u0027polygon\u0027: {\n let sum = 0;\n for (const s of shape.sides) sum += s;\n return sum;\n }\n default:\n return assertNever(shape);\n }\n}\n","suffix":"\nconst shapes: Shape[] = [\n { kind: \u0027circle\u0027, radius: 5 },\n { kind: \u0027rectangle\u0027, width: 4, height: 6 },\n { kind: \u0027triangle\u0027, base: 10, height: 3 },\n { kind: \u0027polygon\u0027, sides: [3, 4, 5] },\n];\n\nconst descriptions = shapes.map(s =\u003e `${s.kind}:${computeArea(s).toFixed(2)}`);\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(descriptions[0], \u0027circle:78.54\u0027);\nassert.strictEqual(descriptions[1], \u0027rectangle:24.00\u0027);\nassert.strictEqual(descriptions[2], \u0027triangle:15.00\u0027);\nassert.strictEqual(descriptions[3], \u0027polygon:12.00\u0027);\nconsole.log(\u0027Task 12 passed\u0027);\n","category":"syntax_completion"} {"id":"13","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type DeepUnwrap\u003cT\u003e = T extends Array\u003cinfer U\u003e ? DeepUnwrap\u003cU\u003e : T;\n\ntype ExtractKeys\u003cT, V\u003e = {\n [K in keyof T]: T[K] extends V ? K : never;\n}[keyof T];\n\nfunction deepUnwrap\u003cT\u003e(value: T): DeepUnwrap\u003cT\u003e {\n let current: any = value;\n while (Array.isArray(current)) {\n if (current.length === 0) break;\n current = current[0];\n }\n return current as DeepUnwrap\u003cT\u003e;\n}\n\nfunction pickByType\u003cT extends Record\u003cstring, any\u003e, V\u003e(\n obj: T, guard: (val: any) =\u003e val is V\n): Pick\u003cT, ExtractKeys\u003cT, V\u003e\u003e {\n","golden_completion":" const result = {} as any;\n for (const key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key) \u0026\u0026 guard(obj[key])) {\n result[key] = obj[key];\n }\n }\n return result;\n}\n","suffix":"\nfunction isString(val: any): val is string {\n return typeof val === \u0027string\u0027;\n}\n\nconst nested = [[[42]]];\nconst unwrapped = deepUnwrap(nested);\n\nconst mixed = { a: \u0027hello\u0027, b: 42, c: \u0027world\u0027, d: true };\nconst stringsOnly = pickByType(mixed, isString);\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(unwrapped, 42);\nassert.deepStrictEqual(stringsOnly, { a: \u0027hello\u0027, c: \u0027world\u0027 });\nconsole.log(\u0027Task 13 passed\u0027);\n","category":"syntax_completion"} {"id":"14","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface Container\u003cT\u003e {\n value: T;\n timestamp: number;\n}\n\ninterface Container\u003cT\u003e {\n label: string;\n}\n\nfunction createContainer\u003cT\u003e(value: T, label: string): Container\u003cT\u003e {\n","golden_completion":" return {\n value,\n timestamp: Date.now(),\n label,\n };\n}\n\nfunction mapContainer\u003cT, U\u003e(c: Container\u003cT\u003e, fn: (v: T) =\u003e U): Container\u003cU\u003e {\n return { value: fn(c.value), timestamp: c.timestamp, label: c.label + \u0027_mapped\u0027 };\n}\n","suffix":"\nconst c1 = createContainer(42, \u0027num\u0027);\nconst c2 = mapContainer(c1, x =\u003e String(x * 2));\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(c1.value, 42);\nassert.strictEqual(c1.label, \u0027num\u0027);\nassert.strictEqual(typeof c1.timestamp, \u0027number\u0027);\nassert.strictEqual(c2.value, \u002784\u0027);\nassert.strictEqual(c2.label, \u0027num_mapped\u0027);\nassert.strictEqual(c2.timestamp, c1.timestamp);\nconsole.log(\u0027Task 14 passed\u0027);\n","category":"syntax_completion"} {"id":"15","testsource":"devbench-syntax-completion","language":"typescript","prefix":"function format(value: string): string;\nfunction format(value: number, decimals: number): string;\nfunction format(value: boolean): string;\nfunction format(value: Date): string;\n","golden_completion":"function format(value: string | number | boolean | Date, decimals?: number): string {\n if (typeof value === \u0027string\u0027) return `\"${value}\"`;\n if (typeof value === \u0027number\u0027) return value.toFixed(decimals ?? 0);\n if (typeof value === \u0027boolean\u0027) return value ? \u0027YES\u0027 : \u0027NO\u0027;\n const d = value as Date;\n const m = String(d.getMonth() + 1).padStart(2, \u00270\u0027);\n const day = String(d.getDate()).padStart(2, \u00270\u0027);\n return `${d.getFullYear()}-${m}-${day}`;\n}\n","suffix":"\nconst results = [\n format(\u0027hello\u0027),\n format(3.14159, 2),\n format(true),\n format(false),\n format(new Date(2025, 0, 15)),\n];\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(results[0], \u0027\"hello\"\u0027);\nassert.strictEqual(results[1], \u00273.14\u0027);\nassert.strictEqual(results[2], \u0027YES\u0027);\nassert.strictEqual(results[3], \u0027NO\u0027);\nassert.strictEqual(results[4], \u00272025-01-15\u0027);\nconsole.log(\u0027Task 15 passed\u0027);\n","category":"syntax_completion"} {"id":"16","testsource":"devbench-syntax-completion","language":"typescript","prefix":"abstract class Pipeline\u003cTIn, TOut\u003e {\n abstract transform(input: TIn): TOut;\n\n pipe\u003cTNext\u003e(fn: (output: TOut) =\u003e TNext): Pipeline\u003cTIn, TNext\u003e {\n const parent = this;\n","golden_completion":" return new (class extends Pipeline\u003cTIn, TNext\u003e {\n transform(input: TIn): TNext {\n return fn(parent.transform(input));\n }\n })();\n }\n}\n\nclass Identity\u003cT\u003e extends Pipeline\u003cT, T\u003e {\n transform(input: T): T { return input; }\n}\n","suffix":"\nfunction createPipeline\u003cT\u003e(): Pipeline\u003cT, T\u003e {\n return new Identity\u003cT\u003e();\n}\n\nconst pipeline = createPipeline\u003cstring\u003e()\n .pipe(s =\u003e s.trim())\n .pipe(s =\u003e s.toUpperCase())\n .pipe(s =\u003e s.split(\u0027 \u0027))\n .pipe(words =\u003e words.length);\n\nconst result1 = pipeline.transform(\u0027 hello world \u0027);\nconst result2 = pipeline.transform(\u0027one two three four\u0027);\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(result1, 2);\nassert.strictEqual(result2, 4);\n\nconst numPipeline = createPipeline\u003cnumber\u003e()\n .pipe(n =\u003e n * 2)\n .pipe(n =\u003e n + 1)\n .pipe(n =\u003e String(n));\nassert.strictEqual(numPipeline.transform(5), \u002711\u0027);\nassert.strictEqual(numPipeline.transform(0), \u00271\u0027);\nconsole.log(\u0027Task 16 passed\u0027);\n","category":"syntax_completion"} {"id":"17","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Status = \u0027active\u0027 | \u0027inactive\u0027 | \u0027pending\u0027;\n\ninterface Task {\n title: string;\n status: Status;\n priority: \u0027low\u0027 | \u0027medium\u0027 | \u0027high\u0027;\n}\n\nfunction createLookup(tasks: ReadonlyArray\u003cTask\u003e): Record\u003cStatus, Task[]\u003e {\n const lookup: Record\u003cStatus, Task[]\u003e = { active: [], inactive: [], pending: [] };\n for (const task of tasks) { lookup[task.status].push(task); }\n return lookup;\n}\n\nfunction summarize(lookup: Readonly\u003cRecord\u003cStatus, Task[]\u003e\u003e): Record\u003cStatus, number\u003e {\n","golden_completion":" return {\n active: lookup.active.length,\n inactive: lookup.inactive.length,\n pending: lookup.pending.length,\n };\n}\n","suffix":"\nconst allTasks: ReadonlyArray\u003cTask\u003e = [\n { title: \u0027Build UI\u0027, status: \u0027active\u0027, priority: \u0027high\u0027 },\n { title: \u0027Write docs\u0027, status: \u0027pending\u0027, priority: \u0027low\u0027 },\n { title: \u0027Fix bug\u0027, status: \u0027active\u0027, priority: \u0027medium\u0027 },\n { title: \u0027Old feature\u0027, status: \u0027inactive\u0027, priority: \u0027low\u0027 },\n { title: \u0027Review PR\u0027, status: \u0027pending\u0027, priority: \u0027high\u0027 },\n];\n\nconst lookup = createLookup(allTasks);\nconst summary = summarize(lookup);\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(lookup.active.length, 2);\nassert.strictEqual(lookup.pending.length, 2);\nassert.strictEqual(lookup.inactive.length, 1);\nassert.deepStrictEqual(summary, { active: 2, inactive: 1, pending: 2 });\nassert.strictEqual(lookup.active[0].title, \u0027Build UI\u0027);\nassert.strictEqual(lookup.active[1].title, \u0027Fix bug\u0027);\nconsole.log(\u0027Task 17 passed\u0027);\n","category":"syntax_completion"} {"id":"18","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface Serializable { serialize(): string; }\ninterface Identifiable { id: string; }\ninterface Timestamped { createdAt: number; updatedAt: number; }\ntype Entity = Serializable \u0026 Identifiable \u0026 Timestamped;\n\nclass Registry\u003cT extends Entity\u003e {\n private items: Map\u003cstring, T\u003e = new Map();\n register(item: T): this { this.items.set(item.id, item); return this; }\n\n find(predicate: (item: T) =\u003e boolean): T | undefined {\n","golden_completion":" for (const item of this.items.values()) {\n if (predicate(item)) return item;\n }\n return undefined;\n }\n findAll(pred: (item: T) =\u003e boolean): T[] {\n return [...this.items.values()].filter(pred);\n }\n getById(id: string): T | undefined { return this.items.get(id); }\n toJSON(): string[] { return [...this.items.values()].map(i =\u003e i.serialize()); }\n get size(): number { return this.items.size; }\n}\n","suffix":"\nclass User implements Entity {\n constructor(public id: string, public name: string, public role: string,\n public createdAt: number, public updatedAt: number) {}\n serialize(): string { return JSON.stringify({ id: this.id, name: this.name, role: this.role }); }\n}\n\nconst registry = new Registry\u003cUser\u003e();\nregistry\n .register(new User(\u0027u1\u0027, \u0027Alice\u0027, \u0027admin\u0027, 1000, 2000))\n .register(new User(\u0027u2\u0027, \u0027Bob\u0027, \u0027user\u0027, 1100, 2100))\n .register(new User(\u0027u3\u0027, \u0027Charlie\u0027, \u0027admin\u0027, 1200, 2200));\n\nconst admins = registry.findAll(u =\u003e u.role === \u0027admin\u0027);\nconst bob = registry.getById(\u0027u2\u0027);\nconst serialized = registry.toJSON();\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(registry.size, 3);\nassert.strictEqual(admins.length, 2);\nassert.strictEqual(admins[0].name, \u0027Alice\u0027);\nassert.strictEqual(admins[1].name, \u0027Charlie\u0027);\nassert.strictEqual(bob!.name, \u0027Bob\u0027);\nassert.strictEqual(serialized.length, 3);\nassert.deepStrictEqual(JSON.parse(serialized[0]), { id: \u0027u1\u0027, name: \u0027Alice\u0027, role: \u0027admin\u0027 });\nconst found = registry.find(u =\u003e u.createdAt \u003e 1150);\nassert.strictEqual(found!.name, \u0027Charlie\u0027);\nconsole.log(\u0027Task 18 passed\u0027);\n","category":"syntax_completion"} {"id":"19","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface Config {\n database: { host: string; port: number; credentials: { user: string; password: string } };\n server: { port: number; debug: boolean };\n features: { darkMode: boolean; beta: boolean };\n}\n\ntype NestedPaths\u003cT, P extends string = \u0027\u0027\u003e = {\n [K in keyof T \u0026 string]: T[K] extends Record\u003cstring, any\u003e\n ? NestedPaths\u003cT[K], `${P}${K}.`\u003e\n : `${P}${K}`;\n}[keyof T \u0026 string];\n\nfunction getNestedValue(obj: any, path: string): any {\n const keys = path.split(\u0027.\u0027);\n let current = obj;\n for (const key of keys) {\n if (current == null) return undefined;\n current = current[key];\n }\n return current;\n}\n\nfunction flattenConfig\u003cT extends Record\u003cstring, any\u003e\u003e(obj: T, prefix: string = \u0027\u0027): Record\u003cstring, any\u003e {\n","golden_completion":" const result: Record\u003cstring, any\u003e = {};\n for (const key of Object.keys(obj)) {\n const fullKey = prefix ? `${prefix}.${key}` : key;\n const val = obj[key];\n if (typeof val === \u0027object\u0027 \u0026\u0026 val !== null \u0026\u0026 !Array.isArray(val)) {\n Object.assign(result, flattenConfig(val, fullKey));\n } else {\n result[fullKey] = val;\n }\n }\n return result;\n}\n","suffix":"\nconst config: Config = {\n database: { host: \u0027localhost\u0027, port: 5432, credentials: { user: \u0027admin\u0027, password: \u0027secret\u0027 } },\n server: { port: 8080, debug: true },\n features: { darkMode: false, beta: true },\n};\n\nconst dbHost = getNestedValue(config, \u0027database.host\u0027);\nconst dbUser = getNestedValue(config, \u0027database.credentials.user\u0027);\nconst flat = flattenConfig(config);\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.strictEqual(dbHost, \u0027localhost\u0027);\nassert.strictEqual(dbUser, \u0027admin\u0027);\nassert.strictEqual(getNestedValue(config, \u0027server.debug\u0027), true);\nassert.strictEqual(getNestedValue(config, \u0027nonexistent.path\u0027), undefined);\nassert.strictEqual(flat[\u0027database.host\u0027], \u0027localhost\u0027);\nassert.strictEqual(flat[\u0027database.port\u0027], 5432);\nassert.strictEqual(flat[\u0027database.credentials.user\u0027], \u0027admin\u0027);\nassert.strictEqual(flat[\u0027server.debug\u0027], true);\nassert.strictEqual(flat[\u0027features.beta\u0027], true);\nassert.strictEqual(Object.keys(flat).length, 8);\nconsole.log(\u0027Task 19 passed\u0027);\n","category":"syntax_completion"} {"id":"20","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface EventMap {\n login: { userId: string; timestamp: number };\n logout: { userId: string };\n error: { code: number; message: string };\n ping: void;\n}\n\ntype Listener\u003cT\u003e = T extends void ? () =\u003e void : (payload: T) =\u003e void;\n\nclass TypedEmitter\u003cTEvents extends Record\u003cstring, any\u003e\u003e {\n private handlers: { [K in keyof TEvents]?: Array\u003cListener\u003cTEvents[K]\u003e\u003e } = {};\n private onceSet: WeakSet\u003cFunction\u003e = new WeakSet();\n private log: string[] = [];\n\n on\u003cK extends keyof TEvents \u0026 string\u003e(event: K, listener: Listener\u003cTEvents[K]\u003e): this {\n if (!this.handlers[event]) this.handlers[event] = [];\n this.handlers[event]!.push(listener);\n this.log.push(`on:${event}`);\n return this;\n }\n\n once\u003cK extends keyof TEvents \u0026 string\u003e(event: K, listener: Listener\u003cTEvents[K]\u003e): this {\n this.onceSet.add(listener);\n return this.on(event, listener);\n }\n\n emit\u003cK extends keyof TEvents \u0026 string\u003e(\n event: K, ...args: TEvents[K] extends void ? [] : [TEvents[K]]\n ): boolean {\n","golden_completion":" const listeners = this.handlers[event];\n if (!listeners || listeners.length === 0) return false;\n this.log.push(`emit:${event}`);\n const remove: Function[] = [];\n for (const fn of listeners) {\n (fn as Function).apply(null, args);\n if (this.onceSet.has(fn)) { remove.push(fn); this.onceSet.delete(fn); }\n }\n this.handlers[event] = listeners.filter(l =\u003e !remove.includes(l as any)) as any;\n return true;\n }\n","suffix":"\n getLog(): string[] { return [...this.log]; }\n}\n\nconst emitter = new TypedEmitter\u003cEventMap\u003e();\nconst received: string[] = [];\n\nemitter\n .on(\u0027login\u0027, (payload) =\u003e { received.push(\u0027login:\u0027 + payload.userId); })\n .on(\u0027error\u0027, (payload) =\u003e { received.push(\u0027error:\u0027 + payload.code); })\n .once(\u0027ping\u0027, () =\u003e { received.push(\u0027ping\u0027); });\n\nemitter.emit(\u0027login\u0027, { userId: \u0027alice\u0027, timestamp: 1000 });\nemitter.emit(\u0027ping\u0027);\nemitter.emit(\u0027ping\u0027);\nemitter.emit(\u0027error\u0027, { code: 404, message: \u0027Not found\u0027 });\nconst log = emitter.getLog();\n","assertions":"import * as assert from \u0027assert\u0027;\nassert.deepStrictEqual(received, [\u0027login:alice\u0027, \u0027ping\u0027, \u0027error:404\u0027]);\nassert.deepStrictEqual(log, [\u0027on:login\u0027, \u0027on:error\u0027, \u0027on:ping\u0027, \u0027emit:login\u0027, \u0027emit:ping\u0027, \u0027emit:error\u0027]);\nassert.strictEqual(emitter.emit(\u0027ping\u0027), false);\nconsole.log(\u0027Task 20 passed\u0027);\n","category":"syntax_completion"} {"id":"21","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface Serializable {\n serialize(): string;\n}\n\nabstract class Container\u003cT extends Serializable\u003e {\n protected items: T[] = [];\n\n abstract add(item: T): this;\n abstract transform\u003cU extends Serializable\u003e(fn: (item: T) =\u003e U): Container\u003cU\u003e;\n\n getAll(): T[] { return [...this.items]; }\n}\n\nclass StringWrapper implements Serializable {\n constructor(public value: string) {}\n serialize(): string { return this.value; }\n}\n\nclass NumberWrapper implements Serializable {\n constructor(public value: number) {}\n serialize(): string { return String(this.value); }\n}\n\nclass TypedContainer\u003cT extends Serializable\u003e extends Container\u003cT\u003e {\n","golden_completion":" add(item: T): this {\n this.items.push(item);\n return this;\n }\n\n transform\u003cU extends Serializable\u003e(fn: (item: T) =\u003e U): TypedContainer\u003cU\u003e {\n const result = new TypedContainer\u003cU\u003e();\n for (const item of this.items) {\n result.add(fn(item));\n }\n return result;\n }\n","suffix":"}\n\nfunction chainOps(): string[] {\n const container = new TypedContainer\u003cStringWrapper\u003e();\n const results = container\n .add(new StringWrapper(\"hello\"))\n .add(new StringWrapper(\"world\"))\n .transform((s: StringWrapper) =\u003e new NumberWrapper(s.value.length))\n .transform((n: NumberWrapper) =\u003e new StringWrapper(n.value.toString()))\n .getAll();\n return results.map(r =\u003e r.serialize());\n}\n","assertions":"const assert = require(\u0027assert\u0027);\nconst res = chainOps();\nassert.deepStrictEqual(res, [\u00275\u0027, \u00275\u0027]);\n\nconst c = new TypedContainer\u003cStringWrapper\u003e();\nconst c2 = c.add(new StringWrapper(\"a\")).add(new StringWrapper(\"bb\")).add(new StringWrapper(\"ccc\"));\nassert.strictEqual(c2, c);\nassert.strictEqual(c.getAll().length, 3);\nconst nums = c.transform((s: StringWrapper) =\u003e new NumberWrapper(s.value.length));\nassert.deepStrictEqual(nums.getAll().map((n: NumberWrapper) =\u003e n.value), [1, 2, 3]);\n\nconsole.log(\u0027Task 21 passed\u0027);\n","category":"syntax_completion"} {"id":"22","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Shape =\n | { kind: \u0027circle\u0027; radius: number }\n | { kind: \u0027rectangle\u0027; width: number; height: number }\n | { kind: \u0027triangle\u0027; base: number; height: number }\n | { kind: \u0027polygon\u0027; sides: { length: number }[] };\n\nfunction area(shape: Shape): number {\n switch (shape.kind) {\n","golden_completion":" case \u0027circle\u0027:\n return Math.PI * shape.radius * shape.radius;\n case \u0027rectangle\u0027:\n return shape.width * shape.height;\n case \u0027triangle\u0027:\n return 0.5 * shape.base * shape.height;\n case \u0027polygon\u0027: {\n const n = shape.sides.length;\n const s = shape.sides[0].length;\n return (n * s * s) / (4 * Math.tan(Math.PI / n));\n }\n","suffix":" default: {\n const _exhaustive: never = shape;\n throw new Error(`Unknown shape: ${(_exhaustive as any).kind}`);\n }\n }\n}\n\nfunction describeShapes(shapes: Shape[]): string[] {\n return shapes.map(s =\u003e `${s.kind}:${area(s).toFixed(2)}`);\n}\n","assertions":"const assert = require(\u0027assert\u0027);\nconst results = describeShapes([\n { kind: \u0027circle\u0027, radius: 1 },\n { kind: \u0027rectangle\u0027, width: 3, height: 4 },\n { kind: \u0027triangle\u0027, base: 6, height: 5 },\n { kind: \u0027polygon\u0027, sides: [{ length: 2 }, { length: 2 }, { length: 2 }, { length: 2 }] },\n]);\nassert.strictEqual(results[0], \u0027circle:\u0027 + (Math.PI).toFixed(2));\nassert.strictEqual(results[1], \u0027rectangle:12.00\u0027);\nassert.strictEqual(results[2], \u0027triangle:15.00\u0027);\nassert.strictEqual(results[3], \u0027polygon:4.00\u0027);\n\n// single element checks\nassert.strictEqual(area({ kind: \u0027circle\u0027, radius: 0 }), 0);\nassert.strictEqual(area({ kind: \u0027rectangle\u0027, width: 1, height: 1 }), 1);\n\nconsole.log(\u0027Task 22 passed\u0027);\n","category":"syntax_completion"} {"id":"23","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Result\u003cT, E = Error\u003e =\n | { ok: true; value: T }\n | { ok: false; error: E };\n\nasync function tryAsync\u003cT\u003e(fn: () =\u003e Promise\u003cT\u003e): Promise\u003cResult\u003cT\u003e\u003e {\n try {\n const value = await fn();\n return { ok: true, value };\n } catch (e) {\n return { ok: false, error: e instanceof Error ? e : new Error(String(e)) };\n }\n}\n\nasync function pipeline\u003cA, B, C\u003e(\n stepA: () =\u003e Promise\u003cA\u003e,\n stepB: (a: A) =\u003e Promise\u003cB\u003e,\n stepC: (b: B) =\u003e Promise\u003cC\u003e,\n): Promise\u003cResult\u003cC\u003e\u003e {\n","golden_completion":" const resA = await tryAsync(stepA);\n if (!resA.ok) return resA;\n\n const resB = await tryAsync(() =\u003e stepB(resA.value));\n if (!resB.ok) return resB;\n\n return tryAsync(() =\u003e stepC(resB.value));\n","suffix":"}\n\nasync function runPipeline(): Promise\u003cstring\u003e {\n const result = await pipeline(\n async () =\u003e 42,\n async (n: number) =\u003e n.toString(),\n async (s: string) =\u003e s + \u0027!\u0027,\n );\n if (result.ok) return result.value;\n throw result.error;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\n(async () =\u003e {\n const r1 = await runPipeline();\n assert.strictEqual(r1, \u002742!\u0027);\n\n const r2 = await pipeline(\n async () =\u003e { throw new Error(\u0027fail-a\u0027); },\n async (n: number) =\u003e n,\n async (n: number) =\u003e n,\n );\n assert.strictEqual(r2.ok, false);\n assert.strictEqual((r2 as any).error.message, \u0027fail-a\u0027);\n\n const r3 = await pipeline(\n async () =\u003e 10,\n async (n: number) =\u003e { throw new Error(\u0027fail-b\u0027); },\n async (s: any) =\u003e s,\n );\n assert.strictEqual(r3.ok, false);\n assert.strictEqual((r3 as any).error.message, \u0027fail-b\u0027);\n\n const r4 = await pipeline(\n async () =\u003e \u0027x\u0027,\n async (s: string) =\u003e s.length,\n async (n: number) =\u003e { throw new Error(\u0027fail-c\u0027); },\n );\n assert.strictEqual(r4.ok, false);\n assert.strictEqual((r4 as any).error.message, \u0027fail-c\u0027);\n\n console.log(\u0027Task 23 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"24","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface QueryConfig {\n table: string;\n fields: string[];\n conditions: Array\u003c{ field: string; op: string; value: unknown }\u003e;\n orderBy: Array\u003c{ field: string; dir: \u0027asc\u0027 | \u0027desc\u0027 }\u003e;\n limit: number | null;\n}\n\nclass QueryBuilder {\n private config: QueryConfig;\n\n private constructor(table: string) {\n this.config = { table, fields: [], conditions: [], orderBy: [], limit: null };\n }\n\n static from(table: string): QueryBuilder {\n return new QueryBuilder(table);\n }\n\n select(...fields: string[]): this {\n this.config.fields.push(...fields);\n return this;\n }\n\n where(field: string, op: string, value: unknown): this {\n this.config.conditions.push({ field, op, value });\n return this;\n }\n\n order(field: string, dir: \u0027asc\u0027 | \u0027desc\u0027 = \u0027asc\u0027): this {\n this.config.orderBy.push({ field, dir });\n return this;\n }\n\n take(n: number): this {\n this.config.limit = n;\n return this;\n }\n\n build(): string {\n const fields = this.config.fields.length \u003e 0 ? this.config.fields.join(\u0027, \u0027) : \u0027*\u0027;\n let sql = `SELECT ${fields} FROM ${this.config.table}`;\n","golden_completion":" if (this.config.conditions.length \u003e 0) {\n const conds = this.config.conditions.map(c =\u003e `${c.field} ${c.op} ${JSON.stringify(c.value)}`);\n sql += ` WHERE ${conds.join(\u0027 AND \u0027)}`;\n }\n if (this.config.orderBy.length \u003e 0) {\n const ords = this.config.orderBy.map(o =\u003e `${o.field} ${o.dir.toUpperCase()}`);\n sql += ` ORDER BY ${ords.join(\u0027, \u0027)}`;\n }\n if (this.config.limit !== null) {\n sql += ` LIMIT ${this.config.limit}`;\n }\n return sql;\n","suffix":" }\n}\n\nfunction buildQuery(): string {\n return QueryBuilder\n .from(\u0027users\u0027)\n .select(\u0027name\u0027, \u0027email\u0027)\n .where(\u0027age\u0027, \u0027\u003e\u0027, 18)\n .where(\u0027active\u0027, \u0027=\u0027, true)\n .order(\u0027name\u0027, \u0027asc\u0027)\n .order(\u0027age\u0027, \u0027desc\u0027)\n .take(10)\n .build();\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst q1 = buildQuery();\nassert.strictEqual(q1, \u0027SELECT name, email FROM users WHERE age \u003e 18 AND active = true ORDER BY name ASC, age DESC LIMIT 10\u0027);\n\nconst q2 = QueryBuilder.from(\u0027orders\u0027).build();\nassert.strictEqual(q2, \u0027SELECT * FROM orders\u0027);\n\nconst q3 = QueryBuilder.from(\u0027products\u0027).select(\u0027id\u0027).where(\u0027price\u0027, \u0027\u003c\u0027, 100).build();\nassert.strictEqual(q3, \u0027SELECT id FROM products WHERE price \u003c 100\u0027);\n\nconst q4 = QueryBuilder.from(\u0027logs\u0027).order(\u0027ts\u0027, \u0027desc\u0027).take(5).build();\nassert.strictEqual(q4, \u0027SELECT * FROM logs ORDER BY ts DESC LIMIT 5\u0027);\n\nconsole.log(\u0027Task 24 passed\u0027);\n","category":"syntax_completion"} {"id":"25","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type TreeNode\u003cT\u003e = {\n value: T;\n children: TreeNode\u003cT\u003e[];\n};\n\nfunction buildTree\u003cT\u003e(value: T, ...childValues: T[]): TreeNode\u003cT\u003e {\n return { value, children: childValues.map(v =\u003e ({ value: v, children: [] })) };\n}\n\nfunction mapTree\u003cT, U\u003e(node: TreeNode\u003cT\u003e, fn: (val: T, depth: number) =\u003e U, depth: number = 0): TreeNode\u003cU\u003e {\n","golden_completion":" return {\n value: fn(node.value, depth),\n children: node.children.map(child =\u003e mapTree(child, fn, depth + 1)),\n };\n","suffix":"}\n\nfunction flattenTree\u003cT\u003e(node: TreeNode\u003cT\u003e): T[] {\n const result: T[] = [node.value];\n for (const child of node.children) {\n result.push(...flattenTree(child));\n }\n return result;\n}\n\nfunction buildNestedTree(): TreeNode\u003cstring\u003e {\n const root: TreeNode\u003cstring\u003e = {\n value: \u0027root\u0027,\n children: [\n { value: \u0027a\u0027, children: [\n { value: \u0027a1\u0027, children: [] },\n { value: \u0027a2\u0027, children: [{ value: \u0027a2x\u0027, children: [] }] },\n ]},\n { value: \u0027b\u0027, children: [] },\n ],\n };\n return root;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst tree = buildNestedTree();\nconst mapped = mapTree(tree, (val, depth) =\u003e `${depth}:${val}`);\nconst flat = flattenTree(mapped);\nassert.deepStrictEqual(flat, [\u00270:root\u0027, \u00271:a\u0027, \u00272:a1\u0027, \u00272:a2\u0027, \u00273:a2x\u0027, \u00271:b\u0027]);\n\nconst simple = buildTree(10, 20, 30);\nconst doubled = mapTree(simple, (v, d) =\u003e v * (d + 1));\nassert.deepStrictEqual(flattenTree(doubled), [10, 40, 60]);\n\nconst single = mapTree({ value: \u0027x\u0027, children: [] }, (v, d) =\u003e v + d);\nassert.deepStrictEqual(flattenTree(single), [\u0027x0\u0027]);\n\nconsole.log(\u0027Task 25 passed\u0027);\n","category":"syntax_completion"} {"id":"26","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface ApiResponse {\n status: number;\n headers: Record\u003cstring, string\u003e;\n body: {\n data?: {\n users: Array\u003c{\n id: number;\n profile: {\n name: string;\n scores: [number, number, number];\n address?: {\n city: string;\n zip: string;\n };\n };\n }\u003e;\n pagination: {\n page: number;\n total: number;\n next?: string;\n };\n };\n errors?: Array\u003c{ code: number; message: string }\u003e;\n };\n}\n\nfunction extractSummary(response: ApiResponse): {\n ok: boolean;\n firstUser: string | null;\n topScore: number;\n city: string;\n nextPage: string | null;\n errorCount: number;\n} {\n const {\n status,\n body: {\n data: {\n users: [\n {\n profile: {\n name: firstName,\n scores: [s1, s2, s3],\n","golden_completion":" address: { city: firstCity = \u0027unknown\u0027 } = { city: \u0027unknown\u0027 },\n },\n } = { profile: { name: \u0027\u0027, scores: [0, 0, 0] as [number, number, number] } },\n ...otherUsers\n ] = [],\n pagination: { next: nextPage = null } = { next: null },\n } = { users: [], pagination: { page: 0, total: 0 } },\n errors = [],\n },\n } = response;\n","suffix":"\n return {\n ok: status \u003e= 200 \u0026\u0026 status \u003c 300,\n firstUser: firstName || null,\n topScore: Math.max(s1, s2, s3),\n city: firstCity,\n nextPage: nextPage ?? null,\n errorCount: errors.length,\n };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst full: ApiResponse = {\n status: 200,\n headers: { \u0027content-type\u0027: \u0027application/json\u0027 },\n body: {\n data: {\n users: [\n { id: 1, profile: { name: \u0027Alice\u0027, scores: [90, 85, 92], address: { city: \u0027NYC\u0027, zip: \u002710001\u0027 } } },\n { id: 2, profile: { name: \u0027Bob\u0027, scores: [70, 80, 75] } },\n ],\n pagination: { page: 1, total: 5, next: \u0027/api?page=2\u0027 },\n },\n },\n};\n\nconst r1 = extractSummary(full);\nassert.strictEqual(r1.ok, true);\nassert.strictEqual(r1.firstUser, \u0027Alice\u0027);\nassert.strictEqual(r1.topScore, 92);\nassert.strictEqual(r1.city, \u0027NYC\u0027);\nassert.strictEqual(r1.nextPage, \u0027/api?page=2\u0027);\nassert.strictEqual(r1.errorCount, 0);\n\nconst empty: ApiResponse = {\n status: 500,\n headers: {},\n body: { errors: [{ code: 1, message: \u0027fail\u0027 }, { code: 2, message: \u0027bad\u0027 }] },\n};\n\nconst r2 = extractSummary(empty);\nassert.strictEqual(r2.ok, false);\nassert.strictEqual(r2.firstUser, null);\nassert.strictEqual(r2.topScore, 0);\nassert.strictEqual(r2.city, \u0027unknown\u0027);\nassert.strictEqual(r2.nextPage, null);\nassert.strictEqual(r2.errorCount, 2);\n\nconsole.log(\u0027Task 26 passed\u0027);\n","category":"syntax_completion"} {"id":"27","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface Context {\n path: string;\n method: string;\n headers: Record\u003cstring, string\u003e;\n body: unknown;\n state: Record\u003cstring, unknown\u003e;\n response: { status: number; body: unknown } | null;\n}\n\ntype Middleware = (ctx: Context, next: () =\u003e Promise\u003cvoid\u003e) =\u003e Promise\u003cvoid\u003e;\n\nclass Router {\n private middlewares: Middleware[] = [];\n private routes: Map\u003cstring, Middleware\u003e = new Map();\n\n use(mw: Middleware): this {\n this.middlewares.push(mw);\n return this;\n }\n\n route(path: string, handler: Middleware): this {\n this.routes.set(path, handler);\n return this;\n }\n\n async handle(ctx: Context): Promise\u003cContext\u003e {\n const routeHandler = this.routes.get(ctx.path);\n const chain = [...this.middlewares];\n if (routeHandler) chain.push(routeHandler);\n","golden_completion":"\n let index = 0;\n const dispatch = async (): Promise\u003cvoid\u003e =\u003e {\n if (index \u003c chain.length) {\n const mw = chain[index++];\n await mw(ctx, dispatch);\n }\n };\n\n await dispatch();\n return ctx;\n }\n","suffix":"}\n\nfunction createCtx(path: string, method: string = \u0027GET\u0027): Context {\n return { path, method, headers: {}, body: null, state: {}, response: null };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\n(async () =\u003e {\n const router = new Router();\n const log: string[] = [];\n\n router.use(async (ctx, next) =\u003e {\n log.push(\u0027mw1:before\u0027);\n ctx.state[\u0027start\u0027] = Date.now();\n await next();\n log.push(\u0027mw1:after\u0027);\n });\n\n router.use(async (ctx, next) =\u003e {\n log.push(\u0027mw2:before\u0027);\n ctx.headers[\u0027x-processed\u0027] = \u0027true\u0027;\n await next();\n log.push(\u0027mw2:after\u0027);\n });\n\n router.route(\u0027/hello\u0027, async (ctx, next) =\u003e {\n log.push(\u0027route:/hello\u0027);\n ctx.response = { status: 200, body: \u0027Hello!\u0027 };\n await next();\n });\n\n const ctx1 = await router.handle(createCtx(\u0027/hello\u0027));\n assert.strictEqual(ctx1.response!.status, 200);\n assert.strictEqual(ctx1.response!.body, \u0027Hello!\u0027);\n assert.strictEqual(ctx1.headers[\u0027x-processed\u0027], \u0027true\u0027);\n assert.deepStrictEqual(log, [\u0027mw1:before\u0027, \u0027mw2:before\u0027, \u0027route:/hello\u0027, \u0027mw2:after\u0027, \u0027mw1:after\u0027]);\n\n const log2: string[] = [];\n const router2 = new Router();\n router2.use(async (ctx, next) =\u003e { log2.push(\u0027a\u0027); await next(); log2.push(\u0027b-end\u0027); });\n router2.use(async (ctx, next) =\u003e { log2.push(\u0027b\u0027); await next(); log2.push(\u0027a-end\u0027); });\n await router2.handle(createCtx(\u0027/missing\u0027));\n assert.deepStrictEqual(log2, [\u0027a\u0027, \u0027b\u0027, \u0027a-end\u0027, \u0027b-end\u0027]);\n\n console.log(\u0027Task 27 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"28","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Validator\u003cT\u003e = (value: unknown) =\u003e value is T;\ntype Schema = Record\u003cstring, Validator\u003cany\u003e\u003e;\n\ntype InferSchema\u003cS extends Schema\u003e = {\n [K in keyof S]: S[K] extends Validator\u003cinfer T\u003e ? T : never;\n};\n\nfunction isString(v: unknown): v is string { return typeof v === \u0027string\u0027; }\nfunction isNumber(v: unknown): v is number { return typeof v === \u0027number\u0027; }\nfunction isBoolean(v: unknown): v is boolean { return typeof v === \u0027boolean\u0027; }\nfunction isArrayOf\u003cT\u003e(check: Validator\u003cT\u003e): Validator\u003cT[]\u003e {\n return ((v: unknown): v is T[] =\u003e Array.isArray(v) \u0026\u0026 v.every(check)) as Validator\u003cT[]\u003e;\n}\n\nfunction createParser\u003cS extends Schema\u003e(schema: S): {\n parse(input: Record\u003cstring, unknown\u003e): { success: true; data: InferSchema\u003cS\u003e } | { success: false; errors: string[] };\n keys(): (keyof S)[];\n} {\n return {\n parse(input: Record\u003cstring, unknown\u003e) {\n const errors: string[] = [];\n const data: Record\u003cstring, unknown\u003e = {};\n for (const key of Object.keys(schema)) {\n","golden_completion":" const value = input[key];\n if (value === undefined) {\n errors.push(`missing:${key}`);\n } else if (!schema[key](value)) {\n errors.push(`invalid:${key}`);\n } else {\n data[key] = value;\n }\n }\n return errors.length \u003e 0\n ? { success: false as const, errors }\n : { success: true as const, data: data as InferSchema\u003cS\u003e };\n","suffix":" },\n keys() {\n return Object.keys(schema) as (keyof S)[];\n },\n };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst userParser = createParser({\n name: isString,\n age: isNumber,\n active: isBoolean,\n tags: isArrayOf(isString),\n});\n\nconst r1 = userParser.parse({ name: \u0027Alice\u0027, age: 30, active: true, tags: [\u0027admin\u0027] });\nassert.strictEqual(r1.success, true);\nif (r1.success) {\n assert.strictEqual(r1.data.name, \u0027Alice\u0027);\n assert.strictEqual(r1.data.age, 30);\n assert.deepStrictEqual(r1.data.tags, [\u0027admin\u0027]);\n}\n\nconst r2 = userParser.parse({ name: \u0027Bob\u0027, age: \u0027thirty\u0027, active: true, tags: [\u0027x\u0027] });\nassert.strictEqual(r2.success, false);\nif (!r2.success) {\n assert.deepStrictEqual(r2.errors, [\u0027invalid:age\u0027]);\n}\n\nconst r3 = userParser.parse({ name: \u0027Carol\u0027 });\nassert.strictEqual(r3.success, false);\nif (!r3.success) {\n assert.strictEqual(r3.errors.length, 3);\n assert.ok(r3.errors.includes(\u0027missing:age\u0027));\n assert.ok(r3.errors.includes(\u0027missing:active\u0027));\n assert.ok(r3.errors.includes(\u0027missing:tags\u0027));\n}\n\nconst keys = userParser.keys();\nassert.deepStrictEqual([...keys].sort(), [\u0027active\u0027, \u0027age\u0027, \u0027name\u0027, \u0027tags\u0027]);\n\nconsole.log(\u0027Task 28 passed\u0027);\n","category":"syntax_completion"} {"id":"29","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type EventMap = Record\u003cstring, unknown[]\u003e;\n\nclass TypedEmitter\u003cE extends EventMap\u003e {\n private listeners: { [K in keyof E]?: Array\u003c(...args: E[K]) =\u003e void\u003e } = {};\n private onceFlags: WeakSet\u003cFunction\u003e = new WeakSet();\n\n on\u003cK extends keyof E\u003e(event: K, listener: (...args: E[K]) =\u003e void): this {\n if (!this.listeners[event]) {\n this.listeners[event] = [];\n }\n this.listeners[event]!.push(listener);\n return this;\n }\n\n once\u003cK extends keyof E\u003e(event: K, listener: (...args: E[K]) =\u003e void): this {\n this.onceFlags.add(listener);\n return this.on(event, listener);\n }\n\n emit\u003cK extends keyof E\u003e(event: K, ...args: E[K]): boolean {\n const handlers = this.listeners[event];\n if (!handlers || handlers.length === 0) return false;\n","golden_completion":" const toRemove: Function[] = [];\n for (const h of handlers) {\n h(...args);\n if (this.onceFlags.has(h)) {\n toRemove.push(h);\n this.onceFlags.delete(h);\n }\n }\n this.listeners[event] = handlers.filter(h =\u003e !toRemove.includes(h));\n return true;\n","suffix":" }\n\n off\u003cK extends keyof E\u003e(event: K, listener: (...args: E[K]) =\u003e void): this {\n const handlers = this.listeners[event];\n if (handlers) {\n this.listeners[event] = handlers.filter(h =\u003e h !== listener);\n }\n return this;\n }\n}\n\ninterface MyEvents extends EventMap {\n message: [sender: string, text: string];\n error: [code: number];\n close: [];\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst emitter = new TypedEmitter\u003cMyEvents\u003e();\nconst log: string[] = [];\n\nemitter.on(\u0027message\u0027, (sender, text) =\u003e { log.push(`msg:${sender}:${text}`); });\nemitter.once(\u0027message\u0027, (sender, text) =\u003e { log.push(`once:${sender}:${text}`); });\nemitter.emit(\u0027message\u0027, \u0027Alice\u0027, \u0027hi\u0027);\nemitter.emit(\u0027message\u0027, \u0027Bob\u0027, \u0027yo\u0027);\nassert.deepStrictEqual(log, [\u0027msg:Alice:hi\u0027, \u0027once:Alice:hi\u0027, \u0027msg:Bob:yo\u0027]);\n\nconst errLog: number[] = [];\nconst errHandler = (code: number) =\u003e { errLog.push(code); };\nemitter.on(\u0027error\u0027, errHandler);\nemitter.emit(\u0027error\u0027, 42);\nemitter.off(\u0027error\u0027, errHandler);\nconst emitted = emitter.emit(\u0027error\u0027, 99);\nassert.strictEqual(emitted, false);\nassert.deepStrictEqual(errLog, [42]);\n\nconst closeLog: string[] = [];\nemitter.once(\u0027close\u0027, () =\u003e { closeLog.push(\u0027closed\u0027); });\nemitter.emit(\u0027close\u0027);\nemitter.emit(\u0027close\u0027);\nassert.deepStrictEqual(closeLog, [\u0027closed\u0027]);\n\nconsole.log(\u0027Task 29 passed\u0027);\n","category":"syntax_completion"} {"id":"30","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Constructor\u003cT = {}\u003e = new (...args: any[]) =\u003e T;\n\ninterface Timestamped {\n createdAt: Date;\n updatedAt: Date;\n touch(): void;\n}\n\ninterface Taggable {\n tags: Set\u003cstring\u003e;\n addTag(tag: string): void;\n hasTag(tag: string): boolean;\n}\n\nfunction WithTimestamps\u003cTBase extends Constructor\u003e(Base: TBase) {\n return class extends Base implements Timestamped {\n createdAt = new Date();\n updatedAt = new Date();\n touch() { this.updatedAt = new Date(); }\n };\n}\n\nfunction WithTags\u003cTBase extends Constructor\u003e(Base: TBase) {\n","golden_completion":" return class extends Base implements Taggable {\n tags: Set\u003cstring\u003e = new Set();\n addTag(tag: string): void { this.tags.add(tag); }\n hasTag(tag: string): boolean { return this.tags.has(tag); }\n };\n}\n\nclass BaseEntity {\n constructor(public id: string, public name: string) {}\n}\n","suffix":"\nclass TaggedEntity extends WithTags(WithTimestamps(BaseEntity)) {\n constructor(id: string, name: string) {\n super(id, name);\n }\n\n describe(): string {\n return `${this.id}:${this.name}:[${[...this.tags].sort().join(\u0027,\u0027)}]`;\n }\n}\n\nfunction createEntity(id: string, name: string, tags: string[]): TaggedEntity {\n const entity = new TaggedEntity(id, name);\n for (const tag of tags) entity.addTag(tag);\n entity.touch();\n return entity;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst e1 = createEntity(\u00271\u0027, \u0027Widget\u0027, [\u0027red\u0027, \u0027large\u0027]);\nassert.strictEqual(e1.id, \u00271\u0027);\nassert.strictEqual(e1.name, \u0027Widget\u0027);\nassert.strictEqual(e1.hasTag(\u0027red\u0027), true);\nassert.strictEqual(e1.hasTag(\u0027blue\u0027), false);\nassert.strictEqual(e1.describe(), \u00271:Widget:[large,red]\u0027);\nassert.ok(e1.createdAt instanceof Date);\nassert.ok(e1.updatedAt instanceof Date);\nassert.ok(e1.updatedAt \u003e= e1.createdAt);\n\nconst e2 = createEntity(\u00272\u0027, \u0027Gadget\u0027, []);\nassert.strictEqual(e2.describe(), \u00272:Gadget:[]\u0027);\ne2.addTag(\u0027new\u0027);\nassert.strictEqual(e2.hasTag(\u0027new\u0027), true);\nassert.strictEqual(e2.describe(), \u00272:Gadget:[new]\u0027);\n\nconst e3 = createEntity(\u00273\u0027, \u0027Item\u0027, [\u0027z\u0027, \u0027a\u0027, \u0027m\u0027]);\nassert.strictEqual(e3.describe(), \u00273:Item:[a,m,z]\u0027);\n\nconsole.log(\u0027Task 30 passed\u0027);\n","category":"syntax_completion"} {"id":"31","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Mapper\u003cA, B\u003e = (a: A) =\u003e B;\n\nfunction pipeline\u003cA, B, C\u003e(\n first: Mapper\u003cA, B\u003e,\n second: Mapper\u003cB, C\u003e\n): Mapper\u003cA, C\u003e {\n","golden_completion":" return (input: A): C =\u003e {\n const intermediate: B = first(input);\n return second(intermediate);\n };\n","suffix":"}\n\nfunction identity\u003cT\u003e(x: T): T { return x; }\n\nconst double = (n: number): number =\u003e n * 2;\nconst stringify = (n: number): string =\u003e `val:${n}`;\nconst combined = pipeline(double, stringify);\n\nconst parseLen = (s: string): number =\u003e s.length;\nconst isEven = (n: number): boolean =\u003e n % 2 === 0;\nconst checkEvenLen = pipeline(parseLen, isEven);\n\nconst noOp = pipeline(identity\u003cnumber\u003e, identity\u003cnumber\u003e);\n","assertions":"const assert = require(\u0027assert\u0027);\nassert.strictEqual(combined(5), \u0027val:10\u0027);\nassert.strictEqual(combined(0), \u0027val:0\u0027);\nassert.strictEqual(combined(-3), \u0027val:-6\u0027);\n\nassert.strictEqual(checkEvenLen(\u0027hi\u0027), true);\nassert.strictEqual(checkEvenLen(\u0027hey\u0027), false);\n\nassert.strictEqual(noOp(42), 42);\nconsole.log(\u0027Task 31 passed\u0027);\n","category":"syntax_completion"} {"id":"32","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface Transaction {\n account: string;\n amount: number;\n type: \u0027credit\u0027 | \u0027debit\u0027;\n}\n\ninterface Summary {\n totals: Map\u003cstring, number\u003e;\n count: number;\n maxCredit: number;\n}\n\nfunction summarize(transactions: Transaction[]): Summary {\n return transactions.reduce\u003cSummary\u003e(\n (acc, tx) =\u003e {\n","golden_completion":" const current = acc.totals.get(tx.account) ?? 0;\n const delta = tx.type === \u0027credit\u0027 ? tx.amount : -tx.amount;\n acc.totals.set(tx.account, current + delta);\n acc.count++;\n if (tx.type === \u0027credit\u0027 \u0026\u0026 tx.amount \u003e acc.maxCredit) {\n acc.maxCredit = tx.amount;\n }\n return acc;\n","suffix":" },\n { totals: new Map(), count: 0, maxCredit: 0 }\n );\n}\n","assertions":"const assert = require(\u0027assert\u0027);\nconst txs: Transaction[] = [\n { account: \u0027A\u0027, amount: 100, type: \u0027credit\u0027 },\n { account: \u0027A\u0027, amount: 30, type: \u0027debit\u0027 },\n { account: \u0027B\u0027, amount: 50, type: \u0027credit\u0027 },\n { account: \u0027B\u0027, amount: 50, type: \u0027credit\u0027 },\n];\nconst s = summarize(txs);\nassert.strictEqual(s.totals.get(\u0027A\u0027), 70);\nassert.strictEqual(s.totals.get(\u0027B\u0027), 100);\nassert.strictEqual(s.count, 4);\nassert.strictEqual(s.maxCredit, 100);\n\nconst empty = summarize([]);\nassert.strictEqual(empty.count, 0);\nassert.strictEqual(empty.maxCredit, 0);\nassert.strictEqual(empty.totals.size, 0);\nconsole.log(\u0027Task 32 passed\u0027);\n","category":"syntax_completion"} {"id":"33","testsource":"devbench-syntax-completion","language":"typescript","prefix":"class Registry\u003cT extends { id: string }\u003e {\n private items: Map\u003cstring, T\u003e = new Map();\n\n add(item: T): this {\n this.items.set(item.id, item);\n return this;\n }\n\n findWhere\u003cK extends keyof T\u003e(key: K, value: T[K]): T[] {\n","golden_completion":" const result: T[] = [];\n for (const item of this.items.values()) {\n if (item[key] === value) {\n result.push(item);\n }\n }\n return result;\n","suffix":" }\n\n get size(): number {\n return this.items.size;\n }\n}\n","assertions":"const assert = require(\u0027assert\u0027);\ninterface User { id: string; name: string; role: string; }\nconst reg = new Registry\u003cUser\u003e();\nreg.add({ id: \u00271\u0027, name: \u0027Alice\u0027, role: \u0027admin\u0027 });\nreg.add({ id: \u00272\u0027, name: \u0027Bob\u0027, role: \u0027user\u0027 });\nreg.add({ id: \u00273\u0027, name: \u0027Charlie\u0027, role: \u0027admin\u0027 });\n\nconst admins = reg.findWhere(\u0027role\u0027, \u0027admin\u0027);\nassert.strictEqual(admins.length, 2);\nassert.strictEqual(admins[0].name, \u0027Alice\u0027);\nassert.strictEqual(admins[1].name, \u0027Charlie\u0027);\n\nconst bobs = reg.findWhere(\u0027name\u0027, \u0027Bob\u0027);\nassert.strictEqual(bobs.length, 1);\nassert.strictEqual(bobs[0].id, \u00272\u0027);\n\nassert.strictEqual(reg.size, 3);\nassert.deepStrictEqual(reg.findWhere(\u0027name\u0027, \u0027Nobody\u0027), []);\nconsole.log(\u0027Task 33 passed\u0027);\n","category":"syntax_completion"} {"id":"34","testsource":"devbench-syntax-completion","language":"typescript","prefix":"class RingBuffer\u003cT\u003e {\n private buf: T[];\n private head: number = 0;\n private count: number = 0;\n\n constructor(private capacity: number) {\n this.buf = new Array\u003cT\u003e(capacity);\n }\n\n push(item: T): T | undefined {\n const idx = (this.head + this.count) % this.capacity;\n let evicted: T | undefined;\n if (this.count === this.capacity) {\n evicted = this.buf[this.head];\n this.head = (this.head + 1) % this.capacity;\n } else {\n this.count++;\n }\n this.buf[idx] = item;\n return evicted;\n }\n\n *[Symbol.iterator](): Generator\u003cT, void, undefined\u003e {\n","golden_completion":" for (let i = 0; i \u003c this.count; i++) {\n yield this.buf[(this.head + i) % this.capacity];\n }\n","suffix":" }\n\n get length(): number {\n return this.count;\n }\n\n toArray(): T[] {\n return [...this];\n }\n}\n","assertions":"const assert = require(\u0027assert\u0027);\nconst rb = new RingBuffer\u003cnumber\u003e(3);\nassert.strictEqual(rb.push(1), undefined);\nassert.strictEqual(rb.push(2), undefined);\nassert.strictEqual(rb.push(3), undefined);\nassert.deepStrictEqual(rb.toArray(), [1, 2, 3]);\n\nassert.strictEqual(rb.push(4), 1);\nassert.deepStrictEqual(rb.toArray(), [2, 3, 4]);\n\nassert.strictEqual(rb.push(5), 2);\nassert.strictEqual(rb.push(6), 3);\nassert.deepStrictEqual(rb.toArray(), [4, 5, 6]);\n\nconst items: number[] = [];\nfor (const x of rb) items.push(x);\nassert.deepStrictEqual(items, [4, 5, 6]);\n\nconst empty = new RingBuffer\u003cstring\u003e(2);\nassert.deepStrictEqual(empty.toArray(), []);\nconsole.log(\u0027Task 34 passed\u0027);\n","category":"syntax_completion"} {"id":"35","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Shape =\n | { kind: \u0027circle\u0027; radius: number }\n | { kind: \u0027rect\u0027; width: number; height: number }\n | { kind: \u0027triangle\u0027; base: number; height: number }\n | { kind: \u0027line\u0027; length: number };\n\ntype ShapeHandlers = {\n [K in Shape[\u0027kind\u0027]]: (shape: Extract\u003cShape, { kind: K }\u003e) =\u003e number;\n};\n\nfunction createMeasurer(handlers: ShapeHandlers): (shape: Shape) =\u003e number {\n","golden_completion":" return (shape: Shape): number =\u003e {\n const handler = handlers[shape.kind] as (shape: Shape) =\u003e number;\n return handler(shape);\n","suffix":" };\n}\n\nconst area = createMeasurer({\n circle: (s) =\u003e Math.PI * s.radius ** 2,\n rect: (s) =\u003e s.width * s.height,\n triangle: (s) =\u003e 0.5 * s.base * s.height,\n line: (_s) =\u003e 0,\n});\n","assertions":"const assert = require(\u0027assert\u0027);\nconst eps = 0.001;\nassert.ok(Math.abs(area({ kind: \u0027circle\u0027, radius: 1 }) - Math.PI) \u003c eps);\nassert.strictEqual(area({ kind: \u0027rect\u0027, width: 3, height: 4 }), 12);\nassert.strictEqual(area({ kind: \u0027triangle\u0027, base: 6, height: 3 }), 9);\nassert.strictEqual(area({ kind: \u0027line\u0027, length: 10 }), 0);\n\nconst perimeter = createMeasurer({\n circle: (s) =\u003e 2 * Math.PI * s.radius,\n rect: (s) =\u003e 2 * (s.width + s.height),\n triangle: (s) =\u003e s.base + s.height + Math.sqrt(s.base ** 2 + s.height ** 2),\n line: (s) =\u003e s.length,\n});\nassert.strictEqual(perimeter({ kind: \u0027line\u0027, length: 7 }), 7);\nassert.ok(Math.abs(perimeter({ kind: \u0027circle\u0027, radius: 1 }) - 2 * Math.PI) \u003c eps);\nconsole.log(\u0027Task 35 passed\u0027);\n","category":"syntax_completion"} {"id":"36","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface BatchResult\u003cT\u003e {\n batch: number;\n items: T[];\n hasMore: boolean;\n}\n\ninterface FetchStats {\n totalBatches: number;\n totalItems: number;\n}\n\nasync function* paginatedFetch\u003cT\u003e(\n fetcher: (page: number) =\u003e Promise\u003cBatchResult\u003cT\u003e\u003e\n): AsyncGenerator\u003cT, FetchStats, undefined\u003e {\n let page = 0;\n let totalItems = 0;\n let hasMore = true;\n\n while (hasMore) {\n const result = await fetcher(page);\n","golden_completion":" for (const item of result.items) {\n yield item;\n totalItems++;\n }\n hasMore = result.hasMore;\n page++;\n }\n\n return { totalBatches: page, totalItems };\n","suffix":"}\n\nasync function collectWithStats\u003cT\u003e(\n gen: AsyncGenerator\u003cT, FetchStats, undefined\u003e\n): Promise\u003c{ items: T[]; stats: FetchStats }\u003e {\n const items: T[] = [];\n let result = await gen.next();\n while (!result.done) {\n items.push(result.value);\n result = await gen.next();\n }\n return { items, stats: result.value };\n}\n","assertions":"const assert = require(\u0027assert\u0027);\n\nconst pages: BatchResult\u003cstring\u003e[] = [\n { batch: 0, items: [\u0027a\u0027, \u0027b\u0027], hasMore: true },\n { batch: 1, items: [\u0027c\u0027], hasMore: true },\n { batch: 2, items: [\u0027d\u0027, \u0027e\u0027], hasMore: false },\n];\n\nasync function mockFetch(page: number): Promise\u003cBatchResult\u003cstring\u003e\u003e {\n return pages[page];\n}\n\ncollectWithStats(paginatedFetch(mockFetch)).then(({ items, stats }) =\u003e {\n assert.deepStrictEqual(items, [\u0027a\u0027, \u0027b\u0027, \u0027c\u0027, \u0027d\u0027, \u0027e\u0027]);\n assert.strictEqual(stats.totalBatches, 3);\n assert.strictEqual(stats.totalItems, 5);\n console.log(\u0027Task 36 passed\u0027);\n}).catch(e =\u003e { console.error(e); process.exit(1); });\n","category":"syntax_completion"} {"id":"37","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type EventMap = {\n click: { x: number; y: number };\n keypress: { key: string; code: number };\n scroll: { deltaX: number; deltaY: number };\n};\n\ntype Listener\u003cK extends keyof EventMap\u003e = (event: EventMap[K]) =\u003e void;\n\nclass TypedEmitter {\n private listeners: { [K in keyof EventMap]?: Listener\u003cK\u003e[] } = {};\n\n on\u003cK extends keyof EventMap\u003e(event: K, listener: Listener\u003cK\u003e): () =\u003e void {\n","golden_completion":" if (!this.listeners[event]) {\n this.listeners[event] = [];\n }\n (this.listeners[event] as Listener\u003cK\u003e[]).push(listener);\n return () =\u003e {\n const arr = this.listeners[event] as Listener\u003cK\u003e[];\n const idx = arr.indexOf(listener);\n if (idx \u003e= 0) arr.splice(idx, 1);\n };\n","suffix":" }\n\n emit\u003cK extends keyof EventMap\u003e(event: K, data: EventMap[K]): void {\n const arr = this.listeners[event] as Listener\u003cK\u003e[] | undefined;\n if (arr) arr.forEach(fn =\u003e fn(data));\n }\n}\n","assertions":"const assert = require(\u0027assert\u0027);\nconst emitter = new TypedEmitter();\nconst log: string[] = [];\n\nconst unsub = emitter.on(\u0027click\u0027, (e) =\u003e log.push(`click:${e.x},${e.y}`));\nemitter.on(\u0027keypress\u0027, (e) =\u003e log.push(`key:${e.key}`));\n\nemitter.emit(\u0027click\u0027, { x: 10, y: 20 });\nemitter.emit(\u0027keypress\u0027, { key: \u0027a\u0027, code: 65 });\nassert.deepStrictEqual(log, [\u0027click:10,20\u0027, \u0027key:a\u0027]);\n\nunsub();\nemitter.emit(\u0027click\u0027, { x: 30, y: 40 });\nassert.deepStrictEqual(log, [\u0027click:10,20\u0027, \u0027key:a\u0027]);\n\nemitter.on(\u0027scroll\u0027, (e) =\u003e log.push(`scroll:${e.deltaY}`));\nemitter.emit(\u0027scroll\u0027, { deltaX: 0, deltaY: 100 });\nassert.deepStrictEqual(log, [\u0027click:10,20\u0027, \u0027key:a\u0027, \u0027scroll:100\u0027]);\nconsole.log(\u0027Task 37 passed\u0027);\n","category":"syntax_completion"} {"id":"38","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type DeepReadonly\u003cT\u003e = T extends Function\n ? T\n : T extends object\n ? { readonly [K in keyof T]: DeepReadonly\u003cT[K]\u003e }\n : T;\n\ninterface FreezeLog {\n sets: Array\u003c{ path: string; value: unknown }\u003e;\n deletes: string[];\n}\n\nfunction deepFreeze\u003cT extends object\u003e(obj: T, log: FreezeLog, path: string = \u0027\u0027): DeepReadonly\u003cT\u003e {\n const makePath = (p: string, prop: string | symbol) =\u003e p ? `${p}.${String(prop)}` : String(prop);\n return new Proxy(obj, {\n get(target: any, prop: string | symbol): any {\n const val = Reflect.get(target, prop);\n if (typeof prop === \u0027symbol\u0027) return val;\n if (val !== null \u0026\u0026 typeof val === \u0027object\u0027 \u0026\u0026 !Array.isArray(val)) {\n return deepFreeze(val, log, makePath(path, prop));\n }\n return val;\n },\n set(_target: any, prop: string | symbol, value: unknown): boolean {\n","golden_completion":" log.sets.push({ path: makePath(path, prop), value });\n return true;\n },\n deleteProperty(_target: any, prop: string | symbol): boolean {\n log.deletes.push(makePath(path, prop));\n return true;\n },\n","suffix":" }) as DeepReadonly\u003cT\u003e;\n}\n","assertions":"const assert = require(\u0027assert\u0027);\ninterface Config {\n server: { host: string; port: number };\n db: { url: string };\n name: string;\n}\nconst log: FreezeLog = { sets: [], deletes: [] };\nconst cfg: Config = { server: { host: \u0027localhost\u0027, port: 3000 }, db: { url: \u0027mongo://...\u0027 }, name: \u0027app\u0027 };\nconst frozen = deepFreeze(cfg, log);\n\nassert.strictEqual(frozen.name, \u0027app\u0027);\nassert.strictEqual(frozen.server.host, \u0027localhost\u0027);\n\n(frozen as any).name = \u0027changed\u0027;\nassert.strictEqual(log.sets.length, 1);\nassert.strictEqual(log.sets[0].path, \u0027name\u0027);\n\n(frozen as any).server.port = 8080;\nassert.strictEqual(log.sets.length, 2);\nassert.strictEqual(log.sets[1].path, \u0027server.port\u0027);\n\ndelete (frozen as any).db;\nassert.deepStrictEqual(log.deletes, [\u0027db\u0027]);\n\nassert.strictEqual(cfg.name, \u0027app\u0027);\nassert.strictEqual(cfg.server.port, 3000);\nconsole.log(\u0027Task 38 passed\u0027);\n","category":"syntax_completion"} {"id":"39","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface QueryState {\n table: string;\n conditions: string[];\n ordering: string | null;\n limitVal: number | null;\n fields: string[];\n}\n\nclass QueryBuilder {\n private state: QueryState;\n\n constructor(table: string) {\n this.state = { table, conditions: [], ordering: null, limitVal: null, fields: [] };\n }\n\n select(...fields: string[]): this { this.state.fields.push(...fields); return this; }\n where(condition: string): this { this.state.conditions.push(condition); return this; }\n orderBy(field: string): this { this.state.ordering = field; return this; }\n limit(n: number): this { this.state.limitVal = n; return this; }\n\n build(): string {\n const cols = this.state.fields.length \u003e 0 ? this.state.fields.join(\u0027, \u0027) : \u0027*\u0027;\n","golden_completion":" let sql = `SELECT ${cols} FROM ${this.state.table}`;\n if (this.state.conditions.length \u003e 0) {\n sql += ` WHERE ${this.state.conditions.join(\u0027 AND \u0027)}`;\n }\n if (this.state.ordering) {\n sql += ` ORDER BY ${this.state.ordering}`;\n }\n if (this.state.limitVal !== null) {\n sql += ` LIMIT ${this.state.limitVal}`;\n }\n return sql;\n }\n","suffix":"}\n","assertions":"const assert = require(\u0027assert\u0027);\nconst q1 = new QueryBuilder(\u0027users\u0027)\n .select(\u0027name\u0027, \u0027email\u0027)\n .where(\u0027age \u003e 18\u0027)\n .where(\u0027active = true\u0027)\n .orderBy(\u0027name\u0027)\n .limit(10)\n .build();\nassert.strictEqual(q1, \u0027SELECT name, email FROM users WHERE age \u003e 18 AND active = true ORDER BY name LIMIT 10\u0027);\n\nconst q2 = new QueryBuilder(\u0027products\u0027).build();\nassert.strictEqual(q2, \u0027SELECT * FROM products\u0027);\n\nconst q3 = new QueryBuilder(\u0027orders\u0027)\n .where(\u0027total \u003e 100\u0027)\n .limit(5)\n .build();\nassert.strictEqual(q3, \u0027SELECT * FROM orders WHERE total \u003e 100 LIMIT 5\u0027);\n\nconst q4 = new QueryBuilder(\u0027items\u0027)\n .select(\u0027id\u0027)\n .orderBy(\u0027price\u0027)\n .build();\nassert.strictEqual(q4, \u0027SELECT id FROM items ORDER BY price\u0027);\nconsole.log(\u0027Task 39 passed\u0027);\n","category":"syntax_completion"} {"id":"40","testsource":"devbench-syntax-completion","language":"typescript","prefix":"/**\n * Middleware receives the current state and a `next` callback.\n * Calling next() invokes the next middleware in the chain.\n * The last middleware (or one that doesn\u0027t call next) acts as the terminal.\n */\ntype Middleware\u003cTState\u003e = (\n state: TState,\n next: () =\u003e TState\n) =\u003e TState;\n\nfunction composeMiddleware\u003cTState\u003e(\n ...middlewares: Middleware\u003cTState\u003e[]\n): (initial: TState) =\u003e TState {\n","golden_completion":" return (initial: TState): TState =\u003e {\n function dispatch(i: number, state: TState): TState {\n if (i \u003e= middlewares.length) return state;\n const mw = middlewares[i];\n return mw(state, () =\u003e dispatch(i + 1, state));\n }\n\n return dispatch(0, initial);\n };\n","suffix":"}\n","assertions":"const assert = require(\u0027assert\u0027);\n\ninterface AppState {\n value: number;\n log: string[];\n}\n\nconst doubler: Middleware\u003cAppState\u003e = (state, next) =\u003e {\n const s = next();\n return { value: s.value * 2, log: [...s.log, \u0027doubled\u0027] };\n};\n\nconst adder: Middleware\u003cAppState\u003e = (state, next) =\u003e {\n const s = next();\n return { value: s.value + 10, log: [...s.log, \u0027added10\u0027] };\n};\n\nconst logger: Middleware\u003cAppState\u003e = (state, _next) =\u003e {\n return { value: state.value, log: [...state.log, \u0027logged\u0027] };\n};\n\nconst pipeline = composeMiddleware(doubler, adder, logger);\nconst result = pipeline({ value: 5, log: [] });\n// logger runs first (innermost): {5, [\u0027logged\u0027]}\n// adder runs next: next() returns {5, [\u0027logged\u0027]}, adds 10 -\u003e {15, [\u0027logged\u0027,\u0027added10\u0027]}\n// doubler runs last: next() returns {5, [\u0027logged\u0027]}, doubles -\u003e wait...\n// Actually: dispatch(2, {5,[]}) -\u003e doubler({5,[]}, ()=\u003edispatch(1, {5,[]}))\n// doubler calls next() -\u003e dispatch(1, {5,[]}) -\u003e adder({5,[]}, ()=\u003edispatch(0, {5,[]}))\n// adder calls next() -\u003e dispatch(0, {5,[]}) -\u003e logger({5,[]}, ()=\u003edispatch(-1,{5,[]}))\n// logger ignores next, returns {5, [\u0027logged\u0027]}\n// adder gets {5,[\u0027logged\u0027]}, adds 10 -\u003e {15, [\u0027logged\u0027,\u0027added10\u0027]}\n// doubler gets {15,[\u0027logged\u0027,\u0027added10\u0027]}, doubles -\u003e {30, [\u0027logged\u0027,\u0027added10\u0027,\u0027doubled\u0027]}\nassert.strictEqual(result.value, 30);\nassert.deepStrictEqual(result.log, [\u0027logged\u0027, \u0027added10\u0027, \u0027doubled\u0027]);\n\nconst single = composeMiddleware(logger);\nconst r2 = single({ value: 7, log: [] });\nassert.strictEqual(r2.value, 7);\nassert.deepStrictEqual(r2.log, [\u0027logged\u0027]);\n\nconst empty = composeMiddleware\u003cAppState\u003e();\nconst r3 = empty({ value: 42, log: [] });\nassert.strictEqual(r3.value, 42);\nconsole.log(\u0027Task 40 passed\u0027);\n","category":"syntax_completion"} {"id":"41","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface LoadSpec {\n name: string;\n readyAt: number;\n maxAttempts: number;\n delayMs: number;\n}\n\ninterface LoadResult {\n name: string;\n ok: boolean;\n value: string;\n attempts: string[];\n}\n\nfunction loadWithTimers(specs: LoadSpec[]): Promise\u003cLoadResult[]\u003e {\n return Promise.allSettled(\n specs.map((spec): Promise\u003cLoadResult\u003e =\u003e {\n const attempts: string[] = [];\n let current = 0;\n return new Promise\u003cstring\u003e((resolve, reject) =\u003e {\n const tick = (): void =\u003e {\n setTimeout(() =\u003e {\n current++;\n attempts.push(`${spec.name}:${current}`);\n if (current \u003c spec.readyAt) {\n if (current \u003e= spec.maxAttempts) reject(new Error(attempts.join(\u0027|\u0027)));\n else tick();\n return;\n }\n","golden_completion":" resolve(`${spec.name}@${current}`);\n }, spec.delayMs);\n };\n tick();\n })\n .then((value: string): LoadResult =\u003e ({ name: spec.name, ok: true, value, attempts: [...attempts] }))\n .catch((err: Error): LoadResult =\u003e ({ name: spec.name, ok: false, value: err.message, attempts: [...attempts] }));\n","suffix":" })\n ).then((settled): LoadResult[] =\u003e settled.map((entry, index) =\u003e {\n if (entry.status === \u0027fulfilled\u0027) return entry.value;\n return {\n name: specs[index].name,\n ok: false,\n value: String(entry.reason),\n attempts: [],\n };\n }));\n}\n\nfunction visibleLoads(): Promise\u003cLoadResult[]\u003e {\n return loadWithTimers([\n { name: \u0027user\u0027, readyAt: 1, maxAttempts: 3, delayMs: 1 },\n { name: \u0027settings\u0027, readyAt: 3, maxAttempts: 5, delayMs: 1 },\n { name: \u0027permissions\u0027, readyAt: 4, maxAttempts: 2, delayMs: 1 },\n ]);\n}\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n const loaded = await visibleLoads();\n assert.deepStrictEqual(loaded, [\n { name: \u0027user\u0027, ok: true, value: \u0027user@1\u0027, attempts: [\u0027user:1\u0027] },\n { name: \u0027settings\u0027, ok: true, value: \u0027settings@3\u0027, attempts: [\u0027settings:1\u0027, \u0027settings:2\u0027, \u0027settings:3\u0027] },\n { name: \u0027permissions\u0027, ok: false, value: \u0027permissions:1|permissions:2\u0027, attempts: [\u0027permissions:1\u0027, \u0027permissions:2\u0027] },\n ]);\n\n const immediate = await loadWithTimers([{ name: \u0027cache\u0027, readyAt: 0, maxAttempts: 1, delayMs: 1 }]);\n assert.deepStrictEqual(immediate, [\n { name: \u0027cache\u0027, ok: true, value: \u0027cache@1\u0027, attempts: [\u0027cache:1\u0027] },\n ]);\n console.log(\u0027Task 41 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"42","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface ApiResponse\u003cT\u003e {\n ok: boolean;\n data?: T;\n error?: string;\n}\n\nfunction simulateApi(shouldFail: boolean): Promise\u003cApiResponse\u003cstring[]\u003e\u003e {\n if (shouldFail) {\n return Promise.reject(new Error(\u0027Network failure\u0027));\n }\n return Promise.resolve({ ok: true, data: [\u0027item1\u0027, \u0027item2\u0027] });\n}\n\nfunction processApiCall(shouldFail: boolean): Promise\u003cstring\u003e {\n return simulateApi(shouldFail)\n","golden_completion":" .then((response: ApiResponse\u003cstring[]\u003e) =\u003e {\n if (!response.ok || !response.data) {\n throw new Error(response.error || \u0027Unknown error\u0027);\n }\n return response.data.join(\u0027, \u0027);\n })\n .catch((err: Error) =\u003e {\n return `FAILED: ${err.message}`;\n });\n","suffix":"}\n\nasync function runTests(): Promise\u003cvoid\u003e {\n const success = await processApiCall(false);\n console.log(\u0027success:\u0027, success);\n const failure = await processApiCall(true);\n console.log(\u0027failure:\u0027, failure);\n}\nrunTests();\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n const s = await processApiCall(false);\n assert.strictEqual(s, \u0027item1, item2\u0027);\n const f = await processApiCall(true);\n assert.strictEqual(f, \u0027FAILED: Network failure\u0027);\n console.log(\u0027Task 42 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"43","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface StepSpec {\n label: string;\n failUntil: number;\n maxAttempts: number;\n delayMs: number;\n}\n\ntype BatchReport = {\n label: string;\n status: \u0027ok\u0027 | \u0027error\u0027;\n value: string;\n attempts: number;\n};\n\nfunction flakyStep(label: string, attempt: number, failUntil: number): Promise\u003cstring\u003e {\n return new Promise((resolve, reject) =\u003e {\n setTimeout(() =\u003e {\n if (attempt \u003c= failUntil) reject(new Error(`${label}:try${attempt}`));\n else resolve(`${label}:ok@${attempt}`);\n }, 1);\n });\n}\n\nfunction runRetryBatch(specs: StepSpec[]): Promise\u003cBatchReport[]\u003e {\n return Promise.allSettled(\n specs.map((spec): Promise\u003cBatchReport\u003e =\u003e {\n let attempt = 1;\n return flakyStep(spec.label, attempt, spec.failUntil)\n .catch((err: Error): Promise\u003cstring\u003e =\u003e {\n","golden_completion":" if (attempt \u003e= spec.maxAttempts) throw err;\n return new Promise\u003cstring\u003e((resolve, reject) =\u003e {\n setTimeout(() =\u003e {\n attempt++;\n flakyStep(spec.label, attempt, spec.failUntil)\n .then(resolve)\n .catch((retryErr: Error) =\u003e reject(new Error(`${err.message}|${retryErr.message}`)));\n }, spec.delayMs);\n });\n })\n .then((value: string): BatchReport =\u003e ({ label: spec.label, status: \u0027ok\u0027, value, attempts: attempt }))\n .catch((finalErr: Error): BatchReport =\u003e ({ label: spec.label, status: \u0027error\u0027, value: finalErr.message, attempts: attempt }));\n","suffix":" })\n ).then((settled): BatchReport[] =\u003e settled.map((item, index) =\u003e {\n if (item.status === \u0027fulfilled\u0027) return item.value;\n return {\n label: specs[index].label,\n status: \u0027error\u0027,\n value: String(item.reason),\n attempts: specs[index].maxAttempts,\n };\n }));\n}\n\nfunction visibleRetryPlan(): Promise\u003cBatchReport[]\u003e {\n return runRetryBatch([\n { label: \u0027alpha\u0027, failUntil: 0, maxAttempts: 2, delayMs: 1 },\n { label: \u0027beta\u0027, failUntil: 1, maxAttempts: 3, delayMs: 1 },\n { label: \u0027gamma\u0027, failUntil: 3, maxAttempts: 2, delayMs: 1 },\n ]);\n}\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n const reports = await visibleRetryPlan();\n assert.deepStrictEqual(reports, [\n { label: \u0027alpha\u0027, status: \u0027ok\u0027, value: \u0027alpha:ok@1\u0027, attempts: 1 },\n { label: \u0027beta\u0027, status: \u0027ok\u0027, value: \u0027beta:ok@2\u0027, attempts: 2 },\n { label: \u0027gamma\u0027, status: \u0027error\u0027, value: \u0027gamma:try1|gamma:try2\u0027, attempts: 2 },\n ]);\n\n const single = await runRetryBatch([\n { label: \u0027delta\u0027, failUntil: 2, maxAttempts: 1, delayMs: 1 },\n ]);\n assert.deepStrictEqual(single, [\n { label: \u0027delta\u0027, status: \u0027error\u0027, value: \u0027delta:try1\u0027, attempts: 1 },\n ]);\n console.log(\u0027Task 43 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"44","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface Resource {\n id: string;\n closed: boolean;\n close(): void;\n}\n\ninterface WorkResult {\n resourceId: string;\n status: \u0027ok\u0027 | \u0027error\u0027;\n message: string;\n cleaned: boolean;\n}\n\nfunction createResource(id: string): Resource {\n return { id, closed: false, close() { this.closed = true; } };\n}\n\nfunction doWork(r: Resource, fail: boolean): Promise\u003cstring\u003e {\n if (fail) return Promise.reject(new Error(`work failed on ${r.id}`));\n return Promise.resolve(`done with ${r.id}`);\n}\n\nconst results: WorkResult[] = [];\n\nasync function processItem(id: string, fail: boolean): Promise\u003cvoid\u003e {\n const resource = createResource(id);\n try {\n const msg = await doWork(resource, fail);\n","golden_completion":" results.push({ resourceId: id, status: \u0027ok\u0027, message: msg, cleaned: false });\n } catch (err) {\n const e = err as Error;\n results.push({ resourceId: id, status: \u0027error\u0027, message: e.message, cleaned: false });\n } finally {\n resource.close();\n const last = results[results.length - 1];\n if (last.resourceId === id) last.cleaned = resource.closed;\n }\n","suffix":"}\n\n(async () =\u003e {\n await processItem(\u0027r1\u0027, false);\n await processItem(\u0027r2\u0027, true);\n console.log(JSON.stringify(results));\n})();\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n // results already populated by the IIFE in suffix\n // wait a tick to ensure the suffix IIFE completes\n await new Promise(r =\u003e setTimeout(r, 100));\n assert.strictEqual(results.length, 2);\n assert.deepStrictEqual(results[0], {\n resourceId: \u0027r1\u0027, status: \u0027ok\u0027, message: \u0027done with r1\u0027, cleaned: true\n });\n assert.deepStrictEqual(results[1], {\n resourceId: \u0027r2\u0027, status: \u0027error\u0027, message: \u0027work failed on r2\u0027, cleaned: true\n });\n console.log(\u0027Task 44 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"45","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type TaskInput = { id: number; shouldFail: boolean };\n\ninterface SuccessResult {\n kind: \u0027success\u0027;\n id: number;\n value: string;\n}\n\ninterface FailureResult {\n kind: \u0027failure\u0027;\n id: number;\n reason: string;\n}\n\ntype TaskResult = SuccessResult | FailureResult;\n\nfunction executeTask(input: TaskInput): Promise\u003cstring\u003e {\n if (input.shouldFail) {\n return Promise.reject(new Error(`task ${input.id} exploded`));\n }\n return Promise.resolve(`result_${input.id}`);\n}\n\nasync function runAll(inputs: TaskInput[]): Promise\u003cTaskResult[]\u003e {\n const settled = await Promise.allSettled(\n inputs.map(i =\u003e executeTask(i))\n );\n","golden_completion":" return settled.map((outcome, idx): TaskResult =\u003e {\n if (outcome.status === \u0027fulfilled\u0027) {\n return { kind: \u0027success\u0027, id: inputs[idx].id, value: outcome.value };\n } else {\n return { kind: \u0027failure\u0027, id: inputs[idx].id, reason: (outcome.reason as Error).message };\n }\n });\n","suffix":"}\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n const results = await runAll([\n { id: 1, shouldFail: false },\n { id: 2, shouldFail: true },\n { id: 3, shouldFail: false },\n ]);\n assert.strictEqual(results.length, 3);\n assert.deepStrictEqual(results[0], { kind: \u0027success\u0027, id: 1, value: \u0027result_1\u0027 });\n assert.deepStrictEqual(results[1], { kind: \u0027failure\u0027, id: 2, reason: \u0027task 2 exploded\u0027 });\n assert.deepStrictEqual(results[2], { kind: \u0027success\u0027, id: 3, value: \u0027result_3\u0027 });\n console.log(\u0027Task 45 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"46","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Priority = \u0027critical\u0027 | \u0027high\u0027 | \u0027medium\u0027 | \u0027low\u0027;\n\ninterface Ticket {\n id: string;\n priority: Priority;\n assignee: string | null;\n overdue: boolean;\n}\n\ninterface Action {\n ticketId: string;\n action: string;\n urgency: number;\n}\n\nfunction triageTickets(tickets: Ticket[]): Action[] {\n return tickets.map((t: Ticket): Action =\u003e {\n","golden_completion":" const urgency: number =\n t.priority === \u0027critical\u0027 ? (t.overdue ? 100 : 80) :\n t.priority === \u0027high\u0027 ? (t.overdue ? 70 : 50) :\n t.priority === \u0027medium\u0027 ? (t.overdue ? 40 : 20) :\n (t.overdue ? 15 : 5);\n const action: string =\n urgency \u003e= 80 ? `ESCALATE${t.assignee ? \u0027\u0027 : \u0027_UNASSIGNED\u0027}` :\n urgency \u003e= 50 ? `NOTIFY${t.assignee ? \u0027\u0027 : \u0027_ASSIGN\u0027}` :\n t.assignee ? \u0027MONITOR\u0027 : \u0027QUEUE\u0027;\n return { ticketId: t.id, action, urgency };\n","suffix":" });\n}\n","assertions":"import assert from \u0027assert\u0027;\n\nconst tickets: Ticket[] = [\n { id: \u0027T1\u0027, priority: \u0027critical\u0027, assignee: \u0027Bob\u0027, overdue: true },\n { id: \u0027T2\u0027, priority: \u0027critical\u0027, assignee: null, overdue: false },\n { id: \u0027T3\u0027, priority: \u0027high\u0027, assignee: \u0027Alice\u0027, overdue: true },\n { id: \u0027T4\u0027, priority: \u0027high\u0027, assignee: null, overdue: false },\n { id: \u0027T5\u0027, priority: \u0027medium\u0027, assignee: \u0027Eve\u0027, overdue: false },\n { id: \u0027T6\u0027, priority: \u0027low\u0027, assignee: null, overdue: true },\n];\nconst actions = triageTickets(tickets);\nassert.deepStrictEqual(actions[0], { ticketId: \u0027T1\u0027, action: \u0027ESCALATE\u0027, urgency: 100 });\nassert.deepStrictEqual(actions[1], { ticketId: \u0027T2\u0027, action: \u0027ESCALATE_UNASSIGNED\u0027, urgency: 80 });\nassert.deepStrictEqual(actions[2], { ticketId: \u0027T3\u0027, action: \u0027NOTIFY\u0027, urgency: 70 });\nassert.deepStrictEqual(actions[3], { ticketId: \u0027T4\u0027, action: \u0027NOTIFY_ASSIGN\u0027, urgency: 50 });\nassert.deepStrictEqual(actions[4], { ticketId: \u0027T5\u0027, action: \u0027MONITOR\u0027, urgency: 20 });\nassert.deepStrictEqual(actions[5], { ticketId: \u0027T6\u0027, action: \u0027QUEUE\u0027, urgency: 15 });\nconsole.log(\u0027Task 46 passed\u0027);\n","category":"syntax_completion"} {"id":"47","testsource":"devbench-syntax-completion","language":"typescript","prefix":"class AppError extends Error {\n constructor(public code: number, message: string) {\n super(message);\n this.name = \u0027AppError\u0027;\n }\n}\n\nclass ValidationError extends AppError {\n constructor(public field: string, message: string) {\n super(400, message);\n this.name = \u0027ValidationError\u0027;\n }\n}\n\nclass AuthError extends AppError {\n constructor(public realm: string) {\n super(401, `unauthorized in ${realm}`);\n this.name = \u0027AuthError\u0027;\n }\n}\n\ninterface ErrorReport {\n type: string;\n code: number;\n detail: string;\n}\n\nasync function riskyOp(mode: string): Promise\u003cstring\u003e {\n if (mode === \u0027validate\u0027) throw new ValidationError(\u0027email\u0027, \u0027invalid format\u0027);\n if (mode === \u0027auth\u0027) throw new AuthError(\u0027admin\u0027);\n if (mode === \u0027unknown\u0027) throw new TypeError(\u0027unexpected type\u0027);\n return `ok:${mode}`;\n}\n\nasync function handleOp(mode: string): Promise\u003cstring | ErrorReport\u003e {\n try {\n return await riskyOp(mode);\n","golden_completion":" } catch (err) {\n if (err instanceof ValidationError) {\n return { type: \u0027validation\u0027, code: err.code, detail: `${err.field}: ${err.message}` };\n } else if (err instanceof AuthError) {\n return { type: \u0027auth\u0027, code: err.code, detail: err.realm };\n } else if (err instanceof AppError) {\n return { type: \u0027app\u0027, code: err.code, detail: err.message };\n } else {\n return { type: \u0027unknown\u0027, code: 500, detail: String(err) };\n }\n }\n","suffix":"}\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n const ok = await handleOp(\u0027safe\u0027);\n assert.strictEqual(ok, \u0027ok:safe\u0027);\n\n const v = await handleOp(\u0027validate\u0027) as ErrorReport;\n assert.strictEqual(v.type, \u0027validation\u0027);\n assert.strictEqual(v.code, 400);\n assert.strictEqual(v.detail, \u0027email: invalid format\u0027);\n\n const a = await handleOp(\u0027auth\u0027) as ErrorReport;\n assert.strictEqual(a.type, \u0027auth\u0027);\n assert.strictEqual(a.code, 401);\n assert.strictEqual(a.detail, \u0027admin\u0027);\n\n const u = await handleOp(\u0027unknown\u0027) as ErrorReport;\n assert.strictEqual(u.type, \u0027unknown\u0027);\n assert.strictEqual(u.code, 500);\n assert.ok(u.detail.includes(\u0027unexpected type\u0027));\n\n console.log(\u0027Task 47 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"48","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface StreamEvent {\n source: string;\n data: number;\n}\n\ninterface AggregateResult {\n source: string;\n sum: number;\n count: number;\n aborted: boolean;\n}\n\nasync function* generateEvents(source: string, values: number[]): AsyncGenerator\u003cStreamEvent\u003e {\n for (const v of values) {\n yield { source, data: v };\n }\n}\n\nasync function aggregateStreams(\n streams: AsyncGenerator\u003cStreamEvent\u003e[],\n limit: number\n): Promise\u003cAggregateResult[]\u003e {\n const accumulators = new Map\u003cstring, { sum: number; count: number }\u003e();\n let totalProcessed = 0;\n let aborted = false;\n\n outer:\n for (const stream of streams) {\n try {\n for await (const event of stream) {\n const acc = accumulators.get(event.source) ?? { sum: 0, count: 0 };\n","golden_completion":" acc.sum += event.data;\n acc.count++;\n accumulators.set(event.source, acc);\n totalProcessed++;\n if (totalProcessed \u003e= limit) {\n aborted = true;\n break outer;\n }\n }\n } catch (err) {\n const src = (err as Error).message || \u0027unknown\u0027;\n accumulators.set(`error:${src}`, { sum: -1, count: 0 });\n }\n","suffix":" }\n\n const results: AggregateResult[] = [];\n for (const [source, acc] of accumulators) {\n results.push({ source, sum: acc.sum, count: acc.count, aborted });\n }\n return results;\n}\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n // Test 1: normal aggregation without hitting limit\n const r1 = await aggregateStreams([\n generateEvents(\u0027A\u0027, [1, 2, 3]),\n generateEvents(\u0027B\u0027, [10, 20]),\n ], 100);\n const a = r1.find(r =\u003e r.source === \u0027A\u0027)!;\n assert.strictEqual(a.sum, 6);\n assert.strictEqual(a.count, 3);\n assert.strictEqual(a.aborted, false);\n const b = r1.find(r =\u003e r.source === \u0027B\u0027)!;\n assert.strictEqual(b.sum, 30);\n assert.strictEqual(b.count, 2);\n\n // Test 2: abort via limit\n const r2 = await aggregateStreams([\n generateEvents(\u0027X\u0027, [5, 10, 15, 20]),\n generateEvents(\u0027Y\u0027, [100, 200]),\n ], 3);\n const x = r2.find(r =\u003e r.source === \u0027X\u0027)!;\n assert.strictEqual(x.sum, 30);\n assert.strictEqual(x.count, 3);\n assert.strictEqual(x.aborted, true);\n // Y should not be present since we aborted during X\n assert.strictEqual(r2.find(r =\u003e r.source === \u0027Y\u0027), undefined);\n\n console.log(\u0027Task 48 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"49","testsource":"devbench-syntax-completion","language":"typescript","prefix":"interface FetchResult\u003cT\u003e {\n data: T;\n attempts: number;\n timedOut: boolean;\n}\n\nclass TimeoutError extends Error {\n constructor(ms: number) {\n super(`Timed out after ${ms}ms`);\n this.name = \u0027TimeoutError\u0027;\n }\n}\n\nfunction delay(ms: number): Promise\u003cnever\u003e {\n return new Promise((_, reject) =\u003e {\n setTimeout(() =\u003e reject(new TimeoutError(ms)), ms);\n });\n}\n\nasync function fetchWithRetry\u003cT\u003e(\n fn: () =\u003e Promise\u003cT\u003e,\n maxRetries: number,\n timeoutMs: number\n): Promise\u003cFetchResult\u003cT\u003e\u003e {\n let lastError: Error | null = null;\n for (let attempt = 1; attempt \u003c= maxRetries; attempt++) {\n try {\n","golden_completion":" const data = await Promise.race([fn(), delay(timeoutMs)]);\n return { data, attempts: attempt, timedOut: false };\n } catch (err) {\n lastError = err as Error;\n if (!(lastError instanceof TimeoutError)) {\n throw lastError;\n }\n }\n }\n return { data: undefined as unknown as T, attempts: maxRetries, timedOut: true };\n","suffix":"}\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n // Test 1: succeeds on first try\n let callCount = 0;\n const r1 = await fetchWithRetry(\n async () =\u003e { callCount++; return 42; },\n 3, 1000\n );\n assert.strictEqual(r1.data, 42);\n assert.strictEqual(r1.attempts, 1);\n assert.strictEqual(r1.timedOut, false);\n assert.strictEqual(callCount, 1);\n\n // Test 2: times out all retries\n const r2 = await fetchWithRetry(\n () =\u003e new Promise(resolve =\u003e setTimeout(() =\u003e resolve(\u0027late\u0027), 500)),\n 2, 10\n );\n assert.strictEqual(r2.attempts, 2);\n assert.strictEqual(r2.timedOut, true);\n\n // Test 3: non-timeout error throws immediately\n try {\n await fetchWithRetry(\n async () =\u003e { throw new Error(\u0027fatal\u0027); },\n 3, 1000\n );\n assert.fail(\u0027should have thrown\u0027);\n } catch (e: any) {\n assert.strictEqual(e.message, \u0027fatal\u0027);\n }\n\n console.log(\u0027Task 49 passed\u0027);\n})();\n","category":"syntax_completion"} {"id":"50","testsource":"devbench-syntax-completion","language":"typescript","prefix":"type Context = {\n path: string;\n headers: Map\u003cstring, string\u003e;\n body: unknown;\n status: number;\n response: string;\n logs: string[];\n};\n\ntype Middleware = (ctx: Context, next: () =\u003e Promise\u003cvoid\u003e) =\u003e Promise\u003cvoid\u003e;\n\nfunction compose(middlewares: Middleware[]): (ctx: Context) =\u003e Promise\u003cvoid\u003e {\n return function dispatch(ctx: Context): Promise\u003cvoid\u003e {\n let index = -1;\n function run(i: number): Promise\u003cvoid\u003e {\n if (i \u003c= index) return Promise.reject(new Error(\u0027next() called multiple times\u0027));\n index = i;\n const fn = middlewares[i];\n if (!fn) return Promise.resolve();\n","golden_completion":" return Promise.resolve(\n fn(ctx, () =\u003e run(i + 1))\n ).catch((err) =\u003e {\n ctx.logs.push(`error@${i}:${(err as Error).message}`);\n throw err;\n });\n }\n return run(0);\n };\n}\n","suffix":"\nconst logger: Middleware = async (ctx, next) =\u003e {\n ctx.logs.push(`\u003e\u003e ${ctx.path}`);\n await next();\n ctx.logs.push(`\u003c\u003c ${ctx.path} [${ctx.status}]`);\n};\n\nconst auth: Middleware = async (ctx, next) =\u003e {\n const token = ctx.headers.get(\u0027Authorization\u0027);\n if (!token) {\n ctx.status = 401;\n ctx.response = \u0027Unauthorized\u0027;\n return;\n }\n ctx.logs.push(`auth:${token}`);\n await next();\n};\n\nconst handler: Middleware = async (ctx, _next) =\u003e {\n ctx.status = 200;\n ctx.response = `Hello ${ctx.path}`;\n};\n","assertions":"import assert from \u0027assert\u0027;\n\n(async () =\u003e {\n const pipeline = compose([logger, auth, handler]);\n\n // Test 1: full pipeline with auth\n const ctx1: Context = {\n path: \u0027/home\u0027,\n headers: new Map([[\u0027Authorization\u0027, \u0027Bearer xyz\u0027]]),\n body: null, status: 0, response: \u0027\u0027, logs: []\n };\n await pipeline(ctx1);\n assert.strictEqual(ctx1.status, 200);\n assert.strictEqual(ctx1.response, \u0027Hello /home\u0027);\n assert.deepStrictEqual(ctx1.logs, [\u0027\u003e\u003e /home\u0027, \u0027auth:Bearer xyz\u0027, \u0027\u003c\u003c /home [200]\u0027]);\n\n // Test 2: auth fails, handler not reached\n const ctx2: Context = {\n path: \u0027/secret\u0027,\n headers: new Map(),\n body: null, status: 0, response: \u0027\u0027, logs: []\n };\n await pipeline(ctx2);\n assert.strictEqual(ctx2.status, 401);\n assert.strictEqual(ctx2.response, \u0027Unauthorized\u0027);\n assert.deepStrictEqual(ctx2.logs, [\u0027\u003e\u003e /secret\u0027, \u0027\u003c\u003c /secret [401]\u0027]);\n\n // Test 3: error propagation\n const failing: Middleware = async (_ctx, _next) =\u003e {\n throw new Error(\u0027boom\u0027);\n };\n const errPipeline = compose([logger, failing]);\n const ctx3: Context = {\n path: \u0027/err\u0027,\n headers: new Map(),\n body: null, status: 0, response: \u0027\u0027, logs: []\n };\n try {\n await errPipeline(ctx3);\n assert.fail(\u0027should have thrown\u0027);\n } catch (e: any) {\n assert.strictEqual(e.message, \u0027boom\u0027);\n }\n assert.deepStrictEqual(ctx3.logs, [\u0027\u003e\u003e /err\u0027, \u0027error@1:boom\u0027, \u0027error@0:boom\u0027]);\n\n console.log(\u0027Task 50 passed\u0027);\n})();\n","category":"syntax_completion"}