On 07.07.24 13:30, Zelphir Kaltstahl wrote:
On 07.07.24 13:01, Maxime Devos wrote:
>Maybe bbtree-fold can be used, but
that would not "early exit" as soon as it has found an item, that satisfies some
specified predicate.
You can use escape continuations to do an early exit:
;; On success, r
On 07.07.24 13:01, Maxime Devos wrote:
>Maybe bbtree-fold can be used, but
that would not "early exit" as soon as it has found an item, that satisfies some
specified predicate.
You can use escape continuations to do an early exit:
;; On success, return stuff-to-return. Otherwise, return the
>Maybe bbtree-fold can be used, but
that would not "early exit" as soon as it has found an item, that satisfies
some
specified predicate.
You can use escape continuations to do an early exit:
;; On success, return stuff-to-return. Otherwise, return the symbol ‘no-match’.
(let/ec escape
(bbtr
Hello Guile Users!
I have questions regarding sets, functional sets from guile-pfds
(https://github.com/ijp/pfds), to be precise:
Is there a way to "find" an element in the set? I know that the sets are backed
by balanced binary trees in guile-pfds and that those bbtrees have
(bbtree-contain