There is a newer version of the record available.

Published October 15, 2018 | Version 3.2.4

scikit-hep/uproot: 3.2.4

  • 1. DIANA-HEP
  • 2. University of Cincinnati
  • 3. Texas A&M University
  • 4. RWTH Aachen

Description

Looking up branches (manually by the user or internally in TTree.arrays) is now faster for large numbers of branches. The O(n^2) lookup algorithm has been replaced by a single hashmap lookup, and a branch's interpretation property is now only computed once.

Files

scikit-hep/uproot-3.2.4.zip

Files (54.6 MB)

Name Size Download all
md5:abf80f9d8cfafd262a66e6803898ec54
54.6 MB Preview Download

Additional details

Related works