|
Just an FYI,
You might want to post in the forums for C++, this is Managed C++, which is code written to run on the .NET Framework.
Eventhough, you could comile with the /clr flag and run native C++ in the CLR, but the point is post in the right forum for better respones.
R.Bischoff
Tengas un buen dia
|
|
|
|
|
Here is the section out of my program that I am having problems with.
char first[20];
ifstream
fin;
openfile(fin);
char str[20];
char* trun;
char* trun2;
char *seps = "\0";
while (!fin.eof())
{fin.getline(str, 30, '\n');
fin.ignore(1);
cout<<str<<endl;
trun = strtok (str,seps);
cout<<"---"<<trun<<"---\n";
if (!doRetrieveVertex (graph, trun))
{doInsertVertex (graph, trun);}
strcpy(first, trun);
while (trun2 != NULL)
{ cout<<trun2;
trun2 = strtok (NULL, seps); \\Here
if (!doRetrieveVertex (graph, trun2))
doInsertVertex (graph, trun2);
cout<<"Internal while";
}
cout<<"External while";
}
If I comment out where it says "trun2 = strtok (NULL, seps);" Then it will run but it stays in an infinite loop inside that Internal while loop. But if I do not then I get a core dump. Please help me if you can it is due tomorrow. Thanks
James
|
|
|
|
|
1 2 50 3 70 4 23
2 1 50 3 34 4 75
3 1 70 2 34 4 80
4 1 23 2 75 3 80
Here is some sample data that we created and also I changed where seps is to " " so that it will break it into pieces. Basically what it is doing is getting the first line and then breaking off th efirst piece and retaining that and then breaking the others off and adding those. We are making a graph if you are wondering.
|
|
|
|
|
You can use your ifstream to read consecituve ints from your file directly without messing with this C ugliness.
And you asked in the wrong forum, this has nothing to do with MC++
Christian
I have several lifelong friends that are New Yorkers but I have always gravitated toward the weirdo's. - Richard Stringer
|
|
|
|
|
You are accessing uninitialised memory for turn2 at
cout<
|
|
|
|
|
|
please visit http://www.apptemplate.com
|
|
|
|
|
i wanna ask how to link a dictionary wid my program if i want to code a dictionary in c++ and link it wid thesaurus as we can consult a word in MS word.
nayyab
|
|
|
|
|
Hello,
I just found this article :
http://www.codeproject.com/csharp/rotateimage.asp
but the code is in C#...
is it possible to use it in a Managed C++ project ?
and what do i have to do ?
thanks
|
|
|
|
|
Of course you can, they are both .NET langauges.
If the C# contents are in project form you want to just add the C# project to your MC++ solution.
If the C# contents you want are in .dll form, then you just add a reference to the C# .dll, from your MC++ solution.
If you don't know how to add projects/references view the SDK/VS.NET relevant documentation.
p.s. if the c# logic you want is embedded in an aspx, then just create a c# library and cutnpaste from aspx to your library.
R.Bischoff
Tengas un buen dia
|
|
|
|
|
thanks for all
it's working fine now 
|
|
|
|
|
Does any one know how to map a network drive using manage c++?
|
|
|
|
|
all,
i was asking if i can develop an ASP.NET Pages with
MC++ or even the new C++/CLI
i know that someone post an article about this before, but as i can remember , someone reply and he wasn't recommending that approache,
thanks
|
|
|
|
|
|
Does anyone know where I can find low level I/O tutorials such as writting to the boot sector, or directly to the disk. I'm sure i need to do this using assembly, but any tutorial in the right direction would be a nice start. How about a tutorial to get system information, ie. drives, cpu, ram, etc, preferable not through windows, again, probably through assembly.
thanks
~Guyaton
|
|
|
|
|
guyaton wrote:
preferable not through windows,
This is the wrong board for that question. This is about MC++, that runs under CLR.
Try posting in an assembler programming forum.
R.Bischoff
Tengas un buen dia
|
|
|
|
|
I have visual c++ .net 2003 and am trying to add an MSchart to a form. I've selected it from the coms list and added it to the tool box. I then go to ad it to the form and get an AxImp.exe error message telling me it can't find AxInterop.OWC10.dll even though it's in the debug directory of the project. I have the same problem if I try using any other AxtiveX component, just a different dll in the error message.
|
|
|
|
|
i do not know any C++ so please explain in little detail this prob is from some one else who is very much in need--------------------------------------------------------------------------------
QUESTION: WRITE A C PROGRAM TO IMPLEMENT NATURAL DEDUCTION FOR MAX VARIABLES POSSIBLE??
YOU CAN ALSO EXPLAIN THE APPROACH TO SOLVE THE PROBLEM
HINT:I WAS TOLD APPROACH OF GAMING TREE SUITS THE PROBLEM BUT NOT HAVING MUCH KNOWLEDGE
OF TOPIC I WAS UNABLE TO IMPLEMENT IT.
OTHER APPROACHES ARE WELCOMED.
ABOUT THE TOPIC:
Natural deduction refers to related proof systems for several different kinds of logic, intended to be similar to the way people actually reason. Unlike many other proof systems, it has many rules and few axioms. Sequents in natural deduction have only one formula on the right side.
Natural Deduction has Introduction and Elimination Rules for each logical connective such as and depicted as "^" above. Justifications for each step shown in square brackets explicitly identify which previous lines in the proof are used, as well as which inference rule.
ITS RULES ARE
A B
------ [/\,intro]
A /\ B
A /\ B
------ [/\,elim]
A
A /\ B
------ [/\,elim]
B
A
------ [\/,intro]
A \/ B
B
------ [\/,intro]
A \/ B
A \/ B A => C B => C
---------------------- [\/,elim]
C
A <=> B
------- [<=>,elim]
A => B
A <=> B
------- [<=>,elim]
B => A
A => B B => A
-------------- [<=>,intro]
A <=> B
A => ff
------- [~,intro]
~A
A ~A
----- [~,elim]
B
ff
---- [efq]
A
A A => B
--------- [mp]
B
---- [true]
tt
------- [tnd]
A \/ ~A
ankit
|
|
|
|
|
If this was not a homework question, I might tell you the right forum to post it in.
Tell your 'friend' that he's screwed. Or invite 'him' to ask 'his' teacher for help, then try to solve it, and if still stuck, then you ( ooops.... he ) can post questions in the appropriate forum here.
Christian
I have several lifelong friends that are New Yorkers but I have always gravitated toward the weirdo's. - Richard Stringer
|
|
|
|
|
Mr Ankit,
hope you don't like this comment and will beat hell out of me when you found me.
this is not a Homework solving Forum, try to build a application,if any problem persist every buddy in CP is helpful enough to solve your problem.
anyway,also this is not a right forum to post this type of problem.the right forum this is Visual C++.
but last not the least , I Too don't know about natural deduction 
-----------------------------
"I Think this Will Help"
-----------------------------
Alok Gupta
visit me at http://www.thisisalok.tk
|
|
|
|
|
I want a java ssl client to communicate nessusd server which is done in c and using SSL protocol (TLSv1) by using socket programing. If u have any idea about it pls mail me.
|
|
|
|
|
Hi guys,
I have created COM .dll in C# and regersterd it.
I want to refernce this dll from my C++ .NET application.
I know how to reference COM .dll in C#, but how to do it in C++.
Please help me.
|
|
|
|
|
|
It's simple; you do it in source code with the #using directive.
Then, the dll must be in the same directory as your application.
Alternatively, (assuming it has a Type Library) you could run the COM dll through TLBIMP.EXE, creating a .NET assembly, which is even more fun.
And, I think you have to use P/Invoke to use the unmanaged types and methods in your code. This is done with the [DllImport] atribute.
Read this:
http://msdn.microsoft.com/msdnmag/issues/03/07/NET/[^]
|
|
|
|
|
Got this problem when I run my .net wrapper class over a "c" class when this method is called. The problem code line is highlighted:
When I replace i1 or i2 with int, it works fine.
the console version calling this method works perfectly fine.
Thks.
-----
int subst_cost_qwerty(const char c1, const char c2)
{
static const int n = 33;
static const
int index[] = {
-1, /* _ 0 */
-1, /* _ 1 */
-1, /* _ 2 */
-1, /* _ 3 */
-1, /* _ 4 */
-1, /* _ 5 */
-1, /* _ 6 */
-1, /* _ 7 */
-1, /* _ 8 */
-1, /* _ 9 */
-1, /* _10 */
-1, /* _11 */
-1, /* _12 */
-1, /* _13 */
-1, /* _14 */
-1, /* _15 */
-1, /* _16 */
-1, /* _17 */
-1, /* _18 */
-1, /* _19 */
-1, /* _20 */
-1, /* _21 */
-1, /* _22 */
-1, /* _23 */
-1, /* _24 */
-1, /* _25 */
-1, /* _26 */
-1, /* _27 */
-1, /* _28 */
-1, /* _29 */
-1, /* _30 */
-1, /* _31 */
-1, /* */
-1, /* ! */
-1, /* " */
-1, /* # */
-1, /* $ */
-1, /* % */
-1, /* & */
0, /* ' */
-1, /* ( */
-1, /* ) */
-1, /* * */
-1, /* + */
1, /* , */
-1, /* - */
2, /* . */
3, /* / */
-1, /* 0 */
-1, /* 1 */
-1, /* 2 */
-1, /* 3 */
-1, /* 4 */
-1, /* 5 */
-1, /* 6 */
-1, /* 7 */
-1, /* 8 */
-1, /* 9 */
-1, /* : */
4, /* ; */
-1, /* < */
-1, /* = */
-1, /* > */
-1, /* ? */
-1, /* @ */
-1, /* A */
-1, /* B */
-1, /* C */
-1, /* D */
-1, /* E */
-1, /* F */
-1, /* G */
-1, /* H */
-1, /* I */
-1, /* J */
-1, /* K */
-1, /* L */
-1, /* M */
-1, /* N */
-1, /* O */
-1, /* P */
-1, /* Q */
-1, /* R */
-1, /* S */
-1, /* T */
-1, /* U */
-1, /* V */
-1, /* W */
-1, /* X */
-1, /* Y */
-1, /* Z */
5, /* [ */
-1, /* \ */
6, /* ] */
-1, /* ^ */
-1, /* _ */
-1, /* ` */
7, /* a */
8, /* b */
9, /* c */
10, /* d */
11, /* e */
12, /* f */
13, /* g */
14, /* h */
15, /* i */
16, /* j */
17, /* k */
18, /* l */
19, /* m */
20, /* n */
21, /* o */
22, /* p */
23, /* q */
24, /* r */
25, /* s */
26, /* t */
27, /* u */
28, /* v */
29, /* w */
30, /* x */
31, /* y */
32 /* z */
};
static const
int ctab[] = {
/* ' , . / ; [ ] a b c d e f g h i j k l m n o p q r s t u v w x y z */
/* ' */ 0, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* , */ 2, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* . */ 2, 1, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* / */ 1, 2, 1, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* ; */ 1, 2, 1, 1, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* [ */ 1, 2, 1, 1, 1, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* ] */ 1, 2, 2, 1, 2, 1, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* a */ 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 1,
/* b */ 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 1, 2,
/* c */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2,
/* d */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2,
/* e */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1,
/* f */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2,
/* g */ 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 1, 2,
/* h */ 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 0, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2,
/* i */ 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 1, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2,
/* j */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 0, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2,
/* k */ 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 0, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* l */ 2, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 0, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* m */ 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 0, 1, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2,
/* n */ 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 1, 0, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2,
/* o */ 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 1, 1, 2, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* p */ 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
/* q */ 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 1, 2, 2, 1,
/* r */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 1, 2, 1, 2, 1, 2, 2,
/* s */ 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 1, 1, 2, 1,
/* t */ 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 0, 2, 1, 2, 2, 1, 2,
/* u */ 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 1, 2,
/* v */ 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 0, 2, 2, 1, 2,
/* w */ 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 0, 1, 2, 1,
/* x */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 1, 0, 2, 1,
/* y */ 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 0, 2,
/* z */ 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 1, 2, 0
};
int i1 = index[(int)c1]; // problem code
int i2 = index[(int)c2]; // problem code
int retval;
if (i1 == -1 || i2 == -1)
retval = 2;
else
retval = ctab[i1*n+i2];
//printf("[%c/%d][%c/%d]=>%d\n",c1,i1,c2,i2,retval);
return retval;
}
-----------
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
