-
Originally reported by: **Łukasz Rogalski (BitBucket: [rogalski](http://bitbucket.org/rogalski), GitHub: @rogalski?)**
---
In typical cases, explicit call to magic method should be considered as vio…
-
Ypsilon is now developed at https://github.com/fujita-y/ypsilon and it becomes a LLVM-based R6RS/R7RS compiler.
The author claims that its performance is comparable to Guile 3.x on his machine. It wo…
-
This code:
```
class XX() satisfies Scalar&Comparable {
compare(XX|YY other) => nothing;
divided(XX other) => nothing;
float => nothing;
fractionalPart => nothing;
integer => noth…
-
This method acts the same as a `remove` followed by an `insert`, but without churning the tree structure. It's especially helpful when the ordering predicate within the tree differs from the record ty…
-
```go
func Same[T comparable](list1 []T, list2 []T) bool{
left,right := Difference(list1,list2)
return len(left)==0 && len(right)==0
}
```
-
It is mentioned on README that candle supports multi GPU inference, using NCCL under the hood. How can this be implemented ? I wonder if there is any available example to look at..
Also, I know PyT…
-
## 🚀 Feature Request
It would be great if, when sampling a property, it held the same formatting as is used for printing counterexample values.
Sample might not be an appropriate function here (…
-
We are attempting to produce node embeddings for several large graphs using PyTorch-BigGraph, and wish to cluster the nodes that are embedded in a downstream task.
If we train 1 graph, and then tra…
-
Recently there was a discussion on Slack, where it turned out that even well seasoned Elm developers where confused about the semantics of Dict.update. Specifically, it is unclear what is supposed to …
-
This protocol should return an agnostic representation of a comparable structure in a format that the datastore natively understands. Take a look at foundation db for inspiration, as their binary key …