|
Francis Paran wrote: infile.seekg (0, ios::end);
When do you seek back to the beginning?
Francis Paran wrote: infile>>noskipws>>stringChar;
Is this supposed to append to stringChar?
"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
"Some people are making such thorough preparation for rainy days that they aren't enjoying today's sunshine." - William Feather
|
|
|
|
|
I already got it working by having the ifstream variable initialized at the end using the ios::ate parameter on its instance. Thank you for the advice. I wouldn't have realized what I did wrong if it wasn't for your intuitive question, asking me when I seek back to the beginning.
|
|
|
|
|
Hi, i need to write a code which can convert a raw image to anyother desired format like BMP or JPEG etc.
|
|
|
|
|
Howdy.
Best you get cracking then - or find a "ken I hav the codez plz" site.
If you had the slightest inkling of what you're doing, you'd realize that about a man-year's worth of work goes into a typical jpeg encoder. With that said, your option of (1) get (image file) format specification documents (2) Write appropriate code, will not work in a timely fashion.
You'll need to find libraries that are suitable for you, in terms of (a) price and (b) compatibility with your code and other libraries.
Have fun young jedi!
|
|
|
|
|
Spot-on, Spartan! Marked as "correct answer". 
"Real men drive manual transmission" - Rajesh.
|
|
|
|
|
You don't need any library
Just use Shell apis (1 line of code to convert any format into any other format)
|
|
|
|
|
The Image::Save method that belongs to the GDI+ library can convert between certain formats.
There is a library call FFmpeg[^] that can do practically whatever you can think of.
|
|
|
|
|
another option CImage class, which in turn uses Gdi+ calls. Use it's Save method.
|
|
|
|
|
|
Hello,
I am C++/VC++ developer. I have query from long time in my mind, what is difference between 16bit/32bit/64bit OS and how (why) it affets softwares(exe/dlls). And how int size is related with all this. Like in 16 bit enviroment int is of 2 byte and so on..
Regards
|
|
|
|
|
Basically, the OS bitness has to do with the address range that the OS can use.
Considering a flat address space, 16-bit OSs can use addresses from 0 to 65536 (2 to the power 16).
Similarily for 32-bit OS it will be 0 to 4294967296 (4 GB) and for 64-bit OS it will be 0 to 18446744073709551616 (whatever).
This means as the bitness increases, the OS can handle more code and data.
The processor also needs to be matched for bitness.
This means, a 32-bit processor cannot host a 64-bit OS.
But a 64-bit processor can host a 64-bit, 32-bit or 16-bit OS.
This is because the internal storage of the processor (registers) must be wide enough.
In the case of intel processors, 16-bit processors have 16-bit registers like AX, BX, CX, DX etc.
32-bit processors have 32-bit registers like EAX, EBX, ECX, EDX etc.
And 64-bit processors have 64-bit registers like RAX, RBX, RCX, RDX etc.
This is why the size of data types like int changes.
However, for 64-bit Windows, the size of int is still 32-bit.
|
|
|
|
|
|
May I know why size of int is only 4 byte in 64bit OS? Why it has not changed as it changed previously with 16 bit and 32 bit OS.
|
|
|
|
|
|
in mfc how i can read and convert data of any type to binary ???
|
|
|
|
|
Any data is already binary (you could do bitwise operations to extract individual bits). What exactly do you want to achieve?
"Real men drive manual transmission" - Rajesh.
|
|
|
|
|
As Rajesh said, your computer is a binary device and so all data is stored as binary.
Here is some code that displays an 8 bit data as binary.
You can extend the same for any other data type.
for (unsigned i = 0; i < 8; ++i)
cout << (datatype & (1 << i)) ? '1' : '0';
|
|
|
|
|
hi there i am working on a project that reads some data from a file and storing it into nodes. i actually made some operations like adding,deleting,search ect. in singly linked list with one structure type. now i am trying to use two structure types which are;
typedef struct node {
int birth_date;
int zipcode;
int phone_num;
char first_name[50];
char last_name[50];
char city[50];
char address[50];
char email_addr[50];
struct node* fn_next;
struct node* ln_next;
struct node* birdat_next;
} NODE;
typedef struct {
int count;
NODE* head;
NODE* tail;
NODE* current;
}LIST;
and this is the block which i read and store the data and finally call add_Node function;
while ( !feof(myfile) ) {
if( !(student = (NODE*) malloc(sizeof(NODE))) ) {
printf("ERROR NOT ENOUGH MEMORY!!!\n");
exit(100);
}
fscanf(myfile,"%s", &(student->first_name) );
fscanf(myfile,"%s", &(student->last_name) );
fscanf(myfile,"%s", &(student->email_addr) );
fscanf(myfile,"%d", &(student->phone_num) );
fscanf(myfile,"%s", &(student->address) );
fscanf(myfile,"%s", &(student->city) );
fscanf(myfile,"%d", &(student->zipcode) );
add_Node(&list,student);
printf("%s\n", student->first_name );
}
}
and of course add_Node function;
void add_Node(LIST** list, NODE* student) {
if( (*list)->head == NULL ) {
student->fn_next = (*list)->head;
(*list)->head = student;
(*list)->tail = student;
printf("Adding operation is succesfull\n");
(*list)->count++;
return;
}
else {
(*list)->current = (*list)->head;
while ( (*list)->current != NULL )
(*list)->current = (*list)->current->fn_next;
(*list)->current->fn_next = student;
student->fn_next = NULL;
(*list)->tail = (*list)->current;
return;
}
}
i am taking segmentation faults in add_Node and i don't know how to fix it.
|
|
|
|
|
Sure it goes wrong, as this statement
while ( (*list)->current != NULL ) (*list)->current = (*list)->current->fn_next;
is bound to result in (*list)->current being zero/null, hence the following
(*list)->current->fn_next=...
will bomb.
Some ideas:
1.
if you want to add a node at the end of the list, and your data structures have a tail member, why not use it, rather than scanning the list?
2.
try not to have special cases. When done properly, one often does not need them. And when one does, try making the alternate paths as short as possible, they tend to have common things (such as return, and count++ of which you forgot one).
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
|
i changed my way to implement the linked list with only NODE structure which is the way i know well. but this fault is not acceptable for me, i am angry to myself now because i want implement to list with using LIST structure. anyway, could you explain why i can't print the data with using code like this --> list->head->first_name
|
|
|
|
|
I did not tell you to drop the LIST structure; if you want new nodes added at the tail, having a tail pointer is the obvious way of doing it, as it is much faster than searching for the last node each time.
And your original code would never reach the print statement as it bombs when you use the null reference that is the resulting of spinning the while loop. So either use the tail pointer and drop the while loop, or fix the while loop.
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
|
This is obviously an assignment but I'll give you some ideas.
a. It's better to use an existing container like std::list but if this is C and you don't have one or you have to write your own linked list then ...
b. You don't need to store current. I also assume you store tail and count for efficiency as you can work these out too.
c. You store tail but then in add_Node() you scan the list for the end anyway.
d. It may be simpler just to add new students to the start of the list rather than the end.
NODE * tmp = head;
head = student;
student->next = tmp;
e. If you step through your code the bvious problem is assigning through a NULL pointer. Why not do it like this:
void add_Node(LIST** list, NODE* student)
{
NODE ** pcurr;
for (pcurr = &head; *pcurr != NULL; pcurr = &((*pcurr)->next) )
;
*pcurr = student;
student->next = NULL;
}
Andrew Phillips
http://www.hexedit.com
andrew @ hexedit.com
|
|
|
|
|
hi andrew;
firstly, i must create my own linked and i know how to create it and i know how to make some simple operations with linked list. but this is the first time i want to use LIST structure(as you can see there is a head,tail,current and count). for example i wanna use like this;
list->head->first_name
and logically isn't it true_?. in main function the code is work well if i use like this
printf("%s\n", student->first_name );
but if use like this it isn't working. so what is the difference_?.
printf("%s\n", list->head->first_name );
|
|
|
|
|
> printf("%s\n", list->head->first_name );
Yes, this should work. It could be that list or list->head are NULL or uninitialised.
Try:
printf("%p %p %s\n", list, list->head, list->head->first_name );
which will print out the values of the pointers. Or step through the code and look at the values in the debugger.
Andrew Phillips
http://www.hexedit.com
andrew @ hexedit.com
|
|
|
|
|
Andrew Phillips wrote: printf("%p %p %s\n", list, list->head, list->head->first_name );
I guess one needs separate print statements here, as if one argument bombs, nothing will be printed at all.
Luc Pattyn [Forum Guidelines] [My Articles] Nil Volentibus Arduum
Please use <PRE> tags for code snippets, they preserve indentation, improve readability, and make me actually look at the code.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
