-
Seems like ``sequence?`` which has this definition:
```factor
[
dup tag 1 swap fixnum-shift-fast 2564 fixnum-bitand 0 eq?
[ f ] [ \ t ] if
[ drop \ t ] [
dup dup tag 7 eq?
…
-
## Description
Currently, go-spacemesh state database size keeps growing and accordingly the performance continues to degrade as less and less of SQLite index data fits in RAM.
A substantial part of…
-
The paper [Discrimination Aware Decision Tree Learning](https://www.win.tue.nl/~mpechen/publications/pubs/KamiranICDM2010.pdf) by Kamiran et al. introduces several approaches for learning a decision t…
-
Chunk could be improved in different ways.
- `Concat` could be specialized and improved with:
```scala
case class ConcatArr[A](body: Array[Arr[A]], tail:Array[Arr[A]]) extends NonEmpty[A]
case c…
-
Start with initial tree state. The initial tree can be fully filled with default values (e.g. hash(NULL)). Then batch update the merkle tree by a list of nodes.
**Public Input**
`[Old Root Hash, …
-
**Describe the bug**
It *looks* like SIPNET runs will continue through then workflow without throwing an error even if no sipnet.clim file is created/available and all model runs fail without produci…
-
From `unordered-containers`'s benchmark and [other places](https://github.com/tibbe/unordered-containers/issues/123), it seems hashmap is faster at inserting but slower at reading, maybe more suitable…
-
@VHellendoorn
In python, there is the [ast module ](https://docs.python.org/3/library/ast.html) which parse the code snippet into a python AST. Which works like this
```python
expr="""
def foo():…
-
I have two pools with `ashift=12` and DDT turned on and have noticed that their size-on-disk is enormous:
```
dedup: DDT entries 58011991, size 1192 on disk, 168 in core
dedup: DDT entries 20163506, …
-
This is a feature request to provide some extensions of the `igraph_path_length_hist()` functionality (possibly implemented as a separate function):
1. Allow weighted path lengths. This would be a ve…