> declare it as private and just leave an empty implementation?
ideally, declare it as private and do not define it.

> Is this common/useful?
useful, yes. common, not all that much.
if there is...

this is broken when C is a const container.
c.begin() and c.end() returns objects of type C::const_iterator.

in C++98 you would have to do something like
template < typename CNTR > struct...

this is nothing specific to constructors or passing parameters to functions.
it is just the application of the C++ rules for resolving a call to an overloaded function.
#include <iostream>

void...

you can answer this yourself if you write a small test program and run it. for example:
#include <iostream>

struct A
{
A() { std::cout << "A::default constructor\n" ; }
A( const A& ) {...

> Does it make sense to write a virtual method in the templated base class
> in order to force derived classes to have an appropriate addelement() method?
no. the polymorphism provided by...

if you absolutely need a base class Chart (with virtual functions), a hack would be to overload the AddElement function.

i would prefer using templates for your containers as suggested by Narue in...

> Is there any real different between using an union between two types and a reinterpret_cast between two types
yes, there are quite a lot of differences.
a union reinterprets the layout of memory...

the typical work around (as exemplified by the standard library containers and function objects) is to have the generic type announce dependent types via suitable typedefs.
#include <vector>...

simulating long division by hand (shift and subtract):
http://courses.cs.vt.edu/~cs1104/Division/ShiftSubtract/Shift.Subtract.html

> The structs are padded so that no padding occurs when we create an array of them,
> like with a scalar variable because if the compiler padded the struct when it created the
> array it wouldn't...

struct align1
{
double a;
char b;
int c;
short d;
};

> why the compiler pads the structure in the end?

#include <iostream>
#include <limits>

// addition can be done using bitwise xor
// with adjustments for carry bits
unsigned int plus( unsigned int first, unsigned int second )
{
unsigned...

from http://www.gnu.org/software/make/manual/make.html#Implicit-Rules

> If you're never going to use a custom allocator, it doesn't make any sense to do that extra work.
the fundamental problem with your code is not that it does not cater for a custom allocator for...

> typename is not followed by a name, which I find confusing
since the intent is to declare a template template type (ttp), the identifier following typename is just a place-holder (like the name...

> So I could write something like this:
...
no, you can't. you need to write something like:
std::size_t max = 0; // Number set by user at execution
// ...
long (*pBigArray)[100][100] = new long...

> ...maybe the array is automatically cleared from memory when the application closes...

right, provided your program is running under an os ( like unix, windows, linux ... ) which gives a...

case 1 : float hipvalley(); // this is the Hip/Valley choice.
that is merely a declaration of the function hipvalley.
to invoke the function (and ignore its result), write
case '1' : hipvalley();...

#include <cstdlib>
#include <string>

inline char random_digit() { return '0' + std::rand() % 10 ; }

inline std::string random_pin( std::size_t ndigits )
{
std::string pin ;
for(...

or
// ...
int Strength = 5 ;
int Intelligence = 2 ;
int Agility = 3 ;
int Defense = 3 ;
int Health = 10 ;
int Level = 1 ;

for(;;)

> ...139 files, with 16,000 lines of code...
> ...So how do I start to disect messy code that is not documented and not written by me?
> How does somebody look at code and start to make sense of...

> 3.6 * vector_a; why can I not implement this binary operator as a member operator of a class Vector?
you can, if the class Vector is your own class.
if not ( for example for standard containers...

sortValues is not a template member. you need to modify DO_SORT

#define DO_SORT(varName, a, b, c, d) (*(varName)).sortValues(a, b, c, d)

when you are sorting an array of char, use MySort<char>...

for( int i=0 ; i<10 ; ++i )
numb2[i] = i%2 == 0 ? (i/2)*5 : i ;

> an algorithm better than FFT for getting large numbers(of the order of 10 power 30 or more)?
FFT multiplications are efficient when numbers are very large. the other popular multiplication...

> i try to avoid copying anything than 2 pointers...
swapping pointers is easy; swap pointers to arrays just like you swap any other pointers.
#include <stdio.h>

void swap( int rows, int cols,...

> maybe the book Java Concurrency in Practice addresses this thing
no, it doesn't. it is a good book on concurrency issues in general, but discusses only java.

> where do you stand vijayan121...

> is there any way to use threads in c++

the ISO standards committee (c++09) has voted voted in a number of concurrency extensions into the working draft (memory model, atomics library, basic...

for(it = aMap.begin(); it != aMap.end(); it++){
//some processing
if(//some condition){
//some processing
aMap.erase(key);
// this is undefined behaviour
// the iterator is...

sort before inserting the string into the multimap?
void fill_mmap( std::multimap< std::string, int >& mmap,
std::ifstream& file )
{
std::string line ;
for( int line_num = 1...

> Do you know how you would go about finding the length of an array?
the array 'decays' into to a pointer when you pass it to a function.
also pass the size of the array (as a second parameter) to...

> Is there anything that 'wraps' pipes?
i do not know of any, but it is very easy to roll out one of our own. eg.
#include <stdio.h>
#include <boost/iostreams/device/file_descriptor.hpp>
#include...

void clearCharArray( char arrayToClear[] )
{
int arrayLength = 0;

// Get the length of the array passed
// this will not give you the length of the array passed
arrayLength = sizeof(...

#include <algorithm>

class LakeDataClass
{
public:
char DTG[13];
float DepthOfMeasurements;
char WaveDirectionStrength[5];
char Weather[9];
float DissolvedOxygen;

dragon: > You might also be able to do this with templates
yes, if there are a lot of members, templates would provide a generic mechanism.
didn't post this earlier because i didn't want to scare...

> I find it interesting that the resolution implied by CLOCKS_PER_SEC is 1/1000000 second,
> but my actual results show 1/100 second.
how typical of linsux. appearances are more important than...

the C library clock() does not give the wall clock:

just sleeping or waiting for input will work for time() (which gives the wall time), not for clock(); no processor time is used by the process...

let's say you have a struct/class of this kind:
struct A
{
int number ;
double value ;
char name[30] ;
};
and you want to sort an array of As on the member value.
first, write a...

do not pass the address of a local variable (with automatic storage duration) to a thread function; it may not be around by the time the thread executes.
// ...
char* input_sentence = new char[32];...

ideally, do not use the (now deprecated) functionality in namespace __gnu_cxx. they have been superceded by tr1 in c++0x.
use -std=c++0x (gcc 4.3) , std::tr1 (gcc4.2) or boost::tr1 (earlier...