Parsing text file and feeding it into an executable
Hello, everyone. I am working wtihin AIX 5.3, and I need to do the following:
read the each line of file BASE.txt
do XK {line contents}
if XK's output begins with "BASE", then append line contents to file "output.txt"
continue until end of file
Here is what I tried(unsuccessfuly):
Code:
for i in `cat BASE.txt`
do
if XK $i | grep BASE
then cat $i >> output.txt
done
Basically, I need to end up with a list of entries from the "BASE.txt" file that returned 'BASE' as the first four characters, when used as an argument in the "XK" executable. The script I have returns only this:
ksh: syntax error: `done' unexpected
I know I am making this too difficult. Can you guys please help?
Hey Guys.I am a newbie on Bash Shell Scripting and Perl.And I have a question about file parsing.
I have a log file which contains reports about a communication device.I need to take some of the reports from the log file.Its hard to explain the issue.but shortly I can say that, the reports has a... (2 Replies)
Hi,
I need some help in extracting the Exception block between the lines
21 Feb 01:18:54:146 ERROR com.orbits.frameworks.integrationframework.ValidationException - Caught exception in validateRequest() (PID=565584)
and
21 Feb 01:18:55:149 INFO ... (0 Replies)
Any ideas?
1)loop through text file
2)extract everything between SOL and EOL
3)output files, for example: 123.txt and 124.txt for the file below
So far I have: sed -n "/SOL/,/EOL/{p;/EOL/q;}" file
Here is an example of my text file.
SOL-123.go
something goes here
something goes... (0 Replies)
The binary file is
ELF-64 executable object file - IA64.
How i know that the source is
Is there any comamnd in unix i can read these kind of files or use a thirty party software?
Thanks for your help (8 Replies)
Hi everyone,
I'm having trouble figuring this one out. I have ~100 *.fa files with multiple lines of fasta sequences like this: file1.fa
>xyzsequence
atcatgcacac......
ataccgagagg.....
atataccagag.....
>abcsequence
atgagatatat.....
acacacggd.....
atcgaacac....
agttccagat....
The... (2 Replies)
I'm new to scripting and was wondering if there was a way to accomplish what I want below using shell script(s).
If there is a log file as follows, where the id is the unique id of a process, with the timestamp of when the process began and completed displayed, would it be possible to find the... (3 Replies)
I was trying to parse the text file, which will looks like this
###XYZABC####
############
int = 4
char = 1
float = 1
.
.
############
like this my text file will contains lots of entries and I need to store these entries in the map eg. map.first = int and map.second = 4 same way I... (5 Replies)
I'm totally stumped with how to handle this huge text file I'm trying to deal with. I really need some help!
Here is what is looks like:
ab1ba67c331a3d731396322fad8dd71a3b627f89359827697645c806091c40b9
0.2
812a3c3684310045f1cb3157bf5eebc4379804e98c82b56f3944564e7bf5dab5
0.6
0.6... (3 Replies)
Hi Friends,
I am back for the second round today - :D
My input text file is this way
Home
friends
friendship meter
Tools
Mirrors
Downloads
My Data
About Us
Help
My own results
BLAT Search Results
ACTIONS QUERY SCORE START END QSIZE IDENTITY CHRO STRAND ... (7 Replies)
Discussion started by: jacobs.smith
7 Replies
LEARN ABOUT LINUX
git-merge-base
GIT-MERGE-BASE(1) Git Manual GIT-MERGE-BASE(1)NAME
git-merge-base - Find as good common ancestors as possible for a merge
SYNOPSIS
git merge-base [-a|--all] <commit> <commit>...
git merge-base [-a|--all] --octopus <commit>...
git merge-base --is-ancestor <commit> <commit>
git merge-base --independent <commit>...
DESCRIPTION
git merge-base finds best common ancestor(s) between two commits to use in a three-way merge. One common ancestor is better than another
common ancestor if the latter is an ancestor of the former. A common ancestor that does not have any better common ancestor is a best
common ancestor, i.e. a merge base. Note that there can be more than one merge base for a pair of commits.
OPERATION MODE
As the most common special case, specifying only two commits on the command line means computing the merge base between the given two
commits.
More generally, among the two commits to compute the merge base from, one is specified by the first commit argument on the command line;
the other commit is a (possibly hypothetical) commit that is a merge across all the remaining commits on the command line.
As a consequence, the merge base is not necessarily contained in each of the commit arguments if more than two commits are specified. This
is different from git-show-branch(1) when used with the --merge-base option.
--octopus
Compute the best common ancestors of all supplied commits, in preparation for an n-way merge. This mimics the behavior of git
show-branch --merge-base.
--independent
Instead of printing merge bases, print a minimal subset of the supplied commits with the same ancestors. In other words, among the
commits given, list those which cannot be reached from any other. This mimics the behavior of git show-branch --independent.
--is-ancestor
Check if the first <commit> is an ancestor of the second <commit>, and exit with status 0 if true, or with status 1 if not. Errors are
signaled by a non-zero status that is not 1.
OPTIONS -a, --all
Output all merge bases for the commits, instead of just one.
DISCUSSION
Given two commits A and B, git merge-base A B will output a commit which is reachable from both A and B through the parent relationship.
For example, with this topology:
o---o---o---B
/
---o---1---o---o---o---A
the merge base between A and B is 1.
Given three commits A, B and C, git merge-base A B C will compute the merge base between A and a hypothetical commit M, which is a merge
between B and C. For example, with this topology:
o---o---o---o---C
/
/ o---o---o---B
/ /
---2---1---o---o---o---A
the result of git merge-base A B C is 1. This is because the equivalent topology with a merge commit M between B and C is:
o---o---o---o---o
/
/ o---o---o---o---M
/ /
---2---1---o---o---o---A
and the result of git merge-base A M is 1. Commit 2 is also a common ancestor between A and M, but 1 is a better common ancestor, because 2
is an ancestor of 1. Hence, 2 is not a merge base.
The result of git merge-base --octopus A B C is 2, because 2 is the best common ancestor of all commits.
When the history involves criss-cross merges, there can be more than one best common ancestor for two commits. For example, with this
topology:
---1---o---A
/
X
/
---2---o---o---B
both 1 and 2 are merge-bases of A and B. Neither one is better than the other (both are best merge bases). When the --all option is not
given, it is unspecified which best one is output.
A common idiom to check "fast-forward-ness" between two commits A and B is (or at least used to be) to compute the merge base between A and
B, and check if it is the same as A, in which case, A is an ancestor of B. You will see this idiom used often in older scripts.
A=$(git rev-parse --verify A)
if test "$A" = "$(git merge-base A B)"
then
... A is an ancestor of B ...
fi
In modern git, you can say this in a more direct way:
if git merge-base --is-ancestor A B
then
... A is an ancestor of B ...
fi
instead.
SEE ALSO git-rev-list(1), git-show-branch(1), git-merge(1)GIT
Part of the git(1) suite
Git 1.8.5.3 01/14/2014 GIT-MERGE-BASE(1)