06-19-2013
Can you elaborate? Should the output be the list of words that are common across all the 10 files or common across any two or more files out of 10?
If possible, provide sample input and expected output.
9 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Suppose we have 2 set of files
set 1 set 2
------ ------
abc hgb
def ppp
mgh vvv
nmk sdf
hgb ... (1 Reply)
Discussion started by: skyineyes
1 Replies
2. UNIX for Dummies Questions & Answers
Hi, everyone,
Let's say, we have
xxx.txt
A 1 2 3 4 5
C 1 2 3 4 5
E 1 2 3 4 5
yyy.txt
A 1 2 3 4 5
B 1 2 3 4 5
C 1 2 3 4 5
D 1 2 3 4 5
E 1 2 3 4 5
First I match the first column I find intersection (A,C, E), then I want to take those lines with ACE out from yyy.txt, like
A 1... (11 Replies)
Discussion started by: kaixinsjtu
11 Replies
3. Shell Programming and Scripting
Hi,
I have a set of simple, one columned text files (in thousands).
file1:
a
b
c
d
file 2:
b
c
d
e
and so on. There is a collection of words in another file:
b d
b c d e
I have to find out the set of words (in each row) is present or absent in the given set of files. So, the... (4 Replies)
Discussion started by: mala
4 Replies
4. Shell Programming and Scripting
hello,
i 'd like your help about a bash script which:
1. finds inside the html file (it is attached with my post) the code number of the Latest Stable Kernel,
2.finds the link which leads to the download location of the Latest Stable Kernel version,
(the right link should lead to the file... (3 Replies)
Discussion started by: alex83
3 Replies
5. Shell Programming and Scripting
I have two (or more, to make it generic) csv files. Each line contains words separated by comma. None of words have any space. The number of words per line is not fixed. Some may have one, and some may have 12... The number of lines per file is also not fixed.
What I need is to find common words... (1 Reply)
Discussion started by: nick2011
1 Replies
6. Shell Programming and Scripting
Hey guys,
I have two files. file1 and file2.
file1:
a,1
b,2
c,343
d,343
e,4343
f,4544
file 2:
a,
d,
e,
Now i need to find the common data between these files from file1.
i.e
a,1 (8 Replies)
Discussion started by: jaituteja
8 Replies
7. Shell Programming and Scripting
Hi all
I have to compare two files and find common entries
First file is like this
XVY
CVY
ZYN
MNA
In second file I have to search these entries in even number of columns
5 XVY 7 hdfj 8 CVY 9
if there is common entries then out put shuld be
5 XVY(approved) 7 hdfj 8... (11 Replies)
Discussion started by: manigrover
11 Replies
8. Shell Programming and Scripting
Hi,
I have two files with the below values.
file1
305231921 1.0 ben/Ben_Determination_Appeals
1348791394 2.0 ben/Ben_Determination_Appeals]
1305231921 1.0 ben/Cancel_Refund_Payment_JLRS
1348791394 2.0 ben/Cancel_Refund_Payment_JLRS
1305231921 ... (2 Replies)
Discussion started by: Vikram_Tanwar12
2 Replies
9. UNIX for Dummies Questions & Answers
Hi,
I have a requirement like i have to find out files and remove them on a daily basis.
The files are generated as
abc_jnfn_201404230004.csv
abc_jnfo_201404230004.csv
abc_jnfp_201404230004.csv
abc_jnfq_201404230004.csv
abd_jnfn_201404220004.csv
abe_jnfn_201404220004.csv
i want to... (1 Reply)
Discussion started by: Mohammed_Tabish
1 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)