|
what if you wanted to put this in to a bitfield. I have a bit map that has one bit per pixel and measures 7x70
|
|
|
|
|
Sorry, I'm not sure I understand your question.
I must get a clever new signature for 2011.
|
|
|
|
|
I have a binary (monochrome) bitmap that is 70x7 pixels would like to put it in an array that is 70x7 as binary. I know that bit fields would be a good choice. ie:
struct
{
unsigned byte d0:1;
unsigned byte d1:1;
unsigned byte d2:1;
unsigned byte d3:1;
....
} test
|
|
|
|
|
how would you cast this pointer to a bit field?
ie:
struct 7bitfield
{
unsigned byte d0:1;
unsigned byte d1:1;
unsigned byte d2:1;
unsigned byte d3:1;
unsigned byte d4:1;
unsigned byte d5:1;
unsigned byte d6:1;
} 7bits;
The reason for asking is I have an monochrome bitmap that is 70x7 and need to retrieve the data as an array of 1's and 0's. These will be used to control the on/off state of an led display.
Thanks
|
|
|
|
|
Are you saying that the fields are packed, such that the second field starts at the last bit of the byte containing the first field and so on? Something like:
byte0 + byte1 + byte2 +
01234567|01234567|01234567|01234567
01234560123456012345601234560123
00000001111111222222233333334444 - pixel numbers
In this case you would probably need to use a BYTE pointer and adjust it manually as you traverse the array.
I must get a clever new signature for 2011.
|
|
|
|
|
Adding ButtonsGroup with subbuttons to RibbonStatusbar. the buttongroup's button have showed images,but subbuttons didn't.here is my code, It was so surprising to me.
std::auto_ptr<CMFCRibbonButtonsGroup> apSBGroup(new CMFCRibbonButtonsGroup);<br />
<br />
CMFCToolBarImages images1;<br />
images1.SetImageSize(CSize(16, 16));<br />
images1.Load(IDB_TOOLBAR_SNAPTOOL);<br />
<br />
apSBGroup->SetImages(&images1, NULL, NULL);<br />
apSBGroup->SetID(ID_GROUP_SNOP);<br />
<br />
apSBGroup->AddButton(new CMFCRibbonButton(ID_DYNA, NULL, 0));<br />
<br />
std::auto_ptr<CMFCRibbonButton> pBtSnopPt(new CMFCRibbonButton(ID_HEAD, NULL, 5));<br />
pBtSnopPt->AddSubItem(new CMFCRibbonButton(ID_HEAD, NULL, 5));<br />
pBtSnopPt->AddSubItem(new CMFCRibbonButton(ID_CENTER, NULL, 6));<br />
pBtSnopPt->AddSubItem(new CMFCRibbonButton(ID_CROSS, NULL, 7));<br />
pBtSnopPt->AddSubItem(new CMFCRibbonButton(ID_LIMIT, NULL, 8));<br />
pBtSnopPt->AddSubItem(new CMFCRibbonButton(ID_PEAK, NULL, 9));<br />
pBtSnopPt->AddSubItem(new CMFCRibbonButton(ID_ON, NULL, 10));<br />
apSBGroup->AddButton(pBtSnopPt.release());<br />
<br />
std::auto_ptr<CMFCRibbonButton> pBtPopCoor(new CMFCRibbonButton(ID_NUMBER, NULL, 11));<br />
pBtPopCoor->AddSubItem(new CMFCRibbonButton(ID_NUMBER, NULL, 11));<br />
pBtPopCoor->AddSubItem(new CMFCRibbonButton(ID_THREEOK, NULL, 12));<br />
pBtPopCoor->AddSubItem(new CMFCRibbonButton(ID_THREE, NULL, 13));<br />
pBtPopCoor->AddSubItem(new CMFCRibbonButton(ID_GRID, NULL, 14));<br />
pBtPopCoor->AddSubItem(new CMFCRibbonButton(ID_RELATEXY, NULL, 15));<br />
pBtPopCoor->AddSubItem(new CMFCRibbonButton(ID_NEWOXOY, NULL, 16));<br />
apSBGroup->AddButton(pBtPopCoor.release());<br />
<br />
m_wndRibStatusBar.AddExtendedElement(apSBGroup.release(), _T(""));<br />
|
|
|
|
|
Greetings.
I need to write a function that has the following interface:
double average (int size, double values []);
The function should return the average of the first size values in the array values.
Here's an example of what I need to accomplish.
Enter number of values to be input : 5
Enter item 1 : 22.3
Current average is 22.3.
Enter item 2 : 54.2
Current average is 38.25.
Enter item 3 : 74
Current average is 50.1667.
Enter item 4 : 83.1
Current average is 58.4.
Enter item 5 : -90.
Final average is 28.72.
|
|
|
|
|
What have you done yet to try to solve this _very_ simple school problem ? did you even try to write some code for it ? or were you expecting someone else to do it for you ?
anyway, should be quite easy with a simple loop, a couple of std::cin and std::cout , an accumulator, a counter, * and / ...
I'm certain if you try to do it by yourself, you will be so proud that you will feel ashame to even have posted this question.
M.
Watched code never compiles.
|
|
|
|
|
Since the question is just to write a function, NO, I didn't try to run a program.
I Think the answer to this is:
Double average (int size, double values []);
{return (a);} {return (a + b) / 2;} {return (a + b + c) /3;} {return (a + b + c + d / 4;}
{return (a + b + c + d + e / 5;}
I really don't have a clue what I'm doing so I'm winging it to say the least. I'm thinking the above is in the ball park because in my text book, there's a program called Average.c that goes like this:
#include <stdio.h>
double average (double a, double b);
int main(void)
{
double x, y, z;
printf("Enter three numbers: ");
scanf("%1f%1f%1f", &x, &y, &z);
printf("average of %g and %g: %g\n", x, y, average (x, y));
printf("average of %g and %g: %g\n", x, y, average (y, z));
printf("average of %g and %g: %g\n", x, y, average (x, z));
return 0;
}
double average (double a, double b)
{
return (a + b) / 2;
while(1);
}
Am I in the ball-park for the function part???
Oh ya, I have no idea what Maximilien was talking about with all the
"simple loop, a couple of std::cin and std::cout , an accumulator, a counter, * and / ..." Sounds like what adults sound like on Peanuts cartoons.
|
|
|
|
|
Tim Dappen wrote: I really don't have a clue what I'm doing
So maybe some time with your text books would be time well spent.
It's time for a new signature.
|
|
|
|
|
Don't you want to use a std::vector to hold the numbers entered by the user?
"One man's wage rise is another man's price increase." - Harold Wilson
"Fireproof doesn't mean the fire will never come. It means when the fire comes that you will be able to withstand it." - Michael Simmons
"Man who follows car will be exhausted." - Confucius
|
|
|
|
|
no need to keep an history of the input, just "accumulate" and divide by the count (number of inputs).
Watched code never compiles.
|
|
|
|
|
Maximilien wrote: no need to keep an history of the input, just "accumulate"...
accumulate() has to have an array of some sort to work with.
"One man's wage rise is another man's price increase." - Harold Wilson
"Fireproof doesn't mean the fire will never come. It means when the fire comes that you will be able to withstand it." - Michael Simmons
"Man who follows car will be exhausted." - Confucius
|
|
|
|
|
If he's that clueless, he's not ready for templates.
Once you agree to clans, tribes, governments...you've opted for socialism. The rest is just details.
|
|
|
|
|
The basic idea is simple: keep a running total and a count of the number of numbers entered. After each number is entered the average is the total divided by the number of numbers entered.
Steve
|
|
|
|
|
One thing to remember when doing programming assignments: Accademic computer scientists love recursion. You should try and introduce it to everything you do. So the best way to implement the function you're trying to write is:
double sum_array( int size, double values[] )
{
if( size > 0 ) return values[0] + sum_array( size - 1, values + 1 );
return 0;
}
double average( int size, double values[] )
{
return sum_array( size, values ) / size;
}
Another cool thing is that the solution doesn't have any side effects so it's pure within the mathematical idea of a function and the CS ideas of functional programming.
You can test it with something like:
int main()
{
double values[ 10 ] = { 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0 };
std::cout << average( 10, values ) << std::endl;
}
The I/O should be easy to sort out.
Cheers,
Ash
|
|
|
|
|
Aescleal wrote: Accademic computer scientists love recursion.
They do seem to. I'm not the biggest fan myself.
Steve
|
|
|
|
|
I prefer divide and conquer:
double sum(std::size_t size, double values[]) {
if (0==size)
return 0.0;
else
return sum(size/2, values) + sum(size-size/2, values+size/2);
}
double average(std::size_t size, double values[]) {
return sum(size, values)/size;
}
Of course, if your goal is to repeatedly calculate the 'running average' of a stream of numbers, a more efficient implementation might look like this:
double incremental_average(double pre_avg, std::size_t new_size, double new_value) {
if (new_size > 1)
return (new_value + pre_avg*(new_size-1))/new_size;
else
return new_value;
}
int main () {
double values[] = {3.5, 5, 7, -2, 3.14, 2.71, 6, 7, 8, 9};
double avg = 0;
for (std::size_t i = 0; i < sizeof(values)/sizeof(double); ++i) {
avg = incremental_average(avg, i+1, values[i]);
std::cout << "average[" << i+1 << "] = " << avg << std::endl;
}
}
modified on Tuesday, September 28, 2010 8:52 AM
|
|
|
|
|
Hi everyone, I want to write an application that can analyse data given in grids like those in Excel. I want to write the application in the Win32 API. How can I add such grid tools in this application? Does using this tool require learning other API before doing it? I will also be glad if I am directed to tutorials and documentations about doing this. Thanks.
|
|
|
|
|
|
I do not know MFC, and going into it means possibly learning another language, although it is in C++. Please do you have any idea of how I can write one on my own if there are no other ways. Brief ideas and sources will be appreciated. Thanks.
|
|
|
|
|
how much effort it needs and LOC it takes to develop such a control in plain win32 without using MFC, just guess. 
|
|
|
|
|
I would probably write the GUI in .NET and if you need any high performance calculation, then implement this in a standard unmanaged dll.
|
|
|
|
|
Hi,
I am currently digging through heaps of articles about various mechanisms for parallel programming, such as OpenMP, OpenCL, and the new Parallels library in Visual Studio 2010. In the short run, I intend to modify our application to take advantage of multicore systems, and it seems the VS libraries will make this really easy to implement.
But I am looking further, and would like to draw on the power of GPU processing as well, so I'd like to make my changes in a way that are not limited to just one method. What I'm thinking of is an interface that can be adapted through settings to use multiple cores, GPU power, or whatever other method I might think of in the future (cloud computing maybe?).
I have no idea where to start though. I've found some very helpful articles (with examples) for using the VS integrated libraries, so I'm good for these. I am pretty much dangling in thin air with respect to GPU processing though: the Wiki articles on OpenMP or OpenCL are pretty much academic, and provide very little in the way of examples or 'how-to' advice.
Can anyone point me to a good article or two to get me started?
P.S.: The application this is all about is a product sold to individual customers with varying hardware, so information about specific GPU programming such as CUDA (I've already found a good article about this on CP) doesn't really help all that much, as it's limited to just one family of graphic cards.
|
|
|
|
|
This is not easy to answer. It's like if you asked: 'Oh, I like the idea of quantum physics, I tried to read a book but it was too academic, please help...'
Parallel computing is a very wide field, divided into many distinct disciplines. I suggest you first try to clarify what you go into first: Utilizing multicore CPU systems is mostly about 'task parallelism' (= pieces of your program code are running concurrently, possibly sharing same data), GPU computing is mainly about 'data parallelism' (= data is processed by several independent units performing the same step on different data). Often, these two kinds of parallelism overlap. Technically, however, programming GPU parallelism versus concurrent programming on a (multicore) CPU system are two different worlds...
Wikipedia articles are not a bad point to start with. I also suggest to have a look at the MSDN magazine articles and the tutorials on msdn.com. You also mentioned OpenCL and OpenMP - there is a vast amount of introductory material available in printed and online format. With regard to concurrent programing I'd recommend to have a look at frameworks which abstract concurrency, like Microsofts TPL or CCR. With regard to general purpose GPU computing, I liked http://www.mathematik.uni-dortmund.de/~goeddeke/gpgpu/index.html[^]
modified on Sunday, September 19, 2010 5:15 AM
|
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
