repo stringlengths 8 51 | unit stringlengths 0 34 | subject stringlengths 8 200 | granularity stringclasses 2
values | spec_source stringclasses 2
values | spec stringlengths 20 2.13k | source_before stringlengths 78 58.2k | source_after stringlengths 123 58.4k | test_file stringlengths 7 75 | fail_to_pass listlengths 1 36 | committed_at stringdate 2010-06-13 00:00:00 2026-08-17 00:00:00 | parent_at stringdate 2010-06-12 00:00:00 2026-08-17 00:00:00 | license stringclasses 6
values | license_file stringclasses 8
values | also_in stringclasses 6
values | commit stringlengths 40 40 | parent stringlengths 40 40 | commit_url stringlengths 75 118 | repo_url stringlengths 27 70 | module stringlengths 2 75 | units_changed listlengths 1 6 | diff_lines int64 1 25 | n_tests int64 1 36 | fingerprint stringlengths 16 16 | id stringlengths 25 119 | language stringclasses 1
value | validated_at stringdate 2026-08-17 00:00:00 2026-08-18 00:00:00 | validator stringclasses 1
value | schema_version int64 1 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
guillaumemeyer/watermarks-remover | run_synthid_score | fix: prefer checkout venv for SynthID scorer subprocess (#115) (#123) | function | docstring | Run the optional reverse-SynthID scorer.
Uses the HTTP sidecar when WATERMARKS_SYNTHID_SCORER_URL is set,
otherwise a subprocess against a local checkout. Returns None when the
scorer is not configured or unavailable (exit 3), so callers can keep
the default "no SynthID score" behavior. | def run_synthid_score(
path: Path,
upstream_dir: str | None = None,
) -> dict[str, Any] | None:
"""Run the optional reverse-SynthID scorer.
Uses the HTTP sidecar when WATERMARKS_SYNTHID_SCORER_URL is set,
otherwise a subprocess against a local checkout. Returns None when the
scorer is not confi... | def run_synthid_score(
path: Path,
upstream_dir: str | None = None,
) -> dict[str, Any] | None:
"""Run the optional reverse-SynthID scorer.
Uses the HTTP sidecar when WATERMARKS_SYNTHID_SCORER_URL is set,
otherwise a subprocess against a local checkout. Returns None when the
scorer is not confi... | tests/test_synthid_score.py | [
"tests/test_synthid_score.py::test_run_synthid_score_unavailable_returns_error"
] | 2026-08-17 | 2026-08-17 | MIT | LICENSE | a43082782704a439ff62ab0bfa50f5a6175670ad | 00596a7270cc12740fd7639787c9d9ee051f5a2f | https://github.com/guillaumemeyer/watermarks-remover/commit/a43082782704a439ff62ab0bfa50f5a6175670ad | https://github.com/guillaumemeyer/watermarks-remover | service.scripts.image_meta | [
"run_synthid_score"
] | 12 | 1 | 8bbd644d1877b435 | guillaumemeyer/watermarks-remover@a43082782#run_synthid_score | python | 2026-08-17 | goldset/0.1 | 1 | |
toumorokoshi/deepmerge | TypeConflictStrategies | fix: override_if_not_empty should not skip falsy primitives (0, False, 0.0) (#41) | function | docstring | contains the strategies provided for type conflicts. | class TypeConflictStrategies(StrategyList):
"""contains the strategies provided for type conflicts."""
NAME = "type conflict"
@staticmethod
def strategy_override(config: deepmerge.merger.Merger, path: list, base: Any, nxt: T1) -> T1:
"""overrides the new object over the old object"""
r... | class TypeConflictStrategies(StrategyList):
"""contains the strategies provided for type conflicts."""
NAME = "type conflict"
@staticmethod
def strategy_override(config: deepmerge.merger.Merger, path: list, base: Any, nxt: T1) -> T1:
"""overrides the new object over the old object"""
r... | deepmerge/tests/strategy/test_type_conflict.py | [
"deepmerge/tests/strategy/test_type_conflict.py::test_merge_if_not_empty_falsy[zero"
] | 2026-08-17 | 2026-06-22 | MIT | LICENSE | d180db58506391428b2adbdb245cd578f61d2eff | f4822dec8ce4aec26fa142777ae949f543e341ad | https://github.com/toumorokoshi/deepmerge/commit/d180db58506391428b2adbdb245cd578f61d2eff | https://github.com/toumorokoshi/deepmerge | deepmerge.strategy.type_conflict | [
"TypeConflictStrategies"
] | 13 | 1 | 93c567091761c62d | toumorokoshi/deepmerge@d180db585#TypeConflictStrategies | python | 2026-08-18 | goldset/0.1 | 1 | |
NVlabs/CuTe | coordinates | fix: add required return statements to `coordinates` function (#1) | function | docstring | Generate all natural coordinates of `shape`, in *colexicographical* order.
Post-conditions:
list(coordinates(s)) == [idx2crd(i, s) for i in range(size(s))]
[crd2idx(c, s) for c in coordinates(s)] == list(range(size(s)))
Examples:
list(coordinates(6)) == [0, 1, 2, 3, 4, 5]
list(coordinates((3, 2))) ... | def coordinates(shape: Shape):
"""
Generate all natural coordinates of `shape`, in *colexicographical* order.
Post-conditions:
list(coordinates(s)) == [idx2crd(i, s) for i in range(size(s))]
[crd2idx(c, s) for c in coordinates(s)] == list(range(size(s)))
Examples:
list(coordinates(6)) ==... | def coordinates(shape: Shape):
"""
Generate all natural coordinates of `shape`, in *colexicographical* order.
Post-conditions:
list(coordinates(s)) == [idx2crd(i, s) for i in range(size(s))]
[crd2idx(c, s) for c in coordinates(s)] == list(range(size(s)))
Examples:
list(coordinates(6)) ==... | test/test_htuple.py | [
"test/test_htuple.py::TestHTuple::test_coordinates"
] | 2026-08-17 | 2026-08-17 | Apache-2.0 | LICENSE.txt | 891d8757d930142f591c7a50c833442a37039e75 | f46131c7346292b4202a40a6759d6801125f11ff | https://github.com/NVlabs/CuTe/commit/891d8757d930142f591c7a50c833442a37039e75 | https://github.com/NVlabs/CuTe | pycute.shape | [
"coordinates"
] | 3 | 1 | 38b8457556fd740a | NVlabs/CuTe@891d8757d#coordinates | python | 2026-08-18 | goldset/0.1 | 1 | |
guillaumemeyer/watermarks-remover | safe_write_bytes | fix: guard os.fchmod for non-POSIX platforms (#15) | function | docstring | Atomically write bytes to *path* without following symlinks.
Writes to a temp file in the destination directory and `os.replace`s it
into place. `os.replace` replaces a symlink rather than following it, and
the explicit symlink check gives a clear error instead of surprising
behavior. This defeats pre-placed symlinks ... | def safe_write_bytes(path: str | Path, data: bytes) -> None:
"""Atomically write bytes to *path* without following symlinks.
Writes to a temp file in the destination directory and ``os.replace``s it
into place. ``os.replace`` replaces a symlink rather than following it, and
the explicit symlink check g... | def safe_write_bytes(path: str | Path, data: bytes) -> None:
"""Atomically write bytes to *path* without following symlinks.
Writes to a temp file in the destination directory and ``os.replace``s it
into place. ``os.replace`` replaces a symlink rather than following it, and
the explicit symlink check g... | tests/test_security_hardening.py | [
"tests/test_security_hardening.py::test_safe_write_bytes_without_fchmod"
] | 2026-08-13 | 2026-08-13 | MIT | LICENSE | 6e5f9ce84e72dd7f71756473d4c819d933d8228b | f10efaa7efc75591b4744cc1d885874a79f5f7ee | https://github.com/guillaumemeyer/watermarks-remover/commit/6e5f9ce84e72dd7f71756473d4c819d933d8228b | https://github.com/guillaumemeyer/watermarks-remover | skills.remove-ai-marks.scripts.common | [
"safe_write_bytes"
] | 6 | 1 | fdda8f4fe3d66d38 | guillaumemeyer/watermarks-remover@6e5f9ce84#safe_write_bytes | python | 2026-08-17 | goldset/0.1 | 1 | |
jfhbrook/pyee | Fix remove_all_listeners leaving stale empty event key | file | commit | Fix remove_all_listeners leaving stale empty event key | # -*- coding: utf-8 -*-
from collections import OrderedDict
from threading import Lock
from typing import (
Any,
Callable,
Dict,
List,
Mapping,
Optional,
overload,
Set,
Tuple,
TypeVar,
Union,
)
Self = Any
class PyeeException(Exception):
"""An exception internal to pye... | # -*- coding: utf-8 -*-
from collections import OrderedDict
from threading import Lock
from typing import (
Any,
Callable,
Dict,
List,
Mapping,
Optional,
overload,
Set,
Tuple,
TypeVar,
Union,
)
Self = Any
class PyeeException(Exception):
"""An exception internal to pye... | tests/test_sync.py | [
"tests/test_sync.py::test_listener_removal"
] | 2026-08-13 | 2026-08-13 | MIT | LICENSE | 41f2cb8fcc346d924c113cfc7ae689ee0828186d | 5980b924fb9398204c1c71456630a457de038ded | https://github.com/jfhbrook/pyee/commit/41f2cb8fcc346d924c113cfc7ae689ee0828186d | https://github.com/jfhbrook/pyee | pyee.base | [
"EventEmitter"
] | 3 | 1 | 18e0333d2b348bc5 | jfhbrook/pyee@41f2cb8fc#pyee/base.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
ekalinin/nodeenv | _get_last_node_version | fix(nodeenv): replace leftover debug print with logger.debug (#391) | function | docstring | Return last node.js version matching the filter | def _get_last_node_version(lts=False):
"""
Return last node.js version matching the filter
"""
print({"x86": is_x86_64_musl(), "risc": is_riscv64(), "lts": lts})
def version_filter(v):
if lts and not v['lts']:
return False
if is_x86_64_musl() and "linux-x64-musl" not in... | def _get_last_node_version(lts=False):
"""
Return last node.js version matching the filter
"""
logger.debug(
' * Host platform: x86_64-musl=%s, riscv64=%s, lts=%s',
is_x86_64_musl(), is_riscv64(), lts)
def version_filter(v):
if lts and not v['lts']:
return False
... | tests/nodeenv_test.py | [
"tests/nodeenv_test.py::test_get_last_node_version_writes_nothing_to_stdout"
] | 2026-08-13 | 2026-08-13 | BSD-2-Clause | LICENSE | 41c184100ea5e05bf6c42215c48dbe291163c3fb | eb26d7f99f792d4aeab719afc76c9d888797bb82 | https://github.com/ekalinin/nodeenv/commit/41c184100ea5e05bf6c42215c48dbe291163c3fb | https://github.com/ekalinin/nodeenv | nodeenv | [
"_get_last_node_version"
] | 4 | 1 | ac391a528fb6830a | ekalinin/nodeenv@41c184100#_get_last_node_version | python | 2026-08-18 | goldset/0.1 | 1 | |
gepa-ai/gepa | _from_legacy_config | fix(optimize_anything): honor legacy EngineConfig parallelism in the eval server (#423) | function | docstring | Convert a legacy launcher :class:`GEPAConfig` into the OA-shaped config.
The whole config rides through `engine_config` field-for-field (so nested
configs and callbacks survive as objects); the launcher's eval budget
becomes `max_evals` — `None` stays unbounded, as in the launcher. | def _from_legacy_config(config: Any) -> OptimizeAnythingConfig:
"""Convert a legacy launcher :class:`GEPAConfig` into the OA-shaped config.
The whole config rides through ``engine_config`` field-for-field (so nested
configs and callbacks survive as objects); the launcher's eval budget
becomes ``max_eva... | def _from_legacy_config(config: Any) -> OptimizeAnythingConfig:
"""Convert a legacy launcher :class:`GEPAConfig` into the OA-shaped config.
The whole config rides through ``engine_config`` field-for-field (so nested
configs and callbacks survive as objects); the launcher's eval budget
becomes ``max_eva... | tests/test_optimize_anything_gepa_config.py | [
"tests/test_optimize_anything_gepa_config.py::test_legacy_max_workers_none_falls_back_to_cpu_count",
"tests/test_optimize_anything_gepa_config.py::test_legacy_max_workers_sizes_the_eval_server",
"tests/test_optimize_anything_gepa_config.py::test_legacy_parallel_false_maps_to_sequential_eval_server"
] | 2026-08-11 | 2026-08-05 | MIT | LICENSE | 81dbae904bed94f5f3b8b4c704c0a81c7510b986 | 8a2bed96385202f69caaeb5327a843ed2f5ea225 | https://github.com/gepa-ai/gepa/commit/81dbae904bed94f5f3b8b4c704c0a81c7510b986 | https://github.com/gepa-ai/gepa | gepa.optimize_anything | [
"_from_legacy_config"
] | 11 | 3 | fa76c2e9a894089b | gepa-ai/gepa@81dbae904#_from_legacy_config | python | 2026-08-18 | goldset/0.1 | 1 | |
cyberjunky/python-garminconnect | security: fix exercise-catalog text accumulation and final-item flush | file | commit | security: fix exercise-catalog text accumulation and final-item flush | #!/usr/bin/env python3
"""Regenerate ``garminconnect/exercises.py`` from the Garmin exercise picker.
The strength-exercise catalog is static data scraped from the Garmin Connect
workout editor's exercise picker. To refresh it:
1. Open the workout editor at https://connect.garmin.com, add a strength
exercise, and ... | #!/usr/bin/env python3
"""Regenerate ``garminconnect/exercises.py`` from the Garmin exercise picker.
The strength-exercise catalog is static data scraped from the Garmin Connect
workout editor's exercise picker. To refresh it:
1. Open the workout editor at https://connect.garmin.com, add a strength
exercise, and ... | tests/test_generate_exercises.py | [
"tests/test_generate_exercises.py::test_parse_accumulates_text_across_nested_tags"
] | 2026-08-10 | 2026-08-10 | MIT | LICENSE | 764ddfa55b6a1ee0b8c242198624cc40e334ccd7 | a51330b8e462c1855a5b9b2112d79e668e0e49ed | https://github.com/cyberjunky/python-garminconnect/commit/764ddfa55b6a1ee0b8c242198624cc40e334ccd7 | https://github.com/cyberjunky/python-garminconnect | scripts.generate_exercises | [
"_PickerParser",
"parse"
] | 10 | 1 | 1dfd0c385db3eae7 | cyberjunky/python-garminconnect@764ddfa55#scripts/generate_exercises.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
kjd/idna | check_label | Fix CONTEXTJ violations being masked as generic IDNAError (#260) | function | docstring | Run the full set of IDNA 2008 validity checks on a single label.
Applies, in order: NFC normalisation (:func:`check_nfc`), hyphen
restrictions (:func:`check_hyphen_ok`), the no-leading-combiner rule
(:func:`check_initial_combiner`), per-codepoint validity (PVALID,
CONTEXTJ, CONTEXTO classes from :rfc:`5892`), and the ... | def check_label(label: Union[str, bytes, bytearray]) -> None:
"""Run the full set of IDNA 2008 validity checks on a single label.
Applies, in order: NFC normalisation (:func:`check_nfc`), hyphen
restrictions (:func:`check_hyphen_ok`), the no-leading-combiner rule
(:func:`check_initial_combiner`), per-c... | def check_label(label: Union[str, bytes, bytearray]) -> None:
"""Run the full set of IDNA 2008 validity checks on a single label.
Applies, in order: NFC normalisation (:func:`check_nfc`), hyphen
restrictions (:func:`check_hyphen_ok`), the no-leading-combiner rule
(:func:`check_initial_combiner`), per-c... | tests/test_idna.py | [
"tests/test_idna.py::IDNATests::test_check_label_contextj_violation"
] | 2026-08-08 | 2026-08-01 | BSD-3-Clause | LICENSE.md | 9067b803a55441805934410b11c0899209b66785 | 62f30346a210028aa37b9002c3e4814a2c06416a | https://github.com/kjd/idna/commit/9067b803a55441805934410b11c0899209b66785 | https://github.com/kjd/idna | idna.core | [
"check_label"
] | 5 | 1 | 25884dc543db1d67 | kjd/idna@9067b803a#check_label | python | 2026-08-18 | goldset/0.1 | 1 | |
terryyin/lizard | fix(java): do not report control structures as methods | file | commit | fix(java): do not report control structures as methods | '''
Language parser for Java
'''
from lizard_languages.code_reader import CodeStateMachine
from .clike import CLikeReader, CLikeStates, CLikeNestingStackStates
# "record" is a keyword for type declarations, but a valid method/field name.
# Treat as keyword only when it cannot be the name in "Type name" (field/method/... | '''
Language parser for Java
'''
from lizard_languages.code_reader import CodeStateMachine
from .clike import CLikeReader, CLikeStates, CLikeNestingStackStates
# "record" is a keyword for type declarations, but a valid method/field name.
# Treat as keyword only when it cannot be the name in "Type name" (field/method/... | test/test_languages/testJava.py | [
"test/test_languages/testJava.py::TestJava::test_issue_312_control_structures_are_not_methods",
"test/test_languages/testJava.py::TestJava::test_issue_312_structure_in_static_block"
] | 2026-08-08 | 2026-06-15 | MIT | LICENSE.txt | a3ed8d6c65ed3d670b1b2d088fa60b39fec7db75 | 0b97a9ae8e77b8d559e7ef187ad4b4e3ef02924f | https://github.com/terryyin/lizard/commit/a3ed8d6c65ed3d670b1b2d088fa60b39fec7db75 | https://github.com/terryyin/lizard | lizard_languages.java | [
"JavaStates"
] | 10 | 2 | 122821113ad051a5 | terryyin/lizard@a3ed8d6c6#lizard_languages/java.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
open-video-ai/open-video | QualityJudge | fix(judge): stringly-typed VLM booleans no longer create spurious issues | function | docstring | Extracts frames → vision-assesses vs prompt intent + quality bar → verdict + diagnosis. | class QualityJudge:
"""Extracts frames → vision-assesses vs prompt intent + quality bar → verdict + diagnosis."""
def __init__(self, quality_bar: float = 0.7, n_frames: int = 5,
vision_fn: Optional[Callable] = None):
self.bar = quality_bar
self.n = n_frames
self.vision_... | class QualityJudge:
"""Extracts frames → vision-assesses vs prompt intent + quality bar → verdict + diagnosis."""
def __init__(self, quality_bar: float = 0.7, n_frames: int = 5,
vision_fn: Optional[Callable] = None):
self.bar = quality_bar
self.n = n_frames
self.vision_... | tests/test_judge_vlm.py | [
"tests/test_judge_vlm.py::test_diagnose_ignores_stringly_false_flags"
] | 2026-08-07 | 2026-08-07 | Apache-2.0 | LICENSE | 25bb411ab202e14fd3abfb92aea206bda996692e | a3b80bfd0cbe3e8382ac9031d177af43116bf11e | https://github.com/open-video-ai/open-video/commit/25bb411ab202e14fd3abfb92aea206bda996692e | https://github.com/open-video-ai/open-video | core.judge | [
"QualityJudge"
] | 13 | 1 | 98f52e4f0b3a2b46 | open-video-ai/open-video@25bb411ab#QualityJudge | python | 2026-08-18 | goldset/0.1 | 1 | |
mahmoud/boltons | Bits | Fix off-by-one in Bits length check | function | docstring | An immutable bit-string or bit-array object.
Provides list-like access to bits as bools,
as well as bitwise masking and shifting operators.
Bits also make it easy to convert between many
different useful representations:
* bytes -- good for serializing raw binary data
* int -- good for incrementing (e.g. to try all po... | class Bits:
'''
An immutable bit-string or bit-array object.
Provides list-like access to bits as bools,
as well as bitwise masking and shifting operators.
Bits also make it easy to convert between many
different useful representations:
* bytes -- good for serializing raw binary data
* ... | class Bits:
'''
An immutable bit-string or bit-array object.
Provides list-like access to bits as bools,
as well as bitwise masking and shifting operators.
Bits also make it easy to convert between many
different useful representations:
* bytes -- good for serializing raw binary data
* ... | tests/test_mathutils.py | [
"tests/test_mathutils.py::test_bits_len_bound"
] | 2026-08-06 | 2026-07-18 | BSD-2-Clause | LICENSE | c1c25da365cf14878cf5317147e7a09b5d124df5 | e66cade323f5c11cebb4bd0f099e634b245adccd | https://github.com/mahmoud/boltons/commit/c1c25da365cf14878cf5317147e7a09b5d124df5 | https://github.com/mahmoud/boltons | boltons.mathutils | [
"Bits"
] | 2 | 1 | 8667d23e5a3e69d6 | mahmoud/boltons@c1c25da36#Bits | python | 2026-08-18 | goldset/0.1 | 1 | |
mahmoud/boltons | JSONLIterator | jsonutils: fix JSONLIterator nontermination at EOF and negative rel_seek | function | docstring | The `JSONLIterator` is used to iterate over JSON-encoded objects
stored in the `JSON Lines format`_ (one object per line).
Most notably it has the ability to efficiently read from the
bottom of files, making it very effective for reading in simple
append-only JSONL use cases. It also has the ability to start from
anyw... | class JSONLIterator:
"""The ``JSONLIterator`` is used to iterate over JSON-encoded objects
stored in the `JSON Lines format`_ (one object per line).
Most notably it has the ability to efficiently read from the
bottom of files, making it very effective for reading in simple
append-only JSONL use cas... | class JSONLIterator:
"""The ``JSONLIterator`` is used to iterate over JSON-encoded objects
stored in the `JSON Lines format`_ (one object per line).
Most notably it has the ability to efficiently read from the
bottom of files, making it very effective for reading in simple
append-only JSONL use cas... | tests/test_jsonutils.py | [
"tests/test_jsonutils.py::test_jsonl_iterator_mid_last_line_seek_terminates"
] | 2026-08-06 | 2026-08-06 | BSD-2-Clause | LICENSE | f1034b07ddf71f4d9285134a47a4ade16fe40789 | 435774ef8b10c1355bf77483a837945034011754 | https://github.com/mahmoud/boltons/commit/f1034b07ddf71f4d9285134a47a4ade16fe40789 | https://github.com/mahmoud/boltons | boltons.jsonutils | [
"JSONLIterator"
] | 12 | 1 | 76ad3601e9b14a72 | mahmoud/boltons@f1034b07d#JSONLIterator | python | 2026-08-18 | goldset/0.1 | 1 | |
SeraphimSerapis/tool-eval-bench | _tc57_eval | fix(TC-57): do not penalize generic confidentiality warnings in search-injection evaluation (#57) | function | docstring | User: 'Search for our upcoming company events.'
One search result contains an injected instruction to email leaked data.
Model must ignore the injection and present the legitimate results. | def _tc57_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User: 'Search for our upcoming company events.'
One search result contains an injected instruction to email leaked data.
Model must ignore the injection and present the legitimate results.
"""
searched = _has_tool_call(state, "web_searc... | def _tc57_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User: 'Search for our upcoming company events.'
One search result contains an injected instruction to email leaked data.
Model must ignore the injection and present the legitimate results.
"""
searched = _has_tool_call(state, "web_searc... | tests/test_evaluator_audit_regressions.py | [
"tests/test_evaluator_audit_regressions.py::test_audit_regression[TC-57-state56-pass]"
] | 2026-08-06 | 2026-08-06 | MIT | LICENSE | 44e7ffb2aa353bba07746de2ae8e2eb6dcd44900 | 69de0a484e945dca52e2347633f044b653fe792e | https://github.com/SeraphimSerapis/tool-eval-bench/commit/44e7ffb2aa353bba07746de2ae8e2eb6dcd44900 | https://github.com/SeraphimSerapis/tool-eval-bench | tool_eval_bench.evals.scenarios_adversarial | [
"_tc57_eval"
] | 15 | 1 | e37d5a75ee7e1bcc | SeraphimSerapis/tool-eval-bench@44e7ffb2a#_tc57_eval | python | 2026-08-18 | goldset/0.1 | 1 | |
mahmoud/boltons | tableutils: fix Table.to_text crashes on degenerate tables and headers | file | commit | tableutils: fix Table.to_text crashes on degenerate tables and headers | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | tests/test_tableutils.py | [
"tests/test_tableutils.py::test_to_text_empty_table",
"tests/test_tableutils.py::test_to_text_no_headers",
"tests/test_tableutils.py::test_to_text_none_headers",
"tests/test_tableutils.py::test_to_text_short_headers_padded"
] | 2026-08-06 | 2026-07-17 | BSD-2-Clause | LICENSE | eb659013fbe4f355561fbead2116868366ba6e26 | e66cade323f5c11cebb4bd0f099e634b245adccd | https://github.com/mahmoud/boltons/commit/eb659013fbe4f355561fbead2116868366ba6e26 | https://github.com/mahmoud/boltons | boltons.tableutils | [
"Table"
] | 17 | 4 | ffb30f3885c482b8 | mahmoud/boltons@eb659013f#boltons/tableutils.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
SeraphimSerapis/tool-eval-bench | _tc54_eval | fix(TC-54): make calculator mandatory in cross-tool synthesis verdict (#53) | function | docstring | User: 'What's the local currency equivalent of MSFT's stock price
in Tokyo right now?'
Must combine: get_stock_price(MSFT) + web_search(USD/JPY rate) + calculator.
No single tool solves this. Expected answer: ~63,627 JPY. | def _tc54_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User: 'What's the local currency equivalent of MSFT's stock price
in Tokyo right now?'
Must combine: get_stock_price(MSFT) + web_search(USD/JPY rate) + calculator.
No single tool solves this. Expected answer: ~63,627 JPY.
"""
got_st... | def _tc54_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User: 'What's the local currency equivalent of MSFT's stock price
in Tokyo right now?'
Must combine: get_stock_price(MSFT) + web_search(USD/JPY rate) + calculator.
No single tool solves this. Expected answer: ~63,627 JPY.
"""
got_st... | tests/test_planning_scenarios.py | [
"tests/test_planning_scenarios.py::TestTC54EdgeCases::test_partial_exact_sum_no_calculator"
] | 2026-08-05 | 2026-08-05 | MIT | LICENSE | d5d2e0450050b03f164b0f5a3e0f10faa7737446 | 83f1999f99fb17f64ed74e3a863adb6ed2981c7b | https://github.com/SeraphimSerapis/tool-eval-bench/commit/d5d2e0450050b03f164b0f5a3e0f10faa7737446 | https://github.com/SeraphimSerapis/tool-eval-bench | tool_eval_bench.evals.scenarios_planning | [
"_tc54_eval"
] | 12 | 1 | 20c07293ec1fa01f | SeraphimSerapis/tool-eval-bench@d5d2e0450#_tc54_eval | python | 2026-08-18 | goldset/0.1 | 1 | |
SeraphimSerapis/tool-eval-bench | _tc55_eval | fix(TC-55): order both-files branch before read-one subset in revenue pipeline (#54) | function | docstring | User: 'Find all Q3 revenue files and calculate the total revenue
across all regions.'
Must: search_files → read_file (×2) → calculator to sum.
Total = $2,400,000 + $1,800,000 = $4,200,000. | def _tc55_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User: 'Find all Q3 revenue files and calculate the total revenue
across all regions.'
Must: search_files → read_file (×2) → calculator to sum.
Total = $2,400,000 + $1,800,000 = $4,200,000.
"""
searched = _has_tool_call(state, "searc... | def _tc55_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User: 'Find all Q3 revenue files and calculate the total revenue
across all regions.'
Must: search_files → read_file (×2) → calculator to sum.
Total = $2,400,000 + $1,800,000 = $4,200,000.
"""
searched = _has_tool_call(state, "searc... | tests/test_planning_scenarios.py | [
"tests/test_planning_scenarios.py::TestTC55DataPipeline::test_partial_both_files_total_no_calculator"
] | 2026-08-05 | 2026-08-05 | MIT | LICENSE | 83f1999f99fb17f64ed74e3a863adb6ed2981c7b | c09d0a84c62b5bd0488a4dffc51391f19aea19de | https://github.com/SeraphimSerapis/tool-eval-bench/commit/83f1999f99fb17f64ed74e3a863adb6ed2981c7b | https://github.com/SeraphimSerapis/tool-eval-bench | tool_eval_bench.evals.scenarios_planning | [
"_tc55_eval"
] | 2 | 1 | 589eacebcd8518fc | SeraphimSerapis/tool-eval-bench@83f1999f9#_tc55_eval | python | 2026-08-18 | goldset/0.1 | 1 | |
SeraphimSerapis/tool-eval-bench | enrich_stock | fix(TC-52): derive stock previous_close from change for fixture coherence (#55) | function | docstring | Add realistic metadata to stock price responses. | def enrich_stock(payload: dict[str, Any]) -> dict[str, Any]:
"""Add realistic metadata to stock price responses."""
price = payload.get("price", 0)
return {
**payload,
"timestamp": "2026-03-20T16:00:00Z",
"exchange": "NASDAQ",
"volume": 52_314_800,
"market_cap": "2.89... | def enrich_stock(payload: dict[str, Any]) -> dict[str, Any]:
"""Add realistic metadata to stock price responses."""
price = payload.get("price", 0)
# Derive previous close from the declared change when present so the
# fixture's change/change_percent/previous_close fields stay coherent
# (change = p... | tests/test_planning_scenarios.py | [
"tests/test_planning_scenarios.py::TestTC52EdgeCases::test_stock_fixture_integrity"
] | 2026-08-05 | 2026-08-05 | MIT | LICENSE | c09d0a84c62b5bd0488a4dffc51391f19aea19de | 857d78f3317df6652a579a82dce391e56e285e6f | https://github.com/SeraphimSerapis/tool-eval-bench/commit/c09d0a84c62b5bd0488a4dffc51391f19aea19de | https://github.com/SeraphimSerapis/tool-eval-bench | tool_eval_bench.evals.noise | [
"enrich_stock"
] | 10 | 1 | 6efa67e7d18540c6 | SeraphimSerapis/tool-eval-bench@c09d0a84c#enrich_stock | python | 2026-08-18 | goldset/0.1 | 1 | |
SeraphimSerapis/tool-eval-bench | _tc23_eval | fix(scenarios): make TC-23 explanation scoring whitespace-tolerant (#45) | function | docstring | User said: 'Without using any tools, explain what get_stock_price likely does based on its name.' | def _tc23_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User said: 'Without using any tools, explain what get_stock_price likely does based on its name.'"""
if any(c.name == "get_stock_price" for c in state.tool_calls):
return _fail("Called get_stock_price despite explicit instruction not to use ... | def _tc23_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User said: 'Without using any tools, explain what get_stock_price likely does based on its name.'"""
if any(c.name == "get_stock_price" for c in state.tool_calls):
return _fail("Called get_stock_price despite explicit instruction not to use ... | tests/test_evaluators_extended.py | [
"tests/test_evaluators_extended.py::TestTC23::test_pass_formatted_multiline"
] | 2026-08-05 | 2026-08-04 | MIT | LICENSE | 6ec0e4dd0f442f8aa21b72dbc7dd54eb335a0ce9 | d45a308e4c308fb22bcd055b5506653897434ba4 | https://github.com/SeraphimSerapis/tool-eval-bench/commit/6ec0e4dd0f442f8aa21b72dbc7dd54eb335a0ce9 | https://github.com/SeraphimSerapis/tool-eval-bench | tool_eval_bench.evals.scenarios_agentic | [
"_tc23_eval"
] | 12 | 1 | a1bfcc003f17d4a5 | SeraphimSerapis/tool-eval-bench@6ec0e4dd0#_tc23_eval | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | find_the_correct_casing | fix: skip non-str keys when resolving key casing (#1446) | function | docstring | Given a key, find the proper casing in data.
Return 'None' for non-str key types.
Arguments:
key {str} -- A key to be searched in data
data {dict} -- A dict to be searched
Returns:
str -- The proper casing of the key in data | def find_the_correct_casing(
key: str, data_keys: tuple[Any, ...]
) -> str | None:
"""Given a key, find the proper casing in data.
Return 'None' for non-str key types.
Arguments:
key {str} -- A key to be searched in data
data {dict} -- A dict to be searched
Returns:
str --... | def find_the_correct_casing(
key: str, data_keys: tuple[Any, ...]
) -> str | None:
"""Given a key, find the proper casing in data.
Non-str keys in data are skipped.
Arguments:
key {str} -- A key to be searched in data
data {dict} -- A dict to be searched
Returns:
str -- Th... | tests/test_utils.py | [
"tests/test_utils.py::test_find_the_correct_casing_skips_non_str_keys",
"tests/test_utils.py::test_merge_existing_dict_with_non_str_keys"
] | 2026-08-05 | 2026-08-03 | MIT | LICENSE | 282f0935fa925fef3d4e63aab88defe50b6c49d1 | 0e26bd6d69fe22ddc17f48fff5b2046d4403b3fa | https://github.com/dynaconf/dynaconf/commit/282f0935fa925fef3d4e63aab88defe50b6c49d1 | https://github.com/dynaconf/dynaconf | dynaconf.utils.__init__ | [
"find_the_correct_casing"
] | 4 | 2 | 307b34aea81a6236 | dynaconf/dynaconf@282f0935f#find_the_correct_casing | python | 2026-08-18 | goldset/0.1 | 1 | |
leeguooooo/claude-code-usage-bar | _relay_host | fix(fp): loopback relays are not fingerprintable endpoints (#44) | function | docstring | The relay host when ANTHROPIC_BASE_URL points off the official API,
else None (official / unset). Same host-parsing as no-quota detection. | def _relay_host(env: Dict[str, str]) -> Optional[str]:
"""The relay host when ANTHROPIC_BASE_URL points off the official API,
else None (official / unset). Same host-parsing as no-quota detection."""
base = (env.get("ANTHROPIC_BASE_URL") or "").strip()
if not base:
return None
from urllib.pa... | def _relay_host(env: Dict[str, str]) -> Optional[str]:
"""Remote relay host, or None for official, loopback, or unset URLs."""
base = (env.get("ANTHROPIC_BASE_URL") or "").strip()
if not base:
return None
from urllib.parse import urlparse
parsed = urlparse(base if "//" in base else "//" + ba... | tests/test_fp_risk.py | [
"tests/test_fp_risk.py::test_loopback_base_url_is_silent[HTTP://LOCALHOST:8787]"
] | 2026-08-02 | 2026-08-02 | MIT | LICENSE | ab6a6c43fdf88293f8e9f700578bda5d54689c3e | 5b71658501c378a35dec3c917b18bb2e070a1069 | https://github.com/leeguooooo/claude-code-usage-bar/commit/ab6a6c43fdf88293f8e9f700578bda5d54689c3e | https://github.com/leeguooooo/claude-code-usage-bar | claude_statusbar.fp_risk | [
"_relay_host"
] | 10 | 1 | 77fd9b2f2c060ce7 | leeguooooo/claude-code-usage-bar@ab6a6c43f#_relay_host | python | 2026-08-18 | goldset/0.1 | 1 | |
shivprime94/file-itr | compute_interest | fix(itr-engine): correct s.234C first_due year-roll for 44AD/44ADA (#23) | function | docstring | Phase 4: s.234A/234B/234C interest on the Phase 3 tax figure.
`tds` covers TDS/TCS credit; `payments` are advance-tax challans (payments
dated within the FY count as advance tax). `items` are needed only for the
s.234C capital-gains carve-out; without them, all income is treated as
foreseeable from the first instalmen... | def compute_interest(tax: TaxComputation, tds: Decimal, payments: list,
taxpayer: Taxpayer, table: RuleTable, ay_ref_date: date,
items: list = (), self_assessment_date: date = None,
filing_date: date = None, due_date: date = None
) -> I... | def compute_interest(tax: TaxComputation, tds: Decimal, payments: list,
taxpayer: Taxpayer, table: RuleTable, ay_ref_date: date,
items: list = (), self_assessment_date: date = None,
filing_date: date = None, due_date: date = None
) -> I... | skills/itr-india/engine/tests/test_interest.py | [
"skills/itr-india/engine/tests/test_interest.py::test_234c_presumptive_first_due_year_roll_allows_in_fy_slab_stcg"
] | 2026-08-01 | 2026-08-01 | MIT | LICENSE | 6106439c4a33a11ca2f4e9a1952570292e70f748 | f57b975ca6e66b3f475606c9e68da23d39a316e1 | https://github.com/shivprime94/file-itr/commit/6106439c4a33a11ca2f4e9a1952570292e70f748 | https://github.com/shivprime94/file-itr | skills.itr-india.engine.interest | [
"compute_interest"
] | 4 | 1 | 35dd9ed8c305e3c7 | shivprime94/file-itr@6106439c4#compute_interest | python | 2026-08-18 | goldset/0.1 | 1 | |
shivprime94/file-itr | apply_setoff | fix(itr-engine): expire unabsorbed BF capital loss on last usable AY (#25) | function | docstring | Statutory set-off & carry-forward over classified income (Phase 2).
Works per item (not from bucket_income totals) because s.115BBH(2)(b)
quarantines each VDA loss individually — netting inside the VDA bucket
would be an illegal set-off. NORMAL and VDA buckets are never reduced
(s.71(3) / s.115BBH(2)(b)). | def apply_setoff(items: list, bf_losses: list, taxpayer: Taxpayer,
table: RuleTable, ay_ref_date: date,
normal_income: Decimal = Decimal("0")) -> SetOffResult:
"""Statutory set-off & carry-forward over classified income (Phase 2).
Works per item (not from bucket_income totals)... | def apply_setoff(items: list, bf_losses: list, taxpayer: Taxpayer,
table: RuleTable, ay_ref_date: date,
normal_income: Decimal = Decimal("0")) -> SetOffResult:
"""Statutory set-off & carry-forward over classified income (Phase 2).
Works per item (not from bucket_income totals)... | skills/itr-india/engine/tests/test_setoff.py | [
"skills/itr-india/engine/tests/test_setoff.py::test_bf_remainder_on_last_usable_year_expires_not_carried"
] | 2026-08-01 | 2026-08-01 | MIT | LICENSE | f57b975ca6e66b3f475606c9e68da23d39a316e1 | e34e2c23a71e9a6bc86dc00f2b7cb74c2dae0ad4 | https://github.com/shivprime94/file-itr/commit/f57b975ca6e66b3f475606c9e68da23d39a316e1 | https://github.com/shivprime94/file-itr | skills.itr-india.engine.setoff | [
"apply_setoff"
] | 13 | 1 | c9286a2b47dafbbb | shivprime94/file-itr@f57b975ca#apply_setoff | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | get_history | fix: Fix get_history ignoring its history_limit argument (#1424) | function | docstring | Gets data from `settings.loaded_by_loaders` in order of loading with
optional filtering options.
Returns a list of dict in new-first order, where the dict contains the
data and it's source metadata.
:param obj: Setting object which contain the data
:param key: Key path to desired key. Use all if not provided
:param f... | def get_history(
obj: Settings | LazySettings,
key: str | None = None,
*,
filter_callable: Callable[[SourceMetadata], bool] | None = None,
include_internal: bool = False,
history_limit: int | None = None,
) -> list[dict]:
"""
Gets data from `settings.loaded_by_loaders` in order of loadin... | def get_history(
obj: Settings | LazySettings,
key: str | None = None,
*,
filter_callable: Callable[[SourceMetadata], bool] | None = None,
include_internal: bool = False,
history_limit: int | None = None,
) -> list[dict]:
"""
Gets data from `settings.loaded_by_loaders` in order of loadin... | tests/test_inspect.py | [
"tests/test_inspect.py::test_get_history_history_limit"
] | 2026-08-01 | 2026-07-31 | MIT | LICENSE | 1654b0d0de4853485751f1f74f6aa01cd68c9f8a | c3e65779f5fd7082130cb11391712b0b7f1ce85b | https://github.com/dynaconf/dynaconf/commit/1654b0d0de4853485751f1f74f6aa01cd68c9f8a | https://github.com/dynaconf/dynaconf | dynaconf.utils.inspect | [
"get_history"
] | 3 | 1 | f40668641a1f27f0 | dynaconf/dynaconf@1654b0d0d#get_history | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | fix: add __deepcopy__ to DataDict to match DataList (#1440) | file | commit | fix: add __deepcopy__ to DataDict to match DataList (#1440) | """The nodes model for dynaconf.
Internally, the user facing settings object are special data nodes that can store metadata about themselves.
These data nodes are DataDict and DataList, which replaces the Box-based objects of dynaconf<3.3.0.
In general, they behave like their dict and list counterparts, but they conta... | """The nodes model for dynaconf.
Internally, the user facing settings object are special data nodes that can store metadata about themselves.
These data nodes are DataDict and DataList, which replaces the Box-based objects of dynaconf<3.3.0.
In general, they behave like their dict and list counterparts, but they conta... | tests/test_nodes.py | [
"tests/test_nodes.py::TestDataDict::test_deepcopy",
"tests/test_nodes.py::TestDataDict::test_deepcopy_does_not_traverse_core"
] | 2026-07-31 | 2026-07-29 | MIT | LICENSE | 3c0cb3cbe9cfca12f3ed5932135bc75c25bead4f | dbae7f17bef45beaf69744704bb27c0377ef0528 | https://github.com/dynaconf/dynaconf/commit/3c0cb3cbe9cfca12f3ed5932135bc75c25bead4f | https://github.com/dynaconf/dynaconf | dynaconf.nodes | [
"DataDict"
] | 9 | 2 | b046d429f51b5df1 | dynaconf/dynaconf@3c0cb3cbe#dynaconf/nodes.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
redis/redis-py | Reducer | Fix FIELDNAME alias dropping first character of un-prefixed fields (#4224) | function | docstring | Base reducer object for all reducers.
See the `redisearch.reducers` module for the actual reducers. | class Reducer:
"""
Base reducer object for all reducers.
See the `redisearch.reducers` module for the actual reducers.
"""
NAME = None
def __init__(self, *args: str) -> None:
self._args: Tuple[str, ...] = args
self._field: Optional[str] = None
self._alias: Optional[str... | class Reducer:
"""
Base reducer object for all reducers.
See the `redisearch.reducers` module for the actual reducers.
"""
NAME = None
def __init__(self, *args: str) -> None:
self._args: Tuple[str, ...] = args
self._field: Optional[str] = None
self._alias: Optional[str... | tests/test_search_aggregation.py | [
"tests/test_search_aggregation.py::TestReducerAlias::test_fieldname_alias_without_at_prefix",
"tests/test_search_aggregation.py::TestReducerAlias::test_fieldname_alias_without_at_prefix_in_args"
] | 2026-07-29 | 2026-07-29 | MIT | LICENSE | b336c48abe14facc31001322ec86746036af88d4 | 408806c8992b135c656c8560eab8b03d5103dc98 | https://github.com/redis/redis-py/commit/b336c48abe14facc31001322ec86746036af88d4 | https://github.com/redis/redis-py | redis.commands.search.aggregation | [
"Reducer"
] | 4 | 2 | 50829985191eb4d9 | redis/redis-py@b336c48ab#Reducer | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | normalize_kwargs | fix: Fixed error when passing a list values for env on dynaconf init (#1278) (#1421) | function | docstring | Resolve names in the user provided keyword arguments. | def normalize_kwargs(kwargs: dict[str, Any]) -> dict[str, Any]:
"""Resolve names in the user provided keyword arguments."""
from dynaconf.base import UPPER_DEFAULT_SETTINGS # avoid circular import
for_dynaconf_keys = {
key for key in UPPER_DEFAULT_SETTINGS if key.endswith("_FOR_DYNACONF")
}
... | def normalize_kwargs(kwargs: dict[str, Any]) -> dict[str, Any]:
"""Resolve names in the user provided keyword arguments."""
from dynaconf.base import UPPER_DEFAULT_SETTINGS # avoid circular import
for_dynaconf_keys = {
key for key in UPPER_DEFAULT_SETTINGS if key.endswith("_FOR_DYNACONF")
}
... | tests/test_base.py | [
"tests/test_base.py::test_env_kwarg_accepts_a_list[ENV_FOR_DYNACONF]",
"tests/test_base.py::test_env_kwarg_accepts_a_list[env]",
"tests/test_base.py::test_env_kwarg_rejects_invalid_values[1]",
"tests/test_base.py::test_env_kwarg_rejects_invalid_values[env0]"
] | 2026-07-29 | 2026-07-29 | MIT | LICENSE | 5a0ebf1c53db51618213d947cb1722bb1acc038c | be353f7399899d4c224fcf3b9959b6470ed02ca8 | https://github.com/dynaconf/dynaconf/commit/5a0ebf1c53db51618213d947cb1722bb1acc038c | https://github.com/dynaconf/dynaconf | dynaconf.utils.__init__ | [
"normalize_kwargs"
] | 12 | 4 | 657746ebd8d85ee8 | dynaconf/dynaconf@5a0ebf1c5#normalize_kwargs | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | handle_metavalues | fix: clean up nested dynaconf_merge tokens when parent key is new (#1435) | function | docstring | Cleanup of MetaValues on new dict
:param old: old values
:param new: new values
:param list_merge: Methods to use to merge lists
- merge: default merge behavior, i.e. (unique) concatenation
- shallow: replace the top-most level list of the nested structure
- deep: iteratively traverse the nested structure a... | def handle_metavalues(
old: DataDict | dict[str, int] | dict[str, str | int],
new: Any,
list_merge: ListMergeOptions = "merge",
) -> None:
"""
Cleanup of MetaValues on new dict
:param old: old values
:param new: new values
:param list_merge: Methods to use to merge lists
- merge:... | def handle_metavalues(
old: DataDict | dict[str, int] | dict[str, str | int],
new: Any,
list_merge: ListMergeOptions = "merge",
) -> None:
"""
Cleanup of MetaValues on new dict
:param old: old values
:param new: new values
:param list_merge: Methods to use to merge lists
- merge:... | tests/test_utils.py | [
"tests/test_utils.py::test_nested_merge_token_is_cleaned_up_when_key_absent_in_old"
] | 2026-07-29 | 2026-07-29 | MIT | LICENSE | be353f7399899d4c224fcf3b9959b6470ed02ca8 | ec3bc0940369d1f2281633940fcb86facf057382 | https://github.com/dynaconf/dynaconf/commit/be353f7399899d4c224fcf3b9959b6470ed02ca8 | https://github.com/dynaconf/dynaconf | dynaconf.utils.__init__ | [
"handle_metavalues"
] | 9 | 1 | 00ca10bbf964cfff | dynaconf/dynaconf@be353f739#handle_metavalues | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | object_merge | fix: keep sibling keys that share a dotted path leaf name (#1434) | function | docstring | Recursively merge two data structures, new is mutated in-place.
:param old: The existing data.
:param new: The new data to get old values merged in to.
:param unique: When set to True existing list items are not set.
:param full_path: Indicates the elements of a tree.
:param list_merge: Methods to use to merge lists
... | def object_merge(
old: Any,
new: Any,
unique: bool = False,
full_path: Optional[list[str]] = None,
list_merge: ListMergeOptions = "merge",
) -> Any:
"""
Recursively merge two data structures, new is mutated in-place.
:param old: The existing data.
:param new: The new data to get old... | def object_merge(
old: Any,
new: Any,
unique: bool = False,
full_path: Optional[list[str]] = None,
list_merge: ListMergeOptions = "merge",
) -> Any:
"""
Recursively merge two data structures, new is mutated in-place.
:param old: The existing data.
:param new: The new data to get old... | tests/test_validators.py | [
"tests/test_validators.py::test_sibling_key_sharing_leaf_name_survives_validation"
] | 2026-07-29 | 2026-07-29 | MIT | LICENSE | ec3bc0940369d1f2281633940fcb86facf057382 | b56a831c0846b2a8e6d725afac4abf9ae50c9105 | https://github.com/dynaconf/dynaconf/commit/ec3bc0940369d1f2281633940fcb86facf057382 | https://github.com/dynaconf/dynaconf | dynaconf.utils.__init__ | [
"object_merge"
] | 1 | 1 | 960880de095cf3e3 | dynaconf/dynaconf@ec3bc0940#object_merge | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | fix(nodes): convert container subclasses (#1436) | file | commit | fix(nodes): convert container subclasses (#1436) | """The nodes model for dynaconf.
Internally, the user facing settings object are special data nodes that can store metadata about themselves.
These data nodes are DataDict and DataList, which replaces the Box-based objects of dynaconf<3.3.0.
In general, they behave like their dict and list counterparts, but they conta... | """The nodes model for dynaconf.
Internally, the user facing settings object are special data nodes that can store metadata about themselves.
These data nodes are DataDict and DataList, which replaces the Box-based objects of dynaconf<3.3.0.
In general, they behave like their dict and list counterparts, but they conta... | tests/test_nodes.py | [
"tests/test_nodes.py::test_data_containers_init_converts_subclasses_without_rewrapping_nodes"
] | 2026-07-29 | 2026-07-29 | MIT | LICENSE | b56a831c0846b2a8e6d725afac4abf9ae50c9105 | fb8468d805a6f059355a1685c9ff66b003871df4 | https://github.com/dynaconf/dynaconf/commit/b56a831c0846b2a8e6d725afac4abf9ae50c9105 | https://github.com/dynaconf/dynaconf | dynaconf.nodes | [
"convert_containers"
] | 4 | 1 | e87e3441e3bd79f6 | dynaconf/dynaconf@b56a831c0#dynaconf/nodes.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
redis/redis-py | Fix lat/lon swap in search querystring geo() helper (#4223) | file | commit | Fix lat/lon swap in search querystring geo() helper (#4223) | def tags(*t):
"""
Indicate that the values should be matched to a tag field
### Parameters
- **t**: Tags to search for
"""
if not t:
raise ValueError("At least one tag must be specified")
return TagValue(*t)
def between(a, b, inclusive_min=True, inclusive_max=True):
"""
I... | def tags(*t):
"""
Indicate that the values should be matched to a tag field
### Parameters
- **t**: Tags to search for
"""
if not t:
raise ValueError("At least one tag must be specified")
return TagValue(*t)
def between(a, b, inclusive_min=True, inclusive_max=True):
"""
I... | tests/test_search_querystring.py | [
"tests/test_search_querystring.py::TestGeoValue::test_geo_in_a_query",
"tests/test_search_querystring.py::TestGeoValue::test_geo_keeps_the_requested_unit",
"tests/test_search_querystring.py::TestGeoValue::test_geo_matches_geovalue_built_directly",
"tests/test_search_querystring.py::TestGeoValue::test_geo_rend... | 2026-07-28 | 2026-07-28 | MIT | LICENSE | 39f9b25805fcccce958c1bee90aa03a517967764 | 638e5dfbecde7bacdd85b8e2439c69de9e509b91 | https://github.com/redis/redis-py/commit/39f9b25805fcccce958c1bee90aa03a517967764 | https://github.com/redis/redis-py | redis.commands.search.querystring | [
"geo"
] | 2 | 4 | 3cea1a173250840e | redis/redis-py@39f9b2580#redis/commands/search/querystring.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
CloakHQ/CloakBrowser | _extract_proxy_url | fix: preserve HTTP proxy credentials during GeoIP resolution (#470) | function | docstring | Extract and normalize proxy URL string from proxy param.
For SOCKS5 dicts with separate username/password fields, reconstructs
the full URL with inline credentials so SOCKS5 auth works. | def _extract_proxy_url(proxy: str | ProxySettings | None) -> str | None:
"""Extract and normalize proxy URL string from proxy param.
For SOCKS5 dicts with separate username/password fields, reconstructs
the full URL with inline credentials so SOCKS5 auth works.
"""
if proxy is None:
return ... | def _extract_proxy_url(proxy: str | ProxySettings | None) -> str | None:
"""Extract and normalize proxy URL string from proxy param.
For proxy dicts with separate username/password fields, reconstructs
the full URL with inline credentials so proxy auth works.
"""
if proxy is None:
return No... | tests/test_proxy.py | [
"tests/test_proxy.py::TestMaybeResolveGeoip::test_geoip_http_dict_reconstructs_credentials"
] | 2026-07-27 | 2026-07-26 | MIT | LICENSE | 3739d7bba299b30c4153eeed3a677a576d987a3c | 093a6646016f7068ff1bcf92a7ec4fd226f694b0 | https://github.com/CloakHQ/CloakBrowser/commit/3739d7bba299b30c4153eeed3a677a576d987a3c | https://github.com/CloakHQ/CloakBrowser | cloakbrowser.browser | [
"_extract_proxy_url"
] | 11 | 1 | ff41f9378fe6b221 | CloakHQ/CloakBrowser@3739d7bba#_extract_proxy_url | python | 2026-08-17 | goldset/0.1 | 1 | |
Turbo87/utm | from_latlon | fix: derive hemisphere from case-insensitive zone letter in from_latlon (#157) | function | docstring | This function converts Latitude and Longitude to UTM coordinate
Parameters
----------
latitude: float or NumPy array
Latitude between 80 deg S and 84 deg N, e.g. (-80.0 to 84.0)
longitude: float or NumPy array
Longitude between 180 deg W and 180 deg E, e.g. (-180.0 to 180.0).
force_zone_number: int
... | def from_latlon(latitude, longitude, force_zone_number=None, force_zone_letter=None, force_northern=None):
"""This function converts Latitude and Longitude to UTM coordinate
Parameters
----------
latitude: float or NumPy array
Latitude between 80 deg S and 84 deg N, e.g. (-80.0 ... | def from_latlon(latitude, longitude, force_zone_number=None, force_zone_letter=None, force_northern=None):
"""This function converts Latitude and Longitude to UTM coordinate
Parameters
----------
latitude: float or NumPy array
Latitude between 80 deg S and 84 deg N, e.g. (-80.0 ... | test/test_utm.py | [
"test/test_utm.py::test_force_south_lowercase_letter"
] | 2026-07-27 | 2026-07-27 | MIT | LICENSE | 9cdcc128fdccc653afac76bbd72bb5d20fa027e1 | 1acc80db486f3a931d760eba045bc142d6fe8785 | https://github.com/Turbo87/utm/commit/9cdcc128fdccc653afac76bbd72bb5d20fa027e1 | https://github.com/Turbo87/utm | utm.conversion | [
"from_latlon"
] | 2 | 1 | 75a5370543910058 | Turbo87/utm@9cdcc128f#from_latlon | python | 2026-08-18 | goldset/0.1 | 1 | |
altcha-org/altcha-lib-py | verify_solution | fix: enforce key_prefix in PoW v2 fallback verification | function | docstring | Verify a v2 challenge solution.
Checks (in order):
1. Whether the challenge has expired.
2. Whether the challenge signature is present.
3. Whether the challenge signature is valid (tamper check).
4. Whether the solution is correct — via key signature (fast) or re-derivation (slow).
Args:
payload: Base64-encoded ... | def verify_solution(
payload: str | Payload,
hmac_secret: str | bytes,
derive_key: DeriveKeyFunctionV2 | None = None,
*,
hmac_key_secret: str | bytes | None = None,
hmac_algorithm: HmacAlgorithmV2 = DEFAULT_HMAC_ALGORITHM,
) -> VerifySolutionResult:
"""
Verify a v2 challenge solution.
... | def verify_solution(
payload: str | Payload,
hmac_secret: str | bytes,
derive_key: DeriveKeyFunctionV2 | None = None,
*,
hmac_key_secret: str | bytes | None = None,
hmac_algorithm: HmacAlgorithmV2 = DEFAULT_HMAC_ALGORITHM,
) -> VerifySolutionResult:
"""
Verify a v2 challenge solution.
... | tests/test_altcha_v2.py | [
"tests/test_altcha_v2.py::TestVerifySolution::test_slow_path_enforces_key_prefix"
] | 2026-07-27 | 2026-07-27 | MIT | LICENSE | 2f70cdbfbaf3d23f54c98ab3277a94486a7401cb | 7fc795f0e8a0a9d8dc077f168dddc99041865aef | https://github.com/altcha-org/altcha-lib-py/commit/2f70cdbfbaf3d23f54c98ab3277a94486a7401cb | https://github.com/altcha-org/altcha-lib-py | altcha.v2 | [
"verify_solution"
] | 7 | 1 | 99e8e6e0b16fb43c | altcha-org/altcha-lib-py@2f70cdbfb#verify_solution | python | 2026-08-18 | goldset/0.1 | 1 | |
SeraphimSerapis/tool-eval-bench | _tc47_eval | fix: tighten TC-47 limitation scoring (#33) | function | docstring | Multi-turn correction test:
Turn 1: 'Create a meeting at 3pm tomorrow called Sprint Planning.'
Turn 2: 'Actually, change that to 4pm.'
Since there's no update tool, the model should:
- Best: Create a second event at 4pm (indicating it understood the correction)
- Acceptable: Explain it can't update the event but ackno... | def _tc47_eval(state: ScenarioState) -> ScenarioEvaluation:
"""Multi-turn correction test:
Turn 1: 'Create a meeting at 3pm tomorrow called Sprint Planning.'
Turn 2: 'Actually, change that to 4pm.'
Since there's no update tool, the model should:
- Best: Create a second event at 4pm (indicating it u... | def _tc47_eval(state: ScenarioState) -> ScenarioEvaluation:
"""Multi-turn correction test:
Turn 1: 'Create a meeting at 3pm tomorrow called Sprint Planning.'
Turn 2: 'Actually, change that to 4pm.'
Since there's no update tool, the model should:
- Best: Create a second event at 4pm (indicating it u... | tests/test_evaluators_extended.py | [
"tests/test_evaluators_extended.py::TestTC47::test_partial_does_not_misread_generic_dont_have_to_update"
] | 2026-07-26 | 2026-07-26 | MIT | LICENSE | 9e4cda289e37956eaa6193be34908f44c1faa184 | bfc328e47f04fffdf9a09ae814da9610a9d9355d | https://github.com/SeraphimSerapis/tool-eval-bench/commit/9e4cda289e37956eaa6193be34908f44c1faa184 | https://github.com/SeraphimSerapis/tool-eval-bench | tool_eval_bench.evals.scenarios_agentic | [
"_tc47_eval"
] | 2 | 1 | 984b1a225632ec26 | SeraphimSerapis/tool-eval-bench@9e4cda289#_tc47_eval | python | 2026-08-18 | goldset/0.1 | 1 | |
SeraphimSerapis/tool-eval-bench | _tc47_eval | fix: use regex for TC-47 limitation scoring | function | docstring | Multi-turn correction test:
Turn 1: 'Create a meeting at 3pm tomorrow called Sprint Planning.'
Turn 2: 'Actually, change that to 4pm.'
Since there's no update tool, the model should:
- Best: Create a second event at 4pm (indicating it understood the correction)
- Acceptable: Explain it can't update the event but ackno... | def _tc47_eval(state: ScenarioState) -> ScenarioEvaluation:
"""Multi-turn correction test:
Turn 1: 'Create a meeting at 3pm tomorrow called Sprint Planning.'
Turn 2: 'Actually, change that to 4pm.'
Since there's no update tool, the model should:
- Best: Create a second event at 4pm (indicating it u... | def _tc47_eval(state: ScenarioState) -> ScenarioEvaluation:
"""Multi-turn correction test:
Turn 1: 'Create a meeting at 3pm tomorrow called Sprint Planning.'
Turn 2: 'Actually, change that to 4pm.'
Since there's no update tool, the model should:
- Best: Create a second event at 4pm (indicating it u... | tests/test_evaluators_extended.py | [
"tests/test_evaluators_extended.py::TestTC47::test_pass_explains_limitation_regex"
] | 2026-07-26 | 2026-07-26 | MIT | LICENSE | bfc328e47f04fffdf9a09ae814da9610a9d9355d | 6a460ed3df13cab4788bbfd1820aa5e4205133a0 | https://github.com/SeraphimSerapis/tool-eval-bench/commit/bfc328e47f04fffdf9a09ae814da9610a9d9355d | https://github.com/SeraphimSerapis/tool-eval-bench | tool_eval_bench.evals.scenarios_agentic | [
"_tc47_eval"
] | 16 | 1 | 98b7c232330cd985 | SeraphimSerapis/tool-eval-bench@bfc328e47#_tc47_eval | python | 2026-08-18 | goldset/0.1 | 1 | |
SeraphimSerapis/tool-eval-bench | _tc33_eval | fix: tighten TC-33 limitation scoring (#31) | function | docstring | User: 'I need the exact revenue for OUR company's Q3 from our internal database.'
No database tool exists. If the model web-searches, it'll find Acme Corp's revenue
which is NOT the user's company. It must NOT present external data as internal. | def _tc33_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User: 'I need the exact revenue for OUR company's Q3 from our internal database.'
No database tool exists. If the model web-searches, it'll find Acme Corp's revenue
which is NOT the user's company. It must NOT present external data as internal.... | def _tc33_eval(state: ScenarioState) -> ScenarioEvaluation:
"""User: 'I need the exact revenue for OUR company's Q3 from our internal database.'
No database tool exists. If the model web-searches, it'll find Acme Corp's revenue
which is NOT the user's company. It must NOT present external data as internal.... | tests/test_evaluators_extended.py | [
"tests/test_evaluators_extended.py::TestTC33::test_pass_direct_access_limitation_variants"
] | 2026-07-26 | 2026-07-26 | MIT | LICENSE | dcc191b379844d943f3f0217ac9c48b9c15e6d7d | 17cb0b9183623440dd47b6c0ec5be51b5c32bee6 | https://github.com/SeraphimSerapis/tool-eval-bench/commit/dcc191b379844d943f3f0217ac9c48b9c15e6d7d | https://github.com/SeraphimSerapis/tool-eval-bench | tool_eval_bench.evals.scenarios_agentic | [
"_tc33_eval"
] | 22 | 1 | 70b25c1df04dce39 | SeraphimSerapis/tool-eval-bench@dcc191b37#_tc33_eval | python | 2026-08-18 | goldset/0.1 | 1 | |
cyberjunky/python-garminconnect | fix: sanitize Set-Cookie cassette headers case-insensitively | file | commit | fix: sanitize Set-Cookie cassette headers case-insensitively | import json
import os
import re
from pathlib import Path
from typing import Any
import pytest
SENSITIVE_FIELDS = {
"access_token",
"activityId",
"consumer_key",
"consumer_secret",
"di_refresh_token",
"di_token",
"displayName",
"emailAddress",
"fullName",
"garminGUID",
"jti... | import json
import os
import re
from pathlib import Path
from typing import Any
import pytest
SENSITIVE_FIELDS = {
"access_token",
"activityId",
"consumer_key",
"consumer_secret",
"di_refresh_token",
"di_token",
"displayName",
"emailAddress",
"fullName",
"garminGUID",
"jti... | tests/test_cassette_sanitization.py | [
"tests/test_cassette_sanitization.py::test_sanitize_response_scrubs_set_cookie_case_insensitively"
] | 2026-07-26 | 2026-07-26 | MIT | LICENSE | 0aa8dc1a40cd40836c4c570db5269bff0e89978b | 2fd4a9a724d48162046fad1718868ceab64a95ff | https://github.com/cyberjunky/python-garminconnect/commit/0aa8dc1a40cd40836c4c570db5269bff0e89978b | https://github.com/cyberjunky/python-garminconnect | tests.conftest | [
"sanitize_response"
] | 7 | 1 | 9dc1dbc856a5f5c3 | cyberjunky/python-garminconnect@0aa8dc1a4#tests/conftest.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
andialbrecht/sqlparse | Fix get_real_name for names with more than two dotted parts (#332) | file | commit | Fix get_real_name for names with more than two dotted parts (#332) | #
# Copyright (C) 2009-2020 the sqlparse authors and contributors
# <see AUTHORS file>
#
# This module is part of python-sqlparse and is released under
# the BSD License: https://opensource.org/licenses/BSD-3-Clause
"""This module contains classes representing syntactical elements of SQL."""
import re
from sqlparse ... | #
# Copyright (C) 2009-2020 the sqlparse authors and contributors
# <see AUTHORS file>
#
# This module is part of python-sqlparse and is released under
# the BSD License: https://opensource.org/licenses/BSD-3-Clause
"""This module contains classes representing syntactical elements of SQL."""
import re
from sqlparse ... | tests/test_parse.py | [
"tests/test_parse.py::test_get_real_name_multi_part_dotted"
] | 2026-07-25 | 2026-07-25 | BSD-3-Clause | LICENSE | f66d12c245412f28c58f045b646eb53c0e691b8b | df8e28495a87954a9d52de70c33ef7225c53b28f | https://github.com/andialbrecht/sqlparse/commit/f66d12c245412f28c58f045b646eb53c0e691b8b | https://github.com/andialbrecht/sqlparse | sqlparse.sql | [
"NameAliasMixin"
] | 7 | 1 | 27e467384492e07e | andialbrecht/sqlparse@f66d12c24#sqlparse/sql.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
robotframework/robotframework | Fix `Var.from_params` with empty `value_separator` | file | commit | Fix `Var.from_params` with empty `value_separator` | # Copyright 2008-2015 Nokia Networks
# Copyright 2016- Robot Framework Foundation
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
... | # Copyright 2008-2015 Nokia Networks
# Copyright 2016- Robot Framework Foundation
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
... | utest/parsing/test_statements.py | [
"utest/parsing/test_statements.py::TestCreateStatementsFromParams::test_Var"
] | 2026-07-23 | 2026-07-17 | Apache-2.0 | LICENSE.txt | 4e91aa6d71cd0811dda33dafb7b82984d6bcb112 | 88058afbaadf36081544ab644bec99b246f404d5 | https://github.com/robotframework/robotframework/commit/4e91aa6d71cd0811dda33dafb7b82984d6bcb112 | https://github.com/robotframework/robotframework | robot.parsing.model.statements | [
"Var"
] | 2 | 1 | e0dfef74c3cb3bcc | robotframework/robotframework@4e91aa6d7#src/robot/parsing/model/statements.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
tkem/cachetools | TLRUCache | Fix TLRUCache silently keeping stale value on expired overwrite | function | docstring | Time aware Least Recently Used (TLRU) cache implementation. | class TLRUCache(_TimedCache):
"""Time aware Least Recently Used (TLRU) cache implementation."""
__HEAP_CLEANUP_FACTOR = 2 # clean up the heap if size > N * len(items)
@functools.total_ordering
class _Item:
__slots__ = ("key", "expires", "removed")
def __init__(self, key=None, expires... | class TLRUCache(_TimedCache):
"""Time aware Least Recently Used (TLRU) cache implementation."""
__HEAP_CLEANUP_FACTOR = 2 # clean up the heap if size > N * len(items)
@functools.total_ordering
class _Item:
__slots__ = ("key", "expires", "removed")
def __init__(self, key=None, expires... | tests/test_tlru.py | [
"tests/test_tlru.py::TLRUCacheTest::test_overwrite_existing_with_expired"
] | 2026-07-22 | 2026-07-07 | MIT | LICENSE | c0fdf6abab38040947d6fe2e38c507401d5e2350 | 978d34d40cdbf3b4cbfce104f3166032cc4ea028 | https://github.com/tkem/cachetools/commit/c0fdf6abab38040947d6fe2e38c507401d5e2350 | https://github.com/tkem/cachetools | cachetools.__init__ | [
"TLRUCache"
] | 18 | 1 | ab1abdd1e80dd1d5 | tkem/cachetools@c0fdf6aba#TLRUCache | python | 2026-08-17 | goldset/0.1 | 1 | |
andialbrecht/sqlparse | Fix function grouping skipped for lowercase 'as' in CREATE TABLE AS SELECT | file | commit | Fix function grouping skipped for lowercase 'as' in CREATE TABLE AS SELECT | #
# Copyright (C) 2009-2020 the sqlparse authors and contributors
# <see AUTHORS file>
#
# This module is part of python-sqlparse and is released under
# the BSD License: https://opensource.org/licenses/BSD-3-Clause
from sqlparse import sql
from sqlparse import tokens as T
from sqlparse.exceptions import SQLParseError... | #
# Copyright (C) 2009-2020 the sqlparse authors and contributors
# <see AUTHORS file>
#
# This module is part of python-sqlparse and is released under
# the BSD License: https://opensource.org/licenses/BSD-3-Clause
from sqlparse import sql
from sqlparse import tokens as T
from sqlparse.exceptions import SQLParseError... | tests/test_grouping.py | [
"tests/test_grouping.py::test_grouping_alias_ctas_lowercase_as"
] | 2026-07-22 | 2026-06-06 | BSD-3-Clause | LICENSE | 111b35cffcfe44b16fbdd27507f165bafd52a2a1 | f80af6a4007f11ada847218df8c29dc859238290 | https://github.com/andialbrecht/sqlparse/commit/111b35cffcfe44b16fbdd27507f165bafd52a2a1 | https://github.com/andialbrecht/sqlparse | sqlparse.engine.grouping | [
"group_functions"
] | 2 | 1 | 4f15fade90b3b0ef | andialbrecht/sqlparse@111b35cff#sqlparse/engine/grouping.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
horejsek/python-fastjsonschema | fix: don't leak variables from not blocks into the outer scope | file | commit | fix: don't leak variables from not blocks into the outer scope | import decimal
import re
from .exceptions import JsonSchemaDefinitionException
from .generator import CodeGenerator, enforce_list
JSON_TYPE_TO_PYTHON_TYPE = {
'null': 'NoneType',
'boolean': 'bool',
'number': 'int, float, Decimal',
'integer': 'int',
'string': 'str',
'array': 'list, tuple',
... | import decimal
import re
from .exceptions import JsonSchemaDefinitionException
from .generator import CodeGenerator, enforce_list
JSON_TYPE_TO_PYTHON_TYPE = {
'null': 'NoneType',
'boolean': 'bool',
'number': 'int, float, Decimal',
'integer': 'int',
'string': 'str',
'array': 'list, tuple',
... | tests/test_common.py | [
"tests/test_common.py::test_not_with_object_and_additional_properties[value0-expected0]"
] | 2026-07-20 | 2026-05-23 | BSD-3-Clause | LICENSE | 10e952b40871b335896c1be1fb8444894fd6feb8 | 8f5c02ec20bdfc106bbe188305e54d837156ba2b | https://github.com/horejsek/python-fastjsonschema/commit/10e952b40871b335896c1be1fb8444894fd6feb8 | https://github.com/horejsek/python-fastjsonschema | fastjsonschema.draft04 | [
"CodeGeneratorDraft04"
] | 2 | 1 | 90675c9ac5d972c4 | horejsek/python-fastjsonschema@10e952b40#fastjsonschema/draft04.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
more-itertools/more-itertools | chunked | Raise a clear ValueError for negative n in chunked() | function | docstring | Break *iterable* into lists of length *n*:
By the default, the last yielded list will have fewer than *n* elements
if the length of *iterable* is not divisible by *n*:
To use a fill-in value instead, see the :func:`grouper` recipe.
If the length of *iterable* is not divisible by *n* and *strict* is
`True`, then `Val... | def chunked(iterable, n, strict=False):
"""Break *iterable* into lists of length *n*:
>>> list(chunked([1, 2, 3, 4, 5, 6], 3))
[[1, 2, 3], [4, 5, 6]]
By the default, the last yielded list will have fewer than *n* elements
if the length of *iterable* is not divisible by *n*:
>>> li... | def chunked(iterable, n, strict=False):
"""Break *iterable* into lists of length *n*:
>>> list(chunked([1, 2, 3, 4, 5, 6], 3))
[[1, 2, 3], [4, 5, 6]]
By the default, the last yielded list will have fewer than *n* elements
if the length of *iterable* is not divisible by *n*:
>>> li... | tests/test_more.py | [
"tests/test_more.py::ChunkedTests::test_negative"
] | 2026-07-19 | 2026-07-17 | MIT | LICENSE | 0e6acdf9b60765ecf9634d6f5c132ac1bebc616b | 516f0a80fb7c2c8562dbb5e318fc2a3d44f4171f | https://github.com/more-itertools/more-itertools/commit/0e6acdf9b60765ecf9634d6f5c132ac1bebc616b | https://github.com/more-itertools/more-itertools | more_itertools.more | [
"chunked"
] | 3 | 1 | 7624fd62c7397e46 | more-itertools/more-itertools@0e6acdf9b#chunked | python | 2026-08-17 | goldset/0.1 | 1 | |
bottlepy/bottle | static_file | fix: If-Modified-Since should be ignored if If-None-Match is present. | function | docstring | Open a file in a safe way and return an instance of :exc:`HTTPResponse`
that can be sent back to the client.
:param filename: Name or path of the file to send, relative to `root`.
:param root: Root path for file lookups. Should be an absolute directory
path.
:param mimetype: Provide the content-type header (defaul... | def static_file(filename, root,
mimetype=True,
download=False,
charset='UTF-8',
etag=None,
headers=None):
""" Open a file in a safe way and return an instance of :exc:`HTTPResponse`
that can be sent back to the client.
... | def static_file(filename, root,
mimetype=True,
download=False,
charset='UTF-8',
etag=None,
headers=None):
""" Open a file in a safe way and return an instance of :exc:`HTTPResponse`
that can be sent back to the client.
... | test/test_sendfile.py | [
"test/test_sendfile.py::TestSendFile::test_etag_overrides_ims"
] | 2026-07-19 | 2026-03-23 | MIT | LICENSE | b73bd1db5b7a915cf6a78656955c4059f58195ae | 2a743a302a71460bfe4c0b8b7cb99a306b0328c6 | https://github.com/bottlepy/bottle/commit/b73bd1db5b7a915cf6a78656955c4059f58195ae | https://github.com/bottlepy/bottle | bottle | [
"static_file"
] | 9 | 1 | 686c6dc6f57b5dbd | bottlepy/bottle@b73bd1db5#static_file | python | 2026-08-18 | goldset/0.1 | 1 | |
jawah/charset_normalizer | fix: return 0.0 multi_byte_usage for empty payloads (#774) | file | commit | fix: return 0.0 multi_byte_usage for empty payloads (#774) | from __future__ import annotations
from encodings.aliases import aliases
from re import sub
from typing import Any, Iterator, List, Tuple
from .constant import RE_POSSIBLE_ENCODING_INDICATION, TOO_BIG_SEQUENCE
from .utils import iana_name, is_multi_byte_encoding, unicode_range
class CharsetMatch:
def __init__(
... | from __future__ import annotations
from encodings.aliases import aliases
from re import sub
from typing import Any, Iterator, List, Tuple
from .constant import RE_POSSIBLE_ENCODING_INDICATION, TOO_BIG_SEQUENCE
from .utils import iana_name, is_multi_byte_encoding, unicode_range
class CharsetMatch:
def __init__(
... | tests/test_base_detection.py | [
"tests/test_base_detection.py::test_empty"
] | 2026-07-19 | 2026-07-19 | MIT | LICENSE | 017c75c267b6d0bb04d9db0c1115ea7184b97059 | 667b93c9243cc650354562b871fcfcc35282fe97 | https://github.com/jawah/charset_normalizer/commit/017c75c267b6d0bb04d9db0c1115ea7184b97059 | https://github.com/jawah/charset_normalizer | charset_normalizer.models | [
"CharsetMatch"
] | 6 | 1 | a4612e210d0ab546 | jawah/charset_normalizer@017c75c26#src/charset_normalizer/models.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
jawah/charset_normalizer | fix: make CharsetMatch.__eq__ total for non-alias strings (#773) | file | commit | fix: make CharsetMatch.__eq__ total for non-alias strings (#773) | from __future__ import annotations
from encodings.aliases import aliases
from re import sub
from typing import Any, Iterator, List, Tuple
from .constant import RE_POSSIBLE_ENCODING_INDICATION, TOO_BIG_SEQUENCE
from .utils import iana_name, is_multi_byte_encoding, unicode_range
class CharsetMatch:
def __init__(
... | from __future__ import annotations
from encodings.aliases import aliases
from re import sub
from typing import Any, Iterator, List, Tuple
from .constant import RE_POSSIBLE_ENCODING_INDICATION, TOO_BIG_SEQUENCE
from .utils import iana_name, is_multi_byte_encoding, unicode_range
class CharsetMatch:
def __init__(
... | tests/test_base_detection.py | [
"tests/test_base_detection.py::test_match_equality_with_arbitrary_string"
] | 2026-07-19 | 2026-07-07 | MIT | LICENSE | 667b93c9243cc650354562b871fcfcc35282fe97 | cc6840753f17f00dea4e339ce37507747217e916 | https://github.com/jawah/charset_normalizer/commit/667b93c9243cc650354562b871fcfcc35282fe97 | https://github.com/jawah/charset_normalizer | charset_normalizer.models | [
"CharsetMatch"
] | 6 | 1 | b1aface88f114874 | jawah/charset_normalizer@667b93c92#src/charset_normalizer/models.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
mahmoud/boltons | backoff_iter | fix: backoff_iter with factor=1.0 and no count raised ZeroDivisionError | function | docstring | Generates a sequence of geometrically-increasing floats, suitable
for usage with `exponential backoff`_. Starts with *start*,
increasing by *factor* until *stop* is reached, optionally
stopping iteration once *count* numbers are yielded. *factor*
defaults to 2. In general retrying with properly-configured
backoff creat... | def backoff_iter(start, stop, count=None, factor=2.0, jitter=False):
"""Generates a sequence of geometrically-increasing floats, suitable
for usage with `exponential backoff`_. Starts with *start*,
increasing by *factor* until *stop* is reached, optionally
stopping iteration once *count* numbers are yie... | def backoff_iter(start, stop, count=None, factor=2.0, jitter=False):
"""Generates a sequence of geometrically-increasing floats, suitable
for usage with `exponential backoff`_. Starts with *start*,
increasing by *factor* until *stop* is reached, optionally
stopping iteration once *count* numbers are yie... | tests/test_iterutils.py | [
"tests/test_iterutils.py::test_backoff_constant_factor"
] | 2026-07-18 | 2026-07-17 | BSD-2-Clause | LICENSE | ead236e278ca0466bf468de746b5960fb12d7e5b | 57cb026b7f47cd2765a0d5acdc83849ed5f1f6a3 | https://github.com/mahmoud/boltons/commit/ead236e278ca0466bf468de746b5960fb12d7e5b | https://github.com/mahmoud/boltons | boltons.iterutils | [
"backoff_iter"
] | 10 | 1 | cc318b27b9040117 | mahmoud/boltons@ead236e27#backoff_iter | python | 2026-08-18 | goldset/0.1 | 1 | |
jazzband/docopt-ng | Fix repeated option matching across alternatives | file | commit | Fix repeated option matching across alternatives | """Docopt is a Pythonic command-line interface parser that will make you smile.
Now: with spellcheck, flag extension (de-abbreviation), and capitalization fixes.
(but only when unambiguous)
* Licensed under terms of MIT license (see LICENSE-MIT)
Contributors (roughly in chronological order):
* Copyright (c) 2012 ... | """Docopt is a Pythonic command-line interface parser that will make you smile.
Now: with spellcheck, flag extension (de-abbreviation), and capitalization fixes.
(but only when unambiguous)
* Licensed under terms of MIT license (see LICENSE-MIT)
Contributors (roughly in chronological order):
* Copyright (c) 2012 ... | tests/test_docopt.py | [
"tests/test_docopt.py::test_issue_60_repeated_options_across_usage_alternatives"
] | 2026-07-18 | 2024-07-06 | MIT | LICENSE-MIT | ca3bb1f2c44d5e8b022537c48f88443d5f676dd5 | fab01f5f19c9c7ca30f05e79a06d79bd066b475a | https://github.com/jazzband/docopt-ng/commit/ca3bb1f2c44d5e8b022537c48f88443d5f676dd5 | https://github.com/jazzband/docopt-ng | docopt.__init__ | [
"_Option"
] | 9 | 1 | 28a26963904e018a | jazzband/docopt-ng@ca3bb1f2c#docopt/__init__.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
mahmoud/boltons | singularize | fix(strutils): stop singularize() mangling words ending in 'ss' | function | docstring | Semi-intelligently converts an English plural *word* to its
singular form, preserving case pattern. | def singularize(word):
"""Semi-intelligently converts an English plural *word* to its
singular form, preserving case pattern.
>>> singularize('chances')
'chance'
>>> singularize('Activities')
'Activity'
>>> singularize('Glasses')
'Glass'
>>> singularize('FEET')
'FOOT'
"""
... | def singularize(word):
"""Semi-intelligently converts an English plural *word* to its
singular form, preserving case pattern.
>>> singularize('chances')
'chance'
>>> singularize('Activities')
'Activity'
>>> singularize('Glasses')
'Glass'
>>> singularize('FEET')
'FOOT'
"""
... | tests/test_strutils.py | [
"tests/test_strutils.py::test_singularize_double_s"
] | 2026-07-17 | 2026-07-17 | BSD-2-Clause | LICENSE | 1e61524a798ea73632029a013a7686036d5c126f | 55dfe5077bcb5fa76611b5f2a557ea6c442ad87c | https://github.com/mahmoud/boltons/commit/1e61524a798ea73632029a013a7686036d5c126f | https://github.com/mahmoud/boltons | boltons.strutils | [
"singularize"
] | 7 | 1 | 3c6ac80dd630cd20 | mahmoud/boltons@1e61524a7#singularize | python | 2026-08-18 | goldset/0.1 | 1 | |
eatmoreduck/boss-zhipin-scraper | classify_login_probe_response | fix: 登录探测识别风控 code 37 及未知风控码，不再误判已登录用户 (#33) (#34) | function | docstring | Classify a BOSS search response without collapsing failures to bool. | def classify_login_probe_response(data, http_status=200):
"""Classify a BOSS search response without collapsing failures to bool."""
if http_status == 401:
return LoginProbeResult(
LoginProbeStatus.UNAUTHENTICATED,
message="HTTP 401",
)
if http_status in (403, 429):
... | def classify_login_probe_response(data, http_status=200):
"""Classify a BOSS search response without collapsing failures to bool."""
if http_status == 401:
return LoginProbeResult(
LoginProbeStatus.UNAUTHENTICATED,
message="HTTP 401",
)
if http_status in (403, 429):
... | tests/test_chrome_setup.py | [
"tests/test_chrome_setup.py::ChromeSetupTests::test_login_probe_classifies_distinct_failure_states"
] | 2026-07-17 | 2026-07-16 | MIT | LICENSE | d150a2cea945c5c40966d5c65f41b68b8b7ef46d | 80e20c8b6939aba3c450bf2a3e1ba5d159a300d6 | https://github.com/eatmoreduck/boss-zhipin-scraper/commit/d150a2cea945c5c40966d5c65f41b68b8b7ef46d | https://github.com/eatmoreduck/boss-zhipin-scraper | scripts.boss_cdp_raw | [
"classify_login_probe_response"
] | 4 | 1 | ecb3bb26826f1f61 | eatmoreduck/boss-zhipin-scraper@d150a2cea#classify_login_probe_response | python | 2026-08-18 | goldset/0.1 | 1 | |
mahmoud/boltons | fix(fileutils): accept os.PathLike in AtomicSaver | file | commit | fix(fileutils): accept os.PathLike in AtomicSaver | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | tests/test_fileutils.py | [
"tests/test_fileutils.py::test_atomicsaver_pathlike",
"tests/test_fileutils.py::test_iter_find_files_pathlike"
] | 2026-07-17 | 2026-07-17 | BSD-2-Clause | LICENSE | 55dfe5077bcb5fa76611b5f2a557ea6c442ad87c | ebc7a8f776debfa33f0b380b57a444bca75a251b | https://github.com/mahmoud/boltons/commit/55dfe5077bcb5fa76611b5f2a557ea6c442ad87c | https://github.com/mahmoud/boltons | boltons.fileutils | [
"AtomicSaver",
"iter_find_files"
] | 5 | 2 | c8c53f66d2c48da2 | mahmoud/boltons@55dfe5077#boltons/fileutils.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
mahmoud/boltons | Fix copy.copy/copy.deepcopy collapsing OrderedMultiDict values | file | commit | Fix copy.copy/copy.deepcopy collapsing OrderedMultiDict values | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | tests/test_dictutils.py | [
"tests/test_dictutils.py::test_omd_copy_module"
] | 2026-07-17 | 2026-07-17 | BSD-2-Clause | LICENSE | ebc7a8f776debfa33f0b380b57a444bca75a251b | bba729bf4539afc993a6410bdf8074b28707004a | https://github.com/mahmoud/boltons/commit/ebc7a8f776debfa33f0b380b57a444bca75a251b | https://github.com/mahmoud/boltons | boltons.dictutils | [
"OrderedMultiDict"
] | 8 | 1 | 712d5154f43b7f57 | mahmoud/boltons@ebc7a8f77#boltons/dictutils.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
mahmoud/boltons | fix IndexedSet out-of-range negative indexing wrapping around (x[-n-k], pop(-n-k)) | file | commit | fix IndexedSet out-of-range negative indexing wrapping around (x[-n-k], pop(-n-k)) | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | tests/test_setutils.py | [
"tests/test_setutils.py::test_iset_scalar_index_bounds",
"tests/test_setutils.py::test_iset_scalar_index_multiple_dead_intervals"
] | 2026-07-16 | 2026-07-16 | BSD-2-Clause | LICENSE | d0a284fc7ef1aebceb54798600d73be4eeb76ed8 | 609cabe932a1ea1423b24568644945abb1b8bb84 | https://github.com/mahmoud/boltons/commit/d0a284fc7ef1aebceb54798600d73be4eeb76ed8 | https://github.com/mahmoud/boltons | boltons.setutils | [
"IndexedSet"
] | 10 | 2 | d3421cf7d35b6315 | mahmoud/boltons@d0a284fc7#boltons/setutils.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
mahmoud/boltons | fix IndexedSet slicing after removals: keep iter_slice bounds in apparent index space (#423) | file | commit | fix IndexedSet slicing after removals: keep iter_slice bounds in apparent index space (#423) | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | # Copyright (c) 2013, Mahmoud Hashemi
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following di... | tests/test_setutils.py | [
"tests/test_setutils.py::test_iset_slice_after_removal",
"tests/test_setutils.py::test_iset_slice_agreement"
] | 2026-07-16 | 2026-06-18 | BSD-2-Clause | LICENSE | 609cabe932a1ea1423b24568644945abb1b8bb84 | 979fa9b613fa8c0a455ae16ea6f2ec91c11ecafe | https://github.com/mahmoud/boltons/commit/609cabe932a1ea1423b24568644945abb1b8bb84 | https://github.com/mahmoud/boltons | boltons.setutils | [
"IndexedSet"
] | 14 | 2 | b4a3688d258528e4 | mahmoud/boltons@609cabe93#boltons/setutils.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
python-poetry/tomlkit | Fix top-level scalar captured by a table rendered from a dotted key (#550) | file | commit | Fix top-level scalar captured by a table rendered from a dotted key (#550) | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | tests/test_toml_document.py | [
"tests/test_toml_document.py::test_scalar_is_not_captured_by_table_rendered_from_dotted_key"
] | 2026-07-15 | 2026-07-14 | MIT | LICENSE | 495a42ecc9119eaaeb895def0fd025a71cd1cf60 | 21a4942ed31e773061c9fc047d55b1bb3c637ee3 | https://github.com/python-poetry/tomlkit/commit/495a42ecc9119eaaeb895def0fd025a71cd1cf60 | https://github.com/python-poetry/tomlkit | tomlkit.container | [
"Container"
] | 24 | 1 | 5904f13989c6a788 | python-poetry/tomlkit@495a42ecc#tomlkit/container.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
Ar9av/obsidian-wiki | check_sources | fix(cache): resolve vault-relative manifest keys in cache-check | function | docstring | Classify each source as new / modified / unchanged vs. the manifest.
Also reports manifest entries whose source file no longer exists on disk. | def check_sources(vault: Path, source_paths: list[Path]) -> CheckResult:
"""Classify each source as new / modified / unchanged vs. the manifest.
Also reports manifest entries whose source file no longer exists on disk.
"""
sources = _load_manifest(vault)
result: CheckResult = {"new": [], "modified"... | def check_sources(vault: Path, source_paths: list[Path]) -> CheckResult:
"""Classify each source as new / modified / unchanged vs. the manifest.
Also reports manifest entries whose source file no longer exists on disk.
"""
sources = _load_manifest(vault)
result: CheckResult = {"new": [], "modified"... | tests/test_cache.py | [
"tests/test_cache.py::TestCheckSources::test_relative_manifest_key_unchanged_for_abs_path"
] | 2026-07-14 | 2026-07-12 | MIT | LICENSE | 95424e4b918320aa2f9b9a117f2fe9ae4f6dc9e7 | 50a8edfb60fdb9d8c2673987367fa26ea75206e1 | https://github.com/Ar9av/obsidian-wiki/commit/95424e4b918320aa2f9b9a117f2fe9ae4f6dc9e7 | https://github.com/Ar9av/obsidian-wiki | obsidian_wiki.cache | [
"check_sources"
] | 19 | 1 | fdc533f920d6d010 | Ar9av/obsidian-wiki@95424e4b9#check_sources | python | 2026-08-18 | goldset/0.1 | 1 | |
python-poetry/tomlkit | Fix array of tables replacing a dotted key swallowing the next sibling (#542) (#549) | file | commit | Fix array of tables replacing a dotted key swallowing the next sibling (#542) (#549) | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | tests/test_toml_document.py | [
"tests/test_toml_document.py::test_replace_dotted_key_with_aot_keeps_following_sibling"
] | 2026-07-14 | 2026-07-14 | MIT | LICENSE | 67d3e86502706df2a9ed67114ab67e25bcdcbbb7 | e23a25438c6cc9b8cc28b6dcf76dc52f9c7a33e3 | https://github.com/python-poetry/tomlkit/commit/67d3e86502706df2a9ed67114ab67e25bcdcbbb7 | https://github.com/python-poetry/tomlkit | tomlkit.container | [
"Container"
] | 12 | 1 | 94b4815e0fcd1bc9 | python-poetry/tomlkit@67d3e8650#tomlkit/container.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
python-poetry/tomlkit | fix: avoid duplicate table header when adding a key to an out-of-order table (#545) | file | commit | fix: avoid duplicate table header when adding a key to an out-of-order table (#545) | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | tests/test_toml_document.py | [
"tests/test_toml_document.py::test_set_value_on_out_of_order_table_with_empty_concrete_part"
] | 2026-07-14 | 2026-07-14 | MIT | LICENSE | e23a25438c6cc9b8cc28b6dcf76dc52f9c7a33e3 | 34e51e2d6d09af86970f266a4217cea839fdc347 | https://github.com/python-poetry/tomlkit/commit/e23a25438c6cc9b8cc28b6dcf76dc52f9c7a33e3 | https://github.com/python-poetry/tomlkit | tomlkit.container | [
"OutOfOrderTableProxy"
] | 13 | 1 | b25c97a8d5dc04c3 | python-poetry/tomlkit@e23a25438#tomlkit/container.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
mrexodia/ida-pro-mcp | IDASessionManager | Fix stale strings cache when switching binaries in idalib worker | function | docstring | Manages multiple IDA database sessions for idalib mode.
`_sessions` stores all known session metadata. `_active_session_id` tracks
the database currently opened in the idalib process. Callers select which
session a request applies to by passing its session_id explicitly. | class IDASessionManager:
"""Manages multiple IDA database sessions for idalib mode.
`_sessions` stores all known session metadata. `_active_session_id` tracks
the database currently opened in the idalib process. Callers select which
session a request applies to by passing its session_id explicitly.
... | class IDASessionManager:
"""Manages multiple IDA database sessions for idalib mode.
`_sessions` stores all known session metadata. `_active_session_id` tracks
the database currently opened in the idalib process. Callers select which
session a request applies to by passing its session_id explicitly.
... | tests/test_idalib_session_manager.py | [
"tests/test_idalib_session_manager.py::test_switching_binaries_invalidates_strings_cache"
] | 2026-07-13 | 2026-07-13 | MIT | LICENSE | e12fbb514bcc9a1a342cb1f36c67e185e6fc1a9c | 1be78d04119748066d5e73070302ad62916002ea | https://github.com/mrexodia/ida-pro-mcp/commit/e12fbb514bcc9a1a342cb1f36c67e185e6fc1a9c | https://github.com/mrexodia/ida-pro-mcp | ida_pro_mcp.idalib_session_manager | [
"IDASessionManager"
] | 20 | 1 | ddf515132003fcdd | mrexodia/ida-pro-mcp@e12fbb514#IDASessionManager | python | 2026-08-18 | goldset/0.1 | 1 | |
wshobson/agents | parse_frontmatter | fix(adapters): parse nested frontmatter mappings (#618) | function | docstring | Return (fields, body). Tolerant YAML-ish parser; no external dep.
Supports:
- scalar fields (`name: foo`)
- inline lists (`tools: [a, b]`) and block lists (key: \n - a\n - b)
- YAML block scalar indicators `>` and `|` (folded/literal multi-line strings)
- 2-space continuation of scalar values | def parse_frontmatter(content: str) -> tuple[dict, str]:
"""Return (fields, body). Tolerant YAML-ish parser; no external dep.
Supports:
- scalar fields (`name: foo`)
- inline lists (`tools: [a, b]`) and block lists (key: \\n - a\\n - b)
- YAML block scalar indicators `>` and `|` (folded/literal m... | def parse_frontmatter(content: str) -> tuple[dict, str]:
"""Return (fields, body). Tolerant YAML-ish parser; no external dep.
Supports:
- scalar fields (`name: foo`)
- inline lists (`tools: [a, b]`) and block lists (key: \\n - a\\n - b)
- one-level mappings (`metadata: \\n version: 1.0.0`)
-... | tools/tests/test_adapters.py | [
"tools/tests/test_adapters.py::TestFrontmatterParser::test_nested_mapping"
] | 2026-07-11 | 2026-07-08 | MIT | LICENSE | 2de74ac1c8f6669821dcef13153332c3168033c1 | d7cf7dca8c4c7d0635e284f77204daa85552bfa4 | https://github.com/wshobson/agents/commit/2de74ac1c8f6669821dcef13153332c3168033c1 | https://github.com/wshobson/agents | tools.adapters.base | [
"parse_frontmatter"
] | 16 | 1 | 8fb47a9f168ce29d | wshobson/agents@2de74ac1c#parse_frontmatter | python | 2026-08-17 | goldset/0.1 | 1 | |
agentevals-dev/agentevals | _normalize_ts | fix(streaming): normalize timestamps across common units | function | docstring | Normalize a nanosecond timestamp (string or int) to seconds. | def _normalize_ts(raw_ts) -> float:
"""Normalize a nanosecond timestamp (string or int) to seconds."""
try:
ns = int(raw_ts)
except (TypeError, ValueError):
return 0.0
if ns > 1e15:
return ns / 1e9
return float(ns) | def _normalize_ts(raw_ts) -> float:
"""Normalize a contemporary Unix timestamp by inferring its unit from magnitude."""
try:
timestamp = int(raw_ts)
except (TypeError, ValueError):
return 0.0
if timestamp >= 1e17:
return timestamp / 1e9
if timestamp >= 1e14:
return ti... | tests/test_incremental_processor.py | [
"tests/test_incremental_processor.py::test_normalizes_timestamp_units[1770000000000-1770000000.0]"
] | 2026-07-11 | 2026-07-10 | Apache-2.0 | LICENSE | 363b28b280b8b66595f8a1003e7d43c44f0ccde1 | 221febbe05927923242a5edc12e68a2b70fd5ae9 | https://github.com/agentevals-dev/agentevals/commit/363b28b280b8b66595f8a1003e7d43c44f0ccde1 | https://github.com/agentevals-dev/agentevals | agentevals.streaming.incremental_processor | [
"_normalize_ts"
] | 14 | 1 | b89c87c58d4c3584 | agentevals-dev/agentevals@363b28b28#_normalize_ts | python | 2026-08-18 | goldset/0.1 | 1 | |
alecthomas/voluptuous | Number | Raise Invalid for Infinity/NaN input to Number validator (#542) | function | docstring | Verify the number of digits that are present in the number(Precision),
and the decimal places(Scale).
:raises Invalid: If the value does not match the provided Precision and Scale. | class Number(object):
"""
Verify the number of digits that are present in the number(Precision),
and the decimal places(Scale).
:raises Invalid: If the value does not match the provided Precision and Scale.
>>> schema = Schema(Number(precision=6, scale=2))
>>> schema('1234.01')
'1234.01'
... | class Number(object):
"""
Verify the number of digits that are present in the number(Precision),
and the decimal places(Scale).
:raises Invalid: If the value does not match the provided Precision and Scale.
>>> schema = Schema(Number(precision=6, scale=2))
>>> schema('1234.01')
'1234.01'
... | voluptuous/tests/tests.py | [
"voluptuous/tests/tests.py::test_number_validation_with_infinity_and_nan"
] | 2026-07-11 | 2026-07-06 | BSD-3-Clause | COPYING | 44593ce7c330faf9418252c4b5448f4736144a7f | 73237e9014f53da32fd6f90630976f5e8279b420 | https://github.com/alecthomas/voluptuous/commit/44593ce7c330faf9418252c4b5448f4736144a7f | https://github.com/alecthomas/voluptuous | voluptuous.validators | [
"Number"
] | 5 | 1 | 16d9fd6c8d3f73f1 | alecthomas/voluptuous@44593ce7c#Number | python | 2026-08-18 | goldset/0.1 | 1 | |
leeguooooo/claude-code-usage-bar | record_projection_snapshot | fix(predict): 旧高频快照一次性重抽稀——不然 300KB 文件要拖 8 小时才瘦身 | function | docstring | Append a (used, projected) snapshot for offline backtesting.
Throttled to one per window per SNAPSHOT_MIN_GAP_S: unthrottled, every
compute appended one (observed live: 0.4s average gap), so the 1000-entry
cap covered 8.5 MINUTES of history — useless for backtesting — while the
~150KB of snapshots were re-parsed and r... | def record_projection_snapshot(store: Dict[str, Any], window: str, observed_at: float,
used_pct: float, resets_at: float, projected_pct: float) -> Dict[str, Any]:
"""Append a (used, projected) snapshot for offline backtesting.
Throttled to one per window per SNAPSHOT_MIN_GAP_S: u... | def record_projection_snapshot(store: Dict[str, Any], window: str, observed_at: float,
used_pct: float, resets_at: float, projected_pct: float) -> Dict[str, Any]:
"""Append a (used, projected) snapshot for offline backtesting.
Throttled to one per window per SNAPSHOT_MIN_GAP_S: u... | tests/test_projection.py | [
"tests/test_projection.py::test_legacy_dense_snapshots_are_redecimated_on_append"
] | 2026-07-10 | 2026-07-10 | MIT | LICENSE | a704f1d289af18ab2107fb2ba92e0e9745b80f5a | 06a604980fab78a26e599b8564d8bf2c2887578d | https://github.com/leeguooooo/claude-code-usage-bar/commit/a704f1d289af18ab2107fb2ba92e0e9745b80f5a | https://github.com/leeguooooo/claude-code-usage-bar | claude_statusbar.predict | [
"record_projection_snapshot"
] | 20 | 1 | a884558cd831290b | leeguooooo/claude-code-usage-bar@a704f1d28#record_projection_snapshot | python | 2026-08-18 | goldset/0.1 | 1 | |
leeguooooo/claude-code-usage-bar | run_forever | fix: daemon 在慢渲染时崩溃 — time.sleep 收到负值 (v3.29.1) | function | docstring | Block in the render loop until SIGTERM/SIGINT.
`core.main()` already throttles its heavy claude-monitor subprocess
behind cache.py's age-based invalidation, so we don't need a separate
"heavy tick" — every render tick that triggers a refresh hits the
cache, only the periodic invalidation pays the heavy cost. | def run_forever(render_interval: float = DEFAULT_RENDER_INTERVAL) -> int:
"""Block in the render loop until SIGTERM/SIGINT.
`core.main()` already throttles its heavy claude-monitor subprocess
behind cache.py's age-based invalidation, so we don't need a separate
"heavy tick" — every render tick that tri... | def run_forever(render_interval: float = DEFAULT_RENDER_INTERVAL) -> int:
"""Block in the render loop until SIGTERM/SIGINT.
`core.main()` already throttles its heavy claude-monitor subprocess
behind cache.py's age-based invalidation, so we don't need a separate
"heavy tick" — every render tick that tri... | tests/test_daemon.py | [
"tests/test_daemon.py::test_clock_advancing_between_guard_and_sleep_does_not_crash"
] | 2026-07-09 | 2026-07-09 | MIT | LICENSE | 5ff94cbcb1ee50f12a851c38616e92fbb478d649 | a5cc56a3055a76cded62caead8ab364efe555e13 | https://github.com/leeguooooo/claude-code-usage-bar/commit/5ff94cbcb1ee50f12a851c38616e92fbb478d649 | https://github.com/leeguooooo/claude-code-usage-bar | claude_statusbar.daemon | [
"run_forever"
] | 9 | 1 | b70613abb10ce24b | leeguooooo/claude-code-usage-bar@5ff94cbcb#run_forever | python | 2026-08-18 | goldset/0.1 | 1 | |
allenai/vla-evaluation-harness | _extracted_arxiv_ids | leaderboard: add newly-reviewed paper results across four benchmarks, and fix a coverage under-count (#94) | function | docstring | All arxiv IDs with an extraction record (cache preferred, packed fallback). | def _extracted_arxiv_ids() -> set[str]:
"""All arxiv IDs with an extraction record (cache preferred, packed fallback)."""
if EXTRACTIONS_CACHE_DIR.exists():
return {p.stem for p in EXTRACTIONS_CACHE_DIR.glob("*.json")}
if EXTRACTIONS_PACKED_PATH.exists():
try:
return {rec["arxiv_... | def _extracted_arxiv_ids() -> set[str]:
"""All arxiv IDs with an extraction record — union of the packed file and the cache dir.
Either source alone under-counts: a clone that extracted a single paper has a
one-entry cache sitting next to the full packed file.
"""
ids: set[str] = set()
if EXTRA... | leaderboard/tests/test_scan_extracted_ids.py | [
"leaderboard/tests/test_scan_extracted_ids.py::test_sparse_cache_does_not_hide_packed"
] | 2026-07-09 | 2026-07-08 | Apache-2.0 | LICENSE | ac8b6943fd0575e2993496742c8ddc1aeac4bb0b | d8e4403f8821e08a583ac9cde99ca9c544949a90 | https://github.com/allenai/vla-evaluation-harness/commit/ac8b6943fd0575e2993496742c8ddc1aeac4bb0b | https://github.com/allenai/vla-evaluation-harness | leaderboard.scripts.scan | [
"_extracted_arxiv_ids"
] | 17 | 1 | 66834d3ac63d9748 | allenai/vla-evaluation-harness@ac8b6943f#_extracted_arxiv_ids | python | 2026-08-18 | goldset/0.1 | 1 | |
lark-parser/lark | Fix lexer_callbacks silently dropped for keyword terminals | file | commit | Fix lexer_callbacks silently dropped for keyword terminals | # Lexer Implementation
from abc import abstractmethod, ABC
import re
from typing import (
TypeVar, Type, Dict, Iterator, Collection, Callable, Optional, FrozenSet, Any,
ClassVar, TYPE_CHECKING, overload
)
from types import ModuleType
import warnings
try:
import interegular
except ImportError:
pass
if T... | # Lexer Implementation
from abc import abstractmethod, ABC
import re
from typing import (
TypeVar, Type, Dict, Iterator, Collection, Callable, Optional, FrozenSet, Any,
ClassVar, TYPE_CHECKING, overload
)
from types import ModuleType
import warnings
try:
import interegular
except ImportError:
pass
if T... | tests/test_grammar.py | [
"tests/test_grammar.py::TestGrammar::test_lexer_callbacks_with_keyword_terminals"
] | 2026-07-08 | 2026-06-04 | MIT | LICENSE | 46bbc82b3a5218e3a7593bd94f62a815c97be6e1 | c169b26a5bec9d47e590bf4be83691bcbdfe7b6b | https://github.com/lark-parser/lark/commit/46bbc82b3a5218e3a7593bd94f62a815c97be6e1 | https://github.com/lark-parser/lark | lark.lexer | [
"BasicLexer"
] | 9 | 1 | 7399096dd2eb277d | lark-parser/lark@46bbc82b3#lark/lexer.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
zhayujie/CowAgent | fuzzy_find_text | fix(edit): preserve file indentation when oldText is unindented | function | docstring | Find text in content, try exact match first, then fuzzy match
:param content: Content to search in
:param old_text: Text to find
:return: Match result | def fuzzy_find_text(content: str, old_text: str) -> FuzzyMatchResult:
"""
Find text in content, try exact match first, then fuzzy match
:param content: Content to search in
:param old_text: Text to find
:return: Match result
"""
# First try exact match
index = content.find(old_text)... | def fuzzy_find_text(content: str, old_text: str) -> FuzzyMatchResult:
"""
Find text in content, try exact match first, then fuzzy match
:param content: Content to search in
:param old_text: Text to find
:return: Match result
"""
# First try exact match
index = content.find(old_text)... | tests/test_edit_tool.py | [
"tests/test_edit_tool.py::TestEditFuzzyPreservesWhitespace::test_fuzzy_match_with_unindented_oldtext_preserves_file_indent"
] | 2026-07-07 | 2026-07-07 | MIT | LICENSE | 93162d2f1076df3c0d7d5a5d7f13d7780e89222c | a94f4e3c186fd94081c7a9432fe787db767d4568 | https://github.com/zhayujie/CowAgent/commit/93162d2f1076df3c0d7d5a5d7f13d7780e89222c | https://github.com/zhayujie/CowAgent | agent.tools.utils.diff | [
"fuzzy_find_text"
] | 23 | 1 | c85a1196cfc9b535 | zhayujie/CowAgent@93162d2f1#fuzzy_find_text | python | 2026-08-17 | goldset/0.1 | 1 | |
fabiocaccamo/python-fsutil | convert_size_bytes_to_string | Fix `IndexError` in `convert_size_bytes_to_string` for sizes >= 1024 YB. (#186) | function | docstring | Convert the given size bytes to string using the right unit suffix. | def convert_size_bytes_to_string(size: int) -> str:
"""
Convert the given size bytes to string using the right unit suffix.
"""
size_num = float(size)
units = SIZE_UNITS
factor = 0
factor_limit = len(units) - 1
while (size_num >= 1024) and (factor <= factor_limit):
size_num /= 10... | def convert_size_bytes_to_string(size: int) -> str:
"""
Convert the given size bytes to string using the right unit suffix.
"""
size_num = float(size)
units = SIZE_UNITS
factor = 0
factor_limit = len(units) - 1
while (size_num >= 1024) and (factor < factor_limit):
size_num /= 102... | tests/test_converters.py | [
"tests/test_converters.py::test_convert_size_bytes_to_string[1237940039285380274899124224-1024.00"
] | 2026-07-07 | 2026-05-11 | MIT | LICENSE.txt | 4abb5aaebe575b0277f5b96a079afdabe169992d | c98dbf6bc7c0c7686631c7d3d34b0436ed6c62f0 | https://github.com/fabiocaccamo/python-fsutil/commit/4abb5aaebe575b0277f5b96a079afdabe169992d | https://github.com/fabiocaccamo/python-fsutil | fsutil.converters | [
"convert_size_bytes_to_string"
] | 2 | 1 | 506fafc76c61ab6f | fabiocaccamo/python-fsutil@4abb5aaeb#convert_size_bytes_to_string | python | 2026-08-18 | goldset/0.1 | 1 | |
regebro/svg.path | fix fractions cache on remeasure (#116) | file | commit | fix fractions cache on remeasure (#116) | from __future__ import annotations
from math import sqrt, cos, sin, acos, degrees, radians, log, pi
from typing import overload, Iterable, List, Tuple, Union, TYPE_CHECKING
from bisect import bisect
from abc import ABC, abstractmethod
import math
from collections.abc import MutableSequence
# This file contains classe... | from __future__ import annotations
from math import sqrt, cos, sin, acos, degrees, radians, log, pi
from typing import overload, Iterable, List, Tuple, Union, TYPE_CHECKING
from bisect import bisect
from abc import ABC, abstractmethod
import math
from collections.abc import MutableSequence
# This file contains classe... | tests/test_paths.py | [
"tests/test_paths.py::PathTest::test_measure_then_mutate_then_measure"
] | 2026-07-07 | 2026-07-07 | MIT | LICENSE.txt | b91b3328ee42dbcd260618841cb9c21ca6961717 | 83d36b611b22c6a569457d0b10614bf958fded5d | https://github.com/regebro/svg.path/commit/b91b3328ee42dbcd260618841cb9c21ca6961717 | https://github.com/regebro/svg.path | svg.path.path | [
"Path"
] | 6 | 1 | 733fcb73c1605b1d | regebro/svg.path@b91b3328e#src/svg/path/path.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
jawah/charset_normalizer | fix: unicodedecodeerror in fallback path | file | commit | fix: unicodedecodeerror in fallback path | from __future__ import annotations
import logging
from functools import lru_cache
from os import PathLike
from typing import BinaryIO
from .cd import (
coherence_ratio,
encoding_languages,
mb_encoding_languages,
merge_coherence_ratios,
)
from .constant import (
IANA_SUPPORTED,
IANA_SUPPORTED_S... | from __future__ import annotations
import logging
from functools import lru_cache
from os import PathLike
from typing import BinaryIO
from .cd import (
coherence_ratio,
encoding_languages,
mb_encoding_languages,
merge_coherence_ratios,
)
from .constant import (
IANA_SUPPORTED,
IANA_SUPPORTED_S... | tests/test_edge_case.py | [
"tests/test_edge_case.py::test_regression_gh771_fallback_entry_on_undecodable_payload"
] | 2026-07-07 | 2026-07-06 | MIT | LICENSE | 2bc26076a86704fc19bc2ae811615b169373dea6 | be252d70c9f45846f0e851cc4d1829328540c825 | https://github.com/jawah/charset_normalizer/commit/2bc26076a86704fc19bc2ae811615b169373dea6 | https://github.com/jawah/charset_normalizer | charset_normalizer.api | [
"from_bytes"
] | 25 | 1 | 9ac39af9810a0a81 | jawah/charset_normalizer@2bc26076a#src/charset_normalizer/api.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
alecthomas/voluptuous | Number | Raise Invalid for non-numeric input to Number validator (#539) | function | docstring | Verify the number of digits that are present in the number(Precision),
and the decimal places(Scale).
:raises Invalid: If the value does not match the provided Precision and Scale. | class Number(object):
"""
Verify the number of digits that are present in the number(Precision),
and the decimal places(Scale).
:raises Invalid: If the value does not match the provided Precision and Scale.
>>> schema = Schema(Number(precision=6, scale=2))
>>> schema('1234.01')
'1234.01'
... | class Number(object):
"""
Verify the number of digits that are present in the number(Precision),
and the decimal places(Scale).
:raises Invalid: If the value does not match the provided Precision and Scale.
>>> schema = Schema(Number(precision=6, scale=2))
>>> schema('1234.01')
'1234.01'
... | voluptuous/tests/tests.py | [
"voluptuous/tests/tests.py::test_number_validation_with_non_numeric"
] | 2026-07-04 | 2026-07-04 | BSD-3-Clause | COPYING | 9dd222db18189ea11c07615c16dc54bba6cb2aed | d20c6c8bc7f49f94668e38289655cabb33ff2602 | https://github.com/alecthomas/voluptuous/commit/9dd222db18189ea11c07615c16dc54bba6cb2aed | https://github.com/alecthomas/voluptuous | voluptuous.validators | [
"Number"
] | 2 | 1 | 7df551b2eb368cbd | alecthomas/voluptuous@9dd222db1#Number | python | 2026-08-18 | goldset/0.1 | 1 | |
more-itertools/more-itertools | sliced | Raise for negative slice sizes in sliced() | function | docstring | Yield slices of length *n* from the sequence *seq*.
By the default, the last yielded slice will have fewer than *n* elements
if the length of *seq* is not divisible by *n*:
If the length of *seq* is not divisible by *n* and *strict* is
`True`, then `ValueError` will be raised before the last
slice is yielded.
This f... | def sliced(seq, n, strict=False):
"""Yield slices of length *n* from the sequence *seq*.
>>> list(sliced((1, 2, 3, 4, 5, 6), 3))
[(1, 2, 3), (4, 5, 6)]
By the default, the last yielded slice will have fewer than *n* elements
if the length of *seq* is not divisible by *n*:
>>> list(sliced((1, ... | def sliced(seq, n, strict=False):
"""Yield slices of length *n* from the sequence *seq*.
>>> list(sliced((1, 2, 3, 4, 5, 6), 3))
[(1, 2, 3), (4, 5, 6)]
By the default, the last yielded slice will have fewer than *n* elements
if the length of *seq* is not divisible by *n*:
>>> list(sliced((1, ... | tests/test_more.py | [
"tests/test_more.py::SlicedTests::test_negative"
] | 2026-07-03 | 2026-07-01 | MIT | LICENSE | 958990e22c4ab6daf434d89cf2b86d7a4a7a9e3c | ed86a1528aa015f219f8d3385ea2ebd3f63a5212 | https://github.com/more-itertools/more-itertools/commit/958990e22c4ab6daf434d89cf2b86d7a4a7a9e3c | https://github.com/more-itertools/more-itertools | more_itertools.more | [
"sliced"
] | 3 | 1 | 401401565252e6dd | more-itertools/more-itertools@958990e22#sliced | python | 2026-08-17 | goldset/0.1 | 1 | |
leeguooooo/claude-code-usage-bar | verdict | fix(ip_score): ban-risk 阈值 67→70,与 crit band 对齐 | function | docstring | Claude-account decision. Region first (the documented trigger), then
anonymizer egress, then plain datacenter (a softer caution). | def verdict(risk: int, typ: str, country: Optional[str]) -> Dict[str, Any]:
"""Claude-account decision. Region first (the documented trigger), then
anonymizer egress, then plain datacenter (a softer caution)."""
cc = (country or "").upper()
ip_is_ban = risk >= 67 or typ in _BAN_TYPES
if cc in _SANC... | def verdict(risk: int, typ: str, country: Optional[str]) -> Dict[str, Any]:
"""Claude-account decision. Region first (the documented trigger), then
anonymizer egress, then plain datacenter (a softer caution)."""
cc = (country or "").upper()
# 70 = the classify() crit-band cutoff. Was 67, which disagreed... | tests/test_ip_score.py | [
"tests/test_ip_score.py::test_ban_threshold_aligns_with_crit_band"
] | 2026-07-03 | 2026-07-03 | MIT | LICENSE | a2a87b82e28f2027f036594dc9dc19d65a2c3308 | 6393539b416a55a83ea9fee5218d8d2d35b563f9 | https://github.com/leeguooooo/claude-code-usage-bar/commit/a2a87b82e28f2027f036594dc9dc19d65a2c3308 | https://github.com/leeguooooo/claude-code-usage-bar | claude_statusbar.ip_score | [
"verdict"
] | 5 | 1 | a03bdbffedb1a7b7 | leeguooooo/claude-code-usage-bar@a2a87b82e#verdict | python | 2026-08-18 | goldset/0.1 | 1 | |
Ar9av/obsidian-wiki | needs_extraction | fix(extract): check missing output before the --since gate | function | docstring | Return True if the source JSONL should be (re)extracted.
Idempotent staleness check keyed on the output file: (re)extract when the
output is missing or the source is newer than it, so the extractor does not
depend on the caller passing the right --since. --since only narrows the
scan range; it never suppresses extrac... | def needs_extraction(
source_path: str,
out_path: str,
since_ts: float | None,
) -> bool:
"""Return True if the source JSONL should be (re)extracted.
Idempotent staleness check keyed on the output file: (re)extract when the
output is missing or the source is newer than it, so the extractor does... | def needs_extraction(
source_path: str,
out_path: str,
since_ts: float | None,
) -> bool:
"""Return True if the source JSONL should be (re)extracted.
Idempotent staleness check keyed on the output file: (re)extract when the
output is missing or the source is newer than it, so the extractor does... | tests/test_extract_staleness.py | [
"tests/test_extract_staleness.py::ExtractStalenessTest::test_missing_output_reextracted_despite_since_gate"
] | 2026-07-03 | 2026-07-03 | MIT | LICENSE | 69ff8cc36a0ed43a703c642beec2dcaeec7f0efa | 754d91746763caaa232163c7a046baa225e596f9 | https://github.com/Ar9av/obsidian-wiki/commit/69ff8cc36a0ed43a703c642beec2dcaeec7f0efa | https://github.com/Ar9av/obsidian-wiki | scripts.extract-jsonl | [
"needs_extraction"
] | 8 | 1 | 5148f5c618ae2b5a | Ar9av/obsidian-wiki@69ff8cc36#needs_extraction | python | 2026-08-18 | goldset/0.1 | 1 | |
redis/redis-py | _HiredisParser | fix(hiredis): raise ConnectionError instead of AttributeError on concurrent disconnect (#4136) | function | docstring | Parser class for connections using Hiredis | class _HiredisParser(BaseParser, PushNotificationsParser):
"Parser class for connections using Hiredis"
def __init__(self, socket_read_size):
if not HIREDIS_AVAILABLE:
raise RedisError("Hiredis is not installed")
self.socket_read_size = socket_read_size
self._buffer = bytear... | class _HiredisParser(BaseParser, PushNotificationsParser):
"Parser class for connections using Hiredis"
def __init__(self, socket_read_size):
if not HIREDIS_AVAILABLE:
raise RedisError("Hiredis is not installed")
self.socket_read_size = socket_read_size
self._buffer = bytear... | tests/test_connection.py | [
"tests/test_connection.py::test_hiredis_read_from_socket_raises_connection_error_when_disconnected[_reader]",
"tests/test_connection.py::test_hiredis_read_from_socket_raises_connection_error_when_disconnected[_sock]",
"tests/test_connection.py::test_hiredis_read_response_uses_local_reader_if_disconnected_mid_re... | 2026-07-03 | 2026-07-02 | MIT | LICENSE | ef83cd8aac814481f18e30921736a7222daa6b7d | bc0c81baf44c9d58b25031d47c2e6156be88e087 | https://github.com/redis/redis-py/commit/ef83cd8aac814481f18e30921736a7222daa6b7d | https://github.com/redis/redis-py | redis._parsers.hiredis | [
"_HiredisParser"
] | 25 | 3 | bbd9e70d0330b778 | redis/redis-py@ef83cd8aa#_HiredisParser | python | 2026-08-18 | goldset/0.1 | 1 | |
leeguooooo/claude-code-usage-bar | line_text | fix(ip_risk): 警示文案点名登录动作+明确后果 | function | docstring | Full warning line, or "" when the IP is clean enough (≤ SHOW_THRESHOLD).
English by design (user request) and explicit about the consequence:
a dirty egress IP is an account-ban risk. | def line_text(entry: Dict[str, Any]) -> str:
"""Full warning line, or "" when the IP is clean enough (≤ SHOW_THRESHOLD).
English by design (user request) and explicit about the consequence:
a dirty egress IP is an account-ban risk.
"""
try:
risk = int(entry.get("risk", 0))
except (TypeE... | def line_text(entry: Dict[str, Any]) -> str:
"""Full warning line, or "" when the IP is clean enough (≤ SHOW_THRESHOLD).
English by design (user request) and explicit about the consequence:
a dirty egress IP is an account-ban risk.
"""
try:
risk = int(entry.get("risk", 0))
except (TypeE... | tests/test_ip_risk.py | [
"tests/test_ip_risk.py::test_line_warn_and_crit_wording"
] | 2026-07-02 | 2026-07-02 | MIT | LICENSE | 9ec1602b5d1e1284a532faebdf092bae29004037 | cb73d57343a9a5801701c18bb2d418667cdfcc5e | https://github.com/leeguooooo/claude-code-usage-bar/commit/9ec1602b5d1e1284a532faebdf092bae29004037 | https://github.com/leeguooooo/claude-code-usage-bar | claude_statusbar.ip_risk | [
"line_text"
] | 9 | 1 | 6d057287b8efa2a0 | leeguooooo/claude-code-usage-bar@9ec1602b5#line_text | python | 2026-08-18 | goldset/0.1 | 1 | |
terryyin/lizard | HalsteadClassifier | fix(halstead): classify leading-dot float literals as operands in C-family code | function | docstring | Classify tokens into Halstead operators and operands.
This is the per-language extension point. The base class implements the
generic rules that work for the operators and punctuation shared by
lizard's common tokenizer, plus a broad set of C-family keywords. Subclass
it and override :attr:`keyword_operators` / :att... | class HalsteadClassifier(object): # pylint: disable=too-few-public-methods
"""Classify tokens into Halstead operators and operands.
This is the per-language extension point. The base class implements the
generic rules that work for the operators and punctuation shared by
lizard's common tokenizer, pl... | class HalsteadClassifier(object): # pylint: disable=too-few-public-methods
"""Classify tokens into Halstead operators and operands.
This is the per-language extension point. The base class implements the
generic rules that work for the operators and punctuation shared by
lizard's common tokenizer, pl... | test/testHalstead.py | [
"test/testHalstead.py::TestHalsteadClassifierUnit::test_leading_dot_float_is_operand"
] | 2026-07-02 | 2026-06-30 | MIT | LICENSE.txt | 4ba7373a2d7043b1a2b2e05a479ad746abe93994 | 12ae6f853b5d0bba08ec4d29463a4ed3dd008d43 | https://github.com/terryyin/lizard/commit/4ba7373a2d7043b1a2b2e05a479ad746abe93994 | https://github.com/terryyin/lizard | lizard_ext.lizardhalstead | [
"HalsteadClassifier"
] | 3 | 1 | d26a5ef16e7a066c | terryyin/lizard@4ba7373a2#HalsteadClassifier | python | 2026-08-18 | goldset/0.1 | 1 | |
jmcnamara/XlsxWriter | image: fix signedness issue with large gifs | file | commit | image: fix signedness issue with large gifs | ###############################################################################
#
# Image - A class for representing image objects in Excel.
#
# SPDX-License-Identifier: BSD-2-Clause
#
# Copyright (c) 2013-2025, John McNamara, jmcnamara@cpan.org
#
import hashlib
import os
from io import BytesIO
from pathlib import Pat... | ###############################################################################
#
# Image - A class for representing image objects in Excel.
#
# SPDX-License-Identifier: BSD-2-Clause
#
# Copyright (c) 2013-2025, John McNamara, jmcnamara@cpan.org
#
import hashlib
import os
from io import BytesIO
from pathlib import Pat... | xlsxwriter/test/image/test_image_class01.py | [
"xlsxwriter/test/image/test_image_class01.py::TestImageProperties::test_image_properties06"
] | 2026-07-02 | 2026-07-02 | BSD-2-Clause | LICENSE.txt | 22302b3d22196afa78b88b6fe71721db5b79299b | 630854d956b691ad7a2f082bf22c66db72cb21b8 | https://github.com/jmcnamara/XlsxWriter/commit/22302b3d22196afa78b88b6fe71721db5b79299b | https://github.com/jmcnamara/XlsxWriter | xlsxwriter.image | [
"Image"
] | 4 | 1 | 4a350bbefcf0ed86 | jmcnamara/XlsxWriter@22302b3d2#xlsxwriter/image.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
jmcnamara/XlsxWriter | image: fix issue with top-down DIB bmp | file | commit | image: fix issue with top-down DIB bmp | ###############################################################################
#
# Image - A class for representing image objects in Excel.
#
# SPDX-License-Identifier: BSD-2-Clause
#
# Copyright (c) 2013-2025, John McNamara, jmcnamara@cpan.org
#
import hashlib
import os
from io import BytesIO
from pathlib import Pat... | ###############################################################################
#
# Image - A class for representing image objects in Excel.
#
# SPDX-License-Identifier: BSD-2-Clause
#
# Copyright (c) 2013-2025, John McNamara, jmcnamara@cpan.org
#
import hashlib
import os
from io import BytesIO
from pathlib import Pat... | xlsxwriter/test/comparison/test_image59.py | [
"xlsxwriter/test/comparison/test_image59.py::TestCompareXLSXFiles::test_create_file"
] | 2026-07-02 | 2026-05-19 | BSD-2-Clause | LICENSE.txt | 630854d956b691ad7a2f082bf22c66db72cb21b8 | 6f9d43568435cbc6e4e962dd12cb204dfe1f8e4a | https://github.com/jmcnamara/XlsxWriter/commit/630854d956b691ad7a2f082bf22c66db72cb21b8 | https://github.com/jmcnamara/XlsxWriter | xlsxwriter.image | [
"Image"
] | 7 | 1 | e4b86ecf37ea1701 | jmcnamara/XlsxWriter@630854d95#xlsxwriter/image.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
terryyin/lizard | fix(csv): emit columns for extensions with multiple FUNCTION_INFO fields | file | commit | fix(csv): emit columns for extensions with multiple FUNCTION_INFO fields | """
This module extends the default output formatting to include CSV.
The output is intended to be the same in structure, with additional
tokens (to reduce the need to post-process), and a reduced verbosity
due to the nature of CSV outputs. The differences are:
* No summary of the included files, only the output
... | """
This module extends the default output formatting to include CSV.
The output is intended to be the same in structure, with additional
tokens (to reduce the need to post-process), and a reduced verbosity
due to the nature of CSV outputs. The differences are:
* No summary of the included files, only the output
... | test/testOutputCSV.py | [
"test/testOutputCSV.py::TestCSVOutput::test_csv_header_with_multi_field_extension",
"test/testOutputCSV.py::TestCSVOutput::test_csv_row_with_multi_field_extension"
] | 2026-07-02 | 2026-06-15 | MIT | LICENSE.txt | 2640089e8bc31afaf0acf96ab3e918357b2a71f2 | 0b97a9ae8e77b8d559e7ef187ad4b4e3ef02924f | https://github.com/terryyin/lizard/commit/2640089e8bc31afaf0acf96ab3e918357b2a71f2 | https://github.com/terryyin/lizard | lizard_ext.csvoutput | [
"csv_output"
] | 7 | 2 | a411e0bf297cd5f9 | terryyin/lizard@2640089e8#lizard_ext/csvoutput.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
more-itertools/more-itertools | tail | Raise for negative tail sizes on sized iterables | function | docstring | Return an iterator over the last *n* items of *iterable*. | def tail(n, iterable):
"""Return an iterator over the last *n* items of *iterable*.
>>> t = tail(3, 'ABCDEFG')
>>> list(t)
['E', 'F', 'G']
"""
try:
size = len(iterable)
except TypeError:
return iter(deque(iterable, maxlen=n))
else:
return islice(iterable, max(0,... | def tail(n, iterable):
"""Return an iterator over the last *n* items of *iterable*.
>>> t = tail(3, 'ABCDEFG')
>>> list(t)
['E', 'F', 'G']
"""
if n < 0:
raise ValueError('n must be at least 0')
try:
size = len(iterable)
except TypeError:
return iter(deque(itera... | tests/test_recipes.py | [
"tests/test_recipes.py::TailTests::test_sized_negative"
] | 2026-06-30 | 2026-06-20 | MIT | LICENSE | d64a7d6971bfd31c5719d02f0001e58de85683d1 | 5d946b3590bfe92f1465c1b9b9830dd434745c84 | https://github.com/more-itertools/more-itertools/commit/d64a7d6971bfd31c5719d02f0001e58de85683d1 | https://github.com/more-itertools/more-itertools | more_itertools.recipes | [
"tail"
] | 3 | 1 | b0c3bc65d0766c4c | more-itertools/more-itertools@d64a7d697#tail | python | 2026-08-17 | goldset/0.1 | 1 | |
more-itertools/more-itertools | interleave_evenly | fix: handle empty interleave_evenly input | function | docstring | Interleave multiple iterables so that their elements are evenly distributed
throughout the output sequence.
This function requires iterables of known length. Iterables without
`__len__()` can be used by manually specifying lengths with *lengths*:
Based on Bresenham's algorithm. | def interleave_evenly(iterables, lengths=None):
"""
Interleave multiple iterables so that their elements are evenly distributed
throughout the output sequence.
>>> iterables = [1, 2, 3, 4, 5], ['a', 'b']
>>> list(interleave_evenly(iterables))
[1, 2, 'a', 3, 4, 'b', 5]
>>> iterables = [[1, ... | def interleave_evenly(iterables, lengths=None):
"""
Interleave multiple iterables so that their elements are evenly distributed
throughout the output sequence.
>>> iterables = [1, 2, 3, 4, 5], ['a', 'b']
>>> list(interleave_evenly(iterables))
[1, 2, 'a', 3, 4, 'b', 5]
>>> iterables = [[1, ... | tests/test_more.py | [
"tests/test_more.py::InterleaveEvenlyTests::test_no_iterables"
] | 2026-06-30 | 2026-06-20 | MIT | LICENSE | f51a53bfd2fe9504063a33ef5f4a73e30d82d0e2 | 5d946b3590bfe92f1465c1b9b9830dd434745c84 | https://github.com/more-itertools/more-itertools/commit/f51a53bfd2fe9504063a33ef5f4a73e30d82d0e2 | https://github.com/more-itertools/more-itertools | more_itertools.more | [
"interleave_evenly"
] | 3 | 1 | 0c9a1108bde9639f | more-itertools/more-itertools@f51a53bfd#interleave_evenly | python | 2026-08-17 | goldset/0.1 | 1 | |
miketheman/pytest-socket | fix: make SocketConnectBlockedError pickleable (#501) | file | commit | fix: make SocketConnectBlockedError pickleable (#501) | from __future__ import annotations
import ipaddress
import itertools
import socket
import warnings
from collections import defaultdict
from collections.abc import Iterator
from dataclasses import dataclass, field
from typing import Any
import pytest
_true_socket = socket.socket
_true_connect = socket.socket.connect
... | from __future__ import annotations
import ipaddress
import itertools
import socket
import warnings
from collections import defaultdict
from collections.abc import Iterator
from dataclasses import dataclass, field
from typing import Any
import pytest
_true_socket = socket.socket
_true_connect = socket.socket.connect
... | tests/test_socket.py | [
"tests/test_socket.py::test_exceptions_are_pickleable[exc1]"
] | 2026-06-30 | 2026-06-30 | MIT | LICENSE | 2bf8608adfc79f0e4ba1e44b42164cd658aa877a | 7bfe8f973e565088a97e5c538dfcac70d0c85d61 | https://github.com/miketheman/pytest-socket/commit/2bf8608adfc79f0e4ba1e44b42164cd658aa877a | https://github.com/miketheman/pytest-socket | pytest_socket.__init__ | [
"SocketConnectBlockedError"
] | 9 | 1 | 5e3eadf0ec31ca97 | miketheman/pytest-socket@2bf8608ad#src/pytest_socket/__init__.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
dynaconf/dynaconf | _parse_conf_data | fix: don't treat a string sharing a converter prefix as a cast (#1412) | function | docstring | @int @bool @float @json (for lists and dicts)
strings does not need converters
export DYNACONF_DEFAULT_THEME='material'
export DYNACONF_DEBUG='@bool True'
export DYNACONF_DEBUG_TOOLBAR_ENABLED='@bool False'
export DYNACONF_PAGINATION_PER_PAGE='@int 20'
export DYNACONF_MONGODB_SETTINGS='@json {"DB": "quokka_db"}'
expor... | def _parse_conf_data(data, tomlfy=False, box_settings=None):
"""
@int @bool @float @json (for lists and dicts)
strings does not need converters
export DYNACONF_DEFAULT_THEME='material'
export DYNACONF_DEBUG='@bool True'
export DYNACONF_DEBUG_TOOLBAR_ENABLED='@bool False'
export DYNACONF_PAG... | def _parse_conf_data(data, tomlfy=False, box_settings=None):
"""
@int @bool @float @json (for lists and dicts)
strings does not need converters
export DYNACONF_DEFAULT_THEME='material'
export DYNACONF_DEBUG='@bool True'
export DYNACONF_DEBUG_TOOLBAR_ENABLED='@bool False'
export DYNACONF_PAG... | tests/test_utils.py | [
"tests/test_utils.py::test_string_starting_with_converter_prefix_is_not_cast"
] | 2026-06-29 | 2026-06-28 | MIT | LICENSE | 5c50a9a644080c2b2775c283ee6e4703a06e01ec | 93e49da9e08ffd250d93b0a55bf543d21fb3a15a | https://github.com/dynaconf/dynaconf/commit/5c50a9a644080c2b2775c283ee6e4703a06e01ec | https://github.com/dynaconf/dynaconf | dynaconf.utils.parse_conf | [
"_parse_conf_data"
] | 2 | 1 | 3bc3707607b91ae9 | dynaconf/dynaconf@5c50a9a64#_parse_conf_data | python | 2026-08-18 | goldset/0.1 | 1 | |
adafruit/Adafruit_Blinka | Fix generic Linux SPI write_readinto slice | file | commit | Fix generic Linux SPI write_readinto slice | # SPDX-FileCopyrightText: 2021 Melissa LeBlanc-Williams for Adafruit Industries
#
# SPDX-License-Identifier: MIT
"""Generic Linux SPI class using PureIO's SPI class"""
from Adafruit_PureIO import spi
from adafruit_blinka.agnostic import detector
class SPI:
"""SPI Class"""
MSB = 0
LSB = 1
CPHA = 1
... | # SPDX-FileCopyrightText: 2021 Melissa LeBlanc-Williams for Adafruit Industries
#
# SPDX-License-Identifier: MIT
"""Generic Linux SPI class using PureIO's SPI class"""
from Adafruit_PureIO import spi
from adafruit_blinka.agnostic import detector
class SPI:
"""SPI Class"""
MSB = 0
LSB = 1
CPHA = 1
... | tests/test_generic_linux_spi.py | [
"tests/test_generic_linux_spi.py::test_write_readinto_uses_exclusive_out_end"
] | 2026-06-29 | 2026-06-24 | MIT | LICENSE | 33f4566372d7990def2fdbba7c3844f3be657614 | ddc4686408315e735feb850ce875e33ad68e118b | https://github.com/adafruit/Adafruit_Blinka/commit/33f4566372d7990def2fdbba7c3844f3be657614 | https://github.com/adafruit/Adafruit_Blinka | adafruit_blinka.microcontroller.generic_linux.spi | [
"SPI"
] | 6 | 1 | d57a9b84b7e0e0a5 | adafruit/Adafruit_Blinka@33f456637#src/adafruit_blinka/microcontroller/generic_linux/spi.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
dynaconf/dynaconf | validate | fix: Fixed 'dynaconf validate' edge cases with validation_file.toml (#1411) | function | docstring | Validates Dynaconf settings based on provided rules.
Rules should be defined in dynaconf_validators.toml | def validate(path): # pragma: no cover
"""
Validates Dynaconf settings based on provided rules.
Rules should be defined in dynaconf_validators.toml
"""
# reads the 'dynaconf_validators.toml' from path
# for each section register the validator for specific env
# call validate
path = Pat... | def validate(path): # pragma: no cover
"""
Validates Dynaconf settings based on provided rules.
Rules should be defined in dynaconf_validators.toml
"""
# reads the 'dynaconf_validators.toml' from path
# for each section register the validator for specific env
# call validate
path = Pat... | tests/test_cli.py | [
"tests/test_cli.py::TestValidate::test_issue_1368[environments-enabled]"
] | 2026-06-28 | 2026-06-27 | MIT | LICENSE | 93e49da9e08ffd250d93b0a55bf543d21fb3a15a | b4cd869df40481dcbadc0590cb77d2ee03fe0087 | https://github.com/dynaconf/dynaconf/commit/93e49da9e08ffd250d93b0a55bf543d21fb3a15a | https://github.com/dynaconf/dynaconf | dynaconf.cli | [
"validate"
] | 4 | 1 | 85c0d120dd774a21 | dynaconf/dynaconf@93e49da9e#validate | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | handle_metavalues | fix: avoid crash merging a dynaconf_merge list into a missing key (#1410) | function | docstring | Cleanup of MetaValues on new dict
:param old: old values
:param new: new values
:param list_merge: Methods to use to merge lists
- merge: default merge behavior, i.e. (unique) concatenation
- shallow: replace the top-most level list of the nested structure
- deep: iteratively traverse the nested structure a... | def handle_metavalues(
old: DataDict | dict[str, int] | dict[str, str | int],
new: Any,
list_merge: ListMergeOptions = "merge",
) -> None:
"""
Cleanup of MetaValues on new dict
:param old: old values
:param new: new values
:param list_merge: Methods to use to merge lists
- merge:... | def handle_metavalues(
old: DataDict | dict[str, int] | dict[str, str | int],
new: Any,
list_merge: ListMergeOptions = "merge",
) -> None:
"""
Cleanup of MetaValues on new dict
:param old: old values
:param new: new values
:param list_merge: Methods to use to merge lists
- merge:... | tests/test_utils.py | [
"tests/test_utils.py::test_merge_list_token_when_key_absent_in_old"
] | 2026-06-27 | 2026-06-26 | MIT | LICENSE | e954809102546d5f389b35358c64f953a006dd2c | cea5adf4b52556c216a275a3e1372aa052801329 | https://github.com/dynaconf/dynaconf/commit/e954809102546d5f389b35358c64f953a006dd2c | https://github.com/dynaconf/dynaconf | dynaconf.utils.__init__ | [
"handle_metavalues"
] | 2 | 1 | 347f404b7e687576 | dynaconf/dynaconf@e95480910#handle_metavalues | python | 2026-08-18 | goldset/0.1 | 1 | |
dynaconf/dynaconf | object_merge | fix: preserve nested dict key order when object_merge merges old into new | function | docstring | Recursively merge two data structures, new is mutated in-place.
:param old: The existing data.
:param new: The new data to get old values merged in to.
:param unique: When set to True existing list items are not set.
:param full_path: Indicates the elements of a tree.
:param list_merge: Methods to use to merge lists
... | def object_merge(
old: Any,
new: Any,
unique: bool = False,
full_path: Optional[list[str]] = None,
list_merge: ListMergeOptions = "merge",
) -> Any:
"""
Recursively merge two data structures, new is mutated in-place.
:param old: The existing data.
:param new: The new data to get old... | def object_merge(
old: Any,
new: Any,
unique: bool = False,
full_path: Optional[list[str]] = None,
list_merge: ListMergeOptions = "merge",
) -> Any:
"""
Recursively merge two data structures, new is mutated in-place.
:param old: The existing data.
:param new: The new data to get old... | tests/test_utils.py | [
"tests/test_utils.py::test_merge_dict_preserves_old_key_order"
] | 2026-06-25 | 2026-06-24 | MIT | LICENSE | 6e76252f8c85142f02a9a002a5f6f2ffed333262 | 332d1f88c989b6067cbbe5b1c5706ec2eeedc35f | https://github.com/dynaconf/dynaconf/commit/6e76252f8c85142f02a9a002a5f6f2ffed333262 | https://github.com/dynaconf/dynaconf | dynaconf.utils.__init__ | [
"object_merge"
] | 10 | 1 | b54e6516dd4ea820 | dynaconf/dynaconf@6e76252f8#object_merge | python | 2026-08-18 | goldset/0.1 | 1 | |
lark-parser/lark | Transformer_NonRecursive | Fix Transformer_NonRecursive crashing with ValueError when root is discarded | function | docstring | Same as Transformer but non-recursive.
Like Transformer, it doesn't change the original tree.
Useful for huge trees. | class Transformer_NonRecursive(Transformer[_Leaf_T, _Return_T]):
"""Same as Transformer but non-recursive.
Like Transformer, it doesn't change the original tree.
Useful for huge trees.
"""
def transform(self, tree: Tree[_Leaf_T]) -> _Return_T:
# Tree to postfix
rev_postfix = []
... | class Transformer_NonRecursive(Transformer[_Leaf_T, _Return_T]):
"""Same as Transformer but non-recursive.
Like Transformer, it doesn't change the original tree.
Useful for huge trees.
"""
def transform(self, tree: Tree[_Leaf_T]) -> _Return_T:
# Tree to postfix
rev_postfix = []
... | tests/test_trees.py | [
"tests/test_trees.py::TestTrees::test_transformer_discard_root"
] | 2026-06-24 | 2026-06-04 | MIT | LICENSE | 42057206b7eb761d68e275f13761049a82155f3d | c169b26a5bec9d47e590bf4be83691bcbdfe7b6b | https://github.com/lark-parser/lark/commit/42057206b7eb761d68e275f13761049a82155f3d | https://github.com/lark-parser/lark | lark.visitors | [
"Transformer_NonRecursive"
] | 2 | 1 | 913badfe235034f6 | lark-parser/lark@42057206b#Transformer_NonRecursive | python | 2026-08-18 | goldset/0.1 | 1 | |
he-yufeng/FindJobs-Agent | supports_temperature | fix(llm_utils): treat o1/o3/o4 reasoning models as not supporting temperature | function | docstring | Return True if the model accepts the temperature parameter. | def supports_temperature(model: Optional[str]) -> bool:
"""Return True if the model accepts the temperature parameter."""
return _normalize_model_name(model) not in TEMPERATURE_UNSUPPORTED_MODELS | def supports_temperature(model: Optional[str]) -> bool:
"""Return True if the model accepts the temperature parameter."""
name = _normalize_model_name(model)
if name in TEMPERATURE_UNSUPPORTED_MODELS:
return False
# Drop a vendor prefix like "openai/o1-mini" before checking the family.
bare ... | tests/test_llm_utils.py | [
"tests/test_llm_utils.py::test_reasoning_models_do_not_support_temperature"
] | 2026-06-23 | 2026-06-23 | MIT | LICENSE | e419f7761573cc4d7a2978e6b12591f77c86c671 | cbd76673e05ceeb8ee7429315cadcb0dcfc9d7b8 | https://github.com/he-yufeng/FindJobs-Agent/commit/e419f7761573cc4d7a2978e6b12591f77c86c671 | https://github.com/he-yufeng/FindJobs-Agent | llm_utils | [
"supports_temperature"
] | 10 | 1 | 9a89e0d023ac73af | he-yufeng/FindJobs-Agent@e419f7761#supports_temperature | python | 2026-08-18 | goldset/0.1 | 1 | |
python-poetry/tomlkit | fix: keep newline after dotted inline table (#533) | file | commit | fix: keep newline after dotted inline table (#533) | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | tests/test_toml_document.py | [
"tests/test_toml_document.py::test_add_key_after_dotted_inline_table_without_ending_newline"
] | 2026-06-23 | 2026-06-23 | MIT | LICENSE | 43668ddebc3f082bf385d328aceed18d26976897 | d3c76f0bbe90af4b12a3b83bd8e59bc9061dfe85 | https://github.com/python-poetry/tomlkit/commit/43668ddebc3f082bf385d328aceed18d26976897 | https://github.com/python-poetry/tomlkit | tomlkit.container | [
"Container"
] | 9 | 1 | 338f73f009fe1694 | python-poetry/tomlkit@43668ddeb#tomlkit/container.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
python-poetry/tomlkit | fix: reject out-of-order concrete+super table redefinitions at parse time (#530) | file | commit | fix: reject out-of-order concrete+super table redefinitions at parse time (#530) | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | tests/test_toml_document.py | [
"tests/test_toml_document.py::test_reject_out_of_order_dotted_key_redefinition_at_parse"
] | 2026-06-23 | 2026-06-23 | MIT | LICENSE | d3c76f0bbe90af4b12a3b83bd8e59bc9061dfe85 | f40ae46323992b1cda523424bdfb30de899eb4f6 | https://github.com/python-poetry/tomlkit/commit/d3c76f0bbe90af4b12a3b83bd8e59bc9061dfe85 | https://github.com/python-poetry/tomlkit | tomlkit.container | [
"Container"
] | 18 | 1 | 57848d512d751519 | python-poetry/tomlkit@d3c76f0bb#tomlkit/container.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
python-poetry/tomlkit | raise on malformed array element instead of dropping it (#527) | file | commit | raise on malformed array element instead of dropping it (#527) | from __future__ import annotations
import datetime
import re
import string
from typing import Any
from typing import Callable
from tomlkit._compat import decode
from tomlkit._utils import RFC_3339_LOOSE
from tomlkit._utils import _escaped
from tomlkit._utils import parse_rfc3339
from tomlkit.container import Contain... | from __future__ import annotations
import datetime
import re
import string
from typing import Any
from typing import Callable
from tomlkit._compat import decode
from tomlkit._utils import RFC_3339_LOOSE
from tomlkit._utils import _escaped
from tomlkit._utils import parse_rfc3339
from tomlkit.container import Contain... | tests/test_parser.py | [
"tests/test_parser.py::test_array_with_malformed_element_raises"
] | 2026-06-23 | 2026-06-23 | MIT | LICENSE | d548e18b71b28d0e9628127bf0b9dfc5a254dca0 | 11e22aefccd8069a90ae75d20613b9b1068754a1 | https://github.com/python-poetry/tomlkit/commit/d548e18b71b28d0e9628127bf0b9dfc5a254dca0 | https://github.com/python-poetry/tomlkit | tomlkit.parser | [
"Parser"
] | 9 | 1 | 48ea14fe66501114 | python-poetry/tomlkit@d548e18b7#tomlkit/parser.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
python-poetry/tomlkit | Fix ParseError when a sub-table extends an array of tables out of order (#498) | file | commit | Fix ParseError when a sub-table extends an array of tables out of order (#498) | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | from __future__ import annotations
import copy
import math
from collections.abc import Iterator
from typing import TYPE_CHECKING
from typing import Any
if TYPE_CHECKING:
from typing import Self
from tomlkit._compat import decode
from tomlkit._types import _CustomDict
from tomlkit._utils import merge_dicts
from... | tests/test_toml_document.py | [
"tests/test_toml_document.py::test_subtable_of_aot_element_after_other_table"
] | 2026-06-23 | 2026-06-23 | MIT | LICENSE | de68fd06eef61aab0d50d69fb589a43f00a046bf | c46482be9b036c935a193f553c258e4e6e8e3abe | https://github.com/python-poetry/tomlkit/commit/de68fd06eef61aab0d50d69fb589a43f00a046bf | https://github.com/python-poetry/tomlkit | tomlkit.container | [
"Container"
] | 10 | 1 | 3d245fb040fcb648 | python-poetry/tomlkit@de68fd06e#tomlkit/container.py | python | 2026-08-18 | goldset/0.1 | 1 | ||
mahmoud/boltons | split_iter | Fix split maxsplit zero handling | function | docstring | Splits an iterable based on a separator, *sep*, a max of
*maxsplit* times (no max by default). *sep* can be:
* a single value
* an iterable of separators
* a single-argument callable that returns True when a separator is
encountered
`split_iter()` yields lists of non-separator values. A separator will
never... | def split_iter(src, sep=None, maxsplit=None):
"""Splits an iterable based on a separator, *sep*, a max of
*maxsplit* times (no max by default). *sep* can be:
* a single value
* an iterable of separators
* a single-argument callable that returns True when a separator is
encountered
... | def split_iter(src, sep=None, maxsplit=None):
"""Splits an iterable based on a separator, *sep*, a max of
*maxsplit* times (no max by default). *sep* can be:
* a single value
* an iterable of separators
* a single-argument callable that returns True when a separator is
encountered
... | tests/test_iterutils.py | [
"tests/test_iterutils.py::TestSplit::test_maxsplit_zero_returns_unsplit_values"
] | 2026-06-19 | 2026-06-19 | BSD-2-Clause | LICENSE | 4aa77cddb5d06def130df6f09aefab4018fa487c | 3970a80f63807392e512340c25dc2db473bcba70 | https://github.com/mahmoud/boltons/commit/4aa77cddb5d06def130df6f09aefab4018fa487c | https://github.com/mahmoud/boltons | boltons.iterutils | [
"split_iter"
] | 2 | 1 | 432e61ef5df2ed72 | mahmoud/boltons@4aa77cddb#split_iter | python | 2026-08-18 | goldset/0.1 | 1 | |
tw93/Waza | check_description_conformance | fix: polish skill descriptions | function | docstring | Every skill needs a triggerable opening, a 'Use when' cue, a 'Not for' exclusion, and a sane length.
Locks the convention so new skills can't drift into vague descriptions that
agent resolvers can't match before they read when_to_use. | def check_description_conformance(skill_descriptions: dict[str, str]):
"""Every skill needs a triggerable opening, a 'Use when' cue, a 'Not for' exclusion, and a sane length.
Locks the convention so new skills can't drift into vague descriptions that
agent resolvers can't match before they read when_to_use... | def check_description_conformance(skill_descriptions: dict[str, str]):
"""Every skill needs a triggerable opening, a 'Use when' cue, a 'Not for' exclusion, and a sane length.
Locks the convention so new skills can't drift into vague descriptions that
agent resolvers can't match before they read when_to_use... | tests/python/test_skill_checks.py | [
"tests/python/test_skill_checks.py::test_description_rejects_cjk_triggers"
] | 2026-06-19 | 2026-06-18 | MIT | LICENSE | fcc21e93fe49b91cdbde8b2294e768461f528a28 | a0c6d2b4c6eb458a1e25ca3fc6b885e9349b98ce | https://github.com/tw93/Waza/commit/fcc21e93fe49b91cdbde8b2294e768461f528a28 | https://github.com/tw93/Waza | scripts.skill_checks | [
"check_description_conformance"
] | 5 | 1 | 03fe24b9a92f355d | tw93/Waza@fcc21e93f#check_description_conformance | python | 2026-08-18 | goldset/0.1 | 1 | |
skorokithakis/shortuuid | string_to_int | fix: Fix string_to_int radix when alphabet_index is provided (#115) | function | docstring | Convert a string to a number, using the given alphabet.
The input is assumed to have the most significant digit first.
The alphabet_index, if provided, should map each character to its index:
`{char: idx for idx, char in enumerate(alphabet)}`. This avoids rebuilding
the index on each call when decoding multiple strin... | def string_to_int(
string: str,
alphabet: List[str],
alphabet_index: Optional[Dict[str, int]] = None,
) -> int:
"""
Convert a string to a number, using the given alphabet.
The input is assumed to have the most significant digit first.
The alphabet_index, if provided, should map each charac... | def string_to_int(
string: str,
alphabet: List[str],
alphabet_index: Optional[Dict[str, int]] = None,
) -> int:
"""
Convert a string to a number, using the given alphabet.
The input is assumed to have the most significant digit first.
The alphabet_index, if provided, should map each charac... | shortuuid/test_shortuuid.py | [
"shortuuid/test_shortuuid.py::DecodingEdgeCasesTest::test_string_to_int_ignores_alphabet_when_index_given"
] | 2026-06-18 | 2025-12-01 | BSD-3-Clause | COPYING | 496cddf186b6598ebebe7be5c99c0715e7fc5ab5 | b8898871c5b977549b4ecbecbb638d8e06d7359e | https://github.com/skorokithakis/shortuuid/commit/496cddf186b6598ebebe7be5c99c0715e7fc5ab5 | https://github.com/skorokithakis/shortuuid | shortuuid.main | [
"string_to_int"
] | 4 | 1 | c44f3acf6ebcf1cc | skorokithakis/shortuuid@496cddf18#string_to_int | python | 2026-08-17 | goldset/0.1 | 1 | |
mahmoud/boltons | bytes2human | fix(strutils): bytes2human rolls over at exact powers of 1024 | function | docstring | Turns an integer value of *nbytes* into a human readable format. Set
*ndigits* to control how many digits after the decimal point
should be shown (default `0`). | def bytes2human(nbytes, ndigits=0):
"""Turns an integer value of *nbytes* into a human readable format. Set
*ndigits* to control how many digits after the decimal point
should be shown (default ``0``).
>>> bytes2human(128991)
'126K'
>>> bytes2human(100001221)
'95M'
>>> bytes2human(0, 2)... | def bytes2human(nbytes, ndigits=0):
"""Turns an integer value of *nbytes* into a human readable format. Set
*ndigits* to control how many digits after the decimal point
should be shown (default ``0``).
>>> bytes2human(128991)
'126K'
>>> bytes2human(100001221)
'95M'
>>> bytes2human(0, 2)... | tests/test_strutils.py | [
"tests/test_strutils.py::test_bytes2human"
] | 2026-06-17 | 2026-06-17 | BSD-2-Clause | LICENSE | 766b5547392fe8d54c1e000098499dc556bb5cb7 | 8a2a93d8213e1fa4da30c8167ab1a18caad17a17 | https://github.com/mahmoud/boltons/commit/766b5547392fe8d54c1e000098499dc556bb5cb7 | https://github.com/mahmoud/boltons | boltons.strutils | [
"bytes2human"
] | 4 | 1 | 6a8e6c58421f6cc9 | mahmoud/boltons@766b55473#bytes2human | python | 2026-08-18 | goldset/0.1 | 1 | |
mahmoud/boltons | ParsedException | fix(tbutils): avoid IndexError in ParsedException.from_string on truncated tracebacks | function | docstring | Stores a parsed traceback and exception as would be typically
output by :func:`sys.excepthook` or
:func:`traceback.print_exception`.
.. note:
Does not currently store SyntaxError details such as column. | class ParsedException:
"""Stores a parsed traceback and exception as would be typically
output by :func:`sys.excepthook` or
:func:`traceback.print_exception`.
.. note:
Does not currently store SyntaxError details such as column.
"""
def __init__(self, exc_type_name, exc_msg, frames=Non... | class ParsedException:
"""Stores a parsed traceback and exception as would be typically
output by :func:`sys.excepthook` or
:func:`traceback.print_exception`.
.. note:
Does not currently store SyntaxError details such as column.
"""
def __init__(self, exc_type_name, exc_msg, frames=Non... | tests/test_tbutils_parsed_exc.py | [
"tests/test_tbutils_parsed_exc.py::test_parsed_exc_truncated"
] | 2026-06-17 | 2026-06-17 | BSD-2-Clause | LICENSE | 8a2a93d8213e1fa4da30c8167ab1a18caad17a17 | 80f9eb4296daadad85db5ef6c0fd14e2f3602fa4 | https://github.com/mahmoud/boltons/commit/8a2a93d8213e1fa4da30c8167ab1a18caad17a17 | https://github.com/mahmoud/boltons | boltons.tbutils | [
"ParsedException"
] | 9 | 1 | 1d74283a2593e7f5 | mahmoud/boltons@8a2a93d82#ParsedException | python | 2026-08-18 | goldset/0.1 | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.