Simplify `max_as/l` application

未关闭
#85 0 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看

还没有人认领这个 Issue。

评估

难度
4/5
预计耗时
3-5 天
新手友好度
35/100
Issue 类型
重构
描述清晰度
基本清楚
活跃度
停滞
技术栈
python
领域
backend

调研方向

The issue names no files or tests. Start by tracing how max_as/l are applied during grid loading and how later checks and operations use the loaded grids. Determine whether trimming subgrids at load time preserves the expected lower order, then compare memory use and code paths; done means higher order grids are handled consistently without separate special cases.

由索引模型根据 Issue 内容生成。

描述

enhancement refactor

When max_as/l are specified, to use grids at a lower order than available (e.g. computing an NLO theory from NNLO grids), everything might be done consistently just cutting the grids during loading: everything else (checks and operations) will be done adaptively according to the loaded grids, that will always be used completely.

This will have the advantage of only loading (or keeping in memory) the required subgrids, lowering the memory impact of Pineko in these cases, and the even greater advantage of simplifying the code, since there will be no need to separately consider the case of grids containing orders higher than needed.

主要语言
Python
星标
2
派生
0
平均合并
10 天 34 分钟
30 天内合并 PR
3

环境准备

  • 没有 Dockerfile 或 Docker Compose 文件
  • 没有 Pull Request 模板
  • 阅读贡献指南

从这里开始

  1. 先读完整个 Issue,再读项目的贡献指南。
  2. 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
  3. Fork 仓库,在一个分支上完成修改。
  4. 提交 Pull Request,并在描述里引用这个 Issue 编号。

NNPDF/pineko 的其他 Issue

查看 NNPDF/pineko 的全部 Issue

相似的 Issue

更多 Python Issue

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。