uint = unsigned integer, no negative numbers. Range is 0 to a very large positive number. var x int // -9,223,372,036,854,775,808 to +9,223,372,036,854,775,807 var x uint64 // 0 to 18,446,744,073,709,551,615 In a commit log specifically:
Let's understand this with log structure example. A commit log is just an append-only slice // at its heart, this is all a log is type Log struct { records []string } func (l *Log) Append(record string) { l.records = append(l.records, record) } func (l *Log) Read(index int) string
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. * Value semantics when you assign or pass to a function, the whole array is copied. * Rarely used directly in production
The 7 Layers of the OSI Model #LayerFunctionCommon Protocols / Tools7ApplicationWhere users and software interactHTTP, HTTPS, DNS, SSH, SMTP, FTP, SNMP, etc.6PresentationTranslates, encrypts, and formats dataSSL/TLS, MIME, JSON, ASCII, JPEG5SessionStarts, manages, and ends sessionsTCP session, NetBIOS, RPC4TransportEnsures data delivery (error checking, retransmission)TCP, UDP, SCTP3NetworkHandles routing and addressing between
Understanding Virtual 1D index → 2D coordinates: How does this formula work? row = index / n col = index % n Mapping 1D to 2D Imagine you have a bookshelf with 4 shelves (rows), and each shelf holds 3 books (columns). Shelf 0: [Book0] [Book1] [Book2] Shelf 1: [Book3] [Book4] [Book5] Shelf 2: [Book6]
I was solving the classic problem of calculating the widest binary tree level - essentially finding the maximum width of in the tree. I had doubts around how left and right indices of nodes is calulated because I thought we use the standard formulas for calculating indices: left := 2i + 1
Why nslookup works but ping says “Name or service not known”? Let’s get basic terminology straight up and it’s assumed you already understand how DNS resolution works. In my quest to understand how tools like nslookup and ping behave differently, I was honestly confused by the terms DNS
In my experience, I've revisited this topic multiple times and every single time, I’ve learned something new. So here’s a simple visual walkthrough for those who want to understand what really happens when you type a domain name into your browser. We’ll break this into
An entry from my journal, just some combined thoughts and reflections. Felt internet could read it. A life in India can only be fully understood when viewed through the lens of community. In this deeply religious land and more, lives are intertwined like threads in an intricate tapestry, with little
In Go, there are several ways to allocate and initialize memory. Pre-requisite: undertsand types in Go var Declaration When you declare a variable using var: var x int var s string var m map[string]int var sl []int * The variable is zero-valued (0 for numeric types, "" for
Primitive Types Primitive types (also called basic types) are the simplest, fundamental data types that aren't composed of other types: * Numeric types: * Integers: int, int8, int16, int32, int64, uint, uint8, etc. * Floating-point: float32, float64 * Complex: complex64, complex128 * Boolean type: bool * String type: string These types store their values
A concept that serves as both a negotiation tool and a practical decision-making framework, on efficiency of an algorithm that suits the needs of current problem. Big O just tells how slower my program is going to be as the input size increases. So technically, It doesn't dictate