Search:

I can't seem to spot the difference's in my code that was allowing -> to work before, and now the dot notation to work. Can you explain the difference?

I have used this exact code numerous times in the past weeks, and it has always worked flawlessly.



typedef struct _LLNode
{
int x;
int y;
int z;
int dx;

Doh! Got it, just missing a list->head = n; at the end of my add to front.

Thanks so much anduril462, you've been so much help.

Just realized that this is actually "adding to tail".

The output for case 3 should be "data 20; data 10"
The output for case 4 should be "data 30; data 20; data 10"
The output for case 5 should...

Thank you for your response, I would've never caught that it was pointing to the updated source. Whoops! However, something still doesn't seem right! My traverse function now loops forever and keeps...

This is the print function, called as a function pointer in traverse


void print_int(void* node){
lnode *converted_node=(lnode*)node;
int *p=(int *)converted_node->data;
int a=*p;...

Thank you for your input, but this isn't necessarily correct. My lists are updating, the nodes are being added.

I have a doubly linked, continuous list that I am having some troubles with. It seems as if my pointer reassignments aren't working correctly, even though they appear to be logically accurate.

My...

I couldn't agree more, just teach us right the first time. The next assignment was doubly linked list, in a circular fashion. I guess it's just a good learning experience to figure it out the long...

I came to the forums for help, you're correct. If you don't wish to provide it then by all means, don't. But your trolling doesn't help anyone.

I am fully aware of what I am trying to accomplish here, and my code does essentially exactly what your psuedo code describes. At least I thought it did.

Well, the following fails to run:


while(hd != NULL)


I originally had it in the following for loop:


for (hd = list->head; hd->next; hd = hd->next)

I have a function that is supposed to iterate through and create 10 random values, adding the values into the linked list each iteration in numeric order. I have the basis of my function down,...

This is my updated Add_to_Tail function, getting closer, but still not sure where to go from here.


void Add_to_Tail(List *list, List *newnode)
{
if(!list->head)
{
list->head =...

I know I need to do this, but I have no idea how to, hence this post.

I have to add to tail. Adding to the head is very simple, and I've got the function for that! Just having trouble figuring out the tail.

Unfortunately, I can only use a head pointer. Which I guess means I would have to iterate through every time I "Add_to_Tail" until it comes back NULL, i.e the end?

I am working on an assignment, and need to write a function to add a new node to the tail of a linked list. My code so far is as follows.



#include <stdio.h>
#include <stdlib.h>

typedef...

I have read into the FindFirstFile and FindNextFile functions for windows extensively, and read numerous threads on the topic, but can't seem to break it down and figure out how to use it for what I...

edit: rebooted netbeans, and everything is operational oddly enough.

Well it is compiled with Cygwin, NetBeans shouldn't cause this error. And the difference in \r and \n would change things. Linux expects \n, windows \r\n and mac \r, so this could effect things. ...

Well, if any of them worked I wouldn't have posted this. The solutions I saw were to try what I mentioned above, i.e. the different file types and the different commands for newline/carriage return.

I have searched around and have found that this is a pretty common error, but fprintf isn't printing newline/return carriages.



FILE *index;
index = fopen("index.html", "w");
fprintf(index,...

This did not resolve the error, please provide the code so I can understand it.

I understand the bitwise operations and how memcpy's suggestion accomplishes the goal. However, I still do not understand how to do this without bitwise operators and using the 3rd room "c".
I have...