SortedSet.cs :  » GIS » DeepEarth » Iesi_NTS » Collections » Generic » C# / CSharp Open Source

Home
C# / CSharp Open Source
1.2.6.4 mono .net core
2.2.6.4 mono core
3.Aspect Oriented Frameworks
4.Bloggers
5.Build Systems
6.Business Application
7.Charting Reporting Tools
8.Chat Servers
9.Code Coverage Tools
10.Content Management Systems CMS
11.CRM ERP
12.Database
13.Development
14.Email
15.Forum
16.Game
17.GIS
18.GUI
19.IDEs
20.Installers Generators
21.Inversion of Control Dependency Injection
22.Issue Tracking
23.Logging Tools
24.Message
25.Mobile
26.Network Clients
27.Network Servers
28.Office
29.PDF
30.Persistence Frameworks
31.Portals
32.Profilers
33.Project Management
34.RSS RDF
35.Rule Engines
36.Script
37.Search Engines
38.Sound Audio
39.Source Control
40.SQL Clients
41.Template Engines
42.Testing
43.UML
44.Web Frameworks
45.Web Service
46.Web Testing
47.Wiki Engines
48.Windows Presentation Foundation
49.Workflows
50.XML Parsers
C# / C Sharp
C# / C Sharp by API
C# / CSharp Tutorial
C# / CSharp Open Source » GIS » DeepEarth 
DeepEarth » Iesi_NTS » Collections » Generic » SortedSet.cs
/* Copyright  2002-2004 by Aidant Systems, Inc., and by Jason Smith. */
using System;
using System.Collections.Generic;

namespace Iesi_NTS.Collections.Generic{
  /// <summary>
  /// Implements a <c>Set</c> based on a sorted tree.  This gives good performance for operations on very
  /// large data-sets, though not as good - asymptotically - as a <c>HashedSet</c>.  However, iteration
  /// occurs in order.  Elements that you put into this type of collection must implement <c>IComparable</c>,
  /// and they must actually be comparable.  You can't mix <c>string</c> and <c>int</c> values, for example.
  /// </summary>
#if !SILVERLIGHT
  [Serializable]
#endif
  public class SortedSet<T> : DictionarySet<T>
  {
    /// <summary>
    /// Creates a new set instance based on a sorted tree.
    /// </summary>
    public SortedSet()
    {
      InternalDictionary = new Dictionary<T, object>();
    }
#if !SILVERLIGHT
    /// <summary>
    /// Creates a new set instance based on a sorted tree.
    /// </summary>
    /// <param name="comparer">The <see cref="IComparer"/> to use for sorting.</param>
        public SortedSet( IComparer<T> comparer ) 
    {
            InternalDictionary = new Dictionary<T, object>( comparer );
    }
#endif

    /// <summary>
    /// Creates a new set instance based on a sorted tree and
    /// initializes it based on a collection of elements.
    /// </summary>
    /// <param name="initialValues">A collection of elements that defines the initial set contents.</param>
    public SortedSet(ICollection<T> initialValues) 
            : this()
    {
      this.AddAll(initialValues);
    }

#if !SILVERLIGHT
    /// <summary>
    /// Creates a new set instance based on a sorted tree and
    /// initializes it based on a collection of elements.
    /// </summary>
    /// <param name="initialValues">A collection of elements that defines the initial set contents.</param>
    /// <param name="comparer">The <see cref="IComparer"/> to use for sorting.</param>
    public SortedSet(ICollection<T> initialValues, IComparer<T> comparer) 
            : this( comparer )
    {
      this.AddAll(initialValues);
    }
#endif
  }
}
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.