This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
- # announcements (12)
- # babashka (25)
- # biff (30)
- # cherry (34)
- # cider (46)
- # clj-kondo (23)
- # clojure (37)
- # clojure-berlin (6)
- # clojure-europe (12)
- # clojure-nl (4)
- # clojure-norway (6)
- # clojure-uk (2)
- # clojurescript (8)
- # conjure (1)
- # cursive (4)
- # data-science (11)
- # datalevin (12)
- # datascript (15)
- # emacs (2)
- # events (1)
- # fulcro (14)
- # graalvm (16)
- # gratitude (23)
- # honeysql (11)
- # jobs (2)
- # jobs-discuss (14)
- # kaocha (1)
- # leiningen (8)
- # nbb (45)
- # off-topic (7)
- # portal (8)
- # re-frame (9)
- # releases (2)
- # shadow-cljs (24)
- # squint (5)
- # tools-build (17)
- # tools-deps (7)
- # vim (5)
tapestry-0.3.0-SNAPSHOT - seeking feedback or thoughts (message me or post in #teknql) on the new APIs before potentially releasing it with the GA release of JDK 19 later in september.
tapestry.core/interrupt! to interrupt fibers.
tapesty.core/timeout! to set a timeout on fibers
tapestry.core/alive? to see whether a fiber is still alive
• Refactored fibers to use a custom
tapestry.core/Fiber type allowing for better introspection (custom
print-method) as well as the functions above. Takes us a step away from manifold (used to return deferreds) and toward built-in JDK stuff.
• Removed custom
tapestry.core/locking implementation - was needed when loom and
clojure.core/locking didn't play well together (Monitors weren't yet supported).
• Updates to the JDK 19 APIs instead of the loom preview build APIs.
• Updated the readme w/ JDK 19 installation instructions and examples of the new APIs
Check it out here:
Looks good. It'll be interesting to see what kind of various async abstractions eventually develop on top of loom, tapestry looks like a nice start. I'm also curious to see core.async loom support and maybe promesa loom support, as well as Missionary or other structured concurency approach
I will say I doubt if core.async will do anything to support loom (because it needs to support JDK versions from 8 ). Most likely the easiest way to handle it will be to monkey patch it so that go blocks just use tapestry and parking put and take get replaced with the blocking ones.
fs 0.1.11 (File system utility library for Clojure)
• https://github.com/babashka/fs/issues/65: Explicitly support
:win-exts option on
which function (https://github.com/lread)
exists? should never throw on illegal input path.
^:const to not cache OS-specific constants, so AOT-ed code can be re-used in multiple OS-es.
I've updated and released Jordan Lewis's
1.0.0 It's a clean and fast implementation of the Union Find algorithm for quickly finding groups of interrelated elements.
This version updates from the previous 0.1.0 release with support for fast construction using transient/persistent!
I used this library as it is now in 2015 for a drug discovery project and it worked great. Unfortunately that variant was never properly released. I recently came back to it for a different project and asked Jordan to update the release. He asked me to take it over instead, so I have. I don't expect any significant changes in the future since I think it's feature complete and stable.
If you aren't familiar with Union Find, you should check it out. It's a simple idea and quite useful!
http://www.frankmcsherry.org/graph/scalability/cost/2015/01/15/COST.html I first read about union-find in this engagingly written (and frankly devastating) takedown of Scalable:tm: "big data" systems. Thanks for releasing this implementation!
I've used https://github.com/huahaiy/nifty/blob/master/src/nifty/disjoint_set.cljc for this in the past as it supports both CLJ and CLJS. I know it can be tricky to support both, but it's really appreciated when implementations of fundamental data-structures support multiple platforms. I am curious how the data.union-find implementation compares on performance though.
By looking at the code, the data.union-find library seems to have immutable semantics, having transient and such, whereas mine is a faithful implementation of the mutable algorithm of union-find in Clojure syntax. Mine also use loop-recur instead of explicit recursion, so it probably won’t blow the stack.
@UFTRLDZEW Thanks for the link!
@UMGAMGWF8 interesting, thanks for the pointer to the nifty lib. I hadn't seen it before. I'd definitely be curious about the relative performance between these implementations. I see that nifty also implements
disj which is nice.
@U0A74MRCJ you're right, I was just writing the same thing!