Book Image

.NET 4.0 Generics Beginner's Guide

By : Sudipta Mukherjee
Book Image

.NET 4.0 Generics Beginner's Guide

By: Sudipta Mukherjee

Overview of this book

Generics were added as part of .NET Framework 2.0 in November 2005. Although similar to generics in Java, .NET generics do not apply type erasure but every object has unique representation at run-time. There is no performance hit from runtime casts and boxing conversions, which are normally expensive..NET offers type-safe versions of every classical data structure and some hybrid ones. This book will show you everything you need to start writing type-safe applications using generic data structures available in Generics API. You will also see how you can use several collections for each task you perform. This book is full of practical examples, interesting applications, and comparisons between Generics and more traditional approaches. Finally, each container is bench marked on the basis of performance for a given task, so you know which one to use and when. This book first covers the fundamental concepts such as type safety, Generic Methods, and Generic Containers. As the book progresses, you will learn how to join several generic containers to achieve your goals and query them efficiently using Linq. There are short exercises in every chapter to boost your knowledge. The book also teaches you some best practices, and several patterns that are commonly available in generic code. Some important generic algorithm definitions are present in Power Collection (an API created by Wintellect Inc.) that are missing from .NET framework. This book shows you how to use such algorithms seamlessly with other generic containers. The book also discusses C5 collections. Java Programmers will find themselves at home with this API. This is the closest to JCF. Some very interesting problems are solved using generic containers from .NET framework, C5, and PowerCollection Algorithms ñ a clone of Google Set and Gender Genie for example! The author has also created a website (http://www.consulttoday.com/genguide) for the book where you can find many useful tools, code snippets, and, applications, which are not the part of code-download section
Table of Contents (20 chapters)
.NET 4.0 Generics
Credits
Foreword
About the Author
Acknowledgement
About the Reviewers
www.PacktPub.com
Preface
2
Lists
4
LINQ to Objects
Migration Cheat Sheet

Benchmarking experiment 5


How much time does it take to delete a single element in a random location in a list-based collection?

Being able to delete at random locations is also a very important functionality sought by developers. Although it doesn't make much sense in IDictionary implementations and is advisable to avoid; it is almost taken for granted for an IList<T> implantation such as List<T>.

In this experiment, we shall try random deletions from List<T>, LinkedList<T>, C5.LinkedList<T>, C5.ArrayList<T>, C5.HashedLinkedList<T>, and C5.HashedArrayList<T> and see which one wins.

The following is the benchmarking code that will work for LinkedList<T> in System.Collections.Generic:

using System;
using SCG = System.Collections.Generic;
using System.Linq;
using System.Text;
using C5;
namespace PerformanceMap
{
class Program
{
static void Main(string[] args)
{
SCG.Dictionary<int, double> perfMap
= new SCG.Dictionary<int, double...