AbstractMap.cs 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151
  1. using System;
  2. using System.Collections;
  3. using System.Collections.Generic;
  4. using System.Linq;
  5. namespace SharpCifs.Util.Sharpen
  6. {
  7. public abstract class AbstractMap<T, TU> : IDictionary<T, TU>
  8. {
  9. public virtual void Clear ()
  10. {
  11. EntrySet ().Clear ();
  12. }
  13. public virtual bool ContainsKey (object name)
  14. {
  15. return EntrySet ().Any (p => p.Key.Equals ((T)name));
  16. }
  17. public abstract ICollection<KeyValuePair<T, TU>> EntrySet ();
  18. public virtual TU Get (object key)
  19. {
  20. return EntrySet ().Where (p => p.Key.Equals (key)).Select (p => p.Value).FirstOrDefault ();
  21. }
  22. protected virtual IEnumerator<KeyValuePair<T, TU>> InternalGetEnumerator ()
  23. {
  24. return EntrySet ().GetEnumerator ();
  25. }
  26. public virtual bool IsEmpty ()
  27. {
  28. return !EntrySet ().Any ();
  29. }
  30. public virtual TU Put (T key, TU value)
  31. {
  32. throw new NotSupportedException ();
  33. }
  34. public virtual TU Remove (object key)
  35. {
  36. Iterator<TU> iterator = EntrySet () as Iterator<TU>;
  37. if (iterator == null) {
  38. throw new NotSupportedException ();
  39. }
  40. while (iterator.HasNext ()) {
  41. TU local = iterator.Next ();
  42. if (local.Equals ((T)key)) {
  43. iterator.Remove ();
  44. return local;
  45. }
  46. }
  47. return default(TU);
  48. }
  49. void ICollection<KeyValuePair<T, TU>>.Add (KeyValuePair<T, TU> item)
  50. {
  51. Put (item.Key, item.Value);
  52. }
  53. bool ICollection<KeyValuePair<T, TU>>.Contains (KeyValuePair<T, TU> item)
  54. {
  55. throw new NotImplementedException ();
  56. }
  57. void ICollection<KeyValuePair<T, TU>>.CopyTo (KeyValuePair<T, TU>[] array, int arrayIndex)
  58. {
  59. EntrySet ().CopyTo (array, arrayIndex);
  60. }
  61. bool ICollection<KeyValuePair<T, TU>>.Remove (KeyValuePair<T, TU> item)
  62. {
  63. Remove (item.Key);
  64. return true;
  65. }
  66. void IDictionary<T, TU>.Add (T key, TU value)
  67. {
  68. Put (key, value);
  69. }
  70. bool IDictionary<T, TU>.ContainsKey (T key)
  71. {
  72. return ContainsKey (key);
  73. }
  74. bool IDictionary<T, TU>.Remove (T key)
  75. {
  76. if (ContainsKey (key)) {
  77. Remove (key);
  78. return true;
  79. }
  80. return false;
  81. }
  82. bool IDictionary<T, TU>.TryGetValue (T key, out TU value)
  83. {
  84. if (ContainsKey (key)) {
  85. value = Get (key);
  86. return true;
  87. }
  88. value = default(TU);
  89. return false;
  90. }
  91. IEnumerator<KeyValuePair<T, TU>> IEnumerable<KeyValuePair<T, TU>>.GetEnumerator ()
  92. {
  93. return InternalGetEnumerator ();
  94. }
  95. IEnumerator IEnumerable.GetEnumerator ()
  96. {
  97. return InternalGetEnumerator ();
  98. }
  99. public virtual int Count {
  100. get { return EntrySet ().Count; }
  101. }
  102. public TU this[T key] {
  103. get { return Get (key); }
  104. set { Put (key, value); }
  105. }
  106. public virtual IEnumerable<T> Keys {
  107. get { return EntrySet ().Select (p => p.Key); }
  108. }
  109. int ICollection<KeyValuePair<T, TU>>.Count {
  110. get { return Count; }
  111. }
  112. bool ICollection<KeyValuePair<T, TU>>.IsReadOnly {
  113. get { return false; }
  114. }
  115. ICollection<T> IDictionary<T, TU>.Keys {
  116. get { return Keys.ToList (); }
  117. }
  118. ICollection<TU> IDictionary<T, TU>.Values {
  119. get { return Values.ToList (); }
  120. }
  121. public virtual IEnumerable<TU> Values {
  122. get { return EntrySet ().Select (p => p.Value); }
  123. }
  124. }
  125. }