C / C++ Forum

As a new C++ programmer can someone tell me if it is possible to write regular C++ programs (Visual C++ 6) in Microsoft's Visual Studio .NET platform. For example, will any code I write in VC++6 run in .NET without alteration. Thanks.

Dear all, I am learning C++ and I got a little confused about dynamic allocation of arrays. Any help is greatly appreciated. In the following piece of code, is the use of the operator new strictly necessary ? I mean, can I safely replace the line "a=new double;" with "double a", and keep "delete a;" to free the reserved memory ? Many...

Hello dear membres of the comp.unix.programmer. Please , I've got the following question to submit and I need your help. Here below you'll find a lexical and a syntaxic analysers. The lexical analyser (flex) find out variables, numbers and the '#' character. The syntaxic analyser (yacc) surveys "number diese number" patterns , or...

Hi, im pretty new to this so plz cut me some slag ;-) anyhow, i need to delete an array, or what i really need is to increase the array size, i was think i could be done by copying the array into a temorary array of the same size, then delete the original, initiate the old array again, but now with more spaces/cell or what u call it, then...

This is an old problem of mine. Basically I have an abstract base class which represents a generic iterator over a collection of elements, and various derived classes that implement the traversing on specific data structures. For each iterator I want to be able to specify the four possible const combinations, corresponding to the various ...

Hey all, Is there a way to call the sleep() function to sleep a certain amount of milliseconds instead of seconds? If this is not possible with sleep() is there some other function that can do this? Currently I'm using sleep and passing it a float but I think it is not working. Any suggestions? ..jay

I'm writing an application that decodes a file containing binary records. Each record is a particular event type. Each record is translated into ASCII and then written to a file. Each file contains the same events. At the moment each record is processed one after the other. It taks about 1m40s to process a large file containing 70,000...

We are working on vc++ project and are using mfc applications for gui. we want to shift our project to linux, is there any method by which we can make mfc work on linux

Hi all, In my code I use different vectors of the same size to hold some data. At some point I need to iterate through all vectors at the same time. Now, the question is what type should the index variable have? size_t? vector<X>::size_type? vector<Y>::size_type? Example code: -------------------- vector<X> xv; vector<Y> yv;

Anyone know how to see the source code from the .exe file?

Greetings, im Danilo, a student from TUP Manila and taking up COMPUTER SCIENCE. we are going to have a defense or we could say a project in turbo c. i just wanna know how to use the SWITCH FUNCTION cause we really need it badly. about the array in the interger type variables, what if i put this: int num; then print some statements so...

I have the following code, which use template as the parent class of my other class. But I have "instantiated from here" compile error at this line: class C: public B2<A>. Can some one please tell me why? class AI {

I am implementing a variation on the Singleton design pattern, that allows up to 8 objects of a class to be instantiated, and returns a null pointer for anything more than 8. I am running into a compile problem with GNU g++. Here is the code: /******************** FILE sample.h ********************/

So I have this: double x = .25; double y = .5; double z = .25; double probability; int index; while(index < 30) {

Is it guaranteed that STL iterators are aggregate types and can thus be derived from? I'm thinking along the lines of, for example: class DerIter : public std::vector<int>::iterator {...}; My concern is whether the standard might allow an implementation to use a bare pointer as an iterator.

Hello, Trying to debug a weird problem here. When I run this program many times over, at some point argc gets corrupted and I get the error that enough number of arguments are not provided. It definitely seems to have something to do with the env. variable being set and used because the previous version of this code did not have that...

I'm very sorry for the offtopic, but I haven't known where else to post. Can I solve n-order linear ode with gsl? Some like this: f(n)(x) - it's n-order derivative of f(x) A(n), B, D - scalar coefficients A(n)*f(n)(x) + A(n-1)*f(n-1)(x) + ... + A1*f(1)(x) + A0*f(x)+B = D*g(x) It would be precious to see a little example :)

Here is a program- /* PROGRAM: To find the difference between two dates */ #include<dos.h> #include<stdio.h> #include<conio.h> #include<process.h> void valid_date(int,int,int); int getkey(void); void differ_dat(struct date *,struct date *); const int mth={31,28,31,30,31,30,31,31,30,31,30,31};

I have two structures; struct cordsys { int y, x, length }; struct provinces { int number; int type; struct cordsys cord;

#include <iostream> #include <vector> #include <string> #include <algorithm> #include <iterator> using std::cout; using std::vector; using std::string; using std::endl;

Hi, Is there a free version of the c++ lint tool available on linux? If yes, can you please tell me where is it? Thank you.'

Is there any array template implementation available? I mean <array> from C++ Technical Report.

I use this function that I wrote for inputting strings. It's meant to return a pointer to mallocated memory holding one input string, or 0 on error. (Personally, I prefer to use 0 to NULL when returning null pointers.) It looks pretty watertight to me, but my version of lint complains about use of deallocated pointers, etc. Is this code...

Could you please tell me which is the most efficient of way writing a BOOLEAN array to a file. Thanks a ton. Speed

Hi every one, I got very basic question, here i go: Say i have 11001 11010 bits which are infact 10 bits. Now i want to address every bit so if it is zero i would add one and if it is one then i would be adding zero. Folks say it manchester coding. Please note that left hand side just accept a single bit for every operation.