5,427,813 members and growing! (16,028 online)
Email Password   helpLost your password?
Languages » C# » Generics     Beginner License: The Code Project Open License (CPOL)

Useful Generic Array Functions

By Yang Yu

Useful Generic Array Functions used to append, resize, remove elements in an array
C# (C# 1.0, C# 2.0, C# 3.0, C#), Windows (Windows, WinXP, Vista), .NET CF, .NET (.NET, .NET 3.5, .NET 3.0, .NET 2.0), Architect, Dev, Design

Posted: 10 Apr 2008
Updated: 10 Apr 2008
Views: 4,646
Bookmarked: 2 times
Announcements
Want a new Job?



Search    
Advanced Search
Sitemap
8 votes for this Article.
Popularity: 2.37 Rating: 2.63 out of 5
2 votes, 25.0%
1
2 votes, 25.0%
2
1 vote, 12.5%
3
0 votes, 0.0%
4
3 votes, 37.5%
5

Introduction

The standard .NET Framework offers quite a few generic functions to manipulate arrays, however there are some functionalities where extra code will be needed such as appending to the array, removing an element from the array, or removing all elements that fall under a condition.

Background

You should have some basic knowledge of generic classes, lists, arrays, etc.

The Array object contains some useful generic functionalities such as:

  • ConvertAll<T,O>
  • Exists<T>
  • Find<T>
  • Resize<T>
  • TrueForAll<T>

However, these functionalities by themselves sometimes do not get the job done. This is why I've extended the functionalities a bit more.

Using the Code

Basically the code is very simple and gets the job done.

 class ArrayEx {
    /// <summary>
    /// Appends a list of elements to the end of an array
    /// </summary>
    /// <typeparam name="T"></typeparam>
    /// <param name="array"></param>
    /// <param name="items"></param>
    public static void Append<T>(ref T[] array, params T[] items)
    {
        int oldLength = array.Length;
        //make room for new items
        Array.Resize<T>(ref array, oldLength + items.Length);
        
        for(int i=0;i<items.Length;i++)
            array[oldLength + i] = items[i];
    }

    /// <summary>
    /// Remove an Array at a specific Location
    /// </summary>
    /// <typeparam name="T"></typeparam>
    /// <param name="index">index to remove at</param>
    /// <param name="list">The Array Object</param>
    public static void RemoveAt<T>(int index, ref T[] list)
    {
        //pre:
        if (index < 0 || list == null | list.Length == 0) return;

        //move everything from the index on to the left one then remove last empty
        if (list.Length > index + 1)
            for (int i = index + 1; i < list.Length; i++)
                list[i - 1] = list[i]; 

        Array.Resize<T>(ref list, list.Length - 1);
    }

    /// 
    ///<summary> Thanks to homer.
    /// Remove all elements in an array satisfying a predicate
    /// </summary>
    /// <typeparam name="T"></typeparam>
    /// <param name="list">The Array Object</param>
    /// <param name="condition">A Predicate when the element shall get removed under.
    /// </param>
    /// <returns>Number of elements removed</returns>
    public static int RemoveAll<T>(ref T[] list, Predicate<T> condition)
    {
    if (null == condition || null == list || 0 == list.Length) return 0;
    
    int length = list.Length;
    int destinationIndex = 0;
    T[] destinationArray = new T[length];
    
    for (int i = 0; i < list.Length; i++)
    {
        if (!condition(list[i]))
        {
            destinationArray[destinationIndex] = list[i];
            destinationIndex++;
        }
    }
    
    if (destinationIndex != length)
    {
        Array.Resize<T>(ref destinationArray, destinationIndex);
        list = destinationArray;
    }
    
    return length - destinationIndex;
    }
}

First We Have Append<T>

public static void Append<T>(ref T[] array, params T[] items) 

This function takes any array and appends more elements at the end of the array keeping the size of the array equal to the number of elements.

Keep in mind that you do not want to be doing this over and over again since every append will cost performance. However, if utilized correctly, meaning the items being appended only happens at the end of an operation, then this will be fine.

Using The Method...

string[] strArray = new string[] { "a", "b", "c" };
string[] strArray2 = new string[] { "d", "e", "f" };

// appends d e f to the first array
ArrayEx.Append<string>(ref strArray, strArray2);

// appends one more element
ArrayEx.Append<string>(ref strArray, "g");

Console.Out.Write(string.Join(strArray));  

Then We Have RemoveAt<T>

public static void RemoveAt<T>(int index, ref T[] list) 

This method will remove an element at a specific location like the IList.RemoveAt and return the element removed.

Using The Method...

string[] strArray = new string[] { "a", "b", "c" };       
// remove element b
string Element = ArrayEx.RemoveAt<string>(1,ref strArray);

Then We Have RemoveAll<T>

public static int RemoveAll<T>(ref T[] list, Predicate<T> condition) 

This method will remove all elements from an Array satisfying a conditional predicate.

The function also returns the number of elements removed. You can alter the function to create all the elements removed if you wish. This can then be used in a recursive search to reduce search surface space.

Using The Method...

// create array from sentence
string[] strArray = "My Name is Yang Yu and I'm the best!".Split(' ');

int RemoveCount = Ordering.RemoveAll<string>(ref strArray, new Predicate<string>(
            delegate(string element)
{
    // remove all elements with ' in them
    return element.Contains("'");
}
));

Points of Interest

You may also want to create an InsertAt<T>, or Merge<T>, etc.

The functionalities provided here do not replace the ones in the wrapper class List<T> which does contain most of these methods. Determining when to use Array and when to use List depends on a number of variables. Beware...

History

  • 11th April, 2008 - Article created

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

About the Author

Yang Yu


I am a software and web developer major in computing science software engineering at the university of Alberta, and been involved in software development and architecture following various methodologies. My areas of expertise include designing and developing Web-based applications, client-server applications, and n-tier applications, with a special focus on database programming.

I have extensive expertise in OOAD, SDLC, and Microsoft. NET Framework, C#, ASP, ASP.NET, ADO/ADO.NET, Crystal Report/Crystal Reports 10 .Net, Oracle, JavaScript, VBScript, DHTML, Visual Studio .NET, SQL Server, ORACLE, T-SQL, Access 2003, Interdev, IIS, Web Services, Visual Basic 6, C#, COM/DCOM/COM+, Microsoft Transaction Server (MTS).
Occupation: Web Developer
Location: Canada Canada

Other popular C# articles:

Article Top
Sign Up to vote for this article
You must Sign In to use this message board.
FAQ FAQ Noise ToleranceSearch Search Messages 
 Layout  Per page   
 Msgs 1 to 6 of 6 (Total in Forum: 6) (Refresh)FirstPrevNext
Subject  Author Date 
GeneralRemoveAllmemberRichard Deeming8:41 14 Apr '08  
GeneralRe: RemoveAllmemberyang yu 17999998:45 15 Apr '08  
GeneralNeedlessmemberPIEBALDconsult4:32 11 Apr '08  
GeneralExtesion MethodsmemberVivek Ragunathan4:20 11 Apr '08  
GeneralSourcememberBill Warner3:05 11 Apr '08  
GeneralNo source codemember leppie 0:31 11 Apr '08  

General General    News News    Question Question    Answer Answer    Joke Joke    Rant Rant    Admin Admin   

PermaLink | Privacy | Terms of Use
Last Updated: 10 Apr 2008
Editor: Deeksha Shenoy
Copyright 2008 by Yang Yu
Everything else Copyright © CodeProject, 1999-2008
Web16 | Advertise on the Code Project