Here is my test.in file
Case Modify 10001 20002 30003 40004|Report Create 3417176211|Case Modify 10002 20002 30003 40004|
Script:
Remove.ksh
This script to remove $1 which I type in:
$ cat test.in
Case Modify 10001 20002 30003 40004|Report Create 3417176211|Case Modify 10002 20002 30003... (0 Replies)
Hi
I am trying to create a modify a txt file via a sh script and I'm not sure how to do it.
I have this:
data1a#data2a#data3aµ data1b#data2b#data3bµ data1c#data2c#data3cµ
and I want to have this (more or less)
data1a data2a data3a
data1b data2b data3b
data1c data2c data3c
I know... (5 Replies)
Hi all.
I have a selection of awk functions which I have written and tested in a main awk program.
From the command line I use nawk -f function -f main to run main and call my functions from within it.
I now wish to use these awk function again but want to call them from inside an awk section of... (1 Reply)
Actually I got a list of file end with *.txt
I want to use the same command apply to all the *.txt
Thus I try to find out the fastest way to write those same command in a script and then want to let them run automatics.
For example:
I got the file below:
file1.txt
file2.txt
file3.txt... (4 Replies)
Hello,
I posted a working script on this thread:
https://www.unix.com/emergency-unix-linux-support-help-me/160123-help-make-awk-script-more-efficient-large-files.html
When I run this script on a large file, 351 MB I get this error:
awk: Internal software error in the tostring function on... (8 Replies)
Input=D123,S1234,D345 | kESTREL PRODUCTION SUPPORT
echo -en "Enter the logmsg="
read logmsg
logmsg1=${logmsg%%|*};
echo "$logmsg1"|tr ',' '\n' | sed 's/*$ | sed '/^$/d'//'>pre-commit.config
Char()
{
while read line
do
if ] || ];then
echo "Success"
else
exit 1;... (1 Reply)
Hi,
We have installed linux6(RHEL) OS and installed datastage application on that.
First time installation worked fine and our all services related to datastage was up and running.
When we stopped the datastage and restarted its giving below error while restart:-
./uv -admin -start
... (0 Replies)
Hi all,
I need to have informations in a URL :
https://www.autolib.eu/stations/
Valors I need are in bold:
{"charging_status": "nonexistent", "rental_status": "future", "subscription_status": "nonexistent", "station_id": 791, "address": "10 rue de Rome, 93110 Rosny-sous-Bois", "lat":... (3 Replies)
hi,
I have used awk command to delimit my variable. But this that not worked.
Could you please let me know what need to be changed in my awk command
Input:
home/unix>cat test.txt
DAILY.JOB CHENNAI,8388
DAILY.JOB BANGLORE,3848
DAILY.JOB TRICHY,9489
DAILY.JOB TIRUPUR,8409
code
... (9 Replies)
Hi,
I am having script which contains many functions. Need to print each function name at the starting of the function. Like below,
functionname()
{
echo "functionname"
commands....
}
I've tried like below,
func=`grep "()" scriptname | cut -d "(" -f1`
for i in $func
do
nawk -v... (4 Replies)
Discussion started by: Sumanthsv
4 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)