Skip to main content

How does Angular's change detection mechanism work under the hood?

 Angular's change detection mechanism is one of the core features that keeps the application’s view (DOM) in sync with its underlying data model. It determines what changed and updates the view accordingly. Let’s dive into how it works under the hood, and how it has evolved—especially with Ivy

How does Angular's change detection mechanism work under the hood?

🔄 How Angular Change Detection Works

📌 1. The Core Idea

Angular uses a unidirectional data flow and a tree of components. Each time an event occurs (like a user input or a timer), Angular performs change detection to check if any data-bound properties in the component tree have changed—and updates the DOM accordingly.

🧠 Under the Hood: The Process

Step-by-step Overview:

  1. Triggering Change Detection
    Angular’s change detection is triggered by:

    • Browser events (click, input, etc.)

    • Timers (setTimeout, setInterval)

    • HTTP responses

    • Manual triggers (ChangeDetectorRef.detectChanges())

    This is usually wrapped by NgZone, which patches async APIs to automatically trigger a re-evaluation when the JS stack is clear.

  2. Component Tree Traversal
    Angular starts from the root component and traverses down the component tree, checking each component for data changes.

  3. Template Expressions Re-evaluated
    For each component:

    • Angular re-evaluates the bindings in the template (like {{title}}, [src], etc.).

    • If a new value is different from the previous one (using strict identity comparison ===), the DOM is updated.

  4. View Update
    The DOM is updated only if necessary, based on the latest data vs. previous values.

🧱 Change Detection Strategies

🔁 1. Default

  • Angular checks every component on every change detection cycle.

  • Good for simplicity, but can be inefficient in large apps.

🧩 2. OnPush

  • Angular checks a component only if:

    • An @Input() reference has changed.

    • You call markForCheck() manually.

  • Great for performance in well-structured apps.

🌿 Ivy vs. View Engine in Change Detection

With Ivy:

  • Change detection is more granular and efficient.

  • Ivy uses template instructions (like Δɵtext, Δɵelement) during compilation to optimize DOM updates.

  • It does per-component change detection, reducing unnecessary checks.

🛠️ Optimizations You Can Do

  1. Use OnPush change detection in performance-critical components.

  2. Avoid mutating objects/arrays directly—use new references so Angular can detect changes.

  3. Detach change detection with ChangeDetectorRef.detach() for parts of the UI that rarely change.

  4. Use trackBy in *ngFor to prevent unnecessary DOM manipulation.

📊 Visual Summary

Angular Change Detection Flow:

arduino
User Event / Async Task ↓ NgZone triggers ↓ Angular starts change detection ↓ Traverses component tree ↓ Checks template bindings ↓ Updates DOM if needed

✅ Final Thoughts

Angular’s change detection is powerful and efficient—especially with Ivy. It minimizes manual DOM manipulation and keeps your view in sync with your data model. Understanding how it works lets you make smarter decisions for performance and architecture.

Popular posts from this blog

How does BGP prevent routing loops? Explain AS_PATH and loop prevention mechanisms.

 In Border Gateway Protocol (BGP), preventing routing loops is critical — especially because BGP is the inter-domain routing protocol used to connect Autonomous Systems (ASes) on the internet. 🔄 How BGP Prevents Routing Loops The main mechanism BGP uses is the AS_PATH attribute . 🔍 What is AS_PATH? AS_PATH is a BGP path attribute that lists the sequence of Autonomous Systems (AS numbers) a route has traversed. Each time a route is advertised across an AS boundary, the local AS number is prepended to the AS_PATH. Example: If AS 65001 → AS 65002 → AS 65003 is the route a prefix has taken, the AS_PATH will look like: makefile AS_PATH: 65003 65002 65001 It’s prepended in reverse order — so the last AS is first . 🚫 Loop Prevention Using AS_PATH ✅ Core Mechanism: BGP routers reject any route advertisement that contains their own AS number in the AS_PATH. 🔁 Why It Works: If a route makes its way back to an AS that’s already in the AS_PATH , that AS kno...

What’s the impact of BGP full routes on router memory and performance?

Receiving full BGP routes (i.e., the full global BGP routing table) has a significant impact on a router's memory and performance. Here's a breakdown of the key impacts: 🔧 1. Memory Usage (RAM) A full BGP table typically contains ~1 million IPv4 routes and growing (~200k+ IPv6 routes). Each BGP route consumes tens to hundreds of bytes of memory, depending on attributes (AS path, communities, etc.). This translates to hundreds of megabytes to several gigabytes of RAM just for storing the BGP RIB (Routing Information Base). The FIB (Forwarding Information Base) , which is installed into the router's hardware or kernel for actual packet forwarding, also consumes memory (especially in TCAM for hardware routers). ❗ Example A router might require 4–8 GB of RAM (or more) to comfortably handle full BGP routes with headroom for growth and stability. 🧠 2. CPU Utilization High CPU load during: Initial BGP session establishment (parsing all rout...

Explain the OSPF LSDB (Link State Database) and how SPF (Shortest Path First) algorithm works.

OSPF (Open Shortest Path First) is a link-state routing protocol , and the LSDB (Link-State Database) and SPF (Shortest Path First) algorithm are core to how OSPF calculates the best paths . Let’s break them down. 🧠 What is the OSPF LSDB (Link-State Database)? The LSDB is a map of the entire OSPF network area — each router stores a complete topology of its area. 🔍 Details: Built from LSAs (Link-State Advertisements) exchanged between routers. Contains info about: Routers and their interfaces Network segments Neighbor relationships Each OSPF router maintains an identical LSDB within the same area. ✅ Key Characteristics: Feature Description Scope One LSDB per OSPF area Source Built from received LSAs Consistency All routers in an area have identical LSDBs Purpose Used as input for SPF algorithm to calculate best paths ⚙️ How the SPF Algorithm Works in OSPF OSPF uses Dijkstra’s Shortest Path First (SPF) algorithm to compute the shortest (lowest-cost)...