08-17-2012
i thank each one of you but i am really wondering why its taking too much time even for a file having 8 lines of data
![Confused Smilie](https://www.unix.com/images/smilies/confused.gif)
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
i am studying a script which is used for data loading.
it has functions which deletes all the existing data before loading and then loads new fresh data.
but i am stuck up at function Replace into table ( col 1,col 2....)
Does this signify All Inserts. (1 Reply)
Discussion started by: ankitgupta
1 Replies
2. Shell Programming and Scripting
I have a 1 million record file and in there i have 580 bad records meaning like they were spread on to 2 lines and is making my process fail as it is expecting single line records. How can i correct this records spread into 2 lines into single line or how i can writer these records into a new... (34 Replies)
Discussion started by: dsravan
34 Replies
3. Shell Programming and Scripting
Hi everyone!
Can you please help me with some shell scripting?
I have an input file input.txt
It has 3 columns (Time, Event, Value)
Time event Value
03:38:22 A 57
03:38:23 A 56
03:38:24 B 24
03:38:25 C 51
03:38:26 B 7
03:38:26 ... (7 Replies)
Discussion started by: Needhelp2
7 Replies
4. Shell Programming and Scripting
I could not find this on the search..
I want to know how to trim a row
so lets say I have a file that looks like this:
bob 88888888888888
and I want to trim column 2 (lets say 4 off the front and end)
bob 888888
Also, how would I bin column 2
Lets so I want to add and average... (1 Reply)
Discussion started by: phil_heath
1 Replies
5. Shell Programming and Scripting
Hi I have a file that I want to bin.
I am using this code:
awk -F'\t' -v r=40 '{for(i=r;i<=NF;i+=r){for(j=0;j<r;j++){sum+=$(i-j)}printf "%s ", sum/r;sum=0}; printf "\n"}' file1 > file2
So basically what this code does is that it will averaging every 40 columns (creating bins of 40). But... (2 Replies)
Discussion started by: phil_heath
2 Replies
6. Shell Programming and Scripting
Hi all,
suppose i have one file and in that file there are thousand of record like below . if i want to fill the bold position below with some value suppose 000000 then how it would be in shell script
... (1 Reply)
Discussion started by: aishsimplesweet
1 Replies
7. Shell Programming and Scripting
Input file
<data id>="1">\
</data>\
<data id>="2">\
</data>\
<code>="1" target="2">\
</code>\
<data id>="1">\
</data>\
<data id>="2">\
</data>\
<code>="1" target="2">\
</code>\
<data id>="1">\
</data>\
<data id>="2">\
</data>\
<code>="1" target="2">\
</code>\ (2 Replies)
Discussion started by: cpp_beginner
2 Replies
8. Shell Programming and Scripting
Hi All,
I'm having a problem tabbing the data. can you please help me tab the data. i used sed but it's not working.
ex.
BUNDLE1MB(6spaces)|Y|ng_oliv10@shellscript.com.ph(6spaces)562.60.61.20(6spaces)562.61.35
here's my code
sed "s/ //g" Userid_dsl_npm.txt__200 | sed "s/ |/ /g" |... (2 Replies)
Discussion started by: nikki1200
2 Replies
9. Shell Programming and Scripting
Hello
I have a text file with tens of thousands of rows
The format is
x y
where both x and y can be anything between -100 and +100.
What I would like to do is have a 3d gnuplot where there are 10,000 squared or bins and each bin will count how many rows have a value that would be... (1 Reply)
Discussion started by: garethsays
1 Replies
LEARN ABOUT MOJAVE
algorithm::diffold
Algorithm::DiffOld(3) User Contributed Perl Documentation Algorithm::DiffOld(3)
NAME
Algorithm::DiffOld - Compute `intelligent' differences between two files / lists but use the old (<=0.59) interface.
NOTE
This has been provided as part of the Algorithm::Diff package by Ned Konz. This particular module is ONLY for people who HAVE to have the
old interface, which uses a comparison function rather than a key generating function.
Because each of the lines in one array have to be compared with each of the lines in the other array, this does M*N comparisions. This can
be very slow. I clocked it at taking 18 times as long as the stock version of Algorithm::Diff for a 4000-line file. It will get worse
quadratically as array sizes increase.
SYNOPSIS
use Algorithm::DiffOld qw(diff LCS traverse_sequences);
@lcs = LCS( @seq1, @seq2, $comparison_function );
$lcsref = LCS( @seq1, @seq2, $comparison_function );
@diffs = diff( @seq1, @seq2, $comparison_function );
traverse_sequences( @seq1, @seq2,
{ MATCH => $callback,
DISCARD_A => $callback,
DISCARD_B => $callback,
},
$comparison_function );
COMPARISON FUNCTIONS
Each of the main routines should be passed a comparison function. If you aren't passing one in, use Algorithm::Diff instead.
These functions should return a true value when two items should compare as equal.
For instance,
@lcs = LCS( @seq1, @seq2, sub { my ($a, $b) = @_; $a eq $b } );
but if that is all you're doing with your comparison function, just use Algorithm::Diff and let it do this (this is its default).
Or:
sub someFunkyComparisonFunction
{
my ($a, $b) = @_;
$a =~ m{$b};
}
@diffs = diff( @lines, @patterns, &someFunkyComparisonFunction );
which would allow you to diff an array @lines which consists of text lines with an array @patterns which consists of regular expressions.
This is actually the reason I wrote this version -- there is no way to do this with a key generation function as in the stock
Algorithm::Diff.
perl v5.18.2 2006-07-30 Algorithm::DiffOld(3)