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

mrocklin / dask / 2218
92%
master: 94%

Build:
Build:
LAST BUILD BRANCH: astype-passthrough
DEFAULT BRANCH: master
Ran 19 Mar 2018 02:39PM UTC
Jobs 1
Files 97
Run time 11s
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

pending completion
2218

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

9 of 9 new or added lines in 1 file covered. (100.0%)

14635 of 15903 relevant lines covered (92.03%)

0.92 hits per line

New Missed Lines in Diff

Lines Coverage ∆ File
1
100.0
dask/order.py
Jobs
ID Job ID Ran Files Coverage
1 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') 19 Mar 2018 02:39PM UTC 0
92.03
Travis Job 2218.1
Source Files on build 2218
Detailed source file information is not available for this build.
  • Back to Repo
  • Travis Build #2218
  • 7bbab4c1 on github
  • Next Build on order-sorted (#2219)
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