{
  "Allow": "// Allow checks if a call is allowed under the rate limit.",
  "BubbleSort": "// BubbleSort sorts a slice using bubble sort with early termination.",
  "CountWords": "// CountWords counts the number of words in text separated by whitespace.",
  "ExtractNumbers": "// ExtractNumbers extracts all numeric values from a mixed text string.",
  "HashCrc32": "// HashCrc32 computes CRC32 checksum of byte data.",
  "HeapSort": "// HeapSort sorts a slice using heap sort with binary max-heap.",
  "InsertionSort": "// InsertionSort sorts a slice using insertion sort - efficient for small or nearly sorted arrays.",
  "MergeSort": "// MergeSort sorts a slice using merge sort - stable divide and conquer algorithm.",
  "NewCircuitBreaker": "// NewCircuitBreaker creates a circuit breaker with failure threshold and reset timeout.",
  "NewRateLimiter": "// NewRateLimiter creates a rate limiter allowing maxPerSecond calls per second.",
  "PadString": "// PadString pads string to fixed width with a fill character.",
  "RadixSort": "// RadixSort sorts non-negative integers using radix sort - processes digits from least significant.",
  "RecordFailure": "// RecordFailure records a failure - may trip the circuit to open state.",
  "RecordSuccess": "// RecordSuccess records a success - resets failure count and closes circuit.",
  "ReverseString": "// ReverseString reverses the characters in a string.",
  "ShouldAllow": "// ShouldAllow checks if calls should be allowed through the circuit.",
  "TestCircuitBreaker": "This function tests a circuit breaker with a specific threshold of 3 failures before opening and a 30-unit timeout window, verifying the initial closed state permits requests through.",
  "TestHeapSort": "This is a test function, not a sorting algorithm itself\u2014it validates a HeapSort implementation by comparing the sorted output against an expected result using index-by-index assertions rather than leveraging Go's built-in comparison packages.",
  "TestMergeSort": "// Test functions",
  "TestValidateEmail": "This function is a basic unit test that validates email addresses using simple positive and negative test cases rather than comprehensive pattern matching or RFC 5322 compliance testing.",
  "TestValidatePhone": "This function tests phone number validation by checking both positive cases (accepting formatted numbers with country codes and hyphens) and negative cases (rejecting alphabetic strings), verifying that the validator correctly handles common formatting variations while rejecting invalid input patterns.",
  "ValidateIpAddress": "// ValidateIpAddress validates IP address - supports both IPv4 and IPv6 formats.",
  "ValidatePhone": "// ValidatePhone validates phone number with international country code prefix.",
  "ValidateUrl": "// ValidateUrl validates URL format - checks for valid scheme and hostname.",
  "__init__": "This constructor implements a token bucket rate limiter that replenishes tokens based on elapsed time since the last refill rather than using a fixed interval or queue, allowing smooth rate limiting with O(1) space complexity.",
  "_insertionSortSmall": "This function implements insertion sort with in-place element shifting rather than using a swap operation, which minimizes write operations by moving larger elements rightward in a single pass before placing the key in its final position.",
  "_insertion_sort_small": "\"\"\"Internal sort helper for small partitions.",
  "_mergeSorted": "This function uses a two-pointer comparison technique to merge two pre-sorted arrays in a single linear pass, maintaining stability by preferring equal elements from the left array through the `<=` operator.",
  "_merge_sorted": "\"\"\"Internal merge helper \u2014 merges two sorted lists.",
  "_refill": "This method implements a **discrete token-bucket rate limiter that refills to full capacity only once per second**, rather than gradually accumulating tokens proportionally to elapsed time like traditional token-bucket algorithms.",
  "allow": "\"\"\"Check if a call is allowed under the rate limit.",
  "bubbleSort": "/** Sort array using bubble sort with early termination.",
  "bubble_sort": "\"\"\"Sort list using bubble sort with early termination.",
  "constructor": "This implements a token bucket rate limiter that replenishes tokens based on elapsed time since the last refill, allowing for burst capacity up to `maxTokens` while maintaining an average rate limit of `maxPerSecond`.",
  "countWords": "/** Count the number of words in text separated by whitespace.",
  "count_words": "\"\"\"Count the number of words in text separated by whitespace.",
  "countingSortByDigit": "This function implements the digit-extraction phase of radix sort by using a stable counting sort that processes a single digit position (controlled by `exp` as a power of 10) to enable multi-pass sorting of integers by their individual digits.",
  "counting_sort_by_digit": "This function implements the digit-extraction subroutine of radix sort that isolates a specific decimal digit position (controlled by `exp` as a power of 10) and performs a stable counting sort on that digit alone, enabling multi-pass sorting of integers by processing one digit at a time.",
  "extractNumbers": "/** Extract all numeric values from a mixed text string.",
  "extract_numbers": "\"\"\"Extract all numeric values from a mixed text string.",
  "hashCrc32": "/** Compute CRC32 checksum of string data.",
  "hash_crc32": "\"\"\"Compute CRC32 checksum of byte data.",
  "heapSort": "/** Sort array using heap sort with binary max-heap.",
  "heap_sort": "\"\"\"Sort list using heap sort with binary max-heap.",
  "heapify": "This function performs a recursive top-down heap repair by comparing a parent node with its two children and recursively pushing down the smaller parent value until the max-heap property is restored.",
  "insertionSort": "/** Sort array using insertion sort - efficient for small or nearly sorted arrays.",
  "insertionSortSmall": "// insertionSortSmall is an internal sort helper for small partitions",
  "insertion_sort": "\"\"\"Sort list using insertion sort - efficient for small or nearly sorted arrays.",
  "mergeSort": "// Hard eval fixture for JavaScript - confusable functions for semantic search testing\n/** Sort array using merge sort - stable divide and conquer algorithm.",
  "mergeSorted": "// mergeSorted is an internal merge helper \u2014 merges two sorted slices",
  "merge_sort": "\"\"\"Sort list using merge sort - stable divide and conquer algorithm.",
  "new": "This constructor initializes a token bucket rate limiter that refills exactly `max_per_second` tokens every second, with the initial token count set to full capacity, enabling immediate burst usage up to the rate limit.",
  "padString": "/** Pad string to fixed width with a fill character.",
  "pad_string": "\"\"\"Pad string to fixed width with a fill character.",
  "radixSort": "/** Sort non-negative integers using radix sort - processes digits from least significant.",
  "radix_sort": "\"\"\"Sort non-negative integers using radix sort - processes digits from least significant.",
  "recordFailure": "This method implements a simple threshold-based state transition mechanism that immediately opens the circuit breaker when consecutive failures reach a specified count, without any exponential backoff, timeout decay, or half-open recovery attempts.",
  "recordSuccess": "This method uniquely resets the failure count to zero and immediately transitions the circuit breaker to a closed state upon a single successful operation, without requiring a half-open state or success threshold validation.",
  "record_failure": "\"\"\"Record a failure - may trip the circuit to open state.",
  "record_success": "\"\"\"Record a success - resets failure count and closes circuit.",
  "refill": "This method implements a fixed-window token bucket where tokens are completely replenished to their maximum at discrete 1-second intervals, rather than gradually refilling at a continuous rate proportional to elapsed time.",
  "reverseString": "/** Reverse the characters in a string.",
  "reverse_string": "\"\"\"Reverse the characters in a string.",
  "shouldAllow": "This circuit breaker implementation uniquely permits requests during the `half_open` state without requiring successful execution to automatically transition back to `closed`, instead relying on the passage of `resetTimeoutMs` since the last failure to initiate the half-open state.",
  "should_allow": "\"\"\"Check if calls should be allowed through the circuit.",
  "testCircuitBreaker": "This function tests a circuit breaker pattern implementation that uses a failure threshold (3) and timeout window (30000ms) to automatically prevent cascading failures by blocking requests after a specified number of failures within the time window.",
  "testHeapSort": "This function is a test harness for a heap sort implementation that validates correctness by comparing the stringified JSON representation of the sorted output against an expected array, rather than using individual element assertions.",
  "testMergeSort": "// Test functions",
  "testValidateEmail": "This function is a test suite that uses `console.assert()` to validate an email validation function's behavior, rather than a traditional testing framework, making it browser-console-executable and lightweight but lacking detailed assertion messages.",
  "testValidatePhone": "This function is a test suite that validates a phone number function using console assertions rather than a dedicated testing framework, checking both positive and negative cases in a single function.",
  "test_circuit_breaker": "This function tests a circuit breaker implementation that uses a fixed failure threshold (3) and time window (30 units) to determine when to trip, distinguishing it from circuit breakers that might use exponential backoff, adaptive thresholds, or state-machine-based transitions.",
  "test_heap_sort": "This function tests heap sort by mutating the input vector in-place and comparing its result against an expected sorted sequence, verifying that the heap sort implementation correctly rearranges elements using a binary heap data structure.",
  "test_merge_sort": "# Test functions for sort algorithms",
  "test_validate_email": "This function is a test case that validates email addresses using a `validate_email()` function, distinguishing itself by asserting both positive cases (valid emails like \"user@example.com\") and negative cases (invalid formats like \"not-an-email\") rather than testing a single condition.",
  "test_validate_phone": "This test validates a phone number function that accepts the specific North American format \"+1-555-0100\" (country code with hyphens) while rejecting non-numeric input like \"abc\".",
  "try_parse_ipv4": "This function uniquely validates IPv4 addresses by checking both structural format (exactly 4 dot-separated parts) and numeric validity (each part parseable as u8) in a single pass using iterator composition rather than explicit loops or regex.",
  "validateIpAddress": "/** Validate IP address - supports both IPv4 and IPv6 formats.",
  "validatePhone": "/** Validate phone number with international country code prefix.",
  "validateUrl": "/** Validate URL format - checks for valid scheme and hostname.",
  "validate_ip_address": "\"\"\"Validate IP address - supports both IPv4 and IPv6 formats.",
  "validate_phone": "\"\"\"Validate phone number with international country code prefix.",
  "validate_url": "\"\"\"Validate URL format - checks for valid scheme and hostname."
}