chore: add GlobalUsings.cs with project-wide using directives in data structures

KaranChadha10 · KaranChadha10 · commit 282fb7a60132 · 2025-09-08T22:36:08.000+05:30
diff --git a/DataStructures/AATree/AATree.cs b/DataStructures/AATree/AATree.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.AATree;
 
 /// <summary>
diff --git a/DataStructures/AVLTree/AVLTree.cs b/DataStructures/AVLTree/AVLTree.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.AVLTree;
 
 /// <summary>
diff --git a/DataStructures/AVLTree/AVLTreeNode.cs b/DataStructures/AVLTree/AVLTreeNode.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.AVLTree;
 
 /// <summary>
diff --git a/DataStructures/BinarySearchTree/BinarySearchTree.cs b/DataStructures/BinarySearchTree/BinarySearchTree.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.BinarySearchTree;
 
 /// <summary>
diff --git a/DataStructures/BitArray.cs b/DataStructures/BitArray.cs
@@ -114,11 +114,7 @@
 // returns true if there inputs aren't equal otherwise false.
 // assumes: the input bit-arrays must have same length.
 
-using System;
 using System.Collections;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
 
 namespace DataStructures;
 
diff --git a/DataStructures/Cache/LfuCache.cs b/DataStructures/Cache/LfuCache.cs
@@ -1,5 +1,3 @@
-using System.Collections.Generic;
-
 namespace DataStructures.Cache;
 
 /// <summary>
diff --git a/DataStructures/Cache/LruCache.cs b/DataStructures/Cache/LruCache.cs
@@ -1,5 +1,3 @@
-using System.Collections.Generic;
-
 namespace DataStructures.Cache;
 
 /// <summary>
diff --git a/DataStructures/GlobalUsings.cs b/DataStructures/GlobalUsings.cs
@@ -0,0 +1,16 @@
+// -----------------------------------------------------------------------------
+// Global using directives for the C-Sharp solution.
+// These namespaces are imported globally so they don’t need to be repeatedly declared
+// in individual files, improving readability and reducing boilerplate.
+//
+// Guidelines:
+// - Keep only the most commonly used namespaces here.
+// - Add project-specific namespaces (e.g., Utilities.Extensions) only if they are
+//   required across the majority of files in the project.
+// - Avoid placing rarely used namespaces here to maintain clarity.
+// -----------------------------------------------------------------------------
+
+global using System;                        // Core base classes and fundamental types
+global using System.Collections.Generic;    // Generic collection types (List, Dictionary, etc.)
+global using System.Linq;                   // LINQ query operators for collections
+global using System.Text;                   // Text encoding, StringBuilder, etc.
diff --git a/DataStructures/Graph/DirectedWeightedGraph.cs b/DataStructures/Graph/DirectedWeightedGraph.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.Graph;
 
 /// <summary>
diff --git a/DataStructures/Graph/IDirectedWeightedGraph.cs b/DataStructures/Graph/IDirectedWeightedGraph.cs
@@ -1,5 +1,3 @@
-using System.Collections.Generic;
-
 namespace DataStructures.Graph;
 
 public interface IDirectedWeightedGraph<T>
diff --git a/DataStructures/Hashing/HashTable.cs b/DataStructures/Hashing/HashTable.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
 using DataStructures.Hashing.NumberTheory;
 
 namespace DataStructures.Hashing;
diff --git a/DataStructures/Heap/BinaryHeap.cs b/DataStructures/Heap/BinaryHeap.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.Heap;
 
 /// <summary>
diff --git a/DataStructures/Heap/FibonacciHeap/FHeapNode.cs b/DataStructures/Heap/FibonacciHeap/FHeapNode.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.Heap.FibonacciHeap;
 
 /// <summary>
diff --git a/DataStructures/Heap/FibonacciHeap/FibonacciHeap.cs b/DataStructures/Heap/FibonacciHeap/FibonacciHeap.cs
@@ -1,7 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-
 namespace DataStructures.Heap.FibonacciHeap;
 
 /// <summary>
diff --git a/DataStructures/Heap/MinMaxHeap.cs b/DataStructures/Heap/MinMaxHeap.cs
@@ -1,7 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-
 namespace DataStructures.Heap;
 
 /// <summary>
diff --git a/DataStructures/Heap/PairingHeap/PairingHeap.cs b/DataStructures/Heap/PairingHeap/PairingHeap.cs
@@ -1,7 +1,4 @@
-using System;
 using System.Collections;
-using System.Collections.Generic;
-using System.Linq;
 
 namespace DataStructures.Heap.PairingHeap;
 
