BurntSushi/xsv

feature: binned histograms

Open

#84 建立於 2017年6月13日

在 GitHub 查看
 (3 留言) (2 反應) (0 負責人)Rust (9,730 star) (315 fork)batch import
enhancementhelp wanted

描述

Histograms could be done in numerous ways. Here are some thoughts:

  • like most of xsv, should operate over huge tables with a single pass
  • .idx files could store metadata helpful for binning? eg, min and max values per column
  • "chose N evenly spaced numerical bins" seems to require more than one pass (or keeping all values in memory). Keeping a tree of round-sized bins and merging them when the tree gets too big would avoid that
  • logarithmic bins
  • power-of-two or power-of-1024 (eg, for file sizes)
  • binning of strings or decimal numbers by prefix
  • "other" / "NaN" / null bins
  • csv/tsv output by default, then a separate mode like xsv table to pretty print bars

貢獻者指南

技術棧
rust
領域
clidata
議題類型
feature
難度面向新貢獻者的預計實作難度，1 表示很小改動，5 表示專家級工作。
3
預計時間有經驗貢獻者完成調查、實作、測試並準備 pull request 的粗略時間範圍。
3-5 days
活動狀態議題目前的可參與程度：新鮮、活躍、陳舊、阻塞或等待維護者輸入。
stale
清晰度議題是否清楚說明預期改動、驗收標準和下一步。
needs investigation
前置要求
RustCSV parsinghistogram algorithmsmemory efficient processing
新手友善度1-100 的估計分數，表示該議題對首次貢獻者的友善程度。
30
研究方向
Investigate single pass histogram binning approaches for large CSV data, considering memory constraints. Review comments in issue #84 for additional requirements like logarithmic bins and null handling. Existing .idx files may provide min/max metadata. The implementation should output CSV/TSV and support a pretty print mode similar to `xsv table`.