IndexSet.cs 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356
  1. using System;
  2. using System.Collections;
  3. using System.Collections.Generic;
  4. namespace UnityEditor.ShaderGraph.Drawing
  5. {
  6. sealed class IndexSet : ICollection<int>
  7. {
  8. List<uint> m_Masks = new List<uint>();
  9. public IndexSet() {}
  10. public IndexSet(IEnumerable<int> indices)
  11. {
  12. foreach (var index in indices)
  13. Add(index);
  14. }
  15. public IEnumerator<int> GetEnumerator()
  16. {
  17. for (var i = 0; i < m_Masks.Count; i++)
  18. {
  19. var mask = m_Masks[i];
  20. if (mask == 0)
  21. continue;
  22. for (var j = 0; j < 32; j++)
  23. {
  24. if ((mask & (1 << j)) > 0)
  25. yield return i * 32 + j;
  26. }
  27. }
  28. }
  29. IEnumerator IEnumerable.GetEnumerator()
  30. {
  31. return GetEnumerator();
  32. }
  33. public void UnionWith(IEnumerable<int> other)
  34. {
  35. var otherSet = other as IndexSet;
  36. if (otherSet != null)
  37. {
  38. UnionWith(otherSet);
  39. }
  40. else
  41. {
  42. foreach (var index in other)
  43. Add(index);
  44. }
  45. }
  46. public void UnionWith(IndexSet other)
  47. {
  48. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  49. m_Masks[i] |= other.m_Masks[i];
  50. for (var i = m_Masks.Count; i < other.m_Masks.Count; i++)
  51. m_Masks.Add(other.m_Masks[i]);
  52. }
  53. public void IntersectWith(IEnumerable<int> other)
  54. {
  55. IntersectWith(other as IndexSet ?? new IndexSet(other));
  56. }
  57. public void IntersectWith(IndexSet other)
  58. {
  59. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  60. m_Masks[i] &= other.m_Masks[i];
  61. }
  62. public void ExceptWith(IEnumerable<int> other)
  63. {
  64. var otherSet = other as IndexSet;
  65. if (otherSet != null)
  66. {
  67. ExceptWith(otherSet);
  68. }
  69. else
  70. {
  71. foreach (var index in other)
  72. Remove(index);
  73. }
  74. }
  75. public void ExceptWith(IndexSet other)
  76. {
  77. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  78. m_Masks[i] &= ~other.m_Masks[i];
  79. }
  80. public void SymmetricExceptWith(IEnumerable<int> other)
  81. {
  82. SymmetricExceptWith(other as IndexSet ?? new IndexSet(other));
  83. }
  84. public void SymmetricExceptWith(IndexSet other)
  85. {
  86. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  87. m_Masks[i] ^= other.m_Masks[i];
  88. }
  89. public bool IsSubsetOf(IEnumerable<int> other)
  90. {
  91. return IsSubsetOf(other as IndexSet ?? new IndexSet(other));
  92. }
  93. public bool IsSubsetOf(IndexSet other)
  94. {
  95. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  96. {
  97. var mask = m_Masks[i];
  98. var otherMask = other.m_Masks[i];
  99. if ((mask & otherMask) != mask)
  100. return false;
  101. }
  102. for (var i = other.m_Masks.Count; i < m_Masks.Count; i++)
  103. {
  104. if (m_Masks[i] > 0)
  105. return false;
  106. }
  107. return true;
  108. }
  109. public bool IsSupersetOf(IEnumerable<int> other)
  110. {
  111. return IsSupersetOf(other as IndexSet ?? new IndexSet(other));
  112. }
  113. public bool IsSupersetOf(IndexSet other)
  114. {
  115. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  116. {
  117. var otherMask = other.m_Masks[i];
  118. var mask = m_Masks[i];
  119. if ((otherMask & mask) != otherMask)
  120. return false;
  121. }
  122. for (var i = m_Masks.Count; i < other.m_Masks.Count; i++)
  123. {
  124. if (other.m_Masks[i] > 0)
  125. return false;
  126. }
  127. return true;
  128. }
  129. public bool IsProperSupersetOf(IEnumerable<int> other)
  130. {
  131. return IsProperSupersetOf(other as IndexSet ?? new IndexSet(other));
  132. }
  133. public bool IsProperSupersetOf(IndexSet other)
  134. {
  135. var isProper = false;
  136. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  137. {
  138. var mask = m_Masks[i];
  139. var otherMask = other.m_Masks[i];
  140. if ((otherMask & mask) != otherMask)
  141. return false;
  142. if ((~otherMask & mask) > 0)
  143. isProper = true;
  144. }
  145. for (var i = m_Masks.Count; i < other.m_Masks.Count; i++)
  146. {
  147. if (other.m_Masks[i] > 0)
  148. return false;
  149. }
  150. if (!isProper)
  151. {
  152. for (var i = other.m_Masks.Count; i < m_Masks.Count; i++)
  153. {
  154. if (m_Masks[i] > 0)
  155. return true;
  156. }
  157. }
  158. return isProper;
  159. }
  160. public bool IsProperSubsetOf(IEnumerable<int> other)
  161. {
  162. return IsProperSubsetOf(other as IndexSet ?? new IndexSet(other));
  163. }
  164. public bool IsProperSubsetOf(IndexSet other)
  165. {
  166. var isProper = false;
  167. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  168. {
  169. var mask = m_Masks[i];
  170. var otherMask = other.m_Masks[i];
  171. if ((mask & otherMask) != mask)
  172. return false;
  173. if ((~mask & otherMask) > 0)
  174. isProper = true;
  175. }
  176. for (var i = other.m_Masks.Count; i < m_Masks.Count; i++)
  177. {
  178. if (m_Masks[i] > 0)
  179. return false;
  180. }
  181. if (!isProper)
  182. {
  183. for (var i = m_Masks.Count; i < other.m_Masks.Count; i++)
  184. {
  185. if (other.m_Masks[i] > 0)
  186. return true;
  187. }
  188. }
  189. return isProper;
  190. }
  191. public bool Overlaps(IEnumerable<int> other)
  192. {
  193. var otherSet = other as IndexSet;
  194. if (otherSet != null)
  195. return Overlaps(otherSet);
  196. foreach (var index in other)
  197. {
  198. if (Contains(index))
  199. return true;
  200. }
  201. return false;
  202. }
  203. public bool Overlaps(IndexSet other)
  204. {
  205. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  206. {
  207. if ((m_Masks[i] & other.m_Masks[i]) > 0)
  208. return true;
  209. }
  210. return false;
  211. }
  212. public bool SetEquals(IEnumerable<int> other)
  213. {
  214. var otherSet = other as IndexSet;
  215. if (otherSet != null)
  216. return SetEquals(otherSet);
  217. foreach (var index in other)
  218. {
  219. if (!Contains(index))
  220. return false;
  221. }
  222. return true;
  223. }
  224. public bool SetEquals(IndexSet other)
  225. {
  226. for (var i = 0; i < Math.Min(m_Masks.Count, other.m_Masks.Count); i++)
  227. {
  228. if (m_Masks[i] != other.m_Masks[i])
  229. return false;
  230. }
  231. for (var i = other.m_Masks.Count; i < m_Masks.Count; i++)
  232. {
  233. if (m_Masks[i] > 0)
  234. return false;
  235. }
  236. for (var i = m_Masks.Count; i < other.m_Masks.Count; i++)
  237. {
  238. if (other.m_Masks[i] > 0)
  239. return false;
  240. }
  241. return true;
  242. }
  243. public bool Add(int index)
  244. {
  245. var maskIndex = index >> 5;
  246. var bitIndex = index & 31;
  247. for (var i = m_Masks.Count; i <= maskIndex; i++)
  248. m_Masks.Add(0);
  249. var mask = (uint)1 << bitIndex;
  250. var isNew = (m_Masks[maskIndex] & mask) == 0;
  251. m_Masks[maskIndex] |= mask;
  252. return isNew;
  253. }
  254. void ICollection<int>.Add(int index)
  255. {
  256. Add(index);
  257. }
  258. public void Clear()
  259. {
  260. m_Masks.Clear();
  261. }
  262. public bool Contains(int index)
  263. {
  264. var maskIndex = index >> 5;
  265. var bitIndex = index & 31;
  266. return maskIndex < m_Masks.Count && (m_Masks[maskIndex] & ((uint)1 << bitIndex)) > 0;
  267. }
  268. public void CopyTo(int[] array, int arrayIndex)
  269. {
  270. throw new NotImplementedException();
  271. }
  272. public bool Remove(int index)
  273. {
  274. var maskIndex = index >> 5;
  275. var bitIndex = index & 31;
  276. if (maskIndex >= m_Masks.Count)
  277. return false;
  278. var mask = (uint)1 << bitIndex;
  279. var exists = (m_Masks[maskIndex] & mask) > 0;
  280. m_Masks[maskIndex] &= ~mask;
  281. return exists;
  282. }
  283. public int Count
  284. {
  285. get
  286. {
  287. var count = 0;
  288. foreach (var mask in m_Masks)
  289. {
  290. for (var j = 0; j < 32; j++)
  291. {
  292. if ((mask & (1 << j)) > 0)
  293. count++;
  294. }
  295. }
  296. return count;
  297. }
  298. }
  299. public bool IsReadOnly
  300. {
  301. get { return false; }
  302. }
  303. }
  304. }