dotNet Product

C#: Split a Distinguished Name of Active Directory into array of string

class DistinguishedNameSplit
{
    static string[] hexCodes = new string[] { "0""1""2""3""4""5""6""7""8""9""a""A""b""B""c""C""d""D""e""E""f""F" };
 
    public static List<string> Split(string distinguishedName)
    {
        List<string> pool = new List<string>();
        StringBuilder working = new StringBuilder();
        string hexHigh = "";
        MachineStatus status = MachineStatus.A;
        int index = 0;
        int indexMax = distinguishedName.Length - 1;
 
        while (index <= indexMax)
        {
            string value = distinguishedName.Substring(index, 1);
            switch (status)
            {
                case MachineStatus.A:
                    if (value == ",")
                    {
                        pool.Add(working.ToString());
                        working.Clear();
                    }
                    else if (value == "\"")
                    {
                        working.Append("\"");
                        status = MachineStatus.B;
                    }
                    else if (value == "\\")
                    {
                        status = MachineStatus.C;
                    }
                    else
                    {
                        working.Append(value);
                    }
                    break;
                case MachineStatus.B:
                    if (value == "\"")
                    {
                        working.Append("\"");
                        status = MachineStatus.A;
                    }
                    else if (value == "\\")
                    {
                        status = MachineStatus.E;
                    }
                    else
                    {
                        working.Append(value);
                    }
                    break;
                case MachineStatus.C:
                    if (value == "," || value == "\"" || value == "\\")
                    {
                        working.Append(value);
                        status = MachineStatus.A;
                    }
                    else if (hexCodes.Contains(value))
                    {
                        hexHigh = value;
                        status = MachineStatus.D;
                    }
                    else
                    {
                        throw new ArgumentException("The distinguished name specified is not typed legally.");
                    }
                    break;
                case MachineStatus.D:
                    if (hexCodes.Contains(value))
                    {
                        working.Append((char)Convert.ToByte(String.Format("{0}{1}", hexHigh, value), 16));
                        status = MachineStatus.A;
                    }
                    else
                    {
                        throw new ArgumentException("The distinguished name specified is not typed legally.");
                    }
                    break;
                case MachineStatus.E:
                    if (value == "," || value == "\"" || value == "\\")
                    {
                        working.Append(value);
                        status = MachineStatus.B;
                    }
                    else if (hexCodes.Contains(value))
                    {
                        hexHigh = value;
                        status = MachineStatus.F;
                    }
                    else
                    {
                        throw new ArgumentException("The distinguished name specified is not typed legally.");
                    }
                    break;
                case MachineStatus.F:
                    if (hexCodes.Contains(value))
                    {
                        working.Append((char)Convert.ToByte(String.Format("{0}{1}", hexHigh, value), 16));
                        status = MachineStatus.B;
                    }
                    else
                    {
                        throw new ArgumentException("The distinguished name specified is not typed legally.");
                    }
                    break;
            }
            index++;
        }
 
        if (status == MachineStatus.A)
        {
            pool.Add(working.ToString());
            return pool;
        }
        else
        {
            throw new ArgumentException("The distinguished name specified is not ended correctly.");
        }
    }
 
    enum MachineStatus
    {
        A, B, C, D, E, F
    }
}

Recursive Enumerator

using System;
using System.Collections.Generic;

namespace SecretNest.RecursiveEnumerator
{
    /// <summary>
    /// Get the enumerator for querying the parents of specified item.
    /// </summary>
    /// <typeparam name="T">Item type</typeparam>
    /// <param name="current">Item for querying parents</param>
    /// <returns>Enumerator of parents querying</returns>
    public delegate IEnumerator<T> GetParentsEnumerator<T>(T current);

    /// <summary>
    /// Enumerator for querying parents
    /// </summary>
    /// <typeparam name="T">Item type</typeparam>
    public class Enumerator<T> : IEnumerator<T>
    {
        T current, initial;

        Queue<T> notQueried = new Queue<T>();

