02-15-2012
What's your system? What's your shell?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
When I go$ echo *I get a directory listing.
When I go$ echo * *I get a directory listing, followed by a second identical directory listing.
When I go$ echo **I only get one directory listing. What happens to the second asterisk in this case? Why doesn't it expand? I haven't been able to sleep... (2 Replies)
Discussion started by: na5m
2 Replies
2. Shell Programming and Scripting
Hi all,
I had a typical problem.
I am using a parameter
PK="PK1 PK2 PK3"
i need to build the string
a.PK1=b.PK1 and a.PK2=b.PK2 and a.PK3=b.PK3
Please help (8 Replies)
Discussion started by: nkosaraju
8 Replies
3. Shell Programming and Scripting
I am attempting to find all complete words which contain an asterisk at the beginning and the end - for instance, "*Hello?*" or "*you*".
From what I've read, I would have thought that the following expression would do that just fine:
\<\*.*\*\>
\< denoting the beginning of a word.
\*... (12 Replies)
Discussion started by: MagusScythe
12 Replies
4. Shell Programming and Scripting
#! /bin/csh
set delimiter = |
foreach i (*)
set str_deli="$i$delimiter"
question: how to retain the value of str_deli so i can build a pipe delimited string?
end (1 Reply)
Discussion started by: jdsignature88
1 Replies
5. Shell Programming and Scripting
I need to replace occurrences of twelve asterisks "************" with the string " 0000000.00" . Note that there are two spaces in front of the first zero. How can I do this using awk or sed? (3 Replies)
Discussion started by: mustang_9333
3 Replies
6. Shell Programming and Scripting
Hi All,
I have a text file which is currently formatted like this:
TEXT1
***
TEXT2
***
TEXT3
***
I want text before *** to go into separate files. For example,
1.dat
TEXT1 (5 Replies)
Discussion started by: shoaibjameel123
5 Replies
7. UNIX for Dummies Questions & Answers
Hi,
So I downloaded this kernel source and was able to build it successfully.
But I want to add this SDK source code inside, can anyone help me how to do this? Note that the SDK source can be built by itself.
I added the SDK in the main Makefile:
init-y := init/
#added SDK... (0 Replies)
Discussion started by: h0ujun
0 Replies
8. Shell Programming and Scripting
I have data file that has this in it:
data.txt
.........
.........
PPJ97**2017PPJ97**2017-03-21-13.35.15.887208********************START ERROR LOGGING******************
PPJ97**2017-03-21-13.35.15.887208** PROMPT APPLICATION ERROR **
PPJ97**2017-03-21-13.35.15.887208** IN TIMESTAMP |... (1 Reply)
Discussion started by: SkySmart
1 Replies
9. UNIX for Advanced & Expert Users
Note: **Showing Asterisks when using SUDO is not what I am looking for. That method is well documented**
Short Description: We have a requirement where users want to see that they are typing a password when logging into a RedHat box or when they are changing their password -- instead of... (1 Reply)
Discussion started by: caperjm
1 Replies
10. Shell Programming and Scripting
i need to replace all occurrences of "period asterisk" as it is shown in this:
blah blah .*:.*:.* blah blah
with:
::
so that the end result looks like this:
blah blah :: blah blah
I tried different variations of the following but it didint work:
%s_ .*:.*:.* _ :: _g (2 Replies)
Discussion started by: SkySmart
2 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)