Search - Articles
DevASP.NET for ASP.NET, VB.NET, XML and C# (C-Sharp) Developers Tuesday, March 03, 2009
Dev Articles
Search Directory
ASP.NET
VB.Net
C-Sharp
SQL Server
 

FREE 12 month online training for ASP.NET & MS Expression Studio and a Free copy of MS Expression Web with Windows Server Purchase

Home >Search > Articles & Samples > Visual C++ .NET > Collection


Search:
What's New - What's Hot
A little "garbage collector" for your project  Version: 0.00     Price: $0.00  
Total Hits: 5  |  Today: 0Author: SpaceSoft      Rating:  
Read Reviews | Write Review |  Your Rating: 

How long did you debug your application to find a memory leak?

Now, i think that I found a little solution to this problem. Here is it....

FxEngine Plugin to simulate logic gates  Version: 0.00     Price: $0.00  
Total Hits: 11  |  Today: 0Author: m_sylvain      Rating:  
Read Reviews | Write Review |  Your Rating: 

Some times ago, I tried to find a free software tool to simulate a very simple alarm using a small number of gate , without (almost) success. Because I already know the FxEngine Framework, then I decided to create my gates to simulate my simply alarm. The final aim would be: to be able to create a sophisticate bit flow using a small number of gate....

How to add support for undocumented third party hardware controllers  Version: 0.00     Price: $0.00  
Total Hits: 6  |  Today: 0Author: Greg Ellis      Rating:  
Read Reviews | Write Review |  Your Rating: 

I have always struggled with finding proper documentation for hardware controllers in my DJ software applications. Usually companies want to keep the technical details about how to interface with their hardware controllers a secret because they don't want competition to be able to support their hardware. This is understandable, but also frustrating for smaller software companies that do not have the resources to be able to create and distribute their own hardware controllers. Since I have a smal...

Memory cache for collections of objects     
Total Hits: 195  |  Today: 0Author: Pierre Couderc.      Rating:  
Read Reviews | Write Review |  Your Rating: 

This template class implements a cache for memory objects. You can use it when you have a large collection of objects, that you do not want to put entirely in memory, but you need anyway to use some of them with quick access.
It can be seen too as a kind of stl map with its size controlled....

XML as a collection  Version: 0.00     Price: $0.00  
Total Hits: 38  |  Today: 0Author: M L Viñas Livschitz      Rating:  
Read Reviews | Write Review |  Your Rating: 

If you ever dreamed about a simple MFC-Based collection to handle an ANSI XML file then here is the solution.
CXXMLFile : (Class) eXtended XML File
This class reads simple XML files. It assumes the HTML/XML conventions in symbols and tags. But, the tag ? .... ? is ignored for now. This means that no codepage support is available (to make code simpler)....

Serialize custom collections of CollectionBase     
Total Hits: 131  |  Today: 0Author: eschneider100      Rating:  
Read Reviews | Write Review |  Your Rating: 

This is a simple demo on how to serialize and deserialize custom collections, while handling derived collection items. This version also demos, serialize, deserialize of unknown derived types of cItem (see Eitem class)....

Wrapper iterator class for stl associative containers and tuple sequence containers  Version: 0.00     Price: $0.00  
Total Hits: 14  |  Today: 0Author: Nicolas Witczak      Rating:  
Read Reviews | Write Review |  Your Rating: 

Modern C++ programming relies heavily on STL and boost librairies, parts are now in the standard. STL separates algorithms from container thanks to iterator pattern. Use of ready made algorithm is encouraged over crafted for loop. Containers are themselves presented as sequence container and associative containers. One of a sequence container is std::vector T class, on of associative one is std::map T,V class. Associative containers are basically sequence container on std::pair T,V with extra s...

The way to calculate a collection of folders size  Version: 0.00     Price: $0.00  
Total Hits: 26  |  Today: 0Author: 365days.enjoy      Rating:  
Read Reviews | Write Review |  Your Rating: 

I got a lot help from the CodeProject, now I want to pose one small program to help others at he same time to make progress, I hope it's helpful to the others.

Some times, we want to give our user the folders size they select on the fly the same as we click on a folder perperty shows, the foder's size will increase continually. How to get the folder/file/drive size, Of course, we can get some similar articles in the codeproject. such as Hans Dietrich's project. His app can obtain a...

NT Remote and Local Group and User Account SID Collector Tool  Version: 0.00     Price: $0.00  
Total Hits: 16  |  Today: 0Author: Lim Bio Liong      Rating:  
Read Reviews | Write Review |  Your Rating: 

Some time at the beginning of 2000, a friend of mine approached me to write a tool that is able to collect all the SIDs of all Group and User Accounts of an NT machine (local or remote)....

A garbage collection framework for C++ - Part II  Version: 0.00     Price: $0.00  
Total Hits: 23  |  Today: 0Author: William E. Kempf      Rating:  
Read Reviews | Write Review |  Your Rating: 

