hmm, I am aware of that but since I am new to awk, its getting difficult for me to generate the required output.
I need to know what needs to be changed in the following command
so that I can get the output as
The problem with the above awk command is :
At first, the value of s is 63. so it creates percentage as 63/63*100 = 100 %
then, the value of s is 63+2 i.e 65. so it creates percentage as 2/65*100 = 3.07 % and so on... I hope you got the point.
How can I change the command such that awk will create percentage only for the entries between ".sss" , calculate the sum and then percentage. Then move to the next loop i.e the entries between next set ".sss".
I am getting the proper sum for every set but not correct percentage.
I have been busy reading away on devices and filesystems and I am stuck on a particular subject matter.. I'm not understanding the concept behind mknod mkfifo makedev or related commands..
can anyone shed some light on the subject.!
any feedback welcome!
moxxx68 (0 Replies)
I'm having problem writing a shell script using bash that takes a file as an argument. The script should be able to determine what permissions the owner, group and everybody has for the file passed in.
could anyone plz help me out. (3 Replies)
#!/bin/bash
echo $1 | cat - $2 >> /tmp/$$ && mv /tmp/$$ $2
im trying to get the first argument to go in the middle of the second argument which is a file, anyone any ideas. i have only managed to get it to go on the end or the front.
been fiddling about with wc -l, i get the number of lines... (5 Replies)
Suppose that I have some data:
12,30
12,45
2,3
7,8
3,9
30, 8
45,54
56,65
Where (a,b) indicates that a is connected to b. I want to get all connected nodes to one point. For instance, the output of the above
example should be something like:
Group 1
2,3
3,9
Group 2
12,30
12,45... (4 Replies)
Hi all,
I have been struggling with this all day, and it is key to a conversion database I have to write.
The data converts the information out of an array using AWK, and basically all I have to do is figure out how to get the value of a variable inside a variable.
Right now at its... (11 Replies)
I want to search for the line with the group name and add the user into the group. The file format is the same as /etc/group
The code i wrote is
egrep "^$newGID" $group >/dev/null
FS=":"
oldData=awk -F: '{print $3}'
newData= "$oldData,$newUser"
sed -n $4/$newData $group
but a friend... (1 Reply)
Hi All
I have script that find 777 dir with specific extension like .php .Now after finding all 777 directory i will place in httpd.conf using a directory directive ,Now i was not do that,if directory entry exitst in httpd.conf then script ignor it dont show me at stdout else if it dont find... (2 Replies)
I am beginner in awk
awk 'BEGIN{for(i=1;(getline<"opnoise")>0;i++) arr=$1}{print arr}'
In the above script, opnoise is a file, I am reading it into an array and then printing the value corresponding to index 20. Well this is not my real objective, but I have posted this example to describe... (1 Reply)
I am developing a multi-threaded library that helps the transformation of messages between threads in different processes using shared memory.
I am using the pthreads condition facility in order to synchronize access to the shared memory slots through which the messages are passed.
My test... (2 Replies)
I was given this to do,
Write a Shell script to automatically check that a specified user is logged in to the computer.
The program should allow the person running the script to specify the name of the user to be checked, the frequency in seconds at which the script should check. If a... (1 Reply)
Discussion started by: operator
1 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)