Hi,
I have 2 files with contents in them and I need to compare each item in each file.
File1:
item4
item5
File2:
item2
item3
item5
item6
The items names can be of different lengths.
If the items in the File1 are not in File2,
delete the missing item in File1.
The resulting... (12 Replies)
Hi everyone.
I have a lot of programs i want to run on some data files, they need to be done sequentially. Often the output from one program is the input for the next.
e.g
$ progA data1 > data1.A
$ progB data1.A > data1.AB
$ progC data1.AB > data1.ABC
repeat on data2, 3, 4, 5, 6 etc
... (4 Replies)
Little lost here, I am trying to search a line for both values after the $ signs. My ultimate goal is to get percertage.
<?php
$string = "Something on sale for $4 and orginal price $10";
$strstr =. strstr($string, '$');
$strrchr =. strrchr($string, '$');
echo "$strstr<br>";
echo... (1 Reply)
Hi everyone! So I have a listView on my Form named "officeView" I already have the code to add and update info into it, but Im having troubles deleting items out of it. :/
Now I know how to delete an Item from the listView, but I want the item before the deleted item to become automatically... (0 Replies)
Hi,
Let's I have the following strings (md5):
07177edf8261d28c6a003e583fcbe38c
0717c0037b3a20fc0f0998e673f228d5
0717d611a5d24374628b98e17fd00977,0717d611a5d24374628b98e17fd00977
07189a18afdae558bb5aadfe602e4a91
0719e97d481c239667f38a3e166bed74
071af3225fe50a1fdbb42c43aac313cc... (4 Replies)
Hi,
I need to filter my data based on items in column 23. Column 1 until column 23 are tab separated. This is how column 23 looks like:
PRIMARY=<0/1:504:499,5:.:.:.:0.01:1:15:.>
I want to extract lines if items 7 (separated by : ) in column 23 are more than 0.25 . In example above , item... (2 Replies)
Hi,
I'm trying to write an awk function that returns all possible permutations of n items chosen in a list of m items. For example, given the input "a,b,c,d,e" and 3, the function should return the following :
a a a
a a b
a a c
a b a
a b b
...
c a a
c a b
...
e e c
e e d
e e e
(125... (21 Replies)
Hello, very new to this and have to use tcsh (not a choice at the moment).
I need to convert files within sub directories. My foreach loops don't work.
Directories are as follow:
sub-001
--ses-T1
---- anat
--------File.nii
--ses-T2
----anat
-------File.nii
sub-002
and so on.
... (2 Replies)
Hello,
I need to collect some statistical results from a series of files that are being generated by other software. The files are tab delimited. There are 4 different sets of statistics in each file where there is a line indicating what the statistic set is, followed by 5 lines of values. It... (8 Replies)
Discussion started by: LMHmedchem
8 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)