What I need to do is to create 1000 files in which myname line listing a sequence of numbers from 0001 to 1000. So I want to have :
nomefile0001.txt that must have the line mionome0001.pdb
nomefile0002.txt that must have the line mionome0002.pdb
and so on up to nomefile1000.txt with the line mionome1000.pdb
Can you give me some advice ? Maybe I could use sed ... but how ??? Thanks a lot to everyone
Moderator's Comments:
Please use code tags for data as well as required by forum rules!
Last edited by RudiC; 05-14-2016 at 02:56 PM..
Reason: Added code tags.
as you can see there is a delimiter after c8 "::". Awk sees the rest as fields because it doesn't recognize spaces and tabs as delimiters. So i am basically looking to isolate 20030003ba13f6cc. Can anyone help?
c8::20030003ba13f6cc disk connected configured unknown (2 Replies)
Hi,
Is there a way to create sequence numbers in unix
i have a set of batches(which contain records) and i want to assign a number to every batch. how can i do that? (1 Reply)
Hello All,
I want to make a simple script which generate random number from 0 to 1000.
and simply display it.
Plz HELP!!!!!!
Regards,
Waqas Ahmed (2 Replies)
I would like to write a script that would create 1000 files like clm0001.txt to clm1000.txt. All the files would contain the same contents. How do I achieve this using a script?Please help. (2 Replies)
Hi Guys,
I have a file with numbers in sequence.
The sequence have been broken somewhere.. I need to find out at which number the sequence has been broken...
For an example, consider this sequence, it needs to give me output as 4 (as 5 is missing) and 6(as 7 is missing)
Thanks for... (3 Replies)
I am just a newbie to perl scripting. I need help with listing of hexadecimal numbers in a column as follows.
INPUT FIle:
08AF ship steel
08B0 ship steel
08B1 ship steel
08B2 flight docs
08B3 flight docs
08B4 flight docs
08B5 flight docs
08B6 flight decl ... (3 Replies)
I am trying to add a single line of text to every file in a particular folder. There are thousands of files in the folder.
Each file contains this same start of the first line:
{d "%w- %d %m-, %Y - %T"} <some message here>
with the rest of the text following the second curly bracket... (10 Replies)
I need awk script to generate part number sequencing based on data in multiple columns like below
Input File
---------
Col A|Col B|Col C|
1|a|x|
2|b|y|
|c|z|
| |m|
| |n|
And out put should be like
1ax
1ay
1az
1am
1an
1bx
1by (6 Replies)
Hi,
I have a file source as below.
OL|10031|Day|Black|Midi|Good|Value|P01|P07
OL|10031|Day|Black|Short|Good|Value|P01|P07
I need to create a file form the above data as below logic
1. take the first line
2. create a file say inclusion1 as below from the first line
OL,10031,1,Day... (8 Replies)
Discussion started by: bhaski2012
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)
05-14-2016
