Înapoi la articole →

Cel mai recent articol

Ultima verificare

Urmăritori 0 urmăritori
Articole: 15
  1. This post is a response to a writing prompt from Underline Center: "Write about an album that got you through a hard time."

  2. Part of the Building the Log Package series How I thought through the log package design before writing any code When I was working through the store object, the whole idea was clear enough when bytes are given, append and when a position is given, read.

  3. Part of the Building the Log Package series How I thought through the log package design before writing any code The five layers of the log package are easiest to understand by tracing one record through all of them.

  4. 📖 Distributed Services with Go by Travis Jeffery; Chapter 3.

  5. The cost of a syscall

    Part of the Building the Log Package series How I thought through the log package design before writing any code Syscalls are not free they involve a context switch from user space to kernel space.

  6. Compiler?

    ℹ️ in reference to what makes protobuf faster?.

  7. 📖 Distributed Services with Go by Travis Jeffery: swaps JSON for Protocol Buffers.

  8. 📖 Chapter 1 summary of pragprog.com/titles/tjgo/distributed-services-with-go/ The correlation when building anything Every server you ever build has exactly three layers: LAYER 1 DATA "what do I store and how?"

  9. uint64 what and why

    uint = unsigned integer, no negative numbers.

  10. Let's understand this with log structure example.

  11. Array: fixed, value type arr := [3]int{10, 20, 30} // size is part of the type Fixed size, decided at compile time. [3]int and [4]int are different types.

  12. The 7 Layers of the OSI Model # Layer Function Common Protocols / Tools 7 Application Where users and software interact HTTP, HTTPS, DNS, SSH, SMTP, FTP, SNMP, etc. 6 Presentation Translates, encrypts, and formats data SSL/TLS, MIME, JSON, ASCII, JPEG 5 S…

  13. Understanding Virtual 1D index → 2D coordinates: How does this formula work?

  14. I was solving the classic problem of calculating the widest binary tree level - essentially finding the maximum width of in the tree.

  15. ping vs nslookup?

    Why nslookup works but ping says “Name or service not known”?