Home > Articles > Programming > Windows Programming

  • Print
  • + Share This
This chapter is from the book

Visual Basic .NET

I, for one, have been longing for Visual Basic .NET for a long time. Why, you ask?

Problems Solved with Visual Basic .NET

VB has always had great ideas for how applications should be built, but the implementations have had quirks. The following are a few examples of problems that were found in VB6 but that are now solved in Visual Basic .NET:

  • WithEvents can't be used with user-defined interfaces—The first time I tried to use WithEvents with user-defined interfaces, it took me half a day to decide that it just wasn't possible. A call-back solution solves the problem, but it's still irritating that the system-plugged solution doesn't work.

  • Single-threaded apartments (STA) are not always a sufficient model for multithreading—VB6 protects us from ourselves. Most of the time, this is a good thing. On the other hand, when we have advanced needs and know what we are doing, it would be nice to have the capability to move into dangerous grounds. Using free threading is a typical example. This is definitely interesting for COM+ components. The built-in synchronization support in COM+ helps a lot with writing thread-safe code without STAs.

  • When GlobalMultiUse is used, the class must live in another DLL—I have also had problems with GlobalMultiUse in COM+ applications. Therefore, I instead use old-style code modules for my helper routines in VB6. That means I often employ code reuse instead of binary reuse, but I also skip some instantiation overhead (both when I write the code and when the code is executed).

  • The class editor isn't made for writing user-defined interfaces, and VB creates an ugly type library—Because of this, although it is possible to take some control of the interfaces with VB6, serious VB6 developers often write the interfaces in IDL and compile them with Microsoft Interface Definition Language (MIDL, the compiler that transforms IDL into, for example, a typelib). There is not a lot of "VB feeling" in that approach, but it is the preferred way.

  • There is a lack of strong typing—If I forget to declare the data type for a variable or parameter, I consider this a bug, and I definitely want the compiler to tell me about it. VB6 forgives and offers a Variant instead. Another example is that VB6 forgives when I forget to do an explicit cast. It makes an implicit one automatically. Is it good to be forgiving? No, not in this case. Hiding risks and bugs is not a good thing.

  • There is a weak error-handling scheme—The error handling in VB6 is quite weak and definitely not well understood. Unfortunately, it's not uncommon to find insufficient or incorrect error-handling code in articles published by Microsoft, either.

  • The implicit cleanup is shaky—Especially in a highly stressed server-side scenario, there have been several reports that the implicit cleanup of VB6 isn't cleaning up correctly. There is also the more well-known circular reference problem of COM that you have to break up manually. (To understand the circular reference problem, assume that you have two objects, each of which keeps a reference to the other object. It's not enough to set one of those objects to Nothing explicitly. The reference counting–based cleanup algorithm in COM will keep both objects alive.)

  • There is a lack of shared (or class or static) members—I tried to implement an ordinary Singleton4 (which means one single object, reused over and over again, similar to a global object) without any luck when VB4 was released, because VB4 didn't have members that belong to the class rather than the objects. The same goes for VB5 and VB6.

In addition to these problems, there has also been a lack of other object-oriented concepts too. The most common complaint in that area is probably the lack of implementation inheritance. (Implementation inheritance means that a class can inherit the implementation from another class. When a programmer refers to "inheritance," he or she is probably referring to this type of inheritance.) At first, I thought Microsoft was "creating" a truth when they said that large projects would suffer if you used implementation inheritance. (Over the years, I have developed an ability to see conspiracies everywhere.) A few years later, I read Clemens Szyperski's Component Software. Beyond Object-Oriented Programming5 and I understood that it was a well-known fact in academic research. Since then, I've been happy using user-defined interfaces and separating the interface from the implementation. I will use user-defined interfaces a lot in .NET too, but there are situations for implementation inheritance. Inheritance is good if you want to inherit the implementation from the base class, but that is actually the only case. We also only have single inheritance in .NET and, therefore, you have to be careful to not "waste" the single inheritance possibility.

As I mentioned earlier, these problems have all been solved with Visual Basic .NET. Visual Basic .NET = the VB way, with fewer quirks.

New "Problems" with Visual Basic .NET

Unfortunately, even though Visual Basic .NET solves a lot of problems, it introduces some as well. For one, Visual Basic .NET is a much harder language to learn for newcomers than VB6. It is more competent, but also full of advanced concepts. Formal training and/or much experience are a must. In fact, for this reason and others, some developers don't like Visual Basic .NET at all. In my opinion, it's a huge and great leap forward. One thing that does irritate me is that between beta 1 and 2, Microsoft suddenly announced that they were changing Visual Basic .NET so that is was more consistent with VB6. They based this decision on the feedback (or, rather, criticism) they got from the VB MVPs. When I discussed this with Microsoft, I was told that these changes would only increase backward compatibility, and that this wouldn't affect the future at all. I don't agree. We will have to live with those mistakes a long time.

The following are the changes Microsoft made between beta 1 and beta 2 of Visual Basic .NET:

  • True should be represented as -1 in numerical form, not as 1—If you have coded so that you are dependent on this, you should be prepared to make changes in the future.

  • And and Or will not be short-circuiting—The main risk was said to be if a user had written an If clause as follows:

  • If a = 1 And InitializeSome() Then

    Assume that InitializeSome() sets some global variables. If And would be short-circuiting and a = 1 is False, InitializeSome() would not execute in Visual Basic .NET. In my opinion, this type of coding is a hack, and the programmer should be prepared for ugly code like this to break in the future. It won't happen in Visual Basic .NET.

    If you want a short-circuiting And/Or, you should use AndAlso/OrElse instead. I always want it to short circuit, so I have to get used to using those new syntactic elements.

  • And/Or will be bitwise operations again, as in VB6—(Before this change, they were purely logical operators and BitAnd/BitOr had to be used for bitwise operations.)

  • Array-declarations should set the upper bound, not the number of elements—If you declare an array as follows:

  • Dim x(5) As Integer

    you get an array of six elements, not five. Over the years, this has irritated me repeatedly. It's not intuitive, and I can't see the point in doing it like this.

Despite these changes, the MVPs are still unhappy with Visual Basic .NET. The only thing Microsoft achieved was to make the language weaker and to irritate a large and quiet part of the VB community.

I decided on Visual Basic .NET as my .NET language of choice quite early. After that, when Microsoft did their movement back, I almost decided to use C# instead. It's actually not a dramatic decision. You can be switching between Visual Basic .NET and C#, and still be quite productive. I will probably work mostly in Visual Basic .NET, despite some irritating details, because of my background. I'm sure that I'll use C# quite a lot as well.

  • + Share This
  • 🔖 Save To Your Account

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020