-
## Context
A Rerun frame is divided into a bunch of non-overlapping phases.
By "phase" I mean any logical unit of work. Individual phases might be parallelized internally, but as a whole, phases a…
-
Code to reproduce (I cloned the repo to have access to the private methods):
```scala
val vec1 = RRBVector.range(0, 1025)
val vec2 = RRBVector.range(0, 1025).map(x => -x) // to distinguish between …
-
leftwise-dense nodes should not have sizes arrays. Currently all nodes created via concatenation except leaf nodes end up with sizes arrays. This means some future operations will take the slow path t…
OxSon updated
10 months ago
-
Hello
From the docs in 12.3:
> O(1)* means 'amortised O(1),' which means that an operation usually runs in constant time but will occasionally be more expensive: for instance, Vector::push_back,…
-
For some reason, when the span has a length of one, ```._.labels``` returns an empty tuple. I would expect it to return the part of speech of the individual word (which can be done by taking the token…
-
Why when I run nltk.corpus.ptb.fileids() in data_ptb.py, I got an empty list of fileids.
`nltk.corpus.ptb.fileids()`
`[]`
-
Extra space would help to recognise tokens correctly, for example for the parser output
### sentence: tree) I
( (S (VP (VB tree)) (NP (PRP I)))))
it's difficult to build the tree if not using the…
-
Hello, from the benchmark code I figured out that this seems to be the way to check if set contains an element:
```
bool res = set.find(i + 1).leaf();
```
However, the following code seems to work…
-
e.g. For ImmutableLists, there's no implementation that I know of that supports random insertion of elements. By exposing such methods in builders it will lull users into believing the operations do n…
-
Would be great to have maps and sets that preserve insertion order, a la https://github.com/frankiesardo/linked or https://github.com/amalloy/ordered.
My main motivation for maintaining insertion ord…