Implementation of Ted Dunning's t-digest in Go
A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means. The t-digest algorithm is also very friendly to parallel programs making it useful in map-reduce and parallel streaming applications implemented using, say, Apache Spark. This is an implementation of Ted Dunning's t-digest in Go. The implementation is based off Derrick Burns' C++ implementation. This package contains the source code needed for building packages that reference the following Go import paths: – github.com/influxdata/tdigest
| Release | Stable | Testing | 
|---|---|---|
| Fedora Rawhide | 0.0.1-3.fc35 | - | 
| Fedora 35 | 0.0.1-3.fc35 | - | 
| Fedora 34 | 0.0.1-2.fc34 | - | 
			You can contact the maintainers of this package via email at
			golang-github-influxdata-tdigest dash maintainers at fedoraproject dot org.