diff options
| author | Berkan Diler <berkan.diler1@ingka.ikea.com> | 2022-12-27 20:27:11 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-12-27 20:27:11 +0100 |
| commit | 0d3b82477ecbf7128340b6725a79413427c68748 (patch) | |
| tree | 2d62c68e38a3c4c79ef7cc1d92700617a40e70ca /Ryujinx.Common/Collections | |
| parent | 470be03c2ff22346a1f0ae53fa25f53c4d1790b5 (diff) | |
Use new ArgumentNullException and ObjectDisposedException throw-helper API (#4163)
Diffstat (limited to 'Ryujinx.Common/Collections')
| -rw-r--r-- | Ryujinx.Common/Collections/IntervalTree.cs | 49 | ||||
| -rw-r--r-- | Ryujinx.Common/Collections/IntrusiveRedBlackTree.cs | 16 | ||||
| -rw-r--r-- | Ryujinx.Common/Collections/IntrusiveRedBlackTreeImpl.cs | 6 | ||||
| -rw-r--r-- | Ryujinx.Common/Collections/TreeDictionary.cs | 55 |
4 files changed, 31 insertions, 95 deletions
diff --git a/Ryujinx.Common/Collections/IntervalTree.cs b/Ryujinx.Common/Collections/IntervalTree.cs index c829caba..b5188cc7 100644 --- a/Ryujinx.Common/Collections/IntervalTree.cs +++ b/Ryujinx.Common/Collections/IntervalTree.cs @@ -24,10 +24,7 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="key"/> is null</exception> public int Get(K key, ref V[] overlaps) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); IntervalTreeNode<K, V> node = GetNode(key); @@ -61,15 +58,8 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="start"/> or <paramref name="end"/> is null</exception> public int Get(K start, K end, ref V[] overlaps, int overlapCount = 0) { - if (start == null) - { - throw new ArgumentNullException(nameof(start)); - } - - if (end == null) - { - throw new ArgumentNullException(nameof(end)); - } + ArgumentNullException.ThrowIfNull(start); + ArgumentNullException.ThrowIfNull(end); GetValues(Root, start, end, ref overlaps, ref overlapCount); @@ -85,20 +75,9 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="start"/>, <paramref name="end"/> or <paramref name="value"/> are null</exception> public void Add(K start, K end, V value) { - if (start == null) - { - throw new ArgumentNullException(nameof(start)); - } - - if (end == null) - { - throw new ArgumentNullException(nameof(end)); - } - - if (value == null) - { - throw new ArgumentNullException(nameof(value)); - } + ArgumentNullException.ThrowIfNull(start); + ArgumentNullException.ThrowIfNull(end); + ArgumentNullException.ThrowIfNull(value); Insert(start, end, value); } @@ -112,10 +91,7 @@ namespace Ryujinx.Common.Collections /// <returns>Number of deleted values</returns> public int Remove(K key, V value) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); int removed = Delete(key, value); @@ -168,10 +144,7 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="key"/> is null</exception> private IntervalTreeNode<K, V> GetNode(K key) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); IntervalTreeNode<K, V> node = Root; while (node != null) @@ -462,10 +435,8 @@ namespace Ryujinx.Common.Collections public bool ContainsKey(K key) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); + return GetNode(key) != null; } } diff --git a/Ryujinx.Common/Collections/IntrusiveRedBlackTree.cs b/Ryujinx.Common/Collections/IntrusiveRedBlackTree.cs index 970cab87..0063d91e 100644 --- a/Ryujinx.Common/Collections/IntrusiveRedBlackTree.cs +++ b/Ryujinx.Common/Collections/IntrusiveRedBlackTree.cs @@ -17,10 +17,7 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="node"/> is null</exception> public void Add(T node) { - if (node == null) - { - throw new ArgumentNullException(nameof(node)); - } + ArgumentNullException.ThrowIfNull(node); Insert(node); } @@ -32,10 +29,8 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="node"/> is null</exception> public void Remove(T node) { - if (node == null) - { - throw new ArgumentNullException(nameof(node)); - } + ArgumentNullException.ThrowIfNull(node); + if (Delete(node) != null) { Count--; @@ -50,10 +45,7 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="searchNode"/> is null</exception> public T GetNode(T searchNode) { - if (searchNode == null) - { - throw new ArgumentNullException(nameof(searchNode)); - } + ArgumentNullException.ThrowIfNull(searchNode); T node = Root; while (node != null) diff --git a/Ryujinx.Common/Collections/IntrusiveRedBlackTreeImpl.cs b/Ryujinx.Common/Collections/IntrusiveRedBlackTreeImpl.cs index 267aeec3..bcb2e2a2 100644 --- a/Ryujinx.Common/Collections/IntrusiveRedBlackTreeImpl.cs +++ b/Ryujinx.Common/Collections/IntrusiveRedBlackTreeImpl.cs @@ -92,10 +92,8 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="node"/> is null</exception> protected static T Minimum(T node) { - if (node == null) - { - throw new ArgumentNullException(nameof(node)); - } + ArgumentNullException.ThrowIfNull(node); + T tmp = node; while (tmp.Left != null) { diff --git a/Ryujinx.Common/Collections/TreeDictionary.cs b/Ryujinx.Common/Collections/TreeDictionary.cs index a5a3b818..d118a30c 100644 --- a/Ryujinx.Common/Collections/TreeDictionary.cs +++ b/Ryujinx.Common/Collections/TreeDictionary.cs @@ -22,10 +22,7 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="key"/> is null</exception> public V Get(K key) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); Node<K, V> node = GetNode(key); @@ -47,14 +44,8 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="key"/> or <paramref name="value"/> are null</exception> public void Add(K key, V value) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } - if (value == null) - { - throw new ArgumentNullException(nameof(value)); - } + ArgumentNullException.ThrowIfNull(key); + ArgumentNullException.ThrowIfNull(value); Insert(key, value); } @@ -66,10 +57,8 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="key"/> is null</exception> public void Remove(K key) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); + if (Delete(key) != null) { Count--; @@ -217,10 +206,7 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="key"/> is null</exception> private Node<K, V> GetNode(K key) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); Node<K, V> node = Root; while (node != null) @@ -370,10 +356,8 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="key"/> is null</exception> private Node<K, V> FloorNode(K key) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); + Node<K, V> tmp = Root; while (tmp != null) @@ -424,10 +408,8 @@ namespace Ryujinx.Common.Collections /// <exception cref="ArgumentNullException"><paramref name="key"/> is null</exception> private Node<K, V> CeilingNode(K key) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); + Node<K, V> tmp = Root; while (tmp != null) @@ -477,10 +459,8 @@ namespace Ryujinx.Common.Collections // Method descriptions are not provided as they are already included as part of the interface. public bool ContainsKey(K key) { - if (key == null) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); + return GetNode(key) != null; } @@ -493,10 +473,8 @@ namespace Ryujinx.Common.Collections public bool TryGetValue(K key, [MaybeNullWhen(false)] out V value) { - if (null == key) - { - throw new ArgumentNullException(nameof(key)); - } + ArgumentNullException.ThrowIfNull(key); + Node<K, V> node = GetNode(key); value = node != null ? node.Value : default; return node != null; @@ -504,10 +482,7 @@ namespace Ryujinx.Common.Collections public void Add(KeyValuePair<K, V> item) { - if (item.Key == null) - { - throw new ArgumentNullException(nameof(item.Key)); - } + ArgumentNullException.ThrowIfNull(item.Key); Add(item.Key, item.Value); } |