@@ -57,7 +54,7 @@ public T Extract()
     /// </summary>
     public void UpdateKey(T currentValue, T newValue)
     {
-        if(!mapping.ContainsKey(currentValue))
+        if (!mapping.ContainsKey(currentValue))
         {
             throw new ArgumentException("Current value is not present in this heap.");
         }
diff --git a/DataStructures/Heap/PairingHeap/PairingNodeComparer.cs b/DataStructures/Heap/PairingHeap/PairingNodeComparer.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.Heap.PairingHeap;
 
 /// <summary>
diff --git a/DataStructures/InvertedIndex.cs b/DataStructures/InvertedIndex.cs
@@ -1,6 +1,3 @@
-using System.Collections.Generic;
-using System.Linq;
-
 namespace DataStructures;
 
 /// <summary>
diff --git a/DataStructures/LinkedList/CircularLinkedList/CircularLinkedList.cs b/DataStructures/LinkedList/CircularLinkedList/CircularLinkedList.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.LinkedList.CircularLinkedList
 {
     /// <summary>
diff --git a/DataStructures/LinkedList/DoublyLinkedList/DoublyLinkedList.cs b/DataStructures/LinkedList/DoublyLinkedList/DoublyLinkedList.cs
@@ -1,5 +1,3 @@
-using System;
-using System.Collections.Generic;
 using Utilities.Exceptions;
 
 namespace DataStructures.LinkedList.DoublyLinkedList;
diff --git a/DataStructures/LinkedList/SinglyLinkedList/SinglyLinkedList.cs b/DataStructures/LinkedList/SinglyLinkedList/SinglyLinkedList.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.LinkedList.SinglyLinkedList;
 
 public class SinglyLinkedList<T>
@@ -161,7 +158,7 @@ public bool DeleteElement(T element)
     public bool DeleteFirst()
     {
         // checks if the List is empty
-        if(Head is null)
+        if (Head is null)
         {
             return false;
         }
@@ -178,21 +175,21 @@ public bool DeleteFirst()
     public bool DeleteLast()
     {
         // checks if the List is empty
-        if(Head is null)
+        if (Head is null)
         {
             return false;
         }
 
         // checks if the List has only one element
-        if(Head.Next is null)
+        if (Head.Next is null)
         {
             Head = null;
             return true;
         }
 
         // if not, iterates through the list to the second last element and deletes the last one
         SinglyLinkedListNode<T>? secondlast = Head;
-        while(secondlast.Next?.Next is not null)
+        while (secondlast.Next?.Next is not null)
         {
             secondlast = secondlast.Next;
         }
diff --git a/DataStructures/LinkedList/SkipList/SkipList.cs b/DataStructures/LinkedList/SkipList/SkipList.cs
@@ -1,7 +1,4 @@
-using System;
-using System.Collections.Generic;
 using System.Diagnostics;
-using System.Linq;
 
 namespace DataStructures.LinkedList.SkipList;
 
@@ -49,7 +46,7 @@ public SkipList(int capacity = 255)
         head = new(int.MinValue, default(TValue), maxLevels);
         tail = new(int.MaxValue, default(TValue), maxLevels);
 
-        for(int i = 0; i < maxLevels; i++)
+        for (int i = 0; i < maxLevels; i++)
         {
             head.Next[i] = tail;
         }
@@ -69,7 +66,7 @@ public TValue this[int key]
         get
         {
             var previousNode = GetSkipNodes(key).First();
-            if(previousNode.Next[0].Key == key)
+            if (previousNode.Next[0].Key == key)
             {
                 return previousNode.Next[0].Value!;
             }
diff --git a/DataStructures/Probabilistic/BloomFilter.cs b/DataStructures/Probabilistic/BloomFilter.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.Probabilistic;
 
 public class BloomFilter<T> where T : notnull
diff --git a/DataStructures/Probabilistic/CountMinSketch.cs b/DataStructures/Probabilistic/CountMinSketch.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.Probabilistic;
 
 public class CountMinSketch<T> where T : notnull
diff --git a/DataStructures/Probabilistic/HyperLogLog.cs b/DataStructures/Probabilistic/HyperLogLog.cs
@@ -1,7 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-
 namespace DataStructures.Probabilistic;
 
 public class HyperLogLog<T> where T : notnull
diff --git a/DataStructures/Queue/ArrayBasedQueue.cs b/DataStructures/Queue/ArrayBasedQueue.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.Queue;
 
 /// <summary>
diff --git a/DataStructures/Queue/ListBasedQueue.cs b/DataStructures/Queue/ListBasedQueue.cs
@@ -1,7 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-
 namespace DataStructures.Queue;
 
 /// <summary>
diff --git a/DataStructures/Queue/StackBasedQueue.cs b/DataStructures/Queue/StackBasedQueue.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.Queue;
 
 /// <summary>
diff --git a/DataStructures/RedBlackTree/RedBlackTree.cs b/DataStructures/RedBlackTree/RedBlackTree.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.RedBlackTree;
 
 /// <summary>
@@ -101,7 +98,7 @@ public void Add(TKey key)
         {
             addCase = GetAddCase(node);
 
-            switch(addCase)
+            switch (addCase)
             {
                 case 1:
                     break;
diff --git a/DataStructures/ScapegoatTree/Extensions.cs b/DataStructures/ScapegoatTree/Extensions.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.ScapegoatTree;
 
 public static class Extensions
diff --git a/DataStructures/ScapegoatTree/Node.cs b/DataStructures/ScapegoatTree/Node.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.ScapegoatTree;
 
 /// <summary>
diff --git a/DataStructures/ScapegoatTree/ScapegoatTree.cs b/DataStructures/ScapegoatTree/ScapegoatTree.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.ScapegoatTree;
 
 /// <summary>
diff --git a/DataStructures/SegmentTrees/SegmentTree.cs b/DataStructures/SegmentTrees/SegmentTree.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.SegmentTrees;
 
 /// <summary>
diff --git a/DataStructures/SegmentTrees/SegmentTreeApply.cs b/DataStructures/SegmentTrees/SegmentTreeApply.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.SegmentTrees;
 
 /// <summary>
diff --git a/DataStructures/SortedList.cs b/DataStructures/SortedList.cs
@@ -1,5 +1,4 @@
 using System.Collections;
-using System.Collections.Generic;
 
 namespace DataStructures;
 
diff --git a/DataStructures/Stack/ArrayBasedStack.cs b/DataStructures/Stack/ArrayBasedStack.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.Stack;
 
 /// <summary>
diff --git a/DataStructures/Stack/ListBasedStack.cs b/DataStructures/Stack/ListBasedStack.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.Stack;
 
 /// <summary>
diff --git a/DataStructures/Stack/QueueBasedStack.cs b/DataStructures/Stack/QueueBasedStack.cs
@@ -1,9 +1,3 @@
-using System;
-using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
-
 namespace DataStructures.Stack;
 
 public class QueueBasedStack<T>
diff --git a/DataStructures/Timeline.cs b/DataStructures/Timeline.cs
@@ -12,10 +12,7 @@ this data structure can be used to represent an ordered series of dates or times
             330: Constantine move the capital to Constantinople.
 */
 
-using System;
 using System.Collections;
-using System.Collections.Generic;
-using System.Linq;
 
 namespace DataStructures;
 
diff --git a/DataStructures/Tries/Trie.cs b/DataStructures/Tries/Trie.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.Tries;
 
 /// <summary>
@@ -70,10 +67,10 @@ public void Remove(string s)
         s += Mark;
         int index = 0;
         TrieNode match = PrefixQuery(s, ref index);
-        while(match.IsLeaf())
+        while (match.IsLeaf())
         {
             char c = match.Value;
-            if(match.Parent == null)
+            if (match.Parent == null)
             {
                 break;
             }
diff --git a/DataStructures/Tries/TrieNode.cs b/DataStructures/Tries/TrieNode.cs
@@ -1,6 +1,3 @@
-using System;
-using System.Collections.Generic;
-
 namespace DataStructures.Tries;
 
 /// <summary>
diff --git a/DataStructures/UnrolledList/UnrolledLinkedList.cs b/DataStructures/UnrolledList/UnrolledLinkedList.cs
@@ -1,5 +1,3 @@
-using System.Collections.Generic;
-
 namespace DataStructures.UnrolledList;
 
 /// <summary>
diff --git a/DataStructures/UnrolledList/UnrolledLinkedListNode.cs b/DataStructures/UnrolledList/UnrolledLinkedListNode.cs
@@ -1,5 +1,3 @@
-using System;
-
 namespace DataStructures.UnrolledList;
 
 /// <summary>

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,3 @@`
`1`		`-using System;`
`2`		`-`
`3`	`1`	`namespace DataStructures.AVLTree;`
`4`	`2`
`5`	`3`	`/// <summary>`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,3 @@`
`1`		`-using System.Collections.Generic;`
`2`		`-`
`3`	`1`	`namespace DataStructures.Cache;`
`4`	`2`
`5`	`3`	`/// <summary>`
Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,3 @@`
`1`		`-using System.Collections.Generic;`
`2`		`-`
`3`	`1`	`namespace DataStructures.Graph;`
`4`	`2`
`5`	`3`	`public interface IDirectedWeightedGraph<T>`