HackerTrans
TopNewTrendsCommentsPastAskShowJobs

rntz

no profile record

Submissions

Evaluation order and nontermination in query languages

rntz.net
1 points·by rntz·14 dagen geleden·0 comments

Deconstructing Datalog

rntz.net
18 points·by rntz·vorige maand·0 comments

comments

rntz
·5 maanden geleden·discuss
why the sharp divide around december 2022, with almost none imported before that and plenty after?
rntz
·9 jaar geleden·discuss
Yes, that's why I said: "but then I have to think about rounding error. Ugh." Because integer division rounds. (Or truncates, if you prefer.)
rntz
·9 jaar geleden·discuss
Huh, is this the stuff you're talking about:

    http://www.diku.dk/hjemmesider/ansatte/henglein/papers/henglein2011a.pdf
    http://www.diku.dk/hjemmesider/ansatte/henglein/papers/henglein2011c.pdf
    https://www.youtube.com/watch?v=sz9ZlZIRDAg
    https://hackage.haskell.org/package/discrimination
I didn't know about this until I read your reply and googled; I thought you were just obliquely referring to radix sort or something like that.
rntz
·9 jaar geleden·discuss
I'm tempted to suggest

    (low / 2) + (high / 2)
but then I have to think about rounding error. Ugh. I guess you could write a bunch of nested `if`s to handle the parity errors, assuming you know how your language rounds when dividing negative numbers. (I wouldn't be surprised if C leaves that "implementation-defined".) If you're really searching an arbitrary range, maybe just use bigints. Then at least you can stop worrying about overflow altogether.
rntz
·9 jaar geleden·discuss
The O(n log n) bound only holds for comparison-based sorts. It's not a matter of time; it's an assumption/precondition of the proof.
rntz
·10 jaar geleden·discuss
Chez is known for being very fast, and for using state-of-the-art compiler technology.