        HashSet<T> queried = new HashSet<T>(); //for avoiding duplicated query
        Queue<T> rollbackHistory = new Queue<T>(); //for soft reset
        Queue<T> history = new Queue<T>(); //for soft reset
        IEnumerator<T> activeQuery;

        /// <summary>
        /// Callback for getting the enumerator, which is used for querying the parents of specified item.
        /// </summary>
        public GetParentsEnumerator<T> GetParentsEnumeratorCallback { get; set; }

        /// <summary>
        /// Constructor
        /// </summary>
        /// <param name="initial">Initial item</param>
        public Enumerator(T initial)
        {
            notQueried.Enqueue(initial);
            this.initial = initial;
        }

        /// <summary>
        /// Constructor
        /// </summary>
        /// <param name="initial">Initial item</param>
        /// <param name="callback">Callback for getting the enumerator, which is used for querying the parents of specified item.</param>
        public Enumerator(T initial, GetParentsEnumerator<T> callback)
        {
            notQueried.Enqueue(initial);
            this.initial = initial;
            GetParentsEnumeratorCallback = callback;
        }

        /// <summary>
        /// Gets the current element in the collection.
        /// </summary>
        public T Current
        {
            get { return current; }
        }

        bool disposed;
        /// <summary>
        /// Performs application-defined tasks associated with freeing, releasing, or resetting unmanaged resources.
        /// </summary>
        public void Dispose()
        {
            Dispose(true);
            GC.SuppressFinalize(this);
        }

        private void Dispose(bool disposing)
        {
            if (!disposed)
            {
                if (disposing)
                {
                    current = default(T);
                    notQueried = null;
                    queried = null;
                    history = null;
                }
                disposed = true;
            }
        }

        /// <summary>
        /// Gets the current element in the collection.
        /// </summary>
        object System.Collections.IEnumerator.Current
        {
            get { return current; }
        }

        /// <summary>
        /// Skip same items
        /// </summary>
        public bool SkipSameItems { get; set; }

        /// <summary>
        /// Advances the enumerator to the next element of the collection.
        /// </summary>
        /// <returns>true if the enumerator was successfully advanced to the next element; false if the enumerator has passed the end of the collection. </returns>
        public bool MoveNext()
        {
            if (disposed) throw new ObjectDisposedException(null);
            if (rollbackHistory.Count > 0)
            {
                current = rollbackHistory.Dequeue();
                history.Enqueue(current);
                return true;
            }
            if (activeQuery != null)
            {
            here:
                if (activeQuery.MoveNext())
                {
                    if (SkipSameItems && history.Contains(activeQuery.Current)) { goto here; }
                    current = activeQuery.Current;
                    history.Enqueue(current);
                    notQueried.Enqueue(current);
                    return true;
                }
                else
                {
                    activeQuery = null;
                }
            }
            if (GetParentsEnumeratorCallback != null)
            {
                while (notQueried.Count != 0)
                {
                    T item = notQueried.Dequeue();
                    if (!queried.Contains(item))
                    {
                        IEnumerator<T> enumerator = GetParentsEnumeratorCallback(item);
                        queried.Add(item);
                        here:
                        if (enumerator != null)
                        {
                            if (enumerator.MoveNext())
                            {
                                activeQuery = enumerator;
                                if (SkipSameItems && history.Contains(enumerator.Current)) { goto here; }
                                current = enumerator.Current;
                                history.Enqueue(current);
                                notQueried.Enqueue(current);
                                return true;
                            }
                            else
                            {
                                enumerator = null;
                            }
                        }
                    }
                }
            }
            return false;
        }

        /// <summary>
        /// Sets the enumerator to its initial position, which is before the first element in the collection. Keep all histories for caching.
        /// </summary>
        public void Reset()
        {
            if (disposed) throw new ObjectDisposedException(null);
            while (history.Count > 0)
            {
                rollbackHistory.Enqueue(history.Dequeue());
            }
            current = default(T);
        }

