if i create an array of pointers to a structure "struct node" as:
and create "n" number of "linked lists" and assign it to the various struct pointers r[i] using some function with a return type as structure pointer as:
is it wrong to then use the individual array members like r[0],r[1] (which are now pointers to various linked lists) etc. as parameters to a function that accept a structure pointers as parameter like::
the programme goes into an infinite loop whenever i try to display the list pointed by add_result..the functions add() and display() work fine in other cases..
i have a function:
char *pcCityIdToCountryName(ADMIN_DB_DATA *pstHEader, unit uiCityID)
this returns a pointer to CountryName if cityId is given.
to retrieve countryname i give:
char *CountryName;
CountryName = pcCityIdToCountryName(..................);
but when i compile it is giving :... (5 Replies)
All ..
I am having a pointer array . And trying to store the addess into that pointer array . please see below the problem i faced
code:
int cnt1;
char *t_array;
char *f_array;
for(cnt1=0; cnt1<1000; cnt1++)
{
t_array =... (1 Reply)
Dear friends,
First all I applogize for posting such a simple question , as I love this forum and forum participants thats why I am posting my problem here..
Why I am getting error when I remove the commented lines
typedef unsigned int U;
typedef struct {U c; U d;} vec32;
... (1 Reply)
Hello all
im trying to build function that will return void function pointer
what is mean is ( not working )
the main function
void * myClass::getFunction(int type){
if(type==1)
return &myClass::Test1;
if(type==2)
return &myClass::Test2;
}
void myClass::Test1(){... (1 Reply)
Hi.
Problem: I have to parse the payload of a packet. The payload could be in Big Endian Format (network byte order) or little. That depends on a flag present in the header of the packet.
Solution: A horrible solution could be to check for that flag everytime I have to read a field in the... (11 Replies)
Hello,
The purpose of the program is to print a sub string from the prompt inputs. I do not understand why char pointer does not work but char array will for line 40 and Line 41.
./a.out thisisatest 0 8
substring = "thisisat"And my code is:
#include <stdio.h>
#include <stdlib.h>
#include... (29 Replies)
I am struggling with the pointer to 2D-array (cf: 2D array of pointers). Can anybody help me elaborate how the pointer x moves in the memory to access the individual of y, especially the high lighted lines?
I have talked to one of the curators of the forum, but I am still not quite clear.
Here... (1 Reply)
Discussion started by: yifangt
1 Replies
LEARN ABOUT DEBIAN
list
list(3) InterNetNews Documentation list(3)NAME
list - list routines
SYNOPSIS
#include <inn/list.h>
struct node {
struct node *succ;
struct node *pred;
};
struct list {
struct node *head;
struct node *tail;
struct node *tailpred;
};
void list_new(struct list *list);
struct node *list_addhead(struct list *list, struct node *node);
struct node *list_addtail(struct list *list, struct node *node);
struct node *list_head(struct list *list);
struct node *list_tail(struct list *list);
struct node *list_succ(struct node *node);
struct node *list_pred(struct node *node);
struct node *list_remhead(struct list *list);
struct node *list_remtail(struct list *list);
struct node *list_remove(struct node *node);
struct node *list_insert(struct list *list, struct node *node, struct node *pred);
bool list_isempty(struct list *list);
DESCRIPTION
list_new initialises the list header list so as to create an empty list.
list_addhead adds node to the head of list, returning the node just added.
list_addtail adds node to the tail of list, returning the node just added.
list_head returns a pointer to the the node at the head of list or NULL if the list is empty.
list_tail returns a pointer to the the node at the tail of list or NULL if the list is empty.
list_succ returns the next (successor) node on the list after node or NULL if node was the final node.
list_pred returns the previous (predecessor) node on the list before node or NULL if node was the first node.
list_remhead removes the first node from list and returns it to the caller. If the list is empty NULL is returned.
list_remtail removes the last node from list and returns it to the caller. If the list is empty NULL is returned.
list_remove removes node from the list it is on and returns it to the caller.
list_insert inserts node onto list after the node pred. If pred is NULL then node is added to the head of list.
HISTORY
Written by Alex Kiernan <alex.kiernan@thus.net> for InterNetNews 2.4.0.
$Id: list.pod 9074 2010-05-31 19:01:32Z iulius $
INN 2.5.3 2011-06-10 list(3)