Tutorial search
Tutorials
Stuff
Affiliates
Photoshop Templates
Featured Photoshop templates - professional ready to use designs for your next project.
View all templates
GNU Debugger - GDB Tutorial - C++ tutorial

A debugger is the best friend of a software programmer.
This tutorial assumes you already know how to program in C and C++ and you can compile and execute programs.
GNU Debugger - GDB Tutorial tutorial description
| Added on | 06.03.2008 |
| Total clicks | 0 |
| Tutorial Rating | 0 |
| Tutorial Difficulty | 0 |
GNU Debugger - GDB Tutorial
More cool C++ tutorials:

A tutorial for beginners, offerring a look into C++ structures. How structures can be defined, created, accessed and what is their actual use. Includes example code.

Reference types provide excellent flexibility and performance of large structures. This is the reason that classes are reference types and structs are data value types. As you will probably know, reference types do not store the actual value of the object but a pointer to a memory location. This pointer is stored on the stack whereas the object itself is located in the managed heap.

The break statement has two uses. You can use it to terminate a case in the switch statement.

Sequential lists are collection of objects that can be entered or extracted in a sequential way. They don’t provide access to objects in the middle on the list. You can only access a specific object each time you extract it. The two classes named “Queue” and ”Stack” which belong to the “System.Collections” namespace provide you with this kind of functionality, each of them in a slightly different way. The Queue class offers you access to the first object on the list, whereas the Stack class offers you access to the last object on the list. By first and last we mean the first and last object that entered the list. So, the Queue class is a First-in, First-out collection(FIFO Collection) whereas the Stack class is a Last-in, First-out(LIFO Collection). In this tutorial you will create and use both classes to see how they behave when entering and extracting data. You will usually work with such collections with temporary and disposable data. For a more permanent use, arrays provide much better functionality.





