A file with $0 when $3 was different in amount
A file with records of File1 not included in File2
A file with records of File2 not included in File1
If is possible (I tried with ed<<) put the decimals correctly
Hi i hope some awk gurus here can help me.. here is what i need i have 2 files:
File1
152445 516532 405088.pdf
152445 516533 405089.pdf
152491 516668 405153.jpg
152491 520977 408779.jpg
152491 0 409265.pdf
File2
516532 /tmp/MainStreet_Sum09_Front_FNL.pdf
516533... (9 Replies)
Hi. I'm new to awk and have searched for a solution to my problem, but haven't found the right answer yet. I have two files that look like this:
file1
Delete,3105551234
Delete,3105551236
Delete,5625559876
Delete,5625556789
Delete,5625553456
Delete,5625551234
Delete,5625556956... (8 Replies)
Hi,
I want to compare two files using awk and write an output based on if the records matched.
Both the files are space delimitted.
File A:
8351 00000000000636 2009044 -00001.000
8351 00000000000637 2009044 -00002.000
8351 00000000000638 2009044 -00001.000
8351 00000000000640... (7 Replies)
Hi
How can I use awk to compare specific columns in 2 files and print the difference.
I currently have this:
BEGIN {
OFS = FS = ","
}
NR == FNR {
b = $3
next
}
{
e = ""
for (x in b) {
if (match ($1, x)) {
if (RSTART == 1 && RLENGTH > length(e)) {
e=x (2 Replies)
Hello,
I have a script which extracts the values from a csv file when a specific date is entered :
#!/bin/sh
awk 'BEGIN{printf("Entrez la date : "); getline date < "-"}
$0 ~ date {f=1;print;next}
/^{2}\//{f=0}
f' file1.csv
This script gives me a number of lines with different values.
... (6 Replies)
Hi,
I have a situation to compare one file, say file1.txt with a set of files in directory.The directory contains more than 100 files.
To be more precise, the requirement is to compare the first field of file1.txt with the first field in all the files in the directory.The files in the... (10 Replies)
Please help me to compare two files and remove the items in file2 from file1
file 1:delimited using pipe(|)
file1
00012|Description - 1|||||AA12345|1|AB12345|2|2012/06/03
AB123|Description - 2|||||AA12345|3|ZA11111|4|2012/06/04
11111|Description - 3|||||AP00012|1|AB12345|2|2012/06/03... (8 Replies)
I have a below requirement and trying to compare the files using awk
File 1 - Already stored on a prev day
id | text | email id
---------------------------------
89564|this is line 1 | xyz@sample.txt
985384|this is line 2 | abc@sample.txt
657342|this is line 3 |... (3 Replies)
HI!!
I am trying to compare two files using AWK but I have some problems. I need to count how many times letters are used in two texts. This is my script
{
long=length($0)
for (i=1;i<=long;i++)
{
aux=substr($0,i,1)
if ( aux != " " && aux != "" )
... (7 Replies)
Discussion started by: ettore8888
7 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS --predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO bup-midx(1), bup-save(1)BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown-bup-margin(1)