Code Coverage Statistics for Source File
Newtonsoft.Json\Utilities\BidirectionalDictionary.cs
Symbol Coverage: 80.00% (12 of 15)
Branch Coverage: 66.67% (6 of 9)
Cyclomatic Complexity Avg: 1.40 Max:3
Code Lines: 16
Symbol Coverage Trend
View:
L | V | Source |
---|---|---|
1 |
#region License |
|
2 |
// Copyright (c) 2007 James Newton-King |
|
3 |
// |
|
4 |
// Permission is hereby granted, free of charge, to any person |
|
5 |
// obtaining a copy of this software and associated documentation |
|
6 |
// files (the "Software"), to deal in the Software without |
|
7 |
// restriction, including without limitation the rights to use, |
|
8 |
// copy, modify, merge, publish, distribute, sublicense, and/or sell |
|
9 |
// copies of the Software, and to permit persons to whom the |
|
10 |
// Software is furnished to do so, subject to the following |
|
11 |
// conditions: |
|
12 |
// |
|
13 |
// The above copyright notice and this permission notice shall be |
|
14 |
// included in all copies or substantial portions of the Software. |
|
15 |
// |
|
16 |
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
|
17 |
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES |
|
18 |
// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |
|
19 |
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT |
|
20 |
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |
|
21 |
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |
|
22 |
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR |
|
23 |
// OTHER DEALINGS IN THE SOFTWARE. |
|
24 |
#endregion |
|
25 |
||
26 |
using System; |
|
27 |
using System.Collections.Generic; |
|
28 |
using System.Linq; |
|
29 |
using System.Text; |
|
30 |
||
31 |
namespace Newtonsoft.Json.Utilities |
|
32 |
{ |
|
33 |
internal class BidirectionalDictionary<TFirst, TSecond> |
|
34 |
{ |
|
35 |
private readonly IDictionary<TFirst, TSecond> _firstToSecond; |
|
36 |
private readonly IDictionary<TSecond, TFirst> _secondToFirst; |
|
37 |
||
38 |
0 |
public BidirectionalDictionary()
|
39 |
0 |
: this(EqualityComparer<TFirst>.Default, EqualityComparer<TSecond>.Default)
|
40 |
{ |
|
41 |
0 |
}
|
42 |
||
43 |
28 |
public BidirectionalDictionary(IEqualityComparer<TFirst> firstEqualityComparer, IEqualityComparer<TSecond> secondEqualityComparer)
|
44 |
{ |
|
45 |
28 |
_firstToSecond = new Dictionary<TFirst, TSecond>(firstEqualityComparer);
|
46 |
28 |
_secondToFirst = new Dictionary<TSecond, TFirst>(secondEqualityComparer);
|
47 |
28 |
}
|
48 |
||
49 |
public void Add(TFirst first, TSecond second) |
|
50 |
{ |
|
51 |
65 |
if (_firstToSecond.ContainsKey(first) || _secondToFirst.ContainsKey(second))
|
52 |
{ |
|
53 |
0 |
throw new ArgumentException("Duplicate first or second");
|
54 |
} |
|
55 |
65 |
_firstToSecond.Add(first, second);
|
56 |
65 |
_secondToFirst.Add(second, first);
|
57 |
65 |
}
|
58 |
||
59 |
public bool TryGetByFirst(TFirst first, out TSecond second) |
|
60 |
{ |
|
61 |
12 |
return _firstToSecond.TryGetValue(first, out second);
|
62 |
12 |
}
|
63 |
||
64 |
public bool TryGetBySecond(TSecond second, out TFirst first) |
|
65 |
{ |
|
66 |
84 |
return _secondToFirst.TryGetValue(second, out first);
|
67 |
84 |
}
|
68 |
} |
|
69 |
} |