I kept asking this question because every time I work on a feature branch, I end up with trivial and less important commit messages. When I merge them into the main branch, the commit history becomes less useful. That’s why I asked ChatGPT and learned about squash and merge.

@devwitheyob

Guys, have you noticed that when we see a picture taken with a good phone camera, if we look at the same image after 3 or 4 years, there seems to be an amazing change in quality, Is that because of our perception, or did the quality actually decline over time🤔

@devwitheyob

Good night fam, sweet dreams😊

@devwitheyob
#nights

If you want a full amazing course on FCM(Firebase Cloud Messaging) I recommend this it is for Next.js app

link 👉 here

@devwitheyob
#resources

I don't know that service workers run inside the browser separated from the web app that it created for, that's why it run even when we close the tab.

@devwitheyob
#JS #ServiceWorkers

Finally It is out😀

@devwitheyob

If I have to pay for an LLM I will definitely pay for Grok👌.

@devwitheyob

I had an interview today, and it actually went really well. The role is a backend-focused full-stack developer position.

We talked mainly about the projects I’ve worked on and my responsibilities, authentication and system design, architectural decisions, why I’m interested in the role, how I use Git and AI in my workflow, the tools we use when working as a team and how we collaborate, and what I expect from the internship.

@devwitheyob

Finally I got some time and deployed the backend of my portfolio so check it out guys, I really need your opinion on this one fam😊

eyobsimachew.vercel.app

@devwitheyob

I have been learning about B-Trees and LSM(Log structured Merge) Database types

B-trees are much faster for read but slower for writes. This is because they use a balanced tree data structure so they can quickly access data since trees has nlogn time complexity but when they write files they have to find a suitable place, they might need to split nodes if they're full, they need to update the root node pointers and also they might need to re-balance the whole tree tree. the main example of this design PostgreSQL, MySQL, MongoDB

When it comes to LSM Trees these trees are good for write, since they first write on a sorted in-memory data structure called a memtable when the buffer size is full they will flush it into the disk for permanent storage, but for reading they are slower, if it's not for some mechanism like (bloom filter, compaction) it would take much longer. The main example are RocksDB, Cassandra, InfluxDB

@devwitheyob
#Databases

Do you guys know, mobile money didn't start until Ride, they were the first to start it, it is just 10 years yet😮

@devwitheyob

መልካም ሰንበት my fam✨

@devwitheyob

well well sending my first proposal today

@devwitheyob
#upwork

This video will change how you see everything specially if you're science and physics enthusiast😮

here is the 👉 link

@deviwitheyob
#Vertasium #Physics

Do you guys know that we can access private methods of a class like this?

This basically works because JS doesn't have a runtime type system like other programming language like Java so if we can trick the Ts compiler JavaScript will allows us. since member access only exist in the compile time.

@devwitheyob
#snippets #tips

FYI: from now on .. we either use the Bad or the Worse

Good night fam, sweet dreams😊

@devwitheyob

Sometimes you realized you're not where u supposed to be😌

@devwitheyob
#lessons

Introducing AI-SDK for Rust

A provider-agnostic, open-source AI Toolkit inspired by Vercel's AI-SDK.

- Compile-time model safety
- Agents & tools
- Structured outputs
- Streaming & text generation
- Compatible with Vercel's AI-SDK UI (Next.js, Svelte, Solid)

Check it out

Github: https://github.com/lazy-hq/aisdk
Docs: https://aisdk.rs/

I’d love feedback from the community 😊