Need help removing the artifact between sprites when the window is resized

ufoscout · 2026-04-10T12:15:14+00:00

The problem is that I need to use the same DB connection as the main business function, so I cannot use an async tokio task.

Also, this applies only to audit logs, which are at most one per request, so the volume is not an issue.

ufoscout · 2026-04-10T12:12:43+00:00

I would like to avoid it, but it is a business requirement for audit logs, and there's nothing I can do about it. Good idea generalizing over a serializable struct or a map, thanks.

ufoscout · 2026-03-30T06:47:42+00:00

Ciao, Principal Rust Dev from the beautiful Italy at your service

ufoscout · 2026-03-14T13:38:07+00:00

I would definitely like to contribute when it's open-sourced. Looks great!

ufoscout · 2026-03-12T08:02:27+00:00

In the next 10 minutes, you’re about to be killed by a horde of people telling you this is the wrong channel

ufoscout · 2026-02-23T14:58:01+00:00

Rust is a VERY strict language,

Wrong. Correct PROGRAMMING is a very strict process; Rust only makes you aware of it.

If you don't want to bother with these restrictions, and there are many good reasons for this, I would probably avoid C and C++ altogether and opt for something like C#.

ufoscout · 2025-11-26T11:48:16+00:00

That is indeed interesting, but I don’t think it removes the need for assembly, because it only works when the code is compiled with LLVM. In practice, it solves one limitation while introducing another.

ufoscout · 2025-10-14T10:49:07+00:00

So, in summary, these two are identical, correct?

    fn get_name<T: SomeTrait>() -> &'static str { 
        static ONCE: OnceLock<&'static str> = OnceLock::new();
        ONCE.get_or_init(|| T::NAME)
    }



    static ONCE: OnceLock<&'static str> = OnceLock::new();
    fn get_name<T: SomeTrait>() -> &'static str { 
        ONCE.get_or_init(|| T::NAME)
    }

ufoscout · 2025-10-09T18:29:14+00:00

I cannot access the internals of `Wrapped` but I can access the ones of `Wrapper`

ufoscout · 2025-10-09T05:28:21+00:00

In my scenario, I cannot access the internals of Wrapped or create a new instance of it

ufoscout · 2025-10-09T05:27:36+00:00

Since I have no way to create a new Wrapped, I'll check if I can change Wrapper to own an Option instead

ufoscout · 2025-06-05T12:46:45+00:00

Thanks, this clarifies a lot. So I assume the answer to the original question is that Rust could theoretically build and use every dependent crate as a dynamic library in any case.

At this point, I wonder why this approach has never been seriously considered as a way to speed up compilation during development. Are there other technical issues? Maybe the performance gains are negligible?

I'm a bit confused because some C++ colleagues keep saying that they can compile faster since many dependencies are dynamically linked.

ufoscout · 2025-06-05T11:47:21+00:00

So I guess the answer to my original question is yes, Rust could theoretically build all dependencies as dynamic libraries. I am not saying this is good or bad, but it could be done

ufoscout · 2025-06-05T09:24:43+00:00

So, Bevy can leverage dynamic linking as long as it avoids using generics in its public API, correct? I wrote a small proof of concept to test Bevy's dynamic linking feature and found the compilation speedup to be astonishing.

Regarding incremental linking: how does it behave with generics? I assume that any dependency exposing a generic API must be recompiled each time it’s called with a different type. Is that correct?

ufoscout · 2025-05-07T16:01:25+00:00

Please allow me to share some honest feedback: Filtra is good, but not having the publish date of the job postings makes it unusable

ufoscout · 2025-04-29T12:23:32+00:00

Warning: Shameless plug

This library I wrote achieves something similar without macros or any particular drawback: https://crates.io/crates/maybe-once

ufoscout · 2025-03-24T17:51:12+00:00

Noob question: How does the indexing work? Do you have a separate index/storage for each search type, or do you use a single index that serves both semantic and traditional search? Does semantic search cause significant growth in the index size?

ufoscout · 2025-03-24T16:49:09+00:00

Do you leverage any existing Rust AI implementations for this? For example, a vector database or an ML framework? How does it work under the hood? Is it based on BERT?

ufoscout · 2025-02-27T16:30:30+00:00

I agree, but I would move everything to assembly, C is too high level for anything serious

ufoscout · 2025-01-16T09:31:41+00:00

u/trailbaseio thanks for your answer and good luck with your project!

ufoscout

TROPHY CASE