        /// <summary>
        /// Sets the enumerator to its initial position, which is before the first element in the collection. Reset all data, and close active sub-query.
        /// </summary>
        public void HardReset()
        {
            if (disposed) throw new ObjectDisposedException(null);
            queried.Clear();
            notQueried.Clear();
            notQueried.Enqueue(initial);
            history.Clear();
            activeQuery = null;
            current = default(T);
        }
    }
}

 

Download code and demo projects

Chorus Update: Invoke Helper

A new Invoke Helper is added for making it easier with creating subscribers for UI updating job, by calling Invoke method internally.

See Chorus page for more information.

OrderedDictionary

Dictionary with ordered keys.
One c# (4.0) class which implements ICollection, IDictionary, IList and IXmlSerializable.

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Collections.ObjectModel;

namespace System.Collection.Generic
{
    [Serializable]
    public class OrderedDictionary : 
        ICollection>, 
        IDictionary, 
        IList>, 
        System.Xml.Serialization.IXmlSerializable
    {
        List keys;
        Dictionary dict;

        #region Constructors
        /// 
        /// Initializes a new instance of the OrderedDictionary class that is empty and has the default initial capacity. 
        /// 
        public OrderedDictionary()
        {
            keys = new List();
            dict = new Dictionary();
        }

        /// 
        /// Initializes a new instance of the OrderedDictionary class that is empty and has the specified initial capacity. 
        /// 
        /// The number of elements that the new dictionary can initially store.
        public OrderedDictionary(int capacity)
        {
            keys = new List(capacity);
            dict = new Dictionary(capacity);
        }

        /// 
        /// Initializes a new instance of the OrderedDictionary class that contains elements copied from the specified collection and has sufficient capacity to accommodate the number of elements copied. 
        /// 
        /// The collection whose elements are copied to the new dictionary.
        public OrderedDictionary(IEnumerable> collection)
        {
            keys = new List();
            dict = new Dictionary();
            var enumerator = collection.GetEnumerator();
            while (enumerator.MoveNext())
            {
                keys.Add(enumerator.Current.Key);
                dict.Add(enumerator.Current.Key, enumerator.Current.Value);
            }
        }

        /// 
        /// Initializes a new instance of the OrderedDictionary class that contains elements copied from the specified OrderedDictionary or Dictionary and uses the default equality comparer for the key type. 
        /// 
        /// The OrderedDictionary or Dictionary whose elements are copied to the new OrderedDictionary.
        public OrderedDictionary(IDictionary dictionary)
        {
            keys = new List();
            dict = new Dictionary();
            foreach (var item in dictionary)
            {
                keys.Add(item.Key);
                dict.Add(item.Key, item.Value);
            }
        }
        #endregion

        #region Add / Insert
        /// 
        /// Adds an item to the OrderedDictionary. 
        /// 
        /// The object to add to the OrderedDictionary.
        public void Add(KeyValuePair item)
        {
            dict.Add(item.Key, item.Value);
            keys.Add(item.Key);
        }

        /// 
        /// Adds an element with the provided key and value to the OrderedDictionary.
        /// 
        /// The object to use as the key of the element to add.
        /// The object to use as the value of the element to add.
        public void Add(TKey key, TValue value)
        {
            dict.Add(key, value);
            keys.Add(key);
        }

        /// 
        /// Inserts an item to the OrderedDictionary at the specified index. 
        /// 
        /// The zero-based index at which item should be inserted.
        /// The object to insert into the OrderedDictionary
        public void Insert(int index, KeyValuePair item)
        {
            dict.Add(item.Key, item.Value);
            keys.Insert(index, item.Key);
        }

        /// 
        /// Inserts an element with the provided key and value to the OrderedDictionary at the specified index. 
        /// 
        /// The zero-based index at which item should be inserted.
        /// The object to use as the key of the element to inserted.
        /// The object to use as the value of the element to inserted.
        public void Insert(int index, TKey key, TValue value)
        {
            dict.Add(key, value);
            keys.Insert(index, key);
        }

        /// 
        /// Gets the value associated with the specified key.
        /// 
        /// The key whose value to get.
        /// When this method returns, the value associated with the specified key, if the key is found; otherwise, the default value for the type of the value parameter. This parameter is passed uninitialized. 
        /// true if the object that implements OrderedDictionary contains an element with the specified key; otherwise, false.
        public bool TryGetValue(TKey key, out TValue value)
        {
            return dict.TryGetValue(key, out value);
        }
        #endregion

        #region Remove / RemoveAt
        /// 
        /// Removes all items from the OrderedDictionary.
        /// 
        public void Clear()
        {
            dict.Clear();
            keys.Clear();
        }

        /// 
        /// Removes the specific object from the OrderedDictionary. The value property will be ignored.
        /// 
        /// The object to remove from the OrderedDictionary.
        /// true if item was successfully removed from the OrderedDictionary; otherwise, false. This method also returns false if item is not found in the original OrderedDictionary.
        public bool Remove(KeyValuePair item)
        {
            if (keys.Remove(item.Key))
            {
                return dict.Remove(item.Key);
            }
            else
            {
                return false;
            }
        }

        /// 
        /// Removes the element with the specified key from the OrderedDictionary.
        /// 
        /// The key of the element to remove.
        /// true if the element is successfully removed; otherwise, false. This method also returns false if key was not found in the original OrderedDictionary.
        public bool Remove(TKey key)
        {
            if (keys.Remove(key))
            {
                return dict.Remove(key);
            }
            else
            {
                return false;
            }
        }

        /// 
        /// Removes the OrderedDictionary item at the specified index. 
        /// 
        /// The zero-based index of the item to remove.
        public void RemoveAt(int index)
        {
            var key = keys[index];
            keys.RemoveAt(index);
            dict.Remove(key);
        }
        #endregion

        #region Count / Contains / IndexOf
        /// 
        /// Gets the number of elements contained in the OrderedDictionary. 
        /// 
        public int Count
        {
            get { return keys.Count(); }
        }

        /// 
        /// Determines whether the OrderedDictionary contains a specific value. The value property will be ignored.
        /// 
        /// The object to locate in the OrderedDictionary.
        /// true if item is found in the OrderedDictionary; otherwise, false. 
        public bool Contains(KeyValuePair item)
        {
            return keys.Contains(item.Key);
        }

        /// 
        /// Determines whether the OrderedDictionary contains an element with the specified key. 
        /// 
        /// The key to locate in the OrderedDictionary.
        /// true if the IOrderedDictionary contains an element with the key; otherwise, false. 
        public bool ContainsKey(TKey key)
        {
            return keys.Contains(key);
        }

        /// 
        /// Determines the index of a specific item in the OrderedDictionary.
        /// 
        /// The key to locate in the OrderedDictionary.
        /// The index of key if found in the list; otherwise, -1.
        public int IndexOf(TKey key)
        {
            return keys.IndexOf(key);
        }

        /// 
        /// Determines the index of a specific item in the OrderedDictionary. The value property will be ignored.
        /// 
        /// The item to locate in the OrderedDictionary.
        /// The index of item if found in the list; otherwise, -1.
        public int IndexOf(KeyValuePair item)
        {
            return keys.IndexOf(item.Key);
        }
        #endregion

        #region Misc
        /// 
        /// Apply the new comparer to OrderedDictionary.
        /// 
        /// The IEqualityComparer implementation to use when comparing keys, or null to use the default EqualityComparer for the type of the key.
        public void ApplyComparer(IEqualityComparer comparer)
        {
            var newDict = new Dictionary(keys.Count, comparer);
            var newKeys = new List(keys.Count);
            foreach (var key in keys)
            {
                newDict.Add(key, dict[key]);
                newKeys.Add(key);
            }
            keys = newKeys;
            dict = newDict;
        }

        /// 
        /// Gets a value indicating whether the OrderedDictionary is read-only. Value false will be returned always.
        /// 
        public bool IsReadOnly
        {
            get { return false; }
        }

        /// 
        /// Copies the elements of the OrderedDictionary to an Array, starting at a particular Array index. 
        /// 
        /// The one-dimensional Array that is the destination of the elements copied from OrderedDictionary. The Array must have zero-based indexing.
        /// The zero-based index in array at which copying begins. 
        public void CopyTo(KeyValuePair[] array, int arrayIndex)
        {
            int index = arrayIndex;
            foreach (var key in keys)
            {
                array[index++] = new KeyValuePair(key, dict[key]);
            }
        }
        #endregion

        #region Enumerator
        /// 
        /// Returns an enumerator that iterates through the collection. 
        /// 
        /// An IEnumerator that can be used to iterate through the collection.
        public IEnumerator> GetEnumerator()
        {
            return (from key in keys
                    select new KeyValuePair(key, dict[key]))
                    .GetEnumerator();
        }

        /// 
        /// Returns an enumerator that iterates through the collection. 
        /// 
        /// An IEnumerator that can be used to iterate through the collection.
        System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
        {
            return GetEnumerator();
        }

        /// 
        /// Returns an enumerator that iterates through the collection. 
        /// 
        /// An IEnumerator that can be used to iterate through the collection.
        IEnumerator> IEnumerable>.GetEnumerator()
        {
            return GetEnumerator();
        }

        /// 
        /// Returns an enumerator that iterates through the keys collection.
        /// 
        /// An IEnumerator that can be used to iterate through the keys collection.
        public IEnumerator GetKeysEnumerator()
        {
            return keys.GetEnumerator();
        }
        #endregion

        #region Collection
        /// 
        /// Gets an ICollection containing the keys of the OrderedDictionary.
        /// 
        public ICollection Keys
        {
            get { return new ReadOnlyCollection(keys); }
        }

        /// 
        /// Gets an ICollection containing the values of the OrderedDictionary.
        /// 
        public ICollection Values
        {
            get
            {
                return new ReadOnlyCollection
                    ((from key in keys
                      select dict[key]).ToList());
            }
        }
        #endregion

        #region indexer
        /// 
        /// Gets or sets the element with the specified key.
        /// 
        /// The key of the element to get or set.
        /// The value which linked to the specified key.
        public TValue this[TKey key]
        {
            get
            {
                return dict[key];
            }
            set
            {
                dict[key] = value;
            }
        }

        /// 
        /// Gets the value at the specified index.
        /// 
        /// The zero-based index of the value to get or set.
        /// The value at the specified index.
        TValue this[int index]
        {
            get
            {
                return dict[keys[index]];
            }
            set
            {
                dict[keys[index]] = value;
            }
        }

        /// 
        /// Gets the element at the specified index. The method set is not supported.
        /// 
        /// The zero-based index of the element to get.
        /// The element at the specified index.
        KeyValuePair IList>.this[int index]
        {
            get
            {
                var key = keys[index];
                return new KeyValuePair(key, dict[key]);
            }
            set
            {
                throw new NotSupportedException();
            }
        }

        /// 
        /// Gets the key at the specified index.
        /// 
        /// The zero-based index of the key to get.
        /// The key at the specified index.
        public TKey GetKeyOfIndex(int index)
        {
            return keys[index];
        }
        #endregion

        #region Serialization
        /// 
        /// This method is reserved and should not be used. When implementing the IXmlSerializable interface, you should return Nothing( Nothing in Visual Basic) from this method, and instead, if specifying a custom schema is required, apply the XmlSchemaProviderAttribute to the class.
        /// 
        /// An XmlSchema that describes the XML representation of the object that is produced by the WriteXml method and consumed by the ReadXml method.
        public Xml.Schema.XmlSchema GetSchema()
        {
            return null;
        }

        /// 
        /// Generates an object from its XML representation.
        /// 
        /// The XmlReader stream from which the object is deserialized.
        public void ReadXml(Xml.XmlReader reader)
        {
            System.Xml.Serialization.XmlSerializer keySer = new System.Xml.Serialization.XmlSerializer(typeof(TKey));
            System.Xml.Serialization.XmlSerializer valueSer = new System.Xml.Serialization.XmlSerializer(typeof(TValue));
            reader.Read();
            reader.ReadStartElement("OrderedDictionary");
            if (reader.NodeType == System.Xml.XmlNodeType.EndElement)
                reader.ReadEndElement();
            else
            {
                while (reader.NodeType != System.Xml.XmlNodeType.EndElement)
                {
                    reader.ReadStartElement("Item");
                    reader.ReadStartElement("Key");
                    TKey key = (TKey)keySer.Deserialize(reader);
                    reader.ReadEndElement();
                    reader.ReadStartElement("Value");
                    TValue value = (TValue)valueSer.Deserialize(reader);
                    reader.ReadEndElement();
                    dict.Add(key, value);
                    keys.Add(key);
                    reader.ReadEndElement();
                    reader.MoveToContent();
                }
                reader.ReadEndElement();
                reader.ReadEndElement();
            }
        }

        /// 
        /// Converts an object into its XML representation.
        /// 
        /// The XmlWriter stream to which the object is serialized.
        public void WriteXml(Xml.XmlWriter writer)
        {
            System.Xml.Serialization.XmlSerializer keySer = new System.Xml.Serialization.XmlSerializer(typeof(TKey));
            System.Xml.Serialization.XmlSerializer valueSer = new System.Xml.Serialization.XmlSerializer(typeof(TValue));
            writer.WriteStartElement("OrderedDictionary");
            if (Keys.Count > 0)
                foreach (TKey key in keys)
                {
                    writer.WriteStartElement("Item");
                    writer.WriteStartElement("Key");
                    keySer.Serialize(writer, key);
                    writer.WriteEndElement();
                    writer.WriteStartElement("Value");
                    valueSer.Serialize(writer, dict[key]);
                    writer.WriteEndElement();
                    writer.WriteEndElement();
                }
            writer.WriteEndElement();
        }
        #endregion
    }
}

