-
If you do a `count()` on a whole table or on an indexed range (through `between()`), we could implement the following optimization to boost `count()`s CPU efficiency by some factor:
Once we get to a l…
-
There are many one-slot jobs with efficiency > 100%. For example d0 jobs last month:
select \* from trq_job where queue_id = 8 and start_time > '2010-10-01' - INTERVAL 1 MONTH and comp_time > '2010-1…
-
Currently, messages sent to the `Send()` channel are sent to every peer that the node connects to. This API allows for a very simple "flooding" scheme: to send a message to every node in the network,…
-
I am working with Python Robyn API. Upon executing the allocator function for the "target_efficiency" scenario, it consistently generates results based on the default target ROAS value, which correspo…
-
### Description
This feature aims to automate the management of open PRs in a repository, ensuring that outdated or abandoned PRs are closed in a timely manner. By doing so, it helps maintain reposit…
-
traversing a subtree using leaves function is very slow, will provide some optimized method in the future? thanks.
-
-
This might be of interest to @evilaliv3 and @obtuse .
@evilaliv3 has expressed concern about the size of the blocklists. In particular, that as-is we have to check whether a given URL matches any en…
-
In the DevOps December call, we noted some frustrations with adore-djatoka.
It seems that adore-djatoka is implemented with default URLs like:
`http://islandora-server/adore-djatoka/resolver?url_v…
-
## **Proposal:** Improve the efficiency of the transaction pool's `ProcessConsensusChange` method
### Motivation
Currently, on every consensus change (i.e. every block update), the transaction poo…