croxfo

Looking for a yt playlist like Cherno's Cpp playlist.

I am heavily constrained by time, and need to learn Go asap to build a Rest API for a file storage vault. I am not new to the language but never deep dived, also I am learning Go after a long time. I know official docs are very good to learn from and go by example is good to go with. But I need more suggesstions due to less time, probably I can give 2 days for learning. I have prior experience in Rust so this shouldn't be a beginner level learning. Maybe a oneshot type video which covers core topics properly. Or should I go with docs instead.

Hey, I am not from electrical engineering branch so I need some insights from you guys. I have some knowledge about how touch screens work(capacitive touch screens). I thought to work on an idea to build a sensor which can detect changes caused due to flexing of structural integrity and detect delta movements, like a muscle movement. I know there are electronic sensors which detect electrical signals to muscles but I want something which is cheaper to build and more practical to use.
Something like a thin patch or strip.

Given n and k. how many triplets that can be formed such that (a,b,c) a + b, b + c, a + c are divisible by k.
Different permutation but same triplet is counted too. eg (3,3,1) (1,3,3), (3,1,3)

Constraints
1 <= n <= 1e6
1 <= k <= 1e6
1<= a,b,c <=n

I’m currently studying RAFT and had a discussion with my professor about the trade-offs between consistency and availability. He suggested exploring a novel mechanism where a distributed system could dynamically switch between "consistent mode" and "available mode" at runtime. The idea is to analyze real-time factors like network conditions, latency patterns, or failure signals, and then shift the system behavior accordingly. However, my concern is that once you prioritize availability during network faults or server failures, isn’t inconsistency inevitable? For example, if a leader server goes down and incosistent replicas keep serving writes to remain available or the uncommitted data is

I have multiple task at the runtime level that access locks frequently.

select!{
  Some(req) = ch_ae.recv() => {
  match req.msg {
    Msg::AppendEntry(e) => {      
        let (mut term, logger, mut state) = {
        loop {
          if let Some(guards) = self.acquire_tls() {
            break guards;
          }
          tokio::time::interval(Duration::from_nanos(10)).tick().await;
        }
      };
  // code
 },
 // other branches
}

I am expecting "tokio::time::interval" to return control back to the executor( am I wrong here) and wait for sometime before ready to acquire locks again which may be held by other

............

() = heartbeat => {

if *sa.watch_state.borrow() != State::Leader {continue;}

match RaftRpcClient::connect(sa.endpoint.clone().timeout(Duration::from_millis(500))).await {

Ok(mut client) => {

...........

so here I am borrowing a value from watch channel. This snippet shows alternate method where I check the condition after the future is polled which works fine.
if I move this check to precondition, it somehow not executing or blocked for some reason.
A little design description:
heart<----->server_agent_1
^-------->server_agent_2
these server agents are spawned tasks and this is where the heartbeat is running. They are connected using mpsc c

https://preview.redd.it/133s8ut3ju7f1.png?width=1702&format=png&auto=webp&s=52583379bc35b679050c65879ee46d8cbe0b31a1

I am new to nvim. I have started with kickstart to configure my nvim with few more plugins added.
After few setups I noticed that some floating windows and pop ups are getting clipped like this.(Telescope, Codeium setup window). However few are working fine like the neotree floating window and floating terminal.
Is there a way to fix it for all the windows instead of fixing each plugin window separately.

I was implementing system call to calculate available memory in freelist then I encountered something which I can't understand.
Each process is allocated a page which is 4090bytes. This memory is allocated during exec call which uses uvmalloc which further calls kalloc to allocate space in memory. What I am not understanding is that why even after allocating an eight page size array there is no change in freelist available memory.
I does change when I am calling malloc instead of stack allocation even during child prcoess creating using fork changes available memory.
No matter how big the array allocation is it's not showing any stack overflow.
Lastly there is one more issue. In th

I(M) have hardly ever thought while purchasing a body spray but now I think it's time to explore. So recently I used old spice and the last time I used this was ~15 years ago. I liked the fragrance it stands out to me and doesn't give me headache like other expensive perfumes my hostel mates use. I want something fruity or something like old spice. I have always liked fragrance which smells more natural. I think smells like banana(not when you poke your nose to smell sometimes the smell from a distance feels fresh, like someone ate a banana in a room and it fill the room with the fragrance), orange, timber, sandalwood will suit.
I don't know how to explain but I don't like smells which ar

So I have a prof. who has worked on computational storage before and proposed an idea to make one. I have almost no idea how does it work and how to make it even or where to start. If anyone knows something about this and can help with the resources, and what to expect?