Flatten a List : List « Collections Data Structure « C# / C Sharp






Flatten a List

    

#region License
// Copyright 2006 James Newton-King
// http://www.newtonsoft.com
//
// This work is licensed under the Creative Commons Attribution 2.5 License
// http://creativecommons.org/licenses/by/2.5/
//
// You are free:
//    * to copy, distribute, display, and perform the work
//    * to make derivative works
//    * to make commercial use of the work
//
// Under the following conditions:
//    * You must attribute the work in the manner specified by the author or licensor:
//          - If you find this component useful a link to http://www.newtonsoft.com would be appreciated.
//    * For any reuse or distribution, you must make clear to others the license terms of this work.
//    * Any of these conditions can be waived if you get permission from the copyright holder.
#endregion

using System;
using System.Collections.Generic;
using System.Text;
using System.Collections;

namespace MySpace.Common.IO.JSON.Utilities
{

    internal static class CollectionUtils
    {
        public static List<List<T>> Flatten<T>(params IList<T>[] lists)
        {
            List<List<T>> flattened = new List<List<T>>();
            Dictionary<int, T> currentList = new Dictionary<int, T>();

            Recurse<T>(new List<IList<T>>(lists), 0, currentList, flattened);

            return flattened;
        }

        private static void Recurse<T>(IList<IList<T>> global, int current, Dictionary<int, T> currentSet, List<List<T>> flattenedResult)
        {
            IList<T> currentArray = global[current];

            for (int i = 0; i < currentArray.Count; i++)
            {
                currentSet[current] = currentArray[i];

                if (current == global.Count - 1)
                {
                    List<T> items = new List<T>();

                    for (int k = 0; k < currentSet.Count; k++)
                    {
                        items.Add(currentSet[k]);
                    }

                    flattenedResult.Add(items);
                }
                else
                {
                    Recurse(global, current + 1, currentSet, flattenedResult);
                }
            }
        }
    }
}

   
    
    
    
  








Related examples in the same category

1.new List() Add(assembly1) Indexer
2.Get the size of a list
3.Add Item to a list object
4.Search Test
5.Remove Item from a List
6.Change Contents
7.Reverse Contents
8.Hash List to Hash Array
9.Load elements into a generic list from an array
10.Lazy List
11.Slice list
12.Chunked List
13.Keyed List
14.Convert a collection of strings to a comma separated list.
15.Convert List To Array
16.Compare two Lists
17.Name Value Pair List
18.Get Distinct value from a List
19.Adds the elements of the specified collection to the specified generic IList.
20.List(T) Class represents a strongly typed list of objects that can be accessed by index.
21.IList Interface represents a non-generic collection of objects that can be individually accessed by index.
22.Searches a range of elements in the sorted List for an element using the specified comparer and returns the zero-based index of the element.
23.Determines whether an element is in the List.
24.Converts the elements in the current List to another type, and returns a list containing the converted elements.
25.Copies a range of elements from the List to a compatible one-dimensional array, starting at the specified index of the target array.
26.Determines whether the List contains elements that match the conditions defined by the specified predicate.
27.Performs the specified action on each element of the List.
28.Searches for object and returns the zero-based index
29.Searches for object and returns the zero-based index of the last occurrence
30.Reverses the order of the elements in the specified range.
31.Weak Collection
32.Sorted Collection
33.Paged List
34.Get Search List
35.Find All Index
36.Evented List
37.SortedList
38.Reverse a List
39.Shuffles the specified list
40.Sequence is an abstraction of a data reseqeuncer
41.Generic Paged List
42.A list implementation that is loaded the first the contents are examined
43.Creates a list by combining two other lists into one.
44.Creates a list by repeating another list.
45.Compare two arrays and two lists