TreeView with CheckBox

If you wanna use CheckBox enabled TreeView in Windows Vista and further systems, you need to pay attention. If you double click the CheckBoxes in the TreeView, some useful event handlers, like BeforeClick and AfterClick, will not be raised. And, the vision of CheckBoxes will be changed (checked or not) but the property of related TreeNode will not.

To fix this, you have to create your own TreeView instead of the provided one.

using System;
using System.Windows.Forms;
public class FixedTreeView : TreeView {
protected override void WndProc(ref Message m) {
// Suppress WM_LBUTTONDBLCLK
if (m.Msg == 0x203) { m.Result = IntPtr.Zero; }
else base.WndProc(ref m);
}
}

Source: http://social.msdn.microsoft.com/Forums/en-US/winforms/thread/9d717ce0-ec6b-4758-a357-6bb55591f956

Chorus Update

Performance optimized. Chorus will require little more memory but run much faster.

Document(pdf) error fixed.

No interface / flow changed. You don’t need to adjust your code. Just download the new version and enjoy it.

http://secretnest.info/Chorus

Chorus本地模式版已经发布

Chorus是一个框架,它实现了多个部件之间的通讯功能。在它的协助下,软件系统中的每个部件可以自由通讯,而不论这些部件运行在同一个程序,同一台计算机,还是在世界的任何角落。

Chorus是一种模型,它展示了软件系统内部的物理结构。在它的支持下,软件系统中的每个部件可以随心拼装,而不论这些部件构造于您的产品,您的企业,还是获取自其他供应商。

Chorus是一份标准,它定义了每个程序部件的接口规格。在它的规范下,软件系统中的每个部件可以严格定义,而不论这些部件开发于同一个员工,同一个小组,还是来自外包公司。

 

当前已经发布本地模式版,实现同一个应用程序内部的通讯功能。

您有兴趣了解吗?请访问Chorus发布页