This article deals with refactoring the code originally presented in A garbage collection framework for C++ in order to allow polymorphic types to be used. If you've not already done so you should read that article first. This article mostly deals with the process in which the code was refactored to illustrate to new programmers how code is maintained in real life situations. If all that you're interested in is using the gc_ptr smart pointer in your code you do not need to read this article. Jus...

A linked list collection class in MC++  Version: 0.00     Price: $0.00  
Total Hits: 51  |  Today: 0Author: sultan_of_6string      Rating:  
Read Reviews | Write Review |  Your Rating: 

If you examine the functionality of the ArrayList class, you'll find that it's quite ridiculous. When the array reaches maximum capacity, it creates a new array with double the capacity, copies the items from the old array into the new one and discards the old array. Convoluted and messy. Every C/C++ programmer knows that the only way to make structures that are 'really' dynamic is to use linked lists. I've created a class in Managed C++ that does just that. Furthermore, I've included a TypedLi...

Implementing custom collection classes with MC++  Version: 0.00     Price: $0.00  
Total Hits: 38  |  Today: 0Author: Nishant Sivakumar      Rating:  
Read Reviews | Write Review |  Your Rating: 

A collection class is basically a pool of indexed objects. This means we know how many objects the collection has at any one time. We can enumerate the objects one by one. We can access the object associated with a particular index. Usually collection classes are also sortable. For collection classes to be sortable, the objects it holds or collects must be comparable among objects of it's same type. In this tutorial we'll see how to design and create collection classes of our own. We'll create a...

Upgrading an STL-based application to use Unicode.     
Total Hits: 74  |  Today: 0Author: Taka Muraoka      Rating:  
Read Reviews | Write Review |  Your Rating: 

I recently upgraded a reasonably large program to use Unicode instead of single-byte characters. Apart from a few legacy modules, I had dutifully used the t- functions and wrapped all my strings literals and character constants in _T() macros, safe in the knowledge that when it came time to switch to Unicode, all I had to do was define UNICODE and _UNICODE and everything would Just Work (tm)....

single_pass_search: Generic sequence searching through single-pass iterators     
Total Hits: 97  |  Today: 0Author: Jim Xochellis      Rating:  
Read Reviews | Write Review |  Your Rating: 

std::search is a notable STL algorithm very useful and powerful. How interesting would it be to have an even more versatile sequence searching algorithm? Can we actually have something more generic than std::search? More efficient maybe? Or is it possible to have something that is more generic than std::search and more efficient at the same time?...

The complete guide to STL: Part 3 - Deque     
Total Hits: 49  |  Today: 0Author: cristitomi      Rating:  
Read Reviews | Write Review |  Your Rating: 

In the third part of the tutorial series, we will learn about the STL deque container. The deque (double ended queue) container combines the facilities offered by the vector and the list into a single class. It occupies noncontiguous memory, divided into large contiguous memory blocks, allocated proportionally to the growth of the container and managed by vectors of pointers. This implementation allows the use of all basic vector operations, and also the push_front() and pop_front() functions. T...

Polymorphic STL containers and iterators     
Total Hits: 75  |  Today: 0Author: Philippe Guglielmetti      Rating:  
Read Reviews | Write Review |  Your Rating: 

STL standard containers store objects of a fixed type, specified in their template parameter. They do not, therefore, support polymorphism by design: you can't store objects from a class hierarchy easily....

Input and output iterators for sampling a data stream     
Total Hits: 125  |  Today: 0Author: Andy Brummer      Rating:  
Read Reviews | Write Review |  Your Rating: 

I was working on an application to show 3D paths using Direct3D and ran into a video card limit in the number of elements in the path. To solve the problem, I wrote some simple code to sample the data I was generating without just clipping the data off at a fixed point. While I needed it for this special case, the problem is a general one that arises in stretching or shrinking data such as images or changing the sample rate of audio files....

The Token Iterator     
Total Hits: 95  |  Today: 0Author: The Token Iterator      Rating:  
Read Reviews | Write Review |  Your Rating: 

The purpose of Token Iterator is to provide an easy to use, familiar, and customizable way in which to go through the tokens contained in a string. Our hypothetical example will be breaking a string into words, and outputting the words as a list. Here is the code....

An STL like Tree Class     
Total Hits: 85  |  Today: 0Author: Jack Hui      Rating:  
Read Reviews | Write Review |  Your Rating: 

For more than a year and a half I have had to use some kind of multi-node tree to do something. However, all I found from the Internet are binary trees or equivalents. I therefore decided to write my own. Because I had to finish it pretty fast, I spent only two days for it, so it may be buggy....

STL containers map, set, and list with fast array access     
Total Hits: 81  |  Today: 0Author: Ray Virzi      Rating:  
Read Reviews | Write Review |  Your Rating: 

Each of these implements the same interface as the STL class in the second part of its name. In addition, each one also implements the STL interface for the vector T class, providing fast array access via operator[] and at(). T is the type of the contained class. Key is the type of the lookup key for pair-associative containers. Cmp is the comparison predicate and must be a binary predicate with arguments of type T for set and type Key for map. If you do not provide a comparison predicate, it wi...



Disclaimer - Privacy
© 2002-2012 DevASP.net