• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

mrocklin / dask / 2218 / 1
92%
master: 94%

Build:
Build:
LAST BUILD BRANCH: astype-passthrough
DEFAULT BRANCH: master
Ran 19 Mar 2018 02:39PM UTC
Files 97
Run time 9s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

19 Mar 2018 02:09PM UTC coverage: 92.027%. First build
PYTHON=2.7 NUMPY=1.14.1 PANDAS=0.22.0 TEST='true' LINT='true' COVERAGE='true' PARALLEL='false' XTRATESTARGS= TEST_IMPORTS='false'

push

travis-ci

mrocklin
Avoid sorting large stacks in order

When performning task ordering we sort tasks based on the
number of dependents/dependencies they have.  This is critical to
low-memory processing.

However, sometimes individual tasks have millions of dependencies,
for which an n*log(n) sort adds significant overhead.  In these cases
we give up on sorting, and just hope that the tasks are well ordered
naturally (such as is often the case in Python 3.6+ due to sorted
dicts and the natural ordering that exists when constructing common
graphs)

See https://github.com/pangeo-data/pangeo/issues/150#issuecomment-373066066
for a real-world case

14635 of 15903 relevant lines covered (92.03%)

0.92 hits per line

Source Files on job 2218.1 (PYTHON=2.7 NUMPY=1.14.1 PANDAS=0.22.0 TEST='true' LINT='true' COVERAGE='true' PARALLEL='false' XTRATESTARGS= TEST_IMPORTS='false')
  • Tree
  • List 0
  • Changed 0
  • Source Changed 0
  • Coverage Changed 0
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Build 1
  • Travis Job 2218.1
  • 7bbab4c1 on github
  • Next Job for PYTHON=2.7 NUMPY=1.14.1 PANDAS=0.22.0 TEST='true' LINT='true' COVERAGE='true' PARALLEL='false' XTRATESTARGS= TEST_IMPORTS='false' on order-sorted (#2219.1)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc