In any distributed system, logging is an important part as it allows for finding bugs, tracking how services are working and figuring out why things may fail. But the logger itself must be fast, thread-safe, and not block other parts/ add delay to your program. This article will go over different techniques you can use …
Implementing a High-Performance Logger in C++ for Distributed Applications Read More »
What is GC.TryStartNoGCRegion()? GC.TryStartNoGCRegion() is a method that attempts to prevent garbage collection from occurring during critical performance sections by pre-allocating enough memory to satisfy allocation requests. It’s designed for scenarios where you need predictable, low-latency performance and cannot tolerate GC pauses. The method reserves memory upfront and prevents collections until you call GC.EndNoGCRegion() or …
Optimizing Garbage Collection in .NET with GC.TryStartNoGCRegion() Read More »
What is Unsafe Code? Unsafe code in C# allows you to work directly with pointers and unmanaged memory, bypassing .NET’s memory safety guarantees. It enables operations like pointer arithmetic, direct memory access, and calling unmanaged functions. While it sacrifices safety for performance, it’s essential for scenarios requiring maximum speed, interop with native code, or low-level …
Using Unsafe Code in C# for Faster Memory Operations Read More »
What is IValueTaskSource? IValueTaskSource<T> is an interface that allows you to create custom awaitable types that can be pooled and reused, avoiding allocations associated with Task<T> objects. It’s the foundation for ValueTask<T>, which is a discriminated union that can represent either a completed synchronous result or an asynchronous Task<T>. This is particularly useful for high-performance …
Writing High-Performance Async Code with IValueTaskSource Read More »
What are ref Structs and readonly Structs? ref structs are value types that can only exist on the stack and cannot be boxed, stored in fields of reference types, or used as generic type arguments. They’re designed for high-performance scenarios where you want to avoid heap allocations entirely. readonly structs are immutable value types where …
How to Optimize C# Code with ref Structs and readonly Structs Read More »
What is Span<T> and Memory<T>? Span<T> and Memory<T> are value types introduced in .NET Core 2.1 that provide type-safe and memory-safe representation of a contiguous region of arbitrary memory. They enable zero-copy slicing of arrays, strings, and other memory buffers without allocating new objects on the heap. Span<T> is a stack-only type (ref struct) that …
Using Span and Memory for High-Performance Data Processing Read More »
A Minimum Spanning Tree (MST) is a subset of edges in a connected, weighted graph that connects all vertices without forming a cycle and with the minimum possible total edge weight. In this blog post, we implement Prim’s Algorithm using a min-heap (priority queue) to efficiently calculate the MST. Minimum Spanning Tree in C++ Using …
Minimum Spanning Tree in C++ Using Prim’s Algorithm with Priority Queue Read More »
In this Blog, we will learn how to create a stopwatch using Java with clear code. A stopwatch is used to measure the time. We will create a simple and easy stopwatch here. After this, you can build your console-based stopwatch in Java What is Stopwatch A Stopwatch is used to measure the amount of time …
How to Create a Stopwatch Using Java With Code and Explanation Read More »
In this Blog, we will learn how the camel case works in Java with a clear and understandable example. In Java, camel case is nothing but a Naming Convention . I know you are thinking about what is naming convention is, it is a set of rules used to name variables, methods, etc. Some rules …
Cycle detection in an undirected graph requires a slightly different approach. Since every edge connects both ways, we must carefully track visited nodes and their parents to avoid false positives. Detecting Cycles in an Undirected Graph using BFS Idea Perform a BFS from every unvisited node (to handle disconnected graphs). If a visited node is …
Detecting Cycles in an Undirected Graph using BFS Read More »