Hi guys,
I need some help to come out with a solution . I have seven such files but I am showing only three for convenience.
filea
a5 20
a8 16
fileb
a3 42
a7 14
filec
a5 23
a3 07
The output file shoud contain the data in table form showing first field of... (7 Replies)
I have two files like this:
#FILE 1
ABCD 4322 26485
JMTJ 5311 97248
XMPJ 4321 58978
#FILE 2
ABCD 4321 26485
JMTJ 5311 97248
XMPJ 4321 68978
What to do: Compare the two files and find those lines that doesn't match. And have a new file like this:
#FILE 3
"from file 1"
ABCD 4322 26485... (11 Replies)
I have learned file comparison from my previous post here. Then, it is comparing the whole line. Now, i have a new problem.
I have two files with 3 columns separated with a "|". What i want to do is to compare the second and third column of file 1, and the second and third column of file 2. And... (4 Replies)
hi! i researched about comparing two columns here and got an answer. but after examining my two files, i found out that the first columns of the two files are not unique with each other. all i want to compare is the 2nd and 3rd column.
FILE 1:
ABS 456 315
EBS 923 163
JYQ3 654 237
FILE 2:... (1 Reply)
File 1 has 16 columns so does File 2
I want to remove all records from File 2 that column 1 and column 16 match between file 1 and file 2
delimter of files is ~ (10 Replies)
Hello. I have two files. FILE1 was extracted from FILE2 and modified thanks to help from this post. Now I need to replace the extracted, modified lines into the original file (FILE2) to produce the FILE3.
FILE1
1466 55.27433 14.72050 -2.52E+03 3.00E-01 1.05E+04 2.57E+04
1467 55.27433... (1 Reply)
Hi,
I want to compare two columns from file1 with another two column of file2 and print matched and unmatched column like this
File1
1 rs1 abc
3 rs4 xyz
1 rs3 stu
File2
1 kkk rs1 AA 10
1 aaa rs2 DD 20
1 ccc ... (2 Replies)
Hello,
I have two text files, each with a single column,
file 1:
124152970
123899868
123476854
54258288
123117283
file 2:
124152970
123899868
54258288
123117283
122108330 (5 Replies)
Discussion started by: LMHmedchem
5 Replies
LEARN ABOUT HPUX
hcreate
hsearch(3C)hsearch(3C)NAME
hsearch(), hcreate(), hdestroy() - manage hash search tables
SYNOPSIS DESCRIPTION
is a hash-table search routine generalized from Knuth (6.4) Algorithm D. It returns a pointer into a hash table indicating the location at
which an entry can be found. Only pointers are copied, so the calling routine must store the data (the value of the "key" must be unique).
item is a structure of type (defined in the header file) containing two pointers: points to the comparison key, and points to any other
data to be associated with that key. (Pointers to types other than character should be cast to pointer-to-character.) action is a member
of an enumeration type indicating the disposition of the entry if it cannot be found in the table. indicates that the item should be
inserted in the table at an appropriate point. indicates that no entry should be made. Unsuccessful resolution is indicated by the return
of a NULL pointer.
allocates sufficient space for the table, and must be called before is used. nel is an estimate of the maximum number of entries that the
table will contain. This number can be adjusted upward by the algorithm in order to obtain certain mathematically favorable circumstances.
destroys the search table, and can be followed by another call to
EXAMPLE
The following example reads in strings followed by two numbers and stores them in a hash table, discarding duplicates. It then reads in
strings and finds the matching entry in the hash table and prints it out.
#include <stdio.h>
#include <search.h>
struct info { /* this is the info stored in the table */
int age, room; /* other than the key. */
};
#define NUM_EMPL 5000 /* # of elements in search table */
main( )
{
/* space to store strings */
char string_space[NUM_EMPL*20];
/* space to store employee info */
struct info info_space[NUM_EMPL];
/* next avail space in string_space */
char *str_ptr = string_space;
/* next avail space in info_space */
struct info *info_ptr = info_space;
ENTRY item, *found_item, *hsearch( );
/* name to look for in table */
char name_to_find[30];
int i = 0;
/* create table */
(void) hcreate(NUM_EMPL);
while (scanf("%s%d%d", str_ptr, &info_ptr->age,
&info_ptr->room) != EOF && i++ < NUM_EMPL) {
/* put info in structure, and structure in item */
item.key = str_ptr;
item.data = (char *)info_ptr;
str_ptr += strlen(str_ptr) + 1;
info_ptr++;
/* put item into table */
(void) hsearch(item, ENTER);
}
/* access table */
item.key = name_to_find;
while (scanf("%s", item.key) != EOF) {
if ((found_item = hsearch(item, FIND)) != NULL) {
/* if item is in the table */
(void)printf("found %s, age = %d, room = %d
",
found_item->key,
((struct info *)found_item->data)->age,
((struct info *)found_item->data)->room);
} else {
(void)printf("no such employee %s
",
name_to_find);
}
}
}
RETURN VALUE
returns a NULL pointer if either the action is and the item could not be found or the action is and the table is full.
returns zero if it cannot allocate sufficient space for the table.
WARNINGS
and use to allocate space (see malloc(3C)).
Only one hash search table can be active at any given time.
SEE ALSO bsearch(3C), lsearch(3C), malloc(3C), string(3C), tsearch(3C), thread_safety(5).
STANDARDS CONFORMANCE hsearch(3C)