|
I suppose, you know that
printf("%d\n", ul);
and
printf("%s\n", ultoa(ul, buffer, 10));
should produce the same output.
|
|
|
|
|
Vaclav_Sal wrote: So why I keep printing numbers
Because that is what ultoa creates. It takes a numeric value (long) and converts it to printable characters. Try an input value of 127 instead of RANDOM.
|
|
|
|
|
So itoa is really NOT "integer to ASCII" conversion, right?
I knew it was a silly question.
I suppose I can use some kind of lookup method the get from random index # to character array of alphabet.
I'll check stdio.
Thanks
|
|
|
|
|
Vaclav_Sal wrote: So itoa is really NOT "integer to ASCII" conversion, right?
Yes, of course it is. It converts a binary integer to a set of printable (ASCII) characters. What else would you expect it to do?
|
|
|
|
|
If all you need is the ASCII character corresponding to the given integer than a cast is enough, e.g.
printf("%c\n", (char) RANDOM);
|
|
|
|
|
Hello,
I have access to array of pixel data (size:512x512x8bpp) from a framegrabber which I currently assign to a 8bpp bitmap which is assigned to a GDI+ graphics object later on.
Now, I would like to convert my array of 8bpp pixel data into 24bpp (BGRA, but I have no use for Alpha channel) and assign it to my bitmap and then modify individual pixel data to different colors depending on other conditions.
When I say efficient, I want it to be done in real-time without much delay.
Any suggestions?
thanks
PKNT
modified 31-Jul-15 14:46pm.
|
|
|
|
|
Did you try the straightforward way (that is filling the ARGB memory area in a loop) and measured its performance?
|
|
|
|
|
When the input data are 8 bit gray scale values just assign them to the R, G, and B values and set the aplha value to zero:
RGBA *out = new RGBA[512 * 512];
for (unsigned i = 0; i < 512 * 512; i++)
{
out[i] = (in[i] << 16) + (in[i] << 8) + in[i];
}
|
|
|
|
|
Although I use C# most of the time, I try to use C for small exercises -- to keep my C sharp! 
Anyway... I don't recall having to pass arrays back when I was using C full-time (in the 90s), so I don't know which technique is preferred.
As I see it, there are two basic techniques as precedents in C:
0) Passing the length of the array with the array -- e.g. main ( int argc , char *argv[] )
1) Having a "special value" at the end of the array to indicate the end -- e.g. NULL-terminated strings.
So, if I want to pass an array of structs (four ints), which technique is preferred by the C/C++ community?
I'm actually considering door number...
2) Using a linked list instead. It just seems cleaner, though memory usage is actually increased by 25% in this case.
Again, this is just an exercise, but practicing poor technique can be worse than not practicing at all.
So, what say you? If you have to pick door 0 or door 1, which do you prefer?
|
|
|
|
|
Which method you use depends on what your data looks like. If you have an array of int, then there may not be a special value that can be the sentinel for the end of the array. On the other hand if you have an array of pointers to something, then maybe a NULL pointer is a good choice as a sentinel. Not always, though. If you had an sparse array of pointers, it would be conventional for the empty elements to be NULL, so you could not use that as the sentinel.
Advantages to passing the length are that you can work your way forwards or backwards through the array without having to count how many first, and you know the bounds, so you shouldn't have any Undefined Behaviour from trying to access outside the array.
|
|
|
|
|
Thanks.
With these particular structs, there is a field in which a 0 (or anything less than 1) could easily be used to indicate that the item is the terminator.
And in this particular exercise, I need to visit each item once per call, so knowing the length would only keep me from going off the end, not aid in navigation.
I'll give door 1 a try. I think that will require only that I allocate one more item and make a small change to the for loop I would otherwise use.
|
|
|
|
|
Unfortunately in C language there has not any concept of bounds checking.If we are inserting an array elements which exceeds size of an array automatically it is treated as garbage value.
Example:
#include<stdio.h>
#include<conio.h>
main()
{
int a[10];
a[3]=4;
a[11]=3;//does not give segmentation fault
a[25]=4;//does not give segmentation fault
a[20000]=3; //gives segmentation fault
getch();
}
|
|
|
|
|
you can always do a 'container':
typedef struct intArray_t
{
int *pData;
int len;
} intArray;
intArray newIntArray(int len)
{
intArray ia;
ia.pData = (int*)malloc(len * sizeof(int));
ia.len = len;
return ia;
}
intArray myData = newIntArray(10);
etc.
then you pass intArrays around
|
|
|
|
|
Oh, of course. 
|
|
|
|
|
And now I've learned that the version of MinGW GCC I have will allow typeof and the declaration of variables in for statements ( for ( int i ... ) provided I invoke -std=gnu99 . ![Jig | [Dance]](https://codeproject.freetls.fastly.net/script/Forums/Images/jig.gif)
What a fun exercise for a rainy Friday afternoon.
modified 31-Jul-15 20:24pm.
|
|
|
|
|
Wait a minute... isn't that code example missing some indirection?
|
|
|
|
|
|
Or maybe that's not C? Can you return a local variable like that in C? Even returning a pointer to a local variable is verboten isn't it?
Or is my C-fu still that rusty?
|
|
|
|
|
sure, you can return locals - even if they're structs.
a pointer to a local would be a bad idea, because the local goes out of scope. but when you return a local, it makes a copy for the caller.
|
|
|
|
|
Huh. I guess I thought C was dumber than that, one semester of C wasn't enough. That explains that small memory leak I wrote in 1994... I wonder whether or not that program is still in use...
|
|
|
|
|
I pulled out my old VAX C book for reference, and all I see is passing structs in as parameters, but it seems to say it's limited to 1020 bytes. If that's true, it must apply to return values as well -- they're still on the stack, yes?
|
|
|
|
|
that's probably the VMS stack size.
i believe the struct returning behavior is compiler dependent (OS dependent?). some will return the struct in a register, if the struct is small enough, or on the stack. some compilers are smart enough to use the caller's struct directly so as to avoid making a copy.
that struct i showed is sizeof(int *) + sizeof(int). so, 8 or 12 bytes. nothing to worry about.
|
|
|
|
|
I believe that's implementation defined. With my linux box I can use ulimit to set the size of the stack. By default it seems to be 8MB, but I can modify that upwards more or less as needed (obviously within memory limits of the system).
I seem to recall that early C implementations were limited to returning basic types (e.g. int, double, char *, etc). gcc-5.2 still has a warning flag for aggregate returns - which suggests that other C compilers might still adhere to that.
|
|
|
|
|
Method 0 is the one I observe most of the time (and use myself more frequently). Even Windows API use it.
Sentinel method has its usages (k5054 already pointed out its drawbacks).
I won't use method 2, I mean I won't choose a linked list instead of an array just in order to avoid the extra parameter in my function.
|
|
|
|
|
Thanks.
The sentinel method worked well in this case, but then Chris Losinger suggested method 3 -- using a container*. So I'm using that now. This technique has the added benefit that I can store the number of items allocated as well as the number of items in use -- sort of like how a List works in .net. I can add items up to the limit (I have no need to expand the array; I know how many items I need up front).
* Didn't we used to call that a Control Block? A simple way to avoid having bullions and bullions of function parameters?
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
