def-lkb

7 ms·

1.
by def-lkb 1y ago
https://sourceforge.net/projects/libre/ dates back to 2001. (One could object it is not imperative enough, whatever that means :))
2.
by def-lkb 3y ago
Compression, synchronization and backup systems often use rolling hash to implement "content-defined chunking", an effective form of deduplication. In optimized implementations, Rabin-Karp is likely to be the bottleneck. See for i
3.
by def-lkb 3y ago
> I would love to hear of other low(er) barrier-to-entry ways to use LaTeX, because it’s a pretty steep commitment for someone who isn’t a professional writer. I have been working on and off on a fork of LaTeX with real-time feedback: yo
4.
by def-lkb 4y ago
I think what you suggest is possible, derivation might even be well suited for this application, however I can't tell if it would be better than existing approaches. There are some chances that it might be interesting in practice, sinc
5.
by def-lkb 4y ago
> Does there exist a regex engine I can try that uses derivatives and supports large Unicode classes and purports to be usable for others? :-) I don't know any besides ocaml-re that Drup already linked, sorry :). And sorry that my c
6.
by def-lkb 4y ago
I don't think you should be worried about Unicode in particular. Although the derivation formula on paper is parameterized by a character, you don't have to compute the derivative for every character separately. It's actually
7.
by def-lkb 4y ago
Of course, this is nitpicking :). For all practical purpose, this O(log n) is O(1). If you are interested, I can try to recover the proof that the rotation step can be done in O(n), thus allowing to apply the master theorem on the main recu
8.
by def-lkb 4y ago
Correction, technically, it uses O(log n) space for the recursion, so it is not stricly-speaking inplace, which would mean O(1) space.
9.
by def-lkb 4y ago
I wrote a similar sorting algorithm around 14 years ago (fast, inplace, adaptive merge sort algorithm using rotation/swap, and I think, stable). This is all I remember from the time... I was able to prove (on paper) that the whole algo
10.
by def-lkb 5y ago
> having the circle not reset after every color change is probably not feasible unless the module order is fairly convoluted right? Not necessarily no. The thing is that you could have an early module that implements a framework to manag
11.
by def-lkb 5y ago
Both the synchronous and asynchronous frontends preserve as much state as possible (all untouched modules are kept). They differ in the control flow they permit (the asynchronous one being more expressive). I will try to make a parallel wit
12.
by def-lkb 5y ago
I am the author of Hotcaml. There is actually some notion of persisting state in it. Reloading is done at the granularity of a module. The reverse dependencies of a module that changed are also reloaded, but the dependencies are not. The ru
13.
by def-lkb 5y ago
The output is a bit underwhelming. You might be interested in https://codinuum.github.io/gallery-cca/ It is not based on tree sitter , the parsers they use are quite impressive. Yet a difficult part is computing large
14.
by def-lkb 5y ago
Indeed. GADTs provide type equalities and existentials. This example involves neither, only sub-typing (which is quite strong and interesting in Typescript)
15.
by def-lkb 6y ago
That might seem counter-intuitive, but tracing GC is the fastest way to manage memory in general (arbitrary life time, graph shapes and allocation patterns). It permits really fast allocation, defragmentation and is sometime the only way to
16.
by def-lkb 8y ago
> spaces whose distance measures obey the triangle inequality That would be a metric space, and a distance obey the triangle inequality by definition. The element of the space are otherwise quite arbitrary. Unfortunately, Normed spaces a
17.
by def-lkb 8y ago
data Ty a where Int :: Ty Int Bool :: Ty Bool ...
18.
by def-lkb 10y ago
Hi, I did a part of the incremental parsing in Menhir and the whole recovery aspect. I can try to explain a bit. My goal was Merlin ( https://github.com/ocaml/merlin/ ), not research so there is no paper covering th
19.
by def-lkb 12y ago
Do you mean making Merlin works in a Js_of_ocaml environment? I am not familiar with JS programming model, but I think it should be possible to turn Merlin into a worker and have synchronous loading of "cmi" files via some service
20.
by def-lkb 12y ago
You are comparing apples to oranges. The purpose of google algorithm is that, when changing the number of bins, a minimum number of items get moved. This version of your codes prints the number of items which have been reaffected: https:&#
21.
by def-lkb 12y ago
The purpose of reals is just to map from [0-1) to [0-n) where n is the number of hosts. Floating points are used to ease the presentation, I think the algorithm can be ported to integer operations without loss of performance (didn't pr