Lists.cs 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110
  1. // Protocol Buffers - Google's data interchange format
  2. // Copyright 2008 Google Inc. All rights reserved.
  3. // http://github.com/jskeet/dotnet-protobufs/
  4. // Original C++/Java/Python code:
  5. // http://code.google.com/p/protobuf/
  6. //
  7. // Redistribution and use in source and binary forms, with or without
  8. // modification, are permitted provided that the following conditions are
  9. // met:
  10. //
  11. // * Redistributions of source code must retain the above copyright
  12. // notice, this list of conditions and the following disclaimer.
  13. // * Redistributions in binary form must reproduce the above
  14. // copyright notice, this list of conditions and the following disclaimer
  15. // in the documentation and/or other materials provided with the
  16. // distribution.
  17. // * Neither the name of Google Inc. nor the names of its
  18. // contributors may be used to endorse or promote products derived from
  19. // this software without specific prior written permission.
  20. //
  21. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  22. // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  23. // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  24. // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  25. // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  26. // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  27. // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  28. // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  29. // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  30. // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  31. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  32. using System.Collections.Generic;
  33. using System.Collections.ObjectModel;
  34. namespace Google.ProtocolBuffers.Collections
  35. {
  36. /// <summary>
  37. /// Utility non-generic class for calling into Lists{T} using type inference.
  38. /// </summary>
  39. public static class Lists
  40. {
  41. /// <summary>
  42. /// Returns a read-only view of the specified list.
  43. /// </summary>
  44. public static IList<T> AsReadOnly<T>(IList<T> list)
  45. {
  46. return Lists<T>.AsReadOnly(list);
  47. }
  48. public static bool Equals<T>(IList<T> left, IList<T> right)
  49. {
  50. if (left == right)
  51. {
  52. return true;
  53. }
  54. if (left == null || right == null)
  55. {
  56. return false;
  57. }
  58. if (left.Count != right.Count)
  59. {
  60. return false;
  61. }
  62. IEqualityComparer<T> comparer = EqualityComparer<T>.Default;
  63. for (int i = 0; i < left.Count; i++)
  64. {
  65. if (!comparer.Equals(left[i], right[i]))
  66. {
  67. return false;
  68. }
  69. }
  70. return true;
  71. }
  72. public static int GetHashCode<T>(IList<T> list)
  73. {
  74. int hash = 31;
  75. foreach (T element in list)
  76. {
  77. hash = hash*29 + element.GetHashCode();
  78. }
  79. return hash;
  80. }
  81. }
  82. /// <summary>
  83. /// Utility class for dealing with lists.
  84. /// </summary>
  85. public static class Lists<T>
  86. {
  87. private static readonly ReadOnlyCollection<T> empty = new ReadOnlyCollection<T>(new T[0]);
  88. /// <summary>
  89. /// Returns an immutable empty list.
  90. /// </summary>
  91. public static ReadOnlyCollection<T> Empty
  92. {
  93. get { return empty; }
  94. }
  95. /// <summary>
  96. /// Returns either the original reference if it's already read-only,
  97. /// or a new ReadOnlyCollection wrapping the original list.
  98. /// </summary>
  99. public static IList<T> AsReadOnly(IList<T> list)
  100. {
  101. return list.IsReadOnly ? list : new ReadOnlyCollection<T>(list);
  102. }
  103. }
  104. }