02-26-2013
You link the 1st element to the newly created element, which then links to NULL.
So you always have the 1st and the latest element - the intermediate elements are lost.
10 More Discussions You Might Find Interesting
1. Programming
Can any one help me in reversing the single linked list and at the same time i want to print the reversed links. (2 Replies)
Discussion started by: dhanamurthy
2 Replies
2. UNIX for Dummies Questions & Answers
A perl script that displays the list of files which have multiple links..!
ls -l shows number of links in a field. (0 Replies)
Discussion started by: aadi_uni
0 Replies
3. Programming
is this possible, if so plz please share with me..
Correct English please, not Cyber-/Leetspeak (11 Replies)
Discussion started by: vijay_manpage
11 Replies
4. Programming
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 (2 Replies)
Discussion started by: girija
2 Replies
5. Programming
i have this code
typedef struct client_list {
char *client_name;
struct client_list * next;
int client_socket_fd;
} client;
client *current, *head; head = NULL;
char *h="test";
add_client(current, h, head, &client_socket_fd);
... (24 Replies)
Discussion started by: omega666
24 Replies
6. Programming
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... (1 Reply)
Discussion started by: omega666
1 Replies
7. Programming
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
... (0 Replies)
Discussion started by: omega666
0 Replies
8. UNIX for Advanced & Expert Users
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? (1 Reply)
Discussion started by: louisTan
1 Replies
9. Programming
How to delete the last node in a single linked list given only the pointer to last node ?
Head node will not be given. (5 Replies)
Discussion started by: VSSajjan
5 Replies
10. Programming
Program to reverse a linked list by traversing only once. (1 Reply)
Discussion started by: VSSajjan
1 Replies
lreplace(n) Tcl Built-In Commands lreplace(n)
__________________________________________________________________________________________________________________________________________________
NAME
lreplace - Replace elements in a list with new elements
SYNOPSIS
lreplace list first last ?element element ...?
_________________________________________________________________
DESCRIPTION
lreplace returns a new list formed by replacing one or more elements of list with the element arguments. first and last are index values |
specifying the first and last elements of the range to replace. The index values first and last are interpreted the same as index values |
for the command string index, supporting simple index arithmetic and indices relative to the end of the list. 0 refers to the first ele- |
ment of the list, and end refers to the last element of the list. If list is empty, then first and last are ignored.
If first is less than zero, it is considered to refer to before the first element of the list. For non-empty lists, the element indicated
by first must exist or first must indicate before the start of the list.
If last is less than first, then any specified elements will be inserted into the list at the point specified by first with no elements
being deleted.
The element arguments specify zero or more new arguments to be added to the list in place of those that were deleted. Each element argu-
ment will become a separate element of the list. If no element arguments are specified, then the elements between first and last are sim-
ply deleted. If list is empty, any element arguments are added to the end of the list.
EXAMPLES
Replacing an element of a list with another:
% lreplace {a b c d e} 1 1 foo
a foo c d e
Replacing two elements of a list with three:
% lreplace {a b c d e} 1 2 three more elements
a three more elements d e
Deleting the last element from a list in a variable:
% set var {a b c d e}
a b c d e
% set var [lreplace $var end end]
a b c d
A procedure to delete a given element from a list:
proc lremove {listVariable value} {
upvar 1 $listVariable var
set idx [lsearch -exact $var $value]
set var [lreplace $var $idx $idx]
}
SEE ALSO
list(n), lappend(n), lindex(n), linsert(n), llength(n), lsearch(n), lset(n), lrange(n), lsort(n), string(n) |
KEYWORDS
element, list, replace
Tcl 7.4 lreplace(n)