So, I have a massive file with thousands of columns
I want a list of the headers in one column in another file.
So I need to strip off the top line (can use head-1)
But how can I convert from this format:
A B C D E F G
to
A
B
C
D
E
F
G (6 Replies)
Hi, Please read the whole thread.
I have been working on this script below. It works fine, feel free to copy and test with the INPUT File below as well.
example:
PACKET DATA PROTOCOL CONTEXT DATA
APNID PDPADD EQOSID VPAA PDPCH PDPTY PDPID
10 ... (6 Replies)
Hi Friends,
I have a single column data like below.
1
2
3
4
5
I need the output like below.
0
1
2
3
4
where each row (including first row) subtracting from first row and the result should print below like the way shown in output file.
Thanks
Sid (11 Replies)
Hi,
I have an input like this
1 2 3 4
2 3 4 5
4 5 6 7
I would like to count the no. of columns and print a header with a prefix "Col".
I would also like to count the no. of rows and print as first column with each line number with a prefix "Row"
So, my output would be
... (2 Replies)
Greetings!
I have been trying to find out a way to take a CSV file with a large number of rows, and a very large number of columns (in the thousands) and convert the rows to a single column of data, where the first row is a header representing the attribute name and the subsequent series of... (3 Replies)
Please help me to get required output for both scenario 1 and scenario 2 and need separate code for both scenario 1 and scenario 2
Scenario 1
i need to do below changes only when column1 is CR and column3 has duplicates rows/values. This inputfile can contain 100 of this duplicated rows of... (1 Reply)
Hi ,
Can anyone help me suggesting - how to do the below trick with awk
Input
120
130
140
210
310
410
645
729
800
Output
120 130 140 (6 Replies)
Discussion started by: Indra2011
6 Replies
LEARN ABOUT HPUX
hsearch
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)