JavaScript Interview Questions
  • JavaScript Interview Questions
  • Contact
  • Introduction
  • Question 1
  • Question 2
  • Question 3
  • Question 4
  • Question 5
  • Question 6
  • Question 7
  • Question 8
  • Question 9
  • Question 10
  • Question 11
  • Question 12
  • Question 13
  • Question 14
  • Question 15
  • Question 16
  • Question 17
  • Question 18
  • Question 19
  • Question 20
  • Question 21
  • Question 22
  • Question 23
  • Question 24
  • Question 25
  • Question 26
  • Question 27
  • Question 28
  • Question 29
  • Question 30
  • Question 31
  • Question 32
  • Question 33
  • Question 34
  • Question 35
  • Question 36
  • Question 37
  • Question 38
  • Question 39
  • Question 40
  • Question 41
  • Question 42
  • Question 43
  • Question 44
  • Question 45
  • Question 46
  • Question 47
  • Question 48
  • Question 49
  • Question 50
  • Question 51
  • Question 52
  • Question 53
  • Question 54
  • Question 55
  • Question 56
  • Question 57
  • Question 58
  • Question 59
  • Question 60
  • Question 61
  • Question 62
  • Question 63
  • Question 64
  • Question 65
  • Question 66
  • Question 67
  • Question 68
  • Question 69
  • Question 70
  • Question 71
  • Question 72
  • Question 73
  • Question 74
  • Question 75
  • Question 76
  • Question 77
  • Question 78
  • Question 79
  • Question 80
  • Question 81
  • Question 82
  • Question 83
  • Question 84
  • Question 85
  • Question 86
  • Question 87
  • Question 88
  • Question 89
  • Question 90
  • Question 91
  • Question 92
  • Question 93
  • Question 94
  • Question 95
  • Question 96
  • Question 97
  • Question 98
  • Question 99
  • Question 100
  • Epilogue
Powered by GitBook
On this page
  • Question
  • Answer

Question 53

Question

How would you create an interdependent object graph using WeakMap and WeakSet?

Answer

Here's how you can build an interdependent object graph leveraging the strengths of WeakMap and WeakSet:

Core Concepts:

  • Object Relationships: We'll define relationships between objects (e.g., "owns," "references") using WeakMap to store these connections.

  • Weak References for Safety: Employ WeakMap and WeakSet throughout to ensure that if an object is no longer referenced elsewhere, it gets garbage collected without causing circular dependencies or memory leaks.

Example: Representing a Simple Social Network

class Person {
  constructor(name) {
    this.name = name;
    this._relationships = new WeakMap(); // Store relationships (e.g., 'friendsWith')
  }

  addFriend(friend) {
    this._relationships.set('friendsWith', friend);
    friend._relationships.set('knows', this); 
  }
}

const john = new Person('John');
const jane = new Person('Jane');
john.addFriend(jane);

// Now, 'john' and 'jane' have a relationship via their _relationships WeakMaps.

Explanation:

  1. Person Class: Each Person object has:

    • A name.

    • A private _relationships WeakMap to store its connections (friendships).

  2. addFriend() Method:

    • Sets a 'friendsWith' relationship from one person (this) to the friend using _relationships.set().

    • Does the same for the reverse direction ('knows') on the friend object, establishing a bidirectional connection.

  3. Weak References: The use of WeakMap ensures that:

    • If a Person object is no longer referenced by anything else (e.g., removed from memory), its _relationships will automatically be cleared, breaking the connection and allowing for garbage collection.

Additional Considerations:

  • Traversing Relationships: You can iterate through relationships using for...of loops or manually checking _relationships for keys like 'friendsWith'.

  • Complex Graphs: For more intricate graphs with various relationship types, consider using a custom class to represent connections (e.g., Relationship with properties for type and objects).

PreviousQuestion 52NextQuestion 54

Last updated 9 months ago