Zeitpunkt Nutzer Delta Tröts TNR Titel Version maxTL So 02.06.2024 00:00:07 61.862 0 3.431.311 55,5 Fosstodon 4.2.9 500 Sa 01.06.2024 00:00:16 61.862 +2 3.429.149 55,4 Fosstodon 4.2.9 500 Fr 31.05.2024 00:00:10 61.860 +1 3.425.635 55,4 Fosstodon 4.2.9 500 Do 30.05.2024 00:00:06 61.859 +2 3.422.265 55,3 Fosstodon 4.2.8 500 Mi 29.05.2024 00:00:07 61.857 +1 3.419.439 55,3 Fosstodon 4.2.8 500 Di 28.05.2024 00:00:11 61.856 +5 3.416.643 55,2 Fosstodon 4.2.8 500 Mo 27.05.2024 00:00:09 61.851 +1 3.413.281 55,2 Fosstodon 4.2.8 500 So 26.05.2024 00:00:08 61.850 -1 3.410.443 55,1 Fosstodon 4.2.8 500 Sa 25.05.2024 00:00:09 61.851 +2 3.407.482 55,1 Fosstodon 4.2.8 500 Fr 24.05.2024 00:00:07 61.849 0 3.404.186 55,0 Fosstodon 4.2.8 500
Philip Trettner (@artificialmind) · 07/2023 · Tröts: 308 · Folger: 32
So 02.06.2024 11:55
I'm currently designing a trait-like system. It's unfortunate that in #rust, a single impl can apply to a single type in potentially infinite ways, making most "collect all traits that apply to this type"-like algorithms moot.
Example:
```
struct S;
trait Foo<T> { }
trait Check<T> { fn check(&self); }
impl <U, T: Foo<U>> Check<U> for T { fn check(&self) { } }
impl Foo<i32> for S { }
impl <T> Foo<Vec<T>> for S { }
fn test(s: &S) {
s.check() // infinite candidates
}
```
[Öffentlich] Antw.: 0 Wtrl.: 1 Fav.: 0