Skip to content

Concurrent topological sorting
Compare
Choose a tag to compare
@rouson rouson released this 22 Sep 19:09
· 12 commits to main since this release
2.1.0
923348e
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Learn about vigilant mode.

This release provides a refactored topological_sort function that

  1. Converts the internal subroutine depth_first_search to a function, which means 👀
    a. all procedures in dag are now functions except Vegetable's runsubroutine in the test suite 💯
    b. every function is pure except those that call jsonff (which was already true before this release). ❄️
  2. Use the resulting clarity in information flow to eliminate several unnecessary local variables, ℹ️
  3. Changes several remaining local declarations to associations, which 🎏
    a. avoids unnecessary temporary copies and ©️
    b. prevents some potential uses of uninitialized variables (none were present). 😨
  4. Converts do loops to do concurrent, opening opportunities for future optimization 🚀 via
    a. vectorization, 🏹
    b. multithreading, or 🧵
    c. GPU acceleration. 🎮
Assets 2
Loading