Browse Source
git-svn-id: svn://svn.sharpdevelop.net/sharpdevelop/trunk@3077 1ccf3a8d-04fe-1044-b7c0-cef0b8235c61shortcuts
Daniel Grunwald
18 years ago
16 changed files with 115 additions and 167 deletions
@ -1,56 +0,0 @@
@@ -1,56 +0,0 @@
|
||||
// <file>
|
||||
// <copyright see="prj:///doc/copyright.txt"/>
|
||||
// <license see="prj:///doc/license.txt"/>
|
||||
// <owner name="Daniel Grunwald" email="daniel@danielgrunwald.de"/>
|
||||
// <version>$Revision$</version>
|
||||
// </file>
|
||||
|
||||
using System; |
||||
using System.ComponentModel; |
||||
using System.Collections.Generic; |
||||
|
||||
namespace ICSharpCode.WpfDesign.Designer |
||||
{ |
||||
delegate void Action(); |
||||
|
||||
// Static helpers that should become extension methods in the future
|
||||
static class Func |
||||
{ |
||||
public static T[] ToArray<T>(ICollection<T> collection) |
||||
{ |
||||
T[] arr = new T[collection.Count]; |
||||
collection.CopyTo(arr, 0); |
||||
return arr; |
||||
} |
||||
|
||||
public static PropertyDescriptor[] ToArray(PropertyDescriptorCollection collection) |
||||
{ |
||||
PropertyDescriptor[] arr = new PropertyDescriptor[collection.Count]; |
||||
collection.CopyTo(arr, 0); |
||||
return arr; |
||||
} |
||||
|
||||
/// <summary>
|
||||
/// Returns a sorted copy of the collection.
|
||||
/// </summary>
|
||||
public static ICollection<T> Sort<T>(ICollection<T> collection, Comparison<T> comparison) |
||||
{ |
||||
T[] arr = ToArray(collection); |
||||
Array.Sort(arr, comparison); |
||||
return arr; |
||||
} |
||||
|
||||
/// <summary>
|
||||
/// Returns the first element from <paramref name="input"/>.
|
||||
/// </summary>
|
||||
public static T First<T>(IEnumerable<T> input) |
||||
{ |
||||
if (input == null) |
||||
throw new ArgumentNullException("input"); |
||||
foreach (T item in input) { |
||||
return item; |
||||
} |
||||
throw new ArgumentException("input must not be an empty collection", "input"); |
||||
} |
||||
} |
||||
} |
||||
@ -1,76 +0,0 @@
@@ -1,76 +0,0 @@
|
||||
// <file>
|
||||
// <copyright see="prj:///doc/copyright.txt"/>
|
||||
// <license see="prj:///doc/license.txt"/>
|
||||
// <owner name="Daniel Grunwald" email="daniel@danielgrunwald.de"/>
|
||||
// <version>$Revision$</version>
|
||||
// </file>
|
||||
|
||||
using System; |
||||
using System.Collections.Generic; |
||||
|
||||
namespace ICSharpCode.WpfDesign |
||||
{ |
||||
// Static helpers that should become extension methods in the future
|
||||
static class Func |
||||
{ |
||||
public static T[] ToArray<T>(ICollection<T> collection) where T : class |
||||
{ |
||||
T[] arr = new T[collection.Count]; |
||||
collection.CopyTo(arr, 0); |
||||
return arr; |
||||
} |
||||
|
||||
/// <summary>
|
||||
/// Outputs distinct elements only, filtering all duplicates.
|
||||
/// </summary>
|
||||
public static IEnumerable<T> Distinct<T>(IEnumerable<T> input) where T : class |
||||
{ |
||||
// store elements already seen
|
||||
HashSet<T> elements = new HashSet<T>(); |
||||
|
||||
foreach (T element in input) { |
||||
if (elements.Add(element)) { |
||||
yield return element; |
||||
} |
||||
} |
||||
} |
||||
|
||||
/// <summary>
|
||||
/// Returns the first element from <paramref name="input"/>.
|
||||
/// </summary>
|
||||
public static T First<T>(IEnumerable<T> input) |
||||
{ |
||||
if (input == null) |
||||
throw new ArgumentNullException("input"); |
||||
foreach (T item in input) { |
||||
return item; |
||||
} |
||||
throw new ArgumentException("input must not be an empty collection", "input"); |
||||
} |
||||
|
||||
/// <summary>
|
||||
/// Skips the first <paramref name="skipCount"/> items in input and returns the rest.
|
||||
/// </summary>
|
||||
public static IEnumerable<T> Skip<T>(IEnumerable<T> input, long skipCount) |
||||
{ |
||||
if (input == null) |
||||
throw new ArgumentNullException("input"); |
||||
if (skipCount < 0) |
||||
throw new ArgumentOutOfRangeException("skipCount", skipCount, "skipCount must be non-negative."); |
||||
using (IEnumerator<T> enumerator = input.GetEnumerator()) { |
||||
if (skipCount != 0) { |
||||
long i = 0; |
||||
while (enumerator.MoveNext()) { |
||||
// skip item
|
||||
if (++i == skipCount) |
||||
break; |
||||
} |
||||
if (i != skipCount) yield break; // MoveNext returned false, don't call it again
|
||||
} |
||||
while (enumerator.MoveNext()) { |
||||
yield return enumerator.Current; |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
Loading…
Reference in new issue