|
|
|
|
|
| | Total Hits: 217 | Today: 0 | Author: ANDREW TROELSEN | Rating:  |
| | 
This chapter rounds out your introduction to the core aspects of the C# language by examining a number of advanced (but extremely useful syntactic constructs.To begin, you learn how to construct and use an indexer method. This C# mechanism
enables you to build custom types, which exposes internal subtypes using the familiar bracket operator (i.e., []). If you have a C++ background, you will find that creating a C# indexer method is analogous to overloading the [] operator on a C++ class. Once... |
| | Total Hits: 174 | Today: 0 | Author: Horatiu V. Jula, Nicu G. Fruja | Rating: |
| |
In this paper we present our implementation of the Abstract State Machine(ASM) model, that has been defined in [4] to formalize the C# static and dynamic semantics. We show all the techniques we have used to get an efficient execution.
This work is part of a larger project which aims to establish some outstanding properties of C# and CLR virtual machine by mathematical proofs, such as the C# type safety and the correctness of the CLR bytecode verifier. As part of this
effort, an ASM model ... |
| | Total Hits: 512 | Today: 0 | Author: Jeff Louie | Rating: |
| |
Congratulations! If you have survived these past 18 chapters, it is finally time to put together a working program that demonstrates many of the concepts presented in this "Twisted Tutorial on Object Oriented Programming". The following "Draw" program dynamically populates a "Shape" menu with DrawableShape choices and draws the shapes on mouse up. The program then adds the DrawableShape object to an ArrayList named drawHistory. Each DrawableShape object in the ArrayList stores its own state incl... |
| | Total Hits: 495 | Today: 0 | Author: Jeff Louie | Rating: |
| |
In this chapter you will learn two approaches to creating a "growable" class factory. The first approach simply makes use of Types and Activator.CreateInstance to build a class factory. The second approach abstracts object creation into an Interface, IConstructDrawableShape. The interface based class factory makes use of a helper class to adapt an existing Drawable class to a menu driven class factory. The first step is to declare the IDrawableShape interface and code an abstract base class, Abs... |
| | Total Hits: 424 | Today: 0 | Author: Jeff Louie | Rating: |
| |
In this chapter, I am going to ramble about and suggest one alternative system for declaring, using and handling exceptions. I will then go on to discuss checked exceptions, design by contract, validation pre-conditions and assertions. The first fundamental question is "What is an exception?" or "When should an exception be thrown?" In the past, exceptions were said to signal an exceptional condition, not routine errors. David Abrahams has argued that one person's exception is another person's e... |
| | Total Hits: 172 | Today: 0 | Author: Jeff Louie | Rating: |
| |
In this chapter I will touch upon the difficult topic of multi-threaded programming including concurrency, locks and threads. I will present an approach to coding safe multi-thread code using inheritance. In a nutshell, I suggest a division of labor in which all "critical sections" are encapsulated into an abstract base class. This base class encapsulates or hides the complexity of thread safe access and operations on shared variables.... |
| | Total Hits: 118 | Today: 0 | Author: Jeff Louie | Rating: |
| |
Well, I've tried as long as possible to avoid the the "nuts and bolts" of object oriented programming. It's sort of like going in to the dentist for a root canal. You know it needs to be done, but it is going to be painful and you want to put it off. The good news is that once you have the root canal the pain goes away! So just dive in. In this chapter you will learn about static methods, factory methods and constructors. You will be introduced to the creational patterns "Class Factory" and "Sin... |
| | Total Hits: 119 | Today: 0 | Author: Thanh Dao | Rating:  |
| |
If you want to aggregate a web service with your application service, or if you are trying to implement someone else's WSDL, then you need to pay attention while viewing them. That means you are encountering the web service interoperability problem. That was the problem I had too, and I thought that having a GUI for viewing a WSDL like tree structure could be really cool.... |
| | Total Hits: 192 | Today: 0 | Author: George Shagov | Rating: |
| |
In the beginning was � a word. And the word was � an algorithm!? Or should I say al-khwarizm? What Wikipedia says about the term algorithm?
Citing: �An algorithm (the word is derived from the name of the Persian mathematician Al-Khwarizmi), is a finite set of well-defined instructions for accomplishing some task which, given an initial state, will terminate in a corresponding recognizable end-state�.
Al-Khwarizmi? Citing: �Abu Abdullah Muhammad bi... |
| | Total Hits: 177 | Today: 0 | Author: Joseph A Reddy | Rating: |
| |
For me, in software development, it is all about why. I feel a very strong need to understand why I am doing everything and anything I do. Furthermore, I am upset with myself when I cannot clearly state why, and on the flip side take pride in knowing why: why I choose a minimum of three layers in darn near any application, why I rarely if ever read books on a language, why I don’t blindly choose auto numbers for primary keys in databases, why I prefer business-object-oriented development, why I... |
| | Total Hits: 211 | Today: 0 | Author: Sateesh Kumar | Rating: |
| |
In this article, we will look into setting up the environment for SLP Services. For small ISVs, it is hard to maintain their own licensing systems. So, it is feasible to go with SLP online services provided by Microsoft. In order to use SLP online services, we need to have an account. Go to SLP Site and click on New User as shown below:... |
| | Total Hits: 168 | Today: 0 | Author: en.csharp-online.net | Rating: |
| |
The heap sort does not require massive recursion or multiple arrays to work. This makes it an attractive option for very large data sets of millions of items. The heap sort works as it name suggests - it begins by building a heap out of the data set, and then removing the largest item and placing it at the end of the sorted array. After removing the largest item, it reconstructs the heap and removes the largest remaining item and places it in the next open position from the end of the sorted arr... |
| | Total Hits: 160 | Today: 0 | Author: en.csharp-online.net | Rating: |
| |
The Insertion sort works just like its name suggests - it inserts each item into its proper place in the final list. The simplest implementation of this requires two list structures - the source list and the list into which sorted items are inserted. To save memory, most implementations use an in-place sort that works by moving the current item past the already sorted items and repeatedly swapping it with the preceding item until it is in place.... |
| | Total Hits: 145 | Today: 0 | Author: en.csharp-online.net | Rating: |
| |
The quick sort is an in-place, divide-and-conquer, massively recursive sort. As a normal person would say, it's essentially a faster in-place version of the merge sort. The quick sort algorithm is simple in theory, but very difficult to put into code. The recursive algorithm consists of four steps:
1. If there are one or less elements in the array to be sorted, return immediately.
2. Pick an element in the array to serve as a "pivot" point. (Usually the left-most element in the array... |
| | Total Hits: 141 | Today: 0 | Author: en.csharp-online.net | Rating: |
| |
The merge sort splits the list to be sorted into two equal halves, and places them in separate arrays. Each array is recursively sorted, and then merged back together to form the final sorted list. Elementary implementations of the merge sort make use of three arrays - one for each half of the data set and one to store the sorted list in. The below algorithm merges the arrays in-place, so only two arrays are required. There are non-recursive versions of the merge sort, but they don't yield any s... |
| | Total Hits: 105 | Today: 0 | Author: en.csharp-online.net | Rating: |
| |
The shell sort is a "diminishing increment sort", better known as a "comb sort" to the unwashed programming masses. The algorithm makes multiple passes through the list, and each time sorts a number of equally sized sets using the Insertion Sort. The size of the set to be sorted gets larger with each pass through the list, until the set consists of the entire list. (Note that as the size of the set increases, the number of sets to be sorted decreases.)... |
| | Total Hits: 274 | Today: 0 | Author: Boris Kolesnikov | Rating: |
| |
Lately I’ve read CLR via C# by J. Richter dedicated to the internals of NET 2.0 and C# peculiarities deriving from it. So I’ve decided to practice a little and write my new application in C#. The part of this application I present here. It’s an asynchronous named pipe server using overlapped I/O plus a synchronous (or they also say blocking) named pipe client.... |
| | Total Hits: 138 | Today: 0 | Author: Alexey Zubritsky | Rating: |
| |
Imagine that you are using a dynamically created library. Imagine you are constructing a plug-in engine for your application. You will attach assemblies dynamically in both these cases. Then it will be necessary to create instances of some unknown classes from attached assemblies. Maybe you even will need to call some unknown functions of these unknown classes. You can solve a part of such problems with usage of base classes and interfaces. However, several situations require reflection anyway. ... |
| | Total Hits: 123 | Today: 0 | Author: Diablo iii | Rating: |
| |
A simple article on Asynchronous implementation of SMTPClient for sending emails through SMTP Server....... |
|
|
|
|
|
|
|
|
|
|
|
|
|