Sponsored Content
Top Forums Shell Programming and Scripting Implementing linked list in shell scripting Post 302995005 by mukulverma2408 on Thursday 30th of March 2017 01:13:22 PM
Old 03-30-2017
Quote:
Originally Posted by Chubler_XL
I'd use arrays. One for the values and one for the next index.
Here is an example of a sorted linked list:
Hi Chubler,

Thanks for the reply, can you please also help me to understand the example mentioned here?
 

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 Replies)
Discussion started by: dhanamurthy
2 Replies

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. (0 Replies)
Discussion started by: aadi_uni
0 Replies

3. Shell Programming and Scripting

Shell Scripting Reading List

Hello Everyone, Over the last few months I have begun to expand my programing skills from windows, Java and SQL / PL-SQL programing into the wonderful world of shell scripting. With little training budget my only options for training are books, Internet and this site (BTY... (1 Reply)
Discussion started by: caddis
1 Replies

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 (2 Replies)
Discussion started by: girija
2 Replies

5. Programming

Help with linked list in C

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

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... (1 Reply)
Discussion started by: omega666
1 Replies

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? (1 Reply)
Discussion started by: louisTan
1 Replies

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) ... (5 Replies)
Discussion started by: prinsh
5 Replies

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. (5 Replies)
Discussion started by: VSSajjan
5 Replies

10. Programming

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

Program to reverse a linked list by traversing only once. (1 Reply)
Discussion started by: VSSajjan
1 Replies
lsearch(1T)						       Tcl Built-In Commands						       lsearch(1T)

__________________________________________________________________________________________________________________________________________________

NAME
lsearch - See if a list contains a particular element SYNOPSIS
lsearch ?options? list pattern _________________________________________________________________ DESCRIPTION
This command searches the elements of list to see if one of them matches pattern. If so, the command returns the index of the first match- ing element (unless the options -all or -inline are specified.) If not, the command returns -1. The option arguments indicates how the | elements of the list are to be matched against pattern and it must have one of the following values: -all Changes the result to be the list of all matching indices (or all matching values if -inline is specified as well.) | -ascii The list elements are to be examined as Unicode strings (the name is for backward-compatability reasons.) This option is only mean- ingful when used with -exact or -sorted. -decreasing The list elements are sorted in decreasing order. This option is only meaningful when used with -sorted. -dictionary The list elements are to be compared using dictionary-style comparisons (see lsort for a fuller description). This option is only meaningful when used with -exact or -sorted, and it is only distinguishable from the -ascii option when the -sorted option is given, because values are only dictionary-equal when exactly equal. -exact The list element must contain exactly the same string as pattern. -glob Pattern is a glob-style pattern which is matched against each list element using the same rules as the string match command. -increasing The list elements are sorted in increasing order. This option is only meaningful when used with -sorted. -inline The matching value is returned instead of its index (or an empty string if no value matches.) If -all is also specified, then the | result of the command is the list of all values that matched. -integer The list elements are to be compared as integers. This option is only meaningful when used with -exact or -sorted. -not This negates the sense of the match, returning the index of the first non-matching value in the list. | -real The list elements are to be compared as floating-point values. This option is only meaningful when used with -exact or -sorted. -regexp Pattern is treated as a regular expression and matched against each list element using the rules described in the re_syntax refer- ence page. -sorted The list elements are in sorted order. If this option is specified, lsearch will use a more efficient searching algorithm to search list. If no other options are specified, list is assumed to be sorted in increasing order, and to contain ASCII strings. This option is mutually exclusive with -glob and -regexp, and is treated exactly like -exact when either -all, or -not is specified. -start index The list is searched starting at position index. If index has the value end, it refers to the last element in the list, and | end-integer refers to the last element in the list minus the specified integer offset. If option is omitted then it defaults to -glob. If more than one of -exact, -glob, -regexp, and -sorted is specified, whichever option is specified last takes precedence. If more than one of -ascii, -dictionary, -integer and -real is specified, the option specified last takes precedence. If more than one of -increasing and -decreasing is specified, the option specified last takes precedence. EXAMPLES
| lsearch {a b c d e} c => 2 | lsearch -all {a b c a b c} c => 2 5 | lsearch -inline {a20 b35 c47} b* => b35 | lsearch -inline -not {a20 b35 c47} b* => a20 | lsearch -all -inline -not {a20 b35 c47} b* => a20 c47 | lsearch -all -not {a20 b35 c47} b* => 0 2 | lsearch -start 3 {a b c a b c} c => 5 | SEE ALSO
foreach(1T), list(1T), lappend(1T), lindex(1T), linsert(1T), llength(1T), lset(1T), lsort(1T), lrange(1T), lreplace(1T) | KEYWORDS
list, match, pattern, regular expression, search, string ATTRIBUTES
See attributes(5) for descriptions of the following attributes: +--------------------+-----------------+ | ATTRIBUTE TYPE | ATTRIBUTE VALUE | +--------------------+-----------------+ |Availability | SUNWTcl | +--------------------+-----------------+ |Interface Stability | Uncommitted | +--------------------+-----------------+ NOTES
Source for Tcl is available on http://opensolaris.org. Tcl 8.4 lsearch(1T)
All times are GMT -4. The time now is 02:07 PM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy