-
The call at Ambiguity.cpp:37:
```
abm.right.replace_data(i, s);
```
is not returning, but using high CPU.
Both `find_tags_motus` runs where this happened were processing the activation
event for…
-
I read the following in the [documentation for ``ala``][1]:
The reason for the signature of the hof is due to ``ala`` not caring about structure. To illustrate why this is important, another functi…
-
### Description of Problem, Request, or Question
We reached again the storage limit on our Bintray account (160GB).
I think we could remove **ALL** outdated packages from Bintray.
I could pro…
-
~Feature Request~
I need something like this:
https://github.com/rails/rails/blob/master/activesupport/lib/active_support/inflections.rb
It would seem appropriate to put this functionality along with…
-
I am using Boost 1.69.0. I have a program which builds fine on x64 using Windows and VS 2017 but not x86. I am using `boost/log` but I believe (from the error message) that the error is in `boost/ut…
-
**Original reporter**: _andreas.abel@_
Producing the doc for Agda (260 modules, 70 kloc) takes 2.5g of resident memory on my Ubuntu 12.04 Linux 64bit machine. This leads to thrashing unless I close …
-
If I run elm-format (built from 9584c6d8223098ef911abd43cecd6b9171993e9b) on elm-combine's [Combine.elm](https://github.com/Bogdanp/elm-combine/blob/master/src/Combine.elm) it ends up turning
``` Elm…
-
I took a look at `fold` and saw:
```haskell
fold :: (a -> c) -> (b -> c) -> Future a b -> Future d c
```
This is not a fold, this is bimap.
-
A simple array with integer indexes would work the same way, and would reduce computational overhead of looking through the a bimap, as well as reduce memory footprint and complexity.
MrTJP updated
6 years ago
-
We should test terms in our translation table file for accuracy. Minimally we could establish certain rules (all identifiers are 7 digits long, table is a bimap, etc.). Bugs like this one - https://…