Quantcast
Channel: C++ – Vladislav Online
Browsing all 8 articles
Browse latest View live

Image may be NSFW.
Clik here to view.

Error Handling – The C++ Way

In my experience as software developer, I noticed that there are lots of people that write in C++, but do not use exceptions. They prefer to use return codes instead. I guess that this is caused by...

View Article



Image may be NSFW.
Clik here to view.

Memory Mapped Files

A memory mapped file is a disk file (or a part of it) that has been associated to a segment of the virtual memory space of a process. It’s useful when you need to manipulate files that are too large to...

View Article

Image may be NSFW.
Clik here to view.

C++ Unit Testing Frameworks

Unit testing is focused on the smallest testable part of an application. A unit test exercises an individual portion of code, to determine if it functions properly. Unit testing: reduces the cost of...

View Article

Tracing Memory Issues

I wasted two weeks of my life, hunting for a bug that is corrupting the heap of a server application. The application runs on Unix-like OSs and is fairly complex. It’s multithreaded and consists of a...

View Article

Image may be NSFW.
Clik here to view.

Using CxxTest

Unit Testing 2 of 3 Having compared the two most popular C++ unit testing frameworks, let’s move on to the next step – the actual usage. Personally I prefer CxxTest, that’s why the samples bellow...

View Article


C++ Singleton Implementation

Singleton is the simplest and probably the most widely used of all design patterns. It’s so popular that some IDEs (like SlickEdit) have templates for its generation. The purpose of this design pattern...

View Article

Image may be NSFW.
Clik here to view.

C++ Observer Implementation

The Observer design pattern is used for state change notifications. An object called subject (or publisher) has a list of dependents, called observers (or subscribers). When the subject changes state,...

View Article

Image may be NSFW.
Clik here to view.

Binary Search Algorithm

Description The binary search algorithm is a divide and conquer algorithm, that takes a sorted array as an input. It works by comparing the searched value (key) to the middle element of the array. If...

View Article

Browsing all 8 articles
Browse latest View live




Latest Images