-
### systemd version the issue has been seen with
256.5
### Used distribution
Debian sid/unstable
### Linux kernel version used
Linux 6.11.0-rc1
### CPU architectures issue was seen on
riscv64
…
-
In addition to being a performance optimization, the magic sets transform often grounds variables that might otherwise be ungrounded. Unfortunately, it appears that souffle performs a check for ground…
-
I have noticed a 50% regression on the benchmark below, between julia version 0.6.4 and 1.5/1.6. Julia v1 is slower by about 30%. Memory usage is interesting: despite being faster, 0.6 uses more memor…
jebej updated
2 years ago
-
-
https://www.youtube.com/watch?v=dO9LQsIpavM
1] craete cache
2] check if argument exists or not
if(yes)=>fetch from their
else add in cache
cache can be map or any suitable data structure or o…
-
``` js
/*
参数 number
返回 number
*/
function fib(num){
}
fib(1); // === 0
fib(2); // === 1
fib(3); // === 1
fib(4); // === 2
fib(5); // === 3
```
-
There has to be a way to sanely do anonymous recursion with closures but this is the best I could come up with:
``` rust
use std::cell::Cell;
fn main() {
let id = &(|a| a) as &Fn(u64) -> u64;
…
-
```
# fib.py
def fib(n):
if n == 1 or n == 0:
return 1
else:
return fib(n - 1) + fib(n - 2)
print fib(35)
```
Segmentation fault when running `pypy -m vmprof -o lo…
-
Not sure what is going on here, but consider the following example:
````cooltt
def category : type :=
sig
def ob : type
def hom : sig [s : ob, t : ob] → type
def idn : (x : ob) →…
-
In the context of the given rule:
```plaintext
(S l₀) ⋈ (fib₀ r₀) ⟶ l₀ ← (dup ?0 ?1), ?2 ← (add r₀ ?3), ?0 ← (fib₀ ?2), ?1 ← (fib ?3)
```
we observe that the equations `?2 ← (add r₀ ?3)`, `?0 ← (…