|
project->settings->C/C++->Enable Run Time Type Information (RTTI)
|
|
|
|
|
1. Select "Project"->"Settings" from the application's menu.
2. Select the project and configuration.
3. Select the "C/C++" tab.
4. Select "C++ Language" in the "Category" combo.
5. Tick the "Enable Run-Time Type Information (RTTI)" check box.
Steve
|
|
|
|
|
I read "A Fast Bresenham Type Algorithm For Drawing Ellipse" by John Kennedy Mathematics Department.
Below function was developed base on above algorithm.
I want to ask someone help me, how can develop below function to rotate ellipse.
If someone have an other ideals, can you help me!
<br />
void CBGraphics::DrawEllipse(HDC hDC, int x1, int y1, int x2, int y2, COLORREF color)<br />
{<br />
long x, y, XChange, YChange, EllipseError, TwoASquare, TwoBSquare, StoppingX, StoppingY; <br />
TwoASquare = 2 * x2 * x2;<br />
TwoBSquare = 2 * y2 * y2;<br />
x = x2;<br />
y = 0;<br />
XChange = y2 * y2 * (1 - 2 * x2);<br />
YChange = x2 * x2;<br />
EllipseError = 0;<br />
StoppingX = TwoBSquare * x2;<br />
StoppingY = 0;<br />
while( StoppingX >= StoppingY)<br />
{<br />
Put4Pixel(hDC, x1, y1, x, y, color);<br />
y++;<br />
StoppingY += TwoASquare;<br />
EllipseError += YChange;<br />
YChange += TwoASquare;<br />
if( ( 2 * EllipseError + XChange) > 0 )<br />
{<br />
x--;<br />
StoppingX -= TwoBSquare;<br />
EllipseError += XChange;<br />
XChange += TwoBSquare;<br />
}<br />
}<br />
x = 0;<br />
y = y2;<br />
XChange = y2 * y2;<br />
YChange = x2 * x2 * (1 - 2 * y2);<br />
EllipseError = 0;<br />
StoppingX = 0;<br />
StoppingY = TwoASquare * y2;<br />
while (StoppingX <= StoppingY)<br />
{<br />
Put4Pixel(hDC, x1, y1, x, y, color);<br />
x++;<br />
StoppingX += TwoBSquare;<br />
EllipseError += XChange;<br />
XChange += TwoBSquare;<br />
if( (2 * EllipseError + YChange) > 0)<br />
{<br />
y--;<br />
StoppingY -= TwoASquare;<br />
EllipseError += YChange;<br />
YChange += TwoASquare;<br />
}<br />
}<br />
}<br />
|
|
|
|
|
Hi,
This Algorithm is based on 4 point symmetry of ellipse. And when the ellipse is rotated this symmetry will lost at numerous position. This algorithm can be used to increase the speed of plotting ellipse in a raster system for ellipse in its symmetric shape.
The parameters to the function is center and X and Y radius. I strongly think this algorithm cannot be used for plotting ellipse in all ellipse transformation.
|
|
|
|
|
Thanks you for your advice. by the way, Can you give me an other algorithm that you think it's suit to solve my trouble? 
|
|
|
|
|
Hi,
i'm making a program that monitors user connection and what that user is doing in my PC. Please let me know how to do this. I'm currently on a LAN connection. I just want to monitor computers are connecting to my PC.;);)
I know this is kindof a general question but i just do not know where to start.
Thanks.
|
|
|
|
|
How about NetConnectionEnum() and NetFileEnum()?
"A good athlete is the result of a good and worthy opponent." - David Crow
"To have a respect for ourselves guides our morals; to have deference for others governs our manners." - Laurence Sterne
|
|
|
|
|
Thanks David,
I assume this is only applicable if I'm sharing a resource on my PC. I would also want to monitor those computers that connect on my PC even if I'm not sharing..and, by the way, not only from LAN but also from those that connect to my PC through the internet.
Thank you!
|
|
|
|
|
Is it possible to create a custom vector allocator that allows you to allocate the maximum amount of memory your vector will ever need during vector instantiation, thereby allowing you to avoid dynamic allocation/reallocation/deallocation during program execution? When you add an item to your vector, it uses the available memory. When you remove an item from your vector, it will not delete the memory, it will only clear it and allow it to be re-used.
If this is possible, can someone provide guidance on how to code this, or provide a link where something like this is accomplished or talked about? I have no experience with Allocators, so I apologize if this is a dumb question.
I need to create a sorted list that provides array indexing capability, but also avoids dynamic allocation and deallocation.
|
|
|
|
|
you could use std::vector::reserve to allocate the number of element.
|
|
|
|
|
Thanks for the info.
Let's say I use reserve, and I reserve memory for 5 integers, 1 through 5.
If I call erase() on integer 3, how will this affect the internal memory structure of the vector? Will the vector have an empty space where 3 used to be (e.g. 1,2,-,4,5) or will the remaining elements in the vector get "pushed" over (e.g. 1,2,4,5)?
|
|
|
|
|
If you erase an element from a vector the elements after the deleted element are moved to fill the space. A vector's memory never gets smaller unless you use the following trick:
vector<int> copy(source);
source.swap(copy);
Steve
|
|
|
|
|
I tried ~WS_THICK_FRAME in precreate window.
Maximize box is disabled but when i double click on title bar it always restores
how to prevent this???
Problem is solved......
I solved using WM_NCLBUTTONDBLCLK any other solution.
|
|
|
|
|
Override OnNcLButtonDblClk().
Manish Rastogi
|
|
|
|
|
I'm new to c++ and this forum, so please...
I want to convert one type(int/float/double, can be 8/16/32/64bits), which is unknow when compiling, to another type, which is also unknow at compile time, in some function. One way is to use a vitual function and override that function with different arugment types. It's a heavy function with a lot of coding, so I want to search some other options.
I'm wondering if there is a solution so that I only need to write one conversion function which can take care of whatever input/output types.
Here are some pseudo codes which I'm not sure if they can be somehow realized. Hope it wouldn't confuse you.
define type T*;
Convert( T* in, T* out)
{
for_each_datum_in
{ *in=(type of out)*out;
}
}
//call the function here
Convert( TypeOfIn * in, TypeOfOut * out);
now here am i
|
|
|
|
|
Strictly speaking you can't do what you've asked about in ordinary C++. Only using .NET reflection, but the chances are that the set of types is not really 'unknown' at compile time it's just that you don't want to have to write much or any new code when you change that set?
If that's true you have a chance. Consider using templates e.g.
<br />
template< typename Ti, typename To ><br />
Convert( Ti* pIn, To* pOut )<br />
{<br />
}<br />
In the end you'll probably have to provide lots of type specific template overrides like
<br />
Convert( double* pIn, char* pOut )<br />
{<br />
}<br />
which is not much better than where you started out.
If you've hit this problem and most of us have  then you probably need to go back and look at your design with a 'what is this really try to achieve' hat on 
Nothing is exactly what it seems but everything with seems can be unpicked.
|
|
|
|
|
Is there some reason a template function won't work?
|
|
|
|
|
Must admit that I am not sure if I understood your problem. But according to I interpreted,
when you talk about converting types, you imply the concept of "casting" (Casting one data type to be another). With respect to your given pseudocode, I guess you want the type pointed by "out" to be treated as type "in" so that the assignment can work nicely. Thus you want to cast the type pointed by "out" to be as type pointed by "in".
If that understanding is true ...
You need to delve in to understanding how "type casting" works in C++. A nice tutorial -
http://www.cplusplus.com/doc/tutorial/typecasting.html
I like it as they quickly goes into how type casting with classes/structs and pointer to those needs to be carefull than for basic types.
Also for completeness, even in the case of template, it will eventually boils down to type casting as soon as the type is provided for the templates. So if you have defined two template types being them as type independent, during the runtime they are associated with provided types, hence the game boils down to type conversion between those two types.
So understanding the "type casting" will enlighten you about how to do it and if done will it be meaning full.
And for the conclusion, you will see that even though it is not a runtime error some casting will not be meaningfull or result in an wanted manner. There is no such freedom as converting ANY type to ANY type. Its not meaningfully possible (such as converting a student info class to a integer number).
Hope it can help.
Regards
|
|
|
|
|
Just in case I wan't clear about it - I agree with Matthew Faithfull.
And interestingly enough, quick Googling shows that there seems to be few implementation of Reflection in C++.
http://www.extreme.indiana.edu/reflcpp/
Hey, Its C++, It can do everything ... 
|
|
|
|
|
I am developing an app which will fetch addresses from the GAL. I need the email address of the users. I get those in the exchnage format (Electronic mail format)
for eg. /c=US/a=att/p=Microsoft/o=Finance/ou=Purchasing/s=Furthur/g=Joe
and need those in
I am using Exchange SDk to fetch the contacts from GAL.
for e.g : xyz@fgh.com
"A winner is not one who never fails...but the one who never quits"
|
|
|
|
|
Hi for all
I've created a program that triggers some threads.
I don't get to use the syncronization. Some threads are triggered before others.
I created a class called ResourceObject. This is a simple class with a boolean value and a CRITICAL_SECTION value:
<br />
ResourceObject::ResourceObject()<br />
{<br />
m_bLocked = false;<br />
InitializeCriticalSection(&m_ResourceSection);<br />
}<br />
ResourceObject::~ResourceObject()<br />
{<br />
DeleteCriticalSection(&m_ResourceSection);<br />
}<br />
<br />
void ResourceObject::LockResource(unsigned int uiTimeToSleep)<br />
{<br />
EnterCriticalSection(&m_ResourceSection);<br />
m_bLocked = true;<br />
Sleep(uiTimeToSleep);<br />
LeaveCriticalSection(&m_ResourceSection);<br />
}<br />
<br />
void ResourceObject::ReleaseResource()<br />
{<br />
EnterCriticalSection(&m_ResourceSection);<br />
if(m_bLocked)m_bLocked = false;<br />
LeaveCriticalSection(&m_ResourceSection);<br />
}<br />
In another class I have this struct that have a pointer to a ResourceObject
<br />
typedef struct LineText<br />
{<br />
FloatText * Line;<br />
bool bShow;<br />
float fTimeWait;<br />
ResourceObject * resource;<br />
}TextLine;<br />
In the same class I have the following codes:
- the first is how I create a thread;
<br />
idThread[m_iLineCount] = CreateThread(NULL, 0, Helper::TextThread, (void*)&Lines[m_iLineCount], CREATE_SUSPENDED, NULL);<br />
- the second is the thread:
<br />
DWORD WINAPI Helper::TextThread(void * vData)<br />
{<br />
LineText * temp = (LineText *)vData;<br />
temp->resource->LockResource(2000);<br />
temp->bShow = true;<br />
temp->resource->ReleaseResource();<br />
return 0;<br />
}<br />
- the third is when I Resume the threads and show some text;
<br />
void Helper::ShowImages()<br />
{<br />
for(int i = 0 ; i < m_iLineCount ; i++)<br />
{<br />
ResumeThread(idThread[i]);<br />
if(Lines[i].bShow)Lines[i].Line->PrintText();<br />
}<br />
}<br />
The threads must have to follow the sequence in that they are resumed, but they don't. Even the first thread is started with the resource, it is not the first to show the text.
Anyone can help me to solve this problem?
Thanks
|
|
|
|
|
If you want multiple threads to pass through a single function in predetermined order you're going to need a master thread to manage them and each one will have to wait to be signalled. I would add an Event to your one-per-thread structure, have each worker wait on its event and then have the main thread signal each event and wait for it to be reset by the signalled thread before singalling the next one. Have the worker reset its event after it has executed your controlled function. I can't see why you'd want to do this as it seems to negate any real benefit of threading but it's your project
Nothing is exactly what it seems but everything with seems can be unpicked.
|
|
|
|
|
Not sure I understand, you want to use multiple threads to perform sequential operations? 
|
|
|
|
|
More or less.
Like you've seen in my code, I have a thread that receives a structure. I have about 10 structures that have different values of text. And I need to show these texts in some moment. At the moment I need to show these values sequentially, but in any other time I would need to show these texts in any other sequence. Just like that, I create the ResourceObject class. I have a pointer to an object of this type in my structs. The first started thread access this object and the others wait.
I called the threads sequentially thinking that the calling order have been respected, with one thread at time access the resource and release it.
|
|
|
|
|
Alex Cutovoi wrote: More or less.
What? You don't know? How are we supposed to help you if you can't specify exactly what your requirements are.
Alex Cutovoi wrote: I need to show these texts in some moment.
I have no idea what that means. I am not familiar with "Moment Based Processing".
Look the bottom line is that trying to use multiple threads to execute sequential operations is like putting a square peg in a round hole. It doesn't seem your approach is the appropriate solution to your problem, whatever that is.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
