05-08-2012
Hi
Thanks for reply.
Quote:
With this programm its providing me alll the entries of one file are not common which is not possible.
Because some entries are common and some are not common.
Kindly let me know whether I have to make any changes
Thanks
Mani grover
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hi
I have a file like this
1234
2345
567889
567889
2345
234899420
83743
2345
67890
67890
................
so on
I want to delete entries which are more than once like 2345, 567889 and 67890 so that these appear once (4 Replies)
Discussion started by: manigrover
4 Replies
2. Shell Programming and Scripting
Hi
I want to remove entries with blank spaces
in my input file:
123
234
456
678
56789
345346456
589
3454
345456
3454566............................ (2 Replies)
Discussion started by: manigrover
2 Replies
3. Shell Programming and Scripting
Hi
I have a file with following entries
122 N/A
123 5654656
123423 43534543
4544 45435
435454 N/A
i Have to remove entries with N/A so that only
123 5654656
123423 43534543
4544 45435
remain in output file
can anybody guide for a code/unix/perl (2 Replies)
Discussion started by: manigrover
2 Replies
4. Shell Programming and Scripting
Hi
I have a file
12m 345693460
12 1234
12 1234
34 345
34 345
And I want output fiel as
12m 345693460
12 1234
34 345
hw can it be done
Thanks (1 Reply)
Discussion started by: manigrover
1 Replies
5. Shell Programming and Scripting
Dear all,
I am facing one problem
in my input file there are many Entries which starts from *FIELD * AV (checked the attached file)
I want all the entries in the output file which start from
*FIELD * AV
I have written this programm but its not printing all the entries with *FIELD... (4 Replies)
Discussion started by: manigrover
4 Replies
6. Shell Programming and Scripting
Hi all
I have an input file which contains so many entries like this: And, I want to count hw many among ASN in one column are converted to LYS in third coulmns. which means output shuld contain only "ASN number LYS"
Kindly let me know wny programm for this
My input is
ASN 217 LYS... (2 Replies)
Discussion started by: manigrover
2 Replies
7. Shell Programming and Scripting
Hi all,
I have 2 big files with such kind of inputs
File I
File II
I want the output file shuld contain
Please let me knw scripting regarind this (1 Reply)
Discussion started by: manigrover
1 Replies
8. Shell Programming and Scripting
Hi all
I have a big file which I have attached here.
And, I have to fetch certain entries and arrange in 5 columns
Name Drug DAP ID disease approved or notIn the attached file data is arranged with tab separated columns in this way:
and other data is... (2 Replies)
Discussion started by: manigrover
2 Replies
9. Shell Programming and Scripting
Hi all,
I have 3 files with such data
first files
second file
third file
I have to find common entries of first column in two ways
1) between 2 files (2 Replies)
Discussion started by: manigrover
2 Replies
10. Shell Programming and Scripting
Hi all.
Kindly check it it's urgent!!
I have one big file from which which I have to fetch certain data
I have attached a small part of this file.
from the attached file, I have to fetch and arrange data in 3 columns
1 Generic name 2. Brand names 3. Drug... (10 Replies)
Discussion started by: manigrover
10 Replies
LEARN ABOUT DEBIAN
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 --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.
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.
SEE ALSO
git-rev-list(1), git-show-branch(1), git-merge(1)
GIT
Part of the git(1) suite
Git 1.7.10.4 11/24/2012 GIT-MERGE-BASE(1)