04-30-2008
Are you trying to eliminate duplicates, sort or what?
Using search.h and maybe lsearch() or hsearch() will do what you need. If the data is redundant, hsearch() is not the best choice.
I personally deal with stuff like this by creating an array of pointers, then sorting the array using qsort, which allows one to access an element with bsearch() using a key. Sorting an array of structs is too expensive. But it is not clear what you need.
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I'm pretty new at this UNIX stuff, and this may be a simple question but I'm kind of stuck :confused:
Let's say I have a large directory structure of .essay files,
where I saved all of the essays that I did over the last few years. Not all of the .essay files are in the same directory (all... (1 Reply)
Discussion started by: hooj
1 Replies
2. Shell Programming and Scripting
Hi Folks
I am pretty new to unix and shellscripting.
I need help on writing logic on traversing recursively through a set of directories under a top-level folder and delete files(mostly text) which are 1 month old.
Can you people help me on this?
Thanks a lot
Ravi (5 Replies)
Discussion started by: ravi2082
5 Replies
3. UNIX for Dummies Questions & Answers
Hi,
I am using GVim as editor... and i am viewing code of pascal/ delphi..
my problem is its difficult to use GVim as source code browser....
normally ctags helps to traverse in vim for c/c++..
is there anything like that for pascal/ delphi to minimise this complication of each... (0 Replies)
Discussion started by: SankarV
0 Replies
4. UNIX for Dummies Questions & Answers
hi
please suggest a korn script which will traverse all subdirectory in the current directory? (2 Replies)
Discussion started by: ilayans
2 Replies
5. Shell Programming and Scripting
Hi,
I have a parent directory in which I have sub directories of different depth
/usr/usr1/user2/671
/usr/usr1/672
/usr/user2/user1/673
/usr/user2/user3/user4/674
And I need the names of all the directories that which starts only with 6 in a file.
Thanks, (12 Replies)
Discussion started by: arun_maffy
12 Replies
6. Programming
Please find the below program. the requirement and description of the program also given:
ganesh@ubuntu:~/my_programs/c/letusc/chap9$ cat fa.c.old
/* Program : write a program to count the number of 'e' in thefollowing array of pointers to strings:
char *s = {
"We will teach you how... (12 Replies)
Discussion started by: ramkrix
12 Replies
7. Homework & Coursework Questions
I was given to create a backup of all files in a given directory(command line argument) into say /home/vishal/back and the back up files must be accordingly to the extension of the file i.e pdf files are saved in back/pdf doc files back/doc etc . I gave a recursive function to traverse through the... (1 Reply)
Discussion started by: davis7son
1 Replies
8. Shell Programming and Scripting
I am writing a script which will read a word and say how many vowels and consonants does the word contain. but i dont know how to traverse a string in shell scripting. if it was in C i'd have done something like this:
cout<<"plz enter the word"<<endl;
cin>>word;
int consonants, vowels;... (4 Replies)
Discussion started by: nishrestha
4 Replies
9. Programming
Program to reverse a linked list by traversing only once. (1 Reply)
Discussion started by: VSSajjan
1 Replies
10. Programming
Hello,
I want to loop thru a vector composed of many entries as structure, which contains sequenceID and sequence. At looping, delete any structure if the sequence is a perfect-match substring of another sequence of any other structure, so that the resulted vector contains only unique sequences.... (1 Reply)
Discussion started by: yifangt
1 Replies
LSEARCH(3) Linux Programmer's Manual LSEARCH(3)
NAME
lfind, lsearch - linear search of an array.
SYNOPSIS
#include <search.h>
void *lfind(const void *key, const void *base, size_t *nmemb,
size_t size, int(*compar)(const void *, const void *));
void *lsearch(const void *key, void *base, size_t *nmemb,
size_t size, int(*compar)(const void *, const void *));
DESCRIPTION
lfind() and lsearch() perform a linear search for key in the array base which has *nmemb elements of size bytes each. The comparison func-
tion referenced by compar is expected to have two arguments which point to the key object and to an array member, in that order, and which
returns zero if the key object matches the array member, and non-zero otherwise.
If lsearch() does not find a matching element, then the key object is inserted at the end of the table, and *nmemb is incremented.
RETURN VALUE
lfind() returns a pointer to a matching member of the array, or NULL if no match is found. lsearch() returns a pointer to a matching mem-
ber of the array, or to the newly added member if no match is found.
SEE ALSO
bsearch(3), hsearch(3), tsearch(3)
GNU
1999-09-27 LSEARCH(3)