589689.xyz

Advanced C# Collections

  • 收录时间:2020-06-17 20:01:09
  • 文件大小:602MB
  • 下载次数:65
  • 最近下载:2021-01-23 07:55:05
  • 磁力链接:
立即下载 复制链接

文件列表

  1. csharp-collections-advanced.zip 20MB
  2. 05. High-performance Modifications with Linked Lists/05. Adding to a Linked List with AddLast().mp4 15MB
  3. 06. Stacks/06. Implementing the Undo Feature.mp4 13MB
  4. 11. Collection Interfaces/05. Checking for Values with Any().mp4 13MB
  5. 08. Concurrency and Concurrent Collections/02. Adding Concurrency to the Demo.mp4 12MB
  6. 11. Collection Interfaces/07. Decoupling the Code.mp4 11MB
  7. 08. Concurrency and Concurrent Collections/04. Dequeueing from a Concurrent Queue with TryDequeue().mp4 11MB
  8. 10. Read-only and Immutable Collections/06. Immutable Collections.mp4 11MB
  9. 11. Collection Interfaces/04. IEnumerable-T- and LINQ Performance.mp4 11MB
  10. 07. Queues/02. Demo- Queuing Booking Requests.mp4 11MB
  11. 04. Inside Dictionaries and Sorted Dictionaries/09. Using a Custom Type as a Key.mp4 10MB
  12. 07. Queues/04. SelectedItems Is Weakly Typed.mp4 9MB
  13. 09. Merging Data with HashSets and SortedSets/02. Removing Duplicates with LINQ.mp4 9MB
  14. 06. Stacks/04. Logging with Stack-T-.Push().mp4 9MB
  15. 04. Inside Dictionaries and Sorted Dictionaries/03. Looking up Countries by Key.mp4 9MB
  16. 07. Queues/03. Declaring the Queue.mp4 9MB
  17. 04. Inside Dictionaries and Sorted Dictionaries/10. Overriding Equality for Keys.mp4 9MB
  18. 04. Inside Dictionaries and Sorted Dictionaries/11. The Importance of GetHashCode().mp4 9MB
  19. 09. Merging Data with HashSets and SortedSets/08. Merging Sets with UnionWith().mp4 9MB
  20. 10. Read-only and Immutable Collections/05. The Loophole in Read-only Collections.mp4 9MB
  21. 03. Collection Performance/03. O(n) Operations and Scalability.mp4 8MB
  22. 03. Collection Performance/10. Linear Searching with List.Find().mp4 8MB
  23. 10. Read-only and Immutable Collections/03. Introducing ReadOnlyList-T-.mp4 8MB
  24. 03. Collection Performance/09. -Displaying the List in a ListBox.mp4 8MB
  25. 03. Collection Performance/11. Sorting- List.Sort() vs. LINQ.mp4 8MB
  26. 05. High-performance Modifications with Linked Lists/10. Taking Advantage of Dictionary Key Uniqueness.mp4 8MB
  27. 05. High-performance Modifications with Linked Lists/09. SortedDictionary Is Back.mp4 8MB
  28. 04. Inside Dictionaries and Sorted Dictionaries/04. Solving Case Sensitivity with an Equality Comparer.mp4 8MB
  29. 07. Queues/05. Enqueuing to the Queue.mp4 8MB
  30. 09. Merging Data with HashSets and SortedSets/07. Comparers and Equality Comparers.mp4 7MB
  31. 09. Merging Data with HashSets and SortedSets/01. Overview.mp4 7MB
  32. 04. Inside Dictionaries and Sorted Dictionaries/07. Introducing SortedDictionary-TKey, TValue-.mp4 7MB
  33. 10. Read-only and Immutable Collections/04. Read-only Makes Code Robust.mp4 7MB
  34. 03. Collection Performance/08. Importing Countries into a List.mp4 7MB
  35. 11. Collection Interfaces/02. List and Dictionary Interfaces.mp4 7MB
  36. 09. Merging Data with HashSets and SortedSets/06. Supplying a Comparer.mp4 7MB
  37. 04. Inside Dictionaries and Sorted Dictionaries/05. Enumerating Dictionaries.mp4 7MB
  38. 08. Concurrency and Concurrent Collections/03. Enqueueing to a Concurrent Queue.mp4 7MB
  39. 05. High-performance Modifications with Linked Lists/06. Removing from a Linked List with Remove().mp4 7MB
  40. 06. Stacks/02. Introducing Stack-T-.mp4 7MB
  41. 02. Arrays, Lists, and Collection Equality/07. Why Are Arrays so Strange-.mp4 7MB
  42. 10. Read-only and Immutable Collections/07. Comparing Immutable and Read-only Collections.mp4 7MB
  43. 03. Collection Performance/07. Introducing the TourBooker Demo.mp4 7MB
  44. 10. Read-only and Immutable Collections/02. Introducing ReadOnlyDictionary-TKey, TValue-.mp4 7MB
  45. 07. Queues/06. Dequeue.mp4 6MB
  46. 06. Stacks/05. Undoing and Stack-T-.Pop().mp4 6MB
  47. 05. High-performance Modifications with Linked Lists/02. Introducing LinkedList-T-.mp4 6MB
  48. 05. High-performance Modifications with Linked Lists/08. LinkedList-T- Pros and Cons.mp4 6MB
  49. 07. Queues/07. Peeking the Queue.mp4 6MB
  50. 05. High-performance Modifications with Linked Lists/01. Overview and Introducing the Demo.mp4 6MB
  51. 02. Arrays, Lists, and Collection Equality/08. Arrays under the Hood.mp4 6MB
  52. 11. Collection Interfaces/03. Enumerating with IEnumerable-T-.mp4 6MB
  53. 10. Read-only and Immutable Collections/01. Overview.mp4 6MB
  54. 02. Arrays, Lists, and Collection Equality/06. Array Assignment.mp4 6MB
  55. 04. Inside Dictionaries and Sorted Dictionaries/08. SortedList vs. SortedDictionary.mp4 5MB
  56. 04. Inside Dictionaries and Sorted Dictionaries/02. Creating a Dictionary from a List with LINQ.mp4 5MB
  57. 08. Concurrency and Concurrent Collections/05. Peeking a Concurrent Queue with TryPeek().mp4 5MB
  58. 09. Merging Data with HashSets and SortedSets/05. Sorting Items with SortedSet-T-.mp4 5MB
  59. 04. Inside Dictionaries and Sorted Dictionaries/06. Dictionary Enumeration Order Is Unspecified.mp4 5MB
  60. 09. Merging Data with HashSets and SortedSets/09. Set Intersection and IntersectWith().mp4 5MB
  61. 02. Arrays, Lists, and Collection Equality/02. Array Equality.mp4 5MB
  62. 08. Concurrency and Concurrent Collections/06. Summary.mp4 5MB
  63. 05. High-performance Modifications with Linked Lists/07. Inserting into a Linked List with InsertBefore().mp4 5MB
  64. 07. Queues/08. Enumerating the Queue.mp4 5MB
  65. 02. Arrays, Lists, and Collection Equality/09. Lists under the Hood.mp4 5MB
  66. 09. Merging Data with HashSets and SortedSets/03. Avoiding Duplicates with Hashset-T-.mp4 5MB
  67. 06. Stacks/03. Setting up the Demo.mp4 5MB
  68. 11. Collection Interfaces/09. Course Summary.mp4 5MB
  69. 03. Collection Performance/06. Collection Scaling Review.mp4 4MB
  70. 11. Collection Interfaces/06. IReadOnlyList-T- vs. IImmutableList-T-.mp4 4MB
  71. 05. High-performance Modifications with Linked Lists/03. Fast Changes but Slow Lookup.mp4 4MB
  72. 02. Arrays, Lists, and Collection Equality/03. Most Collections Are Reference Types.mp4 4MB
  73. 02. Arrays, Lists, and Collection Equality/04. Equality for Collections.mp4 4MB
  74. 07. Queues/09. Summary.mp4 4MB
  75. 01. Course Overview/01. Course Overview.mp4 4MB
  76. 02. Arrays, Lists, and Collection Equality/01. Overview and Prerequisites.mp4 4MB
  77. 03. Collection Performance/04. What Does O(1) Mean-.mp4 4MB
  78. 03. Collection Performance/02. Why Collection Performance Matters.mp4 3MB
  79. 09. Merging Data with HashSets and SortedSets/04. Comparing Sets and Dictionaries.mp4 3MB
  80. 05. High-performance Modifications with Linked Lists/04. Nodes and LinkedListNode-T-.mp4 3MB
  81. 10. Read-only and Immutable Collections/08. Concurrency.mp4 3MB
  82. 06. Stacks/07. Characteristics of a Stack.mp4 3MB
  83. 03. Collection Performance/05. The Perils of O(n squared).mp4 3MB
  84. 02. Arrays, Lists, and Collection Equality/05. Comparing Collection Values with SequenceEqual().mp4 3MB
  85. 08. Concurrency and Concurrent Collections/01. Overview.mp4 2MB
  86. 07. Queues/01. Overview- Introducing Queue-T-.mp4 2MB
  87. 04. Inside Dictionaries and Sorted Dictionaries/12. Summary.mp4 2MB
  88. 10. Read-only and Immutable Collections/09. Summary.mp4 2MB
  89. 02. Arrays, Lists, and Collection Equality/10. Summary.mp4 2MB
  90. 06. Stacks/01. Overview.mp4 2MB
  91. 09. Merging Data with HashSets and SortedSets/10. Summary.mp4 1MB
  92. 05. High-performance Modifications with Linked Lists/11. Summary.mp4 1MB
  93. 06. Stacks/08. Summary.mp4 1MB
  94. 11. Collection Interfaces/08. Module Summary.mp4 1MB
  95. 11. Collection Interfaces/01. Overview.mp4 1MB
  96. 03. Collection Performance/12. Summary.mp4 1MB
  97. 03. Collection Performance/01. Overview.mp4 1MB
  98. 04. Inside Dictionaries and Sorted Dictionaries/01. Overview.mp4 874KB
  99. 08. Concurrency and Concurrent Collections/02. Adding Concurrency to the Demo.srt 7KB
  100. 05. High-performance Modifications with Linked Lists/05. Adding to a Linked List with AddLast().srt 7KB
  101. 06. Stacks/06. Implementing the Undo Feature.srt 6KB
  102. 07. Queues/02. Demo- Queuing Booking Requests.srt 6KB
  103. 03. Collection Performance/03. O(n) Operations and Scalability.srt 6KB
  104. 04. Inside Dictionaries and Sorted Dictionaries/09. Using a Custom Type as a Key.srt 6KB
  105. 02. Arrays, Lists, and Collection Equality/08. Arrays under the Hood.srt 6KB
  106. 11. Collection Interfaces/04. IEnumerable-T- and LINQ Performance.srt 6KB
  107. 11. Collection Interfaces/05. Checking for Values with Any().srt 5KB
  108. 11. Collection Interfaces/02. List and Dictionary Interfaces.srt 5KB
  109. 05. High-performance Modifications with Linked Lists/02. Introducing LinkedList-T-.srt 5KB
  110. 04. Inside Dictionaries and Sorted Dictionaries/10. Overriding Equality for Keys.srt 5KB
  111. 08. Concurrency and Concurrent Collections/04. Dequeueing from a Concurrent Queue with TryDequeue().srt 5KB
  112. 09. Merging Data with HashSets and SortedSets/08. Merging Sets with UnionWith().srt 5KB
  113. 04. Inside Dictionaries and Sorted Dictionaries/11. The Importance of GetHashCode().srt 5KB
  114. 03. Collection Performance/11. Sorting- List.Sort() vs. LINQ.srt 5KB
  115. 11. Collection Interfaces/07. Decoupling the Code.srt 5KB
  116. 05. High-performance Modifications with Linked Lists/01. Overview and Introducing the Demo.srt 5KB
  117. 09. Merging Data with HashSets and SortedSets/07. Comparers and Equality Comparers.srt 5KB
  118. 09. Merging Data with HashSets and SortedSets/01. Overview.srt 5KB
  119. 05. High-performance Modifications with Linked Lists/08. LinkedList-T- Pros and Cons.srt 5KB
  120. 10. Read-only and Immutable Collections/05. The Loophole in Read-only Collections.srt 5KB
  121. 03. Collection Performance/07. Introducing the TourBooker Demo.srt 5KB
  122. 04. Inside Dictionaries and Sorted Dictionaries/07. Introducing SortedDictionary-TKey, TValue-.srt 5KB
  123. 04. Inside Dictionaries and Sorted Dictionaries/04. Solving Case Sensitivity with an Equality Comparer.srt 5KB
  124. 03. Collection Performance/06. Collection Scaling Review.srt 5KB
  125. 05. High-performance Modifications with Linked Lists/09. SortedDictionary Is Back.srt 4KB
  126. 03. Collection Performance/09. -Displaying the List in a ListBox.srt 4KB
  127. 08. Concurrency and Concurrent Collections/06. Summary.srt 4KB
  128. 02. Arrays, Lists, and Collection Equality/07. Why Are Arrays so Strange-.srt 4KB
  129. 09. Merging Data with HashSets and SortedSets/02. Removing Duplicates with LINQ.srt 4KB
  130. 10. Read-only and Immutable Collections/01. Overview.srt 4KB
  131. 09. Merging Data with HashSets and SortedSets/06. Supplying a Comparer.srt 4KB
  132. 10. Read-only and Immutable Collections/06. Immutable Collections.srt 4KB
  133. 03. Collection Performance/08. Importing Countries into a List.srt 4KB
  134. 07. Queues/04. SelectedItems Is Weakly Typed.srt 4KB
  135. 03. Collection Performance/10. Linear Searching with List.Find().srt 4KB
  136. 05. High-performance Modifications with Linked Lists/10. Taking Advantage of Dictionary Key Uniqueness.srt 4KB
  137. 02. Arrays, Lists, and Collection Equality/01. Overview and Prerequisites.srt 4KB
  138. 02. Arrays, Lists, and Collection Equality/03. Most Collections Are Reference Types.srt 4KB
  139. 07. Queues/03. Declaring the Queue.srt 4KB
  140. 10. Read-only and Immutable Collections/07. Comparing Immutable and Read-only Collections.srt 4KB
  141. 06. Stacks/05. Undoing and Stack-T-.Pop().srt 4KB
  142. 05. High-performance Modifications with Linked Lists/03. Fast Changes but Slow Lookup.srt 4KB
  143. 06. Stacks/04. Logging with Stack-T-.Push().srt 4KB
  144. 07. Queues/05. Enqueuing to the Queue.srt 4KB
  145. 11. Collection Interfaces/03. Enumerating with IEnumerable-T-.srt 4KB
  146. 04. Inside Dictionaries and Sorted Dictionaries/03. Looking up Countries by Key.srt 4KB
  147. 04. Inside Dictionaries and Sorted Dictionaries/05. Enumerating Dictionaries.srt 3KB
  148. 06. Stacks/02. Introducing Stack-T-.srt 3KB
  149. 10. Read-only and Immutable Collections/02. Introducing ReadOnlyDictionary-TKey, TValue-.srt 3KB
  150. 04. Inside Dictionaries and Sorted Dictionaries/02. Creating a Dictionary from a List with LINQ.srt 3KB
  151. 04. Inside Dictionaries and Sorted Dictionaries/08. SortedList vs. SortedDictionary.srt 3KB
  152. 05. High-performance Modifications with Linked Lists/06. Removing from a Linked List with Remove().srt 3KB
  153. 02. Arrays, Lists, and Collection Equality/09. Lists under the Hood.srt 3KB
  154. 02. Arrays, Lists, and Collection Equality/06. Array Assignment.srt 3KB
  155. 07. Queues/07. Peeking the Queue.srt 3KB
  156. 11. Collection Interfaces/09. Course Summary.srt 3KB
  157. 10. Read-only and Immutable Collections/04. Read-only Makes Code Robust.srt 3KB
  158. 06. Stacks/03. Setting up the Demo.srt 3KB
  159. 11. Collection Interfaces/06. IReadOnlyList-T- vs. IImmutableList-T-.srt 3KB
  160. 02. Arrays, Lists, and Collection Equality/02. Array Equality.srt 3KB
  161. 02. Arrays, Lists, and Collection Equality/04. Equality for Collections.srt 3KB
  162. 05. High-performance Modifications with Linked Lists/04. Nodes and LinkedListNode-T-.srt 3KB
  163. 06. Stacks/07. Characteristics of a Stack.srt 3KB
  164. 07. Queues/09. Summary.srt 3KB
  165. 10. Read-only and Immutable Collections/08. Concurrency.srt 3KB
  166. 03. Collection Performance/02. Why Collection Performance Matters.srt 3KB
  167. 07. Queues/06. Dequeue.srt 3KB
  168. 09. Merging Data with HashSets and SortedSets/04. Comparing Sets and Dictionaries.srt 3KB
  169. 08. Concurrency and Concurrent Collections/03. Enqueueing to a Concurrent Queue.srt 3KB
  170. 03. Collection Performance/04. What Does O(1) Mean-.srt 3KB
  171. 01. Course Overview/01. Course Overview.srt 3KB
  172. 09. Merging Data with HashSets and SortedSets/09. Set Intersection and IntersectWith().srt 3KB
  173. 10. Read-only and Immutable Collections/03. Introducing ReadOnlyList-T-.srt 3KB
  174. 09. Merging Data with HashSets and SortedSets/03. Avoiding Duplicates with Hashset-T-.srt 2KB
  175. 08. Concurrency and Concurrent Collections/05. Peeking a Concurrent Queue with TryPeek().srt 2KB
  176. 09. Merging Data with HashSets and SortedSets/05. Sorting Items with SortedSet-T-.srt 2KB
  177. 03. Collection Performance/05. The Perils of O(n squared).srt 2KB
  178. 08. Concurrency and Concurrent Collections/01. Overview.srt 2KB
  179. 04. Inside Dictionaries and Sorted Dictionaries/12. Summary.srt 2KB
  180. 07. Queues/08. Enumerating the Queue.srt 2KB
  181. 10. Read-only and Immutable Collections/09. Summary.srt 2KB
  182. 07. Queues/01. Overview- Introducing Queue-T-.srt 2KB
  183. 04. Inside Dictionaries and Sorted Dictionaries/06. Dictionary Enumeration Order Is Unspecified.srt 2KB
  184. 02. Arrays, Lists, and Collection Equality/10. Summary.srt 2KB
  185. 05. High-performance Modifications with Linked Lists/07. Inserting into a Linked List with InsertBefore().srt 2KB
  186. 06. Stacks/01. Overview.srt 2KB
  187. 09. Merging Data with HashSets and SortedSets/10. Summary.srt 2KB
  188. 02. Arrays, Lists, and Collection Equality/05. Comparing Collection Values with SequenceEqual().srt 2KB
  189. 06. Stacks/08. Summary.srt 1KB
  190. 11. Collection Interfaces/01. Overview.srt 1KB
  191. 11. Collection Interfaces/08. Module Summary.srt 1KB
  192. 05. High-performance Modifications with Linked Lists/11. Summary.srt 1KB
  193. 03. Collection Performance/12. Summary.srt 1KB
  194. 03. Collection Performance/01. Overview.srt 1KB
  195. 04. Inside Dictionaries and Sorted Dictionaries/01. Overview.srt 888B