Help with linked list in C Post: 302509753

Login or Register to Ask a Question and Join Our Community

Sponsored Content

Top Forums Programming Help with linked list in C Post 302509753 by omega666 on Thursday 31st of March 2011 03:59:22 PM

Old

03-31-2011

Registered User

if this makes a difference, the way i am doing the list is backwards, so when i want to add something to it, i create a new one in the function, then add the given one (which could be NULL or an actual list) to the next, then return the new one

omega666

View Public Profile for omega666

Find all posts by omega666

10 More Discussions You Might Find Interesting

1. Programming

Reverse single linked list

Can any one help me in reversing the single linked list and at the same time i want to print the reversed links.

2. UNIX for Dummies Questions & Answers

List linked files

A perl script that displays the list of files which have multiple links..! ls -l shows number of links in a field.

3. Programming

shared memory with linked list??

is this possible, if so plz please share with me.. Correct English please, not Cyber-/Leetspeak

4. Programming

I need C++ Code for single linked list

I need C++ Code for single linked list With operations as 1)insert at any position 2)delete any 3)change the data of any position

5. Programming

How to check if something exists in linked list in C?

i have a linked list set up like typedef struct client_list { char *client_name; int client_socket_fd; struct client_list *next; } client; client *client_list=NULL; before adding to the list i check if it already exists, only if it does not then i add if (client_list==NULL...

6. Programming

how to check if something exists in a struct linked list?

can someone provide an example of a struct linked list, where it has strings as its values, and then how do I check if a specific string (say called buffer) exists in the list of structs? i dont understand how to make a copy of it to check with this is what i have ...

7. UNIX for Advanced & Expert Users

Unix linked-list placement

Hi, I am programming in kernel, and I want to use a double linked list that holds infos that every process could access and modify THIS list. So, I suppose it is a 'global' variable since every process(thread) can reach it, I am wondering where to put it? by changing some of the kernel files?

8. Programming

Help with linked list.

#include<stdio.h> #include<stdlib.h> struct LinkedList { int val; struct LinkedList *next; }node; /*Creating a structure variable*/ typedef struct LinkedList Node; Node *start = NULL; int create(int i) { Node *temp = NULL; if (start == NULL) ...

9. Programming

How to delete the last node in a linked list.?

How to delete the last node in a single linked list given only the pointer to last node ? Head node will not be given.

10. Programming

How to reverse a linked list by traversing only once.?

Program to reverse a linked list by traversing only once.

LEARN ABOUT CENTOS

xmtablistinserttabs

XmTabListInsertTabs(library call)										 XmTabListInsertTabs(library call)

NAME

       XmTabListInsertTabs -- A convenience function that inserts tabs into a tab list

SYNOPSIS

       #include <Xm/Xm.h>
       XmTabList XmTabListInsertTabs(
       XmTabList oldlist,
       XmTab *tabs,
       Cardinal tab_count,
       int position);

DESCRIPTION

       XmTabListInsertTabs  creates  a	new tab list that includes the tabs in oldlist. This function copies specified tabs to the tab list at the
       given position. The first tab_count tabs of the tabs array are added to the tab list. If oldlist is NULL, XmTabListInsertTabs creates a new
       tab list containing only the tabs specified.

       oldlist	 Specifies the tab list to add the tabs to.  The function deallocates oldlist after extracting the required information.

       tabs	 Specifies a pointer to the tabs to be added to the tab list.  It is the caller's responsibility to free the tabs in tabs by using
		 XmTabFree.

       tab_count Specifies the number of tabs in tabs.

       position  Specifies the position of the first new tab in the tab list. A value of 0 (zero) makes the first new tab the first tab in the tab
		 list,	a  value of 1 makes it the second tab, and so on. If position is greater than the number of tabs in oldlist, then the tabs
		 will be inserted at the end. If position is negative, the count will be backwards from the end. A value of -1 makes the first new
		 tab the last tab, and so on.

RETURN

       If  tabs  is  NULL  or  tab_count is 0 (zero), this function returns oldlist. Otherwise, it returns a new tab list.  The function allocates
       space to hold the returned tab list.  The application is responsible for managing the allocated space.  The  application  can  recover  the
       allocated space by calling XmTabListFree.

RELATED

       XmTabList(3) and XmTabListFree(3).

														 XmTabListInsertTabs(library call)